@datar-platform/better-auth-dynamodb 0.1.0-alpha.0

package/CHANGELOG.md

@@ -0,0 +1,18 @@
+# @datar-platform/better-auth-dynamodb
+
+## 0.1.0-alpha.0
+
+### Minor Changes
+
+- Initial release. A generic DynamoDB adapter for Better Auth, built on a
+  pluggable `DynamoStore` seam.
+  - `dynamoAdapter()` implements the full Better Auth adapter contract via
+    `createAdapterFactory`, with a declarative where→index planner (`planQuery`)
+    driven by an `IndexMap`.
+  - Ships a zero-dependency built-in single-table store whose index map is
+    auto-derived from the Better Auth schema, so any model or plugin works out of
+    the box. `ensureSchema()` / `generateSchemaFile()` provision the table.
+  - Bring your own store by implementing `DynamoStore` — the seam is expressed in
+    logical index names and field values only, never physical PK/SK.
+  - Correct draining pagination, so `count` and `findMany` are not silently
+    capped at a single DynamoDB page.

package/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2026 Joesome Web Services
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

package/README.md

@@ -0,0 +1,137 @@
+# @datar-platform/better-auth-dynamodb
+
+A generic [DynamoDB](https://aws.amazon.com/dynamodb/) adapter for [Better Auth](https://better-auth.com).
+
+- **Works out of the box** with any Better Auth model or plugin — the built-in
+  single-table store derives its indexes from your schema (`unique` fields and
+  foreign keys), so two-factor, passkey, API-key, organization, etc. just work.
+- **Bring your own store.** The adapter talks to a small `DynamoStore` seam, so
+  you can back it with an existing single-table design (ElectroDB, custom key
+  encoding, a shared table) without changing the adapter.
+- **Correct pagination.** `findMany`/`count` drain every page — no silent row cap.
+- Zero dependencies beyond the AWS SDK.
+
+## Install
+
+```bash
+npm install @datar-platform/better-auth-dynamodb @aws-sdk/client-dynamodb @aws-sdk/lib-dynamodb
+```
+
+## Quick start (built-in single-table store)
+
+```ts
+import { dynamoAdapter } from "@datar-platform/better-auth-dynamodb";
+import { betterAuth } from "better-auth";
+
+export const auth = betterAuth({
+  database: dynamoAdapter({
+    tableName: "better-auth", // or set DYNAMODB_TABLE_NAME
+    region: "us-east-1",
+  }),
+  emailAndPassword: { enabled: true },
+});
+```
+
+### Provision the table
+
+The store uses one table with a `byType` GSI (to list a model) plus one generic
+lookup GSI per index a model needs. Create it once at startup or in setup:
+
+```ts
+import { DynamoDBClient } from "@aws-sdk/client-dynamodb";
+import {
+  assignSlots,
+  deriveIndexMap,
+  ensureSchema,
+} from "@datar-platform/better-auth-dynamodb";
+
+// `schema` is your Better Auth instance's resolved DB schema.
+const indexMap = deriveIndexMap(schema);
+await ensureSchema({
+  client: new DynamoDBClient({ region: "us-east-1" }),
+  tableName: "better-auth",
+  lookupSlots: assignSlots(indexMap).maxSlots,
+});
+```
+
+You can also generate a CloudFormation template via the Better Auth CLI
+(`npx @better-auth/cli generate`) — the adapter's `createSchema` emits one sized
+to your access patterns.
+
+## Bring your own store
+
+Implement `DynamoStore` to run the same adapter against your own table layout.
+The adapter drives it purely through **logical index names + field values** — it
+never touches physical `PK`/`SK` strings, so your store owns all key encoding.
+
+```ts
+import { dynamoAdapter } from "@datar-platform/better-auth-dynamodb";
+
+import type {
+  DynamoStore,
+  IndexMap,
+} from "@datar-platform/better-auth-dynamodb";
+
+const store: DynamoStore = {
+  put(model, item) {
+    /* ... */
+  },
+  getById(model, id) {
+    /* ... */
+  },
+  update(model, id, patch) {
+    /* ... */
+  },
+  deleteById(model, id) {
+    /* ... */
+  },
+  queryIndex({ model, index, key }) {
+    /* map (model, index, key) -> a GSI query */
+  },
+  listByType({ model }) {
+    /* list all rows of a model */
+  },
+  // optional: count(), createSchema()
+};
+
+// Describe which fields each model is looked up by:
+const indexMap: IndexMap = {
+  user: [{ index: "byEmail", pk: ["email"] }],
+  account: [
+    { index: "byUser", pk: ["userId"], sk: ["providerId"] },
+    { index: "byAccountId", pk: ["accountId"], sk: ["providerId"] },
+  ],
+  // ...
+};
+
+betterAuth({ database: dynamoAdapter({ store, indexMap }) });
+```
+
+Given a `where`, the adapter picks the first access pattern whose partition-key
+fields are all present (attaching any leading sort-key fields), then filters any
+remaining predicates in memory. Provide an `indexMap` to match your table, or
+omit it to auto-derive from the schema.
+
+## Configuration
+
+| Option      | Default                               | Description                                                                                       |
+| ----------- | ------------------------------------- | ------------------------------------------------------------------------------------------------- |
+| `store`     | built-in single-table store           | Storage backend (`DynamoStore`).                                                                  |
+| `indexMap`  | derived from schema                   | Access-pattern map.                                                                               |
+| `tableName` | `DYNAMODB_TABLE_NAME` → `better-auth` | Table name (built-in store).                                                                      |
+| `region`    | SDK default                           | AWS region (built-in store).                                                                      |
+| `endpoint`  | SDK default                           | Endpoint override for DynamoDB Local / LocalStack, e.g. `http://localhost:4566` (built-in store). |
+| `debugLogs` | `false`                               | Better Auth debug logging.                                                                        |
+
+## Notes & limitations
+
+- IDs are strings (Better Auth generates them); `supportsNumericIds` is `false`.
+- Dates are stored as ISO strings and re-hydrated on read (`supportsDates: false`).
+- No native transactions — multi-row ops run sequentially in small batches.
+- The built-in store's derived index map keys on schema field names; custom
+  `fieldName` mappings are not yet resolved in derivation (pass an explicit
+  `indexMap` if you rename fields).
+
+## License
+
+MIT

package/dist/adapter.d.ts

@@ -0,0 +1,19 @@
+import type { BetterAuthOptions } from "better-auth";
+import type { AdapterFactory } from "better-auth/adapters";
+import type { DynamoAdapterConfig } from "./types.js";
+/**
+ * A generic DynamoDB adapter for Better Auth.
+ *
+ * The factory handles field mapping, JSON/date/boolean coercion, ID generation
+ * and `where`-clause normalization; this adapter only implements the raw DB
+ * operations. Those operations are expressed against a pluggable
+ * {@link DynamoStore} and a declarative access-pattern map, so the same core
+ * drives both the built-in single-table store and any custom store.
+ *
+ * @example
+ * ```ts
+ * betterAuth({ database: dynamoAdapter({ tableName: "auth", region: "us-east-1" }) });
+ * ```
+ */
+export declare const dynamoAdapter: (config?: DynamoAdapterConfig) => AdapterFactory<BetterAuthOptions>;
+//# sourceMappingURL=adapter.d.ts.map

package/dist/adapter.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"adapter.d.ts","sourceRoot":"","sources":["../src/adapter.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,aAAa,CAAC;AACrD,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAC;AAI3D,OAAO,KAAK,EAAE,mBAAmB,EAA0B,MAAM,YAAY,CAAC;AAW9E;;;;;;;;;;;;;GAaG;AACH,eAAO,MAAM,aAAa,GACxB,SAAQ,mBAAwB,KAC/B,cAAc,CAAC,iBAAiB,CA0NlC,CAAC"}

package/dist/adapter.js

@@ -0,0 +1,153 @@
+import { createAdapterFactory } from "better-auth/adapters";
+import { applySort, applyWindow, drainPages, matchesResidual, } from "./pagination.js";
+import { planQuery } from "./planner.js";
+import { deriveIndexMap } from "./stores/default/derive-index-map.js";
+import { createSingleTableStore } from "./stores/default/single-table-store.js";
+/**
+ * A generic DynamoDB adapter for Better Auth.
+ *
+ * The factory handles field mapping, JSON/date/boolean coercion, ID generation
+ * and `where`-clause normalization; this adapter only implements the raw DB
+ * operations. Those operations are expressed against a pluggable
+ * {@link DynamoStore} and a declarative access-pattern map, so the same core
+ * drives both the built-in single-table store and any custom store.
+ *
+ * @example
+ * ```ts
+ * betterAuth({ database: dynamoAdapter({ tableName: "auth", region: "us-east-1" }) });
+ * ```
+ */
+export const dynamoAdapter = (config = {}) => {
+    return createAdapterFactory({
+        config: {
+            adapterId: "dynamodb",
+            adapterName: "DynamoDB",
+            // DynamoDB keys are strings; let Better Auth generate string ids.
+            supportsNumericIds: false,
+            // We serialize JSON ourselves via the SDK document client.
+            supportsJSON: true,
+            // No native Date type — stored as ISO strings (see transforms below).
+            supportsDates: false,
+            supportsBooleans: true,
+            usePlural: false,
+            debugLogs: config.debugLogs,
+            // Dates <-> ISO strings, since supportsDates is false.
+            customTransformInput: ({ data, fieldAttributes }) => fieldAttributes.type === "date" && data instanceof Date
+                ? data.toISOString()
+                : data,
+            customTransformOutput: ({ data, fieldAttributes }) => fieldAttributes.type === "date" && typeof data === "string"
+                ? new Date(data)
+                : data,
+        },
+        adapter: ({ schema, debugLog, getDefaultModelName }) => {
+            const indexMap = config.indexMap ?? deriveIndexMap(schema);
+            const store = config.store ??
+                createSingleTableStore({
+                    tableName: config.tableName,
+                    region: config.region,
+                    endpoint: config.endpoint,
+                    indexMap,
+                });
+            /** Resolve every row matching `where`, using the best access path. */
+            const queryAll = async (model, where) => {
+                const clauses = where ?? [];
+                const plan = planQuery(model, clauses, indexMap);
+                debugLog("queryAll", { model, plan: plan.kind });
+                let candidates;
+                if (plan.kind === "byId") {
+                    const one = await store.getById(model, plan.id);
+                    candidates = one ? [one] : [];
+                }
+                else if (plan.kind === "index") {
+                    candidates = await drainPages((cursor) => store.queryIndex({
+                        model,
+                        index: plan.index,
+                        key: plan.key,
+                        cursor,
+                    }));
+                }
+                else {
+                    candidates = await drainPages((cursor) => store.listByType({ model, cursor }));
+                }
+                return candidates.filter((item) => matchesResidual(item, plan.residual));
+            };
+            /** Find the primary id for a `where`, cheaply if it names `id` directly. */
+            const resolveId = async (model, where) => {
+                const plan = planQuery(model, where, indexMap);
+                if (plan.kind === "byId")
+                    return plan.id;
+                const [first] = await queryAll(model, where);
+                return first ? String(first.id) : null;
+            };
+            return {
+                async create({ model, data, }) {
+                    const m = getDefaultModelName(model);
+                    const created = await store.put(m, data);
+                    return created;
+                },
+                async update({ model, where, update, }) {
+                    const m = getDefaultModelName(model);
+                    const id = await resolveId(m, where);
+                    if (!id)
+                        return null;
+                    const updated = await store.update(m, id, update);
+                    return updated;
+                },
+                async updateMany({ model, where, update, }) {
+                    const m = getDefaultModelName(model);
+                    const items = await queryAll(m, where);
+                    await runBatched(items, (item) => store.update(m, String(item.id), update));
+                    return items.length;
+                },
+                async delete({ model, where, }) {
+                    const m = getDefaultModelName(model);
+                    const id = await resolveId(m, where);
+                    if (id)
+                        await store.deleteById(m, id);
+                },
+                async deleteMany({ model, where, }) {
+                    const m = getDefaultModelName(model);
+                    const items = await queryAll(m, where);
+                    await runBatched(items, (item) => store.deleteById(m, String(item.id)));
+                    return items.length;
+                },
+                async findOne({ model, where, }) {
+                    const m = getDefaultModelName(model);
+                    const [first] = await queryAll(m, where);
+                    return (first ?? null);
+                },
+                async findMany({ model, where, limit, sortBy, offset, }) {
+                    const m = getDefaultModelName(model);
+                    const items = applyWindow(applySort(await queryAll(m, where), sortBy), offset, limit);
+                    return items;
+                },
+                async count({ model, where, }) {
+                    const m = getDefaultModelName(model);
+                    const clauses = where ?? [];
+                    const plan = planQuery(m, clauses, indexMap);
+                    // Fast path: no residual predicates and the store can count natively.
+                    if (plan.residual.length === 0 && store.count) {
+                        const fast = await store.count(plan.kind === "index"
+                            ? { model: m, index: plan.index, key: plan.key }
+                            : { model: m });
+                        if (fast != null)
+                            return fast;
+                    }
+                    return (await queryAll(m, clauses)).length;
+                },
+                ...(store.createSchema
+                    ? {
+                        createSchema: (props) => store.createSchema(props),
+                    }
+                    : {}),
+            };
+        },
+    });
+};
+/** Run an async op over items in small concurrent chunks to avoid throttling. */
+async function runBatched(items, op, chunkSize = 10) {
+    for (let i = 0; i < items.length; i += chunkSize) {
+        await Promise.all(items.slice(i, i + chunkSize).map(op));
+    }
+}
+//# sourceMappingURL=adapter.js.map

package/dist/adapter.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"adapter.js","sourceRoot":"","sources":["../src/adapter.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,oBAAoB,EAAE,MAAM,sBAAsB,CAAC;AAI5D,OAAO,EACL,SAAS,EACT,WAAW,EACX,UAAU,EACV,eAAe,GAChB,MAAM,iBAAiB,CAAC;AACzB,OAAO,EAAE,SAAS,EAAE,MAAM,cAAc,CAAC;AACzC,OAAO,EAAE,cAAc,EAAE,MAAM,sCAAsC,CAAC;AACtE,OAAO,EAAE,sBAAsB,EAAE,MAAM,wCAAwC,CAAC;AAEhF;;;;;;;;;;;;;GAaG;AACH,MAAM,CAAC,MAAM,aAAa,GAAG,CAC3B,SAA8B,EAAE,EACG,EAAE;IACrC,OAAO,oBAAoB,CAAC;QAC1B,MAAM,EAAE;YACN,SAAS,EAAE,UAAU;YACrB,WAAW,EAAE,UAAU;YACvB,kEAAkE;YAClE,kBAAkB,EAAE,KAAK;YACzB,2DAA2D;YAC3D,YAAY,EAAE,IAAI;YAClB,sEAAsE;YACtE,aAAa,EAAE,KAAK;YACpB,gBAAgB,EAAE,IAAI;YACtB,SAAS,EAAE,KAAK;YAChB,SAAS,EAAE,MAAM,CAAC,SAAS;YAE3B,uDAAuD;YACvD,oBAAoB,EAAE,CAAC,EAAE,IAAI,EAAE,eAAe,EAAE,EAAE,EAAE,CAClD,eAAe,CAAC,IAAI,KAAK,MAAM,IAAI,IAAI,YAAY,IAAI;gBACrD,CAAC,CAAC,IAAI,CAAC,WAAW,EAAE;gBACpB,CAAC,CAAC,IAAI;YACV,qBAAqB,EAAE,CAAC,EAAE,IAAI,EAAE,eAAe,EAAE,EAAE,EAAE,CACnD,eAAe,CAAC,IAAI,KAAK,MAAM,IAAI,OAAO,IAAI,KAAK,QAAQ;gBACzD,CAAC,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC;gBAChB,CAAC,CAAC,IAAI;SACX;QAED,OAAO,EAAE,CAAC,EAAE,MAAM,EAAE,QAAQ,EAAE,mBAAmB,EAAE,EAAE,EAAE;YACrD,MAAM,QAAQ,GAAG,MAAM,CAAC,QAAQ,IAAI,cAAc,CAAC,MAAM,CAAC,CAAC;YAC3D,MAAM,KAAK,GACT,MAAM,CAAC,KAAK;gBACZ,sBAAsB,CAAC;oBACrB,SAAS,EAAE,MAAM,CAAC,SAAS;oBAC3B,MAAM,EAAE,MAAM,CAAC,MAAM;oBACrB,QAAQ,EAAE,MAAM,CAAC,QAAQ;oBACzB,QAAQ;iBACT,CAAC,CAAC;YAEL,sEAAsE;YACtE,MAAM,QAAQ,GAAG,KAAK,EACpB,KAAa,EACb,KAAsB,EACA,EAAE;gBACxB,MAAM,OAAO,GAAG,KAAK,IAAI,EAAE,CAAC;gBAC5B,MAAM,IAAI,GAAG,SAAS,CAAC,KAAK,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC;gBACjD,QAAQ,CAAC,UAAU,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;gBAEjD,IAAI,UAAuB,CAAC;gBAC5B,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;oBACzB,MAAM,GAAG,GAAG,MAAM,KAAK,CAAC,OAAO,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC;oBAChD,UAAU,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBAChC,CAAC;qBAAM,IAAI,IAAI,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;oBACjC,UAAU,GAAG,MAAM,UAAU,CAAC,CAAC,MAAM,EAAE,EAAE,CACvC,KAAK,CAAC,UAAU,CAAC;wBACf,KAAK;wBACL,KAAK,EAAE,IAAI,CAAC,KAAK;wBACjB,GAAG,EAAE,IAAI,CAAC,GAAG;wBACb,MAAM;qBACP,CAAC,CACH,CAAC;gBACJ,CAAC;qBAAM,CAAC;oBACN,UAAU,GAAG,MAAM,UAAU,CAAC,CAAC,MAAM,EAAE,EAAE,CACvC,KAAK,CAAC,UAAU,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,CACpC,CAAC;gBACJ,CAAC;gBACD,OAAO,UAAU,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAChC,eAAe,CAAC,IAAI,EAAE,IAAI,CAAC,QAAQ,CAAC,CACrC,CAAC;YACJ,CAAC,CAAC;YAEF,4EAA4E;YAC5E,MAAM,SAAS,GAAG,KAAK,EACrB,KAAa,EACb,KAAqB,EACG,EAAE;gBAC1B,MAAM,IAAI,GAAc,SAAS,CAAC,KAAK,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC;gBAC1D,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM;oBAAE,OAAO,IAAI,CAAC,EAAE,CAAC;gBACzC,MAAM,CAAC,KAAK,CAAC,GAAG,MAAM,QAAQ,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;gBAC7C,OAAO,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;YACzC,CAAC,CAAC;YAEF,OAAO;gBACL,KAAK,CAAC,MAAM,CAAgC,EAC1C,KAAK,EACL,IAAI,GAIL;oBACC,MAAM,CAAC,GAAG,mBAAmB,CAAC,KAAK,CAAC,CAAC;oBACrC,MAAM,OAAO,GAAG,MAAM,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,IAAiB,CAAC,CAAC;oBACtD,OAAO,OAAY,CAAC;gBACtB,CAAC;gBAED,KAAK,CAAC,MAAM,CAAI,EACd,KAAK,EACL,KAAK,EACL,MAAM,GAKP;oBACC,MAAM,CAAC,GAAG,mBAAmB,CAAC,KAAK,CAAC,CAAC;oBACrC,MAAM,EAAE,GAAG,MAAM,SAAS,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;oBACrC,IAAI,CAAC,EAAE;wBAAE,OAAO,IAAI,CAAC;oBACrB,MAAM,OAAO,GAAG,MAAM,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,MAAmB,CAAC,CAAC;oBAC/D,OAAO,OAAmB,CAAC;gBAC7B,CAAC;gBAED,KAAK,CAAC,UAAU,CAAC,EACf,KAAK,EACL,KAAK,EACL,MAAM,GAKP;oBACC,MAAM,CAAC,GAAG,mBAAmB,CAAC,KAAK,CAAC,CAAC;oBACrC,MAAM,KAAK,GAAG,MAAM,QAAQ,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;oBACvC,MAAM,UAAU,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,EAAE,CAC/B,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CACzC,CAAC;oBACF,OAAO,KAAK,CAAC,MAAM,CAAC;gBACtB,CAAC;gBAED,KAAK,CAAC,MAAM,CAAC,EACX,KAAK,EACL,KAAK,GAIN;oBACC,MAAM,CAAC,GAAG,mBAAmB,CAAC,KAAK,CAAC,CAAC;oBACrC,MAAM,EAAE,GAAG,MAAM,SAAS,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;oBACrC,IAAI,EAAE;wBAAE,MAAM,KAAK,CAAC,UAAU,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;gBACxC,CAAC;gBAED,KAAK,CAAC,UAAU,CAAC,EACf,KAAK,EACL,KAAK,GAIN;oBACC,MAAM,CAAC,GAAG,mBAAmB,CAAC,KAAK,CAAC,CAAC;oBACrC,MAAM,KAAK,GAAG,MAAM,QAAQ,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;oBACvC,MAAM,UAAU,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,EAAE,CAC/B,KAAK,CAAC,UAAU,CAAC,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CACrC,CAAC;oBACF,OAAO,KAAK,CAAC,MAAM,CAAC;gBACtB,CAAC;gBAED,KAAK,CAAC,OAAO,CAAI,EACf,KAAK,EACL,KAAK,GAIN;oBACC,MAAM,CAAC,GAAG,mBAAmB,CAAC,KAAK,CAAC,CAAC;oBACrC,MAAM,CAAC,KAAK,CAAC,GAAG,MAAM,QAAQ,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;oBACzC,OAAO,CAAC,KAAK,IAAI,IAAI,CAAa,CAAC;gBACrC,CAAC;gBAED,KAAK,CAAC,QAAQ,CAAI,EAChB,KAAK,EACL,KAAK,EACL,KAAK,EACL,MAAM,EACN,MAAM,GAOP;oBACC,MAAM,CAAC,GAAG,mBAAmB,CAAC,KAAK,CAAC,CAAC;oBACrC,MAAM,KAAK,GAAG,WAAW,CACvB,SAAS,CAAC,MAAM,QAAQ,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,MAAM,CAAC,EAC3C,MAAM,EACN,KAAK,CACN,CAAC;oBACF,OAAO,KAAY,CAAC;gBACtB,CAAC;gBAED,KAAK,CAAC,KAAK,CAAC,EACV,KAAK,EACL,KAAK,GAIN;oBACC,MAAM,CAAC,GAAG,mBAAmB,CAAC,KAAK,CAAC,CAAC;oBACrC,MAAM,OAAO,GAAG,KAAK,IAAI,EAAE,CAAC;oBAC5B,MAAM,IAAI,GAAG,SAAS,CAAC,CAAC,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC;oBAC7C,sEAAsE;oBACtE,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;wBAC9C,MAAM,IAAI,GAAG,MAAM,KAAK,CAAC,KAAK,CAC5B,IAAI,CAAC,IAAI,KAAK,OAAO;4BACnB,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,GAAG,EAAE,IAAI,CAAC,GAAG,EAAE;4BAChD,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CACjB,CAAC;wBACF,IAAI,IAAI,IAAI,IAAI;4BAAE,OAAO,IAAI,CAAC;oBAChC,CAAC;oBACD,OAAO,CAAC,MAAM,QAAQ,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC;gBAC7C,CAAC;gBAED,GAAG,CAAC,KAAK,CAAC,YAAY;oBACpB,CAAC,CAAC;wBACE,YAAY,EAAE,CAAC,KAAyC,EAAE,EAAE,CAC1D,KAAK,CAAC,YAAa,CAAC,KAAK,CAAC;qBAC7B;oBACH,CAAC,CAAC,EAAE,CAAC;aACR,CAAC;QACJ,CAAC;KACF,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,iFAAiF;AACjF,KAAK,UAAU,UAAU,CACvB,KAAU,EACV,EAAiC,EACjC,SAAS,GAAG,EAAE;IAEd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,IAAI,SAAS,EAAE,CAAC;QACjD,MAAM,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IAC3D,CAAC;AACH,CAAC"}

package/dist/index-map.d.ts

@@ -0,0 +1,33 @@
+/**
+ * Declarative description of a DynamoDB access pattern (one logical index).
+ *
+ * The adapter never deals in physical `PK`/`SK` strings — it only knows the
+ * *logical* index name and which fields form its partition/sort key. Each store
+ * implementation is responsible for translating a logical index + field values
+ * into a concrete DynamoDB query. This is what lets the exact same generic core
+ * drive both the built-in single-table store and a bring-your-own store (e.g.
+ * one backed by ElectroDB) without either leaking its key encoding upward.
+ */
+export interface AccessPattern {
+    /** Logical index name both the planner and the store agree on (e.g. `"byEmail"`). */
+    index: string;
+    /**
+     * Fields that make up the partition key. Every one of these MUST be present as
+     * an equality (`eq`) clause in a `where` for this pattern to be selected.
+     */
+    pk: string[];
+    /**
+     * Ordered fields that make up the sort key. Optional and prefix-satisfiable:
+     * the planner attaches as many leading `sk` fields as the `where` provides
+     * (as `eq` clauses), and leaves the rest to residual in-memory filtering.
+     */
+    sk?: string[];
+}
+/** Ordered list of access patterns for a single model, most specific first. */
+export type ModelIndexMap = AccessPattern[];
+/**
+ * Map of model name -> its access patterns. The planner walks a model's
+ * patterns in order and picks the first whose `pk` fields are all present.
+ */
+export type IndexMap = Record<string, ModelIndexMap>;
+//# sourceMappingURL=index-map.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index-map.d.ts","sourceRoot":"","sources":["../src/index-map.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AACH,MAAM,WAAW,aAAa;IAC5B,qFAAqF;IACrF,KAAK,EAAE,MAAM,CAAC;IACd;;;OAGG;IACH,EAAE,EAAE,MAAM,EAAE,CAAC;IACb;;;;OAIG;IACH,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC;CACf;AAED,+EAA+E;AAC/E,MAAM,MAAM,aAAa,GAAG,aAAa,EAAE,CAAC;AAE5C;;;GAGG;AACH,MAAM,MAAM,QAAQ,GAAG,MAAM,CAAC,MAAM,EAAE,aAAa,CAAC,CAAC"}

package/dist/index-map.js

@@ -0,0 +1 @@
+//# sourceMappingURL=index-map.js.map

package/dist/index-map.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index-map.js","sourceRoot":"","sources":["../src/index-map.ts"],"names":[],"mappings":""}

package/dist/index.d.ts

@@ -0,0 +1,18 @@
+/**
+ * @datar-platform/better-auth-dynamodb
+ *
+ * A generic DynamoDB adapter for Better Auth. Use the built-in single-table
+ * store, or bring your own by implementing {@link DynamoStore}.
+ */
+export { dynamoAdapter } from "./adapter.js";
+export type { DynamoAdapterConfig, DynamoStore, QueryPage, StoreItem, } from "./types.js";
+export type { AccessPattern, IndexMap, ModelIndexMap } from "./index-map.js";
+export type { QueryPlan } from "./planner.js";
+export { planQuery } from "./planner.js";
+export { matchesResidual } from "./pagination.js";
+export { createSingleTableStore } from "./stores/default/single-table-store.js";
+export type { SingleTableStoreOptions } from "./stores/default/single-table-store.js";
+export { deriveIndexMap } from "./stores/default/derive-index-map.js";
+export { buildTableDefinition, ensureSchema, generateSchemaFile, } from "./stores/default/schema.js";
+export { assignSlots } from "./stores/default/key-codec.js";
+//# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,OAAO,EAAE,aAAa,EAAE,MAAM,cAAc,CAAC;AAE7C,YAAY,EACV,mBAAmB,EACnB,WAAW,EACX,SAAS,EACT,SAAS,GACV,MAAM,YAAY,CAAC;AACpB,YAAY,EAAE,aAAa,EAAE,QAAQ,EAAE,aAAa,EAAE,MAAM,gBAAgB,CAAC;AAC7E,YAAY,EAAE,SAAS,EAAE,MAAM,cAAc,CAAC;AAC9C,OAAO,EAAE,SAAS,EAAE,MAAM,cAAc,CAAC;AACzC,OAAO,EAAE,eAAe,EAAE,MAAM,iBAAiB,CAAC;AAGlD,OAAO,EAAE,sBAAsB,EAAE,MAAM,wCAAwC,CAAC;AAChF,YAAY,EAAE,uBAAuB,EAAE,MAAM,wCAAwC,CAAC;AACtF,OAAO,EAAE,cAAc,EAAE,MAAM,sCAAsC,CAAC;AACtE,OAAO,EACL,oBAAoB,EACpB,YAAY,EACZ,kBAAkB,GACnB,MAAM,4BAA4B,CAAC;AACpC,OAAO,EAAE,WAAW,EAAE,MAAM,+BAA+B,CAAC"}

package/dist/index.js

@@ -0,0 +1,15 @@
+/**
+ * @datar-platform/better-auth-dynamodb
+ *
+ * A generic DynamoDB adapter for Better Auth. Use the built-in single-table
+ * store, or bring your own by implementing {@link DynamoStore}.
+ */
+export { dynamoAdapter } from "./adapter.js";
+export { planQuery } from "./planner.js";
+export { matchesResidual } from "./pagination.js";
+// Built-in single-table store (opt-in for advanced wiring / tests).
+export { createSingleTableStore } from "./stores/default/single-table-store.js";
+export { deriveIndexMap } from "./stores/default/derive-index-map.js";
+export { buildTableDefinition, ensureSchema, generateSchemaFile, } from "./stores/default/schema.js";
+export { assignSlots } from "./stores/default/key-codec.js";
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,OAAO,EAAE,aAAa,EAAE,MAAM,cAAc,CAAC;AAU7C,OAAO,EAAE,SAAS,EAAE,MAAM,cAAc,CAAC;AACzC,OAAO,EAAE,eAAe,EAAE,MAAM,iBAAiB,CAAC;AAElD,oEAAoE;AACpE,OAAO,EAAE,sBAAsB,EAAE,MAAM,wCAAwC,CAAC;AAEhF,OAAO,EAAE,cAAc,EAAE,MAAM,sCAAsC,CAAC;AACtE,OAAO,EACL,oBAAoB,EACpB,YAAY,EACZ,kBAAkB,GACnB,MAAM,4BAA4B,CAAC;AACpC,OAAO,EAAE,WAAW,EAAE,MAAM,+BAA+B,CAAC"}

package/dist/pagination.d.ts

@@ -0,0 +1,25 @@
+import type { CleanedWhere } from "@better-auth/core/db/adapter";
+import type { QueryPage, StoreItem } from "./types.js";
+/**
+ * Drain every page of a paginated store query into a single array.
+ *
+ * DynamoDB paginates at 1 MB / index-page boundaries regardless of match count,
+ * so a single `.query()` can silently return a partial result. Draining here —
+ * rather than trusting one page — is what makes `findMany`/`count` correct
+ * (and removes the old adapter's implicit 10 000-row cap).
+ */
+export declare function drainPages(fetch: (cursor: unknown) => Promise<QueryPage>): Promise<StoreItem[]>;
+/**
+ * Apply the residual `where` clauses in memory, honoring Better Auth's
+ * connector semantics: all `AND` clauses must match, and — if any `OR` clauses
+ * are present — at least one of them must also match. An empty residual passes.
+ */
+export declare function matchesResidual(item: StoreItem, residual: CleanedWhere[]): boolean;
+/** Stable in-memory sort matching Better Auth's `sortBy` contract. */
+export declare function applySort(items: StoreItem[], sortBy?: {
+    field: string;
+    direction: "asc" | "desc";
+}): StoreItem[];
+/** Apply `offset`/`limit` (a `limit` of 0 or undefined means "no cap"). */
+export declare function applyWindow(items: StoreItem[], offset?: number, limit?: number): StoreItem[];
+//# sourceMappingURL=pagination.d.ts.map

package/dist/pagination.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"pagination.d.ts","sourceRoot":"","sources":["../src/pagination.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,8BAA8B,CAAC;AAEjE,OAAO,KAAK,EAAE,SAAS,EAAE,SAAS,EAAE,MAAM,YAAY,CAAC;AAEvD;;;;;;;GAOG;AACH,wBAAsB,UAAU,CAC9B,KAAK,EAAE,CAAC,MAAM,EAAE,OAAO,KAAK,OAAO,CAAC,SAAS,CAAC,GAC7C,OAAO,CAAC,SAAS,EAAE,CAAC,CAStB;AAiCD;;;;GAIG;AACH,wBAAgB,eAAe,CAC7B,IAAI,EAAE,SAAS,EACf,QAAQ,EAAE,YAAY,EAAE,GACvB,OAAO,CAQT;AAED,sEAAsE;AACtE,wBAAgB,SAAS,CACvB,KAAK,EAAE,SAAS,EAAE,EAClB,MAAM,CAAC,EAAE;IAAE,KAAK,EAAE,MAAM,CAAC;IAAC,SAAS,EAAE,KAAK,GAAG,MAAM,CAAA;CAAE,GACpD,SAAS,EAAE,CASb;AAED,2EAA2E;AAC3E,wBAAgB,WAAW,CACzB,KAAK,EAAE,SAAS,EAAE,EAClB,MAAM,CAAC,EAAE,MAAM,EACf,KAAK,CAAC,EAAE,MAAM,GACb,SAAS,EAAE,CAKb"}

package/dist/pagination.js

@@ -0,0 +1,86 @@
+/**
+ * Drain every page of a paginated store query into a single array.
+ *
+ * DynamoDB paginates at 1 MB / index-page boundaries regardless of match count,
+ * so a single `.query()` can silently return a partial result. Draining here —
+ * rather than trusting one page — is what makes `findMany`/`count` correct
+ * (and removes the old adapter's implicit 10 000-row cap).
+ */
+export async function drainPages(fetch) {
+    const out = [];
+    let cursor = undefined;
+    do {
+        const page = await fetch(cursor);
+        out.push(...page.items);
+        cursor = page.cursor;
+    } while (cursor);
+    return out;
+}
+function matchOne(item, w) {
+    const actual = item[w.field];
+    const expected = w.value;
+    switch (w.operator) {
+        case "eq":
+            return actual === expected;
+        case "ne":
+            return actual !== expected;
+        case "lt":
+            return actual < expected;
+        case "lte":
+            return actual <= expected;
+        case "gt":
+            return actual > expected;
+        case "gte":
+            return actual >= expected;
+        case "in":
+            return Array.isArray(expected) && expected.includes(actual);
+        case "not_in":
+            return Array.isArray(expected) && !expected.includes(actual);
+        case "contains":
+            return String(actual).includes(String(expected));
+        case "starts_with":
+            return String(actual).startsWith(String(expected));
+        case "ends_with":
+            return String(actual).endsWith(String(expected));
+        default:
+            return actual === expected;
+    }
+}
+/**
+ * Apply the residual `where` clauses in memory, honoring Better Auth's
+ * connector semantics: all `AND` clauses must match, and — if any `OR` clauses
+ * are present — at least one of them must also match. An empty residual passes.
+ */
+export function matchesResidual(item, residual) {
+    const andOk = residual
+        .filter((w) => w.connector !== "OR")
+        .every((w) => matchOne(item, w));
+    if (!andOk)
+        return false;
+    const or = residual.filter((w) => w.connector === "OR");
+    return or.length === 0 || or.some((w) => matchOne(item, w));
+}
+/** Stable in-memory sort matching Better Auth's `sortBy` contract. */
+export function applySort(items, sortBy) {
+    if (!sortBy)
+        return items;
+    const { field, direction } = sortBy;
+    const dir = direction === "asc" ? 1 : -1;
+    return [...items].sort((a, b) => {
+        if (a[field] < b[field])
+            return -dir;
+        if (a[field] > b[field])
+            return dir;
+        return 0;
+    });
+}
+/** Apply `offset`/`limit` (a `limit` of 0 or undefined means "no cap"). */
+export function applyWindow(items, offset, limit) {
+    let out = items;
+    if (offset && offset > 0)
+        out = out.slice(offset);
+    if (limit && limit > 0)
+        out = out.slice(0, limit);
+    return out;
+}
+//# sourceMappingURL=pagination.js.map

package/dist/pagination.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"pagination.js","sourceRoot":"","sources":["../src/pagination.ts"],"names":[],"mappings":"AAIA;;;;;;;GAOG;AACH,MAAM,CAAC,KAAK,UAAU,UAAU,CAC9B,KAA8C;IAE9C,MAAM,GAAG,GAAgB,EAAE,CAAC;IAC5B,IAAI,MAAM,GAAY,SAAS,CAAC;IAChC,GAAG,CAAC;QACF,MAAM,IAAI,GAAG,MAAM,KAAK,CAAC,MAAM,CAAC,CAAC;QACjC,GAAG,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;QACxB,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;IACvB,CAAC,QAAQ,MAAM,EAAE;IACjB,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,QAAQ,CAAC,IAAe,EAAE,CAAe;IAChD,MAAM,MAAM,GAAG,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;IAC7B,MAAM,QAAQ,GAAG,CAAC,CAAC,KAAK,CAAC;IACzB,QAAQ,CAAC,CAAC,QAAQ,EAAE,CAAC;QACnB,KAAK,IAAI;YACP,OAAO,MAAM,KAAK,QAAQ,CAAC;QAC7B,KAAK,IAAI;YACP,OAAO,MAAM,KAAK,QAAQ,CAAC;QAC7B,KAAK,IAAI;YACP,OAAO,MAAM,GAAI,QAAgB,CAAC;QACpC,KAAK,KAAK;YACR,OAAO,MAAM,IAAK,QAAgB,CAAC;QACrC,KAAK,IAAI;YACP,OAAO,MAAM,GAAI,QAAgB,CAAC;QACpC,KAAK,KAAK;YACR,OAAO,MAAM,IAAK,QAAgB,CAAC;QACrC,KAAK,IAAI;YACP,OAAO,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAK,QAAkB,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QACzE,KAAK,QAAQ;YACX,OAAO,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAE,QAAkB,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QAC1E,KAAK,UAAU;YACb,OAAO,MAAM,CAAC,MAAM,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;QACnD,KAAK,aAAa;YAChB,OAAO,MAAM,CAAC,MAAM,CAAC,CAAC,UAAU,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;QACrD,KAAK,WAAW;YACd,OAAO,MAAM,CAAC,MAAM,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;QACnD;YACE,OAAO,MAAM,KAAK,QAAQ,CAAC;IAC/B,CAAC;AACH,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,eAAe,CAC7B,IAAe,EACf,QAAwB;IAExB,MAAM,KAAK,GAAG,QAAQ;SACnB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,KAAK,IAAI,CAAC;SACnC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;IACnC,IAAI,CAAC,KAAK;QAAE,OAAO,KAAK,CAAC;IAEzB,MAAM,EAAE,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,KAAK,IAAI,CAAC,CAAC;IACxD,OAAO,EAAE,CAAC,MAAM,KAAK,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;AAC9D,CAAC;AAED,sEAAsE;AACtE,MAAM,UAAU,SAAS,CACvB,KAAkB,EAClB,MAAqD;IAErD,IAAI,CAAC,MAAM;QAAE,OAAO,KAAK,CAAC;IAC1B,MAAM,EAAE,KAAK,EAAE,SAAS,EAAE,GAAG,MAAM,CAAC;IACpC,MAAM,GAAG,GAAG,SAAS,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzC,OAAO,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QAC9B,IAAI,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC;YAAE,OAAO,CAAC,GAAG,CAAC;QACrC,IAAI,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC;YAAE,OAAO,GAAG,CAAC;QACpC,OAAO,CAAC,CAAC;IACX,CAAC,CAAC,CAAC;AACL,CAAC;AAED,2EAA2E;AAC3E,MAAM,UAAU,WAAW,CACzB,KAAkB,EAClB,MAAe,EACf,KAAc;IAEd,IAAI,GAAG,GAAG,KAAK,CAAC;IAChB,IAAI,MAAM,IAAI,MAAM,GAAG,CAAC;QAAE,GAAG,GAAG,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IAClD,IAAI,KAAK,IAAI,KAAK,GAAG,CAAC;QAAE,GAAG,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IAClD,OAAO,GAAG,CAAC;AACb,CAAC"}

package/dist/planner.d.ts

@@ -0,0 +1,36 @@
+import type { CleanedWhere } from "@better-auth/core/db/adapter";
+import type { IndexMap } from "./index-map.js";
+import type { StoreItem } from "./types.js";
+/**
+ * A resolved query plan: how the adapter will fetch candidate rows for a
+ * `where` clause before applying any residual (in-memory) filtering.
+ *
+ * - `byId`      — a direct primary-key get (the cheapest path).
+ * - `index`     — a logical index query with a resolved partition/sort key.
+ * - `listByType`— no index matched; list all rows of the model and filter.
+ *
+ * `residual` holds the `where` clauses NOT satisfied by the chosen access path;
+ * they are applied in memory by {@link matchesResidual}.
+ */
+export type QueryPlan = {
+    kind: "byId";
+    id: string;
+    residual: CleanedWhere[];
+} | {
+    kind: "index";
+    index: string;
+    key: StoreItem;
+    residual: CleanedWhere[];
+} | {
+    kind: "listByType";
+    residual: CleanedWhere[];
+};
+/**
+ * Choose the most selective access path for `where` against a model's declared
+ * access patterns. Falls back to `listByType` when nothing matches.
+ *
+ * Index selection only ever consumes `eq`/`AND` clauses; everything else (and
+ * any `eq` clause not part of the chosen key) becomes residual.
+ */
+export declare function planQuery(model: string, where: CleanedWhere[], indexMap: IndexMap): QueryPlan;
+//# sourceMappingURL=planner.d.ts.map

package/dist/planner.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"planner.d.ts","sourceRoot":"","sources":["../src/planner.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,8BAA8B,CAAC;AAEjE,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAC/C,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,YAAY,CAAC;AAE5C;;;;;;;;;;GAUG;AACH,MAAM,MAAM,SAAS,GACjB;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,EAAE,EAAE,MAAM,CAAC;IAAC,QAAQ,EAAE,YAAY,EAAE,CAAA;CAAE,GACtD;IAAE,IAAI,EAAE,OAAO,CAAC;IAAC,KAAK,EAAE,MAAM,CAAC;IAAC,GAAG,EAAE,SAAS,CAAC;IAAC,QAAQ,EAAE,YAAY,EAAE,CAAA;CAAE,GAC1E;IAAE,IAAI,EAAE,YAAY,CAAC;IAAC,QAAQ,EAAE,YAAY,EAAE,CAAA;CAAE,CAAC;AAOrD;;;;;;GAMG;AACH,wBAAgB,SAAS,CACvB,KAAK,EAAE,MAAM,EACb,KAAK,EAAE,YAAY,EAAE,EACrB,QAAQ,EAAE,QAAQ,GACjB,SAAS,CA4CX"}