keri-ts 2.0.1 → 2.1.0

package/types/db/core/dber.d.ts

@@ -0,0 +1,505 @@
+/**
+ * Backend-neutral store contract shared by every `keri-ts` database backend.
+ *
+ * ADR-0015 owns the semantics. Backends supply row access and transactions;
+ * the ordinal, insertion-ordered set and insertion-ordered duplicate families
+ * below are built only on those primitives, so every backend shares them.
+ */
+import type { Operation } from "effection";
+import type { Logger } from "../../core/logger.js";
+declare const tableBrand: unique symbol;
+/**
+ * Opaque handle to one named table in one open store.
+ *
+ * Valid only until its store closes or reopens. Only the backend that issued a
+ * handle can interpret it.
+ */
+export interface Table {
+    readonly [tableBrand]: "Table";
+}
+/**
+ * Backend-neutral identity of one store.
+ *
+ * `name` and `base` name the store on every backend; where its bytes live is
+ * each backend's own concern.
+ */
+export interface StoreIdentity {
+    name?: string;
+    base?: string;
+    temp?: boolean;
+    readonly?: boolean;
+    /** Delete the store's contents on close. */
+    clear?: boolean;
+    /** Keep an existing store's contents when reopening it. */
+    reuse?: boolean;
+    /** Open on construction where the backend supports it. */
+    reopen?: boolean;
+    logger?: Logger;
+}
+/** One physical row. Both arrays are caller-owned copies. */
+export interface TableEntry {
+    key: Uint8Array;
+    value: Uint8Array;
+}
+/**
+ * Ordered scan bounds. `start` is inclusive unless `exclusiveStart` is set and
+ * `end` is always exclusive. In reverse, `start` is the upper position and
+ * `end` the lower bound. Dupsort entries order by key, then value.
+ */
+export interface ScanOptions {
+    start?: Uint8Array;
+    end?: Uint8Array;
+    exclusiveStart?: boolean;
+    reverse?: boolean;
+    limit?: number;
+}
+/** The pinned lmdb-js limit on keys and dupsort values, shared by every backend (ADR-0015). */
+export declare const MAX_KEY_BYTES = 1978;
+/**
+ * Shared base for every store backend.
+ *
+ * Subclasses implement the abstract row access. Everything concrete here must
+ * stay free of backend types so a new backend inherits identical family
+ * behavior.
+ */
+export declare abstract class BaseDBer {
+    /** Logical database name. */
+    abstract get name(): string;
+    /** Logical base prefix namespacing `name`. */
+    abstract get base(): string;
+    /** True while the store can serve reads and writes. */
+    abstract get opened(): boolean;
+    /** True when this store refuses writes. */
+    abstract readonly: boolean;
+    /** True for a store that does not outlive its handle. */
+    abstract get temp(): boolean;
+    /** True while a writer is active, so a caller can tell it is borrowing one. */
+    abstract get inWriteTransaction(): boolean;
+    /** Open or reopen the store, reporting whether it is now usable. */
+    abstract reopen(options?: StoreIdentity): Operation<boolean>;
+    /** Close the store, optionally deleting its contents. */
+    abstract close(clear?: boolean): Operation<boolean>;
+    /** Bind a named table; `dupsort` is fixed when the table is created. */
+    abstract openTable(name: string, options?: {
+        dupsort?: boolean;
+    }): Table;
+    /**
+     * Run `fn` synchronously in one atomic transaction and return its result.
+     * A throw rolls back every effect and rethrows. Nesting is a savepoint.
+     */
+    abstract transaction<T>(fn: () => T): T;
+    /** Yield rows in order under `options`. Close the scan before suspending. */
+    abstract scan(table: Table, options?: ScanOptions): Iterable<TableEntry>;
+    /**
+     * Yield keys in order under `options`. A dupsort table yields each key once:
+     * `limit` counts distinct keys and `exclusiveStart` skips every duplicate.
+     */
+    abstract scanKeys(table: Table, options?: ScanOptions): Iterable<Uint8Array>;
+    /**
+     * Increases on every outermost commit that wrote rows. Comparable only within
+     * one open handle; increments need not be one.
+     */
+    abstract get writeVersion(): number;
+    /** Complete when every earlier commit is durable, or fail with the recorded persistence failure. */
+    abstract flushed(): Operation<void>;
+    /** Discard any retained read view so later reads observe the latest commit. */
+    abstract refreshRead(): void;
+    /** Report whether a named table exists, without creating it. */
+    abstract hasTable(name: string): boolean;
+    /** Read the `__version__` marker, or `null` when absent or malformed. */
+    abstract getVer(): string | null;
+    /** Write the `__version__` marker. */
+    abstract setVer(val: string): void;
+    abstract getVal(table: Table, key: Uint8Array): Uint8Array | null;
+    abstract putVal(table: Table, key: Uint8Array, val: Uint8Array): boolean;
+    abstract setVal(table: Table, key: Uint8Array, val: Uint8Array): boolean;
+    abstract delVal(table: Table, key: Uint8Array, val?: Uint8Array): boolean;
+    abstract cnt(table: Table): number;
+    abstract cntAll(table: Table): number;
+    abstract cntTop(table: Table, top?: Uint8Array): number;
+    abstract delTop(table: Table, top?: Uint8Array): boolean;
+    abstract getTopItemIter(table: Table, top?: Uint8Array): Generator<[Uint8Array, Uint8Array]>;
+    abstract putVals(table: Table, key: Uint8Array, vals: Iterable<Uint8Array>): boolean;
+    abstract addVal(table: Table, key: Uint8Array, val: Uint8Array): boolean;
+    abstract getVals(table: Table, key: Uint8Array): Uint8Array[];
+    abstract getValLast(table: Table, key: Uint8Array): Uint8Array | null;
+    abstract getValsIter(table: Table, key: Uint8Array): Generator<Uint8Array>;
+    abstract cntVals(table: Table, key: Uint8Array): number;
+    abstract delVals(table: Table, key: Uint8Array): boolean;
+    /** Return the first duplicate at `key` not below `start`, or `null`. */
+    abstract seekVal(table: Table, key: Uint8Array, start?: Uint8Array): Uint8Array | null;
+    /** Throw the backend's not-open error when the store is closed. */
+    protected abstract assertOpen(): void;
+    /** Write one physical row inside an active `transaction`, without nesting another. */
+    protected abstract putRow(table: Table, key: Uint8Array, val: Uint8Array): void;
+    /**
+     * Remove a key, or one duplicate when `val` is given, reporting whether a row
+     * was removed. Outside a transaction the removal commits by itself.
+     */
+    protected abstract removeRow(table: Table, key: Uint8Array, val?: Uint8Array): boolean;
+    /**
+     * Write `val` at the ordinal key `onKey(key, on)` only when absent.
+     *
+     * The ordinal is encoded into the physical key as a fixed-width 32-hex suffix
+     * so LMDB key order matches ordinal order. Mirrors KERIpy `putOnVal`.
+     */
+    putOnVal(db: Table, key: Uint8Array, on?: number, val?: Uint8Array | null, sep?: Uint8Array): boolean;
+    /**
+     * Write `val` at `onKey(key, on)`, overwriting any existing value.
+     *
+     * TypeScript-local rename of KERIpy `setOnVal`.
+     */
+    pinOnVal(db: Table, key: Uint8Array, on?: number, val?: Uint8Array | null, sep?: Uint8Array): boolean;
+    /**
+     * Append `val` at the next ordinal slot for `key`.
+     *
+     * This scans backward from the `key.MaxON` boundary to find the current tail,
+     * then writes at the next ordinal. Returns the appended ordinal. Mirrors
+     * KERIpy `appendOnVal`.
+     */
+    appendOnVal(db: Table, key: Uint8Array, val: Uint8Array | null, sep?: Uint8Array): number;
+    /**
+     * TypeScript-only convenience returning the exact `(key, on, val)` triple.
+     *
+     * Returns `null` when that exact ordinal entry is missing.
+     */
+    getOnItem(db: Table, key: Uint8Array, on?: number, sep?: Uint8Array): [Uint8Array, number, Uint8Array] | null;
+    /**
+     * Fetch the value stored exactly at `onKey(key, on)`.
+     *
+     * Returns `null` when the exact ordinal entry is missing. Empty logical keys
+     * are treated as absent. Mirrors KERIpy `getOnVal`.
+     */
+    getOnVal(db: Table, key: Uint8Array, on?: number, sep?: Uint8Array): Uint8Array | null;
+    /**
+     * Remove the value stored exactly at `onKey(key, on)`.
+     *
+     * Empty logical keys return `false`. TypeScript-local rename of KERIpy
+     * `delOnVal`.
+     */
+    remOn(db: Table, key: Uint8Array, on?: number, sep?: Uint8Array): boolean;
+    /**
+     * Remove all ordinal entries for `key` starting at ordinal `on`.
+     *
+     * Empty `key` removes the whole DB branch. TypeScript-only convenience built
+     * on the same ordinal-key semantics as KERIpy `delOnVal`.
+     */
+    remOnAll(db: Table, key?: Uint8Array, on?: number, sep?: Uint8Array): boolean;
+    /**
+     * Count ordinal-keyed entries for `key` starting at ordinal `on`.
+     *
+     * Empty `key` counts the whole DB. TypeScript-local rename of KERIpy
+     * `cntOnVals`.
+     */
+    cntOnAll(db: Table, key?: Uint8Array, on?: number, sep?: Uint8Array): number;
+    /**
+     * Iterate `(key, on, val)` triples whose physical keys begin with branch `top`.
+     *
+     * This is the ordinal-key version of `getTopItemIter`, so branch membership is
+     * still a lexicographic key-prefix concept. TypeScript-only convenience.
+     */
+    getOnTopItemIter(db: Table, top?: Uint8Array, sep?: Uint8Array): Generator<[Uint8Array, number, Uint8Array]>;
+    /**
+     * Iterate `(key, on, val)` triples for ordinals `>= on`.
+     *
+     * Empty `key` iterates the whole DB. Ordering follows the fixed-width ordinal
+     * encoded in the key. TypeScript-local rename of KERIpy `getOnItemIter`.
+     */
+    getOnAllItemIter(db: Table, key?: Uint8Array, on?: number, sep?: Uint8Array): Generator<[Uint8Array, number, Uint8Array]>;
+    /**
+     * Add each unique value in `vals` to the insertion-ordered set at `key`.
+     *
+     * This emulates duplicate-like behavior in keyspace, not native LMDB dupsort:
+     * values are stored under hidden suffixed keys `key.<ion>`. Existing logical
+     * members are skipped, new members append at the next suffix. Mirrors KERIpy
+     * `putIoSetVals`.
+     */
+    putIoSetVals(db: Table, key: Uint8Array, vals: Iterable<Uint8Array> | null, sep?: Uint8Array): boolean;
+    /**
+     * Replace the insertion-ordered set at `key` with the provided unique values.
+     *
+     * This clears the existing synthetic key run for `key`, then rewrites fresh
+     * hidden suffixes from zero. TypeScript-local rename of KERIpy `setIoSetVals`.
+     */
+    pinIoSetVals(db: Table, key: Uint8Array, vals: Iterable<Uint8Array> | null, sep?: Uint8Array): boolean;
+    /**
+     * Add one value to the insertion-ordered set at `key` if it is not present.
+     *
+     * Membership is checked by scanning the synthetic key run for `key`; new
+     * values append at the next hidden suffix. Mirrors KERIpy `addIoSetVal`.
+     */
+    addIoSetVal(db: Table, key: Uint8Array, val: Uint8Array | null, sep?: Uint8Array): boolean;
+    /**
+     * Iterate `(key, val)` pairs for the insertion-ordered set at `key`.
+     *
+     * Iteration starts at hidden insertion ordinal `ion`. Returned keys are the
+     * logical effective key with the hidden suffix removed. TypeScript-local item
+     * variant corresponding to KERIpy `getIoSetValsIter`.
+     */
+    getIoSetItemIter(db: Table, key: Uint8Array, ion?: number, sep?: Uint8Array): Generator<[Uint8Array, Uint8Array]>;
+    /**
+     * Return the last logical set member at `key`, or `null`.
+     *
+     * "Last" means the entry stored under the greatest hidden insertion suffix,
+     * not the lexicographically greatest value bytes. TypeScript-local item
+     * variant corresponding to KERIpy `getIoSetValLast`.
+     */
+    getIoSetLastItem(db: Table, key: Uint8Array, sep?: Uint8Array): [Uint8Array, Uint8Array] | null;
+    /**
+     * Remove all insertion-ordered set members at `key`.
+     *
+     * This deletes the full synthetic key run for the effective key. TypeScript-
+     * local rename of KERIpy `delIoSetVals`.
+     */
+    remIoSet(db: Table, key: Uint8Array, sep?: Uint8Array): boolean;
+    /**
+     * Remove one logical set member at `key`, or all members when `val` is `null`.
+     *
+     * Delete-by-value requires a linear search because the caller does not know
+     * the hidden insertion suffix. As in KERIpy, suffix ordinals can grow
+     * monotonically over time after deletes and reinserts. TypeScript-local rename
+     * of KERIpy `delIoSetVal`.
+     */
+    remIoSetVal(db: Table, key: Uint8Array, val?: Uint8Array | null, sep?: Uint8Array): boolean;
+    /**
+     * Count logical set members at `key` starting from hidden insertion ordinal `ion`.
+     *
+     * TypeScript-local item-count variant corresponding to KERIpy `cntIoSetVals`.
+     */
+    cntIoSet(db: Table, key: Uint8Array, ion?: number, sep?: Uint8Array): number;
+    /**
+     * Iterate `(key, val)` pairs for all synthetic-set entries in branch `top`.
+     *
+     * Branch membership is still a lexicographic key-prefix scan over the
+     * physical suffixed keys; returned keys have the hidden insertion suffix
+     * removed. Mirrors KERIpy `getTopIoSetItemIter`.
+     */
+    getTopIoSetItemIter(db: Table, top?: Uint8Array, sep?: Uint8Array): Generator<[Uint8Array, Uint8Array]>;
+    /**
+     * Iterate the last `(key, val)` member for each effective io-set key.
+     *
+     * Empty `key` iterates the whole DB. "Last" is determined by hidden suffix
+     * order. TypeScript-local item variant built from KERIpy `getIoSetValLast`
+     * and branch iteration semantics.
+     */
+    getIoSetLastItemIterAll(db: Table, key?: Uint8Array, sep?: Uint8Array): Generator<[Uint8Array, Uint8Array]>;
+    /**
+     * Iterate only the last logical values for each effective io-set key `>= key`.
+     *
+     * TypeScript-only convenience built on `getIoSetLastItemIterAll`.
+     */
+    getIoSetLastIterAll(db: Table, key?: Uint8Array, sep?: Uint8Array): Generator<Uint8Array>;
+    /**
+     * TypeScript-only extension. Add set members at ordinal effective key `onKey(key, on)`.
+     *
+     * This is the `On` + `IoSet` composition: exposed ordinal in keyspace, hidden
+     * insertion suffix inside that ordinal bucket.
+     */
+    putOnIoSetVals(db: Table, key: Uint8Array, on?: number, vals?: Iterable<Uint8Array> | null, sep?: Uint8Array): boolean;
+    /**
+     * TypeScript-only extension. Replace set members at ordinal effective key.
+     *
+     * This is the ordinal-bucketed counterpart to `pinIoSetVals`.
+     */
+    pinOnIoSetVals(db: Table, key: Uint8Array, on?: number, vals?: Iterable<Uint8Array> | null, sep?: Uint8Array): boolean;
+    /**
+     * TypeScript-only extension. Append a new ordinal bucket for `key`.
+     *
+     * Returns the newly appended exposed ordinal. Within that bucket, the values
+     * are stored as an `IoSet` using hidden insertion suffixes.
+     */
+    appendOnIoSetVals(db: Table, key: Uint8Array, vals: Iterable<Uint8Array> | null, sep?: Uint8Array): number;
+    /**
+     * TypeScript-only extension. Add one set member inside an ordinal bucket.
+     *
+     * This is the ordinal-bucketed counterpart to `addIoSetVal`.
+     */
+    addOnIoSetVal(db: Table, key: Uint8Array, on?: number, val?: Uint8Array | null, sep?: Uint8Array): boolean;
+    /**
+     * TypeScript-only extension. Iterate `(key, on, val)` members at one exact ordinal.
+     *
+     * Ordering inside the bucket follows the hidden insertion suffix.
+     */
+    getOnIoSetItemIter(db: Table, key: Uint8Array, on?: number, ion?: number, sep?: Uint8Array): Generator<[Uint8Array, number, Uint8Array]>;
+    /**
+     * TypeScript-only extension. Fetch the last member in one ordinal bucket.
+     *
+     * Returns `null` when that exact ordinal bucket is empty or missing.
+     */
+    getOnIoSetLastItem(db: Table, key: Uint8Array, on?: number, sep?: Uint8Array): [Uint8Array, number, Uint8Array] | null;
+    /**
+     * TypeScript-only extension. Remove one member from an ordinal bucket.
+     *
+     * When `val` is `null`, removes the whole ordinal bucket.
+     */
+    remOnIoSetVal(db: Table, key: Uint8Array, on?: number, val?: Uint8Array | null, sep?: Uint8Array): boolean;
+    /**
+     * TypeScript-only extension. Remove all ordinal buckets for `key` from `on` onward.
+     *
+     * Empty `key` removes the whole DB branch.
+     */
+    remOnAllIoSet(db: Table, key?: Uint8Array, on?: number, sep?: Uint8Array): boolean;
+    /**
+     * TypeScript-only extension. Count members in one ordinal bucket from insertion ordinal `ion`.
+     */
+    cntOnIoSet(db: Table, key: Uint8Array, on?: number, ion?: number, sep?: Uint8Array): number;
+    /**
+     * TypeScript-only extension. Count all members across ordinal buckets for `key` from `on` onward.
+     */
+    cntOnAllIoSet(db: Table, key?: Uint8Array, on?: number, sep?: Uint8Array): number;
+    /**
+     * TypeScript-only extension. Iterate `(key, on, val)` members in branch `top`.
+     *
+     * This is the branch-scan form of `OnIoSet*`, still based on lexicographic
+     * physical key-prefix traversal.
+     */
+    getOnTopIoSetItemIter(db: Table, top?: Uint8Array, sep?: Uint8Array): Generator<[Uint8Array, number, Uint8Array]>;
+    /**
+     * TypeScript-only extension. Iterate `(key, on, val)` members for ordinals `>= on`.
+     *
+     * Empty `key` iterates the whole DB.
+     */
+    getOnAllIoSetItemIter(db: Table, key?: Uint8Array, on?: number, sep?: Uint8Array): Generator<[Uint8Array, number, Uint8Array]>;
+    /**
+     * TypeScript-only extension. Iterate the last member for each ordinal bucket.
+     *
+     * Empty `key` iterates all logical keys and ordinals in the DB.
+     */
+    getOnAllIoSetLastItemIter(db: Table, key?: Uint8Array, on?: number, sep?: Uint8Array): Generator<[Uint8Array, number, Uint8Array]>;
+    /**
+     * TypeScript-only extension. Iterate backward over `(key, on, val)` members.
+     *
+     * Backward order is materialized from the forward iterator, then reversed.
+     */
+    getOnAllIoSetItemBackIter(db: Table, key?: Uint8Array, on?: number | null, sep?: Uint8Array): Generator<[Uint8Array, number, Uint8Array]>;
+    /**
+     * TypeScript-only extension. Iterate backward over the last member per ordinal bucket.
+     */
+    getOnAllIoSetLastItemBackIter(db: Table, key?: Uint8Array, on?: number | null, sep?: Uint8Array): Generator<[Uint8Array, number, Uint8Array]>;
+    /**
+     * Add insertion-ordered duplicate values at `key`.
+     *
+     * Each stored value gets a hidden 33-byte proem (`32 hex chars + '.'`) so
+     * LMDB's lexicographic duplicate ordering becomes logical insertion order.
+     * Returned values later strip that proem away. Mirrors KERIpy `putIoDupVals`.
+     */
+    putIoDupVals(db: Table, key: Uint8Array, vals: Iterable<Uint8Array>): boolean;
+    /**
+     * Add one insertion-ordered duplicate value at `key` if absent.
+     *
+     * Mirrors KERIpy `addIoDupVal`.
+     */
+    addIoDupVal(db: Table, key: Uint8Array, val: Uint8Array | null): boolean;
+    /**
+     * Get insertion-ordered duplicate values at `key`, with the hidden proem removed.
+     *
+     * Ordering is logical insertion order because the hidden proem controls LMDB
+     * dupsort ordering. Mirrors KERIpy `getIoDupVals`.
+     */
+    getIoDupVals(db: Table, key: Uint8Array): Uint8Array[];
+    /**
+     * Iterate insertion-ordered duplicate values at `key`, with the hidden proem removed.
+     *
+     * Mirrors KERIpy `getIoDupValsIter`.
+     */
+    getIoDupValsIter(db: Table, key: Uint8Array): Generator<Uint8Array>;
+    /**
+     * Get the most recently inserted logical duplicate value at `key`.
+     *
+     * This uses the lexicographically last stored proem-prefixed duplicate and
+     * strips the hidden proem before returning. Mirrors KERIpy `getIoDupValLast`.
+     */
+    getIoDupValLast(db: Table, key: Uint8Array): Uint8Array | null;
+    /** Delete all insertion-ordered duplicates at `key`. Mirrors KERIpy `delIoDupVals`. */
+    delIoDupVals(db: Table, key: Uint8Array): boolean;
+    /**
+     * Delete one insertion-ordered duplicate value at `key`, matching the stripped logical value.
+     *
+     * This performs a linear search over stored proem-prefixed duplicates. Mirrors
+     * KERIpy `delIoDupVal`.
+     */
+    delIoDupVal(db: Table, key: Uint8Array, val: Uint8Array): boolean;
+    /** Count insertion-ordered duplicates at `key`. Mirrors KERIpy `cntIoDupVals`. */
+    cntIoDups(db: Table, key: Uint8Array): number;
+    /**
+     * Iterate `(key, val)` over branch `top`, stripping the hidden IoDup proem from each value.
+     *
+     * Mirrors KERIpy `getTopIoDupItemIter`.
+     */
+    getTopIoDupItemIter(db: Table, top?: Uint8Array): Generator<[Uint8Array, Uint8Array]>;
+    /**
+     * TypeScript-only convenience adding insertion-ordered duplicates at one exact ordinal key.
+     *
+     * This is the ordinal-bucketed counterpart to `putIoDupVals`. KERIpy exposes
+     * `addOnIoDupVal` and iterator-based accessors instead of this bulk helper.
+     */
+    putOnIoDupVals(db: Table, key: Uint8Array, on: number | undefined, vals: Iterable<Uint8Array>, sep?: Uint8Array): boolean;
+    /** Add one insertion-ordered duplicate at ordinal effective key. Mirrors KERIpy `addOnIoDupVal`. */
+    addOnIoDupVal(db: Table, key: Uint8Array, on?: number, val?: Uint8Array | null, sep?: Uint8Array): boolean;
+    /**
+     * Append one insertion-ordered duplicate value at the next ordinal bucket for `key`.
+     *
+     * Mirrors KERIpy `appendOnIoDupVal`.
+     */
+    appendOnIoDupVal(db: Table, key: Uint8Array, val: Uint8Array, sep?: Uint8Array): number;
+    /**
+     * TypeScript-only convenience returning all logical duplicates at one exact ordinal.
+     *
+     * KERIpy exposes scan-style iterators across ordinals rather than this exact
+     * per-ordinal list helper.
+     */
+    getOnIoDupVals(db: Table, key: Uint8Array, on?: number, sep?: Uint8Array): Uint8Array[];
+    /**
+     * TypeScript-only convenience iterating logical duplicates at one exact ordinal.
+     *
+     * No direct KERIpy equivalent: KERIpy `getOnIoDupValIter` scans all ordinals
+     * from `on` onward, which maps to `getOnIoDupIterAll` here.
+     */
+    getOnIoDupValsIter(db: Table, key: Uint8Array, on?: number, sep?: Uint8Array): Generator<Uint8Array>;
+    /**
+     * TypeScript-only convenience fetching the last logical duplicate at one exact ordinal.
+     */
+    getOnIoDupLast(db: Table, key: Uint8Array, on?: number, sep?: Uint8Array): Uint8Array | null;
+    /** Iterate the last logical duplicate value per ordinal bucket. Mirrors KERIpy `getOnIoDupLastValIter`. */
+    getOnIoDupLastValIter(db: Table, key?: Uint8Array, on?: number, sep?: Uint8Array): Generator<Uint8Array>;
+    /** Iterate `(key, on, val)` where `val` is the last logical duplicate per ordinal bucket. Mirrors KERIpy `getOnIoDupLastItemIter`. */
+    getOnIoDupLastItemIter(db: Table, key?: Uint8Array, on?: number, sep?: Uint8Array): Generator<[Uint8Array, number, Uint8Array]>;
+    /**
+     * Iterate `(key, on, val)` logical duplicates across a top branch.
+     *
+     * This mirrors the KERIpy helper added for normalized `OnIoDupSuber`
+     * branch iteration and strips the hidden insertion-order proem from each
+     * duplicate value before yielding it.
+     */
+    getOnTopIoDupItemIter(db: Table, top?: Uint8Array, sep?: Uint8Array): Generator<[Uint8Array, number, Uint8Array]>;
+    /** Delete all insertion-ordered duplicates at one ordinal effective key. TypeScript-local rename of KERIpy `delOnIoDupVals`. */
+    delOnIoDups(db: Table, key: Uint8Array, on?: number, sep?: Uint8Array): boolean;
+    /** Delete one insertion-ordered duplicate at one ordinal effective key. Mirrors KERIpy `delOnIoDupVal`. */
+    delOnIoDupVal(db: Table, key: Uint8Array, on?: number, val?: Uint8Array, sep?: Uint8Array): boolean;
+    /**
+     * TypeScript-only convenience counting logical duplicates at one exact ordinal.
+     *
+     * KERIpy does not expose this exact count helper on `LMDBer`.
+     */
+    cntOnIoDups(db: Table, key: Uint8Array, on?: number, sep?: Uint8Array): number;
+    /** Iterate backwards over logical duplicate values. Mirrors KERIpy `getOnIoDupValBackIter`. */
+    getOnIoDupValBackIter(db: Table, key?: Uint8Array, on?: number, sep?: Uint8Array): Generator<Uint8Array>;
+    /** Iterate backwards over `(key, on, val)` logical duplicates. Mirrors KERIpy `getOnIoDupItemBackIter`. */
+    getOnIoDupItemBackIter(db: Table, key?: Uint8Array, on?: number, sep?: Uint8Array): Generator<[Uint8Array, number, Uint8Array]>;
+    /**
+     * Iterate logical duplicate values for ordinals `>= on`.
+     *
+     * TypeScript-local name for KERIpy `getOnIoDupValIter`.
+     */
+    getOnIoDupIterAll(db: Table, key?: Uint8Array, on?: number, sep?: Uint8Array): Generator<Uint8Array>;
+    /**
+     * Iterate `(key, on, val)` logical duplicates for ordinals `>= on`.
+     *
+     * TypeScript-local name for KERIpy `getOnIoDupItemIter`.
+     */
+    getOnIoDupItemIterAll(db: Table, key?: Uint8Array, on?: number, sep?: Uint8Array): Generator<[Uint8Array, number, Uint8Array]>;
+}
+/** The public store contract from ADR-0015. Depend on this, not on a backend. */
+export type DBer = Pick<BaseDBer, keyof BaseDBer>;
+export {};
+//# sourceMappingURL=dber.d.ts.map

package/types/db/core/dber.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"dber.d.ts","sourceRoot":"","sources":["../../../src/db/core/dber.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAGH,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,WAAW,CAAC;AAC3C,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,sBAAsB,CAAC;AAGnD,OAAO,CAAC,MAAM,UAAU,EAAE,OAAO,MAAM,CAAC;AAExC;;;;;GAKG;AACH,MAAM,WAAW,KAAK;IACpB,QAAQ,CAAC,CAAC,UAAU,CAAC,EAAE,OAAO,CAAC;CAChC;AAED;;;;;GAKG;AACH,MAAM,WAAW,aAAa;IAC5B,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,IAAI,CAAC,EAAE,OAAO,CAAC;IACf,QAAQ,CAAC,EAAE,OAAO,CAAC;IACnB,4CAA4C;IAC5C,KAAK,CAAC,EAAE,OAAO,CAAC;IAChB,2DAA2D;IAC3D,KAAK,CAAC,EAAE,OAAO,CAAC;IAChB,0DAA0D;IAC1D,MAAM,CAAC,EAAE,OAAO,CAAC;IACjB,MAAM,CAAC,EAAE,MAAM,CAAC;CACjB;AAED,6DAA6D;AAC7D,MAAM,WAAW,UAAU;IACzB,GAAG,EAAE,UAAU,CAAC;IAChB,KAAK,EAAE,UAAU,CAAC;CACnB;AAED;;;;GAIG;AACH,MAAM,WAAW,WAAW;IAC1B,KAAK,CAAC,EAAE,UAAU,CAAC;IACnB,GAAG,CAAC,EAAE,UAAU,CAAC;IACjB,cAAc,CAAC,EAAE,OAAO,CAAC;IACzB,OAAO,CAAC,EAAE,OAAO,CAAC;IAClB,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB;AAED,+FAA+F;AAC/F,eAAO,MAAM,aAAa,OAAO,CAAC;AA+DlC;;;;;;GAMG;AACH,8BAAsB,QAAQ;IAC5B,6BAA6B;IAC7B,QAAQ,KAAK,IAAI,IAAI,MAAM,CAAC;IAC5B,8CAA8C;IAC9C,QAAQ,KAAK,IAAI,IAAI,MAAM,CAAC;IAC5B,uDAAuD;IACvD,QAAQ,KAAK,MAAM,IAAI,OAAO,CAAC;IAC/B,2CAA2C;IAC3C,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAC;IAC3B,yDAAyD;IACzD,QAAQ,KAAK,IAAI,IAAI,OAAO,CAAC;IAC7B,+EAA+E;IAC/E,QAAQ,KAAK,kBAAkB,IAAI,OAAO,CAAC;IAE3C,oEAAoE;IACpE,QAAQ,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,aAAa,GAAG,SAAS,CAAC,OAAO,CAAC;IAC5D,yDAAyD;IACzD,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,OAAO,GAAG,SAAS,CAAC,OAAO,CAAC;IACnD,wEAAwE;IACxE,QAAQ,CAAC,SAAS,CAAC,IAAI,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE;QAAE,OAAO,CAAC,EAAE,OAAO,CAAA;KAAE,GAAG,KAAK;IACxE;;;OAGG;IACH,QAAQ,CAAC,WAAW,CAAC,CAAC,EAAE,EAAE,EAAE,MAAM,CAAC,GAAG,CAAC;IACvC,6EAA6E;IAC7E,QAAQ,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,EAAE,OAAO,CAAC,EAAE,WAAW,GAAG,QAAQ,CAAC,UAAU,CAAC;IACxE;;;OAGG;IACH,QAAQ,CAAC,QAAQ,CAAC,KAAK,EAAE,KAAK,EAAE,OAAO,CAAC,EAAE,WAAW,GAAG,QAAQ,CAAC,UAAU,CAAC;IAC5E;;;OAGG;IACH,QAAQ,KAAK,YAAY,IAAI,MAAM,CAAC;IACpC,oGAAoG;IACpG,QAAQ,CAAC,OAAO,IAAI,SAAS,CAAC,IAAI,CAAC;IACnC,+EAA+E;IAC/E,QAAQ,CAAC,WAAW,IAAI,IAAI;IAC5B,gEAAgE;IAChE,QAAQ,CAAC,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO;IAExC,yEAAyE;IACzE,QAAQ,CAAC,MAAM,IAAI,MAAM,GAAG,IAAI;IAChC,sCAAsC;IACtC,QAAQ,CAAC,MAAM,CAAC,GAAG,EAAE,MAAM,GAAG,IAAI;IAElC,QAAQ,CAAC,MAAM,CAAC,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,UAAU,GAAG,UAAU,GAAG,IAAI;IACjE,QAAQ,CAAC,MAAM,CAAC,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,UAAU,EAAE,GAAG,EAAE,UAAU,GAAG,OAAO;IACxE,QAAQ,CAAC,MAAM,CAAC,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,UAAU,EAAE,GAAG,EAAE,UAAU,GAAG,OAAO;IACxE,QAAQ,CAAC,MAAM,CAAC,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,UAAU,EAAE,GAAG,CAAC,EAAE,UAAU,GAAG,OAAO;IACzE,QAAQ,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,GAAG,MAAM;IAClC,QAAQ,CAAC,MAAM,CAAC,KAAK,EAAE,KAAK,GAAG,MAAM;IACrC,QAAQ,CAAC,MAAM,CAAC,KAAK,EAAE,KAAK,EAAE,GAAG,CAAC,EAAE,UAAU,GAAG,MAAM;IACvD,QAAQ,CAAC,MAAM,CAAC,KAAK,EAAE,KAAK,EAAE,GAAG,CAAC,EAAE,UAAU,GAAG,OAAO;IACxD,QAAQ,CAAC,cAAc,CAAC,KAAK,EAAE,KAAK,EAAE,GAAG,CAAC,EAAE,UAAU,GAAG,SAAS,CAAC,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC;IAE5F,QAAQ,CAAC,OAAO,CAAC,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,UAAU,EAAE,IAAI,EAAE,QAAQ,CAAC,UAAU,CAAC,GAAG,OAAO;IACpF,QAAQ,CAAC,MAAM,CAAC,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,UAAU,EAAE,GAAG,EAAE,UAAU,GAAG,OAAO;IACxE,QAAQ,CAAC,OAAO,CAAC,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,UAAU,GAAG,UAAU,EAAE;IAC7D,QAAQ,CAAC,UAAU,CAAC,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,UAAU,GAAG,UAAU,GAAG,IAAI;IACrE,QAAQ,CAAC,WAAW,CAAC,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,UAAU,GAAG,SAAS,CAAC,UAAU,CAAC;IAC1E,QAAQ,CAAC,OAAO,CAAC,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,UAAU,GAAG,MAAM;IACvD,QAAQ,CAAC,OAAO,CAAC,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,UAAU,GAAG,OAAO;IACxD,wEAAwE;IACxE,QAAQ,CAAC,OAAO,CAAC,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,UAAU,EAAE,KAAK,CAAC,EAAE,UAAU,GAAG,UAAU,GAAG,IAAI;IAEtF,mEAAmE;IACnE,SAAS,CAAC,QAAQ,CAAC,UAAU,IAAI,IAAI;IACrC,sFAAsF;IACtF,SAAS,CAAC,QAAQ,CAAC,MAAM,CAAC,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,UAAU,EAAE,GAAG,EAAE,UAAU,GAAG,IAAI;IAC/E;;;OAGG;IACH,SAAS,CAAC,QAAQ,CAAC,SAAS,CAAC,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,UAAU,EAAE,GAAG,CAAC,EAAE,UAAU,GAAG,OAAO;IAUtF;;;;;OAKG;IACH,QAAQ,CACN,EAAE,EAAE,KAAK,EACT,GAAG,EAAE,UAAU,EACf,EAAE,SAAI,EACN,GAAG,GAAE,UAAU,GAAG,IAAW,EAC7B,GAAG,GAAE,UAAoB,GACxB,OAAO;IAOV;;;;OAIG;IACH,QAAQ,CACN,EAAE,EAAE,KAAK,EACT,GAAG,EAAE,UAAU,EACf,EAAE,SAAI,EACN,GAAG,GAAE,UAAU,GAAG,IAAW,EAC7B,GAAG,GAAE,UAAoB,GACxB,OAAO;IAOV;;;;;;OAMG;IACH,WAAW,CACT,EAAE,EAAE,KAAK,EACT,GAAG,EAAE,UAAU,EACf,GAAG,EAAE,UAAU,GAAG,IAAI,EACtB,GAAG,GAAE,UAAoB,GACxB,MAAM;IAqDT;;;;OAIG;IACH,SAAS,CACP,EAAE,EAAE,KAAK,EACT,GAAG,EAAE,UAAU,EACf,EAAE,SAAI,EACN,GAAG,GAAE,UAAoB,GACxB,CAAC,UAAU,EAAE,MAAM,EAAE,UAAU,CAAC,GAAG,IAAI;IAK1C;;;;;OAKG;IACH,QAAQ,CACN,EAAE,EAAE,KAAK,EACT,GAAG,EAAE,UAAU,EACf,EAAE,SAAI,EACN,GAAG,GAAE,UAAoB,GACxB,UAAU,GAAG,IAAI;IAOpB;;;;;OAKG;IACH,KAAK,CACH,EAAE,EAAE,KAAK,EACT,GAAG,EAAE,UAAU,EACf,EAAE,SAAI,EACN,GAAG,GAAE,UAAoB,GACxB,OAAO;IAOV;;;;;OAKG;IACH,QAAQ,CACN,EAAE,EAAE,KAAK,EACT,GAAG,GAAE,UAA8B,EACnC,EAAE,SAAI,EACN,GAAG,GAAE,UAAoB,GACxB,OAAO;IA6BV;;;;;OAKG;IACH,QAAQ,CACN,EAAE,EAAE,KAAK,EACT,GAAG,GAAE,UAA8B,EACnC,EAAE,SAAI,EACN,GAAG,GAAE,UAAoB,GACxB,MAAM;IAeT;;;;;OAKG;IACF,gBAAgB,CACf,EAAE,EAAE,KAAK,EACT,GAAG,GAAE,UAA8B,EACnC,GAAG,GAAE,UAAoB,GACxB,SAAS,CAAC,CAAC,UAAU,EAAE,MAAM,EAAE,UAAU,CAAC,CAAC;IAO9C;;;;;OAKG;IACF,gBAAgB,CACf,EAAE,EAAE,KAAK,EACT,GAAG,GAAE,UAA8B,EACnC,EAAE,SAAI,EACN,GAAG,GAAE,UAAoB,GACxB,SAAS,CAAC,CAAC,UAAU,EAAE,MAAM,EAAE,UAAU,CAAC,CAAC;IAsB9C;;;;;;;OAOG;IACH,YAAY,CACV,EAAE,EAAE,KAAK,EACT,GAAG,EAAE,UAAU,EACf,IAAI,EAAE,QAAQ,CAAC,UAAU,CAAC,GAAG,IAAI,EACjC,GAAG,GAAE,UAAoB,GACxB,OAAO;IAsCV;;;;;OAKG;IACH,YAAY,CACV,EAAE,EAAE,KAAK,EACT,GAAG,EAAE,UAAU,EACf,IAAI,EAAE,QAAQ,CAAC,UAAU,CAAC,GAAG,IAAI,EACjC,GAAG,GAAE,UAAoB,GACxB,OAAO;IAoBV;;;;;OAKG;IACH,WAAW,CACT,EAAE,EAAE,KAAK,EACT,GAAG,EAAE,UAAU,EACf,GAAG,EAAE,UAAU,GAAG,IAAI,EACtB,GAAG,GAAE,UAAoB,GACxB,OAAO;IAyBV;;;;;;OAMG;IACF,gBAAgB,CACf,EAAE,EAAE,KAAK,EACT,GAAG,EAAE,UAAU,EACf,GAAG,SAAI,EACP,GAAG,GAAE,UAAoB,GACxB,SAAS,CAAC,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC;IAiBtC;;;;;;OAMG;IACH,gBAAgB,CACd,EAAE,EAAE,KAAK,EACT,GAAG,EAAE,UAAU,EACf,GAAG,GAAE,UAAoB,GACxB,CAAC,UAAU,EAAE,UAAU,CAAC,GAAG,IAAI;IAQlC;;;;;OAKG;IACH,QAAQ,CACN,EAAE,EAAE,KAAK,EACT,GAAG,EAAE,UAAU,EACf,GAAG,GAAE,UAAoB,GACxB,OAAO;IA6BV;;;;;;;OAOG;IACH,WAAW,CACT,EAAE,EAAE,KAAK,EACT,GAAG,EAAE,UAAU,EACf,GAAG,GAAE,UAAU,GAAG,IAAW,EAC7B,GAAG,GAAE,UAAoB,GACxB,OAAO;IAmCV;;;;OAIG;IACH,QAAQ,CACN,EAAE,EAAE,KAAK,EACT,GAAG,EAAE,UAAU,EACf,GAAG,SAAI,EACP,GAAG,GAAE,UAAoB,GACxB,MAAM;IAWT;;;;;;OAMG;IACF,mBAAmB,CAClB,EAAE,EAAE,KAAK,EACT,GAAG,GAAE,UAA8B,EACnC,GAAG,GAAE,UAAoB,GACxB,SAAS,CAAC,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC;IAOtC;;;;;;OAMG;IACF,uBAAuB,CACtB,EAAE,EAAE,KAAK,EACT,GAAG,GAAE,UAA8B,EACnC,GAAG,GAAE,UAAoB,GACxB,SAAS,CAAC,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC;IAyBtC;;;;OAIG;IACF,mBAAmB,CAClB,EAAE,EAAE,KAAK,EACT,GAAG,GAAE,UAA8B,EACnC,GAAG,GAAE,UAAoB,GACxB,SAAS,CAAC,UAAU,CAAC;IAiBxB;;;;;OAKG;IACH,cAAc,CACZ,EAAE,EAAE,KAAK,EACT,GAAG,EAAE,UAAU,EACf,EAAE,SAAI,EACN,IAAI,GAAE,QAAQ,CAAC,UAAU,CAAC,GAAG,IAAW,EACxC,GAAG,GAAE,UAAoB,GACxB,OAAO;IAOV;;;;OAIG;IACH,cAAc,CACZ,EAAE,EAAE,KAAK,EACT,GAAG,EAAE,UAAU,EACf,EAAE,SAAI,EACN,IAAI,GAAE,QAAQ,CAAC,UAAU,CAAC,GAAG,IAAW,EACxC,GAAG,GAAE,UAAoB,GACxB,OAAO;IAOV;;;;;OAKG;IACH,iBAAiB,CACf,EAAE,EAAE,KAAK,EACT,GAAG,EAAE,UAAU,EACf,IAAI,EAAE,QAAQ,CAAC,UAAU,CAAC,GAAG,IAAI,EACjC,GAAG,GAAE,UAAoB,GACxB,MAAM;IA0BT;;;;OAIG;IACH,aAAa,CACX,EAAE,EAAE,KAAK,EACT,GAAG,EAAE,UAAU,EACf,EAAE,SAAI,EACN,GAAG,GAAE,UAAU,GAAG,IAAW,EAC7B,GAAG,GAAE,UAAoB,GACxB,OAAO;IAIV;;;;OAIG;IACF,kBAAkB,CACjB,EAAE,EAAE,KAAK,EACT,GAAG,EAAE,UAAU,EACf,EAAE,SAAI,EACN,GAAG,SAAI,EACP,GAAG,GAAE,UAAoB,GACxB,SAAS,CAAC,CAAC,UAAU,EAAE,MAAM,EAAE,UAAU,CAAC,CAAC;IAc9C;;;;OAIG;IACH,kBAAkB,CAChB,EAAE,EAAE,KAAK,EACT,GAAG,EAAE,UAAU,EACf,EAAE,SAAI,EACN,GAAG,GAAE,UAAoB,GACxB,CAAC,UAAU,EAAE,MAAM,EAAE,UAAU,CAAC,GAAG,IAAI;IAU1C;;;;OAIG;IACH,aAAa,CACX,EAAE,EAAE,KAAK,EACT,GAAG,EAAE,UAAU,EACf,EAAE,SAAI,EACN,GAAG,GAAE,UAAU,GAAG,IAAW,EAC7B,GAAG,GAAE,UAAoB,GACxB,OAAO;IAIV;;;;OAIG;IACH,aAAa,CACX,EAAE,EAAE,KAAK,EACT,GAAG,GAAE,UAA8B,EACnC,EAAE,SAAI,EACN,GAAG,GAAE,UAAoB,GACxB,OAAO;IA8BV;;OAEG;IACH,UAAU,CACR,EAAE,EAAE,KAAK,EACT,GAAG,EAAE,UAAU,EACf,EAAE,SAAI,EACN,GAAG,SAAI,EACP,GAAG,GAAE,UAAoB,GACxB,MAAM;IAIT;;OAEG;IACH,aAAa,CACX,EAAE,EAAE,KAAK,EACT,GAAG,GAAE,UAA8B,EACnC,EAAE,SAAI,EACN,GAAG,GAAE,UAAoB,GACxB,MAAM;IAkBT;;;;;OAKG;IACF,qBAAqB,CACpB,EAAE,EAAE,KAAK,EACT,GAAG,GAAE,UAA8B,EACnC,GAAG,GAAE,UAAoB,GACxB,SAAS,CAAC,CAAC,UAAU,EAAE,MAAM,EAAE,UAAU,CAAC,CAAC;IAO9C;;;;OAIG;IACF,qBAAqB,CACpB,EAAE,EAAE,KAAK,EACT,GAAG,GAAE,UAA8B,EACnC,EAAE,SAAI,EACN,GAAG,GAAE,UAAoB,GACxB,SAAS,CAAC,CAAC,UAAU,EAAE,MAAM,EAAE,UAAU,CAAC,CAAC;IAkB9C;;;;OAIG;IACF,yBAAyB,CACxB,EAAE,EAAE,KAAK,EACT,GAAG,GAAE,UAA8B,EACnC,EAAE,SAAI,EACN,GAAG,GAAE,UAAoB,GACxB,SAAS,CAAC,CAAC,UAAU,EAAE,MAAM,EAAE,UAAU,CAAC,CAAC;IAiC9C;;;;OAIG;IACF,yBAAyB,CACxB,EAAE,EAAE,KAAK,EACT,GAAG,GAAE,UAA8B,EACnC,EAAE,GAAE,MAAM,GAAG,IAAW,EACxB,GAAG,GAAE,UAAoB,GACxB,SAAS,CAAC,CAAC,UAAU,EAAE,MAAM,EAAE,UAAU,CAAC,CAAC;IAa9C;;OAEG;IACF,6BAA6B,CAC5B,EAAE,EAAE,KAAK,EACT,GAAG,GAAE,UAA8B,EACnC,EAAE,GAAE,MAAM,GAAG,IAAW,EACxB,GAAG,GAAE,UAAoB,GACxB,SAAS,CAAC,CAAC,UAAU,EAAE,MAAM,EAAE,UAAU,CAAC,CAAC;IAsB9C;;;;;;OAMG;IACH,YAAY,CACV,EAAE,EAAE,KAAK,EACT,GAAG,EAAE,UAAU,EACf,IAAI,EAAE,QAAQ,CAAC,UAAU,CAAC,GACzB,OAAO;IA2BV;;;;OAIG;IACH,WAAW,CACT,EAAE,EAAE,KAAK,EACT,GAAG,EAAE,UAAU,EACf,GAAG,EAAE,UAAU,GAAG,IAAI,GACrB,OAAO;IAKV;;;;;OAKG;IACH,YAAY,CAAC,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,UAAU,GAAG,UAAU,EAAE;IAItD;;;;OAIG;IACF,gBAAgB,CACf,EAAE,EAAE,KAAK,EACT,GAAG,EAAE,UAAU,GACd,SAAS,CAAC,UAAU,CAAC;IAMxB;;;;;OAKG;IACH,eAAe,CACb,EAAE,EAAE,KAAK,EACT,GAAG,EAAE,UAAU,GACd,UAAU,GAAG,IAAI;IAKpB,uFAAuF;IACvF,YAAY,CAAC,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,UAAU,GAAG,OAAO;IAIjD;;;;;OAKG;IACH,WAAW,CACT,EAAE,EAAE,KAAK,EACT,GAAG,EAAE,UAAU,EACf,GAAG,EAAE,UAAU,GACd,OAAO;IAUV,kFAAkF;IAClF,SAAS,CAAC,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,UAAU,GAAG,MAAM;IAI7C;;;;OAIG;IACF,mBAAmB,CAClB,EAAE,EAAE,KAAK,EACT,GAAG,GAAE,UAA8B,GAClC,SAAS,CAAC,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC;IActC;;;;;OAKG;IACH,cAAc,CACZ,EAAE,EAAE,KAAK,EACT,GAAG,EAAE,UAAU,EACf,EAAE,oBAAI,EACN,IAAI,EAAE,QAAQ,CAAC,UAAU,CAAC,EAC1B,GAAG,GAAE,UAAoB,GACxB,OAAO;IAIV,oGAAoG;IACpG,aAAa,CACX,EAAE,EAAE,KAAK,EACT,GAAG,EAAE,UAAU,EACf,EAAE,SAAI,EACN,GAAG,GAAE,UAAU,GAAG,IAAW,EAC7B,GAAG,GAAE,UAAoB,GACxB,OAAO;IAIV;;;;OAIG;IACH,gBAAgB,CACd,EAAE,EAAE,KAAK,EACT,GAAG,EAAE,UAAU,EACf,GAAG,EAAE,UAAU,EACf,GAAG,GAAE,UAAoB,GACxB,MAAM;IAIT;;;;;OAKG;IACH,cAAc,CACZ,EAAE,EAAE,KAAK,EACT,GAAG,EAAE,UAAU,EACf,EAAE,SAAI,EACN,GAAG,GAAE,UAAoB,GACxB,UAAU,EAAE;IAOf;;;;;OAKG;IACF,kBAAkB,CACjB,EAAE,EAAE,KAAK,EACT,GAAG,EAAE,UAAU,EACf,EAAE,SAAI,EACN,GAAG,GAAE,UAAoB,GACxB,SAAS,CAAC,UAAU,CAAC;IAOxB;;OAEG;IACH,cAAc,CACZ,EAAE,EAAE,KAAK,EACT,GAAG,EAAE,UAAU,EACf,EAAE,SAAI,EACN,GAAG,GAAE,UAAoB,GACxB,UAAU,GAAG,IAAI;IAIpB,2GAA2G;IAC1G,qBAAqB,CACpB,EAAE,EAAE,KAAK,EACT,GAAG,GAAE,UAA8B,EACnC,EAAE,SAAI,EACN,GAAG,GAAE,UAAoB,GACxB,SAAS,CAAC,UAAU,CAAC;IAMxB,sIAAsI;IACrI,sBAAsB,CACrB,EAAE,EAAE,KAAK,EACT,GAAG,GAAE,UAA8B,EACnC,EAAE,SAAI,EACN,GAAG,GAAE,UAAoB,GACxB,SAAS,CAAC,CAAC,UAAU,EAAE,MAAM,EAAE,UAAU,CAAC,CAAC;IAgC9C;;;;;;OAMG;IACF,qBAAqB,CACpB,EAAE,EAAE,KAAK,EACT,GAAG,GAAE,UAA8B,EACnC,GAAG,GAAE,UAAoB,GACxB,SAAS,CAAC,CAAC,UAAU,EAAE,MAAM,EAAE,UAAU,CAAC,CAAC;IAM9C,gIAAgI;IAChI,WAAW,CACT,EAAE,EAAE,KAAK,EACT,GAAG,EAAE,UAAU,EACf,EAAE,SAAI,EACN,GAAG,GAAE,UAAoB,GACxB,OAAO;IAIV,2GAA2G;IAC3G,aAAa,CACX,EAAE,EAAE,KAAK,EACT,GAAG,EAAE,UAAU,EACf,EAAE,SAAI,EACN,GAAG,GAAE,UAA8B,EACnC,GAAG,GAAE,UAAoB,GACxB,OAAO;IAIV;;;;OAIG;IACH,WAAW,CACT,EAAE,EAAE,KAAK,EACT,GAAG,EAAE,UAAU,EACf,EAAE,SAAI,EACN,GAAG,GAAE,UAAoB,GACxB,MAAM;IAIT,+FAA+F;IAC9F,qBAAqB,CACpB,EAAE,EAAE,KAAK,EACT,GAAG,GAAE,UAA8B,EACnC,EAAE,SAAI,EACN,GAAG,GAAE,UAAoB,GACxB,SAAS,CAAC,UAAU,CAAC;IAMxB,2GAA2G;IAC1G,sBAAsB,CACrB,EAAE,EAAE,KAAK,EACT,GAAG,GAAE,UAA8B,EACnC,EAAE,SAAI,EACN,GAAG,GAAE,UAAoB,GACxB,SAAS,CAAC,CAAC,UAAU,EAAE,MAAM,EAAE,UAAU,CAAC,CAAC;IAU9C;;;;OAIG;IACF,iBAAiB,CAChB,EAAE,EAAE,KAAK,EACT,GAAG,GAAE,UAA8B,EACnC,EAAE,SAAI,EACN,GAAG,GAAE,UAAoB,GACxB,SAAS,CAAC,UAAU,CAAC;IAMxB;;;;OAIG;IACF,qBAAqB,CACpB,EAAE,EAAE,KAAK,EACT,GAAG,GAAE,UAA8B,EACnC,EAAE,SAAI,EACN,GAAG,GAAE,UAAoB,GACxB,SAAS,CAAC,CAAC,UAAU,EAAE,MAAM,EAAE,UAAU,CAAC,CAAC;CAK/C;AAED,iFAAiF;AACjF,MAAM,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,EAAE,MAAM,QAAQ,CAAC,CAAC"}

package/types/db/core/index.d.ts

@@ -1,7 +1,9 @@
 /**
  * Core database module exports
  */
+export * from "./dber.js";
 export * from "./keys.js";
-export * from "./lmdber.js";
-export * from "./path-manager.js";
+export * from "./memstore.js";
+export * from "./store-owner.js";
+export * from "./webdber.js";
 //# sourceMappingURL=index.d.ts.map

package/types/db/core/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/db/core/index.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,cAAc,WAAW,CAAC;AAC1B,cAAc,aAAa,CAAC;AAC5B,cAAc,mBAAmB,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/db/core/index.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,cAAc,WAAW,CAAC;AAC1B,cAAc,WAAW,CAAC;AAC1B,cAAc,eAAe,CAAC;AAC9B,cAAc,kBAAkB,CAAC;AACjC,cAAc,cAAc,CAAC"}

package/types/db/core/lmdb-opener.d.ts

@@ -0,0 +1,17 @@
+/** LMDB placement of store families, reproducing each family's established paths. */
+import type { StoreIdentity } from "./dber.js";
+import { LMDBer, type LMDBerDefaults, type LmdbLocation } from "./lmdber.js";
+import type { StoreFamily, StoreOpener } from "./store-owner.js";
+/** Derive the LMDB path defaults for one family. */
+export declare function lmdbDefaultsFor(family: StoreFamily, compat?: boolean): Partial<LMDBerDefaults>;
+/** Where one composition's LMDB stores live. */
+export interface LmdbOpenerLocation extends Pick<LmdbLocation, "headDirPath" | "mapSize"> {
+    compat?: boolean;
+}
+/** The default `StoreOpener`: closed LMDB stores at the family's established paths. */
+export declare class LmdbStoreOpener implements StoreOpener {
+    readonly location: LmdbOpenerLocation;
+    constructor(location?: LmdbOpenerLocation);
+    create(family: StoreFamily, identity: StoreIdentity): LMDBer;
+}
+//# sourceMappingURL=lmdb-opener.d.ts.map

package/types/db/core/lmdb-opener.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"lmdb-opener.d.ts","sourceRoot":"","sources":["../../../src/db/core/lmdb-opener.ts"],"names":[],"mappings":"AAAA,qFAAqF;AAErF,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,WAAW,CAAC;AAC/C,OAAO,EAAE,MAAM,EAAE,KAAK,cAAc,EAAE,KAAK,YAAY,EAAE,MAAM,aAAa,CAAC;AAC7E,OAAO,KAAK,EAAE,WAAW,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAC;AAEjE,oDAAoD;AACpD,wBAAgB,eAAe,CAAC,MAAM,EAAE,WAAW,EAAE,MAAM,UAAQ,GAAG,OAAO,CAAC,cAAc,CAAC,CAW5F;AAED,gDAAgD;AAChD,MAAM,WAAW,kBAAmB,SAAQ,IAAI,CAAC,YAAY,EAAE,aAAa,GAAG,SAAS,CAAC;IACvF,MAAM,CAAC,EAAE,OAAO,CAAC;CAClB;AAED,uFAAuF;AACvF,qBAAa,eAAgB,YAAW,WAAW;IACrC,QAAQ,CAAC,QAAQ,EAAE,kBAAkB;gBAA5B,QAAQ,GAAE,kBAAuB;IAEtD,MAAM,CAAC,MAAM,EAAE,WAAW,EAAE,QAAQ,EAAE,aAAa,GAAG,MAAM;CAI7D"}