@adonis-agora/filter 0.9.0 → 0.10.0

package/CHANGELOG.md

@@ -1,5 +1,11 @@
 # @adonis-agora/filter
 
+## 0.10.0
+
+### Minor Changes
+
+- [#67](https://github.com/DavideCarvalho/adonis-agora-filter/pull/67) [`1dd11c3`](https://github.com/DavideCarvalho/adonis-agora-filter/commit/1dd11c3563cd015d27627808cc3e23830ed4be50) Thanks [@DavideCarvalho](https://github.com/DavideCarvalho)! - In-memory adapter at `@adonis-agora/filter/in-memory`: `defineCollection({ fields, primaryKey, relations })` declares a row source (field types incl. `'string[]'`-style arrays, virtual fields, to-one/to-many relations), and `collection.query(rows)` is a `QueryBuilderLike` the existing runner drives unchanged — `applyFilter`, `applyCursor`, `applyFilterFromRequest`, `applyCursorFromRequest` and `groupByCountFromRequest` all work over a plain array with the same parsing, allow-listing and coercion. Evaluation mirrors the SQL the Lucid adapter emits (ILIKE, three-valued NULL logic, NULLS LAST asc / FIRST desc, EXISTS for to-many paths). `filterInMemory` / `cursorInMemory` do it in one call; `InMemoryQueryError` is thrown for SQL-only features (`computed`, `fullText`, `vectorSimilarity`).
+
 ## 0.9.0
 
 ### Minor Changes

package/README.md

@@ -50,6 +50,21 @@ AND/OR composition. The `allowed`/`sortable`/`searchable` lists are the security
 boundary. The Lucid binding is structural (`QueryBuilderLike`) so any Lucid query
 builder works and the adapter is unit-testable.
 
+### In-memory lists
+
+`@adonis-agora/filter/in-memory` runs the same input against a plain array — an
+in-memory `QueryBuilderLike` the runner drives exactly like a Lucid query:
+
+```ts
+import { defineCollection, filterInMemory } from '@adonis-agora/filter/in-memory'
+
+const users = defineCollection<UserRow>({
+  fields: { name: 'string', age: 'number', fullName: { type: 'string', get: (u) => u.first + ' ' + u.last } },
+})
+const page = filterInMemory(users, rows, input, { allowed: ['name', 'age', 'fullName'] })
+// { data, meta: { total, perPage, currentPage, lastPage, firstPage } }
+```
+
 See the [repository README](https://github.com/DavideCarvalho/adonis-filter).
 
 ## License

package/dist/src/in_memory.d.ts

@@ -0,0 +1,268 @@
+import { type CursorPage, type CursorParams } from './cursor.js';
+import type { QueryBuilderLike } from './lucid_adapter.js';
+import type { FilterConfig, FilterFieldKind, FilterInput } from './types.js';
+/**
+ * The in-memory adapter: a {@link QueryBuilderLike} that evaluates against a plain JS array.
+ *
+ * The runner (`applyFilter`, `applyCursor`, `applyFilterFromRequest`, `groupByCountFromRequest`)
+ * does exactly what it does for a Lucid query — parse, alias-resolve, validate, allow-list, coerce —
+ * and then drives the same builder calls it would hand Lucid. This builder records those calls and
+ * evaluates them over rows instead of compiling SQL, so an in-memory listing speaks the same wire
+ * format, operators and error shapes as a database one, and a filter spec written for a model
+ * works unchanged over rows assembled in memory (several sources merged, a static catalog, a
+ * remote API page).
+ *
+ * The evaluation mirrors what Postgres does with the SQL the Lucid adapter emits — including the
+ * places that surprise people: three-valued NULL logic (a NULL value fails `notEquals`/`notIn`/
+ * `notBetween`, `NOT IN` a list holding NULL matches nothing), ILIKE for every LIKE-style operator,
+ * and NULLS LAST on ascending / NULLS FIRST on descending order.
+ */
+/** A scalar array kind — an in-memory extension; see {@link InMemoryFieldType}. */
+export type InMemoryArrayKind = 'string[]' | 'number[]' | 'boolean[]' | 'date[]';
+/**
+ * A declared field type. The scalar kinds are the lib's own {@link FilterFieldKind}; the array
+ * kinds declare a list-valued field, on which a scalar operator matches when ANY element matches
+ * and a negated operator (`notEquals`, `notIn`, `notBetween`) matches when NO element does.
+ */
+export type InMemoryFieldType = FilterFieldKind | InMemoryArrayKind;
+/** A virtual field: a value computed from the row — the in-memory counterpart of `computed`. */
+export interface InMemoryVirtualField<T> {
+    type: InMemoryFieldType;
+    get: (row: T) => unknown;
+}
+/** One entry of {@link DefineCollectionOptions.fields}: a stored field's type, or a virtual field. */
+export type InMemoryFieldDeclaration<T> = InMemoryFieldType | InMemoryVirtualField<T>;
+/** Relation cardinality. `*-to-one` reads a row (or null); `*-to-many` reads an array. */
+export type InMemoryRelationKind = 'one-to-one' | 'many-to-one' | 'one-to-many' | 'many-to-many';
+/**
+ * A relation a dotted filter path (`posts.title`) can cross. The runner turns such a path into a
+ * `whereHas`, evaluated here with EXISTS semantics: the row matches when at least one related row
+ * satisfies the nested conditions.
+ */
+export interface InMemoryRelation<T> {
+    kind: InMemoryRelationKind;
+    /** The related collection — a thunk so two collections can reference each other. */
+    target: () => InMemoryCollection<any>;
+    /** Read the related row(s) off a row. `null`/`undefined` means no related row. */
+    get: (row: T) => unknown;
+}
+/** Options for {@link defineCollection}. */
+export interface DefineCollectionOptions<T> {
+    /**
+     * The field declarations — what each field is, so filter values are compared as that kind
+     * (`'3'` equals `3` on a `number` field, `'true'` equals `true` on a `boolean`, ISO strings
+     * compare as instants on a `date`). A field that is not declared is read as an own property and
+     * compared by the kind its value has at runtime.
+     */
+    fields: Record<string, InMemoryFieldDeclaration<T>>;
+    /** The keyset tiebreaker for cursor pagination. Default `'id'`. */
+    primaryKey?: string;
+    /** Relations dotted filter paths may cross. */
+    relations?: Record<string, InMemoryRelation<T>>;
+    /**
+     * The collection's "table" name. A `distinct`/sort field qualified with it (`users.name`, the
+     * form {@link FilterConfig.table} makes projectable) reads the root field `name`.
+     */
+    name?: string;
+}
+interface ResolvedField<T> {
+    kind: FilterFieldKind;
+    array: boolean;
+    get: ((row: T) => unknown) | undefined;
+}
+/** A declared, reusable row source. Create one with {@link defineCollection}. */
+export interface InMemoryCollection<T extends object> {
+    readonly name: string | undefined;
+    readonly primaryKey: string;
+    /**
+     * The declared fields as the colocated `filterable` map `defineFilter` accepts
+     * (`defineFilter({ filterable: users.filterable })`) — array kinds map to their element kind,
+     * which is what the runner coerces a filter value to.
+     */
+    readonly filterable: Readonly<Record<string, FilterFieldKind>>;
+    /** The declared fields as {@link FilterConfig.fieldTypes}, for `applyFilter` callers. */
+    readonly fieldTypes: Readonly<Record<string, {
+        kind: FilterFieldKind;
+    }>>;
+    /** Start a query over `rows` — hand the builder to the runner like a Lucid query. */
+    query(rows: Iterable<T>): InMemoryQueryBuilder<T>;
+    /** @internal */
+    readonly $fields: Readonly<Record<string, ResolvedField<T>>>;
+    /** @internal */
+    readonly $relations: Readonly<Record<string, InMemoryRelation<T>>>;
+}
+/**
+ * Thrown when the runner asks the in-memory builder for something only SQL can do: a raw
+ * predicate or ordering (policy `computed` fields, `fullText`, `vectorSimilarity`) — declare a
+ * virtual field instead — or a relation/field path the collection does not declare.
+ */
+export declare class InMemoryQueryError extends Error {
+    constructor(message: string);
+}
+/**
+ * Declare a collection: its fields (and their types), virtual fields, primary key and relations.
+ *
+ * ```ts
+ * const posts = defineCollection<Post>({ fields: { id: 'number', title: 'string' } })
+ * const users = defineCollection<User>({
+ *   fields: {
+ *     id: 'number',
+ *     name: 'string',
+ *     age: 'number',
+ *     tags: 'string[]',
+ *     fullName: { type: 'string', get: (u) => `${u.first} ${u.last}` },
+ *   },
+ *   relations: { posts: { kind: 'one-to-many', target: () => posts, get: (u) => u.posts } },
+ * })
+ *
+ * const qb = users.query(rows)
+ * const { page, size } = applyFilter(qb, input, { allowed: ['name', 'posts.title'] })
+ * return qb.paginate(page, size)
+ * ```
+ */
+export declare function defineCollection<T extends object>(options: DefineCollectionOptions<T>): InMemoryCollection<T>;
+/** The pagination meta {@link InMemoryQueryBuilder.paginate} returns — Lucid's paginator fields. */
+export interface InMemoryPageMeta {
+    total: number;
+    perPage: number;
+    currentPage: number;
+    lastPage: number;
+    firstPage: number;
+}
+/** One offset page — the shape of a serialized Lucid paginator (`{ meta, data }`). */
+export interface InMemoryPage<T> {
+    data: T[];
+    meta: InMemoryPageMeta;
+}
+/**
+ * A {@link QueryBuilderLike} over an array. Created by {@link InMemoryCollection.query}; hand it to
+ * any runner entry point exactly as you would a Lucid query, then read the result with
+ * {@link all}, {@link paginate}, or by awaiting it (it is thenable, like a Lucid query — which is
+ * what lets `groupByCountFromRequest` run over it unchanged).
+ */
+export declare class InMemoryQueryBuilder<T extends object> implements QueryBuilderLike {
+    readonly collection: InMemoryCollection<T>;
+    private readonly rows;
+    private readonly clauses;
+    private readonly sorts;
+    private readonly selects;
+    private readonly groups;
+    private readonly groupSearches;
+    private distinctFields;
+    private countAlias;
+    private limitCount;
+    private offsetCount;
+    constructor(collection: InMemoryCollection<T>, rows?: readonly T[]);
+    private field;
+    /** Strip a leading `<collection name>.` qualifier. */
+    private unqualify;
+    /**
+     * Read a (possibly dotted) path off a row. A dotted path crosses a to-one relation; crossing a
+     * to-many relation is ambiguous outside a `whereHas` (which the runner uses for filters) and is
+     * rejected.
+     */
+    read(row: T, rawPath: string): unknown;
+    /** The declared kind of a path (following to-one relations), or `unknown`. */
+    private kindOf;
+    /**
+     * Build a leaf predicate. `match` tests one non-null element; `negated` flips the element-level
+     * result into "no element matches" — with SQL's rule that a NULL value (or an uncastable
+     * comparison) satisfies neither a condition nor its negation.
+     */
+    private leaf;
+    private equalsLeaf;
+    private compareLeaf;
+    private inLeaf;
+    private betweenLeaf;
+    private likeLeaf;
+    private add;
+    private group;
+    /**
+     * Does `row` satisfy every recorded condition? Clauses chain left to right the way knex joins
+     * them — `a AND b OR c` — so AND binds tighter than OR, exactly as the emitted SQL would.
+     */
+    matches(row: T): boolean;
+    where(callback: (qb: QueryBuilderLike) => void): this;
+    where(column: string, value: unknown): this;
+    where(column: string, operator: string, value: unknown): this;
+    orWhere(callback: (qb: QueryBuilderLike) => void): this;
+    whereHas(relation: any, callback: (qb: QueryBuilderLike) => void): this;
+    whereNot(column: string, value: unknown): this;
+    whereIn(column: string, values: unknown[]): this;
+    whereNotIn(column: string, values: unknown[]): this;
+    whereNull(column: string): this;
+    whereNotNull(column: string): this;
+    whereBetween(column: string, range: [unknown, unknown]): this;
+    whereNotBetween(column: string, range: [unknown, unknown]): this;
+    whereILike(column: string, value: string): this;
+    orWhereILike(column: string, value: string): this;
+    orderBy(column: string, direction: 'asc' | 'desc'): this;
+    /**
+     * Only the group-by-count search predicate (`LOWER(??) LIKE ?`) is understood; any other raw
+     * SQL — a policy's `computed` fields, `fullText`, `vectorSimilarity` — throws
+     * {@link InMemoryQueryError}. Declare a virtual field on the collection instead of `computed`.
+     */
+    whereRaw(sql: string, bindings?: readonly unknown[]): this;
+    orderByRaw(sql: string, _bindings?: readonly unknown[]): this;
+    distinct(...columns: string[]): this;
+    limit(count: number): this;
+    offset(n: number): this;
+    select(...columns: string[]): this;
+    count(column: string): this;
+    groupBy(...columns: string[]): this;
+    private compareRows;
+    /** Ascending comparison with NULLs sorting last (so NULLS FIRST once a desc sort negates it). */
+    private compareValues;
+    /** Filter + sort (+ distinct / projection / aggregation), before limit/offset. */
+    private evaluate;
+    /**
+     * `GROUP BY` over the matched rows. An array-typed grouping field is unnested — each element is
+     * its own group — which is what a tag picker wants (Postgres would group whole arrays).
+     */
+    private aggregate;
+    private window;
+    /**
+     * Execute: the matching rows in order, honouring `limit`/`offset` (which is what a cursor page
+     * sets). Under a `distinct`, a `select` or a `groupBy`, the rows are projection objects — just
+     * as a Lucid query returns them.
+     */
+    all(): T[];
+    /** How many rows (or distinct tuples / groups) match, ignoring `limit`/`offset`. */
+    total(): number;
+    /**
+     * One offset page — the in-memory `query.paginate(page, size)`. Feed it the `{ page, size }`
+     * the runner resolved (clamped and defaulted), never raw request values.
+     */
+    paginate(page: number, perPage: number): InMemoryPage<T>;
+    /**
+     * Thenable, like a Lucid query: `await qb` resolves to {@link all}. This is what lets helpers
+     * that execute a builder by awaiting it (`groupByCountFromRequest`) run over an array.
+     */
+    then<R1 = T[], R2 = never>(onfulfilled?: ((rows: T[]) => R1 | PromiseLike<R1>) | null, onrejected?: ((reason: unknown) => R2 | PromiseLike<R2>) | null): Promise<R1 | R2>;
+}
+/**
+ * Filter, search, sort and offset-paginate `rows` in one call: {@link applyFilter} over a fresh
+ * builder, then {@link InMemoryQueryBuilder.paginate} with the resolved page. A `distinct` request
+ * pages the distinct tuples instead of rows.
+ *
+ * ```ts
+ * const page = filterInMemory(users, rows, parseFilterRequest(ctx.request.qs()), {
+ *   allowed: ['name', 'age', 'posts.title'],
+ *   searchable: ['name'],
+ *   fieldTypes: users.fieldTypes,
+ * })
+ * // → { data, meta: { total, perPage, currentPage, lastPage, firstPage } }
+ * ```
+ */
+export declare function filterInMemory<T extends object>(collection: InMemoryCollection<T>, rows: Iterable<T>, input: FilterInput, config: FilterConfig): InMemoryPage<T>;
+/**
+ * The keyset (cursor) counterpart of {@link filterInMemory}: {@link applyCursor} over a fresh
+ * builder (the primary key defaults to the collection's), then `buildCursorPage`. Keyset values
+ * are read through the collection, so a virtual field or a to-one relation path works as a cursor
+ * sort field.
+ */
+export declare function cursorInMemory<T extends object>(collection: InMemoryCollection<T>, rows: Iterable<T>, input: FilterInput & CursorParams, config: FilterConfig & {
+    primaryKey?: string;
+}): CursorPage<T>;
+export {};
+//# sourceMappingURL=in_memory.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"in_memory.d.ts","sourceRoot":"","sources":["../../src/in_memory.ts"],"names":[],"mappings":"AAAA,OAAO,EAEL,KAAK,UAAU,EACf,KAAK,YAAY,EAElB,MAAM,aAAa,CAAC;AACrB,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,oBAAoB,CAAC;AAE3D,OAAO,KAAK,EAAE,YAAY,EAAE,eAAe,EAAE,WAAW,EAAY,MAAM,YAAY,CAAC;AAEvF;;;;;;;;;;;;;;;GAeG;AAEH,mFAAmF;AACnF,MAAM,MAAM,iBAAiB,GAAG,UAAU,GAAG,UAAU,GAAG,WAAW,GAAG,QAAQ,CAAC;AAEjF;;;;GAIG;AACH,MAAM,MAAM,iBAAiB,GAAG,eAAe,GAAG,iBAAiB,CAAC;AAEpE,gGAAgG;AAChG,MAAM,WAAW,oBAAoB,CAAC,CAAC;IACrC,IAAI,EAAE,iBAAiB,CAAC;IACxB,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,KAAK,OAAO,CAAC;CAC1B;AAED,sGAAsG;AACtG,MAAM,MAAM,wBAAwB,CAAC,CAAC,IAAI,iBAAiB,GAAG,oBAAoB,CAAC,CAAC,CAAC,CAAC;AAEtF,0FAA0F;AAC1F,MAAM,MAAM,oBAAoB,GAAG,YAAY,GAAG,aAAa,GAAG,aAAa,GAAG,cAAc,CAAC;AAEjG;;;;GAIG;AACH,MAAM,WAAW,gBAAgB,CAAC,CAAC;IACjC,IAAI,EAAE,oBAAoB,CAAC;IAC3B,oFAAoF;IAEpF,MAAM,EAAE,MAAM,kBAAkB,CAAC,GAAG,CAAC,CAAC;IACtC,kFAAkF;IAClF,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,KAAK,OAAO,CAAC;CAC1B;AAED,4CAA4C;AAC5C,MAAM,WAAW,uBAAuB,CAAC,CAAC;IACxC;;;;;OAKG;IACH,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,wBAAwB,CAAC,CAAC,CAAC,CAAC,CAAC;IACpD,mEAAmE;IACnE,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,+CAA+C;IAC/C,SAAS,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC;IAChD;;;OAGG;IACH,IAAI,CAAC,EAAE,MAAM,CAAC;CACf;AAED,UAAU,aAAa,CAAC,CAAC;IACvB,IAAI,EAAE,eAAe,CAAC;IACtB,KAAK,EAAE,OAAO,CAAC;IACf,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,KAAK,OAAO,CAAC,GAAG,SAAS,CAAC;CACxC;AAED,iFAAiF;AACjF,MAAM,WAAW,kBAAkB,CAAC,CAAC,SAAS,MAAM;IAClD,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,SAAS,CAAC;IAClC,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B;;;;OAIG;IACH,QAAQ,CAAC,UAAU,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,eAAe,CAAC,CAAC,CAAC;IAC/D,yFAAyF;IACzF,QAAQ,CAAC,UAAU,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE;QAAE,IAAI,EAAE,eAAe,CAAA;KAAE,CAAC,CAAC,CAAC;IACzE,qFAAqF;IACrF,KAAK,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,oBAAoB,CAAC,CAAC,CAAC,CAAC;IAClD,gBAAgB;IAChB,QAAQ,CAAC,OAAO,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7D,gBAAgB;IAChB,QAAQ,CAAC,UAAU,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;CACpE;AAED;;;;GAIG;AACH,qBAAa,kBAAmB,SAAQ,KAAK;IAC3C,YAAY,OAAO,EAAE,MAAM,EAG1B;CACF;AAcD;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,wBAAgB,gBAAgB,CAAC,CAAC,SAAS,MAAM,EAC/C,OAAO,EAAE,uBAAuB,CAAC,CAAC,CAAC,GAClC,kBAAkB,CAAC,CAAC,CAAC,CA4BvB;AA8JD,oGAAoG;AACpG,MAAM,WAAW,gBAAgB;IAC/B,KAAK,EAAE,MAAM,CAAC;IACd,OAAO,EAAE,MAAM,CAAC;IAChB,WAAW,EAAE,MAAM,CAAC;IACpB,QAAQ,EAAE,MAAM,CAAC;IACjB,SAAS,EAAE,MAAM,CAAC;CACnB;AAED,sFAAsF;AACtF,MAAM,WAAW,YAAY,CAAC,CAAC;IAC7B,IAAI,EAAE,CAAC,EAAE,CAAC;IACV,IAAI,EAAE,gBAAgB,CAAC;CACxB;AAED;;;;;GAKG;AACH,qBAAa,oBAAoB,CAAC,CAAC,SAAS,MAAM,CAAE,YAAW,gBAAgB;IAY3E,QAAQ,CAAC,UAAU,EAAE,kBAAkB,CAAC,CAAC,CAAC;IAC1C,OAAO,CAAC,QAAQ,CAAC,IAAI;IAZvB,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAmB;IAC3C,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAkB;IACxC,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAyC;IACjE,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAgB;IACvC,OAAO,CAAC,QAAQ,CAAC,aAAa,CAA4C;IAC1E,OAAO,CAAC,cAAc,CAAgB;IACtC,OAAO,CAAC,UAAU,CAAqB;IACvC,OAAO,CAAC,UAAU,CAAqB;IACvC,OAAO,CAAC,WAAW,CAAqB;IAExC,YACW,UAAU,EAAE,kBAAkB,CAAC,CAAC,CAAC,EACzB,IAAI,GAAE,SAAS,CAAC,EAAO,EACtC;IAIJ,OAAO,CAAC,KAAK;IAIb,sDAAsD;IACtD,OAAO,CAAC,SAAS;IAKjB;;;;OAIG;IACH,IAAI,CAAC,GAAG,EAAE,CAAC,EAAE,OAAO,EAAE,MAAM,GAAG,OAAO,CA0BrC;IAED,8EAA8E;IAC9E,OAAO,CAAC,MAAM;IAYd;;;;OAIG;IACH,OAAO,CAAC,IAAI;IAqBZ,OAAO,CAAC,UAAU;IAWlB,OAAO,CAAC,WAAW;IAyBnB,OAAO,CAAC,MAAM;IAqBd,OAAO,CAAC,WAAW;IAenB,OAAO,CAAC,QAAQ;IAKhB,OAAO,CAAC,GAAG;IAKX,OAAO,CAAC,KAAK;IAQb;;;OAGG;IACH,OAAO,CAAC,GAAG,EAAE,CAAC,GAAG,OAAO,CAWvB;IAID,KAAK,CAAC,QAAQ,EAAE,CAAC,EAAE,EAAE,gBAAgB,KAAK,IAAI,GAAG,IAAI,CAAC;IACtD,KAAK,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,GAAG,IAAI,CAAC;IAC5C,KAAK,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,GAAG,IAAI,CAAC;IAY9D,OAAO,CAAC,QAAQ,EAAE,CAAC,EAAE,EAAE,gBAAgB,KAAK,IAAI,GAAG,IAAI,CAEtD;IAGD,QAAQ,CAAC,QAAQ,EAAE,GAAG,EAAE,QAAQ,EAAE,CAAC,EAAE,EAAE,gBAAgB,KAAK,IAAI,GAAG,IAAI,CAStE;IAED,QAAQ,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,GAAG,IAAI,CAG7C;IAED,OAAO,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,GAAG,IAAI,CAE/C;IAED,UAAU,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,GAAG,IAAI,CAElD;IAED,SAAS,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAE9B;IAED,YAAY,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAEjC;IAED,YAAY,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,OAAO,EAAE,OAAO,CAAC,GAAG,IAAI,CAE5D;IAED,eAAe,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,OAAO,EAAE,OAAO,CAAC,GAAG,IAAI,CAE/D;IAED,UAAU,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,IAAI,CAE9C;IAED,YAAY,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,IAAI,CAEhD;IAED,OAAO,CAAC,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,KAAK,GAAG,MAAM,GAAG,IAAI,CAGvD;IAED;;;;OAIG;IACH,QAAQ,CAAC,GAAG,EAAE,MAAM,EAAE,QAAQ,GAAE,SAAS,OAAO,EAAO,GAAG,IAAI,CAa7D;IAED,UAAU,CAAC,GAAG,EAAE,MAAM,EAAE,SAAS,GAAE,SAAS,OAAO,EAAO,GAAG,IAAI,CAIhE;IAED,QAAQ,CAAC,GAAG,OAAO,EAAE,MAAM,EAAE,GAAG,IAAI,CAGnC;IAED,KAAK,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI,CAGzB;IAED,MAAM,CAAC,CAAC,EAAE,MAAM,GAAG,IAAI,CAGtB;IAED,MAAM,CAAC,GAAG,OAAO,EAAE,MAAM,EAAE,GAAG,IAAI,CAGjC;IAED,KAAK,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAO1B;IAED,OAAO,CAAC,GAAG,OAAO,EAAE,MAAM,EAAE,GAAG,IAAI,CAGlC;IAID,OAAO,CAAC,WAAW;IAYnB,iGAAiG;IACjG,OAAO,CAAC,aAAa;IAMrB,kFAAkF;IAClF,OAAO,CAAC,QAAQ;IAqChB;;;OAGG;IACH,OAAO,CAAC,SAAS;IAyEjB,OAAO,CAAC,MAAM;IAMd;;;;OAIG;IACH,GAAG,IAAI,CAAC,EAAE,CAET;IAED,oFAAoF;IACpF,KAAK,IAAI,MAAM,CAEd;IAED;;;OAGG;IACH,QAAQ,CAAC,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,YAAY,CAAC,CAAC,CAAC,CAevD;IAED;;;OAGG;IAEH,IAAI,CAAC,EAAE,GAAG,CAAC,EAAE,EAAE,EAAE,GAAG,KAAK,EACvB,WAAW,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,GAAG,WAAW,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,EAC1D,UAAU,CAAC,EAAE,CAAC,CAAC,MAAM,EAAE,OAAO,KAAK,EAAE,GAAG,WAAW,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,GAC9D,OAAO,CAAC,EAAE,GAAG,EAAE,CAAC,CAElB;CACF;AAMD;;;;;;;;;;;;;GAaG;AACH,wBAAgB,cAAc,CAAC,CAAC,SAAS,MAAM,EAC7C,UAAU,EAAE,kBAAkB,CAAC,CAAC,CAAC,EACjC,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,EACjB,KAAK,EAAE,WAAW,EAClB,MAAM,EAAE,YAAY,GACnB,YAAY,CAAC,CAAC,CAAC,CAIjB;AAED;;;;;GAKG;AACH,wBAAgB,cAAc,CAAC,CAAC,SAAS,MAAM,EAC7C,UAAU,EAAE,kBAAkB,CAAC,CAAC,CAAC,EACjC,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,EACjB,KAAK,EAAE,WAAW,GAAG,YAAY,EACjC,MAAM,EAAE,YAAY,GAAG;IAAE,UAAU,CAAC,EAAE,MAAM,CAAA;CAAE,GAC7C,UAAU,CAAC,CAAC,CAAC,CAuBf"}

package/dist/src/in_memory.js

@@ -0,0 +1,759 @@
+import { buildCursorPage, } from './cursor.js';
+import { applyCursor, applyFilter } from './runner.js';
+/**
+ * Thrown when the runner asks the in-memory builder for something only SQL can do: a raw
+ * predicate or ordering (policy `computed` fields, `fullText`, `vectorSimilarity`) — declare a
+ * virtual field instead — or a relation/field path the collection does not declare.
+ */
+export class InMemoryQueryError extends Error {
+    constructor(message) {
+        super(message);
+        this.name = 'InMemoryQueryError';
+    }
+}
+const ARRAY_KINDS = {
+    'string[]': 'string',
+    'number[]': 'number',
+    'boolean[]': 'boolean',
+    'date[]': 'date',
+};
+function resolveType(type) {
+    const element = ARRAY_KINDS[type];
+    return element ? { kind: element, array: true } : { kind: type, array: false };
+}
+/**
+ * Declare a collection: its fields (and their types), virtual fields, primary key and relations.
+ *
+ * ```ts
+ * const posts = defineCollection<Post>({ fields: { id: 'number', title: 'string' } })
+ * const users = defineCollection<User>({
+ *   fields: {
+ *     id: 'number',
+ *     name: 'string',
+ *     age: 'number',
+ *     tags: 'string[]',
+ *     fullName: { type: 'string', get: (u) => `${u.first} ${u.last}` },
+ *   },
+ *   relations: { posts: { kind: 'one-to-many', target: () => posts, get: (u) => u.posts } },
+ * })
+ *
+ * const qb = users.query(rows)
+ * const { page, size } = applyFilter(qb, input, { allowed: ['name', 'posts.title'] })
+ * return qb.paginate(page, size)
+ * ```
+ */
+export function defineCollection(options) {
+    const fields = Object.create(null);
+    const filterable = {};
+    const fieldTypes = {};
+    for (const [name, declaration] of Object.entries(options.fields)) {
+        const virtual = typeof declaration === 'object' ? declaration : undefined;
+        const { kind, array } = resolveType(virtual ? virtual.type : declaration);
+        fields[name] = { kind, array, get: virtual?.get };
+        filterable[name] = kind;
+        fieldTypes[name] = { kind };
+    }
+    const relations = Object.create(null);
+    for (const [name, relation] of Object.entries(options.relations ?? {})) {
+        relations[name] = relation;
+    }
+    const collection = {
+        name: options.name,
+        primaryKey: options.primaryKey ?? 'id',
+        filterable,
+        fieldTypes,
+        $fields: fields,
+        $relations: relations,
+        query: (rows) => new InMemoryQueryBuilder(collection, [...rows]),
+    };
+    return collection;
+}
+function isNil(value) {
+    return value === null || value === undefined;
+}
+function hasToMillis(value) {
+    return (typeof value === 'object' &&
+        value !== null &&
+        typeof value.toMillis === 'function');
+}
+/** The kind a runtime value has — used for undeclared (`unknown`/`json`) fields. */
+function inferKind(value) {
+    if (typeof value === 'number' || typeof value === 'bigint')
+        return 'number';
+    if (typeof value === 'boolean')
+        return 'boolean';
+    if (typeof value === 'string')
+        return 'string';
+    if (value instanceof Date || hasToMillis(value))
+        return 'date';
+    return 'json';
+}
+/**
+ * Normalize a value to a comparable primitive of `kind`, the way Postgres casts a bound literal to
+ * the column type. `undefined` means "cannot be cast" — the comparison is then false, where
+ * Postgres would have rejected the query outright.
+ */
+function normalize(value, kind) {
+    if (isNil(value))
+        return undefined;
+    switch (kind) {
+        case 'number': {
+            if (typeof value === 'number')
+                return Number.isFinite(value) ? value : undefined;
+            if (typeof value === 'bigint')
+                return Number(value);
+            if (typeof value === 'string' && value.trim() !== '') {
+                const n = Number(value.trim());
+                return Number.isFinite(n) ? n : undefined;
+            }
+            return undefined;
+        }
+        case 'boolean': {
+            if (typeof value === 'boolean')
+                return value;
+            if (value === 1 || value === 0)
+                return value === 1;
+            if (typeof value === 'string') {
+                const v = value.trim().toLowerCase();
+                if (v === 'true' || v === '1')
+                    return true;
+                if (v === 'false' || v === '0')
+                    return false;
+            }
+            return undefined;
+        }
+        case 'date': {
+            if (value instanceof Date) {
+                const t = value.getTime();
+                return Number.isNaN(t) ? undefined : t;
+            }
+            if (hasToMillis(value))
+                return value.toMillis();
+            if (typeof value === 'number')
+                return Number.isFinite(value) ? value : undefined;
+            if (typeof value === 'string') {
+                const t = Date.parse(value);
+                return Number.isNaN(t) ? undefined : t;
+            }
+            return undefined;
+        }
+        case 'string':
+            return typeof value === 'string' ? value : stringify(value);
+        default:
+            // json / unknown: structural equality only.
+            return typeof value === 'object' ? JSON.stringify(value) : value;
+    }
+}
+/** Text form of a value — what a LIKE on a non-text column matches against. */
+function stringify(value) {
+    if (typeof value === 'string')
+        return value;
+    if (value instanceof Date)
+        return value.toISOString();
+    if (hasToMillis(value))
+        return new Date(value.toMillis()).toISOString();
+    if (typeof value === 'object' && value !== null)
+        return JSON.stringify(value);
+    return String(value);
+}
+/**
+ * Compare a row value to a comparand under `kind` (`json`/`unknown` → the row value's own kind).
+ * `undefined` when either side cannot be cast or the kind has no ordering.
+ */
+function compare(rowValue, comparand, declared) {
+    const kind = declared === 'json' || declared === 'unknown' ? inferKind(rowValue) : declared;
+    const a = normalize(rowValue, kind);
+    const b = normalize(comparand, kind);
+    if (a === undefined || b === undefined)
+        return undefined;
+    if (typeof a === 'number' && typeof b === 'number')
+        return a - b;
+    if (typeof a === 'boolean' && typeof b === 'boolean')
+        return Number(a) - Number(b);
+    if (typeof a === 'string' && typeof b === 'string') {
+        // Code-unit order — Postgres' "C" collation. Deterministic and locale-free, which a keyset
+        // cursor needs: the seek predicate and the ORDER BY must agree on every pair of values.
+        return a < b ? -1 : a > b ? 1 : 0;
+    }
+    return a === b ? 0 : undefined;
+}
+/** Compile a LIKE pattern (backslash escapes, `%`, `_`) into an anchored RegExp. */
+function likeToRegExp(pattern, caseInsensitive) {
+    let source = '';
+    for (let i = 0; i < pattern.length; i++) {
+        const ch = pattern[i];
+        if (ch === '\\' && i + 1 < pattern.length) {
+            source += escapeRegExp(pattern[++i]);
+        }
+        else if (ch === '%') {
+            source += '.*';
+        }
+        else if (ch === '_') {
+            source += '.';
+        }
+        else {
+            source += escapeRegExp(ch);
+        }
+    }
+    return new RegExp(`^${source}$`, caseInsensitive ? 'is' : 's');
+}
+function escapeRegExp(ch) {
+    return ch.replace(/[.*+?^${}()|[\]\\/]/g, '\\$&');
+}
+/** Relation targets normalized to a list (a to-one relation yields zero or one row). */
+function relatedRows(value) {
+    if (isNil(value))
+        return [];
+    if (Array.isArray(value))
+        return value.filter((v) => !isNil(v));
+    return [value];
+}
+/** Parse a `expr AS alias` select/count argument. */
+function parseAlias(expression) {
+    const match = /^\s*(.+?)\s+as\s+([A-Za-z_][A-Za-z0-9_]*)\s*$/i.exec(expression);
+    return match
+        ? { expr: match[1].trim(), alias: match[2] }
+        : { expr: expression.trim(), alias: expression.trim() };
+}
+/** The raw predicate the group-by-count search emits — the only raw SQL this adapter understands. */
+const GROUP_SEARCH_SQL = /^\s*LOWER\(\?\?\)\s+LIKE\s+\?\s*$/i;
+/**
+ * A {@link QueryBuilderLike} over an array. Created by {@link InMemoryCollection.query}; hand it to
+ * any runner entry point exactly as you would a Lucid query, then read the result with
+ * {@link all}, {@link paginate}, or by awaiting it (it is thenable, like a Lucid query — which is
+ * what lets `groupByCountFromRequest` run over it unchanged).
+ */
+export class InMemoryQueryBuilder {
+    collection;
+    rows;
+    clauses = [];
+    sorts = [];
+    selects = [];
+    groups = [];
+    groupSearches = [];
+    distinctFields = [];
+    countAlias;
+    limitCount;
+    offsetCount;
+    constructor(collection, rows = []) {
+        this.collection = collection;
+        this.rows = rows;
+    }
+    // -- field access -----------------------------------------------------------------------------
+    field(name) {
+        return this.collection.$fields[name];
+    }
+    /** Strip a leading `<collection name>.` qualifier. */
+    unqualify(path) {
+        const name = this.collection.name;
+        return name !== undefined && path.startsWith(`${name}.`) ? path.slice(name.length + 1) : path;
+    }
+    /**
+     * Read a (possibly dotted) path off a row. A dotted path crosses a to-one relation; crossing a
+     * to-many relation is ambiguous outside a `whereHas` (which the runner uses for filters) and is
+     * rejected.
+     */
+    read(row, rawPath) {
+        const path = this.unqualify(rawPath);
+        const dot = path.indexOf('.');
+        if (dot === -1) {
+            const declared = this.field(path);
+            if (declared?.get)
+                return declared.get(row);
+            return Object.hasOwn(row, path) ? row[path] : undefined;
+        }
+        const head = path.slice(0, dot);
+        const relation = this.collection.$relations[head];
+        if (!relation) {
+            throw new InMemoryQueryError(`"${rawPath}" crosses "${head}", which is not a relation declared on this collection.`);
+        }
+        if (relation.kind === 'one-to-many' || relation.kind === 'many-to-many') {
+            throw new InMemoryQueryError(`"${rawPath}" reads through the to-many relation "${head}" — only a filter (EXISTS) can cross it.`);
+        }
+        const related = relatedRows(relation.get(row))[0];
+        if (related === undefined)
+            return undefined;
+        return relation
+            .target()
+            .query([])
+            .read(related, path.slice(dot + 1));
+    }
+    /** The declared kind of a path (following to-one relations), or `unknown`. */
+    kindOf(rawPath) {
+        const path = this.unqualify(rawPath);
+        const dot = path.indexOf('.');
+        if (dot === -1)
+            return this.field(path) ?? { kind: 'unknown', array: false };
+        const relation = this.collection.$relations[path.slice(0, dot)];
+        if (!relation)
+            return { kind: 'unknown', array: false };
+        return relation
+            .target()
+            .query([])
+            .kindOf(path.slice(dot + 1));
+    }
+    /**
+     * Build a leaf predicate. `match` tests one non-null element; `negated` flips the element-level
+     * result into "no element matches" — with SQL's rule that a NULL value (or an uncastable
+     * comparison) satisfies neither a condition nor its negation.
+     */
+    leaf(path, match, negated = false) {
+        const { kind, array } = this.kindOf(path);
+        return (row) => {
+            const value = this.read(row, path);
+            if (isNil(value))
+                return false;
+            if (array || (Array.isArray(value) && (kind === 'unknown' || kind === 'json'))) {
+                const elements = (Array.isArray(value) ? value : [value]).filter((e) => !isNil(e));
+                const results = elements.map((e) => match(e, kind));
+                if (negated)
+                    return results.every((r) => r === false);
+                return results.some((r) => r === true);
+            }
+            const result = match(value, kind);
+            if (result === undefined)
+                return false;
+            return negated ? !result : result;
+        };
+    }
+    equalsLeaf(path, value, negated) {
+        return this.leaf(path, (e, kind) => {
+            const c = compare(e, value, kind);
+            return c === undefined ? undefined : c === 0;
+        }, negated);
+    }
+    compareLeaf(path, operator, value) {
+        switch (operator) {
+            case '=':
+                return isNil(value) ? () => false : this.equalsLeaf(path, value, false);
+            case '!=':
+            case '<>':
+                return isNil(value) ? () => false : this.equalsLeaf(path, value, true);
+            case '>':
+            case '>=':
+            case '<':
+            case '<=':
+                if (isNil(value))
+                    return () => false;
+                return this.leaf(path, (e, kind) => {
+                    const c = compare(e, value, kind);
+                    if (c === undefined)
+                        return undefined;
+                    if (operator === '>')
+                        return c > 0;
+                    if (operator === '>=')
+                        return c >= 0;
+                    if (operator === '<')
+                        return c < 0;
+                    return c <= 0;
+                });
+            default:
+                throw new InMemoryQueryError(`Unsupported comparison operator "${operator}".`);
+        }
+    }
+    inLeaf(path, values, negated) {
+        // SQL: `x IN ()` is false and `x NOT IN ()` is true for every row, NULLs included (knex emits
+        // 1 = 0 / 1 = 1); `x NOT IN (…, NULL)` is never true.
+        if (values.length === 0)
+            return () => negated;
+        if (negated && values.some(isNil))
+            return () => false;
+        const candidates = values.filter((v) => !isNil(v));
+        return this.leaf(path, (e, kind) => {
+            let unknown = false;
+            for (const candidate of candidates) {
+                const c = compare(e, candidate, kind);
+                if (c === 0)
+                    return true;
+                if (c === undefined)
+                    unknown = true;
+            }
+            return unknown ? undefined : false;
+        }, negated);
+    }
+    betweenLeaf(path, range, negated) {
+        const [low, high] = Array.isArray(range) ? range : [undefined, undefined];
+        if (isNil(low) || isNil(high))
+            return () => false;
+        return this.leaf(path, (e, kind) => {
+            const lo = compare(e, low, kind);
+            const hi = compare(e, high, kind);
+            if (lo === undefined || hi === undefined)
+                return undefined;
+            return lo >= 0 && hi <= 0;
+        }, negated);
+    }
+    likeLeaf(path, pattern) {
+        const regex = likeToRegExp(pattern, true);
+        return this.leaf(path, (e) => regex.test(stringify(e)));
+    }
+    add(test, or = false) {
+        this.clauses.push({ or, test });
+        return this;
+    }
+    group(callback, or) {
+        const child = new InMemoryQueryBuilder(this.collection);
+        callback(child);
+        // An empty group compiles to nothing in knex — not to an always-true/false clause.
+        if (child.clauses.length === 0)
+            return this;
+        return this.add((row) => child.matches(row), or);
+    }
+    /**
+     * Does `row` satisfy every recorded condition? Clauses chain left to right the way knex joins
+     * them — `a AND b OR c` — so AND binds tighter than OR, exactly as the emitted SQL would.
+     */
+    matches(row) {
+        let result = false;
+        let segment = true;
+        this.clauses.forEach((clause, index) => {
+            if (clause.or && index > 0) {
+                result ||= segment;
+                segment = true;
+            }
+            segment &&= clause.test(row);
+        });
+        return this.clauses.length === 0 ? true : result || segment;
+    }
+    where(...args) {
+        if (typeof args[0] === 'function') {
+            return this.group(args[0], false);
+        }
+        const column = args[0];
+        if (args.length >= 3)
+            return this.add(this.compareLeaf(column, String(args[1]), args[2]));
+        // knex compiles `where(col, null)` to `col IS NULL`.
+        if (isNil(args[1]))
+            return this.whereNull(column);
+        return this.add(this.equalsLeaf(column, args[1], false));
+    }
+    orWhere(callback) {
+        return this.group(callback, true);
+    }
+    // biome-ignore lint/suspicious/noExplicitAny: matches QueryBuilderLike.whereHas (see its docblock).
+    whereHas(relation, callback) {
+        const name = String(relation);
+        const declared = this.collection.$relations[name];
+        if (!declared) {
+            throw new InMemoryQueryError(`"${name}" is not a relation declared on this collection.`);
+        }
+        const child = new InMemoryQueryBuilder(declared.target());
+        callback(child);
+        return this.add((row) => relatedRows(declared.get(row)).some((r) => child.matches(r)));
+    }
+    whereNot(column, value) {
+        if (isNil(value))
+            return this.whereNotNull(column);
+        return this.add(this.equalsLeaf(column, value, true));
+    }
+    whereIn(column, values) {
+        return this.add(this.inLeaf(column, Array.isArray(values) ? values : [values], false));
+    }
+    whereNotIn(column, values) {
+        return this.add(this.inLeaf(column, Array.isArray(values) ? values : [values], true));
+    }
+    whereNull(column) {
+        return this.add((row) => isNil(this.read(row, column)));
+    }
+    whereNotNull(column) {
+        return this.add((row) => !isNil(this.read(row, column)));
+    }
+    whereBetween(column, range) {
+        return this.add(this.betweenLeaf(column, range, false));
+    }
+    whereNotBetween(column, range) {
+        return this.add(this.betweenLeaf(column, range, true));
+    }
+    whereILike(column, value) {
+        return this.add(this.likeLeaf(column, value));
+    }
+    orWhereILike(column, value) {
+        return this.add(this.likeLeaf(column, value), true);
+    }
+    orderBy(column, direction) {
+        this.sorts.push({ field: column, direction: direction === 'desc' ? 'desc' : 'asc' });
+        return this;
+    }
+    /**
+     * Only the group-by-count search predicate (`LOWER(??) LIKE ?`) is understood; any other raw
+     * SQL — a policy's `computed` fields, `fullText`, `vectorSimilarity` — throws
+     * {@link InMemoryQueryError}. Declare a virtual field on the collection instead of `computed`.
+     */
+    whereRaw(sql, bindings = []) {
+        if (GROUP_SEARCH_SQL.test(sql) && typeof bindings[0] === 'string') {
+            const field = bindings[0];
+            const pattern = likeToRegExp(String(bindings[1] ?? ''), false);
+            this.groupSearches.push({ field, pattern });
+            return this.add(this.leaf(field, (e) => pattern.test(stringify(e).toLowerCase())), false);
+        }
+        throw new InMemoryQueryError(`The in-memory adapter cannot evaluate raw SQL (${JSON.stringify(sql)}). Policy \`computed\` fields, \`fullText\` and \`vectorSimilarity\` are SQL-only — declare a virtual field on the collection instead.`);
+    }
+    orderByRaw(sql, _bindings = []) {
+        throw new InMemoryQueryError(`The in-memory adapter cannot order by raw SQL (${JSON.stringify(sql)}). Declare a virtual field on the collection and sort on it instead.`);
+    }
+    distinct(...columns) {
+        this.distinctFields = columns;
+        return this;
+    }
+    limit(count) {
+        this.limitCount = Math.max(0, count);
+        return this;
+    }
+    offset(n) {
+        this.offsetCount = Math.max(0, n);
+        return this;
+    }
+    select(...columns) {
+        for (const column of columns)
+            this.selects.push(parseAlias(column));
+        return this;
+    }
+    count(column) {
+        const { expr, alias } = parseAlias(column);
+        if (expr !== '*') {
+            throw new InMemoryQueryError(`Only count('*') is supported in memory, got "${column}".`);
+        }
+        this.countAlias = alias;
+        return this;
+    }
+    groupBy(...columns) {
+        this.groups.push(...columns);
+        return this;
+    }
+    // -- execution --------------------------------------------------------------------------------
+    compareRows(a, b) {
+        for (const { field, direction } of this.sorts) {
+            const c = this.compareValues(this.read(a, field), this.read(b, field), this.kindOf(field).kind);
+            if (c !== 0)
+                return direction === 'desc' ? -c : c;
+        }
+        return 0;
+    }
+    /** Ascending comparison with NULLs sorting last (so NULLS FIRST once a desc sort negates it). */
+    compareValues(a, b, kind) {
+        if (isNil(a))
+            return isNil(b) ? 0 : 1;
+        if (isNil(b))
+            return -1;
+        return compare(a, b, kind) ?? 0;
+    }
+    /** Filter + sort (+ distinct / projection / aggregation), before limit/offset. */
+    evaluate() {
+        const matched = this.rows.filter((row) => this.matches(row));
+        if (this.groups.length > 0)
+            return this.aggregate(matched);
+        const sorted = this.sorts.length > 0 ? [...matched].sort((a, b) => this.compareRows(a, b)) : matched;
+        if (this.distinctFields.length > 0) {
+            const seen = new Set();
+            const out = [];
+            for (const row of sorted) {
+                const projected = {};
+                const key = [];
+                for (const field of this.distinctFields) {
+                    const value = this.read(row, field);
+                    projected[this.unqualify(field)] = value;
+                    key.push(normalize(value, this.kindOf(field).kind) ?? null);
+                }
+                const k = JSON.stringify(key);
+                if (!seen.has(k)) {
+                    seen.add(k);
+                    out.push(projected);
+                }
+            }
+            return out;
+        }
+        if (this.selects.length > 0) {
+            return sorted.map((row) => {
+                const projected = {};
+                for (const { expr, alias } of this.selects)
+                    projected[alias] = this.read(row, expr);
+                return projected;
+            });
+        }
+        return sorted;
+    }
+    /**
+     * `GROUP BY` over the matched rows. An array-typed grouping field is unnested — each element is
+     * its own group — which is what a tag picker wants (Postgres would group whole arrays).
+     */
+    aggregate(rows) {
+        const columns = this.groups;
+        const groups = new Map();
+        const single = columns.length === 1 ? columns[0] : undefined;
+        const unnest = single !== undefined && this.kindOf(single).array;
+        const searches = this.groupSearches.filter((s) => s.field === single);
+        for (const row of rows) {
+            const tuples = [];
+            if (unnest) {
+                const value = this.read(row, single);
+                const elements = Array.isArray(value) ? value : isNil(value) ? [null] : [value];
+                for (const element of elements) {
+                    if (searches.every((s) => !isNil(element) && s.pattern.test(stringify(element).toLowerCase()))) {
+                        tuples.push([element]);
+                    }
+                }
+            }
+            else {
+                tuples.push(columns.map((c) => this.read(row, c)));
+            }
+            for (const values of tuples) {
+                const key = JSON.stringify(values.map((v, i) => normalize(v, this.kindOf(columns[i]).kind) ?? null));
+                const group = groups.get(key);
+                if (group)
+                    group.count++;
+                else
+                    groups.set(key, { values, count: 1 });
+            }
+        }
+        const outputs = [...groups.values()].map(({ values, count }) => {
+            const row = {};
+            const selects = this.selects.length > 0 ? this.selects : columns.map((c) => ({ expr: c, alias: c }));
+            for (const { expr, alias } of selects) {
+                const index = columns.indexOf(expr);
+                if (index === -1) {
+                    throw new InMemoryQueryError(`"${expr}" is selected but not grouped by.`);
+                }
+                row[alias] = values[index];
+            }
+            if (this.countAlias !== undefined)
+                row[this.countAlias] = count;
+            return { row, values, count };
+        });
+        outputs.sort((a, b) => {
+            for (const { field, direction } of this.sorts) {
+                let c;
+                if (field === this.countAlias) {
+                    c = a.count - b.count;
+                }
+                else {
+                    const index = columns.indexOf(field);
+                    const aliasIndex = this.selects.findIndex((s) => s.alias === field);
+                    const i = index !== -1
+                        ? index
+                        : aliasIndex !== -1
+                            ? columns.indexOf(this.selects[aliasIndex].expr)
+                            : -1;
+                    if (i === -1)
+                        throw new InMemoryQueryError(`Cannot order grouped rows by "${field}".`);
+                    c = this.compareValues(a.values[i], b.values[i], this.kindOf(columns[i]).kind);
+                }
+                if (c !== 0)
+                    return direction === 'desc' ? -c : c;
+            }
+            return 0;
+        });
+        return outputs.map((o) => o.row);
+    }
+    window(rows) {
+        const start = this.offsetCount ?? 0;
+        const end = this.limitCount === undefined ? undefined : start + this.limitCount;
+        return rows.slice(start, end);
+    }
+    /**
+     * Execute: the matching rows in order, honouring `limit`/`offset` (which is what a cursor page
+     * sets). Under a `distinct`, a `select` or a `groupBy`, the rows are projection objects — just
+     * as a Lucid query returns them.
+     */
+    all() {
+        return this.window(this.evaluate());
+    }
+    /** How many rows (or distinct tuples / groups) match, ignoring `limit`/`offset`. */
+    total() {
+        return this.evaluate().length;
+    }
+    /**
+     * One offset page — the in-memory `query.paginate(page, size)`. Feed it the `{ page, size }`
+     * the runner resolved (clamped and defaulted), never raw request values.
+     */
+    paginate(page, perPage) {
+        const size = Math.max(1, Math.floor(perPage));
+        const current = Math.max(1, Math.floor(page));
+        const rows = this.evaluate();
+        const total = rows.length;
+        return {
+            data: rows.slice((current - 1) * size, current * size),
+            meta: {
+                total,
+                perPage: size,
+                currentPage: current,
+                lastPage: Math.max(1, Math.ceil(total / size)),
+                firstPage: 1,
+            },
+        };
+    }
+    /**
+     * Thenable, like a Lucid query: `await qb` resolves to {@link all}. This is what lets helpers
+     * that execute a builder by awaiting it (`groupByCountFromRequest`) run over an array.
+     */
+    // biome-ignore lint/suspicious/noThenProperty: deliberately thenable, mirroring Lucid's query builders.
+    then(onfulfilled, onrejected) {
+        return new Promise((resolve) => resolve(this.all())).then(onfulfilled, onrejected);
+    }
+}
+// ---------------------------------------------------------------------------------------------
+// One-call helpers
+// ---------------------------------------------------------------------------------------------
+/**
+ * Filter, search, sort and offset-paginate `rows` in one call: {@link applyFilter} over a fresh
+ * builder, then {@link InMemoryQueryBuilder.paginate} with the resolved page. A `distinct` request
+ * pages the distinct tuples instead of rows.
+ *
+ * ```ts
+ * const page = filterInMemory(users, rows, parseFilterRequest(ctx.request.qs()), {
+ *   allowed: ['name', 'age', 'posts.title'],
+ *   searchable: ['name'],
+ *   fieldTypes: users.fieldTypes,
+ * })
+ * // → { data, meta: { total, perPage, currentPage, lastPage, firstPage } }
+ * ```
+ */
+export function filterInMemory(collection, rows, input, config) {
+    const qb = collection.query(rows);
+    const { page, size } = applyFilter(qb, input, config);
+    return qb.paginate(page, size);
+}
+/**
+ * The keyset (cursor) counterpart of {@link filterInMemory}: {@link applyCursor} over a fresh
+ * builder (the primary key defaults to the collection's), then `buildCursorPage`. Keyset values
+ * are read through the collection, so a virtual field or a to-one relation path works as a cursor
+ * sort field.
+ */
+export function cursorInMemory(collection, rows, input, config) {
+    const qb = collection.query(rows);
+    const cursorConfig = {
+        ...config,
+        primaryKey: config.primaryKey ?? collection.primaryKey,
+    };
+    const resolved = applyCursor(qb, input, cursorConfig);
+    const fetched = qb.all();
+    // buildCursorPage reads keyset values as plain properties; stand each row in with an object
+    // carrying its keyset values (virtual fields and relation paths resolved), then map back.
+    const originals = new Map();
+    const keyed = fetched.map((row) => {
+        const values = resolved.keyset.map((k) => qb.read(row, k.field));
+        const stand = {};
+        resolved.keyset.forEach((k, i) => {
+            setPath(stand, k.field, values[i]);
+        });
+        originals.set(stand, row);
+        return stand;
+    });
+    const page = buildCursorPage(keyed, resolved);
+    return { ...page, items: page.items.map((stand) => originals.get(stand)) };
+}
+function setPath(target, path, value) {
+    const segments = path.split('.');
+    let node = target;
+    for (const segment of segments.slice(0, -1)) {
+        const next = node[segment];
+        if (typeof next === 'object' && next !== null)
+            node = next;
+        else {
+            const created = {};
+            node[segment] = created;
+            node = created;
+        }
+    }
+    node[segments[segments.length - 1]] = value;
+}
+//# sourceMappingURL=in_memory.js.map

package/dist/src/in_memory.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"in_memory.js","sourceRoot":"","sources":["../../src/in_memory.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,eAAe,GAIhB,MAAM,aAAa,CAAC;AAErB,OAAO,EAAE,WAAW,EAAE,WAAW,EAAqB,MAAM,aAAa,CAAC;AAsG1E;;;;GAIG;AACH,MAAM,OAAO,kBAAmB,SAAQ,KAAK;IAC3C,YAAY,OAAe;QACzB,KAAK,CAAC,OAAO,CAAC,CAAC;QACf,IAAI,CAAC,IAAI,GAAG,oBAAoB,CAAC;IACnC,CAAC;CACF;AAED,MAAM,WAAW,GAA+C;IAC9D,UAAU,EAAE,QAAQ;IACpB,UAAU,EAAE,QAAQ;IACpB,WAAW,EAAE,SAAS;IACtB,QAAQ,EAAE,MAAM;CACjB,CAAC;AAEF,SAAS,WAAW,CAAC,IAAuB;IAC1C,MAAM,OAAO,GAAI,WAA2D,CAAC,IAAI,CAAC,CAAC;IACnF,OAAO,OAAO,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,IAAuB,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;AACpG,CAAC;AAED;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,MAAM,UAAU,gBAAgB,CAC9B,OAAmC;IAEnC,MAAM,MAAM,GAAqC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACrE,MAAM,UAAU,GAAoC,EAAE,CAAC;IACvD,MAAM,UAAU,GAA8C,EAAE,CAAC;IACjE,KAAK,MAAM,CAAC,IAAI,EAAE,WAAW,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;QACjE,MAAM,OAAO,GAAG,OAAO,WAAW,KAAK,QAAQ,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,SAAS,CAAC;QAC1E,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,WAAW,CACjC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAE,WAAiC,CAC5D,CAAC;QACF,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC;QAClD,UAAU,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;QACxB,UAAU,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,EAAE,CAAC;IAC9B,CAAC;IACD,MAAM,SAAS,GAAwC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAC3E,KAAK,MAAM,CAAC,IAAI,EAAE,QAAQ,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,SAAS,IAAI,EAAE,CAAC,EAAE,CAAC;QACvE,SAAS,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC;IAC7B,CAAC;IAED,MAAM,UAAU,GAA0B;QACxC,IAAI,EAAE,OAAO,CAAC,IAAI;QAClB,UAAU,EAAE,OAAO,CAAC,UAAU,IAAI,IAAI;QACtC,UAAU;QACV,UAAU;QACV,OAAO,EAAE,MAAM;QACf,UAAU,EAAE,SAAS;QACrB,KAAK,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,oBAAoB,CAAC,UAAU,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC;KACjE,CAAC;IACF,OAAO,UAAU,CAAC;AACpB,CAAC;AAQD,SAAS,KAAK,CAAC,KAAc;IAC3B,OAAO,KAAK,KAAK,IAAI,IAAI,KAAK,KAAK,SAAS,CAAC;AAC/C,CAAC;AAED,SAAS,WAAW,CAAC,KAAc;IACjC,OAAO,CACL,OAAO,KAAK,KAAK,QAAQ;QACzB,KAAK,KAAK,IAAI;QACd,OAAQ,KAAgC,CAAC,QAAQ,KAAK,UAAU,CACjE,CAAC;AACJ,CAAC;AAED,oFAAoF;AACpF,SAAS,SAAS,CAAC,KAAc;IAC/B,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,OAAO,KAAK,KAAK,QAAQ;QAAE,OAAO,QAAQ,CAAC;IAC5E,IAAI,OAAO,KAAK,KAAK,SAAS;QAAE,OAAO,SAAS,CAAC;IACjD,IAAI,OAAO,KAAK,KAAK,QAAQ;QAAE,OAAO,QAAQ,CAAC;IAC/C,IAAI,KAAK,YAAY,IAAI,IAAI,WAAW,CAAC,KAAK,CAAC;QAAE,OAAO,MAAM,CAAC;IAC/D,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;GAIG;AACH,SAAS,SAAS,CAAC,KAAc,EAAE,IAAqB;IACtD,IAAI,KAAK,CAAC,KAAK,CAAC;QAAE,OAAO,SAAS,CAAC;IACnC,QAAQ,IAAI,EAAE,CAAC;QACb,KAAK,QAAQ,EAAE,CAAC;YACd,IAAI,OAAO,KAAK,KAAK,QAAQ;gBAAE,OAAO,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC;YACjF,IAAI,OAAO,KAAK,KAAK,QAAQ;gBAAE,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC;YACpD,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC;gBACrD,MAAM,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;gBAC/B,OAAO,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;YAC5C,CAAC;YACD,OAAO,SAAS,CAAC;QACnB,CAAC;QACD,KAAK,SAAS,EAAE,CAAC;YACf,IAAI,OAAO,KAAK,KAAK,SAAS;gBAAE,OAAO,KAAK,CAAC;YAC7C,IAAI,KAAK,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC;gBAAE,OAAO,KAAK,KAAK,CAAC,CAAC;YACnD,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;gBAC9B,MAAM,CAAC,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;gBACrC,IAAI,CAAC,KAAK,MAAM,IAAI,CAAC,KAAK,GAAG;oBAAE,OAAO,IAAI,CAAC;gBAC3C,IAAI,CAAC,KAAK,OAAO,IAAI,CAAC,KAAK,GAAG;oBAAE,OAAO,KAAK,CAAC;YAC/C,CAAC;YACD,OAAO,SAAS,CAAC;QACnB,CAAC;QACD,KAAK,MAAM,EAAE,CAAC;YACZ,IAAI,KAAK,YAAY,IAAI,EAAE,CAAC;gBAC1B,MAAM,CAAC,GAAG,KAAK,CAAC,OAAO,EAAE,CAAC;gBAC1B,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;YACzC,CAAC;YACD,IAAI,WAAW,CAAC,KAAK,CAAC;gBAAE,OAAO,KAAK,CAAC,QAAQ,EAAE,CAAC;YAChD,IAAI,OAAO,KAAK,KAAK,QAAQ;gBAAE,OAAO,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC;YACjF,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;gBAC9B,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;gBAC5B,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;YACzC,CAAC;YACD,OAAO,SAAS,CAAC;QACnB,CAAC;QACD,KAAK,QAAQ;YACX,OAAO,OAAO,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QAC9D;YACE,4CAA4C;YAC5C,OAAO,OAAO,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;IACrE,CAAC;AACH,CAAC;AAED,+EAA+E;AAC/E,SAAS,SAAS,CAAC,KAAc;IAC/B,IAAI,OAAO,KAAK,KAAK,QAAQ;QAAE,OAAO,KAAK,CAAC;IAC5C,IAAI,KAAK,YAAY,IAAI;QAAE,OAAO,KAAK,CAAC,WAAW,EAAE,CAAC;IACtD,IAAI,WAAW,CAAC,KAAK,CAAC;QAAE,OAAO,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC;IACxE,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI;QAAE,OAAO,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;IAC9E,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC;AACvB,CAAC;AAED;;;GAGG;AACH,SAAS,OAAO,CACd,QAAiB,EACjB,SAAkB,EAClB,QAAyB;IAEzB,MAAM,IAAI,GAAG,QAAQ,KAAK,MAAM,IAAI,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC;IAC5F,MAAM,CAAC,GAAG,SAAS,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;IACpC,MAAM,CAAC,GAAG,SAAS,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;IACrC,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,SAAS;QAAE,OAAO,SAAS,CAAC;IACzD,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,OAAO,CAAC,KAAK,QAAQ;QAAE,OAAO,CAAC,GAAG,CAAC,CAAC;IACjE,IAAI,OAAO,CAAC,KAAK,SAAS,IAAI,OAAO,CAAC,KAAK,SAAS;QAAE,OAAO,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IACnF,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,OAAO,CAAC,KAAK,QAAQ,EAAE,CAAC;QACnD,2FAA2F;QAC3F,wFAAwF;QACxF,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACpC,CAAC;IACD,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;AACjC,CAAC;AAED,oFAAoF;AACpF,SAAS,YAAY,CAAC,OAAe,EAAE,eAAwB;IAC7D,IAAI,MAAM,GAAG,EAAE,CAAC;IAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACxC,MAAM,EAAE,GAAG,OAAO,CAAC,CAAC,CAAW,CAAC;QAChC,IAAI,EAAE,KAAK,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;YAC1C,MAAM,IAAI,YAAY,CAAC,OAAO,CAAC,EAAE,CAAC,CAAW,CAAC,CAAC;QACjD,CAAC;aAAM,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;YACtB,MAAM,IAAI,IAAI,CAAC;QACjB,CAAC;aAAM,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;YACtB,MAAM,IAAI,GAAG,CAAC;QAChB,CAAC;aAAM,CAAC;YACN,MAAM,IAAI,YAAY,CAAC,EAAE,CAAC,CAAC;QAC7B,CAAC;IACH,CAAC;IACD,OAAO,IAAI,MAAM,CAAC,IAAI,MAAM,GAAG,EAAE,eAAe,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;AACjE,CAAC;AAED,SAAS,YAAY,CAAC,EAAU;IAC9B,OAAO,EAAE,CAAC,OAAO,CAAC,sBAAsB,EAAE,MAAM,CAAC,CAAC;AACpD,CAAC;AAED,wFAAwF;AACxF,SAAS,WAAW,CAAC,KAAc;IACjC,IAAI,KAAK,CAAC,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAC5B,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAe,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7E,OAAO,CAAC,KAAe,CAAC,CAAC;AAC3B,CAAC;AAED,qDAAqD;AACrD,SAAS,UAAU,CAAC,UAAkB;IACpC,MAAM,KAAK,GAAG,gDAAgD,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IAChF,OAAO,KAAK;QACV,CAAC,CAAC,EAAE,IAAI,EAAG,KAAK,CAAC,CAAC,CAAY,CAAC,IAAI,EAAE,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAW,EAAE;QAClE,CAAC,CAAC,EAAE,IAAI,EAAE,UAAU,CAAC,IAAI,EAAE,EAAE,KAAK,EAAE,UAAU,CAAC,IAAI,EAAE,EAAE,CAAC;AAC5D,CAAC;AAED,qGAAqG;AACrG,MAAM,gBAAgB,GAAG,oCAAoC,CAAC;AA0B9D;;;;;GAKG;AACH,MAAM,OAAO,oBAAoB;IAYpB,UAAU;IACF,IAAI;IAZN,OAAO,GAAgB,EAAE,CAAC;IAC1B,KAAK,GAAe,EAAE,CAAC;IACvB,OAAO,GAAsC,EAAE,CAAC;IAChD,MAAM,GAAa,EAAE,CAAC;IACtB,aAAa,GAAyC,EAAE,CAAC;IAClE,cAAc,GAAa,EAAE,CAAC;IAC9B,UAAU,CAAqB;IAC/B,UAAU,CAAqB;IAC/B,WAAW,CAAqB;IAExC,YACW,UAAiC,EACzB,IAAI,GAAiB,EAAE;0BAD/B,UAAU;oBACF,IAAI;IACpB,CAAC;IAEJ,gGAAgG;IAExF,KAAK,CAAC,IAAY;QACxB,OAAO,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IACvC,CAAC;IAED,sDAAsD;IAC9C,SAAS,CAAC,IAAY;QAC5B,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC;QAClC,OAAO,IAAI,KAAK,SAAS,IAAI,IAAI,CAAC,UAAU,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IAChG,CAAC;IAED;;;;OAIG;IACH,IAAI,CAAC,GAAM,EAAE,OAAe;QAC1B,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;QACrC,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QAC9B,IAAI,GAAG,KAAK,CAAC,CAAC,EAAE,CAAC;YACf,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YAClC,IAAI,QAAQ,EAAE,GAAG;gBAAE,OAAO,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAC5C,OAAO,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,CAAC,CAAE,GAA+B,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QACvF,CAAC;QACD,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QAChC,MAAM,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;QAClD,IAAI,CAAC,QAAQ,EAAE,CAAC;YACd,MAAM,IAAI,kBAAkB,CAC1B,IAAI,OAAO,cAAc,IAAI,yDAAyD,CACvF,CAAC;QACJ,CAAC;QACD,IAAI,QAAQ,CAAC,IAAI,KAAK,aAAa,IAAI,QAAQ,CAAC,IAAI,KAAK,cAAc,EAAE,CAAC;YACxE,MAAM,IAAI,kBAAkB,CAC1B,IAAI,OAAO,yCAAyC,IAAI,0CAA0C,CACnG,CAAC;QACJ,CAAC;QACD,MAAM,OAAO,GAAG,WAAW,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAClD,IAAI,OAAO,KAAK,SAAS;YAAE,OAAO,SAAS,CAAC;QAC5C,OAAO,QAAQ;aACZ,MAAM,EAAE;aACR,KAAK,CAAC,EAAE,CAAC;aACT,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IACxC,CAAC;IAED,8EAA8E;IACtE,MAAM,CAAC,OAAe;QAC5B,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;QACrC,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QAC9B,IAAI,GAAG,KAAK,CAAC,CAAC;YAAE,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;QAC7E,MAAM,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;QAChE,IAAI,CAAC,QAAQ;YAAE,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;QACxD,OAAO,QAAQ;aACZ,MAAM,EAAE;aACR,KAAK,CAAC,EAAE,CAAC;aACT,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IACjC,CAAC;IAED;;;;OAIG;IACK,IAAI,CACV,IAAY,EACZ,KAAuE,EACvE,OAAO,GAAG,KAAK;QAEf,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC1C,OAAO,CAAC,GAAG,EAAE,EAAE;YACb,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;YACnC,IAAI,KAAK,CAAC,KAAK,CAAC;gBAAE,OAAO,KAAK,CAAC;YAC/B,IAAI,KAAK,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,KAAK,SAAS,IAAI,IAAI,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC;gBAC/E,MAAM,QAAQ,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;gBACnF,MAAM,OAAO,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;gBACpD,IAAI,OAAO;oBAAE,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC;gBACtD,OAAO,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC;YACzC,CAAC;YACD,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;YAClC,IAAI,MAAM,KAAK,SAAS;gBAAE,OAAO,KAAK,CAAC;YACvC,OAAO,OAAO,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC;QACpC,CAAC,CAAC;IACJ,CAAC;IAEO,UAAU,CAAC,IAAY,EAAE,KAAc,EAAE,OAAgB;QAC/D,OAAO,IAAI,CAAC,IAAI,CACd,IAAI,EACJ,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE;YACV,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;YAClC,OAAO,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;QAC/C,CAAC,EACD,OAAO,CACR,CAAC;IACJ,CAAC;IAEO,WAAW,CAAC,IAAY,EAAE,QAAgB,EAAE,KAAc;QAChE,QAAQ,QAAQ,EAAE,CAAC;YACjB,KAAK,GAAG;gBACN,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;YAC1E,KAAK,IAAI,CAAC;YACV,KAAK,IAAI;gBACP,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;YACzE,KAAK,GAAG,CAAC;YACT,KAAK,IAAI,CAAC;YACV,KAAK,GAAG,CAAC;YACT,KAAK,IAAI;gBACP,IAAI,KAAK,CAAC,KAAK,CAAC;oBAAE,OAAO,GAAG,EAAE,CAAC,KAAK,CAAC;gBACrC,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE;oBACjC,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;oBAClC,IAAI,CAAC,KAAK,SAAS;wBAAE,OAAO,SAAS,CAAC;oBACtC,IAAI,QAAQ,KAAK,GAAG;wBAAE,OAAO,CAAC,GAAG,CAAC,CAAC;oBACnC,IAAI,QAAQ,KAAK,IAAI;wBAAE,OAAO,CAAC,IAAI,CAAC,CAAC;oBACrC,IAAI,QAAQ,KAAK,GAAG;wBAAE,OAAO,CAAC,GAAG,CAAC,CAAC;oBACnC,OAAO,CAAC,IAAI,CAAC,CAAC;gBAChB,CAAC,CAAC,CAAC;YACL;gBACE,MAAM,IAAI,kBAAkB,CAAC,oCAAoC,QAAQ,IAAI,CAAC,CAAC;QACnF,CAAC;IACH,CAAC;IAEO,MAAM,CAAC,IAAY,EAAE,MAAiB,EAAE,OAAgB;QAC9D,8FAA8F;QAC9F,sDAAsD;QACtD,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,GAAG,EAAE,CAAC,OAAO,CAAC;QAC9C,IAAI,OAAO,IAAI,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC;YAAE,OAAO,GAAG,EAAE,CAAC,KAAK,CAAC;QACtD,MAAM,UAAU,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QACnD,OAAO,IAAI,CAAC,IAAI,CACd,IAAI,EACJ,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE;YACV,IAAI,OAAO,GAAG,KAAK,CAAC;YACpB,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;gBACnC,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,EAAE,SAAS,EAAE,IAAI,CAAC,CAAC;gBACtC,IAAI,CAAC,KAAK,CAAC;oBAAE,OAAO,IAAI,CAAC;gBACzB,IAAI,CAAC,KAAK,SAAS;oBAAE,OAAO,GAAG,IAAI,CAAC;YACtC,CAAC;YACD,OAAO,OAAO,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC;QACrC,CAAC,EACD,OAAO,CACR,CAAC;IACJ,CAAC;IAEO,WAAW,CAAC,IAAY,EAAE,KAAyB,EAAE,OAAgB;QAC3E,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;QAC1E,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC;YAAE,OAAO,GAAG,EAAE,CAAC,KAAK,CAAC;QAClD,OAAO,IAAI,CAAC,IAAI,CACd,IAAI,EACJ,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE;YACV,MAAM,EAAE,GAAG,OAAO,CAAC,CAAC,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC;YACjC,MAAM,EAAE,GAAG,OAAO,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;YAClC,IAAI,EAAE,KAAK,SAAS,IAAI,EAAE,KAAK,SAAS;gBAAE,OAAO,SAAS,CAAC;YAC3D,OAAO,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QAC5B,CAAC,EACD,OAAO,CACR,CAAC;IACJ,CAAC;IAEO,QAAQ,CAAC,IAAY,EAAE,OAAe;QAC5C,MAAM,KAAK,GAAG,YAAY,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;QAC1C,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1D,CAAC;IAEO,GAAG,CAAC,IAAkB,EAAE,EAAE,GAAG,KAAK;QACxC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC;QAChC,OAAO,IAAI,CAAC;IACd,CAAC;IAEO,KAAK,CAAC,QAAwC,EAAE,EAAW;QACjE,MAAM,KAAK,GAAG,IAAI,oBAAoB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACxD,QAAQ,CAAC,KAAK,CAAC,CAAC;QAChB,mFAAmF;QACnF,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;QAC5C,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC;IACnD,CAAC;IAED;;;OAGG;IACH,OAAO,CAAC,GAAM;QACZ,IAAI,MAAM,GAAG,KAAK,CAAC;QACnB,IAAI,OAAO,GAAG,IAAI,CAAC;QACnB,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE;YACrC,IAAI,MAAM,CAAC,EAAE,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;gBAC3B,MAAM,KAAK,OAAO,CAAC;gBACnB,OAAO,GAAG,IAAI,CAAC;YACjB,CAAC;YACD,OAAO,KAAK,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC/B,CAAC,CAAC,CAAC;QACH,OAAO,IAAI,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,IAAI,OAAO,CAAC;IAC9D,CAAC;IAOD,KAAK,CAAC,GAAG,IAAe;QACtB,IAAI,OAAO,IAAI,CAAC,CAAC,CAAC,KAAK,UAAU,EAAE,CAAC;YAClC,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAmC,EAAE,KAAK,CAAC,CAAC;QACtE,CAAC;QACD,MAAM,MAAM,GAAG,IAAI,CAAC,CAAC,CAAW,CAAC;QACjC,IAAI,IAAI,CAAC,MAAM,IAAI,CAAC;YAAE,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1F,qDAAqD;QACrD,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAAE,OAAO,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;QAClD,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;IAC3D,CAAC;IAED,OAAO,CAAC,QAAwC;QAC9C,OAAO,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;IACpC,CAAC;IAED,oGAAoG;IACpG,QAAQ,CAAC,QAAa,EAAE,QAAwC;QAC9D,MAAM,IAAI,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC;QAC9B,MAAM,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;QAClD,IAAI,CAAC,QAAQ,EAAE,CAAC;YACd,MAAM,IAAI,kBAAkB,CAAC,IAAI,IAAI,kDAAkD,CAAC,CAAC;QAC3F,CAAC;QACD,MAAM,KAAK,GAAG,IAAI,oBAAoB,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC;QAC1D,QAAQ,CAAC,KAAK,CAAC,CAAC;QAChB,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,WAAW,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzF,CAAC;IAED,QAAQ,CAAC,MAAc,EAAE,KAAc;QACrC,IAAI,KAAK,CAAC,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC;QACnD,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC;IACxD,CAAC;IAED,OAAO,CAAC,MAAc,EAAE,MAAiB;QACvC,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;IACzF,CAAC;IAED,UAAU,CAAC,MAAc,EAAE,MAAiB;QAC1C,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;IACxF,CAAC;IAED,SAAS,CAAC,MAAc;QACtB,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC;IAC1D,CAAC;IAED,YAAY,CAAC,MAAc;QACzB,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC;IAC3D,CAAC;IAED,YAAY,CAAC,MAAc,EAAE,KAAyB;QACpD,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC;IAC1D,CAAC;IAED,eAAe,CAAC,MAAc,EAAE,KAAyB;QACvD,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC;IACzD,CAAC;IAED,UAAU,CAAC,MAAc,EAAE,KAAa;QACtC,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC;IAChD,CAAC;IAED,YAAY,CAAC,MAAc,EAAE,KAAa;QACxC,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,KAAK,CAAC,EAAE,IAAI,CAAC,CAAC;IACtD,CAAC;IAED,OAAO,CAAC,MAAc,EAAE,SAAyB;QAC/C,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE,SAAS,KAAK,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC;QACrF,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;OAIG;IACH,QAAQ,CAAC,GAAW,EAAE,QAAQ,GAAuB,EAAE;QACrD,IAAI,gBAAgB,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,OAAO,QAAQ,CAAC,CAAC,CAAC,KAAK,QAAQ,EAAE,CAAC;YAClE,MAAM,KAAK,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC1B,MAAM,OAAO,GAAG,YAAY,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;YAC/D,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,CAAC;YAC5C,OAAO,IAAI,CAAC,GAAG,CACb,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,EACjE,KAAK,CACN,CAAC;QACJ,CAAC;QACD,MAAM,IAAI,kBAAkB,CAC1B,kDAAkD,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,wIAAwI,CAC9M,CAAC;IACJ,CAAC;IAED,UAAU,CAAC,GAAW,EAAE,SAAS,GAAuB,EAAE;QACxD,MAAM,IAAI,kBAAkB,CAC1B,kDAAkD,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,sEAAsE,CAC5I,CAAC;IACJ,CAAC;IAED,QAAQ,CAAC,GAAG,OAAiB;QAC3B,IAAI,CAAC,cAAc,GAAG,OAAO,CAAC;QAC9B,OAAO,IAAI,CAAC;IACd,CAAC;IAED,KAAK,CAAC,KAAa;QACjB,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;QACrC,OAAO,IAAI,CAAC;IACd,CAAC;IAED,MAAM,CAAC,CAAS;QACd,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAClC,OAAO,IAAI,CAAC;IACd,CAAC;IAED,MAAM,CAAC,GAAG,OAAiB;QACzB,KAAK,MAAM,MAAM,IAAI,OAAO;YAAE,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC;QACpE,OAAO,IAAI,CAAC;IACd,CAAC;IAED,KAAK,CAAC,MAAc;QAClB,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC;QAC3C,IAAI,IAAI,KAAK,GAAG,EAAE,CAAC;YACjB,MAAM,IAAI,kBAAkB,CAAC,gDAAgD,MAAM,IAAI,CAAC,CAAC;QAC3F,CAAC;QACD,IAAI,CAAC,UAAU,GAAG,KAAK,CAAC;QACxB,OAAO,IAAI,CAAC;IACd,CAAC;IAED,OAAO,CAAC,GAAG,OAAiB;QAC1B,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,CAAC;QAC7B,OAAO,IAAI,CAAC;IACd,CAAC;IAED,gGAAgG;IAExF,WAAW,CAAC,CAAI,EAAE,CAAI;QAC5B,KAAK,MAAM,EAAE,KAAK,EAAE,SAAS,EAAE,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC9C,MAAM,CAAC,GAAG,IAAI,CAAC,aAAa,CAC1B,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,KAAK,CAAC,EACnB,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,KAAK,CAAC,EACnB,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,IAAI,CACxB,CAAC;YACF,IAAI,CAAC,KAAK,CAAC;gBAAE,OAAO,SAAS,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACpD,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC;IAED,iGAAiG;IACzF,aAAa,CAAC,CAAU,EAAE,CAAU,EAAE,IAAqB;QACjE,IAAI,KAAK,CAAC,CAAC,CAAC;YAAE,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACtC,IAAI,KAAK,CAAC,CAAC,CAAC;YAAE,OAAO,CAAC,CAAC,CAAC;QACxB,OAAO,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;IAClC,CAAC;IAED,kFAAkF;IAC1E,QAAQ;QACd,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC;QAC7D,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC;YAAE,OAAO,IAAI,CAAC,SAAS,CAAC,OAAO,CAAmB,CAAC;QAE7E,MAAM,MAAM,GACV,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC;QAExF,IAAI,IAAI,CAAC,cAAc,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACnC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;YAC/B,MAAM,GAAG,GAA8B,EAAE,CAAC;YAC1C,KAAK,MAAM,GAAG,IAAI,MAAM,EAAE,CAAC;gBACzB,MAAM,SAAS,GAA4B,EAAE,CAAC;gBAC9C,MAAM,GAAG,GAAc,EAAE,CAAC;gBAC1B,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,cAAc,EAAE,CAAC;oBACxC,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;oBACpC,SAAS,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC;oBACzC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC;gBAC9D,CAAC;gBACD,MAAM,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;gBAC9B,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;oBACjB,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oBACZ,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;gBACtB,CAAC;YACH,CAAC;YACD,OAAO,GAAqB,CAAC;QAC/B,CAAC;QAED,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC5B,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE;gBACxB,MAAM,SAAS,GAA4B,EAAE,CAAC;gBAC9C,KAAK,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,IAAI,CAAC,OAAO;oBAAE,SAAS,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;gBACpF,OAAO,SAAc,CAAC;YACxB,CAAC,CAAC,CAAC;QACL,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;OAGG;IACK,SAAS,CAAC,IAAS;QACzB,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC;QAC5B,MAAM,MAAM,GAAG,IAAI,GAAG,EAAgD,CAAC;QACvE,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAE,OAAO,CAAC,CAAC,CAAY,CAAC,CAAC,CAAC,SAAS,CAAC;QACzE,MAAM,MAAM,GAAG,MAAM,KAAK,SAAS,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,KAAK,CAAC;QACjE,MAAM,QAAQ,GAAG,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK,MAAM,CAAC,CAAC;QAEtE,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,MAAM,MAAM,GAAgB,EAAE,CAAC;YAC/B,IAAI,MAAM,EAAE,CAAC;gBACX,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,MAAgB,CAAC,CAAC;gBAC/C,MAAM,QAAQ,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;gBAChF,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;oBAC/B,IACE,QAAQ,CAAC,KAAK,CACZ,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,WAAW,EAAE,CAAC,CAC3E,EACD,CAAC;wBACD,MAAM,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;oBACzB,CAAC;gBACH,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YACrD,CAAC;YACD,KAAK,MAAM,MAAM,IAAI,MAAM,EAAE,CAAC;gBAC5B,MAAM,GAAG,GAAG,IAAI,CAAC,SAAS,CACxB,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAW,CAAC,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,CACnF,CAAC;gBACF,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBAC9B,IAAI,KAAK;oBAAE,KAAK,CAAC,KAAK,EAAE,CAAC;;oBACpB,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;YAC7C,CAAC;QACH,CAAC;QAED,MAAM,OAAO,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,EAAE;YAC7D,MAAM,GAAG,GAA4B,EAAE,CAAC;YACxC,MAAM,OAAO,GACX,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACvF,KAAK,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,OAAO,EAAE,CAAC;gBACtC,MAAM,KAAK,GAAG,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;gBACpC,IAAI,KAAK,KAAK,CAAC,CAAC,EAAE,CAAC;oBACjB,MAAM,IAAI,kBAAkB,CAAC,IAAI,IAAI,mCAAmC,CAAC,CAAC;gBAC5E,CAAC;gBACD,GAAG,CAAC,KAAK,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;YAC7B,CAAC;YACD,IAAI,IAAI,CAAC,UAAU,KAAK,SAAS;gBAAE,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,KAAK,CAAC;YAChE,OAAO,EAAE,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC;QAChC,CAAC,CAAC,CAAC;QAEH,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YACpB,KAAK,MAAM,EAAE,KAAK,EAAE,SAAS,EAAE,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;gBAC9C,IAAI,CAAS,CAAC;gBACd,IAAI,KAAK,KAAK,IAAI,CAAC,UAAU,EAAE,CAAC;oBAC9B,CAAC,GAAG,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;gBACxB,CAAC;qBAAM,CAAC;oBACN,MAAM,KAAK,GAAG,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;oBACrC,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK,KAAK,CAAC,CAAC;oBACpE,MAAM,CAAC,GACL,KAAK,KAAK,CAAC,CAAC;wBACV,CAAC,CAAC,KAAK;wBACP,CAAC,CAAC,UAAU,KAAK,CAAC,CAAC;4BACjB,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,UAAU,CAAE,CAAC,IAAI,CAAC;4BACjD,CAAC,CAAC,CAAC,CAAC,CAAC;oBACX,IAAI,CAAC,KAAK,CAAC,CAAC;wBAAE,MAAM,IAAI,kBAAkB,CAAC,iCAAiC,KAAK,IAAI,CAAC,CAAC;oBACvF,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAW,CAAC,CAAC,IAAI,CAAC,CAAC;gBAC3F,CAAC;gBACD,IAAI,CAAC,KAAK,CAAC;oBAAE,OAAO,SAAS,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACpD,CAAC;YACD,OAAO,CAAC,CAAC;QACX,CAAC,CAAC,CAAC;QACH,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACnC,CAAC;IAEO,MAAM,CAAI,IAAS;QACzB,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,IAAI,CAAC,CAAC;QACpC,MAAM,GAAG,GAAG,IAAI,CAAC,UAAU,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC;QAChF,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;IAChC,CAAC;IAED;;;;OAIG;IACH,GAAG;QACD,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC;IACtC,CAAC;IAED,oFAAoF;IACpF,KAAK;QACH,OAAO,IAAI,CAAC,QAAQ,EAAE,CAAC,MAAM,CAAC;IAChC,CAAC;IAED;;;OAGG;IACH,QAAQ,CAAC,IAAY,EAAE,OAAe;QACpC,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;QAC9C,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC;QAC9C,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;QAC7B,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QAC1B,OAAO;YACL,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,OAAO,GAAG,CAAC,CAAC,GAAG,IAAI,EAAE,OAAO,GAAG,IAAI,CAAC;YACtD,IAAI,EAAE;gBACJ,KAAK;gBACL,OAAO,EAAE,IAAI;gBACb,WAAW,EAAE,OAAO;gBACpB,QAAQ,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,CAAC;gBAC9C,SAAS,EAAE,CAAC;aACb;SACF,CAAC;IACJ,CAAC;IAED;;;OAGG;IACH,wGAAwG;IACxG,IAAI,CACF,WAA0D,EAC1D,UAA+D;QAE/D,OAAO,IAAI,OAAO,CAAM,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,EAAE,UAAU,CAAC,CAAC;IAC1F,CAAC;CACF;AAED,gGAAgG;AAChG,mBAAmB;AACnB,gGAAgG;AAEhG;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,cAAc,CAC5B,UAAiC,EACjC,IAAiB,EACjB,KAAkB,EAClB,MAAoB;IAEpB,MAAM,EAAE,GAAG,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAClC,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,WAAW,CAAC,EAAE,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;IACtD,OAAO,EAAE,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;AACjC,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,cAAc,CAC5B,UAAiC,EACjC,IAAiB,EACjB,KAAiC,EACjC,MAA8C;IAE9C,MAAM,EAAE,GAAG,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAClC,MAAM,YAAY,GAAiB;QACjC,GAAG,MAAM;QACT,UAAU,EAAE,MAAM,CAAC,UAAU,IAAI,UAAU,CAAC,UAAU;KACvD,CAAC;IACF,MAAM,QAAQ,GAAmB,WAAW,CAAC,EAAE,EAAE,KAAK,EAAE,YAAY,CAAC,CAAC;IACtE,MAAM,OAAO,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC;IAEzB,4FAA4F;IAC5F,0FAA0F;IAC1F,MAAM,SAAS,GAAG,IAAI,GAAG,EAAa,CAAC;IACvC,MAAM,KAAK,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE;QAChC,MAAM,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QACjE,MAAM,KAAK,GAA4B,EAAE,CAAC;QAC1C,QAAQ,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YAC/B,OAAO,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QACrC,CAAC,CAAC,CAAC;QACH,SAAS,CAAC,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QAC1B,OAAO,KAAK,CAAC;IACf,CAAC,CAAC,CAAC;IACH,MAAM,IAAI,GAAG,eAAe,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;IAC9C,OAAO,EAAE,GAAG,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAM,CAAC,EAAE,CAAC;AAClF,CAAC;AAED,SAAS,OAAO,CAAC,MAA+B,EAAE,IAAY,EAAE,KAAc;IAC5E,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IACjC,IAAI,IAAI,GAAG,MAAM,CAAC;IAClB,KAAK,MAAM,OAAO,IAAI,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC5C,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC;QAC3B,IAAI,OAAO,IAAI,KAAK,QAAQ,IAAI,IAAI,KAAK,IAAI;YAAE,IAAI,GAAG,IAA+B,CAAC;aACjF,CAAC;YACJ,MAAM,OAAO,GAA4B,EAAE,CAAC;YAC5C,IAAI,CAAC,OAAO,CAAC,GAAG,OAAO,CAAC;YACxB,IAAI,GAAG,OAAO,CAAC;QACjB,CAAC;IACH,CAAC;IACD,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAW,CAAC,GAAG,KAAK,CAAC;AACxD,CAAC"}

package/dist/src/index.d.ts

@@ -1,5 +1,5 @@
 /** Keep in sync with this package's `version` in package.json. */
-export declare const VERSION = "0.9.0";
+export declare const VERSION = "0.10.0";
 export type { LucidModelLike, LucidRelationLike } from './aggregate.js';
 export { discoverAggregateSources } from './aggregate.js';
 export type { AggregateFn, AggregatePath } from './aggregate_path.js';

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

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":"AAAA,kEAAkE;AAClE,eAAO,MAAM,OAAO,UAAU,CAAC;AAE/B,YAAY,EAAE,cAAc,EAAE,iBAAiB,EAAE,MAAM,gBAAgB,CAAC;AACxE,OAAO,EAAE,wBAAwB,EAAE,MAAM,gBAAgB,CAAC;AAC1D,YAAY,EAAE,WAAW,EAAE,aAAa,EAAE,MAAM,qBAAqB,CAAC;AACtE,OAAO,EAAE,kBAAkB,EAAE,MAAM,qBAAqB,CAAC;AACzD,YAAY,EACV,6BAA6B,EAC7B,uBAAuB,EACvB,oBAAoB,GACrB,MAAM,yBAAyB,CAAC;AACjC,OAAO,EAAE,sBAAsB,EAAE,sBAAsB,EAAE,MAAM,yBAAyB,CAAC;AACzF,OAAO,EAAE,UAAU,EAAE,MAAM,kBAAkB,CAAC;AAC9C,OAAO,EAAE,eAAe,EAAE,MAAM,wBAAwB,CAAC;AACzD,YAAY,EAAE,UAAU,EAAE,YAAY,EAAE,YAAY,EAAE,cAAc,EAAE,MAAM,aAAa,CAAC;AAC1F,OAAO,EACL,eAAe,EACf,WAAW,EACX,YAAY,EACZ,YAAY,EACZ,mBAAmB,EACnB,aAAa,GACd,MAAM,aAAa,CAAC;AACrB,YAAY,EAAE,wBAAwB,EAAE,iBAAiB,EAAE,MAAM,oBAAoB,CAAC;AACtF,OAAO,EAAE,iBAAiB,EAAE,MAAM,oBAAoB,CAAC;AACvD,YAAY,EAAE,aAAa,EAAE,wBAAwB,EAAE,MAAM,iBAAiB,CAAC;AAC/E,OAAO,EAAE,UAAU,EAAE,SAAS,EAAE,UAAU,EAAE,QAAQ,EAAE,MAAM,iBAAiB,CAAC;AAC9E,OAAO,EAAE,UAAU,EAAE,MAAM,kBAAkB,CAAC;AAC9C,YAAY,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AACvD,OAAO,EACL,oBAAoB,EACpB,kBAAkB,EAClB,gBAAgB,EAChB,iBAAiB,GAClB,MAAM,oBAAoB,CAAC;AAC5B,YAAY,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AACrD,OAAO,EACL,YAAY,EACZ,aAAa,EACb,YAAY,EACZ,mBAAmB,GACpB,MAAM,mBAAmB,CAAC;AAC3B,YAAY,EACV,mBAAmB,EACnB,UAAU,EACV,eAAe,EACf,YAAY,EACZ,cAAc,EACd,eAAe,GAChB,MAAM,kBAAkB,CAAC;AAC1B,OAAO,EACL,YAAY,EACZ,qBAAqB,EACrB,kBAAkB,GACnB,MAAM,kBAAkB,CAAC;AAC1B,YAAY,EAAE,sBAAsB,EAAE,MAAM,uBAAuB,CAAC;AACpE,OAAO,EAAE,UAAU,EAAE,MAAM,uBAAuB,CAAC;AACnD,YAAY,EACV,iBAAiB,EACjB,oBAAoB,EACpB,eAAe,EACf,mBAAmB,EACnB,qBAAqB,EACrB,2BAA2B,GAC5B,MAAM,sBAAsB,CAAC;AAC9B,OAAO,EACL,oBAAoB,EACpB,oBAAoB,EACpB,qBAAqB,EACrB,kBAAkB,GACnB,MAAM,sBAAsB,CAAC;AAC9B,YAAY,EACV,mBAAmB,EACnB,8BAA8B,EAC9B,eAAe,GAChB,MAAM,qBAAqB,CAAC;AAC7B,OAAO,EAAE,uBAAuB,EAAE,MAAM,qBAAqB,CAAC;AAC9D,OAAO,EACL,kBAAkB,EAClB,kBAAkB,EAClB,iBAAiB,EACjB,aAAa,EACb,mBAAmB,EACnB,iBAAiB,EACjB,WAAW,EACX,WAAW,EACX,SAAS,EACT,qBAAqB,EACrB,KAAK,qBAAqB,EAC1B,KAAK,gBAAgB,EACrB,yBAAyB,EACzB,KAAK,oBAAoB,EACzB,KAAK,uBAAuB,GAC7B,MAAM,oBAAoB,CAAC;AAC5B,YAAY,EAAE,qBAAqB,EAAE,MAAM,mBAAmB,CAAC;AAC/D,OAAO,EAAE,oBAAoB,EAAE,MAAM,mBAAmB,CAAC;AACzD,YAAY,EAAE,gBAAgB,EAAE,MAAM,iBAAiB,CAAC;AACxD,OAAO,EAAE,cAAc,EAAE,MAAM,iBAAiB,CAAC;AACjD,YAAY,EACV,YAAY,EACZ,cAAc,EACd,mBAAmB,EACnB,mBAAmB,GACpB,MAAM,gBAAgB,CAAC;AACxB,OAAO,EAAE,gBAAgB,EAAE,gBAAgB,EAAE,MAAM,gBAAgB,CAAC;AACpE,OAAO,EACL,aAAa,EACb,kBAAkB,EAClB,iBAAiB,EACjB,SAAS,EACT,eAAe,GAChB,MAAM,oBAAoB,CAAC;AAC5B,YAAY,EAAE,YAAY,EAAE,kBAAkB,EAAE,MAAM,aAAa,CAAC;AACpE,OAAO,EAAE,WAAW,EAAE,WAAW,EAAE,qBAAqB,EAAE,mBAAmB,EAAE,MAAM,aAAa,CAAC;AACnG,OAAO,EAAE,uBAAuB,EAAE,MAAM,sBAAsB,CAAC;AAC/D,YAAY,EAAE,WAAW,EAAE,MAAM,oBAAoB,CAAC;AACtD,OAAO,EAAE,kBAAkB,EAAE,MAAM,oBAAoB,CAAC;AACxD,YAAY,EACV,SAAS,EACT,eAAe,EACf,cAAc,EACd,cAAc,EACd,YAAY,EACZ,WAAW,EACX,oBAAoB,EACpB,mBAAmB,EACnB,mBAAmB,EACnB,eAAe,EACf,WAAW,EACX,QAAQ,EACR,sBAAsB,GACvB,MAAM,YAAY,CAAC;AACpB,OAAO,EACL,wBAAwB,EACxB,gBAAgB,EAChB,iBAAiB,EACjB,oBAAoB,EACpB,qBAAqB,GACtB,MAAM,6BAA6B,CAAC;AACrC,OAAO,EAAE,gBAAgB,EAAE,oBAAoB,EAAE,MAAM,kBAAkB,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":"AAAA,kEAAkE;AAClE,eAAO,MAAM,OAAO,WAAW,CAAC;AAEhC,YAAY,EAAE,cAAc,EAAE,iBAAiB,EAAE,MAAM,gBAAgB,CAAC;AACxE,OAAO,EAAE,wBAAwB,EAAE,MAAM,gBAAgB,CAAC;AAC1D,YAAY,EAAE,WAAW,EAAE,aAAa,EAAE,MAAM,qBAAqB,CAAC;AACtE,OAAO,EAAE,kBAAkB,EAAE,MAAM,qBAAqB,CAAC;AACzD,YAAY,EACV,6BAA6B,EAC7B,uBAAuB,EACvB,oBAAoB,GACrB,MAAM,yBAAyB,CAAC;AACjC,OAAO,EAAE,sBAAsB,EAAE,sBAAsB,EAAE,MAAM,yBAAyB,CAAC;AACzF,OAAO,EAAE,UAAU,EAAE,MAAM,kBAAkB,CAAC;AAC9C,OAAO,EAAE,eAAe,EAAE,MAAM,wBAAwB,CAAC;AACzD,YAAY,EAAE,UAAU,EAAE,YAAY,EAAE,YAAY,EAAE,cAAc,EAAE,MAAM,aAAa,CAAC;AAC1F,OAAO,EACL,eAAe,EACf,WAAW,EACX,YAAY,EACZ,YAAY,EACZ,mBAAmB,EACnB,aAAa,GACd,MAAM,aAAa,CAAC;AACrB,YAAY,EAAE,wBAAwB,EAAE,iBAAiB,EAAE,MAAM,oBAAoB,CAAC;AACtF,OAAO,EAAE,iBAAiB,EAAE,MAAM,oBAAoB,CAAC;AACvD,YAAY,EAAE,aAAa,EAAE,wBAAwB,EAAE,MAAM,iBAAiB,CAAC;AAC/E,OAAO,EAAE,UAAU,EAAE,SAAS,EAAE,UAAU,EAAE,QAAQ,EAAE,MAAM,iBAAiB,CAAC;AAC9E,OAAO,EAAE,UAAU,EAAE,MAAM,kBAAkB,CAAC;AAC9C,YAAY,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AACvD,OAAO,EACL,oBAAoB,EACpB,kBAAkB,EAClB,gBAAgB,EAChB,iBAAiB,GAClB,MAAM,oBAAoB,CAAC;AAC5B,YAAY,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AACrD,OAAO,EACL,YAAY,EACZ,aAAa,EACb,YAAY,EACZ,mBAAmB,GACpB,MAAM,mBAAmB,CAAC;AAC3B,YAAY,EACV,mBAAmB,EACnB,UAAU,EACV,eAAe,EACf,YAAY,EACZ,cAAc,EACd,eAAe,GAChB,MAAM,kBAAkB,CAAC;AAC1B,OAAO,EACL,YAAY,EACZ,qBAAqB,EACrB,kBAAkB,GACnB,MAAM,kBAAkB,CAAC;AAC1B,YAAY,EAAE,sBAAsB,EAAE,MAAM,uBAAuB,CAAC;AACpE,OAAO,EAAE,UAAU,EAAE,MAAM,uBAAuB,CAAC;AACnD,YAAY,EACV,iBAAiB,EACjB,oBAAoB,EACpB,eAAe,EACf,mBAAmB,EACnB,qBAAqB,EACrB,2BAA2B,GAC5B,MAAM,sBAAsB,CAAC;AAC9B,OAAO,EACL,oBAAoB,EACpB,oBAAoB,EACpB,qBAAqB,EACrB,kBAAkB,GACnB,MAAM,sBAAsB,CAAC;AAC9B,YAAY,EACV,mBAAmB,EACnB,8BAA8B,EAC9B,eAAe,GAChB,MAAM,qBAAqB,CAAC;AAC7B,OAAO,EAAE,uBAAuB,EAAE,MAAM,qBAAqB,CAAC;AAC9D,OAAO,EACL,kBAAkB,EAClB,kBAAkB,EAClB,iBAAiB,EACjB,aAAa,EACb,mBAAmB,EACnB,iBAAiB,EACjB,WAAW,EACX,WAAW,EACX,SAAS,EACT,qBAAqB,EACrB,KAAK,qBAAqB,EAC1B,KAAK,gBAAgB,EACrB,yBAAyB,EACzB,KAAK,oBAAoB,EACzB,KAAK,uBAAuB,GAC7B,MAAM,oBAAoB,CAAC;AAC5B,YAAY,EAAE,qBAAqB,EAAE,MAAM,mBAAmB,CAAC;AAC/D,OAAO,EAAE,oBAAoB,EAAE,MAAM,mBAAmB,CAAC;AACzD,YAAY,EAAE,gBAAgB,EAAE,MAAM,iBAAiB,CAAC;AACxD,OAAO,EAAE,cAAc,EAAE,MAAM,iBAAiB,CAAC;AACjD,YAAY,EACV,YAAY,EACZ,cAAc,EACd,mBAAmB,EACnB,mBAAmB,GACpB,MAAM,gBAAgB,CAAC;AACxB,OAAO,EAAE,gBAAgB,EAAE,gBAAgB,EAAE,MAAM,gBAAgB,CAAC;AACpE,OAAO,EACL,aAAa,EACb,kBAAkB,EAClB,iBAAiB,EACjB,SAAS,EACT,eAAe,GAChB,MAAM,oBAAoB,CAAC;AAC5B,YAAY,EAAE,YAAY,EAAE,kBAAkB,EAAE,MAAM,aAAa,CAAC;AACpE,OAAO,EAAE,WAAW,EAAE,WAAW,EAAE,qBAAqB,EAAE,mBAAmB,EAAE,MAAM,aAAa,CAAC;AACnG,OAAO,EAAE,uBAAuB,EAAE,MAAM,sBAAsB,CAAC;AAC/D,YAAY,EAAE,WAAW,EAAE,MAAM,oBAAoB,CAAC;AACtD,OAAO,EAAE,kBAAkB,EAAE,MAAM,oBAAoB,CAAC;AACxD,YAAY,EACV,SAAS,EACT,eAAe,EACf,cAAc,EACd,cAAc,EACd,YAAY,EACZ,WAAW,EACX,oBAAoB,EACpB,mBAAmB,EACnB,mBAAmB,EACnB,eAAe,EACf,WAAW,EACX,QAAQ,EACR,sBAAsB,GACvB,MAAM,YAAY,CAAC;AACpB,OAAO,EACL,wBAAwB,EACxB,gBAAgB,EAChB,iBAAiB,EACjB,oBAAoB,EACpB,qBAAqB,GACtB,MAAM,6BAA6B,CAAC;AACrC,OAAO,EAAE,gBAAgB,EAAE,oBAAoB,EAAE,MAAM,kBAAkB,CAAC"}

package/dist/src/index.js

@@ -1,5 +1,5 @@
 /** Keep in sync with this package's `version` in package.json. */
-export const VERSION = '0.9.0';
+export const VERSION = '0.10.0';
 export { discoverAggregateSources } from './aggregate.js';
 export { parseAggregatePath } from './aggregate_path.js';
 export { applyCursorFromRequest, applyFilterFromRequest } from './apply_from_request.js';

package/dist/src/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":"AAAA,kEAAkE;AAClE,MAAM,CAAC,MAAM,OAAO,GAAG,OAAO,CAAC;AAG/B,OAAO,EAAE,wBAAwB,EAAE,MAAM,gBAAgB,CAAC;AAE1D,OAAO,EAAE,kBAAkB,EAAE,MAAM,qBAAqB,CAAC;AAMzD,OAAO,EAAE,sBAAsB,EAAE,sBAAsB,EAAE,MAAM,yBAAyB,CAAC;AACzF,OAAO,EAAE,UAAU,EAAE,MAAM,kBAAkB,CAAC;AAC9C,OAAO,EAAE,eAAe,EAAE,MAAM,wBAAwB,CAAC;AAEzD,OAAO,EACL,eAAe,EACf,WAAW,EACX,YAAY,EACZ,YAAY,EACZ,mBAAmB,EACnB,aAAa,GACd,MAAM,aAAa,CAAC;AAErB,OAAO,EAAE,iBAAiB,EAAE,MAAM,oBAAoB,CAAC;AAEvD,OAAO,EAAE,UAAU,EAAE,SAAS,EAAE,UAAU,EAAE,QAAQ,EAAE,MAAM,iBAAiB,CAAC;AAC9E,OAAO,EAAE,UAAU,EAAE,MAAM,kBAAkB,CAAC;AAE9C,OAAO,EACL,oBAAoB,EACpB,kBAAkB,EAClB,gBAAgB,EAChB,iBAAiB,GAClB,MAAM,oBAAoB,CAAC;AAE5B,OAAO,EACL,YAAY,EACZ,aAAa,EACb,YAAY,EACZ,mBAAmB,GACpB,MAAM,mBAAmB,CAAC;AAS3B,OAAO,EACL,YAAY,EACZ,qBAAqB,EACrB,kBAAkB,GACnB,MAAM,kBAAkB,CAAC;AAE1B,OAAO,EAAE,UAAU,EAAE,MAAM,uBAAuB,CAAC;AASnD,OAAO,EACL,oBAAoB,EACpB,oBAAoB,EACpB,qBAAqB,EACrB,kBAAkB,GACnB,MAAM,sBAAsB,CAAC;AAM9B,OAAO,EAAE,uBAAuB,EAAE,MAAM,qBAAqB,CAAC;AAC9D,OAAO,EACL,kBAAkB,EAClB,kBAAkB,EAClB,iBAAiB,EACjB,aAAa,EACb,mBAAmB,EACnB,iBAAiB,EACjB,WAAW,EACX,WAAW,EACX,SAAS,EACT,qBAAqB,EAGrB,yBAAyB,GAG1B,MAAM,oBAAoB,CAAC;AAE5B,OAAO,EAAE,oBAAoB,EAAE,MAAM,mBAAmB,CAAC;AAEzD,OAAO,EAAE,cAAc,EAAE,MAAM,iBAAiB,CAAC;AAOjD,OAAO,EAAE,gBAAgB,EAAE,gBAAgB,EAAE,MAAM,gBAAgB,CAAC;AACpE,OAAO,EACL,aAAa,EACb,kBAAkB,EAClB,iBAAiB,EACjB,SAAS,EACT,eAAe,GAChB,MAAM,oBAAoB,CAAC;AAE5B,OAAO,EAAE,WAAW,EAAE,WAAW,EAAE,qBAAqB,EAAE,mBAAmB,EAAE,MAAM,aAAa,CAAC;AACnG,OAAO,EAAE,uBAAuB,EAAE,MAAM,sBAAsB,CAAC;AAE/D,OAAO,EAAE,kBAAkB,EAAE,MAAM,oBAAoB,CAAC;AAgBxD,OAAO,EACL,wBAAwB,EACxB,gBAAgB,EAChB,iBAAiB,EACjB,oBAAoB,EACpB,qBAAqB,GACtB,MAAM,6BAA6B,CAAC;AACrC,OAAO,EAAE,gBAAgB,EAAE,oBAAoB,EAAE,MAAM,kBAAkB,CAAC"}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":"AAAA,kEAAkE;AAClE,MAAM,CAAC,MAAM,OAAO,GAAG,QAAQ,CAAC;AAGhC,OAAO,EAAE,wBAAwB,EAAE,MAAM,gBAAgB,CAAC;AAE1D,OAAO,EAAE,kBAAkB,EAAE,MAAM,qBAAqB,CAAC;AAMzD,OAAO,EAAE,sBAAsB,EAAE,sBAAsB,EAAE,MAAM,yBAAyB,CAAC;AACzF,OAAO,EAAE,UAAU,EAAE,MAAM,kBAAkB,CAAC;AAC9C,OAAO,EAAE,eAAe,EAAE,MAAM,wBAAwB,CAAC;AAEzD,OAAO,EACL,eAAe,EACf,WAAW,EACX,YAAY,EACZ,YAAY,EACZ,mBAAmB,EACnB,aAAa,GACd,MAAM,aAAa,CAAC;AAErB,OAAO,EAAE,iBAAiB,EAAE,MAAM,oBAAoB,CAAC;AAEvD,OAAO,EAAE,UAAU,EAAE,SAAS,EAAE,UAAU,EAAE,QAAQ,EAAE,MAAM,iBAAiB,CAAC;AAC9E,OAAO,EAAE,UAAU,EAAE,MAAM,kBAAkB,CAAC;AAE9C,OAAO,EACL,oBAAoB,EACpB,kBAAkB,EAClB,gBAAgB,EAChB,iBAAiB,GAClB,MAAM,oBAAoB,CAAC;AAE5B,OAAO,EACL,YAAY,EACZ,aAAa,EACb,YAAY,EACZ,mBAAmB,GACpB,MAAM,mBAAmB,CAAC;AAS3B,OAAO,EACL,YAAY,EACZ,qBAAqB,EACrB,kBAAkB,GACnB,MAAM,kBAAkB,CAAC;AAE1B,OAAO,EAAE,UAAU,EAAE,MAAM,uBAAuB,CAAC;AASnD,OAAO,EACL,oBAAoB,EACpB,oBAAoB,EACpB,qBAAqB,EACrB,kBAAkB,GACnB,MAAM,sBAAsB,CAAC;AAM9B,OAAO,EAAE,uBAAuB,EAAE,MAAM,qBAAqB,CAAC;AAC9D,OAAO,EACL,kBAAkB,EAClB,kBAAkB,EAClB,iBAAiB,EACjB,aAAa,EACb,mBAAmB,EACnB,iBAAiB,EACjB,WAAW,EACX,WAAW,EACX,SAAS,EACT,qBAAqB,EAGrB,yBAAyB,GAG1B,MAAM,oBAAoB,CAAC;AAE5B,OAAO,EAAE,oBAAoB,EAAE,MAAM,mBAAmB,CAAC;AAEzD,OAAO,EAAE,cAAc,EAAE,MAAM,iBAAiB,CAAC;AAOjD,OAAO,EAAE,gBAAgB,EAAE,gBAAgB,EAAE,MAAM,gBAAgB,CAAC;AACpE,OAAO,EACL,aAAa,EACb,kBAAkB,EAClB,iBAAiB,EACjB,SAAS,EACT,eAAe,GAChB,MAAM,oBAAoB,CAAC;AAE5B,OAAO,EAAE,WAAW,EAAE,WAAW,EAAE,qBAAqB,EAAE,mBAAmB,EAAE,MAAM,aAAa,CAAC;AACnG,OAAO,EAAE,uBAAuB,EAAE,MAAM,sBAAsB,CAAC;AAE/D,OAAO,EAAE,kBAAkB,EAAE,MAAM,oBAAoB,CAAC;AAgBxD,OAAO,EACL,wBAAwB,EACxB,gBAAgB,EAChB,iBAAiB,EACjB,oBAAoB,EACpB,qBAAqB,GACtB,MAAM,6BAA6B,CAAC;AACrC,OAAO,EAAE,gBAAgB,EAAE,oBAAoB,EAAE,MAAM,kBAAkB,CAAC"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@adonis-agora/filter",
-  "version": "0.9.0",
+  "version": "0.10.0",
   "description": "Server-side query filtering/sorting/pagination for AdonisJS — Spatie-style input, a Lucid adapter, and field allow-listing. Part of the Agora ecosystem.",
   "license": "MIT",
   "repository": {
@@ -8,6 +8,21 @@
     "url": "git+https://github.com/DavideCarvalho/adonis-agora-filter.git",
     "directory": "packages/core"
   },
+  "homepage": "https://davidecarvalho.github.io/agora/docs/filter",
+  "bugs": {
+    "url": "https://github.com/DavideCarvalho/adonis-agora-filter/issues"
+  },
+  "keywords": [
+    "adonisjs",
+    "adonis",
+    "filter",
+    "lucid",
+    "query",
+    "spatie",
+    "pagination",
+    "agora",
+    "tanstack-intent"
+  ],
   "author": "Davi Carvalho <davi@goflip.ai>",
   "type": "module",
   "main": "./dist/src/index.js",
@@ -23,6 +38,11 @@
       "import": "./dist/src/testing.js",
       "default": "./dist/src/testing.js"
     },
+    "./in-memory": {
+      "types": "./dist/src/in_memory.d.ts",
+      "import": "./dist/src/in_memory.js",
+      "default": "./dist/src/in_memory.js"
+    },
     "./configure": {
       "types": "./dist/configure.d.ts",
       "import": "./dist/configure.js",
@@ -57,32 +77,21 @@
     }
   },
   "devDependencies": {
-    "@adonisjs/assembler": "8.5.0",
-    "@adonisjs/core": "7.5.0",
+    "@adonisjs/assembler": "8.5.2",
+    "@adonisjs/core": "7.5.2",
     "@adonisjs/lucid": "22.4.2",
-    "@tanstack/intent": "^0.3.7",
+    "@tanstack/intent": "0.4.0",
     "@types/luxon": "3.7.5",
-    "@types/node": "26.4.0",
+    "@types/node": "26.6.2",
     "@types/pg": "8.23.1",
     "luxon": "3.7.2",
     "pg": "8.23.0",
     "typescript": "7.0.2",
-    "vitest": "4.1.11"
+    "vitest": "5.0.2"
   },
   "engines": {
     "node": ">=20.6.0"
   },
-  "keywords": [
-    "adonisjs",
-    "adonis",
-    "filter",
-    "lucid",
-    "query",
-    "spatie",
-    "pagination",
-    "agora",
-    "tanstack-intent"
-  ],
   "scripts": {
     "build": "tsc -p tsconfig.json && pnpm run copy:stubs",
     "test": "vitest run --passWithNoTests",

package/skills/filter-basics/SKILL.md

@@ -8,8 +8,11 @@ description: >
   defaultFilters, defaultSort, defaultSize/maxSize), the optional provider
   macros .applyFilterFromRequest() / .filterPaginate(), wire format parsing
   (filter[field][op]=value, sort=-createdAt, page/size), and input sourcing from
-  query string, POST body, or a nested key. Use when building a filtered list
-  endpoint, wiring a reusable filter policy, or deciding free functions vs macros.
+  query string, POST body, or a nested key, and the in-memory adapter
+  (@adonis-agora/filter/in-memory: defineCollection, filterInMemory,
+  cursorInMemory) for lists that are not a table. Use when building a filtered
+  list endpoint, wiring a reusable filter policy, deciding free functions vs
+  macros, or filtering a plain array with the same wire format.
 metadata:
   type: core
   library: "@adonis-agora/filter"
@@ -21,6 +24,7 @@ sources:
   - "DavideCarvalho/adonis-filter:docs/guides/filter-classes.mdx"
   - "DavideCarvalho/adonis-filter:docs/guides/provider.mdx"
   - "DavideCarvalho/adonis-filter:docs/guides/operators.mdx"
+  - "DavideCarvalho/adonis-filter:docs/guides/in-memory.mdx"
 ---
 
 # Filter basics: parse a request, apply it to a Lucid query
@@ -168,6 +172,34 @@ filtered query.
 
 Source: `docs/getting-started.mdx`, `docs/guides/filter-classes.mdx`
 
+### 5. Lists that are not a table — the in-memory adapter
+
+Rows merged from several sources, static catalogs and remote API pages take the
+same input through `@adonis-agora/filter/in-memory`. `collection.query(rows)` is a
+`QueryBuilderLike`, so every runner entry point (and `defineFilter` specs) drives
+it unchanged; the builder evaluates the calls with Postgres semantics (ILIKE,
+three-valued NULLs, NULLS LAST asc / FIRST desc, EXISTS for to-many paths).
+
+```typescript
+import { defineCollection, filterInMemory } from '@adonis-agora/filter/in-memory'
+
+const users = defineCollection<UserRow>({
+  fields: { name: 'string', age: 'number', tags: 'string[]', fullName: { type: 'string', get: (u) => `${u.first} ${u.last}` } },
+  relations: { posts: { kind: 'one-to-many', target: () => posts, get: (u) => u.posts } },
+})
+
+const page = filterInMemory(users, rows, parseFilterRequest(ctx.request.qs()), {
+  allowed: ['name', 'age', 'fullName', 'posts.title'],
+  fieldTypes: users.fieldTypes,
+})
+// or: const q = users.query(rows); const { page, size } = applyFilterFromRequest(q, spec, ctx); q.paginate(page, size)
+```
+
+Policy `computed`, `fullText` and `vectorSimilarity` are SQL-only and throw
+`InMemoryQueryError` there — declare a virtual field on the collection instead.
+
+Source: `docs/guides/in-memory.mdx`
+
 ## Common mistakes
 
 ### [CRITICAL] Feeding raw request page/size to paginate()