@atproto/repo 0.9.1 → 0.10.0-next.0

package/dist/mst/mst.js

@@ -1,48 +1,12 @@
-"use strict";
-var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
-    if (k2 === undefined) k2 = k;
-    var desc = Object.getOwnPropertyDescriptor(m, k);
-    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
-      desc = { enumerable: true, get: function() { return m[k]; } };
-    }
-    Object.defineProperty(o, k2, desc);
-}) : (function(o, m, k, k2) {
-    if (k2 === undefined) k2 = k;
-    o[k2] = m[k];
-}));
-var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {
-    Object.defineProperty(o, "default", { enumerable: true, value: v });
-}) : function(o, v) {
-    o["default"] = v;
-});
-var __importStar = (this && this.__importStar) || (function () {
-    var ownKeys = function(o) {
-        ownKeys = Object.getOwnPropertyNames || function (o) {
-            var ar = [];
-            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;
-            return ar;
-        };
-        return ownKeys(o);
-    };
-    return function (mod) {
-        if (mod && mod.__esModule) return mod;
-        var result = {};
-        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== "default") __createBinding(result, mod, k[i]);
-        __setModuleDefault(result, mod);
-        return result;
-    };
-})();
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.Leaf = exports.MST = exports.nodeDataDef = void 0;
-const zod_1 = require("zod");
-const lex_cbor_1 = require("@atproto/lex-cbor");
-const lex_data_1 = require("@atproto/lex-data");
-const block_map_1 = require("../block-map");
-const cid_set_1 = require("../cid-set");
-const error_1 = require("../error");
-const parse = __importStar(require("../parse"));
-const types_1 = require("../types");
-const util = __importStar(require("./util"));
+import { z } from 'zod';
+import { cidForLex, encode } from '@atproto/lex-cbor';
+import { cidForCbor } from '@atproto/lex-data';
+import { BlockMap } from '../block-map.js';
+import { CidSet } from '../cid-set.js';
+import { MissingBlockError, MissingBlocksError } from '../error.js';
+import * as parse from '../parse.js';
+import { schema } from '../types.js';
+import * as util from './util.js';
 /**
  * This is an implementation of a Merkle Search Tree (MST)
  * The data structure is described here: https://hal.inria.fr/hal-02303490/document
@@ -75,53 +39,24 @@ const util = __importStar(require("./util"));
  * Then the first will be described as `prefix: 0, key: 'bsky/posts/abcdefg'`,
  * and the second will be described as `prefix: 16, key: 'hi'.`
  */
-const subTreePointer = zod_1.z.nullable(types_1.schema.cid);
-const treeEntry = zod_1.z.object({
-    p: zod_1.z.number(), // prefix count of ascii chars that this key shares with the prev key
-    k: types_1.schema.bytes, // the rest of the key outside the shared prefix
-    v: types_1.schema.cid, // value
+const subTreePointer = z.nullable(schema.cid);
+const treeEntry = z.object({
+    p: z.number(), // prefix count of ascii chars that this key shares with the prev key
+    k: schema.bytes, // the rest of the key outside the shared prefix
+    v: schema.cid, // value
     t: subTreePointer, // next subtree (to the right of leaf)
 });
-const nodeData = zod_1.z.object({
+const nodeData = z.object({
     l: subTreePointer, // left-most subtree
-    e: zod_1.z.array(treeEntry), //entries
+    e: z.array(treeEntry), //entries
 });
-exports.nodeDataDef = {
+export const nodeDataDef = {
     name: 'mst node',
     schema: nodeData,
 };
-class MST {
+export class MST {
     constructor(storage, pointer, entries, layer) {
-        Object.defineProperty(this, "storage", {
-            enumerable: true,
-            configurable: true,
-            writable: true,
-            value: void 0
-        });
-        Object.defineProperty(this, "entries", {
-            enumerable: true,
-            configurable: true,
-            writable: true,
-            value: void 0
-        });
-        Object.defineProperty(this, "layer", {
-            enumerable: true,
-            configurable: true,
-            writable: true,
-            value: void 0
-        });
-        Object.defineProperty(this, "pointer", {
-            enumerable: true,
-            configurable: true,
-            writable: true,
-            value: void 0
-        });
-        Object.defineProperty(this, "outdatedPointer", {
-            enumerable: true,
-            configurable: true,
-            writable: true,
-            value: false
-        });
+        this.outdatedPointer = false;
         this.storage = storage;
         this.entries = entries;
         this.layer = layer;
@@ -135,7 +70,7 @@ class MST {
     static async fromData(storage, data, opts) {
         const { layer = null } = opts || {};
         const entries = await util.deserializeNodeData(storage, data, opts);
-        const pointer = await (0, lex_cbor_1.cidForLex)(data);
+        const pointer = await cidForLex(data);
         return new MST(storage, pointer, entries, layer);
     }
     // this is really a *lazy* load, doesn't actually touch storage
@@ -158,7 +93,7 @@ class MST {
         if (this.entries)
             return [...this.entries];
         if (this.pointer) {
-            const data = await this.storage.readObj(this.pointer, exports.nodeDataDef);
+            const data = await this.storage.readObj(this.pointer, nodeDataDef);
             const firstLeaf = data.e[0];
             const layer = firstLeaf !== undefined
                 ? await util.leadingZerosOnHash(firstLeaf.k)
@@ -188,8 +123,8 @@ class MST {
             entries = await this.getEntries();
         }
         const data = util.serializeNodeData(entries);
-        const bytes = (0, lex_cbor_1.encode)(data);
-        const cid = await (0, lex_data_1.cidForCbor)(bytes);
+        const bytes = encode(data);
+        const cid = await cidForCbor(bytes);
         return { cid, bytes };
     }
     // In most cases, we get the layer of a node from a hint on creation
@@ -226,7 +161,7 @@ class MST {
     // -------------------
     // Return the necessary blocks to persist the MST to repo storage
     async getUnstoredBlocks() {
-        const blocks = new block_map_1.BlockMap();
+        const blocks = new BlockMap();
         const pointer = await this.getPointer();
         const alreadyHas = await this.storage.has(pointer);
         if (alreadyHas)
@@ -448,7 +383,7 @@ class MST {
             entries = await this.getEntries();
         }
         catch (err) {
-            if (err instanceof error_1.MissingBlockError) {
+            if (err instanceof MissingBlockError) {
                 return this;
             }
             else {
@@ -641,7 +576,7 @@ class MST {
     }
     // Walks tree & returns all cids
     async allCids() {
-        const cids = new cid_set_1.CidSet();
+        const cids = new CidSet();
         const entries = await this.getEntries();
         for (const entry of entries) {
             if (entry.isLeaf()) {
@@ -683,7 +618,7 @@ class MST {
                     }
                 }
                 catch (err) {
-                    if (err instanceof error_1.MissingBlockError) {
+                    if (err instanceof MissingBlockError) {
                         continue;
                     }
                     else {
@@ -706,17 +641,17 @@ class MST {
     }
     // Sync Protocol
     async *carBlockStream() {
-        const leaves = new cid_set_1.CidSet();
-        let toFetch = new cid_set_1.CidSet();
+        const leaves = new CidSet();
+        let toFetch = new CidSet();
         toFetch.add(await this.getPointer());
         while (toFetch.size() > 0) {
-            const nextLayer = new cid_set_1.CidSet();
+            const nextLayer = new CidSet();
             const fetched = await this.storage.getBlocks(toFetch.toList());
             if (fetched.missing.length > 0) {
-                throw new error_1.MissingBlocksError('mst node', fetched.missing);
+                throw new MissingBlocksError('mst node', fetched.missing);
             }
             for (const cid of toFetch.toList()) {
-                const found = await parse.getAndParseByDef(fetched.blocks, cid, exports.nodeDataDef);
+                const found = await parse.getAndParseByDef(fetched.blocks, cid, nodeDataDef);
                 yield { cid, bytes: found.bytes };
                 const entries = await util.deserializeNodeData(this.storage, found.obj);
                 for (const entry of entries) {
@@ -732,7 +667,7 @@ class MST {
         }
         const leafData = await this.storage.getBlocks(leaves.toList());
         if (leafData.missing.length > 0) {
-            throw new error_1.MissingBlocksError('mst leaf', leafData.missing);
+            throw new MissingBlocksError('mst leaf', leafData.missing);
         }
         for (const leaf of leafData.blocks.entries()) {
             yield leaf;
@@ -768,12 +703,12 @@ class MST {
         const found = await this.atIndex(index);
         let blocks;
         if (found && found.isLeaf() && found.key === key) {
-            blocks = new block_map_1.BlockMap();
+            blocks = new BlockMap();
         }
         else {
             const prev = await this.atIndex(index - 1);
             if (!prev || prev.isLeaf()) {
-                return new block_map_1.BlockMap();
+                return new BlockMap();
             }
             else {
                 blocks = await prev.proofForKey(key);
@@ -787,7 +722,7 @@ class MST {
         const prev = await this.atIndex(index - 1);
         let blocks;
         if (!prev || prev.isLeaf()) {
-            blocks = new block_map_1.BlockMap();
+            blocks = new BlockMap();
         }
         else {
             blocks = await prev.proofForLeftSib(key);
@@ -804,7 +739,7 @@ class MST {
         let blocks;
         if (!found) {
             // shouldn't ever hit, null case
-            blocks = new block_map_1.BlockMap();
+            blocks = new BlockMap();
         }
         else if (found.isTree()) {
             blocks = await found.proofForRightSib(key);
@@ -815,7 +750,7 @@ class MST {
                 ? await this.atIndex(index + 1)
                 : await this.atIndex(index - 1);
             if (!node || node.isLeaf()) {
-                blocks = new block_map_1.BlockMap();
+                blocks = new BlockMap();
             }
             else {
                 blocks = await node.proofForRightSib(key);
@@ -840,21 +775,10 @@ class MST {
         return thisPointer.equals(otherPointer);
     }
 }
-exports.MST = MST;
-class Leaf {
+export class Leaf {
     constructor(key, value) {
-        Object.defineProperty(this, "key", {
-            enumerable: true,
-            configurable: true,
-            writable: true,
-            value: key
-        });
-        Object.defineProperty(this, "value", {
-            enumerable: true,
-            configurable: true,
-            writable: true,
-            value: value
-        });
+        this.key = key;
+        this.value = value;
     }
     isTree() {
         return false;
@@ -871,5 +795,4 @@ class Leaf {
         }
     }
 }
-exports.Leaf = Leaf;
 //# sourceMappingURL=mst.js.map

package/dist/mst/mst.js.map

@@ -1 +1 @@
-{"version":3,"file":"mst.js","sourceRoot":"","sources":["../../src/mst/mst.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA,6BAAuB;AACvB,gDAAqD;AACrD,gDAAmD;AACnD,4CAAuC;AACvC,wCAAmC;AACnC,oCAAgE;AAChE,gDAAiC;AAEjC,oCAA2C;AAC3C,6CAA8B;AAE9B;;;;;;;;;;;;;GAaG;AAEH;;;;;;;;;;;;;;;;;GAiBG;AACH,MAAM,cAAc,GAAG,OAAC,CAAC,QAAQ,CAAC,cAAM,CAAC,GAAG,CAAC,CAAA;AAC7C,MAAM,SAAS,GAAG,OAAC,CAAC,MAAM,CAAC;IACzB,CAAC,EAAE,OAAC,CAAC,MAAM,EAAE,EAAE,qEAAqE;IACpF,CAAC,EAAE,cAAM,CAAC,KAAK,EAAE,gDAAgD;IACjE,CAAC,EAAE,cAAM,CAAC,GAAG,EAAE,QAAQ;IACvB,CAAC,EAAE,cAAc,EAAE,sCAAsC;CAC1D,CAAC,CAAA;AACF,MAAM,QAAQ,GAAG,OAAC,CAAC,MAAM,CAAC;IACxB,CAAC,EAAE,cAAc,EAAE,oBAAoB;IACvC,CAAC,EAAE,OAAC,CAAC,KAAK,CAAC,SAAS,CAAC,EAAE,SAAS;CACjC,CAAC,CAAA;AAGW,QAAA,WAAW,GAAG;IACzB,IAAI,EAAE,UAAU;IAChB,MAAM,EAAE,QAAQ;CACjB,CAAA;AAQD,MAAa,GAAG;IAOd,YACE,OAA2B,EAC3B,OAAY,EACZ,OAA2B,EAC3B,KAAoB;QAVtB;;;;;WAA2B;QAC3B;;;;;WAA2B;QAC3B;;;;;WAAoB;QACpB;;;;;WAAY;QACZ;;;;mBAAkB,KAAK;WAAA;QAQrB,IAAI,CAAC,OAAO,GAAG,OAAO,CAAA;QACtB,IAAI,CAAC,OAAO,GAAG,OAAO,CAAA;QACtB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAA;QAClB,IAAI,CAAC,OAAO,GAAG,OAAO,CAAA;IACxB,CAAC;IAED,MAAM,CAAC,KAAK,CAAC,MAAM,CACjB,OAA2B,EAC3B,UAAuB,EAAE,EACzB,IAAuB;QAEvB,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,CAAA;QACjD,MAAM,EAAE,KAAK,GAAG,IAAI,EAAE,GAAG,IAAI,IAAI,EAAE,CAAA;QACnC,OAAO,IAAI,GAAG,CAAC,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,CAAC,CAAA;IAClD,CAAC;IAED,MAAM,CAAC,KAAK,CAAC,QAAQ,CACnB,OAA2B,EAC3B,IAAc,EACd,IAAuB;QAEvB,MAAM,EAAE,KAAK,GAAG,IAAI,EAAE,GAAG,IAAI,IAAI,EAAE,CAAA;QACnC,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,mBAAmB,CAAC,OAAO,EAAE,IAAI,EAAE,IAAI,CAAC,CAAA;QACnE,MAAM,OAAO,GAAG,MAAM,IAAA,oBAAS,EAAC,IAAI,CAAC,CAAA;QACrC,OAAO,IAAI,GAAG,CAAC,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,CAAC,CAAA;IAClD,CAAC;IAED,+DAA+D;IAC/D,MAAM,CAAC,IAAI,CACT,OAA2B,EAC3B,GAAQ,EACR,IAAuB;QAEvB,MAAM,EAAE,KAAK,GAAG,IAAI,EAAE,GAAG,IAAI,IAAI,EAAE,CAAA;QACnC,OAAO,IAAI,GAAG,CAAC,OAAO,EAAE,GAAG,EAAE,IAAI,EAAE,KAAK,CAAC,CAAA;IAC3C,CAAC;IAED,eAAe;IACf,sBAAsB;IAEtB,uEAAuE;IACvE,KAAK,CAAC,OAAO,CAAC,OAAoB;QAChC,MAAM,GAAG,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,OAAO,EAAE,OAAO,EAAE,IAAI,CAAC,KAAK,CAAC,CAAA;QACpE,GAAG,CAAC,eAAe,GAAG,IAAI,CAAA;QAC1B,OAAO,GAAG,CAAA;IACZ,CAAC;IAED,sBAAsB;IACtB,sBAAsB;IAEtB,wEAAwE;IACxE,KAAK,CAAC,UAAU;QACd,IAAI,IAAI,CAAC,OAAO;YAAE,OAAO,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAA;QAC1C,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjB,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,EAAE,mBAAW,CAAC,CAAA;YAClE,MAAM,SAAS,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;YAC3B,MAAM,KAAK,GACT,SAAS,KAAK,SAAS;gBACrB,CAAC,CAAC,MAAM,IAAI,CAAC,kBAAkB,CAAC,SAAS,CAAC,CAAC,CAAC;gBAC5C,CAAC,CAAC,SAAS,CAAA;YACf,IAAI,CAAC,OAAO,GAAG,MAAM,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,EAAE;gBAChE,KAAK;aACN,CAAC,CAAA;YAEF,OAAO,IAAI,CAAC,OAAO,CAAA;QACrB,CAAC;QACD,MAAM,IAAI,KAAK,CAAC,4BAA4B,CAAC,CAAA;IAC/C,CAAC;IAED,mEAAmE;IACnE,wGAAwG;IACxG,KAAK,CAAC,UAAU;QACd,IAAI,CAAC,IAAI,CAAC,eAAe;YAAE,OAAO,IAAI,CAAC,OAAO,CAAA;QAC9C,MAAM,EAAE,GAAG,EAAE,GAAG,MAAM,IAAI,CAAC,SAAS,EAAE,CAAA;QACtC,IAAI,CAAC,OAAO,GAAG,GAAG,CAAA;QAClB,IAAI,CAAC,eAAe,GAAG,KAAK,CAAA;QAC5B,OAAO,IAAI,CAAC,OAAO,CAAA;IACrB,CAAC;IAED,KAAK,CAAC,SAAS;QACb,IAAI,OAAO,GAAG,MAAM,IAAI,CAAC,UAAU,EAAE,CAAA;QACrC,MAAM,QAAQ,GAAG,OAAO,CAAC,MAAM,CAC7B,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,eAAe,CAC9B,CAAA;QACV,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,CAAA;YACtD,OAAO,GAAG,MAAM,IAAI,CAAC,UAAU,EAAE,CAAA;QACnC,CAAC;QACD,MAAM,IAAI,GAAG,IAAI,CAAC,iBAAiB,CAAC,OAAO,CAAC,CAAA;QAC5C,MAAM,KAAK,GAAG,IAAA,iBAAM,EAAC,IAAI,CAAC,CAAA;QAC1B,MAAM,GAAG,GAAG,MAAM,IAAA,qBAAU,EAAC,KAAK,CAAC,CAAA;QACnC,OAAO,EAAE,GAAG,EAAE,KAAK,EAAE,CAAA;IACvB,CAAC;IAED,oEAAoE;IACpE,mGAAmG;IACnG,oEAAoE;IACpE,iFAAiF;IACjF,KAAK,CAAC,QAAQ;QACZ,IAAI,CAAC,KAAK,GAAG,MAAM,IAAI,CAAC,eAAe,EAAE,CAAA;QACzC,IAAI,IAAI,CAAC,KAAK,KAAK,IAAI;YAAE,IAAI,CAAC,KAAK,GAAG,CAAC,CAAA;QACvC,OAAO,IAAI,CAAC,KAAK,CAAA;IACnB,CAAC;IAED,KAAK,CAAC,eAAe;QACnB,IAAI,IAAI,CAAC,KAAK,KAAK,IAAI;YAAE,OAAO,IAAI,CAAC,KAAK,CAAA;QAC1C,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,UAAU,EAAE,CAAA;QACvC,IAAI,KAAK,GAAG,MAAM,IAAI,CAAC,eAAe,CAAC,OAAO,CAAC,CAAA;QAC/C,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;YACnB,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;gBAC5B,IAAI,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;oBACnB,MAAM,UAAU,GAAG,MAAM,KAAK,CAAC,eAAe,EAAE,CAAA;oBAChD,IAAI,UAAU,KAAK,IAAI,EAAE,CAAC;wBACxB,KAAK,GAAG,UAAU,GAAG,CAAC,CAAA;wBACtB,MAAK;oBACP,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QACD,IAAI,KAAK,KAAK,IAAI;YAAE,IAAI,CAAC,KAAK,GAAG,KAAK,CAAA;QACtC,OAAO,KAAK,CAAA;IACd,CAAC;IAED,qBAAqB;IACrB,sBAAsB;IAEtB,iEAAiE;IACjE,KAAK,CAAC,iBAAiB;QACrB,MAAM,MAAM,GAAG,IAAI,oBAAQ,EAAE,CAAA;QAC7B,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,UAAU,EAAE,CAAA;QACvC,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;QAClD,IAAI,UAAU;YAAE,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,CAAA;QAChD,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,UAAU,EAAE,CAAA;QACvC,MAAM,IAAI,GAAG,IAAI,CAAC,iBAAiB,CAAC,OAAO,CAAC,CAAA;QAC5C,MAAM,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;QACtB,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;YAC5B,IAAI,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;gBACnB,MAAM,OAAO,GAAG,MAAM,KAAK,CAAC,iBAAiB,EAAE,CAAA;gBAC/C,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,CAAA;YAC/B,CAAC;QACH,CAAC;QACD,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,CAAA;IAC1C,CAAC;IAED,+CAA+C;IAC/C,gDAAgD;IAChD,KAAK,CAAC,GAAG,CAAC,GAAW,EAAE,KAAU,EAAE,UAAmB;QACpD,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,CAAA;QAC3B,MAAM,QAAQ,GAAG,UAAU,IAAI,CAAC,MAAM,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,CAAC,CAAA;QACnE,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,QAAQ,EAAE,CAAA;QACnC,MAAM,OAAO,GAAG,IAAI,IAAI,CAAC,GAAG,EAAE,KAAK,CAAC,CAAA;QACpC,IAAI,QAAQ,KAAK,KAAK,EAAE,CAAC;YACvB,2BAA2B;YAC3B,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,CAAA;YACpD,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAA;YACvC,IAAI,KAAK,EAAE,MAAM,EAAE,IAAI,KAAK,CAAC,GAAG,KAAK,GAAG,EAAE,CAAC;gBACzC,MAAM,IAAI,KAAK,CAAC,oCAAoC,GAAG,EAAE,CAAC,CAAA;YAC5D,CAAC;YACD,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,KAAK,GAAG,CAAC,CAAC,CAAA;YAC9C,IAAI,CAAC,QAAQ,IAAI,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC;gBACnC,0EAA0E;gBAC1E,OAAO,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,KAAK,CAAC,CAAA;YACtC,CAAC;iBAAM,CAAC;gBACN,kDAAkD;gBAClD,MAAM,YAAY,GAAG,MAAM,QAAQ,CAAC,WAAW,CAAC,GAAG,CAAC,CAAA;gBACpD,OAAO,IAAI,CAAC,gBAAgB,CAC1B,KAAK,GAAG,CAAC,EACT,YAAY,CAAC,CAAC,CAAC,EACf,OAAO,EACP,YAAY,CAAC,CAAC,CAAC,CAChB,CAAA;YACH,CAAC;QACH,CAAC;aAAM,IAAI,QAAQ,GAAG,KAAK,EAAE,CAAC;YAC5B,8BAA8B;YAC9B,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,CAAA;YACpD,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,KAAK,GAAG,CAAC,CAAC,CAAA;YAC9C,IAAI,QAAQ,IAAI,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC;gBAClC,oDAAoD;gBACpD,MAAM,UAAU,GAAG,MAAM,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAA;gBAC3D,OAAO,IAAI,CAAC,WAAW,CAAC,KAAK,GAAG,CAAC,EAAE,UAAU,CAAC,CAAA;YAChD,CAAC;iBAAM,CAAC;gBACN,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,WAAW,EAAE,CAAA;gBACxC,MAAM,UAAU,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAA;gBAC1D,OAAO,IAAI,CAAC,QAAQ,CAAC,UAAU,EAAE,KAAK,CAAC,CAAA;YACzC,CAAC;QACH,CAAC;aAAM,CAAC;YACN,wEAAwE;YACxE,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAA;YACzC,mFAAmF;YACnF,6DAA6D;YAC7D,IAAI,IAAI,GAAe,KAAK,CAAC,CAAC,CAAC,CAAA;YAC/B,IAAI,KAAK,GAAe,KAAK,CAAC,CAAC,CAAC,CAAA;YAChC,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,QAAQ,EAAE,CAAA;YACnC,MAAM,gBAAgB,GAAG,QAAQ,GAAG,KAAK,CAAA;YACzC,2EAA2E;YAC3E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,gBAAgB,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC1C,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;oBAClB,IAAI,GAAG,MAAM,IAAI,CAAC,YAAY,EAAE,CAAA;gBAClC,CAAC;gBACD,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;oBACnB,KAAK,GAAG,MAAM,KAAK,CAAC,YAAY,EAAE,CAAA;gBACpC,CAAC;YACH,CAAC;YACD,MAAM,OAAO,GAAgB,EAAE,CAAA;YAC/B,IAAI,IAAI;gBAAE,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;YAC5B,OAAO,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAA;YAClC,IAAI,KAAK;gBAAE,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;YAC9B,MAAM,OAAO,GAAG,MAAM,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,EAAE;gBACtD,KAAK,EAAE,QAAQ;aAChB,CAAC,CAAA;YACF,OAAO,CAAC,eAAe,GAAG,IAAI,CAAA;YAC9B,OAAO,OAAO,CAAA;QAChB,CAAC;IACH,CAAC;IAED,kCAAkC;IAClC,KAAK,CAAC,GAAG,CAAC,GAAW;QACnB,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,CAAA;QACpD,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAA;QACvC,IAAI,KAAK,IAAI,KAAK,CAAC,MAAM,EAAE,IAAI,KAAK,CAAC,GAAG,KAAK,GAAG,EAAE,CAAC;YACjD,OAAO,KAAK,CAAC,KAAK,CAAA;QACpB,CAAC;QACD,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,KAAK,GAAG,CAAC,CAAC,CAAA;QAC1C,IAAI,IAAI,IAAI,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC;YAC1B,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;QACtB,CAAC;QACD,OAAO,IAAI,CAAA;IACb,CAAC;IAED,mCAAmC;IACnC,yCAAyC;IACzC,KAAK,CAAC,MAAM,CAAC,GAAW,EAAE,KAAU;QAClC,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,CAAA;QAC3B,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,CAAA;QACpD,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAA;QACvC,IAAI,KAAK,IAAI,KAAK,CAAC,MAAM,EAAE,IAAI,KAAK,CAAC,GAAG,KAAK,GAAG,EAAE,CAAC;YACjD,OAAO,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,IAAI,IAAI,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAA;QACtD,CAAC;QACD,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,KAAK,GAAG,CAAC,CAAC,CAAA;QAC1C,IAAI,IAAI,IAAI,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC;YAC1B,MAAM,WAAW,GAAG,MAAM,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,CAAA;YACjD,OAAO,IAAI,CAAC,WAAW,CAAC,KAAK,GAAG,CAAC,EAAE,WAAW,CAAC,CAAA;QACjD,CAAC;QACD,MAAM,IAAI,KAAK,CAAC,qCAAqC,GAAG,EAAE,CAAC,CAAA;IAC7D,CAAC;IAED,qCAAqC;IACrC,KAAK,CAAC,MAAM,CAAC,GAAW;QACtB,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,CAAA;QAC7C,OAAO,OAAO,CAAC,OAAO,EAAE,CAAA;IAC1B,CAAC;IAED,KAAK,CAAC,aAAa,CAAC,GAAW;QAC7B,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,CAAA;QACpD,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAA;QACvC,oCAAoC;QACpC,IAAI,KAAK,EAAE,MAAM,EAAE,IAAI,KAAK,CAAC,GAAG,KAAK,GAAG,EAAE,CAAC;YACzC,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,KAAK,GAAG,CAAC,CAAC,CAAA;YAC1C,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,KAAK,GAAG,CAAC,CAAC,CAAA;YAC1C,IAAI,IAAI,EAAE,MAAM,EAAE,IAAI,IAAI,EAAE,MAAM,EAAE,EAAE,CAAC;gBACrC,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAA;gBAC3C,OAAO,IAAI,CAAC,OAAO,CAAC;oBAClB,GAAG,CAAC,MAAM,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;oBACnC,MAAM;oBACN,GAAG,CAAC,MAAM,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;iBACjC,CAAC,CAAA;YACJ,CAAC;iBAAM,CAAC;gBACN,OAAO,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAA;YAChC,CAAC;QACH,CAAC;QACD,+BAA+B;QAC/B,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,KAAK,GAAG,CAAC,CAAC,CAAA;QAC1C,IAAI,IAAI,EAAE,MAAM,EAAE,EAAE,CAAC;YACnB,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,CAAA;YAC7C,MAAM,cAAc,GAAG,MAAM,OAAO,CAAC,UAAU,EAAE,CAAA;YACjD,IAAI,cAAc,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBAChC,OAAO,IAAI,CAAC,WAAW,CAAC,KAAK,GAAG,CAAC,CAAC,CAAA;YACpC,CAAC;iBAAM,CAAC;gBACN,OAAO,IAAI,CAAC,WAAW,CAAC,KAAK,GAAG,CAAC,EAAE,OAAO,CAAC,CAAA;YAC7C,CAAC;QACH,CAAC;aAAM,CAAC;YACN,MAAM,IAAI,KAAK,CAAC,qCAAqC,GAAG,EAAE,CAAC,CAAA;QAC7D,CAAC;IACH,CAAC;IAED,oBAAoB;IACpB,sBAAsB;IAEtB,wBAAwB;IACxB,KAAK,CAAC,WAAW,CAAC,KAAa,EAAE,KAAgB;QAC/C,MAAM,MAAM,GAAG;YACb,GAAG,CAAC,MAAM,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;YAC/B,KAAK;YACL,GAAG,CAAC,MAAM,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;SACjC,CAAA;QACD,OAAO,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAA;IAC7B,CAAC;IAED,wBAAwB;IACxB,KAAK,CAAC,WAAW,CAAC,KAAa;QAC7B,MAAM,OAAO,GAAG;YACd,GAAG,CAAC,MAAM,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;YAC/B,GAAG,CAAC,MAAM,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;SACjC,CAAA;QACD,OAAO,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAA;IAC9B,CAAC;IAED,kCAAkC;IAClC,KAAK,CAAC,MAAM,CAAC,KAAgB;QAC3B,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,UAAU,EAAE,CAAA;QACvC,OAAO,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,OAAO,EAAE,KAAK,CAAC,CAAC,CAAA;IAC1C,CAAC;IAED,qCAAqC;IACrC,KAAK,CAAC,OAAO,CAAC,KAAgB;QAC5B,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,UAAU,EAAE,CAAA;QACvC,OAAO,IAAI,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,GAAG,OAAO,CAAC,CAAC,CAAA;IAC1C,CAAC;IAED,yBAAyB;IACzB,KAAK,CAAC,OAAO,CAAC,KAAa;QACzB,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,UAAU,EAAE,CAAA;QACvC,OAAO,OAAO,CAAC,KAAK,CAAC,IAAI,IAAI,CAAA;IAC/B,CAAC;IAED,iDAAiD;IACjD,KAAK,CAAC,KAAK,CACT,KAA0B,EAC1B,GAAwB;QAExB,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,UAAU,EAAE,CAAA;QACvC,OAAO,OAAO,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,CAAA;IAClC,CAAC;IAED,yBAAyB;IACzB,KAAK,CAAC,QAAQ,CAAC,KAAgB,EAAE,KAAa;QAC5C,MAAM,MAAM,GAAG;YACb,GAAG,CAAC,MAAM,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;YAC/B,KAAK;YACL,GAAG,CAAC,MAAM,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;SAC7B,CAAA;QACD,OAAO,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAA;IAC7B,CAAC;IAED,4DAA4D;IAC5D,KAAK,CAAC,gBAAgB,CACpB,KAAa,EACb,IAAgB,EAChB,IAAU,EACV,KAAiB;QAEjB,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAA;QACzC,IAAI,IAAI;YAAE,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QAC3B,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QACjB,IAAI,KAAK;YAAE,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;QAC7B,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;QAC7C,OAAO,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAA;IAC7B,CAAC;IAED,mGAAmG;IACnG,KAAK,CAAC,OAAO;QACX,IAAI,OAAoB,CAAA;QACxB,IAAI,CAAC;YACH,OAAO,GAAG,MAAM,IAAI,CAAC,UAAU,EAAE,CAAA;QACnC,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,IAAI,GAAG,YAAY,yBAAiB,EAAE,CAAC;gBACrC,OAAO,IAAI,CAAA;YACb,CAAC;iBAAM,CAAC;gBACN,MAAM,GAAG,CAAA;YACX,CAAC;QACH,CAAC;QACD,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,IAAI,OAAO,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC;YAChD,OAAO,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAA;QAC7B,CAAC;aAAM,CAAC;YACN,OAAO,IAAI,CAAA;QACb,CAAC;IACH,CAAC;IAED,mBAAmB;IACnB,sBAAsB;IAEtB,mDAAmD;IACnD,KAAK,CAAC,WAAW,CAAC,GAAW;QAC3B,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,CAAA;QACpD,wBAAwB;QACxB,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAA;QAC3C,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAA;QACzC,IAAI,IAAI,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAA;QACvC,IAAI,KAAK,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,CAAA;QAEzC,kDAAkD;QAClD,yCAAyC;QACzC,MAAM,UAAU,GAAG,QAAQ,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;QAChD,IAAI,UAAU,EAAE,MAAM,EAAE,EAAE,CAAC;YACzB,IAAI,GAAG,MAAM,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;YAClD,MAAM,KAAK,GAAG,MAAM,UAAU,CAAC,WAAW,CAAC,GAAG,CAAC,CAAA;YAC/C,IAAI,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;gBACb,IAAI,GAAG,MAAM,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAA;YACpC,CAAC;YACD,IAAI,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;gBACb,KAAK,GAAG,MAAM,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAA;YACvC,CAAC;QACH,CAAC;QAED,OAAO;YACL,CAAC,MAAM,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI;YAClD,CAAC,MAAM,KAAK,CAAC,UAAU,EAAE,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI;SACrD,CAAA;IACH,CAAC;IAED,qGAAqG;IACrG,+BAA+B;IAC/B,KAAK,CAAC,WAAW,CAAC,OAAY;QAC5B,IAAI,CAAC,MAAM,IAAI,CAAC,QAAQ,EAAE,CAAC,KAAK,CAAC,MAAM,OAAO,CAAC,QAAQ,EAAE,CAAC,EAAE,CAAC;YAC3D,MAAM,IAAI,KAAK,CACb,4DAA4D,CAC7D,CAAA;QACH,CAAC;QACD,MAAM,WAAW,GAAG,MAAM,IAAI,CAAC,UAAU,EAAE,CAAA;QAC3C,MAAM,cAAc,GAAG,MAAM,OAAO,CAAC,UAAU,EAAE,CAAA;QACjD,MAAM,UAAU,GAAG,WAAW,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;QACtD,MAAM,YAAY,GAAG,cAAc,CAAC,CAAC,CAAC,CAAA;QACtC,IAAI,UAAU,EAAE,MAAM,EAAE,IAAI,YAAY,EAAE,MAAM,EAAE,EAAE,CAAC;YACnD,MAAM,MAAM,GAAG,MAAM,UAAU,CAAC,WAAW,CAAC,YAAY,CAAC,CAAA;YACzD,OAAO,IAAI,CAAC,OAAO,CAAC;gBAClB,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;gBAC/C,MAAM;gBACN,GAAG,cAAc,CAAC,KAAK,CAAC,CAAC,CAAC;aAC3B,CAAC,CAAA;QACJ,CAAC;aAAM,CAAC;YACN,OAAO,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,WAAW,EAAE,GAAG,cAAc,CAAC,CAAC,CAAA;QAC1D,CAAC;IACH,CAAC;IAED,mBAAmB;IACnB,sBAAsB;IAEtB,KAAK,CAAC,WAAW;QACf,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,QAAQ,EAAE,CAAA;QACnC,OAAO,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,EAAE;YAClC,KAAK,EAAE,KAAK,GAAG,CAAC;SACjB,CAAC,CAAA;IACJ,CAAC;IAED,KAAK,CAAC,YAAY;QAChB,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,QAAQ,EAAE,CAAA;QACnC,MAAM,MAAM,GAAG,MAAM,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,IAAI,CAAC,EAAE;YACpD,KAAK,EAAE,KAAK,GAAG,CAAC;SACjB,CAAC,CAAA;QACF,MAAM,CAAC,eAAe,GAAG,IAAI,CAAA;QAC7B,OAAO,MAAM,CAAA;IACf,CAAC;IAED,2BAA2B;IAC3B,sBAAsB;IAEtB,4EAA4E;IAC5E,KAAK,CAAC,sBAAsB,CAAC,GAAW;QACtC,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,UAAU,EAAE,CAAA;QACvC,MAAM,UAAU,GAAG,OAAO,CAAC,SAAS,CAClC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,MAAM,EAAE,IAAI,KAAK,CAAC,GAAG,IAAI,GAAG,CAC9C,CAAA;QACD,qCAAqC;QACrC,OAAO,UAAU,IAAI,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,CAAA;IACtD,CAAC;IAED,2CAA2C;IAC3C,sBAAsB;IAEtB,8BAA8B;IAE9B,4BAA4B;IAC5B,KAAK,CAAC,CAAC,QAAQ,CAAC,GAAW;QACzB,MAAM,IAAI,CAAA;QACV,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,CAAA;QACpD,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,UAAU,EAAE,CAAA;QACvC,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,CAAA;QAC5B,IAAI,KAAK,IAAI,KAAK,CAAC,MAAM,EAAE,IAAI,KAAK,CAAC,GAAG,KAAK,GAAG,EAAE,CAAC;YACjD,MAAM,KAAK,CAAA;QACb,CAAC;aAAM,CAAC;YACN,MAAM,IAAI,GAAG,OAAO,CAAC,KAAK,GAAG,CAAC,CAAC,CAAA;YAC/B,IAAI,IAAI,EAAE,CAAC;gBACT,IAAI,IAAI,CAAC,MAAM,EAAE,IAAI,IAAI,CAAC,GAAG,KAAK,GAAG,EAAE,CAAC;oBACtC,MAAM,IAAI,CAAA;gBACZ,CAAC;qBAAM,IAAI,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC;oBACzB,KAAK,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAA;gBAC3B,CAAC;YACH,CAAC;QACH,CAAC;QAED,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5C,MAAM,KAAK,GAAG,OAAO,CAAC,CAAC,CAAC,CAAA;YACxB,IAAI,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;gBACnB,MAAM,KAAK,CAAA;YACb,CAAC;iBAAM,CAAC;gBACN,KAAK,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAA;YAC5B,CAAC;QACH,CAAC;IACH,CAAC;IAED,KAAK,CAAC,CAAC,cAAc,CAAC,GAAW;QAC/B,IAAI,KAAK,EAAE,MAAM,IAAI,IAAI,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;YAC5C,IAAI,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC;gBAClB,MAAM,IAAI,CAAA;YACZ,CAAC;QACH,CAAC;IACH,CAAC;IAED,KAAK,CAAC,IAAI,CACR,KAAK,GAAG,MAAM,CAAC,gBAAgB,EAC/B,KAAc,EACd,MAAe;QAEf,MAAM,IAAI,GAAW,EAAE,CAAA;QACvB,IAAI,KAAK,EAAE,MAAM,IAAI,IAAI,IAAI,CAAC,cAAc,CAAC,KAAK,IAAI,EAAE,CAAC,EAAE,CAAC;YAC1D,IAAI,IAAI,CAAC,GAAG,KAAK,KAAK;gBAAE,SAAQ;YAChC,IAAI,IAAI,CAAC,MAAM,IAAI,KAAK;gBAAE,MAAK;YAC/B,IAAI,MAAM,IAAI,IAAI,CAAC,GAAG,IAAI,MAAM;gBAAE,MAAK;YACvC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QACjB,CAAC;QACD,OAAO,IAAI,CAAA;IACb,CAAC;IAED,KAAK,CAAC,cAAc,CAClB,MAAc,EACd,KAAK,GAAG,MAAM,CAAC,gBAAgB;QAE/B,MAAM,IAAI,GAAW,EAAE,CAAA;QACvB,IAAI,KAAK,EAAE,MAAM,IAAI,IAAI,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,EAAE,CAAC;YACrD,IAAI,IAAI,CAAC,MAAM,IAAI,KAAK,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,MAAM,CAAC;gBAAE,MAAK;YAC/D,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QACjB,CAAC;QACD,OAAO,IAAI,CAAA;IACb,CAAC;IAED,sBAAsB;IACtB,sBAAsB;IAEtB,iFAAiF;IACjF,KAAK,CAAC,CAAC,IAAI;QACT,MAAM,IAAI,CAAA;QACV,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,UAAU,EAAE,CAAA;QACvC,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;YAC5B,IAAI,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;gBACnB,IAAI,KAAK,EAAE,MAAM,CAAC,IAAI,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;oBACnC,MAAM,CAAC,CAAA;gBACT,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,MAAM,KAAK,CAAA;YACb,CAAC;QACH,CAAC;IACH,CAAC;IAED,iFAAiF;IACjF,KAAK,CAAC,KAAK;QACT,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,UAAU,EAAE,CAAA;QACvC,IAAI,KAAK,GAAkB,EAAE,CAAA;QAC7B,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;YAC5B,IAAI,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;gBACnB,KAAK,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,CAAA;YACrB,CAAC;YACD,IAAI,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;gBACnB,MAAM,QAAQ,GAAG,MAAM,KAAK,CAAC,KAAK,EAAE,CAAA;gBACpC,KAAK,GAAG,CAAC,GAAG,KAAK,EAAE,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;YAC3D,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAA;IACd,CAAC;IAED,iCAAiC;IACjC,KAAK,CAAC,QAAQ;QACZ,MAAM,KAAK,GAAgB,EAAE,CAAA;QAC7B,IAAI,KAAK,EAAE,MAAM,KAAK,IAAI,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;YACtC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;QACnB,CAAC;QACD,OAAO,KAAK,CAAA;IACd,CAAC;IAED,gCAAgC;IAChC,KAAK,CAAC,OAAO;QACX,MAAM,IAAI,GAAG,IAAI,gBAAM,EAAE,CAAA;QACzB,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,UAAU,EAAE,CAAA;QACvC,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;YAC5B,IAAI,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;gBACnB,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,CAAA;YACvB,CAAC;iBAAM,CAAC;gBACN,MAAM,WAAW,GAAG,MAAM,KAAK,CAAC,OAAO,EAAE,CAAA;gBACzC,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC,CAAA;YAC1B,CAAC;QACH,CAAC;QACD,IAAI,CAAC,GAAG,CAAC,MAAM,IAAI,CAAC,UAAU,EAAE,CAAC,CAAA;QACjC,OAAO,IAAI,CAAA;IACb,CAAC;IAED,kCAAkC;IAClC,KAAK,CAAC,MAAM;QACV,MAAM,MAAM,GAAW,EAAE,CAAA;QACzB,IAAI,KAAK,EAAE,MAAM,KAAK,IAAI,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;YACtC,IAAI,KAAK,CAAC,MAAM,EAAE;gBAAE,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;QACxC,CAAC;QACD,OAAO,MAAM,CAAA;IACf,CAAC;IAED,2BAA2B;IAC3B,KAAK,CAAC,SAAS;QACb,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,MAAM,EAAE,CAAA;QAClC,OAAO,MAAM,CAAC,MAAM,CAAA;IACtB,CAAC;IAED,2BAA2B;IAC3B,sBAAsB;IAEtB,kGAAkG;IAClG,KAAK,CAAC,CAAC,aAAa;QAClB,MAAM,IAAI,CAAA;QACV,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,UAAU,EAAE,CAAA;QACvC,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;YAC5B,IAAI,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;gBACnB,IAAI,CAAC;oBACH,IAAI,KAAK,EAAE,MAAM,CAAC,IAAI,KAAK,CAAC,aAAa,EAAE,EAAE,CAAC;wBAC5C,MAAM,CAAC,CAAA;oBACT,CAAC;gBACH,CAAC;gBAAC,OAAO,GAAG,EAAE,CAAC;oBACb,IAAI,GAAG,YAAY,yBAAiB,EAAE,CAAC;wBACrC,SAAQ;oBACV,CAAC;yBAAM,CAAC;wBACN,MAAM,GAAG,CAAA;oBACX,CAAC;gBACH,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,MAAM,KAAK,CAAA;YACb,CAAC;QACH,CAAC;IACH,CAAC;IAED,KAAK,CAAC,eAAe;QACnB,MAAM,MAAM,GAAW,EAAE,CAAA;QACzB,IAAI,KAAK,EAAE,MAAM,KAAK,IAAI,IAAI,CAAC,aAAa,EAAE,EAAE,CAAC;YAC/C,IAAI,KAAK,CAAC,MAAM,EAAE;gBAAE,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;QACxC,CAAC;QACD,OAAO,MAAM,CAAA;IACf,CAAC;IAED,gBAAgB;IAEhB,KAAK,CAAC,CAAC,cAAc;QACnB,MAAM,MAAM,GAAG,IAAI,gBAAM,EAAE,CAAA;QAC3B,IAAI,OAAO,GAAG,IAAI,gBAAM,EAAE,CAAA;QAC1B,OAAO,CAAC,GAAG,CAAC,MAAM,IAAI,CAAC,UAAU,EAAE,CAAC,CAAA;QACpC,OAAO,OAAO,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC;YAC1B,MAAM,SAAS,GAAG,IAAI,gBAAM,EAAE,CAAA;YAC9B,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAA;YAC9D,IAAI,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC/B,MAAM,IAAI,0BAAkB,CAAC,UAAU,EAAE,OAAO,CAAC,OAAO,CAAC,CAAA;YAC3D,CAAC;YACD,KAAK,MAAM,GAAG,IAAI,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC;gBACnC,MAAM,KAAK,GAAG,MAAM,KAAK,CAAC,gBAAgB,CACxC,OAAO,CAAC,MAAM,EACd,GAAG,EACH,mBAAW,CACZ,CAAA;gBACD,MAAM,EAAE,GAAG,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,CAAA;gBACjC,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,OAAO,EAAE,KAAK,CAAC,GAAG,CAAC,CAAA;gBAEvE,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;oBAC5B,IAAI,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;wBACnB,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,CAAA;oBACzB,CAAC;yBAAM,CAAC;wBACN,SAAS,CAAC,GAAG,CAAC,MAAM,KAAK,CAAC,UAAU,EAAE,CAAC,CAAA;oBACzC,CAAC;gBACH,CAAC;YACH,CAAC;YACD,OAAO,GAAG,SAAS,CAAA;QACrB,CAAC;QACD,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAA;QAC9D,IAAI,QAAQ,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAChC,MAAM,IAAI,0BAAkB,CAAC,UAAU,EAAE,QAAQ,CAAC,OAAO,CAAC,CAAA;QAC5D,CAAC;QAED,KAAK,MAAM,IAAI,IAAI,QAAQ,CAAC,MAAM,CAAC,OAAO,EAAE,EAAE,CAAC;YAC7C,MAAM,IAAI,CAAA;QACZ,CAAC;IACH,CAAC;IAED,KAAK,CAAC,WAAW,CAAC,GAAW;QAC3B,MAAM,IAAI,GAAU,CAAC,MAAM,IAAI,CAAC,UAAU,EAAE,CAAC,CAAA;QAC7C,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,CAAA;QACpD,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAA;QACvC,IAAI,KAAK,IAAI,KAAK,CAAC,MAAM,EAAE,IAAI,KAAK,CAAC,GAAG,KAAK,GAAG,EAAE,CAAC;YACjD,OAAO,CAAC,GAAG,IAAI,EAAE,KAAK,CAAC,KAAK,CAAC,CAAA;QAC/B,CAAC;QACD,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,KAAK,GAAG,CAAC,CAAC,CAAA;QAC1C,IAAI,IAAI,IAAI,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC;YAC1B,OAAO,CAAC,GAAG,IAAI,EAAE,GAAG,CAAC,MAAM,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;QACpD,CAAC;QACD,OAAO,IAAI,CAAA;IACb,CAAC;IAED,gGAAgG;IAChG,mEAAmE;IACnE,iGAAiG;IACjG,uEAAuE;IACvE,KAAK,CAAC,gBAAgB,CAAC,GAAW;QAChC,MAAM,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC;YAC5C,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC;YACrB,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC;YACzB,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC;SAC3B,CAAC,CAAA;QACF,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAA;IACxC,CAAC;IAED,KAAK,CAAC,WAAW,CAAC,GAAW;QAC3B,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,CAAA;QACpD,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAA;QACvC,IAAI,MAAgB,CAAA;QACpB,IAAI,KAAK,IAAI,KAAK,CAAC,MAAM,EAAE,IAAI,KAAK,CAAC,GAAG,KAAK,GAAG,EAAE,CAAC;YACjD,MAAM,GAAG,IAAI,oBAAQ,EAAE,CAAA;QACzB,CAAC;aAAM,CAAC;YACN,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,KAAK,GAAG,CAAC,CAAC,CAAA;YAC1C,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC;gBAC3B,OAAO,IAAI,oBAAQ,EAAE,CAAA;YACvB,CAAC;iBAAM,CAAC;gBACN,MAAM,GAAG,MAAM,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAA;YACtC,CAAC;QACH,CAAC;QACD,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC,SAAS,EAAE,CAAA;QACzC,OAAO,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,GAAG,EAAE,UAAU,CAAC,KAAK,CAAC,CAAA;IACrD,CAAC;IAED,KAAK,CAAC,eAAe,CAAC,GAAW;QAC/B,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,CAAA;QACpD,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,KAAK,GAAG,CAAC,CAAC,CAAA;QAC1C,IAAI,MAAgB,CAAA;QACpB,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC;YAC3B,MAAM,GAAG,IAAI,oBAAQ,EAAE,CAAA;QACzB,CAAC;aAAM,CAAC;YACN,MAAM,GAAG,MAAM,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,CAAA;QAC1C,CAAC;QACD,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC,SAAS,EAAE,CAAA;QACzC,OAAO,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,GAAG,EAAE,UAAU,CAAC,KAAK,CAAC,CAAA;IACrD,CAAC;IAED,KAAK,CAAC,gBAAgB,CAAC,GAAW;QAChC,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,CAAA;QACpD,IAAI,KAAK,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAA;QACrC,IAAI,CAAC,KAAK,EAAE,CAAC;YACX,KAAK,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,KAAK,GAAG,CAAC,CAAC,CAAA;QACvC,CAAC;QACD,IAAI,MAAgB,CAAA;QACpB,IAAI,CAAC,KAAK,EAAE,CAAC;YACX,gCAAgC;YAChC,MAAM,GAAG,IAAI,oBAAQ,EAAE,CAAA;QACzB,CAAC;aAAM,IAAI,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YAC1B,MAAM,GAAG,MAAM,KAAK,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAA;YAC1C,eAAe;QACjB,CAAC;aAAM,CAAC;YACN,MAAM,IAAI,GACR,KAAK,CAAC,GAAG,KAAK,GAAG;gBACf,CAAC,CAAC,MAAM,IAAI,CAAC,OAAO,CAAC,KAAK,GAAG,CAAC,CAAC;gBAC/B,CAAC,CAAC,MAAM,IAAI,CAAC,OAAO,CAAC,KAAK,GAAG,CAAC,CAAC,CAAA;YACnC,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC;gBAC3B,MAAM,GAAG,IAAI,oBAAQ,EAAE,CAAA;YACzB,CAAC;iBAAM,CAAC;gBACN,MAAM,GAAG,MAAM,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAA;YAC3C,CAAC;QACH,CAAC;QACD,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC,SAAS,EAAE,CAAA;QACzC,OAAO,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,GAAG,EAAE,UAAU,CAAC,KAAK,CAAC,CAAA;IACrD,CAAC;IAED,0BAA0B;IAC1B,sBAAsB;IAEtB,MAAM;QACJ,OAAO,IAAI,CAAA;IACb,CAAC;IAED,MAAM;QACJ,OAAO,KAAK,CAAA;IACd,CAAC;IAED,KAAK,CAAC,MAAM,CAAC,KAAgB;QAC3B,IAAI,KAAK,CAAC,MAAM,EAAE;YAAE,OAAO,KAAK,CAAA;QAChC,MAAM,WAAW,GAAG,MAAM,IAAI,CAAC,UAAU,EAAE,CAAA;QAC3C,MAAM,YAAY,GAAG,MAAM,KAAK,CAAC,UAAU,EAAE,CAAA;QAC7C,OAAO,WAAW,CAAC,MAAM,CAAC,YAAY,CAAC,CAAA;IACzC,CAAC;CACF;AAhyBD,kBAgyBC;AAED,MAAa,IAAI;IACf,YACS,GAAW,EACX,KAAU;QADjB;;;;mBAAO,GAAG;WAAQ;QAClB;;;;mBAAO,KAAK;WAAK;IAChB,CAAC;IAEJ,MAAM;QACJ,OAAO,KAAK,CAAA;IACd,CAAC;IAED,MAAM;QACJ,OAAO,IAAI,CAAA;IACb,CAAC;IAED,MAAM,CAAC,KAAgB;QACrB,IAAI,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YACnB,OAAO,IAAI,CAAC,GAAG,KAAK,KAAK,CAAC,GAAG,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAA;QACjE,CAAC;aAAM,CAAC;YACN,OAAO,KAAK,CAAA;QACd,CAAC;IACH,CAAC;CACF;AArBD,oBAqBC","sourcesContent":["import { z } from 'zod'\nimport { cidForLex, encode } from '@atproto/lex-cbor'\nimport { Cid, cidForCbor } from '@atproto/lex-data'\nimport { BlockMap } from '../block-map'\nimport { CidSet } from '../cid-set'\nimport { MissingBlockError, MissingBlocksError } from '../error'\nimport * as parse from '../parse'\nimport { ReadableBlockstore } from '../storage'\nimport { CarBlock, schema } from '../types'\nimport * as util from './util'\n\n/**\n * This is an implementation of a Merkle Search Tree (MST)\n * The data structure is described here: https://hal.inria.fr/hal-02303490/document\n * The MST is an ordered, insert-order-independent, deterministic tree.\n * Keys are laid out in alphabetic order.\n * The key insight of an MST is that each key is hashed and starting 0s are counted\n * to determine which layer it falls on (5 zeros for ~32 fanout).\n * This is a merkle tree, so each subtree is referred to by it's hash (Cid).\n * When a leaf is changed, ever tree on the path to that leaf is changed as well,\n * thereby updating the root hash.\n *\n * For atproto, we use SHA-256 as the key hashing algorithm, and ~4 fanout\n * (2-bits of zero per layer).\n */\n\n/**\n * A couple notes on CBOR encoding:\n *\n * There are never two neighboring subtrees.\n * Therefore, we can represent a node as an array of\n * leaves & pointers to their right neighbor (possibly null),\n * along with a pointer to the left-most subtree (also possibly null).\n *\n * Most keys in a subtree will have overlap.\n * We do compression on prefixes by describing keys as:\n * - the length of the prefix that it shares in common with the preceding key\n * - the rest of the string\n *\n * For example:\n * If the first leaf in a tree is `bsky/posts/abcdefg` and the second is `bsky/posts/abcdehi`\n * Then the first will be described as `prefix: 0, key: 'bsky/posts/abcdefg'`,\n * and the second will be described as `prefix: 16, key: 'hi'.`\n */\nconst subTreePointer = z.nullable(schema.cid)\nconst treeEntry = z.object({\n  p: z.number(), // prefix count of ascii chars that this key shares with the prev key\n  k: schema.bytes, // the rest of the key outside the shared prefix\n  v: schema.cid, // value\n  t: subTreePointer, // next subtree (to the right of leaf)\n})\nconst nodeData = z.object({\n  l: subTreePointer, // left-most subtree\n  e: z.array(treeEntry), //entries\n})\nexport type NodeData = z.infer<typeof nodeData>\n\nexport const nodeDataDef = {\n  name: 'mst node',\n  schema: nodeData,\n}\n\nexport type NodeEntry = MST | Leaf\n\nexport type MstOpts = {\n  layer: number\n}\n\nexport class MST {\n  storage: ReadableBlockstore\n  entries: NodeEntry[] | null\n  layer: number | null\n  pointer: Cid\n  outdatedPointer = false\n\n  constructor(\n    storage: ReadableBlockstore,\n    pointer: Cid,\n    entries: NodeEntry[] | null,\n    layer: number | null,\n  ) {\n    this.storage = storage\n    this.entries = entries\n    this.layer = layer\n    this.pointer = pointer\n  }\n\n  static async create(\n    storage: ReadableBlockstore,\n    entries: NodeEntry[] = [],\n    opts?: Partial<MstOpts>,\n  ): Promise<MST> {\n    const pointer = await util.cidForEntries(entries)\n    const { layer = null } = opts || {}\n    return new MST(storage, pointer, entries, layer)\n  }\n\n  static async fromData(\n    storage: ReadableBlockstore,\n    data: NodeData,\n    opts?: Partial<MstOpts>,\n  ): Promise<MST> {\n    const { layer = null } = opts || {}\n    const entries = await util.deserializeNodeData(storage, data, opts)\n    const pointer = await cidForLex(data)\n    return new MST(storage, pointer, entries, layer)\n  }\n\n  // this is really a *lazy* load, doesn't actually touch storage\n  static load(\n    storage: ReadableBlockstore,\n    cid: Cid,\n    opts?: Partial<MstOpts>,\n  ): MST {\n    const { layer = null } = opts || {}\n    return new MST(storage, cid, null, layer)\n  }\n\n  // Immutability\n  // -------------------\n\n  // We never mutate an MST, we just return a new MST with updated values\n  async newTree(entries: NodeEntry[]): Promise<MST> {\n    const mst = new MST(this.storage, this.pointer, entries, this.layer)\n    mst.outdatedPointer = true\n    return mst\n  }\n\n  // Getters (lazy load)\n  // -------------------\n\n  // We don't want to load entries of every subtree, just the ones we need\n  async getEntries(): Promise<NodeEntry[]> {\n    if (this.entries) return [...this.entries]\n    if (this.pointer) {\n      const data = await this.storage.readObj(this.pointer, nodeDataDef)\n      const firstLeaf = data.e[0]\n      const layer =\n        firstLeaf !== undefined\n          ? await util.leadingZerosOnHash(firstLeaf.k)\n          : undefined\n      this.entries = await util.deserializeNodeData(this.storage, data, {\n        layer,\n      })\n\n      return this.entries\n    }\n    throw new Error('No entries or Cid provided')\n  }\n\n  // We don't hash the node on every mutation for performance reasons\n  // Instead we keep track of whether the pointer is outdated and only (recursively) calculate when needed\n  async getPointer(): Promise<Cid> {\n    if (!this.outdatedPointer) return this.pointer\n    const { cid } = await this.serialize()\n    this.pointer = cid\n    this.outdatedPointer = false\n    return this.pointer\n  }\n\n  async serialize(): Promise<{ cid: Cid; bytes: Uint8Array }> {\n    let entries = await this.getEntries()\n    const outdated = entries.filter(\n      (e) => e.isTree() && e.outdatedPointer,\n    ) as MST[]\n    if (outdated.length > 0) {\n      await Promise.all(outdated.map((e) => e.getPointer()))\n      entries = await this.getEntries()\n    }\n    const data = util.serializeNodeData(entries)\n    const bytes = encode(data)\n    const cid = await cidForCbor(bytes)\n    return { cid, bytes }\n  }\n\n  // In most cases, we get the layer of a node from a hint on creation\n  // In the case of the topmost node in the tree, we look for a key in the node & determine the layer\n  // In the case where we don't find one, we recurse down until we do.\n  // If we still can't find one, then we have an empty tree and the node is layer 0\n  async getLayer(): Promise<number> {\n    this.layer = await this.attemptGetLayer()\n    if (this.layer === null) this.layer = 0\n    return this.layer\n  }\n\n  async attemptGetLayer(): Promise<number | null> {\n    if (this.layer !== null) return this.layer\n    const entries = await this.getEntries()\n    let layer = await util.layerForEntries(entries)\n    if (layer === null) {\n      for (const entry of entries) {\n        if (entry.isTree()) {\n          const childLayer = await entry.attemptGetLayer()\n          if (childLayer !== null) {\n            layer = childLayer + 1\n            break\n          }\n        }\n      }\n    }\n    if (layer !== null) this.layer = layer\n    return layer\n  }\n\n  // Core functionality\n  // -------------------\n\n  // Return the necessary blocks to persist the MST to repo storage\n  async getUnstoredBlocks(): Promise<{ root: Cid; blocks: BlockMap }> {\n    const blocks = new BlockMap()\n    const pointer = await this.getPointer()\n    const alreadyHas = await this.storage.has(pointer)\n    if (alreadyHas) return { root: pointer, blocks }\n    const entries = await this.getEntries()\n    const data = util.serializeNodeData(entries)\n    await blocks.add(data)\n    for (const entry of entries) {\n      if (entry.isTree()) {\n        const subtree = await entry.getUnstoredBlocks()\n        blocks.addMap(subtree.blocks)\n      }\n    }\n    return { root: pointer, blocks: blocks }\n  }\n\n  // Adds a new leaf for the given key/value pair\n  // Throws if a leaf with that key already exists\n  async add(key: string, value: Cid, knownZeros?: number): Promise<MST> {\n    util.ensureValidMstKey(key)\n    const keyZeros = knownZeros ?? (await util.leadingZerosOnHash(key))\n    const layer = await this.getLayer()\n    const newLeaf = new Leaf(key, value)\n    if (keyZeros === layer) {\n      // it belongs in this layer\n      const index = await this.findGtOrEqualLeafIndex(key)\n      const found = await this.atIndex(index)\n      if (found?.isLeaf() && found.key === key) {\n        throw new Error(`There is already a value at key: ${key}`)\n      }\n      const prevNode = await this.atIndex(index - 1)\n      if (!prevNode || prevNode.isLeaf()) {\n        // if entry before is a leaf, (or we're on far left) we can just splice in\n        return this.spliceIn(newLeaf, index)\n      } else {\n        // else we try to split the subtree around the key\n        const splitSubTree = await prevNode.splitAround(key)\n        return this.replaceWithSplit(\n          index - 1,\n          splitSubTree[0],\n          newLeaf,\n          splitSubTree[1],\n        )\n      }\n    } else if (keyZeros < layer) {\n      // it belongs on a lower layer\n      const index = await this.findGtOrEqualLeafIndex(key)\n      const prevNode = await this.atIndex(index - 1)\n      if (prevNode && prevNode.isTree()) {\n        // if entry before is a tree, we add it to that tree\n        const newSubtree = await prevNode.add(key, value, keyZeros)\n        return this.updateEntry(index - 1, newSubtree)\n      } else {\n        const subTree = await this.createChild()\n        const newSubTree = await subTree.add(key, value, keyZeros)\n        return this.spliceIn(newSubTree, index)\n      }\n    } else {\n      // it belongs on a higher layer & we must push the rest of the tree down\n      const split = await this.splitAround(key)\n      // if the newly added key has >=2 more leading zeros than the current highest layer\n      // then we need to add in structural nodes in between as well\n      let left: MST | null = split[0]\n      let right: MST | null = split[1]\n      const layer = await this.getLayer()\n      const extraLayersToAdd = keyZeros - layer\n      // intentionally starting at 1, since first layer is taken care of by split\n      for (let i = 1; i < extraLayersToAdd; i++) {\n        if (left !== null) {\n          left = await left.createParent()\n        }\n        if (right !== null) {\n          right = await right.createParent()\n        }\n      }\n      const updated: NodeEntry[] = []\n      if (left) updated.push(left)\n      updated.push(new Leaf(key, value))\n      if (right) updated.push(right)\n      const newRoot = await MST.create(this.storage, updated, {\n        layer: keyZeros,\n      })\n      newRoot.outdatedPointer = true\n      return newRoot\n    }\n  }\n\n  // Gets the value at the given key\n  async get(key: string): Promise<Cid | null> {\n    const index = await this.findGtOrEqualLeafIndex(key)\n    const found = await this.atIndex(index)\n    if (found && found.isLeaf() && found.key === key) {\n      return found.value\n    }\n    const prev = await this.atIndex(index - 1)\n    if (prev && prev.isTree()) {\n      return prev.get(key)\n    }\n    return null\n  }\n\n  // Edits the value at the given key\n  // Throws if the given key does not exist\n  async update(key: string, value: Cid): Promise<MST> {\n    util.ensureValidMstKey(key)\n    const index = await this.findGtOrEqualLeafIndex(key)\n    const found = await this.atIndex(index)\n    if (found && found.isLeaf() && found.key === key) {\n      return this.updateEntry(index, new Leaf(key, value))\n    }\n    const prev = await this.atIndex(index - 1)\n    if (prev && prev.isTree()) {\n      const updatedTree = await prev.update(key, value)\n      return this.updateEntry(index - 1, updatedTree)\n    }\n    throw new Error(`Could not find a record with key: ${key}`)\n  }\n\n  // Deletes the value at the given key\n  async delete(key: string): Promise<MST> {\n    const altered = await this.deleteRecurse(key)\n    return altered.trimTop()\n  }\n\n  async deleteRecurse(key: string): Promise<MST> {\n    const index = await this.findGtOrEqualLeafIndex(key)\n    const found = await this.atIndex(index)\n    // if found, remove it on this level\n    if (found?.isLeaf() && found.key === key) {\n      const prev = await this.atIndex(index - 1)\n      const next = await this.atIndex(index + 1)\n      if (prev?.isTree() && next?.isTree()) {\n        const merged = await prev.appendMerge(next)\n        return this.newTree([\n          ...(await this.slice(0, index - 1)),\n          merged,\n          ...(await this.slice(index + 2)),\n        ])\n      } else {\n        return this.removeEntry(index)\n      }\n    }\n    // else recurse down to find it\n    const prev = await this.atIndex(index - 1)\n    if (prev?.isTree()) {\n      const subtree = await prev.deleteRecurse(key)\n      const subTreeEntries = await subtree.getEntries()\n      if (subTreeEntries.length === 0) {\n        return this.removeEntry(index - 1)\n      } else {\n        return this.updateEntry(index - 1, subtree)\n      }\n    } else {\n      throw new Error(`Could not find a record with key: ${key}`)\n    }\n  }\n\n  // Simple Operations\n  // -------------------\n\n  // update entry in place\n  async updateEntry(index: number, entry: NodeEntry): Promise<MST> {\n    const update = [\n      ...(await this.slice(0, index)),\n      entry,\n      ...(await this.slice(index + 1)),\n    ]\n    return this.newTree(update)\n  }\n\n  // remove entry at index\n  async removeEntry(index: number): Promise<MST> {\n    const updated = [\n      ...(await this.slice(0, index)),\n      ...(await this.slice(index + 1)),\n    ]\n    return this.newTree(updated)\n  }\n\n  // append entry to end of the node\n  async append(entry: NodeEntry): Promise<MST> {\n    const entries = await this.getEntries()\n    return this.newTree([...entries, entry])\n  }\n\n  // prepend entry to start of the node\n  async prepend(entry: NodeEntry): Promise<MST> {\n    const entries = await this.getEntries()\n    return this.newTree([entry, ...entries])\n  }\n\n  // returns entry at index\n  async atIndex(index: number): Promise<NodeEntry | null> {\n    const entries = await this.getEntries()\n    return entries[index] ?? null\n  }\n\n  // returns a slice of the node (like array.slice)\n  async slice(\n    start?: number | undefined,\n    end?: number | undefined,\n  ): Promise<NodeEntry[]> {\n    const entries = await this.getEntries()\n    return entries.slice(start, end)\n  }\n\n  // inserts entry at index\n  async spliceIn(entry: NodeEntry, index: number): Promise<MST> {\n    const update = [\n      ...(await this.slice(0, index)),\n      entry,\n      ...(await this.slice(index)),\n    ]\n    return this.newTree(update)\n  }\n\n  // replaces an entry with [ Maybe(tree), Leaf, Maybe(tree) ]\n  async replaceWithSplit(\n    index: number,\n    left: MST | null,\n    leaf: Leaf,\n    right: MST | null,\n  ): Promise<MST> {\n    const update = await this.slice(0, index)\n    if (left) update.push(left)\n    update.push(leaf)\n    if (right) update.push(right)\n    update.push(...(await this.slice(index + 1)))\n    return this.newTree(update)\n  }\n\n  // if the topmost node in the tree only points to another tree, trim the top and return the subtree\n  async trimTop(): Promise<MST> {\n    let entries: NodeEntry[]\n    try {\n      entries = await this.getEntries()\n    } catch (err) {\n      if (err instanceof MissingBlockError) {\n        return this\n      } else {\n        throw err\n      }\n    }\n    if (entries.length === 1 && entries[0].isTree()) {\n      return entries[0].trimTop()\n    } else {\n      return this\n    }\n  }\n\n  // Subtree & Splits\n  // -------------------\n\n  // Recursively splits a sub tree around a given key\n  async splitAround(key: string): Promise<[MST | null, MST | null]> {\n    const index = await this.findGtOrEqualLeafIndex(key)\n    // split tree around key\n    const leftData = await this.slice(0, index)\n    const rightData = await this.slice(index)\n    let left = await this.newTree(leftData)\n    let right = await this.newTree(rightData)\n\n    // if the far right of the left side is a subtree,\n    // we need to split it on the key as well\n    const lastInLeft = leftData[leftData.length - 1]\n    if (lastInLeft?.isTree()) {\n      left = await left.removeEntry(leftData.length - 1)\n      const split = await lastInLeft.splitAround(key)\n      if (split[0]) {\n        left = await left.append(split[0])\n      }\n      if (split[1]) {\n        right = await right.prepend(split[1])\n      }\n    }\n\n    return [\n      (await left.getEntries()).length > 0 ? left : null,\n      (await right.getEntries()).length > 0 ? right : null,\n    ]\n  }\n\n  // The simple merge case where every key in the right tree is greater than every key in the left tree\n  // (used primarily for deletes)\n  async appendMerge(toMerge: MST): Promise<MST> {\n    if ((await this.getLayer()) !== (await toMerge.getLayer())) {\n      throw new Error(\n        'Trying to merge two nodes from different layers of the MST',\n      )\n    }\n    const thisEntries = await this.getEntries()\n    const toMergeEntries = await toMerge.getEntries()\n    const lastInLeft = thisEntries[thisEntries.length - 1]\n    const firstInRight = toMergeEntries[0]\n    if (lastInLeft?.isTree() && firstInRight?.isTree()) {\n      const merged = await lastInLeft.appendMerge(firstInRight)\n      return this.newTree([\n        ...thisEntries.slice(0, thisEntries.length - 1),\n        merged,\n        ...toMergeEntries.slice(1),\n      ])\n    } else {\n      return this.newTree([...thisEntries, ...toMergeEntries])\n    }\n  }\n\n  // Create relatives\n  // -------------------\n\n  async createChild(): Promise<MST> {\n    const layer = await this.getLayer()\n    return MST.create(this.storage, [], {\n      layer: layer - 1,\n    })\n  }\n\n  async createParent(): Promise<MST> {\n    const layer = await this.getLayer()\n    const parent = await MST.create(this.storage, [this], {\n      layer: layer + 1,\n    })\n    parent.outdatedPointer = true\n    return parent\n  }\n\n  // Finding insertion points\n  // -------------------\n\n  // finds index of first leaf node that is greater than or equal to the value\n  async findGtOrEqualLeafIndex(key: string): Promise<number> {\n    const entries = await this.getEntries()\n    const maybeIndex = entries.findIndex(\n      (entry) => entry.isLeaf() && entry.key >= key,\n    )\n    // if we can't find, we're on the end\n    return maybeIndex >= 0 ? maybeIndex : entries.length\n  }\n\n  // List operations (partial tree traversal)\n  // -------------------\n\n  // @TODO write tests for these\n\n  // Walk tree starting at key\n  async *walkFrom(key: string): AsyncIterable<NodeEntry> {\n    yield this\n    const index = await this.findGtOrEqualLeafIndex(key)\n    const entries = await this.getEntries()\n    const found = entries[index]\n    if (found && found.isLeaf() && found.key === key) {\n      yield found\n    } else {\n      const prev = entries[index - 1]\n      if (prev) {\n        if (prev.isLeaf() && prev.key === key) {\n          yield prev\n        } else if (prev.isTree()) {\n          yield* prev.walkFrom(key)\n        }\n      }\n    }\n\n    for (let i = index; i < entries.length; i++) {\n      const entry = entries[i]\n      if (entry.isLeaf()) {\n        yield entry\n      } else {\n        yield* entry.walkFrom(key)\n      }\n    }\n  }\n\n  async *walkLeavesFrom(key: string): AsyncIterable<Leaf> {\n    for await (const node of this.walkFrom(key)) {\n      if (node.isLeaf()) {\n        yield node\n      }\n    }\n  }\n\n  async list(\n    count = Number.MAX_SAFE_INTEGER,\n    after?: string,\n    before?: string,\n  ): Promise<Leaf[]> {\n    const vals: Leaf[] = []\n    for await (const leaf of this.walkLeavesFrom(after || '')) {\n      if (leaf.key === after) continue\n      if (vals.length >= count) break\n      if (before && leaf.key >= before) break\n      vals.push(leaf)\n    }\n    return vals\n  }\n\n  async listWithPrefix(\n    prefix: string,\n    count = Number.MAX_SAFE_INTEGER,\n  ): Promise<Leaf[]> {\n    const vals: Leaf[] = []\n    for await (const leaf of this.walkLeavesFrom(prefix)) {\n      if (vals.length >= count || !leaf.key.startsWith(prefix)) break\n      vals.push(leaf)\n    }\n    return vals\n  }\n\n  // Full tree traversal\n  // -------------------\n\n  // Walk full tree & emit nodes, consumer can bail at any point by returning false\n  async *walk(): AsyncIterable<NodeEntry> {\n    yield this\n    const entries = await this.getEntries()\n    for (const entry of entries) {\n      if (entry.isTree()) {\n        for await (const e of entry.walk()) {\n          yield e\n        }\n      } else {\n        yield entry\n      }\n    }\n  }\n\n  // Walk full tree & emit nodes, consumer can bail at any point by returning false\n  async paths(): Promise<NodeEntry[][]> {\n    const entries = await this.getEntries()\n    let paths: NodeEntry[][] = []\n    for (const entry of entries) {\n      if (entry.isLeaf()) {\n        paths.push([entry])\n      }\n      if (entry.isTree()) {\n        const subPaths = await entry.paths()\n        paths = [...paths, ...subPaths.map((p) => [entry, ...p])]\n      }\n    }\n    return paths\n  }\n\n  // Walks tree & returns all nodes\n  async allNodes(): Promise<NodeEntry[]> {\n    const nodes: NodeEntry[] = []\n    for await (const entry of this.walk()) {\n      nodes.push(entry)\n    }\n    return nodes\n  }\n\n  // Walks tree & returns all cids\n  async allCids(): Promise<CidSet> {\n    const cids = new CidSet()\n    const entries = await this.getEntries()\n    for (const entry of entries) {\n      if (entry.isLeaf()) {\n        cids.add(entry.value)\n      } else {\n        const subtreeCids = await entry.allCids()\n        cids.addSet(subtreeCids)\n      }\n    }\n    cids.add(await this.getPointer())\n    return cids\n  }\n\n  // Walks tree & returns all leaves\n  async leaves() {\n    const leaves: Leaf[] = []\n    for await (const entry of this.walk()) {\n      if (entry.isLeaf()) leaves.push(entry)\n    }\n    return leaves\n  }\n\n  // Returns total leaf count\n  async leafCount(): Promise<number> {\n    const leaves = await this.leaves()\n    return leaves.length\n  }\n\n  // Reachable tree traversal\n  // -------------------\n\n  // Walk reachable branches of tree & emit nodes, consumer can bail at any point by returning false\n  async *walkReachable(): AsyncIterable<NodeEntry> {\n    yield this\n    const entries = await this.getEntries()\n    for (const entry of entries) {\n      if (entry.isTree()) {\n        try {\n          for await (const e of entry.walkReachable()) {\n            yield e\n          }\n        } catch (err) {\n          if (err instanceof MissingBlockError) {\n            continue\n          } else {\n            throw err\n          }\n        }\n      } else {\n        yield entry\n      }\n    }\n  }\n\n  async reachableLeaves(): Promise<Leaf[]> {\n    const leaves: Leaf[] = []\n    for await (const entry of this.walkReachable()) {\n      if (entry.isLeaf()) leaves.push(entry)\n    }\n    return leaves\n  }\n\n  // Sync Protocol\n\n  async *carBlockStream(): AsyncIterable<CarBlock> {\n    const leaves = new CidSet()\n    let toFetch = new CidSet()\n    toFetch.add(await this.getPointer())\n    while (toFetch.size() > 0) {\n      const nextLayer = new CidSet()\n      const fetched = await this.storage.getBlocks(toFetch.toList())\n      if (fetched.missing.length > 0) {\n        throw new MissingBlocksError('mst node', fetched.missing)\n      }\n      for (const cid of toFetch.toList()) {\n        const found = await parse.getAndParseByDef(\n          fetched.blocks,\n          cid,\n          nodeDataDef,\n        )\n        yield { cid, bytes: found.bytes }\n        const entries = await util.deserializeNodeData(this.storage, found.obj)\n\n        for (const entry of entries) {\n          if (entry.isLeaf()) {\n            leaves.add(entry.value)\n          } else {\n            nextLayer.add(await entry.getPointer())\n          }\n        }\n      }\n      toFetch = nextLayer\n    }\n    const leafData = await this.storage.getBlocks(leaves.toList())\n    if (leafData.missing.length > 0) {\n      throw new MissingBlocksError('mst leaf', leafData.missing)\n    }\n\n    for (const leaf of leafData.blocks.entries()) {\n      yield leaf\n    }\n  }\n\n  async cidsForPath(key: string): Promise<Cid[]> {\n    const cids: Cid[] = [await this.getPointer()]\n    const index = await this.findGtOrEqualLeafIndex(key)\n    const found = await this.atIndex(index)\n    if (found && found.isLeaf() && found.key === key) {\n      return [...cids, found.value]\n    }\n    const prev = await this.atIndex(index - 1)\n    if (prev && prev.isTree()) {\n      return [...cids, ...(await prev.cidsForPath(key))]\n    }\n    return cids\n  }\n\n  // A covering proof is all MST nodes (leaves excluded) needed to prove the value of a given leaf\n  // and its siblings to its immediate right and left (if applicable)\n  // We simply find the immediately preceeding node and then walk from that node until we reach the\n  // first key that is greater than the requested key (the right sibling)\n  async getCoveringProof(key: string): Promise<BlockMap> {\n    const [self, left, right] = await Promise.all([\n      this.proofForKey(key),\n      this.proofForLeftSib(key),\n      this.proofForRightSib(key),\n    ])\n    return self.addMap(left).addMap(right)\n  }\n\n  async proofForKey(key: string): Promise<BlockMap> {\n    const index = await this.findGtOrEqualLeafIndex(key)\n    const found = await this.atIndex(index)\n    let blocks: BlockMap\n    if (found && found.isLeaf() && found.key === key) {\n      blocks = new BlockMap()\n    } else {\n      const prev = await this.atIndex(index - 1)\n      if (!prev || prev.isLeaf()) {\n        return new BlockMap()\n      } else {\n        blocks = await prev.proofForKey(key)\n      }\n    }\n    const serialized = await this.serialize()\n    return blocks.set(serialized.cid, serialized.bytes)\n  }\n\n  async proofForLeftSib(key: string): Promise<BlockMap> {\n    const index = await this.findGtOrEqualLeafIndex(key)\n    const prev = await this.atIndex(index - 1)\n    let blocks: BlockMap\n    if (!prev || prev.isLeaf()) {\n      blocks = new BlockMap()\n    } else {\n      blocks = await prev.proofForLeftSib(key)\n    }\n    const serialized = await this.serialize()\n    return blocks.set(serialized.cid, serialized.bytes)\n  }\n\n  async proofForRightSib(key: string): Promise<BlockMap> {\n    const index = await this.findGtOrEqualLeafIndex(key)\n    let found = await this.atIndex(index)\n    if (!found) {\n      found = await this.atIndex(index - 1)\n    }\n    let blocks: BlockMap\n    if (!found) {\n      // shouldn't ever hit, null case\n      blocks = new BlockMap()\n    } else if (found.isTree()) {\n      blocks = await found.proofForRightSib(key)\n      // recurse down\n    } else {\n      const node =\n        found.key === key\n          ? await this.atIndex(index + 1)\n          : await this.atIndex(index - 1)\n      if (!node || node.isLeaf()) {\n        blocks = new BlockMap()\n      } else {\n        blocks = await node.proofForRightSib(key)\n      }\n    }\n    const serialized = await this.serialize()\n    return blocks.set(serialized.cid, serialized.bytes)\n  }\n\n  // Matching Leaf interface\n  // -------------------\n\n  isTree(): this is MST {\n    return true\n  }\n\n  isLeaf(): this is Leaf {\n    return false\n  }\n\n  async equals(other: NodeEntry): Promise<boolean> {\n    if (other.isLeaf()) return false\n    const thisPointer = await this.getPointer()\n    const otherPointer = await other.getPointer()\n    return thisPointer.equals(otherPointer)\n  }\n}\n\nexport class Leaf {\n  constructor(\n    public key: string,\n    public value: Cid,\n  ) {}\n\n  isTree(): this is MST {\n    return false\n  }\n\n  isLeaf(): this is Leaf {\n    return true\n  }\n\n  equals(entry: NodeEntry): boolean {\n    if (entry.isLeaf()) {\n      return this.key === entry.key && this.value.equals(entry.value)\n    } else {\n      return false\n    }\n  }\n}\n"]}
+{"version":3,"file":"mst.js","sourceRoot":"","sources":["../../src/mst/mst.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAA;AACvB,OAAO,EAAE,SAAS,EAAE,MAAM,EAAE,MAAM,mBAAmB,CAAA;AACrD,OAAO,EAAO,UAAU,EAAE,MAAM,mBAAmB,CAAA;AACnD,OAAO,EAAE,QAAQ,EAAE,MAAM,iBAAiB,CAAA;AAC1C,OAAO,EAAE,MAAM,EAAE,MAAM,eAAe,CAAA;AACtC,OAAO,EAAE,iBAAiB,EAAE,kBAAkB,EAAE,MAAM,aAAa,CAAA;AACnE,OAAO,KAAK,KAAK,MAAM,aAAa,CAAA;AAEpC,OAAO,EAAY,MAAM,EAAE,MAAM,aAAa,CAAA;AAC9C,OAAO,KAAK,IAAI,MAAM,WAAW,CAAA;AAEjC;;;;;;;;;;;;;GAaG;AAEH;;;;;;;;;;;;;;;;;GAiBG;AACH,MAAM,cAAc,GAAG,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;AAC7C,MAAM,SAAS,GAAG,CAAC,CAAC,MAAM,CAAC;IACzB,CAAC,EAAE,CAAC,CAAC,MAAM,EAAE,EAAE,qEAAqE;IACpF,CAAC,EAAE,MAAM,CAAC,KAAK,EAAE,gDAAgD;IACjE,CAAC,EAAE,MAAM,CAAC,GAAG,EAAE,QAAQ;IACvB,CAAC,EAAE,cAAc,EAAE,sCAAsC;CAC1D,CAAC,CAAA;AACF,MAAM,QAAQ,GAAG,CAAC,CAAC,MAAM,CAAC;IACxB,CAAC,EAAE,cAAc,EAAE,oBAAoB;IACvC,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,SAAS,CAAC,EAAE,SAAS;CACjC,CAAC,CAAA;AAGF,MAAM,CAAC,MAAM,WAAW,GAAG;IACzB,IAAI,EAAE,UAAU;IAChB,MAAM,EAAE,QAAQ;CACjB,CAAA;AAQD,MAAM,OAAO,GAAG;IAOd,YACE,OAA2B,EAC3B,OAAY,EACZ,OAA2B,EAC3B,KAAoB;QANtB,oBAAe,GAAG,KAAK,CAAA;QAQrB,IAAI,CAAC,OAAO,GAAG,OAAO,CAAA;QACtB,IAAI,CAAC,OAAO,GAAG,OAAO,CAAA;QACtB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAA;QAClB,IAAI,CAAC,OAAO,GAAG,OAAO,CAAA;IACxB,CAAC;IAED,MAAM,CAAC,KAAK,CAAC,MAAM,CACjB,OAA2B,EAC3B,UAAuB,EAAE,EACzB,IAAuB;QAEvB,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,CAAA;QACjD,MAAM,EAAE,KAAK,GAAG,IAAI,EAAE,GAAG,IAAI,IAAI,EAAE,CAAA;QACnC,OAAO,IAAI,GAAG,CAAC,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,CAAC,CAAA;IAClD,CAAC;IAED,MAAM,CAAC,KAAK,CAAC,QAAQ,CACnB,OAA2B,EAC3B,IAAc,EACd,IAAuB;QAEvB,MAAM,EAAE,KAAK,GAAG,IAAI,EAAE,GAAG,IAAI,IAAI,EAAE,CAAA;QACnC,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,mBAAmB,CAAC,OAAO,EAAE,IAAI,EAAE,IAAI,CAAC,CAAA;QACnE,MAAM,OAAO,GAAG,MAAM,SAAS,CAAC,IAAI,CAAC,CAAA;QACrC,OAAO,IAAI,GAAG,CAAC,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,CAAC,CAAA;IAClD,CAAC;IAED,+DAA+D;IAC/D,MAAM,CAAC,IAAI,CACT,OAA2B,EAC3B,GAAQ,EACR,IAAuB;QAEvB,MAAM,EAAE,KAAK,GAAG,IAAI,EAAE,GAAG,IAAI,IAAI,EAAE,CAAA;QACnC,OAAO,IAAI,GAAG,CAAC,OAAO,EAAE,GAAG,EAAE,IAAI,EAAE,KAAK,CAAC,CAAA;IAC3C,CAAC;IAED,eAAe;IACf,sBAAsB;IAEtB,uEAAuE;IACvE,KAAK,CAAC,OAAO,CAAC,OAAoB;QAChC,MAAM,GAAG,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,OAAO,EAAE,OAAO,EAAE,IAAI,CAAC,KAAK,CAAC,CAAA;QACpE,GAAG,CAAC,eAAe,GAAG,IAAI,CAAA;QAC1B,OAAO,GAAG,CAAA;IACZ,CAAC;IAED,sBAAsB;IACtB,sBAAsB;IAEtB,wEAAwE;IACxE,KAAK,CAAC,UAAU;QACd,IAAI,IAAI,CAAC,OAAO;YAAE,OAAO,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAA;QAC1C,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjB,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,EAAE,WAAW,CAAC,CAAA;YAClE,MAAM,SAAS,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;YAC3B,MAAM,KAAK,GACT,SAAS,KAAK,SAAS;gBACrB,CAAC,CAAC,MAAM,IAAI,CAAC,kBAAkB,CAAC,SAAS,CAAC,CAAC,CAAC;gBAC5C,CAAC,CAAC,SAAS,CAAA;YACf,IAAI,CAAC,OAAO,GAAG,MAAM,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,EAAE;gBAChE,KAAK;aACN,CAAC,CAAA;YAEF,OAAO,IAAI,CAAC,OAAO,CAAA;QACrB,CAAC;QACD,MAAM,IAAI,KAAK,CAAC,4BAA4B,CAAC,CAAA;IAC/C,CAAC;IAED,mEAAmE;IACnE,wGAAwG;IACxG,KAAK,CAAC,UAAU;QACd,IAAI,CAAC,IAAI,CAAC,eAAe;YAAE,OAAO,IAAI,CAAC,OAAO,CAAA;QAC9C,MAAM,EAAE,GAAG,EAAE,GAAG,MAAM,IAAI,CAAC,SAAS,EAAE,CAAA;QACtC,IAAI,CAAC,OAAO,GAAG,GAAG,CAAA;QAClB,IAAI,CAAC,eAAe,GAAG,KAAK,CAAA;QAC5B,OAAO,IAAI,CAAC,OAAO,CAAA;IACrB,CAAC;IAED,KAAK,CAAC,SAAS;QACb,IAAI,OAAO,GAAG,MAAM,IAAI,CAAC,UAAU,EAAE,CAAA;QACrC,MAAM,QAAQ,GAAG,OAAO,CAAC,MAAM,CAC7B,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,eAAe,CAC9B,CAAA;QACV,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,CAAA;YACtD,OAAO,GAAG,MAAM,IAAI,CAAC,UAAU,EAAE,CAAA;QACnC,CAAC;QACD,MAAM,IAAI,GAAG,IAAI,CAAC,iBAAiB,CAAC,OAAO,CAAC,CAAA;QAC5C,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,CAAA;QAC1B,MAAM,GAAG,GAAG,MAAM,UAAU,CAAC,KAAK,CAAC,CAAA;QACnC,OAAO,EAAE,GAAG,EAAE,KAAK,EAAE,CAAA;IACvB,CAAC;IAED,oEAAoE;IACpE,mGAAmG;IACnG,oEAAoE;IACpE,iFAAiF;IACjF,KAAK,CAAC,QAAQ;QACZ,IAAI,CAAC,KAAK,GAAG,MAAM,IAAI,CAAC,eAAe,EAAE,CAAA;QACzC,IAAI,IAAI,CAAC,KAAK,KAAK,IAAI;YAAE,IAAI,CAAC,KAAK,GAAG,CAAC,CAAA;QACvC,OAAO,IAAI,CAAC,KAAK,CAAA;IACnB,CAAC;IAED,KAAK,CAAC,eAAe;QACnB,IAAI,IAAI,CAAC,KAAK,KAAK,IAAI;YAAE,OAAO,IAAI,CAAC,KAAK,CAAA;QAC1C,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,UAAU,EAAE,CAAA;QACvC,IAAI,KAAK,GAAG,MAAM,IAAI,CAAC,eAAe,CAAC,OAAO,CAAC,CAAA;QAC/C,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;YACnB,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;gBAC5B,IAAI,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;oBACnB,MAAM,UAAU,GAAG,MAAM,KAAK,CAAC,eAAe,EAAE,CAAA;oBAChD,IAAI,UAAU,KAAK,IAAI,EAAE,CAAC;wBACxB,KAAK,GAAG,UAAU,GAAG,CAAC,CAAA;wBACtB,MAAK;oBACP,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QACD,IAAI,KAAK,KAAK,IAAI;YAAE,IAAI,CAAC,KAAK,GAAG,KAAK,CAAA;QACtC,OAAO,KAAK,CAAA;IACd,CAAC;IAED,qBAAqB;IACrB,sBAAsB;IAEtB,iEAAiE;IACjE,KAAK,CAAC,iBAAiB;QACrB,MAAM,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAA;QAC7B,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,UAAU,EAAE,CAAA;QACvC,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;QAClD,IAAI,UAAU;YAAE,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,CAAA;QAChD,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,UAAU,EAAE,CAAA;QACvC,MAAM,IAAI,GAAG,IAAI,CAAC,iBAAiB,CAAC,OAAO,CAAC,CAAA;QAC5C,MAAM,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;QACtB,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;YAC5B,IAAI,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;gBACnB,MAAM,OAAO,GAAG,MAAM,KAAK,CAAC,iBAAiB,EAAE,CAAA;gBAC/C,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,CAAA;YAC/B,CAAC;QACH,CAAC;QACD,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,CAAA;IAC1C,CAAC;IAED,+CAA+C;IAC/C,gDAAgD;IAChD,KAAK,CAAC,GAAG,CAAC,GAAW,EAAE,KAAU,EAAE,UAAmB;QACpD,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,CAAA;QAC3B,MAAM,QAAQ,GAAG,UAAU,IAAI,CAAC,MAAM,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,CAAC,CAAA;QACnE,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,QAAQ,EAAE,CAAA;QACnC,MAAM,OAAO,GAAG,IAAI,IAAI,CAAC,GAAG,EAAE,KAAK,CAAC,CAAA;QACpC,IAAI,QAAQ,KAAK,KAAK,EAAE,CAAC;YACvB,2BAA2B;YAC3B,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,CAAA;YACpD,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAA;YACvC,IAAI,KAAK,EAAE,MAAM,EAAE,IAAI,KAAK,CAAC,GAAG,KAAK,GAAG,EAAE,CAAC;gBACzC,MAAM,IAAI,KAAK,CAAC,oCAAoC,GAAG,EAAE,CAAC,CAAA;YAC5D,CAAC;YACD,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,KAAK,GAAG,CAAC,CAAC,CAAA;YAC9C,IAAI,CAAC,QAAQ,IAAI,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC;gBACnC,0EAA0E;gBAC1E,OAAO,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,KAAK,CAAC,CAAA;YACtC,CAAC;iBAAM,CAAC;gBACN,kDAAkD;gBAClD,MAAM,YAAY,GAAG,MAAM,QAAQ,CAAC,WAAW,CAAC,GAAG,CAAC,CAAA;gBACpD,OAAO,IAAI,CAAC,gBAAgB,CAC1B,KAAK,GAAG,CAAC,EACT,YAAY,CAAC,CAAC,CAAC,EACf,OAAO,EACP,YAAY,CAAC,CAAC,CAAC,CAChB,CAAA;YACH,CAAC;QACH,CAAC;aAAM,IAAI,QAAQ,GAAG,KAAK,EAAE,CAAC;YAC5B,8BAA8B;YAC9B,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,CAAA;YACpD,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,KAAK,GAAG,CAAC,CAAC,CAAA;YAC9C,IAAI,QAAQ,IAAI,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC;gBAClC,oDAAoD;gBACpD,MAAM,UAAU,GAAG,MAAM,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAA;gBAC3D,OAAO,IAAI,CAAC,WAAW,CAAC,KAAK,GAAG,CAAC,EAAE,UAAU,CAAC,CAAA;YAChD,CAAC;iBAAM,CAAC;gBACN,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,WAAW,EAAE,CAAA;gBACxC,MAAM,UAAU,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAA;gBAC1D,OAAO,IAAI,CAAC,QAAQ,CAAC,UAAU,EAAE,KAAK,CAAC,CAAA;YACzC,CAAC;QACH,CAAC;aAAM,CAAC;YACN,wEAAwE;YACxE,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAA;YACzC,mFAAmF;YACnF,6DAA6D;YAC7D,IAAI,IAAI,GAAe,KAAK,CAAC,CAAC,CAAC,CAAA;YAC/B,IAAI,KAAK,GAAe,KAAK,CAAC,CAAC,CAAC,CAAA;YAChC,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,QAAQ,EAAE,CAAA;YACnC,MAAM,gBAAgB,GAAG,QAAQ,GAAG,KAAK,CAAA;YACzC,2EAA2E;YAC3E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,gBAAgB,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC1C,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;oBAClB,IAAI,GAAG,MAAM,IAAI,CAAC,YAAY,EAAE,CAAA;gBAClC,CAAC;gBACD,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;oBACnB,KAAK,GAAG,MAAM,KAAK,CAAC,YAAY,EAAE,CAAA;gBACpC,CAAC;YACH,CAAC;YACD,MAAM,OAAO,GAAgB,EAAE,CAAA;YAC/B,IAAI,IAAI;gBAAE,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;YAC5B,OAAO,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAA;YAClC,IAAI,KAAK;gBAAE,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;YAC9B,MAAM,OAAO,GAAG,MAAM,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,EAAE;gBACtD,KAAK,EAAE,QAAQ;aAChB,CAAC,CAAA;YACF,OAAO,CAAC,eAAe,GAAG,IAAI,CAAA;YAC9B,OAAO,OAAO,CAAA;QAChB,CAAC;IACH,CAAC;IAED,kCAAkC;IAClC,KAAK,CAAC,GAAG,CAAC,GAAW;QACnB,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,CAAA;QACpD,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAA;QACvC,IAAI,KAAK,IAAI,KAAK,CAAC,MAAM,EAAE,IAAI,KAAK,CAAC,GAAG,KAAK,GAAG,EAAE,CAAC;YACjD,OAAO,KAAK,CAAC,KAAK,CAAA;QACpB,CAAC;QACD,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,KAAK,GAAG,CAAC,CAAC,CAAA;QAC1C,IAAI,IAAI,IAAI,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC;YAC1B,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;QACtB,CAAC;QACD,OAAO,IAAI,CAAA;IACb,CAAC;IAED,mCAAmC;IACnC,yCAAyC;IACzC,KAAK,CAAC,MAAM,CAAC,GAAW,EAAE,KAAU;QAClC,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,CAAA;QAC3B,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,CAAA;QACpD,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAA;QACvC,IAAI,KAAK,IAAI,KAAK,CAAC,MAAM,EAAE,IAAI,KAAK,CAAC,GAAG,KAAK,GAAG,EAAE,CAAC;YACjD,OAAO,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,IAAI,IAAI,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAA;QACtD,CAAC;QACD,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,KAAK,GAAG,CAAC,CAAC,CAAA;QAC1C,IAAI,IAAI,IAAI,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC;YAC1B,MAAM,WAAW,GAAG,MAAM,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,CAAA;YACjD,OAAO,IAAI,CAAC,WAAW,CAAC,KAAK,GAAG,CAAC,EAAE,WAAW,CAAC,CAAA;QACjD,CAAC;QACD,MAAM,IAAI,KAAK,CAAC,qCAAqC,GAAG,EAAE,CAAC,CAAA;IAC7D,CAAC;IAED,qCAAqC;IACrC,KAAK,CAAC,MAAM,CAAC,GAAW;QACtB,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,CAAA;QAC7C,OAAO,OAAO,CAAC,OAAO,EAAE,CAAA;IAC1B,CAAC;IAED,KAAK,CAAC,aAAa,CAAC,GAAW;QAC7B,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,CAAA;QACpD,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAA;QACvC,oCAAoC;QACpC,IAAI,KAAK,EAAE,MAAM,EAAE,IAAI,KAAK,CAAC,GAAG,KAAK,GAAG,EAAE,CAAC;YACzC,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,KAAK,GAAG,CAAC,CAAC,CAAA;YAC1C,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,KAAK,GAAG,CAAC,CAAC,CAAA;YAC1C,IAAI,IAAI,EAAE,MAAM,EAAE,IAAI,IAAI,EAAE,MAAM,EAAE,EAAE,CAAC;gBACrC,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAA;gBAC3C,OAAO,IAAI,CAAC,OAAO,CAAC;oBAClB,GAAG,CAAC,MAAM,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;oBACnC,MAAM;oBACN,GAAG,CAAC,MAAM,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;iBACjC,CAAC,CAAA;YACJ,CAAC;iBAAM,CAAC;gBACN,OAAO,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAA;YAChC,CAAC;QACH,CAAC;QACD,+BAA+B;QAC/B,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,KAAK,GAAG,CAAC,CAAC,CAAA;QAC1C,IAAI,IAAI,EAAE,MAAM,EAAE,EAAE,CAAC;YACnB,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,CAAA;YAC7C,MAAM,cAAc,GAAG,MAAM,OAAO,CAAC,UAAU,EAAE,CAAA;YACjD,IAAI,cAAc,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBAChC,OAAO,IAAI,CAAC,WAAW,CAAC,KAAK,GAAG,CAAC,CAAC,CAAA;YACpC,CAAC;iBAAM,CAAC;gBACN,OAAO,IAAI,CAAC,WAAW,CAAC,KAAK,GAAG,CAAC,EAAE,OAAO,CAAC,CAAA;YAC7C,CAAC;QACH,CAAC;aAAM,CAAC;YACN,MAAM,IAAI,KAAK,CAAC,qCAAqC,GAAG,EAAE,CAAC,CAAA;QAC7D,CAAC;IACH,CAAC;IAED,oBAAoB;IACpB,sBAAsB;IAEtB,wBAAwB;IACxB,KAAK,CAAC,WAAW,CAAC,KAAa,EAAE,KAAgB;QAC/C,MAAM,MAAM,GAAG;YACb,GAAG,CAAC,MAAM,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;YAC/B,KAAK;YACL,GAAG,CAAC,MAAM,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;SACjC,CAAA;QACD,OAAO,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAA;IAC7B,CAAC;IAED,wBAAwB;IACxB,KAAK,CAAC,WAAW,CAAC,KAAa;QAC7B,MAAM,OAAO,GAAG;YACd,GAAG,CAAC,MAAM,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;YAC/B,GAAG,CAAC,MAAM,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;SACjC,CAAA;QACD,OAAO,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAA;IAC9B,CAAC;IAED,kCAAkC;IAClC,KAAK,CAAC,MAAM,CAAC,KAAgB;QAC3B,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,UAAU,EAAE,CAAA;QACvC,OAAO,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,OAAO,EAAE,KAAK,CAAC,CAAC,CAAA;IAC1C,CAAC;IAED,qCAAqC;IACrC,KAAK,CAAC,OAAO,CAAC,KAAgB;QAC5B,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,UAAU,EAAE,CAAA;QACvC,OAAO,IAAI,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,GAAG,OAAO,CAAC,CAAC,CAAA;IAC1C,CAAC;IAED,yBAAyB;IACzB,KAAK,CAAC,OAAO,CAAC,KAAa;QACzB,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,UAAU,EAAE,CAAA;QACvC,OAAO,OAAO,CAAC,KAAK,CAAC,IAAI,IAAI,CAAA;IAC/B,CAAC;IAED,iDAAiD;IACjD,KAAK,CAAC,KAAK,CACT,KAA0B,EAC1B,GAAwB;QAExB,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,UAAU,EAAE,CAAA;QACvC,OAAO,OAAO,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,CAAA;IAClC,CAAC;IAED,yBAAyB;IACzB,KAAK,CAAC,QAAQ,CAAC,KAAgB,EAAE,KAAa;QAC5C,MAAM,MAAM,GAAG;YACb,GAAG,CAAC,MAAM,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;YAC/B,KAAK;YACL,GAAG,CAAC,MAAM,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;SAC7B,CAAA;QACD,OAAO,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAA;IAC7B,CAAC;IAED,4DAA4D;IAC5D,KAAK,CAAC,gBAAgB,CACpB,KAAa,EACb,IAAgB,EAChB,IAAU,EACV,KAAiB;QAEjB,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAA;QACzC,IAAI,IAAI;YAAE,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QAC3B,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QACjB,IAAI,KAAK;YAAE,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;QAC7B,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;QAC7C,OAAO,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAA;IAC7B,CAAC;IAED,mGAAmG;IACnG,KAAK,CAAC,OAAO;QACX,IAAI,OAAoB,CAAA;QACxB,IAAI,CAAC;YACH,OAAO,GAAG,MAAM,IAAI,CAAC,UAAU,EAAE,CAAA;QACnC,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,IAAI,GAAG,YAAY,iBAAiB,EAAE,CAAC;gBACrC,OAAO,IAAI,CAAA;YACb,CAAC;iBAAM,CAAC;gBACN,MAAM,GAAG,CAAA;YACX,CAAC;QACH,CAAC;QACD,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,IAAI,OAAO,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC;YAChD,OAAO,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAA;QAC7B,CAAC;aAAM,CAAC;YACN,OAAO,IAAI,CAAA;QACb,CAAC;IACH,CAAC;IAED,mBAAmB;IACnB,sBAAsB;IAEtB,mDAAmD;IACnD,KAAK,CAAC,WAAW,CAAC,GAAW;QAC3B,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,CAAA;QACpD,wBAAwB;QACxB,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAA;QAC3C,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAA;QACzC,IAAI,IAAI,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAA;QACvC,IAAI,KAAK,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,CAAA;QAEzC,kDAAkD;QAClD,yCAAyC;QACzC,MAAM,UAAU,GAAG,QAAQ,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;QAChD,IAAI,UAAU,EAAE,MAAM,EAAE,EAAE,CAAC;YACzB,IAAI,GAAG,MAAM,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;YAClD,MAAM,KAAK,GAAG,MAAM,UAAU,CAAC,WAAW,CAAC,GAAG,CAAC,CAAA;YAC/C,IAAI,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;gBACb,IAAI,GAAG,MAAM,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAA;YACpC,CAAC;YACD,IAAI,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;gBACb,KAAK,GAAG,MAAM,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAA;YACvC,CAAC;QACH,CAAC;QAED,OAAO;YACL,CAAC,MAAM,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI;YAClD,CAAC,MAAM,KAAK,CAAC,UAAU,EAAE,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI;SACrD,CAAA;IACH,CAAC;IAED,qGAAqG;IACrG,+BAA+B;IAC/B,KAAK,CAAC,WAAW,CAAC,OAAY;QAC5B,IAAI,CAAC,MAAM,IAAI,CAAC,QAAQ,EAAE,CAAC,KAAK,CAAC,MAAM,OAAO,CAAC,QAAQ,EAAE,CAAC,EAAE,CAAC;YAC3D,MAAM,IAAI,KAAK,CACb,4DAA4D,CAC7D,CAAA;QACH,CAAC;QACD,MAAM,WAAW,GAAG,MAAM,IAAI,CAAC,UAAU,EAAE,CAAA;QAC3C,MAAM,cAAc,GAAG,MAAM,OAAO,CAAC,UAAU,EAAE,CAAA;QACjD,MAAM,UAAU,GAAG,WAAW,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;QACtD,MAAM,YAAY,GAAG,cAAc,CAAC,CAAC,CAAC,CAAA;QACtC,IAAI,UAAU,EAAE,MAAM,EAAE,IAAI,YAAY,EAAE,MAAM,EAAE,EAAE,CAAC;YACnD,MAAM,MAAM,GAAG,MAAM,UAAU,CAAC,WAAW,CAAC,YAAY,CAAC,CAAA;YACzD,OAAO,IAAI,CAAC,OAAO,CAAC;gBAClB,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;gBAC/C,MAAM;gBACN,GAAG,cAAc,CAAC,KAAK,CAAC,CAAC,CAAC;aAC3B,CAAC,CAAA;QACJ,CAAC;aAAM,CAAC;YACN,OAAO,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,WAAW,EAAE,GAAG,cAAc,CAAC,CAAC,CAAA;QAC1D,CAAC;IACH,CAAC;IAED,mBAAmB;IACnB,sBAAsB;IAEtB,KAAK,CAAC,WAAW;QACf,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,QAAQ,EAAE,CAAA;QACnC,OAAO,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,EAAE;YAClC,KAAK,EAAE,KAAK,GAAG,CAAC;SACjB,CAAC,CAAA;IACJ,CAAC;IAED,KAAK,CAAC,YAAY;QAChB,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,QAAQ,EAAE,CAAA;QACnC,MAAM,MAAM,GAAG,MAAM,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,IAAI,CAAC,EAAE;YACpD,KAAK,EAAE,KAAK,GAAG,CAAC;SACjB,CAAC,CAAA;QACF,MAAM,CAAC,eAAe,GAAG,IAAI,CAAA;QAC7B,OAAO,MAAM,CAAA;IACf,CAAC;IAED,2BAA2B;IAC3B,sBAAsB;IAEtB,4EAA4E;IAC5E,KAAK,CAAC,sBAAsB,CAAC,GAAW;QACtC,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,UAAU,EAAE,CAAA;QACvC,MAAM,UAAU,GAAG,OAAO,CAAC,SAAS,CAClC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,MAAM,EAAE,IAAI,KAAK,CAAC,GAAG,IAAI,GAAG,CAC9C,CAAA;QACD,qCAAqC;QACrC,OAAO,UAAU,IAAI,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,CAAA;IACtD,CAAC;IAED,2CAA2C;IAC3C,sBAAsB;IAEtB,8BAA8B;IAE9B,4BAA4B;IAC5B,KAAK,CAAC,CAAC,QAAQ,CAAC,GAAW;QACzB,MAAM,IAAI,CAAA;QACV,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,CAAA;QACpD,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,UAAU,EAAE,CAAA;QACvC,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,CAAA;QAC5B,IAAI,KAAK,IAAI,KAAK,CAAC,MAAM,EAAE,IAAI,KAAK,CAAC,GAAG,KAAK,GAAG,EAAE,CAAC;YACjD,MAAM,KAAK,CAAA;QACb,CAAC;aAAM,CAAC;YACN,MAAM,IAAI,GAAG,OAAO,CAAC,KAAK,GAAG,CAAC,CAAC,CAAA;YAC/B,IAAI,IAAI,EAAE,CAAC;gBACT,IAAI,IAAI,CAAC,MAAM,EAAE,IAAI,IAAI,CAAC,GAAG,KAAK,GAAG,EAAE,CAAC;oBACtC,MAAM,IAAI,CAAA;gBACZ,CAAC;qBAAM,IAAI,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC;oBACzB,KAAK,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAA;gBAC3B,CAAC;YACH,CAAC;QACH,CAAC;QAED,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5C,MAAM,KAAK,GAAG,OAAO,CAAC,CAAC,CAAC,CAAA;YACxB,IAAI,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;gBACnB,MAAM,KAAK,CAAA;YACb,CAAC;iBAAM,CAAC;gBACN,KAAK,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAA;YAC5B,CAAC;QACH,CAAC;IACH,CAAC;IAED,KAAK,CAAC,CAAC,cAAc,CAAC,GAAW;QAC/B,IAAI,KAAK,EAAE,MAAM,IAAI,IAAI,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;YAC5C,IAAI,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC;gBAClB,MAAM,IAAI,CAAA;YACZ,CAAC;QACH,CAAC;IACH,CAAC;IAED,KAAK,CAAC,IAAI,CACR,KAAK,GAAG,MAAM,CAAC,gBAAgB,EAC/B,KAAc,EACd,MAAe;QAEf,MAAM,IAAI,GAAW,EAAE,CAAA;QACvB,IAAI,KAAK,EAAE,MAAM,IAAI,IAAI,IAAI,CAAC,cAAc,CAAC,KAAK,IAAI,EAAE,CAAC,EAAE,CAAC;YAC1D,IAAI,IAAI,CAAC,GAAG,KAAK,KAAK;gBAAE,SAAQ;YAChC,IAAI,IAAI,CAAC,MAAM,IAAI,KAAK;gBAAE,MAAK;YAC/B,IAAI,MAAM,IAAI,IAAI,CAAC,GAAG,IAAI,MAAM;gBAAE,MAAK;YACvC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QACjB,CAAC;QACD,OAAO,IAAI,CAAA;IACb,CAAC;IAED,KAAK,CAAC,cAAc,CAClB,MAAc,EACd,KAAK,GAAG,MAAM,CAAC,gBAAgB;QAE/B,MAAM,IAAI,GAAW,EAAE,CAAA;QACvB,IAAI,KAAK,EAAE,MAAM,IAAI,IAAI,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,EAAE,CAAC;YACrD,IAAI,IAAI,CAAC,MAAM,IAAI,KAAK,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,MAAM,CAAC;gBAAE,MAAK;YAC/D,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QACjB,CAAC;QACD,OAAO,IAAI,CAAA;IACb,CAAC;IAED,sBAAsB;IACtB,sBAAsB;IAEtB,iFAAiF;IACjF,KAAK,CAAC,CAAC,IAAI;QACT,MAAM,IAAI,CAAA;QACV,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,UAAU,EAAE,CAAA;QACvC,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;YAC5B,IAAI,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;gBACnB,IAAI,KAAK,EAAE,MAAM,CAAC,IAAI,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;oBACnC,MAAM,CAAC,CAAA;gBACT,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,MAAM,KAAK,CAAA;YACb,CAAC;QACH,CAAC;IACH,CAAC;IAED,iFAAiF;IACjF,KAAK,CAAC,KAAK;QACT,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,UAAU,EAAE,CAAA;QACvC,IAAI,KAAK,GAAkB,EAAE,CAAA;QAC7B,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;YAC5B,IAAI,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;gBACnB,KAAK,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,CAAA;YACrB,CAAC;YACD,IAAI,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;gBACnB,MAAM,QAAQ,GAAG,MAAM,KAAK,CAAC,KAAK,EAAE,CAAA;gBACpC,KAAK,GAAG,CAAC,GAAG,KAAK,EAAE,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;YAC3D,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAA;IACd,CAAC;IAED,iCAAiC;IACjC,KAAK,CAAC,QAAQ;QACZ,MAAM,KAAK,GAAgB,EAAE,CAAA;QAC7B,IAAI,KAAK,EAAE,MAAM,KAAK,IAAI,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;YACtC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;QACnB,CAAC;QACD,OAAO,KAAK,CAAA;IACd,CAAC;IAED,gCAAgC;IAChC,KAAK,CAAC,OAAO;QACX,MAAM,IAAI,GAAG,IAAI,MAAM,EAAE,CAAA;QACzB,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,UAAU,EAAE,CAAA;QACvC,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;YAC5B,IAAI,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;gBACnB,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,CAAA;YACvB,CAAC;iBAAM,CAAC;gBACN,MAAM,WAAW,GAAG,MAAM,KAAK,CAAC,OAAO,EAAE,CAAA;gBACzC,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC,CAAA;YAC1B,CAAC;QACH,CAAC;QACD,IAAI,CAAC,GAAG,CAAC,MAAM,IAAI,CAAC,UAAU,EAAE,CAAC,CAAA;QACjC,OAAO,IAAI,CAAA;IACb,CAAC;IAED,kCAAkC;IAClC,KAAK,CAAC,MAAM;QACV,MAAM,MAAM,GAAW,EAAE,CAAA;QACzB,IAAI,KAAK,EAAE,MAAM,KAAK,IAAI,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;YACtC,IAAI,KAAK,CAAC,MAAM,EAAE;gBAAE,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;QACxC,CAAC;QACD,OAAO,MAAM,CAAA;IACf,CAAC;IAED,2BAA2B;IAC3B,KAAK,CAAC,SAAS;QACb,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,MAAM,EAAE,CAAA;QAClC,OAAO,MAAM,CAAC,MAAM,CAAA;IACtB,CAAC;IAED,2BAA2B;IAC3B,sBAAsB;IAEtB,kGAAkG;IAClG,KAAK,CAAC,CAAC,aAAa;QAClB,MAAM,IAAI,CAAA;QACV,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,UAAU,EAAE,CAAA;QACvC,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;YAC5B,IAAI,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;gBACnB,IAAI,CAAC;oBACH,IAAI,KAAK,EAAE,MAAM,CAAC,IAAI,KAAK,CAAC,aAAa,EAAE,EAAE,CAAC;wBAC5C,MAAM,CAAC,CAAA;oBACT,CAAC;gBACH,CAAC;gBAAC,OAAO,GAAG,EAAE,CAAC;oBACb,IAAI,GAAG,YAAY,iBAAiB,EAAE,CAAC;wBACrC,SAAQ;oBACV,CAAC;yBAAM,CAAC;wBACN,MAAM,GAAG,CAAA;oBACX,CAAC;gBACH,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,MAAM,KAAK,CAAA;YACb,CAAC;QACH,CAAC;IACH,CAAC;IAED,KAAK,CAAC,eAAe;QACnB,MAAM,MAAM,GAAW,EAAE,CAAA;QACzB,IAAI,KAAK,EAAE,MAAM,KAAK,IAAI,IAAI,CAAC,aAAa,EAAE,EAAE,CAAC;YAC/C,IAAI,KAAK,CAAC,MAAM,EAAE;gBAAE,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;QACxC,CAAC;QACD,OAAO,MAAM,CAAA;IACf,CAAC;IAED,gBAAgB;IAEhB,KAAK,CAAC,CAAC,cAAc;QACnB,MAAM,MAAM,GAAG,IAAI,MAAM,EAAE,CAAA;QAC3B,IAAI,OAAO,GAAG,IAAI,MAAM,EAAE,CAAA;QAC1B,OAAO,CAAC,GAAG,CAAC,MAAM,IAAI,CAAC,UAAU,EAAE,CAAC,CAAA;QACpC,OAAO,OAAO,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC;YAC1B,MAAM,SAAS,GAAG,IAAI,MAAM,EAAE,CAAA;YAC9B,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAA;YAC9D,IAAI,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC/B,MAAM,IAAI,kBAAkB,CAAC,UAAU,EAAE,OAAO,CAAC,OAAO,CAAC,CAAA;YAC3D,CAAC;YACD,KAAK,MAAM,GAAG,IAAI,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC;gBACnC,MAAM,KAAK,GAAG,MAAM,KAAK,CAAC,gBAAgB,CACxC,OAAO,CAAC,MAAM,EACd,GAAG,EACH,WAAW,CACZ,CAAA;gBACD,MAAM,EAAE,GAAG,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,CAAA;gBACjC,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,OAAO,EAAE,KAAK,CAAC,GAAG,CAAC,CAAA;gBAEvE,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;oBAC5B,IAAI,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;wBACnB,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,CAAA;oBACzB,CAAC;yBAAM,CAAC;wBACN,SAAS,CAAC,GAAG,CAAC,MAAM,KAAK,CAAC,UAAU,EAAE,CAAC,CAAA;oBACzC,CAAC;gBACH,CAAC;YACH,CAAC;YACD,OAAO,GAAG,SAAS,CAAA;QACrB,CAAC;QACD,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAA;QAC9D,IAAI,QAAQ,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAChC,MAAM,IAAI,kBAAkB,CAAC,UAAU,EAAE,QAAQ,CAAC,OAAO,CAAC,CAAA;QAC5D,CAAC;QAED,KAAK,MAAM,IAAI,IAAI,QAAQ,CAAC,MAAM,CAAC,OAAO,EAAE,EAAE,CAAC;YAC7C,MAAM,IAAI,CAAA;QACZ,CAAC;IACH,CAAC;IAED,KAAK,CAAC,WAAW,CAAC,GAAW;QAC3B,MAAM,IAAI,GAAU,CAAC,MAAM,IAAI,CAAC,UAAU,EAAE,CAAC,CAAA;QAC7C,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,CAAA;QACpD,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAA;QACvC,IAAI,KAAK,IAAI,KAAK,CAAC,MAAM,EAAE,IAAI,KAAK,CAAC,GAAG,KAAK,GAAG,EAAE,CAAC;YACjD,OAAO,CAAC,GAAG,IAAI,EAAE,KAAK,CAAC,KAAK,CAAC,CAAA;QAC/B,CAAC;QACD,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,KAAK,GAAG,CAAC,CAAC,CAAA;QAC1C,IAAI,IAAI,IAAI,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC;YAC1B,OAAO,CAAC,GAAG,IAAI,EAAE,GAAG,CAAC,MAAM,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;QACpD,CAAC;QACD,OAAO,IAAI,CAAA;IACb,CAAC;IAED,gGAAgG;IAChG,mEAAmE;IACnE,iGAAiG;IACjG,uEAAuE;IACvE,KAAK,CAAC,gBAAgB,CAAC,GAAW;QAChC,MAAM,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC;YAC5C,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC;YACrB,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC;YACzB,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC;SAC3B,CAAC,CAAA;QACF,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAA;IACxC,CAAC;IAED,KAAK,CAAC,WAAW,CAAC,GAAW;QAC3B,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,CAAA;QACpD,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAA;QACvC,IAAI,MAAgB,CAAA;QACpB,IAAI,KAAK,IAAI,KAAK,CAAC,MAAM,EAAE,IAAI,KAAK,CAAC,GAAG,KAAK,GAAG,EAAE,CAAC;YACjD,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAA;QACzB,CAAC;aAAM,CAAC;YACN,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,KAAK,GAAG,CAAC,CAAC,CAAA;YAC1C,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC;gBAC3B,OAAO,IAAI,QAAQ,EAAE,CAAA;YACvB,CAAC;iBAAM,CAAC;gBACN,MAAM,GAAG,MAAM,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAA;YACtC,CAAC;QACH,CAAC;QACD,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC,SAAS,EAAE,CAAA;QACzC,OAAO,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,GAAG,EAAE,UAAU,CAAC,KAAK,CAAC,CAAA;IACrD,CAAC;IAED,KAAK,CAAC,eAAe,CAAC,GAAW;QAC/B,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,CAAA;QACpD,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,KAAK,GAAG,CAAC,CAAC,CAAA;QAC1C,IAAI,MAAgB,CAAA;QACpB,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC;YAC3B,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAA;QACzB,CAAC;aAAM,CAAC;YACN,MAAM,GAAG,MAAM,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,CAAA;QAC1C,CAAC;QACD,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC,SAAS,EAAE,CAAA;QACzC,OAAO,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,GAAG,EAAE,UAAU,CAAC,KAAK,CAAC,CAAA;IACrD,CAAC;IAED,KAAK,CAAC,gBAAgB,CAAC,GAAW;QAChC,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,CAAA;QACpD,IAAI,KAAK,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAA;QACrC,IAAI,CAAC,KAAK,EAAE,CAAC;YACX,KAAK,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,KAAK,GAAG,CAAC,CAAC,CAAA;QACvC,CAAC;QACD,IAAI,MAAgB,CAAA;QACpB,IAAI,CAAC,KAAK,EAAE,CAAC;YACX,gCAAgC;YAChC,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAA;QACzB,CAAC;aAAM,IAAI,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YAC1B,MAAM,GAAG,MAAM,KAAK,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAA;YAC1C,eAAe;QACjB,CAAC;aAAM,CAAC;YACN,MAAM,IAAI,GACR,KAAK,CAAC,GAAG,KAAK,GAAG;gBACf,CAAC,CAAC,MAAM,IAAI,CAAC,OAAO,CAAC,KAAK,GAAG,CAAC,CAAC;gBAC/B,CAAC,CAAC,MAAM,IAAI,CAAC,OAAO,CAAC,KAAK,GAAG,CAAC,CAAC,CAAA;YACnC,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC;gBAC3B,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAA;YACzB,CAAC;iBAAM,CAAC;gBACN,MAAM,GAAG,MAAM,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAA;YAC3C,CAAC;QACH,CAAC;QACD,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC,SAAS,EAAE,CAAA;QACzC,OAAO,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,GAAG,EAAE,UAAU,CAAC,KAAK,CAAC,CAAA;IACrD,CAAC;IAED,0BAA0B;IAC1B,sBAAsB;IAEtB,MAAM;QACJ,OAAO,IAAI,CAAA;IACb,CAAC;IAED,MAAM;QACJ,OAAO,KAAK,CAAA;IACd,CAAC;IAED,KAAK,CAAC,MAAM,CAAC,KAAgB;QAC3B,IAAI,KAAK,CAAC,MAAM,EAAE;YAAE,OAAO,KAAK,CAAA;QAChC,MAAM,WAAW,GAAG,MAAM,IAAI,CAAC,UAAU,EAAE,CAAA;QAC3C,MAAM,YAAY,GAAG,MAAM,KAAK,CAAC,UAAU,EAAE,CAAA;QAC7C,OAAO,WAAW,CAAC,MAAM,CAAC,YAAY,CAAC,CAAA;IACzC,CAAC;CACF;AAED,MAAM,OAAO,IAAI;IACf,YACS,GAAW,EACX,KAAU;QADV,QAAG,GAAH,GAAG,CAAQ;QACX,UAAK,GAAL,KAAK,CAAK;IAChB,CAAC;IAEJ,MAAM;QACJ,OAAO,KAAK,CAAA;IACd,CAAC;IAED,MAAM;QACJ,OAAO,IAAI,CAAA;IACb,CAAC;IAED,MAAM,CAAC,KAAgB;QACrB,IAAI,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YACnB,OAAO,IAAI,CAAC,GAAG,KAAK,KAAK,CAAC,GAAG,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAA;QACjE,CAAC;aAAM,CAAC;YACN,OAAO,KAAK,CAAA;QACd,CAAC;IACH,CAAC;CACF","sourcesContent":["import { z } from 'zod'\nimport { cidForLex, encode } from '@atproto/lex-cbor'\nimport { Cid, cidForCbor } from '@atproto/lex-data'\nimport { BlockMap } from '../block-map.js'\nimport { CidSet } from '../cid-set.js'\nimport { MissingBlockError, MissingBlocksError } from '../error.js'\nimport * as parse from '../parse.js'\nimport { ReadableBlockstore } from '../storage/index.js'\nimport { CarBlock, schema } from '../types.js'\nimport * as util from './util.js'\n\n/**\n * This is an implementation of a Merkle Search Tree (MST)\n * The data structure is described here: https://hal.inria.fr/hal-02303490/document\n * The MST is an ordered, insert-order-independent, deterministic tree.\n * Keys are laid out in alphabetic order.\n * The key insight of an MST is that each key is hashed and starting 0s are counted\n * to determine which layer it falls on (5 zeros for ~32 fanout).\n * This is a merkle tree, so each subtree is referred to by it's hash (Cid).\n * When a leaf is changed, ever tree on the path to that leaf is changed as well,\n * thereby updating the root hash.\n *\n * For atproto, we use SHA-256 as the key hashing algorithm, and ~4 fanout\n * (2-bits of zero per layer).\n */\n\n/**\n * A couple notes on CBOR encoding:\n *\n * There are never two neighboring subtrees.\n * Therefore, we can represent a node as an array of\n * leaves & pointers to their right neighbor (possibly null),\n * along with a pointer to the left-most subtree (also possibly null).\n *\n * Most keys in a subtree will have overlap.\n * We do compression on prefixes by describing keys as:\n * - the length of the prefix that it shares in common with the preceding key\n * - the rest of the string\n *\n * For example:\n * If the first leaf in a tree is `bsky/posts/abcdefg` and the second is `bsky/posts/abcdehi`\n * Then the first will be described as `prefix: 0, key: 'bsky/posts/abcdefg'`,\n * and the second will be described as `prefix: 16, key: 'hi'.`\n */\nconst subTreePointer = z.nullable(schema.cid)\nconst treeEntry = z.object({\n  p: z.number(), // prefix count of ascii chars that this key shares with the prev key\n  k: schema.bytes, // the rest of the key outside the shared prefix\n  v: schema.cid, // value\n  t: subTreePointer, // next subtree (to the right of leaf)\n})\nconst nodeData = z.object({\n  l: subTreePointer, // left-most subtree\n  e: z.array(treeEntry), //entries\n})\nexport type NodeData = z.infer<typeof nodeData>\n\nexport const nodeDataDef = {\n  name: 'mst node',\n  schema: nodeData,\n}\n\nexport type NodeEntry = MST | Leaf\n\nexport type MstOpts = {\n  layer: number\n}\n\nexport class MST {\n  storage: ReadableBlockstore\n  entries: NodeEntry[] | null\n  layer: number | null\n  pointer: Cid\n  outdatedPointer = false\n\n  constructor(\n    storage: ReadableBlockstore,\n    pointer: Cid,\n    entries: NodeEntry[] | null,\n    layer: number | null,\n  ) {\n    this.storage = storage\n    this.entries = entries\n    this.layer = layer\n    this.pointer = pointer\n  }\n\n  static async create(\n    storage: ReadableBlockstore,\n    entries: NodeEntry[] = [],\n    opts?: Partial<MstOpts>,\n  ): Promise<MST> {\n    const pointer = await util.cidForEntries(entries)\n    const { layer = null } = opts || {}\n    return new MST(storage, pointer, entries, layer)\n  }\n\n  static async fromData(\n    storage: ReadableBlockstore,\n    data: NodeData,\n    opts?: Partial<MstOpts>,\n  ): Promise<MST> {\n    const { layer = null } = opts || {}\n    const entries = await util.deserializeNodeData(storage, data, opts)\n    const pointer = await cidForLex(data)\n    return new MST(storage, pointer, entries, layer)\n  }\n\n  // this is really a *lazy* load, doesn't actually touch storage\n  static load(\n    storage: ReadableBlockstore,\n    cid: Cid,\n    opts?: Partial<MstOpts>,\n  ): MST {\n    const { layer = null } = opts || {}\n    return new MST(storage, cid, null, layer)\n  }\n\n  // Immutability\n  // -------------------\n\n  // We never mutate an MST, we just return a new MST with updated values\n  async newTree(entries: NodeEntry[]): Promise<MST> {\n    const mst = new MST(this.storage, this.pointer, entries, this.layer)\n    mst.outdatedPointer = true\n    return mst\n  }\n\n  // Getters (lazy load)\n  // -------------------\n\n  // We don't want to load entries of every subtree, just the ones we need\n  async getEntries(): Promise<NodeEntry[]> {\n    if (this.entries) return [...this.entries]\n    if (this.pointer) {\n      const data = await this.storage.readObj(this.pointer, nodeDataDef)\n      const firstLeaf = data.e[0]\n      const layer =\n        firstLeaf !== undefined\n          ? await util.leadingZerosOnHash(firstLeaf.k)\n          : undefined\n      this.entries = await util.deserializeNodeData(this.storage, data, {\n        layer,\n      })\n\n      return this.entries\n    }\n    throw new Error('No entries or Cid provided')\n  }\n\n  // We don't hash the node on every mutation for performance reasons\n  // Instead we keep track of whether the pointer is outdated and only (recursively) calculate when needed\n  async getPointer(): Promise<Cid> {\n    if (!this.outdatedPointer) return this.pointer\n    const { cid } = await this.serialize()\n    this.pointer = cid\n    this.outdatedPointer = false\n    return this.pointer\n  }\n\n  async serialize(): Promise<{ cid: Cid; bytes: Uint8Array }> {\n    let entries = await this.getEntries()\n    const outdated = entries.filter(\n      (e) => e.isTree() && e.outdatedPointer,\n    ) as MST[]\n    if (outdated.length > 0) {\n      await Promise.all(outdated.map((e) => e.getPointer()))\n      entries = await this.getEntries()\n    }\n    const data = util.serializeNodeData(entries)\n    const bytes = encode(data)\n    const cid = await cidForCbor(bytes)\n    return { cid, bytes }\n  }\n\n  // In most cases, we get the layer of a node from a hint on creation\n  // In the case of the topmost node in the tree, we look for a key in the node & determine the layer\n  // In the case where we don't find one, we recurse down until we do.\n  // If we still can't find one, then we have an empty tree and the node is layer 0\n  async getLayer(): Promise<number> {\n    this.layer = await this.attemptGetLayer()\n    if (this.layer === null) this.layer = 0\n    return this.layer\n  }\n\n  async attemptGetLayer(): Promise<number | null> {\n    if (this.layer !== null) return this.layer\n    const entries = await this.getEntries()\n    let layer = await util.layerForEntries(entries)\n    if (layer === null) {\n      for (const entry of entries) {\n        if (entry.isTree()) {\n          const childLayer = await entry.attemptGetLayer()\n          if (childLayer !== null) {\n            layer = childLayer + 1\n            break\n          }\n        }\n      }\n    }\n    if (layer !== null) this.layer = layer\n    return layer\n  }\n\n  // Core functionality\n  // -------------------\n\n  // Return the necessary blocks to persist the MST to repo storage\n  async getUnstoredBlocks(): Promise<{ root: Cid; blocks: BlockMap }> {\n    const blocks = new BlockMap()\n    const pointer = await this.getPointer()\n    const alreadyHas = await this.storage.has(pointer)\n    if (alreadyHas) return { root: pointer, blocks }\n    const entries = await this.getEntries()\n    const data = util.serializeNodeData(entries)\n    await blocks.add(data)\n    for (const entry of entries) {\n      if (entry.isTree()) {\n        const subtree = await entry.getUnstoredBlocks()\n        blocks.addMap(subtree.blocks)\n      }\n    }\n    return { root: pointer, blocks: blocks }\n  }\n\n  // Adds a new leaf for the given key/value pair\n  // Throws if a leaf with that key already exists\n  async add(key: string, value: Cid, knownZeros?: number): Promise<MST> {\n    util.ensureValidMstKey(key)\n    const keyZeros = knownZeros ?? (await util.leadingZerosOnHash(key))\n    const layer = await this.getLayer()\n    const newLeaf = new Leaf(key, value)\n    if (keyZeros === layer) {\n      // it belongs in this layer\n      const index = await this.findGtOrEqualLeafIndex(key)\n      const found = await this.atIndex(index)\n      if (found?.isLeaf() && found.key === key) {\n        throw new Error(`There is already a value at key: ${key}`)\n      }\n      const prevNode = await this.atIndex(index - 1)\n      if (!prevNode || prevNode.isLeaf()) {\n        // if entry before is a leaf, (or we're on far left) we can just splice in\n        return this.spliceIn(newLeaf, index)\n      } else {\n        // else we try to split the subtree around the key\n        const splitSubTree = await prevNode.splitAround(key)\n        return this.replaceWithSplit(\n          index - 1,\n          splitSubTree[0],\n          newLeaf,\n          splitSubTree[1],\n        )\n      }\n    } else if (keyZeros < layer) {\n      // it belongs on a lower layer\n      const index = await this.findGtOrEqualLeafIndex(key)\n      const prevNode = await this.atIndex(index - 1)\n      if (prevNode && prevNode.isTree()) {\n        // if entry before is a tree, we add it to that tree\n        const newSubtree = await prevNode.add(key, value, keyZeros)\n        return this.updateEntry(index - 1, newSubtree)\n      } else {\n        const subTree = await this.createChild()\n        const newSubTree = await subTree.add(key, value, keyZeros)\n        return this.spliceIn(newSubTree, index)\n      }\n    } else {\n      // it belongs on a higher layer & we must push the rest of the tree down\n      const split = await this.splitAround(key)\n      // if the newly added key has >=2 more leading zeros than the current highest layer\n      // then we need to add in structural nodes in between as well\n      let left: MST | null = split[0]\n      let right: MST | null = split[1]\n      const layer = await this.getLayer()\n      const extraLayersToAdd = keyZeros - layer\n      // intentionally starting at 1, since first layer is taken care of by split\n      for (let i = 1; i < extraLayersToAdd; i++) {\n        if (left !== null) {\n          left = await left.createParent()\n        }\n        if (right !== null) {\n          right = await right.createParent()\n        }\n      }\n      const updated: NodeEntry[] = []\n      if (left) updated.push(left)\n      updated.push(new Leaf(key, value))\n      if (right) updated.push(right)\n      const newRoot = await MST.create(this.storage, updated, {\n        layer: keyZeros,\n      })\n      newRoot.outdatedPointer = true\n      return newRoot\n    }\n  }\n\n  // Gets the value at the given key\n  async get(key: string): Promise<Cid | null> {\n    const index = await this.findGtOrEqualLeafIndex(key)\n    const found = await this.atIndex(index)\n    if (found && found.isLeaf() && found.key === key) {\n      return found.value\n    }\n    const prev = await this.atIndex(index - 1)\n    if (prev && prev.isTree()) {\n      return prev.get(key)\n    }\n    return null\n  }\n\n  // Edits the value at the given key\n  // Throws if the given key does not exist\n  async update(key: string, value: Cid): Promise<MST> {\n    util.ensureValidMstKey(key)\n    const index = await this.findGtOrEqualLeafIndex(key)\n    const found = await this.atIndex(index)\n    if (found && found.isLeaf() && found.key === key) {\n      return this.updateEntry(index, new Leaf(key, value))\n    }\n    const prev = await this.atIndex(index - 1)\n    if (prev && prev.isTree()) {\n      const updatedTree = await prev.update(key, value)\n      return this.updateEntry(index - 1, updatedTree)\n    }\n    throw new Error(`Could not find a record with key: ${key}`)\n  }\n\n  // Deletes the value at the given key\n  async delete(key: string): Promise<MST> {\n    const altered = await this.deleteRecurse(key)\n    return altered.trimTop()\n  }\n\n  async deleteRecurse(key: string): Promise<MST> {\n    const index = await this.findGtOrEqualLeafIndex(key)\n    const found = await this.atIndex(index)\n    // if found, remove it on this level\n    if (found?.isLeaf() && found.key === key) {\n      const prev = await this.atIndex(index - 1)\n      const next = await this.atIndex(index + 1)\n      if (prev?.isTree() && next?.isTree()) {\n        const merged = await prev.appendMerge(next)\n        return this.newTree([\n          ...(await this.slice(0, index - 1)),\n          merged,\n          ...(await this.slice(index + 2)),\n        ])\n      } else {\n        return this.removeEntry(index)\n      }\n    }\n    // else recurse down to find it\n    const prev = await this.atIndex(index - 1)\n    if (prev?.isTree()) {\n      const subtree = await prev.deleteRecurse(key)\n      const subTreeEntries = await subtree.getEntries()\n      if (subTreeEntries.length === 0) {\n        return this.removeEntry(index - 1)\n      } else {\n        return this.updateEntry(index - 1, subtree)\n      }\n    } else {\n      throw new Error(`Could not find a record with key: ${key}`)\n    }\n  }\n\n  // Simple Operations\n  // -------------------\n\n  // update entry in place\n  async updateEntry(index: number, entry: NodeEntry): Promise<MST> {\n    const update = [\n      ...(await this.slice(0, index)),\n      entry,\n      ...(await this.slice(index + 1)),\n    ]\n    return this.newTree(update)\n  }\n\n  // remove entry at index\n  async removeEntry(index: number): Promise<MST> {\n    const updated = [\n      ...(await this.slice(0, index)),\n      ...(await this.slice(index + 1)),\n    ]\n    return this.newTree(updated)\n  }\n\n  // append entry to end of the node\n  async append(entry: NodeEntry): Promise<MST> {\n    const entries = await this.getEntries()\n    return this.newTree([...entries, entry])\n  }\n\n  // prepend entry to start of the node\n  async prepend(entry: NodeEntry): Promise<MST> {\n    const entries = await this.getEntries()\n    return this.newTree([entry, ...entries])\n  }\n\n  // returns entry at index\n  async atIndex(index: number): Promise<NodeEntry | null> {\n    const entries = await this.getEntries()\n    return entries[index] ?? null\n  }\n\n  // returns a slice of the node (like array.slice)\n  async slice(\n    start?: number | undefined,\n    end?: number | undefined,\n  ): Promise<NodeEntry[]> {\n    const entries = await this.getEntries()\n    return entries.slice(start, end)\n  }\n\n  // inserts entry at index\n  async spliceIn(entry: NodeEntry, index: number): Promise<MST> {\n    const update = [\n      ...(await this.slice(0, index)),\n      entry,\n      ...(await this.slice(index)),\n    ]\n    return this.newTree(update)\n  }\n\n  // replaces an entry with [ Maybe(tree), Leaf, Maybe(tree) ]\n  async replaceWithSplit(\n    index: number,\n    left: MST | null,\n    leaf: Leaf,\n    right: MST | null,\n  ): Promise<MST> {\n    const update = await this.slice(0, index)\n    if (left) update.push(left)\n    update.push(leaf)\n    if (right) update.push(right)\n    update.push(...(await this.slice(index + 1)))\n    return this.newTree(update)\n  }\n\n  // if the topmost node in the tree only points to another tree, trim the top and return the subtree\n  async trimTop(): Promise<MST> {\n    let entries: NodeEntry[]\n    try {\n      entries = await this.getEntries()\n    } catch (err) {\n      if (err instanceof MissingBlockError) {\n        return this\n      } else {\n        throw err\n      }\n    }\n    if (entries.length === 1 && entries[0].isTree()) {\n      return entries[0].trimTop()\n    } else {\n      return this\n    }\n  }\n\n  // Subtree & Splits\n  // -------------------\n\n  // Recursively splits a sub tree around a given key\n  async splitAround(key: string): Promise<[MST | null, MST | null]> {\n    const index = await this.findGtOrEqualLeafIndex(key)\n    // split tree around key\n    const leftData = await this.slice(0, index)\n    const rightData = await this.slice(index)\n    let left = await this.newTree(leftData)\n    let right = await this.newTree(rightData)\n\n    // if the far right of the left side is a subtree,\n    // we need to split it on the key as well\n    const lastInLeft = leftData[leftData.length - 1]\n    if (lastInLeft?.isTree()) {\n      left = await left.removeEntry(leftData.length - 1)\n      const split = await lastInLeft.splitAround(key)\n      if (split[0]) {\n        left = await left.append(split[0])\n      }\n      if (split[1]) {\n        right = await right.prepend(split[1])\n      }\n    }\n\n    return [\n      (await left.getEntries()).length > 0 ? left : null,\n      (await right.getEntries()).length > 0 ? right : null,\n    ]\n  }\n\n  // The simple merge case where every key in the right tree is greater than every key in the left tree\n  // (used primarily for deletes)\n  async appendMerge(toMerge: MST): Promise<MST> {\n    if ((await this.getLayer()) !== (await toMerge.getLayer())) {\n      throw new Error(\n        'Trying to merge two nodes from different layers of the MST',\n      )\n    }\n    const thisEntries = await this.getEntries()\n    const toMergeEntries = await toMerge.getEntries()\n    const lastInLeft = thisEntries[thisEntries.length - 1]\n    const firstInRight = toMergeEntries[0]\n    if (lastInLeft?.isTree() && firstInRight?.isTree()) {\n      const merged = await lastInLeft.appendMerge(firstInRight)\n      return this.newTree([\n        ...thisEntries.slice(0, thisEntries.length - 1),\n        merged,\n        ...toMergeEntries.slice(1),\n      ])\n    } else {\n      return this.newTree([...thisEntries, ...toMergeEntries])\n    }\n  }\n\n  // Create relatives\n  // -------------------\n\n  async createChild(): Promise<MST> {\n    const layer = await this.getLayer()\n    return MST.create(this.storage, [], {\n      layer: layer - 1,\n    })\n  }\n\n  async createParent(): Promise<MST> {\n    const layer = await this.getLayer()\n    const parent = await MST.create(this.storage, [this], {\n      layer: layer + 1,\n    })\n    parent.outdatedPointer = true\n    return parent\n  }\n\n  // Finding insertion points\n  // -------------------\n\n  // finds index of first leaf node that is greater than or equal to the value\n  async findGtOrEqualLeafIndex(key: string): Promise<number> {\n    const entries = await this.getEntries()\n    const maybeIndex = entries.findIndex(\n      (entry) => entry.isLeaf() && entry.key >= key,\n    )\n    // if we can't find, we're on the end\n    return maybeIndex >= 0 ? maybeIndex : entries.length\n  }\n\n  // List operations (partial tree traversal)\n  // -------------------\n\n  // @TODO write tests for these\n\n  // Walk tree starting at key\n  async *walkFrom(key: string): AsyncIterable<NodeEntry> {\n    yield this\n    const index = await this.findGtOrEqualLeafIndex(key)\n    const entries = await this.getEntries()\n    const found = entries[index]\n    if (found && found.isLeaf() && found.key === key) {\n      yield found\n    } else {\n      const prev = entries[index - 1]\n      if (prev) {\n        if (prev.isLeaf() && prev.key === key) {\n          yield prev\n        } else if (prev.isTree()) {\n          yield* prev.walkFrom(key)\n        }\n      }\n    }\n\n    for (let i = index; i < entries.length; i++) {\n      const entry = entries[i]\n      if (entry.isLeaf()) {\n        yield entry\n      } else {\n        yield* entry.walkFrom(key)\n      }\n    }\n  }\n\n  async *walkLeavesFrom(key: string): AsyncIterable<Leaf> {\n    for await (const node of this.walkFrom(key)) {\n      if (node.isLeaf()) {\n        yield node\n      }\n    }\n  }\n\n  async list(\n    count = Number.MAX_SAFE_INTEGER,\n    after?: string,\n    before?: string,\n  ): Promise<Leaf[]> {\n    const vals: Leaf[] = []\n    for await (const leaf of this.walkLeavesFrom(after || '')) {\n      if (leaf.key === after) continue\n      if (vals.length >= count) break\n      if (before && leaf.key >= before) break\n      vals.push(leaf)\n    }\n    return vals\n  }\n\n  async listWithPrefix(\n    prefix: string,\n    count = Number.MAX_SAFE_INTEGER,\n  ): Promise<Leaf[]> {\n    const vals: Leaf[] = []\n    for await (const leaf of this.walkLeavesFrom(prefix)) {\n      if (vals.length >= count || !leaf.key.startsWith(prefix)) break\n      vals.push(leaf)\n    }\n    return vals\n  }\n\n  // Full tree traversal\n  // -------------------\n\n  // Walk full tree & emit nodes, consumer can bail at any point by returning false\n  async *walk(): AsyncIterable<NodeEntry> {\n    yield this\n    const entries = await this.getEntries()\n    for (const entry of entries) {\n      if (entry.isTree()) {\n        for await (const e of entry.walk()) {\n          yield e\n        }\n      } else {\n        yield entry\n      }\n    }\n  }\n\n  // Walk full tree & emit nodes, consumer can bail at any point by returning false\n  async paths(): Promise<NodeEntry[][]> {\n    const entries = await this.getEntries()\n    let paths: NodeEntry[][] = []\n    for (const entry of entries) {\n      if (entry.isLeaf()) {\n        paths.push([entry])\n      }\n      if (entry.isTree()) {\n        const subPaths = await entry.paths()\n        paths = [...paths, ...subPaths.map((p) => [entry, ...p])]\n      }\n    }\n    return paths\n  }\n\n  // Walks tree & returns all nodes\n  async allNodes(): Promise<NodeEntry[]> {\n    const nodes: NodeEntry[] = []\n    for await (const entry of this.walk()) {\n      nodes.push(entry)\n    }\n    return nodes\n  }\n\n  // Walks tree & returns all cids\n  async allCids(): Promise<CidSet> {\n    const cids = new CidSet()\n    const entries = await this.getEntries()\n    for (const entry of entries) {\n      if (entry.isLeaf()) {\n        cids.add(entry.value)\n      } else {\n        const subtreeCids = await entry.allCids()\n        cids.addSet(subtreeCids)\n      }\n    }\n    cids.add(await this.getPointer())\n    return cids\n  }\n\n  // Walks tree & returns all leaves\n  async leaves() {\n    const leaves: Leaf[] = []\n    for await (const entry of this.walk()) {\n      if (entry.isLeaf()) leaves.push(entry)\n    }\n    return leaves\n  }\n\n  // Returns total leaf count\n  async leafCount(): Promise<number> {\n    const leaves = await this.leaves()\n    return leaves.length\n  }\n\n  // Reachable tree traversal\n  // -------------------\n\n  // Walk reachable branches of tree & emit nodes, consumer can bail at any point by returning false\n  async *walkReachable(): AsyncIterable<NodeEntry> {\n    yield this\n    const entries = await this.getEntries()\n    for (const entry of entries) {\n      if (entry.isTree()) {\n        try {\n          for await (const e of entry.walkReachable()) {\n            yield e\n          }\n        } catch (err) {\n          if (err instanceof MissingBlockError) {\n            continue\n          } else {\n            throw err\n          }\n        }\n      } else {\n        yield entry\n      }\n    }\n  }\n\n  async reachableLeaves(): Promise<Leaf[]> {\n    const leaves: Leaf[] = []\n    for await (const entry of this.walkReachable()) {\n      if (entry.isLeaf()) leaves.push(entry)\n    }\n    return leaves\n  }\n\n  // Sync Protocol\n\n  async *carBlockStream(): AsyncIterable<CarBlock> {\n    const leaves = new CidSet()\n    let toFetch = new CidSet()\n    toFetch.add(await this.getPointer())\n    while (toFetch.size() > 0) {\n      const nextLayer = new CidSet()\n      const fetched = await this.storage.getBlocks(toFetch.toList())\n      if (fetched.missing.length > 0) {\n        throw new MissingBlocksError('mst node', fetched.missing)\n      }\n      for (const cid of toFetch.toList()) {\n        const found = await parse.getAndParseByDef(\n          fetched.blocks,\n          cid,\n          nodeDataDef,\n        )\n        yield { cid, bytes: found.bytes }\n        const entries = await util.deserializeNodeData(this.storage, found.obj)\n\n        for (const entry of entries) {\n          if (entry.isLeaf()) {\n            leaves.add(entry.value)\n          } else {\n            nextLayer.add(await entry.getPointer())\n          }\n        }\n      }\n      toFetch = nextLayer\n    }\n    const leafData = await this.storage.getBlocks(leaves.toList())\n    if (leafData.missing.length > 0) {\n      throw new MissingBlocksError('mst leaf', leafData.missing)\n    }\n\n    for (const leaf of leafData.blocks.entries()) {\n      yield leaf\n    }\n  }\n\n  async cidsForPath(key: string): Promise<Cid[]> {\n    const cids: Cid[] = [await this.getPointer()]\n    const index = await this.findGtOrEqualLeafIndex(key)\n    const found = await this.atIndex(index)\n    if (found && found.isLeaf() && found.key === key) {\n      return [...cids, found.value]\n    }\n    const prev = await this.atIndex(index - 1)\n    if (prev && prev.isTree()) {\n      return [...cids, ...(await prev.cidsForPath(key))]\n    }\n    return cids\n  }\n\n  // A covering proof is all MST nodes (leaves excluded) needed to prove the value of a given leaf\n  // and its siblings to its immediate right and left (if applicable)\n  // We simply find the immediately preceeding node and then walk from that node until we reach the\n  // first key that is greater than the requested key (the right sibling)\n  async getCoveringProof(key: string): Promise<BlockMap> {\n    const [self, left, right] = await Promise.all([\n      this.proofForKey(key),\n      this.proofForLeftSib(key),\n      this.proofForRightSib(key),\n    ])\n    return self.addMap(left).addMap(right)\n  }\n\n  async proofForKey(key: string): Promise<BlockMap> {\n    const index = await this.findGtOrEqualLeafIndex(key)\n    const found = await this.atIndex(index)\n    let blocks: BlockMap\n    if (found && found.isLeaf() && found.key === key) {\n      blocks = new BlockMap()\n    } else {\n      const prev = await this.atIndex(index - 1)\n      if (!prev || prev.isLeaf()) {\n        return new BlockMap()\n      } else {\n        blocks = await prev.proofForKey(key)\n      }\n    }\n    const serialized = await this.serialize()\n    return blocks.set(serialized.cid, serialized.bytes)\n  }\n\n  async proofForLeftSib(key: string): Promise<BlockMap> {\n    const index = await this.findGtOrEqualLeafIndex(key)\n    const prev = await this.atIndex(index - 1)\n    let blocks: BlockMap\n    if (!prev || prev.isLeaf()) {\n      blocks = new BlockMap()\n    } else {\n      blocks = await prev.proofForLeftSib(key)\n    }\n    const serialized = await this.serialize()\n    return blocks.set(serialized.cid, serialized.bytes)\n  }\n\n  async proofForRightSib(key: string): Promise<BlockMap> {\n    const index = await this.findGtOrEqualLeafIndex(key)\n    let found = await this.atIndex(index)\n    if (!found) {\n      found = await this.atIndex(index - 1)\n    }\n    let blocks: BlockMap\n    if (!found) {\n      // shouldn't ever hit, null case\n      blocks = new BlockMap()\n    } else if (found.isTree()) {\n      blocks = await found.proofForRightSib(key)\n      // recurse down\n    } else {\n      const node =\n        found.key === key\n          ? await this.atIndex(index + 1)\n          : await this.atIndex(index - 1)\n      if (!node || node.isLeaf()) {\n        blocks = new BlockMap()\n      } else {\n        blocks = await node.proofForRightSib(key)\n      }\n    }\n    const serialized = await this.serialize()\n    return blocks.set(serialized.cid, serialized.bytes)\n  }\n\n  // Matching Leaf interface\n  // -------------------\n\n  isTree(): this is MST {\n    return true\n  }\n\n  isLeaf(): this is Leaf {\n    return false\n  }\n\n  async equals(other: NodeEntry): Promise<boolean> {\n    if (other.isLeaf()) return false\n    const thisPointer = await this.getPointer()\n    const otherPointer = await other.getPointer()\n    return thisPointer.equals(otherPointer)\n  }\n}\n\nexport class Leaf {\n  constructor(\n    public key: string,\n    public value: Cid,\n  ) {}\n\n  isTree(): this is MST {\n    return false\n  }\n\n  isLeaf(): this is Leaf {\n    return true\n  }\n\n  equals(entry: NodeEntry): boolean {\n    if (entry.isLeaf()) {\n      return this.key === entry.key && this.value.equals(entry.value)\n    } else {\n      return false\n    }\n  }\n}\n"]}

package/dist/mst/util.d.ts

@@ -1,6 +1,6 @@
 import { Cid } from '@atproto/lex-data';
-import { ReadableBlockstore } from '../storage';
-import { MstOpts, NodeData, NodeEntry } from './mst';
+import { ReadableBlockstore } from '../storage/index.js';
+import { MstOpts, NodeData, NodeEntry } from './mst.js';
 export declare const leadingZerosOnHash: (key: string | Uint8Array) => Promise<number>;
 export declare const layerForEntries: (entries: NodeEntry[]) => Promise<number | null>;
 export declare const deserializeNodeData: (storage: ReadableBlockstore, data: NodeData, opts?: Partial<MstOpts>) => Promise<NodeEntry[]>;

package/dist/mst/util.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"util.d.ts","sourceRoot":"","sources":["../../src/mst/util.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,GAAG,EAAE,MAAM,mBAAmB,CAAA;AACvC,OAAO,EAAE,kBAAkB,EAAE,MAAM,YAAY,CAAA;AAC/C,OAAO,EAAa,OAAO,EAAE,QAAQ,EAAE,SAAS,EAAE,MAAM,OAAO,CAAA;AAkB/D,eAAO,MAAM,kBAAkB,GAAU,KAAK,MAAM,GAAG,UAAU,oBAehE,CAAA;AAED,eAAO,MAAM,eAAe,GAC1B,SAAS,SAAS,EAAE,KACnB,OAAO,CAAC,MAAM,GAAG,IAAI,CAIvB,CAAA;AAED,eAAO,MAAM,mBAAmB,GAC9B,SAAS,kBAAkB,EAC3B,MAAM,QAAQ,EACd,OAAO,OAAO,CAAC,OAAO,CAAC,KACtB,OAAO,CAAC,SAAS,EAAE,CA0BrB,CAAA;AAED,eAAO,MAAM,iBAAiB,GAAI,SAAS,SAAS,EAAE,KAAG,QAmCxD,CAAA;AAED,eAAO,MAAM,cAAc,GAAI,GAAG,MAAM,EAAE,GAAG,MAAM,KAAG,MAQrD,CAAA;AAED,eAAO,MAAM,aAAa,GAAU,SAAS,SAAS,EAAE,KAAG,OAAO,CAAC,GAAG,CAGrE,CAAA;AAED,eAAO,MAAM,aAAa,GAAI,KAAK,MAAM,KAAG,OAU3C,CAAA;AAED,eAAO,MAAM,eAAe,QAAyB,CAAA;AAErD,eAAO,MAAM,YAAY,GAAI,KAAK,MAAM,KAAG,OAE1C,CAAA;AAED,eAAO,MAAM,iBAAiB,GAAI,KAAK,MAAM,SAI5C,CAAA;AAED,qBAAa,kBAAmB,SAAQ,KAAK;IACxB,GAAG,EAAE,MAAM;gBAAX,GAAG,EAAE,MAAM;CAG/B"}
+{"version":3,"file":"util.d.ts","sourceRoot":"","sources":["../../src/mst/util.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,GAAG,EAAE,MAAM,mBAAmB,CAAA;AACvC,OAAO,EAAE,kBAAkB,EAAE,MAAM,qBAAqB,CAAA;AACxD,OAAO,EAAa,OAAO,EAAE,QAAQ,EAAE,SAAS,EAAE,MAAM,UAAU,CAAA;AAkBlE,eAAO,MAAM,kBAAkB,GAAU,KAAK,MAAM,GAAG,UAAU,oBAehE,CAAA;AAED,eAAO,MAAM,eAAe,GAC1B,SAAS,SAAS,EAAE,KACnB,OAAO,CAAC,MAAM,GAAG,IAAI,CAIvB,CAAA;AAED,eAAO,MAAM,mBAAmB,GAC9B,SAAS,kBAAkB,EAC3B,MAAM,QAAQ,EACd,OAAO,OAAO,CAAC,OAAO,CAAC,KACtB,OAAO,CAAC,SAAS,EAAE,CA0BrB,CAAA;AAED,eAAO,MAAM,iBAAiB,GAAI,SAAS,SAAS,EAAE,KAAG,QAmCxD,CAAA;AAED,eAAO,MAAM,cAAc,GAAI,GAAG,MAAM,EAAE,GAAG,MAAM,KAAG,MAQrD,CAAA;AAED,eAAO,MAAM,aAAa,GAAU,SAAS,SAAS,EAAE,KAAG,OAAO,CAAC,GAAG,CAGrE,CAAA;AAED,eAAO,MAAM,aAAa,GAAI,KAAK,MAAM,KAAG,OAU3C,CAAA;AAED,eAAO,MAAM,eAAe,QAAyB,CAAA;AAErD,eAAO,MAAM,YAAY,GAAI,KAAK,MAAM,KAAG,OAE1C,CAAA;AAED,eAAO,MAAM,iBAAiB,GAAI,KAAK,MAAM,SAI5C,CAAA;AAED,qBAAa,kBAAmB,SAAQ,KAAK;IACxB,GAAG,EAAE,MAAM;gBAAX,GAAG,EAAE,MAAM;CAG/B"}