@dynatrace/strato-components 3.12.1 → 3.13.0

package/esm/filters/filter-field/utils/conversion/tree-precedence.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../../../../../src/filters/filter-field/utils/conversion/tree-precedence.ts"],
-  "sourcesContent": ["import Colors from '@dynatrace/strato-design-tokens/colors';\n\nimport type { FilterFieldError } from '../../types/filter-field-error.js';\nimport type {\n  FilterFieldGroupNode,\n  FilterFieldNode,\n  FilterFieldSearchOperatorNode,\n} from '../../types/tree-nodes.js';\nimport {\n  isFilterFieldStatementNode,\n  isLogicalOperator,\n} from '../tree-node-guards.js';\nimport { convertToErrorNode } from './lezer-tree-conversion/node-mutations.js';\nimport type { FilterFieldProps } from '../../FilterField.types.js';\nimport type {\n  FilterFieldFlatGroupNode,\n  FilterFieldFlatNode,\n  FilterFieldLogicalOperatorNode,\n} from '../../types/conversion-utils.js';\n\n/**\n * Iterate over the parsed document and convert the lezer tree to an object.\n * @internal\n */\nexport function sortFilterFieldTree(\n  tree: FilterFieldFlatGroupNode | undefined,\n  parserConfig: FilterFieldProps['parserConfig'],\n  doc?: string,\n): {\n  tree: FilterFieldGroupNode | undefined;\n  errors: FilterFieldError[];\n  isValidSearch: boolean;\n} {\n  if (!tree) {\n    return { tree, errors: [], isValidSearch: true };\n  }\n\n  const { tree: _cleanedTree, searchOperators } = groupByLogicalOperators({\n    tree,\n  });\n  let errors: FilterFieldError[] = [];\n\n  let cleanedTree = _cleanedTree;\n  let isValidSearch;\n  // eslint-disable-next-line @typescript-eslint/no-deprecated\n  if (parserConfig?.searchConversion === true) {\n    ({\n      tree: cleanedTree,\n      errors,\n      isValidSearch,\n    } = checkValidSearchOperators(cleanedTree, searchOperators, doc));\n  }\n\n  return {\n    tree: cleanedTree,\n    errors,\n    isValidSearch: isValidSearch ?? false,\n  };\n}\n\ntype LogicalOperator = FilterFieldGroupNode['logicalOperator'];\n\n/**\n * Function to group the filter statements depending on the logical operators used.\n */\nfunction groupByLogicalOperators(\n  data: {\n    tree: FilterFieldFlatGroupNode;\n    searchOperators?: FilterFieldSearchOperatorNode[];\n  },\n  group?: FilterFieldGroupNode,\n): {\n  tree: FilterFieldGroupNode;\n  searchOperators: FilterFieldSearchOperatorNode[];\n} {\n  const { tree, searchOperators = [] } = data;\n  const sortedTree: FilterFieldGroupNode = group ?? {\n    type: 'Group',\n    range: tree.range,\n    logicalOperator: 'AND',\n    explicit: tree.explicit,\n    explicitLogicalOperator: false,\n    children: [],\n  };\n\n  let prevLogicalOperator: LogicalOperator | null | undefined;\n  let currentLogicalOperator: LogicalOperator | undefined | null;\n  let nestedTree: FilterFieldGroupNode | undefined;\n\n  // In case of an empty group, return an empty group.\n  if (\n    tree.type === 'Group' &&\n    (tree.children.length === 0 || tree.children[0].type === 'Error')\n  ) {\n    return {\n      tree: {\n        ...tree,\n        logicalOperator: 'AND',\n        explicitLogicalOperator: false,\n        children: tree.children as FilterFieldNode[],\n      },\n      searchOperators,\n    };\n  }\n\n  for (const [index, child] of tree.children.entries()) {\n    // push error nodes to the tree, except logical operators\n    // as they need to be handled separately\n    if (child.type === 'Error' && !isLogicalOperator(child)) {\n      (nestedTree ?? sortedTree).children.push(child);\n    }\n\n    if (\n      child.type === 'Statement' ||\n      (child.type === 'Group' && child.explicit)\n    ) {\n      const prevNode: FilterFieldFlatNode | undefined =\n        tree.children[index - 1];\n\n      if (\n        child.type === 'Statement' &&\n        child.comparisonOperator?.type === 'SearchOperator'\n      ) {\n        // Store search operator to potentially mark all of them as errors in a later step.\n        searchOperators.push(child.comparisonOperator);\n      }\n\n      prevLogicalOperator = currentLogicalOperator;\n      currentLogicalOperator = (\n        isLogicalOperator(prevNode)\n          ? // DEPRECATION: [APPDEV-13773] BREAKING-CHANGE: Exclude logical operator node from public tree type.\n            // Check how to best deal with the logical operator conversion here.\n\n            (prevNode as FilterFieldLogicalOperatorNode).value.toUpperCase()\n          : null\n      ) as FilterFieldGroupNode['logicalOperator'];\n\n      if (prevNode === undefined) {\n        currentLogicalOperator = undefined;\n      }\n\n      // In case the previous logical operator is not equal to the current, we need to group the\n      // previous statement and the current statement and nest them in the tree.\n      // An undefined logical operator indicates that there are no previous statements yet.\n      // E.g.:\n      /*\n        a = 1 OR b = 2 c = 2\n        tree before implicit and: { or: ['a = 1', 'b = 2' ]}\n        -> pop the last statement of the current tree and add it to a new nested\n           tree with the current statement\n        tree after implicit and:  { or: ['a = 1', { and: ['b = 2', 'c = 2]} ]}\n       */\n      const shouldCreateNestedTree =\n        prevLogicalOperator !== undefined &&\n        currentLogicalOperator !== undefined &&\n        currentLogicalOperator !== prevLogicalOperator &&\n        // For an explicit logical operator, a nested tree has already been created when handling the logical operator.\n        prevNode?.type !== 'LogicalOperator';\n\n      if (shouldCreateNestedTree) {\n        // Pop last node of previous tree.\n        const prevNode = sortedTree.children.pop();\n        if (!prevNode) {\n          continue;\n        }\n\n        let nestedChildren: FilterFieldNode;\n        if (child.type === 'Group') {\n          ({ tree: nestedChildren } = groupByLogicalOperators({\n            tree: child,\n            searchOperators,\n          }));\n        } else {\n          nestedChildren = child;\n        }\n\n        // Create new nested tree to push to the previous group.\n        const groupedChildren: FilterFieldNode[] = [prevNode, nestedChildren];\n\n        nestedTree = {\n          type: 'Group',\n          range: {\n            from: prevNode.range.from,\n            to: groupedChildren[groupedChildren.length - 1]?.range.to,\n          },\n          children: groupedChildren,\n          logicalOperator: currentLogicalOperator ?? 'AND',\n          explicitLogicalOperator:\n            currentLogicalOperator !== null &&\n            currentLogicalOperator !== undefined,\n          explicit: false,\n        };\n\n        sortedTree.children.push(nestedTree);\n\n        // Update the nested tree's range to include all of the new group if need be.\n        if (sortedTree.range.to < nestedTree.range.to) {\n          sortedTree.range.to = nestedTree.range.to;\n        }\n      } else {\n        let nestedChildren: FilterFieldNode;\n        if (child.type === 'Group') {\n          ({ tree: nestedChildren } = groupByLogicalOperators(\n            { tree: child, searchOperators },\n            // Pass the created nested tree for implicit groups only to avoid circular structures.\n            // The sorted tree returned at the end of the function is set to the 'group' parameter = nestedTree.\n            // If the child is an explicit group and we would pass the nestedTree, it would be pushed into the\n            // sortedTree of the previous recursion again when returning the current sortedTree.\n            child.explicit ? undefined : nestedTree,\n          ));\n        } else {\n          nestedChildren = child;\n        }\n\n        // If the current node is a group, recursively add the group to the tree.\n        (nestedTree ?? sortedTree).children.push(nestedChildren);\n\n        if (nestedTree) {\n          nestedTree.range.to = child.range.to;\n        }\n        if (!sortedTree.explicit && sortedTree.range.to < child.range.to) {\n          sortedTree.range.to = child.range.to;\n        }\n      }\n    }\n\n    // If the child is an explicit logical operator, depending on the previous\n    // logical operator, we either just push it to the current tree, or create\n    // a nested tree to group the relevant statements and logical operators.\n    // E.g.:\n    /*\n      a = 1 b = 1 OR c = 2\n      Once at the explicit 'OR', group the previous statements (a, b).\n\n      a = 1 OR b = 2 c = 2\n      Once at the implicit 'AND', group the previous statement\n      and the current statement (b, c).\n     */\n    if (isLogicalOperator(child)) {\n      // DEPRECATION: [APPDEV-13773] BREAKING-CHANGE: Exclude logical operator node from public tree type.\n      // Check how to best deal with the logical operator conversion here.\n\n      const convertedChild: FilterFieldLogicalOperatorNode =\n        child as FilterFieldLogicalOperatorNode;\n\n      prevLogicalOperator = currentLogicalOperator;\n      currentLogicalOperator =\n        convertedChild.value.toUpperCase() as FilterFieldGroupNode['logicalOperator'];\n\n      if (\n        prevLogicalOperator !== undefined &&\n        prevLogicalOperator !== currentLogicalOperator\n      ) {\n        if (\n          !nestedTree ||\n          (currentLogicalOperator === 'OR' &&\n            currentLogicalOperator !== sortedTree.logicalOperator &&\n            // Either of the trees has an explicit logical operator. The current logical operator does not match\n            // the operator of the sorted tree. We need to move the existing sorted tree to a nested tree.\n            (sortedTree.explicitLogicalOperator ||\n              nestedTree.explicitLogicalOperator ||\n              // Some deeper nested mixture of implicit and explicit logical and.\n              // With a current logical OR operator, we need to move the existing sorted tree to a nested tree.\n              sortedTree.logicalOperator === nestedTree.logicalOperator)) ||\n          // The current logical operator is an explicit AND with a previous implicit AND and logical OR.\n          // E.g.: b=2 OR c=3 d=4 AND e=5\n          // In this case, we already have a nested tree, but still have to create a new one to group\n          // The implicit and explicit logical AND while not losing the logical OR.\n          (sortedTree.logicalOperator === 'OR' &&\n            currentLogicalOperator === 'AND')\n        ) {\n          // Create a new nested tree.\n          nestedTree = {\n            type: 'Group',\n            logicalOperator: 'AND',\n            range: { from: -1, to: -1 },\n            explicit: false,\n            explicitLogicalOperator:\n              currentLogicalOperator === 'AND' ||\n              (currentLogicalOperator === 'OR' &&\n                sortedTree.explicitLogicalOperator),\n            children: [],\n          };\n\n          // Add all the previous nodes to the new tree until we get to an explicit\n          // logical operator 'OR' operator.\n          // E.g.:\n          /*\n            a = 1 AND b = 1 c = 1 OR d = 2 e = 2\n            Once at the logical 'OR', create a new nested tree to group all the previous statements\n            that are connected with 'AND'.\n            All of them need to be removed from the current tree and pushed to the nested tree.\n\n            a = 1 OR b = 2 AND c = 2\n            Once at the logical 'AND', create a new nested tree, but only include the previous statement (b)\n            and don't move anything before.\n\n            a = 1 b = 2 AND c = 2\n            Once at the logical 'AND', create a new nested tree, but only include the previous statement (b)\n            and don't move anything before to be able to distinguish between explicit and implicit logical and.\n           */\n          let abortGrouping = false;\n          do {\n            const previousNode = sortedTree.children.pop();\n            // Nothing left in the tree -> break;\n            if (!previousNode) {\n              break;\n            }\n\n            nestedTree.children.push(previousNode);\n\n            // If the previous node is a logical 'OR' operator or the sorted tree does not have an explicit logical operator, but\n            // the current logical operator is an explicit 'AND', stop pushing nodes to the nested tree.\n            if (\n              // Switching from logical and to logical or.\n              (sortedTree.explicitLogicalOperator &&\n                sortedTree.logicalOperator === 'OR') ||\n              // Mixture of implicit and explicit logical and.\n              (!sortedTree.explicitLogicalOperator &&\n                currentLogicalOperator === 'AND')\n            ) {\n              abortGrouping = true;\n            }\n          } while (!abortGrouping);\n\n          // Reverse the nested tree to restore the original order of the nodes.\n          nestedTree.children.reverse();\n\n          // Set the start and end index of the nested tree.\n          nestedTree.range.from = nestedTree.children[0]?.range.from;\n          nestedTree.range.to =\n            nestedTree.children[nestedTree.children.length - 1]?.range.to;\n\n          if (\n            currentLogicalOperator === 'AND' &&\n            nestedTree.range.to < child.range.to\n          ) {\n            nestedTree.range.to = child.range.to;\n          }\n\n          if (!nestedTree.children[0]) {\n            nestedTree = undefined;\n          } else {\n            // Push the nested tree to the current tree.\n            sortedTree.children.push(nestedTree);\n            if (currentLogicalOperator === 'OR') {\n              sortedTree.logicalOperator = currentLogicalOperator;\n            }\n          }\n        }\n\n        if (\n          currentLogicalOperator === 'OR' ||\n          (nestedTree?.explicitLogicalOperator === false &&\n            currentLogicalOperator === 'AND')\n        ) {\n          nestedTree = undefined;\n        }\n      } else {\n        (nestedTree ?? sortedTree).explicitLogicalOperator =\n          child.type !== 'Error';\n      }\n\n      // Add the logical operator node to the tree if it is an error node\n      if (child.type === 'Error') {\n        (nestedTree ?? sortedTree).children.push(child);\n      }\n\n      if (!nestedTree) {\n        if (!prevLogicalOperator) {\n          sortedTree.logicalOperator = currentLogicalOperator;\n        }\n\n        if (currentLogicalOperator && child.type !== 'Error') {\n          sortedTree.explicitLogicalOperator = true;\n        }\n        if (sortedTree.range.to < child.range.to) {\n          sortedTree.range.to = child.range.to;\n        }\n      }\n    }\n\n    if (\n      child.type === 'Error' &&\n      (child.value === 'OR' || child.value === 'AND')\n    ) {\n      (nestedTree ?? sortedTree).explicitLogicalOperator = false;\n    }\n  }\n\n  return { tree: sortedTree, searchOperators };\n}\n\n/**\n * Function to check whether search operators are only used in a valid context.\n * A combination of logical or with statements other than search statements is not allowed.\n * Due to the higher precedence of logical and, it is sufficient to check only the root level of the tree\n * and only if the root node's logical operator is a logical or.\n */\nfunction checkValidSearchOperators(\n  root: FilterFieldGroupNode,\n  searchOperators?: FilterFieldSearchOperatorNode[],\n  doc?: string,\n): {\n  tree: FilterFieldGroupNode;\n  errors: FilterFieldError[];\n  isValidSearch: boolean;\n} {\n  const errors: FilterFieldError[] = [];\n  const hasStatementsOtherThanSearch = hasNonSearchStatements(root);\n  const isSearchInNestedGroup = isSearchOperatorInsideGroup(root, true);\n\n  // Check if the document ends with 'OR ' to catch incomplete logical operators at the end of the input.\n  const endsWithOR = typeof doc === 'string' && doc.endsWith('OR ');\n  const hasOr = root.logicalOperator === 'OR' || endsWithOR;\n\n  if (\n    // For a group with an explicit or, we need at least two children that are not logical operators\n    // for it to invalidate search operators.\n    // E.g.:\n    // \u203Afoo = bar or\u2039 should still show the search suggestion, since the user may want to search for \"or\".\n    // At this point, the \"or\" is already detected as logical operator (converted to an error node).\n    searchOperators &&\n    ((root.children.filter((child) => !isLogicalOperator(child)).length > 1 &&\n      hasStatementsOtherThanSearch &&\n      hasOr &&\n      searchOperators) ||\n      isSearchInNestedGroup)\n  ) {\n    for (const node of searchOperators) {\n      convertToErrorNode(node);\n      errors.push({\n        range: node.range,\n        message: {\n          type: 'unsupportedSearchWithLogicalOr',\n          details: `<span style=\"color: ${Colors.Syntax.Operators}\">AND</span>`,\n        },\n      });\n    }\n  }\n\n  const isValidSearch =\n    errors.length === 0 &&\n    !(hasOr && hasStatementsOtherThanSearch) &&\n    !isSearchInNestedGroup;\n\n  return { tree: root, errors, isValidSearch };\n}\n\n/** Check if any statements other than search statements are used in a tree. */\nfunction hasNonSearchStatements(root: FilterFieldGroupNode): boolean {\n  return root.children.some((node) => {\n    if (node.type === 'Group') {\n      return hasNonSearchStatements(node);\n    }\n\n    return (\n      isFilterFieldStatementNode(node) &&\n      node.comparisonOperator !== undefined &&\n      node.comparisonOperator.type !== 'SearchOperator'\n    );\n  });\n}\n\n/**\n * Recursively checks if a search operator or a related error node\n * exists inside any non-root group in the filter tree.\n */\nfunction isSearchOperatorInsideGroup(\n  node: FilterFieldGroupNode,\n  isRoot: boolean = true,\n): boolean {\n  for (const child of node.children) {\n    // Recursively check nested groups\n    if (child.type === 'Group') {\n      if (isSearchOperatorInsideGroup(child, false)) {\n        return true;\n      }\n    }\n    // Check for search operator or error in non-root groups\n    if (\n      !isRoot &&\n      isFilterFieldStatementNode(child) &&\n      child.comparisonOperator?.type === 'Error' &&\n      (child.comparisonOperator.value === '* ~' ||\n        child.comparisonOperator.value === '*~')\n    ) {\n      return true;\n    }\n  }\n  return false;\n}\n"],
+  "sourcesContent": ["import Colors from '@dynatrace/strato-design-tokens/colors';\n\nimport type { FilterFieldError } from '../../types/filter-field-error.js';\nimport type {\n  FilterFieldGroupNode,\n  FilterFieldNode,\n  FilterFieldSearchOperatorNode,\n} from '../../types/tree-nodes.js';\nimport {\n  isFilterFieldStatementNode,\n  isLogicalOperator,\n} from '../tree-node-guards.js';\nimport { convertToErrorNode } from './lezer-tree-conversion/node-mutations.js';\nimport type { FilterFieldProps } from '../../FilterField.types.js';\nimport type {\n  FilterFieldFlatGroupNode,\n  FilterFieldFlatNode,\n  FilterFieldLogicalOperatorNode,\n} from '../../types/conversion-utils.js';\n\n/**\n * Iterate over the parsed document and convert the lezer tree to an object.\n * @internal\n */\nexport function sortFilterFieldTree(\n  tree: FilterFieldFlatGroupNode | undefined,\n  parserConfig: FilterFieldProps['parserConfig'],\n  doc?: string,\n): {\n  tree: FilterFieldGroupNode | undefined;\n  errors: FilterFieldError[];\n  isValidSearch: boolean;\n} {\n  if (!tree) {\n    return { tree, errors: [], isValidSearch: true };\n  }\n\n  const { tree: _cleanedTree, searchOperators } = groupByLogicalOperators({\n    tree,\n  });\n  let errors: FilterFieldError[] = [];\n\n  let cleanedTree = _cleanedTree;\n  let isValidSearch;\n  // oxlint-disable-next-line typescript/no-deprecated\n  if (parserConfig?.searchConversion === true) {\n    ({\n      tree: cleanedTree,\n      errors,\n      isValidSearch,\n    } = checkValidSearchOperators(cleanedTree, searchOperators, doc));\n  }\n\n  return {\n    tree: cleanedTree,\n    errors,\n    isValidSearch: isValidSearch ?? false,\n  };\n}\n\ntype LogicalOperator = FilterFieldGroupNode['logicalOperator'];\n\n/**\n * Function to group the filter statements depending on the logical operators used.\n */\nfunction groupByLogicalOperators(\n  data: {\n    tree: FilterFieldFlatGroupNode;\n    searchOperators?: FilterFieldSearchOperatorNode[];\n  },\n  group?: FilterFieldGroupNode,\n): {\n  tree: FilterFieldGroupNode;\n  searchOperators: FilterFieldSearchOperatorNode[];\n} {\n  const { tree, searchOperators = [] } = data;\n  const sortedTree: FilterFieldGroupNode = group ?? {\n    type: 'Group',\n    range: tree.range,\n    logicalOperator: 'AND',\n    explicit: tree.explicit,\n    explicitLogicalOperator: false,\n    children: [],\n  };\n\n  let prevLogicalOperator: LogicalOperator | null | undefined;\n  let currentLogicalOperator: LogicalOperator | undefined | null;\n  let nestedTree: FilterFieldGroupNode | undefined;\n\n  // In case of an empty group, return an empty group.\n  if (\n    tree.type === 'Group' &&\n    (tree.children.length === 0 || tree.children[0].type === 'Error')\n  ) {\n    return {\n      tree: {\n        ...tree,\n        logicalOperator: 'AND',\n        explicitLogicalOperator: false,\n        children: tree.children as FilterFieldNode[],\n      },\n      searchOperators,\n    };\n  }\n\n  for (const [index, child] of tree.children.entries()) {\n    // push error nodes to the tree, except logical operators\n    // as they need to be handled separately\n    if (child.type === 'Error' && !isLogicalOperator(child)) {\n      (nestedTree ?? sortedTree).children.push(child);\n    }\n\n    if (\n      child.type === 'Statement' ||\n      (child.type === 'Group' && child.explicit)\n    ) {\n      const prevNode: FilterFieldFlatNode | undefined =\n        tree.children[index - 1];\n\n      if (\n        child.type === 'Statement' &&\n        child.comparisonOperator?.type === 'SearchOperator'\n      ) {\n        // Store search operator to potentially mark all of them as errors in a later step.\n        searchOperators.push(child.comparisonOperator);\n      }\n\n      prevLogicalOperator = currentLogicalOperator;\n      currentLogicalOperator = (\n        isLogicalOperator(prevNode)\n          ? // DEPRECATION: [APPDEV-13773] BREAKING-CHANGE: Exclude logical operator node from public tree type.\n            // Check how to best deal with the logical operator conversion here.\n\n            (prevNode as FilterFieldLogicalOperatorNode).value.toUpperCase()\n          : null\n      ) as FilterFieldGroupNode['logicalOperator'];\n\n      if (prevNode === undefined) {\n        currentLogicalOperator = undefined;\n      }\n\n      // In case the previous logical operator is not equal to the current, we need to group the\n      // previous statement and the current statement and nest them in the tree.\n      // An undefined logical operator indicates that there are no previous statements yet.\n      // E.g.:\n      /*\n        a = 1 OR b = 2 c = 2\n        tree before implicit and: { or: ['a = 1', 'b = 2' ]}\n        -> pop the last statement of the current tree and add it to a new nested\n           tree with the current statement\n        tree after implicit and:  { or: ['a = 1', { and: ['b = 2', 'c = 2]} ]}\n       */\n      const shouldCreateNestedTree =\n        prevLogicalOperator !== undefined &&\n        currentLogicalOperator !== undefined &&\n        currentLogicalOperator !== prevLogicalOperator &&\n        // For an explicit logical operator, a nested tree has already been created when handling the logical operator.\n        prevNode?.type !== 'LogicalOperator';\n\n      if (shouldCreateNestedTree) {\n        // Pop last node of previous tree.\n        const prevNode = sortedTree.children.pop();\n        if (!prevNode) {\n          continue;\n        }\n\n        let nestedChildren: FilterFieldNode;\n        if (child.type === 'Group') {\n          ({ tree: nestedChildren } = groupByLogicalOperators({\n            tree: child,\n            searchOperators,\n          }));\n        } else {\n          nestedChildren = child;\n        }\n\n        // Create new nested tree to push to the previous group.\n        const groupedChildren: FilterFieldNode[] = [prevNode, nestedChildren];\n\n        nestedTree = {\n          type: 'Group',\n          range: {\n            from: prevNode.range.from,\n            to: groupedChildren[groupedChildren.length - 1]?.range.to,\n          },\n          children: groupedChildren,\n          logicalOperator: currentLogicalOperator ?? 'AND',\n          explicitLogicalOperator:\n            currentLogicalOperator !== null &&\n            currentLogicalOperator !== undefined,\n          explicit: false,\n        };\n\n        sortedTree.children.push(nestedTree);\n\n        // Update the nested tree's range to include all of the new group if need be.\n        if (sortedTree.range.to < nestedTree.range.to) {\n          sortedTree.range.to = nestedTree.range.to;\n        }\n      } else {\n        let nestedChildren: FilterFieldNode;\n        if (child.type === 'Group') {\n          ({ tree: nestedChildren } = groupByLogicalOperators(\n            { tree: child, searchOperators },\n            // Pass the created nested tree for implicit groups only to avoid circular structures.\n            // The sorted tree returned at the end of the function is set to the 'group' parameter = nestedTree.\n            // If the child is an explicit group and we would pass the nestedTree, it would be pushed into the\n            // sortedTree of the previous recursion again when returning the current sortedTree.\n            child.explicit ? undefined : nestedTree,\n          ));\n        } else {\n          nestedChildren = child;\n        }\n\n        // If the current node is a group, recursively add the group to the tree.\n        (nestedTree ?? sortedTree).children.push(nestedChildren);\n\n        if (nestedTree) {\n          nestedTree.range.to = child.range.to;\n        }\n        if (!sortedTree.explicit && sortedTree.range.to < child.range.to) {\n          sortedTree.range.to = child.range.to;\n        }\n      }\n    }\n\n    // If the child is an explicit logical operator, depending on the previous\n    // logical operator, we either just push it to the current tree, or create\n    // a nested tree to group the relevant statements and logical operators.\n    // E.g.:\n    /*\n      a = 1 b = 1 OR c = 2\n      Once at the explicit 'OR', group the previous statements (a, b).\n\n      a = 1 OR b = 2 c = 2\n      Once at the implicit 'AND', group the previous statement\n      and the current statement (b, c).\n     */\n    if (isLogicalOperator(child)) {\n      // DEPRECATION: [APPDEV-13773] BREAKING-CHANGE: Exclude logical operator node from public tree type.\n      // Check how to best deal with the logical operator conversion here.\n\n      const convertedChild: FilterFieldLogicalOperatorNode =\n        child as FilterFieldLogicalOperatorNode;\n\n      prevLogicalOperator = currentLogicalOperator;\n      currentLogicalOperator =\n        convertedChild.value.toUpperCase() as FilterFieldGroupNode['logicalOperator'];\n\n      if (\n        prevLogicalOperator !== undefined &&\n        prevLogicalOperator !== currentLogicalOperator\n      ) {\n        if (\n          !nestedTree ||\n          (currentLogicalOperator === 'OR' &&\n            currentLogicalOperator !== sortedTree.logicalOperator &&\n            // Either of the trees has an explicit logical operator. The current logical operator does not match\n            // the operator of the sorted tree. We need to move the existing sorted tree to a nested tree.\n            (sortedTree.explicitLogicalOperator ||\n              nestedTree.explicitLogicalOperator ||\n              // Some deeper nested mixture of implicit and explicit logical and.\n              // With a current logical OR operator, we need to move the existing sorted tree to a nested tree.\n              sortedTree.logicalOperator === nestedTree.logicalOperator)) ||\n          // The current logical operator is an explicit AND with a previous implicit AND and logical OR.\n          // E.g.: b=2 OR c=3 d=4 AND e=5\n          // In this case, we already have a nested tree, but still have to create a new one to group\n          // The implicit and explicit logical AND while not losing the logical OR.\n          (sortedTree.logicalOperator === 'OR' &&\n            currentLogicalOperator === 'AND')\n        ) {\n          // Create a new nested tree.\n          nestedTree = {\n            type: 'Group',\n            logicalOperator: 'AND',\n            range: { from: -1, to: -1 },\n            explicit: false,\n            explicitLogicalOperator:\n              currentLogicalOperator === 'AND' ||\n              (currentLogicalOperator === 'OR' &&\n                sortedTree.explicitLogicalOperator),\n            children: [],\n          };\n\n          // Add all the previous nodes to the new tree until we get to an explicit\n          // logical operator 'OR' operator.\n          // E.g.:\n          /*\n            a = 1 AND b = 1 c = 1 OR d = 2 e = 2\n            Once at the logical 'OR', create a new nested tree to group all the previous statements\n            that are connected with 'AND'.\n            All of them need to be removed from the current tree and pushed to the nested tree.\n\n            a = 1 OR b = 2 AND c = 2\n            Once at the logical 'AND', create a new nested tree, but only include the previous statement (b)\n            and don't move anything before.\n\n            a = 1 b = 2 AND c = 2\n            Once at the logical 'AND', create a new nested tree, but only include the previous statement (b)\n            and don't move anything before to be able to distinguish between explicit and implicit logical and.\n           */\n          let abortGrouping = false;\n          do {\n            const previousNode = sortedTree.children.pop();\n            // Nothing left in the tree -> break;\n            if (!previousNode) {\n              break;\n            }\n\n            nestedTree.children.push(previousNode);\n\n            // If the previous node is a logical 'OR' operator or the sorted tree does not have an explicit logical operator, but\n            // the current logical operator is an explicit 'AND', stop pushing nodes to the nested tree.\n            if (\n              // Switching from logical and to logical or.\n              (sortedTree.explicitLogicalOperator &&\n                sortedTree.logicalOperator === 'OR') ||\n              // Mixture of implicit and explicit logical and.\n              (!sortedTree.explicitLogicalOperator &&\n                currentLogicalOperator === 'AND')\n            ) {\n              abortGrouping = true;\n            }\n          } while (!abortGrouping);\n\n          // Reverse the nested tree to restore the original order of the nodes.\n          nestedTree.children.reverse();\n\n          // Set the start and end index of the nested tree.\n          nestedTree.range.from = nestedTree.children[0]?.range.from;\n          nestedTree.range.to =\n            nestedTree.children[nestedTree.children.length - 1]?.range.to;\n\n          if (\n            currentLogicalOperator === 'AND' &&\n            nestedTree.range.to < child.range.to\n          ) {\n            nestedTree.range.to = child.range.to;\n          }\n\n          if (!nestedTree.children[0]) {\n            nestedTree = undefined;\n          } else {\n            // Push the nested tree to the current tree.\n            sortedTree.children.push(nestedTree);\n            if (currentLogicalOperator === 'OR') {\n              sortedTree.logicalOperator = currentLogicalOperator;\n            }\n          }\n        }\n\n        if (\n          currentLogicalOperator === 'OR' ||\n          (nestedTree?.explicitLogicalOperator === false &&\n            currentLogicalOperator === 'AND')\n        ) {\n          nestedTree = undefined;\n        }\n      } else {\n        (nestedTree ?? sortedTree).explicitLogicalOperator =\n          child.type !== 'Error';\n      }\n\n      // Add the logical operator node to the tree if it is an error node\n      if (child.type === 'Error') {\n        (nestedTree ?? sortedTree).children.push(child);\n      }\n\n      if (!nestedTree) {\n        if (!prevLogicalOperator) {\n          sortedTree.logicalOperator = currentLogicalOperator;\n        }\n\n        if (currentLogicalOperator && child.type !== 'Error') {\n          sortedTree.explicitLogicalOperator = true;\n        }\n        if (sortedTree.range.to < child.range.to) {\n          sortedTree.range.to = child.range.to;\n        }\n      }\n    }\n\n    if (\n      child.type === 'Error' &&\n      (child.value === 'OR' || child.value === 'AND')\n    ) {\n      (nestedTree ?? sortedTree).explicitLogicalOperator = false;\n    }\n  }\n\n  return { tree: sortedTree, searchOperators };\n}\n\n/**\n * Function to check whether search operators are only used in a valid context.\n * A combination of logical or with statements other than search statements is not allowed.\n * Due to the higher precedence of logical and, it is sufficient to check only the root level of the tree\n * and only if the root node's logical operator is a logical or.\n */\nfunction checkValidSearchOperators(\n  root: FilterFieldGroupNode,\n  searchOperators?: FilterFieldSearchOperatorNode[],\n  doc?: string,\n): {\n  tree: FilterFieldGroupNode;\n  errors: FilterFieldError[];\n  isValidSearch: boolean;\n} {\n  const errors: FilterFieldError[] = [];\n  const hasStatementsOtherThanSearch = hasNonSearchStatements(root);\n  const isSearchInNestedGroup = isSearchOperatorInsideGroup(root, true);\n\n  // Check if the document ends with 'OR ' to catch incomplete logical operators at the end of the input.\n  const endsWithOR = typeof doc === 'string' && doc.endsWith('OR ');\n  const hasOr = root.logicalOperator === 'OR' || endsWithOR;\n\n  if (\n    // For a group with an explicit or, we need at least two children that are not logical operators\n    // for it to invalidate search operators.\n    // E.g.:\n    // \u203Afoo = bar or\u2039 should still show the search suggestion, since the user may want to search for \"or\".\n    // At this point, the \"or\" is already detected as logical operator (converted to an error node).\n    searchOperators &&\n    ((root.children.filter((child) => !isLogicalOperator(child)).length > 1 &&\n      hasStatementsOtherThanSearch &&\n      hasOr &&\n      searchOperators) ||\n      isSearchInNestedGroup)\n  ) {\n    for (const node of searchOperators) {\n      convertToErrorNode(node);\n      errors.push({\n        range: node.range,\n        message: {\n          type: 'unsupportedSearchWithLogicalOr',\n          details: `<span style=\"color: ${Colors.Syntax.Operators}\">AND</span>`,\n        },\n      });\n    }\n  }\n\n  const isValidSearch =\n    errors.length === 0 &&\n    !(hasOr && hasStatementsOtherThanSearch) &&\n    !isSearchInNestedGroup;\n\n  return { tree: root, errors, isValidSearch };\n}\n\n/** Check if any statements other than search statements are used in a tree. */\nfunction hasNonSearchStatements(root: FilterFieldGroupNode): boolean {\n  return root.children.some((node) => {\n    if (node.type === 'Group') {\n      return hasNonSearchStatements(node);\n    }\n\n    return (\n      isFilterFieldStatementNode(node) &&\n      node.comparisonOperator !== undefined &&\n      node.comparisonOperator.type !== 'SearchOperator'\n    );\n  });\n}\n\n/**\n * Recursively checks if a search operator or a related error node\n * exists inside any non-root group in the filter tree.\n */\nfunction isSearchOperatorInsideGroup(\n  node: FilterFieldGroupNode,\n  isRoot: boolean = true,\n): boolean {\n  for (const child of node.children) {\n    // Recursively check nested groups\n    if (child.type === 'Group') {\n      if (isSearchOperatorInsideGroup(child, false)) {\n        return true;\n      }\n    }\n    // Check for search operator or error in non-root groups\n    if (\n      !isRoot &&\n      isFilterFieldStatementNode(child) &&\n      child.comparisonOperator?.type === 'Error' &&\n      (child.comparisonOperator.value === '* ~' ||\n        child.comparisonOperator.value === '*~')\n    ) {\n      return true;\n    }\n  }\n  return false;\n}\n"],
   "mappings": "AAAA,OAAO,YAAY;AAQnB;AAAA,EACE;AAAA,EACA;AAAA,OACK;AACP,SAAS,0BAA0B;AAY5B,SAAS,oBACd,MACA,cACA,KAKA;AACA,MAAI,CAAC,MAAM;AACT,WAAO,EAAE,MAAM,QAAQ,CAAC,GAAG,eAAe,KAAK;AAAA,EACjD;AAEA,QAAM,EAAE,MAAM,cAAc,gBAAgB,IAAI,wBAAwB;AAAA,IACtE;AAAA,EACF,CAAC;AACD,MAAI,SAA6B,CAAC;AAElC,MAAI,cAAc;AAClB,MAAI;AAEJ,MAAI,cAAc,qBAAqB,MAAM;AAC3C,KAAC;AAAA,MACC,MAAM;AAAA,MACN;AAAA,MACA;AAAA,IACF,IAAI,0BAA0B,aAAa,iBAAiB,GAAG;AAAA,EACjE;AAEA,SAAO;AAAA,IACL,MAAM;AAAA,IACN;AAAA,IACA,eAAe,iBAAiB;AAAA,EAClC;AACF;AAOA,SAAS,wBACP,MAIA,OAIA;AACA,QAAM,EAAE,MAAM,kBAAkB,CAAC,EAAE,IAAI;AACvC,QAAM,aAAmC,SAAS;AAAA,IAChD,MAAM;AAAA,IACN,OAAO,KAAK;AAAA,IACZ,iBAAiB;AAAA,IACjB,UAAU,KAAK;AAAA,IACf,yBAAyB;AAAA,IACzB,UAAU,CAAC;AAAA,EACb;AAEA,MAAI;AACJ,MAAI;AACJ,MAAI;AAGJ,MACE,KAAK,SAAS,YACb,KAAK,SAAS,WAAW,KAAK,KAAK,SAAS,CAAC,EAAE,SAAS,UACzD;AACA,WAAO;AAAA,MACL,MAAM;AAAA,QACJ,GAAG;AAAA,QACH,iBAAiB;AAAA,QACjB,yBAAyB;AAAA,QACzB,UAAU,KAAK;AAAA,MACjB;AAAA,MACA;AAAA,IACF;AAAA,EACF;AAEA,aAAW,CAAC,OAAO,KAAK,KAAK,KAAK,SAAS,QAAQ,GAAG;AAGpD,QAAI,MAAM,SAAS,WAAW,CAAC,kBAAkB,KAAK,GAAG;AACvD,OAAC,cAAc,YAAY,SAAS,KAAK,KAAK;AAAA,IAChD;AAEA,QACE,MAAM,SAAS,eACd,MAAM,SAAS,WAAW,MAAM,UACjC;AACA,YAAM,WACJ,KAAK,SAAS,QAAQ,CAAC;AAEzB,UACE,MAAM,SAAS,eACf,MAAM,oBAAoB,SAAS,kBACnC;AAEA,wBAAgB,KAAK,MAAM,kBAAkB;AAAA,MAC/C;AAEA,4BAAsB;AACtB,+BACE,kBAAkB,QAAQ;AAAA;AAAA;AAAA,QAIrB,SAA4C,MAAM,YAAY;AAAA,UAC/D;AAGN,UAAI,aAAa,QAAW;AAC1B,iCAAyB;AAAA,MAC3B;AAaA,YAAM,yBACJ,wBAAwB,UACxB,2BAA2B,UAC3B,2BAA2B;AAAA,MAE3B,UAAU,SAAS;AAErB,UAAI,wBAAwB;AAE1B,cAAMA,YAAW,WAAW,SAAS,IAAI;AACzC,YAAI,CAACA,WAAU;AACb;AAAA,QACF;AAEA,YAAI;AACJ,YAAI,MAAM,SAAS,SAAS;AAC1B,WAAC,EAAE,MAAM,eAAe,IAAI,wBAAwB;AAAA,YAClD,MAAM;AAAA,YACN;AAAA,UACF,CAAC;AAAA,QACH,OAAO;AACL,2BAAiB;AAAA,QACnB;AAGA,cAAM,kBAAqC,CAACA,WAAU,cAAc;AAEpE,qBAAa;AAAA,UACX,MAAM;AAAA,UACN,OAAO;AAAA,YACL,MAAMA,UAAS,MAAM;AAAA,YACrB,IAAI,gBAAgB,gBAAgB,SAAS,CAAC,GAAG,MAAM;AAAA,UACzD;AAAA,UACA,UAAU;AAAA,UACV,iBAAiB,0BAA0B;AAAA,UAC3C,yBACE,2BAA2B,QAC3B,2BAA2B;AAAA,UAC7B,UAAU;AAAA,QACZ;AAEA,mBAAW,SAAS,KAAK,UAAU;AAGnC,YAAI,WAAW,MAAM,KAAK,WAAW,MAAM,IAAI;AAC7C,qBAAW,MAAM,KAAK,WAAW,MAAM;AAAA,QACzC;AAAA,MACF,OAAO;AACL,YAAI;AACJ,YAAI,MAAM,SAAS,SAAS;AAC1B,WAAC,EAAE,MAAM,eAAe,IAAI;AAAA,YAC1B,EAAE,MAAM,OAAO,gBAAgB;AAAA;AAAA;AAAA;AAAA;AAAA,YAK/B,MAAM,WAAW,SAAY;AAAA,UAC/B;AAAA,QACF,OAAO;AACL,2BAAiB;AAAA,QACnB;AAGA,SAAC,cAAc,YAAY,SAAS,KAAK,cAAc;AAEvD,YAAI,YAAY;AACd,qBAAW,MAAM,KAAK,MAAM,MAAM;AAAA,QACpC;AACA,YAAI,CAAC,WAAW,YAAY,WAAW,MAAM,KAAK,MAAM,MAAM,IAAI;AAChE,qBAAW,MAAM,KAAK,MAAM,MAAM;AAAA,QACpC;AAAA,MACF;AAAA,IACF;AAcA,QAAI,kBAAkB,KAAK,GAAG;AAI5B,YAAM,iBACJ;AAEF,4BAAsB;AACtB,+BACE,eAAe,MAAM,YAAY;AAEnC,UACE,wBAAwB,UACxB,wBAAwB,wBACxB;AACA,YACE,CAAC,cACA,2BAA2B,QAC1B,2BAA2B,WAAW;AAAA;AAAA,SAGrC,WAAW,2BACV,WAAW;AAAA;AAAA,QAGX,WAAW,oBAAoB,WAAW;AAAA;AAAA;AAAA;AAAA,QAK7C,WAAW,oBAAoB,QAC9B,2BAA2B,OAC7B;AAEA,uBAAa;AAAA,YACX,MAAM;AAAA,YACN,iBAAiB;AAAA,YACjB,OAAO,EAAE,MAAM,IAAI,IAAI,GAAG;AAAA,YAC1B,UAAU;AAAA,YACV,yBACE,2BAA2B,SAC1B,2BAA2B,QAC1B,WAAW;AAAA,YACf,UAAU,CAAC;AAAA,UACb;AAmBA,cAAI,gBAAgB;AACpB,aAAG;AACD,kBAAM,eAAe,WAAW,SAAS,IAAI;AAE7C,gBAAI,CAAC,cAAc;AACjB;AAAA,YACF;AAEA,uBAAW,SAAS,KAAK,YAAY;AAIrC;AAAA;AAAA,cAEG,WAAW,2BACV,WAAW,oBAAoB;AAAA,cAEhC,CAAC,WAAW,2BACX,2BAA2B;AAAA,cAC7B;AACA,8BAAgB;AAAA,YAClB;AAAA,UACF,SAAS,CAAC;AAGV,qBAAW,SAAS,QAAQ;AAG5B,qBAAW,MAAM,OAAO,WAAW,SAAS,CAAC,GAAG,MAAM;AACtD,qBAAW,MAAM,KACf,WAAW,SAAS,WAAW,SAAS,SAAS,CAAC,GAAG,MAAM;AAE7D,cACE,2BAA2B,SAC3B,WAAW,MAAM,KAAK,MAAM,MAAM,IAClC;AACA,uBAAW,MAAM,KAAK,MAAM,MAAM;AAAA,UACpC;AAEA,cAAI,CAAC,WAAW,SAAS,CAAC,GAAG;AAC3B,yBAAa;AAAA,UACf,OAAO;AAEL,uBAAW,SAAS,KAAK,UAAU;AACnC,gBAAI,2BAA2B,MAAM;AACnC,yBAAW,kBAAkB;AAAA,YAC/B;AAAA,UACF;AAAA,QACF;AAEA,YACE,2BAA2B,QAC1B,YAAY,4BAA4B,SACvC,2BAA2B,OAC7B;AACA,uBAAa;AAAA,QACf;AAAA,MACF,OAAO;AACL,SAAC,cAAc,YAAY,0BACzB,MAAM,SAAS;AAAA,MACnB;AAGA,UAAI,MAAM,SAAS,SAAS;AAC1B,SAAC,cAAc,YAAY,SAAS,KAAK,KAAK;AAAA,MAChD;AAEA,UAAI,CAAC,YAAY;AACf,YAAI,CAAC,qBAAqB;AACxB,qBAAW,kBAAkB;AAAA,QAC/B;AAEA,YAAI,0BAA0B,MAAM,SAAS,SAAS;AACpD,qBAAW,0BAA0B;AAAA,QACvC;AACA,YAAI,WAAW,MAAM,KAAK,MAAM,MAAM,IAAI;AACxC,qBAAW,MAAM,KAAK,MAAM,MAAM;AAAA,QACpC;AAAA,MACF;AAAA,IACF;AAEA,QACE,MAAM,SAAS,YACd,MAAM,UAAU,QAAQ,MAAM,UAAU,QACzC;AACA,OAAC,cAAc,YAAY,0BAA0B;AAAA,IACvD;AAAA,EACF;AAEA,SAAO,EAAE,MAAM,YAAY,gBAAgB;AAC7C;AAQA,SAAS,0BACP,MACA,iBACA,KAKA;AACA,QAAM,SAA6B,CAAC;AACpC,QAAM,+BAA+B,uBAAuB,IAAI;AAChE,QAAM,wBAAwB,4BAA4B,MAAM,IAAI;AAGpE,QAAM,aAAa,OAAO,QAAQ,YAAY,IAAI,SAAS,KAAK;AAChE,QAAM,QAAQ,KAAK,oBAAoB,QAAQ;AAE/C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAME,oBACE,KAAK,SAAS,OAAO,CAAC,UAAU,CAAC,kBAAkB,KAAK,CAAC,EAAE,SAAS,KACpE,gCACA,SACA,mBACA;AAAA,IACF;AACA,eAAW,QAAQ,iBAAiB;AAClC,yBAAmB,IAAI;AACvB,aAAO,KAAK;AAAA,QACV,OAAO,KAAK;AAAA,QACZ,SAAS;AAAA,UACP,MAAM;AAAA,UACN,SAAS,uBAAuB,OAAO,OAAO,SAAS;AAAA,QACzD;AAAA,MACF,CAAC;AAAA,IACH;AAAA,EACF;AAEA,QAAM,gBACJ,OAAO,WAAW,KAClB,EAAE,SAAS,iCACX,CAAC;AAEH,SAAO,EAAE,MAAM,MAAM,QAAQ,cAAc;AAC7C;AAGA,SAAS,uBAAuB,MAAqC;AACnE,SAAO,KAAK,SAAS,KAAK,CAAC,SAAS;AAClC,QAAI,KAAK,SAAS,SAAS;AACzB,aAAO,uBAAuB,IAAI;AAAA,IACpC;AAEA,WACE,2BAA2B,IAAI,KAC/B,KAAK,uBAAuB,UAC5B,KAAK,mBAAmB,SAAS;AAAA,EAErC,CAAC;AACH;AAMA,SAAS,4BACP,MACA,SAAkB,MACT;AACT,aAAW,SAAS,KAAK,UAAU;AAEjC,QAAI,MAAM,SAAS,SAAS;AAC1B,UAAI,4BAA4B,OAAO,KAAK,GAAG;AAC7C,eAAO;AAAA,MACT;AAAA,IACF;AAEA,QACE,CAAC,UACD,2BAA2B,KAAK,KAChC,MAAM,oBAAoB,SAAS,YAClC,MAAM,mBAAmB,UAAU,SAClC,MAAM,mBAAmB,UAAU,OACrC;AACA,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO;AACT;",
   "names": ["prevNode"]
 }

package/esm/filters/filter-field/utils/conversion/tree-string-conversion.js

@@ -20,6 +20,12 @@ function getOperatorInfo(operatorValue, operatorType) {
       operatorInfo.textValue = "!=";
       operatorInfo.positionOperator = operatorValue.substring(4);
       break;
+    case "matches-wildcard":
+      operatorInfo.textValue = "=";
+      break;
+    case "not-matches-wildcard":
+      operatorInfo.textValue = "!=";
+      break;
     case "matches-phrase":
       operatorInfo.textValue = "~";
       break;
@@ -50,7 +56,8 @@ function getNestedValue({
   nodeType,
   isFreeText,
   positionOperator,
-  separator
+  separator,
+  preserveWildcards
 }) {
   let value = _value;
   if (value === void 0) {
@@ -89,8 +96,10 @@ function getNestedValue({
   );
   value = value.replaceAll(/\\/g, "\\\\");
   value = value.replaceAll(/"/g, '\\"');
-  const positionOperatorInValueRegex = /\*/g;
-  value = value.replaceAll(positionOperatorInValueRegex, "\\*");
+  if (!preserveWildcards) {
+    const positionOperatorInValueRegex = /\*/g;
+    value = value.replaceAll(positionOperatorInValueRegex, "\\*");
+  }
   const reservedCharactersRegex = /(?!^\$)(?<!\\)(?:\\\\)*[,()!<>="$:[\]~ ]|\\$/;
   if (reservedCharactersRegex.test(value) || wrapInQuotes) {
     return `"${value}"`;
@@ -157,12 +166,14 @@ function _convertFilterFieldTreeToString(tree = void 0, convertedString = "") {
       }
       if (value) {
         const val = value.type === "Duration" ? `${value.value}${value.unit}` : value.value;
+        const shouldPreserveWildcards = comparisonOperator?.value === "matches-wildcard" || comparisonOperator?.value === "not-matches-wildcard";
         const childValues = getNestedValue({
           value: val,
           textValue: value.textValue,
           nodeType: value.type,
           positionOperator: operatorInfo.positionOperator,
-          separator: ","
+          separator: ",",
+          preserveWildcards: shouldPreserveWildcards
         });
         if (value.type === "List" || value.type === "Error" && Array.isArray(val)) {
           statement = `${statement}(${childValues})`;

package/esm/filters/filter-field/utils/conversion/tree-string-conversion.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../../../../../src/filters/filter-field/utils/conversion/tree-string-conversion.ts"],
-  "sourcesContent": ["import { getNumberParser } from '../../parser/getNumberParser.js';\nimport type {\n  SimpleFilterFieldNode,\n  SimpleFilterFieldTree,\n} from '../../types/conversion-tree-nodes.js';\n/**\n * Conversion util that converts a filter field tree into a string.\n * @param tree - Filter field tree\n * @public\n */\nexport function convertFilterFieldTreeToString(\n  tree?: SimpleFilterFieldTree,\n): string {\n  return _convertFilterFieldTreeToString(tree, '');\n}\n\nfunction getOperatorInfo(\n  operatorValue: string,\n  operatorType: string,\n): {\n  textValue: string;\n  positionOperator: string;\n} {\n  const operatorInfo = {\n    textValue: operatorValue,\n    positionOperator: '',\n  };\n\n  switch (operatorValue) {\n    case 'ends-with':\n    case 'starts-with':\n    case 'contains':\n      operatorInfo.textValue = '=';\n      operatorInfo.positionOperator = operatorValue;\n      break;\n    case 'not-ends-with':\n    case 'not-starts-with':\n    case 'not-contains':\n      operatorInfo.textValue = '!=';\n      operatorInfo.positionOperator = operatorValue.substring(4);\n      break;\n    case 'matches-phrase':\n      operatorInfo.textValue = '~';\n      break;\n    case 'not-matches-phrase':\n      operatorInfo.textValue = '!~';\n      break;\n    case 'search':\n      operatorInfo.textValue = '* ~';\n      break;\n  }\n\n  if (operatorType === 'ExistsOperator') {\n    operatorInfo.textValue = operatorValue ? '= *' : '!= *';\n  }\n\n  if (operatorType === 'SearchOperator') {\n    operatorInfo.textValue = '* ~';\n  }\n\n  return operatorInfo;\n}\n\n/**\n * check if the value has to be wrapped in quotes regardless if it contains a reserved character.\n * this is the case if it is either an empty string or if it is a boolean, number or duration but has\n * the type 'String' (then it has to be escaped, otherwise the type of the value would change)\n */\nfunction hasToBeWrappedInQuotes(\n  value: string,\n  isString: boolean, // whether the nodeType equals 'String'\n  hasPositionOperator: string | undefined,\n): boolean {\n  const numberParser = getNumberParser();\n  const valueAsNumber = numberParser.parse(value);\n  const durationRegex = /^\\d+(ns|ms|s|m|h|d)$/;\n  return (\n    value === '' ||\n    ((value === 'true' || value === 'false') && isString) ||\n    (!isNaN(valueAsNumber) && isString && !hasPositionOperator) ||\n    (durationRegex.test(value) && isString && !hasPositionOperator) ||\n    (value.charAt(0) === '$' && isString)\n  );\n}\n\nfunction getNestedValue({\n  value: _value,\n  textValue,\n  nodeType,\n  isFreeText,\n  positionOperator,\n  separator,\n}: {\n  value: SimpleFilterFieldNode[] | undefined | string | number | boolean;\n  textValue?: string;\n  nodeType:\n    | 'Error'\n    | 'String'\n    | 'Variable'\n    | 'List'\n    | 'Key'\n    | 'JSONPath'\n    | 'Number'\n    | 'BigInt'\n    | 'Boolean'\n    | 'Duration'\n    | 'ComparisonOperator'\n    | 'IPAddress'\n    | 'UID'\n    | 'SmartscapeId'\n    | 'Timestamp'\n    | 'ExistsOperator'\n    | 'SearchOperator'\n    | 'InclusionOperator'\n    | 'Group';\n  isFreeText?: boolean;\n  positionOperator?: string;\n  separator?: string;\n}): string {\n  let value = _value;\n  if (value === undefined) {\n    return '';\n  }\n\n  if (Array.isArray(value)) {\n    let combinedString = '';\n\n    // Recursively convert all included nodes.\n    value.forEach((node, index) => {\n      return (combinedString = _convertFilterFieldTreeToString(\n        node,\n        separator && index !== 0\n          ? `${combinedString}${separator}`\n          : combinedString,\n      ));\n    });\n\n    return combinedString;\n  }\n\n  if (textValue) {\n    // Remove leading '*' or the star in '\"*' if position operator is 'contains' or 'ends-with'\n    if (positionOperator === 'contains' || positionOperator === 'ends-with') {\n      textValue = textValue.replaceAll(/(?<=^\")\\*|^\\*/g, '');\n    }\n\n    // Remove trailing '*' or the star in '*\"' if position operator is 'contains' or 'starts-with'\n    if (positionOperator === 'contains' || positionOperator === 'starts-with') {\n      textValue = textValue.replaceAll(/\\*(?=\"$)|\\*$/g, '');\n    }\n\n    return textValue;\n  }\n\n  value = `${value}`;\n\n  // If the node is an error, we don't escape any characters\n  if (nodeType === 'Error') {\n    if (!isFreeText) {\n      return value;\n    }\n\n    return value.replaceAll(/\\\\/g, '\\\\\\\\');\n  }\n\n  const wrapInQuotes = hasToBeWrappedInQuotes(\n    value,\n    nodeType === 'String',\n    positionOperator,\n  );\n\n  // Escape the escape character ('\\') with an escape character so it is included in the value, not just\n  // escaping the next character\n  value = value.replaceAll(/\\\\/g, '\\\\\\\\');\n\n  // Escape double quotes with an escape character as it cannot be escaped with double quotes\n  value = value.replaceAll(/\"/g, '\\\\\"');\n\n  // Escape '*' symbols with an escape character as it may change the meaning of the syntax tree if escaped with double quotes\n  const positionOperatorInValueRegex = /\\*/g;\n  value = value.replaceAll(positionOperatorInValueRegex, '\\\\*');\n\n  // check if it contains any reserved characters\n  // https://regex101.com/r/iw2j1u/1\n  const reservedCharactersRegex =\n    /(?!^\\$)(?<!\\\\)(?:\\\\\\\\)*[,()!<>=\"$:[\\]~ ]|\\\\$/;\n\n  if (reservedCharactersRegex.test(value) || wrapInQuotes) {\n    return `\"${value}\"`;\n  }\n\n  return value;\n}\n\nfunction _convertFilterFieldTreeToString(\n  tree: SimpleFilterFieldTree | SimpleFilterFieldNode = undefined,\n  convertedString: string = '',\n): string {\n  if (!tree) {\n    return '';\n  }\n\n  switch (tree.type) {\n    case 'Group': {\n      let groupString = '';\n\n      if (tree.explicit) {\n        groupString = '(';\n      }\n\n      const childValues = getNestedValue({\n        value: tree.children,\n        nodeType: tree.type,\n        separator: tree.explicitLogicalOperator\n          ? ` ${tree.logicalOperator}`\n          : '',\n      });\n\n      groupString =\n        groupString +\n        childValues +\n        `${\n          tree.children.length === 1 && tree.explicitLogicalOperator\n            ? ' ' + tree.logicalOperator\n            : ''\n        }`;\n\n      if (tree.explicit) {\n        const lastChild = tree.children[tree.children.length - 1];\n\n        // if the group is not missing a closing bracket add one to the string\n        if (\n          !(\n            lastChild &&\n            lastChild.type === 'Error' &&\n            lastChild.value === '' &&\n            tree.children.length !== 1\n          )\n        ) {\n          groupString += ')';\n        }\n      }\n\n      convertedString = addNodeToString(convertedString, groupString);\n\n      break;\n    }\n    case 'Error':\n      // if it is an empty group error the brackets were already added when handling the group\n      if (tree.value !== '()') {\n        convertedString = addNodeToString(\n          convertedString,\n          getNestedValue({\n            value: tree.value,\n            textValue: tree.textValue,\n            nodeType: tree.type,\n          }),\n        );\n      }\n      break;\n    case 'Statement': {\n      let statement = '';\n      const { key, comparisonOperator, value } = tree;\n\n      if (key && key.type === 'JSONPath') {\n        statement = `${key.value}${comparisonOperator || value ? ' ' : ''}`;\n      } else if (key) {\n        statement = `${getNestedValue({\n          value: key.value,\n          textValue: key.textValue,\n          nodeType: key.type,\n          isFreeText: !(comparisonOperator ?? value),\n        })}${comparisonOperator || value ? ' ' : ''}`;\n      }\n\n      let operatorInfo = { textValue: '', positionOperator: '' };\n\n      if (comparisonOperator) {\n        operatorInfo = getOperatorInfo(\n          comparisonOperator.value as string,\n          comparisonOperator.type,\n        );\n        statement = `${statement}${operatorInfo.textValue}${value ? ' ' : ''}`;\n      }\n\n      if (value) {\n        const val =\n          value.type === 'Duration'\n            ? `${value.value}${value.unit}`\n            : value.value;\n\n        const childValues = getNestedValue({\n          value: val,\n          textValue: value.textValue,\n          nodeType: value.type,\n          positionOperator: operatorInfo.positionOperator,\n          separator: ',',\n        });\n\n        if (\n          value.type === 'List' ||\n          (value.type === 'Error' && Array.isArray(val))\n        ) {\n          statement = `${statement}(${childValues})`;\n        } else if (value.type === 'Error') {\n          statement = statement + childValues;\n        } else {\n          statement =\n            statement +\n            `${\n              operatorInfo.positionOperator === 'contains' ||\n              operatorInfo.positionOperator === 'ends-with'\n                ? '*'\n                : ''\n            }` +\n            childValues +\n            `${\n              operatorInfo.positionOperator === 'contains' ||\n              operatorInfo.positionOperator === 'starts-with'\n                ? '*'\n                : ''\n            }`;\n        }\n      }\n\n      convertedString = addNodeToString(convertedString, statement);\n      break;\n    }\n    case 'JSONPath': {\n      convertedString = addNodeToString(convertedString, tree.value);\n      break;\n    }\n    case 'Duration': {\n      convertedString = addNodeToString(\n        convertedString,\n        `${tree.value}${tree.unit}`,\n      );\n      break;\n    }\n    default:\n      convertedString = addNodeToString(\n        convertedString,\n        getNestedValue({\n          value: tree.value,\n          textValue: tree.textValue,\n          nodeType: tree.type,\n        }),\n      );\n      break;\n  }\n\n  return convertedString;\n}\n\nfunction addNodeToString(sourceString: string, insertionString: string) {\n  if (insertionString) {\n    const firstElement = sourceString === '' || sourceString === '(';\n    return `${sourceString}${firstElement ? '' : ' '}${insertionString}`;\n  }\n  return sourceString;\n}\n"],
-  "mappings": "AAAA,SAAS,uBAAuB;AAUzB,SAAS,+BACd,MACQ;AACR,SAAO,gCAAgC,MAAM,EAAE;AACjD;AAEA,SAAS,gBACP,eACA,cAIA;AACA,QAAM,eAAe;AAAA,IACnB,WAAW;AAAA,IACX,kBAAkB;AAAA,EACpB;AAEA,UAAQ,eAAe;AAAA,IACrB,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AACH,mBAAa,YAAY;AACzB,mBAAa,mBAAmB;AAChC;AAAA,IACF,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AACH,mBAAa,YAAY;AACzB,mBAAa,mBAAmB,cAAc,UAAU,CAAC;AACzD;AAAA,IACF,KAAK;AACH,mBAAa,YAAY;AACzB;AAAA,IACF,KAAK;AACH,mBAAa,YAAY;AACzB;AAAA,IACF,KAAK;AACH,mBAAa,YAAY;AACzB;AAAA,EACJ;AAEA,MAAI,iBAAiB,kBAAkB;AACrC,iBAAa,YAAY,gBAAgB,QAAQ;AAAA,EACnD;AAEA,MAAI,iBAAiB,kBAAkB;AACrC,iBAAa,YAAY;AAAA,EAC3B;AAEA,SAAO;AACT;AAOA,SAAS,uBACP,OACA,UACA,qBACS;AACT,QAAM,eAAe,gBAAgB;AACrC,QAAM,gBAAgB,aAAa,MAAM,KAAK;AAC9C,QAAM,gBAAgB;AACtB,SACE,UAAU,OACR,UAAU,UAAU,UAAU,YAAY,YAC3C,CAAC,MAAM,aAAa,KAAK,YAAY,CAAC,uBACtC,cAAc,KAAK,KAAK,KAAK,YAAY,CAAC,uBAC1C,MAAM,OAAO,CAAC,MAAM,OAAO;AAEhC;AAEA,SAAS,eAAe;AAAA,EACtB,OAAO;AAAA,EACP;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,GA0BW;AACT,MAAI,QAAQ;AACZ,MAAI,UAAU,QAAW;AACvB,WAAO;AAAA,EACT;AAEA,MAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,QAAI,iBAAiB;AAGrB,UAAM,QAAQ,CAAC,MAAM,UAAU;AAC7B,aAAQ,iBAAiB;AAAA,QACvB;AAAA,QACA,aAAa,UAAU,IACnB,GAAG,cAAc,GAAG,SAAS,KAC7B;AAAA,MACN;AAAA,IACF,CAAC;AAED,WAAO;AAAA,EACT;AAEA,MAAI,WAAW;AAEb,QAAI,qBAAqB,cAAc,qBAAqB,aAAa;AACvE,kBAAY,UAAU,WAAW,kBAAkB,EAAE;AAAA,IACvD;AAGA,QAAI,qBAAqB,cAAc,qBAAqB,eAAe;AACzE,kBAAY,UAAU,WAAW,iBAAiB,EAAE;AAAA,IACtD;AAEA,WAAO;AAAA,EACT;AAEA,UAAQ,GAAG,KAAK;AAGhB,MAAI,aAAa,SAAS;AACxB,QAAI,CAAC,YAAY;AACf,aAAO;AAAA,IACT;AAEA,WAAO,MAAM,WAAW,OAAO,MAAM;AAAA,EACvC;AAEA,QAAM,eAAe;AAAA,IACnB;AAAA,IACA,aAAa;AAAA,IACb;AAAA,EACF;AAIA,UAAQ,MAAM,WAAW,OAAO,MAAM;AAGtC,UAAQ,MAAM,WAAW,MAAM,KAAK;AAGpC,QAAM,+BAA+B;AACrC,UAAQ,MAAM,WAAW,8BAA8B,KAAK;AAI5D,QAAM,0BACJ;AAEF,MAAI,wBAAwB,KAAK,KAAK,KAAK,cAAc;AACvD,WAAO,IAAI,KAAK;AAAA,EAClB;AAEA,SAAO;AACT;AAEA,SAAS,gCACP,OAAsD,QACtD,kBAA0B,IAClB;AACR,MAAI,CAAC,MAAM;AACT,WAAO;AAAA,EACT;AAEA,UAAQ,KAAK,MAAM;AAAA,IACjB,KAAK,SAAS;AACZ,UAAI,cAAc;AAElB,UAAI,KAAK,UAAU;AACjB,sBAAc;AAAA,MAChB;AAEA,YAAM,cAAc,eAAe;AAAA,QACjC,OAAO,KAAK;AAAA,QACZ,UAAU,KAAK;AAAA,QACf,WAAW,KAAK,0BACZ,IAAI,KAAK,eAAe,KACxB;AAAA,MACN,CAAC;AAED,oBACE,cACA,cACA,GACE,KAAK,SAAS,WAAW,KAAK,KAAK,0BAC/B,MAAM,KAAK,kBACX,EACN;AAEF,UAAI,KAAK,UAAU;AACjB,cAAM,YAAY,KAAK,SAAS,KAAK,SAAS,SAAS,CAAC;AAGxD,YACE,EACE,aACA,UAAU,SAAS,WACnB,UAAU,UAAU,MACpB,KAAK,SAAS,WAAW,IAE3B;AACA,yBAAe;AAAA,QACjB;AAAA,MACF;AAEA,wBAAkB,gBAAgB,iBAAiB,WAAW;AAE9D;AAAA,IACF;AAAA,IACA,KAAK;AAEH,UAAI,KAAK,UAAU,MAAM;AACvB,0BAAkB;AAAA,UAChB;AAAA,UACA,eAAe;AAAA,YACb,OAAO,KAAK;AAAA,YACZ,WAAW,KAAK;AAAA,YAChB,UAAU,KAAK;AAAA,UACjB,CAAC;AAAA,QACH;AAAA,MACF;AACA;AAAA,IACF,KAAK,aAAa;AAChB,UAAI,YAAY;AAChB,YAAM,EAAE,KAAK,oBAAoB,MAAM,IAAI;AAE3C,UAAI,OAAO,IAAI,SAAS,YAAY;AAClC,oBAAY,GAAG,IAAI,KAAK,GAAG,sBAAsB,QAAQ,MAAM,EAAE;AAAA,MACnE,WAAW,KAAK;AACd,oBAAY,GAAG,eAAe;AAAA,UAC5B,OAAO,IAAI;AAAA,UACX,WAAW,IAAI;AAAA,UACf,UAAU,IAAI;AAAA,UACd,YAAY,EAAE,sBAAsB;AAAA,QACtC,CAAC,CAAC,GAAG,sBAAsB,QAAQ,MAAM,EAAE;AAAA,MAC7C;AAEA,UAAI,eAAe,EAAE,WAAW,IAAI,kBAAkB,GAAG;AAEzD,UAAI,oBAAoB;AACtB,uBAAe;AAAA,UACb,mBAAmB;AAAA,UACnB,mBAAmB;AAAA,QACrB;AACA,oBAAY,GAAG,SAAS,GAAG,aAAa,SAAS,GAAG,QAAQ,MAAM,EAAE;AAAA,MACtE;AAEA,UAAI,OAAO;AACT,cAAM,MACJ,MAAM,SAAS,aACX,GAAG,MAAM,KAAK,GAAG,MAAM,IAAI,KAC3B,MAAM;AAEZ,cAAM,cAAc,eAAe;AAAA,UACjC,OAAO;AAAA,UACP,WAAW,MAAM;AAAA,UACjB,UAAU,MAAM;AAAA,UAChB,kBAAkB,aAAa;AAAA,UAC/B,WAAW;AAAA,QACb,CAAC;AAED,YACE,MAAM,SAAS,UACd,MAAM,SAAS,WAAW,MAAM,QAAQ,GAAG,GAC5C;AACA,sBAAY,GAAG,SAAS,IAAI,WAAW;AAAA,QACzC,WAAW,MAAM,SAAS,SAAS;AACjC,sBAAY,YAAY;AAAA,QAC1B,OAAO;AACL,sBACE,YACA,GACE,aAAa,qBAAqB,cAClC,aAAa,qBAAqB,cAC9B,MACA,EACN,KACA,cACA,GACE,aAAa,qBAAqB,cAClC,aAAa,qBAAqB,gBAC9B,MACA,EACN;AAAA,QACJ;AAAA,MACF;AAEA,wBAAkB,gBAAgB,iBAAiB,SAAS;AAC5D;AAAA,IACF;AAAA,IACA,KAAK,YAAY;AACf,wBAAkB,gBAAgB,iBAAiB,KAAK,KAAK;AAC7D;AAAA,IACF;AAAA,IACA,KAAK,YAAY;AACf,wBAAkB;AAAA,QAChB;AAAA,QACA,GAAG,KAAK,KAAK,GAAG,KAAK,IAAI;AAAA,MAC3B;AACA;AAAA,IACF;AAAA,IACA;AACE,wBAAkB;AAAA,QAChB;AAAA,QACA,eAAe;AAAA,UACb,OAAO,KAAK;AAAA,UACZ,WAAW,KAAK;AAAA,UAChB,UAAU,KAAK;AAAA,QACjB,CAAC;AAAA,MACH;AACA;AAAA,EACJ;AAEA,SAAO;AACT;AAEA,SAAS,gBAAgB,cAAsB,iBAAyB;AACtE,MAAI,iBAAiB;AACnB,UAAM,eAAe,iBAAiB,MAAM,iBAAiB;AAC7D,WAAO,GAAG,YAAY,GAAG,eAAe,KAAK,GAAG,GAAG,eAAe;AAAA,EACpE;AACA,SAAO;AACT;",
+  "sourcesContent": ["import { getNumberParser } from '../../parser/getNumberParser.js';\nimport type {\n  SimpleFilterFieldNode,\n  SimpleFilterFieldTree,\n} from '../../types/conversion-tree-nodes.js';\n/**\n * Conversion util that converts a filter field tree into a string.\n * @param tree - Filter field tree\n * @public\n */\nexport function convertFilterFieldTreeToString(\n  tree?: SimpleFilterFieldTree,\n): string {\n  return _convertFilterFieldTreeToString(tree, '');\n}\n\nfunction getOperatorInfo(\n  operatorValue: string,\n  operatorType: string,\n): {\n  textValue: string;\n  positionOperator: string;\n} {\n  const operatorInfo = {\n    textValue: operatorValue,\n    positionOperator: '',\n  };\n\n  switch (operatorValue) {\n    case 'ends-with':\n    case 'starts-with':\n    case 'contains':\n      operatorInfo.textValue = '=';\n      operatorInfo.positionOperator = operatorValue;\n      break;\n    case 'not-ends-with':\n    case 'not-starts-with':\n    case 'not-contains':\n      operatorInfo.textValue = '!=';\n      operatorInfo.positionOperator = operatorValue.substring(4);\n      break;\n    case 'matches-wildcard':\n      operatorInfo.textValue = '=';\n      break;\n    case 'not-matches-wildcard':\n      operatorInfo.textValue = '!=';\n      break;\n    case 'matches-phrase':\n      operatorInfo.textValue = '~';\n      break;\n    case 'not-matches-phrase':\n      operatorInfo.textValue = '!~';\n      break;\n    case 'search':\n      operatorInfo.textValue = '* ~';\n      break;\n  }\n\n  if (operatorType === 'ExistsOperator') {\n    operatorInfo.textValue = operatorValue ? '= *' : '!= *';\n  }\n\n  if (operatorType === 'SearchOperator') {\n    operatorInfo.textValue = '* ~';\n  }\n\n  return operatorInfo;\n}\n\n/**\n * check if the value has to be wrapped in quotes regardless if it contains a reserved character.\n * this is the case if it is either an empty string or if it is a boolean, number or duration but has\n * the type 'String' (then it has to be escaped, otherwise the type of the value would change)\n */\nfunction hasToBeWrappedInQuotes(\n  value: string,\n  isString: boolean, // whether the nodeType equals 'String'\n  hasPositionOperator: string | undefined,\n): boolean {\n  const numberParser = getNumberParser();\n  const valueAsNumber = numberParser.parse(value);\n  const durationRegex = /^\\d+(ns|ms|s|m|h|d)$/;\n  return (\n    value === '' ||\n    ((value === 'true' || value === 'false') && isString) ||\n    (!isNaN(valueAsNumber) && isString && !hasPositionOperator) ||\n    (durationRegex.test(value) && isString && !hasPositionOperator) ||\n    (value.charAt(0) === '$' && isString)\n  );\n}\n\nfunction getNestedValue({\n  value: _value,\n  textValue,\n  nodeType,\n  isFreeText,\n  positionOperator,\n  separator,\n  preserveWildcards,\n}: {\n  value: SimpleFilterFieldNode[] | undefined | string | number | boolean;\n  textValue?: string;\n  nodeType:\n    | 'Error'\n    | 'String'\n    | 'Variable'\n    | 'List'\n    | 'Key'\n    | 'JSONPath'\n    | 'Number'\n    | 'BigInt'\n    | 'Boolean'\n    | 'Duration'\n    | 'ComparisonOperator'\n    | 'IPAddress'\n    | 'UID'\n    | 'SmartscapeId'\n    | 'Timestamp'\n    | 'ExistsOperator'\n    | 'SearchOperator'\n    | 'InclusionOperator'\n    | 'Group';\n  isFreeText?: boolean;\n  positionOperator?: string;\n  separator?: string;\n  preserveWildcards?: boolean;\n}): string {\n  let value = _value;\n  if (value === undefined) {\n    return '';\n  }\n\n  if (Array.isArray(value)) {\n    let combinedString = '';\n\n    // Recursively convert all included nodes.\n    value.forEach((node, index) => {\n      return (combinedString = _convertFilterFieldTreeToString(\n        node,\n        separator && index !== 0\n          ? `${combinedString}${separator}`\n          : combinedString,\n      ));\n    });\n\n    return combinedString;\n  }\n\n  if (textValue) {\n    // Remove leading '*' or the star in '\"*' if position operator is 'contains' or 'ends-with'\n    if (positionOperator === 'contains' || positionOperator === 'ends-with') {\n      textValue = textValue.replaceAll(/(?<=^\")\\*|^\\*/g, '');\n    }\n\n    // Remove trailing '*' or the star in '*\"' if position operator is 'contains' or 'starts-with'\n    if (positionOperator === 'contains' || positionOperator === 'starts-with') {\n      textValue = textValue.replaceAll(/\\*(?=\"$)|\\*$/g, '');\n    }\n\n    return textValue;\n  }\n\n  value = `${value}`;\n\n  // If the node is an error, we don't escape any characters\n  if (nodeType === 'Error') {\n    if (!isFreeText) {\n      return value;\n    }\n\n    return value.replaceAll(/\\\\/g, '\\\\\\\\');\n  }\n\n  const wrapInQuotes = hasToBeWrappedInQuotes(\n    value,\n    nodeType === 'String',\n    positionOperator,\n  );\n\n  // Escape the escape character ('\\') with an escape character so it is included in the value, not just\n  // escaping the next character\n  value = value.replaceAll(/\\\\/g, '\\\\\\\\');\n\n  // Escape double quotes with an escape character as it cannot be escaped with double quotes\n  value = value.replaceAll(/\"/g, '\\\\\"');\n\n  // Escape '*' symbols with an escape character as it may change the meaning of the syntax tree if escaped with double quotes\n  // Unless preserveWildcards is true, in which case * is a wildcard and should not be escaped\n  if (!preserveWildcards) {\n    const positionOperatorInValueRegex = /\\*/g;\n    value = value.replaceAll(positionOperatorInValueRegex, '\\\\*');\n  }\n\n  // check if it contains any reserved characters\n  // https://regex101.com/r/iw2j1u/1\n  const reservedCharactersRegex =\n    /(?!^\\$)(?<!\\\\)(?:\\\\\\\\)*[,()!<>=\"$:[\\]~ ]|\\\\$/;\n\n  if (reservedCharactersRegex.test(value) || wrapInQuotes) {\n    return `\"${value}\"`;\n  }\n\n  return value;\n}\n\nfunction _convertFilterFieldTreeToString(\n  tree: SimpleFilterFieldTree | SimpleFilterFieldNode = undefined,\n  convertedString: string = '',\n): string {\n  if (!tree) {\n    return '';\n  }\n\n  switch (tree.type) {\n    case 'Group': {\n      let groupString = '';\n\n      if (tree.explicit) {\n        groupString = '(';\n      }\n\n      const childValues = getNestedValue({\n        value: tree.children,\n        nodeType: tree.type,\n        separator: tree.explicitLogicalOperator\n          ? ` ${tree.logicalOperator}`\n          : '',\n      });\n\n      groupString =\n        groupString +\n        childValues +\n        `${\n          tree.children.length === 1 && tree.explicitLogicalOperator\n            ? ' ' + tree.logicalOperator\n            : ''\n        }`;\n\n      if (tree.explicit) {\n        const lastChild = tree.children[tree.children.length - 1];\n\n        // if the group is not missing a closing bracket add one to the string\n        if (\n          !(\n            lastChild &&\n            lastChild.type === 'Error' &&\n            lastChild.value === '' &&\n            tree.children.length !== 1\n          )\n        ) {\n          groupString += ')';\n        }\n      }\n\n      convertedString = addNodeToString(convertedString, groupString);\n\n      break;\n    }\n    case 'Error':\n      // if it is an empty group error the brackets were already added when handling the group\n      if (tree.value !== '()') {\n        convertedString = addNodeToString(\n          convertedString,\n          getNestedValue({\n            value: tree.value,\n            textValue: tree.textValue,\n            nodeType: tree.type,\n          }),\n        );\n      }\n      break;\n    case 'Statement': {\n      let statement = '';\n      const { key, comparisonOperator, value } = tree;\n\n      if (key && key.type === 'JSONPath') {\n        statement = `${key.value}${comparisonOperator || value ? ' ' : ''}`;\n      } else if (key) {\n        statement = `${getNestedValue({\n          value: key.value,\n          textValue: key.textValue,\n          nodeType: key.type,\n          isFreeText: !(comparisonOperator ?? value),\n        })}${comparisonOperator || value ? ' ' : ''}`;\n      }\n\n      let operatorInfo = { textValue: '', positionOperator: '' };\n\n      if (comparisonOperator) {\n        operatorInfo = getOperatorInfo(\n          comparisonOperator.value as string,\n          comparisonOperator.type,\n        );\n        statement = `${statement}${operatorInfo.textValue}${value ? ' ' : ''}`;\n      }\n\n      if (value) {\n        const val =\n          value.type === 'Duration'\n            ? `${value.value}${value.unit}`\n            : value.value;\n\n        // For matches-wildcard / not-matches-wildcard, preserve * in values without textValue\n        const shouldPreserveWildcards =\n          comparisonOperator?.value === 'matches-wildcard' ||\n          comparisonOperator?.value === 'not-matches-wildcard';\n\n        const childValues = getNestedValue({\n          value: val,\n          textValue: value.textValue,\n          nodeType: value.type,\n          positionOperator: operatorInfo.positionOperator,\n          separator: ',',\n          preserveWildcards: shouldPreserveWildcards,\n        });\n\n        if (\n          value.type === 'List' ||\n          (value.type === 'Error' && Array.isArray(val))\n        ) {\n          statement = `${statement}(${childValues})`;\n        } else if (value.type === 'Error') {\n          statement = statement + childValues;\n        } else {\n          statement =\n            statement +\n            `${\n              operatorInfo.positionOperator === 'contains' ||\n              operatorInfo.positionOperator === 'ends-with'\n                ? '*'\n                : ''\n            }` +\n            childValues +\n            `${\n              operatorInfo.positionOperator === 'contains' ||\n              operatorInfo.positionOperator === 'starts-with'\n                ? '*'\n                : ''\n            }`;\n        }\n      }\n\n      convertedString = addNodeToString(convertedString, statement);\n      break;\n    }\n    case 'JSONPath': {\n      convertedString = addNodeToString(convertedString, tree.value);\n      break;\n    }\n    case 'Duration': {\n      convertedString = addNodeToString(\n        convertedString,\n        `${tree.value}${tree.unit}`,\n      );\n      break;\n    }\n    default:\n      convertedString = addNodeToString(\n        convertedString,\n        getNestedValue({\n          value: tree.value,\n          textValue: tree.textValue,\n          nodeType: tree.type,\n        }),\n      );\n      break;\n  }\n\n  return convertedString;\n}\n\nfunction addNodeToString(sourceString: string, insertionString: string) {\n  if (insertionString) {\n    const firstElement = sourceString === '' || sourceString === '(';\n    return `${sourceString}${firstElement ? '' : ' '}${insertionString}`;\n  }\n  return sourceString;\n}\n"],
+  "mappings": "AAAA,SAAS,uBAAuB;AAUzB,SAAS,+BACd,MACQ;AACR,SAAO,gCAAgC,MAAM,EAAE;AACjD;AAEA,SAAS,gBACP,eACA,cAIA;AACA,QAAM,eAAe;AAAA,IACnB,WAAW;AAAA,IACX,kBAAkB;AAAA,EACpB;AAEA,UAAQ,eAAe;AAAA,IACrB,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AACH,mBAAa,YAAY;AACzB,mBAAa,mBAAmB;AAChC;AAAA,IACF,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AACH,mBAAa,YAAY;AACzB,mBAAa,mBAAmB,cAAc,UAAU,CAAC;AACzD;AAAA,IACF,KAAK;AACH,mBAAa,YAAY;AACzB;AAAA,IACF,KAAK;AACH,mBAAa,YAAY;AACzB;AAAA,IACF,KAAK;AACH,mBAAa,YAAY;AACzB;AAAA,IACF,KAAK;AACH,mBAAa,YAAY;AACzB;AAAA,IACF,KAAK;AACH,mBAAa,YAAY;AACzB;AAAA,EACJ;AAEA,MAAI,iBAAiB,kBAAkB;AACrC,iBAAa,YAAY,gBAAgB,QAAQ;AAAA,EACnD;AAEA,MAAI,iBAAiB,kBAAkB;AACrC,iBAAa,YAAY;AAAA,EAC3B;AAEA,SAAO;AACT;AAOA,SAAS,uBACP,OACA,UACA,qBACS;AACT,QAAM,eAAe,gBAAgB;AACrC,QAAM,gBAAgB,aAAa,MAAM,KAAK;AAC9C,QAAM,gBAAgB;AACtB,SACE,UAAU,OACR,UAAU,UAAU,UAAU,YAAY,YAC3C,CAAC,MAAM,aAAa,KAAK,YAAY,CAAC,uBACtC,cAAc,KAAK,KAAK,KAAK,YAAY,CAAC,uBAC1C,MAAM,OAAO,CAAC,MAAM,OAAO;AAEhC;AAEA,SAAS,eAAe;AAAA,EACtB,OAAO;AAAA,EACP;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,GA2BW;AACT,MAAI,QAAQ;AACZ,MAAI,UAAU,QAAW;AACvB,WAAO;AAAA,EACT;AAEA,MAAI,MAAM,QAAQ,KAAK,GAAG;AACxB,QAAI,iBAAiB;AAGrB,UAAM,QAAQ,CAAC,MAAM,UAAU;AAC7B,aAAQ,iBAAiB;AAAA,QACvB;AAAA,QACA,aAAa,UAAU,IACnB,GAAG,cAAc,GAAG,SAAS,KAC7B;AAAA,MACN;AAAA,IACF,CAAC;AAED,WAAO;AAAA,EACT;AAEA,MAAI,WAAW;AAEb,QAAI,qBAAqB,cAAc,qBAAqB,aAAa;AACvE,kBAAY,UAAU,WAAW,kBAAkB,EAAE;AAAA,IACvD;AAGA,QAAI,qBAAqB,cAAc,qBAAqB,eAAe;AACzE,kBAAY,UAAU,WAAW,iBAAiB,EAAE;AAAA,IACtD;AAEA,WAAO;AAAA,EACT;AAEA,UAAQ,GAAG,KAAK;AAGhB,MAAI,aAAa,SAAS;AACxB,QAAI,CAAC,YAAY;AACf,aAAO;AAAA,IACT;AAEA,WAAO,MAAM,WAAW,OAAO,MAAM;AAAA,EACvC;AAEA,QAAM,eAAe;AAAA,IACnB;AAAA,IACA,aAAa;AAAA,IACb;AAAA,EACF;AAIA,UAAQ,MAAM,WAAW,OAAO,MAAM;AAGtC,UAAQ,MAAM,WAAW,MAAM,KAAK;AAIpC,MAAI,CAAC,mBAAmB;AACtB,UAAM,+BAA+B;AACrC,YAAQ,MAAM,WAAW,8BAA8B,KAAK;AAAA,EAC9D;AAIA,QAAM,0BACJ;AAEF,MAAI,wBAAwB,KAAK,KAAK,KAAK,cAAc;AACvD,WAAO,IAAI,KAAK;AAAA,EAClB;AAEA,SAAO;AACT;AAEA,SAAS,gCACP,OAAsD,QACtD,kBAA0B,IAClB;AACR,MAAI,CAAC,MAAM;AACT,WAAO;AAAA,EACT;AAEA,UAAQ,KAAK,MAAM;AAAA,IACjB,KAAK,SAAS;AACZ,UAAI,cAAc;AAElB,UAAI,KAAK,UAAU;AACjB,sBAAc;AAAA,MAChB;AAEA,YAAM,cAAc,eAAe;AAAA,QACjC,OAAO,KAAK;AAAA,QACZ,UAAU,KAAK;AAAA,QACf,WAAW,KAAK,0BACZ,IAAI,KAAK,eAAe,KACxB;AAAA,MACN,CAAC;AAED,oBACE,cACA,cACA,GACE,KAAK,SAAS,WAAW,KAAK,KAAK,0BAC/B,MAAM,KAAK,kBACX,EACN;AAEF,UAAI,KAAK,UAAU;AACjB,cAAM,YAAY,KAAK,SAAS,KAAK,SAAS,SAAS,CAAC;AAGxD,YACE,EACE,aACA,UAAU,SAAS,WACnB,UAAU,UAAU,MACpB,KAAK,SAAS,WAAW,IAE3B;AACA,yBAAe;AAAA,QACjB;AAAA,MACF;AAEA,wBAAkB,gBAAgB,iBAAiB,WAAW;AAE9D;AAAA,IACF;AAAA,IACA,KAAK;AAEH,UAAI,KAAK,UAAU,MAAM;AACvB,0BAAkB;AAAA,UAChB;AAAA,UACA,eAAe;AAAA,YACb,OAAO,KAAK;AAAA,YACZ,WAAW,KAAK;AAAA,YAChB,UAAU,KAAK;AAAA,UACjB,CAAC;AAAA,QACH;AAAA,MACF;AACA;AAAA,IACF,KAAK,aAAa;AAChB,UAAI,YAAY;AAChB,YAAM,EAAE,KAAK,oBAAoB,MAAM,IAAI;AAE3C,UAAI,OAAO,IAAI,SAAS,YAAY;AAClC,oBAAY,GAAG,IAAI,KAAK,GAAG,sBAAsB,QAAQ,MAAM,EAAE;AAAA,MACnE,WAAW,KAAK;AACd,oBAAY,GAAG,eAAe;AAAA,UAC5B,OAAO,IAAI;AAAA,UACX,WAAW,IAAI;AAAA,UACf,UAAU,IAAI;AAAA,UACd,YAAY,EAAE,sBAAsB;AAAA,QACtC,CAAC,CAAC,GAAG,sBAAsB,QAAQ,MAAM,EAAE;AAAA,MAC7C;AAEA,UAAI,eAAe,EAAE,WAAW,IAAI,kBAAkB,GAAG;AAEzD,UAAI,oBAAoB;AACtB,uBAAe;AAAA,UACb,mBAAmB;AAAA,UACnB,mBAAmB;AAAA,QACrB;AACA,oBAAY,GAAG,SAAS,GAAG,aAAa,SAAS,GAAG,QAAQ,MAAM,EAAE;AAAA,MACtE;AAEA,UAAI,OAAO;AACT,cAAM,MACJ,MAAM,SAAS,aACX,GAAG,MAAM,KAAK,GAAG,MAAM,IAAI,KAC3B,MAAM;AAGZ,cAAM,0BACJ,oBAAoB,UAAU,sBAC9B,oBAAoB,UAAU;AAEhC,cAAM,cAAc,eAAe;AAAA,UACjC,OAAO;AAAA,UACP,WAAW,MAAM;AAAA,UACjB,UAAU,MAAM;AAAA,UAChB,kBAAkB,aAAa;AAAA,UAC/B,WAAW;AAAA,UACX,mBAAmB;AAAA,QACrB,CAAC;AAED,YACE,MAAM,SAAS,UACd,MAAM,SAAS,WAAW,MAAM,QAAQ,GAAG,GAC5C;AACA,sBAAY,GAAG,SAAS,IAAI,WAAW;AAAA,QACzC,WAAW,MAAM,SAAS,SAAS;AACjC,sBAAY,YAAY;AAAA,QAC1B,OAAO;AACL,sBACE,YACA,GACE,aAAa,qBAAqB,cAClC,aAAa,qBAAqB,cAC9B,MACA,EACN,KACA,cACA,GACE,aAAa,qBAAqB,cAClC,aAAa,qBAAqB,gBAC9B,MACA,EACN;AAAA,QACJ;AAAA,MACF;AAEA,wBAAkB,gBAAgB,iBAAiB,SAAS;AAC5D;AAAA,IACF;AAAA,IACA,KAAK,YAAY;AACf,wBAAkB,gBAAgB,iBAAiB,KAAK,KAAK;AAC7D;AAAA,IACF;AAAA,IACA,KAAK,YAAY;AACf,wBAAkB;AAAA,QAChB;AAAA,QACA,GAAG,KAAK,KAAK,GAAG,KAAK,IAAI;AAAA,MAC3B;AACA;AAAA,IACF;AAAA,IACA;AACE,wBAAkB;AAAA,QAChB;AAAA,QACA,eAAe;AAAA,UACb,OAAO,KAAK;AAAA,UACZ,WAAW,KAAK;AAAA,UAChB,UAAU,KAAK;AAAA,QACjB,CAAC;AAAA,MACH;AACA;AAAA,EACJ;AAEA,SAAO;AACT;AAEA,SAAS,gBAAgB,cAAsB,iBAAyB;AACtE,MAAI,iBAAiB;AACnB,UAAM,eAAe,iBAAiB,MAAM,iBAAiB;AAC7D,WAAO,GAAG,YAAY,GAAG,eAAe,KAAK,GAAG,GAAG,eAAe;AAAA,EACpE;AACA,SAAO;AACT;",
   "names": []
 }

package/esm/filters/filter-field/utils/escape-suggestion.js

@@ -10,9 +10,13 @@ function escapeSuggestion(value) {
   if (value.startsWith("$") && new RegExp(IS_VARIABLE_REGEX).exec(value)) {
     return value;
   }
-  const isSuggestionEscaped = new RegExp(/^"(?:[^"\\]|\\")*"$/).exec(value);
+  const isSuggestionEscaped = new RegExp(/^"(?:[^"\\]|\\.)*(?:"|\\")$/).exec(
+    value
+  );
   if (isSuggestionEscaped) {
-    return value;
+    const inner = value.slice(1, -1);
+    const escapedInner = inner.replace(/(?<!\\)(?:\\\\)*\*/g, "\\*");
+    return `"${escapedInner}"`;
   }
   const matches = new RegExp(NEEDS_ESCAPING_REGEX, "g").exec(value);
   if (matches) {

package/esm/filters/filter-field/utils/escape-suggestion.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../../../../src/filters/filter-field/utils/escape-suggestion.ts"],
-  "sourcesContent": ["// Regex that matches all words which are properly defined variable names\n// (Case in-sensitive, alphanumeric, optionally split by \"_\", or \".\")\nconst IS_VARIABLE_REGEX = /^\\$[a-zA-Z]+[a-zA-Z0-9]*(?:[_.][a-zA-Z0-9]+)*$/g;\n\nconst BASE_RESERVED_CHARACTERS = ' *\\\\()!<>=\"~';\nexport const RESERVED_CHARACTERS = `${BASE_RESERVED_CHARACTERS}\\\\\\\\`;\n\n/**\n * Regex that matches all characters that need to be escaped, but are not.\n * The backslash needs to be excluded in the BASE_RESERVED_CHARACTERS to not get\n * overlapping matches.\n * E.g. foo = \\*\n * Should not match, but would if we included the backslash in the first character set.\n * Regex + Javascript string escaping = Fun with backslashes.\n * https://regex101.com/r/gPeWnE\n * @internal\n */\nexport const NEEDS_ESCAPING_REGEX = `(?<!\\\\\\\\)(?:\\\\\\\\\\\\\\\\)*[${BASE_RESERVED_CHARACTERS}]|(\\\\\\\\$)`;\n\n/**\n * Regex that matches all escaped characters, including the escape character and escaped character.\n * https://regex101.com/r/LNo0qJ/1\n * @internal\n */\nexport const ESCAPED_CHARACTERS_REGEX = /\\\\(?:.)/g;\n\n/**\n * Escapes a suggestion value by wrapping it in double quotes if it contains\n * reserved characters that need escaping.\n *\n * @param value - The suggestion value to escape.\n * @returns The escaped suggestion value, wrapped in double quotes if necessary.\n * @public\n */\nexport function escapeSuggestion(value: string): string {\n  // A standalone asterisk (position operator) and exists operators are the\n  // only suggestions that should not be escaped automatically.\n  if (value === '*' || value === '= *' || value === '!= *') {\n    return value;\n  }\n\n  // Properly defined variables should not get escaped\n  if (value.startsWith('$') && new RegExp(IS_VARIABLE_REGEX).exec(value)) {\n    return value;\n  }\n\n  // Regex to check if the string is already escaped (also checking for escaped double quotes inside the string)\n  // https://regex101.com/r/8SXgGW/1\n  const isSuggestionEscaped = new RegExp(/^\"(?:[^\"\\\\]|\\\\\")*\"$/).exec(value);\n\n  if (isSuggestionEscaped) {\n    return value;\n  }\n\n  const matches = new RegExp(NEEDS_ESCAPING_REGEX, 'g').exec(value);\n\n  // If the regex matches, there is at least one character in the applied suggestion that\n  // needs to be escaped, but is not. In this case, we wrap the whole suggestion in\n  // doublequotes. Doublequotes occurring in the applied value that are not yet escaped are\n  // escaped with a backslash to not close the string. A single trailing backslash (\\) is also\n  // escaped to avoid ending the string with an unescaped backslash. It would not be necessary to\n  // wrap 'te\\\"st' in doublequotes, since the included doublequote is already escaped by a\n  // backslash. To not overcomplicate the logic, we still wrap the whole value.\n  if (matches) {\n    return `\"${value\n      .replace(/(?<!\\\\)(?:\\\\\\\\)*\"/g, '\\\\\"')\n      .replace(/(?<!\\\\)(?:\\\\\\\\)*\\*/g, '\\\\*')\n      .replace(/(?<!\\\\)(?:\\\\\\\\)*\\\\$/g, '$&\\\\')}\"`;\n  }\n\n  return value;\n}\n"],
-  "mappings": "AAEA,MAAM,oBAAoB;AAE1B,MAAM,2BAA2B;AAC1B,MAAM,sBAAsB,GAAG,wBAAwB;AAYvD,MAAM,uBAAuB,0BAA0B,wBAAwB;AAO/E,MAAM,2BAA2B;AAUjC,SAAS,iBAAiB,OAAuB;AAGtD,MAAI,UAAU,OAAO,UAAU,SAAS,UAAU,QAAQ;AACxD,WAAO;AAAA,EACT;AAGA,MAAI,MAAM,WAAW,GAAG,KAAK,IAAI,OAAO,iBAAiB,EAAE,KAAK,KAAK,GAAG;AACtE,WAAO;AAAA,EACT;AAIA,QAAM,sBAAsB,IAAI,OAAO,qBAAqB,EAAE,KAAK,KAAK;AAExE,MAAI,qBAAqB;AACvB,WAAO;AAAA,EACT;AAEA,QAAM,UAAU,IAAI,OAAO,sBAAsB,GAAG,EAAE,KAAK,KAAK;AAShE,MAAI,SAAS;AACX,WAAO,IAAI,MACR,QAAQ,sBAAsB,KAAK,EACnC,QAAQ,uBAAuB,KAAK,EACpC,QAAQ,wBAAwB,MAAM,CAAC;AAAA,EAC5C;AAEA,SAAO;AACT;",
+  "sourcesContent": ["// Regex that matches all words which are properly defined variable names\n// (Case in-sensitive, alphanumeric, optionally split by \"_\", or \".\")\nconst IS_VARIABLE_REGEX = /^\\$[a-zA-Z]+[a-zA-Z0-9]*(?:[_.][a-zA-Z0-9]+)*$/g;\n\nconst BASE_RESERVED_CHARACTERS = ' *\\\\()!<>=\"~';\nexport const RESERVED_CHARACTERS = `${BASE_RESERVED_CHARACTERS}\\\\\\\\`;\n\n/**\n * Regex that matches all characters that need to be escaped, but are not.\n * The backslash needs to be excluded in the BASE_RESERVED_CHARACTERS to not get\n * overlapping matches.\n * E.g. foo = \\*\n * Should not match, but would if we included the backslash in the first character set.\n * Regex + Javascript string escaping = Fun with backslashes.\n * https://regex101.com/r/gPeWnE\n * @internal\n */\nexport const NEEDS_ESCAPING_REGEX = `(?<!\\\\\\\\)(?:\\\\\\\\\\\\\\\\)*[${BASE_RESERVED_CHARACTERS}]|(\\\\\\\\$)`;\n\n/**\n * Regex that matches all escaped characters, including the escape character and escaped character.\n * https://regex101.com/r/LNo0qJ/1\n * @internal\n */\nexport const ESCAPED_CHARACTERS_REGEX = /\\\\(?:.)/g;\n\n/**\n * Escapes a suggestion value by wrapping it in double quotes if it contains\n * reserved characters that need escaping.\n *\n * @param value - The suggestion value to escape.\n * @returns The escaped suggestion value, wrapped in double quotes if necessary.\n * @public\n */\nexport function escapeSuggestion(value: string): string {\n  // A standalone asterisk (position operator) and exists operators are the\n  // only suggestions that should not be escaped automatically.\n  if (value === '*' || value === '= *' || value === '!= *') {\n    return value;\n  }\n\n  // Properly defined variables should not get escaped\n  if (value.startsWith('$') && new RegExp(IS_VARIABLE_REGEX).exec(value)) {\n    return value;\n  }\n\n  // Regex to check if the string is already escaped (also checking for escaped double quotes inside the string)\n  // https://regex101.com/r/8SXgGW/1\n  const isSuggestionEscaped = new RegExp(/^\"(?:[^\"\\\\]|\\\\.)*(?:\"|\\\\\")$/).exec(\n    value,\n  );\n\n  if (isSuggestionEscaped) {\n    // Already quoted \u2014 still escape any unescaped wildcards inside the string.\n    const inner = value.slice(1, -1);\n    const escapedInner = inner.replace(/(?<!\\\\)(?:\\\\\\\\)*\\*/g, '\\\\*');\n    return `\"${escapedInner}\"`;\n  }\n\n  const matches = new RegExp(NEEDS_ESCAPING_REGEX, 'g').exec(value);\n\n  // If the regex matches, there is at least one character in the applied suggestion that\n  // needs to be escaped, but is not. In this case, we wrap the whole suggestion in\n  // doublequotes. Doublequotes occurring in the applied value that are not yet escaped are\n  // escaped with a backslash to not close the string. A single trailing backslash (\\) is also\n  // escaped to avoid ending the string with an unescaped backslash. It would not be necessary to\n  // wrap 'te\\\"st' in doublequotes, since the included doublequote is already escaped by a\n  // backslash. To not overcomplicate the logic, we still wrap the whole value.\n  if (matches) {\n    return `\"${value\n      .replace(/(?<!\\\\)(?:\\\\\\\\)*\"/g, '\\\\\"')\n      .replace(/(?<!\\\\)(?:\\\\\\\\)*\\*/g, '\\\\*')\n      .replace(/(?<!\\\\)(?:\\\\\\\\)*\\\\$/g, '$&\\\\')}\"`;\n  }\n\n  return value;\n}\n"],
+  "mappings": "AAEA,MAAM,oBAAoB;AAE1B,MAAM,2BAA2B;AAC1B,MAAM,sBAAsB,GAAG,wBAAwB;AAYvD,MAAM,uBAAuB,0BAA0B,wBAAwB;AAO/E,MAAM,2BAA2B;AAUjC,SAAS,iBAAiB,OAAuB;AAGtD,MAAI,UAAU,OAAO,UAAU,SAAS,UAAU,QAAQ;AACxD,WAAO;AAAA,EACT;AAGA,MAAI,MAAM,WAAW,GAAG,KAAK,IAAI,OAAO,iBAAiB,EAAE,KAAK,KAAK,GAAG;AACtE,WAAO;AAAA,EACT;AAIA,QAAM,sBAAsB,IAAI,OAAO,6BAA6B,EAAE;AAAA,IACpE;AAAA,EACF;AAEA,MAAI,qBAAqB;AAEvB,UAAM,QAAQ,MAAM,MAAM,GAAG,EAAE;AAC/B,UAAM,eAAe,MAAM,QAAQ,uBAAuB,KAAK;AAC/D,WAAO,IAAI,YAAY;AAAA,EACzB;AAEA,QAAM,UAAU,IAAI,OAAO,sBAAsB,GAAG,EAAE,KAAK,KAAK;AAShE,MAAI,SAAS;AACX,WAAO,IAAI,MACR,QAAQ,sBAAsB,KAAK,EACnC,QAAQ,uBAAuB,KAAK,EACpC,QAAQ,wBAAwB,MAAM,CAAC;AAAA,EAC5C;AAEA,SAAO;AACT;",
   "names": []
 }

package/esm/filters/filter-field/utils/generate-errors-or-diagnostics.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../../../../src/filters/filter-field/utils/generate-errors-or-diagnostics.ts"],
-  "sourcesContent": ["import type { Diagnostic } from '@codemirror/lint';\nimport type { RangeSet } from '@codemirror/state';\nimport { RangeSetBuilder } from '@codemirror/state';\nimport type { Decoration, EditorView } from '@codemirror/view';\n\nimport { filterFieldErrorWrapperClass } from '../../../core/styles/diagnostic-tooltip.sty.js';\nimport { renderDiagnosticMessage } from '../../../core/utils/diagnostic-tooltip/render-diagnostic-message.js';\nimport { errorMark } from '../decorations/decoration-marks.js';\nimport {\n  pastingMode,\n  usedErrors,\n  type PastingInfo,\n} from '../editor-state-configs/editor-config.js';\nimport type { FilterFieldErrorMessages } from '../types/filter-field-error.js';\n\n/** @internal */\nexport function generateErrorsOrDiagnostics(\n  view: EditorView,\n): RangeSet<Decoration>;\n/** @internal */\nexport function generateErrorsOrDiagnostics(\n  view: EditorView,\n  messages?: FilterFieldErrorMessages,\n): Diagnostic[];\n/** @internal */\nexport function generateErrorsOrDiagnostics(\n  view: EditorView,\n  messages?: FilterFieldErrorMessages,\n): RangeSet<Decoration> | Diagnostic[] {\n  const builder = new RangeSetBuilder<Decoration>();\n  const diagnostics: Diagnostic[] = [];\n  const errorsStateField = view.state.field(usedErrors, false);\n  const pastingStateField = view?.state.field(pastingMode, false);\n\n  if (!errorsStateField || view.visibleRanges.length === 0) {\n    if (messages !== undefined) {\n      builder.finish();\n      return diagnostics;\n    }\n\n    return builder.finish();\n  }\n\n  for (const error of errorsStateField.errors) {\n    const {\n      range: { from, to },\n      decoration,\n      message: errorMessage,\n    } = error;\n    let message;\n    let messageDetails: string | string[] | undefined;\n\n    if (typeof errorMessage === 'string') {\n      message = errorMessage;\n    } else {\n      message = errorMessage.type;\n      messageDetails = errorMessage.details;\n    }\n\n    if (from <= view.visibleRanges[0].to && to <= view.visibleRanges[0].to) {\n      const showError = !isErrorInPastingRange(from, to, pastingStateField);\n\n      if (showError) {\n        builder.add(from, to, decoration ?? errorMark);\n      }\n\n      if (messages !== undefined) {\n        let errorMessage = message;\n        const errorType = messages[message as keyof FilterFieldErrorMessages];\n        if (errorType) {\n          if (typeof errorType === 'function') {\n            // eslint-disable-next-line @typescript-eslint/no-explicit-any -- The correct details type is always paired with the matching error type at runtime.\n            errorMessage = (errorType as (...args: any[]) => string)(\n              messageDetails,\n            );\n          } else {\n            errorMessage = errorType;\n          }\n        }\n\n        if (showError) {\n          diagnostics.push({\n            from,\n            to,\n            severity: 'error',\n            message: '',\n            // FilterField messages embed trusted, internally generated markup (syntax-colored\n            // operators), so they are rendered as HTML rather than escaped text.\n            renderMessage: renderDiagnosticMessage(\n              'error',\n              errorMessage,\n              filterFieldErrorWrapperClass,\n              { dangerouslyRenderHtml: true },\n            ),\n          });\n        }\n      }\n    }\n  }\n\n  if (messages !== undefined) {\n    builder.finish();\n    return diagnostics;\n  }\n\n  return builder.finish();\n}\n\nfunction isErrorInPastingRange(\n  errorFrom: number,\n  errorTo: number,\n  pastingStateField: PastingInfo | undefined,\n) {\n  if (!pastingStateField?.range || !pastingStateField.pastingInProgress) {\n    return false;\n  }\n\n  const pastingRangeFrom = pastingStateField.range.from;\n  const pastingRangeTo = pastingStateField.range.to;\n\n  return (\n    // Check if error starts inside the pasting range\n    // Check if error surrounds the pasting range\n    (errorFrom >= pastingRangeFrom && errorFrom <= pastingRangeTo) ||\n    // Check if error starts inside the pasting range\n    (errorTo >= pastingRangeFrom && errorTo <= pastingRangeFrom) ||\n    (errorFrom <= pastingRangeFrom && errorTo >= pastingRangeTo)\n  );\n}\n"],
+  "sourcesContent": ["import type { Diagnostic } from '@codemirror/lint';\nimport type { RangeSet } from '@codemirror/state';\nimport { RangeSetBuilder } from '@codemirror/state';\nimport type { Decoration, EditorView } from '@codemirror/view';\n\nimport { filterFieldErrorWrapperClass } from '../../../core/styles/diagnostic-tooltip.sty.js';\nimport { renderDiagnosticMessage } from '../../../core/utils/diagnostic-tooltip/render-diagnostic-message.js';\nimport { errorMark } from '../decorations/decoration-marks.js';\nimport {\n  pastingMode,\n  usedErrors,\n  type PastingInfo,\n} from '../editor-state-configs/editor-config.js';\nimport type { FilterFieldErrorMessages } from '../types/filter-field-error.js';\n\n/** @internal */\nexport function generateErrorsOrDiagnostics(\n  view: EditorView,\n): RangeSet<Decoration>;\n/** @internal */\nexport function generateErrorsOrDiagnostics(\n  view: EditorView,\n  messages?: FilterFieldErrorMessages,\n): Diagnostic[];\n/** @internal */\nexport function generateErrorsOrDiagnostics(\n  view: EditorView,\n  messages?: FilterFieldErrorMessages,\n): RangeSet<Decoration> | Diagnostic[] {\n  const builder = new RangeSetBuilder<Decoration>();\n  const diagnostics: Diagnostic[] = [];\n  const errorsStateField = view.state.field(usedErrors, false);\n  const pastingStateField = view?.state.field(pastingMode, false);\n\n  if (!errorsStateField || view.visibleRanges.length === 0) {\n    if (messages !== undefined) {\n      builder.finish();\n      return diagnostics;\n    }\n\n    return builder.finish();\n  }\n\n  for (const error of errorsStateField.errors) {\n    const {\n      range: { from, to },\n      decoration,\n      message: errorMessage,\n    } = error;\n    let message;\n    let messageDetails: string | string[] | undefined;\n\n    if (typeof errorMessage === 'string') {\n      message = errorMessage;\n    } else {\n      message = errorMessage.type;\n      messageDetails = errorMessage.details;\n    }\n\n    if (from <= view.visibleRanges[0].to && to <= view.visibleRanges[0].to) {\n      const showError = !isErrorInPastingRange(from, to, pastingStateField);\n\n      if (showError) {\n        builder.add(from, to, decoration ?? errorMark);\n      }\n\n      if (messages !== undefined) {\n        let errorMessage = message;\n        const errorType = messages[message as keyof FilterFieldErrorMessages];\n        if (errorType) {\n          if (typeof errorType === 'function') {\n            // oxlint-disable-next-line typescript/no-explicit-any -- The correct details type is always paired with the matching error type at runtime.\n            errorMessage = (errorType as (...args: any[]) => string)(\n              messageDetails,\n            );\n          } else {\n            errorMessage = errorType;\n          }\n        }\n\n        if (showError) {\n          diagnostics.push({\n            from,\n            to,\n            severity: 'error',\n            message: '',\n            // FilterField messages embed trusted, internally generated markup (syntax-colored\n            // operators), so they are rendered as HTML rather than escaped text.\n            renderMessage: renderDiagnosticMessage(\n              'error',\n              errorMessage,\n              filterFieldErrorWrapperClass,\n              { dangerouslyRenderHtml: true },\n            ),\n          });\n        }\n      }\n    }\n  }\n\n  if (messages !== undefined) {\n    builder.finish();\n    return diagnostics;\n  }\n\n  return builder.finish();\n}\n\nfunction isErrorInPastingRange(\n  errorFrom: number,\n  errorTo: number,\n  pastingStateField: PastingInfo | undefined,\n) {\n  if (!pastingStateField?.range || !pastingStateField.pastingInProgress) {\n    return false;\n  }\n\n  const pastingRangeFrom = pastingStateField.range.from;\n  const pastingRangeTo = pastingStateField.range.to;\n\n  return (\n    // Check if error starts inside the pasting range\n    // Check if error surrounds the pasting range\n    (errorFrom >= pastingRangeFrom && errorFrom <= pastingRangeTo) ||\n    // Check if error starts inside the pasting range\n    (errorTo >= pastingRangeFrom && errorTo <= pastingRangeFrom) ||\n    (errorFrom <= pastingRangeFrom && errorTo >= pastingRangeTo)\n  );\n}\n"],
   "mappings": "AAEA,SAAS,uBAAuB;AAGhC,SAAS,oCAAoC;AAC7C,SAAS,+BAA+B;AACxC,SAAS,iBAAiB;AAC1B;AAAA,EACE;AAAA,EACA;AAAA,OAEK;AAaA,SAAS,4BACd,MACA,UACqC;AACrC,QAAM,UAAU,IAAI,gBAA4B;AAChD,QAAM,cAA4B,CAAC;AACnC,QAAM,mBAAmB,KAAK,MAAM,MAAM,YAAY,KAAK;AAC3D,QAAM,oBAAoB,MAAM,MAAM,MAAM,aAAa,KAAK;AAE9D,MAAI,CAAC,oBAAoB,KAAK,cAAc,WAAW,GAAG;AACxD,QAAI,aAAa,QAAW;AAC1B,cAAQ,OAAO;AACf,aAAO;AAAA,IACT;AAEA,WAAO,QAAQ,OAAO;AAAA,EACxB;AAEA,aAAW,SAAS,iBAAiB,QAAQ;AAC3C,UAAM;AAAA,MACJ,OAAO,EAAE,MAAM,GAAG;AAAA,MAClB;AAAA,MACA,SAAS;AAAA,IACX,IAAI;AACJ,QAAI;AACJ,QAAI;AAEJ,QAAI,OAAO,iBAAiB,UAAU;AACpC,gBAAU;AAAA,IACZ,OAAO;AACL,gBAAU,aAAa;AACvB,uBAAiB,aAAa;AAAA,IAChC;AAEA,QAAI,QAAQ,KAAK,cAAc,CAAC,EAAE,MAAM,MAAM,KAAK,cAAc,CAAC,EAAE,IAAI;AACtE,YAAM,YAAY,CAAC,sBAAsB,MAAM,IAAI,iBAAiB;AAEpE,UAAI,WAAW;AACb,gBAAQ,IAAI,MAAM,IAAI,cAAc,SAAS;AAAA,MAC/C;AAEA,UAAI,aAAa,QAAW;AAC1B,YAAIA,gBAAe;AACnB,cAAM,YAAY,SAAS,OAAyC;AACpE,YAAI,WAAW;AACb,cAAI,OAAO,cAAc,YAAY;AAEnC,YAAAA,gBAAgB;AAAA,cACd;AAAA,YACF;AAAA,UACF,OAAO;AACL,YAAAA,gBAAe;AAAA,UACjB;AAAA,QACF;AAEA,YAAI,WAAW;AACb,sBAAY,KAAK;AAAA,YACf;AAAA,YACA;AAAA,YACA,UAAU;AAAA,YACV,SAAS;AAAA;AAAA;AAAA,YAGT,eAAe;AAAA,cACb;AAAA,cACAA;AAAA,cACA;AAAA,cACA,EAAE,uBAAuB,KAAK;AAAA,YAChC;AAAA,UACF,CAAC;AAAA,QACH;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,MAAI,aAAa,QAAW;AAC1B,YAAQ,OAAO;AACf,WAAO;AAAA,EACT;AAEA,SAAO,QAAQ,OAAO;AACxB;AAEA,SAAS,sBACP,WACA,SACA,mBACA;AACA,MAAI,CAAC,mBAAmB,SAAS,CAAC,kBAAkB,mBAAmB;AACrE,WAAO;AAAA,EACT;AAEA,QAAM,mBAAmB,kBAAkB,MAAM;AACjD,QAAM,iBAAiB,kBAAkB,MAAM;AAE/C;AAAA;AAAA;AAAA,IAGG,aAAa,oBAAoB,aAAa;AAAA,IAE9C,WAAW,oBAAoB,WAAW,oBAC1C,aAAa,oBAAoB,WAAW;AAAA;AAEjD;",
   "names": ["errorMessage"]
 }

package/esm/filters/filter-field/utils/get-suggestion-transaction.js

@@ -54,6 +54,7 @@ function getSuggestionTransaction(suggestionValue, range, shouldEscapeSuggestion
   let startsWithOperator = false;
   let endsWithOperator = false;
   let hasSpaceAfterQuotes = false;
+  let isWildcardOperatorSwitch = false;
   const followedByOpeningParenthesis = _isFollowedByOpeningBracket(
     editorState,
     head
@@ -74,9 +75,24 @@ function getSuggestionTransaction(suggestionValue, range, shouldEscapeSuggestion
     if (insertionStrategy === "replace-statement" || isExistsOperator && currentStatement.value && !followedByOpeningParenthesis || startsWithOperator) {
       nextSibling = nextStatement;
       replaceUntil = currentStatement.range.to;
+    } else if (isWildcardSuggestionWithValuePlaceholder && !isValueToken && range === void 0 && currentStatement.value) {
+      isWildcardOperatorSwitch = true;
+      nextSibling = nextStatement;
+      replaceUntil = currentStatement.value.range.to;
     }
     insertedValue = nextSibling || insertionStrategy === "insert" ? trimmedValue : appliedSuggestionValue;
     const containsOperator = startsWithOperator && endsWithOperator;
+    if (isWildcardOperatorSwitch && currentStatement.value) {
+      const leadingWildcard = suggestionValue.endsWith('*"');
+      const trailingWildcard = (trailing ?? "").endsWith('"*');
+      const wrappedValue = buildWildcardWrappedValue(
+        currentStatement.value.textValue,
+        leadingWildcard,
+        trailingWildcard
+      );
+      const operatorSign = suggestionValue.startsWith("!=") ? "!= " : "= ";
+      insertedValue = nextSibling ? `${operatorSign}${wrappedValue}` : `${operatorSign}${wrappedValue} `;
+    }
     if ((startsWithOperator || endsWithOperator) && insertionStrategy === "replace-token") {
       let { from, to } = {
         from: currentStatement.range.to,
@@ -192,7 +208,7 @@ function getSuggestionTransaction(suggestionValue, range, shouldEscapeSuggestion
   }
   insertionRange = getSortedRange(insertionRange);
   let anchor = insertionStrategy === "insert" ? head + insertedValue.length : Math.min(currentDocumentLength, insertionRange.from) + (nextSibling && !isLastListValue ? appliedSuggestionValue.length : insertedValue.length) + (insertionStrategy === "replace-token" ? +startsWithOperator : 0) + +hasSpaceAfterQuotes;
-  if (cursorBeforeTrailing || isWildcardSuggestionWithValuePlaceholder) {
+  if ((cursorBeforeTrailing || isWildcardSuggestionWithValuePlaceholder) && !isWildcardOperatorSwitch) {
     const trailingLength = trailing ? trailing.length : 0;
     anchor -= trailingLength + (autoEscapeSuggestion && !(isSuggestionWithWildcard || isWildcardSuggestionWithValuePlaceholder) ? 1 : 0);
   }
@@ -205,8 +221,9 @@ function getSuggestionTransaction(suggestionValue, range, shouldEscapeSuggestion
     },
     selection: {
       anchor,
-      // Select the value placeholder if inserting a wildcard suggestion with a placeholder
-      ...isWildcardSuggestionWithValuePlaceholder ? { head: anchor + 5 } : {}
+      // Select the value placeholder if inserting a wildcard suggestion with a placeholder.
+      // Skip when performing a wildcard operator switch — the value is already filled in.
+      ...!isWildcardOperatorSwitch && isWildcardSuggestionWithValuePlaceholder ? { head: anchor + 5 } : {}
       // 5 = 'value'.length;
     }
   };
@@ -249,6 +266,30 @@ function getSuggestionTransactionForInclusionOperatorSuggestion(suggestionValue,
     }
   };
 }
+function buildWildcardWrappedValue(textValue, leadingWildcard, trailingWildcard) {
+  let bare = textValue;
+  if (bare.startsWith('*"')) {
+    bare = `"${bare.slice(2)}`;
+  } else if (bare.startsWith("*")) {
+    bare = bare.slice(1);
+  }
+  if (bare.endsWith('*"')) {
+    bare = `${bare.slice(0, -2)}"`;
+  } else if (bare.endsWith("*")) {
+    bare = bare.slice(0, -1);
+  }
+  if (bare.startsWith('"') && bare.endsWith('"')) {
+    let content = bare.slice(1, -1);
+    if (content.startsWith("*")) {
+      content = content.slice(1);
+    }
+    if (content.endsWith("*")) {
+      content = content.slice(0, -1);
+    }
+    return `"${leadingWildcard ? "*" : ""}${content}${trailingWildcard ? "*" : ""}"`;
+  }
+  return `${leadingWildcard ? "*" : ""}${bare}${trailingWildcard ? "*" : ""}`;
+}
 function getSortedRange(range) {
   if (range.to < range.from) {
     return { from: range.to, to: range.from };

package/esm/filters/filter-field/utils/get-suggestion-transaction.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../../../../src/filters/filter-field/utils/get-suggestion-transaction.ts"],
-  "sourcesContent": ["import { syntaxTree } from '@codemirror/language';\nimport { EditorState } from '@codemirror/state';\n\nimport { escapeSuggestion } from './escape-suggestion.js';\nimport { getStatementStatus } from './get-statement-status.js';\nimport { getTextFromRange } from './get-text.js';\nimport { overlappingSuggestionRangeBrand } from './suggestions-utils/get-suggestions.js';\nimport {\n  getStatementCursorAtPosition,\n  hasNextSibling,\n  hasNextStatement,\n} from './tree-navigation.js';\nimport { isLogicalOperator } from './tree-node-guards.js';\nimport { filterFieldLanguageExtension } from '../parser/filterfield-language.js';\nimport type { FilterFieldSuggestionProps } from '../suggestions/Suggestion.types.js';\nimport type { FilterFieldSuggestionsContext } from '../suggestions/suggestions-extension.js';\nimport type {\n  FilterFieldNodeBase,\n  FilterFieldStatementNode,\n  FilterFieldValueNode,\n} from '../types/tree-nodes.js';\n\n/** @internal */\nexport function getSuggestionTransaction(\n  suggestionValue: string,\n  range: FilterFieldNodeBase['range'] | undefined,\n  shouldEscapeSuggestion: boolean | undefined,\n  trailing: string | undefined,\n  insertionStrategy: FilterFieldSuggestionProps['insertionStrategy'],\n  cursorBeforeTrailing: boolean | undefined,\n  suggestionsContext: FilterFieldSuggestionsContext,\n  editorState: EditorState,\n) {\n  const { token, currentStatement: _currentStatement } = suggestionsContext;\n  const currentSelection = editorState.selection;\n  const { head } = currentSelection.main;\n\n  let currentStatement = _currentStatement;\n  if (!currentStatement) {\n    currentStatement = {\n      type: 'Statement',\n      range: { from: token.range.from, to: token.range.to },\n    };\n  }\n\n  const autoEscapeSuggestion =\n    (insertionStrategy === 'replace-token' &&\n      shouldEscapeSuggestion === undefined) ||\n    shouldEscapeSuggestion;\n\n  const currentDocumentLength = editorState.doc.toString().length;\n\n  const isWildcardSuggestionWithValuePlaceholder = trailing?.includes('value');\n  const isInclusionOperatorSuggestion = ['in (', 'not in ('].includes(\n    suggestionValue,\n  ); // these values come from our defined defaultComparisonOperatorSuggestions values when we have autosuggestions\n  const isSuggestionWithWildcard = ['= *', '!= *'].includes(suggestionValue);\n\n  const nextStatement = hasNextStatement(head, editorState);\n\n  // Handle insertion of the inclusion operator suggestion separately,\n  // as we have to take care of potential existing values and brackets and\n  // always want to place the cursor right before the closing bracket so users\n  // can start/continue typing values.\n  if (isInclusionOperatorSuggestion && range === undefined) {\n    return getSuggestionTransactionForInclusionOperatorSuggestion(\n      suggestionValue,\n      currentStatement,\n      token,\n      trailing,\n      head,\n      currentDocumentLength,\n      editorState,\n      nextStatement,\n    );\n  }\n\n  const appliedSuggestionValue = `${\n    autoEscapeSuggestion && !isWildcardSuggestionWithValuePlaceholder\n      ? escapeSuggestion(suggestionValue)\n      : suggestionValue\n  }${trailing ?? ''}`;\n\n  const trimmedValue = appliedSuggestionValue.trimEnd();\n  const isExistsOperator = trimmedValue.match(/^(= \\*)$|^(!= \\*)$/);\n  const addSpace = appliedSuggestionValue.slice(-1) === ' ';\n\n  let insertedValue = appliedSuggestionValue;\n  let replaceFrom = token.range.from;\n  let replaceUntil = token.range.to;\n  let nextSibling = false;\n  let isLastListValue = false;\n  let startsWithOperator = false;\n  let endsWithOperator = false;\n  let hasSpaceAfterQuotes = false;\n\n  const followedByOpeningParenthesis = _isFollowedByOpeningBracket(\n    editorState,\n    head,\n  );\n\n  // If the token at the cursor position is a list, only replace single list values if the cursor\n  // is positioned inside the list's brackets.\n  if (\n    token.type === 'List' &&\n    head > token.range.from &&\n    head < token.range.to &&\n    insertionStrategy === 'replace-token'\n  ) {\n    replaceFrom = head;\n    replaceUntil = head;\n  }\n\n  const { value } = currentStatement ?? {};\n  const isValueToken =\n    token.range.from === value?.range.from &&\n    token.range.to === value?.range.to;\n\n  // If the current statement is undefined, it is definitely not followed by any\n  // other node and we want to automatically add the default trailing space\n  // (unless overridden) when applying a suggestion.\n  // If there is a statement, we want to override the added space in certain cases.\n  if (currentStatement) {\n    nextSibling = !nextStatement\n      ? hasNextSibling(head, editorState, { ignorePositionOperators: true })\n      : nextStatement;\n    startsWithOperator =\n      isValueToken &&\n      currentStatement.comparisonOperator?.type === 'ComparisonOperator' &&\n      (currentStatement.comparisonOperator.value === 'starts-with' ||\n        currentStatement.comparisonOperator.value === 'contains');\n    endsWithOperator =\n      isValueToken &&\n      currentStatement.comparisonOperator?.type === 'ComparisonOperator' &&\n      (currentStatement.comparisonOperator.value === 'ends-with' ||\n        currentStatement.comparisonOperator.value === 'contains');\n\n    if (nextSibling && insertionIsLastListValue(head, editorState)) {\n      // We need this flag to not move the cursor outside of the brackets when\n      // adding a value as the last value in a list. (e.g. a in (a|))\n      isLastListValue = true;\n    }\n\n    // If the applied suggestion is an exists operator (= * | != *), we want to also\n    // replace the value of the current filter statement.\n    // e.g.:\n    //   foo =| bar\n    //   insert \"= *\"\n    //   foo = *\n    if (\n      insertionStrategy === 'replace-statement' ||\n      (isExistsOperator &&\n        currentStatement.value &&\n        !followedByOpeningParenthesis) ||\n      startsWithOperator\n    ) {\n      nextSibling = nextStatement;\n      replaceUntil = currentStatement.range.to;\n    }\n\n    insertedValue =\n      nextSibling || insertionStrategy === 'insert'\n        ? trimmedValue\n        : appliedSuggestionValue;\n    const containsOperator = startsWithOperator && endsWithOperator;\n\n    // When replacing a value that has a starts-with operator, we want to replace\n    // the value while keeping the operator. If a space is supposed to be added, we\n    // have to add it after the position operator.\n    if (\n      (startsWithOperator || endsWithOperator) &&\n      insertionStrategy === 'replace-token'\n    ) {\n      let { from, to } = {\n        from: currentStatement.range.to,\n        to: currentStatement.range.to,\n      };\n\n      if (currentStatement.value) {\n        ({ from, to } = currentStatement.value.range);\n      }\n\n      if (\n        startsWithOperator &&\n        ((head > from && head < to) || (!containsOperator && head === from))\n      ) {\n        startsWithOperator = false;\n        if (shouldAppendTrailingWildcard(trimmedValue)) {\n          insertedValue =\n            containsOperator && !trimmedValue.startsWith('*')\n              ? `*${trimmedValue}*`\n              : `${trimmedValue}*`;\n\n          insertedValue = `${insertedValue}${\n            !nextSibling && addSpace ? ' ' : ''\n          }`;\n        }\n      } else {\n        if (head === from || (startsWithOperator && head === to)) {\n          replaceFrom = from;\n          insertedValue = appliedSuggestionValue;\n        }\n\n        replaceUntil = to;\n        startsWithOperator = false;\n        nextSibling = nextStatement;\n      }\n    }\n  } else {\n    insertedValue = nextSibling ? trimmedValue : appliedSuggestionValue;\n  }\n\n  let insertionRange: { from: number; to: number };\n\n  switch (insertionStrategy) {\n    case 'insert':\n      insertionRange = {\n        from: head,\n        to: head,\n      };\n      break;\n    case 'replace-statement': {\n      const editorState = EditorState.create({\n        doc: appliedSuggestionValue,\n        extensions: [filterFieldLanguageExtension],\n      });\n      const suggestionCursor = getStatementCursorAtPosition(\n        appliedSuggestionValue.length,\n        editorState,\n      );\n\n      if (getStatementStatus(suggestionCursor) !== 'complete') {\n        insertedValue = appliedSuggestionValue;\n        nextSibling = false;\n      }\n\n      insertionRange = {\n        from: Math.min(\n          currentDocumentLength,\n          currentStatement?.range.from ?? head,\n        ),\n        to: Math.min(currentDocumentLength, currentStatement?.range.to ?? head),\n      };\n\n      if (isLogicalOperator(token)) {\n        nextSibling = nextStatement;\n        if (nextSibling) {\n          insertedValue = trimmedValue;\n        }\n\n        insertionRange = {\n          from: Math.min(currentDocumentLength, token.range.from),\n          to: Math.min(currentDocumentLength, token.range.to),\n        };\n      }\n      break;\n    }\n    case 'replace-all':\n      // Reset inserted value to the initial suggestion value, including all trailing characters.\n      insertedValue = appliedSuggestionValue;\n      nextSibling = false;\n      insertionRange = {\n        from: 0,\n        to: editorState.doc.toString().length,\n      };\n      break;\n    default: {\n      if (\n        (token.type === 'String' ||\n          token.type === 'Key' ||\n          token.type === 'Error') &&\n        range === undefined\n      ) {\n        // The current token may end before the enclosing statement, e.g. '\"foo\"| ' -> current token '\"foo\"' doesn't\n        // include the space, which is included in the statement's range.\n        // We need to check whether there's a space after the current token to properly insert the suggestion.\n        if (token.range.to < (currentStatement?.range.to ?? 0)) {\n          const characterAfterToken = getTextFromRange(\n            {\n              from: token.range.to,\n              to: token.range.to + 1,\n            },\n            editorState.doc.toString(),\n          );\n\n          // If there's already a space after the current token, handle insertion as if there was a next sibling.\n          if (characterAfterToken === ' ') {\n            nextSibling = true;\n            insertedValue = trimmedValue;\n          }\n        }\n\n        if (head > token.range.from && head < token.range.to) {\n          const isTokenEscaped = token.textValue.match(/^\"[^\"]*\"$/);\n          const isAppliedSuggestionValueEscaped =\n            appliedSuggestionValue.match(/^\"[^\"]*\"$/) ??\n            appliedSuggestionValue.match(/^\"[^\"]*\" $/);\n\n          if (isTokenEscaped && !isAppliedSuggestionValueEscaped) {\n            replaceFrom = token.range.from + 1;\n            replaceUntil = token.range.to;\n\n            const addSpace = insertedValue.slice(-1) !== ' ';\n\n            insertedValue = addSpace ? `${trimmedValue}\" ` : `${trimmedValue}\"`;\n            hasSpaceAfterQuotes = addSpace;\n          }\n        }\n      } else if (range) {\n        ({ from: replaceFrom, to: replaceUntil } = range);\n        // A branded zero-width range means the range came from the overlapping-suggestions\n        // path (e.g. \"a \" \u2192 subToken {from:2,to:2}) and the component hasn't re-rendered\n        // yet after the user typed a character (e.g. \"=\") that became a live token at that\n        // position. Extend replaceUntil to cover the live token so the suggestion replaces\n        // what was typed rather than inserting alongside it.\n        // The brand check (`overlappingSuggestionRangeBrand`) is essential: it prevents\n        // extending a consumer-supplied insertionRange={{ from: N, to: N }}, which is an\n        // intentional insertion point that must never be widened into a replacement.\n        if (\n          replaceFrom === replaceUntil &&\n          token.range.from === replaceFrom &&\n          (range as Record<symbol, unknown>)[\n            overlappingSuggestionRangeBrand\n          ] === true\n        ) {\n          replaceUntil = token.range.to;\n        }\n      }\n\n      insertionRange = {\n        from: Math.min(currentDocumentLength, replaceFrom),\n        to: Math.min(currentDocumentLength, replaceUntil),\n      };\n    }\n  }\n\n  // Public insertion ranges can be provided in reverse order. Normalize before\n  // calculating selection bounds so CodeMirror does not reject the transaction.\n  insertionRange = getSortedRange(insertionRange);\n\n  let anchor =\n    insertionStrategy === 'insert'\n      ? head + insertedValue.length\n      : Math.min(currentDocumentLength, insertionRange.from) +\n        (nextSibling && !isLastListValue\n          ? appliedSuggestionValue.length\n          : insertedValue.length) +\n        (insertionStrategy === 'replace-token' ? +startsWithOperator : 0) +\n        +hasSpaceAfterQuotes;\n\n  // When a custom suggestion with trailing `value` is provided, we automatically adjust the selection\n  // so the placeholder is selected to have the same behaviour as for ootb wildcard suggestions.\n  if (cursorBeforeTrailing || isWildcardSuggestionWithValuePlaceholder) {\n    const trailingLength = trailing ? trailing.length : 0;\n    anchor -=\n      trailingLength +\n      (autoEscapeSuggestion &&\n      !(isSuggestionWithWildcard || isWildcardSuggestionWithValuePlaceholder)\n        ? 1\n        : 0);\n  }\n\n  // Additional safeguard:\n  // Clamp anchor to be within the new document length to prevent\n  // \"Selection points outside of document\" errors.\n  const newDocLength =\n    currentDocumentLength -\n    (insertionRange.to - insertionRange.from) +\n    insertedValue.length;\n  anchor = Math.max(0, Math.min(anchor, newDocLength));\n\n  return {\n    changes: {\n      ...insertionRange,\n      insert: insertedValue,\n    },\n    selection: {\n      anchor,\n      // Select the value placeholder if inserting a wildcard suggestion with a placeholder\n      ...(isWildcardSuggestionWithValuePlaceholder ? { head: anchor + 5 } : {}), // 5 = 'value'.length;\n    },\n  };\n}\n\n/**\n * Handles the insertion and cursor position of the inclusion operator\n * suggestions (\"in ()\" and \"not in ()\")\n */\nfunction getSuggestionTransactionForInclusionOperatorSuggestion(\n  suggestionValue: string,\n  currentStatement: FilterFieldStatementNode | undefined,\n  token: FilterFieldValueNode,\n  trailing: string | undefined,\n  head: number,\n  currentDocumentLength: number,\n  editorState: EditorState,\n  nextStatement: boolean | undefined,\n) {\n  let insertedValue = suggestionValue;\n\n  // If a value already exists we have to take care of potential brackets\n  if (currentStatement?.value) {\n    let stringifiedValue = currentStatement.value.textValue;\n\n    // we remove potential brackets from the value so that they are not\n    // added twice (e.g. \"a in (b\" should be \"a in (b)\" not \"a in ((b)\")\n    // (For type List we know that the brackets are present, but the value could be an\n    // error node with incomplete / no brackets)\n    stringifiedValue = stringifiedValue\n      .replace(/^\\(/, '') // remove starting opening bracket if present\n      .replace(/(?<!\\\\)\\)$/, ''); // only remove a closing bracket if it's not escaped\n\n    if (currentStatement.value.type !== 'List') {\n      // if the value is not a list, we also want to clean up any extra\n      // spaces that might be present e.g. \"a in (b      \" -> \"a in (b)\"\n      insertedValue = `${insertedValue}${stringifiedValue.trimEnd()}`;\n    } else {\n      insertedValue = `${insertedValue}${stringifiedValue}`;\n    }\n  }\n\n  // We want to insert / reinsert both operator and value\n  // as we have to place the brackets before and after the value\n  let insertionRange = {\n    from: Math.min(\n      currentDocumentLength,\n      currentStatement?.comparisonOperator?.range.from ?? token.range.from,\n    ),\n    to: Math.min(\n      currentDocumentLength,\n      currentStatement?.value?.range.to ?? token.range.to,\n    ),\n  };\n\n  insertionRange = getSortedRange(insertionRange);\n  let anchor = insertionRange.from + insertedValue.length;\n\n  // Add the trailing closing bracket\n  insertedValue = `${insertedValue}${trailing}`;\n\n  // Only add a space at the end if there is not yet a space or another statement\n  // after the current statement\n  const nextSibling = !nextStatement\n    ? hasNextSibling(head, editorState, { ignorePositionOperators: true })\n    : nextStatement;\n  insertedValue = `${insertedValue.trimEnd()}${!nextSibling ? ' ' : ''}`;\n\n  // Additional safeguard:\n  // Clamp anchor to be within the new document length to prevent\n  // \"Selection points outside of document\" errors.\n  const newDocLength =\n    currentDocumentLength -\n    (insertionRange.to - insertionRange.from) +\n    insertedValue.length;\n  anchor = Math.max(0, Math.min(anchor, newDocLength));\n\n  return {\n    changes: {\n      ...insertionRange,\n      insert: insertedValue,\n    },\n    selection: {\n      anchor: anchor,\n    },\n  };\n}\n\n/**\n * Returns the given range with the from and to values sorted so that from is always smaller than to.\n * This is only needed in some edge cases (e.g. when choosing the in operator suggestions here \"foo | b\"),\n * but to be safe we want sort the range.\n * @internal\n */\nfunction getSortedRange(range: { from: number; to: number }) {\n  if (range.to < range.from) {\n    return { from: range.to, to: range.from };\n  }\n\n  return range;\n}\n\nfunction shouldAppendTrailingWildcard(value: string) {\n  return !value.endsWith('*') && !value.endsWith('*\"');\n}\n\n/**\n * Check if the next node after cursor position contains an opening bracket.\n * @internal\n */\nexport function _isFollowedByOpeningBracket(\n  editorState: EditorState,\n  head: number,\n) {\n  const tree = syntaxTree(editorState);\n\n  let cursor = tree.cursorAt(head, 1);\n\n  if (cursor.name === 'OpeningBracket') {\n    return true;\n  }\n\n  if (cursor.node.name === 'Filter' || cursor.node.name === 'FilterStatement') {\n    cursor = tree.cursorAt(head, -1);\n  }\n\n  if (!cursor.next()) {\n    return false;\n  }\n\n  if (cursor.name === 'OpeningBracket' && cursor.node.from >= head) {\n    return true;\n  }\n\n  if (cursor.name === '\u26A0') {\n    if (cursor.next() && cursor.node.from >= head) {\n      // the first check handles cases like `foo = (bar` and the FilterGroup check handles cases like `foo = (bar, baz)`, that already includes an opening bracket\n      // @ts-expect-error the cursor name type changed by calling next, but typescript doesn't recognize it\n      if (cursor.name === 'OpeningBracket' || cursor.name === 'FilterGroup') {\n        return true;\n      }\n    }\n  }\n\n  if (cursor.name === 'FilterIncludesValue') {\n    if (cursor.next() && cursor.node.from >= head) {\n      // if the node is a list node, we know it already includes an opening bracket and otherwise we check if it's just an opening bracket node\n      // @ts-expect-error the cursor name type changed by calling next, but typescript doesn't recognize it\n      if (cursor.name === 'OpeningBracket' || cursor.name === 'List') {\n        return true;\n      }\n    }\n  }\n\n  // keep track of the cursor at the next position for cases like (a = 1) (a = b) at index 6 or foo = bar (test, bla) at index 8\n  const cursorAtExactPosition = tree.cursorAt(head + 1, 1);\n\n  if (cursorAtExactPosition.node.name === 'OpeningBracket') {\n    return true;\n  }\n\n  cursorAtExactPosition.parent();\n\n  if (\n    cursorAtExactPosition.node.name !== 'Filter' &&\n    cursor.node.name === 'FilterGroup'\n  ) {\n    return true;\n  }\n\n  return false;\n}\n\n/**\n * Check whether the node that is be entered at the given position is the last value in a list.\n * @internal\n */\nexport function insertionIsLastListValue(\n  cursorPosition: number,\n  editorState: EditorState,\n): boolean {\n  const tree = syntaxTree(editorState);\n  const cursor = tree.cursorAt(cursorPosition, 1);\n\n  // If the cursor is right before a closing bracket, we definitely have a next sibling.\n  if (\n    cursor.node.name === 'ClosingBracket' &&\n    cursorPosition === cursor.node.from\n  ) {\n    if (cursor.parent() && cursor.name === 'List') {\n      return true;\n    }\n  }\n\n  return false;\n}\n"],
-  "mappings": "AAAA,SAAS,kBAAkB;AAC3B,SAAS,mBAAmB;AAE5B,SAAS,wBAAwB;AACjC,SAAS,0BAA0B;AACnC,SAAS,wBAAwB;AACjC,SAAS,uCAAuC;AAChD;AAAA,EACE;AAAA,EACA;AAAA,EACA;AAAA,OACK;AACP,SAAS,yBAAyB;AAClC,SAAS,oCAAoC;AAUtC,SAAS,yBACd,iBACA,OACA,wBACA,UACA,mBACA,sBACA,oBACA,aACA;AACA,QAAM,EAAE,OAAO,kBAAkB,kBAAkB,IAAI;AACvD,QAAM,mBAAmB,YAAY;AACrC,QAAM,EAAE,KAAK,IAAI,iBAAiB;AAElC,MAAI,mBAAmB;AACvB,MAAI,CAAC,kBAAkB;AACrB,uBAAmB;AAAA,MACjB,MAAM;AAAA,MACN,OAAO,EAAE,MAAM,MAAM,MAAM,MAAM,IAAI,MAAM,MAAM,GAAG;AAAA,IACtD;AAAA,EACF;AAEA,QAAM,uBACH,sBAAsB,mBACrB,2BAA2B,UAC7B;AAEF,QAAM,wBAAwB,YAAY,IAAI,SAAS,EAAE;AAEzD,QAAM,2CAA2C,UAAU,SAAS,OAAO;AAC3E,QAAM,gCAAgC,CAAC,QAAQ,UAAU,EAAE;AAAA,IACzD;AAAA,EACF;AACA,QAAM,2BAA2B,CAAC,OAAO,MAAM,EAAE,SAAS,eAAe;AAEzE,QAAM,gBAAgB,iBAAiB,MAAM,WAAW;AAMxD,MAAI,iCAAiC,UAAU,QAAW;AACxD,WAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,EACF;AAEA,QAAM,yBAAyB,GAC7B,wBAAwB,CAAC,2CACrB,iBAAiB,eAAe,IAChC,eACN,GAAG,YAAY,EAAE;AAEjB,QAAM,eAAe,uBAAuB,QAAQ;AACpD,QAAM,mBAAmB,aAAa,MAAM,oBAAoB;AAChE,QAAM,WAAW,uBAAuB,MAAM,EAAE,MAAM;AAEtD,MAAI,gBAAgB;AACpB,MAAI,cAAc,MAAM,MAAM;AAC9B,MAAI,eAAe,MAAM,MAAM;AAC/B,MAAI,cAAc;AAClB,MAAI,kBAAkB;AACtB,MAAI,qBAAqB;AACzB,MAAI,mBAAmB;AACvB,MAAI,sBAAsB;AAE1B,QAAM,+BAA+B;AAAA,IACnC;AAAA,IACA;AAAA,EACF;AAIA,MACE,MAAM,SAAS,UACf,OAAO,MAAM,MAAM,QACnB,OAAO,MAAM,MAAM,MACnB,sBAAsB,iBACtB;AACA,kBAAc;AACd,mBAAe;AAAA,EACjB;AAEA,QAAM,EAAE,MAAM,IAAI,oBAAoB,CAAC;AACvC,QAAM,eACJ,MAAM,MAAM,SAAS,OAAO,MAAM,QAClC,MAAM,MAAM,OAAO,OAAO,MAAM;AAMlC,MAAI,kBAAkB;AACpB,kBAAc,CAAC,gBACX,eAAe,MAAM,aAAa,EAAE,yBAAyB,KAAK,CAAC,IACnE;AACJ,yBACE,gBACA,iBAAiB,oBAAoB,SAAS,yBAC7C,iBAAiB,mBAAmB,UAAU,iBAC7C,iBAAiB,mBAAmB,UAAU;AAClD,uBACE,gBACA,iBAAiB,oBAAoB,SAAS,yBAC7C,iBAAiB,mBAAmB,UAAU,eAC7C,iBAAiB,mBAAmB,UAAU;AAElD,QAAI,eAAe,yBAAyB,MAAM,WAAW,GAAG;AAG9D,wBAAkB;AAAA,IACpB;AAQA,QACE,sBAAsB,uBACrB,oBACC,iBAAiB,SACjB,CAAC,gCACH,oBACA;AACA,oBAAc;AACd,qBAAe,iBAAiB,MAAM;AAAA,IACxC;AAEA,oBACE,eAAe,sBAAsB,WACjC,eACA;AACN,UAAM,mBAAmB,sBAAsB;AAK/C,SACG,sBAAsB,qBACvB,sBAAsB,iBACtB;AACA,UAAI,EAAE,MAAM,GAAG,IAAI;AAAA,QACjB,MAAM,iBAAiB,MAAM;AAAA,QAC7B,IAAI,iBAAiB,MAAM;AAAA,MAC7B;AAEA,UAAI,iBAAiB,OAAO;AAC1B,SAAC,EAAE,MAAM,GAAG,IAAI,iBAAiB,MAAM;AAAA,MACzC;AAEA,UACE,uBACE,OAAO,QAAQ,OAAO,MAAQ,CAAC,oBAAoB,SAAS,OAC9D;AACA,6BAAqB;AACrB,YAAI,6BAA6B,YAAY,GAAG;AAC9C,0BACE,oBAAoB,CAAC,aAAa,WAAW,GAAG,IAC5C,IAAI,YAAY,MAChB,GAAG,YAAY;AAErB,0BAAgB,GAAG,aAAa,GAC9B,CAAC,eAAe,WAAW,MAAM,EACnC;AAAA,QACF;AAAA,MACF,OAAO;AACL,YAAI,SAAS,QAAS,sBAAsB,SAAS,IAAK;AACxD,wBAAc;AACd,0BAAgB;AAAA,QAClB;AAEA,uBAAe;AACf,6BAAqB;AACrB,sBAAc;AAAA,MAChB;AAAA,IACF;AAAA,EACF,OAAO;AACL,oBAAgB,cAAc,eAAe;AAAA,EAC/C;AAEA,MAAI;AAEJ,UAAQ,mBAAmB;AAAA,IACzB,KAAK;AACH,uBAAiB;AAAA,QACf,MAAM;AAAA,QACN,IAAI;AAAA,MACN;AACA;AAAA,IACF,KAAK,qBAAqB;AACxB,YAAMA,eAAc,YAAY,OAAO;AAAA,QACrC,KAAK;AAAA,QACL,YAAY,CAAC,4BAA4B;AAAA,MAC3C,CAAC;AACD,YAAM,mBAAmB;AAAA,QACvB,uBAAuB;AAAA,QACvBA;AAAA,MACF;AAEA,UAAI,mBAAmB,gBAAgB,MAAM,YAAY;AACvD,wBAAgB;AAChB,sBAAc;AAAA,MAChB;AAEA,uBAAiB;AAAA,QACf,MAAM,KAAK;AAAA,UACT;AAAA,UACA,kBAAkB,MAAM,QAAQ;AAAA,QAClC;AAAA,QACA,IAAI,KAAK,IAAI,uBAAuB,kBAAkB,MAAM,MAAM,IAAI;AAAA,MACxE;AAEA,UAAI,kBAAkB,KAAK,GAAG;AAC5B,sBAAc;AACd,YAAI,aAAa;AACf,0BAAgB;AAAA,QAClB;AAEA,yBAAiB;AAAA,UACf,MAAM,KAAK,IAAI,uBAAuB,MAAM,MAAM,IAAI;AAAA,UACtD,IAAI,KAAK,IAAI,uBAAuB,MAAM,MAAM,EAAE;AAAA,QACpD;AAAA,MACF;AACA;AAAA,IACF;AAAA,IACA,KAAK;AAEH,sBAAgB;AAChB,oBAAc;AACd,uBAAiB;AAAA,QACf,MAAM;AAAA,QACN,IAAI,YAAY,IAAI,SAAS,EAAE;AAAA,MACjC;AACA;AAAA,IACF,SAAS;AACP,WACG,MAAM,SAAS,YACd,MAAM,SAAS,SACf,MAAM,SAAS,YACjB,UAAU,QACV;AAIA,YAAI,MAAM,MAAM,MAAM,kBAAkB,MAAM,MAAM,IAAI;AACtD,gBAAM,sBAAsB;AAAA,YAC1B;AAAA,cACE,MAAM,MAAM,MAAM;AAAA,cAClB,IAAI,MAAM,MAAM,KAAK;AAAA,YACvB;AAAA,YACA,YAAY,IAAI,SAAS;AAAA,UAC3B;AAGA,cAAI,wBAAwB,KAAK;AAC/B,0BAAc;AACd,4BAAgB;AAAA,UAClB;AAAA,QACF;AAEA,YAAI,OAAO,MAAM,MAAM,QAAQ,OAAO,MAAM,MAAM,IAAI;AACpD,gBAAM,iBAAiB,MAAM,UAAU,MAAM,WAAW;AACxD,gBAAM,kCACJ,uBAAuB,MAAM,WAAW,KACxC,uBAAuB,MAAM,YAAY;AAE3C,cAAI,kBAAkB,CAAC,iCAAiC;AACtD,0BAAc,MAAM,MAAM,OAAO;AACjC,2BAAe,MAAM,MAAM;AAE3B,kBAAMC,YAAW,cAAc,MAAM,EAAE,MAAM;AAE7C,4BAAgBA,YAAW,GAAG,YAAY,OAAO,GAAG,YAAY;AAChE,kCAAsBA;AAAA,UACxB;AAAA,QACF;AAAA,MACF,WAAW,OAAO;AAChB,SAAC,EAAE,MAAM,aAAa,IAAI,aAAa,IAAI;AAS3C,YACE,gBAAgB,gBAChB,MAAM,MAAM,SAAS,eACpB,MACC,+BACF,MAAM,MACN;AACA,yBAAe,MAAM,MAAM;AAAA,QAC7B;AAAA,MACF;AAEA,uBAAiB;AAAA,QACf,MAAM,KAAK,IAAI,uBAAuB,WAAW;AAAA,QACjD,IAAI,KAAK,IAAI,uBAAuB,YAAY;AAAA,MAClD;AAAA,IACF;AAAA,EACF;AAIA,mBAAiB,eAAe,cAAc;AAE9C,MAAI,SACF,sBAAsB,WAClB,OAAO,cAAc,SACrB,KAAK,IAAI,uBAAuB,eAAe,IAAI,KAClD,eAAe,CAAC,kBACb,uBAAuB,SACvB,cAAc,WACjB,sBAAsB,kBAAkB,CAAC,qBAAqB,KAC/D,CAAC;AAIP,MAAI,wBAAwB,0CAA0C;AACpE,UAAM,iBAAiB,WAAW,SAAS,SAAS;AACpD,cACE,kBACC,wBACD,EAAE,4BAA4B,4CAC1B,IACA;AAAA,EACR;AAKA,QAAM,eACJ,yBACC,eAAe,KAAK,eAAe,QACpC,cAAc;AAChB,WAAS,KAAK,IAAI,GAAG,KAAK,IAAI,QAAQ,YAAY,CAAC;AAEnD,SAAO;AAAA,IACL,SAAS;AAAA,MACP,GAAG;AAAA,MACH,QAAQ;AAAA,IACV;AAAA,IACA,WAAW;AAAA,MACT;AAAA;AAAA,MAEA,GAAI,2CAA2C,EAAE,MAAM,SAAS,EAAE,IAAI,CAAC;AAAA;AAAA,IACzE;AAAA,EACF;AACF;AAMA,SAAS,uDACP,iBACA,kBACA,OACA,UACA,MACA,uBACA,aACA,eACA;AACA,MAAI,gBAAgB;AAGpB,MAAI,kBAAkB,OAAO;AAC3B,QAAI,mBAAmB,iBAAiB,MAAM;AAM9C,uBAAmB,iBAChB,QAAQ,OAAO,EAAE,EACjB,QAAQ,cAAc,EAAE;AAE3B,QAAI,iBAAiB,MAAM,SAAS,QAAQ;AAG1C,sBAAgB,GAAG,aAAa,GAAG,iBAAiB,QAAQ,CAAC;AAAA,IAC/D,OAAO;AACL,sBAAgB,GAAG,aAAa,GAAG,gBAAgB;AAAA,IACrD;AAAA,EACF;AAIA,MAAI,iBAAiB;AAAA,IACnB,MAAM,KAAK;AAAA,MACT;AAAA,MACA,kBAAkB,oBAAoB,MAAM,QAAQ,MAAM,MAAM;AAAA,IAClE;AAAA,IACA,IAAI,KAAK;AAAA,MACP;AAAA,MACA,kBAAkB,OAAO,MAAM,MAAM,MAAM,MAAM;AAAA,IACnD;AAAA,EACF;AAEA,mBAAiB,eAAe,cAAc;AAC9C,MAAI,SAAS,eAAe,OAAO,cAAc;AAGjD,kBAAgB,GAAG,aAAa,GAAG,QAAQ;AAI3C,QAAM,cAAc,CAAC,gBACjB,eAAe,MAAM,aAAa,EAAE,yBAAyB,KAAK,CAAC,IACnE;AACJ,kBAAgB,GAAG,cAAc,QAAQ,CAAC,GAAG,CAAC,cAAc,MAAM,EAAE;AAKpE,QAAM,eACJ,yBACC,eAAe,KAAK,eAAe,QACpC,cAAc;AAChB,WAAS,KAAK,IAAI,GAAG,KAAK,IAAI,QAAQ,YAAY,CAAC;AAEnD,SAAO;AAAA,IACL,SAAS;AAAA,MACP,GAAG;AAAA,MACH,QAAQ;AAAA,IACV;AAAA,IACA,WAAW;AAAA,MACT;AAAA,IACF;AAAA,EACF;AACF;AAQA,SAAS,eAAe,OAAqC;AAC3D,MAAI,MAAM,KAAK,MAAM,MAAM;AACzB,WAAO,EAAE,MAAM,MAAM,IAAI,IAAI,MAAM,KAAK;AAAA,EAC1C;AAEA,SAAO;AACT;AAEA,SAAS,6BAA6B,OAAe;AACnD,SAAO,CAAC,MAAM,SAAS,GAAG,KAAK,CAAC,MAAM,SAAS,IAAI;AACrD;AAMO,SAAS,4BACd,aACA,MACA;AACA,QAAM,OAAO,WAAW,WAAW;AAEnC,MAAI,SAAS,KAAK,SAAS,MAAM,CAAC;AAElC,MAAI,OAAO,SAAS,kBAAkB;AACpC,WAAO;AAAA,EACT;AAEA,MAAI,OAAO,KAAK,SAAS,YAAY,OAAO,KAAK,SAAS,mBAAmB;AAC3E,aAAS,KAAK,SAAS,MAAM,EAAE;AAAA,EACjC;AAEA,MAAI,CAAC,OAAO,KAAK,GAAG;AAClB,WAAO;AAAA,EACT;AAEA,MAAI,OAAO,SAAS,oBAAoB,OAAO,KAAK,QAAQ,MAAM;AAChE,WAAO;AAAA,EACT;AAEA,MAAI,OAAO,SAAS,UAAK;AACvB,QAAI,OAAO,KAAK,KAAK,OAAO,KAAK,QAAQ,MAAM;AAG7C,UAAI,OAAO,SAAS,oBAAoB,OAAO,SAAS,eAAe;AACrE,eAAO;AAAA,MACT;AAAA,IACF;AAAA,EACF;AAEA,MAAI,OAAO,SAAS,uBAAuB;AACzC,QAAI,OAAO,KAAK,KAAK,OAAO,KAAK,QAAQ,MAAM;AAG7C,UAAI,OAAO,SAAS,oBAAoB,OAAO,SAAS,QAAQ;AAC9D,eAAO;AAAA,MACT;AAAA,IACF;AAAA,EACF;AAGA,QAAM,wBAAwB,KAAK,SAAS,OAAO,GAAG,CAAC;AAEvD,MAAI,sBAAsB,KAAK,SAAS,kBAAkB;AACxD,WAAO;AAAA,EACT;AAEA,wBAAsB,OAAO;AAE7B,MACE,sBAAsB,KAAK,SAAS,YACpC,OAAO,KAAK,SAAS,eACrB;AACA,WAAO;AAAA,EACT;AAEA,SAAO;AACT;AAMO,SAAS,yBACd,gBACA,aACS;AACT,QAAM,OAAO,WAAW,WAAW;AACnC,QAAM,SAAS,KAAK,SAAS,gBAAgB,CAAC;AAG9C,MACE,OAAO,KAAK,SAAS,oBACrB,mBAAmB,OAAO,KAAK,MAC/B;AACA,QAAI,OAAO,OAAO,KAAK,OAAO,SAAS,QAAQ;AAC7C,aAAO;AAAA,IACT;AAAA,EACF;AAEA,SAAO;AACT;",
+  "sourcesContent": ["import { syntaxTree } from '@codemirror/language';\nimport { EditorState } from '@codemirror/state';\n\nimport { escapeSuggestion } from './escape-suggestion.js';\nimport { getStatementStatus } from './get-statement-status.js';\nimport { getTextFromRange } from './get-text.js';\nimport { overlappingSuggestionRangeBrand } from './suggestions-utils/get-suggestions.js';\nimport {\n  getStatementCursorAtPosition,\n  hasNextSibling,\n  hasNextStatement,\n} from './tree-navigation.js';\nimport { isLogicalOperator } from './tree-node-guards.js';\nimport { filterFieldLanguageExtension } from '../parser/filterfield-language.js';\nimport type { FilterFieldSuggestionProps } from '../suggestions/Suggestion.types.js';\nimport type { FilterFieldSuggestionsContext } from '../suggestions/suggestions-extension.js';\nimport type {\n  FilterFieldNodeBase,\n  FilterFieldStatementNode,\n  FilterFieldValueNode,\n} from '../types/tree-nodes.js';\n\n/** @internal */\nexport function getSuggestionTransaction(\n  suggestionValue: string,\n  range: FilterFieldNodeBase['range'] | undefined,\n  shouldEscapeSuggestion: boolean | undefined,\n  trailing: string | undefined,\n  insertionStrategy: FilterFieldSuggestionProps['insertionStrategy'],\n  cursorBeforeTrailing: boolean | undefined,\n  suggestionsContext: FilterFieldSuggestionsContext,\n  editorState: EditorState,\n) {\n  const { token, currentStatement: _currentStatement } = suggestionsContext;\n  const currentSelection = editorState.selection;\n  const { head } = currentSelection.main;\n\n  let currentStatement = _currentStatement;\n  if (!currentStatement) {\n    currentStatement = {\n      type: 'Statement',\n      range: { from: token.range.from, to: token.range.to },\n    };\n  }\n\n  const autoEscapeSuggestion =\n    (insertionStrategy === 'replace-token' &&\n      shouldEscapeSuggestion === undefined) ||\n    shouldEscapeSuggestion;\n\n  const currentDocumentLength = editorState.doc.toString().length;\n\n  const isWildcardSuggestionWithValuePlaceholder = trailing?.includes('value');\n  const isInclusionOperatorSuggestion = ['in (', 'not in ('].includes(\n    suggestionValue,\n  ); // these values come from our defined defaultComparisonOperatorSuggestions values when we have autosuggestions\n  const isSuggestionWithWildcard = ['= *', '!= *'].includes(suggestionValue);\n\n  const nextStatement = hasNextStatement(head, editorState);\n\n  // Handle insertion of the inclusion operator suggestion separately,\n  // as we have to take care of potential existing values and brackets and\n  // always want to place the cursor right before the closing bracket so users\n  // can start/continue typing values.\n  if (isInclusionOperatorSuggestion && range === undefined) {\n    return getSuggestionTransactionForInclusionOperatorSuggestion(\n      suggestionValue,\n      currentStatement,\n      token,\n      trailing,\n      head,\n      currentDocumentLength,\n      editorState,\n      nextStatement,\n    );\n  }\n\n  const appliedSuggestionValue = `${\n    autoEscapeSuggestion && !isWildcardSuggestionWithValuePlaceholder\n      ? escapeSuggestion(suggestionValue)\n      : suggestionValue\n  }${trailing ?? ''}`;\n\n  const trimmedValue = appliedSuggestionValue.trimEnd();\n  const isExistsOperator = trimmedValue.match(/^(= \\*)$|^(!= \\*)$/);\n  const addSpace = appliedSuggestionValue.slice(-1) === ' ';\n\n  let insertedValue = appliedSuggestionValue;\n  let replaceFrom = token.range.from;\n  let replaceUntil = token.range.to;\n  let nextSibling = false;\n  let isLastListValue = false;\n  let startsWithOperator = false;\n  let endsWithOperator = false;\n  let hasSpaceAfterQuotes = false;\n  let isWildcardOperatorSwitch = false;\n\n  const followedByOpeningParenthesis = _isFollowedByOpeningBracket(\n    editorState,\n    head,\n  );\n\n  // If the token at the cursor position is a list, only replace single list values if the cursor\n  // is positioned inside the list's brackets.\n  if (\n    token.type === 'List' &&\n    head > token.range.from &&\n    head < token.range.to &&\n    insertionStrategy === 'replace-token'\n  ) {\n    replaceFrom = head;\n    replaceUntil = head;\n  }\n\n  const { value } = currentStatement ?? {};\n  const isValueToken =\n    token.range.from === value?.range.from &&\n    token.range.to === value?.range.to;\n\n  // If the current statement is undefined, it is definitely not followed by any\n  // other node and we want to automatically add the default trailing space\n  // (unless overridden) when applying a suggestion.\n  // If there is a statement, we want to override the added space in certain cases.\n  if (currentStatement) {\n    nextSibling = !nextStatement\n      ? hasNextSibling(head, editorState, { ignorePositionOperators: true })\n      : nextStatement;\n    startsWithOperator =\n      isValueToken &&\n      currentStatement.comparisonOperator?.type === 'ComparisonOperator' &&\n      (currentStatement.comparisonOperator.value === 'starts-with' ||\n        currentStatement.comparisonOperator.value === 'contains');\n    endsWithOperator =\n      isValueToken &&\n      currentStatement.comparisonOperator?.type === 'ComparisonOperator' &&\n      (currentStatement.comparisonOperator.value === 'ends-with' ||\n        currentStatement.comparisonOperator.value === 'contains');\n\n    if (nextSibling && insertionIsLastListValue(head, editorState)) {\n      // We need this flag to not move the cursor outside of the brackets when\n      // adding a value as the last value in a list. (e.g. a in (a|))\n      isLastListValue = true;\n    }\n\n    // If the applied suggestion is an exists operator (= * | != *), we want to also\n    // replace the value of the current filter statement.\n    // e.g.:\n    //   foo =| bar\n    //   insert \"= *\"\n    //   foo = *\n    if (\n      insertionStrategy === 'replace-statement' ||\n      (isExistsOperator &&\n        currentStatement.value &&\n        !followedByOpeningParenthesis) ||\n      startsWithOperator\n    ) {\n      nextSibling = nextStatement;\n      replaceUntil = currentStatement.range.to;\n    } else if (\n      isWildcardSuggestionWithValuePlaceholder &&\n      !isValueToken &&\n      range === undefined &&\n      currentStatement.value\n    ) {\n      // When switching from a comparison operator to a wildcard operator (starts-with,\n      // ends-with, contains) while a value already exists, extend the replacement to\n      // cover the existing value so it is wrapped correctly instead of leaving it in place.\n      isWildcardOperatorSwitch = true;\n      nextSibling = nextStatement;\n      replaceUntil = currentStatement.value.range.to;\n    }\n\n    insertedValue =\n      nextSibling || insertionStrategy === 'insert'\n        ? trimmedValue\n        : appliedSuggestionValue;\n    const containsOperator = startsWithOperator && endsWithOperator;\n\n    if (isWildcardOperatorSwitch && currentStatement.value) {\n      const leadingWildcard = suggestionValue.endsWith('*\"');\n      const trailingWildcard = (trailing ?? '').endsWith('\"*');\n      const wrappedValue = buildWildcardWrappedValue(\n        currentStatement.value.textValue,\n        leadingWildcard,\n        trailingWildcard,\n      );\n      const operatorSign = suggestionValue.startsWith('!=') ? '!= ' : '= ';\n      insertedValue = nextSibling\n        ? `${operatorSign}${wrappedValue}`\n        : `${operatorSign}${wrappedValue} `;\n    }\n\n    // When replacing a value that has a starts-with operator, we want to replace\n    // the value while keeping the operator. If a space is supposed to be added, we\n    // have to add it after the position operator.\n    if (\n      (startsWithOperator || endsWithOperator) &&\n      insertionStrategy === 'replace-token'\n    ) {\n      let { from, to } = {\n        from: currentStatement.range.to,\n        to: currentStatement.range.to,\n      };\n\n      if (currentStatement.value) {\n        ({ from, to } = currentStatement.value.range);\n      }\n\n      if (\n        startsWithOperator &&\n        ((head > from && head < to) || (!containsOperator && head === from))\n      ) {\n        startsWithOperator = false;\n        if (shouldAppendTrailingWildcard(trimmedValue)) {\n          insertedValue =\n            containsOperator && !trimmedValue.startsWith('*')\n              ? `*${trimmedValue}*`\n              : `${trimmedValue}*`;\n\n          insertedValue = `${insertedValue}${\n            !nextSibling && addSpace ? ' ' : ''\n          }`;\n        }\n      } else {\n        if (head === from || (startsWithOperator && head === to)) {\n          replaceFrom = from;\n          insertedValue = appliedSuggestionValue;\n        }\n\n        replaceUntil = to;\n        startsWithOperator = false;\n        nextSibling = nextStatement;\n      }\n    }\n  } else {\n    insertedValue = nextSibling ? trimmedValue : appliedSuggestionValue;\n  }\n\n  let insertionRange: { from: number; to: number };\n\n  switch (insertionStrategy) {\n    case 'insert':\n      insertionRange = {\n        from: head,\n        to: head,\n      };\n      break;\n    case 'replace-statement': {\n      const editorState = EditorState.create({\n        doc: appliedSuggestionValue,\n        extensions: [filterFieldLanguageExtension],\n      });\n      const suggestionCursor = getStatementCursorAtPosition(\n        appliedSuggestionValue.length,\n        editorState,\n      );\n\n      if (getStatementStatus(suggestionCursor) !== 'complete') {\n        insertedValue = appliedSuggestionValue;\n        nextSibling = false;\n      }\n\n      insertionRange = {\n        from: Math.min(\n          currentDocumentLength,\n          currentStatement?.range.from ?? head,\n        ),\n        to: Math.min(currentDocumentLength, currentStatement?.range.to ?? head),\n      };\n\n      if (isLogicalOperator(token)) {\n        nextSibling = nextStatement;\n        if (nextSibling) {\n          insertedValue = trimmedValue;\n        }\n\n        insertionRange = {\n          from: Math.min(currentDocumentLength, token.range.from),\n          to: Math.min(currentDocumentLength, token.range.to),\n        };\n      }\n      break;\n    }\n    case 'replace-all':\n      // Reset inserted value to the initial suggestion value, including all trailing characters.\n      insertedValue = appliedSuggestionValue;\n      nextSibling = false;\n      insertionRange = {\n        from: 0,\n        to: editorState.doc.toString().length,\n      };\n      break;\n    default: {\n      if (\n        (token.type === 'String' ||\n          token.type === 'Key' ||\n          token.type === 'Error') &&\n        range === undefined\n      ) {\n        // The current token may end before the enclosing statement, e.g. '\"foo\"| ' -> current token '\"foo\"' doesn't\n        // include the space, which is included in the statement's range.\n        // We need to check whether there's a space after the current token to properly insert the suggestion.\n        if (token.range.to < (currentStatement?.range.to ?? 0)) {\n          const characterAfterToken = getTextFromRange(\n            {\n              from: token.range.to,\n              to: token.range.to + 1,\n            },\n            editorState.doc.toString(),\n          );\n\n          // If there's already a space after the current token, handle insertion as if there was a next sibling.\n          if (characterAfterToken === ' ') {\n            nextSibling = true;\n            insertedValue = trimmedValue;\n          }\n        }\n\n        if (head > token.range.from && head < token.range.to) {\n          const isTokenEscaped = token.textValue.match(/^\"[^\"]*\"$/);\n          const isAppliedSuggestionValueEscaped =\n            appliedSuggestionValue.match(/^\"[^\"]*\"$/) ??\n            appliedSuggestionValue.match(/^\"[^\"]*\" $/);\n\n          if (isTokenEscaped && !isAppliedSuggestionValueEscaped) {\n            replaceFrom = token.range.from + 1;\n            replaceUntil = token.range.to;\n\n            const addSpace = insertedValue.slice(-1) !== ' ';\n\n            insertedValue = addSpace ? `${trimmedValue}\" ` : `${trimmedValue}\"`;\n            hasSpaceAfterQuotes = addSpace;\n          }\n        }\n      } else if (range) {\n        ({ from: replaceFrom, to: replaceUntil } = range);\n        // A branded zero-width range means the range came from the overlapping-suggestions\n        // path (e.g. \"a \" \u2192 subToken {from:2,to:2}) and the component hasn't re-rendered\n        // yet after the user typed a character (e.g. \"=\") that became a live token at that\n        // position. Extend replaceUntil to cover the live token so the suggestion replaces\n        // what was typed rather than inserting alongside it.\n        // The brand check (`overlappingSuggestionRangeBrand`) is essential: it prevents\n        // extending a consumer-supplied insertionRange={{ from: N, to: N }}, which is an\n        // intentional insertion point that must never be widened into a replacement.\n        if (\n          replaceFrom === replaceUntil &&\n          token.range.from === replaceFrom &&\n          (range as Record<symbol, unknown>)[\n            overlappingSuggestionRangeBrand\n          ] === true\n        ) {\n          replaceUntil = token.range.to;\n        }\n      }\n\n      insertionRange = {\n        from: Math.min(currentDocumentLength, replaceFrom),\n        to: Math.min(currentDocumentLength, replaceUntil),\n      };\n    }\n  }\n\n  // Public insertion ranges can be provided in reverse order. Normalize before\n  // calculating selection bounds so CodeMirror does not reject the transaction.\n  insertionRange = getSortedRange(insertionRange);\n\n  let anchor =\n    insertionStrategy === 'insert'\n      ? head + insertedValue.length\n      : Math.min(currentDocumentLength, insertionRange.from) +\n        (nextSibling && !isLastListValue\n          ? appliedSuggestionValue.length\n          : insertedValue.length) +\n        (insertionStrategy === 'replace-token' ? +startsWithOperator : 0) +\n        +hasSpaceAfterQuotes;\n\n  // When a custom suggestion with trailing `value` is provided, we automatically adjust the selection\n  // so the placeholder is selected to have the same behaviour as for ootb wildcard suggestions.\n  // For wildcard operator switches (comparison \u2192 wildcard with existing value), the cursor should\n  // land after the already-wrapped value, not inside a placeholder.\n  if (\n    (cursorBeforeTrailing || isWildcardSuggestionWithValuePlaceholder) &&\n    !isWildcardOperatorSwitch\n  ) {\n    const trailingLength = trailing ? trailing.length : 0;\n    anchor -=\n      trailingLength +\n      (autoEscapeSuggestion &&\n      !(isSuggestionWithWildcard || isWildcardSuggestionWithValuePlaceholder)\n        ? 1\n        : 0);\n  }\n\n  // Additional safeguard:\n  // Clamp anchor to be within the new document length to prevent\n  // \"Selection points outside of document\" errors.\n  const newDocLength =\n    currentDocumentLength -\n    (insertionRange.to - insertionRange.from) +\n    insertedValue.length;\n  anchor = Math.max(0, Math.min(anchor, newDocLength));\n\n  return {\n    changes: {\n      ...insertionRange,\n      insert: insertedValue,\n    },\n    selection: {\n      anchor,\n      // Select the value placeholder if inserting a wildcard suggestion with a placeholder.\n      // Skip when performing a wildcard operator switch \u2014 the value is already filled in.\n      ...(!isWildcardOperatorSwitch && isWildcardSuggestionWithValuePlaceholder\n        ? { head: anchor + 5 }\n        : {}), // 5 = 'value'.length;\n    },\n  };\n}\n\n/**\n * Handles the insertion and cursor position of the inclusion operator\n * suggestions (\"in ()\" and \"not in ()\")\n */\nfunction getSuggestionTransactionForInclusionOperatorSuggestion(\n  suggestionValue: string,\n  currentStatement: FilterFieldStatementNode | undefined,\n  token: FilterFieldValueNode,\n  trailing: string | undefined,\n  head: number,\n  currentDocumentLength: number,\n  editorState: EditorState,\n  nextStatement: boolean | undefined,\n) {\n  let insertedValue = suggestionValue;\n\n  // If a value already exists we have to take care of potential brackets\n  if (currentStatement?.value) {\n    let stringifiedValue = currentStatement.value.textValue;\n\n    // we remove potential brackets from the value so that they are not\n    // added twice (e.g. \"a in (b\" should be \"a in (b)\" not \"a in ((b)\")\n    // (For type List we know that the brackets are present, but the value could be an\n    // error node with incomplete / no brackets)\n    stringifiedValue = stringifiedValue\n      .replace(/^\\(/, '') // remove starting opening bracket if present\n      .replace(/(?<!\\\\)\\)$/, ''); // only remove a closing bracket if it's not escaped\n\n    if (currentStatement.value.type !== 'List') {\n      // if the value is not a list, we also want to clean up any extra\n      // spaces that might be present e.g. \"a in (b      \" -> \"a in (b)\"\n      insertedValue = `${insertedValue}${stringifiedValue.trimEnd()}`;\n    } else {\n      insertedValue = `${insertedValue}${stringifiedValue}`;\n    }\n  }\n\n  // We want to insert / reinsert both operator and value\n  // as we have to place the brackets before and after the value\n  let insertionRange = {\n    from: Math.min(\n      currentDocumentLength,\n      currentStatement?.comparisonOperator?.range.from ?? token.range.from,\n    ),\n    to: Math.min(\n      currentDocumentLength,\n      currentStatement?.value?.range.to ?? token.range.to,\n    ),\n  };\n\n  insertionRange = getSortedRange(insertionRange);\n  let anchor = insertionRange.from + insertedValue.length;\n\n  // Add the trailing closing bracket\n  insertedValue = `${insertedValue}${trailing}`;\n\n  // Only add a space at the end if there is not yet a space or another statement\n  // after the current statement\n  const nextSibling = !nextStatement\n    ? hasNextSibling(head, editorState, { ignorePositionOperators: true })\n    : nextStatement;\n  insertedValue = `${insertedValue.trimEnd()}${!nextSibling ? ' ' : ''}`;\n\n  // Additional safeguard:\n  // Clamp anchor to be within the new document length to prevent\n  // \"Selection points outside of document\" errors.\n  const newDocLength =\n    currentDocumentLength -\n    (insertionRange.to - insertionRange.from) +\n    insertedValue.length;\n  anchor = Math.max(0, Math.min(anchor, newDocLength));\n\n  return {\n    changes: {\n      ...insertionRange,\n      insert: insertedValue,\n    },\n    selection: {\n      anchor: anchor,\n    },\n  };\n}\n\nfunction buildWildcardWrappedValue(\n  textValue: string,\n  leadingWildcard: boolean,\n  trailingWildcard: boolean,\n): string {\n  let bare = textValue;\n  if (bare.startsWith('*\"')) {\n    bare = `\"${bare.slice(2)}`;\n  } else if (bare.startsWith('*')) {\n    bare = bare.slice(1);\n  }\n  if (bare.endsWith('*\"')) {\n    bare = `${bare.slice(0, -2)}\"`;\n  } else if (bare.endsWith('*')) {\n    bare = bare.slice(0, -1);\n  }\n  if (bare.startsWith('\"') && bare.endsWith('\"')) {\n    let content = bare.slice(1, -1);\n    if (content.startsWith('*')) {\n      content = content.slice(1);\n    }\n    if (content.endsWith('*')) {\n      content = content.slice(0, -1);\n    }\n    return `\"${leadingWildcard ? '*' : ''}${content}${trailingWildcard ? '*' : ''}\"`;\n  }\n  return `${leadingWildcard ? '*' : ''}${bare}${trailingWildcard ? '*' : ''}`;\n}\n\n/**\n * Returns the given range with the from and to values sorted so that from is always smaller than to.\n * This is only needed in some edge cases (e.g. when choosing the in operator suggestions here \"foo | b\"),\n * but to be safe we want sort the range.\n * @internal\n */\nfunction getSortedRange(range: { from: number; to: number }) {\n  if (range.to < range.from) {\n    return { from: range.to, to: range.from };\n  }\n\n  return range;\n}\n\nfunction shouldAppendTrailingWildcard(value: string) {\n  return !value.endsWith('*') && !value.endsWith('*\"');\n}\n\n/**\n * Check if the next node after cursor position contains an opening bracket.\n * @internal\n */\nexport function _isFollowedByOpeningBracket(\n  editorState: EditorState,\n  head: number,\n) {\n  const tree = syntaxTree(editorState);\n\n  let cursor = tree.cursorAt(head, 1);\n\n  if (cursor.name === 'OpeningBracket') {\n    return true;\n  }\n\n  if (cursor.node.name === 'Filter' || cursor.node.name === 'FilterStatement') {\n    cursor = tree.cursorAt(head, -1);\n  }\n\n  if (!cursor.next()) {\n    return false;\n  }\n\n  if (cursor.name === 'OpeningBracket' && cursor.node.from >= head) {\n    return true;\n  }\n\n  if (cursor.name === '\u26A0') {\n    if (cursor.next() && cursor.node.from >= head) {\n      // the first check handles cases like `foo = (bar` and the FilterGroup check handles cases like `foo = (bar, baz)`, that already includes an opening bracket\n      // @ts-expect-error the cursor name type changed by calling next, but typescript doesn't recognize it\n      if (cursor.name === 'OpeningBracket' || cursor.name === 'FilterGroup') {\n        return true;\n      }\n    }\n  }\n\n  if (cursor.name === 'FilterIncludesValue') {\n    if (cursor.next() && cursor.node.from >= head) {\n      // if the node is a list node, we know it already includes an opening bracket and otherwise we check if it's just an opening bracket node\n      // @ts-expect-error the cursor name type changed by calling next, but typescript doesn't recognize it\n      if (cursor.name === 'OpeningBracket' || cursor.name === 'List') {\n        return true;\n      }\n    }\n  }\n\n  // keep track of the cursor at the next position for cases like (a = 1) (a = b) at index 6 or foo = bar (test, bla) at index 8\n  const cursorAtExactPosition = tree.cursorAt(head + 1, 1);\n\n  if (cursorAtExactPosition.node.name === 'OpeningBracket') {\n    return true;\n  }\n\n  cursorAtExactPosition.parent();\n\n  if (\n    cursorAtExactPosition.node.name !== 'Filter' &&\n    cursor.node.name === 'FilterGroup'\n  ) {\n    return true;\n  }\n\n  return false;\n}\n\n/**\n * Check whether the node that is be entered at the given position is the last value in a list.\n * @internal\n */\nexport function insertionIsLastListValue(\n  cursorPosition: number,\n  editorState: EditorState,\n): boolean {\n  const tree = syntaxTree(editorState);\n  const cursor = tree.cursorAt(cursorPosition, 1);\n\n  // If the cursor is right before a closing bracket, we definitely have a next sibling.\n  if (\n    cursor.node.name === 'ClosingBracket' &&\n    cursorPosition === cursor.node.from\n  ) {\n    if (cursor.parent() && cursor.name === 'List') {\n      return true;\n    }\n  }\n\n  return false;\n}\n"],
+  "mappings": "AAAA,SAAS,kBAAkB;AAC3B,SAAS,mBAAmB;AAE5B,SAAS,wBAAwB;AACjC,SAAS,0BAA0B;AACnC,SAAS,wBAAwB;AACjC,SAAS,uCAAuC;AAChD;AAAA,EACE;AAAA,EACA;AAAA,EACA;AAAA,OACK;AACP,SAAS,yBAAyB;AAClC,SAAS,oCAAoC;AAUtC,SAAS,yBACd,iBACA,OACA,wBACA,UACA,mBACA,sBACA,oBACA,aACA;AACA,QAAM,EAAE,OAAO,kBAAkB,kBAAkB,IAAI;AACvD,QAAM,mBAAmB,YAAY;AACrC,QAAM,EAAE,KAAK,IAAI,iBAAiB;AAElC,MAAI,mBAAmB;AACvB,MAAI,CAAC,kBAAkB;AACrB,uBAAmB;AAAA,MACjB,MAAM;AAAA,MACN,OAAO,EAAE,MAAM,MAAM,MAAM,MAAM,IAAI,MAAM,MAAM,GAAG;AAAA,IACtD;AAAA,EACF;AAEA,QAAM,uBACH,sBAAsB,mBACrB,2BAA2B,UAC7B;AAEF,QAAM,wBAAwB,YAAY,IAAI,SAAS,EAAE;AAEzD,QAAM,2CAA2C,UAAU,SAAS,OAAO;AAC3E,QAAM,gCAAgC,CAAC,QAAQ,UAAU,EAAE;AAAA,IACzD;AAAA,EACF;AACA,QAAM,2BAA2B,CAAC,OAAO,MAAM,EAAE,SAAS,eAAe;AAEzE,QAAM,gBAAgB,iBAAiB,MAAM,WAAW;AAMxD,MAAI,iCAAiC,UAAU,QAAW;AACxD,WAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,EACF;AAEA,QAAM,yBAAyB,GAC7B,wBAAwB,CAAC,2CACrB,iBAAiB,eAAe,IAChC,eACN,GAAG,YAAY,EAAE;AAEjB,QAAM,eAAe,uBAAuB,QAAQ;AACpD,QAAM,mBAAmB,aAAa,MAAM,oBAAoB;AAChE,QAAM,WAAW,uBAAuB,MAAM,EAAE,MAAM;AAEtD,MAAI,gBAAgB;AACpB,MAAI,cAAc,MAAM,MAAM;AAC9B,MAAI,eAAe,MAAM,MAAM;AAC/B,MAAI,cAAc;AAClB,MAAI,kBAAkB;AACtB,MAAI,qBAAqB;AACzB,MAAI,mBAAmB;AACvB,MAAI,sBAAsB;AAC1B,MAAI,2BAA2B;AAE/B,QAAM,+BAA+B;AAAA,IACnC;AAAA,IACA;AAAA,EACF;AAIA,MACE,MAAM,SAAS,UACf,OAAO,MAAM,MAAM,QACnB,OAAO,MAAM,MAAM,MACnB,sBAAsB,iBACtB;AACA,kBAAc;AACd,mBAAe;AAAA,EACjB;AAEA,QAAM,EAAE,MAAM,IAAI,oBAAoB,CAAC;AACvC,QAAM,eACJ,MAAM,MAAM,SAAS,OAAO,MAAM,QAClC,MAAM,MAAM,OAAO,OAAO,MAAM;AAMlC,MAAI,kBAAkB;AACpB,kBAAc,CAAC,gBACX,eAAe,MAAM,aAAa,EAAE,yBAAyB,KAAK,CAAC,IACnE;AACJ,yBACE,gBACA,iBAAiB,oBAAoB,SAAS,yBAC7C,iBAAiB,mBAAmB,UAAU,iBAC7C,iBAAiB,mBAAmB,UAAU;AAClD,uBACE,gBACA,iBAAiB,oBAAoB,SAAS,yBAC7C,iBAAiB,mBAAmB,UAAU,eAC7C,iBAAiB,mBAAmB,UAAU;AAElD,QAAI,eAAe,yBAAyB,MAAM,WAAW,GAAG;AAG9D,wBAAkB;AAAA,IACpB;AAQA,QACE,sBAAsB,uBACrB,oBACC,iBAAiB,SACjB,CAAC,gCACH,oBACA;AACA,oBAAc;AACd,qBAAe,iBAAiB,MAAM;AAAA,IACxC,WACE,4CACA,CAAC,gBACD,UAAU,UACV,iBAAiB,OACjB;AAIA,iCAA2B;AAC3B,oBAAc;AACd,qBAAe,iBAAiB,MAAM,MAAM;AAAA,IAC9C;AAEA,oBACE,eAAe,sBAAsB,WACjC,eACA;AACN,UAAM,mBAAmB,sBAAsB;AAE/C,QAAI,4BAA4B,iBAAiB,OAAO;AACtD,YAAM,kBAAkB,gBAAgB,SAAS,IAAI;AACrD,YAAM,oBAAoB,YAAY,IAAI,SAAS,IAAI;AACvD,YAAM,eAAe;AAAA,QACnB,iBAAiB,MAAM;AAAA,QACvB;AAAA,QACA;AAAA,MACF;AACA,YAAM,eAAe,gBAAgB,WAAW,IAAI,IAAI,QAAQ;AAChE,sBAAgB,cACZ,GAAG,YAAY,GAAG,YAAY,KAC9B,GAAG,YAAY,GAAG,YAAY;AAAA,IACpC;AAKA,SACG,sBAAsB,qBACvB,sBAAsB,iBACtB;AACA,UAAI,EAAE,MAAM,GAAG,IAAI;AAAA,QACjB,MAAM,iBAAiB,MAAM;AAAA,QAC7B,IAAI,iBAAiB,MAAM;AAAA,MAC7B;AAEA,UAAI,iBAAiB,OAAO;AAC1B,SAAC,EAAE,MAAM,GAAG,IAAI,iBAAiB,MAAM;AAAA,MACzC;AAEA,UACE,uBACE,OAAO,QAAQ,OAAO,MAAQ,CAAC,oBAAoB,SAAS,OAC9D;AACA,6BAAqB;AACrB,YAAI,6BAA6B,YAAY,GAAG;AAC9C,0BACE,oBAAoB,CAAC,aAAa,WAAW,GAAG,IAC5C,IAAI,YAAY,MAChB,GAAG,YAAY;AAErB,0BAAgB,GAAG,aAAa,GAC9B,CAAC,eAAe,WAAW,MAAM,EACnC;AAAA,QACF;AAAA,MACF,OAAO;AACL,YAAI,SAAS,QAAS,sBAAsB,SAAS,IAAK;AACxD,wBAAc;AACd,0BAAgB;AAAA,QAClB;AAEA,uBAAe;AACf,6BAAqB;AACrB,sBAAc;AAAA,MAChB;AAAA,IACF;AAAA,EACF,OAAO;AACL,oBAAgB,cAAc,eAAe;AAAA,EAC/C;AAEA,MAAI;AAEJ,UAAQ,mBAAmB;AAAA,IACzB,KAAK;AACH,uBAAiB;AAAA,QACf,MAAM;AAAA,QACN,IAAI;AAAA,MACN;AACA;AAAA,IACF,KAAK,qBAAqB;AACxB,YAAMA,eAAc,YAAY,OAAO;AAAA,QACrC,KAAK;AAAA,QACL,YAAY,CAAC,4BAA4B;AAAA,MAC3C,CAAC;AACD,YAAM,mBAAmB;AAAA,QACvB,uBAAuB;AAAA,QACvBA;AAAA,MACF;AAEA,UAAI,mBAAmB,gBAAgB,MAAM,YAAY;AACvD,wBAAgB;AAChB,sBAAc;AAAA,MAChB;AAEA,uBAAiB;AAAA,QACf,MAAM,KAAK;AAAA,UACT;AAAA,UACA,kBAAkB,MAAM,QAAQ;AAAA,QAClC;AAAA,QACA,IAAI,KAAK,IAAI,uBAAuB,kBAAkB,MAAM,MAAM,IAAI;AAAA,MACxE;AAEA,UAAI,kBAAkB,KAAK,GAAG;AAC5B,sBAAc;AACd,YAAI,aAAa;AACf,0BAAgB;AAAA,QAClB;AAEA,yBAAiB;AAAA,UACf,MAAM,KAAK,IAAI,uBAAuB,MAAM,MAAM,IAAI;AAAA,UACtD,IAAI,KAAK,IAAI,uBAAuB,MAAM,MAAM,EAAE;AAAA,QACpD;AAAA,MACF;AACA;AAAA,IACF;AAAA,IACA,KAAK;AAEH,sBAAgB;AAChB,oBAAc;AACd,uBAAiB;AAAA,QACf,MAAM;AAAA,QACN,IAAI,YAAY,IAAI,SAAS,EAAE;AAAA,MACjC;AACA;AAAA,IACF,SAAS;AACP,WACG,MAAM,SAAS,YACd,MAAM,SAAS,SACf,MAAM,SAAS,YACjB,UAAU,QACV;AAIA,YAAI,MAAM,MAAM,MAAM,kBAAkB,MAAM,MAAM,IAAI;AACtD,gBAAM,sBAAsB;AAAA,YAC1B;AAAA,cACE,MAAM,MAAM,MAAM;AAAA,cAClB,IAAI,MAAM,MAAM,KAAK;AAAA,YACvB;AAAA,YACA,YAAY,IAAI,SAAS;AAAA,UAC3B;AAGA,cAAI,wBAAwB,KAAK;AAC/B,0BAAc;AACd,4BAAgB;AAAA,UAClB;AAAA,QACF;AAEA,YAAI,OAAO,MAAM,MAAM,QAAQ,OAAO,MAAM,MAAM,IAAI;AACpD,gBAAM,iBAAiB,MAAM,UAAU,MAAM,WAAW;AACxD,gBAAM,kCACJ,uBAAuB,MAAM,WAAW,KACxC,uBAAuB,MAAM,YAAY;AAE3C,cAAI,kBAAkB,CAAC,iCAAiC;AACtD,0BAAc,MAAM,MAAM,OAAO;AACjC,2BAAe,MAAM,MAAM;AAE3B,kBAAMC,YAAW,cAAc,MAAM,EAAE,MAAM;AAE7C,4BAAgBA,YAAW,GAAG,YAAY,OAAO,GAAG,YAAY;AAChE,kCAAsBA;AAAA,UACxB;AAAA,QACF;AAAA,MACF,WAAW,OAAO;AAChB,SAAC,EAAE,MAAM,aAAa,IAAI,aAAa,IAAI;AAS3C,YACE,gBAAgB,gBAChB,MAAM,MAAM,SAAS,eACpB,MACC,+BACF,MAAM,MACN;AACA,yBAAe,MAAM,MAAM;AAAA,QAC7B;AAAA,MACF;AAEA,uBAAiB;AAAA,QACf,MAAM,KAAK,IAAI,uBAAuB,WAAW;AAAA,QACjD,IAAI,KAAK,IAAI,uBAAuB,YAAY;AAAA,MAClD;AAAA,IACF;AAAA,EACF;AAIA,mBAAiB,eAAe,cAAc;AAE9C,MAAI,SACF,sBAAsB,WAClB,OAAO,cAAc,SACrB,KAAK,IAAI,uBAAuB,eAAe,IAAI,KAClD,eAAe,CAAC,kBACb,uBAAuB,SACvB,cAAc,WACjB,sBAAsB,kBAAkB,CAAC,qBAAqB,KAC/D,CAAC;AAMP,OACG,wBAAwB,6CACzB,CAAC,0BACD;AACA,UAAM,iBAAiB,WAAW,SAAS,SAAS;AACpD,cACE,kBACC,wBACD,EAAE,4BAA4B,4CAC1B,IACA;AAAA,EACR;AAKA,QAAM,eACJ,yBACC,eAAe,KAAK,eAAe,QACpC,cAAc;AAChB,WAAS,KAAK,IAAI,GAAG,KAAK,IAAI,QAAQ,YAAY,CAAC;AAEnD,SAAO;AAAA,IACL,SAAS;AAAA,MACP,GAAG;AAAA,MACH,QAAQ;AAAA,IACV;AAAA,IACA,WAAW;AAAA,MACT;AAAA;AAAA;AAAA,MAGA,GAAI,CAAC,4BAA4B,2CAC7B,EAAE,MAAM,SAAS,EAAE,IACnB,CAAC;AAAA;AAAA,IACP;AAAA,EACF;AACF;AAMA,SAAS,uDACP,iBACA,kBACA,OACA,UACA,MACA,uBACA,aACA,eACA;AACA,MAAI,gBAAgB;AAGpB,MAAI,kBAAkB,OAAO;AAC3B,QAAI,mBAAmB,iBAAiB,MAAM;AAM9C,uBAAmB,iBAChB,QAAQ,OAAO,EAAE,EACjB,QAAQ,cAAc,EAAE;AAE3B,QAAI,iBAAiB,MAAM,SAAS,QAAQ;AAG1C,sBAAgB,GAAG,aAAa,GAAG,iBAAiB,QAAQ,CAAC;AAAA,IAC/D,OAAO;AACL,sBAAgB,GAAG,aAAa,GAAG,gBAAgB;AAAA,IACrD;AAAA,EACF;AAIA,MAAI,iBAAiB;AAAA,IACnB,MAAM,KAAK;AAAA,MACT;AAAA,MACA,kBAAkB,oBAAoB,MAAM,QAAQ,MAAM,MAAM;AAAA,IAClE;AAAA,IACA,IAAI,KAAK;AAAA,MACP;AAAA,MACA,kBAAkB,OAAO,MAAM,MAAM,MAAM,MAAM;AAAA,IACnD;AAAA,EACF;AAEA,mBAAiB,eAAe,cAAc;AAC9C,MAAI,SAAS,eAAe,OAAO,cAAc;AAGjD,kBAAgB,GAAG,aAAa,GAAG,QAAQ;AAI3C,QAAM,cAAc,CAAC,gBACjB,eAAe,MAAM,aAAa,EAAE,yBAAyB,KAAK,CAAC,IACnE;AACJ,kBAAgB,GAAG,cAAc,QAAQ,CAAC,GAAG,CAAC,cAAc,MAAM,EAAE;AAKpE,QAAM,eACJ,yBACC,eAAe,KAAK,eAAe,QACpC,cAAc;AAChB,WAAS,KAAK,IAAI,GAAG,KAAK,IAAI,QAAQ,YAAY,CAAC;AAEnD,SAAO;AAAA,IACL,SAAS;AAAA,MACP,GAAG;AAAA,MACH,QAAQ;AAAA,IACV;AAAA,IACA,WAAW;AAAA,MACT;AAAA,IACF;AAAA,EACF;AACF;AAEA,SAAS,0BACP,WACA,iBACA,kBACQ;AACR,MAAI,OAAO;AACX,MAAI,KAAK,WAAW,IAAI,GAAG;AACzB,WAAO,IAAI,KAAK,MAAM,CAAC,CAAC;AAAA,EAC1B,WAAW,KAAK,WAAW,GAAG,GAAG;AAC/B,WAAO,KAAK,MAAM,CAAC;AAAA,EACrB;AACA,MAAI,KAAK,SAAS,IAAI,GAAG;AACvB,WAAO,GAAG,KAAK,MAAM,GAAG,EAAE,CAAC;AAAA,EAC7B,WAAW,KAAK,SAAS,GAAG,GAAG;AAC7B,WAAO,KAAK,MAAM,GAAG,EAAE;AAAA,EACzB;AACA,MAAI,KAAK,WAAW,GAAG,KAAK,KAAK,SAAS,GAAG,GAAG;AAC9C,QAAI,UAAU,KAAK,MAAM,GAAG,EAAE;AAC9B,QAAI,QAAQ,WAAW,GAAG,GAAG;AAC3B,gBAAU,QAAQ,MAAM,CAAC;AAAA,IAC3B;AACA,QAAI,QAAQ,SAAS,GAAG,GAAG;AACzB,gBAAU,QAAQ,MAAM,GAAG,EAAE;AAAA,IAC/B;AACA,WAAO,IAAI,kBAAkB,MAAM,EAAE,GAAG,OAAO,GAAG,mBAAmB,MAAM,EAAE;AAAA,EAC/E;AACA,SAAO,GAAG,kBAAkB,MAAM,EAAE,GAAG,IAAI,GAAG,mBAAmB,MAAM,EAAE;AAC3E;AAQA,SAAS,eAAe,OAAqC;AAC3D,MAAI,MAAM,KAAK,MAAM,MAAM;AACzB,WAAO,EAAE,MAAM,MAAM,IAAI,IAAI,MAAM,KAAK;AAAA,EAC1C;AAEA,SAAO;AACT;AAEA,SAAS,6BAA6B,OAAe;AACnD,SAAO,CAAC,MAAM,SAAS,GAAG,KAAK,CAAC,MAAM,SAAS,IAAI;AACrD;AAMO,SAAS,4BACd,aACA,MACA;AACA,QAAM,OAAO,WAAW,WAAW;AAEnC,MAAI,SAAS,KAAK,SAAS,MAAM,CAAC;AAElC,MAAI,OAAO,SAAS,kBAAkB;AACpC,WAAO;AAAA,EACT;AAEA,MAAI,OAAO,KAAK,SAAS,YAAY,OAAO,KAAK,SAAS,mBAAmB;AAC3E,aAAS,KAAK,SAAS,MAAM,EAAE;AAAA,EACjC;AAEA,MAAI,CAAC,OAAO,KAAK,GAAG;AAClB,WAAO;AAAA,EACT;AAEA,MAAI,OAAO,SAAS,oBAAoB,OAAO,KAAK,QAAQ,MAAM;AAChE,WAAO;AAAA,EACT;AAEA,MAAI,OAAO,SAAS,UAAK;AACvB,QAAI,OAAO,KAAK,KAAK,OAAO,KAAK,QAAQ,MAAM;AAG7C,UAAI,OAAO,SAAS,oBAAoB,OAAO,SAAS,eAAe;AACrE,eAAO;AAAA,MACT;AAAA,IACF;AAAA,EACF;AAEA,MAAI,OAAO,SAAS,uBAAuB;AACzC,QAAI,OAAO,KAAK,KAAK,OAAO,KAAK,QAAQ,MAAM;AAG7C,UAAI,OAAO,SAAS,oBAAoB,OAAO,SAAS,QAAQ;AAC9D,eAAO;AAAA,MACT;AAAA,IACF;AAAA,EACF;AAGA,QAAM,wBAAwB,KAAK,SAAS,OAAO,GAAG,CAAC;AAEvD,MAAI,sBAAsB,KAAK,SAAS,kBAAkB;AACxD,WAAO;AAAA,EACT;AAEA,wBAAsB,OAAO;AAE7B,MACE,sBAAsB,KAAK,SAAS,YACpC,OAAO,KAAK,SAAS,eACrB;AACA,WAAO;AAAA,EACT;AAEA,SAAO;AACT;AAMO,SAAS,yBACd,gBACA,aACS;AACT,QAAM,OAAO,WAAW,WAAW;AACnC,QAAM,SAAS,KAAK,SAAS,gBAAgB,CAAC;AAG9C,MACE,OAAO,KAAK,SAAS,oBACrB,mBAAmB,OAAO,KAAK,MAC/B;AACA,QAAI,OAAO,OAAO,KAAK,OAAO,SAAS,QAAQ;AAC7C,aAAO;AAAA,IACT;AAAA,EACF;AAEA,SAAO;AACT;",
   "names": ["editorState", "addSpace"]
 }

package/esm/filters/filter-field/utils/suggestions-utils/operator-suggestions.js

@@ -9,7 +9,7 @@ function getComparisonOperatorSuggestions(key, internalValidatorMap, parserConfi
     key,
     internalValidatorMap,
     parserConfig
-  );
+  ).filter((op) => op !== "matches-wildcard" && op !== "not-matches-wildcard");
   return operators.map((operator) => {
     const operatorWithDetails = operatorSuggestionsWithDetails[operator];
     const baseProps = {