@adonis-agora/filter 0.0.0-beta-20261110131309

package/dist/src/runner.d.ts

@@ -0,0 +1,65 @@
+import { type CursorParams, type ResolvedCursor } from './cursor.js';
+import { type QueryBuilderLike } from './lucid_adapter.js';
+import type { FilterConfig, FilterInput } from './types.js';
+/** The resolved offset pagination to hand to Lucid's `query.paginate(page, size)`. */
+export interface ResolvedPagination {
+    page: number;
+    size: number;
+}
+/**
+ * Resolve aliases, structurally validate, and prune `input.filters`/`input.search`
+ * against the allow-lists, applying the survivors to the builder. Shared by both
+ * {@link applyFilter} (offset) and {@link applyCursor} (keyset) so the security
+ * boundary is identical for either pagination style.
+ */
+export declare function applyFilterConditions(qb: QueryBuilderLike, input: FilterInput, config: FilterConfig): void;
+/**
+ * Resolve the alias-mapped, allow-listed distinct fields for the request. A
+ * distinct field is a projected column, so it is gated by the SAME `allowed`
+ * boundary a `where` field is — aliases resolve first, then the allow-list;
+ * unknown fields are dropped (or rejected under `throwOnInvalid`).
+ *
+ * A field that clears the allow-list but is not projectable
+ * ({@link isProjectable}) is dropped/rejected too, with its OWN message: it is
+ * not an allow-list problem, so pointing the reader at `allowed` would send them
+ * to edit the wrong thing.
+ */
+export declare function resolveSafeDistinct(fields: string[], config: FilterConfig): string[];
+/**
+ * Apply a parsed {@link FilterInput} to a Lucid query builder under a
+ * {@link FilterConfig} policy, and return the resolved offset pagination.
+ *
+ * The allow-lists are the security boundary — fields not in `allowed`/`sortable`/
+ * `searchable` are dropped (or rejected with `throwOnInvalid`). Pagination is
+ * returned (not applied) so the caller drives Lucid's `query.paginate()`:
+ *
+ * ```ts
+ * const { page, size } = applyFilter(Users.query(), input, { allowed: ['name', 'age'] })
+ * const result = await Users.query()... // or: await query.paginate(page, size)
+ * ```
+ */
+export declare function applyFilter(qb: QueryBuilderLike, input: FilterInput, config: FilterConfig): ResolvedPagination;
+/** Per-call policy for {@link applyCursor} — a {@link FilterConfig} plus the keyset tiebreaker. */
+export interface CursorConfig extends FilterConfig {
+    /** Primary-key column appended to the keyset as a stable tiebreaker. Default `'id'`. */
+    primaryKey?: string;
+}
+/**
+ * Apply a parsed {@link FilterInput} plus {@link CursorParams} to a Lucid query
+ * builder as a **keyset (cursor) page** under a {@link CursorConfig} policy.
+ *
+ * Filters/search go through the same allow-list boundary as {@link applyFilter}.
+ * The effective (allow-listed) sort, plus the primary-key tiebreaker, forms the
+ * keyset; a supplied `after`/`before` cursor becomes a row-value seek predicate,
+ * and the builder is ordered + limited to `size + 1` (one extra row to detect a
+ * further page). Feed the fetched rows and the returned {@link ResolvedCursor}
+ * to {@link buildCursorPage} to assemble the page and its boundary cursors:
+ *
+ * ```ts
+ * const resolved = applyCursor(Users.query(), input, { allowed: ['name'], primaryKey: 'id' })
+ * const rows = await Users.query()...exec()
+ * const page = buildCursorPage(rows, resolved)
+ * ```
+ */
+export declare function applyCursor(qb: QueryBuilderLike, input: FilterInput & CursorParams, config: CursorConfig): ResolvedCursor;
+//# sourceMappingURL=runner.d.ts.map

package/dist/src/runner.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"runner.d.ts","sourceRoot":"","sources":["../../src/runner.ts"],"names":[],"mappings":"AAEA,OAAO,EAEL,KAAK,YAAY,EAEjB,KAAK,cAAc,EAEpB,MAAM,aAAa,CAAC;AAOrB,OAAO,EAUL,KAAK,gBAAgB,EAEtB,MAAM,oBAAoB,CAAC;AAE5B,OAAO,KAAK,EAA6B,YAAY,EAAE,WAAW,EAAY,MAAM,YAAY,CAAC;AAGjG,sFAAsF;AACtF,MAAM,WAAW,kBAAkB;IACjC,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;CACd;AAyID;;;;;GAKG;AACH,wBAAgB,qBAAqB,CACnC,EAAE,EAAE,gBAAgB,EACpB,KAAK,EAAE,WAAW,EAClB,MAAM,EAAE,YAAY,GACnB,IAAI,CA4DN;AAyBD;;;;;;;;;;GAUG;AACH,wBAAgB,mBAAmB,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE,MAAM,EAAE,YAAY,GAAG,MAAM,EAAE,CA0BpF;AAwDD;;;;;;;;;;;;GAYG;AACH,wBAAgB,WAAW,CACzB,EAAE,EAAE,gBAAgB,EACpB,KAAK,EAAE,WAAW,EAClB,MAAM,EAAE,YAAY,GACnB,kBAAkB,CAmCpB;AAED,mGAAmG;AACnG,MAAM,WAAW,YAAa,SAAQ,YAAY;IAChD,wFAAwF;IACxF,UAAU,CAAC,EAAE,MAAM,CAAC;CACrB;AAED;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAgB,WAAW,CACzB,EAAE,EAAE,gBAAgB,EACpB,KAAK,EAAE,WAAW,GAAG,YAAY,EACjC,MAAM,EAAE,YAAY,GACnB,cAAc,CA0BhB"}

package/dist/src/runner.js

@@ -0,0 +1,371 @@
+import { countExistencePredicate } from './aggregate.js';
+import { coerceFilterValue } from './coerce_value.js';
+import { buildKeyset, decodeCursor, reverseKeyset, } from './cursor.js';
+import { remapDistinctAliases, remapFilterAliases, remapSortAliases, resolveFieldAlias, } from './field_aliases.js';
+import { applyColumnFilters, applyComputedField, applyComputedSort, applyDistinct, applyFullTextSearch, applyKeyset, applySearch, applySort, applyVectorSimilarity, resolveComputedExpression, } from './lucid_adapter.js';
+import { InvalidColumnFilterError, validateColumnFilters } from './validate-column-filter.js';
+function isAllowed(field, allow) {
+    if (allow === '*')
+        return true;
+    if (typeof allow === 'function')
+        return allow(field);
+    return allow.includes(field);
+}
+function clamp(n, min, max) {
+    return Math.min(max, Math.max(min, n));
+}
+/**
+ * Own-property lookup of a declared computed field. A client-supplied field name
+ * is never trusted as a bare map key (prototype-pollution guard) — only an
+ * OWN, non-inherited key resolves to a computed source.
+ */
+function computedKey(computed, field) {
+    return (computed !== undefined &&
+        typeof field === 'string' &&
+        field.length > 0 &&
+        Object.hasOwn(computed, field));
+}
+/**
+ * A top-level filter that targets a declared computed field: a leaf (has a
+ * field, no AND/OR children) whose name is an own key of the computed map.
+ * Computed fields are only recognised at the top level of `input.filters` — the
+ * shape the client emits — never nested inside a boolean group.
+ */
+function isComputedLeaf(filter, computed) {
+    return computedKey(computed, filter.field) && filter.AND === undefined && filter.OR === undefined;
+}
+/**
+ * Operators whose value is a LIKE pattern rather than a column-typed value. Their argument stays a
+ * string no matter what kind the column is declared as — coercing `contains: '3'` on a numeric
+ * column to the number `3` would destroy the pattern the caller asked for.
+ */
+const PATTERN_OPERATORS = new Set([
+    'contains',
+    'notContains',
+    'iContains',
+    'startsWith',
+    'endsWith',
+]);
+/** Operators whose value is a list/tuple — each element is coerced independently. */
+const ARRAY_OPERATORS = new Set(['in', 'notIn', 'isAnyOf', 'between', 'notBetween']);
+/**
+ * Coerce one leaf's value against its declared column kind. Returns `ok` unchanged when the field
+ * has no declared type (backwards compatible), when the operator carries a LIKE pattern, or when
+ * the kind has no contract to enforce. An array-valued operator fails as a whole if ANY element
+ * fails — a partially-coerced list would silently filter on something the client never asked for.
+ */
+function coerceFilterForField(filter, fieldTypes) {
+    const kind = fieldTypes?.[filter.field]?.kind;
+    if (!kind || PATTERN_OPERATORS.has(String(filter.operator))) {
+        return { ok: true, value: filter.value };
+    }
+    if (ARRAY_OPERATORS.has(String(filter.operator)) && Array.isArray(filter.value)) {
+        const out = [];
+        for (const element of filter.value) {
+            const r = coerceFilterValue(element, kind);
+            if (!r.ok)
+                return r;
+            out.push(r.value);
+        }
+        return { ok: true, value: out };
+    }
+    return coerceFilterValue(filter.value, kind);
+}
+/**
+ * Recursively prune a filter against the allow-list. A leaf on a disallowed field
+ * is dropped (or throws when `throwOnInvalid`). Group nodes keep only their
+ * surviving children; a group left empty is itself dropped (returns `null`).
+ */
+function prune(filter, allowed, throwOnInvalid, fieldTypes) {
+    const hasField = typeof filter.field === 'string' && filter.field.length > 0;
+    if (hasField && !isAllowed(filter.field, allowed)) {
+        if (throwOnInvalid) {
+            throw new InvalidColumnFilterError(`Field "${filter.field}" is not filterable.`);
+        }
+        return null;
+    }
+    const next = { field: filter.field, operator: filter.operator };
+    if (filter.value !== undefined) {
+        // The field passed the allow-list; now guard the VALUE. An uncoercible value is treated
+        // exactly like a disallowed field (drop, or throw under `throwOnInvalid`) rather than being
+        // handed to the driver, where Postgres would reject it as a 500 from user input.
+        const coerced = coerceFilterForField(filter, fieldTypes);
+        if (!coerced.ok) {
+            if (throwOnInvalid) {
+                throw new InvalidColumnFilterError(`Value for field "${filter.field}" is invalid: ${coerced.reason}.`);
+            }
+            return null;
+        }
+        next.value = coerced.value;
+    }
+    if (filter.AND) {
+        const kept = filter.AND.map((f) => prune(f, allowed, throwOnInvalid, fieldTypes)).filter((f) => f !== null);
+        if (kept.length > 0)
+            next.AND = kept;
+    }
+    if (filter.OR) {
+        const kept = filter.OR.map((f) => prune(f, allowed, throwOnInvalid, fieldTypes)).filter((f) => f !== null);
+        if (kept.length > 0)
+            next.OR = kept;
+    }
+    // A pure group node (no field of its own) with no surviving children is empty.
+    if (!hasField && next.AND === undefined && next.OR === undefined) {
+        return null;
+    }
+    return next;
+}
+/**
+ * Resolve aliases, structurally validate, and prune `input.filters`/`input.search`
+ * against the allow-lists, applying the survivors to the builder. Shared by both
+ * {@link applyFilter} (offset) and {@link applyCursor} (keyset) so the security
+ * boundary is identical for either pagination style.
+ */
+export function applyFilterConditions(qb, input, config) {
+    const throwOnInvalid = config.throwOnInvalid ?? false;
+    if (input.filters && input.filters.length > 0) {
+        // Computed fields are a separate namespace from real columns: a top-level
+        // leaf on a declared computed key is routed to the computed hook (its
+        // declaration IS its allow-list) and NEVER run through the column
+        // alias/validate/allow-list path below. Everything else is a normal column
+        // filter. Checked before alias resolution so a computed key is not remapped.
+        const columnFilters = [];
+        for (const filter of input.filters) {
+            if (isComputedLeaf(filter, config.computed)) {
+                const source = config.computed?.[filter.field];
+                const existence = countExistencePredicate(source, config.table ?? '', filter);
+                if (existence)
+                    qb.whereRaw(existence);
+                else
+                    applyComputedField(qb, resolveComputedExpression(source, config.table ?? ''), filter);
+            }
+            else {
+                columnFilters.push(filter);
+            }
+        }
+        if (columnFilters.length > 0) {
+            // Alias resolution runs FIRST — the allow-list, validation and query builder
+            // all see the resolved target column, never the client-facing alias key.
+            const aliased = config.aliases
+                ? columnFilters.map((f) => remapFilterAliases(f, config.aliases))
+                : columnFilters;
+            // Structural validation next (operator/value shape, depth, field charset).
+            validateColumnFilters(aliased);
+            const safe = aliased
+                .map((f) => prune(f, config.allowed, throwOnInvalid, config.fieldTypes))
+                .filter((f) => f !== null);
+            if (safe.length > 0) {
+                applyColumnFilters(qb, safe);
+            }
+        }
+    }
+    if (input.search) {
+        const term = input.search.trim();
+        if (term.length > 0) {
+            // tsvector full-text search is the primary path when the policy declares
+            // it; otherwise fall back to the portable ILIKE scan across `searchable`.
+            if (config.fullText) {
+                applyFullTextSearch(qb, {
+                    query: term,
+                    column: config.fullText.column,
+                    ...(config.fullText.language !== undefined && { language: config.fullText.language }),
+                    ...(config.fullText.rank !== undefined && { rank: config.fullText.rank }),
+                    ...(config.fullText.columnKind !== undefined && {
+                        columnKind: config.fullText.columnKind,
+                    }),
+                });
+            }
+            else if (config.searchable && config.searchable.length > 0) {
+                applySearch(qb, term, config.searchable);
+            }
+        }
+    }
+}
+/**
+ * Is this (alias-resolved) field projectable in the outer SELECT?
+ *
+ * A `where` on a relation path is translated by `applyLeaf` into a nested Lucid
+ * `whereHas`, which compiles to a **correlated EXISTS subquery** — the relation
+ * is never added to the outer `FROM`. A projection has no such escape hatch: the
+ * outer SELECT can only name a column of something the outer FROM holds. So
+ * `distinct=posts.title` on a spec that (correctly) whitelists `posts.title` for
+ * filtering would emit `select distinct "posts"."title" from "users"` and
+ * Postgres answers `missing FROM-clause entry for table "posts"` — a 500 driven
+ * by user input.
+ *
+ * The one qualifier that IS in the outer FROM is the root table itself (Lucid
+ * gives the main table no generated alias, so the table name is the alias — the
+ * same fact {@link FilterConfig.table} already encodes for computed fields).
+ * A single-segment name is a plain root column and always projectable.
+ */
+function isProjectable(field, config) {
+    const dot = field.indexOf('.');
+    if (dot === -1)
+        return true;
+    return config.table !== undefined && field.slice(0, dot) === config.table;
+}
+/**
+ * Resolve the alias-mapped, allow-listed distinct fields for the request. A
+ * distinct field is a projected column, so it is gated by the SAME `allowed`
+ * boundary a `where` field is — aliases resolve first, then the allow-list;
+ * unknown fields are dropped (or rejected under `throwOnInvalid`).
+ *
+ * A field that clears the allow-list but is not projectable
+ * ({@link isProjectable}) is dropped/rejected too, with its OWN message: it is
+ * not an allow-list problem, so pointing the reader at `allowed` would send them
+ * to edit the wrong thing.
+ */
+export function resolveSafeDistinct(fields, config) {
+    const throwOnInvalid = config.throwOnInvalid ?? false;
+    const aliased = config.aliases
+        ? remapDistinctAliases(fields, config.aliases)
+        : fields;
+    const safe = [];
+    for (const field of aliased) {
+        if (!isAllowed(field, config.allowed)) {
+            if (throwOnInvalid) {
+                throw new InvalidColumnFilterError(`Field "${field}" is not a distinct-able column.`);
+            }
+            continue;
+        }
+        if (!isProjectable(field, config)) {
+            if (throwOnInvalid) {
+                const relation = field.slice(0, field.indexOf('.'));
+                throw new InvalidColumnFilterError(`Field "${field}" cannot be used for distinct: it is a relation path, and a relation is filtered through a correlated EXISTS subquery, never joined into the query's FROM — so there is no "${relation}" table whose column the SELECT could project. This is NOT an allow-list problem: filtering on "${field}" works, projecting it does not, and adding it to \`allowed\` will not change that. Use a column of the root table for distinct.`);
+            }
+            continue;
+        }
+        if (!safe.includes(field))
+            safe.push(field);
+    }
+    return safe;
+}
+/**
+ * Apply the request's sort directives in order, routing each to the right hook:
+ * a declared computed field goes to `applyComputedSort` (an appended
+ * `orderByRaw`), a real column goes through alias resolution + the `sortable`
+ * allow-list to `applySort` (an appended `orderBy`). Both hooks append, so a
+ * computed sort and a real-column sort compose in request order — a client can
+ * sort by `fullName` then `id` and get exactly that ORDER BY sequence.
+ */
+function applySortsWithComputed(qb, sort, config) {
+    const throwOnInvalid = config.throwOnInvalid ?? false;
+    const sortable = config.sortable ?? config.allowed;
+    for (const item of sort) {
+        if (computedKey(config.computed, item.field)) {
+            const expression = resolveComputedExpression(config.computed?.[item.field], config.table ?? '');
+            applyComputedSort(qb, expression, item.direction);
+            continue;
+        }
+        const field = config.aliases
+            ? resolveFieldAlias(config.aliases, item.field)
+            : item.field;
+        if (isAllowed(field, sortable)) {
+            applySort(qb, [{ field, direction: item.direction }]);
+        }
+        else if (throwOnInvalid) {
+            throw new InvalidColumnFilterError(`Field "${item.field}" is not sortable.`);
+        }
+    }
+}
+/** Resolve the alias-mapped, allow-listed sort directives for the request. */
+function resolveSafeSort(sort, config) {
+    const throwOnInvalid = config.throwOnInvalid ?? false;
+    const sortable = config.sortable ?? config.allowed;
+    const aliased = config.aliases
+        ? remapSortAliases(sort, config.aliases)
+        : sort;
+    const safe = [];
+    for (const item of aliased) {
+        if (isAllowed(item.field, sortable)) {
+            safe.push(item);
+        }
+        else if (throwOnInvalid) {
+            throw new InvalidColumnFilterError(`Field "${item.field}" is not sortable.`);
+        }
+    }
+    return safe;
+}
+/**
+ * Apply a parsed {@link FilterInput} to a Lucid query builder under a
+ * {@link FilterConfig} policy, and return the resolved offset pagination.
+ *
+ * The allow-lists are the security boundary — fields not in `allowed`/`sortable`/
+ * `searchable` are dropped (or rejected with `throwOnInvalid`). Pagination is
+ * returned (not applied) so the caller drives Lucid's `query.paginate()`:
+ *
+ * ```ts
+ * const { page, size } = applyFilter(Users.query(), input, { allowed: ['name', 'age'] })
+ * const result = await Users.query()... // or: await query.paginate(page, size)
+ * ```
+ */
+export function applyFilter(qb, input, config) {
+    applyFilterConditions(qb, input, config);
+    // Embedding-similarity ranking (opt-in, additive): only when the policy declares
+    // a similarity column AND the request carries a query embedding. Applied before
+    // the user sort so nearest-first distance is the primary ordering; any allowed
+    // sort then acts as a tiebreaker.
+    if (config.vectorSimilarity && input.vectorSimilarity && input.vectorSimilarity.length > 0) {
+        applyVectorSimilarity(qb, {
+            column: config.vectorSimilarity.column,
+            vector: input.vectorSimilarity,
+            ...(config.vectorSimilarity.metric !== undefined && {
+                metric: config.vectorSimilarity.metric,
+            }),
+            ...(config.vectorSimilarity.threshold !== undefined && {
+                threshold: config.vectorSimilarity.threshold,
+            }),
+            ...(config.vectorSimilarity.topK !== undefined && { topK: config.vectorSimilarity.topK }),
+        });
+    }
+    if (input.sort && input.sort.length > 0) {
+        applySortsWithComputed(qb, input.sort, config);
+    }
+    if (input.distinct && input.distinct.length > 0) {
+        const safeDistinct = resolveSafeDistinct(input.distinct, config);
+        if (safeDistinct.length > 0) {
+            applyDistinct(qb, safeDistinct);
+        }
+    }
+    const size = clamp(input.size ?? config.defaultSize ?? 25, 1, config.maxSize ?? 100);
+    const page = Math.max(1, input.page ?? 1);
+    return { page, size };
+}
+/**
+ * Apply a parsed {@link FilterInput} plus {@link CursorParams} to a Lucid query
+ * builder as a **keyset (cursor) page** under a {@link CursorConfig} policy.
+ *
+ * Filters/search go through the same allow-list boundary as {@link applyFilter}.
+ * The effective (allow-listed) sort, plus the primary-key tiebreaker, forms the
+ * keyset; a supplied `after`/`before` cursor becomes a row-value seek predicate,
+ * and the builder is ordered + limited to `size + 1` (one extra row to detect a
+ * further page). Feed the fetched rows and the returned {@link ResolvedCursor}
+ * to {@link buildCursorPage} to assemble the page and its boundary cursors:
+ *
+ * ```ts
+ * const resolved = applyCursor(Users.query(), input, { allowed: ['name'], primaryKey: 'id' })
+ * const rows = await Users.query()...exec()
+ * const page = buildCursorPage(rows, resolved)
+ * ```
+ */
+export function applyCursor(qb, input, config) {
+    applyFilterConditions(qb, input, config);
+    const safeSort = input.sort && input.sort.length > 0 ? resolveSafeSort(input.sort, config) : [];
+    const baseKeyset = buildKeyset(safeSort, config.primaryKey ?? 'id');
+    const backward = input.before !== undefined && input.after === undefined;
+    const cursorStr = input.after ?? input.before;
+    const requested = backward ? input.last : input.first;
+    const size = clamp(requested ?? config.defaultSize ?? 25, 1, config.maxSize ?? 100);
+    // For backward paging, reverse keyset directions so the boundary seek and
+    // ordering walk the other way; buildCursorPage re-reverses the rows.
+    const queryKeyset = backward ? reverseKeyset(baseKeyset) : baseKeyset;
+    if (cursorStr !== undefined) {
+        const values = decodeCursor(cursorStr);
+        if (values && values.length === queryKeyset.length) {
+            applyKeyset(qb, queryKeyset, values);
+        }
+    }
+    applySort(qb, queryKeyset);
+    qb.limit(size + 1);
+    return { keyset: baseKeyset, size, backward, hasCursor: cursorStr !== undefined };
+}
+//# sourceMappingURL=runner.js.map

package/dist/src/runner.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"runner.js","sourceRoot":"","sources":["../../src/runner.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,uBAAuB,EAAE,MAAM,gBAAgB,CAAC;AACzD,OAAO,EAAE,iBAAiB,EAAE,MAAM,mBAAmB,CAAC;AACtD,OAAO,EACL,WAAW,EAEX,YAAY,EAEZ,aAAa,GACd,MAAM,aAAa,CAAC;AACrB,OAAO,EACL,oBAAoB,EACpB,kBAAkB,EAClB,gBAAgB,EAChB,iBAAiB,GAClB,MAAM,oBAAoB,CAAC;AAC5B,OAAO,EACL,kBAAkB,EAClB,kBAAkB,EAClB,iBAAiB,EACjB,aAAa,EACb,mBAAmB,EACnB,WAAW,EACX,WAAW,EACX,SAAS,EACT,qBAAqB,EAErB,yBAAyB,GAC1B,MAAM,oBAAoB,CAAC;AAG5B,OAAO,EAAE,wBAAwB,EAAE,qBAAqB,EAAE,MAAM,6BAA6B,CAAC;AAQ9F,SAAS,SAAS,CAAC,KAAa,EAAE,KAAgB;IAChD,IAAI,KAAK,KAAK,GAAG;QAAE,OAAO,IAAI,CAAC;IAC/B,IAAI,OAAO,KAAK,KAAK,UAAU;QAAE,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC;IACrD,OAAO,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;AAC/B,CAAC;AAED,SAAS,KAAK,CAAC,CAAS,EAAE,GAAW,EAAE,GAAW;IAChD,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;AACzC,CAAC;AAED;;;;GAIG;AACH,SAAS,WAAW,CAAC,QAAoC,EAAE,KAAa;IACtE,OAAO,CACL,QAAQ,KAAK,SAAS;QACtB,OAAO,KAAK,KAAK,QAAQ;QACzB,KAAK,CAAC,MAAM,GAAG,CAAC;QAChB,MAAM,CAAC,MAAM,CAAC,QAAQ,EAAE,KAAK,CAAC,CAC/B,CAAC;AACJ,CAAC;AAED;;;;;GAKG;AACH,SAAS,cAAc,CAAC,MAAoB,EAAE,QAAoC;IAChF,OAAO,WAAW,CAAC,QAAQ,EAAE,MAAM,CAAC,KAAK,CAAC,IAAI,MAAM,CAAC,GAAG,KAAK,SAAS,IAAI,MAAM,CAAC,EAAE,KAAK,SAAS,CAAC;AACpG,CAAC;AAED;;;;GAIG;AACH,MAAM,iBAAiB,GAAG,IAAI,GAAG,CAAC;IAChC,UAAU;IACV,aAAa;IACb,WAAW;IACX,YAAY;IACZ,UAAU;CACX,CAAC,CAAC;AAEH,qFAAqF;AACrF,MAAM,eAAe,GAAG,IAAI,GAAG,CAAC,CAAC,IAAI,EAAE,OAAO,EAAE,SAAS,EAAE,SAAS,EAAE,YAAY,CAAC,CAAC,CAAC;AAErF;;;;;GAKG;AACH,SAAS,oBAAoB,CAC3B,MAAoB,EACpB,UAAsC;IAEtC,MAAM,IAAI,GAAG,UAAU,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC;IAC9C,IAAI,CAAC,IAAI,IAAI,iBAAiB,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC;QAC5D,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,EAAE,CAAC;IAC3C,CAAC;IAED,IAAI,eAAe,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC;QAChF,MAAM,GAAG,GAAc,EAAE,CAAC;QAC1B,KAAK,MAAM,OAAO,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC;YACnC,MAAM,CAAC,GAAG,iBAAiB,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;YAC3C,IAAI,CAAC,CAAC,CAAC,EAAE;gBAAE,OAAO,CAAC,CAAC;YACpB,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;QACpB,CAAC;QACD,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC;IAClC,CAAC;IAED,OAAO,iBAAiB,CAAC,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;AAC/C,CAAC;AAED;;;;GAIG;AACH,SAAS,KAAK,CACZ,MAAoB,EACpB,OAAkB,EAClB,cAAuB,EACvB,UAAuC;IAEvC,MAAM,QAAQ,GAAG,OAAO,MAAM,CAAC,KAAK,KAAK,QAAQ,IAAI,MAAM,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;IAE7E,IAAI,QAAQ,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,KAAK,EAAE,OAAO,CAAC,EAAE,CAAC;QAClD,IAAI,cAAc,EAAE,CAAC;YACnB,MAAM,IAAI,wBAAwB,CAAC,UAAU,MAAM,CAAC,KAAK,sBAAsB,CAAC,CAAC;QACnF,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,MAAM,IAAI,GAAiB,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,EAAE,QAAQ,EAAE,MAAM,CAAC,QAAQ,EAAE,CAAC;IAC9E,IAAI,MAAM,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;QAC/B,wFAAwF;QACxF,4FAA4F;QAC5F,iFAAiF;QACjF,MAAM,OAAO,GAAG,oBAAoB,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;QACzD,IAAI,CAAC,OAAO,CAAC,EAAE,EAAE,CAAC;YAChB,IAAI,cAAc,EAAE,CAAC;gBACnB,MAAM,IAAI,wBAAwB,CAChC,oBAAoB,MAAM,CAAC,KAAK,iBAAiB,OAAO,CAAC,MAAM,GAAG,CACnE,CAAC;YACJ,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC;QACD,IAAI,CAAC,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC;IAC7B,CAAC;IAED,IAAI,MAAM,CAAC,GAAG,EAAE,CAAC;QACf,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,OAAO,EAAE,cAAc,EAAE,UAAU,CAAC,CAAC,CAAC,MAAM,CACtF,CAAC,CAAC,EAAqB,EAAE,CAAC,CAAC,KAAK,IAAI,CACrC,CAAC;QACF,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC;YAAE,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC;IACvC,CAAC;IACD,IAAI,MAAM,CAAC,EAAE,EAAE,CAAC;QACd,MAAM,IAAI,GAAG,MAAM,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,OAAO,EAAE,cAAc,EAAE,UAAU,CAAC,CAAC,CAAC,MAAM,CACrF,CAAC,CAAC,EAAqB,EAAE,CAAC,CAAC,KAAK,IAAI,CACrC,CAAC;QACF,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC;YAAE,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC;IACtC,CAAC;IAED,+EAA+E;IAC/E,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,GAAG,KAAK,SAAS,IAAI,IAAI,CAAC,EAAE,KAAK,SAAS,EAAE,CAAC;QACjE,OAAO,IAAI,CAAC;IACd,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,qBAAqB,CACnC,EAAoB,EACpB,KAAkB,EAClB,MAAoB;IAEpB,MAAM,cAAc,GAAG,MAAM,CAAC,cAAc,IAAI,KAAK,CAAC;IAEtD,IAAI,KAAK,CAAC,OAAO,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC9C,0EAA0E;QAC1E,sEAAsE;QACtE,kEAAkE;QAClE,2EAA2E;QAC3E,6EAA6E;QAC7E,MAAM,aAAa,GAAmB,EAAE,CAAC;QACzC,KAAK,MAAM,MAAM,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;YACnC,IAAI,cAAc,CAAC,MAAM,EAAE,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAC5C,MAAM,MAAM,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,MAAM,CAAC,KAAK,CAAwC,CAAC;gBACtF,MAAM,SAAS,GAAG,uBAAuB,CAAC,MAAM,EAAE,MAAM,CAAC,KAAK,IAAI,EAAE,EAAE,MAAM,CAAC,CAAC;gBAC9E,IAAI,SAAS;oBAAE,EAAE,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;;oBACjC,kBAAkB,CAAC,EAAE,EAAE,yBAAyB,CAAC,MAAM,EAAE,MAAM,CAAC,KAAK,IAAI,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC;YAC7F,CAAC;iBAAM,CAAC;gBACN,aAAa,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAC7B,CAAC;QACH,CAAC;QAED,IAAI,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC7B,6EAA6E;YAC7E,yEAAyE;YACzE,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO;gBAC5B,CAAC,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CACtB,kBAAkB,CAAC,CAAC,EAAE,MAAM,CAAC,OAA6C,CAAC,CAC5E;gBACH,CAAC,CAAC,aAAa,CAAC;YAClB,2EAA2E;YAC3E,qBAAqB,CAAC,OAAO,CAAC,CAAC;YAC/B,MAAM,IAAI,GAAG,OAAO;iBACjB,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,OAAO,EAAE,cAAc,EAAE,MAAM,CAAC,UAAU,CAAC,CAAC;iBACvE,MAAM,CAAC,CAAC,CAAC,EAAqB,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC;YAChD,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACpB,kBAAkB,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;YAC/B,CAAC;QACH,CAAC;IACH,CAAC;IAED,IAAI,KAAK,CAAC,MAAM,EAAE,CAAC;QACjB,MAAM,IAAI,GAAG,KAAK,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;QACjC,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACpB,yEAAyE;YACzE,0EAA0E;YAC1E,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC;gBACpB,mBAAmB,CAAC,EAAE,EAAE;oBACtB,KAAK,EAAE,IAAI;oBACX,MAAM,EAAE,MAAM,CAAC,QAAQ,CAAC,MAAM;oBAC9B,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,QAAQ,KAAK,SAAS,IAAI,EAAE,QAAQ,EAAE,MAAM,CAAC,QAAQ,CAAC,QAAQ,EAAE,CAAC;oBACrF,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,KAAK,SAAS,IAAI,EAAE,IAAI,EAAE,MAAM,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC;oBACzE,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,UAAU,KAAK,SAAS,IAAI;wBAC9C,UAAU,EAAE,MAAM,CAAC,QAAQ,CAAC,UAAU;qBACvC,CAAC;iBACH,CAAC,CAAC;YACL,CAAC;iBAAM,IAAI,MAAM,CAAC,UAAU,IAAI,MAAM,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC7D,WAAW,CAAC,EAAE,EAAE,IAAI,EAAE,MAAM,CAAC,UAAU,CAAC,CAAC;YAC3C,CAAC;QACH,CAAC;IACH,CAAC;AACH,CAAC;AAED;;;;;;;;;;;;;;;;GAgBG;AACH,SAAS,aAAa,CAAC,KAAa,EAAE,MAAoB;IACxD,MAAM,GAAG,GAAG,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IAC/B,IAAI,GAAG,KAAK,CAAC,CAAC;QAAE,OAAO,IAAI,CAAC;IAC5B,OAAO,MAAM,CAAC,KAAK,KAAK,SAAS,IAAI,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,KAAK,MAAM,CAAC,KAAK,CAAC;AAC5E,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,mBAAmB,CAAC,MAAgB,EAAE,MAAoB;IACxE,MAAM,cAAc,GAAG,MAAM,CAAC,cAAc,IAAI,KAAK,CAAC;IACtD,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO;QAC5B,CAAC,CAAC,oBAAoB,CAAC,MAAM,EAAE,MAAM,CAAC,OAA6C,CAAC;QACpF,CAAC,CAAC,MAAM,CAAC;IAEX,MAAM,IAAI,GAAa,EAAE,CAAC;IAC1B,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC;YACtC,IAAI,cAAc,EAAE,CAAC;gBACnB,MAAM,IAAI,wBAAwB,CAAC,UAAU,KAAK,kCAAkC,CAAC,CAAC;YACxF,CAAC;YACD,SAAS;QACX,CAAC;QACD,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,MAAM,CAAC,EAAE,CAAC;YAClC,IAAI,cAAc,EAAE,CAAC;gBACnB,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC;gBACpD,MAAM,IAAI,wBAAwB,CAChC,UAAU,KAAK,+KAA+K,QAAQ,mGAAmG,KAAK,kIAAkI,CACjb,CAAC;YACJ,CAAC;YACD,SAAS;QACX,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC;YAAE,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC9C,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,sBAAsB,CAC7B,EAAoB,EACpB,IAAgB,EAChB,MAAoB;IAEpB,MAAM,cAAc,GAAG,MAAM,CAAC,cAAc,IAAI,KAAK,CAAC;IACtD,MAAM,QAAQ,GAAG,MAAM,CAAC,QAAQ,IAAI,MAAM,CAAC,OAAO,CAAC;IACnD,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;QACxB,IAAI,WAAW,CAAC,MAAM,CAAC,QAAQ,EAAE,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YAC7C,MAAM,UAAU,GAAG,yBAAyB,CAC1C,MAAM,CAAC,QAAQ,EAAE,CAAC,IAAI,CAAC,KAAK,CAAwC,EACpE,MAAM,CAAC,KAAK,IAAI,EAAE,CACnB,CAAC;YACF,iBAAiB,CAAC,EAAE,EAAE,UAAU,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;YAClD,SAAS;QACX,CAAC;QACD,MAAM,KAAK,GAAG,MAAM,CAAC,OAAO;YAC1B,CAAC,CAAC,iBAAiB,CAAC,MAAM,CAAC,OAA6C,EAAE,IAAI,CAAC,KAAK,CAAC;YACrF,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC;QACf,IAAI,SAAS,CAAC,KAAK,EAAE,QAAQ,CAAC,EAAE,CAAC;YAC/B,SAAS,CAAC,EAAE,EAAE,CAAC,EAAE,KAAK,EAAE,SAAS,EAAE,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;QACxD,CAAC;aAAM,IAAI,cAAc,EAAE,CAAC;YAC1B,MAAM,IAAI,wBAAwB,CAAC,UAAU,IAAI,CAAC,KAAK,oBAAoB,CAAC,CAAC;QAC/E,CAAC;IACH,CAAC;AACH,CAAC;AAED,8EAA8E;AAC9E,SAAS,eAAe,CAAC,IAAgB,EAAE,MAAoB;IAC7D,MAAM,cAAc,GAAG,MAAM,CAAC,cAAc,IAAI,KAAK,CAAC;IACtD,MAAM,QAAQ,GAAG,MAAM,CAAC,QAAQ,IAAI,MAAM,CAAC,OAAO,CAAC;IACnD,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO;QAC5B,CAAC,CAAC,gBAAgB,CAAC,IAAI,EAAE,MAAM,CAAC,OAA6C,CAAC;QAC9E,CAAC,CAAC,IAAI,CAAC;IAET,MAAM,IAAI,GAAe,EAAE,CAAC;IAC5B,KAAK,MAAM,IAAI,IAAI,OAAO,EAAE,CAAC;QAC3B,IAAI,SAAS,CAAC,IAAI,CAAC,KAAK,EAAE,QAAQ,CAAC,EAAE,CAAC;YACpC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAClB,CAAC;aAAM,IAAI,cAAc,EAAE,CAAC;YAC1B,MAAM,IAAI,wBAAwB,CAAC,UAAU,IAAI,CAAC,KAAK,oBAAoB,CAAC,CAAC;QAC/E,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,WAAW,CACzB,EAAoB,EACpB,KAAkB,EAClB,MAAoB;IAEpB,qBAAqB,CAAC,EAAE,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;IAEzC,iFAAiF;IACjF,gFAAgF;IAChF,+EAA+E;IAC/E,kCAAkC;IAClC,IAAI,MAAM,CAAC,gBAAgB,IAAI,KAAK,CAAC,gBAAgB,IAAI,KAAK,CAAC,gBAAgB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC3F,qBAAqB,CAAC,EAAE,EAAE;YACxB,MAAM,EAAE,MAAM,CAAC,gBAAgB,CAAC,MAAM;YACtC,MAAM,EAAE,KAAK,CAAC,gBAAgB;YAC9B,GAAG,CAAC,MAAM,CAAC,gBAAgB,CAAC,MAAM,KAAK,SAAS,IAAI;gBAClD,MAAM,EAAE,MAAM,CAAC,gBAAgB,CAAC,MAAM;aACvC,CAAC;YACF,GAAG,CAAC,MAAM,CAAC,gBAAgB,CAAC,SAAS,KAAK,SAAS,IAAI;gBACrD,SAAS,EAAE,MAAM,CAAC,gBAAgB,CAAC,SAAS;aAC7C,CAAC;YACF,GAAG,CAAC,MAAM,CAAC,gBAAgB,CAAC,IAAI,KAAK,SAAS,IAAI,EAAE,IAAI,EAAE,MAAM,CAAC,gBAAgB,CAAC,IAAI,EAAE,CAAC;SAC1F,CAAC,CAAC;IACL,CAAC;IAED,IAAI,KAAK,CAAC,IAAI,IAAI,KAAK,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxC,sBAAsB,CAAC,EAAE,EAAE,KAAK,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IACjD,CAAC;IAED,IAAI,KAAK,CAAC,QAAQ,IAAI,KAAK,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAChD,MAAM,YAAY,GAAG,mBAAmB,CAAC,KAAK,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;QACjE,IAAI,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC5B,aAAa,CAAC,EAAE,EAAE,YAAY,CAAC,CAAC;QAClC,CAAC;IACH,CAAC;IAED,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,IAAI,IAAI,MAAM,CAAC,WAAW,IAAI,EAAE,EAAE,CAAC,EAAE,MAAM,CAAC,OAAO,IAAI,GAAG,CAAC,CAAC;IACrF,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC;IAC1C,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;AACxB,CAAC;AAQD;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,UAAU,WAAW,CACzB,EAAoB,EACpB,KAAiC,EACjC,MAAoB;IAEpB,qBAAqB,CAAC,EAAE,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;IAEzC,MAAM,QAAQ,GAAG,KAAK,CAAC,IAAI,IAAI,KAAK,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,KAAK,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IAChG,MAAM,UAAU,GAAG,WAAW,CAAC,QAAQ,EAAE,MAAM,CAAC,UAAU,IAAI,IAAI,CAAC,CAAC;IAEpE,MAAM,QAAQ,GAAG,KAAK,CAAC,MAAM,KAAK,SAAS,IAAI,KAAK,CAAC,KAAK,KAAK,SAAS,CAAC;IACzE,MAAM,SAAS,GAAG,KAAK,CAAC,KAAK,IAAI,KAAK,CAAC,MAAM,CAAC;IAC9C,MAAM,SAAS,GAAG,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC;IACtD,MAAM,IAAI,GAAG,KAAK,CAAC,SAAS,IAAI,MAAM,CAAC,WAAW,IAAI,EAAE,EAAE,CAAC,EAAE,MAAM,CAAC,OAAO,IAAI,GAAG,CAAC,CAAC;IAEpF,0EAA0E;IAC1E,qEAAqE;IACrE,MAAM,WAAW,GAAG,QAAQ,CAAC,CAAC,CAAC,aAAa,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC;IAEtE,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;QAC5B,MAAM,MAAM,GAAG,YAAY,CAAC,SAAS,CAAC,CAAC;QACvC,IAAI,MAAM,IAAI,MAAM,CAAC,MAAM,KAAK,WAAW,CAAC,MAAM,EAAE,CAAC;YACnD,WAAW,CAAC,EAAE,EAAE,WAAW,EAAE,MAAM,CAAC,CAAC;QACvC,CAAC;IACH,CAAC;IAED,SAAS,CAAC,EAAE,EAAE,WAAW,CAAC,CAAC;IAC3B,EAAE,CAAC,KAAK,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;IAEnB,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,IAAI,EAAE,QAAQ,EAAE,SAAS,EAAE,SAAS,KAAK,SAAS,EAAE,CAAC;AACpF,CAAC"}

package/dist/src/source_resolver.d.ts

@@ -0,0 +1,18 @@
+import type { InputSource } from './types.js';
+/**
+ * Resolve the raw structured input from a request according to an
+ * {@link InputSource}:
+ *
+ * - a function — a custom extractor, called with the request.
+ * - `'query'` / `'body'` — always that container.
+ * - `'auto'` (or any other bare token) — query on reads (GET/HEAD), query+body
+ *   merged (body wins) on writes (POST/PUT/PATCH/DELETE).
+ * - a dot-path (e.g. `'body.filters'`) — the nested object at that path, or `{}`
+ *   when the path is missing or does not resolve to an object.
+ *
+ * The `req` is treated structurally (`{ method, query, body }`), so an AdonisJS
+ * `HttpContext.request` — whose `qs()`/`body()` you pass in — or a plain object
+ * both work. The result is always a fresh shallow copy.
+ */
+export declare function resolveInputFromRequest(req: unknown, source: InputSource): Record<string, unknown>;
+//# sourceMappingURL=source_resolver.d.ts.map

package/dist/src/source_resolver.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"source_resolver.d.ts","sourceRoot":"","sources":["../../src/source_resolver.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AAW9C;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,uBAAuB,CACrC,GAAG,EAAE,OAAO,EACZ,MAAM,EAAE,WAAW,GAClB,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CA+BzB"}

package/dist/src/source_resolver.js

@@ -0,0 +1,64 @@
+const WRITE_METHODS = new Set(['POST', 'PUT', 'PATCH', 'DELETE']);
+const READ_METHODS = new Set(['GET', 'HEAD']);
+/**
+ * Resolve the raw structured input from a request according to an
+ * {@link InputSource}:
+ *
+ * - a function — a custom extractor, called with the request.
+ * - `'query'` / `'body'` — always that container.
+ * - `'auto'` (or any other bare token) — query on reads (GET/HEAD), query+body
+ *   merged (body wins) on writes (POST/PUT/PATCH/DELETE).
+ * - a dot-path (e.g. `'body.filters'`) — the nested object at that path, or `{}`
+ *   when the path is missing or does not resolve to an object.
+ *
+ * The `req` is treated structurally (`{ method, query, body }`), so an AdonisJS
+ * `HttpContext.request` — whose `qs()`/`body()` you pass in — or a plain object
+ * both work. The result is always a fresh shallow copy.
+ */
+export function resolveInputFromRequest(req, source) {
+    if (typeof source === 'function') {
+        const r = source(req);
+        return { ...(r ?? {}) };
+    }
+    const r = (req ?? {});
+    const query = (r.query ?? {});
+    const body = (r.body ?? {});
+    switch (source) {
+        case 'query':
+            return { ...query };
+        case 'body':
+            return { ...body };
+        case 'auto': {
+            const method = (r.method ?? 'GET').toUpperCase();
+            if (READ_METHODS.has(method))
+                return { ...query };
+            if (WRITE_METHODS.has(method))
+                return { ...query, ...body };
+            return { ...query };
+        }
+        default: {
+            if (source.includes('.')) {
+                const resolved = resolveDotPath(r, source);
+                return { ...(resolved ?? {}) };
+            }
+            const method = (r.method ?? 'GET').toUpperCase();
+            if (READ_METHODS.has(method))
+                return { ...query };
+            if (WRITE_METHODS.has(method))
+                return { ...query, ...body };
+            return { ...query };
+        }
+    }
+}
+function resolveDotPath(obj, path) {
+    let current = obj;
+    for (const segment of path.split('.')) {
+        if (current == null || typeof current !== 'object')
+            return undefined;
+        current = current[segment];
+    }
+    if (current == null || typeof current !== 'object')
+        return undefined;
+    return current;
+}
+//# sourceMappingURL=source_resolver.js.map

package/dist/src/source_resolver.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"source_resolver.js","sourceRoot":"","sources":["../../src/source_resolver.ts"],"names":[],"mappings":"AAEA,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC,CAAC,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC,CAAC;AAClE,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC;AAQ9C;;;;;;;;;;;;;;GAcG;AACH,MAAM,UAAU,uBAAuB,CACrC,GAAY,EACZ,MAAmB;IAEnB,IAAI,OAAO,MAAM,KAAK,UAAU,EAAE,CAAC;QACjC,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;QACtB,OAAO,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAA6B,CAAC;IACrD,CAAC;IACD,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI,EAAE,CAAY,CAAC;IACjC,MAAM,KAAK,GAAG,CAAC,CAAC,CAAC,KAAK,IAAI,EAAE,CAA4B,CAAC;IACzD,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE,CAA4B,CAAC;IAEvD,QAAQ,MAAM,EAAE,CAAC;QACf,KAAK,OAAO;YACV,OAAO,EAAE,GAAG,KAAK,EAAE,CAAC;QACtB,KAAK,MAAM;YACT,OAAO,EAAE,GAAG,IAAI,EAAE,CAAC;QACrB,KAAK,MAAM,EAAE,CAAC;YACZ,MAAM,MAAM,GAAG,CAAC,CAAC,CAAC,MAAM,IAAI,KAAK,CAAC,CAAC,WAAW,EAAE,CAAC;YACjD,IAAI,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC;gBAAE,OAAO,EAAE,GAAG,KAAK,EAAE,CAAC;YAClD,IAAI,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC;gBAAE,OAAO,EAAE,GAAG,KAAK,EAAE,GAAG,IAAI,EAAE,CAAC;YAC5D,OAAO,EAAE,GAAG,KAAK,EAAE,CAAC;QACtB,CAAC;QACD,SAAS,CAAC;YACR,IAAI,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;gBACzB,MAAM,QAAQ,GAAG,cAAc,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;gBAC3C,OAAO,EAAE,GAAG,CAAC,QAAQ,IAAI,EAAE,CAAC,EAAE,CAAC;YACjC,CAAC;YACD,MAAM,MAAM,GAAG,CAAC,CAAC,CAAC,MAAM,IAAI,KAAK,CAAC,CAAC,WAAW,EAAE,CAAC;YACjD,IAAI,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC;gBAAE,OAAO,EAAE,GAAG,KAAK,EAAE,CAAC;YAClD,IAAI,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC;gBAAE,OAAO,EAAE,GAAG,KAAK,EAAE,GAAG,IAAI,EAAE,CAAC;YAC5D,OAAO,EAAE,GAAG,KAAK,EAAE,CAAC;QACtB,CAAC;IACH,CAAC;AACH,CAAC;AAED,SAAS,cAAc,CAAC,GAAY,EAAE,IAAY;IAChD,IAAI,OAAO,GAAY,GAAG,CAAC;IAC3B,KAAK,MAAM,OAAO,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;QACtC,IAAI,OAAO,IAAI,IAAI,IAAI,OAAO,OAAO,KAAK,QAAQ;YAAE,OAAO,SAAS,CAAC;QACrE,OAAO,GAAI,OAAmC,CAAC,OAAO,CAAC,CAAC;IAC1D,CAAC;IACD,IAAI,OAAO,IAAI,IAAI,IAAI,OAAO,OAAO,KAAK,QAAQ;QAAE,OAAO,SAAS,CAAC;IACrE,OAAO,OAAkC,CAAC;AAC5C,CAAC"}

package/dist/src/spatie_parser.d.ts

@@ -0,0 +1,39 @@
+import type { CursorParams } from './cursor.js';
+import type { FilterInput } from './types.js';
+/**
+ * The richer Spatie / JSON:API input shape produced by {@link parseSpatieRequest}.
+ * A superset of {@link FilterInput}: it adds cursor pagination
+ * ({@link CursorParams}), JSON:API sparse fieldsets (`select`) and relation
+ * includes (`include`). Ready to hand to `applyFilter` (offset) or `applyCursor`
+ * (keyset) — the extra fields are ignored by whichever runner does not use them.
+ */
+export interface SpatieInput extends FilterInput, CursorParams {
+    /** JSON:API sparse fieldsets (`fields[resource]=a,b`), flattened + de-duped. */
+    select?: string[];
+    /** Relation includes (`include=posts,comments`). */
+    include?: string[];
+}
+/**
+ * Parse a decoded, Spatie-laravel-query-builder / JSON:API-style query object
+ * into a {@link SpatieInput}. This is the richer, additive counterpart to
+ * {@link parseFilterRequest}: it understands the same `filter`/`sort`/`search`
+ * shapes plus JSON:API `include`, sparse `fields[resource]` sets, and cursor
+ * pagination (`page[after]`/`page[before]`).
+ *
+ * | Query string                    | Decoded input                        | Mapped to                                  |
+ * | ------------------------------- | ------------------------------------ | ------------------------------------------ |
+ * | `filter[name]=Al`               | `{ filter: { name: 'Al' } }`         | `equals` column filter                     |
+ * | `filter[id]=1,2,3`              | `{ filter: { id: '1,2,3' } }`        | `in` column filter                         |
+ * | `filter[age][gte]=18`          | `{ filter: { age: { gte: '18' } } }` | operator column filter                     |
+ * | `sort=-createdAt,name`         | `{ sort: '-createdAt,name' }`        | sort items                                 |
+ * | `distinct=city,tier`           | `{ distinct: 'city,tier' }`          | `distinct: ['city', 'tier']`               |
+ * | `include=posts,comments`       | `{ include: 'posts,comments' }`      | `include: ['posts', 'comments']`           |
+ * | `fields[users]=id,name`        | `{ fields: { users: 'id,name' } }`   | `select: ['id', 'name']`                   |
+ * | `page[number]=2&page[size]=10` | `{ page: { number, size } }`         | offset (`page`/`size`)                     |
+ * | `page[after]=cur&page[size]=10`| `{ page: { after, size } }`          | cursor (`after`/`first`)                   |
+ *
+ * A pure reshape — no validation or allow-listing here; that happens downstream
+ * in `applyFilter` / `applyCursor` against the `FilterConfig`.
+ */
+export declare function parseSpatieRequest(qs: unknown): SpatieInput;
+//# sourceMappingURL=spatie_parser.d.ts.map

package/dist/src/spatie_parser.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"spatie_parser.d.ts","sourceRoot":"","sources":["../../src/spatie_parser.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAGhD,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AAE9C;;;;;;GAMG;AACH,MAAM,WAAW,WAAY,SAAQ,WAAW,EAAE,YAAY;IAC5D,gFAAgF;IAChF,MAAM,CAAC,EAAE,MAAM,EAAE,CAAC;IAClB,oDAAoD;IACpD,OAAO,CAAC,EAAE,MAAM,EAAE,CAAC;CACpB;AAWD;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,wBAAgB,kBAAkB,CAAC,EAAE,EAAE,OAAO,GAAG,WAAW,CA8B3D"}