@rocicorp/zero 0.0.202410040740 → 0.0.202410040818

package/out/replicache/src/btree/node.d.ts

@@ -0,0 +1,125 @@
+import { type ReadonlyJSONValue } from '../../../shared/src/json.js';
+import type { IndexKey } from '../db/index.js';
+import * as FormatVersion from '../format-version-enum.js';
+import { type FrozenJSONValue, type FrozenTag } from '../frozen-json.js';
+import { type Hash } from '../hash.js';
+import type { BTreeRead } from './read.js';
+import type { BTreeWrite } from './write.js';
+export type Entry<V> = readonly [key: string, value: V, sizeOfEntry: number];
+export declare const NODE_LEVEL = 0;
+export declare const NODE_ENTRIES = 1;
+/**
+ * The type of B+Tree node chunk data
+ */
+type BaseNode<V> = FrozenTag<readonly [level: number, entries: ReadonlyArray<Entry<V>>]>;
+export type InternalNode = BaseNode<Hash>;
+export type DataNode = BaseNode<FrozenJSONValue>;
+export declare function makeNodeChunkData<V>(level: number, entries: ReadonlyArray<Entry<V>>, formatVersion: FormatVersion.Type): BaseNode<V>;
+export type Node = DataNode | InternalNode;
+/**
+ * Describes the changes that happened to Replicache after a
+ * {@link WriteTransaction} was committed.
+ *
+ * @experimental This type is experimental and may change in the future.
+ */
+export type Diff = IndexDiff | NoIndexDiff;
+/**
+ * @experimental This type is experimental and may change in the future.
+ */
+export type IndexDiff = readonly DiffOperation<IndexKey>[];
+/**
+ * @experimental This type is experimental and may change in the future.
+ */
+export type NoIndexDiff = readonly DiffOperation<string>[];
+/**
+ * InternalDiff uses string keys even for the secondary index maps.
+ */
+export type InternalDiff = readonly InternalDiffOperation[];
+export type DiffOperationAdd<Key, Value = ReadonlyJSONValue> = {
+    readonly op: 'add';
+    readonly key: Key;
+    readonly newValue: Value;
+};
+export type DiffOperationDel<Key, Value = ReadonlyJSONValue> = {
+    readonly op: 'del';
+    readonly key: Key;
+    readonly oldValue: Value;
+};
+export type DiffOperationChange<Key, Value = ReadonlyJSONValue> = {
+    readonly op: 'change';
+    readonly key: Key;
+    readonly oldValue: Value;
+    readonly newValue: Value;
+};
+/**
+ * The individual parts describing the changes that happened to the Replicache
+ * data. There are three different kinds of operations:
+ * - `add`: A new entry was added.
+ * - `del`: An entry was deleted.
+ * - `change`: An entry was changed.
+ *
+ * @experimental This type is experimental and may change in the future.
+ */
+export type DiffOperation<Key> = DiffOperationAdd<Key> | DiffOperationDel<Key> | DiffOperationChange<Key>;
+export type InternalDiffOperation<Key = string, Value = FrozenJSONValue> = DiffOperationAdd<Key, Value> | DiffOperationDel<Key, Value> | DiffOperationChange<Key, Value>;
+/**
+ * Finds the leaf where a key is (if present) or where it should go if not
+ * present.
+ */
+export declare function findLeaf(key: string, hash: Hash, source: BTreeRead, expectedRootHash: Hash): Promise<DataNodeImpl>;
+type BinarySearchEntries = readonly Entry<unknown>[];
+/**
+ * Does a binary search over entries
+ *
+ * If the key found then the return value is the index it was found at.
+ *
+ * If the key was *not* found then the return value is the index where it should
+ * be inserted at
+ */
+export declare function binarySearch(key: string, entries: BinarySearchEntries): number;
+export declare function binarySearchFound(i: number, entries: BinarySearchEntries, key: string): boolean;
+export declare function parseBTreeNode(v: unknown, formatVersion: FormatVersion.Type, getSizeOfEntry: <K, V>(key: K, value: V) => number): InternalNode | DataNode;
+export declare function isInternalNode(node: Node): node is InternalNode;
+declare abstract class NodeImpl<Value> {
+    #private;
+    entries: Array<Entry<Value>>;
+    hash: Hash;
+    abstract readonly level: number;
+    readonly isMutable: boolean;
+    constructor(entries: Array<Entry<Value>>, hash: Hash, isMutable: boolean);
+    abstract set(key: string, value: FrozenJSONValue, entrySize: number, tree: BTreeWrite): Promise<NodeImpl<Value>>;
+    abstract del(key: string, tree: BTreeWrite): Promise<NodeImpl<Value> | DataNodeImpl>;
+    maxKey(): string;
+    getChildNodeSize(tree: BTreeRead): number;
+    protected _updateNode(tree: BTreeWrite): void;
+}
+export declare function toChunkData<V>(node: NodeImpl<V>, formatVersion: FormatVersion.Type): BaseNode<V>;
+export declare class DataNodeImpl extends NodeImpl<FrozenJSONValue> {
+    #private;
+    readonly level = 0;
+    set(key: string, value: FrozenJSONValue, entrySize: number, tree: BTreeWrite): Promise<DataNodeImpl>;
+    del(key: string, tree: BTreeWrite): Promise<DataNodeImpl>;
+    keys(_tree: BTreeRead): AsyncGenerator<string, void>;
+    entriesIter(_tree: BTreeRead): AsyncGenerator<Entry<FrozenJSONValue>, void>;
+}
+export declare class InternalNodeImpl extends NodeImpl<Hash> {
+    #private;
+    readonly level: number;
+    constructor(entries: Array<Entry<Hash>>, hash: Hash, level: number, isMutable: boolean);
+    set(key: string, value: FrozenJSONValue, entrySize: number, tree: BTreeWrite): Promise<InternalNodeImpl>;
+    del(key: string, tree: BTreeWrite): Promise<InternalNodeImpl | DataNodeImpl>;
+    keys(tree: BTreeRead): AsyncGenerator<string, void>;
+    entriesIter(tree: BTreeRead): AsyncGenerator<Entry<FrozenJSONValue>, void>;
+    getChildren(start: number, length: number, tree: BTreeRead): Promise<Array<InternalNodeImpl | DataNodeImpl>>;
+    getCompositeChildren(start: number, length: number, tree: BTreeRead): Promise<InternalNodeImpl | DataNodeImpl>;
+}
+export declare function newNodeImpl(entries: Array<Entry<FrozenJSONValue>>, hash: Hash, level: number, isMutable: boolean): DataNodeImpl;
+export declare function newNodeImpl(entries: Array<Entry<Hash>>, hash: Hash, level: number, isMutable: boolean): InternalNodeImpl;
+export declare function newNodeImpl(entries: Array<Entry<FrozenJSONValue>> | Array<Entry<Hash>>, hash: Hash, level: number, isMutable: boolean): DataNodeImpl | InternalNodeImpl;
+export declare function isDataNodeImpl(node: DataNodeImpl | InternalNodeImpl): node is DataNodeImpl;
+export declare function partition<T>(values: Iterable<T>, getSizeOfEntry: (v: T) => number, min: number, max: number): T[][];
+export declare const emptyDataNode: BaseNode<ReadonlyJSONValue>;
+export declare const emptyDataNodeImpl: DataNodeImpl;
+export declare function createNewInternalEntryForNode(node: NodeImpl<unknown>, getSizeOfEntry: <K, V>(k: K, v: V) => number): [string, Hash, number];
+export {};
+//# sourceMappingURL=node.d.ts.map

package/out/replicache/src/btree/node.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"node.d.ts","sourceRoot":"","sources":["../../../../../replicache/src/btree/node.ts"],"names":[],"mappings":"AAQA,OAAO,EAEL,KAAK,iBAAiB,EAEvB,MAAM,oBAAoB,CAAC;AAG5B,OAAO,KAAK,EAAC,QAAQ,EAAC,MAAM,gBAAgB,CAAC;AAC7C,OAAO,KAAK,aAAa,MAAM,2BAA2B,CAAC;AAC3D,OAAO,EACL,KAAK,eAAe,EACpB,KAAK,SAAS,EAGf,MAAM,mBAAmB,CAAC;AAC3B,OAAO,EAAC,KAAK,IAAI,EAA2B,MAAM,YAAY,CAAC;AAC/D,OAAO,KAAK,EAAC,SAAS,EAAC,MAAM,WAAW,CAAC;AACzC,OAAO,KAAK,EAAC,UAAU,EAAC,MAAM,YAAY,CAAC;AAE3C,MAAM,MAAM,KAAK,CAAC,CAAC,IAAI,SAAS,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,WAAW,EAAE,MAAM,CAAC,CAAC;AAE7E,eAAO,MAAM,UAAU,IAAI,CAAC;AAC5B,eAAO,MAAM,YAAY,IAAI,CAAC;AAE9B;;GAEG;AACH,KAAK,QAAQ,CAAC,CAAC,IAAI,SAAS,CAC1B,SAAS,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,aAAa,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAC3D,CAAC;AACF,MAAM,MAAM,YAAY,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC;AAE1C,MAAM,MAAM,QAAQ,GAAG,QAAQ,CAAC,eAAe,CAAC,CAAC;AAEjD,wBAAgB,iBAAiB,CAAC,CAAC,EACjC,KAAK,EAAE,MAAM,EACb,OAAO,EAAE,aAAa,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAChC,aAAa,EAAE,aAAa,CAAC,IAAI,GAChC,QAAQ,CAAC,CAAC,CAAC,CAOb;AAED,MAAM,MAAM,IAAI,GAAG,QAAQ,GAAG,YAAY,CAAC;AAE3C;;;;;GAKG;AACH,MAAM,MAAM,IAAI,GAAG,SAAS,GAAG,WAAW,CAAC;AAE3C;;GAEG;AACH,MAAM,MAAM,SAAS,GAAG,SAAS,aAAa,CAAC,QAAQ,CAAC,EAAE,CAAC;AAE3D;;GAEG;AACH,MAAM,MAAM,WAAW,GAAG,SAAS,aAAa,CAAC,MAAM,CAAC,EAAE,CAAC;AAE3D;;GAEG;AACH,MAAM,MAAM,YAAY,GAAG,SAAS,qBAAqB,EAAE,CAAC;AAE5D,MAAM,MAAM,gBAAgB,CAAC,GAAG,EAAE,KAAK,GAAG,iBAAiB,IAAI;IAC7D,QAAQ,CAAC,EAAE,EAAE,KAAK,CAAC;IACnB,QAAQ,CAAC,GAAG,EAAE,GAAG,CAAC;IAClB,QAAQ,CAAC,QAAQ,EAAE,KAAK,CAAC;CAC1B,CAAC;AAEF,MAAM,MAAM,gBAAgB,CAAC,GAAG,EAAE,KAAK,GAAG,iBAAiB,IAAI;IAC7D,QAAQ,CAAC,EAAE,EAAE,KAAK,CAAC;IACnB,QAAQ,CAAC,GAAG,EAAE,GAAG,CAAC;IAClB,QAAQ,CAAC,QAAQ,EAAE,KAAK,CAAC;CAC1B,CAAC;AAEF,MAAM,MAAM,mBAAmB,CAAC,GAAG,EAAE,KAAK,GAAG,iBAAiB,IAAI;IAChE,QAAQ,CAAC,EAAE,EAAE,QAAQ,CAAC;IACtB,QAAQ,CAAC,GAAG,EAAE,GAAG,CAAC;IAClB,QAAQ,CAAC,QAAQ,EAAE,KAAK,CAAC;IACzB,QAAQ,CAAC,QAAQ,EAAE,KAAK,CAAC;CAC1B,CAAC;AAEF;;;;;;;;GAQG;AACH,MAAM,MAAM,aAAa,CAAC,GAAG,IACzB,gBAAgB,CAAC,GAAG,CAAC,GACrB,gBAAgB,CAAC,GAAG,CAAC,GACrB,mBAAmB,CAAC,GAAG,CAAC,CAAC;AAG7B,MAAM,MAAM,qBAAqB,CAAC,GAAG,GAAG,MAAM,EAAE,KAAK,GAAG,eAAe,IACnE,gBAAgB,CAAC,GAAG,EAAE,KAAK,CAAC,GAC5B,gBAAgB,CAAC,GAAG,EAAE,KAAK,CAAC,GAC5B,mBAAmB,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;AAEpC;;;GAGG;AACH,wBAAsB,QAAQ,CAC5B,GAAG,EAAE,MAAM,EACX,IAAI,EAAE,IAAI,EACV,MAAM,EAAE,SAAS,EACjB,gBAAgB,EAAE,IAAI,GACrB,OAAO,CAAC,YAAY,CAAC,CAgBvB;AAED,KAAK,mBAAmB,GAAG,SAAS,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC;AAErD;;;;;;;GAOG;AACH,wBAAgB,YAAY,CAC1B,GAAG,EAAE,MAAM,EACX,OAAO,EAAE,mBAAmB,GAC3B,MAAM,CAIR;AAED,wBAAgB,iBAAiB,CAC/B,CAAC,EAAE,MAAM,EACT,OAAO,EAAE,mBAAmB,EAC5B,GAAG,EAAE,MAAM,GACV,OAAO,CAET;AAED,wBAAgB,cAAc,CAC5B,CAAC,EAAE,OAAO,EACV,aAAa,EAAE,aAAa,CAAC,IAAI,EACjC,cAAc,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,KAAK,MAAM,GACjD,YAAY,GAAG,QAAQ,CAyBzB;AAmCD,wBAAgB,cAAc,CAAC,IAAI,EAAE,IAAI,GAAG,IAAI,IAAI,YAAY,CAE/D;AAED,uBAAe,QAAQ,CAAC,KAAK;;IAC3B,OAAO,EAAE,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;IAC7B,IAAI,EAAE,IAAI,CAAC;IACX,QAAQ,CAAC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IAChC,QAAQ,CAAC,SAAS,EAAE,OAAO,CAAC;gBAIhB,OAAO,EAAE,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,SAAS,EAAE,OAAO;IAMxE,QAAQ,CAAC,GAAG,CACV,GAAG,EAAE,MAAM,EACX,KAAK,EAAE,eAAe,EACtB,SAAS,EAAE,MAAM,EACjB,IAAI,EAAE,UAAU,GACf,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;IAE3B,QAAQ,CAAC,GAAG,CACV,GAAG,EAAE,MAAM,EACX,IAAI,EAAE,UAAU,GACf,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,GAAG,YAAY,CAAC;IAE1C,MAAM,IAAI,MAAM;IAIhB,gBAAgB,CAAC,IAAI,EAAE,SAAS,GAAG,MAAM;IAYzC,SAAS,CAAC,WAAW,CAAC,IAAI,EAAE,UAAU;CAMvC;AAED,wBAAgB,WAAW,CAAC,CAAC,EAC3B,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,EACjB,aAAa,EAAE,aAAa,CAAC,IAAI,GAChC,QAAQ,CAAC,CAAC,CAAC,CAEb;AAED,qBAAa,YAAa,SAAQ,QAAQ,CAAC,eAAe,CAAC;;IACzD,QAAQ,CAAC,KAAK,KAAK;IAEnB,GAAG,CACD,GAAG,EAAE,MAAM,EACX,KAAK,EAAE,eAAe,EACtB,SAAS,EAAE,MAAM,EACjB,IAAI,EAAE,UAAU,GACf,OAAO,CAAC,YAAY,CAAC;IA+BxB,GAAG,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,UAAU,GAAG,OAAO,CAAC,YAAY,CAAC;IAWlD,IAAI,CAAC,KAAK,EAAE,SAAS,GAAG,cAAc,CAAC,MAAM,EAAE,IAAI,CAAC;IAMpD,WAAW,CAChB,KAAK,EAAE,SAAS,GACf,cAAc,CAAC,KAAK,CAAC,eAAe,CAAC,EAAE,IAAI,CAAC;CAKhD;AAkBD,qBAAa,gBAAiB,SAAQ,QAAQ,CAAC,IAAI,CAAC;;IAClD,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;gBAGrB,OAAO,EAAE,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,EAC3B,IAAI,EAAE,IAAI,EACV,KAAK,EAAE,MAAM,EACb,SAAS,EAAE,OAAO;IAMd,GAAG,CACP,GAAG,EAAE,MAAM,EACX,KAAK,EAAE,eAAe,EACtB,SAAS,EAAE,MAAM,EACjB,IAAI,EAAE,UAAU,GACf,OAAO,CAAC,gBAAgB,CAAC;IAkHtB,GAAG,CACP,GAAG,EAAE,MAAM,EACX,IAAI,EAAE,UAAU,GACf,OAAO,CAAC,gBAAgB,GAAG,YAAY,CAAC;IAwCpC,IAAI,CAAC,IAAI,EAAE,SAAS,GAAG,cAAc,CAAC,MAAM,EAAE,IAAI,CAAC;IAOnD,WAAW,CAChB,IAAI,EAAE,SAAS,GACd,cAAc,CAAC,KAAK,CAAC,eAAe,CAAC,EAAE,IAAI,CAAC;IAO/C,WAAW,CACT,KAAK,EAAE,MAAM,EACb,MAAM,EAAE,MAAM,EACd,IAAI,EAAE,SAAS,GACd,OAAO,CAAC,KAAK,CAAC,gBAAgB,GAAG,YAAY,CAAC,CAAC;IAQ5C,oBAAoB,CACxB,KAAK,EAAE,MAAM,EACb,MAAM,EAAE,MAAM,EACd,IAAI,EAAE,SAAS,GACd,OAAO,CAAC,gBAAgB,GAAG,YAAY,CAAC;CAwB5C;AAED,wBAAgB,WAAW,CACzB,OAAO,EAAE,KAAK,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC,EACtC,IAAI,EAAE,IAAI,EACV,KAAK,EAAE,MAAM,EACb,SAAS,EAAE,OAAO,GACjB,YAAY,CAAC;AAChB,wBAAgB,WAAW,CACzB,OAAO,EAAE,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,EAC3B,IAAI,EAAE,IAAI,EACV,KAAK,EAAE,MAAM,EACb,SAAS,EAAE,OAAO,GACjB,gBAAgB,CAAC;AACpB,wBAAgB,WAAW,CACzB,OAAO,EAAE,KAAK,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,EAC3D,IAAI,EAAE,IAAI,EACV,KAAK,EAAE,MAAM,EACb,SAAS,EAAE,OAAO,GACjB,YAAY,GAAG,gBAAgB,CAAC;AAiBnC,wBAAgB,cAAc,CAC5B,IAAI,EAAE,YAAY,GAAG,gBAAgB,GACpC,IAAI,IAAI,YAAY,CAEtB;AAED,wBAAgB,SAAS,CAAC,CAAC,EACzB,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,EAEnB,cAAc,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,MAAM,EAChC,GAAG,EAAE,MAAM,EACX,GAAG,EAAE,MAAM,GACV,CAAC,EAAE,EAAE,CAqCP;AAED,eAAO,MAAM,aAAa,6BAIzB,CAAC;AACF,eAAO,MAAM,iBAAiB,cAAyC,CAAC;AAExE,wBAAgB,6BAA6B,CAC3C,IAAI,EAAE,QAAQ,CAAC,OAAO,CAAC,EACvB,cAAc,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,MAAM,GAC3C,CAAC,MAAM,EAAE,IAAI,EAAE,MAAM,CAAC,CAKxB"}

package/out/replicache/src/btree/read.d.ts

@@ -0,0 +1,32 @@
+import type { Read } from '../dag/store.js';
+import type { FormatVersion } from '../format-version-enum.js';
+import type { FrozenJSONValue } from '../frozen-json.js';
+import { type Hash } from '../hash.js';
+import { DataNodeImpl, type Entry, type InternalDiff, type InternalDiffOperation, InternalNodeImpl } from './node.js';
+/**
+ * The size of the header of a node. (If we had compile time
+ * constants we would have used that).
+ *
+ * There is a test ensuring this is correct.
+ */
+export declare const NODE_HEADER_SIZE = 11;
+export declare class BTreeRead implements AsyncIterable<Entry<FrozenJSONValue>> {
+    protected readonly _cache: Map<Hash, DataNodeImpl | InternalNodeImpl>;
+    protected readonly _dagRead: Read;
+    protected readonly _formatVersion: FormatVersion;
+    rootHash: Hash;
+    readonly getEntrySize: <K, V>(k: K, v: V) => number;
+    readonly chunkHeaderSize: number;
+    constructor(dagRead: Read, formatVersion: FormatVersion, root?: Hash, getEntrySize?: <K, V>(k: K, v: V) => number, chunkHeaderSize?: number);
+    getNode(hash: Hash): Promise<DataNodeImpl | InternalNodeImpl>;
+    get(key: string): Promise<FrozenJSONValue | undefined>;
+    has(key: string): Promise<boolean>;
+    isEmpty(): Promise<boolean>;
+    scan(fromKey: string): AsyncIterableIterator<Entry<FrozenJSONValue>>;
+    keys(): AsyncIterableIterator<string>;
+    entries(): AsyncIterableIterator<Entry<FrozenJSONValue>>;
+    [Symbol.asyncIterator](): AsyncIterableIterator<Entry<FrozenJSONValue>>;
+    diff(last: BTreeRead): AsyncIterableIterator<InternalDiffOperation>;
+}
+export declare function allEntriesAsDiff(map: BTreeRead, op: 'add' | 'del'): Promise<InternalDiff>;
+//# sourceMappingURL=read.d.ts.map

package/out/replicache/src/btree/read.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"read.d.ts","sourceRoot":"","sources":["../../../../../replicache/src/btree/read.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAC,IAAI,EAAC,MAAM,iBAAiB,CAAC;AAC1C,OAAO,KAAK,EAAC,aAAa,EAAC,MAAM,2BAA2B,CAAC;AAC7D,OAAO,KAAK,EAAC,eAAe,EAAC,MAAM,mBAAmB,CAAC;AACvD,OAAO,EAAC,KAAK,IAAI,EAAY,MAAM,YAAY,CAAC;AAEhD,OAAO,EACL,YAAY,EACZ,KAAK,KAAK,EACV,KAAK,YAAY,EACjB,KAAK,qBAAqB,EAC1B,gBAAgB,EAUjB,MAAM,WAAW,CAAC;AASnB;;;;;GAKG;AACH,eAAO,MAAM,gBAAgB,KAAK,CAAC;AAEnC,qBAAa,SAAU,YAAW,aAAa,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC;IACrE,SAAS,CAAC,QAAQ,CAAC,MAAM,EAAE,GAAG,CAAC,IAAI,EAAE,YAAY,GAAG,gBAAgB,CAAC,CACzD;IAEZ,SAAS,CAAC,QAAQ,CAAC,QAAQ,EAAE,IAAI,CAAC;IAClC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,aAAa,CAAC;IACjD,QAAQ,EAAE,IAAI,CAAC;IACf,QAAQ,CAAC,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,MAAM,CAAC;IACpD,QAAQ,CAAC,eAAe,EAAE,MAAM,CAAC;gBAG/B,OAAO,EAAE,IAAI,EACb,aAAa,EAAE,aAAa,EAC5B,IAAI,GAAE,IAAgB,EACtB,YAAY,GAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,MAAuB,EAC3D,eAAe,SAAmB;IAS9B,OAAO,CAAC,IAAI,EAAE,IAAI,GAAG,OAAO,CAAC,YAAY,GAAG,gBAAgB,CAAC;IA0B7D,GAAG,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC,eAAe,GAAG,SAAS,CAAC;IAStD,GAAG,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC;IAMlC,OAAO,IAAI,OAAO,CAAC,OAAO,CAAC;IAcjC,IAAI,CAAC,OAAO,EAAE,MAAM,GAAG,qBAAqB,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC;IAwB7D,IAAI,IAAI,qBAAqB,CAAC,MAAM,CAAC;IAKrC,OAAO,IAAI,qBAAqB,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC;IAK/D,CAAC,MAAM,CAAC,aAAa,CAAC,IAAI,qBAAqB,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC;IAIhE,IAAI,CAAC,IAAI,EAAE,SAAS,GAAG,qBAAqB,CAAC,qBAAqB,CAAC;CAO3E;AA8KD,wBAAsB,gBAAgB,CACpC,GAAG,EAAE,SAAS,EACd,EAAE,EAAE,KAAK,GAAG,KAAK,GAChB,OAAO,CAAC,YAAY,CAAC,CAmBvB"}

package/out/replicache/src/btree/splice.d.ts

@@ -0,0 +1,9 @@
+export type Splice = [at: number, removed: number, added: number, from: number];
+export declare const SPLICE_AT = 0;
+export declare const SPLICE_REMOVED = 1;
+export declare const SPLICE_ADDED = 2;
+export declare const SPLICE_FROM = 3;
+type Entry<V> = readonly [key: string, value: V, ...rest: unknown[]];
+export declare function computeSplices<T>(previous: readonly Entry<T>[], current: readonly Entry<T>[]): Generator<Splice, void>;
+export {};
+//# sourceMappingURL=splice.d.ts.map

package/out/replicache/src/btree/splice.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"splice.d.ts","sourceRoot":"","sources":["../../../../../replicache/src/btree/splice.ts"],"names":[],"mappings":"AAEA,MAAM,MAAM,MAAM,GAAG,CAAC,EAAE,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC;AAGhF,eAAO,MAAM,SAAS,IAAI,CAAC;AAC3B,eAAO,MAAM,cAAc,IAAI,CAAC;AAChC,eAAO,MAAM,YAAY,IAAI,CAAC;AAC9B,eAAO,MAAM,WAAW,IAAI,CAAC;AAK7B,KAAK,KAAK,CAAC,CAAC,IAAI,SAAS,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,IAAI,EAAE,OAAO,EAAE,CAAC,CAAC;AAErE,wBAAiB,cAAc,CAAC,CAAC,EAC/B,QAAQ,EAAE,SAAS,KAAK,CAAC,CAAC,CAAC,EAAE,EAC7B,OAAO,EAAE,SAAS,KAAK,CAAC,CAAC,CAAC,EAAE,GAC3B,SAAS,CAAC,MAAM,EAAE,IAAI,CAAC,CA8EzB"}

package/out/replicache/src/btree/write.d.ts

@@ -0,0 +1,24 @@
+import type { Write } from '../dag/store.js';
+import type { FormatVersion } from '../format-version-enum.js';
+import type { FrozenJSONValue } from '../frozen-json.js';
+import { type Hash } from '../hash.js';
+import { DataNodeImpl, type Entry, InternalNodeImpl } from './node.js';
+import { BTreeRead } from './read.js';
+export declare class BTreeWrite extends BTreeRead {
+    #private;
+    protected _dagRead: Write;
+    readonly minSize: number;
+    readonly maxSize: number;
+    constructor(dagWrite: Write, formatVersion: FormatVersion, root?: Hash, minSize?: number, maxSize?: number, getEntrySize?: <K, V>(k: K, v: V) => number, chunkHeaderSize?: number);
+    updateNode(node: DataNodeImpl | InternalNodeImpl): void;
+    newInternalNodeImpl(entries: Array<Entry<Hash>>, level: number): InternalNodeImpl;
+    newDataNodeImpl(entries: Entry<FrozenJSONValue>[]): DataNodeImpl;
+    newNodeImpl(entries: Entry<FrozenJSONValue>[], level: number): DataNodeImpl;
+    newNodeImpl(entries: Entry<Hash>[], level: number): InternalNodeImpl;
+    newNodeImpl(entries: Entry<Hash>[] | Entry<FrozenJSONValue>[], level: number): InternalNodeImpl | DataNodeImpl;
+    put(key: string, value: FrozenJSONValue): Promise<void>;
+    del(key: string): Promise<boolean>;
+    clear(): Promise<void>;
+    flush(): Promise<Hash>;
+}
+//# sourceMappingURL=write.d.ts.map

package/out/replicache/src/btree/write.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"write.d.ts","sourceRoot":"","sources":["../../../../../replicache/src/btree/write.ts"],"names":[],"mappings":"AAIA,OAAO,KAAK,EAAC,KAAK,EAAC,MAAM,iBAAiB,CAAC;AAC3C,OAAO,KAAK,EAAC,aAAa,EAAC,MAAM,2BAA2B,CAAC;AAC7D,OAAO,KAAK,EAAC,eAAe,EAAC,MAAM,mBAAmB,CAAC;AACvD,OAAO,EAAC,KAAK,IAAI,EAA2B,MAAM,YAAY,CAAC;AAE/D,OAAO,EACL,YAAY,EACZ,KAAK,KAAK,EACV,gBAAgB,EAOjB,MAAM,WAAW,CAAC;AACnB,OAAO,EAAC,SAAS,EAAC,MAAM,WAAW,CAAC;AAEpC,qBAAa,UAAW,SAAQ,SAAS;;IAoBvC,UAAkB,QAAQ,EAAE,KAAK,CAAC;IAElC,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;gBAGvB,QAAQ,EAAE,KAAK,EACf,aAAa,EAAE,aAAa,EAC5B,IAAI,GAAE,IAAgB,EACtB,OAAO,SAAW,EAClB,OAAO,SAAY,EACnB,YAAY,GAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,MAAuB,EAC3D,eAAe,CAAC,EAAE,MAAM;IAc1B,UAAU,CAAC,IAAI,EAAE,YAAY,GAAG,gBAAgB,GAAG,IAAI;IAOvD,mBAAmB,CACjB,OAAO,EAAE,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,EAC3B,KAAK,EAAE,MAAM,GACZ,gBAAgB;IAMnB,eAAe,CAAC,OAAO,EAAE,KAAK,CAAC,eAAe,CAAC,EAAE,GAAG,YAAY;IAMhE,WAAW,CAAC,OAAO,EAAE,KAAK,CAAC,eAAe,CAAC,EAAE,EAAE,KAAK,EAAE,MAAM,GAAG,YAAY;IAC3E,WAAW,CAAC,OAAO,EAAE,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,EAAE,MAAM,GAAG,gBAAgB;IACpE,WAAW,CACT,OAAO,EAAE,KAAK,CAAC,IAAI,CAAC,EAAE,GAAG,KAAK,CAAC,eAAe,CAAC,EAAE,EACjD,KAAK,EAAE,MAAM,GACZ,gBAAgB,GAAG,YAAY;IAUlC,GAAG,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,eAAe,GAAG,OAAO,CAAC,IAAI,CAAC;IA6BvD,GAAG,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC;IAqBlC,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;IAOtB,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;CAyBvB"}

package/out/replicache/src/call-default-fetch.d.ts

@@ -0,0 +1,6 @@
+import type { HTTPRequestInfo } from './http-request-info.js';
+/**
+ * Helper function for {@link getDefaultPuller} and {@link getDefaultPusher}.
+ */
+export declare function callDefaultFetch<Body>(url: string, auth: string, requestID: string, requestBody: Body): Promise<readonly [Response | undefined, HTTPRequestInfo]>;
+//# sourceMappingURL=call-default-fetch.d.ts.map

package/out/replicache/src/call-default-fetch.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"call-default-fetch.d.ts","sourceRoot":"","sources":["../../../../replicache/src/call-default-fetch.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAC,eAAe,EAAC,MAAM,wBAAwB,CAAC;AAE5D;;GAEG;AACH,wBAAsB,gBAAgB,CAAC,IAAI,EACzC,GAAG,EAAE,MAAM,EACX,IAAI,EAAE,MAAM,EACZ,SAAS,EAAE,MAAM,EACjB,WAAW,EAAE,IAAI,GAChB,OAAO,CAAC,SAAS,CAAC,QAAQ,GAAG,SAAS,EAAE,eAAe,CAAC,CAAC,CAgC3D"}

package/out/replicache/src/config.d.ts

@@ -0,0 +1,13 @@
+import { isProd } from '../../shared/src/config.js';
+export { isProd as skipBTreeNodeAsserts, isProd as skipCommitDataAsserts, 
+/**
+ * In debug mode we deeply freeze the values we read out of the IDB store and we
+ * deeply freeze the values we put into the stores.
+ */
+isProd as skipFreeze, 
+/**
+ * In debug mode we assert that chunks and BTree data is deeply frozen. In
+ * release mode we skip these asserts.
+ */
+isProd as skipFrozenAsserts, isProd as skipGCAsserts, };
+//# sourceMappingURL=config.d.ts.map

package/out/replicache/src/config.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"config.d.ts","sourceRoot":"","sources":["../../../../replicache/src/config.ts"],"names":[],"mappings":"AAAA,OAAO,EAAC,MAAM,EAAC,MAAM,sBAAsB,CAAC;AAE5C,OAAO,EACL,MAAM,IAAI,oBAAoB,EAC9B,MAAM,IAAI,qBAAqB;AAC/B;;;GAGG;AACH,MAAM,IAAI,UAAU;AACpB;;;GAGG;AACH,MAAM,IAAI,iBAAiB,EAC3B,MAAM,IAAI,aAAa,GACxB,CAAC"}

package/out/replicache/src/connection-loop-delegates.d.ts

@@ -0,0 +1,20 @@
+import type { ConnectionLoopDelegate } from './connection-loop.js';
+import type { ReplicacheImpl } from './replicache-impl.js';
+declare class ConnectionLoopDelegateImpl {
+    readonly rep: ReplicacheImpl;
+    readonly invokeSend: () => Promise<boolean>;
+    readonly maxConnections = 1;
+    constructor(rep: ReplicacheImpl, invokeSend: () => Promise<boolean>);
+    get maxDelayMs(): number;
+    get minDelayMs(): number;
+}
+export declare class PullDelegate extends ConnectionLoopDelegateImpl implements ConnectionLoopDelegate {
+    readonly debounceDelay = 0;
+    get watchdogTimer(): number | null;
+}
+export declare class PushDelegate extends ConnectionLoopDelegateImpl implements ConnectionLoopDelegate {
+    get debounceDelay(): number;
+    watchdogTimer: null;
+}
+export {};
+//# sourceMappingURL=connection-loop-delegates.d.ts.map

package/out/replicache/src/connection-loop-delegates.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"connection-loop-delegates.d.ts","sourceRoot":"","sources":["../../../../replicache/src/connection-loop-delegates.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAC,sBAAsB,EAAC,MAAM,sBAAsB,CAAC;AACjE,OAAO,KAAK,EAAC,cAAc,EAAC,MAAM,sBAAsB,CAAC;AAEzD,cAAM,0BAA0B;IAC9B,QAAQ,CAAC,GAAG,EAAE,cAAc,CAAC;IAC7B,QAAQ,CAAC,UAAU,EAAE,MAAM,OAAO,CAAC,OAAO,CAAC,CAAC;IAI5C,QAAQ,CAAC,cAAc,KAAK;gBAEhB,GAAG,EAAE,cAAc,EAAE,UAAU,EAAE,MAAM,OAAO,CAAC,OAAO,CAAC;IAKnE,IAAI,UAAU,IAAI,MAAM,CAEvB;IAED,IAAI,UAAU,IAAI,MAAM,CAEvB;CACF;AAED,qBAAa,YACX,SAAQ,0BACR,YAAW,sBAAsB;IAEjC,QAAQ,CAAC,aAAa,KAAK;IAE3B,IAAI,aAAa,IAAI,MAAM,GAAG,IAAI,CAEjC;CACF;AAED,qBAAa,YACX,SAAQ,0BACR,YAAW,sBAAsB;IAEjC,IAAI,aAAa,IAAI,MAAM,CAE1B;IAED,aAAa,OAAQ;CACtB"}

package/out/replicache/src/connection-loop.d.ts

@@ -0,0 +1,28 @@
+import type { LogContext } from '@rocicorp/logger';
+import type { DocumentVisibilityWatcher } from '../../shared/src/document-visible.js';
+export declare const DEBOUNCE_DELAY_MS = 10;
+export declare const MIN_DELAY_MS = 30;
+export declare const MAX_DELAY_MS = 60000;
+export interface ConnectionLoopDelegate {
+    invokeSend(): Promise<boolean>;
+    debounceDelay: number;
+    watchdogTimer: number | null;
+    maxConnections: number;
+    maxDelayMs: number;
+    minDelayMs: number;
+}
+export declare class ConnectionLoop {
+    #private;
+    constructor(lc: LogContext, delegate: ConnectionLoopDelegate, visibilityWatcher?: DocumentVisibilityWatcher);
+    close(): void;
+    /**
+     *
+     * @returns Returns undefined if ok, otherwise it return the error that caused
+     * the send to fail.
+     */
+    send(now: boolean): Promise<undefined | {
+        error: unknown;
+    }>;
+    run(): Promise<void>;
+}
+//# sourceMappingURL=connection-loop.d.ts.map

package/out/replicache/src/connection-loop.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"connection-loop.d.ts","sourceRoot":"","sources":["../../../../replicache/src/connection-loop.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAC,UAAU,EAAC,MAAM,kBAAkB,CAAC;AAEjD,OAAO,KAAK,EAAC,yBAAyB,EAAC,MAAM,gCAAgC,CAAC;AAG9E,eAAO,MAAM,iBAAiB,KAAK,CAAC;AAEpC,eAAO,MAAM,YAAY,KAAK,CAAC;AAC/B,eAAO,MAAM,YAAY,QAAS,CAAC;AAInC,MAAM,WAAW,sBAAsB;IACrC,UAAU,IAAI,OAAO,CAAC,OAAO,CAAC,CAAC;IAC/B,aAAa,EAAE,MAAM,CAAC;IAEtB,aAAa,EAAE,MAAM,GAAG,IAAI,CAAC;IAC7B,cAAc,EAAE,MAAM,CAAC;IACvB,UAAU,EAAE,MAAM,CAAC;IACnB,UAAU,EAAE,MAAM,CAAC;CACpB;AAED,qBAAa,cAAc;;gBA0DvB,EAAE,EAAE,UAAU,EACd,QAAQ,EAAE,sBAAsB,EAChC,iBAAiB,CAAC,EAAE,yBAAyB;IAQ/C,KAAK,IAAI,IAAI;IAOb;;;;OAIG;IACG,IAAI,CAAC,GAAG,EAAE,OAAO,GAAG,OAAO,CAAC,SAAS,GAAG;QAAC,KAAK,EAAE,OAAO,CAAA;KAAC,CAAC;IAmBzD,GAAG,IAAI,OAAO,CAAC,IAAI,CAAC;CA+I3B"}

package/out/replicache/src/cookies.d.ts

@@ -0,0 +1,29 @@
+import { type ReadonlyJSONValue } from '../../shared/src/json.js';
+import type { FrozenJSONValue } from './frozen-json.js';
+/**
+ * A cookie is a value that is used to determine the order of snapshots. It
+ * needs to be comparable. This can be a `string`, `number` or if you want to
+ * use a more complex value, you can use an object with an `order` property. The
+ * value `null` is considered to be less than any other cookie and it is used
+ * for the first pull when no cookie has been set.
+ *
+ * The order is the natural order of numbers and strings. If one of the cookies
+ * is an object then the value of the `order` property is treated as the cookie
+ * when doing comparison.
+ *
+ * If one of the cookies is a string and the other is a number, the number is
+ * fist converted to a string (using `toString()`).
+ */
+export type Cookie = null | string | number | (ReadonlyJSONValue & {
+    readonly order: number | string;
+});
+export type FrozenCookie = null | string | number | (FrozenJSONValue & {
+    readonly order: number | string;
+});
+/**
+ * Compare two cookies.
+ * `null` is considered to be less than any other cookie.
+ */
+export declare function compareCookies(a: Cookie, b: Cookie): number;
+export declare function assertCookie(v: unknown): asserts v is Cookie;
+//# sourceMappingURL=cookies.d.ts.map

package/out/replicache/src/cookies.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"cookies.d.ts","sourceRoot":"","sources":["../../../../replicache/src/cookies.ts"],"names":[],"mappings":"AAAA,OAAO,EAAmB,KAAK,iBAAiB,EAAC,MAAM,oBAAoB,CAAC;AAE5E,OAAO,KAAK,EAAC,eAAe,EAAC,MAAM,kBAAkB,CAAC;AAEtD;;;;;;;;;;;;;GAaG;AACH,MAAM,MAAM,MAAM,GACd,IAAI,GACJ,MAAM,GACN,MAAM,GACN,CAAC,iBAAiB,GAAG;IAAC,QAAQ,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAAA;CAAC,CAAC,CAAC;AAE5D,MAAM,MAAM,YAAY,GACpB,IAAI,GACJ,MAAM,GACN,MAAM,GACN,CAAC,eAAe,GAAG;IAAC,QAAQ,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAAA;CAAC,CAAC,CAAC;AAE1D;;;GAGG;AACH,wBAAgB,cAAc,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAoB3D;AAWD,wBAAgB,YAAY,CAAC,CAAC,EAAE,OAAO,GAAG,OAAO,CAAC,CAAC,IAAI,MAAM,CAW5D"}

package/out/replicache/src/dag/chunk.d.ts

@@ -0,0 +1,35 @@
+import type { Hash } from '../hash.js';
+declare const refsTag: unique symbol;
+/**
+ * Opaque type representing a Refs. The reason to use an opaque type here is to
+ * make sure that Refs are always sorted and have no duplicates.
+ */
+export type Refs = [] | readonly [Hash] | (readonly Hash[] & {
+    [refsTag]: true;
+});
+/**
+ * Convert to a Refs when we already know it is sorted and has no duplicates.
+ */
+export declare function asRefs(sortedRefs: Hash[]): Refs;
+/**
+ * Sorts and tags as Refs. If an Array is passed in the array is sorted in
+ * place, otherwise a copy of the iterable is created. This checks for duplicates.
+ */
+export declare function toRefs(refs: Hash[] | Set<Hash>): Refs;
+export declare class Chunk<V = unknown> {
+    readonly hash: Hash;
+    readonly data: V;
+    /**
+     * Meta is an array of refs. If there are no refs we do not write a meta
+     * chunk.
+     */
+    readonly meta: Refs;
+    constructor(hash: Hash, data: V, refs: Refs);
+}
+export declare function assertRefs(v: unknown): asserts v is Refs;
+export declare function createChunk<V>(data: V, refs: Refs, chunkHasher: ChunkHasher): Chunk<V>;
+export type CreateChunk = <V>(data: V, refs: Refs) => Chunk<V>;
+export type ChunkHasher = () => Hash;
+export declare function throwChunkHasher(): Hash;
+export {};
+//# sourceMappingURL=chunk.d.ts.map

package/out/replicache/src/dag/chunk.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"chunk.d.ts","sourceRoot":"","sources":["../../../../../replicache/src/dag/chunk.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAC,IAAI,EAAC,MAAM,YAAY,CAAC;AAIrC,OAAO,CAAC,MAAM,OAAO,EAAE,OAAO,MAAM,CAAC;AAErC;;;GAGG;AACH,MAAM,MAAM,IAAI,GAAG,EAAE,GAAG,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,SAAS,IAAI,EAAE,GAAG;IAAC,CAAC,OAAO,CAAC,EAAE,IAAI,CAAA;CAAC,CAAC,CAAC;AAEhF;;GAEG;AACH,wBAAgB,MAAM,CAAC,UAAU,EAAE,IAAI,EAAE,GAAG,IAAI,CAE/C;AAED;;;GAGG;AACH,wBAAgB,MAAM,CAAC,IAAI,EAAE,IAAI,EAAE,GAAG,GAAG,CAAC,IAAI,CAAC,GAAG,IAAI,CAarD;AAED,qBAAa,KAAK,CAAC,CAAC,GAAG,OAAO;IAC5B,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC;IACpB,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC;IAEjB;;;OAGG;IACH,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC;gBAER,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,IAAI;CAU5C;AAED,wBAAgB,UAAU,CAAC,CAAC,EAAE,OAAO,GAAG,OAAO,CAAC,CAAC,IAAI,IAAI,CAUxD;AAED,wBAAgB,WAAW,CAAC,CAAC,EAC3B,IAAI,EAAE,CAAC,EACP,IAAI,EAAE,IAAI,EACV,WAAW,EAAE,WAAW,GACvB,KAAK,CAAC,CAAC,CAAC,CAGV;AAED,MAAM,MAAM,WAAW,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,IAAI,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC;AAE/D,MAAM,MAAM,WAAW,GAAG,MAAM,IAAI,CAAC;AAErC,wBAAgB,gBAAgB,IAAI,IAAI,CAEvC"}

package/out/replicache/src/dag/gc.d.ts

@@ -0,0 +1,42 @@
+import type { MaybePromise } from '../../../shared/src/types.js';
+import { type Hash } from '../hash.js';
+export type HeadChange = {
+    new: Hash | undefined;
+    old: Hash | undefined;
+};
+export interface RefCountUpdatesDelegate {
+    getRefCount: (hash: Hash) => MaybePromise<number | undefined>;
+    getRefs: (hash: Hash) => MaybePromise<readonly Hash[] | undefined>;
+    /**
+     * Should be implemented if the store lazily loads refs, returning whether
+     * or not the chunks refs have already been counted (i.e. are reflected
+     * in `getRefCount`).
+     *
+     * If defined then:
+     *  - `getRefs` should return undefined for refs that have not been loaded,
+     *    but should never return undefined for hashes in `putChunks`.
+     *  - it is assumed that chunks in `putChunks` may have been reachable before
+     *    the write, but may not have been counted.  This method is used to
+     *    determine if they have been counted or not.  If they have not been
+     *    counted, and are reachable with the write applied, the returned
+     *    ref count updates will include updates for counting them.
+     *
+     * If undefined then:
+     *  - `getRefs` should never return undefined
+     *  - it is assumed that the refs of any chunks which were reachable before
+     *    the write are already counted
+     */
+    areRefsCounted?: (hash: Hash) => boolean;
+}
+/**
+ * Computes how ref counts should be updated when a dag write is committed.
+ * Does not modify the dag store.
+ * @param headChanges Heads that were changed by the dag write.
+ * @param putChunks Chunks that were put by the dag write.
+ * @param delegate Delegate used for getting ref information from the dag store.
+ * @returns Map from chunk Hash to changed ref counts.  Chunks with a new ref
+ * count of 0 should be deleted.  All hashes in `putChunks` will have an entry
+ * (which will be zero if the newly put chunk is not reachable from any head).
+ */
+export declare function computeRefCountUpdates(headChanges: Iterable<HeadChange>, putChunks: ReadonlySet<Hash>, delegate: RefCountUpdatesDelegate): Promise<Map<Hash, number>>;
+//# sourceMappingURL=gc.d.ts.map

package/out/replicache/src/dag/gc.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"gc.d.ts","sourceRoot":"","sources":["../../../../../replicache/src/dag/gc.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAC,YAAY,EAAC,MAAM,qBAAqB,CAAC;AAEtD,OAAO,EAAC,KAAK,IAAI,EAAY,MAAM,YAAY,CAAC;AAEhD,MAAM,MAAM,UAAU,GAAG;IACvB,GAAG,EAAE,IAAI,GAAG,SAAS,CAAC;IACtB,GAAG,EAAE,IAAI,GAAG,SAAS,CAAC;CACvB,CAAC;AAIF,MAAM,WAAW,uBAAuB;IACtC,WAAW,EAAE,CAAC,IAAI,EAAE,IAAI,KAAK,YAAY,CAAC,MAAM,GAAG,SAAS,CAAC,CAAC;IAC9D,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,KAAK,YAAY,CAAC,SAAS,IAAI,EAAE,GAAG,SAAS,CAAC,CAAC;IACnE;;;;;;;;;;;;;;;;;;OAkBG;IACH,cAAc,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,KAAK,OAAO,CAAC;CAC1C;AAED;;;;;;;;;GASG;AACH,wBAAgB,sBAAsB,CACpC,WAAW,EAAE,QAAQ,CAAC,UAAU,CAAC,EACjC,SAAS,EAAE,WAAW,CAAC,IAAI,CAAC,EAC5B,QAAQ,EAAE,uBAAuB,GAChC,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,CAE5B"}

package/out/replicache/src/dag/key-type-enum.d.ts

@@ -0,0 +1,10 @@
+export declare const ChunkData = 0;
+export declare const ChunkMeta = 1;
+export declare const ChunkRefCount = 2;
+export declare const Head = 3;
+export type ChunkData = typeof ChunkData;
+export type ChunkMeta = typeof ChunkMeta;
+export type ChunkRefCount = typeof ChunkRefCount;
+export type Head = typeof Head;
+export type Type = ChunkData | ChunkMeta | ChunkRefCount | Head;
+//# sourceMappingURL=key-type-enum.d.ts.map

package/out/replicache/src/dag/key-type-enum.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"key-type-enum.d.ts","sourceRoot":"","sources":["../../../../../replicache/src/dag/key-type-enum.ts"],"names":[],"mappings":"AAEA,eAAO,MAAM,SAAS,IAAI,CAAC;AAC3B,eAAO,MAAM,SAAS,IAAI,CAAC;AAC3B,eAAO,MAAM,aAAa,IAAI,CAAC;AAC/B,eAAO,MAAM,IAAI,IAAI,CAAC;AAEtB,MAAM,MAAM,SAAS,GAAG,OAAO,SAAS,CAAC;AACzC,MAAM,MAAM,SAAS,GAAG,OAAO,SAAS,CAAC;AACzC,MAAM,MAAM,aAAa,GAAG,OAAO,aAAa,CAAC;AACjD,MAAM,MAAM,IAAI,GAAG,OAAO,IAAI,CAAC;AAE/B,MAAM,MAAM,IAAI,GAAG,SAAS,GAAG,SAAS,GAAG,aAAa,GAAG,IAAI,CAAC"}

package/out/replicache/src/dag/key.d.ts

@@ -0,0 +1,21 @@
+import { type Hash } from '../hash.js';
+import * as KeyType from './key-type-enum.js';
+export declare function chunkDataKey(hash: Hash): string;
+export declare function chunkMetaKey(hash: Hash): string;
+export declare function chunkRefCountKey(hash: Hash): string;
+export declare function headKey(name: string): string;
+export type Key = {
+    type: KeyType.ChunkData;
+    hash: Hash;
+} | {
+    type: KeyType.ChunkMeta;
+    hash: Hash;
+} | {
+    type: KeyType.ChunkRefCount;
+    hash: Hash;
+} | {
+    type: KeyType.Head;
+    name: string;
+};
+export declare function parse(key: string): Key;
+//# sourceMappingURL=key.d.ts.map

package/out/replicache/src/dag/key.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"key.d.ts","sourceRoot":"","sources":["../../../../../replicache/src/dag/key.ts"],"names":[],"mappings":"AAAA,OAAO,EAAC,KAAK,IAAI,EAAqB,MAAM,YAAY,CAAC;AACzD,OAAO,KAAK,OAAO,MAAM,oBAAoB,CAAC;AAE9C,wBAAgB,YAAY,CAAC,IAAI,EAAE,IAAI,GAAG,MAAM,CAE/C;AAED,wBAAgB,YAAY,CAAC,IAAI,EAAE,IAAI,GAAG,MAAM,CAE/C;AAED,wBAAgB,gBAAgB,CAAC,IAAI,EAAE,IAAI,GAAG,MAAM,CAEnD;AAED,wBAAgB,OAAO,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAE5C;AAED,MAAM,MAAM,GAAG,GACX;IACE,IAAI,EAAE,OAAO,CAAC,SAAS,CAAC;IACxB,IAAI,EAAE,IAAI,CAAC;CACZ,GACD;IACE,IAAI,EAAE,OAAO,CAAC,SAAS,CAAC;IACxB,IAAI,EAAE,IAAI,CAAC;CACZ,GACD;IACE,IAAI,EAAE,OAAO,CAAC,aAAa,CAAC;IAC5B,IAAI,EAAE,IAAI,CAAC;CACZ,GACD;IACE,IAAI,EAAE,OAAO,CAAC,IAAI,CAAC;IACnB,IAAI,EAAE,MAAM,CAAC;CACd,CAAC;AAEN,wBAAgB,KAAK,CAAC,GAAG,EAAE,MAAM,GAAG,GAAG,CAuCtC"}