@rapiq/parser-expression 2.0.0-beta.4 → 2.0.0-beta.5

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
package/dist/index.mjs CHANGED
@@ -90,12 +90,12 @@ var ExpressionFiltersParser = class extends BaseParser {
90
90
  parseExact(input, options = {}) {
91
91
  const { expr, scope } = this.parseSource(input, options);
92
92
  if (!scope) return expr;
93
- return applyFiltersSchemaValidation(expr, scope.schema) ?? new Filters(FilterCompoundOperator.AND, buildFiltersDefaults(scope.schema));
93
+ return applyFiltersSchemaValidation(expr, scope.schema, options.context) ?? new Filters(FilterCompoundOperator.AND, buildFiltersDefaults(scope.schema));
94
94
  }
95
95
  async parseExactAsync(input, options = {}) {
96
96
  const { expr, scope } = this.parseSource(input, options);
97
97
  if (!scope) return expr;
98
- return await applyFiltersSchemaValidationAsync(expr, scope.schema) ?? new Filters(FilterCompoundOperator.AND, buildFiltersDefaults(scope.schema));
98
+ return await applyFiltersSchemaValidationAsync(expr, scope.schema, options.context) ?? new Filters(FilterCompoundOperator.AND, buildFiltersDefaults(scope.schema));
99
99
  }
100
100
  /**
101
101
  * The shared front-end of {@link parseExact} and
@@ -1 +1 @@
1
- {"version":3,"file":"index.mjs","names":[],"sources":["../src/parameter/fields/module.ts","../src/parameter/filters/constants.ts","../src/parameter/filters/module.ts","../src/parameter/pagination/module.ts","../src/parameter/relations/module.ts","../src/parameter/sorts/module.ts","../src/module.ts"],"sourcesContent":["/*\n * Copyright (c) 2025-2025.\n * Author Peter Placzek (tada5hi)\n * For the full copyright and license information,\n * view the LICENSE file that was distributed with this source code.\n */\n\nimport { SimpleFieldsParser } from '@rapiq/parser-simple';\n\nexport class ExpressionFieldsParser extends SimpleFieldsParser {\n\n}\n","/*\n * Copyright (c) 2025-2026.\n * Author Peter Placzek (tada5hi)\n * For the full copyright and license information,\n * view the LICENSE file that was distributed with this source code.\n */\n\nexport enum FilterTokenType {\n NOT = 'NOT',\n\n AND = 'AND',\n OR = 'OR',\n\n EQUAL = 'eq',\n GREATER_THAN = 'gt',\n GREATER_OR_EQUAL = 'gte',\n LESS_THAN = 'lt',\n LESS_OR_EQUAL = 'lte',\n CONTAINS = 'like',\n STARTS_WITH = 'startsWith',\n ENDS_WITH = 'endsWith',\n IN = 'in',\n NIN = 'nin',\n ELEM_MATCH = 'elemMatch',\n SIZE = 'size',\n\n FIELD = 'FIELD',\n ITSELF = 'ITSELF',\n ESCAPED_TEXT = 'ESCAPED_TEXT',\n NULL = 'NULL',\n LPAREN = 'LPAREN',\n RPAREN = 'RPAREN',\n COMMA = 'COMMA',\n DOT = 'DOT',\n EOF = 'EOF',\n}\n\n/**\n * Grammar keywords of the expression dialect mapped to the token\n * they classify as. The tokenizer classifies whole identifiers\n * against this map; encoders consume its keys to reject field\n * segments that would tokenize as an operator on decode.\n */\nexport const FILTER_EXPRESSION_KEYWORDS = {\n not: FilterTokenType.NOT,\n and: FilterTokenType.AND,\n or: FilterTokenType.OR,\n eq: FilterTokenType.EQUAL,\n gt: FilterTokenType.GREATER_THAN,\n gte: FilterTokenType.GREATER_OR_EQUAL,\n lt: FilterTokenType.LESS_THAN,\n lte: FilterTokenType.LESS_OR_EQUAL,\n contains: FilterTokenType.CONTAINS,\n startsWith: FilterTokenType.STARTS_WITH,\n endsWith: FilterTokenType.ENDS_WITH,\n in: FilterTokenType.IN,\n nin: FilterTokenType.NIN,\n elemMatch: FilterTokenType.ELEM_MATCH,\n size: FilterTokenType.SIZE,\n null: FilterTokenType.NULL,\n} as const satisfies Record<string, FilterTokenType>;\n\n/**\n * Identifier grammar of a single field segment as accepted by the\n * expression tokenizer (unanchored regex source; consumers anchor\n * it as needed).\n */\nexport const FILTER_FIELD_SEGMENT_PATTERN = '[A-Za-z0-9_](?:[A-Za-z0-9_-]*[A-Za-z0-9_])?';\n","/*\n * Copyright (c) 2021-2025.\n * Author Peter Placzek (tada5hi)\n * For the full copyright and license information,\n * view the LICENSE file that was distributed with this source code.\n */\n\nimport type {\n FiltersParseOptions,\n IFilter,\n IFilters,\n ObjectLiteral,\n Scalar,\n} from '@rapiq/core';\nimport {\n BaseParser,\n DEFAULT_ID,\n ErrorCode,\n Filter,\n FilterCompoundOperator,\n FilterFieldOperator,\n Filters,\n FiltersParseError,\n ITSELF,\n MAX_TRAVERSAL_DEPTH,\n Parameter,\n ParseError,\n ResolutionScope,\n applyFiltersSchemaValidation,\n applyFiltersSchemaValidationAsync,\n buildFiltersDefaults,\n isFilters,\n} from '@rapiq/core';\nimport { parseFilterScalar } from '@rapiq/parser-simple';\nimport {\n FILTER_EXPRESSION_KEYWORDS,\n FILTER_FIELD_SEGMENT_PATTERN,\n FilterTokenType,\n} from './constants';\nimport type { FilterToken } from './types';\n\ntype FiltersScope = ResolutionScope<`${Parameter.FILTERS}`>;\n\n/**\n * Keep recursive expression parsing below the JavaScript call-stack limit and\n * aligned with the schema resolver and Mongo parser traversal caps.\n */\nconst MAX_DEPTH = MAX_TRAVERSAL_DEPTH;\n\n/**\n * @see https://www.jsonapi.net/usage/reading/filtering.html\n */\nexport class ExpressionFiltersParser extends BaseParser<\n FiltersParseOptions,\n IFilters\n> {\n private tokens: FilterToken[] = [];\n\n private pos = 0;\n\n /**\n * How many elemMatch interiors the parser is currently inside —\n * the ITSELF marker is only legal at depth > 0.\n */\n private elemMatchDepth = 0;\n\n // ---------------------------------------------------------\n\n parse<RECORD extends ObjectLiteral = ObjectLiteral>(\n input: unknown,\n options: FiltersParseOptions<RECORD> = {},\n ) : IFilters {\n // absent input is not a failure — schema defaults still apply.\n // an empty string is NOT absent: the dialect is precise, so\n // input like `?filter=` must surface a syntax error.\n if (input === undefined || input === null) {\n return this.buildAbsentOutput(options);\n }\n\n return this.wrapRoot(this.parseExact(input, options));\n }\n\n override async parseAsync<RECORD extends ObjectLiteral = ObjectLiteral>(\n input: unknown,\n options: FiltersParseOptions<RECORD> = {},\n ) : Promise<IFilters> {\n if (input === undefined || input === null) {\n return this.buildAbsentOutput(options);\n }\n\n return this.wrapRoot(await this.parseExactAsync(input, options));\n }\n\n parseExact<RECORD extends ObjectLiteral = ObjectLiteral>(\n input: unknown,\n options: FiltersParseOptions<RECORD> = {},\n ) : IFilters | IFilter {\n const { expr, scope } = this.parseSource(input, options);\n if (!scope) {\n return expr;\n }\n\n const validated = applyFiltersSchemaValidation(expr, scope.schema);\n\n return validated ?? new Filters(\n FilterCompoundOperator.AND,\n buildFiltersDefaults(scope.schema),\n );\n }\n\n async parseExactAsync<RECORD extends ObjectLiteral = ObjectLiteral>(\n input: unknown,\n options: FiltersParseOptions<RECORD> = {},\n ) : Promise<IFilters | IFilter> {\n const { expr, scope } = this.parseSource(input, options);\n if (!scope) {\n return expr;\n }\n\n const validated = await applyFiltersSchemaValidationAsync(expr, scope.schema);\n\n return validated ?? new Filters(\n FilterCompoundOperator.AND,\n buildFiltersDefaults(scope.schema),\n );\n }\n\n // ---------------------------------------------------------\n\n /**\n * The shared front-end of {@link parseExact} and\n * {@link parseExactAsync}: tokenize, bind the resolution scope and\n * run the grammar — everything up to (but excluding) validation.\n */\n private parseSource<RECORD extends ObjectLiteral = ObjectLiteral>(\n input: unknown,\n options: FiltersParseOptions<RECORD>,\n ) : { expr: Filters | Filter, scope?: FiltersScope } {\n if (typeof input !== 'string') {\n throw FiltersParseError.inputInvalid();\n }\n\n this.pos = 0;\n this.elemMatchDepth = 0;\n this.tokens = this.tokenize(input);\n\n // expressions are precise — invalid keys always throw,\n // but only when a schema (or the strict override,\n // which rejects undeclared keys) constrains the parse.\n let scope : FiltersScope | undefined;\n if (options.schema || options.strict) {\n scope = ResolutionScope.for(this.registry, Parameter.FILTERS, options.schema, {\n relations: options.relations,\n throwOnFailure: true,\n strict: options.strict,\n }) as FiltersScope;\n }\n\n const expr = this.parseFilterExpression(scope);\n if (this.peek().type !== FilterTokenType.EOF) {\n throw FiltersParseError.syntaxInvalid(`Unexpected token: ${this.peek().type}`);\n }\n\n return { expr, scope };\n }\n\n private buildAbsentOutput<RECORD extends ObjectLiteral = ObjectLiteral>(\n options: FiltersParseOptions<RECORD>,\n ) : IFilters {\n const scope = ResolutionScope.for(this.registry, Parameter.FILTERS, options.schema, { relations: options.relations }) as FiltersScope;\n\n return new Filters(\n FilterCompoundOperator.AND,\n buildFiltersDefaults(scope.schema),\n );\n }\n\n private wrapRoot(expr: IFilters | IFilter) : IFilters {\n if (\n isFilters(expr, FilterCompoundOperator.AND) ||\n isFilters(expr, FilterCompoundOperator.OR)\n ) {\n return expr;\n }\n\n return new Filters(FilterCompoundOperator.AND, [expr]);\n }\n\n // ---------------------------------------------------------\n\n private peek(): FilterToken {\n return this.tokens[this.pos] || { type: FilterTokenType.EOF };\n }\n\n private consume(expected?: `${FilterTokenType}`): FilterToken {\n const token = this.peek();\n if (expected && token.type !== expected) {\n throw FiltersParseError.syntaxInvalid(`Expected ${expected}, got ${token.type}`);\n }\n this.pos++;\n return token;\n }\n\n private tokenize(input: string): FilterToken[] {\n const tokens: FilterToken[] = [];\n // keywords are classified from whole identifiers (lookup below) —\n // matching them in the regex would split identifiers that merely\n // start with a keyword (e.g. \"order\" -> \"or\" + \"der\").\n // $-words are reserved markers, never field segments.\n const regex = new RegExp(`\\\\s+|\\\\(|\\\\)|,|\\\\.|'(?:''|[^'])*'|\\\\$[A-Za-z0-9_]*|${FILTER_FIELD_SEGMENT_PATTERN}`, 'g');\n\n let match: RegExpExecArray | null;\n let cursor = 0;\n\n while ((match = regex.exec(input))) {\n if (match.index !== cursor) {\n throw FiltersParseError.syntaxInvalid(`Unexpected character at position ${cursor}.`);\n }\n\n const value = match[0];\n cursor = regex.lastIndex;\n if (/^\\s+$/.test(value)) continue;\n\n switch (value) {\n case '(': tokens.push({ type: FilterTokenType.LPAREN }); break;\n case ')': tokens.push({ type: FilterTokenType.RPAREN }); break;\n case ',': tokens.push({ type: FilterTokenType.COMMA }); break;\n case '.': tokens.push({ type: FilterTokenType.DOT }); break;\n default:\n if (value.startsWith('$')) {\n if (value !== ITSELF) {\n throw FiltersParseError.syntaxInvalid(`The marker ${value} is unknown.`);\n }\n\n tokens.push({ type: FilterTokenType.ITSELF });\n break;\n }\n\n // own-property check: exotic field names inherited from\n // Object.prototype (toString, constructor, ...) stay fields.\n if (Object.prototype.hasOwnProperty.call(FILTER_EXPRESSION_KEYWORDS, value)) {\n tokens.push({ type: FILTER_EXPRESSION_KEYWORDS[value as keyof typeof FILTER_EXPRESSION_KEYWORDS] });\n } else if (\n value.startsWith('\\'') &&\n value.endsWith('\\'')\n ) {\n tokens.push({ type: FilterTokenType.ESCAPED_TEXT, value });\n } else {\n tokens.push({ type: FilterTokenType.FIELD, value });\n }\n }\n }\n\n if (cursor !== input.length) {\n throw FiltersParseError.syntaxInvalid(`Unexpected character at position ${cursor}.`);\n }\n\n tokens.push({ type: FilterTokenType.EOF });\n return tokens;\n }\n\n private parseFilterExpression(\n scope?: FiltersScope,\n negation: boolean = false,\n depth: number = 0,\n ) : Filters | Filter {\n if (depth > MAX_DEPTH) {\n throw FiltersParseError.syntaxInvalid('The maximum nesting depth was exceeded.');\n }\n\n const token = this.peek();\n switch (token.type) {\n case FilterTokenType.NOT:\n return this.parseNotExpression(scope, negation, depth);\n case FilterTokenType.AND:\n case FilterTokenType.OR:\n return this.parseLogicalExpression(scope, negation, depth);\n case FilterTokenType.EQUAL:\n case FilterTokenType.GREATER_THAN:\n case FilterTokenType.GREATER_OR_EQUAL:\n case FilterTokenType.LESS_THAN:\n case FilterTokenType.LESS_OR_EQUAL:\n return this.parseComparisonExpression(scope, negation);\n case FilterTokenType.CONTAINS:\n case FilterTokenType.STARTS_WITH:\n case FilterTokenType.ENDS_WITH:\n return this.parseMatchExpression(scope, negation);\n case FilterTokenType.IN:\n case FilterTokenType.NIN:\n return this.parseInExpression(scope, negation);\n case FilterTokenType.ELEM_MATCH:\n return this.parseElemMatchExpression(scope, negation, depth);\n case FilterTokenType.SIZE:\n return this.parseSizeExpression(scope, negation);\n default:\n throw FiltersParseError.syntaxInvalid(`Unexpected token in filter expression: ${token.type}`);\n }\n }\n\n private parseNotExpression(\n scope?: FiltersScope,\n negation: boolean = false,\n depth: number = 0,\n ): Filters | Filter {\n this.consume(FilterTokenType.NOT);\n this.consume(FilterTokenType.LPAREN);\n const expr = this.parseFilterExpression(scope, !negation, depth + 1);\n this.consume(FilterTokenType.RPAREN);\n\n return expr;\n }\n\n private parseLogicalExpression(\n scope?: FiltersScope,\n negation: boolean = false,\n depth: number = 0,\n ): Filters | Filter {\n let op = this.consume().type; // AND / OR\n if (op !== FilterTokenType.AND && op !== FilterTokenType.OR) {\n throw FiltersParseError.syntaxInvalid('Expected AND or OR token type.');\n }\n\n this.consume(FilterTokenType.LPAREN);\n const expressions: (Filter | Filters)[] = [this.parseFilterExpression(scope, negation, depth + 1)];\n while (this.peek().type === FilterTokenType.COMMA) {\n this.consume(FilterTokenType.COMMA);\n expressions.push(this.parseFilterExpression(scope, negation, depth + 1));\n }\n this.consume(FilterTokenType.RPAREN);\n\n if (negation) {\n if (op === FilterTokenType.AND) {\n op = FilterTokenType.OR;\n } else {\n op = FilterTokenType.AND;\n }\n }\n\n if (op === FilterTokenType.AND) {\n return new Filters(\n FilterCompoundOperator.AND,\n expressions,\n );\n }\n\n return new Filters(FilterCompoundOperator.OR, expressions);\n }\n\n private parseComparisonExpression(\n scope?: FiltersScope,\n negation: boolean = false,\n ): Filters | Filter {\n const op = this.consume().type;\n this.consume(FilterTokenType.LPAREN);\n const left = this.parseExpressionFieldChain(scope);\n this.consume(FilterTokenType.COMMA);\n const right = this.parseExpressionValue();\n this.consume(FilterTokenType.RPAREN);\n\n switch (op) {\n case FilterTokenType.EQUAL: {\n if (negation) {\n return new Filter(\n FilterFieldOperator.NOT_EQUAL,\n left as string,\n right as string,\n );\n }\n\n return new Filter(\n FilterFieldOperator.EQUAL,\n left as string,\n right as string,\n );\n }\n case FilterTokenType.GREATER_THAN: {\n if (negation) {\n return new Filter(\n FilterFieldOperator.LESS_THAN_EQUAL,\n left as string,\n right as string,\n );\n }\n return new Filter(\n FilterFieldOperator.GREATER_THAN,\n left as string,\n right as string,\n );\n }\n case FilterTokenType.GREATER_OR_EQUAL: {\n if (negation) {\n return new Filter(\n FilterFieldOperator.LESS_THAN,\n left as string,\n right as string,\n );\n }\n return new Filter(\n FilterFieldOperator.GREATER_THAN_EQUAL,\n left as string,\n right as string,\n );\n }\n case FilterTokenType.LESS_THAN: {\n if (negation) {\n return new Filter(\n FilterFieldOperator.GREATER_THAN_EQUAL,\n left as string,\n right as string,\n );\n }\n return new Filter(\n FilterFieldOperator.LESS_THAN,\n left as string,\n right as string,\n );\n }\n case FilterTokenType.LESS_OR_EQUAL: {\n if (negation) {\n return new Filter(\n FilterFieldOperator.GREATER_THAN,\n left as string,\n right as string,\n );\n }\n return new Filter(\n FilterFieldOperator.LESS_THAN_EQUAL,\n left as string,\n right as string,\n );\n }\n }\n\n throw FiltersParseError.syntaxInvalid(`Token type ${op} not supported as comparison operator.`);\n }\n\n private parseMatchExpression(\n scope?: FiltersScope,\n negation: boolean = false,\n ): Filters | Filter {\n const op = this.consume().type;\n this.consume(FilterTokenType.LPAREN);\n const field = this.parseExpressionFieldChain(scope);\n this.consume(FilterTokenType.COMMA);\n const text = this.consume(FilterTokenType.ESCAPED_TEXT).value!;\n this.consume(FilterTokenType.RPAREN);\n\n const normalized = this.normalizeValue(text);\n if (typeof normalized !== 'string') {\n throw FiltersParseError.keyValueInvalid(field);\n }\n\n switch (op) {\n case FilterTokenType.CONTAINS: {\n return new Filter(\n negation ?\n FilterFieldOperator.NOT_CONTAINS :\n FilterFieldOperator.CONTAINS,\n field,\n normalized,\n );\n }\n case FilterTokenType.ENDS_WITH: {\n return new Filter(\n negation ?\n FilterFieldOperator.NOT_ENDS_WITH :\n FilterFieldOperator.ENDS_WITH,\n field,\n normalized,\n );\n }\n default: {\n return new Filter(\n negation ?\n FilterFieldOperator.NOT_STARTS_WITH :\n FilterFieldOperator.STARTS_WITH,\n field,\n normalized,\n );\n }\n }\n }\n\n private parseInExpression(\n scope?: FiltersScope,\n negation: boolean = false,\n ): Filters | Filter {\n const token = this.peek();\n if (token.type === FilterTokenType.NIN) {\n this.consume(FilterTokenType.NIN);\n } else {\n this.consume(FilterTokenType.IN);\n }\n\n this.consume(FilterTokenType.LPAREN);\n\n const field = this.parseExpressionFieldChain(scope);\n\n const values: unknown[] = [];\n while (this.peek().type === FilterTokenType.COMMA) {\n this.consume(FilterTokenType.COMMA);\n\n values.push(this.parseExpressionValue());\n }\n this.consume(FilterTokenType.RPAREN);\n\n const notIn = (token.type === FilterTokenType.NIN && !negation) ||\n (token.type === FilterTokenType.IN && negation);\n\n if (notIn) {\n return new Filter(\n FilterFieldOperator.NOT_IN,\n field,\n values,\n );\n }\n\n return new Filter(\n FilterFieldOperator.IN,\n field,\n values,\n );\n }\n\n /**\n * size(field, n): the field holds an array of exactly n elements\n * (a non-negative integer — the wire is untyped, so the quoted\n * value coerces back to a number). There is no complement — a\n * negated size would silently widen and always throws.\n */\n private parseSizeExpression(\n scope?: FiltersScope,\n negation: boolean = false,\n ): Filter {\n if (negation) {\n throw FiltersParseError.operatorUnsupported('size');\n }\n\n this.consume(FilterTokenType.SIZE);\n this.consume(FilterTokenType.LPAREN);\n const field = this.parseExpressionFieldChain(scope);\n this.consume(FilterTokenType.COMMA);\n const value = this.parseExpressionValue();\n this.consume(FilterTokenType.RPAREN);\n\n if (\n typeof value !== 'number' ||\n !Number.isInteger(value) ||\n value < 0\n ) {\n throw FiltersParseError.keyValueInvalid(field);\n }\n\n return new Filter(FilterFieldOperator.SIZE, field, value);\n }\n\n /**\n * elemMatch(field, expr): field paths inside the interior are\n * relative to the array element; the ITSELF marker addresses the\n * element itself. There is no complement — a negated elemMatch\n * would silently widen and always throws.\n */\n private parseElemMatchExpression(\n scope?: FiltersScope,\n negation: boolean = false,\n depth: number = 0,\n ): Filter {\n if (negation) {\n throw FiltersParseError.operatorUnsupported('elemMatch');\n }\n\n this.consume(FilterTokenType.ELEM_MATCH);\n this.consume(FilterTokenType.LPAREN);\n\n const target = this.parseElemMatchTarget(scope);\n\n this.consume(FilterTokenType.COMMA);\n\n this.elemMatchDepth += 1;\n\n let condition : Filters | Filter;\n try {\n condition = this.parseFilterExpression(target.scope, false, depth + 1);\n } finally {\n this.elemMatchDepth -= 1;\n }\n\n this.consume(FilterTokenType.RPAREN);\n\n return new Filter(FilterFieldOperator.ELEM_MATCH, target.field, condition);\n }\n\n /**\n * The field an elemMatch binds plus the interior resolution scope:\n * the related schema when resolvable, otherwise an unbound scope\n * inheriting the current policy (e.g. a JSON array column).\n */\n private parseElemMatchTarget(\n scope?: FiltersScope,\n ): { field: string, scope?: FiltersScope } {\n if (this.peek().type === FilterTokenType.ITSELF) {\n // an elemMatch on the element itself (arrays of arrays);\n // the chain parser enforces the interior-only contract.\n const field = this.parseExpressionFieldChain(scope);\n\n return {\n field,\n scope: scope ? this.buildUnboundScope(scope) : undefined,\n };\n }\n\n const token = this.consume(FilterTokenType.FIELD);\n\n const parts = [token.value!];\n while (this.peek().type === FilterTokenType.DOT) {\n this.consume(FilterTokenType.DOT);\n parts.push(this.consume(FilterTokenType.FIELD).value!);\n }\n\n if (!scope) {\n return { field: parts.join('.') };\n }\n\n // a leading segment matching the schema name addresses the\n // schema itself (mirrors parseExpressionFieldChain).\n if (\n parts.length > 1 &&\n (parts[0] === DEFAULT_ID || parts[0] === scope.schema.name)\n ) {\n parts.shift();\n }\n\n const resolved = scope.resolveKey(parts.join('.'));\n\n /* istanbul ignore next -- the scope always throws */\n if (!resolved.success) {\n throw FiltersParseError.keyInvalid(resolved.input);\n }\n\n const field = [...resolved.path, resolved.name].join('.');\n\n let interior : FiltersScope | undefined;\n try {\n const verdict = resolved.scope.descend(resolved.name);\n if (verdict instanceof ResolutionScope) {\n interior = verdict as FiltersScope;\n }\n } catch (e) {\n // elemMatch on a non-relation field is legal — a missing\n // related schema (thrown as keyPathInvalid, the scope is\n // always throwing) falls back to the unbound scope; every\n // other failure (e.g. relations gating) propagates.\n if (\n !(e instanceof ParseError) ||\n e.code !== ErrorCode.KEY_PATH_INVALID\n ) {\n throw e;\n }\n }\n\n return {\n field,\n scope: interior ?? this.buildUnboundScope(scope),\n };\n }\n\n private buildUnboundScope(current: FiltersScope) : FiltersScope {\n return ResolutionScope.for(this.registry, Parameter.FILTERS, undefined, {\n throwOnFailure: true,\n strict: current.strict,\n }) as FiltersScope;\n }\n\n private parseExpressionValue(): Scalar {\n const token = this.consume();\n\n if (\n token.type !== FilterTokenType.ESCAPED_TEXT &&\n token.type !== FilterTokenType.NULL\n ) {\n throw FiltersParseError.syntaxInvalid(`Unexpected token in value: ${token.type}`);\n }\n\n return this.normalizeValue(token.value ?? 'null');\n }\n\n private parseExpressionFieldChain(\n scope?: FiltersScope,\n ): string {\n if (this.peek().type === FilterTokenType.ITSELF) {\n this.consume(FilterTokenType.ITSELF);\n\n // the marker addresses the element bound by the enclosing\n // elemMatch interior and never resolves against the schema.\n if (this.elemMatchDepth === 0) {\n throw FiltersParseError.keyInvalid(ITSELF);\n }\n\n return ITSELF;\n }\n\n const token = this.consume(FilterTokenType.FIELD);\n if (token.type !== FilterTokenType.FIELD) {\n throw FiltersParseError.syntaxInvalid(`Unexpected token in field chain: ${token.type}`);\n }\n\n const parts = [token.value!];\n\n while (this.peek().type === FilterTokenType.DOT) {\n this.consume(FilterTokenType.DOT);\n parts.push(this.consume(FilterTokenType.FIELD).value!);\n }\n\n if (scope) {\n // a leading segment matching the schema name addresses the\n // schema itself (mirrors the named-group hoisting of the\n // simple filters parser) and is stripped.\n if (\n parts.length > 1 &&\n (parts[0] === DEFAULT_ID || parts[0] === scope.schema.name)\n ) {\n parts.shift();\n }\n\n const resolved = scope.resolveKey(parts.join('.'));\n\n /* istanbul ignore next -- the scope always throws */\n if (!resolved.success) {\n throw FiltersParseError.keyInvalid(resolved.input);\n }\n\n return [...resolved.path, resolved.name].join('.');\n }\n\n return parts.join('.');\n }\n\n // ---------------------------------------------------------\n\n protected normalizeValue(input: unknown) : Scalar {\n if (typeof input === 'string') {\n const trimmed = input.trim();\n if (trimmed.length === 0) {\n return trimmed;\n }\n\n // quoted content is coerced but never comma-split —\n // the expression dialect passes lists as separate args.\n if (\n trimmed.startsWith('\\'') &&\n trimmed.endsWith('\\'') &&\n trimmed.length >= 2\n ) {\n return parseFilterScalar(trimmed.slice(1, -1).replace(/''/g, '\\''));\n }\n\n return parseFilterScalar(trimmed);\n }\n\n if (typeof input === 'number') {\n return input;\n }\n\n if (typeof input === 'undefined' || input === null) {\n return null;\n }\n\n throw new SyntaxError('Value can not be normalized.');\n }\n}\n","/*\n * Copyright (c) 2022-2025.\n * Author Peter Placzek (tada5hi)\n * For the full copyright and license information,\n * view the LICENSE file that was distributed with this source code.\n */\n\nimport { SimplePaginationParser } from '@rapiq/parser-simple';\nimport type { ExpressionPaginationParseOptions } from './types';\n\nexport class ExpressionPaginationParser extends SimplePaginationParser<ExpressionPaginationParseOptions> {\n\n}\n","/*\n * Copyright (c) 2021-2025.\n * Author Peter Placzek (tada5hi)\n * For the full copyright and license information,\n * view the LICENSE file that was distributed with this source code.\n */\n\nimport { SimpleRelationsParser } from '@rapiq/parser-simple';\n\nexport class ExpressionRelationsParser extends SimpleRelationsParser {\n\n}\n","/*\n * Copyright (c) 2021-2025.\n * Author Peter Placzek (tada5hi)\n * For the full copyright and license information,\n * view the LICENSE file that was distributed with this source code.\n */\n\nimport { SimpleSortParser } from '@rapiq/parser-simple';\n\nexport class ExpressionSortParser extends SimpleSortParser {\n\n}\n","/*\n * Copyright (c) 2025.\n * Author Peter Placzek (tada5hi)\n * For the full copyright and license information,\n * view the LICENSE file that was distributed with this source code.\n */\n\nimport type { SchemaRegistry } from '@rapiq/core';\nimport { BaseQueryParser } from '@rapiq/core';\nimport {\n ExpressionFieldsParser,\n ExpressionFiltersParser,\n ExpressionPaginationParser,\n ExpressionRelationsParser,\n ExpressionSortParser,\n} from './parameter';\n\nexport class ExpressionParser extends BaseQueryParser {\n protected fieldsParser : ExpressionFieldsParser;\n\n protected filtersParser : ExpressionFiltersParser;\n\n protected paginationParser : ExpressionPaginationParser;\n\n protected relationsParser : ExpressionRelationsParser;\n\n protected sortParser : ExpressionSortParser;\n\n // -----------------------------------------------------\n\n constructor(input?: SchemaRegistry) {\n super(input);\n\n this.fieldsParser = new ExpressionFieldsParser(this.registry);\n this.filtersParser = new ExpressionFiltersParser(this.registry);\n this.paginationParser = new ExpressionPaginationParser(this.registry);\n this.relationsParser = new ExpressionRelationsParser(this.registry);\n this.sortParser = new ExpressionSortParser(this.registry);\n }\n}\n"],"mappings":";;;AASA,IAAa,yBAAb,cAA4C,mBAAmB,CAE/D;;;ACJA,IAAY,kBAAL,yBAAA,iBAAA;CACH,gBAAA,SAAA;CAEA,gBAAA,SAAA;CACA,gBAAA,QAAA;CAEA,gBAAA,WAAA;CACA,gBAAA,kBAAA;CACA,gBAAA,sBAAA;CACA,gBAAA,eAAA;CACA,gBAAA,mBAAA;CACA,gBAAA,cAAA;CACA,gBAAA,iBAAA;CACA,gBAAA,eAAA;CACA,gBAAA,QAAA;CACA,gBAAA,SAAA;CACA,gBAAA,gBAAA;CACA,gBAAA,UAAA;CAEA,gBAAA,WAAA;CACA,gBAAA,YAAA;CACA,gBAAA,kBAAA;CACA,gBAAA,UAAA;CACA,gBAAA,YAAA;CACA,gBAAA,YAAA;CACA,gBAAA,WAAA;CACA,gBAAA,SAAA;CACA,gBAAA,SAAA;;AACJ,EAAA,CAAA,CAAA;;;;;;;AAQA,MAAa,6BAA6B;CACtC,KAAA;CACA,KAAA;CACA,IAAA;CACA,IAAA;CACA,IAAA;CACA,KAAA;CACA,IAAA;CACA,KAAA;CACA,UAAA;CACA,YAAA;CACA,UAAA;CACA,IAAA;CACA,KAAA;CACA,WAAA;CACA,MAAA;CACA,MAAA;AACJ;;;;;;AAOA,MAAa,+BAA+B;;;;;;;ACpB5C,MAAM,YAAY;;;;AAKlB,IAAa,0BAAb,cAA6C,WAG3C;CACE,SAAgC,CAAC;CAEjC,MAAc;;;;;CAMd,iBAAyB;CAIzB,MACI,OACA,UAAuC,CAAC,GAC/B;EAIT,IAAI,UAAU,KAAA,KAAa,UAAU,MACjC,OAAO,KAAK,kBAAkB,OAAO;EAGzC,OAAO,KAAK,SAAS,KAAK,WAAW,OAAO,OAAO,CAAC;CACxD;CAEA,MAAe,WACX,OACA,UAAuC,CAAC,GACtB;EAClB,IAAI,UAAU,KAAA,KAAa,UAAU,MACjC,OAAO,KAAK,kBAAkB,OAAO;EAGzC,OAAO,KAAK,SAAS,MAAM,KAAK,gBAAgB,OAAO,OAAO,CAAC;CACnE;CAEA,WACI,OACA,UAAuC,CAAC,GACrB;EACnB,MAAM,EAAE,MAAM,UAAU,KAAK,YAAY,OAAO,OAAO;EACvD,IAAI,CAAC,OACD,OAAO;EAKX,OAFkB,6BAA6B,MAAM,MAAM,MAE5C,KAAK,IAAI,QACpB,uBAAuB,KACvB,qBAAqB,MAAM,MAAM,CACrC;CACJ;CAEA,MAAM,gBACF,OACA,UAAuC,CAAC,GACZ;EAC5B,MAAM,EAAE,MAAM,UAAU,KAAK,YAAY,OAAO,OAAO;EACvD,IAAI,CAAC,OACD,OAAO;EAKX,OAAO,MAFiB,kCAAkC,MAAM,MAAM,MAAM,KAExD,IAAI,QACpB,uBAAuB,KACvB,qBAAqB,MAAM,MAAM,CACrC;CACJ;;;;;;CASA,YACI,OACA,SACiD;EACjD,IAAI,OAAO,UAAU,UACjB,MAAM,kBAAkB,aAAa;EAGzC,KAAK,MAAM;EACX,KAAK,iBAAiB;EACtB,KAAK,SAAS,KAAK,SAAS,KAAK;EAKjC,IAAI;EACJ,IAAI,QAAQ,UAAU,QAAQ,QAC1B,QAAQ,gBAAgB,IAAI,KAAK,UAAU,UAAU,SAAS,QAAQ,QAAQ;GAC1E,WAAW,QAAQ;GACnB,gBAAgB;GAChB,QAAQ,QAAQ;EACpB,CAAC;EAGL,MAAM,OAAO,KAAK,sBAAsB,KAAK;EAC7C,IAAI,KAAK,KAAK,CAAC,CAAC,SAAA,OACZ,MAAM,kBAAkB,cAAc,qBAAqB,KAAK,KAAK,CAAC,CAAC,MAAM;EAGjF,OAAO;GAAE;GAAM;EAAM;CACzB;CAEA,kBACI,SACS;EACT,MAAM,QAAQ,gBAAgB,IAAI,KAAK,UAAU,UAAU,SAAS,QAAQ,QAAQ,EAAE,WAAW,QAAQ,UAAU,CAAC;EAEpH,OAAO,IAAI,QACP,uBAAuB,KACvB,qBAAqB,MAAM,MAAM,CACrC;CACJ;CAEA,SAAiB,MAAqC;EAClD,IACI,UAAU,MAAM,uBAAuB,GAAG,KAC1C,UAAU,MAAM,uBAAuB,EAAE,GAEzC,OAAO;EAGX,OAAO,IAAI,QAAQ,uBAAuB,KAAK,CAAC,IAAI,CAAC;CACzD;CAIA,OAA4B;EACxB,OAAO,KAAK,OAAO,KAAK,QAAQ,EAAE,MAAA,MAA0B;CAChE;CAEA,QAAgB,UAA8C;EAC1D,MAAM,QAAQ,KAAK,KAAK;EACxB,IAAI,YAAY,MAAM,SAAS,UAC3B,MAAM,kBAAkB,cAAc,YAAY,SAAS,QAAQ,MAAM,MAAM;EAEnF,KAAK;EACL,OAAO;CACX;CAEA,SAAiB,OAA8B;EAC3C,MAAM,SAAwB,CAAC;EAK/B,MAAM,QAAQ,IAAI,OAAO,sDAAsD,gCAAgC,GAAG;EAElH,IAAI;EACJ,IAAI,SAAS;EAEb,OAAQ,QAAQ,MAAM,KAAK,KAAK,GAAI;GAChC,IAAI,MAAM,UAAU,QAChB,MAAM,kBAAkB,cAAc,oCAAoC,OAAO,EAAE;GAGvF,MAAM,QAAQ,MAAM;GACpB,SAAS,MAAM;GACf,IAAI,QAAQ,KAAK,KAAK,GAAG;GAEzB,QAAQ,OAAR;IACI,KAAK;KAAK,OAAO,KAAK,EAAE,MAAA,SAA6B,CAAC;KAAG;IACzD,KAAK;KAAK,OAAO,KAAK,EAAE,MAAA,SAA6B,CAAC;KAAG;IACzD,KAAK;KAAK,OAAO,KAAK,EAAE,MAAA,QAA4B,CAAC;KAAG;IACxD,KAAK;KAAK,OAAO,KAAK,EAAE,MAAA,MAA0B,CAAC;KAAG;IACtD;KACI,IAAI,MAAM,WAAW,GAAG,GAAG;MACvB,IAAI,UAAU,QACV,MAAM,kBAAkB,cAAc,cAAc,MAAM,aAAa;MAG3E,OAAO,KAAK,EAAE,MAAA,SAA6B,CAAC;MAC5C;KACJ;KAIA,IAAI,OAAO,UAAU,eAAe,KAAK,4BAA4B,KAAK,GACtE,OAAO,KAAK,EAAE,MAAM,2BAA2B,OAAkD,CAAC;UAC/F,IACH,MAAM,WAAW,GAAI,KACrB,MAAM,SAAS,GAAI,GAEnB,OAAO,KAAK;MAAE,MAAA;MAAoC;KAAM,CAAC;UAEzD,OAAO,KAAK;MAAE,MAAA;MAA6B;KAAM,CAAC;GAE9D;EACJ;EAEA,IAAI,WAAW,MAAM,QACjB,MAAM,kBAAkB,cAAc,oCAAoC,OAAO,EAAE;EAGvF,OAAO,KAAK,EAAE,MAAA,MAA0B,CAAC;EACzC,OAAO;CACX;CAEA,sBACI,OACA,WAAoB,OACpB,QAAgB,GACC;EACjB,IAAI,QAAQ,WACR,MAAM,kBAAkB,cAAc,yCAAyC;EAGnF,MAAM,QAAQ,KAAK,KAAK;EACxB,QAAQ,MAAM,MAAd;GACI,KAAA,OACI,OAAO,KAAK,mBAAmB,OAAO,UAAU,KAAK;GACzD,KAAA;GACA,KAAA,MACI,OAAO,KAAK,uBAAuB,OAAO,UAAU,KAAK;GAC7D,KAAA;GACA,KAAA;GACA,KAAA;GACA,KAAA;GACA,KAAA,OACI,OAAO,KAAK,0BAA0B,OAAO,QAAQ;GACzD,KAAA;GACA,KAAA;GACA,KAAA,YACI,OAAO,KAAK,qBAAqB,OAAO,QAAQ;GACpD,KAAA;GACA,KAAA,OACI,OAAO,KAAK,kBAAkB,OAAO,QAAQ;GACjD,KAAA,aACI,OAAO,KAAK,yBAAyB,OAAO,UAAU,KAAK;GAC/D,KAAA,QACI,OAAO,KAAK,oBAAoB,OAAO,QAAQ;GACnD,SACI,MAAM,kBAAkB,cAAc,0CAA0C,MAAM,MAAM;EACpG;CACJ;CAEA,mBACI,OACA,WAAoB,OACpB,QAAgB,GACA;EAChB,KAAK,QAAA,KAA2B;EAChC,KAAK,QAAA,QAA8B;EACnC,MAAM,OAAO,KAAK,sBAAsB,OAAO,CAAC,UAAU,QAAQ,CAAC;EACnE,KAAK,QAAA,QAA8B;EAEnC,OAAO;CACX;CAEA,uBACI,OACA,WAAoB,OACpB,QAAgB,GACA;EAChB,IAAI,KAAK,KAAK,QAAQ,CAAC,CAAC;EACxB,IAAI,OAAA,SAA8B,OAAA,MAC9B,MAAM,kBAAkB,cAAc,gCAAgC;EAG1E,KAAK,QAAA,QAA8B;EACnC,MAAM,cAAoC,CAAC,KAAK,sBAAsB,OAAO,UAAU,QAAQ,CAAC,CAAC;EACjG,OAAO,KAAK,KAAK,CAAC,CAAC,SAAA,SAAgC;GAC/C,KAAK,QAAA,OAA6B;GAClC,YAAY,KAAK,KAAK,sBAAsB,OAAO,UAAU,QAAQ,CAAC,CAAC;EAC3E;EACA,KAAK,QAAA,QAA8B;EAEnC,IAAI,UACA,IAAI,OAAA,OACA,KAAA;OAEA,KAAA;EAIR,IAAI,OAAA,OACA,OAAO,IAAI,QACP,uBAAuB,KACvB,WACJ;EAGJ,OAAO,IAAI,QAAQ,uBAAuB,IAAI,WAAW;CAC7D;CAEA,0BACI,OACA,WAAoB,OACJ;EAChB,MAAM,KAAK,KAAK,QAAQ,CAAC,CAAC;EAC1B,KAAK,QAAA,QAA8B;EACnC,MAAM,OAAO,KAAK,0BAA0B,KAAK;EACjD,KAAK,QAAA,OAA6B;EAClC,MAAM,QAAQ,KAAK,qBAAqB;EACxC,KAAK,QAAA,QAA8B;EAEnC,QAAQ,IAAR;GACI,KAAA;IACI,IAAI,UACA,OAAO,IAAI,OACP,oBAAoB,WACpB,MACA,KACJ;IAGJ,OAAO,IAAI,OACP,oBAAoB,OACpB,MACA,KACJ;GAEJ,KAAA;IACI,IAAI,UACA,OAAO,IAAI,OACP,oBAAoB,iBACpB,MACA,KACJ;IAEJ,OAAO,IAAI,OACP,oBAAoB,cACpB,MACA,KACJ;GAEJ,KAAA;IACI,IAAI,UACA,OAAO,IAAI,OACP,oBAAoB,WACpB,MACA,KACJ;IAEJ,OAAO,IAAI,OACP,oBAAoB,oBACpB,MACA,KACJ;GAEJ,KAAA;IACI,IAAI,UACA,OAAO,IAAI,OACP,oBAAoB,oBACpB,MACA,KACJ;IAEJ,OAAO,IAAI,OACP,oBAAoB,WACpB,MACA,KACJ;GAEJ,KAAA;IACI,IAAI,UACA,OAAO,IAAI,OACP,oBAAoB,cACpB,MACA,KACJ;IAEJ,OAAO,IAAI,OACP,oBAAoB,iBACpB,MACA,KACJ;EAER;EAEA,MAAM,kBAAkB,cAAc,cAAc,GAAG,uCAAuC;CAClG;CAEA,qBACI,OACA,WAAoB,OACJ;EAChB,MAAM,KAAK,KAAK,QAAQ,CAAC,CAAC;EAC1B,KAAK,QAAA,QAA8B;EACnC,MAAM,QAAQ,KAAK,0BAA0B,KAAK;EAClD,KAAK,QAAA,OAA6B;EAClC,MAAM,OAAO,KAAK,QAAA,cAAoC,CAAC,CAAC;EACxD,KAAK,QAAA,QAA8B;EAEnC,MAAM,aAAa,KAAK,eAAe,IAAI;EAC3C,IAAI,OAAO,eAAe,UACtB,MAAM,kBAAkB,gBAAgB,KAAK;EAGjD,QAAQ,IAAR;GACI,KAAA,QACI,OAAO,IAAI,OACP,WACI,oBAAoB,eACpB,oBAAoB,UACxB,OACA,UACJ;GAEJ,KAAA,YACI,OAAO,IAAI,OACP,WACI,oBAAoB,gBACpB,oBAAoB,WACxB,OACA,UACJ;GAEJ,SACI,OAAO,IAAI,OACP,WACI,oBAAoB,kBACpB,oBAAoB,aACxB,OACA,UACJ;EAER;CACJ;CAEA,kBACI,OACA,WAAoB,OACJ;EAChB,MAAM,QAAQ,KAAK,KAAK;EACxB,IAAI,MAAM,SAAA,OACN,KAAK,QAAA,KAA2B;OAEhC,KAAK,QAAA,IAA0B;EAGnC,KAAK,QAAA,QAA8B;EAEnC,MAAM,QAAQ,KAAK,0BAA0B,KAAK;EAElD,MAAM,SAAoB,CAAC;EAC3B,OAAO,KAAK,KAAK,CAAC,CAAC,SAAA,SAAgC;GAC/C,KAAK,QAAA,OAA6B;GAElC,OAAO,KAAK,KAAK,qBAAqB,CAAC;EAC3C;EACA,KAAK,QAAA,QAA8B;EAKnC,IAHe,MAAM,SAAA,SAAgC,CAAC,YACjD,MAAM,SAAA,QAA+B,UAGtC,OAAO,IAAI,OACP,oBAAoB,QACpB,OACA,MACJ;EAGJ,OAAO,IAAI,OACP,oBAAoB,IACpB,OACA,MACJ;CACJ;;;;;;;CAQA,oBACI,OACA,WAAoB,OACd;EACN,IAAI,UACA,MAAM,kBAAkB,oBAAoB,MAAM;EAGtD,KAAK,QAAA,MAA4B;EACjC,KAAK,QAAA,QAA8B;EACnC,MAAM,QAAQ,KAAK,0BAA0B,KAAK;EAClD,KAAK,QAAA,OAA6B;EAClC,MAAM,QAAQ,KAAK,qBAAqB;EACxC,KAAK,QAAA,QAA8B;EAEnC,IACI,OAAO,UAAU,YACjB,CAAC,OAAO,UAAU,KAAK,KACvB,QAAQ,GAER,MAAM,kBAAkB,gBAAgB,KAAK;EAGjD,OAAO,IAAI,OAAO,oBAAoB,MAAM,OAAO,KAAK;CAC5D;;;;;;;CAQA,yBACI,OACA,WAAoB,OACpB,QAAgB,GACV;EACN,IAAI,UACA,MAAM,kBAAkB,oBAAoB,WAAW;EAG3D,KAAK,QAAA,WAAkC;EACvC,KAAK,QAAA,QAA8B;EAEnC,MAAM,SAAS,KAAK,qBAAqB,KAAK;EAE9C,KAAK,QAAA,OAA6B;EAElC,KAAK,kBAAkB;EAEvB,IAAI;EACJ,IAAI;GACA,YAAY,KAAK,sBAAsB,OAAO,OAAO,OAAO,QAAQ,CAAC;EACzE,UAAU;GACN,KAAK,kBAAkB;EAC3B;EAEA,KAAK,QAAA,QAA8B;EAEnC,OAAO,IAAI,OAAO,oBAAoB,YAAY,OAAO,OAAO,SAAS;CAC7E;;;;;;CAOA,qBACI,OACuC;EACvC,IAAI,KAAK,KAAK,CAAC,CAAC,SAAA,UAKZ,OAAO;GACH,OAHU,KAAK,0BAA0B,KAGrC;GACJ,OAAO,QAAQ,KAAK,kBAAkB,KAAK,IAAI,KAAA;EACnD;EAKJ,MAAM,QAAQ,CAFA,KAAK,QAAA,OAEA,CAAC,CAAC,KAAM;EAC3B,OAAO,KAAK,KAAK,CAAC,CAAC,SAAA,OAA8B;GAC7C,KAAK,QAAA,KAA2B;GAChC,MAAM,KAAK,KAAK,QAAA,OAA6B,CAAC,CAAC,KAAM;EACzD;EAEA,IAAI,CAAC,OACD,OAAO,EAAE,OAAO,MAAM,KAAK,GAAG,EAAE;EAKpC,IACI,MAAM,SAAS,MACd,MAAM,OAAO,cAAc,MAAM,OAAO,MAAM,OAAO,OAEtD,MAAM,MAAM;EAGhB,MAAM,WAAW,MAAM,WAAW,MAAM,KAAK,GAAG,CAAC;;EAGjD,IAAI,CAAC,SAAS,SACV,MAAM,kBAAkB,WAAW,SAAS,KAAK;EAGrD,MAAM,QAAQ,CAAC,GAAG,SAAS,MAAM,SAAS,IAAI,CAAC,CAAC,KAAK,GAAG;EAExD,IAAI;EACJ,IAAI;GACA,MAAM,UAAU,SAAS,MAAM,QAAQ,SAAS,IAAI;GACpD,IAAI,mBAAmB,iBACnB,WAAW;EAEnB,SAAS,GAAG;GAKR,IACI,EAAE,aAAa,eACf,EAAE,SAAS,UAAU,kBAErB,MAAM;EAEd;EAEA,OAAO;GACH;GACA,OAAO,YAAY,KAAK,kBAAkB,KAAK;EACnD;CACJ;CAEA,kBAA0B,SAAsC;EAC5D,OAAO,gBAAgB,IAAI,KAAK,UAAU,UAAU,SAAS,KAAA,GAAW;GACpE,gBAAgB;GAChB,QAAQ,QAAQ;EACpB,CAAC;CACL;CAEA,uBAAuC;EACnC,MAAM,QAAQ,KAAK,QAAQ;EAE3B,IACI,MAAM,SAAA,kBACN,MAAM,SAAA,QAEN,MAAM,kBAAkB,cAAc,8BAA8B,MAAM,MAAM;EAGpF,OAAO,KAAK,eAAe,MAAM,SAAS,MAAM;CACpD;CAEA,0BACI,OACM;EACN,IAAI,KAAK,KAAK,CAAC,CAAC,SAAA,UAAiC;GAC7C,KAAK,QAAA,QAA8B;GAInC,IAAI,KAAK,mBAAmB,GACxB,MAAM,kBAAkB,WAAW,MAAM;GAG7C,OAAO;EACX;EAEA,MAAM,QAAQ,KAAK,QAAA,OAA6B;EAChD,IAAI,MAAM,SAAA,SACN,MAAM,kBAAkB,cAAc,oCAAoC,MAAM,MAAM;EAG1F,MAAM,QAAQ,CAAC,MAAM,KAAM;EAE3B,OAAO,KAAK,KAAK,CAAC,CAAC,SAAA,OAA8B;GAC7C,KAAK,QAAA,KAA2B;GAChC,MAAM,KAAK,KAAK,QAAA,OAA6B,CAAC,CAAC,KAAM;EACzD;EAEA,IAAI,OAAO;GAIP,IACI,MAAM,SAAS,MACd,MAAM,OAAO,cAAc,MAAM,OAAO,MAAM,OAAO,OAEtD,MAAM,MAAM;GAGhB,MAAM,WAAW,MAAM,WAAW,MAAM,KAAK,GAAG,CAAC;;GAGjD,IAAI,CAAC,SAAS,SACV,MAAM,kBAAkB,WAAW,SAAS,KAAK;GAGrD,OAAO,CAAC,GAAG,SAAS,MAAM,SAAS,IAAI,CAAC,CAAC,KAAK,GAAG;EACrD;EAEA,OAAO,MAAM,KAAK,GAAG;CACzB;CAIA,eAAyB,OAAyB;EAC9C,IAAI,OAAO,UAAU,UAAU;GAC3B,MAAM,UAAU,MAAM,KAAK;GAC3B,IAAI,QAAQ,WAAW,GACnB,OAAO;GAKX,IACI,QAAQ,WAAW,GAAI,KACvB,QAAQ,SAAS,GAAI,KACrB,QAAQ,UAAU,GAElB,OAAO,kBAAkB,QAAQ,MAAM,GAAG,EAAE,CAAC,CAAC,QAAQ,OAAO,GAAI,CAAC;GAGtE,OAAO,kBAAkB,OAAO;EACpC;EAEA,IAAI,OAAO,UAAU,UACjB,OAAO;EAGX,IAAI,OAAO,UAAU,eAAe,UAAU,MAC1C,OAAO;EAGX,MAAM,IAAI,YAAY,8BAA8B;CACxD;AACJ;;;ACvvBA,IAAa,6BAAb,cAAgD,uBAAyD,CAEzG;;;ACHA,IAAa,4BAAb,cAA+C,sBAAsB,CAErE;;;ACFA,IAAa,uBAAb,cAA0C,iBAAiB,CAE3D;;;ACMA,IAAa,mBAAb,cAAsC,gBAAgB;CAClD;CAEA;CAEA;CAEA;CAEA;CAIA,YAAY,OAAwB;EAChC,MAAM,KAAK;EAEX,KAAK,eAAe,IAAI,uBAAuB,KAAK,QAAQ;EAC5D,KAAK,gBAAgB,IAAI,wBAAwB,KAAK,QAAQ;EAC9D,KAAK,mBAAmB,IAAI,2BAA2B,KAAK,QAAQ;EACpE,KAAK,kBAAkB,IAAI,0BAA0B,KAAK,QAAQ;EAClE,KAAK,aAAa,IAAI,qBAAqB,KAAK,QAAQ;CAC5D;AACJ"}
1
+ {"version":3,"file":"index.mjs","names":[],"sources":["../src/parameter/fields/module.ts","../src/parameter/filters/constants.ts","../src/parameter/filters/module.ts","../src/parameter/pagination/module.ts","../src/parameter/relations/module.ts","../src/parameter/sorts/module.ts","../src/module.ts"],"sourcesContent":["/*\n * Copyright (c) 2025-2025.\n * Author Peter Placzek (tada5hi)\n * For the full copyright and license information,\n * view the LICENSE file that was distributed with this source code.\n */\n\nimport { SimpleFieldsParser } from '@rapiq/parser-simple';\n\nexport class ExpressionFieldsParser extends SimpleFieldsParser {\n\n}\n","/*\n * Copyright (c) 2025-2026.\n * Author Peter Placzek (tada5hi)\n * For the full copyright and license information,\n * view the LICENSE file that was distributed with this source code.\n */\n\nexport enum FilterTokenType {\n NOT = 'NOT',\n\n AND = 'AND',\n OR = 'OR',\n\n EQUAL = 'eq',\n GREATER_THAN = 'gt',\n GREATER_OR_EQUAL = 'gte',\n LESS_THAN = 'lt',\n LESS_OR_EQUAL = 'lte',\n CONTAINS = 'like',\n STARTS_WITH = 'startsWith',\n ENDS_WITH = 'endsWith',\n IN = 'in',\n NIN = 'nin',\n ELEM_MATCH = 'elemMatch',\n SIZE = 'size',\n\n FIELD = 'FIELD',\n ITSELF = 'ITSELF',\n ESCAPED_TEXT = 'ESCAPED_TEXT',\n NULL = 'NULL',\n LPAREN = 'LPAREN',\n RPAREN = 'RPAREN',\n COMMA = 'COMMA',\n DOT = 'DOT',\n EOF = 'EOF',\n}\n\n/**\n * Grammar keywords of the expression dialect mapped to the token\n * they classify as. The tokenizer classifies whole identifiers\n * against this map; encoders consume its keys to reject field\n * segments that would tokenize as an operator on decode.\n */\nexport const FILTER_EXPRESSION_KEYWORDS = {\n not: FilterTokenType.NOT,\n and: FilterTokenType.AND,\n or: FilterTokenType.OR,\n eq: FilterTokenType.EQUAL,\n gt: FilterTokenType.GREATER_THAN,\n gte: FilterTokenType.GREATER_OR_EQUAL,\n lt: FilterTokenType.LESS_THAN,\n lte: FilterTokenType.LESS_OR_EQUAL,\n contains: FilterTokenType.CONTAINS,\n startsWith: FilterTokenType.STARTS_WITH,\n endsWith: FilterTokenType.ENDS_WITH,\n in: FilterTokenType.IN,\n nin: FilterTokenType.NIN,\n elemMatch: FilterTokenType.ELEM_MATCH,\n size: FilterTokenType.SIZE,\n null: FilterTokenType.NULL,\n} as const satisfies Record<string, FilterTokenType>;\n\n/**\n * Identifier grammar of a single field segment as accepted by the\n * expression tokenizer (unanchored regex source; consumers anchor\n * it as needed).\n */\nexport const FILTER_FIELD_SEGMENT_PATTERN = '[A-Za-z0-9_](?:[A-Za-z0-9_-]*[A-Za-z0-9_])?';\n","/*\n * Copyright (c) 2021-2025.\n * Author Peter Placzek (tada5hi)\n * For the full copyright and license information,\n * view the LICENSE file that was distributed with this source code.\n */\n\nimport type {\n FiltersParseOptions,\n IFilter,\n IFilters,\n ObjectLiteral,\n Scalar,\n} from '@rapiq/core';\nimport {\n BaseParser,\n DEFAULT_ID,\n ErrorCode,\n Filter,\n FilterCompoundOperator,\n FilterFieldOperator,\n Filters,\n FiltersParseError,\n ITSELF,\n MAX_TRAVERSAL_DEPTH,\n Parameter,\n ParseError,\n ResolutionScope,\n applyFiltersSchemaValidation,\n applyFiltersSchemaValidationAsync,\n buildFiltersDefaults,\n isFilters,\n} from '@rapiq/core';\nimport { parseFilterScalar } from '@rapiq/parser-simple';\nimport {\n FILTER_EXPRESSION_KEYWORDS,\n FILTER_FIELD_SEGMENT_PATTERN,\n FilterTokenType,\n} from './constants';\nimport type { FilterToken } from './types';\n\ntype FiltersScope = ResolutionScope<`${Parameter.FILTERS}`>;\n\n/**\n * Keep recursive expression parsing below the JavaScript call-stack limit and\n * aligned with the schema resolver and Mongo parser traversal caps.\n */\nconst MAX_DEPTH = MAX_TRAVERSAL_DEPTH;\n\n/**\n * @see https://www.jsonapi.net/usage/reading/filtering.html\n */\nexport class ExpressionFiltersParser extends BaseParser<\n FiltersParseOptions,\n IFilters\n> {\n private tokens: FilterToken[] = [];\n\n private pos = 0;\n\n /**\n * How many elemMatch interiors the parser is currently inside —\n * the ITSELF marker is only legal at depth > 0.\n */\n private elemMatchDepth = 0;\n\n // ---------------------------------------------------------\n\n parse<RECORD extends ObjectLiteral = ObjectLiteral>(\n input: unknown,\n options: FiltersParseOptions<RECORD> = {},\n ) : IFilters {\n // absent input is not a failure — schema defaults still apply.\n // an empty string is NOT absent: the dialect is precise, so\n // input like `?filter=` must surface a syntax error.\n if (input === undefined || input === null) {\n return this.buildAbsentOutput(options);\n }\n\n return this.wrapRoot(this.parseExact(input, options));\n }\n\n override async parseAsync<RECORD extends ObjectLiteral = ObjectLiteral>(\n input: unknown,\n options: FiltersParseOptions<RECORD> = {},\n ) : Promise<IFilters> {\n if (input === undefined || input === null) {\n return this.buildAbsentOutput(options);\n }\n\n return this.wrapRoot(await this.parseExactAsync(input, options));\n }\n\n parseExact<RECORD extends ObjectLiteral = ObjectLiteral>(\n input: unknown,\n options: FiltersParseOptions<RECORD> = {},\n ) : IFilters | IFilter {\n const { expr, scope } = this.parseSource(input, options);\n if (!scope) {\n return expr;\n }\n\n const validated = applyFiltersSchemaValidation(expr, scope.schema, options.context);\n\n return validated ?? new Filters(\n FilterCompoundOperator.AND,\n buildFiltersDefaults(scope.schema),\n );\n }\n\n async parseExactAsync<RECORD extends ObjectLiteral = ObjectLiteral>(\n input: unknown,\n options: FiltersParseOptions<RECORD> = {},\n ) : Promise<IFilters | IFilter> {\n const { expr, scope } = this.parseSource(input, options);\n if (!scope) {\n return expr;\n }\n\n const validated = await applyFiltersSchemaValidationAsync(expr, scope.schema, options.context);\n\n return validated ?? new Filters(\n FilterCompoundOperator.AND,\n buildFiltersDefaults(scope.schema),\n );\n }\n\n // ---------------------------------------------------------\n\n /**\n * The shared front-end of {@link parseExact} and\n * {@link parseExactAsync}: tokenize, bind the resolution scope and\n * run the grammar — everything up to (but excluding) validation.\n */\n private parseSource<RECORD extends ObjectLiteral = ObjectLiteral>(\n input: unknown,\n options: FiltersParseOptions<RECORD>,\n ) : { expr: Filters | Filter, scope?: FiltersScope } {\n if (typeof input !== 'string') {\n throw FiltersParseError.inputInvalid();\n }\n\n this.pos = 0;\n this.elemMatchDepth = 0;\n this.tokens = this.tokenize(input);\n\n // expressions are precise — invalid keys always throw,\n // but only when a schema (or the strict override,\n // which rejects undeclared keys) constrains the parse.\n let scope : FiltersScope | undefined;\n if (options.schema || options.strict) {\n scope = ResolutionScope.for(this.registry, Parameter.FILTERS, options.schema, {\n relations: options.relations,\n throwOnFailure: true,\n strict: options.strict,\n }) as FiltersScope;\n }\n\n const expr = this.parseFilterExpression(scope);\n if (this.peek().type !== FilterTokenType.EOF) {\n throw FiltersParseError.syntaxInvalid(`Unexpected token: ${this.peek().type}`);\n }\n\n return { expr, scope };\n }\n\n private buildAbsentOutput<RECORD extends ObjectLiteral = ObjectLiteral>(\n options: FiltersParseOptions<RECORD>,\n ) : IFilters {\n const scope = ResolutionScope.for(this.registry, Parameter.FILTERS, options.schema, { relations: options.relations }) as FiltersScope;\n\n return new Filters(\n FilterCompoundOperator.AND,\n buildFiltersDefaults(scope.schema),\n );\n }\n\n private wrapRoot(expr: IFilters | IFilter) : IFilters {\n if (\n isFilters(expr, FilterCompoundOperator.AND) ||\n isFilters(expr, FilterCompoundOperator.OR)\n ) {\n return expr;\n }\n\n return new Filters(FilterCompoundOperator.AND, [expr]);\n }\n\n // ---------------------------------------------------------\n\n private peek(): FilterToken {\n return this.tokens[this.pos] || { type: FilterTokenType.EOF };\n }\n\n private consume(expected?: `${FilterTokenType}`): FilterToken {\n const token = this.peek();\n if (expected && token.type !== expected) {\n throw FiltersParseError.syntaxInvalid(`Expected ${expected}, got ${token.type}`);\n }\n this.pos++;\n return token;\n }\n\n private tokenize(input: string): FilterToken[] {\n const tokens: FilterToken[] = [];\n // keywords are classified from whole identifiers (lookup below) —\n // matching them in the regex would split identifiers that merely\n // start with a keyword (e.g. \"order\" -> \"or\" + \"der\").\n // $-words are reserved markers, never field segments.\n const regex = new RegExp(`\\\\s+|\\\\(|\\\\)|,|\\\\.|'(?:''|[^'])*'|\\\\$[A-Za-z0-9_]*|${FILTER_FIELD_SEGMENT_PATTERN}`, 'g');\n\n let match: RegExpExecArray | null;\n let cursor = 0;\n\n while ((match = regex.exec(input))) {\n if (match.index !== cursor) {\n throw FiltersParseError.syntaxInvalid(`Unexpected character at position ${cursor}.`);\n }\n\n const value = match[0];\n cursor = regex.lastIndex;\n if (/^\\s+$/.test(value)) continue;\n\n switch (value) {\n case '(': tokens.push({ type: FilterTokenType.LPAREN }); break;\n case ')': tokens.push({ type: FilterTokenType.RPAREN }); break;\n case ',': tokens.push({ type: FilterTokenType.COMMA }); break;\n case '.': tokens.push({ type: FilterTokenType.DOT }); break;\n default:\n if (value.startsWith('$')) {\n if (value !== ITSELF) {\n throw FiltersParseError.syntaxInvalid(`The marker ${value} is unknown.`);\n }\n\n tokens.push({ type: FilterTokenType.ITSELF });\n break;\n }\n\n // own-property check: exotic field names inherited from\n // Object.prototype (toString, constructor, ...) stay fields.\n if (Object.prototype.hasOwnProperty.call(FILTER_EXPRESSION_KEYWORDS, value)) {\n tokens.push({ type: FILTER_EXPRESSION_KEYWORDS[value as keyof typeof FILTER_EXPRESSION_KEYWORDS] });\n } else if (\n value.startsWith('\\'') &&\n value.endsWith('\\'')\n ) {\n tokens.push({ type: FilterTokenType.ESCAPED_TEXT, value });\n } else {\n tokens.push({ type: FilterTokenType.FIELD, value });\n }\n }\n }\n\n if (cursor !== input.length) {\n throw FiltersParseError.syntaxInvalid(`Unexpected character at position ${cursor}.`);\n }\n\n tokens.push({ type: FilterTokenType.EOF });\n return tokens;\n }\n\n private parseFilterExpression(\n scope?: FiltersScope,\n negation: boolean = false,\n depth: number = 0,\n ) : Filters | Filter {\n if (depth > MAX_DEPTH) {\n throw FiltersParseError.syntaxInvalid('The maximum nesting depth was exceeded.');\n }\n\n const token = this.peek();\n switch (token.type) {\n case FilterTokenType.NOT:\n return this.parseNotExpression(scope, negation, depth);\n case FilterTokenType.AND:\n case FilterTokenType.OR:\n return this.parseLogicalExpression(scope, negation, depth);\n case FilterTokenType.EQUAL:\n case FilterTokenType.GREATER_THAN:\n case FilterTokenType.GREATER_OR_EQUAL:\n case FilterTokenType.LESS_THAN:\n case FilterTokenType.LESS_OR_EQUAL:\n return this.parseComparisonExpression(scope, negation);\n case FilterTokenType.CONTAINS:\n case FilterTokenType.STARTS_WITH:\n case FilterTokenType.ENDS_WITH:\n return this.parseMatchExpression(scope, negation);\n case FilterTokenType.IN:\n case FilterTokenType.NIN:\n return this.parseInExpression(scope, negation);\n case FilterTokenType.ELEM_MATCH:\n return this.parseElemMatchExpression(scope, negation, depth);\n case FilterTokenType.SIZE:\n return this.parseSizeExpression(scope, negation);\n default:\n throw FiltersParseError.syntaxInvalid(`Unexpected token in filter expression: ${token.type}`);\n }\n }\n\n private parseNotExpression(\n scope?: FiltersScope,\n negation: boolean = false,\n depth: number = 0,\n ): Filters | Filter {\n this.consume(FilterTokenType.NOT);\n this.consume(FilterTokenType.LPAREN);\n const expr = this.parseFilterExpression(scope, !negation, depth + 1);\n this.consume(FilterTokenType.RPAREN);\n\n return expr;\n }\n\n private parseLogicalExpression(\n scope?: FiltersScope,\n negation: boolean = false,\n depth: number = 0,\n ): Filters | Filter {\n let op = this.consume().type; // AND / OR\n if (op !== FilterTokenType.AND && op !== FilterTokenType.OR) {\n throw FiltersParseError.syntaxInvalid('Expected AND or OR token type.');\n }\n\n this.consume(FilterTokenType.LPAREN);\n const expressions: (Filter | Filters)[] = [this.parseFilterExpression(scope, negation, depth + 1)];\n while (this.peek().type === FilterTokenType.COMMA) {\n this.consume(FilterTokenType.COMMA);\n expressions.push(this.parseFilterExpression(scope, negation, depth + 1));\n }\n this.consume(FilterTokenType.RPAREN);\n\n if (negation) {\n if (op === FilterTokenType.AND) {\n op = FilterTokenType.OR;\n } else {\n op = FilterTokenType.AND;\n }\n }\n\n if (op === FilterTokenType.AND) {\n return new Filters(\n FilterCompoundOperator.AND,\n expressions,\n );\n }\n\n return new Filters(FilterCompoundOperator.OR, expressions);\n }\n\n private parseComparisonExpression(\n scope?: FiltersScope,\n negation: boolean = false,\n ): Filters | Filter {\n const op = this.consume().type;\n this.consume(FilterTokenType.LPAREN);\n const left = this.parseExpressionFieldChain(scope);\n this.consume(FilterTokenType.COMMA);\n const right = this.parseExpressionValue();\n this.consume(FilterTokenType.RPAREN);\n\n switch (op) {\n case FilterTokenType.EQUAL: {\n if (negation) {\n return new Filter(\n FilterFieldOperator.NOT_EQUAL,\n left as string,\n right as string,\n );\n }\n\n return new Filter(\n FilterFieldOperator.EQUAL,\n left as string,\n right as string,\n );\n }\n case FilterTokenType.GREATER_THAN: {\n if (negation) {\n return new Filter(\n FilterFieldOperator.LESS_THAN_EQUAL,\n left as string,\n right as string,\n );\n }\n return new Filter(\n FilterFieldOperator.GREATER_THAN,\n left as string,\n right as string,\n );\n }\n case FilterTokenType.GREATER_OR_EQUAL: {\n if (negation) {\n return new Filter(\n FilterFieldOperator.LESS_THAN,\n left as string,\n right as string,\n );\n }\n return new Filter(\n FilterFieldOperator.GREATER_THAN_EQUAL,\n left as string,\n right as string,\n );\n }\n case FilterTokenType.LESS_THAN: {\n if (negation) {\n return new Filter(\n FilterFieldOperator.GREATER_THAN_EQUAL,\n left as string,\n right as string,\n );\n }\n return new Filter(\n FilterFieldOperator.LESS_THAN,\n left as string,\n right as string,\n );\n }\n case FilterTokenType.LESS_OR_EQUAL: {\n if (negation) {\n return new Filter(\n FilterFieldOperator.GREATER_THAN,\n left as string,\n right as string,\n );\n }\n return new Filter(\n FilterFieldOperator.LESS_THAN_EQUAL,\n left as string,\n right as string,\n );\n }\n }\n\n throw FiltersParseError.syntaxInvalid(`Token type ${op} not supported as comparison operator.`);\n }\n\n private parseMatchExpression(\n scope?: FiltersScope,\n negation: boolean = false,\n ): Filters | Filter {\n const op = this.consume().type;\n this.consume(FilterTokenType.LPAREN);\n const field = this.parseExpressionFieldChain(scope);\n this.consume(FilterTokenType.COMMA);\n const text = this.consume(FilterTokenType.ESCAPED_TEXT).value!;\n this.consume(FilterTokenType.RPAREN);\n\n const normalized = this.normalizeValue(text);\n if (typeof normalized !== 'string') {\n throw FiltersParseError.keyValueInvalid(field);\n }\n\n switch (op) {\n case FilterTokenType.CONTAINS: {\n return new Filter(\n negation ?\n FilterFieldOperator.NOT_CONTAINS :\n FilterFieldOperator.CONTAINS,\n field,\n normalized,\n );\n }\n case FilterTokenType.ENDS_WITH: {\n return new Filter(\n negation ?\n FilterFieldOperator.NOT_ENDS_WITH :\n FilterFieldOperator.ENDS_WITH,\n field,\n normalized,\n );\n }\n default: {\n return new Filter(\n negation ?\n FilterFieldOperator.NOT_STARTS_WITH :\n FilterFieldOperator.STARTS_WITH,\n field,\n normalized,\n );\n }\n }\n }\n\n private parseInExpression(\n scope?: FiltersScope,\n negation: boolean = false,\n ): Filters | Filter {\n const token = this.peek();\n if (token.type === FilterTokenType.NIN) {\n this.consume(FilterTokenType.NIN);\n } else {\n this.consume(FilterTokenType.IN);\n }\n\n this.consume(FilterTokenType.LPAREN);\n\n const field = this.parseExpressionFieldChain(scope);\n\n const values: unknown[] = [];\n while (this.peek().type === FilterTokenType.COMMA) {\n this.consume(FilterTokenType.COMMA);\n\n values.push(this.parseExpressionValue());\n }\n this.consume(FilterTokenType.RPAREN);\n\n const notIn = (token.type === FilterTokenType.NIN && !negation) ||\n (token.type === FilterTokenType.IN && negation);\n\n if (notIn) {\n return new Filter(\n FilterFieldOperator.NOT_IN,\n field,\n values,\n );\n }\n\n return new Filter(\n FilterFieldOperator.IN,\n field,\n values,\n );\n }\n\n /**\n * size(field, n): the field holds an array of exactly n elements\n * (a non-negative integer — the wire is untyped, so the quoted\n * value coerces back to a number). There is no complement — a\n * negated size would silently widen and always throws.\n */\n private parseSizeExpression(\n scope?: FiltersScope,\n negation: boolean = false,\n ): Filter {\n if (negation) {\n throw FiltersParseError.operatorUnsupported('size');\n }\n\n this.consume(FilterTokenType.SIZE);\n this.consume(FilterTokenType.LPAREN);\n const field = this.parseExpressionFieldChain(scope);\n this.consume(FilterTokenType.COMMA);\n const value = this.parseExpressionValue();\n this.consume(FilterTokenType.RPAREN);\n\n if (\n typeof value !== 'number' ||\n !Number.isInteger(value) ||\n value < 0\n ) {\n throw FiltersParseError.keyValueInvalid(field);\n }\n\n return new Filter(FilterFieldOperator.SIZE, field, value);\n }\n\n /**\n * elemMatch(field, expr): field paths inside the interior are\n * relative to the array element; the ITSELF marker addresses the\n * element itself. There is no complement — a negated elemMatch\n * would silently widen and always throws.\n */\n private parseElemMatchExpression(\n scope?: FiltersScope,\n negation: boolean = false,\n depth: number = 0,\n ): Filter {\n if (negation) {\n throw FiltersParseError.operatorUnsupported('elemMatch');\n }\n\n this.consume(FilterTokenType.ELEM_MATCH);\n this.consume(FilterTokenType.LPAREN);\n\n const target = this.parseElemMatchTarget(scope);\n\n this.consume(FilterTokenType.COMMA);\n\n this.elemMatchDepth += 1;\n\n let condition : Filters | Filter;\n try {\n condition = this.parseFilterExpression(target.scope, false, depth + 1);\n } finally {\n this.elemMatchDepth -= 1;\n }\n\n this.consume(FilterTokenType.RPAREN);\n\n return new Filter(FilterFieldOperator.ELEM_MATCH, target.field, condition);\n }\n\n /**\n * The field an elemMatch binds plus the interior resolution scope:\n * the related schema when resolvable, otherwise an unbound scope\n * inheriting the current policy (e.g. a JSON array column).\n */\n private parseElemMatchTarget(\n scope?: FiltersScope,\n ): { field: string, scope?: FiltersScope } {\n if (this.peek().type === FilterTokenType.ITSELF) {\n // an elemMatch on the element itself (arrays of arrays);\n // the chain parser enforces the interior-only contract.\n const field = this.parseExpressionFieldChain(scope);\n\n return {\n field,\n scope: scope ? this.buildUnboundScope(scope) : undefined,\n };\n }\n\n const token = this.consume(FilterTokenType.FIELD);\n\n const parts = [token.value!];\n while (this.peek().type === FilterTokenType.DOT) {\n this.consume(FilterTokenType.DOT);\n parts.push(this.consume(FilterTokenType.FIELD).value!);\n }\n\n if (!scope) {\n return { field: parts.join('.') };\n }\n\n // a leading segment matching the schema name addresses the\n // schema itself (mirrors parseExpressionFieldChain).\n if (\n parts.length > 1 &&\n (parts[0] === DEFAULT_ID || parts[0] === scope.schema.name)\n ) {\n parts.shift();\n }\n\n const resolved = scope.resolveKey(parts.join('.'));\n\n /* istanbul ignore next -- the scope always throws */\n if (!resolved.success) {\n throw FiltersParseError.keyInvalid(resolved.input);\n }\n\n const field = [...resolved.path, resolved.name].join('.');\n\n let interior : FiltersScope | undefined;\n try {\n const verdict = resolved.scope.descend(resolved.name);\n if (verdict instanceof ResolutionScope) {\n interior = verdict as FiltersScope;\n }\n } catch (e) {\n // elemMatch on a non-relation field is legal — a missing\n // related schema (thrown as keyPathInvalid, the scope is\n // always throwing) falls back to the unbound scope; every\n // other failure (e.g. relations gating) propagates.\n if (\n !(e instanceof ParseError) ||\n e.code !== ErrorCode.KEY_PATH_INVALID\n ) {\n throw e;\n }\n }\n\n return {\n field,\n scope: interior ?? this.buildUnboundScope(scope),\n };\n }\n\n private buildUnboundScope(current: FiltersScope) : FiltersScope {\n return ResolutionScope.for(this.registry, Parameter.FILTERS, undefined, {\n throwOnFailure: true,\n strict: current.strict,\n }) as FiltersScope;\n }\n\n private parseExpressionValue(): Scalar {\n const token = this.consume();\n\n if (\n token.type !== FilterTokenType.ESCAPED_TEXT &&\n token.type !== FilterTokenType.NULL\n ) {\n throw FiltersParseError.syntaxInvalid(`Unexpected token in value: ${token.type}`);\n }\n\n return this.normalizeValue(token.value ?? 'null');\n }\n\n private parseExpressionFieldChain(\n scope?: FiltersScope,\n ): string {\n if (this.peek().type === FilterTokenType.ITSELF) {\n this.consume(FilterTokenType.ITSELF);\n\n // the marker addresses the element bound by the enclosing\n // elemMatch interior and never resolves against the schema.\n if (this.elemMatchDepth === 0) {\n throw FiltersParseError.keyInvalid(ITSELF);\n }\n\n return ITSELF;\n }\n\n const token = this.consume(FilterTokenType.FIELD);\n if (token.type !== FilterTokenType.FIELD) {\n throw FiltersParseError.syntaxInvalid(`Unexpected token in field chain: ${token.type}`);\n }\n\n const parts = [token.value!];\n\n while (this.peek().type === FilterTokenType.DOT) {\n this.consume(FilterTokenType.DOT);\n parts.push(this.consume(FilterTokenType.FIELD).value!);\n }\n\n if (scope) {\n // a leading segment matching the schema name addresses the\n // schema itself (mirrors the named-group hoisting of the\n // simple filters parser) and is stripped.\n if (\n parts.length > 1 &&\n (parts[0] === DEFAULT_ID || parts[0] === scope.schema.name)\n ) {\n parts.shift();\n }\n\n const resolved = scope.resolveKey(parts.join('.'));\n\n /* istanbul ignore next -- the scope always throws */\n if (!resolved.success) {\n throw FiltersParseError.keyInvalid(resolved.input);\n }\n\n return [...resolved.path, resolved.name].join('.');\n }\n\n return parts.join('.');\n }\n\n // ---------------------------------------------------------\n\n protected normalizeValue(input: unknown) : Scalar {\n if (typeof input === 'string') {\n const trimmed = input.trim();\n if (trimmed.length === 0) {\n return trimmed;\n }\n\n // quoted content is coerced but never comma-split —\n // the expression dialect passes lists as separate args.\n if (\n trimmed.startsWith('\\'') &&\n trimmed.endsWith('\\'') &&\n trimmed.length >= 2\n ) {\n return parseFilterScalar(trimmed.slice(1, -1).replace(/''/g, '\\''));\n }\n\n return parseFilterScalar(trimmed);\n }\n\n if (typeof input === 'number') {\n return input;\n }\n\n if (typeof input === 'undefined' || input === null) {\n return null;\n }\n\n throw new SyntaxError('Value can not be normalized.');\n }\n}\n","/*\n * Copyright (c) 2022-2025.\n * Author Peter Placzek (tada5hi)\n * For the full copyright and license information,\n * view the LICENSE file that was distributed with this source code.\n */\n\nimport { SimplePaginationParser } from '@rapiq/parser-simple';\nimport type { ExpressionPaginationParseOptions } from './types';\n\nexport class ExpressionPaginationParser extends SimplePaginationParser<ExpressionPaginationParseOptions> {\n\n}\n","/*\n * Copyright (c) 2021-2025.\n * Author Peter Placzek (tada5hi)\n * For the full copyright and license information,\n * view the LICENSE file that was distributed with this source code.\n */\n\nimport { SimpleRelationsParser } from '@rapiq/parser-simple';\n\nexport class ExpressionRelationsParser extends SimpleRelationsParser {\n\n}\n","/*\n * Copyright (c) 2021-2025.\n * Author Peter Placzek (tada5hi)\n * For the full copyright and license information,\n * view the LICENSE file that was distributed with this source code.\n */\n\nimport { SimpleSortParser } from '@rapiq/parser-simple';\n\nexport class ExpressionSortParser extends SimpleSortParser {\n\n}\n","/*\n * Copyright (c) 2025.\n * Author Peter Placzek (tada5hi)\n * For the full copyright and license information,\n * view the LICENSE file that was distributed with this source code.\n */\n\nimport type { SchemaRegistry } from '@rapiq/core';\nimport { BaseQueryParser } from '@rapiq/core';\nimport {\n ExpressionFieldsParser,\n ExpressionFiltersParser,\n ExpressionPaginationParser,\n ExpressionRelationsParser,\n ExpressionSortParser,\n} from './parameter';\n\nexport class ExpressionParser extends BaseQueryParser {\n protected fieldsParser : ExpressionFieldsParser;\n\n protected filtersParser : ExpressionFiltersParser;\n\n protected paginationParser : ExpressionPaginationParser;\n\n protected relationsParser : ExpressionRelationsParser;\n\n protected sortParser : ExpressionSortParser;\n\n // -----------------------------------------------------\n\n constructor(input?: SchemaRegistry) {\n super(input);\n\n this.fieldsParser = new ExpressionFieldsParser(this.registry);\n this.filtersParser = new ExpressionFiltersParser(this.registry);\n this.paginationParser = new ExpressionPaginationParser(this.registry);\n this.relationsParser = new ExpressionRelationsParser(this.registry);\n this.sortParser = new ExpressionSortParser(this.registry);\n }\n}\n"],"mappings":";;;AASA,IAAa,yBAAb,cAA4C,mBAAmB,CAE/D;;;ACJA,IAAY,kBAAL,yBAAA,iBAAA;CACH,gBAAA,SAAA;CAEA,gBAAA,SAAA;CACA,gBAAA,QAAA;CAEA,gBAAA,WAAA;CACA,gBAAA,kBAAA;CACA,gBAAA,sBAAA;CACA,gBAAA,eAAA;CACA,gBAAA,mBAAA;CACA,gBAAA,cAAA;CACA,gBAAA,iBAAA;CACA,gBAAA,eAAA;CACA,gBAAA,QAAA;CACA,gBAAA,SAAA;CACA,gBAAA,gBAAA;CACA,gBAAA,UAAA;CAEA,gBAAA,WAAA;CACA,gBAAA,YAAA;CACA,gBAAA,kBAAA;CACA,gBAAA,UAAA;CACA,gBAAA,YAAA;CACA,gBAAA,YAAA;CACA,gBAAA,WAAA;CACA,gBAAA,SAAA;CACA,gBAAA,SAAA;;AACJ,EAAA,CAAA,CAAA;;;;;;;AAQA,MAAa,6BAA6B;CACtC,KAAA;CACA,KAAA;CACA,IAAA;CACA,IAAA;CACA,IAAA;CACA,KAAA;CACA,IAAA;CACA,KAAA;CACA,UAAA;CACA,YAAA;CACA,UAAA;CACA,IAAA;CACA,KAAA;CACA,WAAA;CACA,MAAA;CACA,MAAA;AACJ;;;;;;AAOA,MAAa,+BAA+B;;;;;;;ACpB5C,MAAM,YAAY;;;;AAKlB,IAAa,0BAAb,cAA6C,WAG3C;CACE,SAAgC,CAAC;CAEjC,MAAc;;;;;CAMd,iBAAyB;CAIzB,MACI,OACA,UAAuC,CAAC,GAC/B;EAIT,IAAI,UAAU,KAAA,KAAa,UAAU,MACjC,OAAO,KAAK,kBAAkB,OAAO;EAGzC,OAAO,KAAK,SAAS,KAAK,WAAW,OAAO,OAAO,CAAC;CACxD;CAEA,MAAe,WACX,OACA,UAAuC,CAAC,GACtB;EAClB,IAAI,UAAU,KAAA,KAAa,UAAU,MACjC,OAAO,KAAK,kBAAkB,OAAO;EAGzC,OAAO,KAAK,SAAS,MAAM,KAAK,gBAAgB,OAAO,OAAO,CAAC;CACnE;CAEA,WACI,OACA,UAAuC,CAAC,GACrB;EACnB,MAAM,EAAE,MAAM,UAAU,KAAK,YAAY,OAAO,OAAO;EACvD,IAAI,CAAC,OACD,OAAO;EAKX,OAFkB,6BAA6B,MAAM,MAAM,QAAQ,QAAQ,OAE5D,KAAK,IAAI,QACpB,uBAAuB,KACvB,qBAAqB,MAAM,MAAM,CACrC;CACJ;CAEA,MAAM,gBACF,OACA,UAAuC,CAAC,GACZ;EAC5B,MAAM,EAAE,MAAM,UAAU,KAAK,YAAY,OAAO,OAAO;EACvD,IAAI,CAAC,OACD,OAAO;EAKX,OAAO,MAFiB,kCAAkC,MAAM,MAAM,QAAQ,QAAQ,OAAO,KAEzE,IAAI,QACpB,uBAAuB,KACvB,qBAAqB,MAAM,MAAM,CACrC;CACJ;;;;;;CASA,YACI,OACA,SACiD;EACjD,IAAI,OAAO,UAAU,UACjB,MAAM,kBAAkB,aAAa;EAGzC,KAAK,MAAM;EACX,KAAK,iBAAiB;EACtB,KAAK,SAAS,KAAK,SAAS,KAAK;EAKjC,IAAI;EACJ,IAAI,QAAQ,UAAU,QAAQ,QAC1B,QAAQ,gBAAgB,IAAI,KAAK,UAAU,UAAU,SAAS,QAAQ,QAAQ;GAC1E,WAAW,QAAQ;GACnB,gBAAgB;GAChB,QAAQ,QAAQ;EACpB,CAAC;EAGL,MAAM,OAAO,KAAK,sBAAsB,KAAK;EAC7C,IAAI,KAAK,KAAK,CAAC,CAAC,SAAA,OACZ,MAAM,kBAAkB,cAAc,qBAAqB,KAAK,KAAK,CAAC,CAAC,MAAM;EAGjF,OAAO;GAAE;GAAM;EAAM;CACzB;CAEA,kBACI,SACS;EACT,MAAM,QAAQ,gBAAgB,IAAI,KAAK,UAAU,UAAU,SAAS,QAAQ,QAAQ,EAAE,WAAW,QAAQ,UAAU,CAAC;EAEpH,OAAO,IAAI,QACP,uBAAuB,KACvB,qBAAqB,MAAM,MAAM,CACrC;CACJ;CAEA,SAAiB,MAAqC;EAClD,IACI,UAAU,MAAM,uBAAuB,GAAG,KAC1C,UAAU,MAAM,uBAAuB,EAAE,GAEzC,OAAO;EAGX,OAAO,IAAI,QAAQ,uBAAuB,KAAK,CAAC,IAAI,CAAC;CACzD;CAIA,OAA4B;EACxB,OAAO,KAAK,OAAO,KAAK,QAAQ,EAAE,MAAA,MAA0B;CAChE;CAEA,QAAgB,UAA8C;EAC1D,MAAM,QAAQ,KAAK,KAAK;EACxB,IAAI,YAAY,MAAM,SAAS,UAC3B,MAAM,kBAAkB,cAAc,YAAY,SAAS,QAAQ,MAAM,MAAM;EAEnF,KAAK;EACL,OAAO;CACX;CAEA,SAAiB,OAA8B;EAC3C,MAAM,SAAwB,CAAC;EAK/B,MAAM,QAAQ,IAAI,OAAO,sDAAsD,gCAAgC,GAAG;EAElH,IAAI;EACJ,IAAI,SAAS;EAEb,OAAQ,QAAQ,MAAM,KAAK,KAAK,GAAI;GAChC,IAAI,MAAM,UAAU,QAChB,MAAM,kBAAkB,cAAc,oCAAoC,OAAO,EAAE;GAGvF,MAAM,QAAQ,MAAM;GACpB,SAAS,MAAM;GACf,IAAI,QAAQ,KAAK,KAAK,GAAG;GAEzB,QAAQ,OAAR;IACI,KAAK;KAAK,OAAO,KAAK,EAAE,MAAA,SAA6B,CAAC;KAAG;IACzD,KAAK;KAAK,OAAO,KAAK,EAAE,MAAA,SAA6B,CAAC;KAAG;IACzD,KAAK;KAAK,OAAO,KAAK,EAAE,MAAA,QAA4B,CAAC;KAAG;IACxD,KAAK;KAAK,OAAO,KAAK,EAAE,MAAA,MAA0B,CAAC;KAAG;IACtD;KACI,IAAI,MAAM,WAAW,GAAG,GAAG;MACvB,IAAI,UAAU,QACV,MAAM,kBAAkB,cAAc,cAAc,MAAM,aAAa;MAG3E,OAAO,KAAK,EAAE,MAAA,SAA6B,CAAC;MAC5C;KACJ;KAIA,IAAI,OAAO,UAAU,eAAe,KAAK,4BAA4B,KAAK,GACtE,OAAO,KAAK,EAAE,MAAM,2BAA2B,OAAkD,CAAC;UAC/F,IACH,MAAM,WAAW,GAAI,KACrB,MAAM,SAAS,GAAI,GAEnB,OAAO,KAAK;MAAE,MAAA;MAAoC;KAAM,CAAC;UAEzD,OAAO,KAAK;MAAE,MAAA;MAA6B;KAAM,CAAC;GAE9D;EACJ;EAEA,IAAI,WAAW,MAAM,QACjB,MAAM,kBAAkB,cAAc,oCAAoC,OAAO,EAAE;EAGvF,OAAO,KAAK,EAAE,MAAA,MAA0B,CAAC;EACzC,OAAO;CACX;CAEA,sBACI,OACA,WAAoB,OACpB,QAAgB,GACC;EACjB,IAAI,QAAQ,WACR,MAAM,kBAAkB,cAAc,yCAAyC;EAGnF,MAAM,QAAQ,KAAK,KAAK;EACxB,QAAQ,MAAM,MAAd;GACI,KAAA,OACI,OAAO,KAAK,mBAAmB,OAAO,UAAU,KAAK;GACzD,KAAA;GACA,KAAA,MACI,OAAO,KAAK,uBAAuB,OAAO,UAAU,KAAK;GAC7D,KAAA;GACA,KAAA;GACA,KAAA;GACA,KAAA;GACA,KAAA,OACI,OAAO,KAAK,0BAA0B,OAAO,QAAQ;GACzD,KAAA;GACA,KAAA;GACA,KAAA,YACI,OAAO,KAAK,qBAAqB,OAAO,QAAQ;GACpD,KAAA;GACA,KAAA,OACI,OAAO,KAAK,kBAAkB,OAAO,QAAQ;GACjD,KAAA,aACI,OAAO,KAAK,yBAAyB,OAAO,UAAU,KAAK;GAC/D,KAAA,QACI,OAAO,KAAK,oBAAoB,OAAO,QAAQ;GACnD,SACI,MAAM,kBAAkB,cAAc,0CAA0C,MAAM,MAAM;EACpG;CACJ;CAEA,mBACI,OACA,WAAoB,OACpB,QAAgB,GACA;EAChB,KAAK,QAAA,KAA2B;EAChC,KAAK,QAAA,QAA8B;EACnC,MAAM,OAAO,KAAK,sBAAsB,OAAO,CAAC,UAAU,QAAQ,CAAC;EACnE,KAAK,QAAA,QAA8B;EAEnC,OAAO;CACX;CAEA,uBACI,OACA,WAAoB,OACpB,QAAgB,GACA;EAChB,IAAI,KAAK,KAAK,QAAQ,CAAC,CAAC;EACxB,IAAI,OAAA,SAA8B,OAAA,MAC9B,MAAM,kBAAkB,cAAc,gCAAgC;EAG1E,KAAK,QAAA,QAA8B;EACnC,MAAM,cAAoC,CAAC,KAAK,sBAAsB,OAAO,UAAU,QAAQ,CAAC,CAAC;EACjG,OAAO,KAAK,KAAK,CAAC,CAAC,SAAA,SAAgC;GAC/C,KAAK,QAAA,OAA6B;GAClC,YAAY,KAAK,KAAK,sBAAsB,OAAO,UAAU,QAAQ,CAAC,CAAC;EAC3E;EACA,KAAK,QAAA,QAA8B;EAEnC,IAAI,UACA,IAAI,OAAA,OACA,KAAA;OAEA,KAAA;EAIR,IAAI,OAAA,OACA,OAAO,IAAI,QACP,uBAAuB,KACvB,WACJ;EAGJ,OAAO,IAAI,QAAQ,uBAAuB,IAAI,WAAW;CAC7D;CAEA,0BACI,OACA,WAAoB,OACJ;EAChB,MAAM,KAAK,KAAK,QAAQ,CAAC,CAAC;EAC1B,KAAK,QAAA,QAA8B;EACnC,MAAM,OAAO,KAAK,0BAA0B,KAAK;EACjD,KAAK,QAAA,OAA6B;EAClC,MAAM,QAAQ,KAAK,qBAAqB;EACxC,KAAK,QAAA,QAA8B;EAEnC,QAAQ,IAAR;GACI,KAAA;IACI,IAAI,UACA,OAAO,IAAI,OACP,oBAAoB,WACpB,MACA,KACJ;IAGJ,OAAO,IAAI,OACP,oBAAoB,OACpB,MACA,KACJ;GAEJ,KAAA;IACI,IAAI,UACA,OAAO,IAAI,OACP,oBAAoB,iBACpB,MACA,KACJ;IAEJ,OAAO,IAAI,OACP,oBAAoB,cACpB,MACA,KACJ;GAEJ,KAAA;IACI,IAAI,UACA,OAAO,IAAI,OACP,oBAAoB,WACpB,MACA,KACJ;IAEJ,OAAO,IAAI,OACP,oBAAoB,oBACpB,MACA,KACJ;GAEJ,KAAA;IACI,IAAI,UACA,OAAO,IAAI,OACP,oBAAoB,oBACpB,MACA,KACJ;IAEJ,OAAO,IAAI,OACP,oBAAoB,WACpB,MACA,KACJ;GAEJ,KAAA;IACI,IAAI,UACA,OAAO,IAAI,OACP,oBAAoB,cACpB,MACA,KACJ;IAEJ,OAAO,IAAI,OACP,oBAAoB,iBACpB,MACA,KACJ;EAER;EAEA,MAAM,kBAAkB,cAAc,cAAc,GAAG,uCAAuC;CAClG;CAEA,qBACI,OACA,WAAoB,OACJ;EAChB,MAAM,KAAK,KAAK,QAAQ,CAAC,CAAC;EAC1B,KAAK,QAAA,QAA8B;EACnC,MAAM,QAAQ,KAAK,0BAA0B,KAAK;EAClD,KAAK,QAAA,OAA6B;EAClC,MAAM,OAAO,KAAK,QAAA,cAAoC,CAAC,CAAC;EACxD,KAAK,QAAA,QAA8B;EAEnC,MAAM,aAAa,KAAK,eAAe,IAAI;EAC3C,IAAI,OAAO,eAAe,UACtB,MAAM,kBAAkB,gBAAgB,KAAK;EAGjD,QAAQ,IAAR;GACI,KAAA,QACI,OAAO,IAAI,OACP,WACI,oBAAoB,eACpB,oBAAoB,UACxB,OACA,UACJ;GAEJ,KAAA,YACI,OAAO,IAAI,OACP,WACI,oBAAoB,gBACpB,oBAAoB,WACxB,OACA,UACJ;GAEJ,SACI,OAAO,IAAI,OACP,WACI,oBAAoB,kBACpB,oBAAoB,aACxB,OACA,UACJ;EAER;CACJ;CAEA,kBACI,OACA,WAAoB,OACJ;EAChB,MAAM,QAAQ,KAAK,KAAK;EACxB,IAAI,MAAM,SAAA,OACN,KAAK,QAAA,KAA2B;OAEhC,KAAK,QAAA,IAA0B;EAGnC,KAAK,QAAA,QAA8B;EAEnC,MAAM,QAAQ,KAAK,0BAA0B,KAAK;EAElD,MAAM,SAAoB,CAAC;EAC3B,OAAO,KAAK,KAAK,CAAC,CAAC,SAAA,SAAgC;GAC/C,KAAK,QAAA,OAA6B;GAElC,OAAO,KAAK,KAAK,qBAAqB,CAAC;EAC3C;EACA,KAAK,QAAA,QAA8B;EAKnC,IAHe,MAAM,SAAA,SAAgC,CAAC,YACjD,MAAM,SAAA,QAA+B,UAGtC,OAAO,IAAI,OACP,oBAAoB,QACpB,OACA,MACJ;EAGJ,OAAO,IAAI,OACP,oBAAoB,IACpB,OACA,MACJ;CACJ;;;;;;;CAQA,oBACI,OACA,WAAoB,OACd;EACN,IAAI,UACA,MAAM,kBAAkB,oBAAoB,MAAM;EAGtD,KAAK,QAAA,MAA4B;EACjC,KAAK,QAAA,QAA8B;EACnC,MAAM,QAAQ,KAAK,0BAA0B,KAAK;EAClD,KAAK,QAAA,OAA6B;EAClC,MAAM,QAAQ,KAAK,qBAAqB;EACxC,KAAK,QAAA,QAA8B;EAEnC,IACI,OAAO,UAAU,YACjB,CAAC,OAAO,UAAU,KAAK,KACvB,QAAQ,GAER,MAAM,kBAAkB,gBAAgB,KAAK;EAGjD,OAAO,IAAI,OAAO,oBAAoB,MAAM,OAAO,KAAK;CAC5D;;;;;;;CAQA,yBACI,OACA,WAAoB,OACpB,QAAgB,GACV;EACN,IAAI,UACA,MAAM,kBAAkB,oBAAoB,WAAW;EAG3D,KAAK,QAAA,WAAkC;EACvC,KAAK,QAAA,QAA8B;EAEnC,MAAM,SAAS,KAAK,qBAAqB,KAAK;EAE9C,KAAK,QAAA,OAA6B;EAElC,KAAK,kBAAkB;EAEvB,IAAI;EACJ,IAAI;GACA,YAAY,KAAK,sBAAsB,OAAO,OAAO,OAAO,QAAQ,CAAC;EACzE,UAAU;GACN,KAAK,kBAAkB;EAC3B;EAEA,KAAK,QAAA,QAA8B;EAEnC,OAAO,IAAI,OAAO,oBAAoB,YAAY,OAAO,OAAO,SAAS;CAC7E;;;;;;CAOA,qBACI,OACuC;EACvC,IAAI,KAAK,KAAK,CAAC,CAAC,SAAA,UAKZ,OAAO;GACH,OAHU,KAAK,0BAA0B,KAGrC;GACJ,OAAO,QAAQ,KAAK,kBAAkB,KAAK,IAAI,KAAA;EACnD;EAKJ,MAAM,QAAQ,CAFA,KAAK,QAAA,OAEA,CAAC,CAAC,KAAM;EAC3B,OAAO,KAAK,KAAK,CAAC,CAAC,SAAA,OAA8B;GAC7C,KAAK,QAAA,KAA2B;GAChC,MAAM,KAAK,KAAK,QAAA,OAA6B,CAAC,CAAC,KAAM;EACzD;EAEA,IAAI,CAAC,OACD,OAAO,EAAE,OAAO,MAAM,KAAK,GAAG,EAAE;EAKpC,IACI,MAAM,SAAS,MACd,MAAM,OAAO,cAAc,MAAM,OAAO,MAAM,OAAO,OAEtD,MAAM,MAAM;EAGhB,MAAM,WAAW,MAAM,WAAW,MAAM,KAAK,GAAG,CAAC;;EAGjD,IAAI,CAAC,SAAS,SACV,MAAM,kBAAkB,WAAW,SAAS,KAAK;EAGrD,MAAM,QAAQ,CAAC,GAAG,SAAS,MAAM,SAAS,IAAI,CAAC,CAAC,KAAK,GAAG;EAExD,IAAI;EACJ,IAAI;GACA,MAAM,UAAU,SAAS,MAAM,QAAQ,SAAS,IAAI;GACpD,IAAI,mBAAmB,iBACnB,WAAW;EAEnB,SAAS,GAAG;GAKR,IACI,EAAE,aAAa,eACf,EAAE,SAAS,UAAU,kBAErB,MAAM;EAEd;EAEA,OAAO;GACH;GACA,OAAO,YAAY,KAAK,kBAAkB,KAAK;EACnD;CACJ;CAEA,kBAA0B,SAAsC;EAC5D,OAAO,gBAAgB,IAAI,KAAK,UAAU,UAAU,SAAS,KAAA,GAAW;GACpE,gBAAgB;GAChB,QAAQ,QAAQ;EACpB,CAAC;CACL;CAEA,uBAAuC;EACnC,MAAM,QAAQ,KAAK,QAAQ;EAE3B,IACI,MAAM,SAAA,kBACN,MAAM,SAAA,QAEN,MAAM,kBAAkB,cAAc,8BAA8B,MAAM,MAAM;EAGpF,OAAO,KAAK,eAAe,MAAM,SAAS,MAAM;CACpD;CAEA,0BACI,OACM;EACN,IAAI,KAAK,KAAK,CAAC,CAAC,SAAA,UAAiC;GAC7C,KAAK,QAAA,QAA8B;GAInC,IAAI,KAAK,mBAAmB,GACxB,MAAM,kBAAkB,WAAW,MAAM;GAG7C,OAAO;EACX;EAEA,MAAM,QAAQ,KAAK,QAAA,OAA6B;EAChD,IAAI,MAAM,SAAA,SACN,MAAM,kBAAkB,cAAc,oCAAoC,MAAM,MAAM;EAG1F,MAAM,QAAQ,CAAC,MAAM,KAAM;EAE3B,OAAO,KAAK,KAAK,CAAC,CAAC,SAAA,OAA8B;GAC7C,KAAK,QAAA,KAA2B;GAChC,MAAM,KAAK,KAAK,QAAA,OAA6B,CAAC,CAAC,KAAM;EACzD;EAEA,IAAI,OAAO;GAIP,IACI,MAAM,SAAS,MACd,MAAM,OAAO,cAAc,MAAM,OAAO,MAAM,OAAO,OAEtD,MAAM,MAAM;GAGhB,MAAM,WAAW,MAAM,WAAW,MAAM,KAAK,GAAG,CAAC;;GAGjD,IAAI,CAAC,SAAS,SACV,MAAM,kBAAkB,WAAW,SAAS,KAAK;GAGrD,OAAO,CAAC,GAAG,SAAS,MAAM,SAAS,IAAI,CAAC,CAAC,KAAK,GAAG;EACrD;EAEA,OAAO,MAAM,KAAK,GAAG;CACzB;CAIA,eAAyB,OAAyB;EAC9C,IAAI,OAAO,UAAU,UAAU;GAC3B,MAAM,UAAU,MAAM,KAAK;GAC3B,IAAI,QAAQ,WAAW,GACnB,OAAO;GAKX,IACI,QAAQ,WAAW,GAAI,KACvB,QAAQ,SAAS,GAAI,KACrB,QAAQ,UAAU,GAElB,OAAO,kBAAkB,QAAQ,MAAM,GAAG,EAAE,CAAC,CAAC,QAAQ,OAAO,GAAI,CAAC;GAGtE,OAAO,kBAAkB,OAAO;EACpC;EAEA,IAAI,OAAO,UAAU,UACjB,OAAO;EAGX,IAAI,OAAO,UAAU,eAAe,UAAU,MAC1C,OAAO;EAGX,MAAM,IAAI,YAAY,8BAA8B;CACxD;AACJ;;;ACvvBA,IAAa,6BAAb,cAAgD,uBAAyD,CAEzG;;;ACHA,IAAa,4BAAb,cAA+C,sBAAsB,CAErE;;;ACFA,IAAa,uBAAb,cAA0C,iBAAiB,CAE3D;;;ACMA,IAAa,mBAAb,cAAsC,gBAAgB;CAClD;CAEA;CAEA;CAEA;CAEA;CAIA,YAAY,OAAwB;EAChC,MAAM,KAAK;EAEX,KAAK,eAAe,IAAI,uBAAuB,KAAK,QAAQ;EAC5D,KAAK,gBAAgB,IAAI,wBAAwB,KAAK,QAAQ;EAC9D,KAAK,mBAAmB,IAAI,2BAA2B,KAAK,QAAQ;EACpE,KAAK,kBAAkB,IAAI,0BAA0B,KAAK,QAAQ;EAClE,KAAK,aAAa,IAAI,qBAAqB,KAAK,QAAQ;CAC5D;AACJ"}
package/package.json CHANGED
@@ -1,6 +1,6 @@
1
1
  {
2
2
  "name": "@rapiq/parser-expression",
3
- "version": "2.0.0-beta.4",
3
+ "version": "2.0.0-beta.5",
4
4
  "description": "A package containing an expression parser",
5
5
  "type": "module",
6
6
  "main": "dist/index.mjs",
@@ -16,12 +16,12 @@
16
16
  "dist/"
17
17
  ],
18
18
  "devDependencies": {
19
- "@rapiq/core": "^2.0.0-beta.4",
20
- "@rapiq/parser-simple": "^2.0.0-beta.4"
19
+ "@rapiq/core": "^2.0.0-beta.5",
20
+ "@rapiq/parser-simple": "^2.0.0-beta.5"
21
21
  },
22
22
  "peerDependencies": {
23
- "@rapiq/core": "^2.0.0-beta.4",
24
- "@rapiq/parser-simple": "^2.0.0-beta.4"
23
+ "@rapiq/core": "^2.0.0-beta.5",
24
+ "@rapiq/parser-simple": "^2.0.0-beta.5"
25
25
  },
26
26
  "scripts": {
27
27
  "build:types": "tsc --noEmit -p tsconfig.build.json",