@rapiq/parser-expression 2.3.0 → 2.4.1

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.d.mts CHANGED
@@ -1,9 +1,6 @@
1
1
  import { BaseParser, BaseQueryParser, FiltersParseOptions, ICondition, IFilters, IIssueCollector, ObjectLiteral, PaginationParseOptions, Parameter, RelationLedger, ResolutionScope, Scalar, SchemaRegistry } from "@rapiq/core";
2
2
  import { SimpleFieldsParser, SimplePaginationParser, SimpleRelationsParser, SimpleSortsParser } from "@rapiq/parser-simple";
3
- //#region src/parameter/fields/module.d.ts
4
3
  export declare class ExpressionFieldsParser extends SimpleFieldsParser {}
5
- //#endregion
6
- //#region src/parameter/filters/constants.d.ts
7
4
  export declare enum FilterTokenType {
8
5
  NOT = "NOT",
9
6
  AND = "AND",
@@ -60,8 +57,6 @@ export declare const FILTER_EXPRESSION_KEYWORDS: {
60
57
  * it as needed).
61
58
  */
62
59
  export declare const FILTER_FIELD_SEGMENT_PATTERN = "[A-Za-z0-9_](?:[A-Za-z0-9_-]*[A-Za-z0-9_])?";
63
- //#endregion
64
- //#region src/parameter/filters/module.d.ts
65
60
  type FiltersScope = ResolutionScope<`${Parameter.FILTERS}`>;
66
61
  /**
67
62
  * @see https://www.jsonapi.net/usage/reading/filtering.html
@@ -147,35 +142,20 @@ export declare class ExpressionFiltersParser extends BaseParser<FiltersParseOpti
147
142
  private parseExpressionFieldChain;
148
143
  protected normalizeValue(input: unknown): Scalar;
149
144
  }
150
- //#endregion
151
- //#region src/parameter/filters/types.d.ts
152
145
  export type FilterToken = {
153
146
  type: `${FilterTokenType}`;
154
147
  value?: string;
155
148
  };
156
149
  export type FilterExpressionParseOptions<RECORD extends ObjectLiteral = ObjectLiteral> = FiltersParseOptions<RECORD>;
157
- //#endregion
158
- //#region src/parameter/pagination/types.d.ts
159
150
  type ExpressionPaginationParseOptions = PaginationParseOptions;
160
- //#endregion
161
- //#region src/parameter/pagination/module.d.ts
162
151
  export declare class ExpressionPaginationParser extends SimplePaginationParser<ExpressionPaginationParseOptions> {}
163
- //#endregion
164
- //#region src/parameter/relations/module.d.ts
165
152
  export declare class ExpressionRelationsParser extends SimpleRelationsParser {}
166
- //#endregion
167
- //#region src/parameter/sorts/module.d.ts
168
153
  export declare class ExpressionSortsParser extends SimpleSortsParser {}
169
154
  /**
170
155
  * @deprecated use {@link ExpressionSortsParser}. Removed in 3.0.
171
156
  */
172
157
  export declare const ExpressionSortParser: typeof ExpressionSortsParser;
173
- /**
174
- * @deprecated use {@link ExpressionSortsParser}. Removed in 3.0.
175
- */
176
158
  export type ExpressionSortParser = ExpressionSortsParser;
177
- //#endregion
178
- //#region src/module.d.ts
179
159
  export declare class ExpressionParser extends BaseQueryParser {
180
160
  protected fieldsParser: ExpressionFieldsParser;
181
161
  protected filtersParser: ExpressionFiltersParser;
@@ -184,5 +164,5 @@ export declare class ExpressionParser extends BaseQueryParser {
184
164
  protected sortParser: ExpressionSortsParser;
185
165
  constructor(input?: SchemaRegistry);
186
166
  }
187
- //#endregion
167
+ export {};
188
168
  //# sourceMappingURL=index.d.mts.map
@@ -1 +1 @@
1
- {"version":3,"file":"index.d.mts","names":[],"sources":["../src/parameter/fields/module.ts","../src/parameter/filters/constants.ts","../src/parameter/filters/module.ts","../src/parameter/filters/types.ts","../src/parameter/pagination/types.ts","../src/parameter/pagination/module.ts","../src/parameter/relations/module.ts","../src/parameter/sorts/module.ts","../src/module.ts"],"mappings":";;;qBASa,+BAA+B;;;oBCFhC;EACR;EAEA;EACA;EAEA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EAEA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;;;;;;;;qBASS;;;;;;;;;;;;;;;;;;;;;;;qBAwBA;;;KChBR,eAAe,mBAAmB,UAAU;;;;qBA0BpC,gCAAgC,WACzC,qBACA;UAEQ;UAEA;;;;;UAMA;EAIR,MAAM,eAAe,gBAAgB,eACjC,gBACA,UAAS,oBAAoB,UAC7B;EAsBW,WAAW,eAAe,gBAAgB,eACrD,gBACA,UAAS,oBAAoB,UAC7B,QAAQ;EAsBZ,eAAe,eAAe,gBAAgB,eAC1C,gBACA,SAAS,oBAAoB,SAC7B,QAAQ,gBACR,iBAAiB,kBACjB;EAUE,oBAAoB,eAAe,gBAAgB,eACrD,gBACA,SAAS,oBAAoB,SAC7B,QAAQ,gBACR,iBAAiB,kBACjB,QAAQ;EAKZ,WAAW,eAAe,gBAAgB,eACtC,gBACA,UAAS,oBAAoB,UAC7B;EAOE,gBAAgB,eAAe,gBAAgB,eACjD,gBACA,UAAS,oBAAoB,UAC7B,QAAQ;;;;;;;YAaF,MAAM,eAAe,gBAAgB,eAC3C,gBACA,SAAS,oBAAoB,SAC7B,QAAQ,gBACR,iBAAiB;IACf,QAAQ;IAAU,QAAQ;;YAUhB,WAAW,eAAe,gBAAgB,eACtD,gBACA,SAAS,oBAAoB,SAC7B,QAAQ,gBACR,iBAAiB,kBACjB;IAAU,QAAQ;IAAU,QAAQ;;;;;;;UAehC;UAyBM;;;;;;UAkCN;UAuCA;UAWA;UAaA;UAIA;UASA;UA0DA;;;;;;;UA2CA;UA0BA;UA2BA;UAmDA;UA6CA;;;;;;UA0CA;;;;;;UA0BA;;;;;;UA8BA;UAqEA;UAOA;UAaA;YAqDE,eAAe,iBAAkB;;;;YC50BnC;EACR,SAAS;EACT;;YAGQ,6BACR,eAAe,gBAAgB,iBAC/B,oBAAoB;;;KCRZ,mCAAmC;;;qBCClC,mCAAmC,uBAAuB;;;qBCD1D,kCAAkC;;;qBCAlC,8BAA8B;;;;qBAO9B,6BAAoB;;;;YAKrB,uBAAuB;;;qBCJtB,yBAAyB;YACxB,cAAe;YAEf,eAAgB;YAEhB,kBAAmB;YAEnB,iBAAkB;YAElB,YAAa;EAIX,YAAA,QAAQ"}
1
+ {"version":3,"file":"index.d.mts","names":[],"sources":["../src/parameter/fields/module.ts","../src/parameter/filters/constants.ts","../src/parameter/filters/module.ts","../src/parameter/filters/types.ts","../src/parameter/pagination/types.ts","../src/parameter/pagination/module.ts","../src/parameter/relations/module.ts","../src/parameter/sorts/module.ts","../src/module.ts"],"mappings":";;qBASa,+BAA+B;oBCFhC;EACR;EAEA;EACA;EAEA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EAEA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;;;;;;;;qBASS;;;;;;;;;;;;;;;;;;;;;;;qBAwBA;KChBR,eAAe,mBAAmB,UAAU;;;;qBA4BpC,gCAAgC,WACzC,qBACA;UAEQ;UAEA;;;;;UAMA;EAIR,MAAM,eAAe,gBAAgB,eACjC,gBACA,UAAS,oBAAoB,UAC7B;EAuBW,WAAW,eAAe,gBAAgB,eACrD,gBACA,UAAS,oBAAoB,UAC7B,QAAQ;EAuBZ,eAAe,eAAe,gBAAgB,eAC1C,gBACA,SAAS,oBAAoB,SAC7B,QAAQ,gBACR,iBAAiB,kBACjB;EAUE,oBAAoB,eAAe,gBAAgB,eACrD,gBACA,SAAS,oBAAoB,SAC7B,QAAQ,gBACR,iBAAiB,kBACjB,QAAQ;EAKZ,WAAW,eAAe,gBAAgB,eACtC,gBACA,UAAS,oBAAoB,UAC7B;EAOE,gBAAgB,eAAe,gBAAgB,eACjD,gBACA,UAAS,oBAAoB,UAC7B,QAAQ;;;;;;;YAaF,MAAM,eAAe,gBAAgB,eAC3C,gBACA,SAAS,oBAAoB,SAC7B,QAAQ,gBACR,iBAAiB;IACf,QAAQ;IAAU,QAAQ;;YAUhB,WAAW,eAAe,gBAAgB,eACtD,gBACA,SAAS,oBAAoB,SAC7B,QAAQ,gBACR,iBAAiB,kBACjB;IAAU,QAAQ;IAAU,QAAQ;;;;;;;UAehC;UA0BM;;;;;;UAmCN;UAyCA;UAWA;UAaA;UAIA;UAYA;UAwEA;;;;;;;UA4CA;UA6BA;UA+BA;UAwDA;UAkDA;;;;;;UA6CA;;;;;;UA8BA;;;;;;UA+BA;UAwEA;UAOA;UAaA;YAsDE,eAAe,iBAAkB;;YCn4BnC;EACR,SAAS;EACT;;YAGQ,6BACR,eAAe,gBAAgB,iBAC/B,oBAAoB;KCRZ,mCAAmC;qBCClC,mCAAmC,uBAAuB;qBCD1D,kCAAkC;qBCAlC,8BAA8B;;;;qBAO9B,6BAAoB;YAGrB,uBAAuB;qBCDtB,yBAAyB;YACxB,cAAe;YAEf,eAAgB;YAEhB,kBAAmB;YAEnB,iBAAkB;YAElB,YAAa;EAIX,YAAA,QAAQ"}
package/dist/index.mjs CHANGED
@@ -1,9 +1,8 @@
1
1
  import { BaseParser, BaseQueryParser, DEFAULT_ID, ErrorCode, FILTER_OPERATOR_SEMANTICS, Filter, FilterCompoundOperator, FilterFieldOperator, Filters, FiltersParseError, ITSELF, MAX_TRAVERSAL_DEPTH, Parameter, RelationsParseError, ResolutionScope, applyFiltersIndexPolicy, applyFiltersSchemaValidation, applyFiltersSchemaValidationAsync, applyKeySchemaValidation, applyKeySchemaValidationAsync, buildFiltersDefaults, isFilter, isFilters, isParseError, pruneFiltersByRelations } from "@rapiq/core";
2
- import { SimpleFieldsParser, SimplePaginationParser, SimpleRelationsParser, SimpleSortsParser, parseFilterScalar } from "@rapiq/parser-simple";
3
- //#region src/parameter/fields/module.ts
2
+ import { SimpleAggregatesParser, SimpleFieldsParser, SimpleGroupsParser, SimplePaginationParser, SimpleRelationsParser, SimpleSortsParser, parseFilterScalar } from "@rapiq/parser-simple";
3
+ // src/parameter/fields/module.ts
4
4
  var ExpressionFieldsParser = class extends SimpleFieldsParser {};
5
- //#endregion
6
- //#region src/parameter/filters/constants.ts
5
+ // src/parameter/filters/constants.ts
7
6
  let FilterTokenType = /* @__PURE__ */ function(FilterTokenType) {
8
7
  FilterTokenType["NOT"] = "NOT";
9
8
  FilterTokenType["AND"] = "AND";
@@ -61,8 +60,7 @@ const FILTER_EXPRESSION_KEYWORDS = {
61
60
  * it as needed).
62
61
  */
63
62
  const FILTER_FIELD_SEGMENT_PATTERN = "[A-Za-z0-9_](?:[A-Za-z0-9_-]*[A-Za-z0-9_])?";
64
- //#endregion
65
- //#region src/parameter/filters/module.ts
63
+ // src/parameter/filters/module.ts
66
64
  /**
67
65
  * Keep recursive expression parsing below the JavaScript call-stack limit and
68
66
  * aligned with the schema resolver and Mongo parser traversal caps.
@@ -487,21 +485,17 @@ var ExpressionFiltersParser = class extends BaseParser {
487
485
  throw FiltersParseError.syntaxInvalid("the value could not be normalized");
488
486
  }
489
487
  };
490
- //#endregion
491
- //#region src/parameter/pagination/module.ts
488
+ // src/parameter/pagination/module.ts
492
489
  var ExpressionPaginationParser = class extends SimplePaginationParser {};
493
- //#endregion
494
- //#region src/parameter/relations/module.ts
490
+ // src/parameter/relations/module.ts
495
491
  var ExpressionRelationsParser = class extends SimpleRelationsParser {};
496
- //#endregion
497
- //#region src/parameter/sorts/module.ts
492
+ // src/parameter/sorts/module.ts
498
493
  var ExpressionSortsParser = class extends SimpleSortsParser {};
499
494
  /**
500
495
  * @deprecated use {@link ExpressionSortsParser}. Removed in 3.0.
501
496
  */
502
497
  const ExpressionSortParser = ExpressionSortsParser;
503
- //#endregion
504
- //#region src/module.ts
498
+ // src/module.ts
505
499
  var ExpressionParser = class extends BaseQueryParser {
506
500
  fieldsParser;
507
501
  filtersParser;
@@ -515,9 +509,10 @@ var ExpressionParser = class extends BaseQueryParser {
515
509
  this.paginationParser = new ExpressionPaginationParser(this.registry);
516
510
  this.relationsParser = new ExpressionRelationsParser(this.registry);
517
511
  this.sortParser = new ExpressionSortsParser(this.registry);
512
+ this.groupsParser = new SimpleGroupsParser(this.registry);
513
+ this.aggregatesParser = new SimpleAggregatesParser(this.registry);
518
514
  }
519
515
  };
520
- //#endregion
521
516
  export { ExpressionFieldsParser, ExpressionFiltersParser, ExpressionPaginationParser, ExpressionParser, ExpressionRelationsParser, ExpressionSortParser, ExpressionSortsParser, FILTER_EXPRESSION_KEYWORDS, FILTER_FIELD_SEGMENT_PATTERN, FilterTokenType };
522
517
 
523
518
  //# sourceMappingURL=index.mjs.map
@@ -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 FiltersSchema,\n ICondition,\n IFilters,\n IIssueCollector,\n ObjectLiteral,\n RelationLedger,\n Scalar,\n} from '@rapiq/core';\nimport {\n BaseParser,\n DEFAULT_ID,\n ErrorCode,\n FILTER_OPERATOR_SEMANTICS,\n Filter,\n FilterCompoundOperator,\n FilterFieldOperator,\n Filters,\n FiltersParseError,\n ITSELF,\n MAX_TRAVERSAL_DEPTH,\n Parameter,\n RelationsParseError,\n ResolutionScope,\n applyFiltersIndexPolicy,\n applyFiltersSchemaValidation,\n applyFiltersSchemaValidationAsync,\n applyKeySchemaValidation,\n applyKeySchemaValidationAsync,\n buildFiltersDefaults,\n isFilter,\n isFilters,\n isParseError,\n pruneFiltersByRelations,\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 * Bidirectional complement twins derived from the semantics table:\n * a not(…) around a single leaf normalizes to the leaf's twin\n * (not(eq) → ne, not(nin) → in) instead of a symbolic NOT node —\n * both lower to the identical plan, the twin is the canonical form.\n */\nconst COMPLEMENT_TWINS : Record<string, string> = {};\nfor (const [operator, semantics] of Object.entries(FILTER_OPERATOR_SEMANTICS)) {\n const twin = (semantics as { complementOf?: string }).complementOf;\n if (twin) {\n COMPLEMENT_TWINS[operator] = twin;\n COMPLEMENT_TWINS[twin] = operator;\n }\n}\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 const ledger : RelationLedger = [];\n\n return this.withTrace({ parameter: Parameter.FILTERS }, (issueCollector) => {\n const { output, scope } = this.build(input, options, ledger, issueCollector);\n if (!scope) {\n return output;\n }\n\n return applyFiltersIndexPolicy(\n pruneFiltersByRelations(output, applyKeySchemaValidation(ledger, options.context, {\n throwOnFailure: scope.relationsThrowOnFailure,\n errors: RelationsParseError,\n issueCollector,\n }), scope.schema as FiltersSchema<RECORD>, issueCollector),\n this.registry,\n options.schema,\n { throwOnFailure: options.throwOnFailure, issueCollector },\n );\n });\n }\n\n override async parseAsync<RECORD extends ObjectLiteral = ObjectLiteral>(\n input: unknown,\n options: FiltersParseOptions<RECORD> = {},\n ) : Promise<IFilters> {\n const ledger : RelationLedger = [];\n\n return this.withTraceAsync({ parameter: Parameter.FILTERS }, async (issueCollector) => {\n const { output, scope } = await this.buildAsync(input, options, ledger, issueCollector);\n if (!scope) {\n return output;\n }\n\n return applyFiltersIndexPolicy(\n pruneFiltersByRelations(output, await applyKeySchemaValidationAsync(ledger, options.context, {\n throwOnFailure: scope.relationsThrowOnFailure,\n errors: RelationsParseError,\n issueCollector,\n }), scope.schema as FiltersSchema<RECORD>, issueCollector),\n this.registry,\n options.schema,\n { throwOnFailure: options.throwOnFailure, issueCollector },\n );\n });\n }\n\n parseParameter<RECORD extends ObjectLiteral = ObjectLiteral>(\n input: unknown,\n options: FiltersParseOptions<RECORD>,\n ledger: RelationLedger,\n issueCollector?: IIssueCollector,\n ) : IFilters {\n // whoever opens a trace raises it: driven by the query orchestrator\n // this records into the enclosing one and decides nothing, driven\n // directly it raises its own. The dialect resolves keys under an\n // always-throwing scope, so the abort route is the usual one here.\n return this.withTrace({ parameter: Parameter.FILTERS, driver: issueCollector }, (trace) =>\n this.build(input, options, ledger, trace).output);\n }\n\n\n async parseParameterAsync<RECORD extends ObjectLiteral = ObjectLiteral>(\n input: unknown,\n options: FiltersParseOptions<RECORD>,\n ledger: RelationLedger,\n issueCollector?: IIssueCollector,\n ) : Promise<IFilters> {\n return this.withTraceAsync({ parameter: Parameter.FILTERS, driver: issueCollector }, async (trace) =>\n (await this.buildAsync(input, options, ledger, trace)).output);\n }\n\n parseExact<RECORD extends ObjectLiteral = ObjectLiteral>(\n input: unknown,\n options: FiltersParseOptions<RECORD> = {},\n ) : ICondition {\n // raw exact tree; a standalone caller wanting relation authorization\n // uses parse(). Obligations are discarded, not pooled.\n return this.withTrace({ parameter: Parameter.FILTERS }, (issueCollector) =>\n this.parseValidated(input, options, [], issueCollector).result);\n }\n\n async parseExactAsync<RECORD extends ObjectLiteral = ObjectLiteral>(\n input: unknown,\n options: FiltersParseOptions<RECORD> = {},\n ) : Promise<ICondition> {\n return this.withTraceAsync({ parameter: Parameter.FILTERS }, async (issueCollector) =>\n (await this.parseValidatedAsync(input, options, [], issueCollector)).result);\n }\n\n // ---------------------------------------------------------\n\n /**\n * Resolve + leaf-validate + wrap into the root filters node, recording the\n * relation obligations it traverses into `ledger` (the scope's sink). Relation\n * authorization stays with the caller. `scope` is undefined for a schemaless\n * parse (nothing to authorize).\n */\n protected build<RECORD extends ObjectLiteral = ObjectLiteral>(\n input: unknown,\n options: FiltersParseOptions<RECORD>,\n ledger: RelationLedger,\n issueCollector?: IIssueCollector,\n ) : { output: IFilters, scope?: FiltersScope } {\n if (input === undefined || input === null) {\n return { output: this.buildAbsentOutput(options) };\n }\n\n const { result, scope } = this.parseValidated(input, options, ledger, issueCollector);\n\n return { output: this.wrapRoot(result), scope };\n }\n\n protected async buildAsync<RECORD extends ObjectLiteral = ObjectLiteral>(\n input: unknown,\n options: FiltersParseOptions<RECORD>,\n ledger: RelationLedger,\n issueCollector?: IIssueCollector,\n ) : Promise<{ output: IFilters, scope?: FiltersScope }> {\n if (input === undefined || input === null) {\n return { output: this.buildAbsentOutput(options) };\n }\n\n const { result, scope } = await this.parseValidatedAsync(input, options, ledger, issueCollector);\n\n return { output: this.wrapRoot(result), scope };\n }\n\n /**\n * The shared validated-parse of {@link parse} and {@link parseExact}:\n * tokenize + resolve + apply the filters leaf validator, returning the\n * bound scope so the caller can additionally authorize traversed relations.\n */\n private parseValidated<RECORD extends ObjectLiteral = ObjectLiteral>(\n input: unknown,\n options: FiltersParseOptions<RECORD>,\n ledger: RelationLedger,\n issueCollector?: IIssueCollector,\n ) : { result: ICondition, scope?: FiltersScope } {\n const { expr, scope } = this.parseSource(input, options, ledger);\n if (!scope) {\n return { result: expr };\n }\n\n const validated = applyFiltersSchemaValidation(expr, scope.schema, options.context, {\n issueCollector,\n throwOnFailure: options.throwOnFailure,\n });\n\n return {\n result: validated ?? new Filters(\n FilterCompoundOperator.AND,\n buildFiltersDefaults(scope.schema),\n ),\n scope,\n };\n }\n\n private async parseValidatedAsync<RECORD extends ObjectLiteral = ObjectLiteral>(\n input: unknown,\n options: FiltersParseOptions<RECORD>,\n ledger: RelationLedger,\n issueCollector?: IIssueCollector,\n ) : Promise<{ result: ICondition, scope?: FiltersScope }> {\n const { expr, scope } = this.parseSource(input, options, ledger);\n if (!scope) {\n return { result: expr };\n }\n\n const validated = await applyFiltersSchemaValidationAsync(\n expr,\n scope.schema,\n options.context,\n { issueCollector, throwOnFailure: options.throwOnFailure },\n );\n\n return {\n result: validated ?? new Filters(\n FilterCompoundOperator.AND,\n buildFiltersDefaults(scope.schema),\n ),\n scope,\n };\n }\n\n // ---------------------------------------------------------\n\n /**\n * The shared front-end of {@link parseValidated}: tokenize, bind the\n * resolution scope (recording relation obligations into `ledger`) and run\n * the grammar — everything up to (but excluding) validation.\n */\n private parseSource<RECORD extends ObjectLiteral = ObjectLiteral>(\n input: unknown,\n options: FiltersParseOptions<RECORD>,\n ledger: RelationLedger,\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: options.throwOnFailure,\n // the forcing is about KEYS: an expression cannot be partially\n // reinterpreted. Whether a relations validator declining a\n // relation fails the request stays the caller's call, as\n // everywhere else.\n resolutionThrowOnFailure: true,\n strict: options.strict,\n obligationSink: ledger,\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: ICondition) : 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 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, depth);\n case FilterTokenType.AND:\n case FilterTokenType.OR:\n return this.parseLogicalExpression(scope, 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);\n case FilterTokenType.CONTAINS:\n case FilterTokenType.STARTS_WITH:\n case FilterTokenType.ENDS_WITH:\n return this.parseMatchExpression(scope);\n case FilterTokenType.IN:\n case FilterTokenType.NIN:\n return this.parseInExpression(scope);\n case FilterTokenType.ELEM_MATCH:\n return this.parseElemMatchExpression(scope, depth);\n case FilterTokenType.SIZE:\n return this.parseSizeExpression(scope);\n default:\n throw FiltersParseError.syntaxInvalid(`Unexpected token in filter expression: ${token.type}`);\n }\n }\n\n /**\n * not(expr): the exact complement of the interior (null-inclusive\n * complement law). A single leaf with a complement twin normalizes\n * to the twin, a double negation cancels; everything else stays a\n * first-class NOT node.\n */\n private parseNotExpression(\n scope?: FiltersScope,\n depth: number = 0,\n ): Filters | Filter {\n this.consume(FilterTokenType.NOT);\n this.consume(FilterTokenType.LPAREN);\n const expr = this.parseFilterExpression(scope, depth + 1);\n this.consume(FilterTokenType.RPAREN);\n\n if (isFilter(expr)) {\n const twin = COMPLEMENT_TWINS[expr.operator];\n if (twin) {\n return new Filter(twin as FilterFieldOperator, expr.field, expr.value);\n }\n }\n\n if (\n isFilters(expr, FilterCompoundOperator.NOT) &&\n expr.value.length === 1\n ) {\n return expr.value[0] as Filters | Filter;\n }\n\n return new Filters(FilterCompoundOperator.NOT, [expr]);\n }\n\n private parseLogicalExpression(\n scope?: FiltersScope,\n depth: number = 0,\n ): Filters | Filter {\n const 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, depth + 1)];\n while (this.peek().type === FilterTokenType.COMMA) {\n this.consume(FilterTokenType.COMMA);\n expressions.push(this.parseFilterExpression(scope, depth + 1));\n }\n this.consume(FilterTokenType.RPAREN);\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 ): 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 return new Filter(\n FilterFieldOperator.EQUAL,\n left as string,\n right as string,\n );\n }\n case FilterTokenType.GREATER_THAN: {\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 return new Filter(\n FilterFieldOperator.GREATER_THAN_EQUAL,\n left as string,\n right as string,\n );\n }\n case FilterTokenType.LESS_THAN: {\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 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 ): 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 // the anchored operators match a literal substring, so the pattern\n // is transport text and is kept verbatim — never run through the\n // scalar grammar. Coercing it would reject a numeric pattern\n // (contains(title, '2024')) and silently trim a whitespace one into\n // a match-everything predicate. Mirrors the simple dialect, which\n // tags exactly these three operators `value: 'raw'`.\n const normalized = text.length >= 2 ?\n text.slice(1, -1).replace(/''/g, '\\'') :\n text;\n\n switch (op) {\n case FilterTokenType.CONTAINS: {\n return new Filter(\n FilterFieldOperator.CONTAINS,\n field,\n normalized,\n );\n }\n case FilterTokenType.ENDS_WITH: {\n return new Filter(\n FilterFieldOperator.ENDS_WITH,\n field,\n normalized,\n );\n }\n default: {\n return new Filter(\n FilterFieldOperator.STARTS_WITH,\n field,\n normalized,\n );\n }\n }\n }\n\n private parseInExpression(\n scope?: FiltersScope,\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 if (token.type === FilterTokenType.NIN) {\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).\n */\n private parseSizeExpression(\n scope?: FiltersScope,\n ): Filter {\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.isSafeInteger(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.\n */\n private parseElemMatchExpression(\n scope?: FiltersScope,\n depth: number = 0,\n ): Filter {\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, 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 !isParseError(e) ||\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 FiltersParseError.syntaxInvalid('the value could 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 { SimpleSortsParser } from '@rapiq/parser-simple';\n\nexport class ExpressionSortsParser extends SimpleSortsParser {\n\n}\n\n/**\n * @deprecated use {@link ExpressionSortsParser}. Removed in 3.0.\n */\nexport const ExpressionSortParser = ExpressionSortsParser;\n\n/**\n * @deprecated use {@link ExpressionSortsParser}. Removed in 3.0.\n */\nexport type ExpressionSortParser = ExpressionSortsParser;\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 ExpressionSortsParser,\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 : ExpressionSortsParser;\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 ExpressionSortsParser(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;;;;;;;ACV5C,MAAM,YAAY;;;;;;;AAQlB,MAAM,mBAA4C,CAAC;AACnD,KAAK,MAAM,CAAC,UAAU,cAAc,OAAO,QAAQ,yBAAyB,GAAG;CAC3E,MAAM,OAAQ,UAAwC;CACtD,IAAI,MAAM;EACN,iBAAiB,YAAY;EAC7B,iBAAiB,QAAQ;CAC7B;AACJ;;;;AAKA,IAAa,0BAAb,cAA6C,WAG3C;CACE,SAAgC,CAAC;CAEjC,MAAc;;;;;CAMd,iBAAyB;CAIzB,MACI,OACA,UAAuC,CAAC,GAC/B;EACT,MAAM,SAA0B,CAAC;EAEjC,OAAO,KAAK,UAAU,EAAE,WAAW,UAAU,QAAQ,IAAI,mBAAmB;GACxE,MAAM,EAAE,QAAQ,UAAU,KAAK,MAAM,OAAO,SAAS,QAAQ,cAAc;GAC3E,IAAI,CAAC,OACD,OAAO;GAGX,OAAO,wBACH,wBAAwB,QAAQ,yBAAyB,QAAQ,QAAQ,SAAS;IAC9E,gBAAgB,MAAM;IACtB,QAAQ;IACR;GACJ,CAAC,GAAG,MAAM,QAAiC,cAAc,GACzD,KAAK,UACL,QAAQ,QACR;IAAE,gBAAgB,QAAQ;IAAgB;GAAe,CAC7D;EACJ,CAAC;CACL;CAEA,MAAe,WACX,OACA,UAAuC,CAAC,GACtB;EAClB,MAAM,SAA0B,CAAC;EAEjC,OAAO,KAAK,eAAe,EAAE,WAAW,UAAU,QAAQ,GAAG,OAAO,mBAAmB;GACnF,MAAM,EAAE,QAAQ,UAAU,MAAM,KAAK,WAAW,OAAO,SAAS,QAAQ,cAAc;GACtF,IAAI,CAAC,OACD,OAAO;GAGX,OAAO,wBACH,wBAAwB,QAAQ,MAAM,8BAA8B,QAAQ,QAAQ,SAAS;IACzF,gBAAgB,MAAM;IACtB,QAAQ;IACR;GACJ,CAAC,GAAG,MAAM,QAAiC,cAAc,GACzD,KAAK,UACL,QAAQ,QACR;IAAE,gBAAgB,QAAQ;IAAgB;GAAe,CAC7D;EACJ,CAAC;CACL;CAEA,eACI,OACA,SACA,QACA,gBACS;EAKT,OAAO,KAAK,UAAU;GAAE,WAAW,UAAU;GAAS,QAAQ;EAAe,IAAI,UAC7E,KAAK,MAAM,OAAO,SAAS,QAAQ,KAAK,CAAC,CAAC,MAAM;CACxD;CAGA,MAAM,oBACF,OACA,SACA,QACA,gBACkB;EAClB,OAAO,KAAK,eAAe;GAAE,WAAW,UAAU;GAAS,QAAQ;EAAe,GAAG,OAAO,WACvF,MAAM,KAAK,WAAW,OAAO,SAAS,QAAQ,KAAK,EAAA,CAAG,MAAM;CACrE;CAEA,WACI,OACA,UAAuC,CAAC,GAC7B;EAGX,OAAO,KAAK,UAAU,EAAE,WAAW,UAAU,QAAQ,IAAI,mBACrD,KAAK,eAAe,OAAO,SAAS,CAAC,GAAG,cAAc,CAAC,CAAC,MAAM;CACtE;CAEA,MAAM,gBACF,OACA,UAAuC,CAAC,GACpB;EACpB,OAAO,KAAK,eAAe,EAAE,WAAW,UAAU,QAAQ,GAAG,OAAO,oBAC/D,MAAM,KAAK,oBAAoB,OAAO,SAAS,CAAC,GAAG,cAAc,EAAA,CAAG,MAAM;CACnF;;;;;;;CAUA,MACI,OACA,SACA,QACA,gBAC2C;EAC3C,IAAI,UAAU,KAAA,KAAa,UAAU,MACjC,OAAO,EAAE,QAAQ,KAAK,kBAAkB,OAAO,EAAE;EAGrD,MAAM,EAAE,QAAQ,UAAU,KAAK,eAAe,OAAO,SAAS,QAAQ,cAAc;EAEpF,OAAO;GAAE,QAAQ,KAAK,SAAS,MAAM;GAAG;EAAM;CAClD;CAEA,MAAgB,WACZ,OACA,SACA,QACA,gBACoD;EACpD,IAAI,UAAU,KAAA,KAAa,UAAU,MACjC,OAAO,EAAE,QAAQ,KAAK,kBAAkB,OAAO,EAAE;EAGrD,MAAM,EAAE,QAAQ,UAAU,MAAM,KAAK,oBAAoB,OAAO,SAAS,QAAQ,cAAc;EAE/F,OAAO;GAAE,QAAQ,KAAK,SAAS,MAAM;GAAG;EAAM;CAClD;;;;;;CAOA,eACI,OACA,SACA,QACA,gBAC6C;EAC7C,MAAM,EAAE,MAAM,UAAU,KAAK,YAAY,OAAO,SAAS,MAAM;EAC/D,IAAI,CAAC,OACD,OAAO,EAAE,QAAQ,KAAK;EAQ1B,OAAO;GACH,QANc,6BAA6B,MAAM,MAAM,QAAQ,QAAQ,SAAS;IAChF;IACA,gBAAgB,QAAQ;GAC5B,CAGoB,KAAK,IAAI,QACrB,uBAAuB,KACvB,qBAAqB,MAAM,MAAM,CACrC;GACA;EACJ;CACJ;CAEA,MAAc,oBACV,OACA,SACA,QACA,gBACsD;EACtD,MAAM,EAAE,MAAM,UAAU,KAAK,YAAY,OAAO,SAAS,MAAM;EAC/D,IAAI,CAAC,OACD,OAAO,EAAE,QAAQ,KAAK;EAU1B,OAAO;GACH,QAAQ,MARY,kCACpB,MACA,MAAM,QACN,QAAQ,SACR;IAAE;IAAgB,gBAAgB,QAAQ;GAAe,CAC7D,KAGyB,IAAI,QACrB,uBAAuB,KACvB,qBAAqB,MAAM,MAAM,CACrC;GACA;EACJ;CACJ;;;;;;CASA,YACI,OACA,SACA,QACiD;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,QAAQ;GAKxB,0BAA0B;GAC1B,QAAQ,QAAQ;GAChB,gBAAgB;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,MAA6B;EAC1C,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,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,KAAK;GAC/C,KAAA;GACA,KAAA,MACI,OAAO,KAAK,uBAAuB,OAAO,KAAK;GACnD,KAAA;GACA,KAAA;GACA,KAAA;GACA,KAAA;GACA,KAAA,OACI,OAAO,KAAK,0BAA0B,KAAK;GAC/C,KAAA;GACA,KAAA;GACA,KAAA,YACI,OAAO,KAAK,qBAAqB,KAAK;GAC1C,KAAA;GACA,KAAA,OACI,OAAO,KAAK,kBAAkB,KAAK;GACvC,KAAA,aACI,OAAO,KAAK,yBAAyB,OAAO,KAAK;GACrD,KAAA,QACI,OAAO,KAAK,oBAAoB,KAAK;GACzC,SACI,MAAM,kBAAkB,cAAc,0CAA0C,MAAM,MAAM;EACpG;CACJ;;;;;;;CAQA,mBACI,OACA,QAAgB,GACA;EAChB,KAAK,QAAA,KAA2B;EAChC,KAAK,QAAA,QAA8B;EACnC,MAAM,OAAO,KAAK,sBAAsB,OAAO,QAAQ,CAAC;EACxD,KAAK,QAAA,QAA8B;EAEnC,IAAI,SAAS,IAAI,GAAG;GAChB,MAAM,OAAO,iBAAiB,KAAK;GACnC,IAAI,MACA,OAAO,IAAI,OAAO,MAA6B,KAAK,OAAO,KAAK,KAAK;EAE7E;EAEA,IACI,UAAU,MAAM,uBAAuB,GAAG,KAC1C,KAAK,MAAM,WAAW,GAEtB,OAAO,KAAK,MAAM;EAGtB,OAAO,IAAI,QAAQ,uBAAuB,KAAK,CAAC,IAAI,CAAC;CACzD;CAEA,uBACI,OACA,QAAgB,GACA;EAChB,MAAM,KAAK,KAAK,QAAQ,CAAC,CAAC;EAC1B,IAAI,OAAA,SAA8B,OAAA,MAC9B,MAAM,kBAAkB,cAAc,gCAAgC;EAG1E,KAAK,QAAA,QAA8B;EACnC,MAAM,cAAoC,CAAC,KAAK,sBAAsB,OAAO,QAAQ,CAAC,CAAC;EACvF,OAAO,KAAK,KAAK,CAAC,CAAC,SAAA,SAAgC;GAC/C,KAAK,QAAA,OAA6B;GAClC,YAAY,KAAK,KAAK,sBAAsB,OAAO,QAAQ,CAAC,CAAC;EACjE;EACA,KAAK,QAAA,QAA8B;EAEnC,IAAI,OAAA,OACA,OAAO,IAAI,QACP,uBAAuB,KACvB,WACJ;EAGJ,OAAO,IAAI,QAAQ,uBAAuB,IAAI,WAAW;CAC7D;CAEA,0BACI,OACgB;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,MACI,OAAO,IAAI,OACP,oBAAoB,OACpB,MACA,KACJ;GAEJ,KAAA,MACI,OAAO,IAAI,OACP,oBAAoB,cACpB,MACA,KACJ;GAEJ,KAAA,OACI,OAAO,IAAI,OACP,oBAAoB,oBACpB,MACA,KACJ;GAEJ,KAAA,MACI,OAAO,IAAI,OACP,oBAAoB,WACpB,MACA,KACJ;GAEJ,KAAA,OACI,OAAO,IAAI,OACP,oBAAoB,iBACpB,MACA,KACJ;EAER;EAEA,MAAM,kBAAkB,cAAc,cAAc,GAAG,uCAAuC;CAClG;CAEA,qBACI,OACgB;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;EAQnC,MAAM,aAAa,KAAK,UAAU,IAC9B,KAAK,MAAM,GAAG,EAAE,CAAC,CAAC,QAAQ,OAAO,GAAI,IACrC;EAEJ,QAAQ,IAAR;GACI,KAAA,QACI,OAAO,IAAI,OACP,oBAAoB,UACpB,OACA,UACJ;GAEJ,KAAA,YACI,OAAO,IAAI,OACP,oBAAoB,WACpB,OACA,UACJ;GAEJ,SACI,OAAO,IAAI,OACP,oBAAoB,aACpB,OACA,UACJ;EAER;CACJ;CAEA,kBACI,OACgB;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;EAEnC,IAAI,MAAM,SAAA,OACN,OAAO,IAAI,OACP,oBAAoB,QACpB,OACA,MACJ;EAGJ,OAAO,IAAI,OACP,oBAAoB,IACpB,OACA,MACJ;CACJ;;;;;;CAOA,oBACI,OACM;EACN,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,cAAc,KAAK,KAC3B,QAAQ,GAER,MAAM,kBAAkB,gBAAgB,KAAK;EAGjD,OAAO,IAAI,OAAO,oBAAoB,MAAM,OAAO,KAAK;CAC5D;;;;;;CAOA,yBACI,OACA,QAAgB,GACV;EACN,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,QAAQ,CAAC;EAClE,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,CAAC,aAAa,CAAC,KACf,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,kBAAkB,cAAc,mCAAmC;CAC7E;AACJ;;;AC12BA,IAAa,6BAAb,cAAgD,uBAAyD,CAEzG;;;ACHA,IAAa,4BAAb,cAA+C,sBAAsB,CAErE;;;ACFA,IAAa,wBAAb,cAA2C,kBAAkB,CAE7D;;;;AAKA,MAAa,uBAAuB;;;ACCpC,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,sBAAsB,KAAK,QAAQ;CAC7D;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 FiltersSchema,\n ICondition,\n IFilters,\n IIssueCollector,\n ObjectLiteral,\n RelationLedger,\n Scalar,\n} from '@rapiq/core';\nimport {\n BaseParser,\n DEFAULT_ID,\n ErrorCode,\n FILTER_OPERATOR_SEMANTICS,\n Filter,\n FilterCompoundOperator,\n FilterFieldOperator,\n Filters,\n FiltersParseError,\n ITSELF,\n MAX_TRAVERSAL_DEPTH,\n Parameter,\n RelationsParseError,\n ResolutionScope,\n applyFiltersIndexPolicy,\n applyFiltersSchemaValidation,\n applyFiltersSchemaValidationAsync,\n applyKeySchemaValidation,\n applyKeySchemaValidationAsync,\n buildFiltersDefaults,\n isFilter,\n isFilters,\n isParseError,\n pruneFiltersByRelations,\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 * Bidirectional complement twins derived from the semantics table:\n * a not(…) around a single leaf normalizes to the leaf's twin\n * (not(eq) → ne, not(nin) → in) instead of a symbolic NOT node —\n * both lower to the identical plan, the twin is the canonical form.\n */\nconst COMPLEMENT_TWINS : Record<string, string> = {};\n\nfor (const [operator, semantics] of Object.entries(FILTER_OPERATOR_SEMANTICS)) {\n const twin = (semantics as { complementOf?: string }).complementOf;\n\n if (twin) {\n COMPLEMENT_TWINS[operator] = twin;\n COMPLEMENT_TWINS[twin] = operator;\n }\n}\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 const ledger : RelationLedger = [];\n\n return this.withTrace({ parameter: Parameter.FILTERS }, (issueCollector) => {\n const { output, scope } = this.build(input, options, ledger, issueCollector);\n\n if (!scope) {\n return output;\n }\n\n return applyFiltersIndexPolicy(\n pruneFiltersByRelations(output, applyKeySchemaValidation(ledger, options.context, {\n throwOnFailure: scope.relationsThrowOnFailure,\n errors: RelationsParseError,\n issueCollector,\n }), scope.schema as FiltersSchema<RECORD>, issueCollector),\n this.registry,\n options.schema,\n { throwOnFailure: options.throwOnFailure, issueCollector },\n );\n });\n }\n\n override async parseAsync<RECORD extends ObjectLiteral = ObjectLiteral>(\n input: unknown,\n options: FiltersParseOptions<RECORD> = {},\n ) : Promise<IFilters> {\n const ledger : RelationLedger = [];\n\n return this.withTraceAsync({ parameter: Parameter.FILTERS }, async (issueCollector) => {\n const { output, scope } = await this.buildAsync(input, options, ledger, issueCollector);\n\n if (!scope) {\n return output;\n }\n\n return applyFiltersIndexPolicy(\n pruneFiltersByRelations(output, await applyKeySchemaValidationAsync(ledger, options.context, {\n throwOnFailure: scope.relationsThrowOnFailure,\n errors: RelationsParseError,\n issueCollector,\n }), scope.schema as FiltersSchema<RECORD>, issueCollector),\n this.registry,\n options.schema,\n { throwOnFailure: options.throwOnFailure, issueCollector },\n );\n });\n }\n\n parseParameter<RECORD extends ObjectLiteral = ObjectLiteral>(\n input: unknown,\n options: FiltersParseOptions<RECORD>,\n ledger: RelationLedger,\n issueCollector?: IIssueCollector,\n ) : IFilters {\n // whoever opens a trace raises it: driven by the query orchestrator\n // this records into the enclosing one and decides nothing, driven\n // directly it raises its own. The dialect resolves keys under an\n // always-throwing scope, so the abort route is the usual one here.\n return this.withTrace({ parameter: Parameter.FILTERS, driver: issueCollector }, (trace) =>\n this.build(input, options, ledger, trace).output);\n }\n\n\n async parseParameterAsync<RECORD extends ObjectLiteral = ObjectLiteral>(\n input: unknown,\n options: FiltersParseOptions<RECORD>,\n ledger: RelationLedger,\n issueCollector?: IIssueCollector,\n ) : Promise<IFilters> {\n return this.withTraceAsync({ parameter: Parameter.FILTERS, driver: issueCollector }, async (trace) =>\n (await this.buildAsync(input, options, ledger, trace)).output);\n }\n\n parseExact<RECORD extends ObjectLiteral = ObjectLiteral>(\n input: unknown,\n options: FiltersParseOptions<RECORD> = {},\n ) : ICondition {\n // raw exact tree; a standalone caller wanting relation authorization\n // uses parse(). Obligations are discarded, not pooled.\n return this.withTrace({ parameter: Parameter.FILTERS }, (issueCollector) =>\n this.parseValidated(input, options, [], issueCollector).result);\n }\n\n async parseExactAsync<RECORD extends ObjectLiteral = ObjectLiteral>(\n input: unknown,\n options: FiltersParseOptions<RECORD> = {},\n ) : Promise<ICondition> {\n return this.withTraceAsync({ parameter: Parameter.FILTERS }, async (issueCollector) =>\n (await this.parseValidatedAsync(input, options, [], issueCollector)).result);\n }\n\n // ---------------------------------------------------------\n\n /**\n * Resolve + leaf-validate + wrap into the root filters node, recording the\n * relation obligations it traverses into `ledger` (the scope's sink). Relation\n * authorization stays with the caller. `scope` is undefined for a schemaless\n * parse (nothing to authorize).\n */\n protected build<RECORD extends ObjectLiteral = ObjectLiteral>(\n input: unknown,\n options: FiltersParseOptions<RECORD>,\n ledger: RelationLedger,\n issueCollector?: IIssueCollector,\n ) : { output: IFilters, scope?: FiltersScope } {\n if (input === undefined || input === null) {\n return { output: this.buildAbsentOutput(options) };\n }\n\n const { result, scope } = this.parseValidated(input, options, ledger, issueCollector);\n\n return { output: this.wrapRoot(result), scope };\n }\n\n protected async buildAsync<RECORD extends ObjectLiteral = ObjectLiteral>(\n input: unknown,\n options: FiltersParseOptions<RECORD>,\n ledger: RelationLedger,\n issueCollector?: IIssueCollector,\n ) : Promise<{ output: IFilters, scope?: FiltersScope }> {\n if (input === undefined || input === null) {\n return { output: this.buildAbsentOutput(options) };\n }\n\n const { result, scope } = await this.parseValidatedAsync(input, options, ledger, issueCollector);\n\n return { output: this.wrapRoot(result), scope };\n }\n\n /**\n * The shared validated-parse of {@link parse} and {@link parseExact}:\n * tokenize + resolve + apply the filters leaf validator, returning the\n * bound scope so the caller can additionally authorize traversed relations.\n */\n private parseValidated<RECORD extends ObjectLiteral = ObjectLiteral>(\n input: unknown,\n options: FiltersParseOptions<RECORD>,\n ledger: RelationLedger,\n issueCollector?: IIssueCollector,\n ) : { result: ICondition, scope?: FiltersScope } {\n const { expr, scope } = this.parseSource(input, options, ledger);\n\n if (!scope) {\n return { result: expr };\n }\n\n const validated = applyFiltersSchemaValidation(expr, scope.schema, options.context, {\n issueCollector,\n throwOnFailure: options.throwOnFailure,\n });\n\n return {\n result: validated ?? new Filters(\n FilterCompoundOperator.AND,\n buildFiltersDefaults(scope.schema),\n ),\n scope,\n };\n }\n\n private async parseValidatedAsync<RECORD extends ObjectLiteral = ObjectLiteral>(\n input: unknown,\n options: FiltersParseOptions<RECORD>,\n ledger: RelationLedger,\n issueCollector?: IIssueCollector,\n ) : Promise<{ result: ICondition, scope?: FiltersScope }> {\n const { expr, scope } = this.parseSource(input, options, ledger);\n\n if (!scope) {\n return { result: expr };\n }\n\n const validated = await applyFiltersSchemaValidationAsync(\n expr,\n scope.schema,\n options.context,\n { issueCollector, throwOnFailure: options.throwOnFailure },\n );\n\n return {\n result: validated ?? new Filters(\n FilterCompoundOperator.AND,\n buildFiltersDefaults(scope.schema),\n ),\n scope,\n };\n }\n\n // ---------------------------------------------------------\n\n /**\n * The shared front-end of {@link parseValidated}: tokenize, bind the\n * resolution scope (recording relation obligations into `ledger`) and run\n * the grammar — everything up to (but excluding) validation.\n */\n private parseSource<RECORD extends ObjectLiteral = ObjectLiteral>(\n input: unknown,\n options: FiltersParseOptions<RECORD>,\n ledger: RelationLedger,\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\n if (options.schema || options.strict) {\n scope = ResolutionScope.for(this.registry, Parameter.FILTERS, options.schema, {\n relations: options.relations,\n throwOnFailure: options.throwOnFailure,\n // the forcing is about KEYS: an expression cannot be partially\n // reinterpreted. Whether a relations validator declining a\n // relation fails the request stays the caller's call, as\n // everywhere else.\n resolutionThrowOnFailure: true,\n strict: options.strict,\n obligationSink: ledger,\n }) as FiltersScope;\n }\n\n const expr = this.parseFilterExpression(scope);\n\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: ICondition) : 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\n if (expected && token.type !== expected) {\n throw FiltersParseError.syntaxInvalid(`Expected ${expected}, got ${token.type}`);\n }\n\n this.pos++;\n\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\n cursor = regex.lastIndex;\n\n if (/^\\s+$/.test(value)) {\n continue;\n }\n\n switch (value) {\n case '(': tokens.push({ type: FilterTokenType.LPAREN });\n\n break;\n case ')': tokens.push({ type: FilterTokenType.RPAREN });\n\n break;\n case ',': tokens.push({ type: FilterTokenType.COMMA });\n\n break;\n case '.': tokens.push({ type: FilterTokenType.DOT });\n\n 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\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\n return tokens;\n }\n\n private parseFilterExpression(\n scope?: FiltersScope,\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\n switch (token.type) {\n case FilterTokenType.NOT:\n return this.parseNotExpression(scope, depth);\n case FilterTokenType.AND:\n case FilterTokenType.OR:\n return this.parseLogicalExpression(scope, 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);\n case FilterTokenType.CONTAINS:\n case FilterTokenType.STARTS_WITH:\n case FilterTokenType.ENDS_WITH:\n return this.parseMatchExpression(scope);\n case FilterTokenType.IN:\n case FilterTokenType.NIN:\n return this.parseInExpression(scope);\n case FilterTokenType.ELEM_MATCH:\n return this.parseElemMatchExpression(scope, depth);\n case FilterTokenType.SIZE:\n return this.parseSizeExpression(scope);\n default:\n throw FiltersParseError.syntaxInvalid(`Unexpected token in filter expression: ${token.type}`);\n }\n }\n\n /**\n * not(expr): the exact complement of the interior (null-inclusive\n * complement law). A single leaf with a complement twin normalizes\n * to the twin, a double negation cancels; everything else stays a\n * first-class NOT node.\n */\n private parseNotExpression(\n scope?: FiltersScope,\n depth: number = 0,\n ): Filters | Filter {\n this.consume(FilterTokenType.NOT);\n this.consume(FilterTokenType.LPAREN);\n\n const expr = this.parseFilterExpression(scope, depth + 1);\n\n this.consume(FilterTokenType.RPAREN);\n\n if (isFilter(expr)) {\n const twin = COMPLEMENT_TWINS[expr.operator];\n\n if (twin) {\n return new Filter(twin as FilterFieldOperator, expr.field, expr.value);\n }\n }\n\n if (\n isFilters(expr, FilterCompoundOperator.NOT) &&\n expr.value.length === 1\n ) {\n return expr.value[0] as Filters | Filter;\n }\n\n return new Filters(FilterCompoundOperator.NOT, [expr]);\n }\n\n private parseLogicalExpression(\n scope?: FiltersScope,\n depth: number = 0,\n ): Filters | Filter {\n const op = this.consume().type; // AND / OR\n\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\n const expressions: (Filter | Filters)[] = [this.parseFilterExpression(scope, depth + 1)];\n\n while (this.peek().type === FilterTokenType.COMMA) {\n this.consume(FilterTokenType.COMMA);\n expressions.push(this.parseFilterExpression(scope, depth + 1));\n }\n\n this.consume(FilterTokenType.RPAREN);\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 ): Filters | Filter {\n const op = this.consume().type;\n\n this.consume(FilterTokenType.LPAREN);\n\n const left = this.parseExpressionFieldChain(scope);\n\n this.consume(FilterTokenType.COMMA);\n\n const right = this.parseExpressionValue();\n\n this.consume(FilterTokenType.RPAREN);\n\n switch (op) {\n case FilterTokenType.EQUAL: {\n return new Filter(\n FilterFieldOperator.EQUAL,\n left as string,\n right as string,\n );\n }\n case FilterTokenType.GREATER_THAN: {\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 return new Filter(\n FilterFieldOperator.GREATER_THAN_EQUAL,\n left as string,\n right as string,\n );\n }\n case FilterTokenType.LESS_THAN: {\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 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 ): Filters | Filter {\n const op = this.consume().type;\n\n this.consume(FilterTokenType.LPAREN);\n\n const field = this.parseExpressionFieldChain(scope);\n\n this.consume(FilterTokenType.COMMA);\n\n const text = this.consume(FilterTokenType.ESCAPED_TEXT).value!;\n\n this.consume(FilterTokenType.RPAREN);\n\n // the anchored operators match a literal substring, so the pattern\n // is transport text and is kept verbatim — never run through the\n // scalar grammar. Coercing it would reject a numeric pattern\n // (contains(title, '2024')) and silently trim a whitespace one into\n // a match-everything predicate. Mirrors the simple dialect, which\n // tags exactly these three operators `value: 'raw'`.\n const normalized = text.length >= 2 ?\n text.slice(1, -1).replace(/''/g, '\\'') :\n text;\n\n switch (op) {\n case FilterTokenType.CONTAINS: {\n return new Filter(\n FilterFieldOperator.CONTAINS,\n field,\n normalized,\n );\n }\n case FilterTokenType.ENDS_WITH: {\n return new Filter(\n FilterFieldOperator.ENDS_WITH,\n field,\n normalized,\n );\n }\n default: {\n return new Filter(\n FilterFieldOperator.STARTS_WITH,\n field,\n normalized,\n );\n }\n }\n }\n\n private parseInExpression(\n scope?: FiltersScope,\n ): Filters | Filter {\n const token = this.peek();\n\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\n while (this.peek().type === FilterTokenType.COMMA) {\n this.consume(FilterTokenType.COMMA);\n\n values.push(this.parseExpressionValue());\n }\n\n this.consume(FilterTokenType.RPAREN);\n\n if (token.type === FilterTokenType.NIN) {\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).\n */\n private parseSizeExpression(\n scope?: FiltersScope,\n ): Filter {\n this.consume(FilterTokenType.SIZE);\n this.consume(FilterTokenType.LPAREN);\n\n const field = this.parseExpressionFieldChain(scope);\n\n this.consume(FilterTokenType.COMMA);\n\n const value = this.parseExpressionValue();\n\n this.consume(FilterTokenType.RPAREN);\n\n if (\n typeof value !== 'number' ||\n !Number.isSafeInteger(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.\n */\n private parseElemMatchExpression(\n scope?: FiltersScope,\n depth: number = 0,\n ): Filter {\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\n try {\n condition = this.parseFilterExpression(target.scope, 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\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\n try {\n const verdict = resolved.scope.descend(resolved.name);\n\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 !isParseError(e) ||\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\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\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 FiltersParseError.syntaxInvalid('the value could 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 { SimpleSortsParser } from '@rapiq/parser-simple';\n\nexport class ExpressionSortsParser extends SimpleSortsParser {\n\n}\n\n/**\n * @deprecated use {@link ExpressionSortsParser}. Removed in 3.0.\n */\nexport const ExpressionSortParser = ExpressionSortsParser;\n\n// eslint-disable-next-line @tada5hi/type-declaration-location -- Preserve the merged public value and type.\nexport type ExpressionSortParser = ExpressionSortsParser;\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 { SimpleAggregatesParser, SimpleGroupsParser } from '@rapiq/parser-simple';\nimport {\n ExpressionFieldsParser,\n ExpressionFiltersParser,\n ExpressionPaginationParser,\n ExpressionRelationsParser,\n ExpressionSortsParser,\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 : ExpressionSortsParser;\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 ExpressionSortsParser(this.registry);\n // one call-term grammar serves every dialect.\n this.groupsParser = new SimpleGroupsParser(this.registry);\n this.aggregatesParser = new SimpleAggregatesParser(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;;;;;;ACV5C,MAAM,YAAY;;;;;;;AAQlB,MAAM,mBAA4C,CAAC;AAEnD,KAAK,MAAM,CAAC,UAAU,cAAc,OAAO,QAAQ,yBAAyB,GAAG;CAC3E,MAAM,OAAQ,UAAwC;CAEtD,IAAI,MAAM;EACN,iBAAiB,YAAY;EAC7B,iBAAiB,QAAQ;CAC7B;AACJ;;;;AAKA,IAAa,0BAAb,cAA6C,WAG3C;CACE,SAAgC,CAAC;CAEjC,MAAc;;;;;CAMd,iBAAyB;CAIzB,MACI,OACA,UAAuC,CAAC,GAC/B;EACT,MAAM,SAA0B,CAAC;EAEjC,OAAO,KAAK,UAAU,EAAE,WAAW,UAAU,QAAQ,IAAI,mBAAmB;GACxE,MAAM,EAAE,QAAQ,UAAU,KAAK,MAAM,OAAO,SAAS,QAAQ,cAAc;GAE3E,IAAI,CAAC,OACD,OAAO;GAGX,OAAO,wBACH,wBAAwB,QAAQ,yBAAyB,QAAQ,QAAQ,SAAS;IAC9E,gBAAgB,MAAM;IACtB,QAAQ;IACR;GACJ,CAAC,GAAG,MAAM,QAAiC,cAAc,GACzD,KAAK,UACL,QAAQ,QACR;IAAE,gBAAgB,QAAQ;IAAgB;GAAe,CAC7D;EACJ,CAAC;CACL;CAEA,MAAe,WACX,OACA,UAAuC,CAAC,GACtB;EAClB,MAAM,SAA0B,CAAC;EAEjC,OAAO,KAAK,eAAe,EAAE,WAAW,UAAU,QAAQ,GAAG,OAAO,mBAAmB;GACnF,MAAM,EAAE,QAAQ,UAAU,MAAM,KAAK,WAAW,OAAO,SAAS,QAAQ,cAAc;GAEtF,IAAI,CAAC,OACD,OAAO;GAGX,OAAO,wBACH,wBAAwB,QAAQ,MAAM,8BAA8B,QAAQ,QAAQ,SAAS;IACzF,gBAAgB,MAAM;IACtB,QAAQ;IACR;GACJ,CAAC,GAAG,MAAM,QAAiC,cAAc,GACzD,KAAK,UACL,QAAQ,QACR;IAAE,gBAAgB,QAAQ;IAAgB;GAAe,CAC7D;EACJ,CAAC;CACL;CAEA,eACI,OACA,SACA,QACA,gBACS;EAKT,OAAO,KAAK,UAAU;GAAE,WAAW,UAAU;GAAS,QAAQ;EAAe,IAAI,UAC7E,KAAK,MAAM,OAAO,SAAS,QAAQ,KAAK,CAAC,CAAC,MAAM;CACxD;CAGA,MAAM,oBACF,OACA,SACA,QACA,gBACkB;EAClB,OAAO,KAAK,eAAe;GAAE,WAAW,UAAU;GAAS,QAAQ;EAAe,GAAG,OAAO,WACvF,MAAM,KAAK,WAAW,OAAO,SAAS,QAAQ,KAAK,EAAA,CAAG,MAAM;CACrE;CAEA,WACI,OACA,UAAuC,CAAC,GAC7B;EAGX,OAAO,KAAK,UAAU,EAAE,WAAW,UAAU,QAAQ,IAAI,mBACrD,KAAK,eAAe,OAAO,SAAS,CAAC,GAAG,cAAc,CAAC,CAAC,MAAM;CACtE;CAEA,MAAM,gBACF,OACA,UAAuC,CAAC,GACpB;EACpB,OAAO,KAAK,eAAe,EAAE,WAAW,UAAU,QAAQ,GAAG,OAAO,oBAC/D,MAAM,KAAK,oBAAoB,OAAO,SAAS,CAAC,GAAG,cAAc,EAAA,CAAG,MAAM;CACnF;;;;;;;CAUA,MACI,OACA,SACA,QACA,gBAC2C;EAC3C,IAAI,UAAU,KAAA,KAAa,UAAU,MACjC,OAAO,EAAE,QAAQ,KAAK,kBAAkB,OAAO,EAAE;EAGrD,MAAM,EAAE,QAAQ,UAAU,KAAK,eAAe,OAAO,SAAS,QAAQ,cAAc;EAEpF,OAAO;GAAE,QAAQ,KAAK,SAAS,MAAM;GAAG;EAAM;CAClD;CAEA,MAAgB,WACZ,OACA,SACA,QACA,gBACoD;EACpD,IAAI,UAAU,KAAA,KAAa,UAAU,MACjC,OAAO,EAAE,QAAQ,KAAK,kBAAkB,OAAO,EAAE;EAGrD,MAAM,EAAE,QAAQ,UAAU,MAAM,KAAK,oBAAoB,OAAO,SAAS,QAAQ,cAAc;EAE/F,OAAO;GAAE,QAAQ,KAAK,SAAS,MAAM;GAAG;EAAM;CAClD;;;;;;CAOA,eACI,OACA,SACA,QACA,gBAC6C;EAC7C,MAAM,EAAE,MAAM,UAAU,KAAK,YAAY,OAAO,SAAS,MAAM;EAE/D,IAAI,CAAC,OACD,OAAO,EAAE,QAAQ,KAAK;EAQ1B,OAAO;GACH,QANc,6BAA6B,MAAM,MAAM,QAAQ,QAAQ,SAAS;IAChF;IACA,gBAAgB,QAAQ;GAC5B,CAGoB,KAAK,IAAI,QACrB,uBAAuB,KACvB,qBAAqB,MAAM,MAAM,CACrC;GACA;EACJ;CACJ;CAEA,MAAc,oBACV,OACA,SACA,QACA,gBACsD;EACtD,MAAM,EAAE,MAAM,UAAU,KAAK,YAAY,OAAO,SAAS,MAAM;EAE/D,IAAI,CAAC,OACD,OAAO,EAAE,QAAQ,KAAK;EAU1B,OAAO;GACH,QAAQ,MARY,kCACpB,MACA,MAAM,QACN,QAAQ,SACR;IAAE;IAAgB,gBAAgB,QAAQ;GAAe,CAC7D,KAGyB,IAAI,QACrB,uBAAuB,KACvB,qBAAqB,MAAM,MAAM,CACrC;GACA;EACJ;CACJ;;;;;;CASA,YACI,OACA,SACA,QACiD;EACjD,IAAI,OAAO,UAAU,UACjB,MAAM,kBAAkB,aAAa;EAGzC,KAAK,MAAM;EACX,KAAK,iBAAiB;EACtB,KAAK,SAAS,KAAK,SAAS,KAAK;EAKjC,IAAI;EAEJ,IAAI,QAAQ,UAAU,QAAQ,QAC1B,QAAQ,gBAAgB,IAAI,KAAK,UAAU,UAAU,SAAS,QAAQ,QAAQ;GAC1E,WAAW,QAAQ;GACnB,gBAAgB,QAAQ;GAKxB,0BAA0B;GAC1B,QAAQ,QAAQ;GAChB,gBAAgB;EACpB,CAAC;EAGL,MAAM,OAAO,KAAK,sBAAsB,KAAK;EAE7C,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,MAA6B;EAC1C,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;EAExB,IAAI,YAAY,MAAM,SAAS,UAC3B,MAAM,kBAAkB,cAAc,YAAY,SAAS,QAAQ,MAAM,MAAM;EAGnF,KAAK;EAEL,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;GAEpB,SAAS,MAAM;GAEf,IAAI,QAAQ,KAAK,KAAK,GAClB;GAGJ,QAAQ,OAAR;IACI,KAAK;KAAK,OAAO,KAAK,EAAE,MAAA,SAA6B,CAAC;KAElD;IACJ,KAAK;KAAK,OAAO,KAAK,EAAE,MAAA,SAA6B,CAAC;KAElD;IACJ,KAAK;KAAK,OAAO,KAAK,EAAE,MAAA,QAA4B,CAAC;KAEjD;IACJ,KAAK;KAAK,OAAO,KAAK,EAAE,MAAA,MAA0B,CAAC;KAE/C;IACJ;KACI,IAAI,MAAM,WAAW,GAAG,GAAG;MACvB,IAAI,UAAU,QACV,MAAM,kBAAkB,cAAc,cAAc,MAAM,aAAa;MAG3E,OAAO,KAAK,EAAE,MAAA,SAA6B,CAAC;MAE5C;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;EAEzC,OAAO;CACX;CAEA,sBACI,OACA,QAAgB,GACC;EACjB,IAAI,QAAQ,WACR,MAAM,kBAAkB,cAAc,yCAAyC;EAGnF,MAAM,QAAQ,KAAK,KAAK;EAExB,QAAQ,MAAM,MAAd;GACI,KAAA,OACI,OAAO,KAAK,mBAAmB,OAAO,KAAK;GAC/C,KAAA;GACA,KAAA,MACI,OAAO,KAAK,uBAAuB,OAAO,KAAK;GACnD,KAAA;GACA,KAAA;GACA,KAAA;GACA,KAAA;GACA,KAAA,OACI,OAAO,KAAK,0BAA0B,KAAK;GAC/C,KAAA;GACA,KAAA;GACA,KAAA,YACI,OAAO,KAAK,qBAAqB,KAAK;GAC1C,KAAA;GACA,KAAA,OACI,OAAO,KAAK,kBAAkB,KAAK;GACvC,KAAA,aACI,OAAO,KAAK,yBAAyB,OAAO,KAAK;GACrD,KAAA,QACI,OAAO,KAAK,oBAAoB,KAAK;GACzC,SACI,MAAM,kBAAkB,cAAc,0CAA0C,MAAM,MAAM;EACpG;CACJ;;;;;;;CAQA,mBACI,OACA,QAAgB,GACA;EAChB,KAAK,QAAA,KAA2B;EAChC,KAAK,QAAA,QAA8B;EAEnC,MAAM,OAAO,KAAK,sBAAsB,OAAO,QAAQ,CAAC;EAExD,KAAK,QAAA,QAA8B;EAEnC,IAAI,SAAS,IAAI,GAAG;GAChB,MAAM,OAAO,iBAAiB,KAAK;GAEnC,IAAI,MACA,OAAO,IAAI,OAAO,MAA6B,KAAK,OAAO,KAAK,KAAK;EAE7E;EAEA,IACI,UAAU,MAAM,uBAAuB,GAAG,KAC1C,KAAK,MAAM,WAAW,GAEtB,OAAO,KAAK,MAAM;EAGtB,OAAO,IAAI,QAAQ,uBAAuB,KAAK,CAAC,IAAI,CAAC;CACzD;CAEA,uBACI,OACA,QAAgB,GACA;EAChB,MAAM,KAAK,KAAK,QAAQ,CAAC,CAAC;EAE1B,IAAI,OAAA,SAA8B,OAAA,MAC9B,MAAM,kBAAkB,cAAc,gCAAgC;EAG1E,KAAK,QAAA,QAA8B;EAEnC,MAAM,cAAoC,CAAC,KAAK,sBAAsB,OAAO,QAAQ,CAAC,CAAC;EAEvF,OAAO,KAAK,KAAK,CAAC,CAAC,SAAA,SAAgC;GAC/C,KAAK,QAAA,OAA6B;GAClC,YAAY,KAAK,KAAK,sBAAsB,OAAO,QAAQ,CAAC,CAAC;EACjE;EAEA,KAAK,QAAA,QAA8B;EAEnC,IAAI,OAAA,OACA,OAAO,IAAI,QACP,uBAAuB,KACvB,WACJ;EAGJ,OAAO,IAAI,QAAQ,uBAAuB,IAAI,WAAW;CAC7D;CAEA,0BACI,OACgB;EAChB,MAAM,KAAK,KAAK,QAAQ,CAAC,CAAC;EAE1B,KAAK,QAAA,QAA8B;EAEnC,MAAM,OAAO,KAAK,0BAA0B,KAAK;EAEjD,KAAK,QAAA,OAA6B;EAElC,MAAM,QAAQ,KAAK,qBAAqB;EAExC,KAAK,QAAA,QAA8B;EAEnC,QAAQ,IAAR;GACI,KAAA,MACI,OAAO,IAAI,OACP,oBAAoB,OACpB,MACA,KACJ;GAEJ,KAAA,MACI,OAAO,IAAI,OACP,oBAAoB,cACpB,MACA,KACJ;GAEJ,KAAA,OACI,OAAO,IAAI,OACP,oBAAoB,oBACpB,MACA,KACJ;GAEJ,KAAA,MACI,OAAO,IAAI,OACP,oBAAoB,WACpB,MACA,KACJ;GAEJ,KAAA,OACI,OAAO,IAAI,OACP,oBAAoB,iBACpB,MACA,KACJ;EAER;EAEA,MAAM,kBAAkB,cAAc,cAAc,GAAG,uCAAuC;CAClG;CAEA,qBACI,OACgB;EAChB,MAAM,KAAK,KAAK,QAAQ,CAAC,CAAC;EAE1B,KAAK,QAAA,QAA8B;EAEnC,MAAM,QAAQ,KAAK,0BAA0B,KAAK;EAElD,KAAK,QAAA,OAA6B;EAElC,MAAM,OAAO,KAAK,QAAA,cAAoC,CAAC,CAAC;EAExD,KAAK,QAAA,QAA8B;EAQnC,MAAM,aAAa,KAAK,UAAU,IAC9B,KAAK,MAAM,GAAG,EAAE,CAAC,CAAC,QAAQ,OAAO,GAAI,IACrC;EAEJ,QAAQ,IAAR;GACI,KAAA,QACI,OAAO,IAAI,OACP,oBAAoB,UACpB,OACA,UACJ;GAEJ,KAAA,YACI,OAAO,IAAI,OACP,oBAAoB,WACpB,OACA,UACJ;GAEJ,SACI,OAAO,IAAI,OACP,oBAAoB,aACpB,OACA,UACJ;EAER;CACJ;CAEA,kBACI,OACgB;EAChB,MAAM,QAAQ,KAAK,KAAK;EAExB,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;EAE3B,OAAO,KAAK,KAAK,CAAC,CAAC,SAAA,SAAgC;GAC/C,KAAK,QAAA,OAA6B;GAElC,OAAO,KAAK,KAAK,qBAAqB,CAAC;EAC3C;EAEA,KAAK,QAAA,QAA8B;EAEnC,IAAI,MAAM,SAAA,OACN,OAAO,IAAI,OACP,oBAAoB,QACpB,OACA,MACJ;EAGJ,OAAO,IAAI,OACP,oBAAoB,IACpB,OACA,MACJ;CACJ;;;;;;CAOA,oBACI,OACM;EACN,KAAK,QAAA,MAA4B;EACjC,KAAK,QAAA,QAA8B;EAEnC,MAAM,QAAQ,KAAK,0BAA0B,KAAK;EAElD,KAAK,QAAA,OAA6B;EAElC,MAAM,QAAQ,KAAK,qBAAqB;EAExC,KAAK,QAAA,QAA8B;EAEnC,IACI,OAAO,UAAU,YACjB,CAAC,OAAO,cAAc,KAAK,KAC3B,QAAQ,GAER,MAAM,kBAAkB,gBAAgB,KAAK;EAGjD,OAAO,IAAI,OAAO,oBAAoB,MAAM,OAAO,KAAK;CAC5D;;;;;;CAOA,yBACI,OACA,QAAgB,GACV;EACN,KAAK,QAAA,WAAkC;EACvC,KAAK,QAAA,QAA8B;EAEnC,MAAM,SAAS,KAAK,qBAAqB,KAAK;EAE9C,KAAK,QAAA,OAA6B;EAElC,KAAK,kBAAkB;EAEvB,IAAI;EAEJ,IAAI;GACA,YAAY,KAAK,sBAAsB,OAAO,OAAO,QAAQ,CAAC;EAClE,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;EAE3B,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;EAEJ,IAAI;GACA,MAAM,UAAU,SAAS,MAAM,QAAQ,SAAS,IAAI;GAEpD,IAAI,mBAAmB,iBACnB,WAAW;EAEnB,SAAS,GAAG;GAKR,IACI,CAAC,aAAa,CAAC,KACf,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;EAEhD,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;GAE3B,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,kBAAkB,cAAc,mCAAmC;CAC7E;AACJ;;ACl6BA,IAAa,6BAAb,cAAgD,uBAAyD,CAEzG;;ACHA,IAAa,4BAAb,cAA+C,sBAAsB,CAErE;;ACFA,IAAa,wBAAb,cAA2C,kBAAkB,CAE7D;;;;AAKA,MAAa,uBAAuB;;ACEpC,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,sBAAsB,KAAK,QAAQ;EAEzD,KAAK,eAAe,IAAI,mBAAmB,KAAK,QAAQ;EACxD,KAAK,mBAAmB,IAAI,uBAAuB,KAAK,QAAQ;CACpE;AACJ"}
package/package.json CHANGED
@@ -1,6 +1,6 @@
1
1
  {
2
2
  "name": "@rapiq/parser-expression",
3
- "version": "2.3.0",
3
+ "version": "2.4.1",
4
4
  "description": "Parse a function-call filter language (e.g. and(eq(name,'John'), gte(age,'18'))) into a rapiq query AST.",
5
5
  "type": "module",
6
6
  "main": "dist/index.mjs",
@@ -17,12 +17,12 @@
17
17
  ],
18
18
  "devDependencies": {
19
19
  "@ebec/core": "^1.3.2",
20
- "@rapiq/core": "^2.3.0",
21
- "@rapiq/parser-simple": "^2.3.0"
20
+ "@rapiq/core": "^2.4.1",
21
+ "@rapiq/parser-simple": "^2.4.1"
22
22
  },
23
23
  "peerDependencies": {
24
- "@rapiq/core": "^2.3.0",
25
- "@rapiq/parser-simple": "^2.3.0"
24
+ "@rapiq/core": "^2.4.1",
25
+ "@rapiq/parser-simple": "^2.4.1"
26
26
  },
27
27
  "scripts": {
28
28
  "build:types": "tsc --noEmit -p tsconfig.build.json",