@dynatrace/strato-components 3.12.2 → 3.13.2

package/esm/filters/filter-field/utils/conversion/lezer-tree-conversion/parent-node/inclusion.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../../../../../../../src/filters/filter-field/utils/conversion/lezer-tree-conversion/parent-node/inclusion.ts"],
-  "sourcesContent": ["import type { SyntaxNodeRef } from '@lezer/common';\n\nimport { isDev } from '../../../../../../core/utils/is-node-environment.js';\nimport type { FilterFieldProps } from '../../../../FilterField.types.js';\nimport type { NumberFormatParser } from '../../../../parser/getNumberParser.js';\nimport type { ConvertedLezerNode } from '../../../../types/conversion-utils.js';\nimport type { FilterFieldError } from '../../../../types/filter-field-error.js';\nimport type {\n  FilterFieldErrorNode,\n  FilterFieldLezerNodeType,\n  FilterFieldListNode,\n} from '../../../../types/tree-nodes.js';\nimport { FilterFieldCustomTypes } from '../../../../types/validation.js';\nimport { getTextFromRange } from '../../../get-text.js';\nimport { convertToErrorNode, updateNodeValues } from '../node-mutations.js';\nimport { convertBoolean } from '../value/boolean.js';\nimport { convertDuration } from '../value/duration.js';\nimport { convertIdentifier } from '../value/identifier.js';\nimport { convertNumber } from '../value/number.js';\nimport { convertSimpleValue } from '../value/simple-value.js';\n\n/**\n * Convert an inclusion node.\n * @internal\n */\nexport function convertInclusionValue(\n  node: SyntaxNodeRef,\n  doc: string,\n  numberParser: NumberFormatParser,\n  customTypes?: FilterFieldCustomTypes,\n  parserConfig?: FilterFieldProps['parserConfig'],\n): ConvertedLezerNode<FilterFieldListNode> {\n  const { from, to } = node;\n  const cursor = node.node.cursor();\n\n  const convertedNode: FilterFieldListNode | FilterFieldErrorNode = {\n    type: 'List',\n    range: {\n      from,\n      to,\n    },\n    textValue: getTextFromRange(node, doc),\n    value: [],\n  };\n  const errors: FilterFieldError[] = [];\n  const parentheses = { opening: false, closing: false };\n  let highlightFullListAsError = false;\n\n  cursor.iterate((childNode) => {\n    const nodeName = childNode.name as FilterFieldLezerNodeType;\n    const { from: childFrom, to: childTo } = childNode;\n\n    switch (nodeName) {\n      case 'FilterIncludesValue':\n      case 'List': {\n        // Intentionally left empty.\n        // Duplicating the tree cursor starts at the list node again.\n        break;\n      }\n      case 'OpeningBracket':\n        parentheses.opening = true;\n        break;\n      case 'ClosingBracket':\n        parentheses.closing = true;\n        break;\n      case 'ListValue': {\n        const {\n          convertedNode: valueNode,\n          errors: valueErrors,\n          positionOperators,\n        } = convertSimpleValue(\n          childNode,\n          doc,\n          numberParser,\n          customTypes,\n          parserConfig,\n        );\n\n        if (positionOperators) {\n          convertToErrorNode(valueNode);\n\n          for (const range of positionOperators.ranges) {\n            errors.push({\n              range,\n              message: 'invalidWildCardOperatorInList',\n            });\n          }\n        }\n\n        convertedNode.value.push(valueNode);\n        errors.push(...valueErrors);\n        return false;\n      }\n      case 'Identifier':\n      case 'String':\n      case 'IncompleteString': {\n        const {\n          convertedNode: valueNode,\n          positionOperators: { endsWithOperator, startsWithOperator },\n          embeddedWildcards,\n        } = convertIdentifier(childNode, doc, nodeName);\n\n        // Position operators are not supported inside lists.\n        if (endsWithOperator) {\n          convertToErrorNode(valueNode);\n          errors.push({\n            range: endsWithOperator,\n            message: 'unsupportedPositionOperator',\n          });\n        }\n        if (startsWithOperator) {\n          convertToErrorNode(valueNode);\n          errors.push({\n            range: startsWithOperator,\n            message: 'unsupportedPositionOperator',\n          });\n        }\n        for (const range of embeddedWildcards) {\n          convertToErrorNode(valueNode);\n          errors.push({ range, message: 'unsupportedPositionOperator' });\n        }\n\n        convertedNode.value.push(valueNode);\n\n        break;\n      }\n      case 'Number': {\n        const { convertedNode: numberNode } = convertNumber(\n          childNode,\n          doc,\n          numberParser,\n        );\n        convertedNode.value.push(numberNode);\n        break;\n      }\n      case 'Boolean': {\n        const { convertedNode: booleanNode } = convertBoolean(childNode, doc);\n        convertedNode.value.push(booleanNode);\n        break;\n      }\n      case 'Duration': {\n        const { convertedNode: durationNode } = convertDuration(childNode, doc);\n        convertedNode.value.push(durationNode);\n        break;\n      }\n      case 'PositionOperator':\n      case 'InvalidPositionOperator': {\n        const text = getTextFromRange(childNode, doc);\n        const errorNode: FilterFieldErrorNode = {\n          type: 'Error',\n          range: { from: childFrom, to: childTo },\n          textValue: text,\n          value: text,\n        };\n        convertedNode.value.push(errorNode);\n        errors.push({\n          range: { from: childFrom, to: childTo },\n          message: 'unsupportedPositionOperator',\n        });\n\n        break;\n      }\n      case 'InvalidInclusionValue':\n        highlightFullListAsError = true;\n        convertToErrorNode(convertedNode);\n        updateNodeValues(convertedNode, getTextFromRange(childNode, doc));\n        break;\n      case '\u26A0':\n        highlightFullListAsError = true;\n        break;\n      default:\n        if (isDev()) {\n          // eslint-disable-next-line no-console\n          console.log(\n            `${doc.toString()} | Syntax node '${\n              childNode.name\n            }' is not yet handled in the list conversion. Please make sure to handle all nodes accordingly.`,\n          );\n        }\n    }\n  });\n\n  // Empty or invalid inclusion value.\n  if (convertedNode.value.length === 0) {\n    convertedNode.textValue = getTextFromRange(convertedNode.range, doc);\n    convertToErrorNode(convertedNode);\n    errors.push({\n      range: { from, to },\n      message: 'emptyInclusionValue',\n    });\n  } else if (highlightFullListAsError) {\n    convertedNode.textValue = getTextFromRange(convertedNode.range, doc);\n    convertToErrorNode(convertedNode);\n    errors.push({\n      range: { from, to },\n      message: 'invalidInclusionValue',\n    });\n  }\n\n  return {\n    convertedNode,\n    errors,\n  };\n}\n"],
-  "mappings": "AAEA,SAAS,aAAa;AAWtB,SAAS,wBAAwB;AACjC,SAAS,oBAAoB,wBAAwB;AACrD,SAAS,sBAAsB;AAC/B,SAAS,uBAAuB;AAChC,SAAS,yBAAyB;AAClC,SAAS,qBAAqB;AAC9B,SAAS,0BAA0B;AAM5B,SAAS,sBACd,MACA,KACA,cACA,aACA,cACyC;AACzC,QAAM,EAAE,MAAM,GAAG,IAAI;AACrB,QAAM,SAAS,KAAK,KAAK,OAAO;AAEhC,QAAM,gBAA4D;AAAA,IAChE,MAAM;AAAA,IACN,OAAO;AAAA,MACL;AAAA,MACA;AAAA,IACF;AAAA,IACA,WAAW,iBAAiB,MAAM,GAAG;AAAA,IACrC,OAAO,CAAC;AAAA,EACV;AACA,QAAM,SAA6B,CAAC;AACpC,QAAM,cAAc,EAAE,SAAS,OAAO,SAAS,MAAM;AACrD,MAAI,2BAA2B;AAE/B,SAAO,QAAQ,CAAC,cAAc;AAC5B,UAAM,WAAW,UAAU;AAC3B,UAAM,EAAE,MAAM,WAAW,IAAI,QAAQ,IAAI;AAEzC,YAAQ,UAAU;AAAA,MAChB,KAAK;AAAA,MACL,KAAK,QAAQ;AAGX;AAAA,MACF;AAAA,MACA,KAAK;AACH,oBAAY,UAAU;AACtB;AAAA,MACF,KAAK;AACH,oBAAY,UAAU;AACtB;AAAA,MACF,KAAK,aAAa;AAChB,cAAM;AAAA,UACJ,eAAe;AAAA,UACf,QAAQ;AAAA,UACR;AAAA,QACF,IAAI;AAAA,UACF;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,QACF;AAEA,YAAI,mBAAmB;AACrB,6BAAmB,SAAS;AAE5B,qBAAW,SAAS,kBAAkB,QAAQ;AAC5C,mBAAO,KAAK;AAAA,cACV;AAAA,cACA,SAAS;AAAA,YACX,CAAC;AAAA,UACH;AAAA,QACF;AAEA,sBAAc,MAAM,KAAK,SAAS;AAClC,eAAO,KAAK,GAAG,WAAW;AAC1B,eAAO;AAAA,MACT;AAAA,MACA,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK,oBAAoB;AACvB,cAAM;AAAA,UACJ,eAAe;AAAA,UACf,mBAAmB,EAAE,kBAAkB,mBAAmB;AAAA,UAC1D;AAAA,QACF,IAAI,kBAAkB,WAAW,KAAK,QAAQ;AAG9C,YAAI,kBAAkB;AACpB,6BAAmB,SAAS;AAC5B,iBAAO,KAAK;AAAA,YACV,OAAO;AAAA,YACP,SAAS;AAAA,UACX,CAAC;AAAA,QACH;AACA,YAAI,oBAAoB;AACtB,6BAAmB,SAAS;AAC5B,iBAAO,KAAK;AAAA,YACV,OAAO;AAAA,YACP,SAAS;AAAA,UACX,CAAC;AAAA,QACH;AACA,mBAAW,SAAS,mBAAmB;AACrC,6BAAmB,SAAS;AAC5B,iBAAO,KAAK,EAAE,OAAO,SAAS,8BAA8B,CAAC;AAAA,QAC/D;AAEA,sBAAc,MAAM,KAAK,SAAS;AAElC;AAAA,MACF;AAAA,MACA,KAAK,UAAU;AACb,cAAM,EAAE,eAAe,WAAW,IAAI;AAAA,UACpC;AAAA,UACA;AAAA,UACA;AAAA,QACF;AACA,sBAAc,MAAM,KAAK,UAAU;AACnC;AAAA,MACF;AAAA,MACA,KAAK,WAAW;AACd,cAAM,EAAE,eAAe,YAAY,IAAI,eAAe,WAAW,GAAG;AACpE,sBAAc,MAAM,KAAK,WAAW;AACpC;AAAA,MACF;AAAA,MACA,KAAK,YAAY;AACf,cAAM,EAAE,eAAe,aAAa,IAAI,gBAAgB,WAAW,GAAG;AACtE,sBAAc,MAAM,KAAK,YAAY;AACrC;AAAA,MACF;AAAA,MACA,KAAK;AAAA,MACL,KAAK,2BAA2B;AAC9B,cAAM,OAAO,iBAAiB,WAAW,GAAG;AAC5C,cAAM,YAAkC;AAAA,UACtC,MAAM;AAAA,UACN,OAAO,EAAE,MAAM,WAAW,IAAI,QAAQ;AAAA,UACtC,WAAW;AAAA,UACX,OAAO;AAAA,QACT;AACA,sBAAc,MAAM,KAAK,SAAS;AAClC,eAAO,KAAK;AAAA,UACV,OAAO,EAAE,MAAM,WAAW,IAAI,QAAQ;AAAA,UACtC,SAAS;AAAA,QACX,CAAC;AAED;AAAA,MACF;AAAA,MACA,KAAK;AACH,mCAA2B;AAC3B,2BAAmB,aAAa;AAChC,yBAAiB,eAAe,iBAAiB,WAAW,GAAG,CAAC;AAChE;AAAA,MACF,KAAK;AACH,mCAA2B;AAC3B;AAAA,MACF;AACE,YAAI,MAAM,GAAG;AAEX,kBAAQ;AAAA,YACN,GAAG,IAAI,SAAS,CAAC,mBACf,UAAU,IACZ;AAAA,UACF;AAAA,QACF;AAAA,IACJ;AAAA,EACF,CAAC;AAGD,MAAI,cAAc,MAAM,WAAW,GAAG;AACpC,kBAAc,YAAY,iBAAiB,cAAc,OAAO,GAAG;AACnE,uBAAmB,aAAa;AAChC,WAAO,KAAK;AAAA,MACV,OAAO,EAAE,MAAM,GAAG;AAAA,MAClB,SAAS;AAAA,IACX,CAAC;AAAA,EACH,WAAW,0BAA0B;AACnC,kBAAc,YAAY,iBAAiB,cAAc,OAAO,GAAG;AACnE,uBAAmB,aAAa;AAChC,WAAO,KAAK;AAAA,MACV,OAAO,EAAE,MAAM,GAAG;AAAA,MAClB,SAAS;AAAA,IACX,CAAC;AAAA,EACH;AAEA,SAAO;AAAA,IACL;AAAA,IACA;AAAA,EACF;AACF;",
+  "sourcesContent": ["import type { SyntaxNodeRef } from '@lezer/common';\n\nimport { isDev } from '../../../../../../core/utils/is-node-environment.js';\nimport type { FilterFieldProps } from '../../../../FilterField.types.js';\nimport type { NumberFormatParser } from '../../../../parser/getNumberParser.js';\nimport type { ConvertedLezerNode } from '../../../../types/conversion-utils.js';\nimport type { FilterFieldError } from '../../../../types/filter-field-error.js';\nimport type {\n  FilterFieldErrorNode,\n  FilterFieldLezerNodeType,\n  FilterFieldListNode,\n} from '../../../../types/tree-nodes.js';\nimport { FilterFieldCustomTypes } from '../../../../types/validation.js';\nimport { getTextFromRange } from '../../../get-text.js';\nimport { convertToErrorNode, updateNodeValues } from '../node-mutations.js';\nimport { convertBoolean } from '../value/boolean.js';\nimport { convertDuration } from '../value/duration.js';\nimport { convertIdentifier } from '../value/identifier.js';\nimport { convertNumber } from '../value/number.js';\nimport { convertSimpleValue } from '../value/simple-value.js';\n\n/**\n * Convert an inclusion node.\n * @internal\n */\nexport function convertInclusionValue(\n  node: SyntaxNodeRef,\n  doc: string,\n  numberParser: NumberFormatParser,\n  customTypes?: FilterFieldCustomTypes,\n  parserConfig?: FilterFieldProps['parserConfig'],\n): ConvertedLezerNode<FilterFieldListNode> {\n  const { from, to } = node;\n  const cursor = node.node.cursor();\n\n  const convertedNode: FilterFieldListNode | FilterFieldErrorNode = {\n    type: 'List',\n    range: {\n      from,\n      to,\n    },\n    textValue: getTextFromRange(node, doc),\n    value: [],\n  };\n  const errors: FilterFieldError[] = [];\n  const parentheses = { opening: false, closing: false };\n  let highlightFullListAsError = false;\n\n  cursor.iterate((childNode) => {\n    const nodeName = childNode.name as FilterFieldLezerNodeType;\n    const { from: childFrom, to: childTo } = childNode;\n\n    switch (nodeName) {\n      case 'FilterIncludesValue':\n      case 'List': {\n        // Intentionally left empty.\n        // Duplicating the tree cursor starts at the list node again.\n        break;\n      }\n      case 'OpeningBracket':\n        parentheses.opening = true;\n        break;\n      case 'ClosingBracket':\n        parentheses.closing = true;\n        break;\n      case 'ListValue': {\n        const {\n          convertedNode: valueNode,\n          errors: valueErrors,\n          positionOperators,\n          wildcardInMiddle,\n        } = convertSimpleValue(\n          childNode,\n          doc,\n          numberParser,\n          customTypes,\n          parserConfig,\n        );\n\n        if (positionOperators || wildcardInMiddle) {\n          convertToErrorNode(valueNode);\n\n          for (const range of [\n            ...(positionOperators?.ranges ?? []),\n            ...(wildcardInMiddle ?? []),\n          ]) {\n            errors.push({\n              range,\n              message: 'invalidWildCardOperatorInList',\n            });\n          }\n        }\n\n        convertedNode.value.push(valueNode);\n        errors.push(...valueErrors);\n        return false;\n      }\n      case 'Identifier':\n      case 'String':\n      case 'IncompleteString': {\n        const {\n          convertedNode: valueNode,\n          positionOperators: { endsWithOperator, startsWithOperator },\n          embeddedWildcards,\n        } = convertIdentifier(childNode, doc, nodeName);\n\n        // Position operators are not supported inside lists.\n        if (endsWithOperator) {\n          convertToErrorNode(valueNode);\n          errors.push({\n            range: endsWithOperator,\n            message: 'unsupportedPositionOperator',\n          });\n        }\n        if (startsWithOperator) {\n          convertToErrorNode(valueNode);\n          errors.push({\n            range: startsWithOperator,\n            message: 'unsupportedPositionOperator',\n          });\n        }\n        for (const range of embeddedWildcards) {\n          convertToErrorNode(valueNode);\n          errors.push({ range, message: 'unsupportedPositionOperator' });\n        }\n\n        convertedNode.value.push(valueNode);\n\n        break;\n      }\n      case 'Number': {\n        const { convertedNode: numberNode } = convertNumber(\n          childNode,\n          doc,\n          numberParser,\n        );\n        convertedNode.value.push(numberNode);\n        break;\n      }\n      case 'Boolean': {\n        const { convertedNode: booleanNode } = convertBoolean(childNode, doc);\n        convertedNode.value.push(booleanNode);\n        break;\n      }\n      case 'Duration': {\n        const { convertedNode: durationNode } = convertDuration(childNode, doc);\n        convertedNode.value.push(durationNode);\n        break;\n      }\n      case 'PositionOperator':\n      case 'InvalidPositionOperator': {\n        const text = getTextFromRange(childNode, doc);\n        const errorNode: FilterFieldErrorNode = {\n          type: 'Error',\n          range: { from: childFrom, to: childTo },\n          textValue: text,\n          value: text,\n        };\n        convertedNode.value.push(errorNode);\n        errors.push({\n          range: { from: childFrom, to: childTo },\n          message: 'unsupportedPositionOperator',\n        });\n\n        break;\n      }\n      case 'InvalidInclusionValue':\n        highlightFullListAsError = true;\n        convertToErrorNode(convertedNode);\n        updateNodeValues(convertedNode, getTextFromRange(childNode, doc));\n        break;\n      case '\u26A0':\n        highlightFullListAsError = true;\n        break;\n      default:\n        if (isDev()) {\n          // oxlint-disable-next-line no-console\n          console.log(\n            `${doc.toString()} | Syntax node '${\n              childNode.name\n            }' is not yet handled in the list conversion. Please make sure to handle all nodes accordingly.`,\n          );\n        }\n    }\n  });\n\n  // Empty or invalid inclusion value.\n  if (convertedNode.value.length === 0) {\n    convertedNode.textValue = getTextFromRange(convertedNode.range, doc);\n    convertToErrorNode(convertedNode);\n    errors.push({\n      range: { from, to },\n      message: 'emptyInclusionValue',\n    });\n  } else if (highlightFullListAsError) {\n    convertedNode.textValue = getTextFromRange(convertedNode.range, doc);\n    convertToErrorNode(convertedNode);\n    errors.push({\n      range: { from, to },\n      message: 'invalidInclusionValue',\n    });\n  }\n\n  return {\n    convertedNode,\n    errors,\n  };\n}\n"],
+  "mappings": "AAEA,SAAS,aAAa;AAWtB,SAAS,wBAAwB;AACjC,SAAS,oBAAoB,wBAAwB;AACrD,SAAS,sBAAsB;AAC/B,SAAS,uBAAuB;AAChC,SAAS,yBAAyB;AAClC,SAAS,qBAAqB;AAC9B,SAAS,0BAA0B;AAM5B,SAAS,sBACd,MACA,KACA,cACA,aACA,cACyC;AACzC,QAAM,EAAE,MAAM,GAAG,IAAI;AACrB,QAAM,SAAS,KAAK,KAAK,OAAO;AAEhC,QAAM,gBAA4D;AAAA,IAChE,MAAM;AAAA,IACN,OAAO;AAAA,MACL;AAAA,MACA;AAAA,IACF;AAAA,IACA,WAAW,iBAAiB,MAAM,GAAG;AAAA,IACrC,OAAO,CAAC;AAAA,EACV;AACA,QAAM,SAA6B,CAAC;AACpC,QAAM,cAAc,EAAE,SAAS,OAAO,SAAS,MAAM;AACrD,MAAI,2BAA2B;AAE/B,SAAO,QAAQ,CAAC,cAAc;AAC5B,UAAM,WAAW,UAAU;AAC3B,UAAM,EAAE,MAAM,WAAW,IAAI,QAAQ,IAAI;AAEzC,YAAQ,UAAU;AAAA,MAChB,KAAK;AAAA,MACL,KAAK,QAAQ;AAGX;AAAA,MACF;AAAA,MACA,KAAK;AACH,oBAAY,UAAU;AACtB;AAAA,MACF,KAAK;AACH,oBAAY,UAAU;AACtB;AAAA,MACF,KAAK,aAAa;AAChB,cAAM;AAAA,UACJ,eAAe;AAAA,UACf,QAAQ;AAAA,UACR;AAAA,UACA;AAAA,QACF,IAAI;AAAA,UACF;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,QACF;AAEA,YAAI,qBAAqB,kBAAkB;AACzC,6BAAmB,SAAS;AAE5B,qBAAW,SAAS;AAAA,YAClB,GAAI,mBAAmB,UAAU,CAAC;AAAA,YAClC,GAAI,oBAAoB,CAAC;AAAA,UAC3B,GAAG;AACD,mBAAO,KAAK;AAAA,cACV;AAAA,cACA,SAAS;AAAA,YACX,CAAC;AAAA,UACH;AAAA,QACF;AAEA,sBAAc,MAAM,KAAK,SAAS;AAClC,eAAO,KAAK,GAAG,WAAW;AAC1B,eAAO;AAAA,MACT;AAAA,MACA,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK,oBAAoB;AACvB,cAAM;AAAA,UACJ,eAAe;AAAA,UACf,mBAAmB,EAAE,kBAAkB,mBAAmB;AAAA,UAC1D;AAAA,QACF,IAAI,kBAAkB,WAAW,KAAK,QAAQ;AAG9C,YAAI,kBAAkB;AACpB,6BAAmB,SAAS;AAC5B,iBAAO,KAAK;AAAA,YACV,OAAO;AAAA,YACP,SAAS;AAAA,UACX,CAAC;AAAA,QACH;AACA,YAAI,oBAAoB;AACtB,6BAAmB,SAAS;AAC5B,iBAAO,KAAK;AAAA,YACV,OAAO;AAAA,YACP,SAAS;AAAA,UACX,CAAC;AAAA,QACH;AACA,mBAAW,SAAS,mBAAmB;AACrC,6BAAmB,SAAS;AAC5B,iBAAO,KAAK,EAAE,OAAO,SAAS,8BAA8B,CAAC;AAAA,QAC/D;AAEA,sBAAc,MAAM,KAAK,SAAS;AAElC;AAAA,MACF;AAAA,MACA,KAAK,UAAU;AACb,cAAM,EAAE,eAAe,WAAW,IAAI;AAAA,UACpC;AAAA,UACA;AAAA,UACA;AAAA,QACF;AACA,sBAAc,MAAM,KAAK,UAAU;AACnC;AAAA,MACF;AAAA,MACA,KAAK,WAAW;AACd,cAAM,EAAE,eAAe,YAAY,IAAI,eAAe,WAAW,GAAG;AACpE,sBAAc,MAAM,KAAK,WAAW;AACpC;AAAA,MACF;AAAA,MACA,KAAK,YAAY;AACf,cAAM,EAAE,eAAe,aAAa,IAAI,gBAAgB,WAAW,GAAG;AACtE,sBAAc,MAAM,KAAK,YAAY;AACrC;AAAA,MACF;AAAA,MACA,KAAK;AAAA,MACL,KAAK,2BAA2B;AAC9B,cAAM,OAAO,iBAAiB,WAAW,GAAG;AAC5C,cAAM,YAAkC;AAAA,UACtC,MAAM;AAAA,UACN,OAAO,EAAE,MAAM,WAAW,IAAI,QAAQ;AAAA,UACtC,WAAW;AAAA,UACX,OAAO;AAAA,QACT;AACA,sBAAc,MAAM,KAAK,SAAS;AAClC,eAAO,KAAK;AAAA,UACV,OAAO,EAAE,MAAM,WAAW,IAAI,QAAQ;AAAA,UACtC,SAAS;AAAA,QACX,CAAC;AAED;AAAA,MACF;AAAA,MACA,KAAK;AACH,mCAA2B;AAC3B,2BAAmB,aAAa;AAChC,yBAAiB,eAAe,iBAAiB,WAAW,GAAG,CAAC;AAChE;AAAA,MACF,KAAK;AACH,mCAA2B;AAC3B;AAAA,MACF;AACE,YAAI,MAAM,GAAG;AAEX,kBAAQ;AAAA,YACN,GAAG,IAAI,SAAS,CAAC,mBACf,UAAU,IACZ;AAAA,UACF;AAAA,QACF;AAAA,IACJ;AAAA,EACF,CAAC;AAGD,MAAI,cAAc,MAAM,WAAW,GAAG;AACpC,kBAAc,YAAY,iBAAiB,cAAc,OAAO,GAAG;AACnE,uBAAmB,aAAa;AAChC,WAAO,KAAK;AAAA,MACV,OAAO,EAAE,MAAM,GAAG;AAAA,MAClB,SAAS;AAAA,IACX,CAAC;AAAA,EACH,WAAW,0BAA0B;AACnC,kBAAc,YAAY,iBAAiB,cAAc,OAAO,GAAG;AACnE,uBAAmB,aAAa;AAChC,WAAO,KAAK;AAAA,MACV,OAAO,EAAE,MAAM,GAAG;AAAA,MAClB,SAAS;AAAA,IACX,CAAC;AAAA,EACH;AAEA,SAAO;AAAA,IACL;AAAA,IACA;AAAA,EACF;AACF;",
   "names": []
 }

package/esm/filters/filter-field/utils/conversion/lezer-tree-conversion/parent-node/statement.js

@@ -177,6 +177,33 @@ function validateKey(key, internalValidatorMap, errors = []) {
     });
   }
 }
+function convertWildcardInMiddle(convertedStatement, internalValidatorMap, wildcardRanges, errors, parserConfig) {
+  if (!convertedStatement.comparisonOperator) {
+    return;
+  }
+  const operator = convertedStatement.comparisonOperator;
+  const value = operator.value;
+  if (value !== "=" && value !== "!=") {
+    convertToErrorNode(convertedStatement.value);
+    for (const range of wildcardRanges) {
+      errors.push({ range, message: "invalidPositionOperator" });
+    }
+    return;
+  }
+  const newValue = value === "!=" ? "not-matches-wildcard" : "matches-wildcard";
+  convertedStatement.comparisonOperator.value = newValue;
+  if (!isValidOperator(
+    newValue,
+    convertedStatement.key?.textValue,
+    internalValidatorMap,
+    parserConfig
+  )) {
+    convertToErrorNode(convertedStatement.value);
+    for (const range of wildcardRanges) {
+      errors.push({ range, message: "invalidWildCardOperator" });
+    }
+  }
+}
 function convertFilterStatement(node, doc, numberParser, internalValidatorMap, customTypes, parserConfig, context) {
   const nodeName = node.name;
   const { from, to } = node;
@@ -190,6 +217,7 @@ function convertFilterStatement(node, doc, numberParser, internalValidatorMap, c
   };
   const errors = [];
   let positionOperators;
+  let wildcardInMiddle;
   let prevNode;
   function updatePreviousAndContinue(nodeName2) {
     prevNode = nodeName2;
@@ -238,7 +266,8 @@ function convertFilterStatement(node, doc, numberParser, internalValidatorMap, c
         const {
           convertedNode: value,
           errors: valueErrors,
-          positionOperators: valuePositionOperators
+          positionOperators: valuePositionOperators,
+          wildcardInMiddle: valueWildcardInMiddle
         } = convertSimpleValue(
           childNode,
           doc,
@@ -249,7 +278,10 @@ function convertFilterStatement(node, doc, numberParser, internalValidatorMap, c
         );
         convertedStatement.value = value;
         errors.push(...valueErrors);
-        positionOperators = valuePositionOperators;
+        wildcardInMiddle = valueWildcardInMiddle;
+        if (!wildcardInMiddle || wildcardInMiddle?.length === 0) {
+          positionOperators = valuePositionOperators;
+        }
         return updatePreviousAndContinue(nodeName2);
       }
       case "FilterIncludesValue": {
@@ -353,9 +385,11 @@ function convertFilterStatement(node, doc, numberParser, internalValidatorMap, c
         }
         return updatePreviousAndContinue(nodeName2);
       default:
-        console.log(
-          `${doc.toString()} | Syntax node '${nodeName2}' is not yet handled in the statement conversion. Please make sure to handle all nodes accordingly.`
-        );
+        if (isDev()) {
+          console.log(
+            `${doc.toString()} | Syntax node '${nodeName2}' is not yet handled in the statement conversion. Please make sure to handle all nodes accordingly.`
+          );
+        }
     }
     prevNode = nodeName2;
   });
@@ -368,6 +402,15 @@ function convertFilterStatement(node, doc, numberParser, internalValidatorMap, c
       parserConfig
     );
   }
+  if (convertedStatement.comparisonOperator && wildcardInMiddle?.length) {
+    convertWildcardInMiddle(
+      convertedStatement,
+      internalValidatorMap,
+      wildcardInMiddle,
+      errors,
+      parserConfig
+    );
+  }
   validateKeyAndValue(
     internalValidatorMap,
     convertedStatement,
@@ -377,7 +420,7 @@ function convertFilterStatement(node, doc, numberParser, internalValidatorMap, c
     parserConfig
   );
   const operator = convertedStatement.comparisonOperator;
-  if (operator && !positionOperators && (!isValidOperator(
+  if (operator && !positionOperators && !wildcardInMiddle?.length && (!isValidOperator(
     operator.textValue,
     convertedStatement.key?.value,
     internalValidatorMap,

package/esm/filters/filter-field/utils/conversion/lezer-tree-conversion/parent-node/statement.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../../../../../../../src/filters/filter-field/utils/conversion/lezer-tree-conversion/parent-node/statement.ts"],
-  "sourcesContent": ["import type { SyntaxNodeRef } from '@lezer/common';\n\nimport { convertInclusionValue } from './inclusion.js';\nimport { isDev } from '../../../../../../core/utils/is-node-environment.js';\nimport { postSpotErrorMark } from '../../../../decorations/decoration-marks.js';\nimport type { FilterFieldProps } from '../../../../FilterField.types.js';\nimport type { NumberFormatParser } from '../../../../parser/getNumberParser.js';\nimport type { ConvertedLezerNode } from '../../../../types/conversion-utils.js';\nimport type { FilterFieldError } from '../../../../types/filter-field-error.js';\nimport type {\n  FilterFieldLezerNodeType,\n  FilterFieldStatementNode,\n} from '../../../../types/tree-nodes.js';\nimport type {\n  PositionOperators,\n  FilterFieldCustomTypes,\n} from '../../../../types/validation.js';\nimport type { InternalValidatorMap } from '../../../../utils/validation-utils/normalize-validator-map.js';\nimport {\n  getErrorMessageForType,\n  isCustomType,\n} from '../../../error-utils/error-message-helpers.js';\nimport { getStatementStatus } from '../../../get-statement-status.js';\nimport { getTextFromRange } from '../../../get-text.js';\nimport { getValidValueTypes } from '../../../suggestions-utils/suggestion-type.js';\nimport {\n  getColoredSearchOperator,\n  getValidOperatorsColored,\n  isValidOperator,\n  isValidValue,\n} from '../../../validation-utils/validation-helper-functions.js';\nimport { convertExistsOperator } from '../comparator/exists.js';\nimport { convertComparisonOperator } from '../comparator/operator.js';\nimport { convertSearchOperator } from '../comparator/search.js';\nimport { convertFilterKey } from '../key/key.js';\nimport { convertToErrorNode } from '../node-mutations.js';\nimport { nodeTypeOverrides } from '../node-type-mapping.js';\nimport { convertFreeText } from '../value/free-text.js';\nimport { convertSimpleValue } from '../value/simple-value.js';\n\n/**\n * Returns the valid value types for the given key, or undefined when the key is\n * unknown or accepts any type (function predicate / no predicate).\n */\nfunction getKeyValidTypes(\n  keyValue: string | undefined,\n  internalValidatorMap: InternalValidatorMap | undefined,\n): string[] | undefined {\n  if (!keyValue || !internalValidatorMap) {\n    return undefined;\n  }\n  const predicate = internalValidatorMap.normalizedKeys.byKey.get(keyValue);\n  if (!predicate) {\n    return undefined;\n  }\n  if (predicate.valueType) {\n    return Array.isArray(predicate.valueType)\n      ? predicate.valueType\n      : [predicate.valueType];\n  }\n  if (\n    predicate.valuePredicate !== undefined &&\n    typeof predicate.valuePredicate !== 'function'\n  ) {\n    const { types } = getValidValueTypes(predicate.valuePredicate);\n    return types;\n  }\n  return undefined;\n}\n\n/**\n * If the filter field value contains position operators, the statement's operator node\n * needs to reflect them accordingly ((not) starts-with, ends-with, contains).\n * Errors are generated for invalid combinations of operators and position operators.\n */\nfunction convertPositionOperators(\n  convertedStatement: FilterFieldStatementNode,\n  internalValidatorMap: InternalValidatorMap | undefined,\n  positionOperators: PositionOperators,\n  errors: FilterFieldError[],\n  parserConfig?: FilterFieldProps['parserConfig'],\n) {\n  if (!convertedStatement.comparisonOperator || !positionOperators) {\n    return;\n  }\n\n  const operator = convertedStatement.comparisonOperator;\n  const value = operator?.value;\n\n  if (value === '=' || value === '!=' || operator?.type === 'SearchOperator') {\n    const newValue = `${value === '!=' ? 'not-' : ''}${positionOperators.type}`;\n    if (convertedStatement.comparisonOperator) {\n      convertedStatement.comparisonOperator.value = newValue;\n    }\n\n    // Check if position operators are limited by the validatorMap and generate errors if need be.\n    if (\n      !isValidOperator(\n        newValue,\n        convertedStatement.key?.textValue,\n        internalValidatorMap,\n        parserConfig,\n      )\n    ) {\n      convertToErrorNode(convertedStatement.value);\n      for (const positionOperator of positionOperators.ranges) {\n        errors.push({\n          range: positionOperator,\n          message: 'invalidWildCardOperator',\n        });\n      }\n    }\n  } else {\n    convertToErrorNode(convertedStatement.value);\n\n    for (const positionOperator of positionOperators.ranges) {\n      errors.push({\n        range: positionOperator,\n        message: 'invalidPositionOperator',\n      });\n    }\n  }\n}\n\n/**\n * Validate the key and value of a filter field statement\n * according to the provided validatorMap.\n */\nfunction validateKeyAndValue(\n  internalValidatorMap: InternalValidatorMap | undefined,\n  convertedStatement: FilterFieldStatementNode,\n  doc: string,\n  errors: FilterFieldError[],\n  customTypes?: FilterFieldCustomTypes,\n  parserConfig?: FilterFieldProps['parserConfig'],\n) {\n  if (\n    !internalValidatorMap ||\n    internalValidatorMap.normalizedKeys.byKey.size === 0 ||\n    !convertedStatement.key\n  ) {\n    return;\n  }\n\n  if (convertedStatement.key.type !== 'Error') {\n    validateKey(convertedStatement.key, internalValidatorMap, errors);\n  }\n\n  if (!convertedStatement.value) {\n    return;\n  }\n\n  // Check each validity of each value for lists\n  if (Array.isArray(convertedStatement.value.value)) {\n    for (const value of convertedStatement.value.value) {\n      validateSingleValue(\n        value,\n        doc,\n        { ...convertedStatement, value },\n        internalValidatorMap,\n        errors,\n        customTypes,\n        parserConfig,\n      );\n    }\n  } else {\n    const isValid = validateSingleValue(\n      convertedStatement.value,\n      doc,\n      convertedStatement,\n      internalValidatorMap,\n      errors,\n      customTypes,\n      parserConfig,\n    );\n\n    if (!isValid) {\n      // If the value is an error, we also need to update the statement's operator node.\n      // It may have changed to 'contains' or similar already, but should not reflect\n      // position operators in case the value is an error.\n      if (convertedStatement.comparisonOperator) {\n        convertedStatement.comparisonOperator.value =\n          convertedStatement.comparisonOperator.textValue;\n      }\n    }\n  }\n}\n\n/**\n * Validate a single value of a filter field statement\n * according to the provided validatorMap.\n */\nfunction validateSingleValue(\n  value: FilterFieldStatementNode['value'],\n  doc: string,\n  convertedStatement: FilterFieldStatementNode,\n  internalValidatorMap?: InternalValidatorMap,\n  errors: FilterFieldError[] = [],\n  customTypes?: FilterFieldCustomTypes,\n  parserConfig?: FilterFieldProps['parserConfig'],\n): boolean {\n  if (!value || !convertedStatement.key) {\n    return true;\n  }\n\n  const { isValid, message, validTypes } = isValidValue(\n    convertedStatement.key.value,\n    value.type === 'String' ? value.value : value.textValue,\n    value.type,\n    internalValidatorMap,\n    convertedStatement,\n    doc.toString(),\n    customTypes,\n    parserConfig,\n  );\n\n  if (!isValid) {\n    convertToErrorNode(value);\n    if (!validTypes || validTypes.length === 1) {\n      const singleType = validTypes ? validTypes[0] : undefined;\n      if (singleType && isCustomType(singleType)) {\n        errors.push({\n          range: value.range,\n          message: message ?? {\n            type: 'invalidValueErrorMultipleTypes',\n            details: validTypes,\n          },\n        });\n      } else {\n        errors.push({\n          range: value.range,\n          message: message ?? getErrorMessageForType(singleType),\n        });\n      }\n    } else {\n      errors.push({\n        range: value.range,\n        message: message ?? {\n          type: 'invalidValueErrorMultipleTypes',\n          details: validTypes,\n        },\n      });\n    }\n  }\n\n  return isValid;\n}\n\n/**\n * Validate a key of a filter field statement\n * according to the provided validatorMap.\n */\nfunction validateKey(\n  key: FilterFieldStatementNode['key'],\n  internalValidatorMap?: InternalValidatorMap,\n  errors: FilterFieldError[] = [],\n) {\n  if (!internalValidatorMap || !key) {\n    return;\n  }\n\n  const isExhaustive = internalValidatorMap.exhaustive ?? true;\n  let { value } = key;\n\n  let isValidJsonPath = true;\n\n  if (key.type === 'JSONPath') {\n    value = key.root;\n\n    isValidJsonPath =\n      getKeyValidTypes(value, internalValidatorMap)?.includes('JSONPath') ??\n      false;\n  }\n\n  const keyIsInValidatorMap =\n    internalValidatorMap.normalizedKeys.byKey.has(value);\n\n  if ((!keyIsInValidatorMap || !isValidJsonPath) && isExhaustive) {\n    convertToErrorNode(key);\n    errors.push({\n      range: key.range,\n      message: 'invalidKey',\n    });\n  }\n}\n\n/**\n * Convert a filter field statement node.\n * @internal\n */\nexport function convertFilterStatement(\n  node: SyntaxNodeRef,\n  doc: string,\n  numberParser: NumberFormatParser,\n  internalValidatorMap: InternalValidatorMap | undefined,\n  customTypes?: FilterFieldCustomTypes,\n  parserConfig?: FilterFieldProps['parserConfig'],\n  context?: FilterFieldLezerNodeType,\n): ConvertedLezerNode<\n  FilterFieldStatementNode,\n  { status: 'complete' | 'incomplete' | 'indeterminate' }\n> {\n  const nodeName = node.name as FilterFieldLezerNodeType;\n  const { from, to } = node;\n  const cursor = node.node.cursor();\n\n  const convertedStatement: FilterFieldStatementNode = {\n    type: (nodeTypeOverrides[nodeName] ??\n      nodeName) as FilterFieldStatementNode['type'],\n    range: {\n      from,\n      to,\n    },\n  };\n  const errors: FilterFieldError[] = [];\n  let positionOperators: PositionOperators | undefined;\n  let prevNode: FilterFieldLezerNodeType | undefined;\n\n  /**\n   * Update the previous node and return false to not go any deeper when iterating.\n   * Iteration continues with the next sibling, if any.\n   */\n  function updatePreviousAndContinue(\n    nodeName: FilterFieldLezerNodeType | undefined,\n  ): false {\n    prevNode = nodeName;\n    return false;\n  }\n\n  cursor.iterate((childNode) => {\n    const nodeName = childNode.name as FilterFieldLezerNodeType;\n    const { from: childFrom, to: childTo } = childNode;\n\n    switch (nodeName) {\n      case 'FilterStatement': {\n        // Intentionally left empty.\n        // Duplicating the tree cursor starts at the statement node again.\n        break;\n      }\n      case 'FilterKey': {\n        const { convertedNode: filterKey, errors: keyErrors } =\n          convertFilterKey(childNode, doc, parserConfig);\n        if (filterKey !== undefined) {\n          convertedStatement.key = filterKey;\n        }\n        errors.push(...keyErrors);\n        return updatePreviousAndContinue(nodeName);\n      }\n      case 'InvalidComparisonOperator':\n      case 'ComparisonOperator':\n      case 'InclusionOperator': {\n        const { convertedNode: operator } = convertComparisonOperator(\n          childNode,\n          doc,\n        );\n        convertedStatement.comparisonOperator = operator;\n        return updatePreviousAndContinue(nodeName);\n      }\n      case 'SearchOperator': {\n        const { convertedNode: operator, errors: operatorErrors } =\n          convertSearchOperator(childNode, doc, parserConfig, context);\n        convertedStatement.comparisonOperator = operator;\n        errors.push(...operatorErrors);\n        break;\n      }\n      case 'ExistsOperator': {\n        const { convertedNode: operator } = convertExistsOperator(\n          childNode,\n          doc,\n        );\n        convertedStatement.comparisonOperator = operator;\n        break;\n      }\n      case 'FilterSimpleValue': {\n        const {\n          convertedNode: value,\n          errors: valueErrors,\n          positionOperators: valuePositionOperators,\n        } = convertSimpleValue(\n          childNode,\n          doc,\n          numberParser,\n          customTypes,\n          parserConfig,\n          getKeyValidTypes(convertedStatement.key?.value, internalValidatorMap),\n        );\n\n        convertedStatement.value = value;\n        errors.push(...valueErrors);\n        positionOperators = valuePositionOperators;\n        return updatePreviousAndContinue(nodeName);\n      }\n      case 'FilterIncludesValue': {\n        const { convertedNode: value, errors: valueErrors } =\n          convertInclusionValue(\n            childNode,\n            doc,\n            numberParser,\n            customTypes,\n            parserConfig,\n          );\n        convertedStatement.value = value;\n        errors.push(...valueErrors);\n        return updatePreviousAndContinue(nodeName);\n      }\n      case 'FreeText': {\n        const { convertedNode: freeTextNode, errors: freeTextErrors } =\n          convertFreeText(childNode, doc, parserConfig);\n        convertedStatement.key = freeTextNode;\n        errors.push(...freeTextErrors);\n        return updatePreviousAndContinue(nodeName);\n      }\n      // An error node may occur as direct child of a 'FilterStatement'.\n      // Depending on the context, it needs to be added to the corresponding node (key, comparator, or value).\n      case '\u26A0':\n        switch (prevNode) {\n          case 'FilterKey':\n          case 'FreeText':\n            // eslint-disable-next-line @typescript-eslint/no-deprecated\n            if (parserConfig?.searchConversion) {\n              errors.push({\n                range: { from: childFrom - 1, to: childTo },\n                message: {\n                  type: 'incompleteStatementWithEnabledSearchError',\n                  details: getColoredSearchOperator(),\n                },\n                decoration: postSpotErrorMark,\n              });\n            } else {\n              errors.push({\n                range: { from: childFrom - 1, to: childTo },\n                message: 'incompleteStatementError',\n                decoration: postSpotErrorMark,\n              });\n            }\n            break;\n          case 'ComparisonOperator':\n          case 'InvalidComparisonOperator':\n          case 'SearchOperator':\n            if (convertedStatement.comparisonOperator !== undefined) {\n              if (childFrom !== childTo) {\n                const childAfter = childNode.node.nextSibling;\n                if (childAfter) {\n                  // Update range.to for both if they exist\n                  if (convertedStatement.comparisonOperator) {\n                    convertedStatement.comparisonOperator.range.to = childTo;\n                    const textValue = getTextFromRange(\n                      convertedStatement.comparisonOperator.range,\n                      doc,\n                    );\n                    convertedStatement.comparisonOperator.textValue =\n                      convertedStatement.comparisonOperator.value = textValue;\n                  }\n                  return updatePreviousAndContinue(prevNode);\n                } else {\n                  const range = {\n                    from: childFrom,\n                    to: childTo,\n                  };\n\n                  const textValue = getTextFromRange(range, doc);\n\n                  convertedStatement.value = {\n                    type: 'Error',\n                    value: textValue,\n                    textValue,\n                    range,\n                  };\n\n                  errors.push({\n                    range,\n                    message: 'invalidValueErrorGeneric',\n                  });\n                }\n              } else {\n                errors.push({\n                  range: {\n                    from: childFrom - (childFrom === childTo ? 1 : 0),\n                    to: childTo,\n                  },\n                  message: 'missingValueError',\n                  decoration: postSpotErrorMark,\n                });\n              }\n            }\n            break;\n          case 'InclusionOperator':\n            errors.push({\n              range: { from: childFrom - 1, to: childTo },\n              message: 'missingValueError',\n            });\n            break;\n          default:\n            if (isDev()) {\n              // eslint-disable-next-line no-console\n              console.log(\n                `${doc.toString()} | Syntax node '${nodeName}' is not yet handled after a '${prevNode}' node. Please make sure to handle all nodes accordingly.`,\n              );\n            }\n        }\n\n        return updatePreviousAndContinue(nodeName);\n      default:\n        // eslint-disable-next-line no-console\n        console.log(\n          `${doc.toString()} | Syntax node '${nodeName}' is not yet handled in the statement conversion. Please make sure to handle all nodes accordingly.`,\n        );\n    }\n\n    prevNode = nodeName;\n  });\n\n  if (convertedStatement.comparisonOperator && positionOperators) {\n    convertPositionOperators(\n      convertedStatement,\n      internalValidatorMap,\n      positionOperators,\n      errors,\n      parserConfig,\n    );\n  }\n\n  /**\n   * Custom validation\n   */\n  validateKeyAndValue(\n    internalValidatorMap,\n    convertedStatement,\n    doc,\n    errors,\n    customTypes,\n    parserConfig,\n  );\n\n  // Check the validity of the operator node, regardless of whether there\n  // is a validatorMap, as there are default global operators.\n  const operator = convertedStatement.comparisonOperator;\n  if (\n    operator &&\n    !positionOperators &&\n    (!isValidOperator(\n      operator.textValue,\n      convertedStatement.key?.value,\n      internalValidatorMap,\n      parserConfig,\n    ) ||\n      (operator.type === 'Error' && operator.value !== '*~'))\n  ) {\n    convertToErrorNode(operator);\n\n    if (convertedStatement.comparisonOperator) {\n      convertToErrorNode(convertedStatement.comparisonOperator);\n    }\n    errors.push({\n      range: operator.range,\n      message: {\n        type: 'invalidComparatorError',\n        details: getValidOperatorsColored(\n          convertedStatement.key?.textValue,\n          internalValidatorMap,\n          parserConfig,\n        ),\n      },\n    });\n  }\n\n  return {\n    convertedNode: convertedStatement,\n    errors,\n    status: getStatementStatus(node.node.cursor(), doc),\n  };\n}\n"],
-  "mappings": "AAEA,SAAS,6BAA6B;AACtC,SAAS,aAAa;AACtB,SAAS,yBAAyB;AAclC;AAAA,EACE;AAAA,EACA;AAAA,OACK;AACP,SAAS,0BAA0B;AACnC,SAAS,wBAAwB;AACjC,SAAS,0BAA0B;AACnC;AAAA,EACE;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,OACK;AACP,SAAS,6BAA6B;AACtC,SAAS,iCAAiC;AAC1C,SAAS,6BAA6B;AACtC,SAAS,wBAAwB;AACjC,SAAS,0BAA0B;AACnC,SAAS,yBAAyB;AAClC,SAAS,uBAAuB;AAChC,SAAS,0BAA0B;AAMnC,SAAS,iBACP,UACA,sBACsB;AACtB,MAAI,CAAC,YAAY,CAAC,sBAAsB;AACtC,WAAO;AAAA,EACT;AACA,QAAM,YAAY,qBAAqB,eAAe,MAAM,IAAI,QAAQ;AACxE,MAAI,CAAC,WAAW;AACd,WAAO;AAAA,EACT;AACA,MAAI,UAAU,WAAW;AACvB,WAAO,MAAM,QAAQ,UAAU,SAAS,IACpC,UAAU,YACV,CAAC,UAAU,SAAS;AAAA,EAC1B;AACA,MACE,UAAU,mBAAmB,UAC7B,OAAO,UAAU,mBAAmB,YACpC;AACA,UAAM,EAAE,MAAM,IAAI,mBAAmB,UAAU,cAAc;AAC7D,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAOA,SAAS,yBACP,oBACA,sBACA,mBACA,QACA,cACA;AACA,MAAI,CAAC,mBAAmB,sBAAsB,CAAC,mBAAmB;AAChE;AAAA,EACF;AAEA,QAAM,WAAW,mBAAmB;AACpC,QAAM,QAAQ,UAAU;AAExB,MAAI,UAAU,OAAO,UAAU,QAAQ,UAAU,SAAS,kBAAkB;AAC1E,UAAM,WAAW,GAAG,UAAU,OAAO,SAAS,EAAE,GAAG,kBAAkB,IAAI;AACzE,QAAI,mBAAmB,oBAAoB;AACzC,yBAAmB,mBAAmB,QAAQ;AAAA,IAChD;AAGA,QACE,CAAC;AAAA,MACC;AAAA,MACA,mBAAmB,KAAK;AAAA,MACxB;AAAA,MACA;AAAA,IACF,GACA;AACA,yBAAmB,mBAAmB,KAAK;AAC3C,iBAAW,oBAAoB,kBAAkB,QAAQ;AACvD,eAAO,KAAK;AAAA,UACV,OAAO;AAAA,UACP,SAAS;AAAA,QACX,CAAC;AAAA,MACH;AAAA,IACF;AAAA,EACF,OAAO;AACL,uBAAmB,mBAAmB,KAAK;AAE3C,eAAW,oBAAoB,kBAAkB,QAAQ;AACvD,aAAO,KAAK;AAAA,QACV,OAAO;AAAA,QACP,SAAS;AAAA,MACX,CAAC;AAAA,IACH;AAAA,EACF;AACF;AAMA,SAAS,oBACP,sBACA,oBACA,KACA,QACA,aACA,cACA;AACA,MACE,CAAC,wBACD,qBAAqB,eAAe,MAAM,SAAS,KACnD,CAAC,mBAAmB,KACpB;AACA;AAAA,EACF;AAEA,MAAI,mBAAmB,IAAI,SAAS,SAAS;AAC3C,gBAAY,mBAAmB,KAAK,sBAAsB,MAAM;AAAA,EAClE;AAEA,MAAI,CAAC,mBAAmB,OAAO;AAC7B;AAAA,EACF;AAGA,MAAI,MAAM,QAAQ,mBAAmB,MAAM,KAAK,GAAG;AACjD,eAAW,SAAS,mBAAmB,MAAM,OAAO;AAClD;AAAA,QACE;AAAA,QACA;AAAA,QACA,EAAE,GAAG,oBAAoB,MAAM;AAAA,QAC/B;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACF;AAAA,IACF;AAAA,EACF,OAAO;AACL,UAAM,UAAU;AAAA,MACd,mBAAmB;AAAA,MACnB;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAEA,QAAI,CAAC,SAAS;AAIZ,UAAI,mBAAmB,oBAAoB;AACzC,2BAAmB,mBAAmB,QACpC,mBAAmB,mBAAmB;AAAA,MAC1C;AAAA,IACF;AAAA,EACF;AACF;AAMA,SAAS,oBACP,OACA,KACA,oBACA,sBACA,SAA6B,CAAC,GAC9B,aACA,cACS;AACT,MAAI,CAAC,SAAS,CAAC,mBAAmB,KAAK;AACrC,WAAO;AAAA,EACT;AAEA,QAAM,EAAE,SAAS,SAAS,WAAW,IAAI;AAAA,IACvC,mBAAmB,IAAI;AAAA,IACvB,MAAM,SAAS,WAAW,MAAM,QAAQ,MAAM;AAAA,IAC9C,MAAM;AAAA,IACN;AAAA,IACA;AAAA,IACA,IAAI,SAAS;AAAA,IACb;AAAA,IACA;AAAA,EACF;AAEA,MAAI,CAAC,SAAS;AACZ,uBAAmB,KAAK;AACxB,QAAI,CAAC,cAAc,WAAW,WAAW,GAAG;AAC1C,YAAM,aAAa,aAAa,WAAW,CAAC,IAAI;AAChD,UAAI,cAAc,aAAa,UAAU,GAAG;AAC1C,eAAO,KAAK;AAAA,UACV,OAAO,MAAM;AAAA,UACb,SAAS,WAAW;AAAA,YAClB,MAAM;AAAA,YACN,SAAS;AAAA,UACX;AAAA,QACF,CAAC;AAAA,MACH,OAAO;AACL,eAAO,KAAK;AAAA,UACV,OAAO,MAAM;AAAA,UACb,SAAS,WAAW,uBAAuB,UAAU;AAAA,QACvD,CAAC;AAAA,MACH;AAAA,IACF,OAAO;AACL,aAAO,KAAK;AAAA,QACV,OAAO,MAAM;AAAA,QACb,SAAS,WAAW;AAAA,UAClB,MAAM;AAAA,UACN,SAAS;AAAA,QACX;AAAA,MACF,CAAC;AAAA,IACH;AAAA,EACF;AAEA,SAAO;AACT;AAMA,SAAS,YACP,KACA,sBACA,SAA6B,CAAC,GAC9B;AACA,MAAI,CAAC,wBAAwB,CAAC,KAAK;AACjC;AAAA,EACF;AAEA,QAAM,eAAe,qBAAqB,cAAc;AACxD,MAAI,EAAE,MAAM,IAAI;AAEhB,MAAI,kBAAkB;AAEtB,MAAI,IAAI,SAAS,YAAY;AAC3B,YAAQ,IAAI;AAEZ,sBACE,iBAAiB,OAAO,oBAAoB,GAAG,SAAS,UAAU,KAClE;AAAA,EACJ;AAEA,QAAM,sBACJ,qBAAqB,eAAe,MAAM,IAAI,KAAK;AAErD,OAAK,CAAC,uBAAuB,CAAC,oBAAoB,cAAc;AAC9D,uBAAmB,GAAG;AACtB,WAAO,KAAK;AAAA,MACV,OAAO,IAAI;AAAA,MACX,SAAS;AAAA,IACX,CAAC;AAAA,EACH;AACF;AAMO,SAAS,uBACd,MACA,KACA,cACA,sBACA,aACA,cACA,SAIA;AACA,QAAM,WAAW,KAAK;AACtB,QAAM,EAAE,MAAM,GAAG,IAAI;AACrB,QAAM,SAAS,KAAK,KAAK,OAAO;AAEhC,QAAM,qBAA+C;AAAA,IACnD,MAAO,kBAAkB,QAAQ,KAC/B;AAAA,IACF,OAAO;AAAA,MACL;AAAA,MACA;AAAA,IACF;AAAA,EACF;AACA,QAAM,SAA6B,CAAC;AACpC,MAAI;AACJ,MAAI;AAMJ,WAAS,0BACPA,WACO;AACP,eAAWA;AACX,WAAO;AAAA,EACT;AAEA,SAAO,QAAQ,CAAC,cAAc;AAC5B,UAAMA,YAAW,UAAU;AAC3B,UAAM,EAAE,MAAM,WAAW,IAAI,QAAQ,IAAI;AAEzC,YAAQA,WAAU;AAAA,MAChB,KAAK,mBAAmB;AAGtB;AAAA,MACF;AAAA,MACA,KAAK,aAAa;AAChB,cAAM,EAAE,eAAe,WAAW,QAAQ,UAAU,IAClD,iBAAiB,WAAW,KAAK,YAAY;AAC/C,YAAI,cAAc,QAAW;AAC3B,6BAAmB,MAAM;AAAA,QAC3B;AACA,eAAO,KAAK,GAAG,SAAS;AACxB,eAAO,0BAA0BA,SAAQ;AAAA,MAC3C;AAAA,MACA,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK,qBAAqB;AACxB,cAAM,EAAE,eAAeC,UAAS,IAAI;AAAA,UAClC;AAAA,UACA;AAAA,QACF;AACA,2BAAmB,qBAAqBA;AACxC,eAAO,0BAA0BD,SAAQ;AAAA,MAC3C;AAAA,MACA,KAAK,kBAAkB;AACrB,cAAM,EAAE,eAAeC,WAAU,QAAQ,eAAe,IACtD,sBAAsB,WAAW,KAAK,cAAc,OAAO;AAC7D,2BAAmB,qBAAqBA;AACxC,eAAO,KAAK,GAAG,cAAc;AAC7B;AAAA,MACF;AAAA,MACA,KAAK,kBAAkB;AACrB,cAAM,EAAE,eAAeA,UAAS,IAAI;AAAA,UAClC;AAAA,UACA;AAAA,QACF;AACA,2BAAmB,qBAAqBA;AACxC;AAAA,MACF;AAAA,MACA,KAAK,qBAAqB;AACxB,cAAM;AAAA,UACJ,eAAe;AAAA,UACf,QAAQ;AAAA,UACR,mBAAmB;AAAA,QACrB,IAAI;AAAA,UACF;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA,iBAAiB,mBAAmB,KAAK,OAAO,oBAAoB;AAAA,QACtE;AAEA,2BAAmB,QAAQ;AAC3B,eAAO,KAAK,GAAG,WAAW;AAC1B,4BAAoB;AACpB,eAAO,0BAA0BD,SAAQ;AAAA,MAC3C;AAAA,MACA,KAAK,uBAAuB;AAC1B,cAAM,EAAE,eAAe,OAAO,QAAQ,YAAY,IAChD;AAAA,UACE;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,QACF;AACF,2BAAmB,QAAQ;AAC3B,eAAO,KAAK,GAAG,WAAW;AAC1B,eAAO,0BAA0BA,SAAQ;AAAA,MAC3C;AAAA,MACA,KAAK,YAAY;AACf,cAAM,EAAE,eAAe,cAAc,QAAQ,eAAe,IAC1D,gBAAgB,WAAW,KAAK,YAAY;AAC9C,2BAAmB,MAAM;AACzB,eAAO,KAAK,GAAG,cAAc;AAC7B,eAAO,0BAA0BA,SAAQ;AAAA,MAC3C;AAAA;AAAA;AAAA,MAGA,KAAK;AACH,gBAAQ,UAAU;AAAA,UAChB,KAAK;AAAA,UACL,KAAK;AAEH,gBAAI,cAAc,kBAAkB;AAClC,qBAAO,KAAK;AAAA,gBACV,OAAO,EAAE,MAAM,YAAY,GAAG,IAAI,QAAQ;AAAA,gBAC1C,SAAS;AAAA,kBACP,MAAM;AAAA,kBACN,SAAS,yBAAyB;AAAA,gBACpC;AAAA,gBACA,YAAY;AAAA,cACd,CAAC;AAAA,YACH,OAAO;AACL,qBAAO,KAAK;AAAA,gBACV,OAAO,EAAE,MAAM,YAAY,GAAG,IAAI,QAAQ;AAAA,gBAC1C,SAAS;AAAA,gBACT,YAAY;AAAA,cACd,CAAC;AAAA,YACH;AACA;AAAA,UACF,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AACH,gBAAI,mBAAmB,uBAAuB,QAAW;AACvD,kBAAI,cAAc,SAAS;AACzB,sBAAM,aAAa,UAAU,KAAK;AAClC,oBAAI,YAAY;AAEd,sBAAI,mBAAmB,oBAAoB;AACzC,uCAAmB,mBAAmB,MAAM,KAAK;AACjD,0BAAM,YAAY;AAAA,sBAChB,mBAAmB,mBAAmB;AAAA,sBACtC;AAAA,oBACF;AACA,uCAAmB,mBAAmB,YACpC,mBAAmB,mBAAmB,QAAQ;AAAA,kBAClD;AACA,yBAAO,0BAA0B,QAAQ;AAAA,gBAC3C,OAAO;AACL,wBAAM,QAAQ;AAAA,oBACZ,MAAM;AAAA,oBACN,IAAI;AAAA,kBACN;AAEA,wBAAM,YAAY,iBAAiB,OAAO,GAAG;AAE7C,qCAAmB,QAAQ;AAAA,oBACzB,MAAM;AAAA,oBACN,OAAO;AAAA,oBACP;AAAA,oBACA;AAAA,kBACF;AAEA,yBAAO,KAAK;AAAA,oBACV;AAAA,oBACA,SAAS;AAAA,kBACX,CAAC;AAAA,gBACH;AAAA,cACF,OAAO;AACL,uBAAO,KAAK;AAAA,kBACV,OAAO;AAAA,oBACL,MAAM,aAAa,cAAc,UAAU,IAAI;AAAA,oBAC/C,IAAI;AAAA,kBACN;AAAA,kBACA,SAAS;AAAA,kBACT,YAAY;AAAA,gBACd,CAAC;AAAA,cACH;AAAA,YACF;AACA;AAAA,UACF,KAAK;AACH,mBAAO,KAAK;AAAA,cACV,OAAO,EAAE,MAAM,YAAY,GAAG,IAAI,QAAQ;AAAA,cAC1C,SAAS;AAAA,YACX,CAAC;AACD;AAAA,UACF;AACE,gBAAI,MAAM,GAAG;AAEX,sBAAQ;AAAA,gBACN,GAAG,IAAI,SAAS,CAAC,mBAAmBA,SAAQ,iCAAiC,QAAQ;AAAA,cACvF;AAAA,YACF;AAAA,QACJ;AAEA,eAAO,0BAA0BA,SAAQ;AAAA,MAC3C;AAEE,gBAAQ;AAAA,UACN,GAAG,IAAI,SAAS,CAAC,mBAAmBA,SAAQ;AAAA,QAC9C;AAAA,IACJ;AAEA,eAAWA;AAAA,EACb,CAAC;AAED,MAAI,mBAAmB,sBAAsB,mBAAmB;AAC9D;AAAA,MACE;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,EACF;AAKA;AAAA,IACE;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AAIA,QAAM,WAAW,mBAAmB;AACpC,MACE,YACA,CAAC,sBACA,CAAC;AAAA,IACA,SAAS;AAAA,IACT,mBAAmB,KAAK;AAAA,IACxB;AAAA,IACA;AAAA,EACF,KACG,SAAS,SAAS,WAAW,SAAS,UAAU,OACnD;AACA,uBAAmB,QAAQ;AAE3B,QAAI,mBAAmB,oBAAoB;AACzC,yBAAmB,mBAAmB,kBAAkB;AAAA,IAC1D;AACA,WAAO,KAAK;AAAA,MACV,OAAO,SAAS;AAAA,MAChB,SAAS;AAAA,QACP,MAAM;AAAA,QACN,SAAS;AAAA,UACP,mBAAmB,KAAK;AAAA,UACxB;AAAA,UACA;AAAA,QACF;AAAA,MACF;AAAA,IACF,CAAC;AAAA,EACH;AAEA,SAAO;AAAA,IACL,eAAe;AAAA,IACf;AAAA,IACA,QAAQ,mBAAmB,KAAK,KAAK,OAAO,GAAG,GAAG;AAAA,EACpD;AACF;",
+  "sourcesContent": ["import type { SyntaxNodeRef } from '@lezer/common';\n\nimport { convertInclusionValue } from './inclusion.js';\nimport { isDev } from '../../../../../../core/utils/is-node-environment.js';\nimport { postSpotErrorMark } from '../../../../decorations/decoration-marks.js';\nimport type { FilterFieldProps } from '../../../../FilterField.types.js';\nimport type { NumberFormatParser } from '../../../../parser/getNumberParser.js';\nimport type { ConvertedLezerNode } from '../../../../types/conversion-utils.js';\nimport type { FilterFieldError } from '../../../../types/filter-field-error.js';\nimport type {\n  FilterFieldLezerNodeType,\n  FilterFieldStatementNode,\n} from '../../../../types/tree-nodes.js';\nimport type {\n  FilterFieldComparisonOperators,\n  PositionOperators,\n  FilterFieldCustomTypes,\n} from '../../../../types/validation.js';\nimport type { InternalValidatorMap } from '../../../../utils/validation-utils/normalize-validator-map.js';\nimport {\n  getErrorMessageForType,\n  isCustomType,\n} from '../../../error-utils/error-message-helpers.js';\nimport { getStatementStatus } from '../../../get-statement-status.js';\nimport { getTextFromRange } from '../../../get-text.js';\nimport { getValidValueTypes } from '../../../suggestions-utils/suggestion-type.js';\nimport {\n  getColoredSearchOperator,\n  getValidOperatorsColored,\n  isValidOperator,\n  isValidValue,\n} from '../../../validation-utils/validation-helper-functions.js';\nimport { convertExistsOperator } from '../comparator/exists.js';\nimport { convertComparisonOperator } from '../comparator/operator.js';\nimport { convertSearchOperator } from '../comparator/search.js';\nimport { convertFilterKey } from '../key/key.js';\nimport { convertToErrorNode } from '../node-mutations.js';\nimport { nodeTypeOverrides } from '../node-type-mapping.js';\nimport { convertFreeText } from '../value/free-text.js';\nimport { convertSimpleValue } from '../value/simple-value.js';\n\n/**\n * Returns the valid value types for the given key, or undefined when the key is\n * unknown or accepts any type (function predicate / no predicate).\n */\nfunction getKeyValidTypes(\n  keyValue: string | undefined,\n  internalValidatorMap: InternalValidatorMap | undefined,\n): string[] | undefined {\n  if (!keyValue || !internalValidatorMap) {\n    return undefined;\n  }\n  const predicate = internalValidatorMap.normalizedKeys.byKey.get(keyValue);\n  if (!predicate) {\n    return undefined;\n  }\n  if (predicate.valueType) {\n    return Array.isArray(predicate.valueType)\n      ? predicate.valueType\n      : [predicate.valueType];\n  }\n  if (\n    predicate.valuePredicate !== undefined &&\n    typeof predicate.valuePredicate !== 'function'\n  ) {\n    const { types } = getValidValueTypes(predicate.valuePredicate);\n    return types;\n  }\n  return undefined;\n}\n\n/**\n * If the filter field value contains position operators, the statement's operator node\n * needs to reflect them accordingly ((not) starts-with, ends-with, contains).\n * Errors are generated for invalid combinations of operators and position operators.\n */\nfunction convertPositionOperators(\n  convertedStatement: FilterFieldStatementNode,\n  internalValidatorMap: InternalValidatorMap | undefined,\n  positionOperators: PositionOperators,\n  errors: FilterFieldError[],\n  parserConfig?: FilterFieldProps['parserConfig'],\n) {\n  if (!convertedStatement.comparisonOperator || !positionOperators) {\n    return;\n  }\n\n  const operator = convertedStatement.comparisonOperator;\n  const value = operator?.value;\n\n  if (value === '=' || value === '!=' || operator?.type === 'SearchOperator') {\n    const newValue = `${value === '!=' ? 'not-' : ''}${positionOperators.type}`;\n    if (convertedStatement.comparisonOperator) {\n      convertedStatement.comparisonOperator.value = newValue;\n    }\n\n    // Check if position operators are limited by the validatorMap and generate errors if need be.\n    if (\n      !isValidOperator(\n        newValue,\n        convertedStatement.key?.textValue,\n        internalValidatorMap,\n        parserConfig,\n      )\n    ) {\n      convertToErrorNode(convertedStatement.value);\n      for (const positionOperator of positionOperators.ranges) {\n        errors.push({\n          range: positionOperator,\n          message: 'invalidWildCardOperator',\n        });\n      }\n    }\n  } else {\n    convertToErrorNode(convertedStatement.value);\n\n    for (const positionOperator of positionOperators.ranges) {\n      errors.push({\n        range: positionOperator,\n        message: 'invalidPositionOperator',\n      });\n    }\n  }\n}\n\n/**\n * Validate the key and value of a filter field statement\n * according to the provided validatorMap.\n */\nfunction validateKeyAndValue(\n  internalValidatorMap: InternalValidatorMap | undefined,\n  convertedStatement: FilterFieldStatementNode,\n  doc: string,\n  errors: FilterFieldError[],\n  customTypes?: FilterFieldCustomTypes,\n  parserConfig?: FilterFieldProps['parserConfig'],\n) {\n  if (\n    !internalValidatorMap ||\n    internalValidatorMap.normalizedKeys.byKey.size === 0 ||\n    !convertedStatement.key\n  ) {\n    return;\n  }\n\n  if (convertedStatement.key.type !== 'Error') {\n    validateKey(convertedStatement.key, internalValidatorMap, errors);\n  }\n\n  if (!convertedStatement.value) {\n    return;\n  }\n\n  // Check each validity of each value for lists\n  if (Array.isArray(convertedStatement.value.value)) {\n    for (const value of convertedStatement.value.value) {\n      validateSingleValue(\n        value,\n        doc,\n        { ...convertedStatement, value },\n        internalValidatorMap,\n        errors,\n        customTypes,\n        parserConfig,\n      );\n    }\n  } else {\n    const isValid = validateSingleValue(\n      convertedStatement.value,\n      doc,\n      convertedStatement,\n      internalValidatorMap,\n      errors,\n      customTypes,\n      parserConfig,\n    );\n\n    if (!isValid) {\n      // If the value is an error, we also need to update the statement's operator node.\n      // It may have changed to 'contains' or similar already, but should not reflect\n      // position operators in case the value is an error.\n      if (convertedStatement.comparisonOperator) {\n        convertedStatement.comparisonOperator.value =\n          convertedStatement.comparisonOperator.textValue;\n      }\n    }\n  }\n}\n\n/**\n * Validate a single value of a filter field statement\n * according to the provided validatorMap.\n */\nfunction validateSingleValue(\n  value: FilterFieldStatementNode['value'],\n  doc: string,\n  convertedStatement: FilterFieldStatementNode,\n  internalValidatorMap?: InternalValidatorMap,\n  errors: FilterFieldError[] = [],\n  customTypes?: FilterFieldCustomTypes,\n  parserConfig?: FilterFieldProps['parserConfig'],\n): boolean {\n  if (!value || !convertedStatement.key) {\n    return true;\n  }\n\n  const { isValid, message, validTypes } = isValidValue(\n    convertedStatement.key.value,\n    value.type === 'String' ? value.value : value.textValue,\n    value.type,\n    internalValidatorMap,\n    convertedStatement,\n    doc.toString(),\n    customTypes,\n    parserConfig,\n  );\n\n  if (!isValid) {\n    convertToErrorNode(value);\n    if (!validTypes || validTypes.length === 1) {\n      const singleType = validTypes ? validTypes[0] : undefined;\n      if (singleType && isCustomType(singleType)) {\n        errors.push({\n          range: value.range,\n          message: message ?? {\n            type: 'invalidValueErrorMultipleTypes',\n            details: validTypes,\n          },\n        });\n      } else {\n        errors.push({\n          range: value.range,\n          message: message ?? getErrorMessageForType(singleType),\n        });\n      }\n    } else {\n      errors.push({\n        range: value.range,\n        message: message ?? {\n          type: 'invalidValueErrorMultipleTypes',\n          details: validTypes,\n        },\n      });\n    }\n  }\n\n  return isValid;\n}\n\n/**\n * Validate a key of a filter field statement\n * according to the provided validatorMap.\n */\nfunction validateKey(\n  key: FilterFieldStatementNode['key'],\n  internalValidatorMap?: InternalValidatorMap,\n  errors: FilterFieldError[] = [],\n) {\n  if (!internalValidatorMap || !key) {\n    return;\n  }\n\n  const isExhaustive = internalValidatorMap.exhaustive ?? true;\n  let { value } = key;\n\n  let isValidJsonPath = true;\n\n  if (key.type === 'JSONPath') {\n    value = key.root;\n\n    isValidJsonPath =\n      getKeyValidTypes(value, internalValidatorMap)?.includes('JSONPath') ??\n      false;\n  }\n\n  const keyIsInValidatorMap =\n    internalValidatorMap.normalizedKeys.byKey.has(value);\n\n  if ((!keyIsInValidatorMap || !isValidJsonPath) && isExhaustive) {\n    convertToErrorNode(key);\n    errors.push({\n      range: key.range,\n      message: 'invalidKey',\n    });\n  }\n}\n\n/**\n * When the value has a `*` in a non-edge position, set the operator to\n * `matches-wildcard` / `not-matches-wildcard` and validate it.\n */\nfunction convertWildcardInMiddle(\n  convertedStatement: FilterFieldStatementNode,\n  internalValidatorMap: InternalValidatorMap | undefined,\n  wildcardRanges: Array<PositionOperators['ranges'][number]>,\n  errors: FilterFieldError[],\n  parserConfig?: FilterFieldProps['parserConfig'],\n) {\n  if (!convertedStatement.comparisonOperator) {\n    return;\n  }\n\n  const operator = convertedStatement.comparisonOperator;\n  const value = operator.value;\n\n  if (value !== '=' && value !== '!=') {\n    convertToErrorNode(convertedStatement.value);\n    for (const range of wildcardRanges) {\n      errors.push({ range, message: 'invalidPositionOperator' });\n    }\n    return;\n  }\n\n  const newValue: FilterFieldComparisonOperators =\n    value === '!=' ? 'not-matches-wildcard' : 'matches-wildcard';\n  convertedStatement.comparisonOperator.value = newValue;\n\n  if (\n    !isValidOperator(\n      newValue,\n      convertedStatement.key?.textValue,\n      internalValidatorMap,\n      parserConfig,\n    )\n  ) {\n    convertToErrorNode(convertedStatement.value);\n    for (const range of wildcardRanges) {\n      errors.push({ range, message: 'invalidWildCardOperator' });\n    }\n  }\n}\n\n/**\n * Convert a filter field statement node.\n * @internal\n */\nexport function convertFilterStatement(\n  node: SyntaxNodeRef,\n  doc: string,\n  numberParser: NumberFormatParser,\n  internalValidatorMap: InternalValidatorMap | undefined,\n  customTypes?: FilterFieldCustomTypes,\n  parserConfig?: FilterFieldProps['parserConfig'],\n  context?: FilterFieldLezerNodeType,\n): ConvertedLezerNode<\n  FilterFieldStatementNode,\n  { status: 'complete' | 'incomplete' | 'indeterminate' }\n> {\n  const nodeName = node.name as FilterFieldLezerNodeType;\n  const { from, to } = node;\n  const cursor = node.node.cursor();\n\n  const convertedStatement: FilterFieldStatementNode = {\n    type: (nodeTypeOverrides[nodeName] ??\n      nodeName) as FilterFieldStatementNode['type'],\n    range: {\n      from,\n      to,\n    },\n  };\n  const errors: FilterFieldError[] = [];\n  let positionOperators: PositionOperators | undefined;\n  let wildcardInMiddle: Array<PositionOperators['ranges'][number]> | undefined;\n  let prevNode: FilterFieldLezerNodeType | undefined;\n\n  /**\n   * Update the previous node and return false to not go any deeper when iterating.\n   * Iteration continues with the next sibling, if any.\n   */\n  function updatePreviousAndContinue(\n    nodeName: FilterFieldLezerNodeType | undefined,\n  ): false {\n    prevNode = nodeName;\n    return false;\n  }\n\n  cursor.iterate((childNode) => {\n    const nodeName = childNode.name as FilterFieldLezerNodeType;\n    const { from: childFrom, to: childTo } = childNode;\n\n    switch (nodeName) {\n      case 'FilterStatement': {\n        // Intentionally left empty.\n        // Duplicating the tree cursor starts at the statement node again.\n        break;\n      }\n      case 'FilterKey': {\n        const { convertedNode: filterKey, errors: keyErrors } =\n          convertFilterKey(childNode, doc, parserConfig);\n        if (filterKey !== undefined) {\n          convertedStatement.key = filterKey;\n        }\n        errors.push(...keyErrors);\n        return updatePreviousAndContinue(nodeName);\n      }\n      case 'InvalidComparisonOperator':\n      case 'ComparisonOperator':\n      case 'InclusionOperator': {\n        const { convertedNode: operator } = convertComparisonOperator(\n          childNode,\n          doc,\n        );\n        convertedStatement.comparisonOperator = operator;\n        return updatePreviousAndContinue(nodeName);\n      }\n      case 'SearchOperator': {\n        const { convertedNode: operator, errors: operatorErrors } =\n          convertSearchOperator(childNode, doc, parserConfig, context);\n        convertedStatement.comparisonOperator = operator;\n        errors.push(...operatorErrors);\n        break;\n      }\n      case 'ExistsOperator': {\n        const { convertedNode: operator } = convertExistsOperator(\n          childNode,\n          doc,\n        );\n        convertedStatement.comparisonOperator = operator;\n        break;\n      }\n      case 'FilterSimpleValue': {\n        const {\n          convertedNode: value,\n          errors: valueErrors,\n          positionOperators: valuePositionOperators,\n          wildcardInMiddle: valueWildcardInMiddle,\n        } = convertSimpleValue(\n          childNode,\n          doc,\n          numberParser,\n          customTypes,\n          parserConfig,\n          getKeyValidTypes(convertedStatement.key?.value, internalValidatorMap),\n        );\n\n        convertedStatement.value = value;\n        errors.push(...valueErrors);\n        wildcardInMiddle = valueWildcardInMiddle;\n        // wildcardInMiddle already include position operators, so only set positionOperators\n        // if there are no wildcards in the middle.\n        if (!wildcardInMiddle || wildcardInMiddle?.length === 0) {\n          positionOperators = valuePositionOperators;\n        }\n        return updatePreviousAndContinue(nodeName);\n      }\n      case 'FilterIncludesValue': {\n        const { convertedNode: value, errors: valueErrors } =\n          convertInclusionValue(\n            childNode,\n            doc,\n            numberParser,\n            customTypes,\n            parserConfig,\n          );\n        convertedStatement.value = value;\n        errors.push(...valueErrors);\n        return updatePreviousAndContinue(nodeName);\n      }\n      case 'FreeText': {\n        const { convertedNode: freeTextNode, errors: freeTextErrors } =\n          convertFreeText(childNode, doc, parserConfig);\n        convertedStatement.key = freeTextNode;\n        errors.push(...freeTextErrors);\n        return updatePreviousAndContinue(nodeName);\n      }\n      // An error node may occur as direct child of a 'FilterStatement'.\n      // Depending on the context, it needs to be added to the corresponding node (key, comparator, or value).\n      case '\u26A0':\n        switch (prevNode) {\n          case 'FilterKey':\n          case 'FreeText':\n            // oxlint-disable-next-line typescript/no-deprecated\n            if (parserConfig?.searchConversion) {\n              errors.push({\n                range: { from: childFrom - 1, to: childTo },\n                message: {\n                  type: 'incompleteStatementWithEnabledSearchError',\n                  details: getColoredSearchOperator(),\n                },\n                decoration: postSpotErrorMark,\n              });\n            } else {\n              errors.push({\n                range: { from: childFrom - 1, to: childTo },\n                message: 'incompleteStatementError',\n                decoration: postSpotErrorMark,\n              });\n            }\n            break;\n          case 'ComparisonOperator':\n          case 'InvalidComparisonOperator':\n          case 'SearchOperator':\n            if (convertedStatement.comparisonOperator !== undefined) {\n              if (childFrom !== childTo) {\n                const childAfter = childNode.node.nextSibling;\n                if (childAfter) {\n                  // Update range.to for both if they exist\n                  if (convertedStatement.comparisonOperator) {\n                    convertedStatement.comparisonOperator.range.to = childTo;\n                    const textValue = getTextFromRange(\n                      convertedStatement.comparisonOperator.range,\n                      doc,\n                    );\n                    convertedStatement.comparisonOperator.textValue =\n                      convertedStatement.comparisonOperator.value = textValue;\n                  }\n                  return updatePreviousAndContinue(prevNode);\n                } else {\n                  const range = {\n                    from: childFrom,\n                    to: childTo,\n                  };\n\n                  const textValue = getTextFromRange(range, doc);\n\n                  convertedStatement.value = {\n                    type: 'Error',\n                    value: textValue,\n                    textValue,\n                    range,\n                  };\n\n                  errors.push({\n                    range,\n                    message: 'invalidValueErrorGeneric',\n                  });\n                }\n              } else {\n                errors.push({\n                  range: {\n                    from: childFrom - (childFrom === childTo ? 1 : 0),\n                    to: childTo,\n                  },\n                  message: 'missingValueError',\n                  decoration: postSpotErrorMark,\n                });\n              }\n            }\n            break;\n          case 'InclusionOperator':\n            errors.push({\n              range: { from: childFrom - 1, to: childTo },\n              message: 'missingValueError',\n            });\n            break;\n          default:\n            if (isDev()) {\n              // oxlint-disable-next-line no-console\n              console.log(\n                `${doc.toString()} | Syntax node '${nodeName}' is not yet handled after a '${prevNode}' node. Please make sure to handle all nodes accordingly.`,\n              );\n            }\n        }\n\n        return updatePreviousAndContinue(nodeName);\n      default:\n        if (isDev()) {\n          // oxlint-disable-next-line no-console\n          console.log(\n            `${doc.toString()} | Syntax node '${nodeName}' is not yet handled in the statement conversion. Please make sure to handle all nodes accordingly.`,\n          );\n        }\n    }\n\n    prevNode = nodeName;\n  });\n\n  if (convertedStatement.comparisonOperator && positionOperators) {\n    convertPositionOperators(\n      convertedStatement,\n      internalValidatorMap,\n      positionOperators,\n      errors,\n      parserConfig,\n    );\n  }\n\n  if (convertedStatement.comparisonOperator && wildcardInMiddle?.length) {\n    convertWildcardInMiddle(\n      convertedStatement,\n      internalValidatorMap,\n      wildcardInMiddle,\n      errors,\n      parserConfig,\n    );\n  }\n\n  /**\n   * Custom validation\n   */\n  validateKeyAndValue(\n    internalValidatorMap,\n    convertedStatement,\n    doc,\n    errors,\n    customTypes,\n    parserConfig,\n  );\n\n  // Check the validity of the operator node, regardless of whether there\n  // is a validatorMap, as there are default global operators.\n  const operator = convertedStatement.comparisonOperator;\n  if (\n    operator &&\n    !positionOperators &&\n    !wildcardInMiddle?.length &&\n    (!isValidOperator(\n      operator.textValue,\n      convertedStatement.key?.value,\n      internalValidatorMap,\n      parserConfig,\n    ) ||\n      (operator.type === 'Error' && operator.value !== '*~'))\n  ) {\n    convertToErrorNode(operator);\n\n    if (convertedStatement.comparisonOperator) {\n      convertToErrorNode(convertedStatement.comparisonOperator);\n    }\n    errors.push({\n      range: operator.range,\n      message: {\n        type: 'invalidComparatorError',\n        details: getValidOperatorsColored(\n          convertedStatement.key?.textValue,\n          internalValidatorMap,\n          parserConfig,\n        ),\n      },\n    });\n  }\n\n  return {\n    convertedNode: convertedStatement,\n    errors,\n    status: getStatementStatus(node.node.cursor(), doc),\n  };\n}\n"],
+  "mappings": "AAEA,SAAS,6BAA6B;AACtC,SAAS,aAAa;AACtB,SAAS,yBAAyB;AAelC;AAAA,EACE;AAAA,EACA;AAAA,OACK;AACP,SAAS,0BAA0B;AACnC,SAAS,wBAAwB;AACjC,SAAS,0BAA0B;AACnC;AAAA,EACE;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,OACK;AACP,SAAS,6BAA6B;AACtC,SAAS,iCAAiC;AAC1C,SAAS,6BAA6B;AACtC,SAAS,wBAAwB;AACjC,SAAS,0BAA0B;AACnC,SAAS,yBAAyB;AAClC,SAAS,uBAAuB;AAChC,SAAS,0BAA0B;AAMnC,SAAS,iBACP,UACA,sBACsB;AACtB,MAAI,CAAC,YAAY,CAAC,sBAAsB;AACtC,WAAO;AAAA,EACT;AACA,QAAM,YAAY,qBAAqB,eAAe,MAAM,IAAI,QAAQ;AACxE,MAAI,CAAC,WAAW;AACd,WAAO;AAAA,EACT;AACA,MAAI,UAAU,WAAW;AACvB,WAAO,MAAM,QAAQ,UAAU,SAAS,IACpC,UAAU,YACV,CAAC,UAAU,SAAS;AAAA,EAC1B;AACA,MACE,UAAU,mBAAmB,UAC7B,OAAO,UAAU,mBAAmB,YACpC;AACA,UAAM,EAAE,MAAM,IAAI,mBAAmB,UAAU,cAAc;AAC7D,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAOA,SAAS,yBACP,oBACA,sBACA,mBACA,QACA,cACA;AACA,MAAI,CAAC,mBAAmB,sBAAsB,CAAC,mBAAmB;AAChE;AAAA,EACF;AAEA,QAAM,WAAW,mBAAmB;AACpC,QAAM,QAAQ,UAAU;AAExB,MAAI,UAAU,OAAO,UAAU,QAAQ,UAAU,SAAS,kBAAkB;AAC1E,UAAM,WAAW,GAAG,UAAU,OAAO,SAAS,EAAE,GAAG,kBAAkB,IAAI;AACzE,QAAI,mBAAmB,oBAAoB;AACzC,yBAAmB,mBAAmB,QAAQ;AAAA,IAChD;AAGA,QACE,CAAC;AAAA,MACC;AAAA,MACA,mBAAmB,KAAK;AAAA,MACxB;AAAA,MACA;AAAA,IACF,GACA;AACA,yBAAmB,mBAAmB,KAAK;AAC3C,iBAAW,oBAAoB,kBAAkB,QAAQ;AACvD,eAAO,KAAK;AAAA,UACV,OAAO;AAAA,UACP,SAAS;AAAA,QACX,CAAC;AAAA,MACH;AAAA,IACF;AAAA,EACF,OAAO;AACL,uBAAmB,mBAAmB,KAAK;AAE3C,eAAW,oBAAoB,kBAAkB,QAAQ;AACvD,aAAO,KAAK;AAAA,QACV,OAAO;AAAA,QACP,SAAS;AAAA,MACX,CAAC;AAAA,IACH;AAAA,EACF;AACF;AAMA,SAAS,oBACP,sBACA,oBACA,KACA,QACA,aACA,cACA;AACA,MACE,CAAC,wBACD,qBAAqB,eAAe,MAAM,SAAS,KACnD,CAAC,mBAAmB,KACpB;AACA;AAAA,EACF;AAEA,MAAI,mBAAmB,IAAI,SAAS,SAAS;AAC3C,gBAAY,mBAAmB,KAAK,sBAAsB,MAAM;AAAA,EAClE;AAEA,MAAI,CAAC,mBAAmB,OAAO;AAC7B;AAAA,EACF;AAGA,MAAI,MAAM,QAAQ,mBAAmB,MAAM,KAAK,GAAG;AACjD,eAAW,SAAS,mBAAmB,MAAM,OAAO;AAClD;AAAA,QACE;AAAA,QACA;AAAA,QACA,EAAE,GAAG,oBAAoB,MAAM;AAAA,QAC/B;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACF;AAAA,IACF;AAAA,EACF,OAAO;AACL,UAAM,UAAU;AAAA,MACd,mBAAmB;AAAA,MACnB;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAEA,QAAI,CAAC,SAAS;AAIZ,UAAI,mBAAmB,oBAAoB;AACzC,2BAAmB,mBAAmB,QACpC,mBAAmB,mBAAmB;AAAA,MAC1C;AAAA,IACF;AAAA,EACF;AACF;AAMA,SAAS,oBACP,OACA,KACA,oBACA,sBACA,SAA6B,CAAC,GAC9B,aACA,cACS;AACT,MAAI,CAAC,SAAS,CAAC,mBAAmB,KAAK;AACrC,WAAO;AAAA,EACT;AAEA,QAAM,EAAE,SAAS,SAAS,WAAW,IAAI;AAAA,IACvC,mBAAmB,IAAI;AAAA,IACvB,MAAM,SAAS,WAAW,MAAM,QAAQ,MAAM;AAAA,IAC9C,MAAM;AAAA,IACN;AAAA,IACA;AAAA,IACA,IAAI,SAAS;AAAA,IACb;AAAA,IACA;AAAA,EACF;AAEA,MAAI,CAAC,SAAS;AACZ,uBAAmB,KAAK;AACxB,QAAI,CAAC,cAAc,WAAW,WAAW,GAAG;AAC1C,YAAM,aAAa,aAAa,WAAW,CAAC,IAAI;AAChD,UAAI,cAAc,aAAa,UAAU,GAAG;AAC1C,eAAO,KAAK;AAAA,UACV,OAAO,MAAM;AAAA,UACb,SAAS,WAAW;AAAA,YAClB,MAAM;AAAA,YACN,SAAS;AAAA,UACX;AAAA,QACF,CAAC;AAAA,MACH,OAAO;AACL,eAAO,KAAK;AAAA,UACV,OAAO,MAAM;AAAA,UACb,SAAS,WAAW,uBAAuB,UAAU;AAAA,QACvD,CAAC;AAAA,MACH;AAAA,IACF,OAAO;AACL,aAAO,KAAK;AAAA,QACV,OAAO,MAAM;AAAA,QACb,SAAS,WAAW;AAAA,UAClB,MAAM;AAAA,UACN,SAAS;AAAA,QACX;AAAA,MACF,CAAC;AAAA,IACH;AAAA,EACF;AAEA,SAAO;AACT;AAMA,SAAS,YACP,KACA,sBACA,SAA6B,CAAC,GAC9B;AACA,MAAI,CAAC,wBAAwB,CAAC,KAAK;AACjC;AAAA,EACF;AAEA,QAAM,eAAe,qBAAqB,cAAc;AACxD,MAAI,EAAE,MAAM,IAAI;AAEhB,MAAI,kBAAkB;AAEtB,MAAI,IAAI,SAAS,YAAY;AAC3B,YAAQ,IAAI;AAEZ,sBACE,iBAAiB,OAAO,oBAAoB,GAAG,SAAS,UAAU,KAClE;AAAA,EACJ;AAEA,QAAM,sBACJ,qBAAqB,eAAe,MAAM,IAAI,KAAK;AAErD,OAAK,CAAC,uBAAuB,CAAC,oBAAoB,cAAc;AAC9D,uBAAmB,GAAG;AACtB,WAAO,KAAK;AAAA,MACV,OAAO,IAAI;AAAA,MACX,SAAS;AAAA,IACX,CAAC;AAAA,EACH;AACF;AAMA,SAAS,wBACP,oBACA,sBACA,gBACA,QACA,cACA;AACA,MAAI,CAAC,mBAAmB,oBAAoB;AAC1C;AAAA,EACF;AAEA,QAAM,WAAW,mBAAmB;AACpC,QAAM,QAAQ,SAAS;AAEvB,MAAI,UAAU,OAAO,UAAU,MAAM;AACnC,uBAAmB,mBAAmB,KAAK;AAC3C,eAAW,SAAS,gBAAgB;AAClC,aAAO,KAAK,EAAE,OAAO,SAAS,0BAA0B,CAAC;AAAA,IAC3D;AACA;AAAA,EACF;AAEA,QAAM,WACJ,UAAU,OAAO,yBAAyB;AAC5C,qBAAmB,mBAAmB,QAAQ;AAE9C,MACE,CAAC;AAAA,IACC;AAAA,IACA,mBAAmB,KAAK;AAAA,IACxB;AAAA,IACA;AAAA,EACF,GACA;AACA,uBAAmB,mBAAmB,KAAK;AAC3C,eAAW,SAAS,gBAAgB;AAClC,aAAO,KAAK,EAAE,OAAO,SAAS,0BAA0B,CAAC;AAAA,IAC3D;AAAA,EACF;AACF;AAMO,SAAS,uBACd,MACA,KACA,cACA,sBACA,aACA,cACA,SAIA;AACA,QAAM,WAAW,KAAK;AACtB,QAAM,EAAE,MAAM,GAAG,IAAI;AACrB,QAAM,SAAS,KAAK,KAAK,OAAO;AAEhC,QAAM,qBAA+C;AAAA,IACnD,MAAO,kBAAkB,QAAQ,KAC/B;AAAA,IACF,OAAO;AAAA,MACL;AAAA,MACA;AAAA,IACF;AAAA,EACF;AACA,QAAM,SAA6B,CAAC;AACpC,MAAI;AACJ,MAAI;AACJ,MAAI;AAMJ,WAAS,0BACPA,WACO;AACP,eAAWA;AACX,WAAO;AAAA,EACT;AAEA,SAAO,QAAQ,CAAC,cAAc;AAC5B,UAAMA,YAAW,UAAU;AAC3B,UAAM,EAAE,MAAM,WAAW,IAAI,QAAQ,IAAI;AAEzC,YAAQA,WAAU;AAAA,MAChB,KAAK,mBAAmB;AAGtB;AAAA,MACF;AAAA,MACA,KAAK,aAAa;AAChB,cAAM,EAAE,eAAe,WAAW,QAAQ,UAAU,IAClD,iBAAiB,WAAW,KAAK,YAAY;AAC/C,YAAI,cAAc,QAAW;AAC3B,6BAAmB,MAAM;AAAA,QAC3B;AACA,eAAO,KAAK,GAAG,SAAS;AACxB,eAAO,0BAA0BA,SAAQ;AAAA,MAC3C;AAAA,MACA,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK,qBAAqB;AACxB,cAAM,EAAE,eAAeC,UAAS,IAAI;AAAA,UAClC;AAAA,UACA;AAAA,QACF;AACA,2BAAmB,qBAAqBA;AACxC,eAAO,0BAA0BD,SAAQ;AAAA,MAC3C;AAAA,MACA,KAAK,kBAAkB;AACrB,cAAM,EAAE,eAAeC,WAAU,QAAQ,eAAe,IACtD,sBAAsB,WAAW,KAAK,cAAc,OAAO;AAC7D,2BAAmB,qBAAqBA;AACxC,eAAO,KAAK,GAAG,cAAc;AAC7B;AAAA,MACF;AAAA,MACA,KAAK,kBAAkB;AACrB,cAAM,EAAE,eAAeA,UAAS,IAAI;AAAA,UAClC;AAAA,UACA;AAAA,QACF;AACA,2BAAmB,qBAAqBA;AACxC;AAAA,MACF;AAAA,MACA,KAAK,qBAAqB;AACxB,cAAM;AAAA,UACJ,eAAe;AAAA,UACf,QAAQ;AAAA,UACR,mBAAmB;AAAA,UACnB,kBAAkB;AAAA,QACpB,IAAI;AAAA,UACF;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA,iBAAiB,mBAAmB,KAAK,OAAO,oBAAoB;AAAA,QACtE;AAEA,2BAAmB,QAAQ;AAC3B,eAAO,KAAK,GAAG,WAAW;AAC1B,2BAAmB;AAGnB,YAAI,CAAC,oBAAoB,kBAAkB,WAAW,GAAG;AACvD,8BAAoB;AAAA,QACtB;AACA,eAAO,0BAA0BD,SAAQ;AAAA,MAC3C;AAAA,MACA,KAAK,uBAAuB;AAC1B,cAAM,EAAE,eAAe,OAAO,QAAQ,YAAY,IAChD;AAAA,UACE;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,QACF;AACF,2BAAmB,QAAQ;AAC3B,eAAO,KAAK,GAAG,WAAW;AAC1B,eAAO,0BAA0BA,SAAQ;AAAA,MAC3C;AAAA,MACA,KAAK,YAAY;AACf,cAAM,EAAE,eAAe,cAAc,QAAQ,eAAe,IAC1D,gBAAgB,WAAW,KAAK,YAAY;AAC9C,2BAAmB,MAAM;AACzB,eAAO,KAAK,GAAG,cAAc;AAC7B,eAAO,0BAA0BA,SAAQ;AAAA,MAC3C;AAAA;AAAA;AAAA,MAGA,KAAK;AACH,gBAAQ,UAAU;AAAA,UAChB,KAAK;AAAA,UACL,KAAK;AAEH,gBAAI,cAAc,kBAAkB;AAClC,qBAAO,KAAK;AAAA,gBACV,OAAO,EAAE,MAAM,YAAY,GAAG,IAAI,QAAQ;AAAA,gBAC1C,SAAS;AAAA,kBACP,MAAM;AAAA,kBACN,SAAS,yBAAyB;AAAA,gBACpC;AAAA,gBACA,YAAY;AAAA,cACd,CAAC;AAAA,YACH,OAAO;AACL,qBAAO,KAAK;AAAA,gBACV,OAAO,EAAE,MAAM,YAAY,GAAG,IAAI,QAAQ;AAAA,gBAC1C,SAAS;AAAA,gBACT,YAAY;AAAA,cACd,CAAC;AAAA,YACH;AACA;AAAA,UACF,KAAK;AAAA,UACL,KAAK;AAAA,UACL,KAAK;AACH,gBAAI,mBAAmB,uBAAuB,QAAW;AACvD,kBAAI,cAAc,SAAS;AACzB,sBAAM,aAAa,UAAU,KAAK;AAClC,oBAAI,YAAY;AAEd,sBAAI,mBAAmB,oBAAoB;AACzC,uCAAmB,mBAAmB,MAAM,KAAK;AACjD,0BAAM,YAAY;AAAA,sBAChB,mBAAmB,mBAAmB;AAAA,sBACtC;AAAA,oBACF;AACA,uCAAmB,mBAAmB,YACpC,mBAAmB,mBAAmB,QAAQ;AAAA,kBAClD;AACA,yBAAO,0BAA0B,QAAQ;AAAA,gBAC3C,OAAO;AACL,wBAAM,QAAQ;AAAA,oBACZ,MAAM;AAAA,oBACN,IAAI;AAAA,kBACN;AAEA,wBAAM,YAAY,iBAAiB,OAAO,GAAG;AAE7C,qCAAmB,QAAQ;AAAA,oBACzB,MAAM;AAAA,oBACN,OAAO;AAAA,oBACP;AAAA,oBACA;AAAA,kBACF;AAEA,yBAAO,KAAK;AAAA,oBACV;AAAA,oBACA,SAAS;AAAA,kBACX,CAAC;AAAA,gBACH;AAAA,cACF,OAAO;AACL,uBAAO,KAAK;AAAA,kBACV,OAAO;AAAA,oBACL,MAAM,aAAa,cAAc,UAAU,IAAI;AAAA,oBAC/C,IAAI;AAAA,kBACN;AAAA,kBACA,SAAS;AAAA,kBACT,YAAY;AAAA,gBACd,CAAC;AAAA,cACH;AAAA,YACF;AACA;AAAA,UACF,KAAK;AACH,mBAAO,KAAK;AAAA,cACV,OAAO,EAAE,MAAM,YAAY,GAAG,IAAI,QAAQ;AAAA,cAC1C,SAAS;AAAA,YACX,CAAC;AACD;AAAA,UACF;AACE,gBAAI,MAAM,GAAG;AAEX,sBAAQ;AAAA,gBACN,GAAG,IAAI,SAAS,CAAC,mBAAmBA,SAAQ,iCAAiC,QAAQ;AAAA,cACvF;AAAA,YACF;AAAA,QACJ;AAEA,eAAO,0BAA0BA,SAAQ;AAAA,MAC3C;AACE,YAAI,MAAM,GAAG;AAEX,kBAAQ;AAAA,YACN,GAAG,IAAI,SAAS,CAAC,mBAAmBA,SAAQ;AAAA,UAC9C;AAAA,QACF;AAAA,IACJ;AAEA,eAAWA;AAAA,EACb,CAAC;AAED,MAAI,mBAAmB,sBAAsB,mBAAmB;AAC9D;AAAA,MACE;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,EACF;AAEA,MAAI,mBAAmB,sBAAsB,kBAAkB,QAAQ;AACrE;AAAA,MACE;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,EACF;AAKA;AAAA,IACE;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AAIA,QAAM,WAAW,mBAAmB;AACpC,MACE,YACA,CAAC,qBACD,CAAC,kBAAkB,WAClB,CAAC;AAAA,IACA,SAAS;AAAA,IACT,mBAAmB,KAAK;AAAA,IACxB;AAAA,IACA;AAAA,EACF,KACG,SAAS,SAAS,WAAW,SAAS,UAAU,OACnD;AACA,uBAAmB,QAAQ;AAE3B,QAAI,mBAAmB,oBAAoB;AACzC,yBAAmB,mBAAmB,kBAAkB;AAAA,IAC1D;AACA,WAAO,KAAK;AAAA,MACV,OAAO,SAAS;AAAA,MAChB,SAAS;AAAA,QACP,MAAM;AAAA,QACN,SAAS;AAAA,UACP,mBAAmB,KAAK;AAAA,UACxB;AAAA,UACA;AAAA,QACF;AAAA,MACF;AAAA,IACF,CAAC;AAAA,EACH;AAEA,SAAO;AAAA,IACL,eAAe;AAAA,IACf;AAAA,IACA,QAAQ,mBAAmB,KAAK,KAAK,OAAO,GAAG,GAAG;AAAA,EACpD;AACF;",
   "names": ["nodeName", "operator"]
 }

package/esm/filters/filter-field/utils/conversion/lezer-tree-conversion/value/free-text.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../../../../../../../src/filters/filter-field/utils/conversion/lezer-tree-conversion/value/free-text.ts"],
-  "sourcesContent": ["import type { SyntaxNodeRef } from '@lezer/common';\n\nimport { postSpotErrorMark } from '../../../../decorations/decoration-marks.js';\nimport type { FilterFieldProps } from '../../../../FilterField.types.js';\nimport type { ConvertedLezerNode } from '../../../../types/conversion-utils.js';\nimport type { FilterFieldError } from '../../../../types/filter-field-error.js';\nimport type { FilterFieldErrorNode } from '../../../../types/tree-nodes.js';\nimport { getTextFromRange } from '../../../get-text.js';\nimport { getColoredSearchOperator } from '../../../validation-utils/validation-helper-functions.js';\nimport { removeEscapeCharacters } from '../../escape-characters.js';\n\n/**\n * Convert a free text node.\n * @internal\n */\nexport function convertFreeText(\n  node: SyntaxNodeRef,\n  doc: string,\n  parserConfig?: FilterFieldProps['parserConfig'],\n): ConvertedLezerNode<Omit<FilterFieldErrorNode, 'value'> & { value: string }> {\n  const { from, to } = node;\n  const text = getTextFromRange(node, doc);\n  const value = removeEscapeCharacters(text);\n\n  const errors: FilterFieldError[] = [];\n  const convertedNode: Omit<FilterFieldErrorNode, 'value'> & { value: string } =\n    {\n      type: 'Error',\n      range: {\n        from,\n        to,\n      },\n      textValue: text,\n      value,\n    };\n\n  // eslint-disable-next-line @typescript-eslint/no-deprecated\n  if (parserConfig?.searchConversion) {\n    errors.push({\n      range: { from: to - 1, to },\n      message: {\n        type: 'incompleteStatementWithEnabledSearchError',\n        details: getColoredSearchOperator(),\n      },\n      decoration: postSpotErrorMark,\n    });\n  } else {\n    errors.push({\n      range: { from: to - 1, to },\n      message: 'incompleteStatementError',\n      decoration: postSpotErrorMark,\n    });\n  }\n\n  return {\n    convertedNode,\n    errors,\n  };\n}\n"],
+  "sourcesContent": ["import type { SyntaxNodeRef } from '@lezer/common';\n\nimport { postSpotErrorMark } from '../../../../decorations/decoration-marks.js';\nimport type { FilterFieldProps } from '../../../../FilterField.types.js';\nimport type { ConvertedLezerNode } from '../../../../types/conversion-utils.js';\nimport type { FilterFieldError } from '../../../../types/filter-field-error.js';\nimport type { FilterFieldErrorNode } from '../../../../types/tree-nodes.js';\nimport { getTextFromRange } from '../../../get-text.js';\nimport { getColoredSearchOperator } from '../../../validation-utils/validation-helper-functions.js';\nimport { removeEscapeCharacters } from '../../escape-characters.js';\n\n/**\n * Convert a free text node.\n * @internal\n */\nexport function convertFreeText(\n  node: SyntaxNodeRef,\n  doc: string,\n  parserConfig?: FilterFieldProps['parserConfig'],\n): ConvertedLezerNode<Omit<FilterFieldErrorNode, 'value'> & { value: string }> {\n  const { from, to } = node;\n  const text = getTextFromRange(node, doc);\n  const value = removeEscapeCharacters(text);\n\n  const errors: FilterFieldError[] = [];\n  const convertedNode: Omit<FilterFieldErrorNode, 'value'> & { value: string } =\n    {\n      type: 'Error',\n      range: {\n        from,\n        to,\n      },\n      textValue: text,\n      value,\n    };\n\n  // oxlint-disable-next-line typescript/no-deprecated\n  if (parserConfig?.searchConversion) {\n    errors.push({\n      range: { from: to - 1, to },\n      message: {\n        type: 'incompleteStatementWithEnabledSearchError',\n        details: getColoredSearchOperator(),\n      },\n      decoration: postSpotErrorMark,\n    });\n  } else {\n    errors.push({\n      range: { from: to - 1, to },\n      message: 'incompleteStatementError',\n      decoration: postSpotErrorMark,\n    });\n  }\n\n  return {\n    convertedNode,\n    errors,\n  };\n}\n"],
   "mappings": "AAEA,SAAS,yBAAyB;AAKlC,SAAS,wBAAwB;AACjC,SAAS,gCAAgC;AACzC,SAAS,8BAA8B;AAMhC,SAAS,gBACd,MACA,KACA,cAC6E;AAC7E,QAAM,EAAE,MAAM,GAAG,IAAI;AACrB,QAAM,OAAO,iBAAiB,MAAM,GAAG;AACvC,QAAM,QAAQ,uBAAuB,IAAI;AAEzC,QAAM,SAA6B,CAAC;AACpC,QAAM,gBACJ;AAAA,IACE,MAAM;AAAA,IACN,OAAO;AAAA,MACL;AAAA,MACA;AAAA,IACF;AAAA,IACA,WAAW;AAAA,IACX;AAAA,EACF;AAGF,MAAI,cAAc,kBAAkB;AAClC,WAAO,KAAK;AAAA,MACV,OAAO,EAAE,MAAM,KAAK,GAAG,GAAG;AAAA,MAC1B,SAAS;AAAA,QACP,MAAM;AAAA,QACN,SAAS,yBAAyB;AAAA,MACpC;AAAA,MACA,YAAY;AAAA,IACd,CAAC;AAAA,EACH,OAAO;AACL,WAAO,KAAK;AAAA,MACV,OAAO,EAAE,MAAM,KAAK,GAAG,GAAG;AAAA,MAC1B,SAAS;AAAA,MACT,YAAY;AAAA,IACd,CAAC;AAAA,EACH;AAEA,SAAO;AAAA,IACL;AAAA,IACA;AAAA,EACF;AACF;",
   "names": []
 }

package/esm/filters/filter-field/utils/conversion/lezer-tree-conversion/value/identifier.js

@@ -21,6 +21,7 @@ function convertIdentifier(node, doc, context) {
   };
   let endsWithOperator;
   let startsWithOperator;
+  let embeddedWildcards = [];
   if (node.name === "String") {
     endsWithOperator = text.slice(1, 2) === "*" ? { from: from + 1, to: from + 2 } : void 0;
     const withoutQuotes = text.slice(1, text.length - 1);
@@ -29,8 +30,19 @@ function convertIdentifier(node, doc, context) {
       endsWithOperator ? 1 : 0,
       value.length - (startsWithOperator ? 1 : 0)
     );
+    const contentText = text.slice(1, -1);
+    const wildcardRangesInContent = findSpecialCharsRanges(
+      contentText,
+      from + 1,
+      ["*"]
+    );
+    embeddedWildcards = wildcardRangesInContent.filter(
+      (range) => (!endsWithOperator || range.from !== endsWithOperator.from) && (!startsWithOperator || range.from !== startsWithOperator.from)
+    );
+  }
+  if (node.name === "Identifier" || node.name === "Variable") {
+    embeddedWildcards = findSpecialCharsRanges(text, from, ["*"]);
   }
-  const embeddedWildcards = node.name === "Identifier" || node.name === "Variable" ? findSpecialCharsRanges(text, from, ["*"]) : [];
   return {
     convertedNode,
     errors: [],

package/esm/filters/filter-field/utils/conversion/lezer-tree-conversion/value/identifier.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../../../../../../../src/filters/filter-field/utils/conversion/lezer-tree-conversion/value/identifier.ts"],
-  "sourcesContent": ["import type { SyntaxNodeRef } from '@lezer/common';\n\nimport type { ConvertedLezerNode } from '../../../../types/conversion-utils.js';\nimport type {\n  FilterFieldLezerNodeType,\n  FilterFieldStringNode,\n  FilterFieldNodeBase,\n} from '../../../../types/tree-nodes.js';\nimport { getTextFromRange } from '../../../get-text.js';\nimport {\n  removeEscapeCharacters,\n  isValidEscapeSequence,\n} from '../../escape-characters.js';\nimport { findSpecialCharsRanges } from '../utils/range-helpers.js';\n\n/**\n * Convert a string or identifier node.\n * Also returns starts- or ends-with operators if present, since they may not be valid depending on the context.\n * @internal\n */\nexport function convertIdentifier(\n  node: SyntaxNodeRef,\n  doc: string,\n  context?: FilterFieldLezerNodeType,\n): ConvertedLezerNode<\n  FilterFieldStringNode,\n  {\n    isValid: boolean;\n    positionOperators: {\n      endsWithOperator?: FilterFieldNodeBase['range'];\n      startsWithOperator?: FilterFieldNodeBase['range'];\n    };\n    embeddedWildcards: Array<FilterFieldNodeBase['range']>;\n  }\n> {\n  const { from, to } = node;\n  const text = getTextFromRange(node, doc);\n  const value = removeEscapeCharacters(\n    context === 'String' ? text.slice(1, -1) : text,\n  );\n\n  const convertedNode: FilterFieldStringNode = {\n    type: 'String',\n    range: {\n      from,\n      to,\n    },\n    textValue: text,\n    value,\n  };\n\n  let endsWithOperator;\n  let startsWithOperator;\n\n  // Position operators inside strings are currently not detected by the grammar, but\n  // by simply checking the first / last character of the string value.\n  // The range includes the doublequotes, which need to be excluded for potential errors.\n  if (node.name === 'String') {\n    endsWithOperator =\n      text.slice(1, 2) === '*' ? { from: from + 1, to: from + 2 } : undefined;\n\n    const withoutQuotes = text.slice(1, text.length - 1);\n    // check if there is a * at the end that is not escaped\n    startsWithOperator = withoutQuotes.match(/(?<!\\\\)(?:\\\\\\\\)*[*]$/)\n      ? { from: to - 2, to: to - 1 }\n      : undefined;\n\n    convertedNode.value = value.substring(\n      endsWithOperator ? 1 : 0,\n      value.length - (startsWithOperator ? 1 : 0),\n    );\n  }\n\n  const embeddedWildcards =\n    node.name === 'Identifier' || node.name === 'Variable'\n      ? findSpecialCharsRanges(text, from, ['*'])\n      : [];\n\n  return {\n    convertedNode,\n    errors: [],\n    isValid: isValidEscapeSequence(text),\n    positionOperators: {\n      endsWithOperator,\n      startsWithOperator,\n    },\n    embeddedWildcards,\n  };\n}\n"],
-  "mappings": "AAQA,SAAS,wBAAwB;AACjC;AAAA,EACE;AAAA,EACA;AAAA,OACK;AACP,SAAS,8BAA8B;AAOhC,SAAS,kBACd,MACA,KACA,SAWA;AACA,QAAM,EAAE,MAAM,GAAG,IAAI;AACrB,QAAM,OAAO,iBAAiB,MAAM,GAAG;AACvC,QAAM,QAAQ;AAAA,IACZ,YAAY,WAAW,KAAK,MAAM,GAAG,EAAE,IAAI;AAAA,EAC7C;AAEA,QAAM,gBAAuC;AAAA,IAC3C,MAAM;AAAA,IACN,OAAO;AAAA,MACL;AAAA,MACA;AAAA,IACF;AAAA,IACA,WAAW;AAAA,IACX;AAAA,EACF;AAEA,MAAI;AACJ,MAAI;AAKJ,MAAI,KAAK,SAAS,UAAU;AAC1B,uBACE,KAAK,MAAM,GAAG,CAAC,MAAM,MAAM,EAAE,MAAM,OAAO,GAAG,IAAI,OAAO,EAAE,IAAI;AAEhE,UAAM,gBAAgB,KAAK,MAAM,GAAG,KAAK,SAAS,CAAC;AAEnD,yBAAqB,cAAc,MAAM,sBAAsB,IAC3D,EAAE,MAAM,KAAK,GAAG,IAAI,KAAK,EAAE,IAC3B;AAEJ,kBAAc,QAAQ,MAAM;AAAA,MAC1B,mBAAmB,IAAI;AAAA,MACvB,MAAM,UAAU,qBAAqB,IAAI;AAAA,IAC3C;AAAA,EACF;AAEA,QAAM,oBACJ,KAAK,SAAS,gBAAgB,KAAK,SAAS,aACxC,uBAAuB,MAAM,MAAM,CAAC,GAAG,CAAC,IACxC,CAAC;AAEP,SAAO;AAAA,IACL;AAAA,IACA,QAAQ,CAAC;AAAA,IACT,SAAS,sBAAsB,IAAI;AAAA,IACnC,mBAAmB;AAAA,MACjB;AAAA,MACA;AAAA,IACF;AAAA,IACA;AAAA,EACF;AACF;",
+  "sourcesContent": ["import type { SyntaxNodeRef } from '@lezer/common';\n\nimport type { ConvertedLezerNode } from '../../../../types/conversion-utils.js';\nimport type {\n  FilterFieldLezerNodeType,\n  FilterFieldStringNode,\n  FilterFieldNodeBase,\n} from '../../../../types/tree-nodes.js';\nimport { getTextFromRange } from '../../../get-text.js';\nimport {\n  removeEscapeCharacters,\n  isValidEscapeSequence,\n} from '../../escape-characters.js';\nimport { findSpecialCharsRanges } from '../utils/range-helpers.js';\n\n/**\n * Convert a string or identifier node.\n * Also returns starts- or ends-with operators if present, since they may not be valid depending on the context.\n * @internal\n */\nexport function convertIdentifier(\n  node: SyntaxNodeRef,\n  doc: string,\n  context?: FilterFieldLezerNodeType,\n): ConvertedLezerNode<\n  FilterFieldStringNode,\n  {\n    isValid: boolean;\n    positionOperators: {\n      endsWithOperator?: FilterFieldNodeBase['range'];\n      startsWithOperator?: FilterFieldNodeBase['range'];\n    };\n    embeddedWildcards: Array<FilterFieldNodeBase['range']>;\n  }\n> {\n  const { from, to } = node;\n  const text = getTextFromRange(node, doc);\n  const value = removeEscapeCharacters(\n    context === 'String' ? text.slice(1, -1) : text,\n  );\n\n  const convertedNode: FilterFieldStringNode = {\n    type: 'String',\n    range: {\n      from,\n      to,\n    },\n    textValue: text,\n    value,\n  };\n\n  let endsWithOperator: FilterFieldNodeBase['range'] | undefined;\n  let startsWithOperator: FilterFieldNodeBase['range'] | undefined;\n  let embeddedWildcards: Array<FilterFieldNodeBase['range']> = [];\n\n  // Position operators inside strings are currently not detected by the grammar, but\n  // by simply checking the first / last character of the string value.\n  // The range includes the doublequotes, which need to be excluded for potential errors.\n  if (node.name === 'String') {\n    endsWithOperator =\n      text.slice(1, 2) === '*' ? { from: from + 1, to: from + 2 } : undefined;\n\n    const withoutQuotes = text.slice(1, text.length - 1);\n    // check if there is a * at the end that is not escaped\n    startsWithOperator = withoutQuotes.match(/(?<!\\\\)(?:\\\\\\\\)*[*]$/)\n      ? { from: to - 2, to: to - 1 }\n      : undefined;\n\n    convertedNode.value = value.substring(\n      endsWithOperator ? 1 : 0,\n      value.length - (startsWithOperator ? 1 : 0),\n    );\n\n    // Find wildcards in string content (between quotes) that are not at the edge positions\n    // already handled by endsWithOperator / startsWithOperator.\n    const contentText = text.slice(1, -1);\n    const wildcardRangesInContent = findSpecialCharsRanges(\n      contentText,\n      from + 1,\n      ['*'],\n    );\n    embeddedWildcards = wildcardRangesInContent.filter(\n      (range) =>\n        (!endsWithOperator || range.from !== endsWithOperator.from) &&\n        (!startsWithOperator || range.from !== startsWithOperator.from),\n    );\n  }\n\n  if (node.name === 'Identifier' || node.name === 'Variable') {\n    embeddedWildcards = findSpecialCharsRanges(text, from, ['*']);\n  }\n\n  return {\n    convertedNode,\n    errors: [],\n    isValid: isValidEscapeSequence(text),\n    positionOperators: {\n      endsWithOperator,\n      startsWithOperator,\n    },\n    embeddedWildcards,\n  };\n}\n"],
+  "mappings": "AAQA,SAAS,wBAAwB;AACjC;AAAA,EACE;AAAA,EACA;AAAA,OACK;AACP,SAAS,8BAA8B;AAOhC,SAAS,kBACd,MACA,KACA,SAWA;AACA,QAAM,EAAE,MAAM,GAAG,IAAI;AACrB,QAAM,OAAO,iBAAiB,MAAM,GAAG;AACvC,QAAM,QAAQ;AAAA,IACZ,YAAY,WAAW,KAAK,MAAM,GAAG,EAAE,IAAI;AAAA,EAC7C;AAEA,QAAM,gBAAuC;AAAA,IAC3C,MAAM;AAAA,IACN,OAAO;AAAA,MACL;AAAA,MACA;AAAA,IACF;AAAA,IACA,WAAW;AAAA,IACX;AAAA,EACF;AAEA,MAAI;AACJ,MAAI;AACJ,MAAI,oBAAyD,CAAC;AAK9D,MAAI,KAAK,SAAS,UAAU;AAC1B,uBACE,KAAK,MAAM,GAAG,CAAC,MAAM,MAAM,EAAE,MAAM,OAAO,GAAG,IAAI,OAAO,EAAE,IAAI;AAEhE,UAAM,gBAAgB,KAAK,MAAM,GAAG,KAAK,SAAS,CAAC;AAEnD,yBAAqB,cAAc,MAAM,sBAAsB,IAC3D,EAAE,MAAM,KAAK,GAAG,IAAI,KAAK,EAAE,IAC3B;AAEJ,kBAAc,QAAQ,MAAM;AAAA,MAC1B,mBAAmB,IAAI;AAAA,MACvB,MAAM,UAAU,qBAAqB,IAAI;AAAA,IAC3C;AAIA,UAAM,cAAc,KAAK,MAAM,GAAG,EAAE;AACpC,UAAM,0BAA0B;AAAA,MAC9B;AAAA,MACA,OAAO;AAAA,MACP,CAAC,GAAG;AAAA,IACN;AACA,wBAAoB,wBAAwB;AAAA,MAC1C,CAAC,WACE,CAAC,oBAAoB,MAAM,SAAS,iBAAiB,UACrD,CAAC,sBAAsB,MAAM,SAAS,mBAAmB;AAAA,IAC9D;AAAA,EACF;AAEA,MAAI,KAAK,SAAS,gBAAgB,KAAK,SAAS,YAAY;AAC1D,wBAAoB,uBAAuB,MAAM,MAAM,CAAC,GAAG,CAAC;AAAA,EAC9D;AAEA,SAAO;AAAA,IACL;AAAA,IACA,QAAQ,CAAC;AAAA,IACT,SAAS,sBAAsB,IAAI;AAAA,IACnC,mBAAmB;AAAA,MACjB;AAAA,MACA;AAAA,IACF;AAAA,IACA;AAAA,EACF;AACF;",
   "names": []
 }

package/esm/filters/filter-field/utils/conversion/lezer-tree-conversion/value/simple-value.js

@@ -30,6 +30,7 @@ function convertSimpleValue(node, doc, numberParser, customTypes, parserConfig,
   const errors = [];
   let positionOperators;
   let positionOperatorsInsideString;
+  const wildcardInMiddleRanges = [];
   cursor.iterate((childNode) => {
     const { from: childFrom, to: childTo } = childNode;
     const nodeName = childNode.name;
@@ -48,24 +49,24 @@ function convertSimpleValue(node, doc, numberParser, customTypes, parserConfig,
           embeddedWildcards
         } = convertIdentifier(childNode, doc, nodeName);
         if (
-          // eslint-disable-next-line @typescript-eslint/no-deprecated
+          // oxlint-disable-next-line typescript/no-deprecated
           parserConfig?.ipAddressConversion && nodeName === "Identifier" && isValidIPAddress(value)
         ) {
           convertedNode.type = "IPAddress";
         } else if (
-          // eslint-disable-next-line @typescript-eslint/no-deprecated
+          // oxlint-disable-next-line typescript/no-deprecated
           parserConfig?.timestampConversion && (nodeName === "Identifier" || nodeName === "String") && isValidTimestamp(value)
         ) {
           convertedNode.type = "Timestamp";
         }
         if (
-          // eslint-disable-next-line @typescript-eslint/no-deprecated
+          // oxlint-disable-next-line typescript/no-deprecated
           parserConfig?.uidConversion && nodeName === "Identifier" && isValidUID(value)
         ) {
           convertedNode.type = "UID";
         }
         if (
-          // eslint-disable-next-line @typescript-eslint/no-deprecated
+          // oxlint-disable-next-line typescript/no-deprecated
           parserConfig?.smartscapeIdConversion && nodeName === "Identifier" && isValidSmartscapeId(value)
         ) {
           convertedNode.type = "SmartscapeId";
@@ -112,8 +113,38 @@ function convertSimpleValue(node, doc, numberParser, customTypes, parserConfig,
           }
         }
         for (const range of embeddedWildcards) {
-          convertToErrorNode(convertedNode);
-          errors.push({ range, message: "unsupportedPositionOperator" });
+          if (parserConfig?.matchesWildcardConversion) {
+            wildcardInMiddleRanges.push(range);
+          } else if (nodeName !== "String") {
+            convertToErrorNode(convertedNode);
+            errors.push({ range, message: "unsupportedPositionOperator" });
+          }
+        }
+        if (embeddedWildcards.length > 0) {
+          const firstEmbedded = embeddedWildcards[0];
+          const lastEmbedded = embeddedWildcards[embeddedWildcards.length - 1];
+          if (endsWithOperator && endsWithOperator.to === firstEmbedded.from) {
+            convertToErrorNode(convertedNode);
+            errors.push({
+              range: endsWithOperator,
+              message: "unsupportedPositionOperator"
+            });
+            errors.push({
+              range: firstEmbedded,
+              message: "unsupportedPositionOperator"
+            });
+          }
+          if (startsWithOperator && lastEmbedded.to === startsWithOperator.from) {
+            convertToErrorNode(convertedNode);
+            errors.push({
+              range: lastEmbedded,
+              message: "unsupportedPositionOperator"
+            });
+            errors.push({
+              range: startsWithOperator,
+              message: "unsupportedPositionOperator"
+            });
+          }
         }
         if (!isValidIdentifier || nodeName === "IncompleteString") {
           convertToErrorNode(convertedNode);
@@ -261,14 +292,68 @@ function convertSimpleValue(node, doc, numberParser, customTypes, parserConfig,
         message: "duplicatePositionOperator"
       });
     }
+    if (typeInsideString === "contains" && type === "starts-with") {
+      convertToErrorNode(convertedNode);
+      errors.push({
+        range: positionOperatorsInsideString.ranges[1],
+        message: "duplicatePositionOperator"
+      });
+      errors.push({
+        range: positionOperators.ranges[0],
+        message: "duplicatePositionOperator"
+      });
+    }
+    if (typeInsideString === "contains" && type === "ends-with") {
+      convertToErrorNode(convertedNode);
+      errors.push({
+        range: positionOperators.ranges[0],
+        message: "duplicatePositionOperator"
+      });
+      errors.push({
+        range: positionOperatorsInsideString.ranges[0],
+        message: "duplicatePositionOperator"
+      });
+    }
     if (typeInsideString === "ends-with" && type === "starts-with" || typeInsideString === "starts-with" && type === "ends-with") {
       combinedPositionOperators.type = "contains";
     }
   }
+  const consecutiveWildcard = /* @__PURE__ */ new Set();
+  for (let i = 0; i + 1 < wildcardInMiddleRanges.length; i++) {
+    if (wildcardInMiddleRanges[i].to === wildcardInMiddleRanges[i + 1].from) {
+      convertToErrorNode(convertedNode);
+      if (!consecutiveWildcard.has(i)) {
+        consecutiveWildcard.add(i);
+        errors.push({
+          range: wildcardInMiddleRanges[i],
+          message: "unsupportedPositionOperator"
+        });
+      }
+      if (!consecutiveWildcard.has(i + 1)) {
+        consecutiveWildcard.add(i + 1);
+        errors.push({
+          range: wildcardInMiddleRanges[i + 1],
+          message: "unsupportedPositionOperator"
+        });
+      }
+    }
+  }
+  if (wildcardInMiddleRanges.length > 0 && errors.length === 0) {
+    const hasLeading = combinedPositionOperators?.type === "ends-with" || combinedPositionOperators?.type === "contains";
+    const hasTrailing = combinedPositionOperators?.type === "starts-with" || combinedPositionOperators?.type === "contains";
+    convertedNode.value = (hasLeading ? "*" : "") + convertedNode.value + (hasTrailing ? "*" : "");
+    return {
+      convertedNode,
+      errors,
+      positionOperators: combinedPositionOperators,
+      wildcardInMiddle: wildcardInMiddleRanges
+    };
+  }
   return {
     convertedNode,
     errors,
-    positionOperators: errors.length === 0 ? combinedPositionOperators : void 0
+    positionOperators: errors.length === 0 ? combinedPositionOperators : void 0,
+    wildcardInMiddle: void 0
   };
 }
 export {