@rapiq/parser-expression 2.0.0-beta.5 → 2.0.0-beta.7
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 +36 -8
- package/dist/index.d.mts.map +1 -1
- package/dist/index.mjs +129 -64
- package/dist/index.mjs.map +1 -1
- package/package.json +5 -5
package/dist/index.d.mts
CHANGED
|
@@ -1,4 +1,4 @@
|
|
|
1
|
-
import { BaseParser, BaseQueryParser, FiltersParseOptions, IFilter, IFilters, ObjectLiteral, PaginationParseOptions, Scalar, SchemaRegistry } from "@rapiq/core";
|
|
1
|
+
import { BaseParser, BaseQueryParser, FiltersParseOptions, IFilter, IFilters, ObjectLiteral, PaginationParseOptions, Parameter, RelationLedger, ResolutionScope, Scalar, SchemaRegistry } from "@rapiq/core";
|
|
2
2
|
import { SimpleFieldsParser, SimplePaginationParser, SimpleRelationsParser, SimpleSortParser } from "@rapiq/parser-simple";
|
|
3
3
|
//#region src/parameter/fields/module.d.ts
|
|
4
4
|
declare class ExpressionFieldsParser extends SimpleFieldsParser {}
|
|
@@ -62,6 +62,7 @@ declare const FILTER_EXPRESSION_KEYWORDS: {
|
|
|
62
62
|
declare const FILTER_FIELD_SEGMENT_PATTERN = "[A-Za-z0-9_](?:[A-Za-z0-9_-]*[A-Za-z0-9_])?";
|
|
63
63
|
//#endregion
|
|
64
64
|
//#region src/parameter/filters/module.d.ts
|
|
65
|
+
type FiltersScope = ResolutionScope<`${Parameter.FILTERS}`>;
|
|
65
66
|
/**
|
|
66
67
|
* @see https://www.jsonapi.net/usage/reading/filtering.html
|
|
67
68
|
*/
|
|
@@ -75,12 +76,35 @@ declare class ExpressionFiltersParser extends BaseParser<FiltersParseOptions, IF
|
|
|
75
76
|
private elemMatchDepth;
|
|
76
77
|
parse<RECORD extends ObjectLiteral = ObjectLiteral>(input: unknown, options?: FiltersParseOptions<RECORD>): IFilters;
|
|
77
78
|
parseAsync<RECORD extends ObjectLiteral = ObjectLiteral>(input: unknown, options?: FiltersParseOptions<RECORD>): Promise<IFilters>;
|
|
79
|
+
parseParameter<RECORD extends ObjectLiteral = ObjectLiteral>(input: unknown, options: FiltersParseOptions<RECORD>, ledger: RelationLedger): IFilters;
|
|
80
|
+
parseParameterAsync<RECORD extends ObjectLiteral = ObjectLiteral>(input: unknown, options: FiltersParseOptions<RECORD>, ledger: RelationLedger): Promise<IFilters>;
|
|
78
81
|
parseExact<RECORD extends ObjectLiteral = ObjectLiteral>(input: unknown, options?: FiltersParseOptions<RECORD>): IFilters | IFilter;
|
|
79
82
|
parseExactAsync<RECORD extends ObjectLiteral = ObjectLiteral>(input: unknown, options?: FiltersParseOptions<RECORD>): Promise<IFilters | IFilter>;
|
|
80
83
|
/**
|
|
81
|
-
*
|
|
82
|
-
*
|
|
83
|
-
*
|
|
84
|
+
* Resolve + leaf-validate + wrap into the root filters node, recording the
|
|
85
|
+
* relation obligations it traverses into `ledger` (the scope's sink). Relation
|
|
86
|
+
* authorization stays with the caller. `scope` is undefined for a schemaless
|
|
87
|
+
* parse (nothing to authorize).
|
|
88
|
+
*/
|
|
89
|
+
protected build<RECORD extends ObjectLiteral = ObjectLiteral>(input: unknown, options: FiltersParseOptions<RECORD>, ledger: RelationLedger): {
|
|
90
|
+
output: IFilters;
|
|
91
|
+
scope?: FiltersScope;
|
|
92
|
+
};
|
|
93
|
+
protected buildAsync<RECORD extends ObjectLiteral = ObjectLiteral>(input: unknown, options: FiltersParseOptions<RECORD>, ledger: RelationLedger): Promise<{
|
|
94
|
+
output: IFilters;
|
|
95
|
+
scope?: FiltersScope;
|
|
96
|
+
}>;
|
|
97
|
+
/**
|
|
98
|
+
* The shared validated-parse of {@link parse} and {@link parseExact}:
|
|
99
|
+
* tokenize + resolve + apply the filters leaf validator, returning the
|
|
100
|
+
* bound scope so the caller can additionally authorize traversed relations.
|
|
101
|
+
*/
|
|
102
|
+
private parseValidated;
|
|
103
|
+
private parseValidatedAsync;
|
|
104
|
+
/**
|
|
105
|
+
* The shared front-end of {@link parseValidated}: tokenize, bind the
|
|
106
|
+
* resolution scope (recording relation obligations into `ledger`) and run
|
|
107
|
+
* the grammar — everything up to (but excluding) validation.
|
|
84
108
|
*/
|
|
85
109
|
private parseSource;
|
|
86
110
|
private buildAbsentOutput;
|
|
@@ -89,6 +113,12 @@ declare class ExpressionFiltersParser extends BaseParser<FiltersParseOptions, IF
|
|
|
89
113
|
private consume;
|
|
90
114
|
private tokenize;
|
|
91
115
|
private parseFilterExpression;
|
|
116
|
+
/**
|
|
117
|
+
* not(expr): the exact complement of the interior (null-inclusive
|
|
118
|
+
* complement law). A single leaf with a complement twin normalizes
|
|
119
|
+
* to the twin, a double negation cancels; everything else stays a
|
|
120
|
+
* first-class NOT node.
|
|
121
|
+
*/
|
|
92
122
|
private parseNotExpression;
|
|
93
123
|
private parseLogicalExpression;
|
|
94
124
|
private parseComparisonExpression;
|
|
@@ -97,15 +127,13 @@ declare class ExpressionFiltersParser extends BaseParser<FiltersParseOptions, IF
|
|
|
97
127
|
/**
|
|
98
128
|
* size(field, n): the field holds an array of exactly n elements
|
|
99
129
|
* (a non-negative integer — the wire is untyped, so the quoted
|
|
100
|
-
* value coerces back to a number).
|
|
101
|
-
* negated size would silently widen and always throws.
|
|
130
|
+
* value coerces back to a number).
|
|
102
131
|
*/
|
|
103
132
|
private parseSizeExpression;
|
|
104
133
|
/**
|
|
105
134
|
* elemMatch(field, expr): field paths inside the interior are
|
|
106
135
|
* relative to the array element; the ITSELF marker addresses the
|
|
107
|
-
* element itself.
|
|
108
|
-
* would silently widen and always throws.
|
|
136
|
+
* element itself.
|
|
109
137
|
*/
|
|
110
138
|
private parseElemMatchExpression;
|
|
111
139
|
/**
|
package/dist/index.d.mts.map
CHANGED
|
@@ -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":";;;cASa,+BAA+B;;;aCFhC;EACR;EAEA;EACA;EAEA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EAEA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;;;;;;;;cASS;;;;;;;;;;;;;;;;;;;;;;;cAwBA
|
|
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":";;;cASa,+BAA+B;;;aCFhC;EACR;EAEA;EACA;EAEA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EAEA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;;;;;;;;cASS;;;;;;;;;;;;;;;;;;;;;;;cAwBA;;;KClBR,eAAe,mBAAmB,UAAU;;;;cA0BpC,gCAAgC,WACzC,qBACA;UAEQ;UAEA;;;;;UAMA;EAIR,MAAM,eAAe,gBAAgB,eACjC,gBACA,UAAS,oBAAoB,UAC7B;EAaW,WAAW,eAAe,gBAAgB,eACrD,gBACA,UAAS,oBAAoB,UAC7B,QAAQ;EAaZ,eAAe,eAAe,gBAAgB,eAC1C,gBACA,SAAS,oBAAoB,SAC7B,QAAQ,iBACR;EAIE,oBAAoB,eAAe,gBAAgB,eACrD,gBACA,SAAS,oBAAoB,SAC7B,QAAQ,iBACR,QAAQ;EAIZ,WAAW,eAAe,gBAAgB,eACtC,gBACA,UAAS,oBAAoB,UAC7B,WAAW;EAMT,gBAAgB,eAAe,gBAAgB,eACjD,gBACA,UAAS,oBAAoB,UAC7B,QAAQ,WAAW;;;;;;;YAYb,MAAM,eAAe,gBAAgB,eAC3C,gBACA,SAAS,oBAAoB,SAC7B,QAAQ;IACN,QAAQ;IAAU,QAAQ;;YAUhB,WAAW,eAAe,gBAAgB,eACtD,gBACA,SAAS,oBAAoB,SAC7B,QAAQ,iBACR;IAAU,QAAQ;IAAU,QAAQ;;;;;;;UAehC;UAqBM;;;;;;UA4BN;UAkCA;UAWA;UAaA;UAIA;UASA;UA0DA;;;;;;;UA2CA;UA0BA;UA2BA;UAmDA;UAwCA;;;;;;UA0CA;;;;;;UA0BA;;;;;;UA8BA;UAqEA;UAOA;UAaA;YAqDE,eAAe,iBAAkB;;;;KCvxBnC;EACR,SAAS;EACT;;KAGQ,6BACR,eAAe,gBAAgB,iBAC/B,oBAAoB;;;KCRZ,mCAAmC;;;cCClC,mCAAmC,uBAAuB;;;cCD1D,kCAAkC;;;cCAlC,6BAA6B;;;cCQ7B,yBAAyB;YACxB,cAAe;YAEf,eAAgB;YAEhB,kBAAmB;YAEnB,iBAAkB;YAElB,YAAa;cAIX,QAAQ"}
|
package/dist/index.mjs
CHANGED
|
@@ -1,4 +1,4 @@
|
|
|
1
|
-
import { BaseParser, BaseQueryParser, DEFAULT_ID, ErrorCode, Filter, FilterCompoundOperator, FilterFieldOperator, Filters, FiltersParseError, ITSELF, MAX_TRAVERSAL_DEPTH, Parameter, ParseError, ResolutionScope, applyFiltersSchemaValidation, applyFiltersSchemaValidationAsync, buildFiltersDefaults, isFilters } from "@rapiq/core";
|
|
1
|
+
import { BaseParser, BaseQueryParser, DEFAULT_ID, ErrorCode, FILTER_OPERATOR_SEMANTICS, Filter, FilterCompoundOperator, FilterFieldOperator, Filters, FiltersParseError, ITSELF, MAX_TRAVERSAL_DEPTH, Parameter, ParseError, RelationsParseError, ResolutionScope, applyFiltersSchemaValidation, applyFiltersSchemaValidationAsync, applyKeySchemaValidation, applyKeySchemaValidationAsync, buildFiltersDefaults, isFilter, isFilters, pruneFiltersByRelations } from "@rapiq/core";
|
|
2
2
|
import { SimpleFieldsParser, SimplePaginationParser, SimpleRelationsParser, SimpleSortParser, parseFilterScalar } from "@rapiq/parser-simple";
|
|
3
3
|
//#region src/parameter/fields/module.ts
|
|
4
4
|
var ExpressionFieldsParser = class extends SimpleFieldsParser {};
|
|
@@ -69,6 +69,20 @@ const FILTER_FIELD_SEGMENT_PATTERN = "[A-Za-z0-9_](?:[A-Za-z0-9_-]*[A-Za-z0-9_])
|
|
|
69
69
|
*/
|
|
70
70
|
const MAX_DEPTH = MAX_TRAVERSAL_DEPTH;
|
|
71
71
|
/**
|
|
72
|
+
* Bidirectional complement twins derived from the semantics table:
|
|
73
|
+
* a not(…) around a single leaf normalizes to the leaf's twin
|
|
74
|
+
* (not(eq) → ne, not(nin) → in) instead of a symbolic NOT node —
|
|
75
|
+
* both lower to the identical plan, the twin is the canonical form.
|
|
76
|
+
*/
|
|
77
|
+
const COMPLEMENT_TWINS = {};
|
|
78
|
+
for (const [operator, semantics] of Object.entries(FILTER_OPERATOR_SEMANTICS)) {
|
|
79
|
+
const twin = semantics.complementOf;
|
|
80
|
+
if (twin) {
|
|
81
|
+
COMPLEMENT_TWINS[operator] = twin;
|
|
82
|
+
COMPLEMENT_TWINS[twin] = operator;
|
|
83
|
+
}
|
|
84
|
+
}
|
|
85
|
+
/**
|
|
72
86
|
* @see https://www.jsonapi.net/usage/reading/filtering.html
|
|
73
87
|
*/
|
|
74
88
|
var ExpressionFiltersParser = class extends BaseParser {
|
|
@@ -80,29 +94,84 @@ var ExpressionFiltersParser = class extends BaseParser {
|
|
|
80
94
|
*/
|
|
81
95
|
elemMatchDepth = 0;
|
|
82
96
|
parse(input, options = {}) {
|
|
83
|
-
|
|
84
|
-
|
|
97
|
+
const ledger = [];
|
|
98
|
+
const { output, scope } = this.build(input, options, ledger);
|
|
99
|
+
if (!scope) return output;
|
|
100
|
+
return pruneFiltersByRelations(output, applyKeySchemaValidation(ledger, options.context, {
|
|
101
|
+
throwOnFailure: scope.relationsThrowOnFailure,
|
|
102
|
+
errors: RelationsParseError
|
|
103
|
+
}), scope.schema);
|
|
85
104
|
}
|
|
86
105
|
async parseAsync(input, options = {}) {
|
|
87
|
-
|
|
88
|
-
|
|
106
|
+
const ledger = [];
|
|
107
|
+
const { output, scope } = await this.buildAsync(input, options, ledger);
|
|
108
|
+
if (!scope) return output;
|
|
109
|
+
return pruneFiltersByRelations(output, await applyKeySchemaValidationAsync(ledger, options.context, {
|
|
110
|
+
throwOnFailure: scope.relationsThrowOnFailure,
|
|
111
|
+
errors: RelationsParseError
|
|
112
|
+
}), scope.schema);
|
|
113
|
+
}
|
|
114
|
+
parseParameter(input, options, ledger) {
|
|
115
|
+
return this.build(input, options, ledger).output;
|
|
116
|
+
}
|
|
117
|
+
async parseParameterAsync(input, options, ledger) {
|
|
118
|
+
return (await this.buildAsync(input, options, ledger)).output;
|
|
89
119
|
}
|
|
90
120
|
parseExact(input, options = {}) {
|
|
91
|
-
|
|
92
|
-
if (!scope) return expr;
|
|
93
|
-
return applyFiltersSchemaValidation(expr, scope.schema, options.context) ?? new Filters(FilterCompoundOperator.AND, buildFiltersDefaults(scope.schema));
|
|
121
|
+
return this.parseValidated(input, options, []).result;
|
|
94
122
|
}
|
|
95
123
|
async parseExactAsync(input, options = {}) {
|
|
96
|
-
|
|
97
|
-
if (!scope) return expr;
|
|
98
|
-
return await applyFiltersSchemaValidationAsync(expr, scope.schema, options.context) ?? new Filters(FilterCompoundOperator.AND, buildFiltersDefaults(scope.schema));
|
|
124
|
+
return (await this.parseValidatedAsync(input, options, [])).result;
|
|
99
125
|
}
|
|
100
126
|
/**
|
|
101
|
-
*
|
|
102
|
-
*
|
|
103
|
-
*
|
|
127
|
+
* Resolve + leaf-validate + wrap into the root filters node, recording the
|
|
128
|
+
* relation obligations it traverses into `ledger` (the scope's sink). Relation
|
|
129
|
+
* authorization stays with the caller. `scope` is undefined for a schemaless
|
|
130
|
+
* parse (nothing to authorize).
|
|
104
131
|
*/
|
|
105
|
-
|
|
132
|
+
build(input, options, ledger) {
|
|
133
|
+
if (input === void 0 || input === null) return { output: this.buildAbsentOutput(options) };
|
|
134
|
+
const { result, scope } = this.parseValidated(input, options, ledger);
|
|
135
|
+
return {
|
|
136
|
+
output: this.wrapRoot(result),
|
|
137
|
+
scope
|
|
138
|
+
};
|
|
139
|
+
}
|
|
140
|
+
async buildAsync(input, options, ledger) {
|
|
141
|
+
if (input === void 0 || input === null) return { output: this.buildAbsentOutput(options) };
|
|
142
|
+
const { result, scope } = await this.parseValidatedAsync(input, options, ledger);
|
|
143
|
+
return {
|
|
144
|
+
output: this.wrapRoot(result),
|
|
145
|
+
scope
|
|
146
|
+
};
|
|
147
|
+
}
|
|
148
|
+
/**
|
|
149
|
+
* The shared validated-parse of {@link parse} and {@link parseExact}:
|
|
150
|
+
* tokenize + resolve + apply the filters leaf validator, returning the
|
|
151
|
+
* bound scope so the caller can additionally authorize traversed relations.
|
|
152
|
+
*/
|
|
153
|
+
parseValidated(input, options, ledger) {
|
|
154
|
+
const { expr, scope } = this.parseSource(input, options, ledger);
|
|
155
|
+
if (!scope) return { result: expr };
|
|
156
|
+
return {
|
|
157
|
+
result: applyFiltersSchemaValidation(expr, scope.schema, options.context) ?? new Filters(FilterCompoundOperator.AND, buildFiltersDefaults(scope.schema)),
|
|
158
|
+
scope
|
|
159
|
+
};
|
|
160
|
+
}
|
|
161
|
+
async parseValidatedAsync(input, options, ledger) {
|
|
162
|
+
const { expr, scope } = this.parseSource(input, options, ledger);
|
|
163
|
+
if (!scope) return { result: expr };
|
|
164
|
+
return {
|
|
165
|
+
result: await applyFiltersSchemaValidationAsync(expr, scope.schema, options.context) ?? new Filters(FilterCompoundOperator.AND, buildFiltersDefaults(scope.schema)),
|
|
166
|
+
scope
|
|
167
|
+
};
|
|
168
|
+
}
|
|
169
|
+
/**
|
|
170
|
+
* The shared front-end of {@link parseValidated}: tokenize, bind the
|
|
171
|
+
* resolution scope (recording relation obligations into `ledger`) and run
|
|
172
|
+
* the grammar — everything up to (but excluding) validation.
|
|
173
|
+
*/
|
|
174
|
+
parseSource(input, options, ledger) {
|
|
106
175
|
if (typeof input !== "string") throw FiltersParseError.inputInvalid();
|
|
107
176
|
this.pos = 0;
|
|
108
177
|
this.elemMatchDepth = 0;
|
|
@@ -111,7 +180,8 @@ var ExpressionFiltersParser = class extends BaseParser {
|
|
|
111
180
|
if (options.schema || options.strict) scope = ResolutionScope.for(this.registry, Parameter.FILTERS, options.schema, {
|
|
112
181
|
relations: options.relations,
|
|
113
182
|
throwOnFailure: true,
|
|
114
|
-
strict: options.strict
|
|
183
|
+
strict: options.strict,
|
|
184
|
+
obligationSink: ledger
|
|
115
185
|
});
|
|
116
186
|
const expr = this.parseFilterExpression(scope);
|
|
117
187
|
if (this.peek().type !== "EOF") throw FiltersParseError.syntaxInvalid(`Unexpected token: ${this.peek().type}`);
|
|
@@ -181,51 +251,60 @@ var ExpressionFiltersParser = class extends BaseParser {
|
|
|
181
251
|
tokens.push({ type: "EOF" });
|
|
182
252
|
return tokens;
|
|
183
253
|
}
|
|
184
|
-
parseFilterExpression(scope,
|
|
254
|
+
parseFilterExpression(scope, depth = 0) {
|
|
185
255
|
if (depth > MAX_DEPTH) throw FiltersParseError.syntaxInvalid("The maximum nesting depth was exceeded.");
|
|
186
256
|
const token = this.peek();
|
|
187
257
|
switch (token.type) {
|
|
188
|
-
case "NOT": return this.parseNotExpression(scope,
|
|
258
|
+
case "NOT": return this.parseNotExpression(scope, depth);
|
|
189
259
|
case "AND":
|
|
190
|
-
case "OR": return this.parseLogicalExpression(scope,
|
|
260
|
+
case "OR": return this.parseLogicalExpression(scope, depth);
|
|
191
261
|
case "eq":
|
|
192
262
|
case "gt":
|
|
193
263
|
case "gte":
|
|
194
264
|
case "lt":
|
|
195
|
-
case "lte": return this.parseComparisonExpression(scope
|
|
265
|
+
case "lte": return this.parseComparisonExpression(scope);
|
|
196
266
|
case "like":
|
|
197
267
|
case "startsWith":
|
|
198
|
-
case "endsWith": return this.parseMatchExpression(scope
|
|
268
|
+
case "endsWith": return this.parseMatchExpression(scope);
|
|
199
269
|
case "in":
|
|
200
|
-
case "nin": return this.parseInExpression(scope
|
|
201
|
-
case "elemMatch": return this.parseElemMatchExpression(scope,
|
|
202
|
-
case "size": return this.parseSizeExpression(scope
|
|
270
|
+
case "nin": return this.parseInExpression(scope);
|
|
271
|
+
case "elemMatch": return this.parseElemMatchExpression(scope, depth);
|
|
272
|
+
case "size": return this.parseSizeExpression(scope);
|
|
203
273
|
default: throw FiltersParseError.syntaxInvalid(`Unexpected token in filter expression: ${token.type}`);
|
|
204
274
|
}
|
|
205
275
|
}
|
|
206
|
-
|
|
276
|
+
/**
|
|
277
|
+
* not(expr): the exact complement of the interior (null-inclusive
|
|
278
|
+
* complement law). A single leaf with a complement twin normalizes
|
|
279
|
+
* to the twin, a double negation cancels; everything else stays a
|
|
280
|
+
* first-class NOT node.
|
|
281
|
+
*/
|
|
282
|
+
parseNotExpression(scope, depth = 0) {
|
|
207
283
|
this.consume("NOT");
|
|
208
284
|
this.consume("LPAREN");
|
|
209
|
-
const expr = this.parseFilterExpression(scope,
|
|
285
|
+
const expr = this.parseFilterExpression(scope, depth + 1);
|
|
210
286
|
this.consume("RPAREN");
|
|
211
|
-
|
|
287
|
+
if (isFilter(expr)) {
|
|
288
|
+
const twin = COMPLEMENT_TWINS[expr.operator];
|
|
289
|
+
if (twin) return new Filter(twin, expr.field, expr.value);
|
|
290
|
+
}
|
|
291
|
+
if (isFilters(expr, FilterCompoundOperator.NOT) && expr.value.length === 1) return expr.value[0];
|
|
292
|
+
return new Filters(FilterCompoundOperator.NOT, [expr]);
|
|
212
293
|
}
|
|
213
|
-
parseLogicalExpression(scope,
|
|
214
|
-
|
|
294
|
+
parseLogicalExpression(scope, depth = 0) {
|
|
295
|
+
const op = this.consume().type;
|
|
215
296
|
if (op !== "AND" && op !== "OR") throw FiltersParseError.syntaxInvalid("Expected AND or OR token type.");
|
|
216
297
|
this.consume("LPAREN");
|
|
217
|
-
const expressions = [this.parseFilterExpression(scope,
|
|
298
|
+
const expressions = [this.parseFilterExpression(scope, depth + 1)];
|
|
218
299
|
while (this.peek().type === "COMMA") {
|
|
219
300
|
this.consume("COMMA");
|
|
220
|
-
expressions.push(this.parseFilterExpression(scope,
|
|
301
|
+
expressions.push(this.parseFilterExpression(scope, depth + 1));
|
|
221
302
|
}
|
|
222
303
|
this.consume("RPAREN");
|
|
223
|
-
if (negation) if (op === "AND") op = "OR";
|
|
224
|
-
else op = "AND";
|
|
225
304
|
if (op === "AND") return new Filters(FilterCompoundOperator.AND, expressions);
|
|
226
305
|
return new Filters(FilterCompoundOperator.OR, expressions);
|
|
227
306
|
}
|
|
228
|
-
parseComparisonExpression(scope
|
|
307
|
+
parseComparisonExpression(scope) {
|
|
229
308
|
const op = this.consume().type;
|
|
230
309
|
this.consume("LPAREN");
|
|
231
310
|
const left = this.parseExpressionFieldChain(scope);
|
|
@@ -233,25 +312,15 @@ var ExpressionFiltersParser = class extends BaseParser {
|
|
|
233
312
|
const right = this.parseExpressionValue();
|
|
234
313
|
this.consume("RPAREN");
|
|
235
314
|
switch (op) {
|
|
236
|
-
case "eq":
|
|
237
|
-
|
|
238
|
-
|
|
239
|
-
case "
|
|
240
|
-
|
|
241
|
-
return new Filter(FilterFieldOperator.GREATER_THAN, left, right);
|
|
242
|
-
case "gte":
|
|
243
|
-
if (negation) return new Filter(FilterFieldOperator.LESS_THAN, left, right);
|
|
244
|
-
return new Filter(FilterFieldOperator.GREATER_THAN_EQUAL, left, right);
|
|
245
|
-
case "lt":
|
|
246
|
-
if (negation) return new Filter(FilterFieldOperator.GREATER_THAN_EQUAL, left, right);
|
|
247
|
-
return new Filter(FilterFieldOperator.LESS_THAN, left, right);
|
|
248
|
-
case "lte":
|
|
249
|
-
if (negation) return new Filter(FilterFieldOperator.GREATER_THAN, left, right);
|
|
250
|
-
return new Filter(FilterFieldOperator.LESS_THAN_EQUAL, left, right);
|
|
315
|
+
case "eq": return new Filter(FilterFieldOperator.EQUAL, left, right);
|
|
316
|
+
case "gt": return new Filter(FilterFieldOperator.GREATER_THAN, left, right);
|
|
317
|
+
case "gte": return new Filter(FilterFieldOperator.GREATER_THAN_EQUAL, left, right);
|
|
318
|
+
case "lt": return new Filter(FilterFieldOperator.LESS_THAN, left, right);
|
|
319
|
+
case "lte": return new Filter(FilterFieldOperator.LESS_THAN_EQUAL, left, right);
|
|
251
320
|
}
|
|
252
321
|
throw FiltersParseError.syntaxInvalid(`Token type ${op} not supported as comparison operator.`);
|
|
253
322
|
}
|
|
254
|
-
parseMatchExpression(scope
|
|
323
|
+
parseMatchExpression(scope) {
|
|
255
324
|
const op = this.consume().type;
|
|
256
325
|
this.consume("LPAREN");
|
|
257
326
|
const field = this.parseExpressionFieldChain(scope);
|
|
@@ -261,12 +330,12 @@ var ExpressionFiltersParser = class extends BaseParser {
|
|
|
261
330
|
const normalized = this.normalizeValue(text);
|
|
262
331
|
if (typeof normalized !== "string") throw FiltersParseError.keyValueInvalid(field);
|
|
263
332
|
switch (op) {
|
|
264
|
-
case "like": return new Filter(
|
|
265
|
-
case "endsWith": return new Filter(
|
|
266
|
-
default: return new Filter(
|
|
333
|
+
case "like": return new Filter(FilterFieldOperator.CONTAINS, field, normalized);
|
|
334
|
+
case "endsWith": return new Filter(FilterFieldOperator.ENDS_WITH, field, normalized);
|
|
335
|
+
default: return new Filter(FilterFieldOperator.STARTS_WITH, field, normalized);
|
|
267
336
|
}
|
|
268
337
|
}
|
|
269
|
-
parseInExpression(scope
|
|
338
|
+
parseInExpression(scope) {
|
|
270
339
|
const token = this.peek();
|
|
271
340
|
if (token.type === "nin") this.consume("nin");
|
|
272
341
|
else this.consume("in");
|
|
@@ -278,17 +347,15 @@ var ExpressionFiltersParser = class extends BaseParser {
|
|
|
278
347
|
values.push(this.parseExpressionValue());
|
|
279
348
|
}
|
|
280
349
|
this.consume("RPAREN");
|
|
281
|
-
if (token.type === "nin"
|
|
350
|
+
if (token.type === "nin") return new Filter(FilterFieldOperator.NOT_IN, field, values);
|
|
282
351
|
return new Filter(FilterFieldOperator.IN, field, values);
|
|
283
352
|
}
|
|
284
353
|
/**
|
|
285
354
|
* size(field, n): the field holds an array of exactly n elements
|
|
286
355
|
* (a non-negative integer — the wire is untyped, so the quoted
|
|
287
|
-
* value coerces back to a number).
|
|
288
|
-
* negated size would silently widen and always throws.
|
|
356
|
+
* value coerces back to a number).
|
|
289
357
|
*/
|
|
290
|
-
parseSizeExpression(scope
|
|
291
|
-
if (negation) throw FiltersParseError.operatorUnsupported("size");
|
|
358
|
+
parseSizeExpression(scope) {
|
|
292
359
|
this.consume("size");
|
|
293
360
|
this.consume("LPAREN");
|
|
294
361
|
const field = this.parseExpressionFieldChain(scope);
|
|
@@ -301,11 +368,9 @@ var ExpressionFiltersParser = class extends BaseParser {
|
|
|
301
368
|
/**
|
|
302
369
|
* elemMatch(field, expr): field paths inside the interior are
|
|
303
370
|
* relative to the array element; the ITSELF marker addresses the
|
|
304
|
-
* element itself.
|
|
305
|
-
* would silently widen and always throws.
|
|
371
|
+
* element itself.
|
|
306
372
|
*/
|
|
307
|
-
parseElemMatchExpression(scope,
|
|
308
|
-
if (negation) throw FiltersParseError.operatorUnsupported("elemMatch");
|
|
373
|
+
parseElemMatchExpression(scope, depth = 0) {
|
|
309
374
|
this.consume("elemMatch");
|
|
310
375
|
this.consume("LPAREN");
|
|
311
376
|
const target = this.parseElemMatchTarget(scope);
|
|
@@ -313,7 +378,7 @@ var ExpressionFiltersParser = class extends BaseParser {
|
|
|
313
378
|
this.elemMatchDepth += 1;
|
|
314
379
|
let condition;
|
|
315
380
|
try {
|
|
316
|
-
condition = this.parseFilterExpression(target.scope,
|
|
381
|
+
condition = this.parseFilterExpression(target.scope, depth + 1);
|
|
317
382
|
} finally {
|
|
318
383
|
this.elemMatchDepth -= 1;
|
|
319
384
|
}
|
package/dist/index.mjs.map
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"index.mjs","names":[],"sources":["../src/parameter/fields/module.ts","../src/parameter/filters/constants.ts","../src/parameter/filters/module.ts","../src/parameter/pagination/module.ts","../src/parameter/relations/module.ts","../src/parameter/sorts/module.ts","../src/module.ts"],"sourcesContent":["/*\n * Copyright (c) 2025-2025.\n * Author Peter Placzek (tada5hi)\n * For the full copyright and license information,\n * view the LICENSE file that was distributed with this source code.\n */\n\nimport { SimpleFieldsParser } from '@rapiq/parser-simple';\n\nexport class ExpressionFieldsParser extends SimpleFieldsParser {\n\n}\n","/*\n * Copyright (c) 2025-2026.\n * Author Peter Placzek (tada5hi)\n * For the full copyright and license information,\n * view the LICENSE file that was distributed with this source code.\n */\n\nexport enum FilterTokenType {\n NOT = 'NOT',\n\n AND = 'AND',\n OR = 'OR',\n\n EQUAL = 'eq',\n GREATER_THAN = 'gt',\n GREATER_OR_EQUAL = 'gte',\n LESS_THAN = 'lt',\n LESS_OR_EQUAL = 'lte',\n CONTAINS = 'like',\n STARTS_WITH = 'startsWith',\n ENDS_WITH = 'endsWith',\n IN = 'in',\n NIN = 'nin',\n ELEM_MATCH = 'elemMatch',\n SIZE = 'size',\n\n FIELD = 'FIELD',\n ITSELF = 'ITSELF',\n ESCAPED_TEXT = 'ESCAPED_TEXT',\n NULL = 'NULL',\n LPAREN = 'LPAREN',\n RPAREN = 'RPAREN',\n COMMA = 'COMMA',\n DOT = 'DOT',\n EOF = 'EOF',\n}\n\n/**\n * Grammar keywords of the expression dialect mapped to the token\n * they classify as. The tokenizer classifies whole identifiers\n * against this map; encoders consume its keys to reject field\n * segments that would tokenize as an operator on decode.\n */\nexport const FILTER_EXPRESSION_KEYWORDS = {\n not: FilterTokenType.NOT,\n and: FilterTokenType.AND,\n or: FilterTokenType.OR,\n eq: FilterTokenType.EQUAL,\n gt: FilterTokenType.GREATER_THAN,\n gte: FilterTokenType.GREATER_OR_EQUAL,\n lt: FilterTokenType.LESS_THAN,\n lte: FilterTokenType.LESS_OR_EQUAL,\n contains: FilterTokenType.CONTAINS,\n startsWith: FilterTokenType.STARTS_WITH,\n endsWith: FilterTokenType.ENDS_WITH,\n in: FilterTokenType.IN,\n nin: FilterTokenType.NIN,\n elemMatch: FilterTokenType.ELEM_MATCH,\n size: FilterTokenType.SIZE,\n null: FilterTokenType.NULL,\n} as const satisfies Record<string, FilterTokenType>;\n\n/**\n * Identifier grammar of a single field segment as accepted by the\n * expression tokenizer (unanchored regex source; consumers anchor\n * it as needed).\n */\nexport const FILTER_FIELD_SEGMENT_PATTERN = '[A-Za-z0-9_](?:[A-Za-z0-9_-]*[A-Za-z0-9_])?';\n","/*\n * Copyright (c) 2021-2025.\n * Author Peter Placzek (tada5hi)\n * For the full copyright and license information,\n * view the LICENSE file that was distributed with this source code.\n */\n\nimport type {\n FiltersParseOptions,\n IFilter,\n IFilters,\n ObjectLiteral,\n Scalar,\n} from '@rapiq/core';\nimport {\n BaseParser,\n DEFAULT_ID,\n ErrorCode,\n Filter,\n FilterCompoundOperator,\n FilterFieldOperator,\n Filters,\n FiltersParseError,\n ITSELF,\n MAX_TRAVERSAL_DEPTH,\n Parameter,\n ParseError,\n ResolutionScope,\n applyFiltersSchemaValidation,\n applyFiltersSchemaValidationAsync,\n buildFiltersDefaults,\n isFilters,\n} from '@rapiq/core';\nimport { parseFilterScalar } from '@rapiq/parser-simple';\nimport {\n FILTER_EXPRESSION_KEYWORDS,\n FILTER_FIELD_SEGMENT_PATTERN,\n FilterTokenType,\n} from './constants';\nimport type { FilterToken } from './types';\n\ntype FiltersScope = ResolutionScope<`${Parameter.FILTERS}`>;\n\n/**\n * Keep recursive expression parsing below the JavaScript call-stack limit and\n * aligned with the schema resolver and Mongo parser traversal caps.\n */\nconst MAX_DEPTH = MAX_TRAVERSAL_DEPTH;\n\n/**\n * @see https://www.jsonapi.net/usage/reading/filtering.html\n */\nexport class ExpressionFiltersParser extends BaseParser<\n FiltersParseOptions,\n IFilters\n> {\n private tokens: FilterToken[] = [];\n\n private pos = 0;\n\n /**\n * How many elemMatch interiors the parser is currently inside —\n * the ITSELF marker is only legal at depth > 0.\n */\n private elemMatchDepth = 0;\n\n // ---------------------------------------------------------\n\n parse<RECORD extends ObjectLiteral = ObjectLiteral>(\n input: unknown,\n options: FiltersParseOptions<RECORD> = {},\n ) : IFilters {\n // absent input is not a failure — schema defaults still apply.\n // an empty string is NOT absent: the dialect is precise, so\n // input like `?filter=` must surface a syntax error.\n if (input === undefined || input === null) {\n return this.buildAbsentOutput(options);\n }\n\n return this.wrapRoot(this.parseExact(input, options));\n }\n\n override async parseAsync<RECORD extends ObjectLiteral = ObjectLiteral>(\n input: unknown,\n options: FiltersParseOptions<RECORD> = {},\n ) : Promise<IFilters> {\n if (input === undefined || input === null) {\n return this.buildAbsentOutput(options);\n }\n\n return this.wrapRoot(await this.parseExactAsync(input, options));\n }\n\n parseExact<RECORD extends ObjectLiteral = ObjectLiteral>(\n input: unknown,\n options: FiltersParseOptions<RECORD> = {},\n ) : IFilters | IFilter {\n const { expr, scope } = this.parseSource(input, options);\n if (!scope) {\n return expr;\n }\n\n const validated = applyFiltersSchemaValidation(expr, scope.schema, options.context);\n\n return validated ?? new Filters(\n FilterCompoundOperator.AND,\n buildFiltersDefaults(scope.schema),\n );\n }\n\n async parseExactAsync<RECORD extends ObjectLiteral = ObjectLiteral>(\n input: unknown,\n options: FiltersParseOptions<RECORD> = {},\n ) : Promise<IFilters | IFilter> {\n const { expr, scope } = this.parseSource(input, options);\n if (!scope) {\n return expr;\n }\n\n const validated = await applyFiltersSchemaValidationAsync(expr, scope.schema, options.context);\n\n return validated ?? new Filters(\n FilterCompoundOperator.AND,\n buildFiltersDefaults(scope.schema),\n );\n }\n\n // ---------------------------------------------------------\n\n /**\n * The shared front-end of {@link parseExact} and\n * {@link parseExactAsync}: tokenize, bind the resolution scope and\n * run the grammar — everything up to (but excluding) validation.\n */\n private parseSource<RECORD extends ObjectLiteral = ObjectLiteral>(\n input: unknown,\n options: FiltersParseOptions<RECORD>,\n ) : { expr: Filters | Filter, scope?: FiltersScope } {\n if (typeof input !== 'string') {\n throw FiltersParseError.inputInvalid();\n }\n\n this.pos = 0;\n this.elemMatchDepth = 0;\n this.tokens = this.tokenize(input);\n\n // expressions are precise — invalid keys always throw,\n // but only when a schema (or the strict override,\n // which rejects undeclared keys) constrains the parse.\n let scope : FiltersScope | undefined;\n if (options.schema || options.strict) {\n scope = ResolutionScope.for(this.registry, Parameter.FILTERS, options.schema, {\n relations: options.relations,\n throwOnFailure: true,\n strict: options.strict,\n }) as FiltersScope;\n }\n\n const expr = this.parseFilterExpression(scope);\n if (this.peek().type !== FilterTokenType.EOF) {\n throw FiltersParseError.syntaxInvalid(`Unexpected token: ${this.peek().type}`);\n }\n\n return { expr, scope };\n }\n\n private buildAbsentOutput<RECORD extends ObjectLiteral = ObjectLiteral>(\n options: FiltersParseOptions<RECORD>,\n ) : IFilters {\n const scope = ResolutionScope.for(this.registry, Parameter.FILTERS, options.schema, { relations: options.relations }) as FiltersScope;\n\n return new Filters(\n FilterCompoundOperator.AND,\n buildFiltersDefaults(scope.schema),\n );\n }\n\n private wrapRoot(expr: IFilters | IFilter) : IFilters {\n if (\n isFilters(expr, FilterCompoundOperator.AND) ||\n isFilters(expr, FilterCompoundOperator.OR)\n ) {\n return expr;\n }\n\n return new Filters(FilterCompoundOperator.AND, [expr]);\n }\n\n // ---------------------------------------------------------\n\n private peek(): FilterToken {\n return this.tokens[this.pos] || { type: FilterTokenType.EOF };\n }\n\n private consume(expected?: `${FilterTokenType}`): FilterToken {\n const token = this.peek();\n if (expected && token.type !== expected) {\n throw FiltersParseError.syntaxInvalid(`Expected ${expected}, got ${token.type}`);\n }\n this.pos++;\n return token;\n }\n\n private tokenize(input: string): FilterToken[] {\n const tokens: FilterToken[] = [];\n // keywords are classified from whole identifiers (lookup below) —\n // matching them in the regex would split identifiers that merely\n // start with a keyword (e.g. \"order\" -> \"or\" + \"der\").\n // $-words are reserved markers, never field segments.\n const regex = new RegExp(`\\\\s+|\\\\(|\\\\)|,|\\\\.|'(?:''|[^'])*'|\\\\$[A-Za-z0-9_]*|${FILTER_FIELD_SEGMENT_PATTERN}`, 'g');\n\n let match: RegExpExecArray | null;\n let cursor = 0;\n\n while ((match = regex.exec(input))) {\n if (match.index !== cursor) {\n throw FiltersParseError.syntaxInvalid(`Unexpected character at position ${cursor}.`);\n }\n\n const value = match[0];\n cursor = regex.lastIndex;\n if (/^\\s+$/.test(value)) continue;\n\n switch (value) {\n case '(': tokens.push({ type: FilterTokenType.LPAREN }); break;\n case ')': tokens.push({ type: FilterTokenType.RPAREN }); break;\n case ',': tokens.push({ type: FilterTokenType.COMMA }); break;\n case '.': tokens.push({ type: FilterTokenType.DOT }); break;\n default:\n if (value.startsWith('$')) {\n if (value !== ITSELF) {\n throw FiltersParseError.syntaxInvalid(`The marker ${value} is unknown.`);\n }\n\n tokens.push({ type: FilterTokenType.ITSELF });\n break;\n }\n\n // own-property check: exotic field names inherited from\n // Object.prototype (toString, constructor, ...) stay fields.\n if (Object.prototype.hasOwnProperty.call(FILTER_EXPRESSION_KEYWORDS, value)) {\n tokens.push({ type: FILTER_EXPRESSION_KEYWORDS[value as keyof typeof FILTER_EXPRESSION_KEYWORDS] });\n } else if (\n value.startsWith('\\'') &&\n value.endsWith('\\'')\n ) {\n tokens.push({ type: FilterTokenType.ESCAPED_TEXT, value });\n } else {\n tokens.push({ type: FilterTokenType.FIELD, value });\n }\n }\n }\n\n if (cursor !== input.length) {\n throw FiltersParseError.syntaxInvalid(`Unexpected character at position ${cursor}.`);\n }\n\n tokens.push({ type: FilterTokenType.EOF });\n return tokens;\n }\n\n private parseFilterExpression(\n scope?: FiltersScope,\n negation: boolean = false,\n depth: number = 0,\n ) : Filters | Filter {\n if (depth > MAX_DEPTH) {\n throw FiltersParseError.syntaxInvalid('The maximum nesting depth was exceeded.');\n }\n\n const token = this.peek();\n switch (token.type) {\n case FilterTokenType.NOT:\n return this.parseNotExpression(scope, negation, depth);\n case FilterTokenType.AND:\n case FilterTokenType.OR:\n return this.parseLogicalExpression(scope, negation, depth);\n case FilterTokenType.EQUAL:\n case FilterTokenType.GREATER_THAN:\n case FilterTokenType.GREATER_OR_EQUAL:\n case FilterTokenType.LESS_THAN:\n case FilterTokenType.LESS_OR_EQUAL:\n return this.parseComparisonExpression(scope, negation);\n case FilterTokenType.CONTAINS:\n case FilterTokenType.STARTS_WITH:\n case FilterTokenType.ENDS_WITH:\n return this.parseMatchExpression(scope, negation);\n case FilterTokenType.IN:\n case FilterTokenType.NIN:\n return this.parseInExpression(scope, negation);\n case FilterTokenType.ELEM_MATCH:\n return this.parseElemMatchExpression(scope, negation, depth);\n case FilterTokenType.SIZE:\n return this.parseSizeExpression(scope, negation);\n default:\n throw FiltersParseError.syntaxInvalid(`Unexpected token in filter expression: ${token.type}`);\n }\n }\n\n private parseNotExpression(\n scope?: FiltersScope,\n negation: boolean = false,\n depth: number = 0,\n ): Filters | Filter {\n this.consume(FilterTokenType.NOT);\n this.consume(FilterTokenType.LPAREN);\n const expr = this.parseFilterExpression(scope, !negation, depth + 1);\n this.consume(FilterTokenType.RPAREN);\n\n return expr;\n }\n\n private parseLogicalExpression(\n scope?: FiltersScope,\n negation: boolean = false,\n depth: number = 0,\n ): Filters | Filter {\n let op = this.consume().type; // AND / OR\n if (op !== FilterTokenType.AND && op !== FilterTokenType.OR) {\n throw FiltersParseError.syntaxInvalid('Expected AND or OR token type.');\n }\n\n this.consume(FilterTokenType.LPAREN);\n const expressions: (Filter | Filters)[] = [this.parseFilterExpression(scope, negation, depth + 1)];\n while (this.peek().type === FilterTokenType.COMMA) {\n this.consume(FilterTokenType.COMMA);\n expressions.push(this.parseFilterExpression(scope, negation, depth + 1));\n }\n this.consume(FilterTokenType.RPAREN);\n\n if (negation) {\n if (op === FilterTokenType.AND) {\n op = FilterTokenType.OR;\n } else {\n op = FilterTokenType.AND;\n }\n }\n\n if (op === FilterTokenType.AND) {\n return new Filters(\n FilterCompoundOperator.AND,\n expressions,\n );\n }\n\n return new Filters(FilterCompoundOperator.OR, expressions);\n }\n\n private parseComparisonExpression(\n scope?: FiltersScope,\n negation: boolean = false,\n ): Filters | Filter {\n const op = this.consume().type;\n this.consume(FilterTokenType.LPAREN);\n const left = this.parseExpressionFieldChain(scope);\n this.consume(FilterTokenType.COMMA);\n const right = this.parseExpressionValue();\n this.consume(FilterTokenType.RPAREN);\n\n switch (op) {\n case FilterTokenType.EQUAL: {\n if (negation) {\n return new Filter(\n FilterFieldOperator.NOT_EQUAL,\n left as string,\n right as string,\n );\n }\n\n return new Filter(\n FilterFieldOperator.EQUAL,\n left as string,\n right as string,\n );\n }\n case FilterTokenType.GREATER_THAN: {\n if (negation) {\n return new Filter(\n FilterFieldOperator.LESS_THAN_EQUAL,\n left as string,\n right as string,\n );\n }\n return new Filter(\n FilterFieldOperator.GREATER_THAN,\n left as string,\n right as string,\n );\n }\n case FilterTokenType.GREATER_OR_EQUAL: {\n if (negation) {\n return new Filter(\n FilterFieldOperator.LESS_THAN,\n left as string,\n right as string,\n );\n }\n return new Filter(\n FilterFieldOperator.GREATER_THAN_EQUAL,\n left as string,\n right as string,\n );\n }\n case FilterTokenType.LESS_THAN: {\n if (negation) {\n return new Filter(\n FilterFieldOperator.GREATER_THAN_EQUAL,\n left as string,\n right as string,\n );\n }\n return new Filter(\n FilterFieldOperator.LESS_THAN,\n left as string,\n right as string,\n );\n }\n case FilterTokenType.LESS_OR_EQUAL: {\n if (negation) {\n return new Filter(\n FilterFieldOperator.GREATER_THAN,\n left as string,\n right as string,\n );\n }\n return new Filter(\n FilterFieldOperator.LESS_THAN_EQUAL,\n left as string,\n right as string,\n );\n }\n }\n\n throw FiltersParseError.syntaxInvalid(`Token type ${op} not supported as comparison operator.`);\n }\n\n private parseMatchExpression(\n scope?: FiltersScope,\n negation: boolean = false,\n ): Filters | Filter {\n const op = this.consume().type;\n this.consume(FilterTokenType.LPAREN);\n const field = this.parseExpressionFieldChain(scope);\n this.consume(FilterTokenType.COMMA);\n const text = this.consume(FilterTokenType.ESCAPED_TEXT).value!;\n this.consume(FilterTokenType.RPAREN);\n\n const normalized = this.normalizeValue(text);\n if (typeof normalized !== 'string') {\n throw FiltersParseError.keyValueInvalid(field);\n }\n\n switch (op) {\n case FilterTokenType.CONTAINS: {\n return new Filter(\n negation ?\n FilterFieldOperator.NOT_CONTAINS :\n FilterFieldOperator.CONTAINS,\n field,\n normalized,\n );\n }\n case FilterTokenType.ENDS_WITH: {\n return new Filter(\n negation ?\n FilterFieldOperator.NOT_ENDS_WITH :\n FilterFieldOperator.ENDS_WITH,\n field,\n normalized,\n );\n }\n default: {\n return new Filter(\n negation ?\n FilterFieldOperator.NOT_STARTS_WITH :\n FilterFieldOperator.STARTS_WITH,\n field,\n normalized,\n );\n }\n }\n }\n\n private parseInExpression(\n scope?: FiltersScope,\n negation: boolean = false,\n ): Filters | Filter {\n const token = this.peek();\n if (token.type === FilterTokenType.NIN) {\n this.consume(FilterTokenType.NIN);\n } else {\n this.consume(FilterTokenType.IN);\n }\n\n this.consume(FilterTokenType.LPAREN);\n\n const field = this.parseExpressionFieldChain(scope);\n\n const values: unknown[] = [];\n while (this.peek().type === FilterTokenType.COMMA) {\n this.consume(FilterTokenType.COMMA);\n\n values.push(this.parseExpressionValue());\n }\n this.consume(FilterTokenType.RPAREN);\n\n const notIn = (token.type === FilterTokenType.NIN && !negation) ||\n (token.type === FilterTokenType.IN && negation);\n\n if (notIn) {\n return new Filter(\n FilterFieldOperator.NOT_IN,\n field,\n values,\n );\n }\n\n return new Filter(\n FilterFieldOperator.IN,\n field,\n values,\n );\n }\n\n /**\n * size(field, n): the field holds an array of exactly n elements\n * (a non-negative integer — the wire is untyped, so the quoted\n * value coerces back to a number). There is no complement — a\n * negated size would silently widen and always throws.\n */\n private parseSizeExpression(\n scope?: FiltersScope,\n negation: boolean = false,\n ): Filter {\n if (negation) {\n throw FiltersParseError.operatorUnsupported('size');\n }\n\n this.consume(FilterTokenType.SIZE);\n this.consume(FilterTokenType.LPAREN);\n const field = this.parseExpressionFieldChain(scope);\n this.consume(FilterTokenType.COMMA);\n const value = this.parseExpressionValue();\n this.consume(FilterTokenType.RPAREN);\n\n if (\n typeof value !== 'number' ||\n !Number.isInteger(value) ||\n value < 0\n ) {\n throw FiltersParseError.keyValueInvalid(field);\n }\n\n return new Filter(FilterFieldOperator.SIZE, field, value);\n }\n\n /**\n * elemMatch(field, expr): field paths inside the interior are\n * relative to the array element; the ITSELF marker addresses the\n * element itself. There is no complement — a negated elemMatch\n * would silently widen and always throws.\n */\n private parseElemMatchExpression(\n scope?: FiltersScope,\n negation: boolean = false,\n depth: number = 0,\n ): Filter {\n if (negation) {\n throw FiltersParseError.operatorUnsupported('elemMatch');\n }\n\n this.consume(FilterTokenType.ELEM_MATCH);\n this.consume(FilterTokenType.LPAREN);\n\n const target = this.parseElemMatchTarget(scope);\n\n this.consume(FilterTokenType.COMMA);\n\n this.elemMatchDepth += 1;\n\n let condition : Filters | Filter;\n try {\n condition = this.parseFilterExpression(target.scope, false, depth + 1);\n } finally {\n this.elemMatchDepth -= 1;\n }\n\n this.consume(FilterTokenType.RPAREN);\n\n return new Filter(FilterFieldOperator.ELEM_MATCH, target.field, condition);\n }\n\n /**\n * The field an elemMatch binds plus the interior resolution scope:\n * the related schema when resolvable, otherwise an unbound scope\n * inheriting the current policy (e.g. a JSON array column).\n */\n private parseElemMatchTarget(\n scope?: FiltersScope,\n ): { field: string, scope?: FiltersScope } {\n if (this.peek().type === FilterTokenType.ITSELF) {\n // an elemMatch on the element itself (arrays of arrays);\n // the chain parser enforces the interior-only contract.\n const field = this.parseExpressionFieldChain(scope);\n\n return {\n field,\n scope: scope ? this.buildUnboundScope(scope) : undefined,\n };\n }\n\n const token = this.consume(FilterTokenType.FIELD);\n\n const parts = [token.value!];\n while (this.peek().type === FilterTokenType.DOT) {\n this.consume(FilterTokenType.DOT);\n parts.push(this.consume(FilterTokenType.FIELD).value!);\n }\n\n if (!scope) {\n return { field: parts.join('.') };\n }\n\n // a leading segment matching the schema name addresses the\n // schema itself (mirrors parseExpressionFieldChain).\n if (\n parts.length > 1 &&\n (parts[0] === DEFAULT_ID || parts[0] === scope.schema.name)\n ) {\n parts.shift();\n }\n\n const resolved = scope.resolveKey(parts.join('.'));\n\n /* istanbul ignore next -- the scope always throws */\n if (!resolved.success) {\n throw FiltersParseError.keyInvalid(resolved.input);\n }\n\n const field = [...resolved.path, resolved.name].join('.');\n\n let interior : FiltersScope | undefined;\n try {\n const verdict = resolved.scope.descend(resolved.name);\n if (verdict instanceof ResolutionScope) {\n interior = verdict as FiltersScope;\n }\n } catch (e) {\n // elemMatch on a non-relation field is legal — a missing\n // related schema (thrown as keyPathInvalid, the scope is\n // always throwing) falls back to the unbound scope; every\n // other failure (e.g. relations gating) propagates.\n if (\n !(e instanceof ParseError) ||\n e.code !== ErrorCode.KEY_PATH_INVALID\n ) {\n throw e;\n }\n }\n\n return {\n field,\n scope: interior ?? this.buildUnboundScope(scope),\n };\n }\n\n private buildUnboundScope(current: FiltersScope) : FiltersScope {\n return ResolutionScope.for(this.registry, Parameter.FILTERS, undefined, {\n throwOnFailure: true,\n strict: current.strict,\n }) as FiltersScope;\n }\n\n private parseExpressionValue(): Scalar {\n const token = this.consume();\n\n if (\n token.type !== FilterTokenType.ESCAPED_TEXT &&\n token.type !== FilterTokenType.NULL\n ) {\n throw FiltersParseError.syntaxInvalid(`Unexpected token in value: ${token.type}`);\n }\n\n return this.normalizeValue(token.value ?? 'null');\n }\n\n private parseExpressionFieldChain(\n scope?: FiltersScope,\n ): string {\n if (this.peek().type === FilterTokenType.ITSELF) {\n this.consume(FilterTokenType.ITSELF);\n\n // the marker addresses the element bound by the enclosing\n // elemMatch interior and never resolves against the schema.\n if (this.elemMatchDepth === 0) {\n throw FiltersParseError.keyInvalid(ITSELF);\n }\n\n return ITSELF;\n }\n\n const token = this.consume(FilterTokenType.FIELD);\n if (token.type !== FilterTokenType.FIELD) {\n throw FiltersParseError.syntaxInvalid(`Unexpected token in field chain: ${token.type}`);\n }\n\n const parts = [token.value!];\n\n while (this.peek().type === FilterTokenType.DOT) {\n this.consume(FilterTokenType.DOT);\n parts.push(this.consume(FilterTokenType.FIELD).value!);\n }\n\n if (scope) {\n // a leading segment matching the schema name addresses the\n // schema itself (mirrors the named-group hoisting of the\n // simple filters parser) and is stripped.\n if (\n parts.length > 1 &&\n (parts[0] === DEFAULT_ID || parts[0] === scope.schema.name)\n ) {\n parts.shift();\n }\n\n const resolved = scope.resolveKey(parts.join('.'));\n\n /* istanbul ignore next -- the scope always throws */\n if (!resolved.success) {\n throw FiltersParseError.keyInvalid(resolved.input);\n }\n\n return [...resolved.path, resolved.name].join('.');\n }\n\n return parts.join('.');\n }\n\n // ---------------------------------------------------------\n\n protected normalizeValue(input: unknown) : Scalar {\n if (typeof input === 'string') {\n const trimmed = input.trim();\n if (trimmed.length === 0) {\n return trimmed;\n }\n\n // quoted content is coerced but never comma-split —\n // the expression dialect passes lists as separate args.\n if (\n trimmed.startsWith('\\'') &&\n trimmed.endsWith('\\'') &&\n trimmed.length >= 2\n ) {\n return parseFilterScalar(trimmed.slice(1, -1).replace(/''/g, '\\''));\n }\n\n return parseFilterScalar(trimmed);\n }\n\n if (typeof input === 'number') {\n return input;\n }\n\n if (typeof input === 'undefined' || input === null) {\n return null;\n }\n\n throw new SyntaxError('Value can not be normalized.');\n }\n}\n","/*\n * Copyright (c) 2022-2025.\n * Author Peter Placzek (tada5hi)\n * For the full copyright and license information,\n * view the LICENSE file that was distributed with this source code.\n */\n\nimport { SimplePaginationParser } from '@rapiq/parser-simple';\nimport type { ExpressionPaginationParseOptions } from './types';\n\nexport class ExpressionPaginationParser extends SimplePaginationParser<ExpressionPaginationParseOptions> {\n\n}\n","/*\n * Copyright (c) 2021-2025.\n * Author Peter Placzek (tada5hi)\n * For the full copyright and license information,\n * view the LICENSE file that was distributed with this source code.\n */\n\nimport { SimpleRelationsParser } from '@rapiq/parser-simple';\n\nexport class ExpressionRelationsParser extends SimpleRelationsParser {\n\n}\n","/*\n * Copyright (c) 2021-2025.\n * Author Peter Placzek (tada5hi)\n * For the full copyright and license information,\n * view the LICENSE file that was distributed with this source code.\n */\n\nimport { SimpleSortParser } from '@rapiq/parser-simple';\n\nexport class ExpressionSortParser extends SimpleSortParser {\n\n}\n","/*\n * Copyright (c) 2025.\n * Author Peter Placzek (tada5hi)\n * For the full copyright and license information,\n * view the LICENSE file that was distributed with this source code.\n */\n\nimport type { SchemaRegistry } from '@rapiq/core';\nimport { BaseQueryParser } from '@rapiq/core';\nimport {\n ExpressionFieldsParser,\n ExpressionFiltersParser,\n ExpressionPaginationParser,\n ExpressionRelationsParser,\n ExpressionSortParser,\n} from './parameter';\n\nexport class ExpressionParser extends BaseQueryParser {\n protected fieldsParser : ExpressionFieldsParser;\n\n protected filtersParser : ExpressionFiltersParser;\n\n protected paginationParser : ExpressionPaginationParser;\n\n protected relationsParser : ExpressionRelationsParser;\n\n protected sortParser : ExpressionSortParser;\n\n // -----------------------------------------------------\n\n constructor(input?: SchemaRegistry) {\n super(input);\n\n this.fieldsParser = new ExpressionFieldsParser(this.registry);\n this.filtersParser = new ExpressionFiltersParser(this.registry);\n this.paginationParser = new ExpressionPaginationParser(this.registry);\n this.relationsParser = new ExpressionRelationsParser(this.registry);\n this.sortParser = new ExpressionSortParser(this.registry);\n }\n}\n"],"mappings":";;;AASA,IAAa,yBAAb,cAA4C,mBAAmB,CAE/D;;;ACJA,IAAY,kBAAL,yBAAA,iBAAA;CACH,gBAAA,SAAA;CAEA,gBAAA,SAAA;CACA,gBAAA,QAAA;CAEA,gBAAA,WAAA;CACA,gBAAA,kBAAA;CACA,gBAAA,sBAAA;CACA,gBAAA,eAAA;CACA,gBAAA,mBAAA;CACA,gBAAA,cAAA;CACA,gBAAA,iBAAA;CACA,gBAAA,eAAA;CACA,gBAAA,QAAA;CACA,gBAAA,SAAA;CACA,gBAAA,gBAAA;CACA,gBAAA,UAAA;CAEA,gBAAA,WAAA;CACA,gBAAA,YAAA;CACA,gBAAA,kBAAA;CACA,gBAAA,UAAA;CACA,gBAAA,YAAA;CACA,gBAAA,YAAA;CACA,gBAAA,WAAA;CACA,gBAAA,SAAA;CACA,gBAAA,SAAA;;AACJ,EAAA,CAAA,CAAA;;;;;;;AAQA,MAAa,6BAA6B;CACtC,KAAA;CACA,KAAA;CACA,IAAA;CACA,IAAA;CACA,IAAA;CACA,KAAA;CACA,IAAA;CACA,KAAA;CACA,UAAA;CACA,YAAA;CACA,UAAA;CACA,IAAA;CACA,KAAA;CACA,WAAA;CACA,MAAA;CACA,MAAA;AACJ;;;;;;AAOA,MAAa,+BAA+B;;;;;;;ACpB5C,MAAM,YAAY;;;;AAKlB,IAAa,0BAAb,cAA6C,WAG3C;CACE,SAAgC,CAAC;CAEjC,MAAc;;;;;CAMd,iBAAyB;CAIzB,MACI,OACA,UAAuC,CAAC,GAC/B;EAIT,IAAI,UAAU,KAAA,KAAa,UAAU,MACjC,OAAO,KAAK,kBAAkB,OAAO;EAGzC,OAAO,KAAK,SAAS,KAAK,WAAW,OAAO,OAAO,CAAC;CACxD;CAEA,MAAe,WACX,OACA,UAAuC,CAAC,GACtB;EAClB,IAAI,UAAU,KAAA,KAAa,UAAU,MACjC,OAAO,KAAK,kBAAkB,OAAO;EAGzC,OAAO,KAAK,SAAS,MAAM,KAAK,gBAAgB,OAAO,OAAO,CAAC;CACnE;CAEA,WACI,OACA,UAAuC,CAAC,GACrB;EACnB,MAAM,EAAE,MAAM,UAAU,KAAK,YAAY,OAAO,OAAO;EACvD,IAAI,CAAC,OACD,OAAO;EAKX,OAFkB,6BAA6B,MAAM,MAAM,QAAQ,QAAQ,OAE5D,KAAK,IAAI,QACpB,uBAAuB,KACvB,qBAAqB,MAAM,MAAM,CACrC;CACJ;CAEA,MAAM,gBACF,OACA,UAAuC,CAAC,GACZ;EAC5B,MAAM,EAAE,MAAM,UAAU,KAAK,YAAY,OAAO,OAAO;EACvD,IAAI,CAAC,OACD,OAAO;EAKX,OAAO,MAFiB,kCAAkC,MAAM,MAAM,QAAQ,QAAQ,OAAO,KAEzE,IAAI,QACpB,uBAAuB,KACvB,qBAAqB,MAAM,MAAM,CACrC;CACJ;;;;;;CASA,YACI,OACA,SACiD;EACjD,IAAI,OAAO,UAAU,UACjB,MAAM,kBAAkB,aAAa;EAGzC,KAAK,MAAM;EACX,KAAK,iBAAiB;EACtB,KAAK,SAAS,KAAK,SAAS,KAAK;EAKjC,IAAI;EACJ,IAAI,QAAQ,UAAU,QAAQ,QAC1B,QAAQ,gBAAgB,IAAI,KAAK,UAAU,UAAU,SAAS,QAAQ,QAAQ;GAC1E,WAAW,QAAQ;GACnB,gBAAgB;GAChB,QAAQ,QAAQ;EACpB,CAAC;EAGL,MAAM,OAAO,KAAK,sBAAsB,KAAK;EAC7C,IAAI,KAAK,KAAK,CAAC,CAAC,SAAA,OACZ,MAAM,kBAAkB,cAAc,qBAAqB,KAAK,KAAK,CAAC,CAAC,MAAM;EAGjF,OAAO;GAAE;GAAM;EAAM;CACzB;CAEA,kBACI,SACS;EACT,MAAM,QAAQ,gBAAgB,IAAI,KAAK,UAAU,UAAU,SAAS,QAAQ,QAAQ,EAAE,WAAW,QAAQ,UAAU,CAAC;EAEpH,OAAO,IAAI,QACP,uBAAuB,KACvB,qBAAqB,MAAM,MAAM,CACrC;CACJ;CAEA,SAAiB,MAAqC;EAClD,IACI,UAAU,MAAM,uBAAuB,GAAG,KAC1C,UAAU,MAAM,uBAAuB,EAAE,GAEzC,OAAO;EAGX,OAAO,IAAI,QAAQ,uBAAuB,KAAK,CAAC,IAAI,CAAC;CACzD;CAIA,OAA4B;EACxB,OAAO,KAAK,OAAO,KAAK,QAAQ,EAAE,MAAA,MAA0B;CAChE;CAEA,QAAgB,UAA8C;EAC1D,MAAM,QAAQ,KAAK,KAAK;EACxB,IAAI,YAAY,MAAM,SAAS,UAC3B,MAAM,kBAAkB,cAAc,YAAY,SAAS,QAAQ,MAAM,MAAM;EAEnF,KAAK;EACL,OAAO;CACX;CAEA,SAAiB,OAA8B;EAC3C,MAAM,SAAwB,CAAC;EAK/B,MAAM,QAAQ,IAAI,OAAO,sDAAsD,gCAAgC,GAAG;EAElH,IAAI;EACJ,IAAI,SAAS;EAEb,OAAQ,QAAQ,MAAM,KAAK,KAAK,GAAI;GAChC,IAAI,MAAM,UAAU,QAChB,MAAM,kBAAkB,cAAc,oCAAoC,OAAO,EAAE;GAGvF,MAAM,QAAQ,MAAM;GACpB,SAAS,MAAM;GACf,IAAI,QAAQ,KAAK,KAAK,GAAG;GAEzB,QAAQ,OAAR;IACI,KAAK;KAAK,OAAO,KAAK,EAAE,MAAA,SAA6B,CAAC;KAAG;IACzD,KAAK;KAAK,OAAO,KAAK,EAAE,MAAA,SAA6B,CAAC;KAAG;IACzD,KAAK;KAAK,OAAO,KAAK,EAAE,MAAA,QAA4B,CAAC;KAAG;IACxD,KAAK;KAAK,OAAO,KAAK,EAAE,MAAA,MAA0B,CAAC;KAAG;IACtD;KACI,IAAI,MAAM,WAAW,GAAG,GAAG;MACvB,IAAI,UAAU,QACV,MAAM,kBAAkB,cAAc,cAAc,MAAM,aAAa;MAG3E,OAAO,KAAK,EAAE,MAAA,SAA6B,CAAC;MAC5C;KACJ;KAIA,IAAI,OAAO,UAAU,eAAe,KAAK,4BAA4B,KAAK,GACtE,OAAO,KAAK,EAAE,MAAM,2BAA2B,OAAkD,CAAC;UAC/F,IACH,MAAM,WAAW,GAAI,KACrB,MAAM,SAAS,GAAI,GAEnB,OAAO,KAAK;MAAE,MAAA;MAAoC;KAAM,CAAC;UAEzD,OAAO,KAAK;MAAE,MAAA;MAA6B;KAAM,CAAC;GAE9D;EACJ;EAEA,IAAI,WAAW,MAAM,QACjB,MAAM,kBAAkB,cAAc,oCAAoC,OAAO,EAAE;EAGvF,OAAO,KAAK,EAAE,MAAA,MAA0B,CAAC;EACzC,OAAO;CACX;CAEA,sBACI,OACA,WAAoB,OACpB,QAAgB,GACC;EACjB,IAAI,QAAQ,WACR,MAAM,kBAAkB,cAAc,yCAAyC;EAGnF,MAAM,QAAQ,KAAK,KAAK;EACxB,QAAQ,MAAM,MAAd;GACI,KAAA,OACI,OAAO,KAAK,mBAAmB,OAAO,UAAU,KAAK;GACzD,KAAA;GACA,KAAA,MACI,OAAO,KAAK,uBAAuB,OAAO,UAAU,KAAK;GAC7D,KAAA;GACA,KAAA;GACA,KAAA;GACA,KAAA;GACA,KAAA,OACI,OAAO,KAAK,0BAA0B,OAAO,QAAQ;GACzD,KAAA;GACA,KAAA;GACA,KAAA,YACI,OAAO,KAAK,qBAAqB,OAAO,QAAQ;GACpD,KAAA;GACA,KAAA,OACI,OAAO,KAAK,kBAAkB,OAAO,QAAQ;GACjD,KAAA,aACI,OAAO,KAAK,yBAAyB,OAAO,UAAU,KAAK;GAC/D,KAAA,QACI,OAAO,KAAK,oBAAoB,OAAO,QAAQ;GACnD,SACI,MAAM,kBAAkB,cAAc,0CAA0C,MAAM,MAAM;EACpG;CACJ;CAEA,mBACI,OACA,WAAoB,OACpB,QAAgB,GACA;EAChB,KAAK,QAAA,KAA2B;EAChC,KAAK,QAAA,QAA8B;EACnC,MAAM,OAAO,KAAK,sBAAsB,OAAO,CAAC,UAAU,QAAQ,CAAC;EACnE,KAAK,QAAA,QAA8B;EAEnC,OAAO;CACX;CAEA,uBACI,OACA,WAAoB,OACpB,QAAgB,GACA;EAChB,IAAI,KAAK,KAAK,QAAQ,CAAC,CAAC;EACxB,IAAI,OAAA,SAA8B,OAAA,MAC9B,MAAM,kBAAkB,cAAc,gCAAgC;EAG1E,KAAK,QAAA,QAA8B;EACnC,MAAM,cAAoC,CAAC,KAAK,sBAAsB,OAAO,UAAU,QAAQ,CAAC,CAAC;EACjG,OAAO,KAAK,KAAK,CAAC,CAAC,SAAA,SAAgC;GAC/C,KAAK,QAAA,OAA6B;GAClC,YAAY,KAAK,KAAK,sBAAsB,OAAO,UAAU,QAAQ,CAAC,CAAC;EAC3E;EACA,KAAK,QAAA,QAA8B;EAEnC,IAAI,UACA,IAAI,OAAA,OACA,KAAA;OAEA,KAAA;EAIR,IAAI,OAAA,OACA,OAAO,IAAI,QACP,uBAAuB,KACvB,WACJ;EAGJ,OAAO,IAAI,QAAQ,uBAAuB,IAAI,WAAW;CAC7D;CAEA,0BACI,OACA,WAAoB,OACJ;EAChB,MAAM,KAAK,KAAK,QAAQ,CAAC,CAAC;EAC1B,KAAK,QAAA,QAA8B;EACnC,MAAM,OAAO,KAAK,0BAA0B,KAAK;EACjD,KAAK,QAAA,OAA6B;EAClC,MAAM,QAAQ,KAAK,qBAAqB;EACxC,KAAK,QAAA,QAA8B;EAEnC,QAAQ,IAAR;GACI,KAAA;IACI,IAAI,UACA,OAAO,IAAI,OACP,oBAAoB,WACpB,MACA,KACJ;IAGJ,OAAO,IAAI,OACP,oBAAoB,OACpB,MACA,KACJ;GAEJ,KAAA;IACI,IAAI,UACA,OAAO,IAAI,OACP,oBAAoB,iBACpB,MACA,KACJ;IAEJ,OAAO,IAAI,OACP,oBAAoB,cACpB,MACA,KACJ;GAEJ,KAAA;IACI,IAAI,UACA,OAAO,IAAI,OACP,oBAAoB,WACpB,MACA,KACJ;IAEJ,OAAO,IAAI,OACP,oBAAoB,oBACpB,MACA,KACJ;GAEJ,KAAA;IACI,IAAI,UACA,OAAO,IAAI,OACP,oBAAoB,oBACpB,MACA,KACJ;IAEJ,OAAO,IAAI,OACP,oBAAoB,WACpB,MACA,KACJ;GAEJ,KAAA;IACI,IAAI,UACA,OAAO,IAAI,OACP,oBAAoB,cACpB,MACA,KACJ;IAEJ,OAAO,IAAI,OACP,oBAAoB,iBACpB,MACA,KACJ;EAER;EAEA,MAAM,kBAAkB,cAAc,cAAc,GAAG,uCAAuC;CAClG;CAEA,qBACI,OACA,WAAoB,OACJ;EAChB,MAAM,KAAK,KAAK,QAAQ,CAAC,CAAC;EAC1B,KAAK,QAAA,QAA8B;EACnC,MAAM,QAAQ,KAAK,0BAA0B,KAAK;EAClD,KAAK,QAAA,OAA6B;EAClC,MAAM,OAAO,KAAK,QAAA,cAAoC,CAAC,CAAC;EACxD,KAAK,QAAA,QAA8B;EAEnC,MAAM,aAAa,KAAK,eAAe,IAAI;EAC3C,IAAI,OAAO,eAAe,UACtB,MAAM,kBAAkB,gBAAgB,KAAK;EAGjD,QAAQ,IAAR;GACI,KAAA,QACI,OAAO,IAAI,OACP,WACI,oBAAoB,eACpB,oBAAoB,UACxB,OACA,UACJ;GAEJ,KAAA,YACI,OAAO,IAAI,OACP,WACI,oBAAoB,gBACpB,oBAAoB,WACxB,OACA,UACJ;GAEJ,SACI,OAAO,IAAI,OACP,WACI,oBAAoB,kBACpB,oBAAoB,aACxB,OACA,UACJ;EAER;CACJ;CAEA,kBACI,OACA,WAAoB,OACJ;EAChB,MAAM,QAAQ,KAAK,KAAK;EACxB,IAAI,MAAM,SAAA,OACN,KAAK,QAAA,KAA2B;OAEhC,KAAK,QAAA,IAA0B;EAGnC,KAAK,QAAA,QAA8B;EAEnC,MAAM,QAAQ,KAAK,0BAA0B,KAAK;EAElD,MAAM,SAAoB,CAAC;EAC3B,OAAO,KAAK,KAAK,CAAC,CAAC,SAAA,SAAgC;GAC/C,KAAK,QAAA,OAA6B;GAElC,OAAO,KAAK,KAAK,qBAAqB,CAAC;EAC3C;EACA,KAAK,QAAA,QAA8B;EAKnC,IAHe,MAAM,SAAA,SAAgC,CAAC,YACjD,MAAM,SAAA,QAA+B,UAGtC,OAAO,IAAI,OACP,oBAAoB,QACpB,OACA,MACJ;EAGJ,OAAO,IAAI,OACP,oBAAoB,IACpB,OACA,MACJ;CACJ;;;;;;;CAQA,oBACI,OACA,WAAoB,OACd;EACN,IAAI,UACA,MAAM,kBAAkB,oBAAoB,MAAM;EAGtD,KAAK,QAAA,MAA4B;EACjC,KAAK,QAAA,QAA8B;EACnC,MAAM,QAAQ,KAAK,0BAA0B,KAAK;EAClD,KAAK,QAAA,OAA6B;EAClC,MAAM,QAAQ,KAAK,qBAAqB;EACxC,KAAK,QAAA,QAA8B;EAEnC,IACI,OAAO,UAAU,YACjB,CAAC,OAAO,UAAU,KAAK,KACvB,QAAQ,GAER,MAAM,kBAAkB,gBAAgB,KAAK;EAGjD,OAAO,IAAI,OAAO,oBAAoB,MAAM,OAAO,KAAK;CAC5D;;;;;;;CAQA,yBACI,OACA,WAAoB,OACpB,QAAgB,GACV;EACN,IAAI,UACA,MAAM,kBAAkB,oBAAoB,WAAW;EAG3D,KAAK,QAAA,WAAkC;EACvC,KAAK,QAAA,QAA8B;EAEnC,MAAM,SAAS,KAAK,qBAAqB,KAAK;EAE9C,KAAK,QAAA,OAA6B;EAElC,KAAK,kBAAkB;EAEvB,IAAI;EACJ,IAAI;GACA,YAAY,KAAK,sBAAsB,OAAO,OAAO,OAAO,QAAQ,CAAC;EACzE,UAAU;GACN,KAAK,kBAAkB;EAC3B;EAEA,KAAK,QAAA,QAA8B;EAEnC,OAAO,IAAI,OAAO,oBAAoB,YAAY,OAAO,OAAO,SAAS;CAC7E;;;;;;CAOA,qBACI,OACuC;EACvC,IAAI,KAAK,KAAK,CAAC,CAAC,SAAA,UAKZ,OAAO;GACH,OAHU,KAAK,0BAA0B,KAGrC;GACJ,OAAO,QAAQ,KAAK,kBAAkB,KAAK,IAAI,KAAA;EACnD;EAKJ,MAAM,QAAQ,CAFA,KAAK,QAAA,OAEA,CAAC,CAAC,KAAM;EAC3B,OAAO,KAAK,KAAK,CAAC,CAAC,SAAA,OAA8B;GAC7C,KAAK,QAAA,KAA2B;GAChC,MAAM,KAAK,KAAK,QAAA,OAA6B,CAAC,CAAC,KAAM;EACzD;EAEA,IAAI,CAAC,OACD,OAAO,EAAE,OAAO,MAAM,KAAK,GAAG,EAAE;EAKpC,IACI,MAAM,SAAS,MACd,MAAM,OAAO,cAAc,MAAM,OAAO,MAAM,OAAO,OAEtD,MAAM,MAAM;EAGhB,MAAM,WAAW,MAAM,WAAW,MAAM,KAAK,GAAG,CAAC;;EAGjD,IAAI,CAAC,SAAS,SACV,MAAM,kBAAkB,WAAW,SAAS,KAAK;EAGrD,MAAM,QAAQ,CAAC,GAAG,SAAS,MAAM,SAAS,IAAI,CAAC,CAAC,KAAK,GAAG;EAExD,IAAI;EACJ,IAAI;GACA,MAAM,UAAU,SAAS,MAAM,QAAQ,SAAS,IAAI;GACpD,IAAI,mBAAmB,iBACnB,WAAW;EAEnB,SAAS,GAAG;GAKR,IACI,EAAE,aAAa,eACf,EAAE,SAAS,UAAU,kBAErB,MAAM;EAEd;EAEA,OAAO;GACH;GACA,OAAO,YAAY,KAAK,kBAAkB,KAAK;EACnD;CACJ;CAEA,kBAA0B,SAAsC;EAC5D,OAAO,gBAAgB,IAAI,KAAK,UAAU,UAAU,SAAS,KAAA,GAAW;GACpE,gBAAgB;GAChB,QAAQ,QAAQ;EACpB,CAAC;CACL;CAEA,uBAAuC;EACnC,MAAM,QAAQ,KAAK,QAAQ;EAE3B,IACI,MAAM,SAAA,kBACN,MAAM,SAAA,QAEN,MAAM,kBAAkB,cAAc,8BAA8B,MAAM,MAAM;EAGpF,OAAO,KAAK,eAAe,MAAM,SAAS,MAAM;CACpD;CAEA,0BACI,OACM;EACN,IAAI,KAAK,KAAK,CAAC,CAAC,SAAA,UAAiC;GAC7C,KAAK,QAAA,QAA8B;GAInC,IAAI,KAAK,mBAAmB,GACxB,MAAM,kBAAkB,WAAW,MAAM;GAG7C,OAAO;EACX;EAEA,MAAM,QAAQ,KAAK,QAAA,OAA6B;EAChD,IAAI,MAAM,SAAA,SACN,MAAM,kBAAkB,cAAc,oCAAoC,MAAM,MAAM;EAG1F,MAAM,QAAQ,CAAC,MAAM,KAAM;EAE3B,OAAO,KAAK,KAAK,CAAC,CAAC,SAAA,OAA8B;GAC7C,KAAK,QAAA,KAA2B;GAChC,MAAM,KAAK,KAAK,QAAA,OAA6B,CAAC,CAAC,KAAM;EACzD;EAEA,IAAI,OAAO;GAIP,IACI,MAAM,SAAS,MACd,MAAM,OAAO,cAAc,MAAM,OAAO,MAAM,OAAO,OAEtD,MAAM,MAAM;GAGhB,MAAM,WAAW,MAAM,WAAW,MAAM,KAAK,GAAG,CAAC;;GAGjD,IAAI,CAAC,SAAS,SACV,MAAM,kBAAkB,WAAW,SAAS,KAAK;GAGrD,OAAO,CAAC,GAAG,SAAS,MAAM,SAAS,IAAI,CAAC,CAAC,KAAK,GAAG;EACrD;EAEA,OAAO,MAAM,KAAK,GAAG;CACzB;CAIA,eAAyB,OAAyB;EAC9C,IAAI,OAAO,UAAU,UAAU;GAC3B,MAAM,UAAU,MAAM,KAAK;GAC3B,IAAI,QAAQ,WAAW,GACnB,OAAO;GAKX,IACI,QAAQ,WAAW,GAAI,KACvB,QAAQ,SAAS,GAAI,KACrB,QAAQ,UAAU,GAElB,OAAO,kBAAkB,QAAQ,MAAM,GAAG,EAAE,CAAC,CAAC,QAAQ,OAAO,GAAI,CAAC;GAGtE,OAAO,kBAAkB,OAAO;EACpC;EAEA,IAAI,OAAO,UAAU,UACjB,OAAO;EAGX,IAAI,OAAO,UAAU,eAAe,UAAU,MAC1C,OAAO;EAGX,MAAM,IAAI,YAAY,8BAA8B;CACxD;AACJ;;;ACvvBA,IAAa,6BAAb,cAAgD,uBAAyD,CAEzG;;;ACHA,IAAa,4BAAb,cAA+C,sBAAsB,CAErE;;;ACFA,IAAa,uBAAb,cAA0C,iBAAiB,CAE3D;;;ACMA,IAAa,mBAAb,cAAsC,gBAAgB;CAClD;CAEA;CAEA;CAEA;CAEA;CAIA,YAAY,OAAwB;EAChC,MAAM,KAAK;EAEX,KAAK,eAAe,IAAI,uBAAuB,KAAK,QAAQ;EAC5D,KAAK,gBAAgB,IAAI,wBAAwB,KAAK,QAAQ;EAC9D,KAAK,mBAAmB,IAAI,2BAA2B,KAAK,QAAQ;EACpE,KAAK,kBAAkB,IAAI,0BAA0B,KAAK,QAAQ;EAClE,KAAK,aAAa,IAAI,qBAAqB,KAAK,QAAQ;CAC5D;AACJ"}
|
|
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 IFilter,\n IFilters,\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 ParseError,\n RelationsParseError,\n ResolutionScope,\n applyFiltersSchemaValidation,\n applyFiltersSchemaValidationAsync,\n applyKeySchemaValidation,\n applyKeySchemaValidationAsync,\n buildFiltersDefaults,\n isFilter,\n isFilters,\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 const { output, scope } = this.build(input, options, ledger);\n if (!scope) {\n return output;\n }\n\n return pruneFiltersByRelations(output, applyKeySchemaValidation(ledger, options.context, {\n throwOnFailure: scope.relationsThrowOnFailure,\n errors: RelationsParseError,\n }), scope.schema as FiltersSchema<RECORD>);\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 const { output, scope } = await this.buildAsync(input, options, ledger);\n if (!scope) {\n return output;\n }\n\n return pruneFiltersByRelations(output, await applyKeySchemaValidationAsync(ledger, options.context, {\n throwOnFailure: scope.relationsThrowOnFailure,\n errors: RelationsParseError,\n }), scope.schema as FiltersSchema<RECORD>);\n }\n\n parseParameter<RECORD extends ObjectLiteral = ObjectLiteral>(\n input: unknown,\n options: FiltersParseOptions<RECORD>,\n ledger: RelationLedger,\n ) : IFilters {\n return this.build(input, options, ledger).output;\n }\n\n async parseParameterAsync<RECORD extends ObjectLiteral = ObjectLiteral>(\n input: unknown,\n options: FiltersParseOptions<RECORD>,\n ledger: RelationLedger,\n ) : Promise<IFilters> {\n return (await this.buildAsync(input, options, ledger)).output;\n }\n\n parseExact<RECORD extends ObjectLiteral = ObjectLiteral>(\n input: unknown,\n options: FiltersParseOptions<RECORD> = {},\n ) : IFilters | IFilter {\n // raw exact tree; a standalone caller wanting relation authorization\n // uses parse(). Obligations are discarded, not pooled.\n return this.parseValidated(input, options, []).result;\n }\n\n async parseExactAsync<RECORD extends ObjectLiteral = ObjectLiteral>(\n input: unknown,\n options: FiltersParseOptions<RECORD> = {},\n ) : Promise<IFilters | IFilter> {\n return (await this.parseValidatedAsync(input, options, [])).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 ) : { 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);\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 ) : 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);\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 ) : { result: IFilters | IFilter, 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\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 ) : Promise<{ result: IFilters | IFilter, 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(expr, scope.schema, options.context);\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: 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: IFilters | IFilter) : IFilters {\n if (\n isFilters(expr, FilterCompoundOperator.AND) ||\n isFilters(expr, FilterCompoundOperator.OR)\n ) {\n return expr;\n }\n\n return new Filters(FilterCompoundOperator.AND, [expr]);\n }\n\n // ---------------------------------------------------------\n\n private peek(): FilterToken {\n return this.tokens[this.pos] || { type: FilterTokenType.EOF };\n }\n\n private consume(expected?: `${FilterTokenType}`): FilterToken {\n const token = this.peek();\n if (expected && token.type !== expected) {\n throw FiltersParseError.syntaxInvalid(`Expected ${expected}, got ${token.type}`);\n }\n this.pos++;\n return token;\n }\n\n private tokenize(input: string): FilterToken[] {\n const tokens: FilterToken[] = [];\n // keywords are classified from whole identifiers (lookup below) —\n // matching them in the regex would split identifiers that merely\n // start with a keyword (e.g. \"order\" -> \"or\" + \"der\").\n // $-words are reserved markers, never field segments.\n const regex = new RegExp(`\\\\s+|\\\\(|\\\\)|,|\\\\.|'(?:''|[^'])*'|\\\\$[A-Za-z0-9_]*|${FILTER_FIELD_SEGMENT_PATTERN}`, 'g');\n\n let match: RegExpExecArray | null;\n let cursor = 0;\n\n while ((match = regex.exec(input))) {\n if (match.index !== cursor) {\n throw FiltersParseError.syntaxInvalid(`Unexpected character at position ${cursor}.`);\n }\n\n const value = match[0];\n cursor = regex.lastIndex;\n if (/^\\s+$/.test(value)) continue;\n\n switch (value) {\n case '(': tokens.push({ type: FilterTokenType.LPAREN }); break;\n case ')': tokens.push({ type: FilterTokenType.RPAREN }); break;\n case ',': tokens.push({ type: FilterTokenType.COMMA }); break;\n case '.': tokens.push({ type: FilterTokenType.DOT }); break;\n default:\n if (value.startsWith('$')) {\n if (value !== ITSELF) {\n throw FiltersParseError.syntaxInvalid(`The marker ${value} is unknown.`);\n }\n\n tokens.push({ type: FilterTokenType.ITSELF });\n break;\n }\n\n // own-property check: exotic field names inherited from\n // Object.prototype (toString, constructor, ...) stay fields.\n if (Object.prototype.hasOwnProperty.call(FILTER_EXPRESSION_KEYWORDS, value)) {\n tokens.push({ type: FILTER_EXPRESSION_KEYWORDS[value as keyof typeof FILTER_EXPRESSION_KEYWORDS] });\n } else if (\n value.startsWith('\\'') &&\n value.endsWith('\\'')\n ) {\n tokens.push({ type: FilterTokenType.ESCAPED_TEXT, value });\n } else {\n tokens.push({ type: FilterTokenType.FIELD, value });\n }\n }\n }\n\n if (cursor !== input.length) {\n throw FiltersParseError.syntaxInvalid(`Unexpected character at position ${cursor}.`);\n }\n\n tokens.push({ type: FilterTokenType.EOF });\n return tokens;\n }\n\n private parseFilterExpression(\n scope?: FiltersScope,\n 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 const normalized = this.normalizeValue(text);\n if (typeof normalized !== 'string') {\n throw FiltersParseError.keyValueInvalid(field);\n }\n\n switch (op) {\n case FilterTokenType.CONTAINS: {\n return new Filter(\n 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.isInteger(value) ||\n value < 0\n ) {\n throw FiltersParseError.keyValueInvalid(field);\n }\n\n return new Filter(FilterFieldOperator.SIZE, field, value);\n }\n\n /**\n * elemMatch(field, expr): field paths inside the interior are\n * relative to the array element; the ITSELF marker addresses the\n * element itself.\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 !(e instanceof ParseError) ||\n e.code !== ErrorCode.KEY_PATH_INVALID\n ) {\n throw e;\n }\n }\n\n return {\n field,\n scope: interior ?? this.buildUnboundScope(scope),\n };\n }\n\n private buildUnboundScope(current: FiltersScope) : FiltersScope {\n return ResolutionScope.for(this.registry, Parameter.FILTERS, undefined, {\n throwOnFailure: true,\n strict: current.strict,\n }) as FiltersScope;\n }\n\n private parseExpressionValue(): Scalar {\n const token = this.consume();\n\n if (\n token.type !== FilterTokenType.ESCAPED_TEXT &&\n token.type !== FilterTokenType.NULL\n ) {\n throw FiltersParseError.syntaxInvalid(`Unexpected token in value: ${token.type}`);\n }\n\n return this.normalizeValue(token.value ?? 'null');\n }\n\n private parseExpressionFieldChain(\n scope?: FiltersScope,\n ): string {\n if (this.peek().type === FilterTokenType.ITSELF) {\n this.consume(FilterTokenType.ITSELF);\n\n // the marker addresses the element bound by the enclosing\n // elemMatch interior and never resolves against the schema.\n if (this.elemMatchDepth === 0) {\n throw FiltersParseError.keyInvalid(ITSELF);\n }\n\n return ITSELF;\n }\n\n const token = this.consume(FilterTokenType.FIELD);\n if (token.type !== FilterTokenType.FIELD) {\n throw FiltersParseError.syntaxInvalid(`Unexpected token in field chain: ${token.type}`);\n }\n\n const parts = [token.value!];\n\n while (this.peek().type === FilterTokenType.DOT) {\n this.consume(FilterTokenType.DOT);\n parts.push(this.consume(FilterTokenType.FIELD).value!);\n }\n\n if (scope) {\n // a leading segment matching the schema name addresses the\n // schema itself (mirrors the named-group hoisting of the\n // simple filters parser) and is stripped.\n if (\n parts.length > 1 &&\n (parts[0] === DEFAULT_ID || parts[0] === scope.schema.name)\n ) {\n parts.shift();\n }\n\n const resolved = scope.resolveKey(parts.join('.'));\n\n /* istanbul ignore next -- the scope always throws */\n if (!resolved.success) {\n throw FiltersParseError.keyInvalid(resolved.input);\n }\n\n return [...resolved.path, resolved.name].join('.');\n }\n\n return parts.join('.');\n }\n\n // ---------------------------------------------------------\n\n protected normalizeValue(input: unknown) : Scalar {\n if (typeof input === 'string') {\n const trimmed = input.trim();\n if (trimmed.length === 0) {\n return trimmed;\n }\n\n // quoted content is coerced but never comma-split —\n // the expression dialect passes lists as separate args.\n if (\n trimmed.startsWith('\\'') &&\n trimmed.endsWith('\\'') &&\n trimmed.length >= 2\n ) {\n return parseFilterScalar(trimmed.slice(1, -1).replace(/''/g, '\\''));\n }\n\n return parseFilterScalar(trimmed);\n }\n\n if (typeof input === 'number') {\n return input;\n }\n\n if (typeof input === 'undefined' || input === null) {\n return null;\n }\n\n throw new SyntaxError('Value can not be normalized.');\n }\n}\n","/*\n * Copyright (c) 2022-2025.\n * Author Peter Placzek (tada5hi)\n * For the full copyright and license information,\n * view the LICENSE file that was distributed with this source code.\n */\n\nimport { SimplePaginationParser } from '@rapiq/parser-simple';\nimport type { ExpressionPaginationParseOptions } from './types';\n\nexport class ExpressionPaginationParser extends SimplePaginationParser<ExpressionPaginationParseOptions> {\n\n}\n","/*\n * Copyright (c) 2021-2025.\n * Author Peter Placzek (tada5hi)\n * For the full copyright and license information,\n * view the LICENSE file that was distributed with this source code.\n */\n\nimport { SimpleRelationsParser } from '@rapiq/parser-simple';\n\nexport class ExpressionRelationsParser extends SimpleRelationsParser {\n\n}\n","/*\n * Copyright (c) 2021-2025.\n * Author Peter Placzek (tada5hi)\n * For the full copyright and license information,\n * view the LICENSE file that was distributed with this source code.\n */\n\nimport { SimpleSortParser } from '@rapiq/parser-simple';\n\nexport class ExpressionSortParser extends SimpleSortParser {\n\n}\n","/*\n * Copyright (c) 2025.\n * Author Peter Placzek (tada5hi)\n * For the full copyright and license information,\n * view the LICENSE file that was distributed with this source code.\n */\n\nimport type { SchemaRegistry } from '@rapiq/core';\nimport { BaseQueryParser } from '@rapiq/core';\nimport {\n ExpressionFieldsParser,\n ExpressionFiltersParser,\n ExpressionPaginationParser,\n ExpressionRelationsParser,\n ExpressionSortParser,\n} from './parameter';\n\nexport class ExpressionParser extends BaseQueryParser {\n protected fieldsParser : ExpressionFieldsParser;\n\n protected filtersParser : ExpressionFiltersParser;\n\n protected paginationParser : ExpressionPaginationParser;\n\n protected relationsParser : ExpressionRelationsParser;\n\n protected sortParser : ExpressionSortParser;\n\n // -----------------------------------------------------\n\n constructor(input?: SchemaRegistry) {\n super(input);\n\n this.fieldsParser = new ExpressionFieldsParser(this.registry);\n this.filtersParser = new ExpressionFiltersParser(this.registry);\n this.paginationParser = new ExpressionPaginationParser(this.registry);\n this.relationsParser = new ExpressionRelationsParser(this.registry);\n this.sortParser = new ExpressionSortParser(this.registry);\n }\n}\n"],"mappings":";;;AASA,IAAa,yBAAb,cAA4C,mBAAmB,CAE/D;;;ACJA,IAAY,kBAAL,yBAAA,iBAAA;CACH,gBAAA,SAAA;CAEA,gBAAA,SAAA;CACA,gBAAA,QAAA;CAEA,gBAAA,WAAA;CACA,gBAAA,kBAAA;CACA,gBAAA,sBAAA;CACA,gBAAA,eAAA;CACA,gBAAA,mBAAA;CACA,gBAAA,cAAA;CACA,gBAAA,iBAAA;CACA,gBAAA,eAAA;CACA,gBAAA,QAAA;CACA,gBAAA,SAAA;CACA,gBAAA,gBAAA;CACA,gBAAA,UAAA;CAEA,gBAAA,WAAA;CACA,gBAAA,YAAA;CACA,gBAAA,kBAAA;CACA,gBAAA,UAAA;CACA,gBAAA,YAAA;CACA,gBAAA,YAAA;CACA,gBAAA,WAAA;CACA,gBAAA,SAAA;CACA,gBAAA,SAAA;;AACJ,EAAA,CAAA,CAAA;;;;;;;AAQA,MAAa,6BAA6B;CACtC,KAAA;CACA,KAAA;CACA,IAAA;CACA,IAAA;CACA,IAAA;CACA,KAAA;CACA,IAAA;CACA,KAAA;CACA,UAAA;CACA,YAAA;CACA,UAAA;CACA,IAAA;CACA,KAAA;CACA,WAAA;CACA,MAAA;CACA,MAAA;AACJ;;;;;;AAOA,MAAa,+BAA+B;;;;;;;ACZ5C,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;EACjC,MAAM,EAAE,QAAQ,UAAU,KAAK,MAAM,OAAO,SAAS,MAAM;EAC3D,IAAI,CAAC,OACD,OAAO;EAGX,OAAO,wBAAwB,QAAQ,yBAAyB,QAAQ,QAAQ,SAAS;GACrF,gBAAgB,MAAM;GACtB,QAAQ;EACZ,CAAC,GAAG,MAAM,MAA+B;CAC7C;CAEA,MAAe,WACX,OACA,UAAuC,CAAC,GACtB;EAClB,MAAM,SAA0B,CAAC;EACjC,MAAM,EAAE,QAAQ,UAAU,MAAM,KAAK,WAAW,OAAO,SAAS,MAAM;EACtE,IAAI,CAAC,OACD,OAAO;EAGX,OAAO,wBAAwB,QAAQ,MAAM,8BAA8B,QAAQ,QAAQ,SAAS;GAChG,gBAAgB,MAAM;GACtB,QAAQ;EACZ,CAAC,GAAG,MAAM,MAA+B;CAC7C;CAEA,eACI,OACA,SACA,QACS;EACT,OAAO,KAAK,MAAM,OAAO,SAAS,MAAM,CAAC,CAAC;CAC9C;CAEA,MAAM,oBACF,OACA,SACA,QACkB;EAClB,QAAQ,MAAM,KAAK,WAAW,OAAO,SAAS,MAAM,EAAA,CAAG;CAC3D;CAEA,WACI,OACA,UAAuC,CAAC,GACrB;EAGnB,OAAO,KAAK,eAAe,OAAO,SAAS,CAAC,CAAC,CAAC,CAAC;CACnD;CAEA,MAAM,gBACF,OACA,UAAuC,CAAC,GACZ;EAC5B,QAAQ,MAAM,KAAK,oBAAoB,OAAO,SAAS,CAAC,CAAC,EAAA,CAAG;CAChE;;;;;;;CAUA,MACI,OACA,SACA,QAC2C;EAC3C,IAAI,UAAU,KAAA,KAAa,UAAU,MACjC,OAAO,EAAE,QAAQ,KAAK,kBAAkB,OAAO,EAAE;EAGrD,MAAM,EAAE,QAAQ,UAAU,KAAK,eAAe,OAAO,SAAS,MAAM;EAEpE,OAAO;GAAE,QAAQ,KAAK,SAAS,MAAM;GAAG;EAAM;CAClD;CAEA,MAAgB,WACZ,OACA,SACA,QACoD;EACpD,IAAI,UAAU,KAAA,KAAa,UAAU,MACjC,OAAO,EAAE,QAAQ,KAAK,kBAAkB,OAAO,EAAE;EAGrD,MAAM,EAAE,QAAQ,UAAU,MAAM,KAAK,oBAAoB,OAAO,SAAS,MAAM;EAE/E,OAAO;GAAE,QAAQ,KAAK,SAAS,MAAM;GAAG;EAAM;CAClD;;;;;;CAOA,eACI,OACA,SACA,QACqD;EACrD,MAAM,EAAE,MAAM,UAAU,KAAK,YAAY,OAAO,SAAS,MAAM;EAC/D,IAAI,CAAC,OACD,OAAO,EAAE,QAAQ,KAAK;EAK1B,OAAO;GACH,QAHc,6BAA6B,MAAM,MAAM,QAAQ,QAAQ,OAGvD,KAAK,IAAI,QACrB,uBAAuB,KACvB,qBAAqB,MAAM,MAAM,CACrC;GACA;EACJ;CACJ;CAEA,MAAc,oBACV,OACA,SACA,QAC8D;EAC9D,MAAM,EAAE,MAAM,UAAU,KAAK,YAAY,OAAO,SAAS,MAAM;EAC/D,IAAI,CAAC,OACD,OAAO,EAAE,QAAQ,KAAK;EAK1B,OAAO;GACH,QAAQ,MAHY,kCAAkC,MAAM,MAAM,QAAQ,QAAQ,OAAO,KAGpE,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;GAChB,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,MAAqC;EAClD,IACI,UAAU,MAAM,uBAAuB,GAAG,KAC1C,UAAU,MAAM,uBAAuB,EAAE,GAEzC,OAAO;EAGX,OAAO,IAAI,QAAQ,uBAAuB,KAAK,CAAC,IAAI,CAAC;CACzD;CAIA,OAA4B;EACxB,OAAO,KAAK,OAAO,KAAK,QAAQ,EAAE,MAAA,MAA0B;CAChE;CAEA,QAAgB,UAA8C;EAC1D,MAAM,QAAQ,KAAK,KAAK;EACxB,IAAI,YAAY,MAAM,SAAS,UAC3B,MAAM,kBAAkB,cAAc,YAAY,SAAS,QAAQ,MAAM,MAAM;EAEnF,KAAK;EACL,OAAO;CACX;CAEA,SAAiB,OAA8B;EAC3C,MAAM,SAAwB,CAAC;EAK/B,MAAM,QAAQ,IAAI,OAAO,sDAAsD,gCAAgC,GAAG;EAElH,IAAI;EACJ,IAAI,SAAS;EAEb,OAAQ,QAAQ,MAAM,KAAK,KAAK,GAAI;GAChC,IAAI,MAAM,UAAU,QAChB,MAAM,kBAAkB,cAAc,oCAAoC,OAAO,EAAE;GAGvF,MAAM,QAAQ,MAAM;GACpB,SAAS,MAAM;GACf,IAAI,QAAQ,KAAK,KAAK,GAAG;GAEzB,QAAQ,OAAR;IACI,KAAK;KAAK,OAAO,KAAK,EAAE,MAAA,SAA6B,CAAC;KAAG;IACzD,KAAK;KAAK,OAAO,KAAK,EAAE,MAAA,SAA6B,CAAC;KAAG;IACzD,KAAK;KAAK,OAAO,KAAK,EAAE,MAAA,QAA4B,CAAC;KAAG;IACxD,KAAK;KAAK,OAAO,KAAK,EAAE,MAAA,MAA0B,CAAC;KAAG;IACtD;KACI,IAAI,MAAM,WAAW,GAAG,GAAG;MACvB,IAAI,UAAU,QACV,MAAM,kBAAkB,cAAc,cAAc,MAAM,aAAa;MAG3E,OAAO,KAAK,EAAE,MAAA,SAA6B,CAAC;MAC5C;KACJ;KAIA,IAAI,OAAO,UAAU,eAAe,KAAK,4BAA4B,KAAK,GACtE,OAAO,KAAK,EAAE,MAAM,2BAA2B,OAAkD,CAAC;UAC/F,IACH,MAAM,WAAW,GAAI,KACrB,MAAM,SAAS,GAAI,GAEnB,OAAO,KAAK;MAAE,MAAA;MAAoC;KAAM,CAAC;UAEzD,OAAO,KAAK;MAAE,MAAA;MAA6B;KAAM,CAAC;GAE9D;EACJ;EAEA,IAAI,WAAW,MAAM,QACjB,MAAM,kBAAkB,cAAc,oCAAoC,OAAO,EAAE;EAGvF,OAAO,KAAK,EAAE,MAAA,MAA0B,CAAC;EACzC,OAAO;CACX;CAEA,sBACI,OACA,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;EAEnC,MAAM,aAAa,KAAK,eAAe,IAAI;EAC3C,IAAI,OAAO,eAAe,UACtB,MAAM,kBAAkB,gBAAgB,KAAK;EAGjD,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,UAAU,KAAK,KACvB,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,EAAE,aAAa,eACf,EAAE,SAAS,UAAU,kBAErB,MAAM;EAEd;EAEA,OAAO;GACH;GACA,OAAO,YAAY,KAAK,kBAAkB,KAAK;EACnD;CACJ;CAEA,kBAA0B,SAAsC;EAC5D,OAAO,gBAAgB,IAAI,KAAK,UAAU,UAAU,SAAS,KAAA,GAAW;GACpE,gBAAgB;GAChB,QAAQ,QAAQ;EACpB,CAAC;CACL;CAEA,uBAAuC;EACnC,MAAM,QAAQ,KAAK,QAAQ;EAE3B,IACI,MAAM,SAAA,kBACN,MAAM,SAAA,QAEN,MAAM,kBAAkB,cAAc,8BAA8B,MAAM,MAAM;EAGpF,OAAO,KAAK,eAAe,MAAM,SAAS,MAAM;CACpD;CAEA,0BACI,OACM;EACN,IAAI,KAAK,KAAK,CAAC,CAAC,SAAA,UAAiC;GAC7C,KAAK,QAAA,QAA8B;GAInC,IAAI,KAAK,mBAAmB,GACxB,MAAM,kBAAkB,WAAW,MAAM;GAG7C,OAAO;EACX;EAEA,MAAM,QAAQ,KAAK,QAAA,OAA6B;EAChD,IAAI,MAAM,SAAA,SACN,MAAM,kBAAkB,cAAc,oCAAoC,MAAM,MAAM;EAG1F,MAAM,QAAQ,CAAC,MAAM,KAAM;EAE3B,OAAO,KAAK,KAAK,CAAC,CAAC,SAAA,OAA8B;GAC7C,KAAK,QAAA,KAA2B;GAChC,MAAM,KAAK,KAAK,QAAA,OAA6B,CAAC,CAAC,KAAM;EACzD;EAEA,IAAI,OAAO;GAIP,IACI,MAAM,SAAS,MACd,MAAM,OAAO,cAAc,MAAM,OAAO,MAAM,OAAO,OAEtD,MAAM,MAAM;GAGhB,MAAM,WAAW,MAAM,WAAW,MAAM,KAAK,GAAG,CAAC;;GAGjD,IAAI,CAAC,SAAS,SACV,MAAM,kBAAkB,WAAW,SAAS,KAAK;GAGrD,OAAO,CAAC,GAAG,SAAS,MAAM,SAAS,IAAI,CAAC,CAAC,KAAK,GAAG;EACrD;EAEA,OAAO,MAAM,KAAK,GAAG;CACzB;CAIA,eAAyB,OAAyB;EAC9C,IAAI,OAAO,UAAU,UAAU;GAC3B,MAAM,UAAU,MAAM,KAAK;GAC3B,IAAI,QAAQ,WAAW,GACnB,OAAO;GAKX,IACI,QAAQ,WAAW,GAAI,KACvB,QAAQ,SAAS,GAAI,KACrB,QAAQ,UAAU,GAElB,OAAO,kBAAkB,QAAQ,MAAM,GAAG,EAAE,CAAC,CAAC,QAAQ,OAAO,GAAI,CAAC;GAGtE,OAAO,kBAAkB,OAAO;EACpC;EAEA,IAAI,OAAO,UAAU,UACjB,OAAO;EAGX,IAAI,OAAO,UAAU,eAAe,UAAU,MAC1C,OAAO;EAGX,MAAM,IAAI,YAAY,8BAA8B;CACxD;AACJ;;;ACrzBA,IAAa,6BAAb,cAAgD,uBAAyD,CAEzG;;;ACHA,IAAa,4BAAb,cAA+C,sBAAsB,CAErE;;;ACFA,IAAa,uBAAb,cAA0C,iBAAiB,CAE3D;;;ACMA,IAAa,mBAAb,cAAsC,gBAAgB;CAClD;CAEA;CAEA;CAEA;CAEA;CAIA,YAAY,OAAwB;EAChC,MAAM,KAAK;EAEX,KAAK,eAAe,IAAI,uBAAuB,KAAK,QAAQ;EAC5D,KAAK,gBAAgB,IAAI,wBAAwB,KAAK,QAAQ;EAC9D,KAAK,mBAAmB,IAAI,2BAA2B,KAAK,QAAQ;EACpE,KAAK,kBAAkB,IAAI,0BAA0B,KAAK,QAAQ;EAClE,KAAK,aAAa,IAAI,qBAAqB,KAAK,QAAQ;CAC5D;AACJ"}
|
package/package.json
CHANGED
|
@@ -1,6 +1,6 @@
|
|
|
1
1
|
{
|
|
2
2
|
"name": "@rapiq/parser-expression",
|
|
3
|
-
"version": "2.0.0-beta.
|
|
3
|
+
"version": "2.0.0-beta.7",
|
|
4
4
|
"description": "A package containing an expression parser",
|
|
5
5
|
"type": "module",
|
|
6
6
|
"main": "dist/index.mjs",
|
|
@@ -16,12 +16,12 @@
|
|
|
16
16
|
"dist/"
|
|
17
17
|
],
|
|
18
18
|
"devDependencies": {
|
|
19
|
-
"@rapiq/core": "^2.0.0-beta.
|
|
20
|
-
"@rapiq/parser-simple": "^2.0.0-beta.
|
|
19
|
+
"@rapiq/core": "^2.0.0-beta.7",
|
|
20
|
+
"@rapiq/parser-simple": "^2.0.0-beta.7"
|
|
21
21
|
},
|
|
22
22
|
"peerDependencies": {
|
|
23
|
-
"@rapiq/core": "^2.0.0-beta.
|
|
24
|
-
"@rapiq/parser-simple": "^2.0.0-beta.
|
|
23
|
+
"@rapiq/core": "^2.0.0-beta.7",
|
|
24
|
+
"@rapiq/parser-simple": "^2.0.0-beta.7"
|
|
25
25
|
},
|
|
26
26
|
"scripts": {
|
|
27
27
|
"build:types": "tsc --noEmit -p tsconfig.build.json",
|