mindoodb 0.0.2 → 0.0.4

package/dist/core/appendonlystores/MaterializationPlanner.js

@@ -0,0 +1,325 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.computeDocumentMaterializationPlan = computeDocumentMaterializationPlan;
+exports.computeBatchMaterializationPlan = computeBatchMaterializationPlan;
+/**
+ * Shared, metadata-only planner for causal document materialization.
+ *
+ * Why this exists:
+ * - local and remote stores need the same causal replay behavior
+ * - planner must work without decrypting payloads
+ * - replay order must be deterministic across runs
+ *
+ * Core invariant:
+ * - `entryIdsToApply` contains exactly the replay entries needed to reconstruct
+ *   latest state that are not already covered by the selected snapshot.
+ */
+const DOC_REPLAY_TYPES = new Set(["doc_create", "doc_change", "doc_delete"]);
+/**
+ * Returns true for entry types that can influence Automerge latest state replay.
+ */
+function isReplayEntry(meta) {
+    return DOC_REPLAY_TYPES.has(meta.entryType);
+}
+/**
+ * Computes latest-state heads and all replay entries causally reachable from them.
+ *
+ * `latestReachable` intentionally excludes unrelated historical branches that are
+ * not ancestors of current heads, so coverage/replay decisions only operate on
+ * data needed for latest state materialization.
+ */
+function buildLatestStateReachability(replayEntries) {
+    const byId = new Map();
+    const referenced = new Set();
+    for (const entry of replayEntries) {
+        byId.set(entry.id, entry);
+    }
+    for (const entry of replayEntries) {
+        for (const depId of entry.dependencyIds) {
+            if (byId.has(depId)) {
+                referenced.add(depId);
+            }
+        }
+    }
+    // Heads are entries that are not referenced as dependencies by any other replay entry.
+    const latestHeads = replayEntries
+        .filter((e) => !referenced.has(e.id))
+        .map((e) => e.id);
+    const latestReachable = new Set();
+    const stack = [...latestHeads];
+    while (stack.length > 0) {
+        const id = stack.pop();
+        if (latestReachable.has(id)) {
+            continue;
+        }
+        latestReachable.add(id);
+        const entry = byId.get(id);
+        if (!entry) {
+            continue;
+        }
+        for (const depId of entry.dependencyIds) {
+            if (byId.has(depId) && !latestReachable.has(depId)) {
+                stack.push(depId);
+            }
+        }
+    }
+    return { latestHeads, latestReachable };
+}
+/**
+ * Computes replay entries covered by the given snapshot.
+ *
+ * Coverage roots are chosen in this order:
+ * 1) explicit `snapshotHeadEntryIds` (preferred; most accurate)
+ * 2) snapshot `dependencyIds` (compatibility fallback)
+ */
+function coveredBySnapshot(snapshot, replayById) {
+    if (!snapshot) {
+        return new Set();
+    }
+    const roots = snapshot.snapshotHeadEntryIds && snapshot.snapshotHeadEntryIds.length > 0
+        ? snapshot.snapshotHeadEntryIds
+        : snapshot.dependencyIds;
+    const covered = new Set();
+    const stack = [...roots];
+    while (stack.length > 0) {
+        const id = stack.pop();
+        if (covered.has(id)) {
+            continue;
+        }
+        const entry = replayById.get(id);
+        if (!entry) {
+            continue;
+        }
+        covered.add(id);
+        for (const depId of entry.dependencyIds) {
+            if (!covered.has(depId)) {
+                stack.push(depId);
+            }
+        }
+    }
+    return covered;
+}
+/**
+ * Produces a stable, dependency-first ordering of replay entries using
+ * Kahn's algorithm for topological sorting.
+ *
+ * The caller passes a set of entry IDs that need to be replayed (the
+ * "uncovered" set from {@link computeDocumentMaterializationPlan}) and the
+ * full metadata map so the function can inspect each entry's
+ * `dependencyIds`.  The result is an array where every entry appears
+ * *after* all of its causal predecessors, which is the order
+ * `Automerge.applyChanges` requires to apply changes correctly.
+ *
+ * **Why Kahn's algorithm?**  It processes nodes in BFS order starting from
+ * roots (entries with no in-set dependencies), decrementing the in-degree
+ * of each dependent as its predecessors are emitted.  This naturally
+ * produces a valid topological order for any DAG.
+ *
+ * **Determinism:** When multiple entries become ready at the same time
+ * (in-degree drops to zero simultaneously), the queue is sorted
+ * lexicographically before the next dequeue.  This guarantees the same
+ * output regardless of `Set` or `Map` iteration order, which can vary
+ * across JavaScript engines and process runs.
+ *
+ * **Cycle safety:** In a well-formed Automerge DAG, cycles are impossible.
+ * However, if corrupted metadata somehow introduces a cycle, the algorithm
+ * detects it (ordered.length < ids.size) and falls back to a simple
+ * lexicographic sort so the caller still receives a complete list rather
+ * than a partial one.
+ *
+ * @param ids        The entry IDs to sort (typically the uncovered set).
+ * @param replayById Lookup map from entry ID to its metadata, used to
+ *                   read `dependencyIds` for graph edges.
+ * @returns Entry IDs in dependency-first order suitable for sequential
+ *          application to an Automerge document.
+ */
+function topologicalByDependencies(ids, replayById) {
+    // ── Build the in-degree and reverse-adjacency structures ──────────
+    // `indegree`   — for each id, how many of its dependencies are also in `ids`
+    // `dependents` — for each id, which other ids in the set depend on it
+    const indegree = new Map();
+    const dependents = new Map();
+    for (const id of ids) {
+        indegree.set(id, 0);
+        dependents.set(id, []);
+    }
+    for (const id of ids) {
+        const entry = replayById.get(id);
+        if (!entry) {
+            continue;
+        }
+        for (const depId of entry.dependencyIds) {
+            if (!ids.has(depId)) {
+                // Dependency is outside the uncovered set (already covered by
+                // the snapshot or not part of the latest-state DAG) — skip it.
+                continue;
+            }
+            indegree.set(id, (indegree.get(id) || 0) + 1);
+            dependents.get(depId).push(id);
+        }
+    }
+    // ── Kahn's BFS ────────────────────────────────────────────────────
+    // Seed the queue with root entries (in-degree 0 within the set).
+    const queue = Array.from(ids).filter((id) => (indegree.get(id) || 0) === 0);
+    queue.sort();
+    const ordered = [];
+    while (queue.length > 0) {
+        const id = queue.shift();
+        ordered.push(id);
+        for (const dep of dependents.get(id) || []) {
+            const next = (indegree.get(dep) || 0) - 1;
+            indegree.set(dep, next);
+            if (next === 0) {
+                queue.push(dep);
+            }
+        }
+        // Re-sort after adding newly ready entries to maintain determinism.
+        queue.sort();
+    }
+    // ── Cycle fallback ────────────────────────────────────────────────
+    if (ordered.length !== ids.size) {
+        return Array.from(ids).sort();
+    }
+    return ordered;
+}
+/**
+ * Computes a causal materialization plan for one document.
+ *
+ * Given all store entries for a document, this function answers two questions:
+ *
+ * 1. **Which snapshot should we load first?**
+ *    The planner evaluates every `doc_snapshot` entry and selects the one whose
+ *    causal coverage overlaps the most with the entries needed for the latest
+ *    document state.  A snapshot that covers 90% of the DAG means only 10%
+ *    of entries need to be replayed — a large win for documents with long
+ *    histories.  When two snapshots cover the same number of latest-state
+ *    entries, the newer one (by `createdAt`) wins as a deterministic
+ *    tie-breaker.  Correctness never depends on timestamps.
+ *
+ * 2. **Which change entries must be replayed on top of that snapshot?**
+ *    Every entry in the latest-state DAG that is *not* causally covered by
+ *    the selected snapshot is collected and sorted in dependency-first
+ *    (topological) order.  This is the minimal set of Automerge changes
+ *    the caller must decrypt and apply to reach the current document state.
+ *
+ * Snapshot selection strategy:
+ * - Choose the snapshot with maximal overlap against `latestReachable`.
+ * - Break equal-coverage ties by newer `createdAt` (optimization only).
+ * - If no snapshots exist, all replay entries are returned (full rebuild).
+ *
+ * Attachment entries (`attachment_chunk`) are never included — the planner
+ * operates exclusively on `doc_create`, `doc_change`, and `doc_delete`
+ * entries (the types tracked by `DOC_REPLAY_TYPES`).
+ *
+ * @param docId            The document to plan for.
+ * @param allEntriesForDoc Every entry metadata record for this document,
+ *                         including snapshots and attachments (attachments
+ *                         are filtered out internally).
+ * @param options          Pass `{ includeDiagnostics: true }` to populate the
+ *                         `diagnostics` field with head IDs and coverage counts.
+ * @returns A plan containing the snapshot to load (if any) and the ordered
+ *          list of entry IDs to apply afterwards.
+ */
+function computeDocumentMaterializationPlan(docId, allEntriesForDoc, options) {
+    // ── Step 1: Partition entries ──────────────────────────────────────
+    // Replay entries are the doc-lifecycle entries (create/change/delete) that
+    // form the Automerge DAG.  Snapshots are evaluated separately as candidate
+    // starting points.
+    const replayEntries = allEntriesForDoc.filter(isReplayEntry);
+    const replayById = new Map(replayEntries.map((e) => [e.id, e]));
+    const snapshots = allEntriesForDoc.filter((e) => e.entryType === "doc_snapshot");
+    // ── Step 2: Handle empty replay set ─────────────────────────────────
+    // After a dense sync the local store may contain only a snapshot with no
+    // individual change entries.  In that case select the newest snapshot so
+    // the caller can still load the document state.
+    if (replayEntries.length === 0) {
+        if (snapshots.length > 0) {
+            const best = snapshots.reduce((a, b) => (b.createdAt > a.createdAt ? b : a));
+            return {
+                docId,
+                snapshotEntryId: best.id,
+                entryIdsToApply: [],
+                diagnostics: options?.includeDiagnostics
+                    ? { headEntryIds: [], coveredLatestEntryCount: 0, uncoveredLatestEntryCount: 0 }
+                    : undefined,
+            };
+        }
+        return {
+            docId,
+            snapshotEntryId: null,
+            entryIdsToApply: [],
+            diagnostics: options?.includeDiagnostics
+                ? { headEntryIds: [], coveredLatestEntryCount: 0, uncoveredLatestEntryCount: 0 }
+                : undefined,
+        };
+    }
+    // ── Step 3: Build latest-state reachability ───────────────────────
+    // Identify the DAG heads (entries with no dependents) and walk backward
+    // to collect every entry causally needed for the current document state.
+    const { latestHeads, latestReachable } = buildLatestStateReachability(replayEntries);
+    // ── Step 4: Score each snapshot by how many latest-state entries it covers
+    let bestSnapshot = null;
+    let bestCoveredCount = -1;
+    for (const snapshot of snapshots) {
+        const covered = coveredBySnapshot(snapshot, replayById);
+        let coveredLatest = 0;
+        for (const id of latestReachable) {
+            if (covered.has(id)) {
+                coveredLatest++;
+            }
+        }
+        if (coveredLatest > bestCoveredCount ||
+            (coveredLatest === bestCoveredCount && bestSnapshot && snapshot.createdAt > bestSnapshot.createdAt)) {
+            bestSnapshot = snapshot;
+            bestCoveredCount = coveredLatest;
+        }
+        if (!bestSnapshot) {
+            bestSnapshot = snapshot;
+            bestCoveredCount = coveredLatest;
+        }
+    }
+    // ── Step 5: Compute the uncovered set ─────────────────────────────
+    // These are the entries that the selected snapshot does NOT already include.
+    // If no snapshot was selected, the entire latestReachable set is uncovered.
+    const covered = coveredBySnapshot(bestSnapshot, replayById);
+    const uncovered = new Set();
+    for (const id of latestReachable) {
+        if (!covered.has(id)) {
+            uncovered.add(id);
+        }
+    }
+    // ── Step 6: Sort uncovered entries in dependency-first order ──────
+    // This guarantees that Automerge.applyChanges sees each change only after
+    // all of its causal predecessors have already been applied.
+    const entryIdsToApply = topologicalByDependencies(uncovered, replayById);
+    return {
+        docId,
+        snapshotEntryId: bestSnapshot ? bestSnapshot.id : null,
+        entryIdsToApply,
+        diagnostics: options?.includeDiagnostics
+            ? {
+                headEntryIds: latestHeads,
+                coveredLatestEntryCount: bestCoveredCount < 0 ? 0 : bestCoveredCount,
+                uncoveredLatestEntryCount: uncovered.size,
+            }
+            : undefined,
+    };
+}
+/**
+ * Computes plans for many documents in one metadata pass.
+ *
+ * Batch planning is important for networked stores to reduce request/response
+ * chattiness during startup and dense sync operations.
+ */
+function computeBatchMaterializationPlan(allEntries, docIds, options) {
+    const byDoc = new Map();
+    for (const entry of allEntries) {
+        if (!byDoc.has(entry.docId)) {
+            byDoc.set(entry.docId, []);
+        }
+        byDoc.get(entry.docId).push(entry);
+    }
+    const plans = docIds.map((docId) => computeDocumentMaterializationPlan(docId, byDoc.get(docId) || [], options));
+    return { plans };
+}
+//# sourceMappingURL=MaterializationPlanner.js.map

package/dist/core/appendonlystores/MaterializationPlanner.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"MaterializationPlanner.js","sourceRoot":"","sources":["../../../src/core/appendonlystores/MaterializationPlanner.ts"],"names":[],"mappings":";;AAsPA,gFAkGC;AAQD,0EAkBC;AA3WD;;;;;;;;;;;GAWG;AACH,MAAM,gBAAgB,GAAG,IAAI,GAAG,CAAC,CAAC,YAAY,EAAE,YAAY,EAAE,YAAY,CAAC,CAAC,CAAC;AAE7E;;GAEG;AACH,SAAS,aAAa,CAAC,IAAwB;IAC7C,OAAO,gBAAgB,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;AAC9C,CAAC;AAED;;;;;;GAMG;AACH,SAAS,4BAA4B,CACnC,aAAmC;IAEnC,MAAM,IAAI,GAAG,IAAI,GAAG,EAA8B,CAAC;IACnD,MAAM,UAAU,GAAG,IAAI,GAAG,EAAU,CAAC;IACrC,KAAK,MAAM,KAAK,IAAI,aAAa,EAAE,CAAC;QAClC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;IAC5B,CAAC;IACD,KAAK,MAAM,KAAK,IAAI,aAAa,EAAE,CAAC;QAClC,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,aAAa,EAAE,CAAC;YACxC,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBACpB,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YACxB,CAAC;QACH,CAAC;IACH,CAAC;IAED,uFAAuF;IACvF,MAAM,WAAW,GAAG,aAAa;SAC9B,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;SACpC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAEpB,MAAM,eAAe,GAAG,IAAI,GAAG,EAAU,CAAC;IAC1C,MAAM,KAAK,GAAG,CAAC,GAAG,WAAW,CAAC,CAAC;IAC/B,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;QACxB,IAAI,eAAe,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YAC5B,SAAS;QACX,CAAC;QACD,eAAe,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACxB,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC3B,IAAI,CAAC,KAAK,EAAE,CAAC;YACX,SAAS;QACX,CAAC;QACD,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,aAAa,EAAE,CAAC;YACxC,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBACnD,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACpB,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,EAAE,WAAW,EAAE,eAAe,EAAE,CAAC;AAC1C,CAAC;AAED;;;;;;GAMG;AACH,SAAS,iBAAiB,CACxB,QAAmC,EACnC,UAA2C;IAE3C,IAAI,CAAC,QAAQ,EAAE,CAAC;QACd,OAAO,IAAI,GAAG,EAAU,CAAC;IAC3B,CAAC;IAED,MAAM,KAAK,GAAG,QAAQ,CAAC,oBAAoB,IAAI,QAAQ,CAAC,oBAAoB,CAAC,MAAM,GAAG,CAAC;QACrF,CAAC,CAAC,QAAQ,CAAC,oBAAoB;QAC/B,CAAC,CAAC,QAAQ,CAAC,aAAa,CAAC;IAE3B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,KAAK,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC;IACzB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;QACxB,IAAI,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YACpB,SAAS;QACX,CAAC;QACD,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACjC,IAAI,CAAC,KAAK,EAAE,CAAC;YACX,SAAS;QACX,CAAC;QACD,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAChB,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,aAAa,EAAE,CAAC;YACxC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBACxB,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACpB,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAiCG;AACH,SAAS,yBAAyB,CAChC,GAAgB,EAChB,UAA2C;IAE3C,qEAAqE;IACrE,6EAA6E;IAC7E,sEAAsE;IACtE,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,MAAM,UAAU,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC/C,KAAK,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC;QACrB,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QACpB,UAAU,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IACzB,CAAC;IAED,KAAK,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC;QACrB,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACjC,IAAI,CAAC,KAAK,EAAE,CAAC;YACX,SAAS;QACX,CAAC;QACD,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,aAAa,EAAE,CAAC;YACxC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBACpB,8DAA8D;gBAC9D,+DAA+D;gBAC/D,SAAS;YACX,CAAC;YACD,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC9C,UAAU,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAClC,CAAC;IACH,CAAC;IAED,qEAAqE;IACrE,iEAAiE;IACjE,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;IAC5E,KAAK,CAAC,IAAI,EAAE,CAAC;IACb,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,EAAE,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;QAC1B,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACjB,KAAK,MAAM,GAAG,IAAI,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC;YAC3C,MAAM,IAAI,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;YAC1C,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;YACxB,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;gBACf,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAClB,CAAC;QACH,CAAC;QACD,oEAAoE;QACpE,KAAK,CAAC,IAAI,EAAE,CAAC;IACf,CAAC;IAED,qEAAqE;IACrE,IAAI,OAAO,CAAC,MAAM,KAAK,GAAG,CAAC,IAAI,EAAE,CAAC;QAChC,OAAO,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;IAChC,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAqCG;AACH,SAAgB,kCAAkC,CAChD,KAAa,EACb,gBAAsC,EACtC,OAAoC;IAGpC,sEAAsE;IACtE,2EAA2E;IAC3E,2EAA2E;IAC3E,mBAAmB;IACnB,MAAM,aAAa,GAAG,gBAAgB,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC;IAC7D,MAAM,UAAU,GAAG,IAAI,GAAG,CAA6B,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5F,MAAM,SAAS,GAAG,gBAAgB,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,KAAK,cAAc,CAAC,CAAC;IAEjF,uEAAuE;IACvE,yEAAyE;IACzE,yEAAyE;IACzE,gDAAgD;IAChD,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC/B,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACzB,MAAM,IAAI,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC7E,OAAO;gBACL,KAAK;gBACL,eAAe,EAAE,IAAI,CAAC,EAAE;gBACxB,eAAe,EAAE,EAAE;gBACnB,WAAW,EAAE,OAAO,EAAE,kBAAkB;oBACtC,CAAC,CAAC,EAAE,YAAY,EAAE,EAAE,EAAE,uBAAuB,EAAE,CAAC,EAAE,yBAAyB,EAAE,CAAC,EAAE;oBAChF,CAAC,CAAC,SAAS;aACd,CAAC;QACJ,CAAC;QACD,OAAO;YACL,KAAK;YACL,eAAe,EAAE,IAAI;YACrB,eAAe,EAAE,EAAE;YACnB,WAAW,EAAE,OAAO,EAAE,kBAAkB;gBACtC,CAAC,CAAC,EAAE,YAAY,EAAE,EAAE,EAAE,uBAAuB,EAAE,CAAC,EAAE,yBAAyB,EAAE,CAAC,EAAE;gBAChF,CAAC,CAAC,SAAS;SACd,CAAC;IACJ,CAAC;IAED,qEAAqE;IACrE,wEAAwE;IACxE,yEAAyE;IACzE,MAAM,EAAE,WAAW,EAAE,eAAe,EAAE,GAAG,4BAA4B,CAAC,aAAa,CAAC,CAAC;IAErF,4EAA4E;IAC5E,IAAI,YAAY,GAA8B,IAAI,CAAC;IACnD,IAAI,gBAAgB,GAAG,CAAC,CAAC,CAAC;IAE1B,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;QACjC,MAAM,OAAO,GAAG,iBAAiB,CAAC,QAAQ,EAAE,UAAU,CAAC,CAAC;QACxD,IAAI,aAAa,GAAG,CAAC,CAAC;QACtB,KAAK,MAAM,EAAE,IAAI,eAAe,EAAE,CAAC;YACjC,IAAI,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;gBACpB,aAAa,EAAE,CAAC;YAClB,CAAC;QACH,CAAC;QACD,IACE,aAAa,GAAG,gBAAgB;YAChC,CAAC,aAAa,KAAK,gBAAgB,IAAI,YAAY,IAAI,QAAQ,CAAC,SAAS,GAAG,YAAY,CAAC,SAAS,CAAC,EACnG,CAAC;YACD,YAAY,GAAG,QAAQ,CAAC;YACxB,gBAAgB,GAAG,aAAa,CAAC;QACnC,CAAC;QACD,IAAI,CAAC,YAAY,EAAE,CAAC;YAClB,YAAY,GAAG,QAAQ,CAAC;YACxB,gBAAgB,GAAG,aAAa,CAAC;QACnC,CAAC;IACH,CAAC;IAED,qEAAqE;IACrE,6EAA6E;IAC7E,4EAA4E;IAC5E,MAAM,OAAO,GAAG,iBAAiB,CAAC,YAAY,EAAE,UAAU,CAAC,CAAC;IAC5D,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;IACpC,KAAK,MAAM,EAAE,IAAI,eAAe,EAAE,CAAC;QACjC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YACrB,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACpB,CAAC;IACH,CAAC;IAED,qEAAqE;IACrE,0EAA0E;IAC1E,4DAA4D;IAC5D,MAAM,eAAe,GAAG,yBAAyB,CAAC,SAAS,EAAE,UAAU,CAAC,CAAC;IAEzE,OAAO;QACL,KAAK;QACL,eAAe,EAAE,YAAY,CAAC,CAAC,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI;QACtD,eAAe;QACf,WAAW,EAAE,OAAO,EAAE,kBAAkB;YACtC,CAAC,CAAC;gBACE,YAAY,EAAE,WAAW;gBACzB,uBAAuB,EAAE,gBAAgB,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,gBAAgB;gBACpE,yBAAyB,EAAE,SAAS,CAAC,IAAI;aAC1C;YACH,CAAC,CAAC,SAAS;KACd,CAAC;AACJ,CAAC;AAED;;;;;GAKG;AACH,SAAgB,+BAA+B,CAC7C,UAAgC,EAChC,MAAgB,EAChB,OAAoC;IAEpC,MAAM,KAAK,GAAG,IAAI,GAAG,EAAgC,CAAC;IACtD,KAAK,MAAM,KAAK,IAAI,UAAU,EAAE,CAAC;QAC/B,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC;YAC5B,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;QAC7B,CAAC;QACD,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,CAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACtC,CAAC;IAED,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CACjC,kCAAkC,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,OAAO,CAAC,CAC3E,CAAC;IAEF,OAAO,EAAE,KAAK,EAAE,CAAC;AACnB,CAAC"}

package/dist/core/appendonlystores/bloom.d.ts

@@ -0,0 +1,85 @@
+/**
+ * Bloom filter for compact set-membership summaries of store entry IDs.
+ *
+ * During network sync, a local store needs to determine which of its entry IDs
+ * are missing from a remote store.  Naively this requires sending every local ID
+ * to the remote for an exact `hasEntries` check — an O(n) network round-trip
+ * that dominates sync latency for large stores.
+ *
+ * A bloom filter provides a probabilistic shortcut: the remote store serializes
+ * its full ID set into a compact bitset ({@link StoreIdBloomSummary}) and sends
+ * it to the local side in a single response.  The local side then tests each of
+ * its own IDs against the bloom filter:
+ *
+ *   - **Definite negative** — the ID is certainly absent on the remote; no
+ *     round-trip needed, the entry can be pushed immediately.
+ *   - **Probable positive** — the ID *might* exist on the remote (subject to a
+ *     configurable false-positive rate, default 1 %).  Only these IDs require a
+ *     follow-up `hasEntries` call to confirm.
+ *
+ * This is used by {@link BasicOnDiskContentAddressedStore.getIdBloomSummary} and
+ * consumed by the sync loop in `BaseMindooDB` to partition IDs into
+ * "definitely missing" and "maybe existing" buckets before making any network
+ * calls.
+ *
+ * ### Implementation details
+ *
+ * - Uses **enhanced double hashing** (FNV-1a + DJB2) to derive `k` bit
+ *   positions from a single ID string, avoiding the need for `k` independent
+ *   hash functions.
+ * - Bit-array size and hash count are computed from the classic bloom filter
+ *   formulas to satisfy the requested false-positive rate.
+ * - The filter is versioned (`"bloom-v1"`) so future changes to hashing or
+ *   encoding remain backward-compatible.
+ *
+ * @module bloom
+ */
+import type { StoreIdBloomSummary } from "./types";
+/**
+ * Build a bloom filter summary from a list of entry IDs.
+ *
+ * The resulting {@link StoreIdBloomSummary} is a compact, serializable
+ * representation that can be transferred over the network (e.g. in sync
+ * protocol responses) and later queried with {@link bloomMightContainId}.
+ *
+ * Typical usage in the on-disk store:
+ * ```ts
+ * const ids = await store.getAllIds();
+ * const summary = createIdBloomSummary(ids);
+ * // send summary to the syncing peer
+ * ```
+ *
+ * @param ids               Array of entry ID strings to include in the filter.
+ * @param falsePositiveRate Target false-positive probability (default 1 %).
+ * @returns A serializable bloom filter summary (base64-encoded bitset).
+ */
+export declare function createIdBloomSummary(ids: string[], falsePositiveRate?: number): StoreIdBloomSummary;
+/**
+ * Test whether an entry ID *might* be present in a bloom filter summary.
+ *
+ * - Returns `false` only when the ID is **definitely absent** — at least one
+ *   of its bit-positions is unset, so the ID was never inserted.
+ * - Returns `true` when the ID **might be present** — all bit-positions are
+ *   set, but this could be a false positive (probability ≤ the configured
+ *   false-positive rate).
+ *
+ * If the summary version is unrecognized, conservatively returns `true` to
+ * avoid incorrectly skipping entries during sync.
+ *
+ * Used in the sync loop to partition local IDs:
+ * ```ts
+ * for (const id of localIds) {
+ *   if (bloomMightContainId(remoteBloom, id)) {
+ *     maybeExisting.push(id);   // needs exact hasEntries() check
+ *   } else {
+ *     definitelyMissing.push(id); // can push without round-trip
+ *   }
+ * }
+ * ```
+ *
+ * @param summary  The bloom filter summary obtained from the remote store.
+ * @param id       The entry ID to test.
+ * @returns `true` if the ID might be in the set; `false` if it is definitely not.
+ */
+export declare function bloomMightContainId(summary: StoreIdBloomSummary, id: string): boolean;
+//# sourceMappingURL=bloom.d.ts.map

package/dist/core/appendonlystores/bloom.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"bloom.d.ts","sourceRoot":"","sources":["../../../src/core/appendonlystores/bloom.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAmCG;AAEH,OAAO,KAAK,EAAE,mBAAmB,EAAE,MAAM,SAAS,CAAC;AA+HnD;;;;;;;;;;;;;;;;;GAiBG;AACH,wBAAgB,oBAAoB,CAAC,GAAG,EAAE,MAAM,EAAE,EAAE,iBAAiB,GAAE,MAAoC,GAAG,mBAAmB,CAmBhI;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AACH,wBAAgB,mBAAmB,CAAC,OAAO,EAAE,mBAAmB,EAAE,EAAE,EAAE,MAAM,GAAG,OAAO,CAYrF"}

package/dist/core/appendonlystores/bloom.js

@@ -0,0 +1,228 @@
+"use strict";
+/**
+ * Bloom filter for compact set-membership summaries of store entry IDs.
+ *
+ * During network sync, a local store needs to determine which of its entry IDs
+ * are missing from a remote store.  Naively this requires sending every local ID
+ * to the remote for an exact `hasEntries` check — an O(n) network round-trip
+ * that dominates sync latency for large stores.
+ *
+ * A bloom filter provides a probabilistic shortcut: the remote store serializes
+ * its full ID set into a compact bitset ({@link StoreIdBloomSummary}) and sends
+ * it to the local side in a single response.  The local side then tests each of
+ * its own IDs against the bloom filter:
+ *
+ *   - **Definite negative** — the ID is certainly absent on the remote; no
+ *     round-trip needed, the entry can be pushed immediately.
+ *   - **Probable positive** — the ID *might* exist on the remote (subject to a
+ *     configurable false-positive rate, default 1 %).  Only these IDs require a
+ *     follow-up `hasEntries` call to confirm.
+ *
+ * This is used by {@link BasicOnDiskContentAddressedStore.getIdBloomSummary} and
+ * consumed by the sync loop in `BaseMindooDB` to partition IDs into
+ * "definitely missing" and "maybe existing" buckets before making any network
+ * calls.
+ *
+ * ### Implementation details
+ *
+ * - Uses **enhanced double hashing** (FNV-1a + DJB2) to derive `k` bit
+ *   positions from a single ID string, avoiding the need for `k` independent
+ *   hash functions.
+ * - Bit-array size and hash count are computed from the classic bloom filter
+ *   formulas to satisfy the requested false-positive rate.
+ * - The filter is versioned (`"bloom-v1"`) so future changes to hashing or
+ *   encoding remain backward-compatible.
+ *
+ * @module bloom
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.createIdBloomSummary = createIdBloomSummary;
+exports.bloomMightContainId = bloomMightContainId;
+/** Cross-platform Uint8Array -> base64 string. */
+function uint8ArrayToBase64(bytes) {
+    let binary = "";
+    for (let i = 0; i < bytes.length; i++) {
+        binary += String.fromCharCode(bytes[i]);
+    }
+    return btoa(binary);
+}
+/** Cross-platform base64 string -> Uint8Array. */
+function base64ToUint8Array(base64) {
+    const binary = atob(base64);
+    const bytes = new Uint8Array(binary.length);
+    for (let i = 0; i < binary.length; i++) {
+        bytes[i] = binary.charCodeAt(i);
+    }
+    return bytes;
+}
+/** Default probability of a false positive (1 %). */
+const DEFAULT_FALSE_POSITIVE_RATE = 0.01;
+/** Salt mixed into every hash to namespace this bloom filter version. */
+const DEFAULT_SALT = "mindoodb-bloom-v1";
+/**
+ * FNV-1a 32-bit hash.
+ *
+ * Used as the first of two independent hash bases for enhanced double hashing.
+ * FNV-1a is fast, has good avalanche properties, and is simple to implement
+ * without external dependencies.
+ */
+function fnv1a32(input) {
+    let hash = 0x811c9dc5;
+    for (let i = 0; i < input.length; i++) {
+        hash ^= input.charCodeAt(i);
+        hash = Math.imul(hash, 0x01000193);
+    }
+    return hash >>> 0;
+}
+/**
+ * DJB2 32-bit hash (Daniel J. Bernstein).
+ *
+ * Used as the second hash base.  Chosen for its simplicity and because it is
+ * sufficiently independent from FNV-1a to give good bit dispersion when
+ * combined via enhanced double hashing: h(i) = h1 + i * h2.
+ */
+function djb2_32(input) {
+    let hash = 5381;
+    for (let i = 0; i < input.length; i++) {
+        hash = ((hash << 5) + hash + input.charCodeAt(i)) >>> 0;
+    }
+    return hash >>> 0;
+}
+/**
+ * Compute the optimal bit-array size and number of hash functions for a bloom
+ * filter given the expected item count and desired false-positive rate.
+ *
+ * Uses the standard formulas:
+ *   m = -(n * ln(p)) / (ln2)^2   (bit count)
+ *   k = (m / n) * ln2             (hash count)
+ *
+ * A minimum of 64 bits and 1 hash is enforced so the filter remains valid
+ * even for very small or empty sets.
+ *
+ * @param itemCount          Expected number of distinct IDs.
+ * @param falsePositiveRate  Target false-positive probability (0 < p < 1).
+ * @returns Optimal `bitCount` and `hashCount`.
+ */
+function computeBloomShape(itemCount, falsePositiveRate) {
+    if (itemCount <= 0) {
+        return { bitCount: 64, hashCount: 2 };
+    }
+    const ln2 = Math.log(2);
+    const bitCount = Math.max(64, Math.ceil((-itemCount * Math.log(falsePositiveRate)) / (ln2 * ln2)));
+    const hashCount = Math.max(1, Math.round((bitCount / itemCount) * ln2));
+    return { bitCount, hashCount };
+}
+/** Set a single bit in a byte-packed bitset. */
+function setBit(bitset, bitIndex) {
+    const byteIndex = Math.floor(bitIndex / 8);
+    const bitOffset = bitIndex % 8;
+    bitset[byteIndex] |= 1 << bitOffset;
+}
+/** Test whether a single bit is set in a byte-packed bitset. */
+function getBit(bitset, bitIndex) {
+    const byteIndex = Math.floor(bitIndex / 8);
+    const bitOffset = bitIndex % 8;
+    return (bitset[byteIndex] & (1 << bitOffset)) !== 0;
+}
+/**
+ * Derive `hashCount` bit-positions for an ID using enhanced double hashing.
+ *
+ * Enhanced double hashing computes k positions as:
+ *   index_i = (h1 + i * h2) mod bitCount
+ *
+ * where h1 = FNV-1a(salt + id) and h2 = DJB2(id + salt).  The salt is
+ * prepended/appended in opposite order to reduce correlation between the two
+ * hash values.
+ *
+ * @param id        The entry ID to hash.
+ * @param bitCount  Total bits in the bloom filter.
+ * @param hashCount Number of bit positions to produce.
+ * @param salt      Version-specific salt string.
+ * @returns Array of `hashCount` bit-positions in [0, bitCount).
+ */
+function bloomIndexes(id, bitCount, hashCount, salt) {
+    const h1 = fnv1a32(`${salt}:${id}`);
+    const h2 = djb2_32(`${id}:${salt}`) || 1;
+    const indexes = [];
+    for (let i = 0; i < hashCount; i++) {
+        indexes.push((h1 + i * h2) % bitCount);
+    }
+    return indexes;
+}
+/**
+ * Build a bloom filter summary from a list of entry IDs.
+ *
+ * The resulting {@link StoreIdBloomSummary} is a compact, serializable
+ * representation that can be transferred over the network (e.g. in sync
+ * protocol responses) and later queried with {@link bloomMightContainId}.
+ *
+ * Typical usage in the on-disk store:
+ * ```ts
+ * const ids = await store.getAllIds();
+ * const summary = createIdBloomSummary(ids);
+ * // send summary to the syncing peer
+ * ```
+ *
+ * @param ids               Array of entry ID strings to include in the filter.
+ * @param falsePositiveRate Target false-positive probability (default 1 %).
+ * @returns A serializable bloom filter summary (base64-encoded bitset).
+ */
+function createIdBloomSummary(ids, falsePositiveRate = DEFAULT_FALSE_POSITIVE_RATE) {
+    const { bitCount, hashCount } = computeBloomShape(ids.length, falsePositiveRate);
+    const bitset = new Uint8Array(Math.ceil(bitCount / 8));
+    for (const id of ids) {
+        const indexes = bloomIndexes(id, bitCount, hashCount, DEFAULT_SALT);
+        for (const idx of indexes) {
+            setBit(bitset, idx);
+        }
+    }
+    return {
+        version: "bloom-v1",
+        totalIds: ids.length,
+        bitCount,
+        hashCount,
+        salt: DEFAULT_SALT,
+        bitsetBase64: uint8ArrayToBase64(bitset),
+    };
+}
+/**
+ * Test whether an entry ID *might* be present in a bloom filter summary.
+ *
+ * - Returns `false` only when the ID is **definitely absent** — at least one
+ *   of its bit-positions is unset, so the ID was never inserted.
+ * - Returns `true` when the ID **might be present** — all bit-positions are
+ *   set, but this could be a false positive (probability ≤ the configured
+ *   false-positive rate).
+ *
+ * If the summary version is unrecognized, conservatively returns `true` to
+ * avoid incorrectly skipping entries during sync.
+ *
+ * Used in the sync loop to partition local IDs:
+ * ```ts
+ * for (const id of localIds) {
+ *   if (bloomMightContainId(remoteBloom, id)) {
+ *     maybeExisting.push(id);   // needs exact hasEntries() check
+ *   } else {
+ *     definitelyMissing.push(id); // can push without round-trip
+ *   }
+ * }
+ * ```
+ *
+ * @param summary  The bloom filter summary obtained from the remote store.
+ * @param id       The entry ID to test.
+ * @returns `true` if the ID might be in the set; `false` if it is definitely not.
+ */
+function bloomMightContainId(summary, id) {
+    if (summary.version !== "bloom-v1") {
+        return true;
+    }
+    const bitset = base64ToUint8Array(summary.bitsetBase64);
+    const indexes = bloomIndexes(id, summary.bitCount, summary.hashCount, summary.salt);
+    for (const idx of indexes) {
+        if (!getBit(bitset, idx)) {
+            return false;
+        }
+    }
+    return true;
+}
+//# sourceMappingURL=bloom.js.map

package/dist/core/appendonlystores/bloom.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"bloom.js","sourceRoot":"","sources":["../../../src/core/appendonlystores/bloom.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAmCG;;AAmJH,oDAmBC;AA6BD,kDAYC;AA3MD,kDAAkD;AAClD,SAAS,kBAAkB,CAAC,KAAiB;IAC3C,IAAI,MAAM,GAAG,EAAE,CAAC;IAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,MAAM,IAAI,MAAM,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1C,CAAC;IACD,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC;AACtB,CAAC;AAED,kDAAkD;AAClD,SAAS,kBAAkB,CAAC,MAAc;IACxC,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC;IAC5B,MAAM,KAAK,GAAG,IAAI,UAAU,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IAC5C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,KAAK,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;IAClC,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,qDAAqD;AACrD,MAAM,2BAA2B,GAAG,IAAI,CAAC;AAEzC,yEAAyE;AACzE,MAAM,YAAY,GAAG,mBAAmB,CAAC;AAEzC;;;;;;GAMG;AACH,SAAS,OAAO,CAAC,KAAa;IAC5B,IAAI,IAAI,GAAG,UAAU,CAAC;IACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,IAAI,IAAI,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QAC5B,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;IACrC,CAAC;IACD,OAAO,IAAI,KAAK,CAAC,CAAC;AACpB,CAAC;AAED;;;;;;GAMG;AACH,SAAS,OAAO,CAAC,KAAa;IAC5B,IAAI,IAAI,GAAG,IAAI,CAAC;IAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,IAAI,GAAG,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;IAC1D,CAAC;IACD,OAAO,IAAI,KAAK,CAAC,CAAC;AACpB,CAAC;AAED;;;;;;;;;;;;;;GAcG;AACH,SAAS,iBAAiB,CAAC,SAAiB,EAAE,iBAAyB;IACrE,IAAI,SAAS,IAAI,CAAC,EAAE,CAAC;QACnB,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,SAAS,EAAE,CAAC,EAAE,CAAC;IACxC,CAAC;IAED,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACxB,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CACvB,EAAE,EACF,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,iBAAiB,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,CACpE,CAAC;IACF,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,QAAQ,GAAG,SAAS,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;IACxE,OAAO,EAAE,QAAQ,EAAE,SAAS,EAAE,CAAC;AACjC,CAAC;AAED,gDAAgD;AAChD,SAAS,MAAM,CAAC,MAAkB,EAAE,QAAgB;IAClD,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC;IAC3C,MAAM,SAAS,GAAG,QAAQ,GAAG,CAAC,CAAC;IAC/B,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,SAAS,CAAC;AACtC,CAAC;AAED,gEAAgE;AAChE,SAAS,MAAM,CAAC,MAAkB,EAAE,QAAgB;IAClD,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC;IAC3C,MAAM,SAAS,GAAG,QAAQ,GAAG,CAAC,CAAC;IAC/B,OAAO,CAAC,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,IAAI,SAAS,CAAC,CAAC,KAAK,CAAC,CAAC;AACtD,CAAC;AAED;;;;;;;;;;;;;;;GAeG;AACH,SAAS,YAAY,CAAC,EAAU,EAAE,QAAgB,EAAE,SAAiB,EAAE,IAAY;IACjF,MAAM,EAAE,GAAG,OAAO,CAAC,GAAG,IAAI,IAAI,EAAE,EAAE,CAAC,CAAC;IACpC,MAAM,EAAE,GAAG,OAAO,CAAC,GAAG,EAAE,IAAI,IAAI,EAAE,CAAC,IAAI,CAAC,CAAC;IACzC,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,OAAO,CAAC,IAAI,CAAC,CAAC,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,QAAQ,CAAC,CAAC;IACzC,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;;;;;;;;;;;;;;;;GAiBG;AACH,SAAgB,oBAAoB,CAAC,GAAa,EAAE,oBAA4B,2BAA2B;IACzG,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,GAAG,iBAAiB,CAAC,GAAG,CAAC,MAAM,EAAE,iBAAiB,CAAC,CAAC;IACjF,MAAM,MAAM,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC;IAEvD,KAAK,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC;QACrB,MAAM,OAAO,GAAG,YAAY,CAAC,EAAE,EAAE,QAAQ,EAAE,SAAS,EAAE,YAAY,CAAC,CAAC;QACpE,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;YAC1B,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;QACtB,CAAC;IACH,CAAC;IAED,OAAO;QACL,OAAO,EAAE,UAAU;QACnB,QAAQ,EAAE,GAAG,CAAC,MAAM;QACpB,QAAQ;QACR,SAAS;QACT,IAAI,EAAE,YAAY;QAClB,YAAY,EAAE,kBAAkB,CAAC,MAAM,CAAC;KACzC,CAAC;AACJ,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AACH,SAAgB,mBAAmB,CAAC,OAA4B,EAAE,EAAU;IAC1E,IAAI,OAAO,CAAC,OAAO,KAAK,UAAU,EAAE,CAAC;QACnC,OAAO,IAAI,CAAC;IACd,CAAC;IACD,MAAM,MAAM,GAAG,kBAAkB,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC;IACxD,MAAM,OAAO,GAAG,YAAY,CAAC,EAAE,EAAE,OAAO,CAAC,QAAQ,EAAE,OAAO,CAAC,SAAS,EAAE,OAAO,CAAC,IAAI,CAAC,CAAC;IACpF,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;QAC1B,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,EAAE,CAAC;YACzB,OAAO,KAAK,CAAC;QACf,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC"}