@adonis-agora/filter 0.0.0-beta-20261110131309

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

@@ -0,0 +1 @@
+{"version":3,"file":"generate_client.d.ts","sourceRoot":"","sources":["../../src/generate_client.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,UAAU,EAAgB,MAAM,kBAAkB,CAAC;AAEjE;;;;;;;;;;;;;;;;;;GAkBG;AAIH,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,YAAY,CAAC;AAElD,YAAY,EAAE,eAAe,EAAE,CAAC;AAEhC;;;;;GAKG;AACH,MAAM,WAAW,mBAAmB;IAClC,wFAAwF;IACxF,IAAI,CAAC,EAAE,eAAe,CAAC;IACvB,kGAAkG;IAClG,UAAU,CAAC,EAAE,SAAS,CAAC,MAAM,GAAG,MAAM,CAAC,EAAE,CAAC;IAC1C,gFAAgF;IAChF,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,8DAA8D;IAC9D,QAAQ,CAAC,EAAE,OAAO,CAAC;CACpB;AAED,gDAAgD;AAChD,MAAM,WAAW,2BAA2B;IAC1C;;;;OAIG;IACH,IAAI,EAAE,MAAM,CAAC;IACb,sFAAsF;IACtF,UAAU,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,mBAAmB,CAAC,CAAC;IACjD,wFAAwF;IACxF,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,+FAA+F;IAC/F,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,iEAAiE;IACjE,MAAM,CAAC,EAAE,OAAO,CAAC;CAClB;AAED,8FAA8F;AAC9F,wBAAgB,oBAAoB,CAAC,IAAI,EAAE,UAAU,EAAE,QAAQ,SAAgB,GAAG,MAAM,EAAE,CAEzF;AAED,4FAA4F;AAC5F,wBAAgB,kBAAkB,CAAC,IAAI,EAAE,UAAU,EAAE,QAAQ,SAAgB,GAAG,MAAM,EAAE,CAEvF;AA0FD;;;;;;;;;;;;;GAaG;AACH,wBAAgB,oBAAoB,CAClC,IAAI,EAAE,UAAU,EAChB,OAAO,EAAE,2BAA2B,GACnC,MAAM,CAsFR;AAED;;;;;GAKG;AACH,MAAM,WAAW,iBAAiB;IAChC,+DAA+D;IAC/D,IAAI,EAAE,UAAU,CAAC;IACjB,kFAAkF;IAClF,UAAU,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,mBAAmB,CAAC,CAAC;IACjD,2DAA2D;IAC3D,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,2DAA2D;IAC3D,QAAQ,CAAC,EAAE,MAAM,CAAC;CACnB;AAED,qFAAqF;AACrF,MAAM,MAAM,oBAAoB,GAAG,MAAM,CAAC,MAAM,EAAE,iBAAiB,CAAC,CAAC;AAErE,8FAA8F;AAC9F,MAAM,WAAW,qBAAqB;IACpC,IAAI,EAAE,MAAM,CAAC;IACb,kEAAkE;IAClE,QAAQ,EAAE,MAAM,CAAC;IACjB,IAAI,EAAE,MAAM,CAAC;CACd;AAED;;;;;GAKG;AACH,wBAAgB,qBAAqB,CAAC,QAAQ,EAAE,oBAAoB,GAAG,qBAAqB,EAAE,CAW7F"}

package/dist/src/generate_client.js

@@ -0,0 +1,164 @@
+/** Enumerate the filterable field paths a spec admits, capped at `maxDepth` relation hops. */
+export function filterableFieldPaths(spec, maxDepth = spec.maxDepth) {
+    return collectPaths(spec, 'filterable', maxDepth);
+}
+/** Enumerate the sortable field paths a spec admits, capped at `maxDepth` relation hops. */
+export function sortableFieldPaths(spec, maxDepth = spec.maxDepth) {
+    return collectPaths(spec, 'sortable', maxDepth);
+}
+/**
+ * Walk the spec's base allow-list + relation whitelist into a flat, de-duped list
+ * of (dotted) field paths, bounded by `maxDepth` relation hops. A `'*'` allow-list
+ * cannot be enumerated (any column), so it contributes no concrete base names —
+ * the emitter then falls back to a permissive `string` field union.
+ */
+function collectPaths(spec, kind, maxDepth) {
+    const out = [];
+    const base = kind === 'filterable' ? spec.filterable : spec.sortable;
+    if (Array.isArray(base))
+        out.push(...base);
+    // Computed/virtual fields are both filterable and sortable — surface their
+    // declared aliases in the client's field union so a generated client can
+    // reference `fullName`/`postCount` exactly like a real column.
+    if (spec.computed)
+        out.push(...Object.keys(spec.computed));
+    const walk = (relations, prefix, depth) => {
+        if (depth > maxDepth)
+            return;
+        for (const [relName, rel] of Object.entries(relations)) {
+            const cols = kind === 'filterable' ? rel.filterable : (rel.sortable ?? rel.filterable);
+            if (Array.isArray(cols)) {
+                for (const col of cols)
+                    out.push([...prefix, relName, col].join('.'));
+            }
+            if (rel.relations)
+                walk(rel.relations, [...prefix, relName], depth + 1);
+        }
+    };
+    walk(spec.relations, [], 1);
+    return [...new Set(out)];
+}
+/** `foo-bar_baz` → `FooBarBaz`. Strips non-identifier chars, PascalCases the rest. */
+function toPascalCase(name) {
+    const parts = name.split(/[^A-Za-z0-9]+/).filter(Boolean);
+    const pascal = parts.map((p) => p.charAt(0).toUpperCase() + p.slice(1)).join('');
+    return /^[0-9]/.test(pascal) ? `_${pascal}` : pascal || 'Filter';
+}
+/** PascalCase but a lowercased first char — the value-identifier form (`peopleFilterQuery`). */
+function toCamelCase(name) {
+    const pascal = toPascalCase(name);
+    return pascal.charAt(0).toLowerCase() + pascal.slice(1);
+}
+/** `BlogPost`/`blog-post` → `blog_post` — the AdonisJS file-name convention. */
+function toSnakeCase(name) {
+    return toPascalCase(name)
+        .replace(/([a-z0-9])([A-Z])/g, '$1_$2')
+        .toLowerCase();
+}
+/** Map a field's type info to a TS type literal. Mirrors the NestJS `kindToTs` emitter. */
+function fieldTypeToTs(info) {
+    if (info.typeRef)
+        return info.typeRef;
+    if (info.enumValues && info.enumValues.length > 0) {
+        return info.enumValues
+            .map((v) => (typeof v === 'number' ? String(v) : JSON.stringify(v)))
+            .join(' | ');
+    }
+    switch (info.kind) {
+        case 'string':
+            return 'string';
+        case 'number':
+            return 'number';
+        case 'boolean':
+            return 'boolean';
+        case 'date':
+            return 'Date';
+        case 'json':
+            return 'Record<string, unknown>';
+        default:
+            return 'unknown';
+    }
+}
+/** The classifier kind stored in runtime meta (`typeRef`/enum collapse to their base bucket). */
+function metaKind(info) {
+    return info.kind ?? 'unknown';
+}
+/**
+ * Generate a typed filter client module for one {@link FilterSpec} — a pure
+ * string transform. The emitted module exports, for a spec named `people`:
+ *
+ * - `type PeopleFilterFields` — the union of filterable field paths (the security
+ *   boundary, as concrete string literals);
+ * - `interface PeopleFilterFieldTypes` — the per-field value-type map (only when
+ *   `fieldTypes` is supplied), which drives the client's operator/value narrowing;
+ * - `const peopleFilterMeta` — runtime metadata (filterable/sortable/searchable
+ *   fields, whitelisted relations, per-field kinds, and the default sort / page
+ *   size / max size + cursor keyset the runner paginates by);
+ * - `function peopleFilterQuery()` — a `filterQueryTyped<Fields, FieldTypes>()`
+ *   factory returning a type-safe builder scoped to this spec.
+ */
+export function generateFilterClient(spec, options) {
+    const pascal = toPascalCase(options.name);
+    const camel = toCamelCase(options.name);
+    const clientModule = options.clientModule ?? '@adonis-agora/filter-client';
+    const maxDepth = options.maxDepth ?? spec.maxDepth;
+    // The spec's own `fieldTypes` are the default source: declaring a kind there already drives
+    // server-side value coercion, so inheriting it here means one declaration feeds both ends
+    // instead of asking callers to repeat themselves in the manifest. An explicit `options.fieldTypes`
+    // still wins, for a caller that wants richer codegen-only info (enumValues/typeRef) than the
+    // server needs.
+    const fieldTypes = options.fieldTypes ?? spec.fieldTypes ?? {};
+    const hasTypes = Object.keys(fieldTypes).length > 0;
+    const fields = filterableFieldPaths(spec, maxDepth);
+    const sortable = sortableFieldPaths(spec, maxDepth);
+    const relations = Object.keys(spec.relations);
+    const cursorKeyset = spec.defaultSort.map((s) => s.field);
+    const fieldsUnion = fields.length > 0 ? fields.map((f) => JSON.stringify(f)).join(' | ') : 'string';
+    const typesTypeName = `${pascal}FilterFieldTypes`;
+    const fieldsTypeName = `${pascal}FilterFields`;
+    const typeArgs = hasTypes ? `${fieldsTypeName}, ${typesTypeName}` : fieldsTypeName;
+    const lines = [];
+    if (options.banner ?? true) {
+        lines.push('// Code generated by @adonis-agora/filter. DO NOT EDIT.', `// Source: filter spec "${options.name}".`, '');
+    }
+    lines.push(`import { filterQueryTyped as _filterQueryTyped } from '${clientModule}';`, '', `/** Filterable field paths for \`${options.name}\` — the client's field-name allow-list. */`, `export type ${fieldsTypeName} = ${fieldsUnion};`, '');
+    if (hasTypes) {
+        lines.push(`/** Per-field value types for \`${options.name}\` (drives operator narrowing). */`);
+        lines.push(`export interface ${typesTypeName} {`);
+        for (const [field, info] of Object.entries(fieldTypes)) {
+            let ts = fieldTypeToTs(info);
+            if (info.nullable)
+                ts = `${ts} | null`;
+            lines.push(`  ${JSON.stringify(field)}: ${ts};`);
+        }
+        lines.push('}', '');
+    }
+    const typesMeta = hasTypes
+        ? `{ ${Object.entries(fieldTypes)
+            .map(([field, info]) => `${JSON.stringify(field)}: ${JSON.stringify(metaKind(info))}`)
+            .join(', ')} }`
+        : '{}';
+    lines.push(`/** Runtime filter metadata for \`${options.name}\`. */`, `export const ${camel}FilterMeta = {`, `  fields: [${fields.map((f) => JSON.stringify(f)).join(', ')}],`, `  sortable: [${sortable.map((f) => JSON.stringify(f)).join(', ')}],`, `  searchable: [${spec.searchable.map((f) => JSON.stringify(f)).join(', ')}],`, `  relations: [${relations.map((r) => JSON.stringify(r)).join(', ')}],`, `  types: ${typesMeta},`, `  defaultSort: [${spec.defaultSort
+        .map((s) => `{ field: ${JSON.stringify(s.field)}, direction: ${JSON.stringify(s.direction)} }`)
+        .join(', ')}],`, `  cursorKeyset: [${cursorKeyset.map((f) => JSON.stringify(f)).join(', ')}],`, `  defaultSize: ${spec.defaultSize ?? 'undefined'},`, `  maxSize: ${spec.maxSize ?? 'undefined'},`, '} as const;', '', `/** A type-safe filter-query builder scoped to \`${options.name}\`'s filterable fields. */`, `export function ${camel}FilterQuery() {`, `  return _filterQueryTyped<${typeArgs}>();`, '}', '');
+    return lines.join('\n');
+}
+/**
+ * Expand a whole {@link FilterClientManifest} into per-spec generated modules —
+ * the pure core the `make:filter-client` ace command writes to disk. Kept pure
+ * (manifest in, modules out) so the command stays a thin IO wrapper and the
+ * expansion is itself testable without a running app.
+ */
+export function generateFilterClients(manifest) {
+    return Object.entries(manifest).map(([name, entry]) => ({
+        name,
+        filename: `${toSnakeCase(name)}_filter_client.ts`,
+        code: generateFilterClient(entry.spec, {
+            name,
+            ...(entry.fieldTypes && { fieldTypes: entry.fieldTypes }),
+            ...(entry.clientModule && { clientModule: entry.clientModule }),
+            ...(entry.maxDepth !== undefined && { maxDepth: entry.maxDepth }),
+        }),
+    }));
+}
+//# sourceMappingURL=generate_client.js.map

package/dist/src/generate_client.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"generate_client.js","sourceRoot":"","sources":["../../src/generate_client.ts"],"names":[],"mappings":"AA+DA,8FAA8F;AAC9F,MAAM,UAAU,oBAAoB,CAAC,IAAgB,EAAE,QAAQ,GAAG,IAAI,CAAC,QAAQ;IAC7E,OAAO,YAAY,CAAC,IAAI,EAAE,YAAY,EAAE,QAAQ,CAAC,CAAC;AACpD,CAAC;AAED,4FAA4F;AAC5F,MAAM,UAAU,kBAAkB,CAAC,IAAgB,EAAE,QAAQ,GAAG,IAAI,CAAC,QAAQ;IAC3E,OAAO,YAAY,CAAC,IAAI,EAAE,UAAU,EAAE,QAAQ,CAAC,CAAC;AAClD,CAAC;AAED;;;;;GAKG;AACH,SAAS,YAAY,CACnB,IAAgB,EAChB,IAA+B,EAC/B,QAAgB;IAEhB,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,MAAM,IAAI,GAAG,IAAI,KAAK,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC;IACrE,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC;QAAE,GAAG,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC;IAE3C,2EAA2E;IAC3E,yEAAyE;IACzE,+DAA+D;IAC/D,IAAI,IAAI,CAAC,QAAQ;QAAE,GAAG,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;IAE3D,MAAM,IAAI,GAAG,CACX,SAAiD,EACjD,MAAgB,EAChB,KAAa,EACP,EAAE;QACR,IAAI,KAAK,GAAG,QAAQ;YAAE,OAAO;QAC7B,KAAK,MAAM,CAAC,OAAO,EAAE,GAAG,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE,CAAC;YACvD,MAAM,IAAI,GAAG,IAAI,KAAK,YAAY,CAAC,CAAC,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,IAAI,GAAG,CAAC,UAAU,CAAC,CAAC;YACvF,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;gBACxB,KAAK,MAAM,GAAG,IAAI,IAAI;oBAAE,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,MAAM,EAAE,OAAO,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;YACxE,CAAC;YACD,IAAI,GAAG,CAAC,SAAS;gBAAE,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,CAAC,GAAG,MAAM,EAAE,OAAO,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;QAC1E,CAAC;IACH,CAAC,CAAC;IACF,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;IAE5B,OAAO,CAAC,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;AAC3B,CAAC;AAED,sFAAsF;AACtF,SAAS,YAAY,CAAC,IAAY;IAChC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;IAC1D,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACjF,OAAO,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,MAAM,EAAE,CAAC,CAAC,CAAC,MAAM,IAAI,QAAQ,CAAC;AACnE,CAAC;AAED,gGAAgG;AAChG,SAAS,WAAW,CAAC,IAAY;IAC/B,MAAM,MAAM,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC;IAClC,OAAO,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;AAC1D,CAAC;AAED,gFAAgF;AAChF,SAAS,WAAW,CAAC,IAAY;IAC/B,OAAO,YAAY,CAAC,IAAI,CAAC;SACtB,OAAO,CAAC,oBAAoB,EAAE,OAAO,CAAC;SACtC,WAAW,EAAE,CAAC;AACnB,CAAC;AAED,2FAA2F;AAC3F,SAAS,aAAa,CAAC,IAAyB;IAC9C,IAAI,IAAI,CAAC,OAAO;QAAE,OAAO,IAAI,CAAC,OAAO,CAAC;IACtC,IAAI,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAClD,OAAO,IAAI,CAAC,UAAU;aACnB,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;aACnE,IAAI,CAAC,KAAK,CAAC,CAAC;IACjB,CAAC;IACD,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,KAAK,QAAQ;YACX,OAAO,QAAQ,CAAC;QAClB,KAAK,QAAQ;YACX,OAAO,QAAQ,CAAC;QAClB,KAAK,SAAS;YACZ,OAAO,SAAS,CAAC;QACnB,KAAK,MAAM;YACT,OAAO,MAAM,CAAC;QAChB,KAAK,MAAM;YACT,OAAO,yBAAyB,CAAC;QACnC;YACE,OAAO,SAAS,CAAC;IACrB,CAAC;AACH,CAAC;AAED,iGAAiG;AACjG,SAAS,QAAQ,CAAC,IAAyB;IACzC,OAAO,IAAI,CAAC,IAAI,IAAI,SAAS,CAAC;AAChC,CAAC;AAED;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,oBAAoB,CAClC,IAAgB,EAChB,OAAoC;IAEpC,MAAM,MAAM,GAAG,YAAY,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IAC1C,MAAM,KAAK,GAAG,WAAW,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IACxC,MAAM,YAAY,GAAG,OAAO,CAAC,YAAY,IAAI,6BAA6B,CAAC;IAC3E,MAAM,QAAQ,GAAG,OAAO,CAAC,QAAQ,IAAI,IAAI,CAAC,QAAQ,CAAC;IACnD,4FAA4F;IAC5F,0FAA0F;IAC1F,mGAAmG;IACnG,6FAA6F;IAC7F,gBAAgB;IAChB,MAAM,UAAU,GAAG,OAAO,CAAC,UAAU,IAAI,IAAI,CAAC,UAAU,IAAI,EAAE,CAAC;IAC/D,MAAM,QAAQ,GAAG,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;IAEpD,MAAM,MAAM,GAAG,oBAAoB,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;IACpD,MAAM,QAAQ,GAAG,kBAAkB,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;IACpD,MAAM,SAAS,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IAC9C,MAAM,YAAY,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;IAE1D,MAAM,WAAW,GACf,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC;IAElF,MAAM,aAAa,GAAG,GAAG,MAAM,kBAAkB,CAAC;IAClD,MAAM,cAAc,GAAG,GAAG,MAAM,cAAc,CAAC;IAC/C,MAAM,QAAQ,GAAG,QAAQ,CAAC,CAAC,CAAC,GAAG,cAAc,KAAK,aAAa,EAAE,CAAC,CAAC,CAAC,cAAc,CAAC;IAEnF,MAAM,KAAK,GAAa,EAAE,CAAC;IAE3B,IAAI,OAAO,CAAC,MAAM,IAAI,IAAI,EAAE,CAAC;QAC3B,KAAK,CAAC,IAAI,CACR,yDAAyD,EACzD,2BAA2B,OAAO,CAAC,IAAI,IAAI,EAC3C,EAAE,CACH,CAAC;IACJ,CAAC;IAED,KAAK,CAAC,IAAI,CACR,0DAA0D,YAAY,IAAI,EAC1E,EAAE,EACF,oCAAoC,OAAO,CAAC,IAAI,6CAA6C,EAC7F,eAAe,cAAc,MAAM,WAAW,GAAG,EACjD,EAAE,CACH,CAAC;IAEF,IAAI,QAAQ,EAAE,CAAC;QACb,KAAK,CAAC,IAAI,CAAC,mCAAmC,OAAO,CAAC,IAAI,oCAAoC,CAAC,CAAC;QAChG,KAAK,CAAC,IAAI,CAAC,oBAAoB,aAAa,IAAI,CAAC,CAAC;QAClD,KAAK,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,UAAU,CAAC,EAAE,CAAC;YACvD,IAAI,EAAE,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC;YAC7B,IAAI,IAAI,CAAC,QAAQ;gBAAE,EAAE,GAAG,GAAG,EAAE,SAAS,CAAC;YACvC,KAAK,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QACnD,CAAC;QACD,KAAK,CAAC,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;IACtB,CAAC;IAED,MAAM,SAAS,GAAG,QAAQ;QACxB,CAAC,CAAC,KAAK,MAAM,CAAC,OAAO,CAAC,UAAU,CAAC;aAC5B,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,KAAK,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;aACrF,IAAI,CAAC,IAAI,CAAC,IAAI;QACnB,CAAC,CAAC,IAAI,CAAC;IAET,KAAK,CAAC,IAAI,CACR,qCAAqC,OAAO,CAAC,IAAI,QAAQ,EACzD,gBAAgB,KAAK,gBAAgB,EACrC,cAAc,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EACjE,gBAAgB,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EACrE,kBAAkB,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAC9E,iBAAiB,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EACvE,YAAY,SAAS,GAAG,EACxB,mBAAmB,IAAI,CAAC,WAAW;SAChC,GAAG,CACF,CAAC,CAAC,EAAE,EAAE,CAAC,YAAY,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,gBAAgB,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,CAC1F;SACA,IAAI,CAAC,IAAI,CAAC,IAAI,EACjB,oBAAoB,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAC7E,kBAAkB,IAAI,CAAC,WAAW,IAAI,WAAW,GAAG,EACpD,cAAc,IAAI,CAAC,OAAO,IAAI,WAAW,GAAG,EAC5C,aAAa,EACb,EAAE,EACF,oDAAoD,OAAO,CAAC,IAAI,4BAA4B,EAC5F,mBAAmB,KAAK,iBAAiB,EACzC,8BAA8B,QAAQ,MAAM,EAC5C,GAAG,EACH,EAAE,CACH,CAAC;IAEF,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC;AA8BD;;;;;GAKG;AACH,MAAM,UAAU,qBAAqB,CAAC,QAA8B;IAClE,OAAO,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC;QACtD,IAAI;QACJ,QAAQ,EAAE,GAAG,WAAW,CAAC,IAAI,CAAC,mBAAmB;QACjD,IAAI,EAAE,oBAAoB,CAAC,KAAK,CAAC,IAAI,EAAE;YACrC,IAAI;YACJ,GAAG,CAAC,KAAK,CAAC,UAAU,IAAI,EAAE,UAAU,EAAE,KAAK,CAAC,UAAU,EAAE,CAAC;YACzD,GAAG,CAAC,KAAK,CAAC,YAAY,IAAI,EAAE,YAAY,EAAE,KAAK,CAAC,YAAY,EAAE,CAAC;YAC/D,GAAG,CAAC,KAAK,CAAC,QAAQ,KAAK,SAAS,IAAI,EAAE,QAAQ,EAAE,KAAK,CAAC,QAAQ,EAAE,CAAC;SAClE,CAAC;KACH,CAAC,CAAC,CAAC;AACN,CAAC"}

package/dist/src/group_by_count.d.ts

@@ -0,0 +1,67 @@
+import { type FilterRequestContext } from './apply_from_request.js';
+import type { CustomFilterClass } from './custom_filter.js';
+import { type FilterClass } from './filter_class.js';
+import type { FilterSpec } from './filter_spec.js';
+import type { QueryBuilderLike } from './lucid_adapter.js';
+import type { FilterInput, GroupByCountOptions } from './types.js';
+/** One enumerated value and how many matching rows carry it — the rows behind a picker. */
+export interface GroupByCountRow {
+    value: unknown;
+    count: number;
+}
+/**
+ * Count the distinct values of one field over a CUSTOM backend — the seam a non-Lucide store
+ * implements so its consoles get pickers too. The helper runs the filter class over the active
+ * scope first (unknown fields fail there, loudly), then hands the narrowed draft over: the
+ * adapter never parses a query string, it only counts.
+ */
+export interface GroupByCountAdapter<D> {
+    groupByCount(field: string, draft: D, opts: GroupByCountOptions): Promise<GroupByCountRow[]>;
+}
+/** Options for {@link groupByCountFromRequest}. */
+export interface GroupByCountFromRequestOptions<D = unknown> {
+    /**
+     * Pre-parsed input to use instead of reading `ctx.request.qs()`. Useful for non-HTTP callers
+     * and tests.
+     */
+    input?: FilterInput;
+    /** The axis to enumerate, when the request does not carry a `groupByCount[field]`. */
+    field?: string;
+    /** Cap the returned groups (highest count first). */
+    limit?: number;
+    /** Skip groups — pages the fixed count-desc/value-asc ordering. */
+    offset?: number;
+    /** Narrow to groups whose value contains this text. */
+    search?: string;
+    /**
+     * Custom-backend counting: the narrowed draft is handed to this adapter instead of running a
+     * `GROUP BY` on the builder. Required when the first argument is a draft rather than a Lucid
+     * builder.
+     */
+    adapter?: GroupByCountAdapter<D>;
+}
+/**
+ * Terminal group-by-count aggregation — the value pickers' query: the distinct values of one
+ * field with counts, over the rows the active filters select.
+ *
+ * Lucid mode (a query builder, no adapter): the server scope plus the request filters and search
+ * apply on the builder, then a `GROUP BY` replaces entity-row output — most groups first, so the
+ * answer is pageable. Sort/pagination/distinct of the listing do not apply: this mode replaces
+ * entity rows.
+ *
+ * Custom mode (a draft + `adapter`): the filter class narrows the draft over the same scope,
+ * then the adapter counts it — a Lucid builder never enters the picture.
+ *
+ * ```ts
+ * // Lucid — in a controller:
+ * const rows = await groupByCountFromRequest(User.query(), UserFilter, ctx);
+ *
+ * // custom backend — same shape, a draft instead of a builder:
+ * const rows = await groupByCountFromRequest(draft, RunFilter, ctx, { adapter });
+ * ```
+ */
+export declare function groupByCountFromRequest(qb: QueryBuilderLike, spec: FilterSpec | FilterClass, ctx: FilterRequestContext | undefined, opts?: GroupByCountFromRequestOptions<never>): Promise<GroupByCountRow[]>;
+export declare function groupByCountFromRequest<D>(draft: D, cls: CustomFilterClass<D>, ctx: FilterRequestContext | undefined, opts: GroupByCountFromRequestOptions<D> & {
+    adapter: GroupByCountAdapter<D>;
+}): Promise<GroupByCountRow[]>;
+//# sourceMappingURL=group_by_count.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"group_by_count.d.ts","sourceRoot":"","sources":["../../src/group_by_count.ts"],"names":[],"mappings":"AAAA,OAAO,EAAoB,KAAK,oBAAoB,EAAE,MAAM,yBAAyB,CAAC;AACtF,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,oBAAoB,CAAC;AAE5D,OAAO,EAAE,KAAK,WAAW,EAAsC,MAAM,mBAAmB,CAAC;AACzF,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,kBAAkB,CAAC;AAEnD,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,oBAAoB,CAAC;AAI3D,OAAO,KAAK,EAAgB,WAAW,EAAE,mBAAmB,EAAE,MAAM,YAAY,CAAC;AAGjF,2FAA2F;AAC3F,MAAM,WAAW,eAAe;IAC9B,KAAK,EAAE,OAAO,CAAC;IACf,KAAK,EAAE,MAAM,CAAC;CACf;AAED;;;;;GAKG;AACH,MAAM,WAAW,mBAAmB,CAAC,CAAC;IACpC,YAAY,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,mBAAmB,GAAG,OAAO,CAAC,eAAe,EAAE,CAAC,CAAC;CAC9F;AAED,mDAAmD;AACnD,MAAM,WAAW,8BAA8B,CAAC,CAAC,GAAG,OAAO;IACzD;;;OAGG;IACH,KAAK,CAAC,EAAE,WAAW,CAAC;IACpB,sFAAsF;IACtF,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,qDAAqD;IACrD,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,mEAAmE;IACnE,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,uDAAuD;IACvD,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB;;;;OAIG;IACH,OAAO,CAAC,EAAE,mBAAmB,CAAC,CAAC,CAAC,CAAC;CAClC;AAmBD;;;;;;;;;;;;;;;;;;;GAmBG;AACH,wBAAsB,uBAAuB,CAC3C,EAAE,EAAE,gBAAgB,EACpB,IAAI,EAAE,UAAU,GAAG,WAAW,EAC9B,GAAG,EAAE,oBAAoB,GAAG,SAAS,EACrC,IAAI,CAAC,EAAE,8BAA8B,CAAC,KAAK,CAAC,GAC3C,OAAO,CAAC,eAAe,EAAE,CAAC,CAAC;AAC9B,wBAAsB,uBAAuB,CAAC,CAAC,EAC7C,KAAK,EAAE,CAAC,EACR,GAAG,EAAE,iBAAiB,CAAC,CAAC,CAAC,EACzB,GAAG,EAAE,oBAAoB,GAAG,SAAS,EACrC,IAAI,EAAE,8BAA8B,CAAC,CAAC,CAAC,GAAG;IAAE,OAAO,EAAE,mBAAmB,CAAC,CAAC,CAAC,CAAA;CAAE,GAC5E,OAAO,CAAC,eAAe,EAAE,CAAC,CAAC"}

package/dist/src/group_by_count.js

@@ -0,0 +1,71 @@
+import { applyServerScope } from './apply_from_request.js';
+import { applyCustomFilter } from './custom_filter.js';
+import { isFilterClass, specFromFilterClass } from './filter_class.js';
+import { specToFilterConfig } from './filter_spec.js';
+import { applyGroupByCount } from './lucid_adapter.js';
+import { parseFilterRequest } from './parse_request.js';
+import { applyFilterConditions, resolveSafeDistinct } from './runner.js';
+import { InvalidColumnFilterError } from './validate-column-filter.js';
+/**
+ * Check a grouping field against the allow-list — the same boundary `sort`/`distinct` enforce
+ * (aliases resolve first; relation paths never project). Unknown fields are rejected outright,
+ * never silently ignored: the grouping column IS the whole query, so there is no safe default
+ * for a typo.
+ */
+function resolveGroupField(field, config) {
+    if (!field || typeof field !== 'string' || field.trim() === '') {
+        throw new InvalidColumnFilterError('groupByCount needs a `field` — `groupByCount[field]=tag`.');
+    }
+    const [column] = resolveSafeDistinct([field], { ...config, throwOnInvalid: false });
+    if (column === undefined) {
+        throw new InvalidColumnFilterError(`Cannot group by unlisted field: "${field}".`);
+    }
+    return column;
+}
+export async function groupByCountFromRequest(qbOrDraft, specOrClass, ctx, opts = {}) {
+    const raw = ctx?.request?.qs?.() ?? {};
+    const parsed = opts.input ?? parseFilterRequest(raw);
+    const limit = opts.limit ?? parsed.groupByCount?.limit;
+    const offset = opts.offset ?? parsed.groupByCount?.offset;
+    const search = opts.search ?? parsed.groupByCount?.search;
+    if (opts.adapter) {
+        const draft = qbOrDraft;
+        await applyCustomFilter(draft, specOrClass, ctx, { input: parsed });
+        const field = opts.field ?? parsed.groupByCount?.field;
+        if (!field || typeof field !== 'string' || field.trim() === '') {
+            throw new InvalidColumnFilterError('groupByCount needs a `field` — `groupByCount[field]=tag`.');
+        }
+        return opts.adapter.groupByCount(field, draft, {
+            ...(limit !== undefined && { limit }),
+            ...(offset !== undefined && { offset }),
+            ...(search !== undefined && { search }),
+        });
+    }
+    const spec = typeof specOrClass === 'function' && isFilterClass(specOrClass)
+        ? specFromFilterClass(specOrClass)
+        : specOrClass;
+    const config = specToFilterConfig(spec);
+    const column = resolveGroupField(opts.field ?? parsed.groupByCount?.field, config);
+    const qb = qbOrDraft;
+    applyServerScope(qb, spec, ctx);
+    applyFilterConditions(qb, {
+        ...(parsed.filters !== undefined && { filters: parsed.filters }),
+        ...(parsed.search !== undefined && { search: parsed.search }),
+    }, config);
+    applyGroupByCount(qb, column, {
+        ...(limit !== undefined && { limit }),
+        ...(offset !== undefined && { offset }),
+        ...(search !== undefined && { search }),
+    });
+    // Lucid builders are thenable (awaiting runs the query) — outside the structural seam's
+    // vocabulary, hence the cast at the single point that executes. Model queries hydrate rows
+    // into model instances, where ad-hoc selects land in `$extras` rather than as direct props;
+    // plain builders return the raw `{ value, count }` rows. Both shapes map to the same answer.
+    const rows = (await qb);
+    return rows.map((row) => {
+        const value = row.value ?? row.$extras?.value ?? null;
+        const count = row.count ?? row.$extras?.count;
+        return { value, count: Number(count) };
+    });
+}
+//# sourceMappingURL=group_by_count.js.map

package/dist/src/group_by_count.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"group_by_count.js","sourceRoot":"","sources":["../../src/group_by_count.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,gBAAgB,EAA6B,MAAM,yBAAyB,CAAC;AAEtF,OAAO,EAAE,iBAAiB,EAAE,MAAM,oBAAoB,CAAC;AACvD,OAAO,EAAoB,aAAa,EAAE,mBAAmB,EAAE,MAAM,mBAAmB,CAAC;AAEzF,OAAO,EAAE,kBAAkB,EAAE,MAAM,kBAAkB,CAAC;AAEtD,OAAO,EAAE,iBAAiB,EAAE,MAAM,oBAAoB,CAAC;AACvD,OAAO,EAAE,kBAAkB,EAAE,MAAM,oBAAoB,CAAC;AACxD,OAAO,EAAE,qBAAqB,EAAE,mBAAmB,EAAE,MAAM,aAAa,CAAC;AAEzE,OAAO,EAAE,wBAAwB,EAAE,MAAM,6BAA6B,CAAC;AAyCvE;;;;;GAKG;AACH,SAAS,iBAAiB,CAAC,KAAyB,EAAE,MAAoB;IACxE,IAAI,CAAC,KAAK,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC;QAC/D,MAAM,IAAI,wBAAwB,CAAC,2DAA2D,CAAC,CAAC;IAClG,CAAC;IACD,MAAM,CAAC,MAAM,CAAC,GAAG,mBAAmB,CAAC,CAAC,KAAK,CAAC,EAAE,EAAE,GAAG,MAAM,EAAE,cAAc,EAAE,KAAK,EAAE,CAAC,CAAC;IACpF,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;QACzB,MAAM,IAAI,wBAAwB,CAAC,oCAAoC,KAAK,IAAI,CAAC,CAAC;IACpF,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAkCD,MAAM,CAAC,KAAK,UAAU,uBAAuB,CAC3C,SAA+B,EAC/B,WAA4D,EAC5D,GAAqC,EACrC,IAAI,GAAsC,EAAE;IAE5C,MAAM,GAAG,GAA4B,GAAG,EAAE,OAAO,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC;IAChE,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,IAAI,kBAAkB,CAAC,GAAG,CAAC,CAAC;IACrD,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,MAAM,CAAC,YAAY,EAAE,KAAK,CAAC;IACvD,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,IAAI,MAAM,CAAC,YAAY,EAAE,MAAM,CAAC;IAC1D,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,IAAI,MAAM,CAAC,YAAY,EAAE,MAAM,CAAC;IAE1D,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;QACjB,MAAM,KAAK,GAAG,SAAc,CAAC;QAC7B,MAAM,iBAAiB,CAAC,KAAK,EAAE,WAAmC,EAAE,GAAG,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC;QAC5F,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,MAAM,CAAC,YAAY,EAAE,KAAK,CAAC;QACvD,IAAI,CAAC,KAAK,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC;YAC/D,MAAM,IAAI,wBAAwB,CAChC,2DAA2D,CAC5D,CAAC;QACJ,CAAC;QACD,OAAO,IAAI,CAAC,OAAO,CAAC,YAAY,CAAC,KAAK,EAAE,KAAK,EAAE;YAC7C,GAAG,CAAC,KAAK,KAAK,SAAS,IAAI,EAAE,KAAK,EAAE,CAAC;YACrC,GAAG,CAAC,MAAM,KAAK,SAAS,IAAI,EAAE,MAAM,EAAE,CAAC;YACvC,GAAG,CAAC,MAAM,KAAK,SAAS,IAAI,EAAE,MAAM,EAAE,CAAC;SACxC,CAAC,CAAC;IACL,CAAC;IAED,MAAM,IAAI,GACR,OAAO,WAAW,KAAK,UAAU,IAAI,aAAa,CAAC,WAA0B,CAAC;QAC5E,CAAC,CAAC,mBAAmB,CAAC,WAA0B,CAAC;QACjD,CAAC,CAAE,WAA0B,CAAC;IAClC,MAAM,MAAM,GAAG,kBAAkB,CAAC,IAAI,CAAC,CAAC;IACxC,MAAM,MAAM,GAAG,iBAAiB,CAAC,IAAI,CAAC,KAAK,IAAI,MAAM,CAAC,YAAY,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;IACnF,MAAM,EAAE,GAAG,SAA6B,CAAC;IACzC,gBAAgB,CAAC,EAAE,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;IAChC,qBAAqB,CACnB,EAAE,EACF;QACE,GAAG,CAAC,MAAM,CAAC,OAAO,KAAK,SAAS,IAAI,EAAE,OAAO,EAAE,MAAM,CAAC,OAAO,EAAE,CAAC;QAChE,GAAG,CAAC,MAAM,CAAC,MAAM,KAAK,SAAS,IAAI,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,CAAC;KAC9D,EACD,MAAM,CACP,CAAC;IACF,iBAAiB,CAAC,EAAE,EAAE,MAAM,EAAE;QAC5B,GAAG,CAAC,KAAK,KAAK,SAAS,IAAI,EAAE,KAAK,EAAE,CAAC;QACrC,GAAG,CAAC,MAAM,KAAK,SAAS,IAAI,EAAE,MAAM,EAAE,CAAC;QACvC,GAAG,CAAC,MAAM,KAAK,SAAS,IAAI,EAAE,MAAM,EAAE,CAAC;KACxC,CAAC,CAAC;IACH,wFAAwF;IACxF,2FAA2F;IAC3F,4FAA4F;IAC5F,6FAA6F;IAC7F,MAAM,IAAI,GAAG,CAAC,MAAM,EAAE,CAIpB,CAAC;IACH,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE;QACtB,MAAM,KAAK,GAAG,GAAG,CAAC,KAAK,IAAI,GAAG,CAAC,OAAO,EAAE,KAAK,IAAI,IAAI,CAAC;QACtD,MAAM,KAAK,GAAG,GAAG,CAAC,KAAK,IAAI,GAAG,CAAC,OAAO,EAAE,KAAK,CAAC;QAC9C,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC;IACzC,CAAC,CAAC,CAAC;AACL,CAAC"}

package/dist/src/in_memory.d.ts

@@ -0,0 +1,279 @@
+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;
+    /** Lazily-built readers for to-one relation hops, so a dotted read does not allocate per row. */
+    private relationReaders;
+    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 (memoized) empty builder over a relation's target collection, used to read through it. */
+    private relationReader;
+    /** 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(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;
+    /**
+     * Sort rows by the recorded `orderBy`s. Each row's sort values are read at most once per field
+     * (memoized lazily, so a field is only read for rows whose earlier fields tied — exactly when a
+     * pairwise comparator would read it) instead of twice per comparison, turning O(n log n) reads
+     * (virtual getters, relation hops) into O(n).
+     */
+    private sortRows;
+    /** 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;AAiKD,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;IAc3E,QAAQ,CAAC,UAAU,EAAE,kBAAkB,CAAC,CAAC,CAAC;IAC1C,OAAO,CAAC,QAAQ,CAAC,IAAI;IAdvB,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;IACxC,iGAAiG;IACjG,OAAO,CAAC,eAAe,CAAwD;IAE/E,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,CAuBrC;IAED,iGAAiG;IACjG,OAAO,CAAC,cAAc;IAatB,8EAA8E;IAC9E,OAAO,CAAC,MAAM;IAUd;;;;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,QAAQ,EAAE,CAAC,EAAE,EAAE,gBAAgB,KAAK,IAAI,GAAG,IAAI,CAAC;IACzD,QAAQ,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,GAAG,IAAI,CAAC;IAa/C,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;;;;;OAKG;IACH,OAAO,CAAC,QAAQ;IAgChB,iGAAiG;IACjG,OAAO,CAAC,aAAa;IAMrB,kFAAkF;IAClF,OAAO,CAAC,QAAQ;IAuChB;;;OAGG;IACH,OAAO,CAAC,SAAS;IA0EjB,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"}