@dynatrace/strato-components 3.5.0 → 3.6.0

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 {\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 (!trimmedValue.endsWith('*')) {\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      }\n\n      insertionRange = {\n        from: Math.min(currentDocumentLength, replaceFrom),\n        to: Math.min(currentDocumentLength, replaceUntil),\n      };\n    }\n  }\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  insertionRange = getSortedRange(insertionRange);\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\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;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,CAAC,aAAa,SAAS,GAAG,GAAG;AAC/B,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;AAAA,MAC7C;AAEA,uBAAiB;AAAA,QACf,MAAM,KAAK,IAAI,uBAAuB,WAAW;AAAA,QACjD,IAAI,KAAK,IAAI,uBAAuB,YAAY;AAAA,MAClD;AAAA,IACF;AAAA,EACF;AAEA,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,mBAAiB,eAAe,cAAc;AAE9C,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;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 {\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 (!trimmedValue.endsWith('*')) {\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      }\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\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;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,CAAC,aAAa,SAAS,GAAG,GAAG;AAC/B,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;AAAA,MAC7C;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;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/get-suggestions.js

@@ -7,6 +7,11 @@ import {
   getComparisonOperatorSuggestions
 } from "./operator-suggestions.js";
 import { getJSONPathHint, getPastingSuggestion } from "./shared-suggestions.js";
+import {
+  getSuggestionMatchPriority,
+  normalizeSuggestionMatchText,
+  suggestionMatchesTerm
+} from "./suggestion-matching.js";
 import { getValidValueTypes } from "./suggestion-type.js";
 import {
   getValueSuggestionGroups,
@@ -121,7 +126,10 @@ function getSuggestions({
     comparisonOperatorSuggestions = filterSuggestions(
       comparisonOperatorSuggestions,
       currentToken,
-      overlappingSuggestions ? overlappingSuggestions.subToken.textValue.trim() : getTypedOperatorFromCurrentStatement(currentStatement)
+      overlappingSuggestions ? overlappingSuggestions.subToken.textValue.trim() : getTypedOperatorFromCurrentStatement(currentStatement),
+      // Operator details (e.g. "equals", "not equals") are display-only
+      // localized labels — never a match target.
+      { includeDetails: false }
     );
     if (overlappingSuggestions) {
       comparisonOperatorSuggestions = comparisonOperatorSuggestions.map(
@@ -152,7 +160,8 @@ function getSuggestions({
     logicalOperatorSuggestions = filterSuggestions(
       defaultLogicalOperatorSuggestions,
       currentToken,
-      currentValue
+      currentValue,
+      { includeDetails: false }
     );
   }
   if (suggestionTypes.find((value) => value === "key") && (currentToken.type === "JSONPath" || currentToken.type === "Error" && currentToken.textValue.match(JSONPATH_PATTERN_PARTIAL))) {
@@ -168,9 +177,9 @@ function getSuggestions({
   };
 }
 function trimEscapedCharacters(value) {
-  return value.replace(/(["'\\])/g, "").toLowerCase();
+  return normalizeSuggestionMatchText(value);
 }
-function filterSuggestions(providedSuggestions, currentToken, currentValue) {
+function filterSuggestions(providedSuggestions, currentToken, currentValue, options) {
   const textValue = trimEscapedCharacters(currentValue);
   return providedSuggestions.filter((suggestion) => {
     if (Array.isArray(currentToken.value)) {
@@ -182,10 +191,7 @@ function filterSuggestions(providedSuggestions, currentToken, currentValue) {
     if (suggestion.value === "OR" && currentToken.value !== currentToken.textValue) {
       return false;
     }
-    const trimmedValue = trimEscapedCharacters(suggestion.value);
-    const trimmedDisplayValue = typeof suggestion.displayValue === "string" ? trimEscapedCharacters(suggestion.displayValue) : void 0;
-    const matchTarget = trimmedDisplayValue ?? trimmedValue;
-    return matchTarget.includes(`${textValue ?? ""}`);
+    return suggestionMatchesTerm(suggestion, textValue, options);
   });
 }
 function isSuggestionTypeNumber(suggestion) {
@@ -227,15 +233,6 @@ function compareDurations(a, b) {
   }
   return getDurationNumericValue(a) - getDurationNumericValue(b);
 }
-function getMatchPriority(normalizedValue, needle) {
-  if (normalizedValue === needle) {
-    return 0;
-  }
-  if (normalizedValue.startsWith(needle)) {
-    return 1;
-  }
-  return 2;
-}
 function sortSuggestions(suggestions, isSortingEnabled, currentValue, suggestionsTypeOrder) {
   const { validatorMapSuggestions, otherSuggestions } = suggestions.reduce(
     (acc, currentSuggestion) => {
@@ -303,7 +300,7 @@ function sortSuggestionsGroup(suggestionsGroup, currentValue) {
     return suggestionsGroup.sort((a, b) => {
       const aNorm = trimEscapedCharacters(a.value ?? "");
       const bNorm = trimEscapedCharacters(b.value ?? "");
-      const priorityDiff = getMatchPriority(aNorm, currentValue) - getMatchPriority(bNorm, currentValue);
+      const priorityDiff = getSuggestionMatchPriority(a, currentValue) - getSuggestionMatchPriority(b, currentValue);
       if (priorityDiff !== 0) {
         return priorityDiff;
       }

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

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../../../../../src/filters/filter-field/utils/suggestions-utils/get-suggestions.ts"],
-  "sourcesContent": ["import type { FilterFieldOverlappingSuggestions } from './get-suggestion-category.js';\nimport {\n  getKeySuggestions,\n  JSONPATH_PATTERN_PARTIAL,\n} from './key-suggestions.js';\nimport {\n  defaultLogicalOperatorSuggestions,\n  getComparisonOperatorSuggestions,\n} from './operator-suggestions.js';\nimport { getJSONPathHint, getPastingSuggestion } from './shared-suggestions.js';\nimport type { SuggestionGroup } from './suggestion-group-utils.js';\nimport { getValidValueTypes } from './suggestion-type.js';\nimport {\n  getValueSuggestionGroups,\n  VALUE_GROUP_ID,\n} from './value-suggestions.js';\nimport type { FilterFieldProps } from '../../FilterField.types.js';\nimport type {\n  FilterFieldSuggestion,\n  FilterFieldSuggestionProps,\n} from '../../suggestions/Suggestion.types.js';\nimport type {\n  FilterFieldGroupedSuggestions,\n  FilterFieldSuggestionsCallback,\n} from '../../types/suggestions.js';\nimport type {\n  FilterFieldLezerNodeType,\n  FilterFieldStatementNode,\n  FilterFieldStatementTokenType,\n  FilterFieldValueNode,\n} from '../../types/tree-nodes.js';\nimport type {\n  FilterFieldComparisonOperators,\n  FilterFieldCustomTypes,\n} from '../../types/validation.js';\nimport { NEEDS_ESCAPING_REGEX } from '../escape-suggestion.js';\nimport { KEY_GROUP_ID } from '../validation-utils/normalize-validator-map.js';\nimport type {\n  InternalValidatorMap,\n  NormalizedKeyConfig,\n} from '../validation-utils/normalize-validator-map.js';\nimport { isWildCardOperator } from '../validation-utils/validation-helper-functions.js';\n\nconst comparisonOperatorAlias: Record<string, string> = {\n  '=*': '= *',\n  '!=*': '!= *',\n};\n\nfunction getCurrentValueFromToken(token: FilterFieldValueNode): string {\n  return token.type === 'String' || token.type === 'Key'\n    ? token.value\n    : token.textValue;\n}\n\nfunction getValueSuggestionsTypesFromKeyPredicate(\n  internalValidatorMap: InternalValidatorMap | undefined,\n  currentStatement: FilterFieldStatementNode | undefined,\n): string[] {\n  if (!internalValidatorMap || !currentStatement?.key?.value) {\n    return [];\n  }\n\n  const keyConfig: NormalizedKeyConfig | undefined =\n    internalValidatorMap.normalizedKeys.byKey.get(currentStatement.key.value);\n\n  if (!keyConfig) {\n    return [];\n  }\n\n  // Prefer the explicit valueType from the new array format; fall back to\n  // inferring types from the legacy valuePredicate.\n  // DEPRECATION: [APPDEV-16872] BREAKING-CHANGE: Remove support for inferring value types from the legacy valuePredicate.\n  // The new array format with explicit valueType should be used exclusively.\n  if (keyConfig.valueType) {\n    return getValidValueTypes({ type: keyConfig.valueType }).types;\n  }\n\n  return getValidValueTypes(keyConfig.valuePredicate).types;\n}\n\nfunction getTypedOperatorFromCurrentStatement(\n  currentStatement: FilterFieldStatementNode | undefined,\n): string {\n  const needle = currentStatement?.comparisonOperator\n    ? currentStatement.comparisonOperator.textValue\n    : '';\n  return comparisonOperatorAlias[needle] ?? needle;\n}\n\n/** @internal */\nexport function getSuggestions({\n  suggestionTypes,\n  overlappingSuggestions,\n  currentStatement,\n  currentToken,\n  currentTokenType,\n  prevNode,\n  internalValidatorMap,\n  customTypes,\n  parserConfig,\n  showLogicalOperators,\n  showInclusionOperators,\n  doc,\n  suggestionTypeForToken,\n}: {\n  suggestionTypes: NonNullable<\n    Parameters<FilterFieldSuggestionsCallback>[0]\n  >['suggestionTypes'];\n  overlappingSuggestions?: FilterFieldOverlappingSuggestions;\n  currentStatement: FilterFieldStatementNode | undefined;\n  currentToken: FilterFieldValueNode;\n  currentTokenType?: FilterFieldStatementTokenType;\n  prevNode: FilterFieldLezerNodeType | 'FilterValue';\n  internalValidatorMap?: InternalValidatorMap;\n  customTypes?: FilterFieldCustomTypes;\n  parserConfig?: FilterFieldProps['parserConfig'];\n  showLogicalOperators: boolean;\n  showInclusionOperators: boolean;\n  doc: string;\n  suggestionTypeForToken?: {\n    type: NonNullable<\n      Parameters<FilterFieldSuggestionsCallback>[0]\n    >['suggestionTypes'][number];\n    token: FilterFieldValueNode;\n  }[];\n}): {\n  groupedSuggestions: FilterFieldGroupedSuggestions;\n  logicalOperatorSuggestions: FilterFieldSuggestion[];\n  pastedContentSuggestions: FilterFieldSuggestion[];\n} {\n  const groupedSuggestions: FilterFieldGroupedSuggestions = {};\n\n  const currentValue = getCurrentValueFromToken(currentToken);\n\n  let pastedContentSuggestions: FilterFieldSuggestion[] = [];\n  const shouldSortAlphabetically =\n    internalValidatorMap?.sortSuggestions ?? true;\n\n  for (const { type: suggestionType, token } of suggestionTypeForToken ?? []) {\n    if (suggestionType === 'key') {\n      const currentValue = getCurrentValueFromToken(token);\n\n      const keySuggestionGroups = getKeySuggestions(\n        internalValidatorMap,\n        suggestionTypes,\n        customTypes,\n        doc,\n        token,\n      );\n\n      assignGroupsToSlots({\n        groups: keySuggestionGroups,\n        groupedSuggestions,\n        slotName: 'key',\n        implicitIdPrefix: KEY_GROUP_ID,\n        token,\n        currentValue,\n        shouldSortAlphabetically,\n      });\n    } else if (suggestionType === 'value') {\n      // These are the suggestions shown when no specific value is entered yet, inserting the \"value\" placeholder when applied.\n      const showDefaultValueOrWildcardSuggestions =\n        typeof currentStatement?.comparisonOperator?.value === 'string' &&\n        currentStatement?.comparisonOperator?.type !== 'Error' &&\n        isWildCardOperator(currentStatement);\n\n      // These are the suggestion to apply a specific value in combination with a wildcard operator.\n      // E.g. Contains \"foo\" or Ends with \"foo\"\n      const showWildcardValueSuggestions =\n        (prevNode === 'ExistsOperator' &&\n          currentTokenType === 'comparisonOperator') ||\n        isWildCardOperator(currentStatement);\n\n      const valueSuggestionGroups = getValueSuggestionGroups(\n        currentStatement?.key?.value,\n        currentStatement?.comparisonOperator?.value?.toString() as FilterFieldComparisonOperators,\n        internalValidatorMap,\n        token,\n        showDefaultValueOrWildcardSuggestions,\n        showWildcardValueSuggestions,\n        suggestionTypes.includes('pastedContent'),\n      );\n\n      const valueSuggestionsTypes = getValueSuggestionsTypesFromKeyPredicate(\n        internalValidatorMap,\n        currentStatement,\n      );\n\n      assignGroupsToSlots({\n        groups: valueSuggestionGroups,\n        groupedSuggestions,\n        slotName: 'value',\n        implicitIdPrefix: VALUE_GROUP_ID,\n        token,\n        currentValue,\n        shouldSortAlphabetically,\n        suggestionsTypeOrder: valueSuggestionsTypes,\n      });\n    } else if (\n      suggestionType === 'pastedContent' &&\n      token.textValue?.match(NEEDS_ESCAPING_REGEX)\n    ) {\n      pastedContentSuggestions = [getPastingSuggestion()];\n    }\n  }\n\n  if (\n    suggestionTypes.includes('comparisonOperator') ||\n    showInclusionOperators\n  ) {\n    let key = currentStatement?.key?.textValue ?? '';\n\n    // If we have overlapping suggestions (free text node), we need to exclude the part of the key\n    // that may already start a comparison operator to get the correct comparators from the validator\n    // map, if present.\n    // E.g.: \u203Ahealth !\u2039 (only one token) -> get comparators for \"health\"\n    if (overlappingSuggestions) {\n      const normalizedKeyEnd =\n        overlappingSuggestions.subToken.range.from -\n        (currentStatement?.range.from ?? 0);\n      key = key.slice(0, normalizedKeyEnd).trim();\n    }\n\n    let comparisonOperatorSuggestions = getComparisonOperatorSuggestions(\n      key,\n      internalValidatorMap,\n      parserConfig,\n    );\n\n    comparisonOperatorSuggestions = filterSuggestions(\n      comparisonOperatorSuggestions,\n      currentToken,\n      overlappingSuggestions\n        ? overlappingSuggestions.subToken.textValue.trim()\n        : getTypedOperatorFromCurrentStatement(currentStatement),\n    );\n\n    // If we have overlapping suggestions, we store the range that should be replaced in a data-attribute\n    // that we can read when applying the suggestion to only replace parts of a free text token.\n    // E.g.:\n    // cluster not in\n    // stored overlapping range: 8 - 14\n    if (overlappingSuggestions) {\n      comparisonOperatorSuggestions = comparisonOperatorSuggestions.map(\n        (suggestion): FilterFieldSuggestion => ({\n          ...suggestion,\n          insertionRange: overlappingSuggestions.subToken.range,\n          escapeSuggestion: false,\n        }),\n      );\n      // If there are no overlapping suggestions, we reset the data-attributes to take whatever range we get from\n      // the actual tokens.\n      // E.g.:\n      /*\n        Initial input: \u203Acluster not in\u2039\n          -> one free text token with overlapping suggestions.\n          -> data-attributes are written to the dom.\n        Typing '(' -> \u203Acluster not in (\u2039\n          -> the suggestion is still the same, so react doesn't re-create the node. we have the same data attributes.\n          -> applying the suggestion would only replace from 8 to 14, so we would end up with \u203Acluster not in ()(\u2039\n        Resetting the data-attributes, we use the appropriate range again.\n       */\n    } else {\n      comparisonOperatorSuggestions = comparisonOperatorSuggestions.map(\n        (suggestion): FilterFieldSuggestion => ({\n          ...suggestion,\n          insertionRange: undefined,\n          escapeSuggestion: false,\n        }),\n      );\n    }\n\n    if (\n      comparisonOperatorSuggestions.length > 0 &&\n      !suggestionTypes.includes('pastedContent')\n    ) {\n      groupedSuggestions.comparisonOperator = {\n        id: 'strato-filter-field-comparator-suggestions',\n        suggestions: comparisonOperatorSuggestions,\n      };\n    }\n  }\n\n  let logicalOperatorSuggestions: FilterFieldSuggestion[] = [];\n  if (showLogicalOperators) {\n    logicalOperatorSuggestions = filterSuggestions(\n      defaultLogicalOperatorSuggestions,\n      currentToken,\n      currentValue,\n    );\n  }\n\n  if (\n    suggestionTypes.find((value) => value === 'key') &&\n    (currentToken.type === 'JSONPath' ||\n      (currentToken.type === 'Error' &&\n        currentToken.textValue.match(JSONPATH_PATTERN_PARTIAL)))\n  ) {\n    groupedSuggestions.key = {\n      id: 'strato-filter-field-key-suggestions',\n      suggestions: [getJSONPathHint()],\n    };\n  }\n\n  return {\n    groupedSuggestions,\n    logicalOperatorSuggestions,\n    pastedContentSuggestions,\n  };\n}\n\nfunction trimEscapedCharacters(value: string) {\n  return value.replace(/([\"'\\\\])/g, '').toLowerCase();\n}\n\n/**\n * @internal\n */\nexport function filterSuggestions(\n  providedSuggestions: FilterFieldSuggestion[],\n  currentToken: FilterFieldValueNode,\n  currentValue: string,\n) {\n  const textValue = trimEscapedCharacters(currentValue);\n  return providedSuggestions.filter((suggestion) => {\n    if (Array.isArray(currentToken.value)) {\n      return true;\n    }\n\n    if (!suggestion.value) {\n      return true;\n    }\n\n    // This check is needed to correctly filter the OR suggestion if there\n    // are quotes or escaped characters\n    if (\n      suggestion.value === 'OR' &&\n      currentToken.value !== currentToken.textValue\n    ) {\n      return false;\n    }\n\n    const trimmedValue = trimEscapedCharacters(suggestion.value);\n    const trimmedDisplayValue =\n      typeof suggestion.displayValue === 'string'\n        ? trimEscapedCharacters(suggestion.displayValue)\n        : undefined;\n\n    const matchTarget = trimmedDisplayValue ?? trimmedValue;\n    return matchTarget.includes(`${textValue ?? ''}`);\n  });\n}\n\n/**\n * Check whether a suggestion is of type number\n */\nfunction isSuggestionTypeNumber(\n  suggestion: FilterFieldSuggestionProps,\n): boolean {\n  if (suggestion.valueType) {\n    return suggestion.valueType === 'Number';\n  }\n\n  const value = trimEscapedCharacters(suggestion.value ?? '');\n  return value ? value.trim() !== '' && !isNaN(Number(value)) : false;\n}\n\n/**\n * Check wheter a suggestion if of type duration\n */\nfunction isSuggestionTypeDuration(\n  suggestion: FilterFieldSuggestionProps,\n): boolean {\n  if (suggestion.valueType) {\n    return suggestion.valueType === 'Duration';\n  }\n\n  const value = trimEscapedCharacters(suggestion.value ?? '');\n  return /^\\d+(ns|ms|s|m|h|d)$/.test(value ?? '');\n}\n\n/**\n * Extract the numeric part from a duration string (e.g. \"200ms\" -\\> 200).\n */\nfunction getDurationNumericValue(value: string): number {\n  const match = /^(\\d+)(ns|ms|s|m|h|d)$/.exec(value);\n  return match ? Number(match[1]) : 0;\n}\n\n/**\n * Extract the unit part from a duration string (e.g. \"200ms\" -\\> \"ms\").\n */\nfunction getDurationUnit(value: string): string {\n  const match = /^\\d+(ns|ms|s|m|h|d)$/.exec(value);\n  return match ? match[1] : '';\n}\n\nconst DURATION_UNIT_ORDER: Record<string, number> = {\n  ns: 0,\n  ms: 1,\n  s: 2,\n  m: 3,\n  h: 4,\n  d: 5,\n};\n\n/**\n * Compare two duration strings by unit order first, then by numeric value.\n */\nfunction compareDurations(a: string, b: string): number {\n  const unitA = getDurationUnit(a);\n  const unitB = getDurationUnit(b);\n  const unitDiff =\n    (DURATION_UNIT_ORDER[unitA] ?? 0) - (DURATION_UNIT_ORDER[unitB] ?? 0);\n  if (unitDiff !== 0) {\n    return unitDiff;\n  }\n  return getDurationNumericValue(a) - getDurationNumericValue(b);\n}\n\n/**\n * Get the priority for sorting matches.\n */\nfunction getMatchPriority(normalizedValue: string, needle: string): number {\n  if (normalizedValue === needle) {\n    return 0;\n  }\n  if (normalizedValue.startsWith(needle)) {\n    return 1;\n  }\n\n  return 2;\n}\n\n/**\n * Sort key/value suggestions alphabetically, or by match position when the user has typed something.\n * When currentValue is non-empty, suggestions are ordered: exact \u2192 starts-with \u2192 contains-middle/ends-with.\n * Within each tier suggestions are ordered alphabetically.\n * Numeric string values (e.g. \"1\", \"10\", \"20\") are sorted numerically and placed before non-numeric strings.\n * For value suggestions with mixed types, suggestions are first grouped by their valueType in the order defined in the valuePredicate,\n * and each group is sorted independently.\n *\n * Default sorting can be disabled by the isSortingEnabled param.\n */\nfunction sortSuggestions(\n  suggestions: FilterFieldSuggestionProps[],\n  isSortingEnabled: boolean,\n  currentValue: string,\n  suggestionsTypeOrder?: string[],\n) {\n  const { validatorMapSuggestions, otherSuggestions } = suggestions.reduce<{\n    validatorMapSuggestions: FilterFieldSuggestionProps[];\n    otherSuggestions: FilterFieldSuggestionProps[];\n  }>(\n    (acc, currentSuggestion) => {\n      if (currentSuggestion.suggestionType === 'validatorMap') {\n        acc.validatorMapSuggestions.push(currentSuggestion);\n      } else {\n        acc.otherSuggestions.push(currentSuggestion);\n      }\n\n      return acc;\n    },\n    { validatorMapSuggestions: [], otherSuggestions: [] },\n  );\n\n  currentValue = currentValue ? trimEscapedCharacters(currentValue) : '';\n  const shouldSortMixedSuggestionsTypes =\n    isSortingEnabled && suggestionsTypeOrder && suggestionsTypeOrder.length > 1;\n\n  // sort mixed type value suggestions by types order\n  if (shouldSortMixedSuggestionsTypes) {\n    return [\n      ...sortMixedSuggestionTypes(\n        validatorMapSuggestions,\n        suggestionsTypeOrder,\n        currentValue,\n      ),\n      ...otherSuggestions,\n    ];\n  }\n\n  if (currentValue || isSortingEnabled) {\n    return [\n      ...sortSuggestionsGroup(validatorMapSuggestions, currentValue),\n      ...otherSuggestions,\n    ];\n  }\n\n  return [...validatorMapSuggestions, ...otherSuggestions];\n}\n\n/**\n * Sort mixed types value suggestions.\n */\nfunction sortMixedSuggestionTypes(\n  validatorMapSuggestions: FilterFieldSuggestionProps[],\n  suggestionsTypeOrder: string[],\n  currentValue: string,\n) {\n  const suggestionsGroups = new Map<string, FilterFieldSuggestionProps[]>();\n  const ungroupedSuggestions: FilterFieldSuggestionProps[] = [];\n\n  for (const suggestion of validatorMapSuggestions) {\n    const { valueType } = suggestion;\n    if (valueType !== undefined && suggestionsTypeOrder.includes(valueType)) {\n      let suggestionGroup = suggestionsGroups.get(valueType);\n      if (!suggestionGroup) {\n        suggestionGroup = [];\n        suggestionsGroups.set(valueType, suggestionGroup);\n      }\n      suggestionGroup.push(suggestion);\n    } else {\n      ungroupedSuggestions.push(suggestion);\n    }\n  }\n\n  const sortedResult: FilterFieldSuggestionProps[] = [];\n\n  for (const suggestionType of suggestionsTypeOrder) {\n    sortedResult.push(\n      ...sortSuggestionsGroup(\n        suggestionsGroups.get(suggestionType) ?? [],\n        currentValue,\n      ),\n    );\n  }\n  sortedResult.push(\n    ...sortSuggestionsGroup(ungroupedSuggestions, currentValue),\n  );\n\n  return sortedResult;\n}\n\n/**\n * Sort a single group of suggestions by match position when currentValue is set,\n * or alphabetically (numbers first, then durations, then strings) otherwise.\n */\nfunction sortSuggestionsGroup(\n  suggestionsGroup: FilterFieldSuggestionProps[],\n  currentValue: string,\n): FilterFieldSuggestionProps[] {\n  if (currentValue) {\n    return suggestionsGroup.sort((a, b) => {\n      const aNorm = trimEscapedCharacters(a.value ?? '');\n      const bNorm = trimEscapedCharacters(b.value ?? '');\n      const priorityDiff =\n        getMatchPriority(aNorm, currentValue) -\n        getMatchPriority(bNorm, currentValue);\n      if (priorityDiff !== 0) {\n        return priorityDiff;\n      }\n      if (isSuggestionTypeNumber(a) && isSuggestionTypeNumber(b)) {\n        return Number(aNorm) - Number(bNorm);\n      }\n      if (isSuggestionTypeDuration(a) && isSuggestionTypeDuration(b)) {\n        return compareDurations(aNorm, bNorm);\n      }\n      return (a.value ?? '').localeCompare(b.value ?? '');\n    });\n  }\n\n  const { numericSuggestions, durationSuggestions, nonNumericSuggestions } =\n    suggestionsGroup.reduce<{\n      numericSuggestions: FilterFieldSuggestionProps[];\n      durationSuggestions: FilterFieldSuggestionProps[];\n      nonNumericSuggestions: FilterFieldSuggestionProps[];\n    }>(\n      (acc, currentSuggestion) => {\n        if (isSuggestionTypeNumber(currentSuggestion)) {\n          acc.numericSuggestions.push(currentSuggestion);\n        } else if (isSuggestionTypeDuration(currentSuggestion)) {\n          acc.durationSuggestions.push(currentSuggestion);\n        } else {\n          acc.nonNumericSuggestions.push(currentSuggestion);\n        }\n\n        return acc;\n      },\n      {\n        numericSuggestions: [],\n        durationSuggestions: [],\n        nonNumericSuggestions: [],\n      },\n    );\n\n  numericSuggestions.sort(\n    (a, b) => Number(a.value ?? 0) - Number(b.value ?? 0),\n  );\n  durationSuggestions.sort((a, b) =>\n    compareDurations(a.value ?? '', b.value ?? ''),\n  );\n  nonNumericSuggestions.sort((a, b) =>\n    (a.value ?? '').localeCompare(b.value ?? ''),\n  );\n\n  return [\n    ...numericSuggestions,\n    ...durationSuggestions,\n    ...nonNumericSuggestions,\n  ];\n}\n\n/**\n * Iterates over suggestion groups, filters each, and assigns non-empty groups\n * to the appropriate slot in `groupedSuggestions`. The first implicit group\n * (matching `implicitIdPrefix`) is assigned to the well-known slot (`slotName`);\n * subsequent groups are assigned to dynamic slots.\n */\nfunction assignGroupsToSlots({\n  groups,\n  groupedSuggestions,\n  slotName,\n  implicitIdPrefix,\n  token,\n  currentValue,\n  shouldSortAlphabetically,\n  suggestionsTypeOrder,\n}: {\n  groups: SuggestionGroup<FilterFieldSuggestion>[];\n  groupedSuggestions: FilterFieldGroupedSuggestions;\n  slotName: 'key' | 'value';\n  implicitIdPrefix: string;\n  token: FilterFieldValueNode;\n  currentValue: string;\n  shouldSortAlphabetically: boolean;\n  suggestionsTypeOrder?: string[];\n}): void {\n  for (const group of groups) {\n    const filtered = filterSuggestions(group.suggestions, token, currentValue);\n\n    if (filtered.length === 0) {\n      continue;\n    }\n\n    const sorted = sortSuggestions(\n      filtered,\n      shouldSortAlphabetically,\n      currentValue,\n      suggestionsTypeOrder,\n    );\n\n    if (\n      !groupedSuggestions[slotName] &&\n      (group.id === implicitIdPrefix ||\n        group.id.startsWith(`${implicitIdPrefix}-implicit`))\n    ) {\n      groupedSuggestions[slotName] = { id: group.id, suggestions: sorted };\n    } else {\n      groupedSuggestions[group.id] = {\n        id: group.id,\n        label: group.label,\n        'aria-label': group['aria-label'],\n        suggestions: sorted,\n      };\n    }\n  }\n}\n"],
-  "mappings": "AACA;AAAA,EACE;AAAA,EACA;AAAA,OACK;AACP;AAAA,EACE;AAAA,EACA;AAAA,OACK;AACP,SAAS,iBAAiB,4BAA4B;AAEtD,SAAS,0BAA0B;AACnC;AAAA,EACE;AAAA,EACA;AAAA,OACK;AAoBP,SAAS,4BAA4B;AACrC,SAAS,oBAAoB;AAK7B,SAAS,0BAA0B;AAEnC,MAAM,0BAAkD;AAAA,EACtD,MAAM;AAAA,EACN,OAAO;AACT;AAEA,SAAS,yBAAyB,OAAqC;AACrE,SAAO,MAAM,SAAS,YAAY,MAAM,SAAS,QAC7C,MAAM,QACN,MAAM;AACZ;AAEA,SAAS,yCACP,sBACA,kBACU;AACV,MAAI,CAAC,wBAAwB,CAAC,kBAAkB,KAAK,OAAO;AAC1D,WAAO,CAAC;AAAA,EACV;AAEA,QAAM,YACJ,qBAAqB,eAAe,MAAM,IAAI,iBAAiB,IAAI,KAAK;AAE1E,MAAI,CAAC,WAAW;AACd,WAAO,CAAC;AAAA,EACV;AAMA,MAAI,UAAU,WAAW;AACvB,WAAO,mBAAmB,EAAE,MAAM,UAAU,UAAU,CAAC,EAAE;AAAA,EAC3D;AAEA,SAAO,mBAAmB,UAAU,cAAc,EAAE;AACtD;AAEA,SAAS,qCACP,kBACQ;AACR,QAAM,SAAS,kBAAkB,qBAC7B,iBAAiB,mBAAmB,YACpC;AACJ,SAAO,wBAAwB,MAAM,KAAK;AAC5C;AAGO,SAAS,eAAe;AAAA,EAC7B;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,GAyBE;AACA,QAAM,qBAAoD,CAAC;AAE3D,QAAM,eAAe,yBAAyB,YAAY;AAE1D,MAAI,2BAAoD,CAAC;AACzD,QAAM,2BACJ,sBAAsB,mBAAmB;AAE3C,aAAW,EAAE,MAAM,gBAAgB,MAAM,KAAK,0BAA0B,CAAC,GAAG;AAC1E,QAAI,mBAAmB,OAAO;AAC5B,YAAMA,gBAAe,yBAAyB,KAAK;AAEnD,YAAM,sBAAsB;AAAA,QAC1B;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACF;AAEA,0BAAoB;AAAA,QAClB,QAAQ;AAAA,QACR;AAAA,QACA,UAAU;AAAA,QACV,kBAAkB;AAAA,QAClB;AAAA,QACA,cAAAA;AAAA,QACA;AAAA,MACF,CAAC;AAAA,IACH,WAAW,mBAAmB,SAAS;AAErC,YAAM,wCACJ,OAAO,kBAAkB,oBAAoB,UAAU,YACvD,kBAAkB,oBAAoB,SAAS,WAC/C,mBAAmB,gBAAgB;AAIrC,YAAM,+BACH,aAAa,oBACZ,qBAAqB,wBACvB,mBAAmB,gBAAgB;AAErC,YAAM,wBAAwB;AAAA,QAC5B,kBAAkB,KAAK;AAAA,QACvB,kBAAkB,oBAAoB,OAAO,SAAS;AAAA,QACtD;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA,gBAAgB,SAAS,eAAe;AAAA,MAC1C;AAEA,YAAM,wBAAwB;AAAA,QAC5B;AAAA,QACA;AAAA,MACF;AAEA,0BAAoB;AAAA,QAClB,QAAQ;AAAA,QACR;AAAA,QACA,UAAU;AAAA,QACV,kBAAkB;AAAA,QAClB;AAAA,QACA;AAAA,QACA;AAAA,QACA,sBAAsB;AAAA,MACxB,CAAC;AAAA,IACH,WACE,mBAAmB,mBACnB,MAAM,WAAW,MAAM,oBAAoB,GAC3C;AACA,iCAA2B,CAAC,qBAAqB,CAAC;AAAA,IACpD;AAAA,EACF;AAEA,MACE,gBAAgB,SAAS,oBAAoB,KAC7C,wBACA;AACA,QAAI,MAAM,kBAAkB,KAAK,aAAa;AAM9C,QAAI,wBAAwB;AAC1B,YAAM,mBACJ,uBAAuB,SAAS,MAAM,QACrC,kBAAkB,MAAM,QAAQ;AACnC,YAAM,IAAI,MAAM,GAAG,gBAAgB,EAAE,KAAK;AAAA,IAC5C;AAEA,QAAI,gCAAgC;AAAA,MAClC;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAEA,oCAAgC;AAAA,MAC9B;AAAA,MACA;AAAA,MACA,yBACI,uBAAuB,SAAS,UAAU,KAAK,IAC/C,qCAAqC,gBAAgB;AAAA,IAC3D;AAOA,QAAI,wBAAwB;AAC1B,sCAAgC,8BAA8B;AAAA,QAC5D,CAAC,gBAAuC;AAAA,UACtC,GAAG;AAAA,UACH,gBAAgB,uBAAuB,SAAS;AAAA,UAChD,kBAAkB;AAAA,QACpB;AAAA,MACF;AAAA,IAaF,OAAO;AACL,sCAAgC,8BAA8B;AAAA,QAC5D,CAAC,gBAAuC;AAAA,UACtC,GAAG;AAAA,UACH,gBAAgB;AAAA,UAChB,kBAAkB;AAAA,QACpB;AAAA,MACF;AAAA,IACF;AAEA,QACE,8BAA8B,SAAS,KACvC,CAAC,gBAAgB,SAAS,eAAe,GACzC;AACA,yBAAmB,qBAAqB;AAAA,QACtC,IAAI;AAAA,QACJ,aAAa;AAAA,MACf;AAAA,IACF;AAAA,EACF;AAEA,MAAI,6BAAsD,CAAC;AAC3D,MAAI,sBAAsB;AACxB,iCAA6B;AAAA,MAC3B;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,EACF;AAEA,MACE,gBAAgB,KAAK,CAAC,UAAU,UAAU,KAAK,MAC9C,aAAa,SAAS,cACpB,aAAa,SAAS,WACrB,aAAa,UAAU,MAAM,wBAAwB,IACzD;AACA,uBAAmB,MAAM;AAAA,MACvB,IAAI;AAAA,MACJ,aAAa,CAAC,gBAAgB,CAAC;AAAA,IACjC;AAAA,EACF;AAEA,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;AAEA,SAAS,sBAAsB,OAAe;AAC5C,SAAO,MAAM,QAAQ,aAAa,EAAE,EAAE,YAAY;AACpD;AAKO,SAAS,kBACd,qBACA,cACA,cACA;AACA,QAAM,YAAY,sBAAsB,YAAY;AACpD,SAAO,oBAAoB,OAAO,CAAC,eAAe;AAChD,QAAI,MAAM,QAAQ,aAAa,KAAK,GAAG;AACrC,aAAO;AAAA,IACT;AAEA,QAAI,CAAC,WAAW,OAAO;AACrB,aAAO;AAAA,IACT;AAIA,QACE,WAAW,UAAU,QACrB,aAAa,UAAU,aAAa,WACpC;AACA,aAAO;AAAA,IACT;AAEA,UAAM,eAAe,sBAAsB,WAAW,KAAK;AAC3D,UAAM,sBACJ,OAAO,WAAW,iBAAiB,WAC/B,sBAAsB,WAAW,YAAY,IAC7C;AAEN,UAAM,cAAc,uBAAuB;AAC3C,WAAO,YAAY,SAAS,GAAG,aAAa,EAAE,EAAE;AAAA,EAClD,CAAC;AACH;AAKA,SAAS,uBACP,YACS;AACT,MAAI,WAAW,WAAW;AACxB,WAAO,WAAW,cAAc;AAAA,EAClC;AAEA,QAAM,QAAQ,sBAAsB,WAAW,SAAS,EAAE;AAC1D,SAAO,QAAQ,MAAM,KAAK,MAAM,MAAM,CAAC,MAAM,OAAO,KAAK,CAAC,IAAI;AAChE;AAKA,SAAS,yBACP,YACS;AACT,MAAI,WAAW,WAAW;AACxB,WAAO,WAAW,cAAc;AAAA,EAClC;AAEA,QAAM,QAAQ,sBAAsB,WAAW,SAAS,EAAE;AAC1D,SAAO,uBAAuB,KAAK,SAAS,EAAE;AAChD;AAKA,SAAS,wBAAwB,OAAuB;AACtD,QAAM,QAAQ,yBAAyB,KAAK,KAAK;AACjD,SAAO,QAAQ,OAAO,MAAM,CAAC,CAAC,IAAI;AACpC;AAKA,SAAS,gBAAgB,OAAuB;AAC9C,QAAM,QAAQ,uBAAuB,KAAK,KAAK;AAC/C,SAAO,QAAQ,MAAM,CAAC,IAAI;AAC5B;AAEA,MAAM,sBAA8C;AAAA,EAClD,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,GAAG;AAAA,EACH,GAAG;AAAA,EACH,GAAG;AAAA,EACH,GAAG;AACL;AAKA,SAAS,iBAAiB,GAAW,GAAmB;AACtD,QAAM,QAAQ,gBAAgB,CAAC;AAC/B,QAAM,QAAQ,gBAAgB,CAAC;AAC/B,QAAM,YACH,oBAAoB,KAAK,KAAK,MAAM,oBAAoB,KAAK,KAAK;AACrE,MAAI,aAAa,GAAG;AAClB,WAAO;AAAA,EACT;AACA,SAAO,wBAAwB,CAAC,IAAI,wBAAwB,CAAC;AAC/D;AAKA,SAAS,iBAAiB,iBAAyB,QAAwB;AACzE,MAAI,oBAAoB,QAAQ;AAC9B,WAAO;AAAA,EACT;AACA,MAAI,gBAAgB,WAAW,MAAM,GAAG;AACtC,WAAO;AAAA,EACT;AAEA,SAAO;AACT;AAYA,SAAS,gBACP,aACA,kBACA,cACA,sBACA;AACA,QAAM,EAAE,yBAAyB,iBAAiB,IAAI,YAAY;AAAA,IAIhE,CAAC,KAAK,sBAAsB;AAC1B,UAAI,kBAAkB,mBAAmB,gBAAgB;AACvD,YAAI,wBAAwB,KAAK,iBAAiB;AAAA,MACpD,OAAO;AACL,YAAI,iBAAiB,KAAK,iBAAiB;AAAA,MAC7C;AAEA,aAAO;AAAA,IACT;AAAA,IACA,EAAE,yBAAyB,CAAC,GAAG,kBAAkB,CAAC,EAAE;AAAA,EACtD;AAEA,iBAAe,eAAe,sBAAsB,YAAY,IAAI;AACpE,QAAM,kCACJ,oBAAoB,wBAAwB,qBAAqB,SAAS;AAG5E,MAAI,iCAAiC;AACnC,WAAO;AAAA,MACL,GAAG;AAAA,QACD;AAAA,QACA;AAAA,QACA;AAAA,MACF;AAAA,MACA,GAAG;AAAA,IACL;AAAA,EACF;AAEA,MAAI,gBAAgB,kBAAkB;AACpC,WAAO;AAAA,MACL,GAAG,qBAAqB,yBAAyB,YAAY;AAAA,MAC7D,GAAG;AAAA,IACL;AAAA,EACF;AAEA,SAAO,CAAC,GAAG,yBAAyB,GAAG,gBAAgB;AACzD;AAKA,SAAS,yBACP,yBACA,sBACA,cACA;AACA,QAAM,oBAAoB,oBAAI,IAA0C;AACxE,QAAM,uBAAqD,CAAC;AAE5D,aAAW,cAAc,yBAAyB;AAChD,UAAM,EAAE,UAAU,IAAI;AACtB,QAAI,cAAc,UAAa,qBAAqB,SAAS,SAAS,GAAG;AACvE,UAAI,kBAAkB,kBAAkB,IAAI,SAAS;AACrD,UAAI,CAAC,iBAAiB;AACpB,0BAAkB,CAAC;AACnB,0BAAkB,IAAI,WAAW,eAAe;AAAA,MAClD;AACA,sBAAgB,KAAK,UAAU;AAAA,IACjC,OAAO;AACL,2BAAqB,KAAK,UAAU;AAAA,IACtC;AAAA,EACF;AAEA,QAAM,eAA6C,CAAC;AAEpD,aAAW,kBAAkB,sBAAsB;AACjD,iBAAa;AAAA,MACX,GAAG;AAAA,QACD,kBAAkB,IAAI,cAAc,KAAK,CAAC;AAAA,QAC1C;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACA,eAAa;AAAA,IACX,GAAG,qBAAqB,sBAAsB,YAAY;AAAA,EAC5D;AAEA,SAAO;AACT;AAMA,SAAS,qBACP,kBACA,cAC8B;AAC9B,MAAI,cAAc;AAChB,WAAO,iBAAiB,KAAK,CAAC,GAAG,MAAM;AACrC,YAAM,QAAQ,sBAAsB,EAAE,SAAS,EAAE;AACjD,YAAM,QAAQ,sBAAsB,EAAE,SAAS,EAAE;AACjD,YAAM,eACJ,iBAAiB,OAAO,YAAY,IACpC,iBAAiB,OAAO,YAAY;AACtC,UAAI,iBAAiB,GAAG;AACtB,eAAO;AAAA,MACT;AACA,UAAI,uBAAuB,CAAC,KAAK,uBAAuB,CAAC,GAAG;AAC1D,eAAO,OAAO,KAAK,IAAI,OAAO,KAAK;AAAA,MACrC;AACA,UAAI,yBAAyB,CAAC,KAAK,yBAAyB,CAAC,GAAG;AAC9D,eAAO,iBAAiB,OAAO,KAAK;AAAA,MACtC;AACA,cAAQ,EAAE,SAAS,IAAI,cAAc,EAAE,SAAS,EAAE;AAAA,IACpD,CAAC;AAAA,EACH;AAEA,QAAM,EAAE,oBAAoB,qBAAqB,sBAAsB,IACrE,iBAAiB;AAAA,IAKf,CAAC,KAAK,sBAAsB;AAC1B,UAAI,uBAAuB,iBAAiB,GAAG;AAC7C,YAAI,mBAAmB,KAAK,iBAAiB;AAAA,MAC/C,WAAW,yBAAyB,iBAAiB,GAAG;AACtD,YAAI,oBAAoB,KAAK,iBAAiB;AAAA,MAChD,OAAO;AACL,YAAI,sBAAsB,KAAK,iBAAiB;AAAA,MAClD;AAEA,aAAO;AAAA,IACT;AAAA,IACA;AAAA,MACE,oBAAoB,CAAC;AAAA,MACrB,qBAAqB,CAAC;AAAA,MACtB,uBAAuB,CAAC;AAAA,IAC1B;AAAA,EACF;AAEF,qBAAmB;AAAA,IACjB,CAAC,GAAG,MAAM,OAAO,EAAE,SAAS,CAAC,IAAI,OAAO,EAAE,SAAS,CAAC;AAAA,EACtD;AACA,sBAAoB;AAAA,IAAK,CAAC,GAAG,MAC3B,iBAAiB,EAAE,SAAS,IAAI,EAAE,SAAS,EAAE;AAAA,EAC/C;AACA,wBAAsB;AAAA,IAAK,CAAC,GAAG,OAC5B,EAAE,SAAS,IAAI,cAAc,EAAE,SAAS,EAAE;AAAA,EAC7C;AAEA,SAAO;AAAA,IACL,GAAG;AAAA,IACH,GAAG;AAAA,IACH,GAAG;AAAA,EACL;AACF;AAQA,SAAS,oBAAoB;AAAA,EAC3B;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,GASS;AACP,aAAW,SAAS,QAAQ;AAC1B,UAAM,WAAW,kBAAkB,MAAM,aAAa,OAAO,YAAY;AAEzE,QAAI,SAAS,WAAW,GAAG;AACzB;AAAA,IACF;AAEA,UAAM,SAAS;AAAA,MACb;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAEA,QACE,CAAC,mBAAmB,QAAQ,MAC3B,MAAM,OAAO,oBACZ,MAAM,GAAG,WAAW,GAAG,gBAAgB,WAAW,IACpD;AACA,yBAAmB,QAAQ,IAAI,EAAE,IAAI,MAAM,IAAI,aAAa,OAAO;AAAA,IACrE,OAAO;AACL,yBAAmB,MAAM,EAAE,IAAI;AAAA,QAC7B,IAAI,MAAM;AAAA,QACV,OAAO,MAAM;AAAA,QACb,cAAc,MAAM,YAAY;AAAA,QAChC,aAAa;AAAA,MACf;AAAA,IACF;AAAA,EACF;AACF;",
+  "sourcesContent": ["import type { FilterFieldOverlappingSuggestions } from './get-suggestion-category.js';\nimport {\n  getKeySuggestions,\n  JSONPATH_PATTERN_PARTIAL,\n} from './key-suggestions.js';\nimport {\n  defaultLogicalOperatorSuggestions,\n  getComparisonOperatorSuggestions,\n} from './operator-suggestions.js';\nimport { getJSONPathHint, getPastingSuggestion } from './shared-suggestions.js';\nimport type { SuggestionGroup } from './suggestion-group-utils.js';\nimport {\n  getSuggestionMatchPriority,\n  normalizeSuggestionMatchText,\n  suggestionMatchesTerm,\n  type SuggestionMatchingOptions,\n} from './suggestion-matching.js';\nimport { getValidValueTypes } from './suggestion-type.js';\nimport {\n  getValueSuggestionGroups,\n  VALUE_GROUP_ID,\n} from './value-suggestions.js';\nimport type { FilterFieldProps } from '../../FilterField.types.js';\nimport type {\n  FilterFieldSuggestion,\n  FilterFieldSuggestionProps,\n} from '../../suggestions/Suggestion.types.js';\nimport type {\n  FilterFieldGroupedSuggestions,\n  FilterFieldSuggestionsCallback,\n} from '../../types/suggestions.js';\nimport type {\n  FilterFieldLezerNodeType,\n  FilterFieldStatementNode,\n  FilterFieldStatementTokenType,\n  FilterFieldValueNode,\n} from '../../types/tree-nodes.js';\nimport type {\n  FilterFieldComparisonOperators,\n  FilterFieldCustomTypes,\n} from '../../types/validation.js';\nimport { NEEDS_ESCAPING_REGEX } from '../escape-suggestion.js';\nimport { KEY_GROUP_ID } from '../validation-utils/normalize-validator-map.js';\nimport type {\n  InternalValidatorMap,\n  NormalizedKeyConfig,\n} from '../validation-utils/normalize-validator-map.js';\nimport { isWildCardOperator } from '../validation-utils/validation-helper-functions.js';\n\nconst comparisonOperatorAlias: Record<string, string> = {\n  '=*': '= *',\n  '!=*': '!= *',\n};\n\nfunction getCurrentValueFromToken(token: FilterFieldValueNode): string {\n  return token.type === 'String' || token.type === 'Key'\n    ? token.value\n    : token.textValue;\n}\n\nfunction getValueSuggestionsTypesFromKeyPredicate(\n  internalValidatorMap: InternalValidatorMap | undefined,\n  currentStatement: FilterFieldStatementNode | undefined,\n): string[] {\n  if (!internalValidatorMap || !currentStatement?.key?.value) {\n    return [];\n  }\n\n  const keyConfig: NormalizedKeyConfig | undefined =\n    internalValidatorMap.normalizedKeys.byKey.get(currentStatement.key.value);\n\n  if (!keyConfig) {\n    return [];\n  }\n\n  // Prefer the explicit valueType from the new array format; fall back to\n  // inferring types from the legacy valuePredicate.\n  // DEPRECATION: [APPDEV-16872] BREAKING-CHANGE: Remove support for inferring value types from the legacy valuePredicate.\n  // The new array format with explicit valueType should be used exclusively.\n  if (keyConfig.valueType) {\n    return getValidValueTypes({ type: keyConfig.valueType }).types;\n  }\n\n  return getValidValueTypes(keyConfig.valuePredicate).types;\n}\n\nfunction getTypedOperatorFromCurrentStatement(\n  currentStatement: FilterFieldStatementNode | undefined,\n): string {\n  const needle = currentStatement?.comparisonOperator\n    ? currentStatement.comparisonOperator.textValue\n    : '';\n  return comparisonOperatorAlias[needle] ?? needle;\n}\n\n/** @internal */\nexport function getSuggestions({\n  suggestionTypes,\n  overlappingSuggestions,\n  currentStatement,\n  currentToken,\n  currentTokenType,\n  prevNode,\n  internalValidatorMap,\n  customTypes,\n  parserConfig,\n  showLogicalOperators,\n  showInclusionOperators,\n  doc,\n  suggestionTypeForToken,\n}: {\n  suggestionTypes: NonNullable<\n    Parameters<FilterFieldSuggestionsCallback>[0]\n  >['suggestionTypes'];\n  overlappingSuggestions?: FilterFieldOverlappingSuggestions;\n  currentStatement: FilterFieldStatementNode | undefined;\n  currentToken: FilterFieldValueNode;\n  currentTokenType?: FilterFieldStatementTokenType;\n  prevNode: FilterFieldLezerNodeType | 'FilterValue';\n  internalValidatorMap?: InternalValidatorMap;\n  customTypes?: FilterFieldCustomTypes;\n  parserConfig?: FilterFieldProps['parserConfig'];\n  showLogicalOperators: boolean;\n  showInclusionOperators: boolean;\n  doc: string;\n  suggestionTypeForToken?: {\n    type: NonNullable<\n      Parameters<FilterFieldSuggestionsCallback>[0]\n    >['suggestionTypes'][number];\n    token: FilterFieldValueNode;\n  }[];\n}): {\n  groupedSuggestions: FilterFieldGroupedSuggestions;\n  logicalOperatorSuggestions: FilterFieldSuggestion[];\n  pastedContentSuggestions: FilterFieldSuggestion[];\n} {\n  const groupedSuggestions: FilterFieldGroupedSuggestions = {};\n\n  const currentValue = getCurrentValueFromToken(currentToken);\n\n  let pastedContentSuggestions: FilterFieldSuggestion[] = [];\n  const shouldSortAlphabetically =\n    internalValidatorMap?.sortSuggestions ?? true;\n\n  for (const { type: suggestionType, token } of suggestionTypeForToken ?? []) {\n    if (suggestionType === 'key') {\n      const currentValue = getCurrentValueFromToken(token);\n\n      const keySuggestionGroups = getKeySuggestions(\n        internalValidatorMap,\n        suggestionTypes,\n        customTypes,\n        doc,\n        token,\n      );\n\n      assignGroupsToSlots({\n        groups: keySuggestionGroups,\n        groupedSuggestions,\n        slotName: 'key',\n        implicitIdPrefix: KEY_GROUP_ID,\n        token,\n        currentValue,\n        shouldSortAlphabetically,\n      });\n    } else if (suggestionType === 'value') {\n      // These are the suggestions shown when no specific value is entered yet, inserting the \"value\" placeholder when applied.\n      const showDefaultValueOrWildcardSuggestions =\n        typeof currentStatement?.comparisonOperator?.value === 'string' &&\n        currentStatement?.comparisonOperator?.type !== 'Error' &&\n        isWildCardOperator(currentStatement);\n\n      // These are the suggestion to apply a specific value in combination with a wildcard operator.\n      // E.g. Contains \"foo\" or Ends with \"foo\"\n      const showWildcardValueSuggestions =\n        (prevNode === 'ExistsOperator' &&\n          currentTokenType === 'comparisonOperator') ||\n        isWildCardOperator(currentStatement);\n\n      const valueSuggestionGroups = getValueSuggestionGroups(\n        currentStatement?.key?.value,\n        currentStatement?.comparisonOperator?.value?.toString() as FilterFieldComparisonOperators,\n        internalValidatorMap,\n        token,\n        showDefaultValueOrWildcardSuggestions,\n        showWildcardValueSuggestions,\n        suggestionTypes.includes('pastedContent'),\n      );\n\n      const valueSuggestionsTypes = getValueSuggestionsTypesFromKeyPredicate(\n        internalValidatorMap,\n        currentStatement,\n      );\n\n      assignGroupsToSlots({\n        groups: valueSuggestionGroups,\n        groupedSuggestions,\n        slotName: 'value',\n        implicitIdPrefix: VALUE_GROUP_ID,\n        token,\n        currentValue,\n        shouldSortAlphabetically,\n        suggestionsTypeOrder: valueSuggestionsTypes,\n      });\n    } else if (\n      suggestionType === 'pastedContent' &&\n      token.textValue?.match(NEEDS_ESCAPING_REGEX)\n    ) {\n      pastedContentSuggestions = [getPastingSuggestion()];\n    }\n  }\n\n  if (\n    suggestionTypes.includes('comparisonOperator') ||\n    showInclusionOperators\n  ) {\n    let key = currentStatement?.key?.textValue ?? '';\n\n    // If we have overlapping suggestions (free text node), we need to exclude the part of the key\n    // that may already start a comparison operator to get the correct comparators from the validator\n    // map, if present.\n    // E.g.: \u203Ahealth !\u2039 (only one token) -> get comparators for \"health\"\n    if (overlappingSuggestions) {\n      const normalizedKeyEnd =\n        overlappingSuggestions.subToken.range.from -\n        (currentStatement?.range.from ?? 0);\n      key = key.slice(0, normalizedKeyEnd).trim();\n    }\n\n    let comparisonOperatorSuggestions = getComparisonOperatorSuggestions(\n      key,\n      internalValidatorMap,\n      parserConfig,\n    );\n\n    comparisonOperatorSuggestions = filterSuggestions(\n      comparisonOperatorSuggestions,\n      currentToken,\n      overlappingSuggestions\n        ? overlappingSuggestions.subToken.textValue.trim()\n        : getTypedOperatorFromCurrentStatement(currentStatement),\n      // Operator details (e.g. \"equals\", \"not equals\") are display-only\n      // localized labels \u2014 never a match target.\n      { includeDetails: false },\n    );\n\n    // If we have overlapping suggestions, we store the range that should be replaced in a data-attribute\n    // that we can read when applying the suggestion to only replace parts of a free text token.\n    // E.g.:\n    // cluster not in\n    // stored overlapping range: 8 - 14\n    if (overlappingSuggestions) {\n      comparisonOperatorSuggestions = comparisonOperatorSuggestions.map(\n        (suggestion): FilterFieldSuggestion => ({\n          ...suggestion,\n          insertionRange: overlappingSuggestions.subToken.range,\n          escapeSuggestion: false,\n        }),\n      );\n      // If there are no overlapping suggestions, we reset the data-attributes to take whatever range we get from\n      // the actual tokens.\n      // E.g.:\n      /*\n        Initial input: \u203Acluster not in\u2039\n          -> one free text token with overlapping suggestions.\n          -> data-attributes are written to the dom.\n        Typing '(' -> \u203Acluster not in (\u2039\n          -> the suggestion is still the same, so react doesn't re-create the node. we have the same data attributes.\n          -> applying the suggestion would only replace from 8 to 14, so we would end up with \u203Acluster not in ()(\u2039\n        Resetting the data-attributes, we use the appropriate range again.\n       */\n    } else {\n      comparisonOperatorSuggestions = comparisonOperatorSuggestions.map(\n        (suggestion): FilterFieldSuggestion => ({\n          ...suggestion,\n          insertionRange: undefined,\n          escapeSuggestion: false,\n        }),\n      );\n    }\n\n    if (\n      comparisonOperatorSuggestions.length > 0 &&\n      !suggestionTypes.includes('pastedContent')\n    ) {\n      groupedSuggestions.comparisonOperator = {\n        id: 'strato-filter-field-comparator-suggestions',\n        suggestions: comparisonOperatorSuggestions,\n      };\n    }\n  }\n\n  let logicalOperatorSuggestions: FilterFieldSuggestion[] = [];\n  if (showLogicalOperators) {\n    // Logical operators (`OR`) match by value only \u2014 any future details on\n    // these would be display-only, same as comparison operators above.\n    logicalOperatorSuggestions = filterSuggestions(\n      defaultLogicalOperatorSuggestions,\n      currentToken,\n      currentValue,\n      { includeDetails: false },\n    );\n  }\n\n  if (\n    suggestionTypes.find((value) => value === 'key') &&\n    (currentToken.type === 'JSONPath' ||\n      (currentToken.type === 'Error' &&\n        currentToken.textValue.match(JSONPATH_PATTERN_PARTIAL)))\n  ) {\n    groupedSuggestions.key = {\n      id: 'strato-filter-field-key-suggestions',\n      suggestions: [getJSONPathHint()],\n    };\n  }\n\n  return {\n    groupedSuggestions,\n    logicalOperatorSuggestions,\n    pastedContentSuggestions,\n  };\n}\n\n// Local alias kept for readability at call sites \u2014 the normalization rule\n// (strip quotes/backslashes + lowercase) is owned by suggestion-matching.ts\n// so filtering, sorting, and this trim all stay in sync.\nfunction trimEscapedCharacters(value: string) {\n  return normalizeSuggestionMatchText(value);\n}\n\n/**\n * Filters validatorMap-derived suggestions against the user's typed value.\n *\n * Matching delegates to `suggestionMatchesTerm` so the rules (which fields\n * count, normalization, displayValue/value mutual exclusion) live in one\n * place. Pass `{ includeDetails: false }` for suggestion sets whose details\n * are display-only (operators).\n * @internal\n */\nexport function filterSuggestions(\n  providedSuggestions: FilterFieldSuggestion[],\n  currentToken: FilterFieldValueNode,\n  currentValue: string,\n  options?: SuggestionMatchingOptions,\n) {\n  const textValue = trimEscapedCharacters(currentValue);\n  return providedSuggestions.filter((suggestion) => {\n    if (Array.isArray(currentToken.value)) {\n      return true;\n    }\n\n    if (!suggestion.value) {\n      return true;\n    }\n\n    // This check is needed to correctly filter the OR suggestion if there\n    // are quotes or escaped characters\n    if (\n      suggestion.value === 'OR' &&\n      currentToken.value !== currentToken.textValue\n    ) {\n      return false;\n    }\n\n    return suggestionMatchesTerm(suggestion, textValue, options);\n  });\n}\n\n/**\n * Check whether a suggestion is of type number\n */\nfunction isSuggestionTypeNumber(\n  suggestion: FilterFieldSuggestionProps,\n): boolean {\n  if (suggestion.valueType) {\n    return suggestion.valueType === 'Number';\n  }\n\n  const value = trimEscapedCharacters(suggestion.value ?? '');\n  return value ? value.trim() !== '' && !isNaN(Number(value)) : false;\n}\n\n/**\n * Check wheter a suggestion if of type duration\n */\nfunction isSuggestionTypeDuration(\n  suggestion: FilterFieldSuggestionProps,\n): boolean {\n  if (suggestion.valueType) {\n    return suggestion.valueType === 'Duration';\n  }\n\n  const value = trimEscapedCharacters(suggestion.value ?? '');\n  return /^\\d+(ns|ms|s|m|h|d)$/.test(value ?? '');\n}\n\n/**\n * Extract the numeric part from a duration string (e.g. \"200ms\" -\\> 200).\n */\nfunction getDurationNumericValue(value: string): number {\n  const match = /^(\\d+)(ns|ms|s|m|h|d)$/.exec(value);\n  return match ? Number(match[1]) : 0;\n}\n\n/**\n * Extract the unit part from a duration string (e.g. \"200ms\" -\\> \"ms\").\n */\nfunction getDurationUnit(value: string): string {\n  const match = /^\\d+(ns|ms|s|m|h|d)$/.exec(value);\n  return match ? match[1] : '';\n}\n\nconst DURATION_UNIT_ORDER: Record<string, number> = {\n  ns: 0,\n  ms: 1,\n  s: 2,\n  m: 3,\n  h: 4,\n  d: 5,\n};\n\n/**\n * Compare two duration strings by unit order first, then by numeric value.\n */\nfunction compareDurations(a: string, b: string): number {\n  const unitA = getDurationUnit(a);\n  const unitB = getDurationUnit(b);\n  const unitDiff =\n    (DURATION_UNIT_ORDER[unitA] ?? 0) - (DURATION_UNIT_ORDER[unitB] ?? 0);\n  if (unitDiff !== 0) {\n    return unitDiff;\n  }\n  return getDurationNumericValue(a) - getDurationNumericValue(b);\n}\n\n/**\n * Sort key/value suggestions alphabetically, or by match position when the user has typed something.\n * When currentValue is non-empty, suggestions are ordered: exact \u2192 starts-with \u2192 contains-middle/ends-with.\n * Within each tier suggestions are ordered alphabetically.\n * Numeric string values (e.g. \"1\", \"10\", \"20\") are sorted numerically and placed before non-numeric strings.\n * For value suggestions with mixed types, suggestions are first grouped by their valueType in the order defined in the valuePredicate,\n * and each group is sorted independently.\n *\n * Default sorting can be disabled by the isSortingEnabled param.\n */\nfunction sortSuggestions(\n  suggestions: FilterFieldSuggestionProps[],\n  isSortingEnabled: boolean,\n  currentValue: string,\n  suggestionsTypeOrder?: string[],\n) {\n  const { validatorMapSuggestions, otherSuggestions } = suggestions.reduce<{\n    validatorMapSuggestions: FilterFieldSuggestionProps[];\n    otherSuggestions: FilterFieldSuggestionProps[];\n  }>(\n    (acc, currentSuggestion) => {\n      if (currentSuggestion.suggestionType === 'validatorMap') {\n        acc.validatorMapSuggestions.push(currentSuggestion);\n      } else {\n        acc.otherSuggestions.push(currentSuggestion);\n      }\n\n      return acc;\n    },\n    { validatorMapSuggestions: [], otherSuggestions: [] },\n  );\n\n  currentValue = currentValue ? trimEscapedCharacters(currentValue) : '';\n  const shouldSortMixedSuggestionsTypes =\n    isSortingEnabled && suggestionsTypeOrder && suggestionsTypeOrder.length > 1;\n\n  // sort mixed type value suggestions by types order\n  if (shouldSortMixedSuggestionsTypes) {\n    return [\n      ...sortMixedSuggestionTypes(\n        validatorMapSuggestions,\n        suggestionsTypeOrder,\n        currentValue,\n      ),\n      ...otherSuggestions,\n    ];\n  }\n\n  if (currentValue || isSortingEnabled) {\n    return [\n      ...sortSuggestionsGroup(validatorMapSuggestions, currentValue),\n      ...otherSuggestions,\n    ];\n  }\n\n  return [...validatorMapSuggestions, ...otherSuggestions];\n}\n\n/**\n * Sort mixed types value suggestions.\n */\nfunction sortMixedSuggestionTypes(\n  validatorMapSuggestions: FilterFieldSuggestionProps[],\n  suggestionsTypeOrder: string[],\n  currentValue: string,\n) {\n  const suggestionsGroups = new Map<string, FilterFieldSuggestionProps[]>();\n  const ungroupedSuggestions: FilterFieldSuggestionProps[] = [];\n\n  for (const suggestion of validatorMapSuggestions) {\n    const { valueType } = suggestion;\n    if (valueType !== undefined && suggestionsTypeOrder.includes(valueType)) {\n      let suggestionGroup = suggestionsGroups.get(valueType);\n      if (!suggestionGroup) {\n        suggestionGroup = [];\n        suggestionsGroups.set(valueType, suggestionGroup);\n      }\n      suggestionGroup.push(suggestion);\n    } else {\n      ungroupedSuggestions.push(suggestion);\n    }\n  }\n\n  const sortedResult: FilterFieldSuggestionProps[] = [];\n\n  for (const suggestionType of suggestionsTypeOrder) {\n    sortedResult.push(\n      ...sortSuggestionsGroup(\n        suggestionsGroups.get(suggestionType) ?? [],\n        currentValue,\n      ),\n    );\n  }\n  sortedResult.push(\n    ...sortSuggestionsGroup(ungroupedSuggestions, currentValue),\n  );\n\n  return sortedResult;\n}\n\n/**\n * Sort a single group of suggestions by match position when currentValue is set,\n * or alphabetically (numbers first, then durations, then strings) otherwise.\n */\nfunction sortSuggestionsGroup(\n  suggestionsGroup: FilterFieldSuggestionProps[],\n  currentValue: string,\n): FilterFieldSuggestionProps[] {\n  if (currentValue) {\n    return suggestionsGroup.sort((a, b) => {\n      const aNorm = trimEscapedCharacters(a.value ?? '');\n      const bNorm = trimEscapedCharacters(b.value ?? '');\n      // Priority is the best of all match targets (value/displayValue/details).\n      // Exact match (0) wins over prefix (1), prefix wins over contains (2).\n      const priorityDiff =\n        getSuggestionMatchPriority(a, currentValue) -\n        getSuggestionMatchPriority(b, currentValue);\n      if (priorityDiff !== 0) {\n        return priorityDiff;\n      }\n      if (isSuggestionTypeNumber(a) && isSuggestionTypeNumber(b)) {\n        return Number(aNorm) - Number(bNorm);\n      }\n      if (isSuggestionTypeDuration(a) && isSuggestionTypeDuration(b)) {\n        return compareDurations(aNorm, bNorm);\n      }\n      return (a.value ?? '').localeCompare(b.value ?? '');\n    });\n  }\n\n  const { numericSuggestions, durationSuggestions, nonNumericSuggestions } =\n    suggestionsGroup.reduce<{\n      numericSuggestions: FilterFieldSuggestionProps[];\n      durationSuggestions: FilterFieldSuggestionProps[];\n      nonNumericSuggestions: FilterFieldSuggestionProps[];\n    }>(\n      (acc, currentSuggestion) => {\n        if (isSuggestionTypeNumber(currentSuggestion)) {\n          acc.numericSuggestions.push(currentSuggestion);\n        } else if (isSuggestionTypeDuration(currentSuggestion)) {\n          acc.durationSuggestions.push(currentSuggestion);\n        } else {\n          acc.nonNumericSuggestions.push(currentSuggestion);\n        }\n\n        return acc;\n      },\n      {\n        numericSuggestions: [],\n        durationSuggestions: [],\n        nonNumericSuggestions: [],\n      },\n    );\n\n  numericSuggestions.sort(\n    (a, b) => Number(a.value ?? 0) - Number(b.value ?? 0),\n  );\n  durationSuggestions.sort((a, b) =>\n    compareDurations(a.value ?? '', b.value ?? ''),\n  );\n  nonNumericSuggestions.sort((a, b) =>\n    (a.value ?? '').localeCompare(b.value ?? ''),\n  );\n\n  return [\n    ...numericSuggestions,\n    ...durationSuggestions,\n    ...nonNumericSuggestions,\n  ];\n}\n\n/**\n * Iterates over suggestion groups, filters each, and assigns non-empty groups\n * to the appropriate slot in `groupedSuggestions`. The first implicit group\n * (matching `implicitIdPrefix`) is assigned to the well-known slot (`slotName`);\n * subsequent groups are assigned to dynamic slots.\n */\nfunction assignGroupsToSlots({\n  groups,\n  groupedSuggestions,\n  slotName,\n  implicitIdPrefix,\n  token,\n  currentValue,\n  shouldSortAlphabetically,\n  suggestionsTypeOrder,\n}: {\n  groups: SuggestionGroup<FilterFieldSuggestion>[];\n  groupedSuggestions: FilterFieldGroupedSuggestions;\n  slotName: 'key' | 'value';\n  implicitIdPrefix: string;\n  token: FilterFieldValueNode;\n  currentValue: string;\n  shouldSortAlphabetically: boolean;\n  suggestionsTypeOrder?: string[];\n}): void {\n  for (const group of groups) {\n    const filtered = filterSuggestions(group.suggestions, token, currentValue);\n\n    if (filtered.length === 0) {\n      continue;\n    }\n\n    const sorted = sortSuggestions(\n      filtered,\n      shouldSortAlphabetically,\n      currentValue,\n      suggestionsTypeOrder,\n    );\n\n    if (\n      !groupedSuggestions[slotName] &&\n      (group.id === implicitIdPrefix ||\n        group.id.startsWith(`${implicitIdPrefix}-implicit`))\n    ) {\n      groupedSuggestions[slotName] = { id: group.id, suggestions: sorted };\n    } else {\n      groupedSuggestions[group.id] = {\n        id: group.id,\n        label: group.label,\n        'aria-label': group['aria-label'],\n        suggestions: sorted,\n      };\n    }\n  }\n}\n"],
+  "mappings": "AACA;AAAA,EACE;AAAA,EACA;AAAA,OACK;AACP;AAAA,EACE;AAAA,EACA;AAAA,OACK;AACP,SAAS,iBAAiB,4BAA4B;AAEtD;AAAA,EACE;AAAA,EACA;AAAA,EACA;AAAA,OAEK;AACP,SAAS,0BAA0B;AACnC;AAAA,EACE;AAAA,EACA;AAAA,OACK;AAoBP,SAAS,4BAA4B;AACrC,SAAS,oBAAoB;AAK7B,SAAS,0BAA0B;AAEnC,MAAM,0BAAkD;AAAA,EACtD,MAAM;AAAA,EACN,OAAO;AACT;AAEA,SAAS,yBAAyB,OAAqC;AACrE,SAAO,MAAM,SAAS,YAAY,MAAM,SAAS,QAC7C,MAAM,QACN,MAAM;AACZ;AAEA,SAAS,yCACP,sBACA,kBACU;AACV,MAAI,CAAC,wBAAwB,CAAC,kBAAkB,KAAK,OAAO;AAC1D,WAAO,CAAC;AAAA,EACV;AAEA,QAAM,YACJ,qBAAqB,eAAe,MAAM,IAAI,iBAAiB,IAAI,KAAK;AAE1E,MAAI,CAAC,WAAW;AACd,WAAO,CAAC;AAAA,EACV;AAMA,MAAI,UAAU,WAAW;AACvB,WAAO,mBAAmB,EAAE,MAAM,UAAU,UAAU,CAAC,EAAE;AAAA,EAC3D;AAEA,SAAO,mBAAmB,UAAU,cAAc,EAAE;AACtD;AAEA,SAAS,qCACP,kBACQ;AACR,QAAM,SAAS,kBAAkB,qBAC7B,iBAAiB,mBAAmB,YACpC;AACJ,SAAO,wBAAwB,MAAM,KAAK;AAC5C;AAGO,SAAS,eAAe;AAAA,EAC7B;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,GAyBE;AACA,QAAM,qBAAoD,CAAC;AAE3D,QAAM,eAAe,yBAAyB,YAAY;AAE1D,MAAI,2BAAoD,CAAC;AACzD,QAAM,2BACJ,sBAAsB,mBAAmB;AAE3C,aAAW,EAAE,MAAM,gBAAgB,MAAM,KAAK,0BAA0B,CAAC,GAAG;AAC1E,QAAI,mBAAmB,OAAO;AAC5B,YAAMA,gBAAe,yBAAyB,KAAK;AAEnD,YAAM,sBAAsB;AAAA,QAC1B;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACF;AAEA,0BAAoB;AAAA,QAClB,QAAQ;AAAA,QACR;AAAA,QACA,UAAU;AAAA,QACV,kBAAkB;AAAA,QAClB;AAAA,QACA,cAAAA;AAAA,QACA;AAAA,MACF,CAAC;AAAA,IACH,WAAW,mBAAmB,SAAS;AAErC,YAAM,wCACJ,OAAO,kBAAkB,oBAAoB,UAAU,YACvD,kBAAkB,oBAAoB,SAAS,WAC/C,mBAAmB,gBAAgB;AAIrC,YAAM,+BACH,aAAa,oBACZ,qBAAqB,wBACvB,mBAAmB,gBAAgB;AAErC,YAAM,wBAAwB;AAAA,QAC5B,kBAAkB,KAAK;AAAA,QACvB,kBAAkB,oBAAoB,OAAO,SAAS;AAAA,QACtD;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA,gBAAgB,SAAS,eAAe;AAAA,MAC1C;AAEA,YAAM,wBAAwB;AAAA,QAC5B;AAAA,QACA;AAAA,MACF;AAEA,0BAAoB;AAAA,QAClB,QAAQ;AAAA,QACR;AAAA,QACA,UAAU;AAAA,QACV,kBAAkB;AAAA,QAClB;AAAA,QACA;AAAA,QACA;AAAA,QACA,sBAAsB;AAAA,MACxB,CAAC;AAAA,IACH,WACE,mBAAmB,mBACnB,MAAM,WAAW,MAAM,oBAAoB,GAC3C;AACA,iCAA2B,CAAC,qBAAqB,CAAC;AAAA,IACpD;AAAA,EACF;AAEA,MACE,gBAAgB,SAAS,oBAAoB,KAC7C,wBACA;AACA,QAAI,MAAM,kBAAkB,KAAK,aAAa;AAM9C,QAAI,wBAAwB;AAC1B,YAAM,mBACJ,uBAAuB,SAAS,MAAM,QACrC,kBAAkB,MAAM,QAAQ;AACnC,YAAM,IAAI,MAAM,GAAG,gBAAgB,EAAE,KAAK;AAAA,IAC5C;AAEA,QAAI,gCAAgC;AAAA,MAClC;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAEA,oCAAgC;AAAA,MAC9B;AAAA,MACA;AAAA,MACA,yBACI,uBAAuB,SAAS,UAAU,KAAK,IAC/C,qCAAqC,gBAAgB;AAAA;AAAA;AAAA,MAGzD,EAAE,gBAAgB,MAAM;AAAA,IAC1B;AAOA,QAAI,wBAAwB;AAC1B,sCAAgC,8BAA8B;AAAA,QAC5D,CAAC,gBAAuC;AAAA,UACtC,GAAG;AAAA,UACH,gBAAgB,uBAAuB,SAAS;AAAA,UAChD,kBAAkB;AAAA,QACpB;AAAA,MACF;AAAA,IAaF,OAAO;AACL,sCAAgC,8BAA8B;AAAA,QAC5D,CAAC,gBAAuC;AAAA,UACtC,GAAG;AAAA,UACH,gBAAgB;AAAA,UAChB,kBAAkB;AAAA,QACpB;AAAA,MACF;AAAA,IACF;AAEA,QACE,8BAA8B,SAAS,KACvC,CAAC,gBAAgB,SAAS,eAAe,GACzC;AACA,yBAAmB,qBAAqB;AAAA,QACtC,IAAI;AAAA,QACJ,aAAa;AAAA,MACf;AAAA,IACF;AAAA,EACF;AAEA,MAAI,6BAAsD,CAAC;AAC3D,MAAI,sBAAsB;AAGxB,iCAA6B;AAAA,MAC3B;AAAA,MACA;AAAA,MACA;AAAA,MACA,EAAE,gBAAgB,MAAM;AAAA,IAC1B;AAAA,EACF;AAEA,MACE,gBAAgB,KAAK,CAAC,UAAU,UAAU,KAAK,MAC9C,aAAa,SAAS,cACpB,aAAa,SAAS,WACrB,aAAa,UAAU,MAAM,wBAAwB,IACzD;AACA,uBAAmB,MAAM;AAAA,MACvB,IAAI;AAAA,MACJ,aAAa,CAAC,gBAAgB,CAAC;AAAA,IACjC;AAAA,EACF;AAEA,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;AAKA,SAAS,sBAAsB,OAAe;AAC5C,SAAO,6BAA6B,KAAK;AAC3C;AAWO,SAAS,kBACd,qBACA,cACA,cACA,SACA;AACA,QAAM,YAAY,sBAAsB,YAAY;AACpD,SAAO,oBAAoB,OAAO,CAAC,eAAe;AAChD,QAAI,MAAM,QAAQ,aAAa,KAAK,GAAG;AACrC,aAAO;AAAA,IACT;AAEA,QAAI,CAAC,WAAW,OAAO;AACrB,aAAO;AAAA,IACT;AAIA,QACE,WAAW,UAAU,QACrB,aAAa,UAAU,aAAa,WACpC;AACA,aAAO;AAAA,IACT;AAEA,WAAO,sBAAsB,YAAY,WAAW,OAAO;AAAA,EAC7D,CAAC;AACH;AAKA,SAAS,uBACP,YACS;AACT,MAAI,WAAW,WAAW;AACxB,WAAO,WAAW,cAAc;AAAA,EAClC;AAEA,QAAM,QAAQ,sBAAsB,WAAW,SAAS,EAAE;AAC1D,SAAO,QAAQ,MAAM,KAAK,MAAM,MAAM,CAAC,MAAM,OAAO,KAAK,CAAC,IAAI;AAChE;AAKA,SAAS,yBACP,YACS;AACT,MAAI,WAAW,WAAW;AACxB,WAAO,WAAW,cAAc;AAAA,EAClC;AAEA,QAAM,QAAQ,sBAAsB,WAAW,SAAS,EAAE;AAC1D,SAAO,uBAAuB,KAAK,SAAS,EAAE;AAChD;AAKA,SAAS,wBAAwB,OAAuB;AACtD,QAAM,QAAQ,yBAAyB,KAAK,KAAK;AACjD,SAAO,QAAQ,OAAO,MAAM,CAAC,CAAC,IAAI;AACpC;AAKA,SAAS,gBAAgB,OAAuB;AAC9C,QAAM,QAAQ,uBAAuB,KAAK,KAAK;AAC/C,SAAO,QAAQ,MAAM,CAAC,IAAI;AAC5B;AAEA,MAAM,sBAA8C;AAAA,EAClD,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,GAAG;AAAA,EACH,GAAG;AAAA,EACH,GAAG;AAAA,EACH,GAAG;AACL;AAKA,SAAS,iBAAiB,GAAW,GAAmB;AACtD,QAAM,QAAQ,gBAAgB,CAAC;AAC/B,QAAM,QAAQ,gBAAgB,CAAC;AAC/B,QAAM,YACH,oBAAoB,KAAK,KAAK,MAAM,oBAAoB,KAAK,KAAK;AACrE,MAAI,aAAa,GAAG;AAClB,WAAO;AAAA,EACT;AACA,SAAO,wBAAwB,CAAC,IAAI,wBAAwB,CAAC;AAC/D;AAYA,SAAS,gBACP,aACA,kBACA,cACA,sBACA;AACA,QAAM,EAAE,yBAAyB,iBAAiB,IAAI,YAAY;AAAA,IAIhE,CAAC,KAAK,sBAAsB;AAC1B,UAAI,kBAAkB,mBAAmB,gBAAgB;AACvD,YAAI,wBAAwB,KAAK,iBAAiB;AAAA,MACpD,OAAO;AACL,YAAI,iBAAiB,KAAK,iBAAiB;AAAA,MAC7C;AAEA,aAAO;AAAA,IACT;AAAA,IACA,EAAE,yBAAyB,CAAC,GAAG,kBAAkB,CAAC,EAAE;AAAA,EACtD;AAEA,iBAAe,eAAe,sBAAsB,YAAY,IAAI;AACpE,QAAM,kCACJ,oBAAoB,wBAAwB,qBAAqB,SAAS;AAG5E,MAAI,iCAAiC;AACnC,WAAO;AAAA,MACL,GAAG;AAAA,QACD;AAAA,QACA;AAAA,QACA;AAAA,MACF;AAAA,MACA,GAAG;AAAA,IACL;AAAA,EACF;AAEA,MAAI,gBAAgB,kBAAkB;AACpC,WAAO;AAAA,MACL,GAAG,qBAAqB,yBAAyB,YAAY;AAAA,MAC7D,GAAG;AAAA,IACL;AAAA,EACF;AAEA,SAAO,CAAC,GAAG,yBAAyB,GAAG,gBAAgB;AACzD;AAKA,SAAS,yBACP,yBACA,sBACA,cACA;AACA,QAAM,oBAAoB,oBAAI,IAA0C;AACxE,QAAM,uBAAqD,CAAC;AAE5D,aAAW,cAAc,yBAAyB;AAChD,UAAM,EAAE,UAAU,IAAI;AACtB,QAAI,cAAc,UAAa,qBAAqB,SAAS,SAAS,GAAG;AACvE,UAAI,kBAAkB,kBAAkB,IAAI,SAAS;AACrD,UAAI,CAAC,iBAAiB;AACpB,0BAAkB,CAAC;AACnB,0BAAkB,IAAI,WAAW,eAAe;AAAA,MAClD;AACA,sBAAgB,KAAK,UAAU;AAAA,IACjC,OAAO;AACL,2BAAqB,KAAK,UAAU;AAAA,IACtC;AAAA,EACF;AAEA,QAAM,eAA6C,CAAC;AAEpD,aAAW,kBAAkB,sBAAsB;AACjD,iBAAa;AAAA,MACX,GAAG;AAAA,QACD,kBAAkB,IAAI,cAAc,KAAK,CAAC;AAAA,QAC1C;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACA,eAAa;AAAA,IACX,GAAG,qBAAqB,sBAAsB,YAAY;AAAA,EAC5D;AAEA,SAAO;AACT;AAMA,SAAS,qBACP,kBACA,cAC8B;AAC9B,MAAI,cAAc;AAChB,WAAO,iBAAiB,KAAK,CAAC,GAAG,MAAM;AACrC,YAAM,QAAQ,sBAAsB,EAAE,SAAS,EAAE;AACjD,YAAM,QAAQ,sBAAsB,EAAE,SAAS,EAAE;AAGjD,YAAM,eACJ,2BAA2B,GAAG,YAAY,IAC1C,2BAA2B,GAAG,YAAY;AAC5C,UAAI,iBAAiB,GAAG;AACtB,eAAO;AAAA,MACT;AACA,UAAI,uBAAuB,CAAC,KAAK,uBAAuB,CAAC,GAAG;AAC1D,eAAO,OAAO,KAAK,IAAI,OAAO,KAAK;AAAA,MACrC;AACA,UAAI,yBAAyB,CAAC,KAAK,yBAAyB,CAAC,GAAG;AAC9D,eAAO,iBAAiB,OAAO,KAAK;AAAA,MACtC;AACA,cAAQ,EAAE,SAAS,IAAI,cAAc,EAAE,SAAS,EAAE;AAAA,IACpD,CAAC;AAAA,EACH;AAEA,QAAM,EAAE,oBAAoB,qBAAqB,sBAAsB,IACrE,iBAAiB;AAAA,IAKf,CAAC,KAAK,sBAAsB;AAC1B,UAAI,uBAAuB,iBAAiB,GAAG;AAC7C,YAAI,mBAAmB,KAAK,iBAAiB;AAAA,MAC/C,WAAW,yBAAyB,iBAAiB,GAAG;AACtD,YAAI,oBAAoB,KAAK,iBAAiB;AAAA,MAChD,OAAO;AACL,YAAI,sBAAsB,KAAK,iBAAiB;AAAA,MAClD;AAEA,aAAO;AAAA,IACT;AAAA,IACA;AAAA,MACE,oBAAoB,CAAC;AAAA,MACrB,qBAAqB,CAAC;AAAA,MACtB,uBAAuB,CAAC;AAAA,IAC1B;AAAA,EACF;AAEF,qBAAmB;AAAA,IACjB,CAAC,GAAG,MAAM,OAAO,EAAE,SAAS,CAAC,IAAI,OAAO,EAAE,SAAS,CAAC;AAAA,EACtD;AACA,sBAAoB;AAAA,IAAK,CAAC,GAAG,MAC3B,iBAAiB,EAAE,SAAS,IAAI,EAAE,SAAS,EAAE;AAAA,EAC/C;AACA,wBAAsB;AAAA,IAAK,CAAC,GAAG,OAC5B,EAAE,SAAS,IAAI,cAAc,EAAE,SAAS,EAAE;AAAA,EAC7C;AAEA,SAAO;AAAA,IACL,GAAG;AAAA,IACH,GAAG;AAAA,IACH,GAAG;AAAA,EACL;AACF;AAQA,SAAS,oBAAoB;AAAA,EAC3B;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,GASS;AACP,aAAW,SAAS,QAAQ;AAC1B,UAAM,WAAW,kBAAkB,MAAM,aAAa,OAAO,YAAY;AAEzE,QAAI,SAAS,WAAW,GAAG;AACzB;AAAA,IACF;AAEA,UAAM,SAAS;AAAA,MACb;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAEA,QACE,CAAC,mBAAmB,QAAQ,MAC3B,MAAM,OAAO,oBACZ,MAAM,GAAG,WAAW,GAAG,gBAAgB,WAAW,IACpD;AACA,yBAAmB,QAAQ,IAAI,EAAE,IAAI,MAAM,IAAI,aAAa,OAAO;AAAA,IACrE,OAAO;AACL,yBAAmB,MAAM,EAAE,IAAI;AAAA,QAC7B,IAAI,MAAM;AAAA,QACV,OAAO,MAAM;AAAA,QACb,cAAc,MAAM,YAAY;AAAA,QAChC,aAAa;AAAA,MACf;AAAA,IACF;AAAA,EACF;AACF;",
   "names": ["currentValue"]
 }

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

@@ -12,8 +12,10 @@ function getComparisonOperatorSuggestions(key, internalValidatorMap, parserConfi
   );
   return operators.map((operator) => {
     const operatorWithDetails = operatorSuggestionsWithDetails[operator];
-    const suggestionType = { suggestionType: "validatorMap" };
-    return operatorWithDetails ? { ...operatorWithDetails, ...suggestionType } : { value: operator, ...suggestionType };
+    const baseProps = {
+      suggestionType: "validatorMap"
+    };
+    return operatorWithDetails ? { ...operatorWithDetails, ...baseProps } : { value: operator, ...baseProps };
   });
 }
 const defaultLogicalOperatorSuggestions = [

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

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../../../../../src/filters/filter-field/utils/suggestions-utils/operator-suggestions.tsx"],
-  "sourcesContent": ["import { FormattedMessage } from 'react-intl';\n\nimport Colors from '@dynatrace/strato-design-tokens/colors';\nimport Typography from '@dynatrace/strato-design-tokens/typography';\n\nimport type { FilterFieldProps } from '../../FilterField.types.js';\nimport { filterFieldMessages } from '../../messages.js';\nimport type { FilterFieldSuggestion } from '../../suggestions/Suggestion.types.js';\nimport type { InternalValidatorMap } from '../validation-utils/normalize-validator-map.js';\nimport { getValidOperatorsShort } from '../validation-utils/validation-helper-functions.js';\n\n/** @internal */\nexport function getComparisonOperatorSuggestions(\n  key: string | undefined,\n  internalValidatorMap: InternalValidatorMap | undefined,\n  parserConfig: FilterFieldProps['parserConfig'],\n): FilterFieldSuggestion[] {\n  const operators = getValidOperatorsShort(\n    key,\n    internalValidatorMap,\n    parserConfig,\n  );\n\n  // check for explicitly defined suggestions or fallback to simple suggestion\n  return operators.map((operator) => {\n    const operatorWithDetails = operatorSuggestionsWithDetails[operator];\n    const suggestionType = { suggestionType: 'validatorMap' } as const;\n\n    return operatorWithDetails\n      ? { ...operatorWithDetails, ...suggestionType }\n      : { value: operator, ...suggestionType };\n  });\n}\n\n/** @internal */\nexport const defaultLogicalOperatorSuggestions: FilterFieldSuggestion[] = [\n  { value: 'OR' },\n];\n\n/** @internal */\nexport const ValuePlaceholder = () => {\n  return (\n    <span\n      style={{\n        color: Colors.Text.Neutral.Subdued,\n        fontWeight: Typography.Text.Base.Default.Weight,\n      }}\n    >\n      value\n    </span>\n  );\n};\n\n/**\n * maps operator values to their detailed suggestion\n * @internal\n */\nexport const operatorSuggestionsWithDetails: Record<\n  string,\n  FilterFieldSuggestion\n> = {\n  '=': {\n    value: '=',\n    details: (\n      <FormattedMessage {...filterFieldMessages.comparisonOperators.equals} />\n    ),\n    escapeSuggestion: false,\n  },\n  '!=': {\n    value: '!=',\n    details: (\n      <FormattedMessage\n        {...filterFieldMessages.comparisonOperators.notEquals}\n      />\n    ),\n    escapeSuggestion: false,\n  },\n  '<': {\n    value: '<',\n    details: (\n      <FormattedMessage {...filterFieldMessages.comparisonOperators.lessThan} />\n    ),\n    escapeSuggestion: false,\n  },\n  '<=': {\n    value: '<=',\n    details: (\n      <FormattedMessage\n        {...filterFieldMessages.comparisonOperators.lessThanEqual}\n      />\n    ),\n    escapeSuggestion: false,\n  },\n  '>': {\n    value: '>',\n    details: (\n      <FormattedMessage\n        {...filterFieldMessages.comparisonOperators.greaterThan}\n      />\n    ),\n    escapeSuggestion: false,\n  },\n  '>=': {\n    value: '>=',\n    details: (\n      <FormattedMessage\n        {...filterFieldMessages.comparisonOperators.greaterThanEqual}\n      />\n    ),\n    escapeSuggestion: false,\n  },\n  in: {\n    value: 'in (',\n    displayValue: 'in ()',\n    details: (\n      <FormattedMessage {...filterFieldMessages.comparisonOperators.in} />\n    ),\n    trailing: ') ',\n    cursorBeforeTrailing: true,\n    escapeSuggestion: false,\n  },\n  'not in': {\n    value: 'not in (',\n    displayValue: 'not in ()',\n    details: (\n      <FormattedMessage {...filterFieldMessages.comparisonOperators.notIn} />\n    ),\n    trailing: ') ',\n    cursorBeforeTrailing: true,\n    escapeSuggestion: false,\n  },\n  'starts-with': {\n    value: '= \"',\n    displayValue: (\n      <div>\n        = <ValuePlaceholder />*\n      </div>\n    ),\n    details: (\n      <FormattedMessage\n        {...filterFieldMessages.comparisonOperators.startsWith}\n      />\n    ),\n    trailing: 'value\"*',\n    cursorBeforeTrailing: true,\n    escapeSuggestion: false,\n  },\n  contains: {\n    value: '= *\"',\n    displayValue: (\n      <div>\n        = *<ValuePlaceholder />*\n      </div>\n    ),\n    details: (\n      <FormattedMessage {...filterFieldMessages.comparisonOperators.contains} />\n    ),\n    trailing: 'value\"*',\n    cursorBeforeTrailing: true,\n    escapeSuggestion: false,\n  },\n  'ends-with': {\n    value: '= *\"',\n    displayValue: (\n      <div>\n        = *<ValuePlaceholder />\n      </div>\n    ),\n    details: (\n      <FormattedMessage {...filterFieldMessages.comparisonOperators.endsWith} />\n    ),\n    trailing: 'value\"',\n    cursorBeforeTrailing: true,\n    escapeSuggestion: false,\n  },\n  'not-starts-with': {\n    value: '!= \"',\n    displayValue: (\n      <div>\n        != <ValuePlaceholder />*\n      </div>\n    ),\n    details: (\n      <FormattedMessage\n        {...filterFieldMessages.comparisonOperators.notStartsWith}\n      />\n    ),\n    trailing: 'value\"*',\n    cursorBeforeTrailing: true,\n    escapeSuggestion: false,\n  },\n  'not-contains': {\n    value: '!= *\"',\n    displayValue: (\n      <div>\n        != *<ValuePlaceholder />*\n      </div>\n    ),\n    details: (\n      <FormattedMessage\n        {...filterFieldMessages.comparisonOperators.notContains}\n      />\n    ),\n    trailing: 'value\"*',\n    cursorBeforeTrailing: true,\n    escapeSuggestion: false,\n  },\n  'not-ends-with': {\n    value: '!= *\"',\n    displayValue: (\n      <div>\n        != *\n        <ValuePlaceholder />\n      </div>\n    ),\n    details: (\n      <FormattedMessage\n        {...filterFieldMessages.comparisonOperators.notEndsWith}\n      />\n    ),\n    trailing: 'value\"',\n    cursorBeforeTrailing: true,\n    escapeSuggestion: false,\n  },\n  '= *': {\n    value: '= *',\n    details: (\n      <FormattedMessage {...filterFieldMessages.comparisonOperators.exists} />\n    ),\n  },\n  '!= *': {\n    value: '!= *',\n    details: (\n      <FormattedMessage\n        {...filterFieldMessages.comparisonOperators.notExists}\n      />\n    ),\n    escapeSuggestion: false,\n  },\n  '~': {\n    value: '~',\n    details: (\n      <FormattedMessage\n        {...filterFieldMessages.comparisonOperators.matchesPhrase}\n      />\n    ),\n    escapeSuggestion: false,\n  },\n  '!~': {\n    value: '!~',\n    details: (\n      <FormattedMessage\n        {...filterFieldMessages.comparisonOperators.notMatchesPhrase}\n      />\n    ),\n    escapeSuggestion: false,\n  },\n};\n"],
-  "mappings": "AA0CI,cA4FE,YA5FF;AA1CJ,SAAS,wBAAwB;AAEjC,OAAO,YAAY;AACnB,OAAO,gBAAgB;AAGvB,SAAS,2BAA2B;AAGpC,SAAS,8BAA8B;AAGhC,SAAS,iCACd,KACA,sBACA,cACyB;AACzB,QAAM,YAAY;AAAA,IAChB;AAAA,IACA;AAAA,IACA;AAAA,EACF;AAGA,SAAO,UAAU,IAAI,CAAC,aAAa;AACjC,UAAM,sBAAsB,+BAA+B,QAAQ;AACnE,UAAM,iBAAiB,EAAE,gBAAgB,eAAe;AAExD,WAAO,sBACH,EAAE,GAAG,qBAAqB,GAAG,eAAe,IAC5C,EAAE,OAAO,UAAU,GAAG,eAAe;AAAA,EAC3C,CAAC;AACH;AAGO,MAAM,oCAA6D;AAAA,EACxE,EAAE,OAAO,KAAK;AAChB;AAGO,MAAM,mBAAmB,MAAM;AACpC,SACE;AAAA,IAAC;AAAA;AAAA,MACC,OAAO;AAAA,QACL,OAAO,OAAO,KAAK,QAAQ;AAAA,QAC3B,YAAY,WAAW,KAAK,KAAK,QAAQ;AAAA,MAC3C;AAAA,MACD;AAAA;AAAA,EAED;AAEJ;AAMO,MAAM,iCAGT;AAAA,EACF,KAAK;AAAA,IACH,OAAO;AAAA,IACP,SACE,oBAAC,oBAAkB,GAAG,oBAAoB,oBAAoB,QAAQ;AAAA,IAExE,kBAAkB;AAAA,EACpB;AAAA,EACA,MAAM;AAAA,IACJ,OAAO;AAAA,IACP,SACE;AAAA,MAAC;AAAA;AAAA,QACE,GAAG,oBAAoB,oBAAoB;AAAA;AAAA,IAC9C;AAAA,IAEF,kBAAkB;AAAA,EACpB;AAAA,EACA,KAAK;AAAA,IACH,OAAO;AAAA,IACP,SACE,oBAAC,oBAAkB,GAAG,oBAAoB,oBAAoB,UAAU;AAAA,IAE1E,kBAAkB;AAAA,EACpB;AAAA,EACA,MAAM;AAAA,IACJ,OAAO;AAAA,IACP,SACE;AAAA,MAAC;AAAA;AAAA,QACE,GAAG,oBAAoB,oBAAoB;AAAA;AAAA,IAC9C;AAAA,IAEF,kBAAkB;AAAA,EACpB;AAAA,EACA,KAAK;AAAA,IACH,OAAO;AAAA,IACP,SACE;AAAA,MAAC;AAAA;AAAA,QACE,GAAG,oBAAoB,oBAAoB;AAAA;AAAA,IAC9C;AAAA,IAEF,kBAAkB;AAAA,EACpB;AAAA,EACA,MAAM;AAAA,IACJ,OAAO;AAAA,IACP,SACE;AAAA,MAAC;AAAA;AAAA,QACE,GAAG,oBAAoB,oBAAoB;AAAA;AAAA,IAC9C;AAAA,IAEF,kBAAkB;AAAA,EACpB;AAAA,EACA,IAAI;AAAA,IACF,OAAO;AAAA,IACP,cAAc;AAAA,IACd,SACE,oBAAC,oBAAkB,GAAG,oBAAoB,oBAAoB,IAAI;AAAA,IAEpE,UAAU;AAAA,IACV,sBAAsB;AAAA,IACtB,kBAAkB;AAAA,EACpB;AAAA,EACA,UAAU;AAAA,IACR,OAAO;AAAA,IACP,cAAc;AAAA,IACd,SACE,oBAAC,oBAAkB,GAAG,oBAAoB,oBAAoB,OAAO;AAAA,IAEvE,UAAU;AAAA,IACV,sBAAsB;AAAA,IACtB,kBAAkB;AAAA,EACpB;AAAA,EACA,eAAe;AAAA,IACb,OAAO;AAAA,IACP,cACE,qBAAC,SAAI;AAAA;AAAA,MACD,oBAAC,oBAAiB;AAAA,MAAE;AAAA,OACxB;AAAA,IAEF,SACE;AAAA,MAAC;AAAA;AAAA,QACE,GAAG,oBAAoB,oBAAoB;AAAA;AAAA,IAC9C;AAAA,IAEF,UAAU;AAAA,IACV,sBAAsB;AAAA,IACtB,kBAAkB;AAAA,EACpB;AAAA,EACA,UAAU;AAAA,IACR,OAAO;AAAA,IACP,cACE,qBAAC,SAAI;AAAA;AAAA,MACA,oBAAC,oBAAiB;AAAA,MAAE;AAAA,OACzB;AAAA,IAEF,SACE,oBAAC,oBAAkB,GAAG,oBAAoB,oBAAoB,UAAU;AAAA,IAE1E,UAAU;AAAA,IACV,sBAAsB;AAAA,IACtB,kBAAkB;AAAA,EACpB;AAAA,EACA,aAAa;AAAA,IACX,OAAO;AAAA,IACP,cACE,qBAAC,SAAI;AAAA;AAAA,MACA,oBAAC,oBAAiB;AAAA,OACvB;AAAA,IAEF,SACE,oBAAC,oBAAkB,GAAG,oBAAoB,oBAAoB,UAAU;AAAA,IAE1E,UAAU;AAAA,IACV,sBAAsB;AAAA,IACtB,kBAAkB;AAAA,EACpB;AAAA,EACA,mBAAmB;AAAA,IACjB,OAAO;AAAA,IACP,cACE,qBAAC,SAAI;AAAA;AAAA,MACA,oBAAC,oBAAiB;AAAA,MAAE;AAAA,OACzB;AAAA,IAEF,SACE;AAAA,MAAC;AAAA;AAAA,QACE,GAAG,oBAAoB,oBAAoB;AAAA;AAAA,IAC9C;AAAA,IAEF,UAAU;AAAA,IACV,sBAAsB;AAAA,IACtB,kBAAkB;AAAA,EACpB;AAAA,EACA,gBAAgB;AAAA,IACd,OAAO;AAAA,IACP,cACE,qBAAC,SAAI;AAAA;AAAA,MACC,oBAAC,oBAAiB;AAAA,MAAE;AAAA,OAC1B;AAAA,IAEF,SACE;AAAA,MAAC;AAAA;AAAA,QACE,GAAG,oBAAoB,oBAAoB;AAAA;AAAA,IAC9C;AAAA,IAEF,UAAU;AAAA,IACV,sBAAsB;AAAA,IACtB,kBAAkB;AAAA,EACpB;AAAA,EACA,iBAAiB;AAAA,IACf,OAAO;AAAA,IACP,cACE,qBAAC,SAAI;AAAA;AAAA,MAEH,oBAAC,oBAAiB;AAAA,OACpB;AAAA,IAEF,SACE;AAAA,MAAC;AAAA;AAAA,QACE,GAAG,oBAAoB,oBAAoB;AAAA;AAAA,IAC9C;AAAA,IAEF,UAAU;AAAA,IACV,sBAAsB;AAAA,IACtB,kBAAkB;AAAA,EACpB;AAAA,EACA,OAAO;AAAA,IACL,OAAO;AAAA,IACP,SACE,oBAAC,oBAAkB,GAAG,oBAAoB,oBAAoB,QAAQ;AAAA,EAE1E;AAAA,EACA,QAAQ;AAAA,IACN,OAAO;AAAA,IACP,SACE;AAAA,MAAC;AAAA;AAAA,QACE,GAAG,oBAAoB,oBAAoB;AAAA;AAAA,IAC9C;AAAA,IAEF,kBAAkB;AAAA,EACpB;AAAA,EACA,KAAK;AAAA,IACH,OAAO;AAAA,IACP,SACE;AAAA,MAAC;AAAA;AAAA,QACE,GAAG,oBAAoB,oBAAoB;AAAA;AAAA,IAC9C;AAAA,IAEF,kBAAkB;AAAA,EACpB;AAAA,EACA,MAAM;AAAA,IACJ,OAAO;AAAA,IACP,SACE;AAAA,MAAC;AAAA;AAAA,QACE,GAAG,oBAAoB,oBAAoB;AAAA;AAAA,IAC9C;AAAA,IAEF,kBAAkB;AAAA,EACpB;AACF;",
+  "sourcesContent": ["import { FormattedMessage } from 'react-intl';\n\nimport Colors from '@dynatrace/strato-design-tokens/colors';\nimport Typography from '@dynatrace/strato-design-tokens/typography';\n\nimport type { FilterFieldProps } from '../../FilterField.types.js';\nimport { filterFieldMessages } from '../../messages.js';\nimport type { FilterFieldSuggestion } from '../../suggestions/Suggestion.types.js';\nimport type { InternalValidatorMap } from '../validation-utils/normalize-validator-map.js';\nimport { getValidOperatorsShort } from '../validation-utils/validation-helper-functions.js';\n\n/** @internal */\nexport function getComparisonOperatorSuggestions(\n  key: string | undefined,\n  internalValidatorMap: InternalValidatorMap | undefined,\n  parserConfig: FilterFieldProps['parserConfig'],\n): FilterFieldSuggestion[] {\n  const operators = getValidOperatorsShort(\n    key,\n    internalValidatorMap,\n    parserConfig,\n  );\n\n  // check for explicitly defined suggestions or fallback to simple suggestion\n  return operators.map((operator) => {\n    const operatorWithDetails = operatorSuggestionsWithDetails[operator];\n    const baseProps = {\n      suggestionType: 'validatorMap',\n    } as const;\n\n    return operatorWithDetails\n      ? { ...operatorWithDetails, ...baseProps }\n      : { value: operator, ...baseProps };\n  });\n}\n\n/** @internal */\nexport const defaultLogicalOperatorSuggestions: FilterFieldSuggestion[] = [\n  { value: 'OR' },\n];\n\n/** @internal */\nexport const ValuePlaceholder = () => {\n  return (\n    <span\n      style={{\n        color: Colors.Text.Neutral.Subdued,\n        fontWeight: Typography.Text.Base.Default.Weight,\n      }}\n    >\n      value\n    </span>\n  );\n};\n\n/**\n * maps operator values to their detailed suggestion\n * @internal\n */\nexport const operatorSuggestionsWithDetails: Record<\n  string,\n  FilterFieldSuggestion\n> = {\n  '=': {\n    value: '=',\n    details: (\n      <FormattedMessage {...filterFieldMessages.comparisonOperators.equals} />\n    ),\n    escapeSuggestion: false,\n  },\n  '!=': {\n    value: '!=',\n    details: (\n      <FormattedMessage\n        {...filterFieldMessages.comparisonOperators.notEquals}\n      />\n    ),\n    escapeSuggestion: false,\n  },\n  '<': {\n    value: '<',\n    details: (\n      <FormattedMessage {...filterFieldMessages.comparisonOperators.lessThan} />\n    ),\n    escapeSuggestion: false,\n  },\n  '<=': {\n    value: '<=',\n    details: (\n      <FormattedMessage\n        {...filterFieldMessages.comparisonOperators.lessThanEqual}\n      />\n    ),\n    escapeSuggestion: false,\n  },\n  '>': {\n    value: '>',\n    details: (\n      <FormattedMessage\n        {...filterFieldMessages.comparisonOperators.greaterThan}\n      />\n    ),\n    escapeSuggestion: false,\n  },\n  '>=': {\n    value: '>=',\n    details: (\n      <FormattedMessage\n        {...filterFieldMessages.comparisonOperators.greaterThanEqual}\n      />\n    ),\n    escapeSuggestion: false,\n  },\n  in: {\n    value: 'in (',\n    displayValue: 'in ()',\n    details: (\n      <FormattedMessage {...filterFieldMessages.comparisonOperators.in} />\n    ),\n    trailing: ') ',\n    cursorBeforeTrailing: true,\n    escapeSuggestion: false,\n  },\n  'not in': {\n    value: 'not in (',\n    displayValue: 'not in ()',\n    details: (\n      <FormattedMessage {...filterFieldMessages.comparisonOperators.notIn} />\n    ),\n    trailing: ') ',\n    cursorBeforeTrailing: true,\n    escapeSuggestion: false,\n  },\n  'starts-with': {\n    value: '= \"',\n    displayValue: (\n      <div>\n        = <ValuePlaceholder />*\n      </div>\n    ),\n    details: (\n      <FormattedMessage\n        {...filterFieldMessages.comparisonOperators.startsWith}\n      />\n    ),\n    trailing: 'value\"*',\n    cursorBeforeTrailing: true,\n    escapeSuggestion: false,\n  },\n  contains: {\n    value: '= *\"',\n    displayValue: (\n      <div>\n        = *<ValuePlaceholder />*\n      </div>\n    ),\n    details: (\n      <FormattedMessage {...filterFieldMessages.comparisonOperators.contains} />\n    ),\n    trailing: 'value\"*',\n    cursorBeforeTrailing: true,\n    escapeSuggestion: false,\n  },\n  'ends-with': {\n    value: '= *\"',\n    displayValue: (\n      <div>\n        = *<ValuePlaceholder />\n      </div>\n    ),\n    details: (\n      <FormattedMessage {...filterFieldMessages.comparisonOperators.endsWith} />\n    ),\n    trailing: 'value\"',\n    cursorBeforeTrailing: true,\n    escapeSuggestion: false,\n  },\n  'not-starts-with': {\n    value: '!= \"',\n    displayValue: (\n      <div>\n        != <ValuePlaceholder />*\n      </div>\n    ),\n    details: (\n      <FormattedMessage\n        {...filterFieldMessages.comparisonOperators.notStartsWith}\n      />\n    ),\n    trailing: 'value\"*',\n    cursorBeforeTrailing: true,\n    escapeSuggestion: false,\n  },\n  'not-contains': {\n    value: '!= *\"',\n    displayValue: (\n      <div>\n        != *<ValuePlaceholder />*\n      </div>\n    ),\n    details: (\n      <FormattedMessage\n        {...filterFieldMessages.comparisonOperators.notContains}\n      />\n    ),\n    trailing: 'value\"*',\n    cursorBeforeTrailing: true,\n    escapeSuggestion: false,\n  },\n  'not-ends-with': {\n    value: '!= *\"',\n    displayValue: (\n      <div>\n        != *\n        <ValuePlaceholder />\n      </div>\n    ),\n    details: (\n      <FormattedMessage\n        {...filterFieldMessages.comparisonOperators.notEndsWith}\n      />\n    ),\n    trailing: 'value\"',\n    cursorBeforeTrailing: true,\n    escapeSuggestion: false,\n  },\n  '= *': {\n    value: '= *',\n    details: (\n      <FormattedMessage {...filterFieldMessages.comparisonOperators.exists} />\n    ),\n  },\n  '!= *': {\n    value: '!= *',\n    details: (\n      <FormattedMessage\n        {...filterFieldMessages.comparisonOperators.notExists}\n      />\n    ),\n    escapeSuggestion: false,\n  },\n  '~': {\n    value: '~',\n    details: (\n      <FormattedMessage\n        {...filterFieldMessages.comparisonOperators.matchesPhrase}\n      />\n    ),\n    escapeSuggestion: false,\n  },\n  '!~': {\n    value: '!~',\n    details: (\n      <FormattedMessage\n        {...filterFieldMessages.comparisonOperators.notMatchesPhrase}\n      />\n    ),\n    escapeSuggestion: false,\n  },\n};\n"],
+  "mappings": "AA4CI,cA4FE,YA5FF;AA5CJ,SAAS,wBAAwB;AAEjC,OAAO,YAAY;AACnB,OAAO,gBAAgB;AAGvB,SAAS,2BAA2B;AAGpC,SAAS,8BAA8B;AAGhC,SAAS,iCACd,KACA,sBACA,cACyB;AACzB,QAAM,YAAY;AAAA,IAChB;AAAA,IACA;AAAA,IACA;AAAA,EACF;AAGA,SAAO,UAAU,IAAI,CAAC,aAAa;AACjC,UAAM,sBAAsB,+BAA+B,QAAQ;AACnE,UAAM,YAAY;AAAA,MAChB,gBAAgB;AAAA,IAClB;AAEA,WAAO,sBACH,EAAE,GAAG,qBAAqB,GAAG,UAAU,IACvC,EAAE,OAAO,UAAU,GAAG,UAAU;AAAA,EACtC,CAAC;AACH;AAGO,MAAM,oCAA6D;AAAA,EACxE,EAAE,OAAO,KAAK;AAChB;AAGO,MAAM,mBAAmB,MAAM;AACpC,SACE;AAAA,IAAC;AAAA;AAAA,MACC,OAAO;AAAA,QACL,OAAO,OAAO,KAAK,QAAQ;AAAA,QAC3B,YAAY,WAAW,KAAK,KAAK,QAAQ;AAAA,MAC3C;AAAA,MACD;AAAA;AAAA,EAED;AAEJ;AAMO,MAAM,iCAGT;AAAA,EACF,KAAK;AAAA,IACH,OAAO;AAAA,IACP,SACE,oBAAC,oBAAkB,GAAG,oBAAoB,oBAAoB,QAAQ;AAAA,IAExE,kBAAkB;AAAA,EACpB;AAAA,EACA,MAAM;AAAA,IACJ,OAAO;AAAA,IACP,SACE;AAAA,MAAC;AAAA;AAAA,QACE,GAAG,oBAAoB,oBAAoB;AAAA;AAAA,IAC9C;AAAA,IAEF,kBAAkB;AAAA,EACpB;AAAA,EACA,KAAK;AAAA,IACH,OAAO;AAAA,IACP,SACE,oBAAC,oBAAkB,GAAG,oBAAoB,oBAAoB,UAAU;AAAA,IAE1E,kBAAkB;AAAA,EACpB;AAAA,EACA,MAAM;AAAA,IACJ,OAAO;AAAA,IACP,SACE;AAAA,MAAC;AAAA;AAAA,QACE,GAAG,oBAAoB,oBAAoB;AAAA;AAAA,IAC9C;AAAA,IAEF,kBAAkB;AAAA,EACpB;AAAA,EACA,KAAK;AAAA,IACH,OAAO;AAAA,IACP,SACE;AAAA,MAAC;AAAA;AAAA,QACE,GAAG,oBAAoB,oBAAoB;AAAA;AAAA,IAC9C;AAAA,IAEF,kBAAkB;AAAA,EACpB;AAAA,EACA,MAAM;AAAA,IACJ,OAAO;AAAA,IACP,SACE;AAAA,MAAC;AAAA;AAAA,QACE,GAAG,oBAAoB,oBAAoB;AAAA;AAAA,IAC9C;AAAA,IAEF,kBAAkB;AAAA,EACpB;AAAA,EACA,IAAI;AAAA,IACF,OAAO;AAAA,IACP,cAAc;AAAA,IACd,SACE,oBAAC,oBAAkB,GAAG,oBAAoB,oBAAoB,IAAI;AAAA,IAEpE,UAAU;AAAA,IACV,sBAAsB;AAAA,IACtB,kBAAkB;AAAA,EACpB;AAAA,EACA,UAAU;AAAA,IACR,OAAO;AAAA,IACP,cAAc;AAAA,IACd,SACE,oBAAC,oBAAkB,GAAG,oBAAoB,oBAAoB,OAAO;AAAA,IAEvE,UAAU;AAAA,IACV,sBAAsB;AAAA,IACtB,kBAAkB;AAAA,EACpB;AAAA,EACA,eAAe;AAAA,IACb,OAAO;AAAA,IACP,cACE,qBAAC,SAAI;AAAA;AAAA,MACD,oBAAC,oBAAiB;AAAA,MAAE;AAAA,OACxB;AAAA,IAEF,SACE;AAAA,MAAC;AAAA;AAAA,QACE,GAAG,oBAAoB,oBAAoB;AAAA;AAAA,IAC9C;AAAA,IAEF,UAAU;AAAA,IACV,sBAAsB;AAAA,IACtB,kBAAkB;AAAA,EACpB;AAAA,EACA,UAAU;AAAA,IACR,OAAO;AAAA,IACP,cACE,qBAAC,SAAI;AAAA;AAAA,MACA,oBAAC,oBAAiB;AAAA,MAAE;AAAA,OACzB;AAAA,IAEF,SACE,oBAAC,oBAAkB,GAAG,oBAAoB,oBAAoB,UAAU;AAAA,IAE1E,UAAU;AAAA,IACV,sBAAsB;AAAA,IACtB,kBAAkB;AAAA,EACpB;AAAA,EACA,aAAa;AAAA,IACX,OAAO;AAAA,IACP,cACE,qBAAC,SAAI;AAAA;AAAA,MACA,oBAAC,oBAAiB;AAAA,OACvB;AAAA,IAEF,SACE,oBAAC,oBAAkB,GAAG,oBAAoB,oBAAoB,UAAU;AAAA,IAE1E,UAAU;AAAA,IACV,sBAAsB;AAAA,IACtB,kBAAkB;AAAA,EACpB;AAAA,EACA,mBAAmB;AAAA,IACjB,OAAO;AAAA,IACP,cACE,qBAAC,SAAI;AAAA;AAAA,MACA,oBAAC,oBAAiB;AAAA,MAAE;AAAA,OACzB;AAAA,IAEF,SACE;AAAA,MAAC;AAAA;AAAA,QACE,GAAG,oBAAoB,oBAAoB;AAAA;AAAA,IAC9C;AAAA,IAEF,UAAU;AAAA,IACV,sBAAsB;AAAA,IACtB,kBAAkB;AAAA,EACpB;AAAA,EACA,gBAAgB;AAAA,IACd,OAAO;AAAA,IACP,cACE,qBAAC,SAAI;AAAA;AAAA,MACC,oBAAC,oBAAiB;AAAA,MAAE;AAAA,OAC1B;AAAA,IAEF,SACE;AAAA,MAAC;AAAA;AAAA,QACE,GAAG,oBAAoB,oBAAoB;AAAA;AAAA,IAC9C;AAAA,IAEF,UAAU;AAAA,IACV,sBAAsB;AAAA,IACtB,kBAAkB;AAAA,EACpB;AAAA,EACA,iBAAiB;AAAA,IACf,OAAO;AAAA,IACP,cACE,qBAAC,SAAI;AAAA;AAAA,MAEH,oBAAC,oBAAiB;AAAA,OACpB;AAAA,IAEF,SACE;AAAA,MAAC;AAAA;AAAA,QACE,GAAG,oBAAoB,oBAAoB;AAAA;AAAA,IAC9C;AAAA,IAEF,UAAU;AAAA,IACV,sBAAsB;AAAA,IACtB,kBAAkB;AAAA,EACpB;AAAA,EACA,OAAO;AAAA,IACL,OAAO;AAAA,IACP,SACE,oBAAC,oBAAkB,GAAG,oBAAoB,oBAAoB,QAAQ;AAAA,EAE1E;AAAA,EACA,QAAQ;AAAA,IACN,OAAO;AAAA,IACP,SACE;AAAA,MAAC;AAAA;AAAA,QACE,GAAG,oBAAoB,oBAAoB;AAAA;AAAA,IAC9C;AAAA,IAEF,kBAAkB;AAAA,EACpB;AAAA,EACA,KAAK;AAAA,IACH,OAAO;AAAA,IACP,SACE;AAAA,MAAC;AAAA;AAAA,QACE,GAAG,oBAAoB,oBAAoB;AAAA;AAAA,IAC9C;AAAA,IAEF,kBAAkB;AAAA,EACpB;AAAA,EACA,MAAM;AAAA,IACJ,OAAO;AAAA,IACP,SACE;AAAA,MAAC;AAAA;AAAA,QACE,GAAG,oBAAoB,oBAAoB;AAAA;AAAA,IAC9C;AAAA,IAEF,kBAAkB;AAAA,EACpB;AACF;",
   "names": []
 }

package/esm/filters/filter-field/utils/suggestions-utils/suggestion-matching.js

@@ -0,0 +1,46 @@
+function normalizeSuggestionMatchText(value) {
+  return value.replace(/(["'\\])/g, "").toLowerCase();
+}
+function getSuggestionMatchTargets(suggestion, options = {}) {
+  const { includeDetails = true } = options;
+  const targets = [];
+  if (typeof suggestion.displayValue === "string") {
+    targets.push(suggestion.displayValue);
+  } else if (typeof suggestion.value === "string") {
+    targets.push(suggestion.value);
+  }
+  if (includeDetails && typeof suggestion.details === "string") {
+    targets.push(suggestion.details);
+  }
+  return targets.map(normalizeSuggestionMatchText);
+}
+function suggestionMatchesTerm(suggestion, term, options) {
+  const normalizedTerm = normalizeSuggestionMatchText(term);
+  return getSuggestionMatchTargets(suggestion, options).some(
+    (target) => target.includes(normalizedTerm)
+  );
+}
+function getMatchPriority(normalizedValue, needle) {
+  if (normalizedValue === needle) {
+    return 0;
+  }
+  if (normalizedValue.startsWith(needle)) {
+    return 1;
+  }
+  return 2;
+}
+function getSuggestionMatchPriority(suggestion, normalizedTerm, options) {
+  const targets = getSuggestionMatchTargets(suggestion, options);
+  if (targets.length === 0) {
+    return 2;
+  }
+  return Math.min(
+    ...targets.map((target) => getMatchPriority(target, normalizedTerm))
+  );
+}
+export {
+  getSuggestionMatchPriority,
+  normalizeSuggestionMatchText,
+  suggestionMatchesTerm
+};
+//# sourceMappingURL=suggestion-matching.js.map

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

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../../../../src/filters/filter-field/utils/suggestions-utils/suggestion-matching.ts"],
+  "sourcesContent": ["/**\n * Shared matching engine for FilterField suggestions.\n *\n * Two questions are asked of every suggestion against the current search term:\n *  1. Does it match? (used for filtering \u2014 see `suggestionMatchesTerm`)\n *  2. How well does it match? (used for sorting \u2014 see `getSuggestionMatchPriority`)\n *\n * Both questions are answered against the same set of \"match targets\" (see\n * `getSuggestionMatchTargets`) and the same text normalization\n * (see `normalizeSuggestionMatchText`) so filtering and sorting can never drift apart.\n */\n\nimport type { FilterFieldSuggestion } from '../../suggestions/Suggestion.types.js';\n\nexport type SuggestionMatchingOptions = {\n  /**\n   * When `false`, the suggestion's `details` text is excluded from matching.\n   * Used at call sites that match suggestions which carry display-only details\n   * (e.g. logical-operator suggestions).\n   * @defaultValue true\n   */\n  includeDetails?: boolean;\n};\n\n/**\n * Canonicalizes text for matching: strips quotes/backslashes and lowercases.\n * Applied to both the search term and every match target so quoted/escaped\n * user input compares against the same normalized form as raw suggestion text.\n * @internal\n */\nexport function normalizeSuggestionMatchText(value: string) {\n  return value.replace(/([\"'\\\\])/g, '').toLowerCase();\n}\n\n/**\n * Returns the normalized strings of a suggestion that participate in matching.\n *\n * Rules:\n *  - `displayValue` and `value` are mutually exclusive: if a string `displayValue`\n *    is provided, it wins (that's what the user sees and types against);\n *    otherwise the raw `value` is used.\n *  - `details` is an *additional* target, only when it's a string and details\n *    matching is enabled via options.\n *\n * Non-string fields (ReactNode `displayValue`/`details`, array `value`, etc.)\n * are silently skipped \u2014 they can't be substring-matched against a typed term.\n *\n * Kept private: only the two primitives below (`suggestionMatchesTerm`,\n * `getSuggestionMatchPriority`) need to know how targets are derived.\n */\nfunction getSuggestionMatchTargets(\n  suggestion: FilterFieldSuggestion,\n  options: SuggestionMatchingOptions = {},\n): string[] {\n  const { includeDetails = true } = options;\n  const targets: string[] = [];\n\n  if (typeof suggestion.displayValue === 'string') {\n    targets.push(suggestion.displayValue);\n  } else if (typeof suggestion.value === 'string') {\n    targets.push(suggestion.value);\n  }\n\n  if (includeDetails && typeof suggestion.details === 'string') {\n    targets.push(suggestion.details);\n  }\n\n  return targets.map(normalizeSuggestionMatchText);\n}\n\n/**\n * Filtering primitive: does any match target contain the normalized term?\n * @internal\n */\nexport function suggestionMatchesTerm(\n  suggestion: FilterFieldSuggestion,\n  term: string,\n  options?: SuggestionMatchingOptions,\n): boolean {\n  const normalizedTerm = normalizeSuggestionMatchText(term);\n\n  return getSuggestionMatchTargets(suggestion, options).some((target) =>\n    target.includes(normalizedTerm),\n  );\n}\n\n/**\n * Position score for a single target against the needle.\n * Lower is better \u2014 used by sort comparators that want exact > startsWith > contains.\n */\nfunction getMatchPriority(normalizedValue: string, needle: string): number {\n  if (normalizedValue === needle) {\n    return 0; // exact match\n  }\n  if (normalizedValue.startsWith(needle)) {\n    return 1; // prefix match\n  }\n\n  return 2; // contains (or no match \u2014 same bucket; non-matches are pre-filtered)\n}\n\n/**\n * Sorting primitive: best (lowest) priority across all of the suggestion's\n * match targets. A suggestion that matches by `value` exactly is ranked above\n * one that only contains the term in `details`, etc.\n *\n * Returns 2 (worst bucket) when no targets exist, so suggestions without\n * matchable text sort to the end without throwing.\n * @internal\n */\nexport function getSuggestionMatchPriority(\n  suggestion: FilterFieldSuggestion,\n  normalizedTerm: string,\n  options?: SuggestionMatchingOptions,\n): number {\n  const targets = getSuggestionMatchTargets(suggestion, options);\n\n  if (targets.length === 0) {\n    return 2;\n  }\n\n  return Math.min(\n    ...targets.map((target) => getMatchPriority(target, normalizedTerm)),\n  );\n}\n"],
+  "mappings": "AA8BO,SAAS,6BAA6B,OAAe;AAC1D,SAAO,MAAM,QAAQ,aAAa,EAAE,EAAE,YAAY;AACpD;AAkBA,SAAS,0BACP,YACA,UAAqC,CAAC,GAC5B;AACV,QAAM,EAAE,iBAAiB,KAAK,IAAI;AAClC,QAAM,UAAoB,CAAC;AAE3B,MAAI,OAAO,WAAW,iBAAiB,UAAU;AAC/C,YAAQ,KAAK,WAAW,YAAY;AAAA,EACtC,WAAW,OAAO,WAAW,UAAU,UAAU;AAC/C,YAAQ,KAAK,WAAW,KAAK;AAAA,EAC/B;AAEA,MAAI,kBAAkB,OAAO,WAAW,YAAY,UAAU;AAC5D,YAAQ,KAAK,WAAW,OAAO;AAAA,EACjC;AAEA,SAAO,QAAQ,IAAI,4BAA4B;AACjD;AAMO,SAAS,sBACd,YACA,MACA,SACS;AACT,QAAM,iBAAiB,6BAA6B,IAAI;AAExD,SAAO,0BAA0B,YAAY,OAAO,EAAE;AAAA,IAAK,CAAC,WAC1D,OAAO,SAAS,cAAc;AAAA,EAChC;AACF;AAMA,SAAS,iBAAiB,iBAAyB,QAAwB;AACzE,MAAI,oBAAoB,QAAQ;AAC9B,WAAO;AAAA,EACT;AACA,MAAI,gBAAgB,WAAW,MAAM,GAAG;AACtC,WAAO;AAAA,EACT;AAEA,SAAO;AACT;AAWO,SAAS,2BACd,YACA,gBACA,SACQ;AACR,QAAM,UAAU,0BAA0B,YAAY,OAAO;AAE7D,MAAI,QAAQ,WAAW,GAAG;AACxB,WAAO;AAAA,EACT;AAEA,SAAO,KAAK;AAAA,IACV,GAAG,QAAQ,IAAI,CAAC,WAAW,iBAAiB,QAAQ,cAAc,CAAC;AAAA,EACrE;AACF;",
+  "names": []
+}

package/esm/filters/segment-selector/SegmentSelector.css

@@ -1,22 +1,22 @@
-._11m6jkl0-3-5-0 {
+._11m6jkl0-3-6-0 {
   all: unset;
   display: flex;
   flex-direction: column;
   gap: var(--dt-spacings-size-8, 8px);
 }
-._11m6jkl1-3-5-0 {
+._11m6jkl1-3-6-0 {
   all: unset;
   width: 100%;
   display: flex;
   flex-direction: column;
   gap: var(--dt-spacings-size-4, 4px);
 }
-._11m6jkl2-3-5-0 {
+._11m6jkl2-3-6-0 {
   max-height: 100px;
   overflow-y: auto;
   overflow-x: hidden;
   padding-right: var(--dt-spacings-size-12, 12px);
 }
-._11m6jkl3-3-5-0 > div {
+._11m6jkl3-3-6-0 > div {
   padding-right: var(--dt-spacings-size-0, 0);
 }

package/esm/filters/segment-selector/SegmentSelector.js

@@ -146,7 +146,7 @@ const SegmentSelectorFwd = forwardRef((props, forwardedRef) => {
           formFieldMessagesState.formControlMessages,
           errorId,
           true
-        );
+        ).catch(() => void 0);
       }
       onOpenChange?.(isOpen2);
     },
@@ -187,14 +187,14 @@ const SegmentSelectorFwd = forwardRef((props, forwardedRef) => {
             }
           });
         }
-        await validateSegments(
+        validateSegments(
           segments,
           onChange,
           formFieldMessagesDispatch,
           formFieldMessagesState.formControlMessages,
           errorId,
           true
-        );
+        ).catch(() => void 0);
       }
     }),
     [
@@ -216,7 +216,7 @@ const SegmentSelectorFwd = forwardRef((props, forwardedRef) => {
       formFieldMessagesDispatch,
       formFieldMessagesState.formControlMessages,
       errorId
-    );
+    ).catch(() => void 0);
   }, [
     errorId,
     formFieldMessagesDispatch,