@fluidframework/driver-utils 2.0.0-internal.3.4.2 → 2.0.0-internal.4.0.1

package/dist/blobAggregationStorage.js

@@ -1,327 +0,0 @@
-"use strict";
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.BlobAggregationStorage = exports.SnapshotExtractor = void 0;
-const protocol_definitions_1 = require("@fluidframework/protocol-definitions");
-const common_utils_1 = require("@fluidframework/common-utils");
-const telemetry_utils_1 = require("@fluidframework/telemetry-utils");
-/*
- * Work around for bufferToString having a bug - it can't consume IsoBuffer!
- * To be removed once bufferToString is fixed!
- */
-function bufferToString2(blob, encoding) {
-    if (blob instanceof Uint8Array) {
-        // IsoBuffer does not have ctor, so it's not in proto chain :(
-        return (0, common_utils_1.Uint8ArrayToString)(blob, encoding);
-    }
-    return (0, common_utils_1.bufferToString)(blob, encoding);
-}
-/**
- * Class responsible for aggregating smaller blobs into one and unpacking it later on.
- */
-class BlobAggregator {
-    constructor() {
-        this.content = [];
-    }
-    addBlob(key, content) {
-        this.content.push([key, content]);
-    }
-    getAggregatedBlobContent() {
-        if (this.content.length === 0) {
-            return undefined;
-        }
-        return JSON.stringify(this.content);
-    }
-    static load(input) {
-        const data = bufferToString2(input, "utf-8");
-        return JSON.parse(data);
-    }
-}
-/**
- * Base class that deals with unpacking snapshots (in place) containing aggregated blobs
- * It relies on abstract methods for reads and storing unpacked blobs.
- *
- * @deprecated This class was introduced experimentally and is no longer used.
- */
-class SnapshotExtractor {
-    constructor() {
-        this.aggregatedBlobName = "__big";
-        this.virtualIdPrefix = "__";
-        // counter for generation of virtual storage IDs
-        this.virtualIdCounter = 0;
-    }
-    getNextVirtualId() {
-        return `${this.virtualIdPrefix}${++this.virtualIdCounter}`;
-    }
-    async unpackSnapshotCore(snapshot, level = 0) {
-        for (const key of Object.keys(snapshot.trees)) {
-            const obj = snapshot.trees[key];
-            await this.unpackSnapshotCore(obj, level + 1);
-        }
-        // For future proof, we will support multiple aggregated blobs with any name
-        // that starts with this.aggregatedBlobName
-        for (const key of Object.keys(snapshot.blobs)) {
-            if (!key.startsWith(this.aggregatedBlobName)) {
-                continue;
-            }
-            const blobId = snapshot.blobs[key];
-            if (blobId !== undefined) {
-                const blob = await this.getBlob(blobId, snapshot);
-                for (const [path, value] of BlobAggregator.load(blob)) {
-                    const id = this.getNextVirtualId();
-                    this.setBlob(id, snapshot, value);
-                    const pathSplit = path.split("/");
-                    let subTree = snapshot;
-                    for (const subPath of pathSplit.slice(0, pathSplit.length - 1)) {
-                        if (subTree.trees[subPath] === undefined) {
-                            subTree.trees[subPath] = { blobs: {}, trees: {} };
-                        }
-                        subTree = subTree.trees[subPath];
-                    }
-                    const blobName = pathSplit[pathSplit.length - 1];
-                    (0, common_utils_1.assert)(subTree.blobs[blobName] === undefined, 0x0f6 /* "real blob ID exists" */);
-                    subTree.blobs[blobName] = id;
-                }
-                // eslint-disable-next-line @typescript-eslint/no-dynamic-delete
-                delete snapshot.blobs[this.aggregatedBlobName];
-            }
-        }
-    }
-}
-exports.SnapshotExtractor = SnapshotExtractor;
-/*
- * Snapshot extractor class that works in place, i.e. patches snapshot that has
- * blob content in ISnapshotTree.blobs itself, not in storage.
- * As result, it implements reading and writing of blobs to/from snapshot itself.
- * It follows existing pattern that mixes concerns - ISnapshotTree.blobs is used for two
- * purposes:
- * 1. map path name to blob ID
- * 2. map blob ID to blob content
- * #2 is what storage (IDocumentStorageService) is for, but in places where we do not have it
- * (like loading serialized earlier draft content), blob content is put directly into snapshot.
- * Ideally this should be fixed by using BlobCacheStorageService or something similar and
- * fixing existing flows to allow switching of storage.
- */
-class SnapshotExtractorInPlace extends SnapshotExtractor {
-    async getBlob(id, tree) {
-        const blob = tree.blobs[id];
-        (0, common_utils_1.assert)(blob !== undefined, 0x0f7 /* "aggregate blob missing" */);
-        return (0, common_utils_1.stringToBuffer)(blob, "base64");
-    }
-    setBlob(id, tree, content) {
-        (0, common_utils_1.assert)(tree.blobs[id] === undefined, 0x0f8 /* "blob from aggregate blob exists on its own" */);
-        tree.blobs[id] = (0, common_utils_1.fromUtf8ToBase64)(content);
-    }
-}
-/**
- * Snapshot packer and extractor.
- * When summary is written it will find and aggregate small blobs into bigger blobs
- * When snapshot is read, it will unpack aggregated blobs and provide them transparently to caller.
- *
- * @deprecated This class was introduced experimentally and is no longer used.
- */
-class BlobAggregationStorage extends SnapshotExtractor {
-    constructor(storage, logger, allowPacking, packingLevel, blobCutOffSize) {
-        super();
-        this.storage = storage;
-        this.logger = logger;
-        this.allowPacking = allowPacking;
-        this.packingLevel = packingLevel;
-        this.blobCutOffSize = blobCutOffSize;
-        this.loadedFromSummary = false;
-        this.virtualBlobs = new Map();
-    }
-    static wrap(storage, logger, allowPacking, packingLevel = 2) {
-        var _a, _b, _c;
-        if (storage instanceof BlobAggregationStorage) {
-            return storage;
-        }
-        const mc = (0, telemetry_utils_1.loggerToMonitoringContext)(logger);
-        const realAllowPackaging = (_b = (_a = mc.config.getBoolean("FluidAggregateBlobs")) !== null && _a !== void 0 ? _a : allowPacking) !== null && _b !== void 0 ? _b : false;
-        // Always create BlobAggregationStorage even if storage is not asking for packing.
-        // This is mostly to avoid cases where future changes in policy would result in inability to
-        // load old files that were created with aggregation on.
-        const minBlobSize = (_c = storage.policies) === null || _c === void 0 ? void 0 : _c.minBlobSize;
-        return new BlobAggregationStorage(storage, logger, realAllowPackaging, packingLevel, minBlobSize);
-    }
-    static async unpackSnapshot(snapshot) {
-        const converter = new SnapshotExtractorInPlace();
-        await converter.unpackSnapshotCore(snapshot);
-    }
-    get policies() {
-        const policies = this.storage.policies;
-        if (policies) {
-            return Object.assign(Object.assign({}, policies), { minBlobSize: undefined });
-        }
-    }
-    async unpackSnapshot(snapshot) {
-        // SummarizerNodeWithGC.refreshLatestSummary can call it when this.loadedFromSummary === false
-        // (I assumed after file was created)
-        // assert(!this.loadedFromSummary, "unpack without summary");
-        this.loadedFromSummary = true;
-        await this.unpackSnapshotCore(snapshot);
-    }
-    setBlob(id, tree, content) {
-        this.virtualBlobs.set(id, (0, common_utils_1.stringToBuffer)(content, "utf-8"));
-    }
-    async getBlob(id, tree) {
-        return this.readBlob(id).catch((error) => {
-            this.logger.sendErrorEvent({ eventName: "BlobDedupNoAggregateBlob" }, error);
-            throw error;
-        });
-    }
-    get repositoryUrl() {
-        return this.storage.repositoryUrl;
-    }
-    async getVersions(versionId, count, scenarioName, fetchSource) {
-        return this.storage.getVersions(versionId, count, scenarioName, fetchSource);
-    }
-    async downloadSummary(handle) {
-        throw new Error("NYI");
-    }
-    // for now we are not optimizing these blobs, with assumption that this API is used only
-    // for big blobs (images)
-    async createBlob(file) {
-        return this.storage.createBlob(file);
-    }
-    async getSnapshotTree(version) {
-        const tree = await this.storage.getSnapshotTree(version);
-        if (tree) {
-            await this.unpackSnapshot(tree);
-        }
-        return tree;
-    }
-    async readBlob(id) {
-        if (this.isRealStorageId(id)) {
-            return this.storage.readBlob(id);
-        }
-        // We support only reading blobs from the summary we loaded from.
-        // This may need to be extended to any general summary in the future as runtime usage pattern
-        // of storage changes (for example, data stores start to load from recent summary, not from original
-        // summary whole container loaded from)
-        // are there other ways we can get here? createFile is one flow, but we should not be reading blobs
-        // in such flow
-        (0, common_utils_1.assert)(this.loadedFromSummary, 0x0f9 /* "never read summary" */);
-        const blob = this.virtualBlobs.get(id);
-        (0, common_utils_1.assert)(blob !== undefined, 0x0fa /* "virtual blob not found" */);
-        return blob;
-    }
-    async uploadSummaryWithContext(summary, context) {
-        const summaryNew = this.allowPacking ? await this.compressSmallBlobs(summary) : summary;
-        return this.storage.uploadSummaryWithContext(summaryNew, context);
-    }
-    // For simplification, we assume that
-    // - blob aggregation is done at data store level only for now
-    // - data store either reuses previous summary, or generates full summary, i.e. there is no partial (some DDS)
-    // summary produced by data stores.
-    // These simplifications allow us not to touch handles, as they are self-contained (either do not use aggregated
-    // blob or contain aggregated blob that stays relevant for that sub-tree)
-    // Note:
-    // From perf perspective, it makes sense to place aggregated blobs one level up in the tree to not create extra
-    // tree nodes (i.e. have shallow tree with less edges). But that creates problems with reusability of trees at
-    // incremental summary time - we would need to understand handles and parse them. In current design we can skip
-    // that step because if data store is reused, the whole sub-tree is reused including aggregated blob embedded into it
-    // and that means we can do nothing and be correct!
-    async compressSmallBlobs(summary, path = "", level = 0, aggregatorArg) {
-        if (this.blobCutOffSize === undefined || this.blobCutOffSize < 0) {
-            return summary;
-        }
-        let shouldCompress = false;
-        let aggregator = aggregatorArg;
-        // checking if this is a dataStore tree, since we only pack at data store level
-        if (Object.keys(summary.tree).includes(".component")) {
-            (0, common_utils_1.assert)(aggregator === undefined, 0x0fb /* "logic err with aggregator" */);
-            (0, common_utils_1.assert)(level === this.packingLevel, 0x23b /* "we are not packing at the right level" */);
-            aggregator = new BlobAggregator();
-            shouldCompress = true;
-        }
-        else {
-            (0, common_utils_1.assert)(level !== this.packingLevel, 0x23c /* "we are not packing at the right level" */);
-        }
-        const newSummary = Object.assign({}, summary);
-        newSummary.tree = Object.assign({}, newSummary.tree);
-        for (const key of Object.keys(summary.tree)) {
-            const obj = summary.tree[key];
-            // Get path relative to root of data store (where we do aggregation)
-            const newPath = shouldCompress ? key : `${path}/${key}`;
-            switch (obj.type) {
-                case protocol_definitions_1.SummaryType.Tree:
-                    // If client created empty tree, keep it as is
-                    // Also do not package search blobs - they are part of storage contract
-                    if (Object.keys(obj).length !== 0 && key !== "__search") {
-                        const tree = await this.compressSmallBlobs(obj, newPath, level + 1, aggregator);
-                        newSummary.tree[key] = tree;
-                        if (Object.keys(obj).length === 0) {
-                            // eslint-disable-next-line @typescript-eslint/no-dynamic-delete
-                            delete newSummary.tree[key];
-                        }
-                    }
-                    break;
-                case protocol_definitions_1.SummaryType.Blob:
-                    if (aggregator &&
-                        typeof obj.content == "string" &&
-                        obj.content.length < this.blobCutOffSize) {
-                        aggregator.addBlob(newPath, obj.content);
-                        // eslint-disable-next-line @typescript-eslint/no-dynamic-delete
-                        delete newSummary.tree[key];
-                    }
-                    break;
-                case protocol_definitions_1.SummaryType.Handle: {
-                    // Would be nice to:
-                    // Trees: expand the tree
-                    // Blobs: parse handle and ensure it points to real blob, not virtual blob.
-                    // We can avoid it for now given data store is the granularity of incremental summaries.
-                    let handlePath = obj.handle;
-                    if (handlePath.startsWith("/")) {
-                        handlePath = handlePath.substr(1);
-                    }
-                    // Ensure only whole data stores can be reused, no reusing at deeper level!
-                    (0, common_utils_1.assert)(level === 0, 0x0fc /* "tree reuse at lower level" */);
-                    (0, common_utils_1.assert)(!handlePath.includes("/"), 0x0fd /* "data stores are writing incremental summaries!" */);
-                    break;
-                }
-                case protocol_definitions_1.SummaryType.Attachment:
-                    (0, common_utils_1.assert)(this.isRealStorageId(obj.id), 0x0fe /* "attachment is aggregate blob" */);
-                    break;
-                default:
-                    (0, common_utils_1.unreachableCase)(obj, `Unknown type: ${obj.type}`);
-            }
-        }
-        (0, common_utils_1.assert)(newSummary.tree[this.aggregatedBlobName] === undefined, 0x0ff /* "duplicate aggregate blob" */);
-        if (shouldCompress) {
-            // Note: It would be great to add code here to unpack aggregate blob back to normal blobs
-            // If only one blob made it into aggregate. Currently that does not happen as we always have
-            // at least one .component blob and at least one DDS that has .attributes blob, so it's not an issue.
-            // But it's possible that in future that would be great addition!
-            // Good news - it's backward compatible change.
-            (0, common_utils_1.assert)(aggregator !== undefined, 0x100 /* "logic error" */);
-            const content = aggregator.getAggregatedBlobContent();
-            if (content !== undefined) {
-                newSummary.tree[this.aggregatedBlobName] = {
-                    type: protocol_definitions_1.SummaryType.Blob,
-                    content,
-                };
-            }
-        }
-        return newSummary;
-    }
-    isRealStorageId(id) {
-        return !id.startsWith(this.virtualIdPrefix);
-    }
-}
-exports.BlobAggregationStorage = BlobAggregationStorage;
-// Tells data store if it can use incremental summary (i.e. reuse DDSes from previous summary
-// when only one DDS changed).
-// The answer has to be know long before we enable actual packing. The reason for the is the following:
-// A the moment when we enable packing, we should assume that all clients out there wil already have bits
-// that can unpack properly (i.e. enough time passed since we deployed bits that can unpack)
-// But we can still have clients where some of them already pack, and some do not. If one summary was
-// using packing, then it relies on non-incremental summaries going forward, even if next client who
-// produced summary is not packing!
-// This can have slight improvement by enabling it per file (based on "did summary we loaded from contain
-// aggregated blobs"), but that's harder to make reliable, so going for simplicity.
-BlobAggregationStorage.fullDataStoreSummaries = true;
-//# sourceMappingURL=blobAggregationStorage.js.map

package/dist/blobAggregationStorage.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"blobAggregationStorage.js","sourceRoot":"","sources":["../src/blobAggregationStorage.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAQH,+EAO8C;AAC9C,+DAOsC;AAEtC,qEAA4E;AAE5E;;;GAGG;AACH,SAAS,eAAe,CAAC,IAAqB,EAAE,QAA4B;IAC3E,IAAI,IAAI,YAAY,UAAU,EAAE;QAC/B,8DAA8D;QAC9D,OAAO,IAAA,iCAAkB,EAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;KAC1C;IACD,OAAO,IAAA,6BAAc,EAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;AACvC,CAAC;AAED;;GAEG;AACH,MAAM,cAAc;IAApB;QACkB,YAAO,GAAuB,EAAE,CAAC;IAiBnD,CAAC;IAfO,OAAO,CAAC,GAAW,EAAE,OAAe;QAC1C,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC,CAAC;IACnC,CAAC;IAEM,wBAAwB;QAC9B,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE;YAC9B,OAAO,SAAS,CAAC;SACjB;QACD,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACrC,CAAC;IAED,MAAM,CAAC,IAAI,CAAC,KAAsB;QACjC,MAAM,IAAI,GAAG,eAAe,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;QAC7C,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAuB,CAAC;IAC/C,CAAC;CACD;AAED;;;;;GAKG;AACH,MAAsB,iBAAiB;IAAvC;QACoB,uBAAkB,GAAG,OAAO,CAAC;QAC7B,oBAAe,GAAG,IAAI,CAAC;QAE1C,gDAAgD;QACtC,qBAAgB,GAAG,CAAC,CAAC;IA8ChC,CAAC;IA7CU,gBAAgB;QACzB,OAAO,GAAG,IAAI,CAAC,eAAe,GAAG,EAAE,IAAI,CAAC,gBAAgB,EAAE,CAAC;IAC5D,CAAC;IAKM,KAAK,CAAC,kBAAkB,CAAC,QAAuB,EAAE,KAAK,GAAG,CAAC;QACjE,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE;YAC9C,MAAM,GAAG,GAAG,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;YAChC,MAAM,IAAI,CAAC,kBAAkB,CAAC,GAAG,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;SAC9C;QAED,4EAA4E;QAC5E,2CAA2C;QAC3C,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE;YAC9C,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,kBAAkB,CAAC,EAAE;gBAC7C,SAAS;aACT;YACD,MAAM,MAAM,GAAG,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;YACnC,IAAI,MAAM,KAAK,SAAS,EAAE;gBACzB,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;gBAClD,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;oBACtD,MAAM,EAAE,GAAG,IAAI,CAAC,gBAAgB,EAAE,CAAC;oBACnC,IAAI,CAAC,OAAO,CAAC,EAAE,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC;oBAClC,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;oBAClC,IAAI,OAAO,GAAG,QAAQ,CAAC;oBACvB,KAAK,MAAM,OAAO,IAAI,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE;wBAC/D,IAAI,OAAO,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,SAAS,EAAE;4BACzC,OAAO,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC;yBAClD;wBACD,OAAO,GAAG,OAAO,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;qBACjC;oBACD,MAAM,QAAQ,GAAG,SAAS,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;oBACjD,IAAA,qBAAM,EACL,OAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,KAAK,SAAS,EACrC,KAAK,CAAC,2BAA2B,CACjC,CAAC;oBACF,OAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,GAAG,EAAE,CAAC;iBAC7B;gBACD,gEAAgE;gBAChE,OAAO,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAC;aAC/C;SACD;IACF,CAAC;CACD;AAnDD,8CAmDC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,wBAAyB,SAAQ,iBAAiB;IAChD,KAAK,CAAC,OAAO,CAAC,EAAU,EAAE,IAAmB;QACnD,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QAC5B,IAAA,qBAAM,EAAC,IAAI,KAAK,SAAS,EAAE,KAAK,CAAC,8BAA8B,CAAC,CAAC;QACjE,OAAO,IAAA,6BAAc,EAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;IACvC,CAAC;IAEM,OAAO,CAAC,EAAU,EAAE,IAAmB,EAAE,OAAe;QAC9D,IAAA,qBAAM,EACL,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,SAAS,EAC5B,KAAK,CAAC,kDAAkD,CACxD,CAAC;QACF,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,GAAG,IAAA,+BAAgB,EAAC,OAAO,CAAC,CAAC;IAC5C,CAAC;CACD;AAED;;;;;;GAMG;AACH,MAAa,sBAAuB,SAAQ,iBAAiB;IAgE5D,YACkB,OAAgC,EAChC,MAAwB,EACxB,YAAqB,EACrB,YAAoB,EACpB,cAAuB;QAExC,KAAK,EAAE,CAAC;QANS,YAAO,GAAP,OAAO,CAAyB;QAChC,WAAM,GAAN,MAAM,CAAkB;QACxB,iBAAY,GAAZ,YAAY,CAAS;QACrB,iBAAY,GAAZ,YAAY,CAAQ;QACpB,mBAAc,GAAd,cAAc,CAAS;QAxD/B,sBAAiB,GAAG,KAAK,CAAC;QAE1B,iBAAY,GAAG,IAAI,GAAG,EAA2B,CAAC;IAyD5D,CAAC;IAvDD,MAAM,CAAC,IAAI,CACV,OAAgC,EAChC,MAAwB,EACxB,YAAsB,EACtB,YAAY,GAAG,CAAC;;QAEhB,IAAI,OAAO,YAAY,sBAAsB,EAAE;YAC9C,OAAO,OAAO,CAAC;SACf;QACD,MAAM,EAAE,GAAG,IAAA,2CAAyB,EAAC,MAAM,CAAC,CAAC;QAC7C,MAAM,kBAAkB,GACvB,MAAA,MAAA,EAAE,CAAC,MAAM,CAAC,UAAU,CAAC,qBAAqB,CAAC,mCAAI,YAAY,mCAAI,KAAK,CAAC;QAEtE,kFAAkF;QAClF,4FAA4F;QAC5F,wDAAwD;QACxD,MAAM,WAAW,GAAG,MAAA,OAAO,CAAC,QAAQ,0CAAE,WAAW,CAAC;QAClD,OAAO,IAAI,sBAAsB,CAChC,OAAO,EACP,MAAM,EACN,kBAAkB,EAClB,YAAY,EACZ,WAAW,CACX,CAAC;IACH,CAAC;IAED,MAAM,CAAC,KAAK,CAAC,cAAc,CAAC,QAAuB;QAClD,MAAM,SAAS,GAAG,IAAI,wBAAwB,EAAE,CAAC;QACjD,MAAM,SAAS,CAAC,kBAAkB,CAAC,QAAQ,CAAC,CAAC;IAC9C,CAAC;IAED,IAAW,QAAQ;QAClB,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC;QACvC,IAAI,QAAQ,EAAE;YACb,uCAAY,QAAQ,KAAE,WAAW,EAAE,SAAS,IAAG;SAC/C;IACF,CAAC;IAEM,KAAK,CAAC,cAAc,CAAC,QAAuB;QAClD,8FAA8F;QAC9F,qCAAqC;QACrC,6DAA6D;QAE7D,IAAI,CAAC,iBAAiB,GAAG,IAAI,CAAC;QAC9B,MAAM,IAAI,CAAC,kBAAkB,CAAC,QAAQ,CAAC,CAAC;IACzC,CAAC;IAYM,OAAO,CAAC,EAAU,EAAE,IAAmB,EAAE,OAAe;QAC9D,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,EAAE,EAAE,IAAA,6BAAc,EAAC,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC;IAC7D,CAAC;IAEM,KAAK,CAAC,OAAO,CAAC,EAAU,EAAE,IAAmB;QACnD,OAAO,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,EAAE;YACxC,IAAI,CAAC,MAAM,CAAC,cAAc,CAAC,EAAE,SAAS,EAAE,0BAA0B,EAAE,EAAE,KAAK,CAAC,CAAC;YAC7E,MAAM,KAAK,CAAC;QACb,CAAC,CAAC,CAAC;IACJ,CAAC;IAED,IAAW,aAAa;QACvB,OAAO,IAAI,CAAC,OAAO,CAAC,aAAa,CAAC;IACnC,CAAC;IACM,KAAK,CAAC,WAAW,CACvB,SAAwB,EACxB,KAAa,EACb,YAAqB,EACrB,WAAyB;QAEzB,OAAO,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,SAAS,EAAE,KAAK,EAAE,YAAY,EAAE,WAAW,CAAC,CAAC;IAC9E,CAAC;IAEM,KAAK,CAAC,eAAe,CAAC,MAAsB;QAClD,MAAM,IAAI,KAAK,CAAC,KAAK,CAAC,CAAC;IACxB,CAAC;IAED,wFAAwF;IACxF,yBAAyB;IAClB,KAAK,CAAC,UAAU,CAAC,IAAqB;QAC5C,OAAO,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;IACtC,CAAC;IAEM,KAAK,CAAC,eAAe,CAAC,OAAkB;QAC9C,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,eAAe,CAAC,OAAO,CAAC,CAAC;QACzD,IAAI,IAAI,EAAE;YACT,MAAM,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC;SAChC;QACD,OAAO,IAAI,CAAC;IACb,CAAC;IAEM,KAAK,CAAC,QAAQ,CAAC,EAAU;QAC/B,IAAI,IAAI,CAAC,eAAe,CAAC,EAAE,CAAC,EAAE;YAC7B,OAAO,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;SACjC;QACD,iEAAiE;QACjE,6FAA6F;QAC7F,oGAAoG;QACpG,uCAAuC;QAEvC,mGAAmG;QACnG,eAAe;QACf,IAAA,qBAAM,EAAC,IAAI,CAAC,iBAAiB,EAAE,KAAK,CAAC,0BAA0B,CAAC,CAAC;QACjE,MAAM,IAAI,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACvC,IAAA,qBAAM,EAAC,IAAI,KAAK,SAAS,EAAE,KAAK,CAAC,8BAA8B,CAAC,CAAC;QACjE,OAAO,IAAI,CAAC;IACb,CAAC;IAEM,KAAK,CAAC,wBAAwB,CACpC,OAAqB,EACrB,OAAwB;QAExB,MAAM,UAAU,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,kBAAkB,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC;QACxF,OAAO,IAAI,CAAC,OAAO,CAAC,wBAAwB,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC;IACnE,CAAC;IAED,qCAAqC;IACrC,8DAA8D;IAC9D,8GAA8G;IAC9G,mCAAmC;IACnC,gHAAgH;IAChH,yEAAyE;IACzE,QAAQ;IACR,+GAA+G;IAC/G,8GAA8G;IAC9G,+GAA+G;IAC/G,qHAAqH;IACrH,mDAAmD;IAC3C,KAAK,CAAC,kBAAkB,CAC/B,OAAqB,EACrB,IAAI,GAAG,EAAE,EACT,KAAK,GAAG,CAAC,EACT,aAA8B;QAE9B,IAAI,IAAI,CAAC,cAAc,KAAK,SAAS,IAAI,IAAI,CAAC,cAAc,GAAG,CAAC,EAAE;YACjE,OAAO,OAAO,CAAC;SACf;QAED,IAAI,cAAc,GAAY,KAAK,CAAC;QAEpC,IAAI,UAAU,GAAG,aAAa,CAAC;QAC/B,+EAA+E;QAC/E,IAAI,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,YAAY,CAAC,EAAE;YACrD,IAAA,qBAAM,EAAC,UAAU,KAAK,SAAS,EAAE,KAAK,CAAC,iCAAiC,CAAC,CAAC;YAC1E,IAAA,qBAAM,EACL,KAAK,KAAK,IAAI,CAAC,YAAY,EAC3B,KAAK,CAAC,6CAA6C,CACnD,CAAC;YACF,UAAU,GAAG,IAAI,cAAc,EAAE,CAAC;YAClC,cAAc,GAAG,IAAI,CAAC;SACtB;aAAM;YACN,IAAA,qBAAM,EACL,KAAK,KAAK,IAAI,CAAC,YAAY,EAC3B,KAAK,CAAC,6CAA6C,CACnD,CAAC;SACF;QAED,MAAM,UAAU,qBAAsB,OAAO,CAAE,CAAC;QAChD,UAAU,CAAC,IAAI,qBAAQ,UAAU,CAAC,IAAI,CAAE,CAAC;QACzC,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;YAC5C,MAAM,GAAG,GAAG,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAC9B,oEAAoE;YACpE,MAAM,OAAO,GAAG,cAAc,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,IAAI,GAAG,EAAE,CAAC;YACxD,QAAQ,GAAG,CAAC,IAAI,EAAE;gBACjB,KAAK,kCAAW,CAAC,IAAI;oBACpB,8CAA8C;oBAC9C,uEAAuE;oBACvE,IAAI,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,KAAK,CAAC,IAAI,GAAG,KAAK,UAAU,EAAE;wBACxD,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,kBAAkB,CACzC,GAAG,EACH,OAAO,EACP,KAAK,GAAG,CAAC,EACT,UAAU,CACV,CAAC;wBACF,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC;wBAC5B,IAAI,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,KAAK,CAAC,EAAE;4BAClC,gEAAgE;4BAChE,OAAO,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;yBAC5B;qBACD;oBACD,MAAM;gBACP,KAAK,kCAAW,CAAC,IAAI;oBACpB,IACC,UAAU;wBACV,OAAO,GAAG,CAAC,OAAO,IAAI,QAAQ;wBAC9B,GAAG,CAAC,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC,cAAc,EACvC;wBACD,UAAU,CAAC,OAAO,CAAC,OAAO,EAAE,GAAG,CAAC,OAAO,CAAC,CAAC;wBACzC,gEAAgE;wBAChE,OAAO,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;qBAC5B;oBACD,MAAM;gBACP,KAAK,kCAAW,CAAC,MAAM,CAAC,CAAC;oBACxB,oBAAoB;oBACpB,yBAAyB;oBACzB,2EAA2E;oBAC3E,wFAAwF;oBACxF,IAAI,UAAU,GAAG,GAAG,CAAC,MAAM,CAAC;oBAC5B,IAAI,UAAU,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE;wBAC/B,UAAU,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;qBAClC;oBACD,2EAA2E;oBAC3E,IAAA,qBAAM,EAAC,KAAK,KAAK,CAAC,EAAE,KAAK,CAAC,iCAAiC,CAAC,CAAC;oBAC7D,IAAA,qBAAM,EACL,CAAC,UAAU,CAAC,QAAQ,CAAC,GAAG,CAAC,EACzB,KAAK,CAAC,sDAAsD,CAC5D,CAAC;oBACF,MAAM;iBACN;gBACD,KAAK,kCAAW,CAAC,UAAU;oBAC1B,IAAA,qBAAM,EACL,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,EAAE,CAAC,EAC5B,KAAK,CAAC,oCAAoC,CAC1C,CAAC;oBACF,MAAM;gBACP;oBACC,IAAA,8BAAe,EAAC,GAAG,EAAE,iBAAkB,GAAW,CAAC,IAAI,EAAE,CAAC,CAAC;aAC5D;SACD;QAED,IAAA,qBAAM,EACL,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,KAAK,SAAS,EACtD,KAAK,CAAC,gCAAgC,CACtC,CAAC;QACF,IAAI,cAAc,EAAE;YACnB,yFAAyF;YACzF,4FAA4F;YAC5F,qGAAqG;YACrG,iEAAiE;YACjE,+CAA+C;YAC/C,IAAA,qBAAM,EAAC,UAAU,KAAK,SAAS,EAAE,KAAK,CAAC,mBAAmB,CAAC,CAAC;YAC5D,MAAM,OAAO,GAAG,UAAU,CAAC,wBAAwB,EAAE,CAAC;YACtD,IAAI,OAAO,KAAK,SAAS,EAAE;gBAC1B,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,GAAG;oBAC1C,IAAI,EAAE,kCAAW,CAAC,IAAI;oBACtB,OAAO;iBACP,CAAC;aACF;SACD;QACD,OAAO,UAAU,CAAC;IACnB,CAAC;IAES,eAAe,CAAC,EAAU;QACnC,OAAO,CAAC,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;IAC7C,CAAC;;AA5QF,wDA6QC;AA5QA,6FAA6F;AAC7F,8BAA8B;AAC9B,uGAAuG;AACvG,yGAAyG;AACzG,4FAA4F;AAC5F,qGAAqG;AACrG,oGAAoG;AACpG,mCAAmC;AACnC,yGAAyG;AACzG,mFAAmF;AACnE,6CAAsB,GAAG,IAAI,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport {\n\tFetchSource,\n\tIDocumentStorageService,\n\tIDocumentStorageServicePolicies,\n\tISummaryContext,\n} from \"@fluidframework/driver-definitions\";\nimport {\n\tICreateBlobResponse,\n\tISnapshotTree,\n\tISummaryHandle,\n\tISummaryTree,\n\tIVersion,\n\tSummaryType,\n} from \"@fluidframework/protocol-definitions\";\nimport {\n\tassert,\n\tbufferToString,\n\tstringToBuffer,\n\tunreachableCase,\n\tfromUtf8ToBase64,\n\tUint8ArrayToString,\n} from \"@fluidframework/common-utils\";\nimport { ITelemetryLogger } from \"@fluidframework/common-definitions\";\nimport { loggerToMonitoringContext } from \"@fluidframework/telemetry-utils\";\n\n/*\n * Work around for bufferToString having a bug - it can't consume IsoBuffer!\n * To be removed once bufferToString is fixed!\n */\nfunction bufferToString2(blob: ArrayBufferLike, encoding: \"utf-8\" | \"base64\"): string {\n\tif (blob instanceof Uint8Array) {\n\t\t// IsoBuffer does not have ctor, so it's not in proto chain :(\n\t\treturn Uint8ArrayToString(blob, encoding);\n\t}\n\treturn bufferToString(blob, encoding);\n}\n\n/**\n * Class responsible for aggregating smaller blobs into one and unpacking it later on.\n */\nclass BlobAggregator {\n\tprivate readonly content: [string, string][] = [];\n\n\tpublic addBlob(key: string, content: string) {\n\t\tthis.content.push([key, content]);\n\t}\n\n\tpublic getAggregatedBlobContent() {\n\t\tif (this.content.length === 0) {\n\t\t\treturn undefined;\n\t\t}\n\t\treturn JSON.stringify(this.content);\n\t}\n\n\tstatic load(input: ArrayBufferLike) {\n\t\tconst data = bufferToString2(input, \"utf-8\");\n\t\treturn JSON.parse(data) as [string, string][];\n\t}\n}\n\n/**\n * Base class that deals with unpacking snapshots (in place) containing aggregated blobs\n * It relies on abstract methods for reads and storing unpacked blobs.\n *\n * @deprecated This class was introduced experimentally and is no longer used.\n */\nexport abstract class SnapshotExtractor {\n\tprotected readonly aggregatedBlobName = \"__big\";\n\tprotected readonly virtualIdPrefix = \"__\";\n\n\t// counter for generation of virtual storage IDs\n\tprotected virtualIdCounter = 0;\n\tprotected getNextVirtualId() {\n\t\treturn `${this.virtualIdPrefix}${++this.virtualIdCounter}`;\n\t}\n\n\tabstract getBlob(id: string, tree: ISnapshotTree): Promise<ArrayBufferLike>;\n\tabstract setBlob(id: string, tree: ISnapshotTree, content: string);\n\n\tpublic async unpackSnapshotCore(snapshot: ISnapshotTree, level = 0): Promise<void> {\n\t\tfor (const key of Object.keys(snapshot.trees)) {\n\t\t\tconst obj = snapshot.trees[key];\n\t\t\tawait this.unpackSnapshotCore(obj, level + 1);\n\t\t}\n\n\t\t// For future proof, we will support multiple aggregated blobs with any name\n\t\t// that starts with this.aggregatedBlobName\n\t\tfor (const key of Object.keys(snapshot.blobs)) {\n\t\t\tif (!key.startsWith(this.aggregatedBlobName)) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tconst blobId = snapshot.blobs[key];\n\t\t\tif (blobId !== undefined) {\n\t\t\t\tconst blob = await this.getBlob(blobId, snapshot);\n\t\t\t\tfor (const [path, value] of BlobAggregator.load(blob)) {\n\t\t\t\t\tconst id = this.getNextVirtualId();\n\t\t\t\t\tthis.setBlob(id, snapshot, value);\n\t\t\t\t\tconst pathSplit = path.split(\"/\");\n\t\t\t\t\tlet subTree = snapshot;\n\t\t\t\t\tfor (const subPath of pathSplit.slice(0, pathSplit.length - 1)) {\n\t\t\t\t\t\tif (subTree.trees[subPath] === undefined) {\n\t\t\t\t\t\t\tsubTree.trees[subPath] = { blobs: {}, trees: {} };\n\t\t\t\t\t\t}\n\t\t\t\t\t\tsubTree = subTree.trees[subPath];\n\t\t\t\t\t}\n\t\t\t\t\tconst blobName = pathSplit[pathSplit.length - 1];\n\t\t\t\t\tassert(\n\t\t\t\t\t\tsubTree.blobs[blobName] === undefined,\n\t\t\t\t\t\t0x0f6 /* \"real blob ID exists\" */,\n\t\t\t\t\t);\n\t\t\t\t\tsubTree.blobs[blobName] = id;\n\t\t\t\t}\n\t\t\t\t// eslint-disable-next-line @typescript-eslint/no-dynamic-delete\n\t\t\t\tdelete snapshot.blobs[this.aggregatedBlobName];\n\t\t\t}\n\t\t}\n\t}\n}\n\n/*\n * Snapshot extractor class that works in place, i.e. patches snapshot that has\n * blob content in ISnapshotTree.blobs itself, not in storage.\n * As result, it implements reading and writing of blobs to/from snapshot itself.\n * It follows existing pattern that mixes concerns - ISnapshotTree.blobs is used for two\n * purposes:\n * 1. map path name to blob ID\n * 2. map blob ID to blob content\n * #2 is what storage (IDocumentStorageService) is for, but in places where we do not have it\n * (like loading serialized earlier draft content), blob content is put directly into snapshot.\n * Ideally this should be fixed by using BlobCacheStorageService or something similar and\n * fixing existing flows to allow switching of storage.\n */\nclass SnapshotExtractorInPlace extends SnapshotExtractor {\n\tpublic async getBlob(id: string, tree: ISnapshotTree): Promise<ArrayBufferLike> {\n\t\tconst blob = tree.blobs[id];\n\t\tassert(blob !== undefined, 0x0f7 /* \"aggregate blob missing\" */);\n\t\treturn stringToBuffer(blob, \"base64\");\n\t}\n\n\tpublic setBlob(id: string, tree: ISnapshotTree, content: string) {\n\t\tassert(\n\t\t\ttree.blobs[id] === undefined,\n\t\t\t0x0f8 /* \"blob from aggregate blob exists on its own\" */,\n\t\t);\n\t\ttree.blobs[id] = fromUtf8ToBase64(content);\n\t}\n}\n\n/**\n * Snapshot packer and extractor.\n * When summary is written it will find and aggregate small blobs into bigger blobs\n * When snapshot is read, it will unpack aggregated blobs and provide them transparently to caller.\n *\n * @deprecated This class was introduced experimentally and is no longer used.\n */\nexport class BlobAggregationStorage extends SnapshotExtractor implements IDocumentStorageService {\n\t// Tells data store if it can use incremental summary (i.e. reuse DDSes from previous summary\n\t// when only one DDS changed).\n\t// The answer has to be know long before we enable actual packing. The reason for the is the following:\n\t// A the moment when we enable packing, we should assume that all clients out there wil already have bits\n\t// that can unpack properly (i.e. enough time passed since we deployed bits that can unpack)\n\t// But we can still have clients where some of them already pack, and some do not. If one summary was\n\t// using packing, then it relies on non-incremental summaries going forward, even if next client who\n\t// produced summary is not packing!\n\t// This can have slight improvement by enabling it per file (based on \"did summary we loaded from contain\n\t// aggregated blobs\"), but that's harder to make reliable, so going for simplicity.\n\tstatic readonly fullDataStoreSummaries = true;\n\n\tprotected loadedFromSummary = false;\n\n\tprotected virtualBlobs = new Map<string, ArrayBufferLike>();\n\n\tstatic wrap(\n\t\tstorage: IDocumentStorageService,\n\t\tlogger: ITelemetryLogger,\n\t\tallowPacking?: boolean,\n\t\tpackingLevel = 2,\n\t) {\n\t\tif (storage instanceof BlobAggregationStorage) {\n\t\t\treturn storage;\n\t\t}\n\t\tconst mc = loggerToMonitoringContext(logger);\n\t\tconst realAllowPackaging =\n\t\t\tmc.config.getBoolean(\"FluidAggregateBlobs\") ?? allowPacking ?? false;\n\n\t\t// Always create BlobAggregationStorage even if storage is not asking for packing.\n\t\t// This is mostly to avoid cases where future changes in policy would result in inability to\n\t\t// load old files that were created with aggregation on.\n\t\tconst minBlobSize = storage.policies?.minBlobSize;\n\t\treturn new BlobAggregationStorage(\n\t\t\tstorage,\n\t\t\tlogger,\n\t\t\trealAllowPackaging,\n\t\t\tpackingLevel,\n\t\t\tminBlobSize,\n\t\t);\n\t}\n\n\tstatic async unpackSnapshot(snapshot: ISnapshotTree) {\n\t\tconst converter = new SnapshotExtractorInPlace();\n\t\tawait converter.unpackSnapshotCore(snapshot);\n\t}\n\n\tpublic get policies(): IDocumentStorageServicePolicies | undefined {\n\t\tconst policies = this.storage.policies;\n\t\tif (policies) {\n\t\t\treturn { ...policies, minBlobSize: undefined };\n\t\t}\n\t}\n\n\tpublic async unpackSnapshot(snapshot: ISnapshotTree) {\n\t\t// SummarizerNodeWithGC.refreshLatestSummary can call it when this.loadedFromSummary === false\n\t\t// (I assumed after file was created)\n\t\t// assert(!this.loadedFromSummary, \"unpack without summary\");\n\n\t\tthis.loadedFromSummary = true;\n\t\tawait this.unpackSnapshotCore(snapshot);\n\t}\n\n\tprotected constructor(\n\t\tprivate readonly storage: IDocumentStorageService,\n\t\tprivate readonly logger: ITelemetryLogger,\n\t\tprivate readonly allowPacking: boolean,\n\t\tprivate readonly packingLevel: number,\n\t\tprivate readonly blobCutOffSize?: number,\n\t) {\n\t\tsuper();\n\t}\n\n\tpublic setBlob(id: string, tree: ISnapshotTree, content: string) {\n\t\tthis.virtualBlobs.set(id, stringToBuffer(content, \"utf-8\"));\n\t}\n\n\tpublic async getBlob(id: string, tree: ISnapshotTree): Promise<ArrayBufferLike> {\n\t\treturn this.readBlob(id).catch((error) => {\n\t\t\tthis.logger.sendErrorEvent({ eventName: \"BlobDedupNoAggregateBlob\" }, error);\n\t\t\tthrow error;\n\t\t});\n\t}\n\n\tpublic get repositoryUrl() {\n\t\treturn this.storage.repositoryUrl;\n\t}\n\tpublic async getVersions(\n\t\tversionId: string | null,\n\t\tcount: number,\n\t\tscenarioName?: string,\n\t\tfetchSource?: FetchSource,\n\t) {\n\t\treturn this.storage.getVersions(versionId, count, scenarioName, fetchSource);\n\t}\n\n\tpublic async downloadSummary(handle: ISummaryHandle): Promise<ISummaryTree> {\n\t\tthrow new Error(\"NYI\");\n\t}\n\n\t// for now we are not optimizing these blobs, with assumption that this API is used only\n\t// for big blobs (images)\n\tpublic async createBlob(file: ArrayBufferLike): Promise<ICreateBlobResponse> {\n\t\treturn this.storage.createBlob(file);\n\t}\n\n\tpublic async getSnapshotTree(version?: IVersion): Promise<ISnapshotTree | null> {\n\t\tconst tree = await this.storage.getSnapshotTree(version);\n\t\tif (tree) {\n\t\t\tawait this.unpackSnapshot(tree);\n\t\t}\n\t\treturn tree;\n\t}\n\n\tpublic async readBlob(id: string): Promise<ArrayBufferLike> {\n\t\tif (this.isRealStorageId(id)) {\n\t\t\treturn this.storage.readBlob(id);\n\t\t}\n\t\t// We support only reading blobs from the summary we loaded from.\n\t\t// This may need to be extended to any general summary in the future as runtime usage pattern\n\t\t// of storage changes (for example, data stores start to load from recent summary, not from original\n\t\t// summary whole container loaded from)\n\n\t\t// are there other ways we can get here? createFile is one flow, but we should not be reading blobs\n\t\t// in such flow\n\t\tassert(this.loadedFromSummary, 0x0f9 /* \"never read summary\" */);\n\t\tconst blob = this.virtualBlobs.get(id);\n\t\tassert(blob !== undefined, 0x0fa /* \"virtual blob not found\" */);\n\t\treturn blob;\n\t}\n\n\tpublic async uploadSummaryWithContext(\n\t\tsummary: ISummaryTree,\n\t\tcontext: ISummaryContext,\n\t): Promise<string> {\n\t\tconst summaryNew = this.allowPacking ? await this.compressSmallBlobs(summary) : summary;\n\t\treturn this.storage.uploadSummaryWithContext(summaryNew, context);\n\t}\n\n\t// For simplification, we assume that\n\t// - blob aggregation is done at data store level only for now\n\t// - data store either reuses previous summary, or generates full summary, i.e. there is no partial (some DDS)\n\t// summary produced by data stores.\n\t// These simplifications allow us not to touch handles, as they are self-contained (either do not use aggregated\n\t// blob or contain aggregated blob that stays relevant for that sub-tree)\n\t// Note:\n\t// From perf perspective, it makes sense to place aggregated blobs one level up in the tree to not create extra\n\t// tree nodes (i.e. have shallow tree with less edges). But that creates problems with reusability of trees at\n\t// incremental summary time - we would need to understand handles and parse them. In current design we can skip\n\t// that step because if data store is reused, the whole sub-tree is reused including aggregated blob embedded into it\n\t// and that means we can do nothing and be correct!\n\tprivate async compressSmallBlobs(\n\t\tsummary: ISummaryTree,\n\t\tpath = \"\",\n\t\tlevel = 0,\n\t\taggregatorArg?: BlobAggregator,\n\t): Promise<ISummaryTree> {\n\t\tif (this.blobCutOffSize === undefined || this.blobCutOffSize < 0) {\n\t\t\treturn summary;\n\t\t}\n\n\t\tlet shouldCompress: boolean = false;\n\n\t\tlet aggregator = aggregatorArg;\n\t\t// checking if this is a dataStore tree, since we only pack at data store level\n\t\tif (Object.keys(summary.tree).includes(\".component\")) {\n\t\t\tassert(aggregator === undefined, 0x0fb /* \"logic err with aggregator\" */);\n\t\t\tassert(\n\t\t\t\tlevel === this.packingLevel,\n\t\t\t\t0x23b /* \"we are not packing at the right level\" */,\n\t\t\t);\n\t\t\taggregator = new BlobAggregator();\n\t\t\tshouldCompress = true;\n\t\t} else {\n\t\t\tassert(\n\t\t\t\tlevel !== this.packingLevel,\n\t\t\t\t0x23c /* \"we are not packing at the right level\" */,\n\t\t\t);\n\t\t}\n\n\t\tconst newSummary: ISummaryTree = { ...summary };\n\t\tnewSummary.tree = { ...newSummary.tree };\n\t\tfor (const key of Object.keys(summary.tree)) {\n\t\t\tconst obj = summary.tree[key];\n\t\t\t// Get path relative to root of data store (where we do aggregation)\n\t\t\tconst newPath = shouldCompress ? key : `${path}/${key}`;\n\t\t\tswitch (obj.type) {\n\t\t\t\tcase SummaryType.Tree:\n\t\t\t\t\t// If client created empty tree, keep it as is\n\t\t\t\t\t// Also do not package search blobs - they are part of storage contract\n\t\t\t\t\tif (Object.keys(obj).length !== 0 && key !== \"__search\") {\n\t\t\t\t\t\tconst tree = await this.compressSmallBlobs(\n\t\t\t\t\t\t\tobj,\n\t\t\t\t\t\t\tnewPath,\n\t\t\t\t\t\t\tlevel + 1,\n\t\t\t\t\t\t\taggregator,\n\t\t\t\t\t\t);\n\t\t\t\t\t\tnewSummary.tree[key] = tree;\n\t\t\t\t\t\tif (Object.keys(obj).length === 0) {\n\t\t\t\t\t\t\t// eslint-disable-next-line @typescript-eslint/no-dynamic-delete\n\t\t\t\t\t\t\tdelete newSummary.tree[key];\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\tcase SummaryType.Blob:\n\t\t\t\t\tif (\n\t\t\t\t\t\taggregator &&\n\t\t\t\t\t\ttypeof obj.content == \"string\" &&\n\t\t\t\t\t\tobj.content.length < this.blobCutOffSize\n\t\t\t\t\t) {\n\t\t\t\t\t\taggregator.addBlob(newPath, obj.content);\n\t\t\t\t\t\t// eslint-disable-next-line @typescript-eslint/no-dynamic-delete\n\t\t\t\t\t\tdelete newSummary.tree[key];\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\tcase SummaryType.Handle: {\n\t\t\t\t\t// Would be nice to:\n\t\t\t\t\t// Trees: expand the tree\n\t\t\t\t\t// Blobs: parse handle and ensure it points to real blob, not virtual blob.\n\t\t\t\t\t// We can avoid it for now given data store is the granularity of incremental summaries.\n\t\t\t\t\tlet handlePath = obj.handle;\n\t\t\t\t\tif (handlePath.startsWith(\"/\")) {\n\t\t\t\t\t\thandlePath = handlePath.substr(1);\n\t\t\t\t\t}\n\t\t\t\t\t// Ensure only whole data stores can be reused, no reusing at deeper level!\n\t\t\t\t\tassert(level === 0, 0x0fc /* \"tree reuse at lower level\" */);\n\t\t\t\t\tassert(\n\t\t\t\t\t\t!handlePath.includes(\"/\"),\n\t\t\t\t\t\t0x0fd /* \"data stores are writing incremental summaries!\" */,\n\t\t\t\t\t);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tcase SummaryType.Attachment:\n\t\t\t\t\tassert(\n\t\t\t\t\t\tthis.isRealStorageId(obj.id),\n\t\t\t\t\t\t0x0fe /* \"attachment is aggregate blob\" */,\n\t\t\t\t\t);\n\t\t\t\t\tbreak;\n\t\t\t\tdefault:\n\t\t\t\t\tunreachableCase(obj, `Unknown type: ${(obj as any).type}`);\n\t\t\t}\n\t\t}\n\n\t\tassert(\n\t\t\tnewSummary.tree[this.aggregatedBlobName] === undefined,\n\t\t\t0x0ff /* \"duplicate aggregate blob\" */,\n\t\t);\n\t\tif (shouldCompress) {\n\t\t\t// Note: It would be great to add code here to unpack aggregate blob back to normal blobs\n\t\t\t// If only one blob made it into aggregate. Currently that does not happen as we always have\n\t\t\t// at least one .component blob and at least one DDS that has .attributes blob, so it's not an issue.\n\t\t\t// But it's possible that in future that would be great addition!\n\t\t\t// Good news - it's backward compatible change.\n\t\t\tassert(aggregator !== undefined, 0x100 /* \"logic error\" */);\n\t\t\tconst content = aggregator.getAggregatedBlobContent();\n\t\t\tif (content !== undefined) {\n\t\t\t\tnewSummary.tree[this.aggregatedBlobName] = {\n\t\t\t\t\ttype: SummaryType.Blob,\n\t\t\t\t\tcontent,\n\t\t\t\t};\n\t\t\t}\n\t\t}\n\t\treturn newSummary;\n\t}\n\n\tprotected isRealStorageId(id: string): boolean {\n\t\treturn !id.startsWith(this.virtualIdPrefix);\n\t}\n}\n"]}

package/dist/blobCacheStorageService.d.ts

@@ -1,27 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { IDocumentStorageService, IDocumentStorageServicePolicies } from "@fluidframework/driver-definitions";
-import { DocumentStorageServiceProxy } from "./documentStorageServiceProxy";
-/**
- * IDocumentStorageService adapter with pre-cached blobs.
- *
- * @deprecated 2.0.0-internal.3.2.0 Not recommended for general purpose use.
- */
-export declare class BlobCacheStorageService extends DocumentStorageServiceProxy {
-    private readonly blobs;
-    /**
-     * @deprecated 2.0.0-internal.3.2.0 Not recommended for general purpose use.
-     */
-    constructor(internalStorageService: IDocumentStorageService, blobs: Map<string, ArrayBufferLike>);
-    /**
-     * @deprecated 2.0.0-internal.3.2.0 Not recommended for general purpose use.
-     */
-    get policies(): IDocumentStorageServicePolicies | undefined;
-    /**
-     * @deprecated 2.0.0-internal.3.2.0 Not recommended for general purpose use.
-     */
-    readBlob(id: string): Promise<ArrayBufferLike>;
-}
-//# sourceMappingURL=blobCacheStorageService.d.ts.map

package/dist/blobCacheStorageService.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"blobCacheStorageService.d.ts","sourceRoot":"","sources":["../src/blobCacheStorageService.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EACN,uBAAuB,EACvB,+BAA+B,EAC/B,MAAM,oCAAoC,CAAC;AAC5C,OAAO,EAAE,2BAA2B,EAAE,MAAM,+BAA+B,CAAC;AAE5E;;;;GAIG;AACH,qBAAa,uBAAwB,SAAQ,2BAA2B;IAMtE,OAAO,CAAC,QAAQ,CAAC,KAAK;IALvB;;OAEG;gBAEF,sBAAsB,EAAE,uBAAuB,EAC9B,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,eAAe,CAAC;IAKrD;;OAEG;IACH,IAAW,QAAQ,IAAI,+BAA+B,GAAG,SAAS,CAEjE;IAED;;OAEG;IACU,QAAQ,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,eAAe,CAAC;CAQ3D"}

package/dist/blobCacheStorageService.js

@@ -1,40 +0,0 @@
-"use strict";
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.BlobCacheStorageService = void 0;
-const documentStorageServiceProxy_1 = require("./documentStorageServiceProxy");
-/**
- * IDocumentStorageService adapter with pre-cached blobs.
- *
- * @deprecated 2.0.0-internal.3.2.0 Not recommended for general purpose use.
- */
-class BlobCacheStorageService extends documentStorageServiceProxy_1.DocumentStorageServiceProxy {
-    /**
-     * @deprecated 2.0.0-internal.3.2.0 Not recommended for general purpose use.
-     */
-    constructor(internalStorageService, blobs) {
-        super(internalStorageService);
-        this.blobs = blobs;
-    }
-    /**
-     * @deprecated 2.0.0-internal.3.2.0 Not recommended for general purpose use.
-     */
-    get policies() {
-        return this.internalStorageService.policies;
-    }
-    /**
-     * @deprecated 2.0.0-internal.3.2.0 Not recommended for general purpose use.
-     */
-    async readBlob(id) {
-        const blob = this.blobs.get(id);
-        if (blob !== undefined) {
-            return blob;
-        }
-        return this.internalStorageService.readBlob(id);
-    }
-}
-exports.BlobCacheStorageService = BlobCacheStorageService;
-//# sourceMappingURL=blobCacheStorageService.js.map

package/dist/blobCacheStorageService.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"blobCacheStorageService.js","sourceRoot":"","sources":["../src/blobCacheStorageService.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAMH,+EAA4E;AAE5E;;;;GAIG;AACH,MAAa,uBAAwB,SAAQ,yDAA2B;IACvE;;OAEG;IACH,YACC,sBAA+C,EAC9B,KAAmC;QAEpD,KAAK,CAAC,sBAAsB,CAAC,CAAC;QAFb,UAAK,GAAL,KAAK,CAA8B;IAGrD,CAAC;IAED;;OAEG;IACH,IAAW,QAAQ;QAClB,OAAO,IAAI,CAAC,sBAAsB,CAAC,QAAQ,CAAC;IAC7C,CAAC;IAED;;OAEG;IACI,KAAK,CAAC,QAAQ,CAAC,EAAU;QAC/B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAChC,IAAI,IAAI,KAAK,SAAS,EAAE;YACvB,OAAO,IAAI,CAAC;SACZ;QAED,OAAO,IAAI,CAAC,sBAAsB,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;IACjD,CAAC;CACD;AA7BD,0DA6BC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport {\n\tIDocumentStorageService,\n\tIDocumentStorageServicePolicies,\n} from \"@fluidframework/driver-definitions\";\nimport { DocumentStorageServiceProxy } from \"./documentStorageServiceProxy\";\n\n/**\n * IDocumentStorageService adapter with pre-cached blobs.\n *\n * @deprecated 2.0.0-internal.3.2.0 Not recommended for general purpose use.\n */\nexport class BlobCacheStorageService extends DocumentStorageServiceProxy {\n\t/**\n\t * @deprecated 2.0.0-internal.3.2.0 Not recommended for general purpose use.\n\t */\n\tconstructor(\n\t\tinternalStorageService: IDocumentStorageService,\n\t\tprivate readonly blobs: Map<string, ArrayBufferLike>,\n\t) {\n\t\tsuper(internalStorageService);\n\t}\n\n\t/**\n\t * @deprecated 2.0.0-internal.3.2.0 Not recommended for general purpose use.\n\t */\n\tpublic get policies(): IDocumentStorageServicePolicies | undefined {\n\t\treturn this.internalStorageService.policies;\n\t}\n\n\t/**\n\t * @deprecated 2.0.0-internal.3.2.0 Not recommended for general purpose use.\n\t */\n\tpublic async readBlob(id: string): Promise<ArrayBufferLike> {\n\t\tconst blob = this.blobs.get(id);\n\t\tif (blob !== undefined) {\n\t\t\treturn blob;\n\t\t}\n\n\t\treturn this.internalStorageService.readBlob(id);\n\t}\n}\n"]}

package/dist/emptyDocumentDeltaStorageService.d.ts

@@ -1,18 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { IDocumentDeltaStorageService, IStream } from "@fluidframework/driver-definitions";
-import { ISequencedDocumentMessage } from "@fluidframework/protocol-definitions";
-/**
- * Implementation of IDocumentDeltaStorageService that will always return an empty message queue when fetching messages
- *
- * @deprecated 2.0.0-internal.3.2.0 Not recommended for general purpose use.
- */
-export declare class EmptyDocumentDeltaStorageService implements IDocumentDeltaStorageService {
-    /**
-     * @deprecated 2.0.0-internal.3.2.0 Not recommended for general purpose use.
-     */
-    fetchMessages(from: number, _to: number | undefined, _abortSignal?: AbortSignal, _cachedOnly?: boolean, _fetchReason?: string): IStream<ISequencedDocumentMessage[]>;
-}
-//# sourceMappingURL=emptyDocumentDeltaStorageService.d.ts.map

package/dist/emptyDocumentDeltaStorageService.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"emptyDocumentDeltaStorageService.d.ts","sourceRoot":"","sources":["../src/emptyDocumentDeltaStorageService.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,4BAA4B,EAAE,OAAO,EAAE,MAAM,oCAAoC,CAAC;AAC3F,OAAO,EAAE,yBAAyB,EAAE,MAAM,sCAAsC,CAAC;AAGjF;;;;GAIG;AACH,qBAAa,gCAAiC,YAAW,4BAA4B;IACpF;;OAEG;IACI,aAAa,CACnB,IAAI,EAAE,MAAM,EACZ,GAAG,EAAE,MAAM,GAAG,SAAS,EACvB,YAAY,CAAC,EAAE,WAAW,EAC1B,WAAW,CAAC,EAAE,OAAO,EACrB,YAAY,CAAC,EAAE,MAAM,GACnB,OAAO,CAAC,yBAAyB,EAAE,CAAC;CAKvC"}

package/dist/emptyDocumentDeltaStorageService.js

@@ -1,25 +0,0 @@
-"use strict";
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.EmptyDocumentDeltaStorageService = void 0;
-const parallelRequests_1 = require("./parallelRequests");
-/**
- * Implementation of IDocumentDeltaStorageService that will always return an empty message queue when fetching messages
- *
- * @deprecated 2.0.0-internal.3.2.0 Not recommended for general purpose use.
- */
-class EmptyDocumentDeltaStorageService {
-    /**
-     * @deprecated 2.0.0-internal.3.2.0 Not recommended for general purpose use.
-     */
-    fetchMessages(from, _to, _abortSignal, _cachedOnly, _fetchReason) {
-        const queue = new parallelRequests_1.Queue();
-        queue.pushDone();
-        return queue;
-    }
-}
-exports.EmptyDocumentDeltaStorageService = EmptyDocumentDeltaStorageService;
-//# sourceMappingURL=emptyDocumentDeltaStorageService.js.map

package/dist/emptyDocumentDeltaStorageService.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"emptyDocumentDeltaStorageService.js","sourceRoot":"","sources":["../src/emptyDocumentDeltaStorageService.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAIH,yDAA2C;AAE3C;;;;GAIG;AACH,MAAa,gCAAgC;IAC5C;;OAEG;IACI,aAAa,CACnB,IAAY,EACZ,GAAuB,EACvB,YAA0B,EAC1B,WAAqB,EACrB,YAAqB;QAErB,MAAM,KAAK,GAAG,IAAI,wBAAK,EAA+B,CAAC;QACvD,KAAK,CAAC,QAAQ,EAAE,CAAC;QACjB,OAAO,KAAK,CAAC;IACd,CAAC;CACD;AAfD,4EAeC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { IDocumentDeltaStorageService, IStream } from \"@fluidframework/driver-definitions\";\nimport { ISequencedDocumentMessage } from \"@fluidframework/protocol-definitions\";\nimport { Queue } from \"./parallelRequests\";\n\n/**\n * Implementation of IDocumentDeltaStorageService that will always return an empty message queue when fetching messages\n *\n * @deprecated 2.0.0-internal.3.2.0 Not recommended for general purpose use.\n */\nexport class EmptyDocumentDeltaStorageService implements IDocumentDeltaStorageService {\n\t/**\n\t * @deprecated 2.0.0-internal.3.2.0 Not recommended for general purpose use.\n\t */\n\tpublic fetchMessages(\n\t\tfrom: number,\n\t\t_to: number | undefined,\n\t\t_abortSignal?: AbortSignal,\n\t\t_cachedOnly?: boolean,\n\t\t_fetchReason?: string,\n\t): IStream<ISequencedDocumentMessage[]> {\n\t\tconst queue = new Queue<ISequencedDocumentMessage[]>();\n\t\tqueue.pushDone();\n\t\treturn queue;\n\t}\n}\n"]}

package/dist/mapWithExpiration.d.ts

@@ -1,75 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-/**
- * An extension of Map that expires (deletes) entries after a period of inactivity.
- * The policy is based on the last time a key was written to.
- *
- * @deprecated 2.0.0-internal.3.2.0 Not recommended for general purpose use.
- */
-export declare class MapWithExpiration<TKey = any, TValue = any> extends Map<TKey, TValue> {
-    private readonly expiryMs;
-    /** Timestamps (as epoch ms numbers) of when each key was last refreshed */
-    private readonly lastRefreshedTimes;
-    /**
-     * @deprecated 2.0.0-internal.3.2.0 Not recommended for general purpose use.
-     */
-    constructor(expiryMs: number);
-    private refresh;
-    /**
-     * Returns true if the key is present and expired, false if it's not expired, and undefined if it's not found
-     * If cleanUp is passed as true, then delete any expired entry before returning.
-     */
-    private checkExpiry;
-    private clearExpiredEntries;
-    /**
-     * @deprecated 2.0.0-internal.3.2.0 Not recommended for general purpose use.
-     */
-    get size(): number;
-    /**
-     * @deprecated 2.0.0-internal.3.2.0 Not recommended for general purpose use.
-     */
-    has(key: TKey): boolean;
-    /**
-     * @deprecated 2.0.0-internal.3.2.0 Not recommended for general purpose use.
-     */
-    get(key: TKey): TValue | undefined;
-    /**
-     * @deprecated 2.0.0-internal.3.2.0 Not recommended for general purpose use.
-     */
-    set(key: TKey, value: TValue): this;
-    /**
-     * @deprecated 2.0.0-internal.3.2.0 Not recommended for general purpose use.
-     */
-    delete(key: TKey): boolean;
-    /**
-     * @deprecated 2.0.0-internal.3.2.0 Not recommended for general purpose use.
-     */
-    clear(): void;
-    /**
-     * @deprecated 2.0.0-internal.3.2.0 Not recommended for general purpose use.
-     */
-    forEach(callbackfn: (value: TValue, key: TKey, map: Map<TKey, TValue>) => void, thisArg?: any): void;
-    /**
-     * @deprecated 2.0.0-internal.3.2.0 Not recommended for general purpose use.
-     */
-    entries(): IterableIterator<[TKey, TValue]>;
-    /**
-     * @deprecated 2.0.0-internal.3.2.0 Not recommended for general purpose use.
-     */
-    keys(): IterableIterator<TKey>;
-    /**
-     * @deprecated 2.0.0-internal.3.2.0 Not recommended for general purpose use.
-     */
-    values(): IterableIterator<TValue>;
-    /**
-     * @deprecated 2.0.0-internal.3.2.0 Not recommended for general purpose use.
-     */
-    [Symbol.iterator](): IterableIterator<[TKey, TValue]>;
-    /**
-     * @deprecated 2.0.0-internal.3.2.0 Not recommended for general purpose use.
-     */
-    valueOf(): Object;
-}
-//# sourceMappingURL=mapWithExpiration.d.ts.map

package/dist/mapWithExpiration.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"mapWithExpiration.d.ts","sourceRoot":"","sources":["../src/mapWithExpiration.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAIH;;;;;GAKG;AACH,qBAAa,iBAAiB,CAAC,IAAI,GAAG,GAAG,EAAE,MAAM,GAAG,GAAG,CAAE,SAAQ,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC;IAOrE,OAAO,CAAC,QAAQ,CAAC,QAAQ;IANrC,2EAA2E;IAC3E,OAAO,CAAC,QAAQ,CAAC,kBAAkB,CAA2B;IAE9D;;OAEG;gBAC0B,QAAQ,EAAE,MAAM;IAI7C,OAAO,CAAC,OAAO;IAIf;;;OAGG;IACH,OAAO,CAAC,WAAW;IAiBnB,OAAO,CAAC,mBAAmB;IAK3B;;OAEG;IACH,IAAI,IAAI,IAAI,MAAM,CAGjB;IAED;;OAEG;IACH,GAAG,CAAC,GAAG,EAAE,IAAI,GAAG,OAAO;IAKvB;;OAEG;IACH,GAAG,CAAC,GAAG,EAAE,IAAI,GAAG,MAAM,GAAG,SAAS;IAKlC;;OAEG;IACH,GAAG,CAAC,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,GAAG,IAAI;IAMnC;;OAEG;IACH,MAAM,CAAC,GAAG,EAAE,IAAI,GAAG,OAAO;IAK1B;;OAEG;IACH,KAAK,IAAI,IAAI;IAKb;;OAEG;IACH,OAAO,CACN,UAAU,EAAE,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,KAAK,IAAI,EACtE,OAAO,CAAC,EAAE,GAAG,GACX,IAAI;IAmBP;;OAEG;IACH,OAAO,IAAI,gBAAgB,CAAC,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IAI3C;;OAEG;IACH,IAAI,IAAI,gBAAgB,CAAC,IAAI,CAAC;IAI9B;;OAEG;IACH,MAAM,IAAI,gBAAgB,CAAC,MAAM,CAAC;IAIlC;;OAEG;IACH,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,gBAAgB,CAAC,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IAKrD;;OAEG;IACH,OAAO;CAIP"}