@vielzeug/vault 2.3.1 → 2.5.0

package/dist/indexeddb.d.ts

@@ -1,4 +1,4 @@
-export type { IndexedDbVaultStore, MigrationContext, MigrationFn, MigrationStep, } from './adapters/indexeddb';
+export type { MigrationContext, MigrationFn, MigrationStep } from './adapters/indexeddb';
 export { createIndexedDB, defineMigration } from './adapters/indexeddb';
 export type { TransactionContext } from './types';
 //# sourceMappingURL=indexeddb.d.ts.map

package/dist/indexeddb.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"indexeddb.d.ts","sourceRoot":"","sources":["../src/indexeddb.ts"],"names":[],"mappings":"AAAA,YAAY,EACV,mBAAmB,EACnB,gBAAgB,EAChB,WAAW,EACX,aAAa,GACd,MAAM,sBAAsB,CAAC;AAC9B,OAAO,EAAE,eAAe,EAAE,eAAe,EAAE,MAAM,sBAAsB,CAAC;AACxE,YAAY,EAAE,kBAAkB,EAAE,MAAM,SAAS,CAAC"}
+{"version":3,"file":"indexeddb.d.ts","sourceRoot":"","sources":["../src/indexeddb.ts"],"names":[],"mappings":"AAAA,YAAY,EAAE,gBAAgB,EAAE,WAAW,EAAE,aAAa,EAAE,MAAM,sBAAsB,CAAC;AACzF,OAAO,EAAE,eAAe,EAAE,eAAe,EAAE,MAAM,sBAAsB,CAAC;AACxE,YAAY,EAAE,kBAAkB,EAAE,MAAM,SAAS,CAAC"}

package/dist/internal.cjs

@@ -1,2 +1,2 @@
-const e=require("./errors.cjs");require("./_dev.cjs");var t=`\0`;function n(t){if(typeof t==`number`){if(!Number.isFinite(t))throw new e.VaultError(`primary key must be a finite number, received ${String(t)}`);return`n:${String(t)}`}return`s:${encodeURIComponent(t)}`}function r(e){return`${encodeURIComponent(e)}${t}`}function i(e,r,i){return`${encodeURIComponent(e)}${t}${encodeURIComponent(r)}${t}${n(i)}`}function a(e,n){return`${encodeURIComponent(e)}${t}${encodeURIComponent(n)}${t}`}function o(e,n){if(!n)return;let i=r(e);if(!n.startsWith(i))return;let a=n.slice(i.length),o=a.indexOf(t);if(o!==-1)try{return decodeURIComponent(a.slice(0,o))}catch{return}}function s(t,n){let r=new Map,i=!1,a=e=>{n&&n(e)},o=e=>{if(i)return;let n=r.get(e);!n||n.size===0||t(e).then(t=>{if(i)return;let n=r.get(e);if(!(!n||n.size===0))for(let e of n)try{e(t)}catch(e){a(e)}}).catch(a)};return{dispose:()=>{i=!0,r.clear()},notify:o,observe:(t,n,{immediate:a=!0,signal:s}={})=>{if(i)throw new e.VaultDisposedError(`observer hub is disposed`);if(s?.aborted)return()=>{};let c=n,l=r.get(t)??new Set;r.set(t,l),l.add(c),a&&o(t);let u=()=>{let e=r.get(t);e&&(e.delete(c),e.size===0&&r.delete(t))};return s?.addEventListener(`abort`,u,{once:!0}),u}}}function c(t,n,r){let i=String(t[n].key),a=r[i];if(typeof a!=`number`&&typeof a!=`string`)throw new e.VaultError(`record in table "${String(n)}" must have a string or finite-number key at "${i}"`);if(typeof a==`number`&&!Number.isFinite(a))throw new e.VaultError(`record in table "${String(n)}" must have a finite-number key at "${i}"`);return a}exports.createObserverHub=s,exports.decodeStorageTableFromKey=o,exports.encodeDbPrefix=r,exports.encodeStorageKey=i,exports.encodeStorageTablePrefix=a,exports.encodeVaultKey=n,exports.getRecordKey=c;
+const e=require("./errors.cjs");var t=`\0`;function n(t){if(typeof t==`number`){if(!Number.isFinite(t))throw new e.VaultError(`primary key must be a finite number, received ${String(t)}`);return`n:${String(t)}`}return`s:${encodeURIComponent(t)}`}function r(e){return`${encodeURIComponent(e)}${t}`}function i(e,r,i){return`${encodeURIComponent(e)}${t}${encodeURIComponent(r)}${t}${n(i)}`}function a(e,n){return`${encodeURIComponent(e)}${t}${encodeURIComponent(n)}${t}`}function o(e,n){if(!n)return;let i=r(e);if(!n.startsWith(i))return;let a=n.slice(i.length),o=a.indexOf(t);if(o!==-1)try{return decodeURIComponent(a.slice(0,o))}catch{return}}function s(t){let n=new Map,r=!1,i=e=>{if(r)return;let i=n.get(e);!i||i.size===0||t(e).then(t=>{if(r)return;let i=n.get(e);if(!(!i||i.size===0))for(let e of i)try{e(t)}catch{}}).catch(()=>{})};return{dispose:()=>{r=!0,n.clear()},notify:i,observe:(t,a,{immediate:o=!0,signal:s}={})=>{if(r)throw new e.VaultDisposedError(`observer hub is disposed`);if(s?.aborted)return()=>{};let c=a,l=n.get(t)??new Set;n.set(t,l),l.add(c),o&&i(t);let u=()=>{let e=n.get(t);e&&(e.delete(c),e.size===0&&n.delete(t))};return s?.addEventListener(`abort`,u,{once:!0}),u}}}function c(t,n,r){let i=String(t[n].key),a=r[i];if(typeof a!=`number`&&typeof a!=`string`)throw new e.VaultError(`record in table "${String(n)}" must have a string or finite-number key at "${i}"`);if(typeof a==`number`&&!Number.isFinite(a))throw new e.VaultError(`record in table "${String(n)}" must have a finite-number key at "${i}"`);return a}exports.createObserverHub=s,exports.decodeStorageTableFromKey=o,exports.encodeDbPrefix=r,exports.encodeStorageKey=i,exports.encodeStorageTablePrefix=a,exports.encodeVaultKey=n,exports.getRecordKey=c;
 //# sourceMappingURL=internal.cjs.map

package/dist/internal.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"internal.cjs","names":[],"sources":["../src/internal.ts"],"sourcesContent":["import { error as logError } from './_dev';\nimport { VaultDisposedError, VaultError } from './errors';\nimport type { AnySchema, KeyOf, RecordOf, VaultKey } from './types';\n\ntype ObserverListener<T> = (records: T[]) => void;\n\nconst SEP = '\\x00';\n\n/**\n * Type-tagged keys make `1` and `'1'` distinct in string-keyed adapters while\n * keeping the same portable primary-key contract as IndexedDB.\n */\nexport function encodeVaultKey(key: VaultKey): string {\n  if (typeof key === 'number') {\n    if (!Number.isFinite(key)) throw new VaultError(`primary key must be a finite number, received ${String(key)}`);\n\n    return `n:${String(key)}`;\n  }\n\n  return `s:${encodeURIComponent(key)}`;\n}\n\nexport function encodeDbPrefix(dbName: string): string {\n  return `${encodeURIComponent(dbName)}${SEP}`;\n}\n\nexport function encodeStorageKey(dbName: string, table: string, key: VaultKey): string {\n  return `${encodeURIComponent(dbName)}${SEP}${encodeURIComponent(table)}${SEP}${encodeVaultKey(key)}`;\n}\n\nexport function encodeStorageTablePrefix(dbName: string, table: string): string {\n  return `${encodeURIComponent(dbName)}${SEP}${encodeURIComponent(table)}${SEP}`;\n}\n\nexport function decodeStorageTableFromKey(dbName: string, storageKey: string | null): string | undefined {\n  if (!storageKey) return undefined;\n\n  const prefix = encodeDbPrefix(dbName);\n\n  if (!storageKey.startsWith(prefix)) return undefined;\n\n  const tail = storageKey.slice(prefix.length);\n  const end = tail.indexOf(SEP);\n\n  if (end === -1) return undefined;\n\n  try {\n    return decodeURIComponent(tail.slice(0, end));\n  } catch {\n    return undefined;\n  }\n}\n\n/** `observe()` is Vault's single reactivity primitive: a snapshot now, then on mutations. */\nexport function createObserverHub<S extends AnySchema>(\n  getAll: <K extends keyof S & string>(table: K) => Promise<RecordOf<S, K>[]>,\n  onError?: (error: unknown) => void,\n) {\n  const observers = new Map<string, Set<ObserverListener<unknown>>>();\n  let disposed = false;\n\n  const reportObserverError = (error: unknown): void => {\n    if (onError) onError(error);\n    else logError('observer notification failed', error);\n  };\n\n  const notify = <K extends keyof S & string>(table: K): void => {\n    if (disposed) return;\n\n    const listeners = observers.get(table);\n\n    if (!listeners || listeners.size === 0) return;\n\n    void getAll(table)\n      .then((records) => {\n        if (disposed) return;\n\n        const current = observers.get(table);\n\n        if (!current || current.size === 0) return;\n\n        for (const listener of current) {\n          try {\n            listener(records as unknown[]);\n          } catch (error) {\n            reportObserverError(error);\n          }\n        }\n      })\n      .catch(reportObserverError);\n  };\n\n  const observe = <K extends keyof S & string>(\n    table: K,\n    listener: (records: RecordOf<S, K>[]) => void,\n    { immediate = true, signal }: { immediate?: boolean; signal?: AbortSignal } = {},\n  ): (() => void) => {\n    if (disposed) throw new VaultDisposedError('observer hub is disposed');\n\n    if (signal?.aborted) return () => {};\n\n    const wrapped = listener as ObserverListener<unknown>;\n    const listeners = observers.get(table) ?? new Set<ObserverListener<unknown>>();\n\n    observers.set(table, listeners);\n    listeners.add(wrapped);\n\n    if (immediate) notify(table);\n\n    const stop = (): void => {\n      const current = observers.get(table);\n\n      if (!current) return;\n\n      current.delete(wrapped);\n\n      if (current.size === 0) observers.delete(table);\n    };\n\n    signal?.addEventListener('abort', stop, { once: true });\n\n    return stop;\n  };\n\n  return {\n    dispose: () => {\n      disposed = true;\n      observers.clear();\n    },\n    notify,\n    observe,\n  };\n}\n\nexport function getRecordKey<S extends AnySchema, K extends keyof S>(\n  schema: S,\n  table: K,\n  value: RecordOf<S, K>,\n): KeyOf<S, K> {\n  const keyField = String(schema[table].key);\n  const keyValue = (value as Record<string, unknown>)[keyField];\n\n  if (typeof keyValue !== 'number' && typeof keyValue !== 'string') {\n    throw new VaultError(`record in table \"${String(table)}\" must have a string or finite-number key at \"${keyField}\"`);\n  }\n\n  if (typeof keyValue === 'number' && !Number.isFinite(keyValue)) {\n    throw new VaultError(`record in table \"${String(table)}\" must have a finite-number key at \"${keyField}\"`);\n  }\n\n  return keyValue as KeyOf<S, K>;\n}\n"],"mappings":"sDAMA,IAAM,EAAM,KAMZ,SAAgB,EAAe,EAAuB,CACpD,GAAI,OAAO,GAAQ,SAAU,CAC3B,GAAI,CAAC,OAAO,SAAS,CAAG,EAAG,MAAM,IAAI,EAAA,WAAW,iDAAiD,OAAO,CAAG,GAAG,EAE9G,MAAO,KAAK,OAAO,CAAG,GACxB,CAEA,MAAO,KAAK,mBAAmB,CAAG,GACpC,CAEA,SAAgB,EAAe,EAAwB,CACrD,MAAO,GAAG,mBAAmB,CAAM,IAAI,GACzC,CAEA,SAAgB,EAAiB,EAAgB,EAAe,EAAuB,CACrF,MAAO,GAAG,mBAAmB,CAAM,IAAI,IAAM,mBAAmB,CAAK,IAAI,IAAM,EAAe,CAAG,GACnG,CAEA,SAAgB,EAAyB,EAAgB,EAAuB,CAC9E,MAAO,GAAG,mBAAmB,CAAM,IAAI,IAAM,mBAAmB,CAAK,IAAI,GAC3E,CAEA,SAAgB,EAA0B,EAAgB,EAA+C,CACvG,GAAI,CAAC,EAAY,OAEjB,IAAM,EAAS,EAAe,CAAM,EAEpC,GAAI,CAAC,EAAW,WAAW,CAAM,EAAG,OAEpC,IAAM,EAAO,EAAW,MAAM,EAAO,MAAM,EACrC,EAAM,EAAK,QAAQ,CAAG,EAExB,OAAQ,GAEZ,GAAI,CACF,OAAO,mBAAmB,EAAK,MAAM,EAAG,CAAG,CAAC,CAC9C,MAAQ,CACN,MACF,CACF,CAGA,SAAgB,EACd,EACA,EACA,CACA,IAAM,EAAY,IAAI,IAClB,EAAW,GAET,EAAuB,GAAyB,CAChD,GAAS,EAAQ,CAAK,CAE5B,EAEM,EAAsC,GAAmB,CAC7D,GAAI,EAAU,OAEd,IAAM,EAAY,EAAU,IAAI,CAAK,EAEjC,CAAC,GAAa,EAAU,OAAS,GAErC,EAAY,CAAK,CAAC,CACf,KAAM,GAAY,CACjB,GAAI,EAAU,OAEd,IAAM,EAAU,EAAU,IAAI,CAAK,EAE/B,MAAC,GAAW,EAAQ,OAAS,GAEjC,IAAK,IAAM,KAAY,EACrB,GAAI,CACF,EAAS,CAAoB,CAC/B,OAAS,EAAO,CACd,EAAoB,CAAK,CAC3B,CAEJ,CAAC,CAAC,CACD,MAAM,CAAmB,CAC9B,EAkCA,MAAO,CACL,YAAe,CACb,EAAW,GACX,EAAU,MAAM,CAClB,EACA,SACA,SArCA,EACA,EACA,CAAE,YAAY,GAAM,UAA0D,CAAC,IAC9D,CACjB,GAAI,EAAU,MAAM,IAAI,EAAA,mBAAmB,0BAA0B,EAErE,GAAI,GAAQ,QAAS,UAAa,CAAC,EAEnC,IAAM,EAAU,EACV,EAAY,EAAU,IAAI,CAAK,GAAK,IAAI,IAE9C,EAAU,IAAI,EAAO,CAAS,EAC9B,EAAU,IAAI,CAAO,EAEjB,GAAW,EAAO,CAAK,EAE3B,IAAM,MAAmB,CACvB,IAAM,EAAU,EAAU,IAAI,CAAK,EAE9B,IAEL,EAAQ,OAAO,CAAO,EAElB,EAAQ,OAAS,GAAG,EAAU,OAAO,CAAK,EAChD,EAIA,OAFA,GAAQ,iBAAiB,QAAS,EAAM,CAAE,KAAM,EAAK,CAAC,EAE/C,CACT,CASA,CACF,CAEA,SAAgB,EACd,EACA,EACA,EACa,CACb,IAAM,EAAW,OAAO,EAAO,EAAM,CAAC,GAAG,EACnC,EAAY,EAAkC,GAEpD,GAAI,OAAO,GAAa,UAAY,OAAO,GAAa,SACtD,MAAM,IAAI,EAAA,WAAW,oBAAoB,OAAO,CAAK,EAAE,gDAAgD,EAAS,EAAE,EAGpH,GAAI,OAAO,GAAa,UAAY,CAAC,OAAO,SAAS,CAAQ,EAC3D,MAAM,IAAI,EAAA,WAAW,oBAAoB,OAAO,CAAK,EAAE,sCAAsC,EAAS,EAAE,EAG1G,OAAO,CACT"}
+{"version":3,"file":"internal.cjs","names":[],"sources":["../src/internal.ts"],"sourcesContent":["import { VaultDisposedError, VaultError } from './errors';\nimport type { AnySchema, KeyOf, RecordOf, VaultKey } from './types';\n\ntype ObserverListener<T> = (records: T[]) => void;\n\nconst SEP = '\\x00';\n\n/**\n * Type-tagged keys make `1` and `'1'` distinct in string-keyed adapters while\n * keeping the same portable primary-key contract as IndexedDB.\n */\nexport function encodeVaultKey(key: VaultKey): string {\n  if (typeof key === 'number') {\n    if (!Number.isFinite(key)) throw new VaultError(`primary key must be a finite number, received ${String(key)}`);\n\n    return `n:${String(key)}`;\n  }\n\n  return `s:${encodeURIComponent(key)}`;\n}\n\nexport function encodeDbPrefix(dbName: string): string {\n  return `${encodeURIComponent(dbName)}${SEP}`;\n}\n\nexport function encodeStorageKey(dbName: string, table: string, key: VaultKey): string {\n  return `${encodeURIComponent(dbName)}${SEP}${encodeURIComponent(table)}${SEP}${encodeVaultKey(key)}`;\n}\n\nexport function encodeStorageTablePrefix(dbName: string, table: string): string {\n  return `${encodeURIComponent(dbName)}${SEP}${encodeURIComponent(table)}${SEP}`;\n}\n\nexport function decodeStorageTableFromKey(dbName: string, storageKey: string | null): string | undefined {\n  if (!storageKey) return undefined;\n\n  const prefix = encodeDbPrefix(dbName);\n\n  if (!storageKey.startsWith(prefix)) return undefined;\n\n  const tail = storageKey.slice(prefix.length);\n  const end = tail.indexOf(SEP);\n\n  if (end === -1) return undefined;\n\n  try {\n    return decodeURIComponent(tail.slice(0, end));\n  } catch {\n    return undefined;\n  }\n}\n\n/** `observe()` is Vault's single reactivity primitive: a snapshot now, then on mutations. */\nexport function createObserverHub<S extends AnySchema>(\n  getAll: <K extends keyof S & string>(table: K) => Promise<RecordOf<S, K>[]>,\n) {\n  const observers = new Map<string, Set<ObserverListener<unknown>>>();\n  let disposed = false;\n\n  const notify = <K extends keyof S & string>(table: K): void => {\n    if (disposed) return;\n\n    const listeners = observers.get(table);\n\n    if (!listeners || listeners.size === 0) return;\n\n    void getAll(table)\n      .then((records) => {\n        if (disposed) return;\n\n        const current = observers.get(table);\n\n        if (!current || current.size === 0) return;\n\n        for (const listener of current) {\n          try {\n            listener(records as unknown[]);\n          } catch {\n            /* observer listener errors are intentionally swallowed */\n          }\n        }\n      })\n      .catch(() => {\n        /* observer source errors are intentionally swallowed */\n      });\n  };\n\n  const observe = <K extends keyof S & string>(\n    table: K,\n    listener: (records: RecordOf<S, K>[]) => void,\n    { immediate = true, signal }: { immediate?: boolean; signal?: AbortSignal } = {},\n  ): (() => void) => {\n    if (disposed) throw new VaultDisposedError('observer hub is disposed');\n\n    if (signal?.aborted) return () => {};\n\n    const wrapped = listener as ObserverListener<unknown>;\n    const listeners = observers.get(table) ?? new Set<ObserverListener<unknown>>();\n\n    observers.set(table, listeners);\n    listeners.add(wrapped);\n\n    if (immediate) notify(table);\n\n    const stop = (): void => {\n      const current = observers.get(table);\n\n      if (!current) return;\n\n      current.delete(wrapped);\n\n      if (current.size === 0) observers.delete(table);\n    };\n\n    signal?.addEventListener('abort', stop, { once: true });\n\n    return stop;\n  };\n\n  return {\n    dispose: () => {\n      disposed = true;\n      observers.clear();\n    },\n    notify,\n    observe,\n  };\n}\n\nexport function getRecordKey<S extends AnySchema, K extends keyof S>(\n  schema: S,\n  table: K,\n  value: RecordOf<S, K>,\n): KeyOf<S, K> {\n  const keyField = String(schema[table].key);\n  const keyValue = (value as Record<string, unknown>)[keyField];\n\n  if (typeof keyValue !== 'number' && typeof keyValue !== 'string') {\n    throw new VaultError(`record in table \"${String(table)}\" must have a string or finite-number key at \"${keyField}\"`);\n  }\n\n  if (typeof keyValue === 'number' && !Number.isFinite(keyValue)) {\n    throw new VaultError(`record in table \"${String(table)}\" must have a finite-number key at \"${keyField}\"`);\n  }\n\n  return keyValue as KeyOf<S, K>;\n}\n"],"mappings":"gCAKA,IAAM,EAAM,KAMZ,SAAgB,EAAe,EAAuB,CACpD,GAAI,OAAO,GAAQ,SAAU,CAC3B,GAAI,CAAC,OAAO,SAAS,CAAG,EAAG,MAAM,IAAI,EAAA,WAAW,iDAAiD,OAAO,CAAG,GAAG,EAE9G,MAAO,KAAK,OAAO,CAAG,GACxB,CAEA,MAAO,KAAK,mBAAmB,CAAG,GACpC,CAEA,SAAgB,EAAe,EAAwB,CACrD,MAAO,GAAG,mBAAmB,CAAM,IAAI,GACzC,CAEA,SAAgB,EAAiB,EAAgB,EAAe,EAAuB,CACrF,MAAO,GAAG,mBAAmB,CAAM,IAAI,IAAM,mBAAmB,CAAK,IAAI,IAAM,EAAe,CAAG,GACnG,CAEA,SAAgB,EAAyB,EAAgB,EAAuB,CAC9E,MAAO,GAAG,mBAAmB,CAAM,IAAI,IAAM,mBAAmB,CAAK,IAAI,GAC3E,CAEA,SAAgB,EAA0B,EAAgB,EAA+C,CACvG,GAAI,CAAC,EAAY,OAEjB,IAAM,EAAS,EAAe,CAAM,EAEpC,GAAI,CAAC,EAAW,WAAW,CAAM,EAAG,OAEpC,IAAM,EAAO,EAAW,MAAM,EAAO,MAAM,EACrC,EAAM,EAAK,QAAQ,CAAG,EAExB,OAAQ,GAEZ,GAAI,CACF,OAAO,mBAAmB,EAAK,MAAM,EAAG,CAAG,CAAC,CAC9C,MAAQ,CACN,MACF,CACF,CAGA,SAAgB,EACd,EACA,CACA,IAAM,EAAY,IAAI,IAClB,EAAW,GAET,EAAsC,GAAmB,CAC7D,GAAI,EAAU,OAEd,IAAM,EAAY,EAAU,IAAI,CAAK,EAEjC,CAAC,GAAa,EAAU,OAAS,GAErC,EAAY,CAAK,CAAC,CACf,KAAM,GAAY,CACjB,GAAI,EAAU,OAEd,IAAM,EAAU,EAAU,IAAI,CAAK,EAE/B,MAAC,GAAW,EAAQ,OAAS,GAEjC,IAAK,IAAM,KAAY,EACrB,GAAI,CACF,EAAS,CAAoB,CAC/B,MAAQ,CAER,CAEJ,CAAC,CAAC,CACD,UAAY,CAEb,CAAC,CACL,EAkCA,MAAO,CACL,YAAe,CACb,EAAW,GACX,EAAU,MAAM,CAClB,EACA,SACA,SArCA,EACA,EACA,CAAE,YAAY,GAAM,UAA0D,CAAC,IAC9D,CACjB,GAAI,EAAU,MAAM,IAAI,EAAA,mBAAmB,0BAA0B,EAErE,GAAI,GAAQ,QAAS,UAAa,CAAC,EAEnC,IAAM,EAAU,EACV,EAAY,EAAU,IAAI,CAAK,GAAK,IAAI,IAE9C,EAAU,IAAI,EAAO,CAAS,EAC9B,EAAU,IAAI,CAAO,EAEjB,GAAW,EAAO,CAAK,EAE3B,IAAM,MAAmB,CACvB,IAAM,EAAU,EAAU,IAAI,CAAK,EAE9B,IAEL,EAAQ,OAAO,CAAO,EAElB,EAAQ,OAAS,GAAG,EAAU,OAAO,CAAK,EAChD,EAIA,OAFA,GAAQ,iBAAiB,QAAS,EAAM,CAAE,KAAM,EAAK,CAAC,EAE/C,CACT,CASA,CACF,CAEA,SAAgB,EACd,EACA,EACA,EACa,CACb,IAAM,EAAW,OAAO,EAAO,EAAM,CAAC,GAAG,EACnC,EAAY,EAAkC,GAEpD,GAAI,OAAO,GAAa,UAAY,OAAO,GAAa,SACtD,MAAM,IAAI,EAAA,WAAW,oBAAoB,OAAO,CAAK,EAAE,gDAAgD,EAAS,EAAE,EAGpH,GAAI,OAAO,GAAa,UAAY,CAAC,OAAO,SAAS,CAAQ,EAC3D,MAAM,IAAI,EAAA,WAAW,oBAAoB,OAAO,CAAK,EAAE,sCAAsC,EAAS,EAAE,EAG1G,OAAO,CACT"}

package/dist/internal.d.ts

@@ -9,7 +9,7 @@ export declare function encodeStorageKey(dbName: string, table: string, key: Vau
 export declare function encodeStorageTablePrefix(dbName: string, table: string): string;
 export declare function decodeStorageTableFromKey(dbName: string, storageKey: string | null): string | undefined;
 /** `observe()` is Vault's single reactivity primitive: a snapshot now, then on mutations. */
-export declare function createObserverHub<S extends AnySchema>(getAll: <K extends keyof S & string>(table: K) => Promise<RecordOf<S, K>[]>, onError?: (error: unknown) => void): {
+export declare function createObserverHub<S extends AnySchema>(getAll: <K extends keyof S & string>(table: K) => Promise<RecordOf<S, K>[]>): {
     dispose: () => void;
     notify: <K extends keyof S & string>(table: K) => void;
     observe: <K extends keyof S & string>(table: K, listener: (records: RecordOf<S, K>[]) => void, { immediate, signal }?: {

package/dist/internal.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"internal.d.ts","sourceRoot":"","sources":["../src/internal.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,SAAS,EAAE,KAAK,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAMpE;;;GAGG;AACH,wBAAgB,cAAc,CAAC,GAAG,EAAE,QAAQ,GAAG,MAAM,CAQpD;AAED,wBAAgB,cAAc,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,CAErD;AAED,wBAAgB,gBAAgB,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,QAAQ,GAAG,MAAM,CAErF;AAED,wBAAgB,wBAAwB,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,CAE9E;AAED,wBAAgB,yBAAyB,CAAC,MAAM,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,GAAG,IAAI,GAAG,MAAM,GAAG,SAAS,CAiBvG;AAED,6FAA6F;AAC7F,wBAAgB,iBAAiB,CAAC,CAAC,SAAS,SAAS,EACnD,MAAM,EAAE,CAAC,CAAC,SAAS,MAAM,CAAC,GAAG,MAAM,EAAE,KAAK,EAAE,CAAC,KAAK,OAAO,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAC3E,OAAO,CAAC,EAAE,CAAC,KAAK,EAAE,OAAO,KAAK,IAAI;;aAUlB,CAAC,SAAS,MAAM,CAAC,GAAG,MAAM,SAAS,CAAC,KAAG,IAAI;cA0B1C,CAAC,SAAS,MAAM,CAAC,GAAG,MAAM,SAClC,CAAC,YACE,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,IAAI,0BACf;QAAE,SAAS,CAAC,EAAE,OAAO,CAAC;QAAC,MAAM,CAAC,EAAE,WAAW,CAAA;KAAE,KAC1E,CAAC,MAAM,IAAI,CAAC;EAoChB;AAED,wBAAgB,YAAY,CAAC,CAAC,SAAS,SAAS,EAAE,CAAC,SAAS,MAAM,CAAC,EACjE,MAAM,EAAE,CAAC,EACT,KAAK,EAAE,CAAC,EACR,KAAK,EAAE,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,GACpB,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAab"}
+{"version":3,"file":"internal.d.ts","sourceRoot":"","sources":["../src/internal.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,SAAS,EAAE,KAAK,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAMpE;;;GAGG;AACH,wBAAgB,cAAc,CAAC,GAAG,EAAE,QAAQ,GAAG,MAAM,CAQpD;AAED,wBAAgB,cAAc,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,CAErD;AAED,wBAAgB,gBAAgB,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,QAAQ,GAAG,MAAM,CAErF;AAED,wBAAgB,wBAAwB,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,CAE9E;AAED,wBAAgB,yBAAyB,CAAC,MAAM,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,GAAG,IAAI,GAAG,MAAM,GAAG,SAAS,CAiBvG;AAED,6FAA6F;AAC7F,wBAAgB,iBAAiB,CAAC,CAAC,SAAS,SAAS,EACnD,MAAM,EAAE,CAAC,CAAC,SAAS,MAAM,CAAC,GAAG,MAAM,EAAE,KAAK,EAAE,CAAC,KAAK,OAAO,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;;aAK3D,CAAC,SAAS,MAAM,CAAC,GAAG,MAAM,SAAS,CAAC,KAAG,IAAI;cA4B1C,CAAC,SAAS,MAAM,CAAC,GAAG,MAAM,SAClC,CAAC,YACE,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,IAAI,0BACf;QAAE,SAAS,CAAC,EAAE,OAAO,CAAC;QAAC,MAAM,CAAC,EAAE,WAAW,CAAA;KAAE,KAC1E,CAAC,MAAM,IAAI,CAAC;EAoChB;AAED,wBAAgB,YAAY,CAAC,CAAC,SAAS,SAAS,EAAE,CAAC,SAAS,MAAM,CAAC,EACjE,MAAM,EAAE,CAAC,EACT,KAAK,EAAE,CAAC,EACR,KAAK,EAAE,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,GACpB,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAab"}

package/dist/internal.js

@@ -1,5 +1,4 @@
 import { VaultDisposedError as e, VaultError as t } from "./errors.js";
-import "./_dev.js";
 //#region src/internal.ts
 var n = "\0";
 function r(e) {
@@ -29,35 +28,31 @@ function s(e, t) {
 		return;
 	}
 }
-function c(t, n) {
-	let r = /* @__PURE__ */ new Map(), i = !1, a = (e) => {
-		n && n(e);
-	}, o = (e) => {
-		if (i) return;
-		let n = r.get(e);
-		!n || n.size === 0 || t(e).then((t) => {
-			if (i) return;
-			let n = r.get(e);
-			if (!(!n || n.size === 0)) for (let e of n) try {
+function c(t) {
+	let n = /* @__PURE__ */ new Map(), r = !1, i = (e) => {
+		if (r) return;
+		let i = n.get(e);
+		!i || i.size === 0 || t(e).then((t) => {
+			if (r) return;
+			let i = n.get(e);
+			if (!(!i || i.size === 0)) for (let e of i) try {
 				e(t);
-			} catch (e) {
-				a(e);
-			}
-		}).catch(a);
+			} catch {}
+		}).catch(() => {});
 	};
 	return {
 		dispose: () => {
-			i = !0, r.clear();
+			r = !0, n.clear();
 		},
-		notify: o,
-		observe: (t, n, { immediate: a = !0, signal: s } = {}) => {
-			if (i) throw new e("observer hub is disposed");
+		notify: i,
+		observe: (t, a, { immediate: o = !0, signal: s } = {}) => {
+			if (r) throw new e("observer hub is disposed");
 			if (s?.aborted) return () => {};
-			let c = n, l = r.get(t) ?? /* @__PURE__ */ new Set();
-			r.set(t, l), l.add(c), a && o(t);
+			let c = a, l = n.get(t) ?? /* @__PURE__ */ new Set();
+			n.set(t, l), l.add(c), o && i(t);
 			let u = () => {
-				let e = r.get(t);
-				e && (e.delete(c), e.size === 0 && r.delete(t));
+				let e = n.get(t);
+				e && (e.delete(c), e.size === 0 && n.delete(t));
 			};
 			return s?.addEventListener("abort", u, { once: !0 }), u;
 		}

package/dist/internal.js.map

@@ -1 +1 @@
-{"version":3,"file":"internal.js","names":[],"sources":["../src/internal.ts"],"sourcesContent":["import { error as logError } from './_dev';\nimport { VaultDisposedError, VaultError } from './errors';\nimport type { AnySchema, KeyOf, RecordOf, VaultKey } from './types';\n\ntype ObserverListener<T> = (records: T[]) => void;\n\nconst SEP = '\\x00';\n\n/**\n * Type-tagged keys make `1` and `'1'` distinct in string-keyed adapters while\n * keeping the same portable primary-key contract as IndexedDB.\n */\nexport function encodeVaultKey(key: VaultKey): string {\n  if (typeof key === 'number') {\n    if (!Number.isFinite(key)) throw new VaultError(`primary key must be a finite number, received ${String(key)}`);\n\n    return `n:${String(key)}`;\n  }\n\n  return `s:${encodeURIComponent(key)}`;\n}\n\nexport function encodeDbPrefix(dbName: string): string {\n  return `${encodeURIComponent(dbName)}${SEP}`;\n}\n\nexport function encodeStorageKey(dbName: string, table: string, key: VaultKey): string {\n  return `${encodeURIComponent(dbName)}${SEP}${encodeURIComponent(table)}${SEP}${encodeVaultKey(key)}`;\n}\n\nexport function encodeStorageTablePrefix(dbName: string, table: string): string {\n  return `${encodeURIComponent(dbName)}${SEP}${encodeURIComponent(table)}${SEP}`;\n}\n\nexport function decodeStorageTableFromKey(dbName: string, storageKey: string | null): string | undefined {\n  if (!storageKey) return undefined;\n\n  const prefix = encodeDbPrefix(dbName);\n\n  if (!storageKey.startsWith(prefix)) return undefined;\n\n  const tail = storageKey.slice(prefix.length);\n  const end = tail.indexOf(SEP);\n\n  if (end === -1) return undefined;\n\n  try {\n    return decodeURIComponent(tail.slice(0, end));\n  } catch {\n    return undefined;\n  }\n}\n\n/** `observe()` is Vault's single reactivity primitive: a snapshot now, then on mutations. */\nexport function createObserverHub<S extends AnySchema>(\n  getAll: <K extends keyof S & string>(table: K) => Promise<RecordOf<S, K>[]>,\n  onError?: (error: unknown) => void,\n) {\n  const observers = new Map<string, Set<ObserverListener<unknown>>>();\n  let disposed = false;\n\n  const reportObserverError = (error: unknown): void => {\n    if (onError) onError(error);\n    else logError('observer notification failed', error);\n  };\n\n  const notify = <K extends keyof S & string>(table: K): void => {\n    if (disposed) return;\n\n    const listeners = observers.get(table);\n\n    if (!listeners || listeners.size === 0) return;\n\n    void getAll(table)\n      .then((records) => {\n        if (disposed) return;\n\n        const current = observers.get(table);\n\n        if (!current || current.size === 0) return;\n\n        for (const listener of current) {\n          try {\n            listener(records as unknown[]);\n          } catch (error) {\n            reportObserverError(error);\n          }\n        }\n      })\n      .catch(reportObserverError);\n  };\n\n  const observe = <K extends keyof S & string>(\n    table: K,\n    listener: (records: RecordOf<S, K>[]) => void,\n    { immediate = true, signal }: { immediate?: boolean; signal?: AbortSignal } = {},\n  ): (() => void) => {\n    if (disposed) throw new VaultDisposedError('observer hub is disposed');\n\n    if (signal?.aborted) return () => {};\n\n    const wrapped = listener as ObserverListener<unknown>;\n    const listeners = observers.get(table) ?? new Set<ObserverListener<unknown>>();\n\n    observers.set(table, listeners);\n    listeners.add(wrapped);\n\n    if (immediate) notify(table);\n\n    const stop = (): void => {\n      const current = observers.get(table);\n\n      if (!current) return;\n\n      current.delete(wrapped);\n\n      if (current.size === 0) observers.delete(table);\n    };\n\n    signal?.addEventListener('abort', stop, { once: true });\n\n    return stop;\n  };\n\n  return {\n    dispose: () => {\n      disposed = true;\n      observers.clear();\n    },\n    notify,\n    observe,\n  };\n}\n\nexport function getRecordKey<S extends AnySchema, K extends keyof S>(\n  schema: S,\n  table: K,\n  value: RecordOf<S, K>,\n): KeyOf<S, K> {\n  const keyField = String(schema[table].key);\n  const keyValue = (value as Record<string, unknown>)[keyField];\n\n  if (typeof keyValue !== 'number' && typeof keyValue !== 'string') {\n    throw new VaultError(`record in table \"${String(table)}\" must have a string or finite-number key at \"${keyField}\"`);\n  }\n\n  if (typeof keyValue === 'number' && !Number.isFinite(keyValue)) {\n    throw new VaultError(`record in table \"${String(table)}\" must have a finite-number key at \"${keyField}\"`);\n  }\n\n  return keyValue as KeyOf<S, K>;\n}\n"],"mappings":";;;AAMA,IAAM,IAAM;AAMZ,SAAgB,EAAe,GAAuB;CACpD,IAAI,OAAO,KAAQ,UAAU;EAC3B,IAAI,CAAC,OAAO,SAAS,CAAG,GAAG,MAAM,IAAI,EAAW,iDAAiD,OAAO,CAAG,GAAG;EAE9G,OAAO,KAAK,OAAO,CAAG;CACxB;CAEA,OAAO,KAAK,mBAAmB,CAAG;AACpC;AAEA,SAAgB,EAAe,GAAwB;CACrD,OAAO,GAAG,mBAAmB,CAAM,IAAI;AACzC;AAEA,SAAgB,EAAiB,GAAgB,GAAe,GAAuB;CACrF,OAAO,GAAG,mBAAmB,CAAM,IAAI,IAAM,mBAAmB,CAAK,IAAI,IAAM,EAAe,CAAG;AACnG;AAEA,SAAgB,EAAyB,GAAgB,GAAuB;CAC9E,OAAO,GAAG,mBAAmB,CAAM,IAAI,IAAM,mBAAmB,CAAK,IAAI;AAC3E;AAEA,SAAgB,EAA0B,GAAgB,GAA+C;CACvG,IAAI,CAAC,GAAY;CAEjB,IAAM,IAAS,EAAe,CAAM;CAEpC,IAAI,CAAC,EAAW,WAAW,CAAM,GAAG;CAEpC,IAAM,IAAO,EAAW,MAAM,EAAO,MAAM,GACrC,IAAM,EAAK,QAAQ,CAAG;CAExB,UAAQ,IAEZ,IAAI;EACF,OAAO,mBAAmB,EAAK,MAAM,GAAG,CAAG,CAAC;CAC9C,QAAQ;EACN;CACF;AACF;AAGA,SAAgB,EACd,GACA,GACA;CACA,IAAM,oBAAY,IAAI,IAA4C,GAC9D,IAAW,IAET,KAAuB,MAAyB;EACpD,AAAI,KAAS,EAAQ,CAAK;CAE5B,GAEM,KAAsC,MAAmB;EAC7D,IAAI,GAAU;EAEd,IAAM,IAAY,EAAU,IAAI,CAAK;EAEjC,CAAC,KAAa,EAAU,SAAS,KAErC,EAAY,CAAK,CAAC,CACf,MAAM,MAAY;GACjB,IAAI,GAAU;GAEd,IAAM,IAAU,EAAU,IAAI,CAAK;GAE/B,OAAC,KAAW,EAAQ,SAAS,IAEjC,KAAK,IAAM,KAAY,GACrB,IAAI;IACF,EAAS,CAAoB;GAC/B,SAAS,GAAO;IACd,EAAoB,CAAK;GAC3B;EAEJ,CAAC,CAAC,CACD,MAAM,CAAmB;CAC9B;CAkCA,OAAO;EACL,eAAe;GAEb,AADA,IAAW,IACX,EAAU,MAAM;EAClB;EACA;EACA,UArCA,GACA,GACA,EAAE,eAAY,IAAM,cAA0D,CAAC,MAC9D;GACjB,IAAI,GAAU,MAAM,IAAI,EAAmB,0BAA0B;GAErE,IAAI,GAAQ,SAAS,aAAa,CAAC;GAEnC,IAAM,IAAU,GACV,IAAY,EAAU,IAAI,CAAK,qBAAK,IAAI,IAA+B;GAK7E,AAHA,EAAU,IAAI,GAAO,CAAS,GAC9B,EAAU,IAAI,CAAO,GAEjB,KAAW,EAAO,CAAK;GAE3B,IAAM,UAAmB;IACvB,IAAM,IAAU,EAAU,IAAI,CAAK;IAE9B,MAEL,EAAQ,OAAO,CAAO,GAElB,EAAQ,SAAS,KAAG,EAAU,OAAO,CAAK;GAChD;GAIA,OAFA,GAAQ,iBAAiB,SAAS,GAAM,EAAE,MAAM,GAAK,CAAC,GAE/C;EACT;CASA;AACF;AAEA,SAAgB,EACd,GACA,GACA,GACa;CACb,IAAM,IAAW,OAAO,EAAO,EAAM,CAAC,GAAG,GACnC,IAAY,EAAkC;CAEpD,IAAI,OAAO,KAAa,YAAY,OAAO,KAAa,UACtD,MAAM,IAAI,EAAW,oBAAoB,OAAO,CAAK,EAAE,gDAAgD,EAAS,EAAE;CAGpH,IAAI,OAAO,KAAa,YAAY,CAAC,OAAO,SAAS,CAAQ,GAC3D,MAAM,IAAI,EAAW,oBAAoB,OAAO,CAAK,EAAE,sCAAsC,EAAS,EAAE;CAG1G,OAAO;AACT"}
+{"version":3,"file":"internal.js","names":[],"sources":["../src/internal.ts"],"sourcesContent":["import { VaultDisposedError, VaultError } from './errors';\nimport type { AnySchema, KeyOf, RecordOf, VaultKey } from './types';\n\ntype ObserverListener<T> = (records: T[]) => void;\n\nconst SEP = '\\x00';\n\n/**\n * Type-tagged keys make `1` and `'1'` distinct in string-keyed adapters while\n * keeping the same portable primary-key contract as IndexedDB.\n */\nexport function encodeVaultKey(key: VaultKey): string {\n  if (typeof key === 'number') {\n    if (!Number.isFinite(key)) throw new VaultError(`primary key must be a finite number, received ${String(key)}`);\n\n    return `n:${String(key)}`;\n  }\n\n  return `s:${encodeURIComponent(key)}`;\n}\n\nexport function encodeDbPrefix(dbName: string): string {\n  return `${encodeURIComponent(dbName)}${SEP}`;\n}\n\nexport function encodeStorageKey(dbName: string, table: string, key: VaultKey): string {\n  return `${encodeURIComponent(dbName)}${SEP}${encodeURIComponent(table)}${SEP}${encodeVaultKey(key)}`;\n}\n\nexport function encodeStorageTablePrefix(dbName: string, table: string): string {\n  return `${encodeURIComponent(dbName)}${SEP}${encodeURIComponent(table)}${SEP}`;\n}\n\nexport function decodeStorageTableFromKey(dbName: string, storageKey: string | null): string | undefined {\n  if (!storageKey) return undefined;\n\n  const prefix = encodeDbPrefix(dbName);\n\n  if (!storageKey.startsWith(prefix)) return undefined;\n\n  const tail = storageKey.slice(prefix.length);\n  const end = tail.indexOf(SEP);\n\n  if (end === -1) return undefined;\n\n  try {\n    return decodeURIComponent(tail.slice(0, end));\n  } catch {\n    return undefined;\n  }\n}\n\n/** `observe()` is Vault's single reactivity primitive: a snapshot now, then on mutations. */\nexport function createObserverHub<S extends AnySchema>(\n  getAll: <K extends keyof S & string>(table: K) => Promise<RecordOf<S, K>[]>,\n) {\n  const observers = new Map<string, Set<ObserverListener<unknown>>>();\n  let disposed = false;\n\n  const notify = <K extends keyof S & string>(table: K): void => {\n    if (disposed) return;\n\n    const listeners = observers.get(table);\n\n    if (!listeners || listeners.size === 0) return;\n\n    void getAll(table)\n      .then((records) => {\n        if (disposed) return;\n\n        const current = observers.get(table);\n\n        if (!current || current.size === 0) return;\n\n        for (const listener of current) {\n          try {\n            listener(records as unknown[]);\n          } catch {\n            /* observer listener errors are intentionally swallowed */\n          }\n        }\n      })\n      .catch(() => {\n        /* observer source errors are intentionally swallowed */\n      });\n  };\n\n  const observe = <K extends keyof S & string>(\n    table: K,\n    listener: (records: RecordOf<S, K>[]) => void,\n    { immediate = true, signal }: { immediate?: boolean; signal?: AbortSignal } = {},\n  ): (() => void) => {\n    if (disposed) throw new VaultDisposedError('observer hub is disposed');\n\n    if (signal?.aborted) return () => {};\n\n    const wrapped = listener as ObserverListener<unknown>;\n    const listeners = observers.get(table) ?? new Set<ObserverListener<unknown>>();\n\n    observers.set(table, listeners);\n    listeners.add(wrapped);\n\n    if (immediate) notify(table);\n\n    const stop = (): void => {\n      const current = observers.get(table);\n\n      if (!current) return;\n\n      current.delete(wrapped);\n\n      if (current.size === 0) observers.delete(table);\n    };\n\n    signal?.addEventListener('abort', stop, { once: true });\n\n    return stop;\n  };\n\n  return {\n    dispose: () => {\n      disposed = true;\n      observers.clear();\n    },\n    notify,\n    observe,\n  };\n}\n\nexport function getRecordKey<S extends AnySchema, K extends keyof S>(\n  schema: S,\n  table: K,\n  value: RecordOf<S, K>,\n): KeyOf<S, K> {\n  const keyField = String(schema[table].key);\n  const keyValue = (value as Record<string, unknown>)[keyField];\n\n  if (typeof keyValue !== 'number' && typeof keyValue !== 'string') {\n    throw new VaultError(`record in table \"${String(table)}\" must have a string or finite-number key at \"${keyField}\"`);\n  }\n\n  if (typeof keyValue === 'number' && !Number.isFinite(keyValue)) {\n    throw new VaultError(`record in table \"${String(table)}\" must have a finite-number key at \"${keyField}\"`);\n  }\n\n  return keyValue as KeyOf<S, K>;\n}\n"],"mappings":";;AAKA,IAAM,IAAM;AAMZ,SAAgB,EAAe,GAAuB;CACpD,IAAI,OAAO,KAAQ,UAAU;EAC3B,IAAI,CAAC,OAAO,SAAS,CAAG,GAAG,MAAM,IAAI,EAAW,iDAAiD,OAAO,CAAG,GAAG;EAE9G,OAAO,KAAK,OAAO,CAAG;CACxB;CAEA,OAAO,KAAK,mBAAmB,CAAG;AACpC;AAEA,SAAgB,EAAe,GAAwB;CACrD,OAAO,GAAG,mBAAmB,CAAM,IAAI;AACzC;AAEA,SAAgB,EAAiB,GAAgB,GAAe,GAAuB;CACrF,OAAO,GAAG,mBAAmB,CAAM,IAAI,IAAM,mBAAmB,CAAK,IAAI,IAAM,EAAe,CAAG;AACnG;AAEA,SAAgB,EAAyB,GAAgB,GAAuB;CAC9E,OAAO,GAAG,mBAAmB,CAAM,IAAI,IAAM,mBAAmB,CAAK,IAAI;AAC3E;AAEA,SAAgB,EAA0B,GAAgB,GAA+C;CACvG,IAAI,CAAC,GAAY;CAEjB,IAAM,IAAS,EAAe,CAAM;CAEpC,IAAI,CAAC,EAAW,WAAW,CAAM,GAAG;CAEpC,IAAM,IAAO,EAAW,MAAM,EAAO,MAAM,GACrC,IAAM,EAAK,QAAQ,CAAG;CAExB,UAAQ,IAEZ,IAAI;EACF,OAAO,mBAAmB,EAAK,MAAM,GAAG,CAAG,CAAC;CAC9C,QAAQ;EACN;CACF;AACF;AAGA,SAAgB,EACd,GACA;CACA,IAAM,oBAAY,IAAI,IAA4C,GAC9D,IAAW,IAET,KAAsC,MAAmB;EAC7D,IAAI,GAAU;EAEd,IAAM,IAAY,EAAU,IAAI,CAAK;EAEjC,CAAC,KAAa,EAAU,SAAS,KAErC,EAAY,CAAK,CAAC,CACf,MAAM,MAAY;GACjB,IAAI,GAAU;GAEd,IAAM,IAAU,EAAU,IAAI,CAAK;GAE/B,OAAC,KAAW,EAAQ,SAAS,IAEjC,KAAK,IAAM,KAAY,GACrB,IAAI;IACF,EAAS,CAAoB;GAC/B,QAAQ,CAER;EAEJ,CAAC,CAAC,CACD,YAAY,CAEb,CAAC;CACL;CAkCA,OAAO;EACL,eAAe;GAEb,AADA,IAAW,IACX,EAAU,MAAM;EAClB;EACA;EACA,UArCA,GACA,GACA,EAAE,eAAY,IAAM,cAA0D,CAAC,MAC9D;GACjB,IAAI,GAAU,MAAM,IAAI,EAAmB,0BAA0B;GAErE,IAAI,GAAQ,SAAS,aAAa,CAAC;GAEnC,IAAM,IAAU,GACV,IAAY,EAAU,IAAI,CAAK,qBAAK,IAAI,IAA+B;GAK7E,AAHA,EAAU,IAAI,GAAO,CAAS,GAC9B,EAAU,IAAI,CAAO,GAEjB,KAAW,EAAO,CAAK;GAE3B,IAAM,UAAmB;IACvB,IAAM,IAAU,EAAU,IAAI,CAAK;IAE9B,MAEL,EAAQ,OAAO,CAAO,GAElB,EAAQ,SAAS,KAAG,EAAU,OAAO,CAAK;GAChD;GAIA,OAFA,GAAQ,iBAAiB,SAAS,GAAM,EAAE,MAAM,GAAK,CAAC,GAE/C;EACT;CASA;AACF;AAEA,SAAgB,EACd,GACA,GACA,GACa;CACb,IAAM,IAAW,OAAO,EAAO,EAAM,CAAC,GAAG,GACnC,IAAY,EAAkC;CAEpD,IAAI,OAAO,KAAa,YAAY,OAAO,KAAa,UACtD,MAAM,IAAI,EAAW,oBAAoB,OAAO,CAAK,EAAE,gDAAgD,EAAS,EAAE;CAGpH,IAAI,OAAO,KAAa,YAAY,CAAC,OAAO,SAAS,CAAQ,GAC3D,MAAM,IAAI,EAAW,oBAAoB,OAAO,CAAK,EAAE,sCAAsC,EAAS,EAAE;CAG1G,OAAO;AACT"}

package/dist/query.cjs

@@ -1,2 +1,2 @@
-const e=require("./errors.cjs");async function t(e,t){let n=await e.source();for(let e of t)n=e.apply(n);return n}function n(t,n){if(!Number.isInteger(t)||t<0)throw new e.VaultError(`${n} must be a non-negative integer`);return t}function r(e,t){return{deleteMany:e.deleteMany,source:t}}function i(a,o=[]){let s=e=>i(a,[...o,e]);return{between(e,t,n){let c=String(e);if(o.length===0){if(a.getRange&&a.keyField===c)return i(r(a,()=>a.getRange({lower:t,type:`between`,upper:n})),o);if(a.getIndexRange&&a.indexedFields?.has(c))return i(r(a,()=>a.getIndexRange(c,{lower:t,type:`between`,upper:n})),o)}return s({apply:r=>r.filter(r=>{let i=r[e];return i>=t&&i<=n})})},count(){return t(a,o.filter(e=>!e.isNonFilter)).then(e=>e.length)},async delete(){if(!a.deleteMany)throw new e.VaultError(`query.delete is not available for this adapter context`);let n=await t(a,o);return a.deleteMany(n)},equals(e,t){let n=String(e);if(o.length===0){if(a.getRange&&a.keyField===n)return i(r(a,()=>a.getRange({type:`eq`,value:t})));if(a.getIndexRange&&a.indexedFields?.has(n))return i(r(a,()=>a.getIndexRange(n,{type:`eq`,value:t})))}return i(a,[...o,{apply:n=>n.filter(n=>n[e]===t)}])},async exists(){return o.length===0?a.source().then(e=>e.length>0):t(a,o).then(e=>e.length>0)},filter(e){return s({apply:t=>t.filter(e)})},first(){return o.length===0?a.source().then(e=>e[0]):t(a,o).then(e=>e[0])},limit(e){let t=n(e,`query.limit`);return s({apply:e=>e.slice(0,t),isNonFilter:!0})},offset(e){let t=n(e,`query.offset`);return s({apply:e=>e.slice(t),isNonFilter:!0})},orderBy(e,t=`asc`){return s({apply:n=>{let r=t===`asc`?1:-1;return[...n].sort((t,n)=>{let i=t[e],a=n[e];return i===a?0:i>a?r:-r})},isNonFilter:!0})},startsWith(e,t,{ignoreCase:n=!1}={}){let c=String(e);if(!n&&t.length>0&&o.length===0){if(a.getRange&&a.keyField===c)return i(r(a,()=>a.getRange({prefix:t,type:`starts`})),o);if(a.getIndexRange&&a.indexedFields?.has(c))return i(r(a,()=>a.getIndexRange(c,{prefix:t,type:`starts`})),o)}let l=n?t.toLowerCase():t;return s({apply:t=>t.filter(t=>{let r=t[e];return typeof r==`string`&&(n?r.toLowerCase():r).startsWith(l)})})},toArray(){return t(a,o)}}}exports.createQueryBuilder=i;
+const e=require("./errors.cjs");async function t(e,t){let n=await e.source();for(let e of t)n=e.apply(n);return n}function n(t,n){if(!Number.isInteger(t)||t<0)throw new e.VaultError(`${n} must be a non-negative integer`);return t}function r(i,a=[]){let o=e=>r(i,[...a,e]);return{count(){return t(i,a.filter(e=>!e.isNonFilter)).then(e=>e.length)},async delete(){if(!i.deleteMany)throw new e.VaultError(`query.delete is not available for this adapter context`);let n=await t(i,a);return i.deleteMany(n)},equals(e,t){return o({apply:n=>n.filter(n=>n[e]===t)})},filter(e){return o({apply:t=>t.filter(e)})},first(){return a.length===0?i.source().then(e=>e[0]):t(i,a).then(e=>e[0])},limit(e){let t=n(e,`query.limit`);return o({apply:e=>e.slice(0,t),isNonFilter:!0})},offset(e){let t=n(e,`query.offset`);return o({apply:e=>e.slice(t),isNonFilter:!0})},orderBy(e,t=`asc`){return o({apply:n=>{let r=t===`asc`?1:-1;return[...n].sort((t,n)=>{let i=t[e],a=n[e];return i===a?0:i>a?r:-r})},isNonFilter:!0})},toArray(){return t(i,a)}}}exports.createQueryBuilder=r;
 //# sourceMappingURL=query.cjs.map

package/dist/query.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"query.cjs","names":[],"sources":["../src/query.ts"],"sourcesContent":["import { VaultError } from './errors';\n\ntype Predicate<T> = (value: T, index: number, array: T[]) => boolean;\n/**\n * `isNonFilter`: when true this op is excluded from `count()` — it does not restrict\n * *which* records match (limit, offset, orderBy), only how results are presented.\n */\ntype QueryOp<T> = { apply: (data: T[]) => T[]; isNonFilter?: boolean };\ntype ComparableFieldKeys<T extends object> = {\n  [K in keyof T]-?: Extract<NonNullable<T[K]>, number | string> extends never ? never : K;\n}[keyof T];\n\n/**\n * A primary-key range hint that can be pushed down to native storage backends (e.g. IndexedDB).\n * When `QueryContext.getRange` and `keyField` are present, a matching first filter op replaces\n * the full-table `source()` scan with a targeted range fetch.\n */\nexport type NativeRange =\n  | { type: 'eq'; value: unknown }\n  | { lower: unknown; type: 'between'; upper: unknown }\n  | { prefix: string; type: 'starts' };\n\nexport type QueryContext<T extends object> = {\n  deleteMany?: (records: T[]) => Promise<number>;\n  /**\n   * When present alongside `indexedFields`, replaces `source()` for secondary-index filter ops.\n   * Only activated when the first op is `equals`, `between`, or `startsWith` on a field that\n   * has an index registered in the schema. IndexedDB uses `IDBIndex.getAll(range)` under the hood.\n   */\n  getIndexRange?: (field: string, range: NativeRange) => Promise<T[]>;\n  /**\n   * When present alongside `keyField`, replaces `source()` for primary-key filter ops.\n   * Only activated when the first op is an `equals`, `between`, or case-sensitive `startsWith`\n   * on `keyField`. All remaining ops still run in-memory against the range result.\n   */\n  getRange?: (range: NativeRange) => Promise<T[]>;\n  /** Fields that have secondary indexes — used to detect when a filter op can use `getIndexRange`. */\n  indexedFields?: ReadonlySet<string>;\n  /** Primary key field name — used to detect when a filter op can be pushed to `getRange`. */\n  keyField?: string;\n  source: () => Promise<T[]>;\n};\n\n/* -------------------- Public interfaces -------------------- */\n\n/**\n * Shared query methods. `T` is the base record type; `N` is the progressively-narrowed type\n * accumulated by `equals()` calls.\n */\ntype ChainedQuery<T extends object, N extends T, Self extends ChainedQuery<T, N, Self>> = {\n  /**\n   * Filter records where `field` is between `lower` and `upper` (inclusive).\n   * Preserves any type narrowing already accumulated by prior `equals()` calls.\n   */\n  between<K extends ComparableFieldKeys<T>>(\n    field: K,\n    lower: Extract<NonNullable<T[K]>, number | string>,\n    upper: Extract<NonNullable<T[K]>, number | string>,\n  ): QueryBuilder<T, N>;\n  /**\n   * Returns the number of records matching the applied filter predicates.\n   * Presentation-only ops (`limit`, `offset`, `orderBy`) are intentionally ignored — this\n   * always counts the full filtered set, making paginated total-count queries possible\n   * without a second query.\n   */\n  count(): Promise<number>;\n  /**\n   * Filter records where `field` exactly equals `value`.\n   * The return type is narrowed to `QueryBuilder<T & Record<K, V>>` so that subsequent\n   * `.toArray()`, `.first()`, etc. reflect the equality constraint in their result type.\n   *\n   * ```ts\n   * // result: (User & { role: 'admin' })[]\n   * const admins = await db.query('users').equals('role', 'admin').toArray();\n   * ```\n   */\n  equals<K extends keyof T & string, V extends T[K]>(field: K, value: V): QueryBuilder<T & Record<K, V>>;\n  /**\n   * Returns `true` if at least one record matches all applied filter operations.\n   * Equivalent to `(await query.first()) !== undefined` but makes the intent explicit.\n   * Presentation-only ops (`limit`, `offset`, `orderBy`) are respected before checking.\n   */\n  exists(): Promise<boolean>;\n  filter(fn: Predicate<N>): Self;\n  first(): Promise<N | undefined>;\n  limit(n: number): Self;\n  offset(n: number): Self;\n  orderBy<K extends keyof T>(field: K, direction?: 'asc' | 'desc'): Self;\n  /**\n   * Filter records where `field` starts with `prefix`.\n   * Preserves any type narrowing already accumulated by prior `equals()` calls.\n   *\n   * **Index push-down** is only active when `ignoreCase` is `false` (default) and this\n   * is the first operation in the chain. With `ignoreCase: true`, a full-table scan is\n   * always performed regardless of whether the field has an index.\n   */\n  startsWith<K extends keyof T>(field: K, prefix: string, options?: { ignoreCase?: boolean }): QueryBuilder<T, N>;\n  toArray(): Promise<N[]>;\n};\n\n/** Extends the shared query API with `delete()`. Available on stores and IndexedDB transaction callbacks. */\nexport interface QueryBuilder<T extends object, N extends T = T> extends ChainedQuery<T, N, QueryBuilder<T, N>> {\n  delete(): Promise<number>;\n}\n\n/* -------------------- Helpers -------------------- */\n\nasync function applyOps<T extends object>(ctx: QueryContext<T>, ops: readonly QueryOp<T>[]): Promise<T[]> {\n  let data = await ctx.source();\n\n  for (const op of ops) {\n    data = op.apply(data);\n  }\n\n  return data;\n}\n\nfunction assertNonNegativeInteger(value: number, name: string): number {\n  if (!Number.isInteger(value) || value < 0) {\n    throw new VaultError(`${name} must be a non-negative integer`);\n  }\n\n  return value;\n}\n\n/* -------------------- Push-down helpers -------------------- */\n\n/** Build a new QueryContext with source replaced by a range/index fetch. Drops range hints since push-down is done. */\nfunction pushDownContext<T extends object>(ctx: QueryContext<T>, newSource: () => Promise<T[]>): QueryContext<T> {\n  return { deleteMany: ctx.deleteMany, source: newSource };\n}\n\n/* -------------------- Factory -------------------- */\n\nexport function createQueryBuilder<T extends object, N extends T = T>(\n  ctx: QueryContext<T>,\n  ops: readonly QueryOp<T>[] = [],\n): QueryBuilder<T, N> {\n  const append = (op: QueryOp<T>): QueryBuilder<T, N> => createQueryBuilder<T, N>(ctx, [...ops, op]);\n\n  return {\n    between(field, lower, upper) {\n      const fieldStr = String(field);\n\n      if (ops.length === 0) {\n        if (ctx.getRange && ctx.keyField === fieldStr) {\n          return createQueryBuilder(\n            pushDownContext(ctx, () => ctx.getRange!({ lower, type: 'between', upper })),\n            ops,\n          );\n        }\n\n        if (ctx.getIndexRange && ctx.indexedFields?.has(fieldStr)) {\n          return createQueryBuilder(\n            pushDownContext(ctx, () => ctx.getIndexRange!(fieldStr, { lower, type: 'between', upper })),\n            ops,\n          );\n        }\n      }\n\n      return append({\n        apply: (data) =>\n          data.filter((r) => {\n            const v = r[field] as number | string;\n\n            return v >= lower && v <= upper;\n          }),\n      }) as unknown as QueryBuilder<T, N>;\n    },\n    count(): Promise<number> {\n      const filterOps = ops.filter((op) => !op.isNonFilter);\n\n      return applyOps(ctx, filterOps).then((r) => r.length);\n    },\n    async delete(): Promise<number> {\n      if (!ctx.deleteMany) {\n        throw new VaultError('query.delete is not available for this adapter context');\n      }\n\n      const records = await applyOps(ctx, ops);\n\n      return ctx.deleteMany(records);\n    },\n    equals<K extends keyof T & string, V extends T[K]>(field: K, value: V): QueryBuilder<T & Record<K, V>> {\n      const fieldStr = String(field);\n\n      if (ops.length === 0) {\n        if (ctx.getRange && ctx.keyField === fieldStr) {\n          return createQueryBuilder<T & Record<K, V>>(\n            pushDownContext(\n              ctx as unknown as QueryContext<T & Record<K, V>>,\n              () => ctx.getRange!({ type: 'eq', value }) as Promise<(T & Record<K, V>)[]>,\n            ),\n          ) as QueryBuilder<T & Record<K, V>>;\n        }\n\n        if (ctx.getIndexRange && ctx.indexedFields?.has(fieldStr)) {\n          return createQueryBuilder<T & Record<K, V>>(\n            pushDownContext(\n              ctx as unknown as QueryContext<T & Record<K, V>>,\n              () => ctx.getIndexRange!(fieldStr, { type: 'eq', value }) as Promise<(T & Record<K, V>)[]>,\n            ),\n          ) as QueryBuilder<T & Record<K, V>>;\n        }\n      }\n\n      return createQueryBuilder<T & Record<K, V>>(ctx as unknown as QueryContext<T & Record<K, V>>, [\n        ...(ops as unknown as QueryOp<T & Record<K, V>>[]),\n        { apply: (data) => data.filter((r) => r[field] === value) as (T & Record<K, V>)[] },\n      ]);\n    },\n    async exists(): Promise<boolean> {\n      if (ops.length === 0) return ctx.source().then((r) => r.length > 0);\n\n      return applyOps(ctx, ops).then((r) => r.length > 0);\n    },\n    filter(fn) {\n      return append({ apply: (data) => data.filter(fn as Predicate<T>) });\n    },\n    first(): Promise<N | undefined> {\n      if (ops.length === 0) return ctx.source().then((r) => r[0] as N | undefined);\n\n      return applyOps(ctx, ops).then((r) => r[0] as N | undefined);\n    },\n    limit(n) {\n      const safeN = assertNonNegativeInteger(n, 'query.limit');\n\n      return append({ apply: (data) => data.slice(0, safeN), isNonFilter: true });\n    },\n    offset(n) {\n      const safeN = assertNonNegativeInteger(n, 'query.offset');\n\n      return append({ apply: (data) => data.slice(safeN), isNonFilter: true });\n    },\n    orderBy(field, direction = 'asc') {\n      return append({\n        apply: (data) => {\n          const sign = direction === 'asc' ? 1 : -1;\n\n          return [...data].sort((a, b) => {\n            const av = a[field] as number | string;\n            const bv = b[field] as number | string;\n\n            if (av === bv) return 0;\n\n            return av > bv ? sign : -sign;\n          });\n        },\n        isNonFilter: true,\n      });\n    },\n    startsWith(field, prefix, { ignoreCase = false } = {}) {\n      const fieldStr = String(field);\n\n      if (!ignoreCase && prefix.length > 0 && ops.length === 0) {\n        if (ctx.getRange && ctx.keyField === fieldStr) {\n          return createQueryBuilder(\n            pushDownContext(ctx, () => ctx.getRange!({ prefix, type: 'starts' })),\n            ops,\n          );\n        }\n\n        if (ctx.getIndexRange && ctx.indexedFields?.has(fieldStr)) {\n          return createQueryBuilder(\n            pushDownContext(ctx, () => ctx.getIndexRange!(fieldStr, { prefix, type: 'starts' })),\n            ops,\n          );\n        }\n      }\n\n      const needle = ignoreCase ? prefix.toLowerCase() : prefix;\n\n      return append({\n        apply: (data) =>\n          data.filter((r) => {\n            const v = r[field];\n\n            if (typeof v !== 'string') return false;\n\n            const haystack = ignoreCase ? v.toLowerCase() : v;\n\n            return haystack.startsWith(needle);\n          }),\n      }) as unknown as QueryBuilder<T, N>;\n    },\n    toArray(): Promise<N[]> {\n      return applyOps(ctx, ops) as Promise<N[]>;\n    },\n  };\n}\n"],"mappings":"gCA2GA,eAAe,EAA2B,EAAsB,EAA0C,CACxG,IAAI,EAAO,MAAM,EAAI,OAAO,EAE5B,IAAK,IAAM,KAAM,EACf,EAAO,EAAG,MAAM,CAAI,EAGtB,OAAO,CACT,CAEA,SAAS,EAAyB,EAAe,EAAsB,CACrE,GAAI,CAAC,OAAO,UAAU,CAAK,GAAK,EAAQ,EACtC,MAAM,IAAI,EAAA,WAAW,GAAG,EAAK,gCAAgC,EAG/D,OAAO,CACT,CAKA,SAAS,EAAkC,EAAsB,EAAgD,CAC/G,MAAO,CAAE,WAAY,EAAI,WAAY,OAAQ,CAAU,CACzD,CAIA,SAAgB,EACd,EACA,EAA6B,CAAC,EACV,CACpB,IAAM,EAAU,GAAuC,EAAyB,EAAK,CAAC,GAAG,EAAK,CAAE,CAAC,EAEjG,MAAO,CACL,QAAQ,EAAO,EAAO,EAAO,CAC3B,IAAM,EAAW,OAAO,CAAK,EAE7B,GAAI,EAAI,SAAW,EAAG,CACpB,GAAI,EAAI,UAAY,EAAI,WAAa,EACnC,OAAO,EACL,EAAgB,MAAW,EAAI,SAAU,CAAE,QAAO,KAAM,UAAW,OAAM,CAAC,CAAC,EAC3E,CACF,EAGF,GAAI,EAAI,eAAiB,EAAI,eAAe,IAAI,CAAQ,EACtD,OAAO,EACL,EAAgB,MAAW,EAAI,cAAe,EAAU,CAAE,QAAO,KAAM,UAAW,OAAM,CAAC,CAAC,EAC1F,CACF,CAEJ,CAEA,OAAO,EAAO,CACZ,MAAQ,GACN,EAAK,OAAQ,GAAM,CACjB,IAAM,EAAI,EAAE,GAEZ,OAAO,GAAK,GAAS,GAAK,CAC5B,CAAC,CACL,CAAC,CACH,EACA,OAAyB,CAGvB,OAAO,EAAS,EAFE,EAAI,OAAQ,GAAO,CAAC,EAAG,WAEpB,CAAS,CAAC,CAAC,KAAM,GAAM,EAAE,MAAM,CACtD,EACA,MAAM,QAA0B,CAC9B,GAAI,CAAC,EAAI,WACP,MAAM,IAAI,EAAA,WAAW,wDAAwD,EAG/E,IAAM,EAAU,MAAM,EAAS,EAAK,CAAG,EAEvC,OAAO,EAAI,WAAW,CAAO,CAC/B,EACA,OAAmD,EAAU,EAA0C,CACrG,IAAM,EAAW,OAAO,CAAK,EAE7B,GAAI,EAAI,SAAW,EAAG,CACpB,GAAI,EAAI,UAAY,EAAI,WAAa,EACnC,OAAO,EACL,EACE,MACM,EAAI,SAAU,CAAE,KAAM,KAAM,OAAM,CAAC,CAC3C,CACF,EAGF,GAAI,EAAI,eAAiB,EAAI,eAAe,IAAI,CAAQ,EACtD,OAAO,EACL,EACE,MACM,EAAI,cAAe,EAAU,CAAE,KAAM,KAAM,OAAM,CAAC,CAC1D,CACF,CAEJ,CAEA,OAAO,EAAqC,EAAkD,CAC5F,GAAI,EACJ,CAAE,MAAQ,GAAS,EAAK,OAAQ,GAAM,EAAE,KAAW,CAAK,CAA0B,CACpF,CAAC,CACH,EACA,MAAM,QAA2B,CAG/B,OAFI,EAAI,SAAW,EAAU,EAAI,OAAO,CAAC,CAAC,KAAM,GAAM,EAAE,OAAS,CAAC,EAE3D,EAAS,EAAK,CAAG,CAAC,CAAC,KAAM,GAAM,EAAE,OAAS,CAAC,CACpD,EACA,OAAO,EAAI,CACT,OAAO,EAAO,CAAE,MAAQ,GAAS,EAAK,OAAO,CAAkB,CAAE,CAAC,CACpE,EACA,OAAgC,CAG9B,OAFI,EAAI,SAAW,EAAU,EAAI,OAAO,CAAC,CAAC,KAAM,GAAM,EAAE,EAAmB,EAEpE,EAAS,EAAK,CAAG,CAAC,CAAC,KAAM,GAAM,EAAE,EAAmB,CAC7D,EACA,MAAM,EAAG,CACP,IAAM,EAAQ,EAAyB,EAAG,aAAa,EAEvD,OAAO,EAAO,CAAE,MAAQ,GAAS,EAAK,MAAM,EAAG,CAAK,EAAG,YAAa,EAAK,CAAC,CAC5E,EACA,OAAO,EAAG,CACR,IAAM,EAAQ,EAAyB,EAAG,cAAc,EAExD,OAAO,EAAO,CAAE,MAAQ,GAAS,EAAK,MAAM,CAAK,EAAG,YAAa,EAAK,CAAC,CACzE,EACA,QAAQ,EAAO,EAAY,MAAO,CAChC,OAAO,EAAO,CACZ,MAAQ,GAAS,CACf,IAAM,EAAO,IAAc,MAAQ,EAAI,GAEvC,MAAO,CAAC,GAAG,CAAI,CAAC,CAAC,MAAM,EAAG,IAAM,CAC9B,IAAM,EAAK,EAAE,GACP,EAAK,EAAE,GAIb,OAFI,IAAO,EAAW,EAEf,EAAK,EAAK,EAAO,CAAC,CAC3B,CAAC,CACH,EACA,YAAa,EACf,CAAC,CACH,EACA,WAAW,EAAO,EAAQ,CAAE,aAAa,IAAU,CAAC,EAAG,CACrD,IAAM,EAAW,OAAO,CAAK,EAE7B,GAAI,CAAC,GAAc,EAAO,OAAS,GAAK,EAAI,SAAW,EAAG,CACxD,GAAI,EAAI,UAAY,EAAI,WAAa,EACnC,OAAO,EACL,EAAgB,MAAW,EAAI,SAAU,CAAE,SAAQ,KAAM,QAAS,CAAC,CAAC,EACpE,CACF,EAGF,GAAI,EAAI,eAAiB,EAAI,eAAe,IAAI,CAAQ,EACtD,OAAO,EACL,EAAgB,MAAW,EAAI,cAAe,EAAU,CAAE,SAAQ,KAAM,QAAS,CAAC,CAAC,EACnF,CACF,CAEJ,CAEA,IAAM,EAAS,EAAa,EAAO,YAAY,EAAI,EAEnD,OAAO,EAAO,CACZ,MAAQ,GACN,EAAK,OAAQ,GAAM,CACjB,IAAM,EAAI,EAAE,GAMZ,OAJI,OAAO,GAAM,WAEA,EAAa,EAAE,YAAY,EAAI,EAAA,CAEhC,WAAW,CAAM,CACnC,CAAC,CACL,CAAC,CACH,EACA,SAAwB,CACtB,OAAO,EAAS,EAAK,CAAG,CAC1B,CACF,CACF"}
+{"version":3,"file":"query.cjs","names":[],"sources":["../src/query.ts"],"sourcesContent":["import { VaultError } from './errors';\n\ntype Predicate<T> = (value: T, index: number, array: T[]) => boolean;\n/**\n * `isNonFilter`: when true this op is excluded from `count()` — it does not restrict\n * *which* records match (limit, offset, orderBy), only how results are presented.\n */\ntype QueryOp<T> = { apply: (data: T[]) => T[]; isNonFilter?: boolean };\n\nexport type QueryContext<T extends object> = {\n  deleteMany?: (records: T[]) => Promise<number>;\n  source: () => Promise<T[]>;\n};\n\n/* -------------------- Public interfaces -------------------- */\n\n/**\n * Fluent query builder. `T` is the record type.\n */\nexport interface QueryBuilder<T extends object> {\n  /**\n   * Returns the number of records matching the applied filter predicates.\n   * Presentation-only ops (`limit`, `offset`, `orderBy`) are intentionally ignored — this\n   * always counts the full filtered set, making paginated total-count queries possible\n   * without a second query.\n   */\n  count(): Promise<number>;\n  delete(): Promise<number>;\n  /**\n   * Filter records where `field` exactly equals `value`.\n   */\n  equals<K extends keyof T & string, V extends T[K]>(field: K, value: V): QueryBuilder<T>;\n  filter(fn: Predicate<T>): QueryBuilder<T>;\n  first(): Promise<T | undefined>;\n  limit(n: number): QueryBuilder<T>;\n  offset(n: number): QueryBuilder<T>;\n  orderBy<K extends keyof T>(field: K, direction?: 'asc' | 'desc'): QueryBuilder<T>;\n  toArray(): Promise<T[]>;\n}\n\n/* -------------------- Helpers -------------------- */\n\nasync function applyOps<T extends object>(ctx: QueryContext<T>, ops: readonly QueryOp<T>[]): Promise<T[]> {\n  let data = await ctx.source();\n\n  for (const op of ops) {\n    data = op.apply(data);\n  }\n\n  return data;\n}\n\nfunction assertNonNegativeInteger(value: number, name: string): number {\n  if (!Number.isInteger(value) || value < 0) {\n    throw new VaultError(`${name} must be a non-negative integer`);\n  }\n\n  return value;\n}\n\n/* -------------------- Factory -------------------- */\n\nexport function createQueryBuilder<T extends object>(\n  ctx: QueryContext<T>,\n  ops: readonly QueryOp<T>[] = [],\n): QueryBuilder<T> {\n  const append = (op: QueryOp<T>): QueryBuilder<T> => createQueryBuilder<T>(ctx, [...ops, op]);\n\n  return {\n    count(): Promise<number> {\n      const filterOps = ops.filter((op) => !op.isNonFilter);\n\n      return applyOps(ctx, filterOps).then((r) => r.length);\n    },\n    async delete(): Promise<number> {\n      if (!ctx.deleteMany) {\n        throw new VaultError('query.delete is not available for this adapter context');\n      }\n\n      const records = await applyOps(ctx, ops);\n\n      return ctx.deleteMany(records);\n    },\n    equals<K extends keyof T & string, V extends T[K]>(field: K, value: V): QueryBuilder<T> {\n      return append({ apply: (data) => data.filter((r) => r[field] === value) });\n    },\n    filter(fn) {\n      return append({ apply: (data) => data.filter(fn) });\n    },\n    first(): Promise<T | undefined> {\n      if (ops.length === 0) return ctx.source().then((r) => r[0]);\n\n      return applyOps(ctx, ops).then((r) => r[0]);\n    },\n    limit(n) {\n      const safeN = assertNonNegativeInteger(n, 'query.limit');\n\n      return append({ apply: (data) => data.slice(0, safeN), isNonFilter: true });\n    },\n    offset(n) {\n      const safeN = assertNonNegativeInteger(n, 'query.offset');\n\n      return append({ apply: (data) => data.slice(safeN), isNonFilter: true });\n    },\n    orderBy(field, direction = 'asc') {\n      return append({\n        apply: (data) => {\n          const sign = direction === 'asc' ? 1 : -1;\n\n          return [...data].sort((a, b) => {\n            const av = a[field] as number | string;\n            const bv = b[field] as number | string;\n\n            if (av === bv) return 0;\n\n            return av > bv ? sign : -sign;\n          });\n        },\n        isNonFilter: true,\n      });\n    },\n    toArray(): Promise<T[]> {\n      return applyOps(ctx, ops);\n    },\n  };\n}\n"],"mappings":"gCA0CA,eAAe,EAA2B,EAAsB,EAA0C,CACxG,IAAI,EAAO,MAAM,EAAI,OAAO,EAE5B,IAAK,IAAM,KAAM,EACf,EAAO,EAAG,MAAM,CAAI,EAGtB,OAAO,CACT,CAEA,SAAS,EAAyB,EAAe,EAAsB,CACrE,GAAI,CAAC,OAAO,UAAU,CAAK,GAAK,EAAQ,EACtC,MAAM,IAAI,EAAA,WAAW,GAAG,EAAK,gCAAgC,EAG/D,OAAO,CACT,CAIA,SAAgB,EACd,EACA,EAA6B,CAAC,EACb,CACjB,IAAM,EAAU,GAAoC,EAAsB,EAAK,CAAC,GAAG,EAAK,CAAE,CAAC,EAE3F,MAAO,CACL,OAAyB,CAGvB,OAAO,EAAS,EAFE,EAAI,OAAQ,GAAO,CAAC,EAAG,WAEpB,CAAS,CAAC,CAAC,KAAM,GAAM,EAAE,MAAM,CACtD,EACA,MAAM,QAA0B,CAC9B,GAAI,CAAC,EAAI,WACP,MAAM,IAAI,EAAA,WAAW,wDAAwD,EAG/E,IAAM,EAAU,MAAM,EAAS,EAAK,CAAG,EAEvC,OAAO,EAAI,WAAW,CAAO,CAC/B,EACA,OAAmD,EAAU,EAA2B,CACtF,OAAO,EAAO,CAAE,MAAQ,GAAS,EAAK,OAAQ,GAAM,EAAE,KAAW,CAAK,CAAE,CAAC,CAC3E,EACA,OAAO,EAAI,CACT,OAAO,EAAO,CAAE,MAAQ,GAAS,EAAK,OAAO,CAAE,CAAE,CAAC,CACpD,EACA,OAAgC,CAG9B,OAFI,EAAI,SAAW,EAAU,EAAI,OAAO,CAAC,CAAC,KAAM,GAAM,EAAE,EAAE,EAEnD,EAAS,EAAK,CAAG,CAAC,CAAC,KAAM,GAAM,EAAE,EAAE,CAC5C,EACA,MAAM,EAAG,CACP,IAAM,EAAQ,EAAyB,EAAG,aAAa,EAEvD,OAAO,EAAO,CAAE,MAAQ,GAAS,EAAK,MAAM,EAAG,CAAK,EAAG,YAAa,EAAK,CAAC,CAC5E,EACA,OAAO,EAAG,CACR,IAAM,EAAQ,EAAyB,EAAG,cAAc,EAExD,OAAO,EAAO,CAAE,MAAQ,GAAS,EAAK,MAAM,CAAK,EAAG,YAAa,EAAK,CAAC,CACzE,EACA,QAAQ,EAAO,EAAY,MAAO,CAChC,OAAO,EAAO,CACZ,MAAQ,GAAS,CACf,IAAM,EAAO,IAAc,MAAQ,EAAI,GAEvC,MAAO,CAAC,GAAG,CAAI,CAAC,CAAC,MAAM,EAAG,IAAM,CAC9B,IAAM,EAAK,EAAE,GACP,EAAK,EAAE,GAIb,OAFI,IAAO,EAAW,EAEf,EAAK,EAAK,EAAO,CAAC,CAC3B,CAAC,CACH,EACA,YAAa,EACf,CAAC,CACH,EACA,SAAwB,CACtB,OAAO,EAAS,EAAK,CAAG,CAC1B,CACF,CACF"}

package/dist/query.d.ts

@@ -7,55 +7,14 @@ type QueryOp<T> = {
     apply: (data: T[]) => T[];
     isNonFilter?: boolean;
 };
-type ComparableFieldKeys<T extends object> = {
-    [K in keyof T]-?: Extract<NonNullable<T[K]>, number | string> extends never ? never : K;
-}[keyof T];
-/**
- * A primary-key range hint that can be pushed down to native storage backends (e.g. IndexedDB).
- * When `QueryContext.getRange` and `keyField` are present, a matching first filter op replaces
- * the full-table `source()` scan with a targeted range fetch.
- */
-export type NativeRange = {
-    type: 'eq';
-    value: unknown;
-} | {
-    lower: unknown;
-    type: 'between';
-    upper: unknown;
-} | {
-    prefix: string;
-    type: 'starts';
-};
 export type QueryContext<T extends object> = {
     deleteMany?: (records: T[]) => Promise<number>;
-    /**
-     * When present alongside `indexedFields`, replaces `source()` for secondary-index filter ops.
-     * Only activated when the first op is `equals`, `between`, or `startsWith` on a field that
-     * has an index registered in the schema. IndexedDB uses `IDBIndex.getAll(range)` under the hood.
-     */
-    getIndexRange?: (field: string, range: NativeRange) => Promise<T[]>;
-    /**
-     * When present alongside `keyField`, replaces `source()` for primary-key filter ops.
-     * Only activated when the first op is an `equals`, `between`, or case-sensitive `startsWith`
-     * on `keyField`. All remaining ops still run in-memory against the range result.
-     */
-    getRange?: (range: NativeRange) => Promise<T[]>;
-    /** Fields that have secondary indexes — used to detect when a filter op can use `getIndexRange`. */
-    indexedFields?: ReadonlySet<string>;
-    /** Primary key field name — used to detect when a filter op can be pushed to `getRange`. */
-    keyField?: string;
     source: () => Promise<T[]>;
 };
 /**
- * Shared query methods. `T` is the base record type; `N` is the progressively-narrowed type
- * accumulated by `equals()` calls.
+ * Fluent query builder. `T` is the record type.
  */
-type ChainedQuery<T extends object, N extends T, Self extends ChainedQuery<T, N, Self>> = {
-    /**
-     * Filter records where `field` is between `lower` and `upper` (inclusive).
-     * Preserves any type narrowing already accumulated by prior `equals()` calls.
-     */
-    between<K extends ComparableFieldKeys<T>>(field: K, lower: Extract<NonNullable<T[K]>, number | string>, upper: Extract<NonNullable<T[K]>, number | string>): QueryBuilder<T, N>;
+export interface QueryBuilder<T extends object> {
     /**
      * Returns the number of records matching the applied filter predicates.
      * Presentation-only ops (`limit`, `offset`, `orderBy`) are intentionally ignored — this
@@ -63,45 +22,18 @@ type ChainedQuery<T extends object, N extends T, Self extends ChainedQuery<T, N,
      * without a second query.
      */
     count(): Promise<number>;
+    delete(): Promise<number>;
     /**
      * Filter records where `field` exactly equals `value`.
-     * The return type is narrowed to `QueryBuilder<T & Record<K, V>>` so that subsequent
-     * `.toArray()`, `.first()`, etc. reflect the equality constraint in their result type.
-     *
-     * ```ts
-     * // result: (User & { role: 'admin' })[]
-     * const admins = await db.query('users').equals('role', 'admin').toArray();
-     * ```
-     */
-    equals<K extends keyof T & string, V extends T[K]>(field: K, value: V): QueryBuilder<T & Record<K, V>>;
-    /**
-     * Returns `true` if at least one record matches all applied filter operations.
-     * Equivalent to `(await query.first()) !== undefined` but makes the intent explicit.
-     * Presentation-only ops (`limit`, `offset`, `orderBy`) are respected before checking.
      */
-    exists(): Promise<boolean>;
-    filter(fn: Predicate<N>): Self;
-    first(): Promise<N | undefined>;
-    limit(n: number): Self;
-    offset(n: number): Self;
-    orderBy<K extends keyof T>(field: K, direction?: 'asc' | 'desc'): Self;
-    /**
-     * Filter records where `field` starts with `prefix`.
-     * Preserves any type narrowing already accumulated by prior `equals()` calls.
-     *
-     * **Index push-down** is only active when `ignoreCase` is `false` (default) and this
-     * is the first operation in the chain. With `ignoreCase: true`, a full-table scan is
-     * always performed regardless of whether the field has an index.
-     */
-    startsWith<K extends keyof T>(field: K, prefix: string, options?: {
-        ignoreCase?: boolean;
-    }): QueryBuilder<T, N>;
-    toArray(): Promise<N[]>;
-};
-/** Extends the shared query API with `delete()`. Available on stores and IndexedDB transaction callbacks. */
-export interface QueryBuilder<T extends object, N extends T = T> extends ChainedQuery<T, N, QueryBuilder<T, N>> {
-    delete(): Promise<number>;
+    equals<K extends keyof T & string, V extends T[K]>(field: K, value: V): QueryBuilder<T>;
+    filter(fn: Predicate<T>): QueryBuilder<T>;
+    first(): Promise<T | undefined>;
+    limit(n: number): QueryBuilder<T>;
+    offset(n: number): QueryBuilder<T>;
+    orderBy<K extends keyof T>(field: K, direction?: 'asc' | 'desc'): QueryBuilder<T>;
+    toArray(): Promise<T[]>;
 }
-export declare function createQueryBuilder<T extends object, N extends T = T>(ctx: QueryContext<T>, ops?: readonly QueryOp<T>[]): QueryBuilder<T, N>;
+export declare function createQueryBuilder<T extends object>(ctx: QueryContext<T>, ops?: readonly QueryOp<T>[]): QueryBuilder<T>;
 export {};
 //# sourceMappingURL=query.d.ts.map

package/dist/query.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"query.d.ts","sourceRoot":"","sources":["../src/query.ts"],"names":[],"mappings":"AAEA,KAAK,SAAS,CAAC,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,OAAO,CAAC;AACrE;;;GAGG;AACH,KAAK,OAAO,CAAC,CAAC,IAAI;IAAE,KAAK,EAAE,CAAC,IAAI,EAAE,CAAC,EAAE,KAAK,CAAC,EAAE,CAAC;IAAC,WAAW,CAAC,EAAE,OAAO,CAAA;CAAE,CAAC;AACvE,KAAK,mBAAmB,CAAC,CAAC,SAAS,MAAM,IAAI;KAC1C,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAAC,SAAS,KAAK,GAAG,KAAK,GAAG,CAAC;CACxF,CAAC,MAAM,CAAC,CAAC,CAAC;AAEX;;;;GAIG;AACH,MAAM,MAAM,WAAW,GACnB;IAAE,IAAI,EAAE,IAAI,CAAC;IAAC,KAAK,EAAE,OAAO,CAAA;CAAE,GAC9B;IAAE,KAAK,EAAE,OAAO,CAAC;IAAC,IAAI,EAAE,SAAS,CAAC;IAAC,KAAK,EAAE,OAAO,CAAA;CAAE,GACnD;IAAE,MAAM,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,QAAQ,CAAA;CAAE,CAAC;AAEvC,MAAM,MAAM,YAAY,CAAC,CAAC,SAAS,MAAM,IAAI;IAC3C,UAAU,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,EAAE,KAAK,OAAO,CAAC,MAAM,CAAC,CAAC;IAC/C;;;;OAIG;IACH,aAAa,CAAC,EAAE,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,WAAW,KAAK,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC;IACpE;;;;OAIG;IACH,QAAQ,CAAC,EAAE,CAAC,KAAK,EAAE,WAAW,KAAK,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC;IAChD,oGAAoG;IACpG,aAAa,CAAC,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC;IACpC,4FAA4F;IAC5F,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,MAAM,EAAE,MAAM,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC;CAC5B,CAAC;AAIF;;;GAGG;AACH,KAAK,YAAY,CAAC,CAAC,SAAS,MAAM,EAAE,CAAC,SAAS,CAAC,EAAE,IAAI,SAAS,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,IAAI;IACxF;;;OAGG;IACH,OAAO,CAAC,CAAC,SAAS,mBAAmB,CAAC,CAAC,CAAC,EACtC,KAAK,EAAE,CAAC,EACR,KAAK,EAAE,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAAC,EAClD,KAAK,EAAE,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAAC,GACjD,YAAY,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACtB;;;;;OAKG;IACH,KAAK,IAAI,OAAO,CAAC,MAAM,CAAC,CAAC;IACzB;;;;;;;;;OASG;IACH,MAAM,CAAC,CAAC,SAAS,MAAM,CAAC,GAAG,MAAM,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,YAAY,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACvG;;;;OAIG;IACH,MAAM,IAAI,OAAO,CAAC,OAAO,CAAC,CAAC;IAC3B,MAAM,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;IAC/B,KAAK,IAAI,OAAO,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC;IAChC,KAAK,CAAC,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IACvB,MAAM,CAAC,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IACxB,OAAO,CAAC,CAAC,SAAS,MAAM,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,SAAS,CAAC,EAAE,KAAK,GAAG,MAAM,GAAG,IAAI,CAAC;IACvE;;;;;;;OAOG;IACH,UAAU,CAAC,CAAC,SAAS,MAAM,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE;QAAE,UAAU,CAAC,EAAE,OAAO,CAAA;KAAE,GAAG,YAAY,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAChH,OAAO,IAAI,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC;CACzB,CAAC;AAEF,6GAA6G;AAC7G,MAAM,WAAW,YAAY,CAAC,CAAC,SAAS,MAAM,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,CAAE,SAAQ,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC7G,MAAM,IAAI,OAAO,CAAC,MAAM,CAAC,CAAC;CAC3B;AA+BD,wBAAgB,kBAAkB,CAAC,CAAC,SAAS,MAAM,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,EAClE,GAAG,EAAE,YAAY,CAAC,CAAC,CAAC,EACpB,GAAG,GAAE,SAAS,OAAO,CAAC,CAAC,CAAC,EAAO,GAC9B,YAAY,CAAC,CAAC,EAAE,CAAC,CAAC,CAwJpB"}
+{"version":3,"file":"query.d.ts","sourceRoot":"","sources":["../src/query.ts"],"names":[],"mappings":"AAEA,KAAK,SAAS,CAAC,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,OAAO,CAAC;AACrE;;;GAGG;AACH,KAAK,OAAO,CAAC,CAAC,IAAI;IAAE,KAAK,EAAE,CAAC,IAAI,EAAE,CAAC,EAAE,KAAK,CAAC,EAAE,CAAC;IAAC,WAAW,CAAC,EAAE,OAAO,CAAA;CAAE,CAAC;AAEvE,MAAM,MAAM,YAAY,CAAC,CAAC,SAAS,MAAM,IAAI;IAC3C,UAAU,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,EAAE,KAAK,OAAO,CAAC,MAAM,CAAC,CAAC;IAC/C,MAAM,EAAE,MAAM,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC;CAC5B,CAAC;AAIF;;GAEG;AACH,MAAM,WAAW,YAAY,CAAC,CAAC,SAAS,MAAM;IAC5C;;;;;OAKG;IACH,KAAK,IAAI,OAAO,CAAC,MAAM,CAAC,CAAC;IACzB,MAAM,IAAI,OAAO,CAAC,MAAM,CAAC,CAAC;IAC1B;;OAEG;IACH,MAAM,CAAC,CAAC,SAAS,MAAM,CAAC,GAAG,MAAM,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;IACxF,MAAM,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;IAC1C,KAAK,IAAI,OAAO,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC;IAChC,KAAK,CAAC,CAAC,EAAE,MAAM,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;IAClC,MAAM,CAAC,CAAC,EAAE,MAAM,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;IACnC,OAAO,CAAC,CAAC,SAAS,MAAM,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,SAAS,CAAC,EAAE,KAAK,GAAG,MAAM,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;IAClF,OAAO,IAAI,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC;CACzB;AAwBD,wBAAgB,kBAAkB,CAAC,CAAC,SAAS,MAAM,EACjD,GAAG,EAAE,YAAY,CAAC,CAAC,CAAC,EACpB,GAAG,GAAE,SAAS,OAAO,CAAC,CAAC,CAAC,EAAO,GAC9B,YAAY,CAAC,CAAC,CAAC,CA4DjB"}

package/dist/query.js

@@ -9,81 +9,42 @@ function n(t, n) {
 	if (!Number.isInteger(t) || t < 0) throw new e(`${n} must be a non-negative integer`);
 	return t;
 }
-function r(e, t) {
+function r(i, a = []) {
+	let o = (e) => r(i, [...a, e]);
 	return {
-		deleteMany: e.deleteMany,
-		source: t
-	};
-}
-function i(a, o = []) {
-	let s = (e) => i(a, [...o, e]);
-	return {
-		between(e, t, n) {
-			let c = String(e);
-			if (o.length === 0) {
-				if (a.getRange && a.keyField === c) return i(r(a, () => a.getRange({
-					lower: t,
-					type: "between",
-					upper: n
-				})), o);
-				if (a.getIndexRange && a.indexedFields?.has(c)) return i(r(a, () => a.getIndexRange(c, {
-					lower: t,
-					type: "between",
-					upper: n
-				})), o);
-			}
-			return s({ apply: (r) => r.filter((r) => {
-				let i = r[e];
-				return i >= t && i <= n;
-			}) });
-		},
 		count() {
-			return t(a, o.filter((e) => !e.isNonFilter)).then((e) => e.length);
+			return t(i, a.filter((e) => !e.isNonFilter)).then((e) => e.length);
 		},
 		async delete() {
-			if (!a.deleteMany) throw new e("query.delete is not available for this adapter context");
-			let n = await t(a, o);
-			return a.deleteMany(n);
+			if (!i.deleteMany) throw new e("query.delete is not available for this adapter context");
+			let n = await t(i, a);
+			return i.deleteMany(n);
 		},
 		equals(e, t) {
-			let n = String(e);
-			if (o.length === 0) {
-				if (a.getRange && a.keyField === n) return i(r(a, () => a.getRange({
-					type: "eq",
-					value: t
-				})));
-				if (a.getIndexRange && a.indexedFields?.has(n)) return i(r(a, () => a.getIndexRange(n, {
-					type: "eq",
-					value: t
-				})));
-			}
-			return i(a, [...o, { apply: (n) => n.filter((n) => n[e] === t) }]);
-		},
-		async exists() {
-			return o.length === 0 ? a.source().then((e) => e.length > 0) : t(a, o).then((e) => e.length > 0);
+			return o({ apply: (n) => n.filter((n) => n[e] === t) });
 		},
 		filter(e) {
-			return s({ apply: (t) => t.filter(e) });
+			return o({ apply: (t) => t.filter(e) });
 		},
 		first() {
-			return o.length === 0 ? a.source().then((e) => e[0]) : t(a, o).then((e) => e[0]);
+			return a.length === 0 ? i.source().then((e) => e[0]) : t(i, a).then((e) => e[0]);
 		},
 		limit(e) {
 			let t = n(e, "query.limit");
-			return s({
+			return o({
 				apply: (e) => e.slice(0, t),
 				isNonFilter: !0
 			});
 		},
 		offset(e) {
 			let t = n(e, "query.offset");
-			return s({
+			return o({
 				apply: (e) => e.slice(t),
 				isNonFilter: !0
 			});
 		},
 		orderBy(e, t = "asc") {
-			return s({
+			return o({
 				apply: (n) => {
 					let r = t === "asc" ? 1 : -1;
 					return [...n].sort((t, n) => {
@@ -94,30 +55,12 @@ function i(a, o = []) {
 				isNonFilter: !0
 			});
 		},
-		startsWith(e, t, { ignoreCase: n = !1 } = {}) {
-			let c = String(e);
-			if (!n && t.length > 0 && o.length === 0) {
-				if (a.getRange && a.keyField === c) return i(r(a, () => a.getRange({
-					prefix: t,
-					type: "starts"
-				})), o);
-				if (a.getIndexRange && a.indexedFields?.has(c)) return i(r(a, () => a.getIndexRange(c, {
-					prefix: t,
-					type: "starts"
-				})), o);
-			}
-			let l = n ? t.toLowerCase() : t;
-			return s({ apply: (t) => t.filter((t) => {
-				let r = t[e];
-				return typeof r == "string" && (n ? r.toLowerCase() : r).startsWith(l);
-			}) });
-		},
 		toArray() {
-			return t(a, o);
+			return t(i, a);
 		}
 	};
 }
 //#endregion
-export { i as createQueryBuilder };
+export { r as createQueryBuilder };
 
 //# sourceMappingURL=query.js.map

package/dist/query.js.map

@@ -1 +1 @@
-{"version":3,"file":"query.js","names":[],"sources":["../src/query.ts"],"sourcesContent":["import { VaultError } from './errors';\n\ntype Predicate<T> = (value: T, index: number, array: T[]) => boolean;\n/**\n * `isNonFilter`: when true this op is excluded from `count()` — it does not restrict\n * *which* records match (limit, offset, orderBy), only how results are presented.\n */\ntype QueryOp<T> = { apply: (data: T[]) => T[]; isNonFilter?: boolean };\ntype ComparableFieldKeys<T extends object> = {\n  [K in keyof T]-?: Extract<NonNullable<T[K]>, number | string> extends never ? never : K;\n}[keyof T];\n\n/**\n * A primary-key range hint that can be pushed down to native storage backends (e.g. IndexedDB).\n * When `QueryContext.getRange` and `keyField` are present, a matching first filter op replaces\n * the full-table `source()` scan with a targeted range fetch.\n */\nexport type NativeRange =\n  | { type: 'eq'; value: unknown }\n  | { lower: unknown; type: 'between'; upper: unknown }\n  | { prefix: string; type: 'starts' };\n\nexport type QueryContext<T extends object> = {\n  deleteMany?: (records: T[]) => Promise<number>;\n  /**\n   * When present alongside `indexedFields`, replaces `source()` for secondary-index filter ops.\n   * Only activated when the first op is `equals`, `between`, or `startsWith` on a field that\n   * has an index registered in the schema. IndexedDB uses `IDBIndex.getAll(range)` under the hood.\n   */\n  getIndexRange?: (field: string, range: NativeRange) => Promise<T[]>;\n  /**\n   * When present alongside `keyField`, replaces `source()` for primary-key filter ops.\n   * Only activated when the first op is an `equals`, `between`, or case-sensitive `startsWith`\n   * on `keyField`. All remaining ops still run in-memory against the range result.\n   */\n  getRange?: (range: NativeRange) => Promise<T[]>;\n  /** Fields that have secondary indexes — used to detect when a filter op can use `getIndexRange`. */\n  indexedFields?: ReadonlySet<string>;\n  /** Primary key field name — used to detect when a filter op can be pushed to `getRange`. */\n  keyField?: string;\n  source: () => Promise<T[]>;\n};\n\n/* -------------------- Public interfaces -------------------- */\n\n/**\n * Shared query methods. `T` is the base record type; `N` is the progressively-narrowed type\n * accumulated by `equals()` calls.\n */\ntype ChainedQuery<T extends object, N extends T, Self extends ChainedQuery<T, N, Self>> = {\n  /**\n   * Filter records where `field` is between `lower` and `upper` (inclusive).\n   * Preserves any type narrowing already accumulated by prior `equals()` calls.\n   */\n  between<K extends ComparableFieldKeys<T>>(\n    field: K,\n    lower: Extract<NonNullable<T[K]>, number | string>,\n    upper: Extract<NonNullable<T[K]>, number | string>,\n  ): QueryBuilder<T, N>;\n  /**\n   * Returns the number of records matching the applied filter predicates.\n   * Presentation-only ops (`limit`, `offset`, `orderBy`) are intentionally ignored — this\n   * always counts the full filtered set, making paginated total-count queries possible\n   * without a second query.\n   */\n  count(): Promise<number>;\n  /**\n   * Filter records where `field` exactly equals `value`.\n   * The return type is narrowed to `QueryBuilder<T & Record<K, V>>` so that subsequent\n   * `.toArray()`, `.first()`, etc. reflect the equality constraint in their result type.\n   *\n   * ```ts\n   * // result: (User & { role: 'admin' })[]\n   * const admins = await db.query('users').equals('role', 'admin').toArray();\n   * ```\n   */\n  equals<K extends keyof T & string, V extends T[K]>(field: K, value: V): QueryBuilder<T & Record<K, V>>;\n  /**\n   * Returns `true` if at least one record matches all applied filter operations.\n   * Equivalent to `(await query.first()) !== undefined` but makes the intent explicit.\n   * Presentation-only ops (`limit`, `offset`, `orderBy`) are respected before checking.\n   */\n  exists(): Promise<boolean>;\n  filter(fn: Predicate<N>): Self;\n  first(): Promise<N | undefined>;\n  limit(n: number): Self;\n  offset(n: number): Self;\n  orderBy<K extends keyof T>(field: K, direction?: 'asc' | 'desc'): Self;\n  /**\n   * Filter records where `field` starts with `prefix`.\n   * Preserves any type narrowing already accumulated by prior `equals()` calls.\n   *\n   * **Index push-down** is only active when `ignoreCase` is `false` (default) and this\n   * is the first operation in the chain. With `ignoreCase: true`, a full-table scan is\n   * always performed regardless of whether the field has an index.\n   */\n  startsWith<K extends keyof T>(field: K, prefix: string, options?: { ignoreCase?: boolean }): QueryBuilder<T, N>;\n  toArray(): Promise<N[]>;\n};\n\n/** Extends the shared query API with `delete()`. Available on stores and IndexedDB transaction callbacks. */\nexport interface QueryBuilder<T extends object, N extends T = T> extends ChainedQuery<T, N, QueryBuilder<T, N>> {\n  delete(): Promise<number>;\n}\n\n/* -------------------- Helpers -------------------- */\n\nasync function applyOps<T extends object>(ctx: QueryContext<T>, ops: readonly QueryOp<T>[]): Promise<T[]> {\n  let data = await ctx.source();\n\n  for (const op of ops) {\n    data = op.apply(data);\n  }\n\n  return data;\n}\n\nfunction assertNonNegativeInteger(value: number, name: string): number {\n  if (!Number.isInteger(value) || value < 0) {\n    throw new VaultError(`${name} must be a non-negative integer`);\n  }\n\n  return value;\n}\n\n/* -------------------- Push-down helpers -------------------- */\n\n/** Build a new QueryContext with source replaced by a range/index fetch. Drops range hints since push-down is done. */\nfunction pushDownContext<T extends object>(ctx: QueryContext<T>, newSource: () => Promise<T[]>): QueryContext<T> {\n  return { deleteMany: ctx.deleteMany, source: newSource };\n}\n\n/* -------------------- Factory -------------------- */\n\nexport function createQueryBuilder<T extends object, N extends T = T>(\n  ctx: QueryContext<T>,\n  ops: readonly QueryOp<T>[] = [],\n): QueryBuilder<T, N> {\n  const append = (op: QueryOp<T>): QueryBuilder<T, N> => createQueryBuilder<T, N>(ctx, [...ops, op]);\n\n  return {\n    between(field, lower, upper) {\n      const fieldStr = String(field);\n\n      if (ops.length === 0) {\n        if (ctx.getRange && ctx.keyField === fieldStr) {\n          return createQueryBuilder(\n            pushDownContext(ctx, () => ctx.getRange!({ lower, type: 'between', upper })),\n            ops,\n          );\n        }\n\n        if (ctx.getIndexRange && ctx.indexedFields?.has(fieldStr)) {\n          return createQueryBuilder(\n            pushDownContext(ctx, () => ctx.getIndexRange!(fieldStr, { lower, type: 'between', upper })),\n            ops,\n          );\n        }\n      }\n\n      return append({\n        apply: (data) =>\n          data.filter((r) => {\n            const v = r[field] as number | string;\n\n            return v >= lower && v <= upper;\n          }),\n      }) as unknown as QueryBuilder<T, N>;\n    },\n    count(): Promise<number> {\n      const filterOps = ops.filter((op) => !op.isNonFilter);\n\n      return applyOps(ctx, filterOps).then((r) => r.length);\n    },\n    async delete(): Promise<number> {\n      if (!ctx.deleteMany) {\n        throw new VaultError('query.delete is not available for this adapter context');\n      }\n\n      const records = await applyOps(ctx, ops);\n\n      return ctx.deleteMany(records);\n    },\n    equals<K extends keyof T & string, V extends T[K]>(field: K, value: V): QueryBuilder<T & Record<K, V>> {\n      const fieldStr = String(field);\n\n      if (ops.length === 0) {\n        if (ctx.getRange && ctx.keyField === fieldStr) {\n          return createQueryBuilder<T & Record<K, V>>(\n            pushDownContext(\n              ctx as unknown as QueryContext<T & Record<K, V>>,\n              () => ctx.getRange!({ type: 'eq', value }) as Promise<(T & Record<K, V>)[]>,\n            ),\n          ) as QueryBuilder<T & Record<K, V>>;\n        }\n\n        if (ctx.getIndexRange && ctx.indexedFields?.has(fieldStr)) {\n          return createQueryBuilder<T & Record<K, V>>(\n            pushDownContext(\n              ctx as unknown as QueryContext<T & Record<K, V>>,\n              () => ctx.getIndexRange!(fieldStr, { type: 'eq', value }) as Promise<(T & Record<K, V>)[]>,\n            ),\n          ) as QueryBuilder<T & Record<K, V>>;\n        }\n      }\n\n      return createQueryBuilder<T & Record<K, V>>(ctx as unknown as QueryContext<T & Record<K, V>>, [\n        ...(ops as unknown as QueryOp<T & Record<K, V>>[]),\n        { apply: (data) => data.filter((r) => r[field] === value) as (T & Record<K, V>)[] },\n      ]);\n    },\n    async exists(): Promise<boolean> {\n      if (ops.length === 0) return ctx.source().then((r) => r.length > 0);\n\n      return applyOps(ctx, ops).then((r) => r.length > 0);\n    },\n    filter(fn) {\n      return append({ apply: (data) => data.filter(fn as Predicate<T>) });\n    },\n    first(): Promise<N | undefined> {\n      if (ops.length === 0) return ctx.source().then((r) => r[0] as N | undefined);\n\n      return applyOps(ctx, ops).then((r) => r[0] as N | undefined);\n    },\n    limit(n) {\n      const safeN = assertNonNegativeInteger(n, 'query.limit');\n\n      return append({ apply: (data) => data.slice(0, safeN), isNonFilter: true });\n    },\n    offset(n) {\n      const safeN = assertNonNegativeInteger(n, 'query.offset');\n\n      return append({ apply: (data) => data.slice(safeN), isNonFilter: true });\n    },\n    orderBy(field, direction = 'asc') {\n      return append({\n        apply: (data) => {\n          const sign = direction === 'asc' ? 1 : -1;\n\n          return [...data].sort((a, b) => {\n            const av = a[field] as number | string;\n            const bv = b[field] as number | string;\n\n            if (av === bv) return 0;\n\n            return av > bv ? sign : -sign;\n          });\n        },\n        isNonFilter: true,\n      });\n    },\n    startsWith(field, prefix, { ignoreCase = false } = {}) {\n      const fieldStr = String(field);\n\n      if (!ignoreCase && prefix.length > 0 && ops.length === 0) {\n        if (ctx.getRange && ctx.keyField === fieldStr) {\n          return createQueryBuilder(\n            pushDownContext(ctx, () => ctx.getRange!({ prefix, type: 'starts' })),\n            ops,\n          );\n        }\n\n        if (ctx.getIndexRange && ctx.indexedFields?.has(fieldStr)) {\n          return createQueryBuilder(\n            pushDownContext(ctx, () => ctx.getIndexRange!(fieldStr, { prefix, type: 'starts' })),\n            ops,\n          );\n        }\n      }\n\n      const needle = ignoreCase ? prefix.toLowerCase() : prefix;\n\n      return append({\n        apply: (data) =>\n          data.filter((r) => {\n            const v = r[field];\n\n            if (typeof v !== 'string') return false;\n\n            const haystack = ignoreCase ? v.toLowerCase() : v;\n\n            return haystack.startsWith(needle);\n          }),\n      }) as unknown as QueryBuilder<T, N>;\n    },\n    toArray(): Promise<N[]> {\n      return applyOps(ctx, ops) as Promise<N[]>;\n    },\n  };\n}\n"],"mappings":";;AA2GA,eAAe,EAA2B,GAAsB,GAA0C;CACxG,IAAI,IAAO,MAAM,EAAI,OAAO;CAE5B,KAAK,IAAM,KAAM,GACf,IAAO,EAAG,MAAM,CAAI;CAGtB,OAAO;AACT;AAEA,SAAS,EAAyB,GAAe,GAAsB;CACrE,IAAI,CAAC,OAAO,UAAU,CAAK,KAAK,IAAQ,GACtC,MAAM,IAAI,EAAW,GAAG,EAAK,gCAAgC;CAG/D,OAAO;AACT;AAKA,SAAS,EAAkC,GAAsB,GAAgD;CAC/G,OAAO;EAAE,YAAY,EAAI;EAAY,QAAQ;CAAU;AACzD;AAIA,SAAgB,EACd,GACA,IAA6B,CAAC,GACV;CACpB,IAAM,KAAU,MAAuC,EAAyB,GAAK,CAAC,GAAG,GAAK,CAAE,CAAC;CAEjG,OAAO;EACL,QAAQ,GAAO,GAAO,GAAO;GAC3B,IAAM,IAAW,OAAO,CAAK;GAE7B,IAAI,EAAI,WAAW,GAAG;IACpB,IAAI,EAAI,YAAY,EAAI,aAAa,GACnC,OAAO,EACL,EAAgB,SAAW,EAAI,SAAU;KAAE;KAAO,MAAM;KAAW;IAAM,CAAC,CAAC,GAC3E,CACF;IAGF,IAAI,EAAI,iBAAiB,EAAI,eAAe,IAAI,CAAQ,GACtD,OAAO,EACL,EAAgB,SAAW,EAAI,cAAe,GAAU;KAAE;KAAO,MAAM;KAAW;IAAM,CAAC,CAAC,GAC1F,CACF;GAEJ;GAEA,OAAO,EAAO,EACZ,QAAQ,MACN,EAAK,QAAQ,MAAM;IACjB,IAAM,IAAI,EAAE;IAEZ,OAAO,KAAK,KAAS,KAAK;GAC5B,CAAC,EACL,CAAC;EACH;EACA,QAAyB;GAGvB,OAAO,EAAS,GAFE,EAAI,QAAQ,MAAO,CAAC,EAAG,WAEpB,CAAS,CAAC,CAAC,MAAM,MAAM,EAAE,MAAM;EACtD;EACA,MAAM,SAA0B;GAC9B,IAAI,CAAC,EAAI,YACP,MAAM,IAAI,EAAW,wDAAwD;GAG/E,IAAM,IAAU,MAAM,EAAS,GAAK,CAAG;GAEvC,OAAO,EAAI,WAAW,CAAO;EAC/B;EACA,OAAmD,GAAU,GAA0C;GACrG,IAAM,IAAW,OAAO,CAAK;GAE7B,IAAI,EAAI,WAAW,GAAG;IACpB,IAAI,EAAI,YAAY,EAAI,aAAa,GACnC,OAAO,EACL,EACE,SACM,EAAI,SAAU;KAAE,MAAM;KAAM;IAAM,CAAC,CAC3C,CACF;IAGF,IAAI,EAAI,iBAAiB,EAAI,eAAe,IAAI,CAAQ,GACtD,OAAO,EACL,EACE,SACM,EAAI,cAAe,GAAU;KAAE,MAAM;KAAM;IAAM,CAAC,CAC1D,CACF;GAEJ;GAEA,OAAO,EAAqC,GAAkD,CAC5F,GAAI,GACJ,EAAE,QAAQ,MAAS,EAAK,QAAQ,MAAM,EAAE,OAAW,CAAK,EAA0B,CACpF,CAAC;EACH;EACA,MAAM,SAA2B;GAG/B,OAFI,EAAI,WAAW,IAAU,EAAI,OAAO,CAAC,CAAC,MAAM,MAAM,EAAE,SAAS,CAAC,IAE3D,EAAS,GAAK,CAAG,CAAC,CAAC,MAAM,MAAM,EAAE,SAAS,CAAC;EACpD;EACA,OAAO,GAAI;GACT,OAAO,EAAO,EAAE,QAAQ,MAAS,EAAK,OAAO,CAAkB,EAAE,CAAC;EACpE;EACA,QAAgC;GAG9B,OAFI,EAAI,WAAW,IAAU,EAAI,OAAO,CAAC,CAAC,MAAM,MAAM,EAAE,EAAmB,IAEpE,EAAS,GAAK,CAAG,CAAC,CAAC,MAAM,MAAM,EAAE,EAAmB;EAC7D;EACA,MAAM,GAAG;GACP,IAAM,IAAQ,EAAyB,GAAG,aAAa;GAEvD,OAAO,EAAO;IAAE,QAAQ,MAAS,EAAK,MAAM,GAAG,CAAK;IAAG,aAAa;GAAK,CAAC;EAC5E;EACA,OAAO,GAAG;GACR,IAAM,IAAQ,EAAyB,GAAG,cAAc;GAExD,OAAO,EAAO;IAAE,QAAQ,MAAS,EAAK,MAAM,CAAK;IAAG,aAAa;GAAK,CAAC;EACzE;EACA,QAAQ,GAAO,IAAY,OAAO;GAChC,OAAO,EAAO;IACZ,QAAQ,MAAS;KACf,IAAM,IAAO,MAAc,QAAQ,IAAI;KAEvC,OAAO,CAAC,GAAG,CAAI,CAAC,CAAC,MAAM,GAAG,MAAM;MAC9B,IAAM,IAAK,EAAE,IACP,IAAK,EAAE;MAIb,OAFI,MAAO,IAAW,IAEf,IAAK,IAAK,IAAO,CAAC;KAC3B,CAAC;IACH;IACA,aAAa;GACf,CAAC;EACH;EACA,WAAW,GAAO,GAAQ,EAAE,gBAAa,OAAU,CAAC,GAAG;GACrD,IAAM,IAAW,OAAO,CAAK;GAE7B,IAAI,CAAC,KAAc,EAAO,SAAS,KAAK,EAAI,WAAW,GAAG;IACxD,IAAI,EAAI,YAAY,EAAI,aAAa,GACnC,OAAO,EACL,EAAgB,SAAW,EAAI,SAAU;KAAE;KAAQ,MAAM;IAAS,CAAC,CAAC,GACpE,CACF;IAGF,IAAI,EAAI,iBAAiB,EAAI,eAAe,IAAI,CAAQ,GACtD,OAAO,EACL,EAAgB,SAAW,EAAI,cAAe,GAAU;KAAE;KAAQ,MAAM;IAAS,CAAC,CAAC,GACnF,CACF;GAEJ;GAEA,IAAM,IAAS,IAAa,EAAO,YAAY,IAAI;GAEnD,OAAO,EAAO,EACZ,QAAQ,MACN,EAAK,QAAQ,MAAM;IACjB,IAAM,IAAI,EAAE;IAMZ,OAJI,OAAO,KAAM,aAEA,IAAa,EAAE,YAAY,IAAI,EAAA,CAEhC,WAAW,CAAM;GACnC,CAAC,EACL,CAAC;EACH;EACA,UAAwB;GACtB,OAAO,EAAS,GAAK,CAAG;EAC1B;CACF;AACF"}
+{"version":3,"file":"query.js","names":[],"sources":["../src/query.ts"],"sourcesContent":["import { VaultError } from './errors';\n\ntype Predicate<T> = (value: T, index: number, array: T[]) => boolean;\n/**\n * `isNonFilter`: when true this op is excluded from `count()` — it does not restrict\n * *which* records match (limit, offset, orderBy), only how results are presented.\n */\ntype QueryOp<T> = { apply: (data: T[]) => T[]; isNonFilter?: boolean };\n\nexport type QueryContext<T extends object> = {\n  deleteMany?: (records: T[]) => Promise<number>;\n  source: () => Promise<T[]>;\n};\n\n/* -------------------- Public interfaces -------------------- */\n\n/**\n * Fluent query builder. `T` is the record type.\n */\nexport interface QueryBuilder<T extends object> {\n  /**\n   * Returns the number of records matching the applied filter predicates.\n   * Presentation-only ops (`limit`, `offset`, `orderBy`) are intentionally ignored — this\n   * always counts the full filtered set, making paginated total-count queries possible\n   * without a second query.\n   */\n  count(): Promise<number>;\n  delete(): Promise<number>;\n  /**\n   * Filter records where `field` exactly equals `value`.\n   */\n  equals<K extends keyof T & string, V extends T[K]>(field: K, value: V): QueryBuilder<T>;\n  filter(fn: Predicate<T>): QueryBuilder<T>;\n  first(): Promise<T | undefined>;\n  limit(n: number): QueryBuilder<T>;\n  offset(n: number): QueryBuilder<T>;\n  orderBy<K extends keyof T>(field: K, direction?: 'asc' | 'desc'): QueryBuilder<T>;\n  toArray(): Promise<T[]>;\n}\n\n/* -------------------- Helpers -------------------- */\n\nasync function applyOps<T extends object>(ctx: QueryContext<T>, ops: readonly QueryOp<T>[]): Promise<T[]> {\n  let data = await ctx.source();\n\n  for (const op of ops) {\n    data = op.apply(data);\n  }\n\n  return data;\n}\n\nfunction assertNonNegativeInteger(value: number, name: string): number {\n  if (!Number.isInteger(value) || value < 0) {\n    throw new VaultError(`${name} must be a non-negative integer`);\n  }\n\n  return value;\n}\n\n/* -------------------- Factory -------------------- */\n\nexport function createQueryBuilder<T extends object>(\n  ctx: QueryContext<T>,\n  ops: readonly QueryOp<T>[] = [],\n): QueryBuilder<T> {\n  const append = (op: QueryOp<T>): QueryBuilder<T> => createQueryBuilder<T>(ctx, [...ops, op]);\n\n  return {\n    count(): Promise<number> {\n      const filterOps = ops.filter((op) => !op.isNonFilter);\n\n      return applyOps(ctx, filterOps).then((r) => r.length);\n    },\n    async delete(): Promise<number> {\n      if (!ctx.deleteMany) {\n        throw new VaultError('query.delete is not available for this adapter context');\n      }\n\n      const records = await applyOps(ctx, ops);\n\n      return ctx.deleteMany(records);\n    },\n    equals<K extends keyof T & string, V extends T[K]>(field: K, value: V): QueryBuilder<T> {\n      return append({ apply: (data) => data.filter((r) => r[field] === value) });\n    },\n    filter(fn) {\n      return append({ apply: (data) => data.filter(fn) });\n    },\n    first(): Promise<T | undefined> {\n      if (ops.length === 0) return ctx.source().then((r) => r[0]);\n\n      return applyOps(ctx, ops).then((r) => r[0]);\n    },\n    limit(n) {\n      const safeN = assertNonNegativeInteger(n, 'query.limit');\n\n      return append({ apply: (data) => data.slice(0, safeN), isNonFilter: true });\n    },\n    offset(n) {\n      const safeN = assertNonNegativeInteger(n, 'query.offset');\n\n      return append({ apply: (data) => data.slice(safeN), isNonFilter: true });\n    },\n    orderBy(field, direction = 'asc') {\n      return append({\n        apply: (data) => {\n          const sign = direction === 'asc' ? 1 : -1;\n\n          return [...data].sort((a, b) => {\n            const av = a[field] as number | string;\n            const bv = b[field] as number | string;\n\n            if (av === bv) return 0;\n\n            return av > bv ? sign : -sign;\n          });\n        },\n        isNonFilter: true,\n      });\n    },\n    toArray(): Promise<T[]> {\n      return applyOps(ctx, ops);\n    },\n  };\n}\n"],"mappings":";;AA0CA,eAAe,EAA2B,GAAsB,GAA0C;CACxG,IAAI,IAAO,MAAM,EAAI,OAAO;CAE5B,KAAK,IAAM,KAAM,GACf,IAAO,EAAG,MAAM,CAAI;CAGtB,OAAO;AACT;AAEA,SAAS,EAAyB,GAAe,GAAsB;CACrE,IAAI,CAAC,OAAO,UAAU,CAAK,KAAK,IAAQ,GACtC,MAAM,IAAI,EAAW,GAAG,EAAK,gCAAgC;CAG/D,OAAO;AACT;AAIA,SAAgB,EACd,GACA,IAA6B,CAAC,GACb;CACjB,IAAM,KAAU,MAAoC,EAAsB,GAAK,CAAC,GAAG,GAAK,CAAE,CAAC;CAE3F,OAAO;EACL,QAAyB;GAGvB,OAAO,EAAS,GAFE,EAAI,QAAQ,MAAO,CAAC,EAAG,WAEpB,CAAS,CAAC,CAAC,MAAM,MAAM,EAAE,MAAM;EACtD;EACA,MAAM,SAA0B;GAC9B,IAAI,CAAC,EAAI,YACP,MAAM,IAAI,EAAW,wDAAwD;GAG/E,IAAM,IAAU,MAAM,EAAS,GAAK,CAAG;GAEvC,OAAO,EAAI,WAAW,CAAO;EAC/B;EACA,OAAmD,GAAU,GAA2B;GACtF,OAAO,EAAO,EAAE,QAAQ,MAAS,EAAK,QAAQ,MAAM,EAAE,OAAW,CAAK,EAAE,CAAC;EAC3E;EACA,OAAO,GAAI;GACT,OAAO,EAAO,EAAE,QAAQ,MAAS,EAAK,OAAO,CAAE,EAAE,CAAC;EACpD;EACA,QAAgC;GAG9B,OAFI,EAAI,WAAW,IAAU,EAAI,OAAO,CAAC,CAAC,MAAM,MAAM,EAAE,EAAE,IAEnD,EAAS,GAAK,CAAG,CAAC,CAAC,MAAM,MAAM,EAAE,EAAE;EAC5C;EACA,MAAM,GAAG;GACP,IAAM,IAAQ,EAAyB,GAAG,aAAa;GAEvD,OAAO,EAAO;IAAE,QAAQ,MAAS,EAAK,MAAM,GAAG,CAAK;IAAG,aAAa;GAAK,CAAC;EAC5E;EACA,OAAO,GAAG;GACR,IAAM,IAAQ,EAAyB,GAAG,cAAc;GAExD,OAAO,EAAO;IAAE,QAAQ,MAAS,EAAK,MAAM,CAAK;IAAG,aAAa;GAAK,CAAC;EACzE;EACA,QAAQ,GAAO,IAAY,OAAO;GAChC,OAAO,EAAO;IACZ,QAAQ,MAAS;KACf,IAAM,IAAO,MAAc,QAAQ,IAAI;KAEvC,OAAO,CAAC,GAAG,CAAI,CAAC,CAAC,MAAM,GAAG,MAAM;MAC9B,IAAM,IAAK,EAAE,IACP,IAAK,EAAE;MAIb,OAFI,MAAO,IAAW,IAEf,IAAK,IAAK,IAAO,CAAC;KAC3B,CAAC;IACH;IACA,aAAa;GACf,CAAC;EACH;EACA,UAAwB;GACtB,OAAO,EAAS,GAAK,CAAG;EAC1B;CACF;AACF"}

package/dist/sqlite.d.ts

@@ -1,3 +1,3 @@
-export type { SQLiteDatabase, SQLiteParameter, SQLiteStatement, SQLiteVaultOptions, SQLiteVaultStore, TransactionContext, } from './adapters/sqlite';
+export type { SQLiteDatabase, SQLiteParameter, SQLiteStatement, SQLiteVaultOptions, TransactionContext, } from './adapters/sqlite';
 export { createSQLite } from './adapters/sqlite';
 //# sourceMappingURL=sqlite.d.ts.map

package/dist/sqlite.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"sqlite.d.ts","sourceRoot":"","sources":["../src/sqlite.ts"],"names":[],"mappings":"AAAA,YAAY,EACV,cAAc,EACd,eAAe,EACf,eAAe,EACf,kBAAkB,EAClB,gBAAgB,EAChB,kBAAkB,GACnB,MAAM,mBAAmB,CAAC;AAC3B,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC"}
+{"version":3,"file":"sqlite.d.ts","sourceRoot":"","sources":["../src/sqlite.ts"],"names":[],"mappings":"AAAA,YAAY,EACV,cAAc,EACd,eAAe,EACf,eAAe,EACf,kBAAkB,EAClB,kBAAkB,GACnB,MAAM,mBAAmB,CAAC;AAC3B,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC"}

package/dist/types.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"types.cjs","names":[],"sources":["../src/types.ts"],"sourcesContent":["/// <reference lib=\"dom\" />\n\nimport { VaultError } from './errors';\nimport type { QueryBuilder } from './query';\nimport { assertPositiveFinite } from './ttl';\n\n/** Portable primary-key values. Vault preserves their type and encodes them distinctly at rest. */\nexport type VaultKey = number | string;\n\n/** A typed table definition whose primary-key field must hold a portable Vault key. */\nexport type SchemaEntry<T extends object, Key extends keyof T & string = keyof T & string> = {\n  defaultTtl?: number;\n  /** IndexedDB creates these as `value.<field>` indexes; other stores filter in memory. */\n  indexes?: readonly (keyof T & string)[];\n  key: Key;\n};\n\nexport type AnySchema = Record<string, { defaultTtl?: number; indexes?: readonly string[]; key: string }>;\n\nexport type RecordOf<S extends AnySchema, K extends keyof S> =\n  S[K] extends SchemaEntry<infer R, infer _Key> ? R : never;\nexport type KeyOf<S extends AnySchema, K extends keyof S> = Extract<\n  S[K] extends SchemaEntry<infer R, infer Key> ? R[Key] : never,\n  VaultKey\n>;\n\nexport type VaultLogger = {\n  error(message: string, context?: Error | Record<string, unknown>): void;\n};\n\nexport type RecordValidator<T> = {\n  parse(value: unknown): T;\n};\n\nexport type TableValidators<S extends AnySchema> = {\n  [K in keyof S]?: RecordValidator<RecordOf<S, K>>;\n};\n\nexport type Observer<T> = (records: T[]) => void;\nexport type Unsubscribe = () => void;\n\n/** Shared factory options. Values always use Vault's fixed `{ value, expiresAt? }` envelope. */\nexport type BaseAdapterOptions<S extends AnySchema> = {\n  logger?: VaultLogger;\n  onMetrics?: (event: MetricsEvent) => void;\n  schema: S;\n  validators?: TableValidators<S>;\n};\n\nexport type MetricsEvent = {\n  duration: number;\n  operation:\n    | 'batch'\n    | 'clear'\n    | 'count'\n    | 'delete'\n    | 'deleteMany'\n    | 'entries'\n    | 'get'\n    | 'getAll'\n    | 'getMany'\n    | 'getOrDefault'\n    | 'has'\n    | 'isEmpty'\n    | 'keys'\n    | 'put'\n    | 'putAll'\n    | 'query'\n    | 'queryDelete'\n    | 'update'\n    | 'upsert';\n  table: string;\n};\n\nexport type DebugStats = { expiredCount: number; recordCount: number };\nexport type DebugInfo<S extends AnySchema> = { tables: Array<{ name: keyof S & string } & DebugStats> };\n\n/** Methods available within an IndexedDB or SQLite transaction. */\nexport type TransactionContext<S extends AnySchema, K extends keyof S & string = keyof S & string> = {\n  clear<T extends K>(table: T): Promise<void>;\n  count<T extends K>(table: T): Promise<number>;\n  delete<T extends K>(table: T, key: KeyOf<S, T>): Promise<boolean>;\n  deleteMany<T extends K>(table: T, keys: KeyOf<S, T>[]): Promise<number>;\n  entries<T extends K>(table: T): Promise<Array<[KeyOf<S, T>, RecordOf<S, T>]>>;\n  get<T extends K>(table: T, key: KeyOf<S, T>): Promise<RecordOf<S, T> | undefined>;\n  getAll<T extends K>(table: T): Promise<RecordOf<S, T>[]>;\n  getMany<T extends K>(table: T, keys: KeyOf<S, T>[]): Promise<Array<RecordOf<S, T> | undefined>>;\n  getOrDefault<T extends K>(\n    table: T,\n    key: KeyOf<S, T>,\n    defaultFn: () => RecordOf<S, T>,\n    ttl?: number,\n  ): Promise<RecordOf<S, T>>;\n  has<T extends K>(table: T, key: KeyOf<S, T>): Promise<boolean>;\n  isEmpty<T extends K>(table: T): Promise<boolean>;\n  keys<T extends K>(table: T, filter?: (record: RecordOf<S, T>) => boolean): Promise<KeyOf<S, T>[]>;\n  put<T extends K>(table: T, value: RecordOf<S, T>, ttl?: number): Promise<void>;\n  putAll<T extends K>(table: T, values: RecordOf<S, T>[], ttl?: number): Promise<void>;\n  query<T extends K>(table: T): QueryBuilder<RecordOf<S, T>>;\n  update<T extends K>(\n    table: T,\n    key: KeyOf<S, T>,\n    changes: Partial<RecordOf<S, T>>,\n    ttl?: number,\n  ): Promise<RecordOf<S, T> | undefined>;\n  upsert<T extends K>(\n    table: T,\n    key: KeyOf<S, T>,\n    fn: (existing: RecordOf<S, T> | undefined) => RecordOf<S, T>,\n    ttl?: number,\n  ): Promise<RecordOf<S, T>>;\n};\n\n/** Portable API returned by memory and Web Storage factories. */\nexport interface VaultStore<S extends AnySchema> {\n  clear<K extends keyof S & string>(table: K): Promise<void>;\n  count<K extends keyof S & string>(table: K): Promise<number>;\n  debug(): Promise<DebugInfo<S>>;\n  delete<K extends keyof S & string>(table: K, key: KeyOf<S, K>): Promise<boolean>;\n  deleteMany<K extends keyof S & string>(table: K, keys: KeyOf<S, K>[]): Promise<number>;\n  readonly disposalSignal: AbortSignal;\n  dispose(): Promise<void>;\n  readonly disposed: boolean;\n  entries<K extends keyof S & string>(table: K): Promise<Array<[KeyOf<S, K>, RecordOf<S, K>]>>;\n  get<K extends keyof S & string>(table: K, key: KeyOf<S, K>): Promise<RecordOf<S, K> | undefined>;\n  getAll<K extends keyof S & string>(table: K): Promise<RecordOf<S, K>[]>;\n  getMany<K extends keyof S & string>(table: K, keys: KeyOf<S, K>[]): Promise<Array<RecordOf<S, K> | undefined>>;\n  getOrDefault<K extends keyof S & string>(\n    table: K,\n    key: KeyOf<S, K>,\n    defaultFn: () => RecordOf<S, K>,\n    ttl?: number,\n  ): Promise<RecordOf<S, K>>;\n  has<K extends keyof S & string>(table: K, key: KeyOf<S, K>): Promise<boolean>;\n  isEmpty<K extends keyof S & string>(table: K): Promise<boolean>;\n  keys<K extends keyof S & string>(table: K, filter?: (record: RecordOf<S, K>) => boolean): Promise<KeyOf<S, K>[]>;\n  observe<K extends keyof S & string>(\n    table: K,\n    listener: Observer<RecordOf<S, K>>,\n    options?: { immediate?: boolean; signal?: AbortSignal },\n  ): Unsubscribe;\n  pruneExpired(): Promise<Record<keyof S & string, number>>;\n  put<K extends keyof S & string>(table: K, value: RecordOf<S, K>, ttl?: number): Promise<void>;\n  putAll<K extends keyof S & string>(table: K, values: RecordOf<S, K>[], ttl?: number): Promise<void>;\n  query<K extends keyof S & string>(table: K): QueryBuilder<RecordOf<S, K>>;\n  update<K extends keyof S & string>(\n    table: K,\n    key: KeyOf<S, K>,\n    changes: Partial<RecordOf<S, K>>,\n    ttl?: number,\n  ): Promise<RecordOf<S, K> | undefined>;\n  upsert<K extends keyof S & string>(\n    table: K,\n    key: KeyOf<S, K>,\n    fn: (existing: RecordOf<S, K> | undefined) => RecordOf<S, K>,\n    ttl?: number,\n  ): Promise<RecordOf<S, K>>;\n  [Symbol.asyncDispose](): Promise<void>;\n}\n\n/** Atomic, scoped transactions supplied by storage engines that support them. */\nexport interface TransactionalVaultStore<S extends AnySchema> extends VaultStore<S> {\n  batch<K extends keyof S & string, R>(\n    tables: readonly K[],\n    fn: (tx: TransactionContext<S, K>) => Promise<R>,\n  ): Promise<R>;\n}\n\n/** Lazy record iteration supplied by storage engines that support it. */\nexport interface IterableVaultStore<S extends AnySchema> extends VaultStore<S> {\n  iterate<K extends keyof S & string>(table: K): AsyncIterable<RecordOf<S, K>>;\n}\n\n/** IndexedDB-only guarantees: cursor iteration and atomic, scoped transactions. */\nexport interface IndexedDbVaultStore<S extends AnySchema> extends TransactionalVaultStore<S>, IterableVaultStore<S> {}\n\n/** Define a typed table whose primary-key field holds a portable Vault key. */\nexport function table<T extends object, Key extends keyof T & string = keyof T & string>(\n  key: Key,\n  options: { defaultTtl?: number; indexes?: readonly (keyof T & string)[] } = {},\n): SchemaEntry<T, Key> {\n  const { defaultTtl, indexes } = options;\n\n  if (defaultTtl !== undefined) assertPositiveFinite(defaultTtl, 'table: defaultTtl');\n\n  if (indexes) {\n    const seen = new Set<string>();\n\n    for (const field of indexes) {\n      if (seen.has(field)) {\n        throw new VaultError(`table: index \"${field}\" is already registered`);\n      }\n\n      seen.add(field);\n    }\n  }\n\n  return { defaultTtl, indexes, key } as unknown as SchemaEntry<T, Key>;\n}\n"],"mappings":"uDAiLA,SAAgB,EACd,EACA,EAA4E,CAAC,EACxD,CACrB,GAAM,CAAE,aAAY,WAAY,EAIhC,GAFI,IAAe,IAAA,IAAW,EAAA,qBAAqB,EAAY,mBAAmB,EAE9E,EAAS,CACX,IAAM,EAAO,IAAI,IAEjB,IAAK,IAAM,KAAS,EAAS,CAC3B,GAAI,EAAK,IAAI,CAAK,EAChB,MAAM,IAAI,EAAA,WAAW,iBAAiB,EAAM,wBAAwB,EAGtE,EAAK,IAAI,CAAK,CAChB,CACF,CAEA,MAAO,CAAE,aAAY,UAAS,KAAI,CACpC"}
+{"version":3,"file":"types.cjs","names":[],"sources":["../src/types.ts"],"sourcesContent":["/// <reference lib=\"dom\" />\n\nimport { VaultError } from './errors';\nimport type { QueryBuilder } from './query';\nimport { assertPositiveFinite } from './ttl';\n\n/** Portable primary-key values. Vault preserves their type and encodes them distinctly at rest. */\nexport type VaultKey = number | string;\n\n/** A typed table definition whose primary-key field must hold a portable Vault key. */\nexport type SchemaEntry<T extends object, Key extends keyof T & string = keyof T & string> = {\n  defaultTtl?: number;\n  /** IndexedDB creates these as `value.<field>` indexes; other stores filter in memory. */\n  indexes?: readonly (keyof T & string)[];\n  key: Key;\n};\n\nexport type AnySchema = Record<string, { defaultTtl?: number; indexes?: readonly string[]; key: string }>;\n\nexport type RecordOf<S extends AnySchema, K extends keyof S> =\n  S[K] extends SchemaEntry<infer R, infer _Key> ? R : never;\nexport type KeyOf<S extends AnySchema, K extends keyof S> = Extract<\n  S[K] extends SchemaEntry<infer R, infer Key> ? R[Key] : never,\n  VaultKey\n>;\n\nexport type RecordValidator<T> = {\n  parse(value: unknown): T;\n};\n\nexport type TableValidators<S extends AnySchema> = {\n  [K in keyof S]?: RecordValidator<RecordOf<S, K>>;\n};\n\nexport type Observer<T> = (records: T[]) => void;\nexport type Unsubscribe = () => void;\n\n/** Shared factory options. Values always use Vault's fixed `{ value, expiresAt? }` envelope. */\nexport type BaseAdapterOptions<S extends AnySchema> = {\n  schema: S;\n  validators?: TableValidators<S>;\n};\n\n/** Methods available within an IndexedDB or SQLite transaction. */\nexport type TransactionContext<S extends AnySchema, K extends keyof S & string = keyof S & string> = {\n  clear<T extends K>(table: T): Promise<void>;\n  count<T extends K>(table: T): Promise<number>;\n  delete<T extends K>(table: T, key: KeyOf<S, T>): Promise<boolean>;\n  deleteMany<T extends K>(table: T, keys: KeyOf<S, T>[]): Promise<number>;\n  get<T extends K>(table: T, key: KeyOf<S, T>): Promise<RecordOf<S, T> | undefined>;\n  getAll<T extends K>(table: T): Promise<RecordOf<S, T>[]>;\n  getMany<T extends K>(table: T, keys: KeyOf<S, T>[]): Promise<Array<RecordOf<S, T> | undefined>>;\n  has<T extends K>(table: T, key: KeyOf<S, T>): Promise<boolean>;\n  isEmpty<T extends K>(table: T): Promise<boolean>;\n  keys<T extends K>(table: T, filter?: (record: RecordOf<S, T>) => boolean): Promise<KeyOf<S, T>[]>;\n  put<T extends K>(table: T, value: RecordOf<S, T>, ttl?: number): Promise<void>;\n  putAll<T extends K>(table: T, values: RecordOf<S, T>[], ttl?: number): Promise<void>;\n  query<T extends K>(table: T): QueryBuilder<RecordOf<S, T>>;\n  update<T extends K>(\n    table: T,\n    key: KeyOf<S, T>,\n    changes: Partial<RecordOf<S, T>>,\n    ttl?: number,\n  ): Promise<RecordOf<S, T> | undefined>;\n  upsert<T extends K>(\n    table: T,\n    key: KeyOf<S, T>,\n    fn: (existing: RecordOf<S, T> | undefined) => RecordOf<S, T>,\n    ttl?: number,\n  ): Promise<RecordOf<S, T>>;\n};\n\n/** Portable API returned by memory and Web Storage factories. */\nexport interface VaultStore<S extends AnySchema> {\n  clear<K extends keyof S & string>(table: K): Promise<void>;\n  count<K extends keyof S & string>(table: K): Promise<number>;\n  delete<K extends keyof S & string>(table: K, key: KeyOf<S, K>): Promise<boolean>;\n  deleteMany<K extends keyof S & string>(table: K, keys: KeyOf<S, K>[]): Promise<number>;\n  readonly disposalSignal: AbortSignal;\n  dispose(): Promise<void>;\n  readonly disposed: boolean;\n  get<K extends keyof S & string>(table: K, key: KeyOf<S, K>): Promise<RecordOf<S, K> | undefined>;\n  getAll<K extends keyof S & string>(table: K): Promise<RecordOf<S, K>[]>;\n  getMany<K extends keyof S & string>(table: K, keys: KeyOf<S, K>[]): Promise<Array<RecordOf<S, K> | undefined>>;\n  has<K extends keyof S & string>(table: K, key: KeyOf<S, K>): Promise<boolean>;\n  isEmpty<K extends keyof S & string>(table: K): Promise<boolean>;\n  keys<K extends keyof S & string>(table: K, filter?: (record: RecordOf<S, K>) => boolean): Promise<KeyOf<S, K>[]>;\n  observe<K extends keyof S & string>(\n    table: K,\n    listener: Observer<RecordOf<S, K>>,\n    options?: { immediate?: boolean; signal?: AbortSignal },\n  ): Unsubscribe;\n  pruneExpired(): Promise<Record<keyof S & string, number>>;\n  put<K extends keyof S & string>(table: K, value: RecordOf<S, K>, ttl?: number): Promise<void>;\n  putAll<K extends keyof S & string>(table: K, values: RecordOf<S, K>[], ttl?: number): Promise<void>;\n  query<K extends keyof S & string>(table: K): QueryBuilder<RecordOf<S, K>>;\n  update<K extends keyof S & string>(\n    table: K,\n    key: KeyOf<S, K>,\n    changes: Partial<RecordOf<S, K>>,\n    ttl?: number,\n  ): Promise<RecordOf<S, K> | undefined>;\n  upsert<K extends keyof S & string>(\n    table: K,\n    key: KeyOf<S, K>,\n    fn: (existing: RecordOf<S, K> | undefined) => RecordOf<S, K>,\n    ttl?: number,\n  ): Promise<RecordOf<S, K>>;\n  [Symbol.asyncDispose](): Promise<void>;\n}\n\n/** Atomic, scoped transactions and lazy iteration supplied by storage engines that support them. */\nexport interface TransactionalVaultStore<S extends AnySchema> extends VaultStore<S> {\n  batch<K extends keyof S & string, R>(\n    tables: readonly K[],\n    fn: (tx: TransactionContext<S, K>) => Promise<R>,\n  ): Promise<R>;\n  iterate<K extends keyof S & string>(table: K): AsyncIterable<RecordOf<S, K>>;\n}\n\n/** Define a typed table whose primary-key field holds a portable Vault key. */\nexport function table<T extends object, Key extends keyof T & string = keyof T & string>(\n  key: Key,\n  options: { defaultTtl?: number; indexes?: readonly (keyof T & string)[] } = {},\n): SchemaEntry<T, Key> {\n  const { defaultTtl, indexes } = options;\n\n  if (defaultTtl !== undefined) assertPositiveFinite(defaultTtl, 'table: defaultTtl');\n\n  if (indexes) {\n    const seen = new Set<string>();\n\n    for (const field of indexes) {\n      if (seen.has(field)) {\n        throw new VaultError(`table: index \"${field}\" is already registered`);\n      }\n\n      seen.add(field);\n    }\n  }\n\n  return { defaultTtl, indexes, key };\n}\n"],"mappings":"uDAyHA,SAAgB,EACd,EACA,EAA4E,CAAC,EACxD,CACrB,GAAM,CAAE,aAAY,WAAY,EAIhC,GAFI,IAAe,IAAA,IAAW,EAAA,qBAAqB,EAAY,mBAAmB,EAE9E,EAAS,CACX,IAAM,EAAO,IAAI,IAEjB,IAAK,IAAM,KAAS,EAAS,CAC3B,GAAI,EAAK,IAAI,CAAK,EAChB,MAAM,IAAI,EAAA,WAAW,iBAAiB,EAAM,wBAAwB,EAGtE,EAAK,IAAI,CAAK,CAChB,CACF,CAEA,MAAO,CAAE,aAAY,UAAS,KAAI,CACpC"}