@enbox/dwn-sdk-js 0.0.6 → 0.0.8

package/dist/esm/src/store/data-store-level.js

@@ -1,136 +1,173 @@
-var __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {
-    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }
-    return new (P || (P = Promise))(function (resolve, reject) {
-        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
-        function rejected(value) { try { step(generator["throw"](value)); } catch (e) { reject(e); } }
-        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }
-        step((generator = generator.apply(thisArg, _arguments || [])).next());
-    });
-};
-var __asyncValues = (this && this.__asyncValues) || function (o) {
-    if (!Symbol.asyncIterator) throw new TypeError("Symbol.asyncIterator is not defined.");
-    var m = o[Symbol.asyncIterator], i;
-    return m ? m.call(o) : (o = typeof __values === "function" ? __values(o) : o[Symbol.iterator](), i = {}, verb("next"), verb("throw"), verb("return"), i[Symbol.asyncIterator] = function () { return this; }, i);
-    function verb(n) { i[n] = o[n] && function (v) { return new Promise(function (resolve, reject) { v = o[n](v), settle(resolve, reject, v.done, v.value); }); }; }
-    function settle(resolve, reject, d, v) { Promise.resolve(v).then(function(v) { resolve({ value: v, done: d }); }, reject); }
-};
 import { BlockstoreLevel } from './blockstore-level.js';
 import { createLevelDatabase } from './level-wrapper.js';
 import { DataStream } from '../utils/data-stream.js';
 import { exporter } from 'ipfs-unixfs-exporter';
 import { importer } from 'ipfs-unixfs-importer';
+const textEncoder = new TextEncoder();
+const textDecoder = new TextDecoder();
 /**
  * A simple implementation of {@link DataStore} that works in both the browser and server-side.
  * Leverages LevelDB under the hood.
  *
- * It has the following structure (`+` represents an additional sublevel/partition):
- *   'data' + <tenant> + <recordId> + <dataCid> -> <data>
+ * It has the following sublevel structure (`+` represents an additional sublevel):
+ *   'refs'      + <tenant> + <recordId>  : key <dataCid>  → JSON { dataSize }
+ *   'blocks'    + <dataCid>              : key <blockCid>  → block data (shared)
+ *   'refcounts' : key <dataCid>                            → JSON { count, dataSize }
+ *
+ * Identical data (same dataCid) is stored only once in the blocks sublevel.
+ * Multiple (tenant, recordId) pairs can reference the same blocks.
  */
 export class DataStoreLevel {
+    config;
+    blockstore;
     constructor(config = {}) {
-        this.config = Object.assign({ blockstoreLocation: 'DATASTORE', createLevelDatabase }, config);
+        this.config = {
+            blockstoreLocation: 'DATASTORE',
+            createLevelDatabase,
+            ...config
+        };
         this.blockstore = new BlockstoreLevel({
             location: this.config.blockstoreLocation,
             createLevelDatabase: this.config.createLevelDatabase,
         });
     }
-    open() {
-        return __awaiter(this, void 0, void 0, function* () {
-            yield this.blockstore.open();
-        });
+    async open() {
+        await this.blockstore.open();
     }
-    close() {
-        return __awaiter(this, void 0, void 0, function* () {
-            yield this.blockstore.close();
-        });
+    async close() {
+        await this.blockstore.close();
     }
-    put(tenant, recordId, dataCid, dataStream) {
-        return __awaiter(this, void 0, void 0, function* () {
-            var _a, e_1, _b, _c;
-            var _d, _e;
-            const blockstoreForData = yield this.getBlockstoreForStoringData(tenant, recordId, dataCid);
-            const asyncDataBlocks = importer([{ content: DataStream.asAsyncIterable(dataStream) }], blockstoreForData, { cidVersion: 1 });
-            // NOTE: the last block contains the root CID as well as info to derive the data size
+    async put(tenant, recordId, dataCid, dataStream) {
+        // Check if this exact ref already exists (idempotent re-put).
+        const refsPartition = await this.getRefsPartition(tenant, recordId);
+        const existingRef = await refsPartition.get(dataCid);
+        if (existingRef) {
+            await dataStream.cancel();
+            const { dataSize } = JSON.parse(textDecoder.decode(existingRef));
+            return { dataSize };
+        }
+        // Check refcount — if > 0, blocks already exist for this dataCid.
+        const refcountsPartition = await this.getRefcountsPartition();
+        const rawRefcount = await refcountsPartition.get(dataCid);
+        const refcountData = rawRefcount
+            ? JSON.parse(textDecoder.decode(rawRefcount))
+            : { count: 0, dataSize: 0 };
+        let dataSize;
+        if (refcountData.count > 0) {
+            // Blocks already exist — skip import.
+            await dataStream.cancel();
+            dataSize = refcountData.dataSize;
+        }
+        else {
+            // First write — import blocks into the shared blocks partition.
+            const blocksPartition = await this.getBlocksPartition(dataCid);
+            const asyncDataBlocks = importer([{ content: DataStream.asAsyncIterable(dataStream) }], blocksPartition, { cidVersion: 1 });
+            // NOTE: the last block contains the root CID as well as info to derive the data size.
             let dataDagRoot;
-            try {
-                for (var _f = true, asyncDataBlocks_1 = __asyncValues(asyncDataBlocks), asyncDataBlocks_1_1; asyncDataBlocks_1_1 = yield asyncDataBlocks_1.next(), _a = asyncDataBlocks_1_1.done, !_a; _f = true) {
-                    _c = asyncDataBlocks_1_1.value;
-                    _f = false;
-                    dataDagRoot = _c;
-                    ;
-                }
+            for await (dataDagRoot of asyncDataBlocks) {
+                ;
             }
-            catch (e_1_1) { e_1 = { error: e_1_1 }; }
-            finally {
-                try {
-                    if (!_f && !_a && (_b = asyncDataBlocks_1.return)) yield _b.call(asyncDataBlocks_1);
-                }
-                finally { if (e_1) throw e_1.error; }
-            }
-            return {
-                dataSize: Number((_e = (_d = dataDagRoot.unixfs) === null || _d === void 0 ? void 0 : _d.fileSize()) !== null && _e !== void 0 ? _e : dataDagRoot.size)
-            };
-        });
+            dataSize = Number(dataDagRoot.unixfs?.fileSize() ?? dataDagRoot.size);
+        }
+        // Write ref entry.
+        await refsPartition.put(dataCid, textEncoder.encode(JSON.stringify({ dataSize })));
+        // Increment refcount.
+        await refcountsPartition.put(dataCid, textEncoder.encode(JSON.stringify({
+            count: refcountData.count + 1,
+            dataSize,
+        })));
+        return { dataSize };
     }
-    get(tenant, recordId, dataCid) {
-        return __awaiter(this, void 0, void 0, function* () {
-            const blockstoreForData = yield this.getBlockstoreForStoringData(tenant, recordId, dataCid);
-            const exists = yield blockstoreForData.has(dataCid);
-            if (!exists) {
-                return undefined;
-            }
-            // data is chunked into dag-pb unixfs blocks. re-inflate the chunks.
-            const dataDagRoot = yield exporter(dataCid, blockstoreForData);
-            const contentIterator = dataDagRoot.content();
-            const dataStream = new ReadableStream({
-                pull(controller) {
-                    return __awaiter(this, void 0, void 0, function* () {
-                        const result = yield contentIterator.next();
-                        if (result.done) {
-                            controller.close();
-                        }
-                        else {
-                            controller.enqueue(result.value);
-                        }
-                    });
+    async get(tenant, recordId, dataCid) {
+        // Check ref exists.
+        const refsPartition = await this.getRefsPartition(tenant, recordId);
+        const rawRef = await refsPartition.get(dataCid);
+        if (!rawRef) {
+            return undefined;
+        }
+        const { dataSize } = JSON.parse(textDecoder.decode(rawRef));
+        // Export from the shared blocks partition.
+        const blocksPartition = await this.getBlocksPartition(dataCid);
+        const exists = await blocksPartition.has(dataCid);
+        if (!exists) {
+            return undefined;
+        }
+        // Data is chunked into DAG-PB UnixFS blocks. Re-inflate the chunks.
+        const dataDagRoot = await exporter(dataCid, blocksPartition);
+        const contentIterator = dataDagRoot.content();
+        const dataStream = new ReadableStream({
+            async pull(controller) {
+                const result = await contentIterator.next();
+                if (result.done) {
+                    controller.close();
+                }
+                else {
+                    controller.enqueue(result.value);
                 }
-            });
-            let dataSize = dataDagRoot.size;
-            if (dataDagRoot.type === 'file' || dataDagRoot.type === 'directory') {
-                dataSize = dataDagRoot.unixfs.fileSize();
             }
-            return {
-                dataSize: Number(dataSize),
-                dataStream,
-            };
         });
+        return { dataSize, dataStream };
     }
-    delete(tenant, recordId, dataCid) {
-        return __awaiter(this, void 0, void 0, function* () {
-            const blockstoreForData = yield this.getBlockstoreForStoringData(tenant, recordId, dataCid);
-            yield blockstoreForData.clear();
-        });
+    async delete(tenant, recordId, dataCid) {
+        // Check ref exists.
+        const refsPartition = await this.getRefsPartition(tenant, recordId);
+        const rawRef = await refsPartition.get(dataCid);
+        if (!rawRef) {
+            return;
+        }
+        // Remove ref.
+        await refsPartition.delete(dataCid);
+        // Decrement refcount and GC blocks if this was the last ref.
+        const refcountsPartition = await this.getRefcountsPartition();
+        const rawRefcount = await refcountsPartition.get(dataCid);
+        if (!rawRefcount) {
+            return;
+        }
+        const refcountData = JSON.parse(textDecoder.decode(rawRefcount));
+        const newCount = refcountData.count - 1;
+        if (newCount <= 0) {
+            // Last reference removed — garbage-collect blocks and refcount entry.
+            const blocksPartition = await this.getBlocksPartition(dataCid);
+            await blocksPartition.clear();
+            await refcountsPartition.delete(dataCid);
+        }
+        else {
+            // Other references remain — update the count.
+            await refcountsPartition.put(dataCid, textEncoder.encode(JSON.stringify({
+                count: newCount,
+                dataSize: refcountData.dataSize,
+            })));
+        }
     }
     /**
      * Deletes everything in the store. Mainly used in tests.
      */
-    clear() {
-        return __awaiter(this, void 0, void 0, function* () {
-            yield this.blockstore.clear();
-        });
+    async clear() {
+        await this.blockstore.clear();
     }
     /**
-     * Gets the blockstore used for storing data for the given `tenant -> `recordId` -> `dataCid`.
+     * Gets the refs sublevel for the given tenant and recordId.
+     * Caller uses `dataCid` as the key within the returned partition.
      */
-    getBlockstoreForStoringData(tenant, recordId, dataCid) {
-        return __awaiter(this, void 0, void 0, function* () {
-            const dataPartitionName = 'data';
-            const blockstoreForData = yield this.blockstore.partition(dataPartitionName);
-            const blockstoreOfGivenTenant = yield blockstoreForData.partition(tenant);
-            const blockstoreOfGivenRecordId = yield blockstoreOfGivenTenant.partition(recordId);
-            const blockstoreOfGivenDataCidOfRecordId = yield blockstoreOfGivenRecordId.partition(dataCid);
-            return blockstoreOfGivenDataCidOfRecordId;
-        });
+    async getRefsPartition(tenant, recordId) {
+        const refsRoot = await this.blockstore.db.partition('refs');
+        const tenantPartition = await refsRoot.partition(tenant);
+        return tenantPartition.partition(recordId);
+    }
+    /**
+     * Gets the shared blocks sublevel for the given dataCid.
+     * Used as a Blockstore for ipfs-unixfs-importer/exporter.
+     */
+    async getBlocksPartition(dataCid) {
+        const blocksRoot = await this.blockstore.partition('blocks');
+        return blocksRoot.partition(dataCid);
+    }
+    /**
+     * Gets the refcounts sublevel.
+     * Key: `dataCid` → JSON `{ count, dataSize }`.
+     */
+    async getRefcountsPartition() {
+        return this.blockstore.db.partition('refcounts');
     }
 }
 //# sourceMappingURL=data-store-level.js.map

package/dist/esm/src/store/data-store-level.js.map

@@ -1 +1 @@
-{"version":3,"file":"data-store-level.js","sourceRoot":"","sources":["../../../../src/store/data-store-level.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;AAGA,OAAO,EAAE,eAAe,EAAE,MAAM,uBAAuB,CAAC;AACxD,OAAO,EAAE,mBAAmB,EAAE,MAAM,oBAAoB,CAAC;AACzD,OAAO,EAAE,UAAU,EAAE,MAAM,yBAAyB,CAAC;AACrD,OAAO,EAAE,QAAQ,EAAE,MAAM,sBAAsB,CAAC;AAChD,OAAO,EAAE,QAAQ,EAAE,MAAM,sBAAsB,CAAC;AAEhD;;;;;;GAMG;AACH,MAAM,OAAO,cAAc;IAKzB,YAAY,SAA+B,EAAE;QAC3C,IAAI,CAAC,MAAM,mBACT,kBAAkB,EAAE,WAAW,EAC/B,mBAAmB,IAChB,MAAM,CACV,CAAC;QAEF,IAAI,CAAC,UAAU,GAAG,IAAI,eAAe,CAAC;YACpC,QAAQ,EAAc,IAAI,CAAC,MAAM,CAAC,kBAAmB;YACrD,mBAAmB,EAAG,IAAI,CAAC,MAAM,CAAC,mBAAmB;SACtD,CAAC,CAAC;IACL,CAAC;IAEY,IAAI;;YACf,MAAM,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,CAAC;QAC/B,CAAC;KAAA;IAEK,KAAK;;YACT,MAAM,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC;QAChC,CAAC;KAAA;IAEK,GAAG,CAAC,MAAc,EAAE,QAAgB,EAAE,OAAe,EAAE,UAAsC;;;;YACjG,MAAM,iBAAiB,GAAG,MAAM,IAAI,CAAC,2BAA2B,CAAC,MAAM,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;YAE5F,MAAM,eAAe,GAAG,QAAQ,CAAC,CAAC,EAAE,OAAO,EAAE,UAAU,CAAC,eAAe,CAAC,UAAU,CAAC,EAAE,CAAC,EAAE,iBAAiB,EAAE,EAAE,UAAU,EAAE,CAAC,EAAE,CAAC,CAAC;YAE9H,qFAAqF;YACrF,IAAI,WAA0B,CAAC;;gBAC/B,KAA0B,eAAA,oBAAA,cAAA,eAAe,CAAA,qBAAA,uGAAE,CAAC;oBAAlB,+BAAe;oBAAf,WAAe;oBAA9B,WAAW,KAAA,CAAA;oBAAuB,CAAC;gBAAC,CAAC;;;;;;;;;YAEhD,OAAO;gBACL,QAAQ,EAAE,MAAM,CAAC,MAAA,MAAA,WAAW,CAAC,MAAM,0CAAE,QAAQ,EAAE,mCAAI,WAAW,CAAC,IAAI,CAAC;aACrE,CAAC;QACJ,CAAC;KAAA;IAEY,GAAG,CAAC,MAAc,EAAE,QAAgB,EAAE,OAAe;;YAChE,MAAM,iBAAiB,GAAG,MAAM,IAAI,CAAC,2BAA2B,CAAC,MAAM,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;YAE5F,MAAM,MAAM,GAAG,MAAM,iBAAiB,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YACpD,IAAI,CAAC,MAAM,EAAE,CAAC;gBACZ,OAAO,SAAS,CAAC;YACnB,CAAC;YAED,oEAAoE;YACpE,MAAM,WAAW,GAAG,MAAM,QAAQ,CAAC,OAAO,EAAE,iBAAiB,CAAC,CAAC;YAC/D,MAAM,eAAe,GAAG,WAAW,CAAC,OAAO,EAAE,CAAC;YAE9C,MAAM,UAAU,GAAG,IAAI,cAAc,CAAa;gBAC1C,IAAI,CAAC,UAAU;;wBACnB,MAAM,MAAM,GAAG,MAAM,eAAe,CAAC,IAAI,EAAE,CAAC;wBAC5C,IAAI,MAAM,CAAC,IAAI,EAAE,CAAC;4BAChB,UAAU,CAAC,KAAK,EAAE,CAAC;wBACrB,CAAC;6BAAM,CAAC;4BACN,UAAU,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;wBACnC,CAAC;oBACH,CAAC;iBAAA;aACF,CAAC,CAAC;YAEH,IAAI,QAAQ,GAAG,WAAW,CAAC,IAAI,CAAC;YAEhC,IAAI,WAAW,CAAC,IAAI,KAAK,MAAM,IAAI,WAAW,CAAC,IAAI,KAAK,WAAW,EAAE,CAAC;gBACpE,QAAQ,GAAG,WAAW,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC;YAC3C,CAAC;YAED,OAAO;gBACL,QAAQ,EAAE,MAAM,CAAC,QAAQ,CAAC;gBAC1B,UAAU;aACX,CAAC;QACJ,CAAC;KAAA;IAEY,MAAM,CAAC,MAAc,EAAE,QAAgB,EAAE,OAAe;;YACnE,MAAM,iBAAiB,GAAG,MAAM,IAAI,CAAC,2BAA2B,CAAC,MAAM,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;YAC5F,MAAM,iBAAiB,CAAC,KAAK,EAAE,CAAC;QAClC,CAAC;KAAA;IAED;;OAEG;IACU,KAAK;;YAChB,MAAM,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC;QAChC,CAAC;KAAA;IAED;;OAEG;IACW,2BAA2B,CAAC,MAAc,EAAE,QAAgB,EAAE,OAAe;;YACzF,MAAM,iBAAiB,GAAG,MAAM,CAAC;YACjC,MAAM,iBAAiB,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,iBAAiB,CAAC,CAAC;YAC7E,MAAM,uBAAuB,GAAG,MAAM,iBAAiB,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;YAC1E,MAAM,yBAAyB,GAAG,MAAM,uBAAuB,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;YACpF,MAAM,kCAAkC,GAAG,MAAM,yBAAyB,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;YAC9F,OAAO,kCAAkC,CAAC;QAC5C,CAAC;KAAA;CAEF"}
+{"version":3,"file":"data-store-level.js","sourceRoot":"","sources":["../../../../src/store/data-store-level.ts"],"names":[],"mappings":"AAIA,OAAO,EAAE,eAAe,EAAE,MAAM,uBAAuB,CAAC;AACxD,OAAO,EAAE,mBAAmB,EAAE,MAAM,oBAAoB,CAAC;AACzD,OAAO,EAAE,UAAU,EAAE,MAAM,yBAAyB,CAAC;AACrD,OAAO,EAAE,QAAQ,EAAE,MAAM,sBAAsB,CAAC;AAChD,OAAO,EAAE,QAAQ,EAAE,MAAM,sBAAsB,CAAC;AAEhD,MAAM,WAAW,GAAG,IAAI,WAAW,EAAE,CAAC;AACtC,MAAM,WAAW,GAAG,IAAI,WAAW,EAAE,CAAC;AAEtC;;;;;;;;;;;GAWG;AACH,MAAM,OAAO,cAAc;IACzB,MAAM,CAAuB;IAE7B,UAAU,CAAkB;IAE5B,YAAY,SAA+B,EAAE;QAC3C,IAAI,CAAC,MAAM,GAAG;YACZ,kBAAkB,EAAE,WAAW;YAC/B,mBAAmB;YACnB,GAAG,MAAM;SACV,CAAC;QAEF,IAAI,CAAC,UAAU,GAAG,IAAI,eAAe,CAAC;YACpC,QAAQ,EAAc,IAAI,CAAC,MAAM,CAAC,kBAAmB;YACrD,mBAAmB,EAAG,IAAI,CAAC,MAAM,CAAC,mBAAmB;SACtD,CAAC,CAAC;IACL,CAAC;IAEM,KAAK,CAAC,IAAI;QACf,MAAM,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,CAAC;IAC/B,CAAC;IAED,KAAK,CAAC,KAAK;QACT,MAAM,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC;IAChC,CAAC;IAED,KAAK,CAAC,GAAG,CAAC,MAAc,EAAE,QAAgB,EAAE,OAAe,EAAE,UAAsC;QACjG,8DAA8D;QAC9D,MAAM,aAAa,GAAG,MAAM,IAAI,CAAC,gBAAgB,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;QACpE,MAAM,WAAW,GAAG,MAAM,aAAa,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QACrD,IAAI,WAAW,EAAE,CAAC;YAChB,MAAM,UAAU,CAAC,MAAM,EAAE,CAAC;YAC1B,MAAM,EAAE,QAAQ,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,MAAM,CAAC,WAAW,CAAC,CAAyB,CAAC;YACzF,OAAO,EAAE,QAAQ,EAAE,CAAC;QACtB,CAAC;QAED,kEAAkE;QAClE,MAAM,kBAAkB,GAAG,MAAM,IAAI,CAAC,qBAAqB,EAAE,CAAC;QAC9D,MAAM,WAAW,GAAG,MAAM,kBAAkB,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QAC1D,MAAM,YAAY,GAAG,WAAW;YAC9B,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,MAAM,CAAC,WAAW,CAAC,CAAwC;YACpF,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC;QAE9B,IAAI,QAAgB,CAAC;QAErB,IAAI,YAAY,CAAC,KAAK,GAAG,CAAC,EAAE,CAAC;YAC3B,sCAAsC;YACtC,MAAM,UAAU,CAAC,MAAM,EAAE,CAAC;YAC1B,QAAQ,GAAG,YAAY,CAAC,QAAQ,CAAC;QACnC,CAAC;aAAM,CAAC;YACN,gEAAgE;YAChE,MAAM,eAAe,GAAG,MAAM,IAAI,CAAC,kBAAkB,CAAC,OAAO,CAAC,CAAC;YAC/D,MAAM,eAAe,GAAG,QAAQ,CAC9B,CAAC,EAAE,OAAO,EAAE,UAAU,CAAC,eAAe,CAAC,UAAU,CAAC,EAAE,CAAC,EACrD,eAAe,EACf,EAAE,UAAU,EAAE,CAAC,EAAE,CAClB,CAAC;YAEF,sFAAsF;YACtF,IAAI,WAA0B,CAAC;YAC/B,IAAI,KAAK,EAAE,WAAW,IAAI,eAAe,EAAE,CAAC;gBAAC,CAAC;YAAC,CAAC;YAChD,QAAQ,GAAG,MAAM,CAAC,WAAW,CAAC,MAAM,EAAE,QAAQ,EAAE,IAAI,WAAW,CAAC,IAAI,CAAC,CAAC;QACxE,CAAC;QAED,mBAAmB;QACnB,MAAM,aAAa,CAAC,GAAG,CAAC,OAAO,EAAE,WAAW,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC,CAAC;QAEnF,sBAAsB;QACtB,MAAM,kBAAkB,CAAC,GAAG,CAAC,OAAO,EAAE,WAAW,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC;YACtE,KAAK,EAAE,YAAY,CAAC,KAAK,GAAG,CAAC;YAC7B,QAAQ;SACT,CAAC,CAAC,CAAC,CAAC;QAEL,OAAO,EAAE,QAAQ,EAAE,CAAC;IACtB,CAAC;IAEM,KAAK,CAAC,GAAG,CAAC,MAAc,EAAE,QAAgB,EAAE,OAAe;QAChE,oBAAoB;QACpB,MAAM,aAAa,GAAG,MAAM,IAAI,CAAC,gBAAgB,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;QACpE,MAAM,MAAM,GAAG,MAAM,aAAa,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QAChD,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,OAAO,SAAS,CAAC;QACnB,CAAC;QAED,MAAM,EAAE,QAAQ,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,MAAM,CAAC,MAAM,CAAC,CAAyB,CAAC;QAEpF,2CAA2C;QAC3C,MAAM,eAAe,GAAG,MAAM,IAAI,CAAC,kBAAkB,CAAC,OAAO,CAAC,CAAC;QAC/D,MAAM,MAAM,GAAG,MAAM,eAAe,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QAClD,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,OAAO,SAAS,CAAC;QACnB,CAAC;QAED,oEAAoE;QACpE,MAAM,WAAW,GAAG,MAAM,QAAQ,CAAC,OAAO,EAAE,eAAe,CAAC,CAAC;QAC7D,MAAM,eAAe,GAAG,WAAW,CAAC,OAAO,EAAE,CAAC;QAE9C,MAAM,UAAU,GAAG,IAAI,cAAc,CAAa;YAChD,KAAK,CAAC,IAAI,CAAC,UAAU;gBACnB,MAAM,MAAM,GAAG,MAAM,eAAe,CAAC,IAAI,EAAE,CAAC;gBAC5C,IAAI,MAAM,CAAC,IAAI,EAAE,CAAC;oBAChB,UAAU,CAAC,KAAK,EAAE,CAAC;gBACrB,CAAC;qBAAM,CAAC;oBACN,UAAU,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;gBACnC,CAAC;YACH,CAAC;SACF,CAAC,CAAC;QAEH,OAAO,EAAE,QAAQ,EAAE,UAAU,EAAE,CAAC;IAClC,CAAC;IAEM,KAAK,CAAC,MAAM,CAAC,MAAc,EAAE,QAAgB,EAAE,OAAe;QACnE,oBAAoB;QACpB,MAAM,aAAa,GAAG,MAAM,IAAI,CAAC,gBAAgB,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;QACpE,MAAM,MAAM,GAAG,MAAM,aAAa,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QAChD,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,OAAO;QACT,CAAC;QAED,cAAc;QACd,MAAM,aAAa,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QAEpC,6DAA6D;QAC7D,MAAM,kBAAkB,GAAG,MAAM,IAAI,CAAC,qBAAqB,EAAE,CAAC;QAC9D,MAAM,WAAW,GAAG,MAAM,kBAAkB,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QAC1D,IAAI,CAAC,WAAW,EAAE,CAAC;YACjB,OAAO;QACT,CAAC;QAED,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,MAAM,CAAC,WAAW,CAAC,CAAwC,CAAC;QACxG,MAAM,QAAQ,GAAG,YAAY,CAAC,KAAK,GAAG,CAAC,CAAC;QAExC,IAAI,QAAQ,IAAI,CAAC,EAAE,CAAC;YAClB,sEAAsE;YACtE,MAAM,eAAe,GAAG,MAAM,IAAI,CAAC,kBAAkB,CAAC,OAAO,CAAC,CAAC;YAC/D,MAAM,eAAe,CAAC,KAAK,EAAE,CAAC;YAC9B,MAAM,kBAAkB,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QAC3C,CAAC;aAAM,CAAC;YACN,8CAA8C;YAC9C,MAAM,kBAAkB,CAAC,GAAG,CAAC,OAAO,EAAE,WAAW,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC;gBACtE,KAAK,EAAM,QAAQ;gBACnB,QAAQ,EAAG,YAAY,CAAC,QAAQ;aACjC,CAAC,CAAC,CAAC,CAAC;QACP,CAAC;IACH,CAAC;IAED;;OAEG;IACI,KAAK,CAAC,KAAK;QAChB,MAAM,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC;IAChC,CAAC;IAED;;;OAGG;IACK,KAAK,CAAC,gBAAgB,CAAC,MAAc,EAAE,QAAgB;QAC7D,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;QAC5D,MAAM,eAAe,GAAG,MAAM,QAAQ,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;QACzD,OAAO,eAAe,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;IAC7C,CAAC;IAED;;;OAGG;IACK,KAAK,CAAC,kBAAkB,CAAC,OAAe;QAC9C,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;QAC7D,OAAO,UAAU,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;IACvC,CAAC;IAED;;;OAGG;IACK,KAAK,CAAC,qBAAqB;QACjC,OAAO,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,SAAS,CAAC,WAAW,CAAC,CAAC;IACnD,CAAC;CAEF"}

package/dist/esm/src/store/index-level-compound.js

@@ -0,0 +1,246 @@
+import { FilterUtility } from '../utils/filter.js';
+import { SortDirection } from '../types/query-types.js';
+/** Separator between compound key segments (higher than \x00 so prefix scans work correctly). */
+export const COMPOUND_SEGMENT_SEPARATOR = '\x01';
+/**
+ * Gets the compound index partition for a given compound index definition.
+ * Compound index sublevels use the naming convention `__compound:<name>__`.
+ */
+export async function getCompoundIndexPartition(db, tenant, compoundIndex) {
+    const partitionName = `__compound:${compoundIndex.name}__`;
+    return (await db.partition(tenant)).partition(partitionName);
+}
+/**
+ * Builds a compound index key from the given indexes and compound index definition.
+ *
+ * Key format: `<prop1>\x01<prop2>\x01...\x01<sortValue>\x00<messageCid>`
+ *
+ * @returns the compound key, or undefined if the indexes don't contain all required properties.
+ */
+export function buildCompoundKey(messageCid, indexes, compoundIndex, encodeValue, delimiter) {
+    const segments = [];
+    for (const property of compoundIndex.properties) {
+        const value = indexes[property];
+        if (value === undefined || Array.isArray(value)) {
+            return undefined; // compound indexes don't support array values or missing properties
+        }
+        segments.push(encodeValue(value));
+    }
+    const sortValue = indexes[compoundIndex.sortProperty];
+    if (sortValue === undefined || Array.isArray(sortValue)) {
+        return undefined;
+    }
+    // join prefix segments with \x01, then append sort value and messageCid with the standard delimiters
+    const prefixPart = segments.join(COMPOUND_SEGMENT_SEPARATOR);
+    const sortPart = encodeValue(sortValue);
+    return prefixPart + COMPOUND_SEGMENT_SEPARATOR + sortPart + delimiter + messageCid;
+}
+/**
+ * Builds the prefix portion of a compound key from filter values (without the sort/messageCid suffix).
+ * Used for range scans: all entries with this prefix match the filter.
+ */
+export function buildCompoundPrefix(filter, compoundIndex, encodeValue) {
+    const segments = [];
+    for (const property of compoundIndex.properties) {
+        const filterValue = filter[property];
+        if (filterValue === undefined || typeof filterValue === 'object') {
+            return undefined; // compound prefix only works with equality filters
+        }
+        segments.push(encodeValue(filterValue));
+    }
+    return segments.join(COMPOUND_SEGMENT_SEPARATOR) + COMPOUND_SEGMENT_SEPARATOR;
+}
+/**
+ * Creates a put operation for a compound index entry.
+ * Returns undefined if the indexes don't contain all required compound index properties.
+ */
+export function createCompoundIndexPutOperation(db, tenant, item, compoundIndex, encodeValue, delimiter) {
+    const key = buildCompoundKey(item.messageCid, item.indexes, compoundIndex, encodeValue, delimiter);
+    if (key === undefined) {
+        return undefined;
+    }
+    return createOperationForPartition(db, tenant, `__compound:${compoundIndex.name}__`, {
+        type: 'put',
+        key,
+        value: JSON.stringify(item),
+    });
+}
+/**
+ * Creates a delete operation for a compound index entry.
+ * Returns undefined if the indexes don't contain all required compound index properties.
+ */
+export function createCompoundIndexDeleteOperation(db, tenant, messageCid, indexes, compoundIndex, encodeValue, delimiter) {
+    const key = buildCompoundKey(messageCid, indexes, compoundIndex, encodeValue, delimiter);
+    if (key === undefined) {
+        return undefined;
+    }
+    return createOperationForPartition(db, tenant, `__compound:${compoundIndex.name}__`, {
+        type: 'del',
+        key,
+    });
+}
+/**
+ * Generic helper to create a batch operation for any named partition under a tenant.
+ */
+export async function createOperationForPartition(db, tenant, partitionName, operation) {
+    const tenantPartition = await db.partition(tenant);
+    return tenantPartition.createPartitionOperation(partitionName, operation);
+}
+/**
+ * Selects the best compound index that covers the given filter and sort requirements.
+ *
+ * A compound index "covers" a query when:
+ * 1. Every property in the compound index definition is present in the filter as an equality filter.
+ * 2. The compound index's sort property matches the query's sort property.
+ *
+ * Among multiple matching compound indexes, the one with the most properties is preferred
+ * (more specific = fewer false positives in the prefix scan).
+ */
+export function selectCompoundIndex(filter, queryOptions, compoundIndexes) {
+    let bestMatch;
+    let bestPropertyCount = 0;
+    for (const compoundIndex of compoundIndexes) {
+        // check that the sort property matches
+        if (compoundIndex.sortProperty !== queryOptions.sortProperty) {
+            continue;
+        }
+        // check that all compound properties are present in the filter as equality filters
+        let allPropertiesMatch = true;
+        for (const property of compoundIndex.properties) {
+            const filterValue = filter[property];
+            if (filterValue === undefined || typeof filterValue === 'object') {
+                allPropertiesMatch = false;
+                break;
+            }
+        }
+        if (allPropertiesMatch && compoundIndex.properties.length > bestPropertyCount) {
+            bestMatch = compoundIndex;
+            bestPropertyCount = compoundIndex.properties.length;
+        }
+    }
+    return bestMatch;
+}
+/**
+ * Queries using a compound index. This is the most efficient query strategy: a single LevelDB
+ * range scan that filters, sorts, and paginates all at once.
+ *
+ * The compound key encodes the filter properties as a prefix and the sort property as a suffix,
+ * so iterating over keys with the filter prefix yields results in sort order.
+ *
+ * Any remaining filter properties not covered by the compound index are verified in memory.
+ *
+ * @param queryWithIteratorPagingFallback callback to fall back to iterator paging if compound prefix fails.
+ */
+export async function queryWithCompoundIndex(db, tenant, filter, queryOptions, compoundIndex, encodeValue, delimiter, queryWithIteratorPagingFallback, options) {
+    const { sortDirection = SortDirection.Ascending, cursor, limit } = queryOptions;
+    const prefix = buildCompoundPrefix(filter, compoundIndex, encodeValue);
+    if (prefix === undefined) {
+        // should not happen since selectCompoundIndex already validated, but guard against it
+        return queryWithIteratorPagingFallback(tenant, [filter], queryOptions, options);
+    }
+    const partition = await getCompoundIndexPartition(db, tenant, compoundIndex);
+    // determine the iterator bounds from the prefix
+    const iteratorOptions = {};
+    if (cursor !== undefined) {
+        // build the full compound key for the cursor position
+        const cursorSortEncoded = encodeValue(cursor.value);
+        const cursorKey = prefix + cursorSortEncoded + delimiter + cursor.messageCid;
+        if (sortDirection === SortDirection.Ascending) {
+            iteratorOptions.gt = cursorKey;
+            // upper bound: everything with this prefix (prefix + \xff is past all valid compound keys with this prefix)
+            iteratorOptions.lt = prefix + '\xff';
+        }
+        else {
+            iteratorOptions.lt = cursorKey;
+            iteratorOptions.gt = prefix;
+            iteratorOptions.reverse = true;
+        }
+    }
+    else {
+        if (sortDirection === SortDirection.Ascending) {
+            iteratorOptions.gt = prefix;
+            iteratorOptions.lt = prefix + '\xff';
+        }
+        else {
+            // for descending without cursor, start from the end of the prefix range
+            iteratorOptions.gt = prefix;
+            iteratorOptions.lt = prefix + '\xff';
+            iteratorOptions.reverse = true;
+        }
+    }
+    // determine which filter properties are NOT covered by the compound index
+    // (need in-memory verification for these)
+    // NOTE: the compound index equality properties are fully covered by the prefix scan,
+    // but the sort property is only covered for ordering — any range filter on the sort
+    // property must still be applied as a residual filter.
+    const coveredEqualityProperties = new Set(compoundIndex.properties);
+    const residualFilter = {};
+    let hasResidualFilter = false;
+    for (const property in filter) {
+        if (!coveredEqualityProperties.has(property)) {
+            residualFilter[property] = filter[property];
+            hasResidualFilter = true;
+        }
+    }
+    const matches = [];
+    for await (const [_key, value] of partition.iterator(iteratorOptions, options)) {
+        if (limit !== undefined && matches.length === limit) {
+            break;
+        }
+        const item = JSON.parse(value);
+        // verify any residual filter properties in memory
+        if (hasResidualFilter && !FilterUtility.matchFilter(item.indexes, residualFilter)) {
+            continue;
+        }
+        matches.push(item);
+    }
+    return matches;
+}
+/**
+ * Counts items matching a compound index prefix without loading full records.
+ * Iterates only keys (not values) for maximum efficiency.
+ *
+ * @param queryFallback callback to fall back to full query if compound prefix fails.
+ */
+export async function countWithCompoundIndex(db, tenant, filter, compoundIndex, encodeValue, queryFallback, options) {
+    const prefix = buildCompoundPrefix(filter, compoundIndex, encodeValue);
+    if (prefix === undefined) {
+        // fallback
+        const results = await queryFallback(tenant, [filter], { sortProperty: compoundIndex.sortProperty }, options);
+        return results.length;
+    }
+    const partition = await getCompoundIndexPartition(db, tenant, compoundIndex);
+    // determine which filter properties are NOT covered by the compound index
+    // (same logic as queryWithCompoundIndex: sort property range filters are residual)
+    const coveredEqualityProperties = new Set(compoundIndex.properties);
+    let hasResidualFilter = false;
+    const residualFilter = {};
+    for (const property in filter) {
+        if (!coveredEqualityProperties.has(property)) {
+            residualFilter[property] = filter[property];
+            hasResidualFilter = true;
+        }
+    }
+    const iteratorOptions = {
+        gt: prefix,
+        lt: prefix + '\xff',
+    };
+    let count = 0;
+    if (hasResidualFilter) {
+        // must read values to check residual filter
+        for await (const [_key, value] of partition.iterator(iteratorOptions, options)) {
+            const item = JSON.parse(value);
+            if (FilterUtility.matchFilter(item.indexes, residualFilter)) {
+                count++;
+            }
+        }
+    }
+    else {
+        // no residual filter — iterate keys via iterator without parsing values
+        for await (const [_key, _value] of partition.iterator(iteratorOptions, options)) {
+            count++;
+        }
+    }
+    return count;
+}
+//# sourceMappingURL=index-level-compound.js.map

package/dist/esm/src/store/index-level-compound.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index-level-compound.js","sourceRoot":"","sources":["../../../../src/store/index-level-compound.ts"],"names":[],"mappings":"AAOA,OAAO,EAAE,aAAa,EAAE,MAAM,oBAAoB,CAAC;AACnD,OAAO,EAAE,aAAa,EAAE,MAAM,yBAAyB,CAAC;AAExD,iGAAiG;AACjG,MAAM,CAAC,MAAM,0BAA0B,GAAG,MAAM,CAAC;AAEjD;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,yBAAyB,CAC7C,EAAwB,EAAE,MAAc,EAAE,aAAsC;IAEhF,MAAM,aAAa,GAAG,cAAc,aAAa,CAAC,IAAI,IAAI,CAAC;IAC3D,OAAO,CAAC,MAAM,EAAE,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC,aAAa,CAAC,CAAC;AAC/D,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,gBAAgB,CAC9B,UAAkB,EAAE,OAAkB,EAAE,aAAsC,EAC9E,WAAyD,EAAE,SAAiB;IAE5E,MAAM,QAAQ,GAAa,EAAE,CAAC;IAE9B,KAAK,MAAM,QAAQ,IAAI,aAAa,CAAC,UAAU,EAAE,CAAC;QAChD,MAAM,KAAK,GAAG,OAAO,CAAC,QAAQ,CAAC,CAAC;QAChC,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;YAChD,OAAO,SAAS,CAAC,CAAC,oEAAoE;QACxF,CAAC;QACD,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC;IACpC,CAAC;IAED,MAAM,SAAS,GAAG,OAAO,CAAC,aAAa,CAAC,YAAY,CAAC,CAAC;IACtD,IAAI,SAAS,KAAK,SAAS,IAAI,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE,CAAC;QACxD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,qGAAqG;IACrG,MAAM,UAAU,GAAG,QAAQ,CAAC,IAAI,CAAC,0BAA0B,CAAC,CAAC;IAC7D,MAAM,QAAQ,GAAG,WAAW,CAAC,SAAS,CAAC,CAAC;IACxC,OAAO,UAAU,GAAG,0BAA0B,GAAG,QAAQ,GAAG,SAAS,GAAG,UAAU,CAAC;AACrF,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,mBAAmB,CACjC,MAAc,EAAE,aAAsC,EACtD,WAAyD;IAEzD,MAAM,QAAQ,GAAa,EAAE,CAAC;IAE9B,KAAK,MAAM,QAAQ,IAAI,aAAa,CAAC,UAAU,EAAE,CAAC;QAChD,MAAM,WAAW,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC;QACrC,IAAI,WAAW,KAAK,SAAS,IAAI,OAAO,WAAW,KAAK,QAAQ,EAAE,CAAC;YACjE,OAAO,SAAS,CAAC,CAAC,mDAAmD;QACvE,CAAC;QACD,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,WAAW,CAAC,CAAC,CAAC;IAC1C,CAAC;IAED,OAAO,QAAQ,CAAC,IAAI,CAAC,0BAA0B,CAAC,GAAG,0BAA0B,CAAC;AAChF,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,+BAA+B,CAC7C,EAAwB,EAAE,MAAc,EAAE,IAAiB,EAAE,aAAsC,EACnG,WAAyD,EAAE,SAAiB;IAE5E,MAAM,GAAG,GAAG,gBAAgB,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,OAAO,EAAE,aAAa,EAAE,WAAW,EAAE,SAAS,CAAC,CAAC;IACnG,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;QACtB,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,OAAO,2BAA2B,CAAC,EAAE,EAAE,MAAM,EAAE,cAAc,aAAa,CAAC,IAAI,IAAI,EAAE;QACnF,IAAI,EAAI,KAAK;QACb,GAAG;QACH,KAAK,EAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC;KAC7B,CAAC,CAAC;AACL,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,kCAAkC,CAChD,EAAwB,EAAE,MAAc,EAAE,UAAkB,EAAE,OAAkB,EAChF,aAAsC,EACtC,WAAyD,EAAE,SAAiB;IAE5E,MAAM,GAAG,GAAG,gBAAgB,CAAC,UAAU,EAAE,OAAO,EAAE,aAAa,EAAE,WAAW,EAAE,SAAS,CAAC,CAAC;IACzF,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;QACtB,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,OAAO,2BAA2B,CAAC,EAAE,EAAE,MAAM,EAAE,cAAc,aAAa,CAAC,IAAI,IAAI,EAAE;QACnF,IAAI,EAAE,KAAK;QACX,GAAG;KACJ,CAAC,CAAC;AACL,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,2BAA2B,CAC/C,EAAwB,EAAE,MAAc,EAAE,aAAqB,EAAE,SAA6C;IAE9G,MAAM,eAAe,GAAG,MAAM,EAAE,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;IACnD,OAAO,eAAe,CAAC,wBAAwB,CAAC,aAAa,EAAE,SAAS,CAAC,CAAC;AAC5E,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,mBAAmB,CACjC,MAAc,EAAE,YAA0B,EAAE,eAA0C;IAEtF,IAAI,SAA8C,CAAC;IACnD,IAAI,iBAAiB,GAAG,CAAC,CAAC;IAE1B,KAAK,MAAM,aAAa,IAAI,eAAe,EAAE,CAAC;QAC5C,uCAAuC;QACvC,IAAI,aAAa,CAAC,YAAY,KAAK,YAAY,CAAC,YAAY,EAAE,CAAC;YAC7D,SAAS;QACX,CAAC;QAED,mFAAmF;QACnF,IAAI,kBAAkB,GAAG,IAAI,CAAC;QAC9B,KAAK,MAAM,QAAQ,IAAI,aAAa,CAAC,UAAU,EAAE,CAAC;YAChD,MAAM,WAAW,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC;YACrC,IAAI,WAAW,KAAK,SAAS,IAAI,OAAO,WAAW,KAAK,QAAQ,EAAE,CAAC;gBACjE,kBAAkB,GAAG,KAAK,CAAC;gBAC3B,MAAM;YACR,CAAC;QACH,CAAC;QAED,IAAI,kBAAkB,IAAI,aAAa,CAAC,UAAU,CAAC,MAAM,GAAG,iBAAiB,EAAE,CAAC;YAC9E,SAAS,GAAG,aAAa,CAAC;YAC1B,iBAAiB,GAAG,aAAa,CAAC,UAAU,CAAC,MAAM,CAAC;QACtD,CAAC;IACH,CAAC;IAED,OAAO,SAAS,CAAC;AACnB,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,CAAC,KAAK,UAAU,sBAAsB,CAC1C,EAAwB,EACxB,MAAc,EACd,MAAc,EACd,YAA0B,EAC1B,aAAsC,EACtC,WAAyD,EACzD,SAAiB,EACjB,+BAE2B,EAC3B,OAA2B;IAE3B,MAAM,EAAE,aAAa,GAAG,aAAa,CAAC,SAAS,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,YAAY,CAAC;IAEhF,MAAM,MAAM,GAAG,mBAAmB,CAAC,MAAM,EAAE,aAAa,EAAE,WAAW,CAAC,CAAC;IACvE,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;QACzB,sFAAsF;QACtF,OAAO,+BAA+B,CAAC,MAAM,EAAE,CAAC,MAAM,CAAC,EAAE,YAAY,EAAE,OAAO,CAAC,CAAC;IAClF,CAAC;IAED,MAAM,SAAS,GAAG,MAAM,yBAAyB,CAAC,EAAE,EAAE,MAAM,EAAE,aAAa,CAAC,CAAC;IAE7E,gDAAgD;IAChD,MAAM,eAAe,GAAwC,EAAE,CAAC;IAEhE,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;QACzB,sDAAsD;QACtD,MAAM,iBAAiB,GAAG,WAAW,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACpD,MAAM,SAAS,GAAG,MAAM,GAAG,iBAAiB,GAAG,SAAS,GAAG,MAAM,CAAC,UAAU,CAAC;QAE7E,IAAI,aAAa,KAAK,aAAa,CAAC,SAAS,EAAE,CAAC;YAC9C,eAAe,CAAC,EAAE,GAAG,SAAS,CAAC;YAC/B,4GAA4G;YAC5G,eAAe,CAAC,EAAE,GAAG,MAAM,GAAG,MAAM,CAAC;QACvC,CAAC;aAAM,CAAC;YACN,eAAe,CAAC,EAAE,GAAG,SAAS,CAAC;YAC/B,eAAe,CAAC,EAAE,GAAG,MAAM,CAAC;YAC5B,eAAe,CAAC,OAAO,GAAG,IAAI,CAAC;QACjC,CAAC;IACH,CAAC;SAAM,CAAC;QACN,IAAI,aAAa,KAAK,aAAa,CAAC,SAAS,EAAE,CAAC;YAC9C,eAAe,CAAC,EAAE,GAAG,MAAM,CAAC;YAC5B,eAAe,CAAC,EAAE,GAAG,MAAM,GAAG,MAAM,CAAC;QACvC,CAAC;aAAM,CAAC;YACN,wEAAwE;YACxE,eAAe,CAAC,EAAE,GAAG,MAAM,CAAC;YAC5B,eAAe,CAAC,EAAE,GAAG,MAAM,GAAG,MAAM,CAAC;YACrC,eAAe,CAAC,OAAO,GAAG,IAAI,CAAC;QACjC,CAAC;IACH,CAAC;IAED,0EAA0E;IAC1E,0CAA0C;IAC1C,qFAAqF;IACrF,oFAAoF;IACpF,uDAAuD;IACvD,MAAM,yBAAyB,GAAG,IAAI,GAAG,CAAC,aAAa,CAAC,UAAU,CAAC,CAAC;IACpE,MAAM,cAAc,GAAW,EAAE,CAAC;IAClC,IAAI,iBAAiB,GAAG,KAAK,CAAC;IAC9B,KAAK,MAAM,QAAQ,IAAI,MAAM,EAAE,CAAC;QAC9B,IAAI,CAAC,yBAAyB,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;YAC7C,cAAc,CAAC,QAAQ,CAAC,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC;YAC5C,iBAAiB,GAAG,IAAI,CAAC;QAC3B,CAAC;IACH,CAAC;IAED,MAAM,OAAO,GAAkB,EAAE,CAAC;IAClC,IAAI,KAAK,EAAE,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,SAAS,CAAC,QAAQ,CAAC,eAAe,EAAE,OAAO,CAAC,EAAE,CAAC;QAC/E,IAAI,KAAK,KAAK,SAAS,IAAI,OAAO,CAAC,MAAM,KAAK,KAAK,EAAE,CAAC;YACpD,MAAM;QACR,CAAC;QAED,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAgB,CAAC;QAE9C,kDAAkD;QAClD,IAAI,iBAAiB,IAAI,CAAC,aAAa,CAAC,WAAW,CAAC,IAAI,CAAC,OAAO,EAAE,cAAc,CAAC,EAAE,CAAC;YAClF,SAAS;QACX,CAAC;QAED,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrB,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;;;;GAKG;AACH,MAAM,CAAC,KAAK,UAAU,sBAAsB,CAC1C,EAAwB,EACxB,MAAc,EACd,MAAc,EACd,aAAsC,EACtC,WAAyD,EACzD,aAAqI,EACrI,OAA2B;IAE3B,MAAM,MAAM,GAAG,mBAAmB,CAAC,MAAM,EAAE,aAAa,EAAE,WAAW,CAAC,CAAC;IACvE,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;QACzB,WAAW;QACX,MAAM,OAAO,GAAG,MAAM,aAAa,CAAC,MAAM,EAAE,CAAC,MAAM,CAAC,EAAE,EAAE,YAAY,EAAE,aAAa,CAAC,YAAY,EAAE,EAAE,OAAO,CAAC,CAAC;QAC7G,OAAO,OAAO,CAAC,MAAM,CAAC;IACxB,CAAC;IAED,MAAM,SAAS,GAAG,MAAM,yBAAyB,CAAC,EAAE,EAAE,MAAM,EAAE,aAAa,CAAC,CAAC;IAE7E,0EAA0E;IAC1E,mFAAmF;IACnF,MAAM,yBAAyB,GAAG,IAAI,GAAG,CAAC,aAAa,CAAC,UAAU,CAAC,CAAC;IACpE,IAAI,iBAAiB,GAAG,KAAK,CAAC;IAC9B,MAAM,cAAc,GAAW,EAAE,CAAC;IAClC,KAAK,MAAM,QAAQ,IAAI,MAAM,EAAE,CAAC;QAC9B,IAAI,CAAC,yBAAyB,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;YAC7C,cAAc,CAAC,QAAQ,CAAC,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC;YAC5C,iBAAiB,GAAG,IAAI,CAAC;QAC3B,CAAC;IACH,CAAC;IAED,MAAM,eAAe,GAAwC;QAC3D,EAAE,EAAG,MAAM;QACX,EAAE,EAAG,MAAM,GAAG,MAAM;KACrB,CAAC;IAEF,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,iBAAiB,EAAE,CAAC;QACtB,4CAA4C;QAC5C,IAAI,KAAK,EAAE,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,SAAS,CAAC,QAAQ,CAAC,eAAe,EAAE,OAAO,CAAC,EAAE,CAAC;YAC/E,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAgB,CAAC;YAC9C,IAAI,aAAa,CAAC,WAAW,CAAC,IAAI,CAAC,OAAO,EAAE,cAAc,CAAC,EAAE,CAAC;gBAC5D,KAAK,EAAE,CAAC;YACV,CAAC;QACH,CAAC;IACH,CAAC;SAAM,CAAC;QACN,wEAAwE;QACxE,IAAI,KAAK,EAAE,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,SAAS,CAAC,QAAQ,CAAC,eAAe,EAAE,OAAO,CAAC,EAAE,CAAC;YAChF,KAAK,EAAE,CAAC;QACV,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC"}