@fluidframework/driver-utils 0.51.0-43124 → 0.52.0-44610

package/dist/blobAggregationStorage.js

@@ -5,6 +5,7 @@
  */
 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");
 // Gate that when flipped, instructs to compress small blobs.
 // We have to first ship with this gate off, such that we can get to saturation bits
@@ -261,7 +262,7 @@ class BlobAggregationStorage extends SnapshotExtractor {
             // Get path relative to root of data store (where we do aggregation)
             const newPath = shouldCompress ? key : `${path}/${key}`;
             switch (obj.type) {
-                case 1 /* Tree */:
+                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 (obj.tree !== {} && key !== "__search") {
@@ -273,14 +274,14 @@ class BlobAggregationStorage extends SnapshotExtractor {
                         }
                     }
                     break;
-                case 2 /* Blob */:
+                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 3 /* Handle */: {
+                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.
@@ -294,7 +295,7 @@ class BlobAggregationStorage extends SnapshotExtractor {
                     common_utils_1.assert(handlePath.indexOf("/") === -1, 0x0fd /* "data stores are writing incremental summaries!" */);
                     break;
                 }
-                case 4 /* Attachment */:
+                case protocol_definitions_1.SummaryType.Attachment:
                     common_utils_1.assert(this.isRealStorageId(obj.id), 0x0fe /* "attachment is aggregate blob" */);
                     break;
                 default:
@@ -312,7 +313,7 @@ class BlobAggregationStorage extends SnapshotExtractor {
             const content = aggregator.getAggregatedBlobContent();
             if (content !== undefined) {
                 newSummary.tree[this.aggregatedBlobName] = {
-                    type: 2 /* Blob */,
+                    type: protocol_definitions_1.SummaryType.Blob,
                     content,
                 };
             }

package/dist/blobAggregationStorage.js.map

@@ -1 +1 @@
-{"version":3,"file":"blobAggregationStorage.js","sourceRoot":"","sources":["../src/blobAggregationStorage.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAgBH,+DAOuC;AAGvC,6DAA6D;AAC7D,oFAAoF;AACpF,sEAAsE;AACtE,SAAS,iBAAiB;IACtB,IAAI;QACA,sCAAsC;QACtC,2CAA2C;QAC3C,IAAI,OAAO,YAAY,KAAK,QAAQ,IAAI,YAAY,KAAK,IAAI,EAAE;YAC3D,IAAK,YAAY,CAAC,mBAAmB,KAAK,GAAG,EAAE;gBAC3C,OAAO,IAAI,CAAC;aACf;YACD,IAAK,YAAY,CAAC,mBAAmB,KAAK,GAAG,EAAE;gBAC3C,OAAO,KAAK,CAAC;aAChB;SACJ;KACJ;IAAC,OAAO,CAAC,EAAE,GAAE;IAEd,4BAA4B;IAC5B,OAAO,KAAK,CAAC;AACjB,CAAC;AAED;;;EAGE;AACF,SAAS,eAAe,CAAC,IAAqB,EAAE,QAA4B;IACxE,IAAI,IAAI,YAAY,UAAU,EAAE,EAAE,8DAA8D;QAC5F,OAAO,iCAAkB,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;KAC7C;IACD,OAAO,6BAAc,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;AAC1C,CAAC;AAEA;;GAEG;AACJ,MAAM,cAAc;IAApB;QACqB,YAAO,GAAsB,EAAE,CAAC;IAiBrD,CAAC;IAfU,OAAO,CAAC,GAAW,EAAE,OAAe;QACvC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC,CAAC;IACtC,CAAC;IAEM,wBAAwB;QAC3B,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE;YAC3B,OAAO,SAAS,CAAC;SACpB;QACD,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACxC,CAAC;IAED,MAAM,CAAC,IAAI,CAAC,KAAsB;QAC9B,MAAM,IAAI,GAAG,eAAe,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;QAC7C,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAuB,CAAC;IAClD,CAAC;CACJ;AAED;;;GAGG;AACH,MAAsB,iBAAiB;IAAvC;QACuB,uBAAkB,GAAG,OAAO,CAAC;QAC7B,oBAAe,GAAG,IAAI,CAAC;QAE1C,gDAAgD;QACtC,qBAAgB,GAAG,CAAC,CAAC;IAyCnC,CAAC;IAxCa,gBAAgB;QACtB,OAAO,GAAG,IAAI,CAAC,eAAe,GAAG,EAAE,IAAI,CAAC,gBAAgB,EAAE,CAAC;IAC/D,CAAC;IAKM,KAAK,CAAC,kBAAkB,CAAC,QAAuB,EAAE,KAAK,GAAG,CAAC;QAC9D,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE;YAC3C,MAAM,GAAG,GAAG,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;YAChC,MAAM,IAAI,CAAC,kBAAkB,CAAC,GAAG,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;SACjD;QAED,4EAA4E;QAC5E,2CAA2C;QAC3C,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE;YAC3C,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,kBAAkB,CAAC,EAAE;gBAAE,SAAS;aAAE;YAC3D,MAAM,MAAM,GAAG,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;YACnC,IAAI,MAAM,KAAK,SAAS,EAAE;gBACtB,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;oBACnD,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;wBAC5D,IAAI,OAAO,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,SAAS,EAAE;4BACtC,OAAO,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAC,CAAC;yBACjE;wBACD,OAAO,GAAG,OAAO,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;qBACpC;oBACD,MAAM,QAAQ,GAAG,SAAS,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;oBACjD,qBAAM,CAAC,OAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,KAAK,SAAS,EAAE,KAAK,CAAC,2BAA2B,CAAC,CAAC;oBACjF,OAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,GAAG,EAAE,CAAC;iBAChC;gBACD,gEAAgE;gBAChE,OAAO,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAC;aAClD;SACJ;IACL,CAAC;CACJ;AA9CD,8CA8CC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,wBAAyB,SAAQ,iBAAiB;IAC7C,KAAK,CAAC,OAAO,CAAC,EAAU,EAAE,IAAmB;QAChD,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QAC5B,qBAAM,CAAC,IAAI,KAAK,SAAS,EAAE,KAAK,CAAC,8BAA8B,CAAC,CAAC;QACjE,OAAO,6BAAc,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;IAC1C,CAAC;IAEM,OAAO,CAAC,EAAU,EAAE,IAAmB,EAAE,OAAe;QAC3D,qBAAM,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,SAAS,EAAE,KAAK,CAAC,kDAAkD,CAAC,CAAC;QAC/F,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,GAAG,+BAAgB,CAAC,OAAO,CAAC,CAAC;IAC/C,CAAC;CACJ;AAED;;;;GAIG;AACH,MAAa,sBAAuB,SAAQ,iBAAiB;IAsDzD,YACqB,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;QA9ClC,sBAAiB,GAAG,KAAK,CAAC;QAE1B,iBAAY,GAAG,IAAI,GAAG,EAA2B,CAAC;IA+C5D,CAAC;IA7CD,MAAM,CAAC,IAAI,CACP,OAAgC,EAChC,MAAwB,EACxB,YAAY,GAAG,iBAAiB,EAAE,EAClC,YAAY,GAAG,CAAC;;QAEhB,IAAI,OAAO,YAAY,sBAAsB,EAAE;YAC3C,OAAO,OAAO,CAAC;SAClB;QACD,kFAAkF;QAClF,4FAA4F;QAC5F,wDAAwD;QACxD,MAAM,WAAW,SAAG,OAAO,CAAC,QAAQ,0CAAE,WAAW,CAAC;QAClD,OAAO,IAAI,sBAAsB,CAAC,OAAO,EAAE,MAAM,EAAE,YAAY,EAAE,YAAY,EAAE,WAAW,CAAC,CAAC;IAChG,CAAC;IAED,MAAM,CAAC,KAAK,CAAC,cAAc,CAAC,QAAuB;QAC/C,MAAM,SAAS,GAAG,IAAI,wBAAwB,EAAE,CAAC;QACjD,MAAM,SAAS,CAAC,kBAAkB,CAAC,QAAQ,CAAC,CAAC;IACjD,CAAC;IAED,IAAW,QAAQ;QACf,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC;QACvC,IAAI,QAAQ,EAAE;YACV,uCAAY,QAAQ,KAAE,WAAW,EAAE,SAAS,IAAG;SAClD;IACL,CAAC;IAEM,KAAK,CAAC,cAAc,CAAC,QAAuB;QAC/C,8FAA8F;QAC9F,qCAAqC;QACrC,6DAA6D;QAE7D,IAAI,CAAC,iBAAiB,GAAG,IAAI,CAAC;QAC9B,MAAM,IAAI,CAAC,kBAAkB,CAAC,QAAQ,CAAC,CAAC;IAC5C,CAAC;IAYM,OAAO,CAAC,EAAU,EAAE,IAAmB,EAAE,OAAe;QAC3D,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,EAAE,EAAE,6BAAc,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC;IAChE,CAAC;IAEM,KAAK,CAAC,OAAO,CAAC,EAAU,EAAE,IAAmB;QAChD,OAAO,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,EAAE;YACrC,IAAI,CAAC,MAAM,CAAC,cAAc,CAAC,EAAE,SAAS,EAAE,0BAA0B,EAAE,EAAE,KAAK,CAAC,CAAC;YAC7E,MAAM,KAAK,CAAC;QAChB,CAAC,CAAC,CAAC;IACP,CAAC;IAED,IAAW,aAAa,KAAK,OAAO,IAAI,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC;IAC1D,KAAK,CAAC,WAAW,CAAC,SAAwB,EAAE,KAAa;QAC5D,OAAO,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;IACtD,CAAC;IAEM,KAAK,CAAC,eAAe,CAAC,MAAsB;QAC/C,MAAM,IAAI,KAAK,CAAC,KAAK,CAAC,CAAC;IAC3B,CAAC;IAED,sEAAsE;IAC/D,KAAK,CAAC,KAAK,CAAC,IAAW,EAAE,OAAiB,EAAE,OAAe,EAAE,GAAW;QAC3E,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,GAAG,CAAC,CAAC;IAC3D,CAAC;IAED,wFAAwF;IACxF,yBAAyB;IAClB,KAAK,CAAC,UAAU,CAAC,IAAqB;QACzC,OAAO,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;IACzC,CAAC;IAEM,KAAK,CAAC,eAAe,CAAC,OAAkB;QAC3C,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,eAAe,CAAC,OAAO,CAAC,CAAC;QACzD,IAAI,IAAI,EAAE;YACN,MAAM,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC;SACnC;QACD,OAAO,IAAI,CAAC;IAChB,CAAC;IAEM,KAAK,CAAC,QAAQ,CAAC,EAAU;QAC5B,IAAI,IAAI,CAAC,eAAe,CAAC,EAAE,CAAC,EAAE;YAC1B,OAAO,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;SACpC;QACD,iEAAiE;QACjE,6FAA6F;QAC7F,oGAAoG;QACpG,uCAAuC;QAEvC,mGAAmG;QACnG,eAAe;QACf,qBAAM,CAAC,IAAI,CAAC,iBAAiB,EAAE,KAAK,CAAC,0BAA0B,CAAC,CAAC;QACjE,MAAM,IAAI,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACvC,qBAAM,CAAC,IAAI,KAAK,SAAS,EAAE,KAAK,CAAC,8BAA8B,CAAC,CAAC;QACjE,OAAO,IAAI,CAAC;IAChB,CAAC;IAEM,KAAK,CAAC,wBAAwB,CAAC,OAAqB,EAAE,OAAwB;QACjF,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;IACtE,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,mHAAmH;IACnH,mDAAmD;IAC3C,KAAK,CAAC,kBAAkB,CAC5B,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;YAC9D,OAAO,OAAO,CAAC;SAClB;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;YAClD,qBAAM,CAAC,UAAU,KAAK,SAAS,EAAE,KAAK,CAAC,iCAAiC,CAAC,CAAC;YAC1E,qBAAM,CAAC,KAAK,KAAK,IAAI,CAAC,YAAY,EAAE,KAAK,CAAC,6CAA6C,CAAC,CAAC;YACzF,UAAU,GAAG,IAAI,cAAc,EAAE,CAAC;YAClC,cAAc,GAAG,IAAI,CAAC;SACzB;aAAM;YACH,qBAAM,CAAC,KAAK,KAAK,IAAI,CAAC,YAAY,EAAE,KAAK,CAAC,6CAA6C,CAAC,CAAC;SAC5F;QAED,MAAM,UAAU,qBAAqB,OAAO,CAAC,CAAC;QAC9C,UAAU,CAAC,IAAI,qBAAQ,UAAU,CAAC,IAAI,CAAC,CAAC;QACxC,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;YACzC,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;gBACd;oBACI,8CAA8C;oBAC9C,uEAAuE;oBACvE,IAAI,GAAG,CAAC,IAAI,KAAK,EAAE,IAAI,GAAG,KAAK,UAAU,EAAE;wBACvC,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,kBAAkB,CAAC,GAAG,EAAE,OAAO,EAAE,KAAK,GAAG,CAAC,EAAE,UAAU,CAAC,CAAC;wBAChF,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC;wBAC5B,IAAI,IAAI,CAAC,IAAI,KAAK,EAAE,EAAE;4BAClB,gEAAgE;4BAChE,OAAO,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;yBAC/B;qBACJ;oBACD,MAAM;gBACV;oBACI,IAAI,UAAU,IAAI,OAAO,GAAG,CAAC,OAAO,IAAI,QAAQ,IAAI,GAAG,CAAC,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC,cAAc,EAAE;wBAC1F,UAAU,CAAC,OAAO,CAAC,OAAO,EAAE,GAAG,CAAC,OAAO,CAAC,CAAC;wBACzC,gEAAgE;wBAChE,OAAO,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;qBAC/B;oBACD,MAAM;gBACV,mBAAuB,CAAC,CAAC;oBACrB,oBAAoB;oBACpB,yBAAyB;oBACzB,2EAA2E;oBAC3E,wFAAwF;oBACxF,IAAI,UAAU,GAAG,GAAG,CAAC,MAAM,CAAC;oBAC5B,IAAI,UAAU,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE;wBAC5B,UAAU,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;qBACrC;oBACD,2EAA2E;oBAC3E,qBAAM,CAAC,KAAK,KAAK,CAAC,EAAE,KAAK,CAAC,iCAAiC,CAAC,CAAC;oBAC7D,qBAAM,CAAC,UAAU,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EACjC,KAAK,CAAC,sDAAsD,CAAC,CAAC;oBAClE,MAAM;iBACT;gBACD;oBACI,qBAAM,CAAC,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,oCAAoC,CAAC,CAAC;oBACjF,MAAM;gBACV;oBACI,8BAAe,CAAC,GAAG,EAAE,iBAAkB,GAAW,CAAC,IAAI,EAAE,CAAC,CAAC;aAClE;SACJ;QAED,qBAAM,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,KAAK,SAAS,EAAE,KAAK,CAAC,gCAAgC,CAAC,CAAC;QACvG,IAAI,cAAc,EAAE;YAChB,yFAAyF;YACzF,4FAA4F;YAC5F,qGAAqG;YACrG,iEAAiE;YACjE,+CAA+C;YAC/C,qBAAM,CAAC,UAAU,KAAK,SAAS,EAAE,KAAK,CAAC,mBAAmB,CAAC,CAAC;YAC5D,MAAM,OAAO,GAAG,UAAU,CAAC,wBAAwB,EAAE,CAAC;YACtD,IAAI,OAAO,KAAK,SAAS,EAAE;gBACvB,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,GAAG;oBACvC,IAAI,cAAkB;oBACtB,OAAO;iBACV,CAAC;aACL;SACJ;QACD,OAAO,UAAU,CAAC;IACtB,CAAC;IAES,eAAe,CAAC,EAAU;QAChC,OAAO,CAAC,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;IAChD,CAAC;;AAtOL,wDAuOC;AAtOG,4FAA4F;AAC5F,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     IDocumentStorageService,\n    IDocumentStorageServicePolicies,\n     ISummaryContext,\n} from \"@fluidframework/driver-definitions\";\nimport {\n    ICreateBlobResponse,\n    ISnapshotTree,\n    ISummaryHandle,\n    ISummaryTree,\n    IVersion,\n    SummaryType,\n    ITree,\n} from \"@fluidframework/protocol-definitions\";\nimport {\n    assert,\n    bufferToString,\n    stringToBuffer,\n    unreachableCase,\n    fromUtf8ToBase64,\n    Uint8ArrayToString,\n } from \"@fluidframework/common-utils\";\nimport { ITelemetryLogger } from \"@fluidframework/common-definitions\";\n\n// Gate that when flipped, instructs to compress small blobs.\n// We have to first ship with this gate off, such that we can get to saturation bits\n// that can understand compressed format. And only after that flip it.\nfunction gatesAllowPacking() {\n    try {\n        // Leave override for testing purposes\n        // eslint-disable-next-line no-null/no-null\n        if (typeof localStorage === \"object\" && localStorage !== null) {\n            if  (localStorage.FluidAggregateBlobs === \"1\") {\n                return true;\n            }\n            if  (localStorage.FluidAggregateBlobs === \"0\") {\n                return false;\n            }\n        }\n    } catch (e) {}\n\n    // We are starting disabled.\n    return false;\n}\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    if (blob instanceof Uint8Array) { // IsoBuffer does not have ctor, so it's not in proto chain :(\n        return Uint8ArrayToString(blob, encoding);\n    }\n    return bufferToString(blob, encoding);\n}\n\n /**\n  * Class responsible for aggregating smaller blobs into one and unpacking it later on.\n  */\nclass BlobAggregator {\n    private readonly content: [string, string][]= [];\n\n    public addBlob(key: string, content: string) {\n        this.content.push([key, content]);\n    }\n\n    public getAggregatedBlobContent() {\n        if (this.content.length === 0) {\n            return undefined;\n        }\n        return JSON.stringify(this.content);\n    }\n\n    static load(input: ArrayBufferLike) {\n        const data = bufferToString2(input, \"utf-8\");\n        return JSON.parse(data) as [string, string][];\n    }\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 */\nexport abstract class SnapshotExtractor {\n    protected readonly aggregatedBlobName = \"__big\";\n    protected readonly virtualIdPrefix = \"__\";\n\n    // counter for generation of virtual storage IDs\n    protected virtualIdCounter = 0;\n    protected getNextVirtualId() {\n        return `${this.virtualIdPrefix}${++this.virtualIdCounter}`;\n    }\n\n    abstract getBlob(id: string, tree: ISnapshotTree): Promise<ArrayBufferLike>;\n    abstract setBlob(id: string, tree: ISnapshotTree, content: string);\n\n    public async unpackSnapshotCore(snapshot: ISnapshotTree, level = 0): Promise<void> {\n        for (const key of Object.keys(snapshot.trees)) {\n            const obj = snapshot.trees[key];\n            await this.unpackSnapshotCore(obj, level + 1);\n        }\n\n        // For future proof, we will support multiple aggregated blobs with any name\n        // that starts with this.aggregatedBlobName\n        for (const key of Object.keys(snapshot.blobs)) {\n            if (!key.startsWith(this.aggregatedBlobName)) { continue; }\n            const blobId = snapshot.blobs[key];\n            if (blobId !== undefined) {\n                const blob = await this.getBlob(blobId, snapshot);\n                for (const [path, value] of BlobAggregator.load(blob)) {\n                    const id = this.getNextVirtualId();\n                    this.setBlob(id, snapshot, value);\n                    const pathSplit = path.split(\"/\");\n                    let subTree = snapshot;\n                    for (const subPath of pathSplit.slice(0, pathSplit.length - 1)) {\n                        if (subTree.trees[subPath] === undefined) {\n                            subTree.trees[subPath] = { blobs: {}, commits: {}, trees: {}};\n                        }\n                        subTree = subTree.trees[subPath];\n                    }\n                    const blobName = pathSplit[pathSplit.length - 1];\n                    assert(subTree.blobs[blobName] === undefined, 0x0f6 /* \"real blob ID exists\" */);\n                    subTree.blobs[blobName] = id;\n                }\n                // eslint-disable-next-line @typescript-eslint/no-dynamic-delete\n                delete snapshot.blobs[this.aggregatedBlobName];\n            }\n        }\n    }\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    public async getBlob(id: string, tree: ISnapshotTree): Promise<ArrayBufferLike> {\n        const blob = tree.blobs[id];\n        assert(blob !== undefined, 0x0f7 /* \"aggregate blob missing\" */);\n        return stringToBuffer(blob, \"base64\");\n    }\n\n    public setBlob(id: string, tree: ISnapshotTree, content: string) {\n        assert(tree.blobs[id] === undefined, 0x0f8 /* \"blob from aggregate blob exists on its own\" */);\n        tree.blobs[id] = fromUtf8ToBase64(content);\n    }\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 */\nexport class BlobAggregationStorage extends SnapshotExtractor implements IDocumentStorageService {\n    // Tells data store if it can use incremental summary (i.e. reuse DDSs from previous summary\n    // when only one DDS changed).\n    // The answer has to be know long before we enable actual packing. The reason for the is the following:\n    // A the moment when we enable packing, we should assume that all clients out there wil already have bits\n    // that can unpack properly (i.e. enough time passed since we deployed bits that can unpack)\n    // But we can still have clients where some of them already pack, and some do not. If one summary was\n    // using packing, then it relies on non-incremental summaries going forward, even if next client who\n    // produced summary is not packing!\n    // This can have slight improvement by enabling it per file (based on \"did summary we loaded from contain\n    // aggregated blobs\"), but that's harder to make reliable, so going for simplicity.\n    static readonly fullDataStoreSummaries = true;\n\n    protected loadedFromSummary = false;\n\n    protected virtualBlobs = new Map<string, ArrayBufferLike>();\n\n    static wrap(\n        storage: IDocumentStorageService,\n        logger: ITelemetryLogger,\n        allowPacking = gatesAllowPacking(),\n        packingLevel = 2,\n    ) {\n        if (storage instanceof BlobAggregationStorage) {\n            return storage;\n        }\n        // Always create BlobAggregationStorage even if storage is not asking for packing.\n        // This is mostly to avoid cases where future changes in policy would result in inability to\n        // load old files that were created with aggregation on.\n        const minBlobSize = storage.policies?.minBlobSize;\n        return new BlobAggregationStorage(storage, logger, allowPacking, packingLevel, minBlobSize);\n    }\n\n    static async unpackSnapshot(snapshot: ISnapshotTree) {\n        const converter = new SnapshotExtractorInPlace();\n        await converter.unpackSnapshotCore(snapshot);\n    }\n\n    public get policies(): IDocumentStorageServicePolicies | undefined {\n        const policies = this.storage.policies;\n        if (policies) {\n            return { ...policies, minBlobSize: undefined };\n        }\n    }\n\n    public async unpackSnapshot(snapshot: ISnapshotTree) {\n        // SummarizerNodeWithGC.refreshLatestSummary can call it when this.loadedFromSummary === false\n        // (I assumed after file was created)\n        // assert(!this.loadedFromSummary, \"unpack without summary\");\n\n        this.loadedFromSummary = true;\n        await this.unpackSnapshotCore(snapshot);\n    }\n\n    protected constructor(\n        private readonly storage: IDocumentStorageService,\n        private readonly logger: ITelemetryLogger,\n        private readonly allowPacking: boolean,\n        private readonly packingLevel: number,\n        private readonly blobCutOffSize?: number)\n    {\n        super();\n    }\n\n    public setBlob(id: string, tree: ISnapshotTree, content: string) {\n        this.virtualBlobs.set(id, stringToBuffer(content, \"utf-8\"));\n    }\n\n    public async getBlob(id: string, tree: ISnapshotTree): Promise<ArrayBufferLike> {\n        return this.readBlob(id).catch((error) => {\n            this.logger.sendErrorEvent({ eventName: \"BlobDedupNoAggregateBlob\" }, error);\n            throw error;\n        });\n    }\n\n    public get repositoryUrl() { return this.storage.repositoryUrl; }\n    public async getVersions(versionId: string | null, count: number) {\n        return this.storage.getVersions(versionId, count);\n    }\n\n    public async downloadSummary(handle: ISummaryHandle): Promise<ISummaryTree> {\n        throw new Error(\"NYI\");\n    }\n\n    // This is only used through Container.snapshot() for testing purposes\n    public async write(root: ITree, parents: string[], message: string, ref: string) {\n        return this.storage.write(root, parents, message, ref);\n    }\n\n    // for now we are not optimizing these blobs, with assumption that this API is used only\n    // for big blobs (images)\n    public async createBlob(file: ArrayBufferLike): Promise<ICreateBlobResponse> {\n        return this.storage.createBlob(file);\n    }\n\n    public async getSnapshotTree(version?: IVersion): Promise<ISnapshotTree | null> {\n        const tree = await this.storage.getSnapshotTree(version);\n        if (tree) {\n            await this.unpackSnapshot(tree);\n        }\n        return tree;\n    }\n\n    public async readBlob(id: string): Promise<ArrayBufferLike> {\n        if (this.isRealStorageId(id)) {\n            return this.storage.readBlob(id);\n        }\n        // We support only reading blobs from the summary we loaded from.\n        // This may need to be extended to any general summary in the future as runtime usage pattern\n        // of storage changes (for example, data stores start to load from recent summary, not from original\n        // summary whole container loaded from)\n\n        // are there other ways we can get here? createFile is one flow, but we should not be reading blobs\n        // in such flow\n        assert(this.loadedFromSummary, 0x0f9 /* \"never read summary\" */);\n        const blob = this.virtualBlobs.get(id);\n        assert(blob !== undefined, 0x0fa /* \"virtual blob not found\" */);\n        return blob;\n    }\n\n    public async uploadSummaryWithContext(summary: ISummaryTree, context: ISummaryContext): Promise<string> {\n        const summaryNew = this.allowPacking ? await this.compressSmallBlobs(summary) : summary;\n        return this.storage.uploadSummaryWithContext(summaryNew, context);\n    }\n\n    // For simplification, we assume that\n    // - blob aggregation is done at data store level only for now\n    // - data store either reuses previous summary, or generates full summary, i.e. there is no partial (some DDS)\n    // summary produced by data stores.\n    // These simplifications allow us not to touch handles, as they are self-contained (either do not use aggregated\n    // blob Or contain aggregated blob that stays relevant for that sub-tree)\n    // Note:\n    // From perf perspective, it makes sense to place aggregated blobs one level up in the tree not to create extra\n    // tree nodes (i.e. have shallow tree with less edges). But that creates problems with reusability of trees at\n    // incremental summary time - we would need to understand handles and parse them. In current design we can skip\n    // that step because if data store is reused, the hole sub-tree is reused included aggregated blob embedded into it\n    // and that means we can do nothing and be correct!\n    private async compressSmallBlobs(\n        summary: ISummaryTree,\n        path = \"\",\n        level = 0,\n        aggregatorArg?: BlobAggregator): Promise<ISummaryTree>\n    {\n        if (this.blobCutOffSize === undefined || this.blobCutOffSize < 0) {\n            return summary;\n        }\n\n        let shouldCompress: boolean = false;\n\n        let aggregator = aggregatorArg;\n        // checking if this is a dataStore tree, since we only pack at data store level\n        if (Object.keys(summary.tree).includes(\".component\")) {\n            assert(aggregator === undefined, 0x0fb /* \"logic err with aggregator\" */);\n            assert(level === this.packingLevel, 0x23b /* \"we are not packing at the right level\" */);\n            aggregator = new BlobAggregator();\n            shouldCompress = true;\n        } else {\n            assert(level !== this.packingLevel, 0x23c /* \"we are not packing at the right level\" */);\n        }\n\n        const newSummary: ISummaryTree = {...summary};\n        newSummary.tree = { ...newSummary.tree};\n        for (const key of Object.keys(summary.tree)) {\n            const obj = summary.tree[key];\n            // Get path relative to root of data store (where we do aggregation)\n            const newPath = shouldCompress ? key : `${path}/${key}`;\n            switch (obj.type) {\n                case SummaryType.Tree:\n                    // If client created empty tree, keep it as is\n                    // Also do not package search blobs - they are part of storage contract\n                    if (obj.tree !== {} && key !== \"__search\") {\n                        const tree = await this.compressSmallBlobs(obj, newPath, level + 1, aggregator);\n                        newSummary.tree[key] = tree;\n                        if (tree.tree === {}) {\n                            // eslint-disable-next-line @typescript-eslint/no-dynamic-delete\n                            delete newSummary.tree[key];\n                        }\n                    }\n                    break;\n                case SummaryType.Blob:\n                    if (aggregator && typeof obj.content == \"string\" && obj.content.length < this.blobCutOffSize) {\n                        aggregator.addBlob(newPath, obj.content);\n                        // eslint-disable-next-line @typescript-eslint/no-dynamic-delete\n                        delete newSummary.tree[key];\n                    }\n                    break;\n                case SummaryType.Handle: {\n                    // Would be nice to:\n                    // Trees: expand the tree\n                    // Blobs: parse handle and ensure it points to real blob, not virtual blob.\n                    // We can avoid it for now given data store is the granularity of incremental summaries.\n                    let handlePath = obj.handle;\n                    if (handlePath.startsWith(\"/\")) {\n                        handlePath = handlePath.substr(1);\n                    }\n                    // Ensure only whole data stores can be reused, no reusing at deeper level!\n                    assert(level === 0, 0x0fc /* \"tree reuse at lower level\" */);\n                    assert(handlePath.indexOf(\"/\") === -1,\n                        0x0fd /* \"data stores are writing incremental summaries!\" */);\n                    break;\n                }\n                case SummaryType.Attachment:\n                    assert(this.isRealStorageId(obj.id), 0x0fe /* \"attachment is aggregate blob\" */);\n                    break;\n                default:\n                    unreachableCase(obj, `Unknown type: ${(obj as any).type}`);\n            }\n        }\n\n        assert(newSummary.tree[this.aggregatedBlobName] === undefined, 0x0ff /* \"duplicate aggregate blob\" */);\n        if (shouldCompress) {\n            // Note: It would be great to add code here to unpack aggregate blob back to normal blobs\n            // If only one blob made it into aggregate. Currently that does not happen as we always have\n            // at least one .component blob and at least one DDS that has .attributes blob, so it's not an issue.\n            // But it's possible that in future that would be great addition!\n            // Good news - it's backward compatible change.\n            assert(aggregator !== undefined, 0x100 /* \"logic error\" */);\n            const content = aggregator.getAggregatedBlobContent();\n            if (content !== undefined) {\n                newSummary.tree[this.aggregatedBlobName] = {\n                    type: SummaryType.Blob,\n                    content,\n                };\n            }\n        }\n        return newSummary;\n    }\n\n    protected isRealStorageId(id: string): boolean {\n        return !id.startsWith(this.virtualIdPrefix);\n    }\n}\n"]}
+{"version":3,"file":"blobAggregationStorage.js","sourceRoot":"","sources":["../src/blobAggregationStorage.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAOH,+EAQ8C;AAC9C,+DAOuC;AAGvC,6DAA6D;AAC7D,oFAAoF;AACpF,sEAAsE;AACtE,SAAS,iBAAiB;IACtB,IAAI;QACA,sCAAsC;QACtC,2CAA2C;QAC3C,IAAI,OAAO,YAAY,KAAK,QAAQ,IAAI,YAAY,KAAK,IAAI,EAAE;YAC3D,IAAK,YAAY,CAAC,mBAAmB,KAAK,GAAG,EAAE;gBAC3C,OAAO,IAAI,CAAC;aACf;YACD,IAAK,YAAY,CAAC,mBAAmB,KAAK,GAAG,EAAE;gBAC3C,OAAO,KAAK,CAAC;aAChB;SACJ;KACJ;IAAC,OAAO,CAAC,EAAE,GAAE;IAEd,4BAA4B;IAC5B,OAAO,KAAK,CAAC;AACjB,CAAC;AAED;;;EAGE;AACF,SAAS,eAAe,CAAC,IAAqB,EAAE,QAA4B;IACxE,IAAI,IAAI,YAAY,UAAU,EAAE,EAAE,8DAA8D;QAC5F,OAAO,iCAAkB,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;KAC7C;IACD,OAAO,6BAAc,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;AAC1C,CAAC;AAEA;;GAEG;AACJ,MAAM,cAAc;IAApB;QACqB,YAAO,GAAsB,EAAE,CAAC;IAiBrD,CAAC;IAfU,OAAO,CAAC,GAAW,EAAE,OAAe;QACvC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC,CAAC;IACtC,CAAC;IAEM,wBAAwB;QAC3B,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE;YAC3B,OAAO,SAAS,CAAC;SACpB;QACD,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACxC,CAAC;IAED,MAAM,CAAC,IAAI,CAAC,KAAsB;QAC9B,MAAM,IAAI,GAAG,eAAe,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;QAC7C,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAuB,CAAC;IAClD,CAAC;CACJ;AAED;;;GAGG;AACH,MAAsB,iBAAiB;IAAvC;QACuB,uBAAkB,GAAG,OAAO,CAAC;QAC7B,oBAAe,GAAG,IAAI,CAAC;QAE1C,gDAAgD;QACtC,qBAAgB,GAAG,CAAC,CAAC;IAyCnC,CAAC;IAxCa,gBAAgB;QACtB,OAAO,GAAG,IAAI,CAAC,eAAe,GAAG,EAAE,IAAI,CAAC,gBAAgB,EAAE,CAAC;IAC/D,CAAC;IAKM,KAAK,CAAC,kBAAkB,CAAC,QAAuB,EAAE,KAAK,GAAG,CAAC;QAC9D,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE;YAC3C,MAAM,GAAG,GAAG,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;YAChC,MAAM,IAAI,CAAC,kBAAkB,CAAC,GAAG,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;SACjD;QAED,4EAA4E;QAC5E,2CAA2C;QAC3C,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE;YAC3C,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,kBAAkB,CAAC,EAAE;gBAAE,SAAS;aAAE;YAC3D,MAAM,MAAM,GAAG,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;YACnC,IAAI,MAAM,KAAK,SAAS,EAAE;gBACtB,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;oBACnD,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;wBAC5D,IAAI,OAAO,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,SAAS,EAAE;4BACtC,OAAO,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAC,CAAC;yBACjE;wBACD,OAAO,GAAG,OAAO,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;qBACpC;oBACD,MAAM,QAAQ,GAAG,SAAS,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;oBACjD,qBAAM,CAAC,OAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,KAAK,SAAS,EAAE,KAAK,CAAC,2BAA2B,CAAC,CAAC;oBACjF,OAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,GAAG,EAAE,CAAC;iBAChC;gBACD,gEAAgE;gBAChE,OAAO,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAC;aAClD;SACJ;IACL,CAAC;CACJ;AA9CD,8CA8CC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,wBAAyB,SAAQ,iBAAiB;IAC7C,KAAK,CAAC,OAAO,CAAC,EAAU,EAAE,IAAmB;QAChD,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QAC5B,qBAAM,CAAC,IAAI,KAAK,SAAS,EAAE,KAAK,CAAC,8BAA8B,CAAC,CAAC;QACjE,OAAO,6BAAc,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;IAC1C,CAAC;IAEM,OAAO,CAAC,EAAU,EAAE,IAAmB,EAAE,OAAe;QAC3D,qBAAM,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,SAAS,EAAE,KAAK,CAAC,kDAAkD,CAAC,CAAC;QAC/F,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,GAAG,+BAAgB,CAAC,OAAO,CAAC,CAAC;IAC/C,CAAC;CACJ;AAED;;;;GAIG;AACH,MAAa,sBAAuB,SAAQ,iBAAiB;IAsDzD,YACqB,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;QA9ClC,sBAAiB,GAAG,KAAK,CAAC;QAE1B,iBAAY,GAAG,IAAI,GAAG,EAA2B,CAAC;IA+C5D,CAAC;IA7CD,MAAM,CAAC,IAAI,CACP,OAAgC,EAChC,MAAwB,EACxB,YAAY,GAAG,iBAAiB,EAAE,EAClC,YAAY,GAAG,CAAC;;QAEhB,IAAI,OAAO,YAAY,sBAAsB,EAAE;YAC3C,OAAO,OAAO,CAAC;SAClB;QACD,kFAAkF;QAClF,4FAA4F;QAC5F,wDAAwD;QACxD,MAAM,WAAW,SAAG,OAAO,CAAC,QAAQ,0CAAE,WAAW,CAAC;QAClD,OAAO,IAAI,sBAAsB,CAAC,OAAO,EAAE,MAAM,EAAE,YAAY,EAAE,YAAY,EAAE,WAAW,CAAC,CAAC;IAChG,CAAC;IAED,MAAM,CAAC,KAAK,CAAC,cAAc,CAAC,QAAuB;QAC/C,MAAM,SAAS,GAAG,IAAI,wBAAwB,EAAE,CAAC;QACjD,MAAM,SAAS,CAAC,kBAAkB,CAAC,QAAQ,CAAC,CAAC;IACjD,CAAC;IAED,IAAW,QAAQ;QACf,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC;QACvC,IAAI,QAAQ,EAAE;YACV,uCAAY,QAAQ,KAAE,WAAW,EAAE,SAAS,IAAG;SAClD;IACL,CAAC;IAEM,KAAK,CAAC,cAAc,CAAC,QAAuB;QAC/C,8FAA8F;QAC9F,qCAAqC;QACrC,6DAA6D;QAE7D,IAAI,CAAC,iBAAiB,GAAG,IAAI,CAAC;QAC9B,MAAM,IAAI,CAAC,kBAAkB,CAAC,QAAQ,CAAC,CAAC;IAC5C,CAAC;IAYM,OAAO,CAAC,EAAU,EAAE,IAAmB,EAAE,OAAe;QAC3D,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,EAAE,EAAE,6BAAc,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC;IAChE,CAAC;IAEM,KAAK,CAAC,OAAO,CAAC,EAAU,EAAE,IAAmB;QAChD,OAAO,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,EAAE;YACrC,IAAI,CAAC,MAAM,CAAC,cAAc,CAAC,EAAE,SAAS,EAAE,0BAA0B,EAAE,EAAE,KAAK,CAAC,CAAC;YAC7E,MAAM,KAAK,CAAC;QAChB,CAAC,CAAC,CAAC;IACP,CAAC;IAED,IAAW,aAAa,KAAK,OAAO,IAAI,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC;IAC1D,KAAK,CAAC,WAAW,CAAC,SAAwB,EAAE,KAAa;QAC5D,OAAO,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;IACtD,CAAC;IAEM,KAAK,CAAC,eAAe,CAAC,MAAsB;QAC/C,MAAM,IAAI,KAAK,CAAC,KAAK,CAAC,CAAC;IAC3B,CAAC;IAED,sEAAsE;IAC/D,KAAK,CAAC,KAAK,CAAC,IAAW,EAAE,OAAiB,EAAE,OAAe,EAAE,GAAW;QAC3E,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,GAAG,CAAC,CAAC;IAC3D,CAAC;IAED,wFAAwF;IACxF,yBAAyB;IAClB,KAAK,CAAC,UAAU,CAAC,IAAqB;QACzC,OAAO,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;IACzC,CAAC;IAEM,KAAK,CAAC,eAAe,CAAC,OAAkB;QAC3C,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,eAAe,CAAC,OAAO,CAAC,CAAC;QACzD,IAAI,IAAI,EAAE;YACN,MAAM,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC;SACnC;QACD,OAAO,IAAI,CAAC;IAChB,CAAC;IAEM,KAAK,CAAC,QAAQ,CAAC,EAAU;QAC5B,IAAI,IAAI,CAAC,eAAe,CAAC,EAAE,CAAC,EAAE;YAC1B,OAAO,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;SACpC;QACD,iEAAiE;QACjE,6FAA6F;QAC7F,oGAAoG;QACpG,uCAAuC;QAEvC,mGAAmG;QACnG,eAAe;QACf,qBAAM,CAAC,IAAI,CAAC,iBAAiB,EAAE,KAAK,CAAC,0BAA0B,CAAC,CAAC;QACjE,MAAM,IAAI,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACvC,qBAAM,CAAC,IAAI,KAAK,SAAS,EAAE,KAAK,CAAC,8BAA8B,CAAC,CAAC;QACjE,OAAO,IAAI,CAAC;IAChB,CAAC;IAEM,KAAK,CAAC,wBAAwB,CAAC,OAAqB,EAAE,OAAwB;QACjF,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;IACtE,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,mHAAmH;IACnH,mDAAmD;IAC3C,KAAK,CAAC,kBAAkB,CAC5B,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;YAC9D,OAAO,OAAO,CAAC;SAClB;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;YAClD,qBAAM,CAAC,UAAU,KAAK,SAAS,EAAE,KAAK,CAAC,iCAAiC,CAAC,CAAC;YAC1E,qBAAM,CAAC,KAAK,KAAK,IAAI,CAAC,YAAY,EAAE,KAAK,CAAC,6CAA6C,CAAC,CAAC;YACzF,UAAU,GAAG,IAAI,cAAc,EAAE,CAAC;YAClC,cAAc,GAAG,IAAI,CAAC;SACzB;aAAM;YACH,qBAAM,CAAC,KAAK,KAAK,IAAI,CAAC,YAAY,EAAE,KAAK,CAAC,6CAA6C,CAAC,CAAC;SAC5F;QAED,MAAM,UAAU,qBAAqB,OAAO,CAAC,CAAC;QAC9C,UAAU,CAAC,IAAI,qBAAQ,UAAU,CAAC,IAAI,CAAC,CAAC;QACxC,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;YACzC,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;gBACd,KAAK,kCAAW,CAAC,IAAI;oBACjB,8CAA8C;oBAC9C,uEAAuE;oBACvE,IAAI,GAAG,CAAC,IAAI,KAAK,EAAE,IAAI,GAAG,KAAK,UAAU,EAAE;wBACvC,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,kBAAkB,CAAC,GAAG,EAAE,OAAO,EAAE,KAAK,GAAG,CAAC,EAAE,UAAU,CAAC,CAAC;wBAChF,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC;wBAC5B,IAAI,IAAI,CAAC,IAAI,KAAK,EAAE,EAAE;4BAClB,gEAAgE;4BAChE,OAAO,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;yBAC/B;qBACJ;oBACD,MAAM;gBACV,KAAK,kCAAW,CAAC,IAAI;oBACjB,IAAI,UAAU,IAAI,OAAO,GAAG,CAAC,OAAO,IAAI,QAAQ,IAAI,GAAG,CAAC,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC,cAAc,EAAE;wBAC1F,UAAU,CAAC,OAAO,CAAC,OAAO,EAAE,GAAG,CAAC,OAAO,CAAC,CAAC;wBACzC,gEAAgE;wBAChE,OAAO,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;qBAC/B;oBACD,MAAM;gBACV,KAAK,kCAAW,CAAC,MAAM,CAAC,CAAC;oBACrB,oBAAoB;oBACpB,yBAAyB;oBACzB,2EAA2E;oBAC3E,wFAAwF;oBACxF,IAAI,UAAU,GAAG,GAAG,CAAC,MAAM,CAAC;oBAC5B,IAAI,UAAU,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE;wBAC5B,UAAU,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;qBACrC;oBACD,2EAA2E;oBAC3E,qBAAM,CAAC,KAAK,KAAK,CAAC,EAAE,KAAK,CAAC,iCAAiC,CAAC,CAAC;oBAC7D,qBAAM,CAAC,UAAU,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EACjC,KAAK,CAAC,sDAAsD,CAAC,CAAC;oBAClE,MAAM;iBACT;gBACD,KAAK,kCAAW,CAAC,UAAU;oBACvB,qBAAM,CAAC,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,oCAAoC,CAAC,CAAC;oBACjF,MAAM;gBACV;oBACI,8BAAe,CAAC,GAAG,EAAE,iBAAkB,GAAW,CAAC,IAAI,EAAE,CAAC,CAAC;aAClE;SACJ;QAED,qBAAM,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,KAAK,SAAS,EAAE,KAAK,CAAC,gCAAgC,CAAC,CAAC;QACvG,IAAI,cAAc,EAAE;YAChB,yFAAyF;YACzF,4FAA4F;YAC5F,qGAAqG;YACrG,iEAAiE;YACjE,+CAA+C;YAC/C,qBAAM,CAAC,UAAU,KAAK,SAAS,EAAE,KAAK,CAAC,mBAAmB,CAAC,CAAC;YAC5D,MAAM,OAAO,GAAG,UAAU,CAAC,wBAAwB,EAAE,CAAC;YACtD,IAAI,OAAO,KAAK,SAAS,EAAE;gBACvB,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,GAAG;oBACvC,IAAI,EAAE,kCAAW,CAAC,IAAI;oBACtB,OAAO;iBACV,CAAC;aACL;SACJ;QACD,OAAO,UAAU,CAAC;IACtB,CAAC;IAES,eAAe,CAAC,EAAU;QAChC,OAAO,CAAC,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;IAChD,CAAC;;AAtOL,wDAuOC;AAtOG,4FAA4F;AAC5F,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     IDocumentStorageService,\n    IDocumentStorageServicePolicies,\n     ISummaryContext,\n} from \"@fluidframework/driver-definitions\";\nimport {\n    ICreateBlobResponse,\n    ISnapshotTree,\n    ISummaryHandle,\n    ISummaryTree,\n    IVersion,\n    SummaryType,\n    ITree,\n} from \"@fluidframework/protocol-definitions\";\nimport {\n    assert,\n    bufferToString,\n    stringToBuffer,\n    unreachableCase,\n    fromUtf8ToBase64,\n    Uint8ArrayToString,\n } from \"@fluidframework/common-utils\";\nimport { ITelemetryLogger } from \"@fluidframework/common-definitions\";\n\n// Gate that when flipped, instructs to compress small blobs.\n// We have to first ship with this gate off, such that we can get to saturation bits\n// that can understand compressed format. And only after that flip it.\nfunction gatesAllowPacking() {\n    try {\n        // Leave override for testing purposes\n        // eslint-disable-next-line no-null/no-null\n        if (typeof localStorage === \"object\" && localStorage !== null) {\n            if  (localStorage.FluidAggregateBlobs === \"1\") {\n                return true;\n            }\n            if  (localStorage.FluidAggregateBlobs === \"0\") {\n                return false;\n            }\n        }\n    } catch (e) {}\n\n    // We are starting disabled.\n    return false;\n}\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    if (blob instanceof Uint8Array) { // IsoBuffer does not have ctor, so it's not in proto chain :(\n        return Uint8ArrayToString(blob, encoding);\n    }\n    return bufferToString(blob, encoding);\n}\n\n /**\n  * Class responsible for aggregating smaller blobs into one and unpacking it later on.\n  */\nclass BlobAggregator {\n    private readonly content: [string, string][]= [];\n\n    public addBlob(key: string, content: string) {\n        this.content.push([key, content]);\n    }\n\n    public getAggregatedBlobContent() {\n        if (this.content.length === 0) {\n            return undefined;\n        }\n        return JSON.stringify(this.content);\n    }\n\n    static load(input: ArrayBufferLike) {\n        const data = bufferToString2(input, \"utf-8\");\n        return JSON.parse(data) as [string, string][];\n    }\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 */\nexport abstract class SnapshotExtractor {\n    protected readonly aggregatedBlobName = \"__big\";\n    protected readonly virtualIdPrefix = \"__\";\n\n    // counter for generation of virtual storage IDs\n    protected virtualIdCounter = 0;\n    protected getNextVirtualId() {\n        return `${this.virtualIdPrefix}${++this.virtualIdCounter}`;\n    }\n\n    abstract getBlob(id: string, tree: ISnapshotTree): Promise<ArrayBufferLike>;\n    abstract setBlob(id: string, tree: ISnapshotTree, content: string);\n\n    public async unpackSnapshotCore(snapshot: ISnapshotTree, level = 0): Promise<void> {\n        for (const key of Object.keys(snapshot.trees)) {\n            const obj = snapshot.trees[key];\n            await this.unpackSnapshotCore(obj, level + 1);\n        }\n\n        // For future proof, we will support multiple aggregated blobs with any name\n        // that starts with this.aggregatedBlobName\n        for (const key of Object.keys(snapshot.blobs)) {\n            if (!key.startsWith(this.aggregatedBlobName)) { continue; }\n            const blobId = snapshot.blobs[key];\n            if (blobId !== undefined) {\n                const blob = await this.getBlob(blobId, snapshot);\n                for (const [path, value] of BlobAggregator.load(blob)) {\n                    const id = this.getNextVirtualId();\n                    this.setBlob(id, snapshot, value);\n                    const pathSplit = path.split(\"/\");\n                    let subTree = snapshot;\n                    for (const subPath of pathSplit.slice(0, pathSplit.length - 1)) {\n                        if (subTree.trees[subPath] === undefined) {\n                            subTree.trees[subPath] = { blobs: {}, commits: {}, trees: {}};\n                        }\n                        subTree = subTree.trees[subPath];\n                    }\n                    const blobName = pathSplit[pathSplit.length - 1];\n                    assert(subTree.blobs[blobName] === undefined, 0x0f6 /* \"real blob ID exists\" */);\n                    subTree.blobs[blobName] = id;\n                }\n                // eslint-disable-next-line @typescript-eslint/no-dynamic-delete\n                delete snapshot.blobs[this.aggregatedBlobName];\n            }\n        }\n    }\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    public async getBlob(id: string, tree: ISnapshotTree): Promise<ArrayBufferLike> {\n        const blob = tree.blobs[id];\n        assert(blob !== undefined, 0x0f7 /* \"aggregate blob missing\" */);\n        return stringToBuffer(blob, \"base64\");\n    }\n\n    public setBlob(id: string, tree: ISnapshotTree, content: string) {\n        assert(tree.blobs[id] === undefined, 0x0f8 /* \"blob from aggregate blob exists on its own\" */);\n        tree.blobs[id] = fromUtf8ToBase64(content);\n    }\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 */\nexport class BlobAggregationStorage extends SnapshotExtractor implements IDocumentStorageService {\n    // Tells data store if it can use incremental summary (i.e. reuse DDSs from previous summary\n    // when only one DDS changed).\n    // The answer has to be know long before we enable actual packing. The reason for the is the following:\n    // A the moment when we enable packing, we should assume that all clients out there wil already have bits\n    // that can unpack properly (i.e. enough time passed since we deployed bits that can unpack)\n    // But we can still have clients where some of them already pack, and some do not. If one summary was\n    // using packing, then it relies on non-incremental summaries going forward, even if next client who\n    // produced summary is not packing!\n    // This can have slight improvement by enabling it per file (based on \"did summary we loaded from contain\n    // aggregated blobs\"), but that's harder to make reliable, so going for simplicity.\n    static readonly fullDataStoreSummaries = true;\n\n    protected loadedFromSummary = false;\n\n    protected virtualBlobs = new Map<string, ArrayBufferLike>();\n\n    static wrap(\n        storage: IDocumentStorageService,\n        logger: ITelemetryLogger,\n        allowPacking = gatesAllowPacking(),\n        packingLevel = 2,\n    ) {\n        if (storage instanceof BlobAggregationStorage) {\n            return storage;\n        }\n        // Always create BlobAggregationStorage even if storage is not asking for packing.\n        // This is mostly to avoid cases where future changes in policy would result in inability to\n        // load old files that were created with aggregation on.\n        const minBlobSize = storage.policies?.minBlobSize;\n        return new BlobAggregationStorage(storage, logger, allowPacking, packingLevel, minBlobSize);\n    }\n\n    static async unpackSnapshot(snapshot: ISnapshotTree) {\n        const converter = new SnapshotExtractorInPlace();\n        await converter.unpackSnapshotCore(snapshot);\n    }\n\n    public get policies(): IDocumentStorageServicePolicies | undefined {\n        const policies = this.storage.policies;\n        if (policies) {\n            return { ...policies, minBlobSize: undefined };\n        }\n    }\n\n    public async unpackSnapshot(snapshot: ISnapshotTree) {\n        // SummarizerNodeWithGC.refreshLatestSummary can call it when this.loadedFromSummary === false\n        // (I assumed after file was created)\n        // assert(!this.loadedFromSummary, \"unpack without summary\");\n\n        this.loadedFromSummary = true;\n        await this.unpackSnapshotCore(snapshot);\n    }\n\n    protected constructor(\n        private readonly storage: IDocumentStorageService,\n        private readonly logger: ITelemetryLogger,\n        private readonly allowPacking: boolean,\n        private readonly packingLevel: number,\n        private readonly blobCutOffSize?: number)\n    {\n        super();\n    }\n\n    public setBlob(id: string, tree: ISnapshotTree, content: string) {\n        this.virtualBlobs.set(id, stringToBuffer(content, \"utf-8\"));\n    }\n\n    public async getBlob(id: string, tree: ISnapshotTree): Promise<ArrayBufferLike> {\n        return this.readBlob(id).catch((error) => {\n            this.logger.sendErrorEvent({ eventName: \"BlobDedupNoAggregateBlob\" }, error);\n            throw error;\n        });\n    }\n\n    public get repositoryUrl() { return this.storage.repositoryUrl; }\n    public async getVersions(versionId: string | null, count: number) {\n        return this.storage.getVersions(versionId, count);\n    }\n\n    public async downloadSummary(handle: ISummaryHandle): Promise<ISummaryTree> {\n        throw new Error(\"NYI\");\n    }\n\n    // This is only used through Container.snapshot() for testing purposes\n    public async write(root: ITree, parents: string[], message: string, ref: string) {\n        return this.storage.write(root, parents, message, ref);\n    }\n\n    // for now we are not optimizing these blobs, with assumption that this API is used only\n    // for big blobs (images)\n    public async createBlob(file: ArrayBufferLike): Promise<ICreateBlobResponse> {\n        return this.storage.createBlob(file);\n    }\n\n    public async getSnapshotTree(version?: IVersion): Promise<ISnapshotTree | null> {\n        const tree = await this.storage.getSnapshotTree(version);\n        if (tree) {\n            await this.unpackSnapshot(tree);\n        }\n        return tree;\n    }\n\n    public async readBlob(id: string): Promise<ArrayBufferLike> {\n        if (this.isRealStorageId(id)) {\n            return this.storage.readBlob(id);\n        }\n        // We support only reading blobs from the summary we loaded from.\n        // This may need to be extended to any general summary in the future as runtime usage pattern\n        // of storage changes (for example, data stores start to load from recent summary, not from original\n        // summary whole container loaded from)\n\n        // are there other ways we can get here? createFile is one flow, but we should not be reading blobs\n        // in such flow\n        assert(this.loadedFromSummary, 0x0f9 /* \"never read summary\" */);\n        const blob = this.virtualBlobs.get(id);\n        assert(blob !== undefined, 0x0fa /* \"virtual blob not found\" */);\n        return blob;\n    }\n\n    public async uploadSummaryWithContext(summary: ISummaryTree, context: ISummaryContext): Promise<string> {\n        const summaryNew = this.allowPacking ? await this.compressSmallBlobs(summary) : summary;\n        return this.storage.uploadSummaryWithContext(summaryNew, context);\n    }\n\n    // For simplification, we assume that\n    // - blob aggregation is done at data store level only for now\n    // - data store either reuses previous summary, or generates full summary, i.e. there is no partial (some DDS)\n    // summary produced by data stores.\n    // These simplifications allow us not to touch handles, as they are self-contained (either do not use aggregated\n    // blob Or contain aggregated blob that stays relevant for that sub-tree)\n    // Note:\n    // From perf perspective, it makes sense to place aggregated blobs one level up in the tree not to create extra\n    // tree nodes (i.e. have shallow tree with less edges). But that creates problems with reusability of trees at\n    // incremental summary time - we would need to understand handles and parse them. In current design we can skip\n    // that step because if data store is reused, the hole sub-tree is reused included aggregated blob embedded into it\n    // and that means we can do nothing and be correct!\n    private async compressSmallBlobs(\n        summary: ISummaryTree,\n        path = \"\",\n        level = 0,\n        aggregatorArg?: BlobAggregator): Promise<ISummaryTree>\n    {\n        if (this.blobCutOffSize === undefined || this.blobCutOffSize < 0) {\n            return summary;\n        }\n\n        let shouldCompress: boolean = false;\n\n        let aggregator = aggregatorArg;\n        // checking if this is a dataStore tree, since we only pack at data store level\n        if (Object.keys(summary.tree).includes(\".component\")) {\n            assert(aggregator === undefined, 0x0fb /* \"logic err with aggregator\" */);\n            assert(level === this.packingLevel, 0x23b /* \"we are not packing at the right level\" */);\n            aggregator = new BlobAggregator();\n            shouldCompress = true;\n        } else {\n            assert(level !== this.packingLevel, 0x23c /* \"we are not packing at the right level\" */);\n        }\n\n        const newSummary: ISummaryTree = {...summary};\n        newSummary.tree = { ...newSummary.tree};\n        for (const key of Object.keys(summary.tree)) {\n            const obj = summary.tree[key];\n            // Get path relative to root of data store (where we do aggregation)\n            const newPath = shouldCompress ? key : `${path}/${key}`;\n            switch (obj.type) {\n                case SummaryType.Tree:\n                    // If client created empty tree, keep it as is\n                    // Also do not package search blobs - they are part of storage contract\n                    if (obj.tree !== {} && key !== \"__search\") {\n                        const tree = await this.compressSmallBlobs(obj, newPath, level + 1, aggregator);\n                        newSummary.tree[key] = tree;\n                        if (tree.tree === {}) {\n                            // eslint-disable-next-line @typescript-eslint/no-dynamic-delete\n                            delete newSummary.tree[key];\n                        }\n                    }\n                    break;\n                case SummaryType.Blob:\n                    if (aggregator && typeof obj.content == \"string\" && obj.content.length < this.blobCutOffSize) {\n                        aggregator.addBlob(newPath, obj.content);\n                        // eslint-disable-next-line @typescript-eslint/no-dynamic-delete\n                        delete newSummary.tree[key];\n                    }\n                    break;\n                case SummaryType.Handle: {\n                    // Would be nice to:\n                    // Trees: expand the tree\n                    // Blobs: parse handle and ensure it points to real blob, not virtual blob.\n                    // We can avoid it for now given data store is the granularity of incremental summaries.\n                    let handlePath = obj.handle;\n                    if (handlePath.startsWith(\"/\")) {\n                        handlePath = handlePath.substr(1);\n                    }\n                    // Ensure only whole data stores can be reused, no reusing at deeper level!\n                    assert(level === 0, 0x0fc /* \"tree reuse at lower level\" */);\n                    assert(handlePath.indexOf(\"/\") === -1,\n                        0x0fd /* \"data stores are writing incremental summaries!\" */);\n                    break;\n                }\n                case SummaryType.Attachment:\n                    assert(this.isRealStorageId(obj.id), 0x0fe /* \"attachment is aggregate blob\" */);\n                    break;\n                default:\n                    unreachableCase(obj, `Unknown type: ${(obj as any).type}`);\n            }\n        }\n\n        assert(newSummary.tree[this.aggregatedBlobName] === undefined, 0x0ff /* \"duplicate aggregate blob\" */);\n        if (shouldCompress) {\n            // Note: It would be great to add code here to unpack aggregate blob back to normal blobs\n            // If only one blob made it into aggregate. Currently that does not happen as we always have\n            // at least one .component blob and at least one DDS that has .attributes blob, so it's not an issue.\n            // But it's possible that in future that would be great addition!\n            // Good news - it's backward compatible change.\n            assert(aggregator !== undefined, 0x100 /* \"logic error\" */);\n            const content = aggregator.getAggregatedBlobContent();\n            if (content !== undefined) {\n                newSummary.tree[this.aggregatedBlobName] = {\n                    type: SummaryType.Blob,\n                    content,\n                };\n            }\n        }\n        return newSummary;\n    }\n\n    protected isRealStorageId(id: string): boolean {\n        return !id.startsWith(this.virtualIdPrefix);\n    }\n}\n"]}

package/dist/packageVersion.d.ts

@@ -5,5 +5,5 @@
  * THIS IS AN AUTOGENERATED FILE. DO NOT EDIT THIS FILE DIRECTLY
  */
 export declare const pkgName = "@fluidframework/driver-utils";
-export declare const pkgVersion = "0.51.0-43124";
+export declare const pkgVersion = "0.52.0-44610";
 //# sourceMappingURL=packageVersion.d.ts.map

package/dist/packageVersion.js

@@ -8,5 +8,5 @@
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.pkgVersion = exports.pkgName = void 0;
 exports.pkgName = "@fluidframework/driver-utils";
-exports.pkgVersion = "0.51.0-43124";
+exports.pkgVersion = "0.52.0-44610";
 //# sourceMappingURL=packageVersion.js.map

package/dist/packageVersion.js.map

@@ -1 +1 @@
-{"version":3,"file":"packageVersion.js","sourceRoot":"","sources":["../src/packageVersion.ts"],"names":[],"mappings":";AAAA;;;;;GAKG;;;AAEU,QAAA,OAAO,GAAG,8BAA8B,CAAC;AACzC,QAAA,UAAU,GAAG,cAAc,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n *\n * THIS IS AN AUTOGENERATED FILE. DO NOT EDIT THIS FILE DIRECTLY\n */\n\nexport const pkgName = \"@fluidframework/driver-utils\";\nexport const pkgVersion = \"0.51.0-43124\";\n"]}
+{"version":3,"file":"packageVersion.js","sourceRoot":"","sources":["../src/packageVersion.ts"],"names":[],"mappings":";AAAA;;;;;GAKG;;;AAEU,QAAA,OAAO,GAAG,8BAA8B,CAAC;AACzC,QAAA,UAAU,GAAG,cAAc,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n *\n * THIS IS AN AUTOGENERATED FILE. DO NOT EDIT THIS FILE DIRECTLY\n */\n\nexport const pkgName = \"@fluidframework/driver-utils\";\nexport const pkgVersion = \"0.52.0-44610\";\n"]}

package/dist/summaryForCreateNew.js

@@ -5,6 +5,7 @@
  */
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.getQuorumValuesFromProtocolSummary = exports.getDocAttributesFromProtocolSummary = exports.combineAppAndProtocolSummary = void 0;
+const protocol_definitions_1 = require("@fluidframework/protocol-definitions");
 /**
  * Combine the app summary and protocol summary in 1 tree.
  * @param appSummary - Summary of the app.
@@ -12,7 +13,7 @@ exports.getQuorumValuesFromProtocolSummary = exports.getDocAttributesFromProtoco
  */
 function combineAppAndProtocolSummary(appSummary, protocolSummary) {
     const createNewSummary = {
-        type: 1 /* Tree */,
+        type: protocol_definitions_1.SummaryType.Tree,
         tree: {
             ".protocol": protocolSummary,
             ".app": appSummary,

package/dist/summaryForCreateNew.js.map

@@ -1 +1 @@
-{"version":3,"file":"summaryForCreateNew.js","sourceRoot":"","sources":["../src/summaryForCreateNew.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAUH;;;;GAIG;AACH,SAAgB,4BAA4B,CACxC,UAAwB,EACxB,eAA6B;IAE7B,MAAM,gBAAgB,GAAiB;QACnC,IAAI,cAAkB;QACtB,IAAI,EAAE;YACF,WAAW,EAAE,eAAe;YAC5B,MAAM,EAAE,UAAU;SACrB;KACJ,CAAC;IACF,OAAO,gBAAgB,CAAC;AAC5B,CAAC;AAZD,oEAYC;AAED;;;GAGG;AACH,SAAgB,mCAAmC,CAC/C,eAA6B;;IAE7B,MAAM,cAAc,GAAG,eAAe,CAAC,IAAI,CAAC,UAA0B,CAAC;IACvE,MAAM,kBAAkB,GAAG,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,OAAiB,CAAwB,CAAC;IAC/F,kBAAkB,CAAC,IAAI,SAAG,kBAAkB,CAAC,IAAI,mCAAI,CAAC,CAAC;IACvD,OAAO,kBAAkB,CAAC;AAC9B,CAAC;AAPD,kFAOC;AAED;;;GAGG;AACH,SAAgB,kCAAkC,CAC9C,eAA6B;IAE7B,MAAM,gBAAgB,GAAG,eAAe,CAAC,IAAI,CAAC,YAA4B,CAAC;IAC3E,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,gBAAgB,CAAC,OAAiB,CAAmC,CAAC;IACtG,OAAO,YAAY,CAAC;AACxB,CAAC;AAND,gFAMC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport {\n    ISummaryTree,\n    SummaryType,\n    ISummaryBlob,\n    ICommittedProposal,\n    IDocumentAttributes,\n} from \"@fluidframework/protocol-definitions\";\n\n/**\n * Combine the app summary and protocol summary in 1 tree.\n * @param appSummary - Summary of the app.\n * @param protocolSummary - Summary of the protocol.\n */\nexport function combineAppAndProtocolSummary(\n    appSummary: ISummaryTree,\n    protocolSummary: ISummaryTree,\n): ISummaryTree {\n    const createNewSummary: ISummaryTree = {\n        type: SummaryType.Tree,\n        tree: {\n            \".protocol\": protocolSummary,\n            \".app\": appSummary,\n        },\n    };\n    return createNewSummary;\n}\n\n/**\n * Extract the attributes from the protocol summary.\n * @param protocolSummary - protocol summary from which the values are to be extracted.\n */\nexport function getDocAttributesFromProtocolSummary(\n    protocolSummary: ISummaryTree,\n): IDocumentAttributes {\n    const attributesBlob = protocolSummary.tree.attributes as ISummaryBlob;\n    const documentAttributes = JSON.parse(attributesBlob.content as string) as IDocumentAttributes;\n    documentAttributes.term = documentAttributes.term ?? 1;\n    return documentAttributes;\n}\n\n/**\n * Extract quorum values from the protocol summary.\n * @param protocolSummary - protocol summary from which the values are to be extracted.\n */\nexport function getQuorumValuesFromProtocolSummary(\n    protocolSummary: ISummaryTree,\n): [string, ICommittedProposal][] {\n    const quorumValuesBlob = protocolSummary.tree.quorumValues as ISummaryBlob;\n    const quorumValues = JSON.parse(quorumValuesBlob.content as string) as [string, ICommittedProposal][];\n    return quorumValues;\n}\n"]}
+{"version":3,"file":"summaryForCreateNew.js","sourceRoot":"","sources":["../src/summaryForCreateNew.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,+EAM8C;AAE9C;;;;GAIG;AACH,SAAgB,4BAA4B,CACxC,UAAwB,EACxB,eAA6B;IAE7B,MAAM,gBAAgB,GAAiB;QACnC,IAAI,EAAE,kCAAW,CAAC,IAAI;QACtB,IAAI,EAAE;YACF,WAAW,EAAE,eAAe;YAC5B,MAAM,EAAE,UAAU;SACrB;KACJ,CAAC;IACF,OAAO,gBAAgB,CAAC;AAC5B,CAAC;AAZD,oEAYC;AAED;;;GAGG;AACH,SAAgB,mCAAmC,CAC/C,eAA6B;;IAE7B,MAAM,cAAc,GAAG,eAAe,CAAC,IAAI,CAAC,UAA0B,CAAC;IACvE,MAAM,kBAAkB,GAAG,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,OAAiB,CAAwB,CAAC;IAC/F,kBAAkB,CAAC,IAAI,SAAG,kBAAkB,CAAC,IAAI,mCAAI,CAAC,CAAC;IACvD,OAAO,kBAAkB,CAAC;AAC9B,CAAC;AAPD,kFAOC;AAED;;;GAGG;AACH,SAAgB,kCAAkC,CAC9C,eAA6B;IAE7B,MAAM,gBAAgB,GAAG,eAAe,CAAC,IAAI,CAAC,YAA4B,CAAC;IAC3E,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,gBAAgB,CAAC,OAAiB,CAAmC,CAAC;IACtG,OAAO,YAAY,CAAC;AACxB,CAAC;AAND,gFAMC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport {\n    ISummaryTree,\n    SummaryType,\n    ISummaryBlob,\n    ICommittedProposal,\n    IDocumentAttributes,\n} from \"@fluidframework/protocol-definitions\";\n\n/**\n * Combine the app summary and protocol summary in 1 tree.\n * @param appSummary - Summary of the app.\n * @param protocolSummary - Summary of the protocol.\n */\nexport function combineAppAndProtocolSummary(\n    appSummary: ISummaryTree,\n    protocolSummary: ISummaryTree,\n): ISummaryTree {\n    const createNewSummary: ISummaryTree = {\n        type: SummaryType.Tree,\n        tree: {\n            \".protocol\": protocolSummary,\n            \".app\": appSummary,\n        },\n    };\n    return createNewSummary;\n}\n\n/**\n * Extract the attributes from the protocol summary.\n * @param protocolSummary - protocol summary from which the values are to be extracted.\n */\nexport function getDocAttributesFromProtocolSummary(\n    protocolSummary: ISummaryTree,\n): IDocumentAttributes {\n    const attributesBlob = protocolSummary.tree.attributes as ISummaryBlob;\n    const documentAttributes = JSON.parse(attributesBlob.content as string) as IDocumentAttributes;\n    documentAttributes.term = documentAttributes.term ?? 1;\n    return documentAttributes;\n}\n\n/**\n * Extract quorum values from the protocol summary.\n * @param protocolSummary - protocol summary from which the values are to be extracted.\n */\nexport function getQuorumValuesFromProtocolSummary(\n    protocolSummary: ISummaryTree,\n): [string, ICommittedProposal][] {\n    const quorumValuesBlob = protocolSummary.tree.quorumValues as ISummaryBlob;\n    const quorumValues = JSON.parse(quorumValuesBlob.content as string) as [string, ICommittedProposal][];\n    return quorumValues;\n}\n"]}

package/lib/blobAggregationStorage.js

@@ -2,6 +2,7 @@
  * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
  * Licensed under the MIT License.
  */
+import { SummaryType, } from "@fluidframework/protocol-definitions";
 import { assert, bufferToString, stringToBuffer, unreachableCase, fromUtf8ToBase64, Uint8ArrayToString, } from "@fluidframework/common-utils";
 // Gate that when flipped, instructs to compress small blobs.
 // We have to first ship with this gate off, such that we can get to saturation bits
@@ -257,7 +258,7 @@ export class BlobAggregationStorage extends SnapshotExtractor {
             // Get path relative to root of data store (where we do aggregation)
             const newPath = shouldCompress ? key : `${path}/${key}`;
             switch (obj.type) {
-                case 1 /* Tree */:
+                case SummaryType.Tree:
                     // If client created empty tree, keep it as is
                     // Also do not package search blobs - they are part of storage contract
                     if (obj.tree !== {} && key !== "__search") {
@@ -269,14 +270,14 @@ export class BlobAggregationStorage extends SnapshotExtractor {
                         }
                     }
                     break;
-                case 2 /* Blob */:
+                case 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 3 /* Handle */: {
+                case SummaryType.Handle: {
                     // Would be nice to:
                     // Trees: expand the tree
                     // Blobs: parse handle and ensure it points to real blob, not virtual blob.
@@ -290,7 +291,7 @@ export class BlobAggregationStorage extends SnapshotExtractor {
                     assert(handlePath.indexOf("/") === -1, 0x0fd /* "data stores are writing incremental summaries!" */);
                     break;
                 }
-                case 4 /* Attachment */:
+                case SummaryType.Attachment:
                     assert(this.isRealStorageId(obj.id), 0x0fe /* "attachment is aggregate blob" */);
                     break;
                 default:
@@ -308,7 +309,7 @@ export class BlobAggregationStorage extends SnapshotExtractor {
             const content = aggregator.getAggregatedBlobContent();
             if (content !== undefined) {
                 newSummary.tree[this.aggregatedBlobName] = {
-                    type: 2 /* Blob */,
+                    type: SummaryType.Blob,
                     content,
                 };
             }

package/lib/blobAggregationStorage.js.map

@@ -1 +1 @@
-{"version":3,"file":"blobAggregationStorage.js","sourceRoot":"","sources":["../src/blobAggregationStorage.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAgBH,OAAO,EACH,MAAM,EACN,cAAc,EACd,cAAc,EACd,eAAe,EACf,gBAAgB,EAChB,kBAAkB,GACpB,MAAM,8BAA8B,CAAC;AAGvC,6DAA6D;AAC7D,oFAAoF;AACpF,sEAAsE;AACtE,SAAS,iBAAiB;IACtB,IAAI;QACA,sCAAsC;QACtC,2CAA2C;QAC3C,IAAI,OAAO,YAAY,KAAK,QAAQ,IAAI,YAAY,KAAK,IAAI,EAAE;YAC3D,IAAK,YAAY,CAAC,mBAAmB,KAAK,GAAG,EAAE;gBAC3C,OAAO,IAAI,CAAC;aACf;YACD,IAAK,YAAY,CAAC,mBAAmB,KAAK,GAAG,EAAE;gBAC3C,OAAO,KAAK,CAAC;aAChB;SACJ;KACJ;IAAC,OAAO,CAAC,EAAE,GAAE;IAEd,4BAA4B;IAC5B,OAAO,KAAK,CAAC;AACjB,CAAC;AAED;;;EAGE;AACF,SAAS,eAAe,CAAC,IAAqB,EAAE,QAA4B;IACxE,IAAI,IAAI,YAAY,UAAU,EAAE,EAAE,8DAA8D;QAC5F,OAAO,kBAAkB,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;KAC7C;IACD,OAAO,cAAc,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;AAC1C,CAAC;AAEA;;GAEG;AACJ,MAAM,cAAc;IAApB;QACqB,YAAO,GAAsB,EAAE,CAAC;IAiBrD,CAAC;IAfU,OAAO,CAAC,GAAW,EAAE,OAAe;QACvC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC,CAAC;IACtC,CAAC;IAEM,wBAAwB;QAC3B,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE;YAC3B,OAAO,SAAS,CAAC;SACpB;QACD,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACxC,CAAC;IAED,MAAM,CAAC,IAAI,CAAC,KAAsB;QAC9B,MAAM,IAAI,GAAG,eAAe,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;QAC7C,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAuB,CAAC;IAClD,CAAC;CACJ;AAED;;;GAGG;AACH,MAAM,OAAgB,iBAAiB;IAAvC;QACuB,uBAAkB,GAAG,OAAO,CAAC;QAC7B,oBAAe,GAAG,IAAI,CAAC;QAE1C,gDAAgD;QACtC,qBAAgB,GAAG,CAAC,CAAC;IAyCnC,CAAC;IAxCa,gBAAgB;QACtB,OAAO,GAAG,IAAI,CAAC,eAAe,GAAG,EAAE,IAAI,CAAC,gBAAgB,EAAE,CAAC;IAC/D,CAAC;IAKM,KAAK,CAAC,kBAAkB,CAAC,QAAuB,EAAE,KAAK,GAAG,CAAC;QAC9D,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE;YAC3C,MAAM,GAAG,GAAG,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;YAChC,MAAM,IAAI,CAAC,kBAAkB,CAAC,GAAG,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;SACjD;QAED,4EAA4E;QAC5E,2CAA2C;QAC3C,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE;YAC3C,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,kBAAkB,CAAC,EAAE;gBAAE,SAAS;aAAE;YAC3D,MAAM,MAAM,GAAG,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;YACnC,IAAI,MAAM,KAAK,SAAS,EAAE;gBACtB,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;oBACnD,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;wBAC5D,IAAI,OAAO,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,SAAS,EAAE;4BACtC,OAAO,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAC,CAAC;yBACjE;wBACD,OAAO,GAAG,OAAO,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;qBACpC;oBACD,MAAM,QAAQ,GAAG,SAAS,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;oBACjD,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,KAAK,SAAS,EAAE,KAAK,CAAC,2BAA2B,CAAC,CAAC;oBACjF,OAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,GAAG,EAAE,CAAC;iBAChC;gBACD,gEAAgE;gBAChE,OAAO,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAC;aAClD;SACJ;IACL,CAAC;CACJ;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,wBAAyB,SAAQ,iBAAiB;IAC7C,KAAK,CAAC,OAAO,CAAC,EAAU,EAAE,IAAmB;QAChD,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QAC5B,MAAM,CAAC,IAAI,KAAK,SAAS,EAAE,KAAK,CAAC,8BAA8B,CAAC,CAAC;QACjE,OAAO,cAAc,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;IAC1C,CAAC;IAEM,OAAO,CAAC,EAAU,EAAE,IAAmB,EAAE,OAAe;QAC3D,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,SAAS,EAAE,KAAK,CAAC,kDAAkD,CAAC,CAAC;QAC/F,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,GAAG,gBAAgB,CAAC,OAAO,CAAC,CAAC;IAC/C,CAAC;CACJ;AAED;;;;GAIG;AACH,MAAM,OAAO,sBAAuB,SAAQ,iBAAiB;IAsDzD,YACqB,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;QA9ClC,sBAAiB,GAAG,KAAK,CAAC;QAE1B,iBAAY,GAAG,IAAI,GAAG,EAA2B,CAAC;IA+C5D,CAAC;IA7CD,MAAM,CAAC,IAAI,CACP,OAAgC,EAChC,MAAwB,EACxB,YAAY,GAAG,iBAAiB,EAAE,EAClC,YAAY,GAAG,CAAC;;QAEhB,IAAI,OAAO,YAAY,sBAAsB,EAAE;YAC3C,OAAO,OAAO,CAAC;SAClB;QACD,kFAAkF;QAClF,4FAA4F;QAC5F,wDAAwD;QACxD,MAAM,WAAW,SAAG,OAAO,CAAC,QAAQ,0CAAE,WAAW,CAAC;QAClD,OAAO,IAAI,sBAAsB,CAAC,OAAO,EAAE,MAAM,EAAE,YAAY,EAAE,YAAY,EAAE,WAAW,CAAC,CAAC;IAChG,CAAC;IAED,MAAM,CAAC,KAAK,CAAC,cAAc,CAAC,QAAuB;QAC/C,MAAM,SAAS,GAAG,IAAI,wBAAwB,EAAE,CAAC;QACjD,MAAM,SAAS,CAAC,kBAAkB,CAAC,QAAQ,CAAC,CAAC;IACjD,CAAC;IAED,IAAW,QAAQ;QACf,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC;QACvC,IAAI,QAAQ,EAAE;YACV,uCAAY,QAAQ,KAAE,WAAW,EAAE,SAAS,IAAG;SAClD;IACL,CAAC;IAEM,KAAK,CAAC,cAAc,CAAC,QAAuB;QAC/C,8FAA8F;QAC9F,qCAAqC;QACrC,6DAA6D;QAE7D,IAAI,CAAC,iBAAiB,GAAG,IAAI,CAAC;QAC9B,MAAM,IAAI,CAAC,kBAAkB,CAAC,QAAQ,CAAC,CAAC;IAC5C,CAAC;IAYM,OAAO,CAAC,EAAU,EAAE,IAAmB,EAAE,OAAe;QAC3D,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,EAAE,EAAE,cAAc,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC;IAChE,CAAC;IAEM,KAAK,CAAC,OAAO,CAAC,EAAU,EAAE,IAAmB;QAChD,OAAO,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,EAAE;YACrC,IAAI,CAAC,MAAM,CAAC,cAAc,CAAC,EAAE,SAAS,EAAE,0BAA0B,EAAE,EAAE,KAAK,CAAC,CAAC;YAC7E,MAAM,KAAK,CAAC;QAChB,CAAC,CAAC,CAAC;IACP,CAAC;IAED,IAAW,aAAa,KAAK,OAAO,IAAI,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC;IAC1D,KAAK,CAAC,WAAW,CAAC,SAAwB,EAAE,KAAa;QAC5D,OAAO,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;IACtD,CAAC;IAEM,KAAK,CAAC,eAAe,CAAC,MAAsB;QAC/C,MAAM,IAAI,KAAK,CAAC,KAAK,CAAC,CAAC;IAC3B,CAAC;IAED,sEAAsE;IAC/D,KAAK,CAAC,KAAK,CAAC,IAAW,EAAE,OAAiB,EAAE,OAAe,EAAE,GAAW;QAC3E,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,GAAG,CAAC,CAAC;IAC3D,CAAC;IAED,wFAAwF;IACxF,yBAAyB;IAClB,KAAK,CAAC,UAAU,CAAC,IAAqB;QACzC,OAAO,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;IACzC,CAAC;IAEM,KAAK,CAAC,eAAe,CAAC,OAAkB;QAC3C,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,eAAe,CAAC,OAAO,CAAC,CAAC;QACzD,IAAI,IAAI,EAAE;YACN,MAAM,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC;SACnC;QACD,OAAO,IAAI,CAAC;IAChB,CAAC;IAEM,KAAK,CAAC,QAAQ,CAAC,EAAU;QAC5B,IAAI,IAAI,CAAC,eAAe,CAAC,EAAE,CAAC,EAAE;YAC1B,OAAO,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;SACpC;QACD,iEAAiE;QACjE,6FAA6F;QAC7F,oGAAoG;QACpG,uCAAuC;QAEvC,mGAAmG;QACnG,eAAe;QACf,MAAM,CAAC,IAAI,CAAC,iBAAiB,EAAE,KAAK,CAAC,0BAA0B,CAAC,CAAC;QACjE,MAAM,IAAI,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACvC,MAAM,CAAC,IAAI,KAAK,SAAS,EAAE,KAAK,CAAC,8BAA8B,CAAC,CAAC;QACjE,OAAO,IAAI,CAAC;IAChB,CAAC;IAEM,KAAK,CAAC,wBAAwB,CAAC,OAAqB,EAAE,OAAwB;QACjF,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;IACtE,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,mHAAmH;IACnH,mDAAmD;IAC3C,KAAK,CAAC,kBAAkB,CAC5B,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;YAC9D,OAAO,OAAO,CAAC;SAClB;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;YAClD,MAAM,CAAC,UAAU,KAAK,SAAS,EAAE,KAAK,CAAC,iCAAiC,CAAC,CAAC;YAC1E,MAAM,CAAC,KAAK,KAAK,IAAI,CAAC,YAAY,EAAE,KAAK,CAAC,6CAA6C,CAAC,CAAC;YACzF,UAAU,GAAG,IAAI,cAAc,EAAE,CAAC;YAClC,cAAc,GAAG,IAAI,CAAC;SACzB;aAAM;YACH,MAAM,CAAC,KAAK,KAAK,IAAI,CAAC,YAAY,EAAE,KAAK,CAAC,6CAA6C,CAAC,CAAC;SAC5F;QAED,MAAM,UAAU,qBAAqB,OAAO,CAAC,CAAC;QAC9C,UAAU,CAAC,IAAI,qBAAQ,UAAU,CAAC,IAAI,CAAC,CAAC;QACxC,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;YACzC,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;gBACd;oBACI,8CAA8C;oBAC9C,uEAAuE;oBACvE,IAAI,GAAG,CAAC,IAAI,KAAK,EAAE,IAAI,GAAG,KAAK,UAAU,EAAE;wBACvC,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,kBAAkB,CAAC,GAAG,EAAE,OAAO,EAAE,KAAK,GAAG,CAAC,EAAE,UAAU,CAAC,CAAC;wBAChF,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC;wBAC5B,IAAI,IAAI,CAAC,IAAI,KAAK,EAAE,EAAE;4BAClB,gEAAgE;4BAChE,OAAO,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;yBAC/B;qBACJ;oBACD,MAAM;gBACV;oBACI,IAAI,UAAU,IAAI,OAAO,GAAG,CAAC,OAAO,IAAI,QAAQ,IAAI,GAAG,CAAC,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC,cAAc,EAAE;wBAC1F,UAAU,CAAC,OAAO,CAAC,OAAO,EAAE,GAAG,CAAC,OAAO,CAAC,CAAC;wBACzC,gEAAgE;wBAChE,OAAO,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;qBAC/B;oBACD,MAAM;gBACV,mBAAuB,CAAC,CAAC;oBACrB,oBAAoB;oBACpB,yBAAyB;oBACzB,2EAA2E;oBAC3E,wFAAwF;oBACxF,IAAI,UAAU,GAAG,GAAG,CAAC,MAAM,CAAC;oBAC5B,IAAI,UAAU,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE;wBAC5B,UAAU,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;qBACrC;oBACD,2EAA2E;oBAC3E,MAAM,CAAC,KAAK,KAAK,CAAC,EAAE,KAAK,CAAC,iCAAiC,CAAC,CAAC;oBAC7D,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EACjC,KAAK,CAAC,sDAAsD,CAAC,CAAC;oBAClE,MAAM;iBACT;gBACD;oBACI,MAAM,CAAC,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,oCAAoC,CAAC,CAAC;oBACjF,MAAM;gBACV;oBACI,eAAe,CAAC,GAAG,EAAE,iBAAkB,GAAW,CAAC,IAAI,EAAE,CAAC,CAAC;aAClE;SACJ;QAED,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,KAAK,SAAS,EAAE,KAAK,CAAC,gCAAgC,CAAC,CAAC;QACvG,IAAI,cAAc,EAAE;YAChB,yFAAyF;YACzF,4FAA4F;YAC5F,qGAAqG;YACrG,iEAAiE;YACjE,+CAA+C;YAC/C,MAAM,CAAC,UAAU,KAAK,SAAS,EAAE,KAAK,CAAC,mBAAmB,CAAC,CAAC;YAC5D,MAAM,OAAO,GAAG,UAAU,CAAC,wBAAwB,EAAE,CAAC;YACtD,IAAI,OAAO,KAAK,SAAS,EAAE;gBACvB,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,GAAG;oBACvC,IAAI,cAAkB;oBACtB,OAAO;iBACV,CAAC;aACL;SACJ;QACD,OAAO,UAAU,CAAC;IACtB,CAAC;IAES,eAAe,CAAC,EAAU;QAChC,OAAO,CAAC,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;IAChD,CAAC;;AArOD,4FAA4F;AAC5F,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     IDocumentStorageService,\n    IDocumentStorageServicePolicies,\n     ISummaryContext,\n} from \"@fluidframework/driver-definitions\";\nimport {\n    ICreateBlobResponse,\n    ISnapshotTree,\n    ISummaryHandle,\n    ISummaryTree,\n    IVersion,\n    SummaryType,\n    ITree,\n} from \"@fluidframework/protocol-definitions\";\nimport {\n    assert,\n    bufferToString,\n    stringToBuffer,\n    unreachableCase,\n    fromUtf8ToBase64,\n    Uint8ArrayToString,\n } from \"@fluidframework/common-utils\";\nimport { ITelemetryLogger } from \"@fluidframework/common-definitions\";\n\n// Gate that when flipped, instructs to compress small blobs.\n// We have to first ship with this gate off, such that we can get to saturation bits\n// that can understand compressed format. And only after that flip it.\nfunction gatesAllowPacking() {\n    try {\n        // Leave override for testing purposes\n        // eslint-disable-next-line no-null/no-null\n        if (typeof localStorage === \"object\" && localStorage !== null) {\n            if  (localStorage.FluidAggregateBlobs === \"1\") {\n                return true;\n            }\n            if  (localStorage.FluidAggregateBlobs === \"0\") {\n                return false;\n            }\n        }\n    } catch (e) {}\n\n    // We are starting disabled.\n    return false;\n}\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    if (blob instanceof Uint8Array) { // IsoBuffer does not have ctor, so it's not in proto chain :(\n        return Uint8ArrayToString(blob, encoding);\n    }\n    return bufferToString(blob, encoding);\n}\n\n /**\n  * Class responsible for aggregating smaller blobs into one and unpacking it later on.\n  */\nclass BlobAggregator {\n    private readonly content: [string, string][]= [];\n\n    public addBlob(key: string, content: string) {\n        this.content.push([key, content]);\n    }\n\n    public getAggregatedBlobContent() {\n        if (this.content.length === 0) {\n            return undefined;\n        }\n        return JSON.stringify(this.content);\n    }\n\n    static load(input: ArrayBufferLike) {\n        const data = bufferToString2(input, \"utf-8\");\n        return JSON.parse(data) as [string, string][];\n    }\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 */\nexport abstract class SnapshotExtractor {\n    protected readonly aggregatedBlobName = \"__big\";\n    protected readonly virtualIdPrefix = \"__\";\n\n    // counter for generation of virtual storage IDs\n    protected virtualIdCounter = 0;\n    protected getNextVirtualId() {\n        return `${this.virtualIdPrefix}${++this.virtualIdCounter}`;\n    }\n\n    abstract getBlob(id: string, tree: ISnapshotTree): Promise<ArrayBufferLike>;\n    abstract setBlob(id: string, tree: ISnapshotTree, content: string);\n\n    public async unpackSnapshotCore(snapshot: ISnapshotTree, level = 0): Promise<void> {\n        for (const key of Object.keys(snapshot.trees)) {\n            const obj = snapshot.trees[key];\n            await this.unpackSnapshotCore(obj, level + 1);\n        }\n\n        // For future proof, we will support multiple aggregated blobs with any name\n        // that starts with this.aggregatedBlobName\n        for (const key of Object.keys(snapshot.blobs)) {\n            if (!key.startsWith(this.aggregatedBlobName)) { continue; }\n            const blobId = snapshot.blobs[key];\n            if (blobId !== undefined) {\n                const blob = await this.getBlob(blobId, snapshot);\n                for (const [path, value] of BlobAggregator.load(blob)) {\n                    const id = this.getNextVirtualId();\n                    this.setBlob(id, snapshot, value);\n                    const pathSplit = path.split(\"/\");\n                    let subTree = snapshot;\n                    for (const subPath of pathSplit.slice(0, pathSplit.length - 1)) {\n                        if (subTree.trees[subPath] === undefined) {\n                            subTree.trees[subPath] = { blobs: {}, commits: {}, trees: {}};\n                        }\n                        subTree = subTree.trees[subPath];\n                    }\n                    const blobName = pathSplit[pathSplit.length - 1];\n                    assert(subTree.blobs[blobName] === undefined, 0x0f6 /* \"real blob ID exists\" */);\n                    subTree.blobs[blobName] = id;\n                }\n                // eslint-disable-next-line @typescript-eslint/no-dynamic-delete\n                delete snapshot.blobs[this.aggregatedBlobName];\n            }\n        }\n    }\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    public async getBlob(id: string, tree: ISnapshotTree): Promise<ArrayBufferLike> {\n        const blob = tree.blobs[id];\n        assert(blob !== undefined, 0x0f7 /* \"aggregate blob missing\" */);\n        return stringToBuffer(blob, \"base64\");\n    }\n\n    public setBlob(id: string, tree: ISnapshotTree, content: string) {\n        assert(tree.blobs[id] === undefined, 0x0f8 /* \"blob from aggregate blob exists on its own\" */);\n        tree.blobs[id] = fromUtf8ToBase64(content);\n    }\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 */\nexport class BlobAggregationStorage extends SnapshotExtractor implements IDocumentStorageService {\n    // Tells data store if it can use incremental summary (i.e. reuse DDSs from previous summary\n    // when only one DDS changed).\n    // The answer has to be know long before we enable actual packing. The reason for the is the following:\n    // A the moment when we enable packing, we should assume that all clients out there wil already have bits\n    // that can unpack properly (i.e. enough time passed since we deployed bits that can unpack)\n    // But we can still have clients where some of them already pack, and some do not. If one summary was\n    // using packing, then it relies on non-incremental summaries going forward, even if next client who\n    // produced summary is not packing!\n    // This can have slight improvement by enabling it per file (based on \"did summary we loaded from contain\n    // aggregated blobs\"), but that's harder to make reliable, so going for simplicity.\n    static readonly fullDataStoreSummaries = true;\n\n    protected loadedFromSummary = false;\n\n    protected virtualBlobs = new Map<string, ArrayBufferLike>();\n\n    static wrap(\n        storage: IDocumentStorageService,\n        logger: ITelemetryLogger,\n        allowPacking = gatesAllowPacking(),\n        packingLevel = 2,\n    ) {\n        if (storage instanceof BlobAggregationStorage) {\n            return storage;\n        }\n        // Always create BlobAggregationStorage even if storage is not asking for packing.\n        // This is mostly to avoid cases where future changes in policy would result in inability to\n        // load old files that were created with aggregation on.\n        const minBlobSize = storage.policies?.minBlobSize;\n        return new BlobAggregationStorage(storage, logger, allowPacking, packingLevel, minBlobSize);\n    }\n\n    static async unpackSnapshot(snapshot: ISnapshotTree) {\n        const converter = new SnapshotExtractorInPlace();\n        await converter.unpackSnapshotCore(snapshot);\n    }\n\n    public get policies(): IDocumentStorageServicePolicies | undefined {\n        const policies = this.storage.policies;\n        if (policies) {\n            return { ...policies, minBlobSize: undefined };\n        }\n    }\n\n    public async unpackSnapshot(snapshot: ISnapshotTree) {\n        // SummarizerNodeWithGC.refreshLatestSummary can call it when this.loadedFromSummary === false\n        // (I assumed after file was created)\n        // assert(!this.loadedFromSummary, \"unpack without summary\");\n\n        this.loadedFromSummary = true;\n        await this.unpackSnapshotCore(snapshot);\n    }\n\n    protected constructor(\n        private readonly storage: IDocumentStorageService,\n        private readonly logger: ITelemetryLogger,\n        private readonly allowPacking: boolean,\n        private readonly packingLevel: number,\n        private readonly blobCutOffSize?: number)\n    {\n        super();\n    }\n\n    public setBlob(id: string, tree: ISnapshotTree, content: string) {\n        this.virtualBlobs.set(id, stringToBuffer(content, \"utf-8\"));\n    }\n\n    public async getBlob(id: string, tree: ISnapshotTree): Promise<ArrayBufferLike> {\n        return this.readBlob(id).catch((error) => {\n            this.logger.sendErrorEvent({ eventName: \"BlobDedupNoAggregateBlob\" }, error);\n            throw error;\n        });\n    }\n\n    public get repositoryUrl() { return this.storage.repositoryUrl; }\n    public async getVersions(versionId: string | null, count: number) {\n        return this.storage.getVersions(versionId, count);\n    }\n\n    public async downloadSummary(handle: ISummaryHandle): Promise<ISummaryTree> {\n        throw new Error(\"NYI\");\n    }\n\n    // This is only used through Container.snapshot() for testing purposes\n    public async write(root: ITree, parents: string[], message: string, ref: string) {\n        return this.storage.write(root, parents, message, ref);\n    }\n\n    // for now we are not optimizing these blobs, with assumption that this API is used only\n    // for big blobs (images)\n    public async createBlob(file: ArrayBufferLike): Promise<ICreateBlobResponse> {\n        return this.storage.createBlob(file);\n    }\n\n    public async getSnapshotTree(version?: IVersion): Promise<ISnapshotTree | null> {\n        const tree = await this.storage.getSnapshotTree(version);\n        if (tree) {\n            await this.unpackSnapshot(tree);\n        }\n        return tree;\n    }\n\n    public async readBlob(id: string): Promise<ArrayBufferLike> {\n        if (this.isRealStorageId(id)) {\n            return this.storage.readBlob(id);\n        }\n        // We support only reading blobs from the summary we loaded from.\n        // This may need to be extended to any general summary in the future as runtime usage pattern\n        // of storage changes (for example, data stores start to load from recent summary, not from original\n        // summary whole container loaded from)\n\n        // are there other ways we can get here? createFile is one flow, but we should not be reading blobs\n        // in such flow\n        assert(this.loadedFromSummary, 0x0f9 /* \"never read summary\" */);\n        const blob = this.virtualBlobs.get(id);\n        assert(blob !== undefined, 0x0fa /* \"virtual blob not found\" */);\n        return blob;\n    }\n\n    public async uploadSummaryWithContext(summary: ISummaryTree, context: ISummaryContext): Promise<string> {\n        const summaryNew = this.allowPacking ? await this.compressSmallBlobs(summary) : summary;\n        return this.storage.uploadSummaryWithContext(summaryNew, context);\n    }\n\n    // For simplification, we assume that\n    // - blob aggregation is done at data store level only for now\n    // - data store either reuses previous summary, or generates full summary, i.e. there is no partial (some DDS)\n    // summary produced by data stores.\n    // These simplifications allow us not to touch handles, as they are self-contained (either do not use aggregated\n    // blob Or contain aggregated blob that stays relevant for that sub-tree)\n    // Note:\n    // From perf perspective, it makes sense to place aggregated blobs one level up in the tree not to create extra\n    // tree nodes (i.e. have shallow tree with less edges). But that creates problems with reusability of trees at\n    // incremental summary time - we would need to understand handles and parse them. In current design we can skip\n    // that step because if data store is reused, the hole sub-tree is reused included aggregated blob embedded into it\n    // and that means we can do nothing and be correct!\n    private async compressSmallBlobs(\n        summary: ISummaryTree,\n        path = \"\",\n        level = 0,\n        aggregatorArg?: BlobAggregator): Promise<ISummaryTree>\n    {\n        if (this.blobCutOffSize === undefined || this.blobCutOffSize < 0) {\n            return summary;\n        }\n\n        let shouldCompress: boolean = false;\n\n        let aggregator = aggregatorArg;\n        // checking if this is a dataStore tree, since we only pack at data store level\n        if (Object.keys(summary.tree).includes(\".component\")) {\n            assert(aggregator === undefined, 0x0fb /* \"logic err with aggregator\" */);\n            assert(level === this.packingLevel, 0x23b /* \"we are not packing at the right level\" */);\n            aggregator = new BlobAggregator();\n            shouldCompress = true;\n        } else {\n            assert(level !== this.packingLevel, 0x23c /* \"we are not packing at the right level\" */);\n        }\n\n        const newSummary: ISummaryTree = {...summary};\n        newSummary.tree = { ...newSummary.tree};\n        for (const key of Object.keys(summary.tree)) {\n            const obj = summary.tree[key];\n            // Get path relative to root of data store (where we do aggregation)\n            const newPath = shouldCompress ? key : `${path}/${key}`;\n            switch (obj.type) {\n                case SummaryType.Tree:\n                    // If client created empty tree, keep it as is\n                    // Also do not package search blobs - they are part of storage contract\n                    if (obj.tree !== {} && key !== \"__search\") {\n                        const tree = await this.compressSmallBlobs(obj, newPath, level + 1, aggregator);\n                        newSummary.tree[key] = tree;\n                        if (tree.tree === {}) {\n                            // eslint-disable-next-line @typescript-eslint/no-dynamic-delete\n                            delete newSummary.tree[key];\n                        }\n                    }\n                    break;\n                case SummaryType.Blob:\n                    if (aggregator && typeof obj.content == \"string\" && obj.content.length < this.blobCutOffSize) {\n                        aggregator.addBlob(newPath, obj.content);\n                        // eslint-disable-next-line @typescript-eslint/no-dynamic-delete\n                        delete newSummary.tree[key];\n                    }\n                    break;\n                case SummaryType.Handle: {\n                    // Would be nice to:\n                    // Trees: expand the tree\n                    // Blobs: parse handle and ensure it points to real blob, not virtual blob.\n                    // We can avoid it for now given data store is the granularity of incremental summaries.\n                    let handlePath = obj.handle;\n                    if (handlePath.startsWith(\"/\")) {\n                        handlePath = handlePath.substr(1);\n                    }\n                    // Ensure only whole data stores can be reused, no reusing at deeper level!\n                    assert(level === 0, 0x0fc /* \"tree reuse at lower level\" */);\n                    assert(handlePath.indexOf(\"/\") === -1,\n                        0x0fd /* \"data stores are writing incremental summaries!\" */);\n                    break;\n                }\n                case SummaryType.Attachment:\n                    assert(this.isRealStorageId(obj.id), 0x0fe /* \"attachment is aggregate blob\" */);\n                    break;\n                default:\n                    unreachableCase(obj, `Unknown type: ${(obj as any).type}`);\n            }\n        }\n\n        assert(newSummary.tree[this.aggregatedBlobName] === undefined, 0x0ff /* \"duplicate aggregate blob\" */);\n        if (shouldCompress) {\n            // Note: It would be great to add code here to unpack aggregate blob back to normal blobs\n            // If only one blob made it into aggregate. Currently that does not happen as we always have\n            // at least one .component blob and at least one DDS that has .attributes blob, so it's not an issue.\n            // But it's possible that in future that would be great addition!\n            // Good news - it's backward compatible change.\n            assert(aggregator !== undefined, 0x100 /* \"logic error\" */);\n            const content = aggregator.getAggregatedBlobContent();\n            if (content !== undefined) {\n                newSummary.tree[this.aggregatedBlobName] = {\n                    type: SummaryType.Blob,\n                    content,\n                };\n            }\n        }\n        return newSummary;\n    }\n\n    protected isRealStorageId(id: string): boolean {\n        return !id.startsWith(this.virtualIdPrefix);\n    }\n}\n"]}
+{"version":3,"file":"blobAggregationStorage.js","sourceRoot":"","sources":["../src/blobAggregationStorage.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAOH,OAAO,EAMH,WAAW,GAEd,MAAM,sCAAsC,CAAC;AAC9C,OAAO,EACH,MAAM,EACN,cAAc,EACd,cAAc,EACd,eAAe,EACf,gBAAgB,EAChB,kBAAkB,GACpB,MAAM,8BAA8B,CAAC;AAGvC,6DAA6D;AAC7D,oFAAoF;AACpF,sEAAsE;AACtE,SAAS,iBAAiB;IACtB,IAAI;QACA,sCAAsC;QACtC,2CAA2C;QAC3C,IAAI,OAAO,YAAY,KAAK,QAAQ,IAAI,YAAY,KAAK,IAAI,EAAE;YAC3D,IAAK,YAAY,CAAC,mBAAmB,KAAK,GAAG,EAAE;gBAC3C,OAAO,IAAI,CAAC;aACf;YACD,IAAK,YAAY,CAAC,mBAAmB,KAAK,GAAG,EAAE;gBAC3C,OAAO,KAAK,CAAC;aAChB;SACJ;KACJ;IAAC,OAAO,CAAC,EAAE,GAAE;IAEd,4BAA4B;IAC5B,OAAO,KAAK,CAAC;AACjB,CAAC;AAED;;;EAGE;AACF,SAAS,eAAe,CAAC,IAAqB,EAAE,QAA4B;IACxE,IAAI,IAAI,YAAY,UAAU,EAAE,EAAE,8DAA8D;QAC5F,OAAO,kBAAkB,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;KAC7C;IACD,OAAO,cAAc,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;AAC1C,CAAC;AAEA;;GAEG;AACJ,MAAM,cAAc;IAApB;QACqB,YAAO,GAAsB,EAAE,CAAC;IAiBrD,CAAC;IAfU,OAAO,CAAC,GAAW,EAAE,OAAe;QACvC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC,CAAC;IACtC,CAAC;IAEM,wBAAwB;QAC3B,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE;YAC3B,OAAO,SAAS,CAAC;SACpB;QACD,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACxC,CAAC;IAED,MAAM,CAAC,IAAI,CAAC,KAAsB;QAC9B,MAAM,IAAI,GAAG,eAAe,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;QAC7C,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAuB,CAAC;IAClD,CAAC;CACJ;AAED;;;GAGG;AACH,MAAM,OAAgB,iBAAiB;IAAvC;QACuB,uBAAkB,GAAG,OAAO,CAAC;QAC7B,oBAAe,GAAG,IAAI,CAAC;QAE1C,gDAAgD;QACtC,qBAAgB,GAAG,CAAC,CAAC;IAyCnC,CAAC;IAxCa,gBAAgB;QACtB,OAAO,GAAG,IAAI,CAAC,eAAe,GAAG,EAAE,IAAI,CAAC,gBAAgB,EAAE,CAAC;IAC/D,CAAC;IAKM,KAAK,CAAC,kBAAkB,CAAC,QAAuB,EAAE,KAAK,GAAG,CAAC;QAC9D,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE;YAC3C,MAAM,GAAG,GAAG,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;YAChC,MAAM,IAAI,CAAC,kBAAkB,CAAC,GAAG,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;SACjD;QAED,4EAA4E;QAC5E,2CAA2C;QAC3C,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE;YAC3C,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,kBAAkB,CAAC,EAAE;gBAAE,SAAS;aAAE;YAC3D,MAAM,MAAM,GAAG,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;YACnC,IAAI,MAAM,KAAK,SAAS,EAAE;gBACtB,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;oBACnD,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;wBAC5D,IAAI,OAAO,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,SAAS,EAAE;4BACtC,OAAO,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAC,CAAC;yBACjE;wBACD,OAAO,GAAG,OAAO,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;qBACpC;oBACD,MAAM,QAAQ,GAAG,SAAS,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;oBACjD,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,KAAK,SAAS,EAAE,KAAK,CAAC,2BAA2B,CAAC,CAAC;oBACjF,OAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,GAAG,EAAE,CAAC;iBAChC;gBACD,gEAAgE;gBAChE,OAAO,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAC;aAClD;SACJ;IACL,CAAC;CACJ;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,wBAAyB,SAAQ,iBAAiB;IAC7C,KAAK,CAAC,OAAO,CAAC,EAAU,EAAE,IAAmB;QAChD,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QAC5B,MAAM,CAAC,IAAI,KAAK,SAAS,EAAE,KAAK,CAAC,8BAA8B,CAAC,CAAC;QACjE,OAAO,cAAc,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;IAC1C,CAAC;IAEM,OAAO,CAAC,EAAU,EAAE,IAAmB,EAAE,OAAe;QAC3D,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,SAAS,EAAE,KAAK,CAAC,kDAAkD,CAAC,CAAC;QAC/F,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,GAAG,gBAAgB,CAAC,OAAO,CAAC,CAAC;IAC/C,CAAC;CACJ;AAED;;;;GAIG;AACH,MAAM,OAAO,sBAAuB,SAAQ,iBAAiB;IAsDzD,YACqB,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;QA9ClC,sBAAiB,GAAG,KAAK,CAAC;QAE1B,iBAAY,GAAG,IAAI,GAAG,EAA2B,CAAC;IA+C5D,CAAC;IA7CD,MAAM,CAAC,IAAI,CACP,OAAgC,EAChC,MAAwB,EACxB,YAAY,GAAG,iBAAiB,EAAE,EAClC,YAAY,GAAG,CAAC;;QAEhB,IAAI,OAAO,YAAY,sBAAsB,EAAE;YAC3C,OAAO,OAAO,CAAC;SAClB;QACD,kFAAkF;QAClF,4FAA4F;QAC5F,wDAAwD;QACxD,MAAM,WAAW,SAAG,OAAO,CAAC,QAAQ,0CAAE,WAAW,CAAC;QAClD,OAAO,IAAI,sBAAsB,CAAC,OAAO,EAAE,MAAM,EAAE,YAAY,EAAE,YAAY,EAAE,WAAW,CAAC,CAAC;IAChG,CAAC;IAED,MAAM,CAAC,KAAK,CAAC,cAAc,CAAC,QAAuB;QAC/C,MAAM,SAAS,GAAG,IAAI,wBAAwB,EAAE,CAAC;QACjD,MAAM,SAAS,CAAC,kBAAkB,CAAC,QAAQ,CAAC,CAAC;IACjD,CAAC;IAED,IAAW,QAAQ;QACf,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC;QACvC,IAAI,QAAQ,EAAE;YACV,uCAAY,QAAQ,KAAE,WAAW,EAAE,SAAS,IAAG;SAClD;IACL,CAAC;IAEM,KAAK,CAAC,cAAc,CAAC,QAAuB;QAC/C,8FAA8F;QAC9F,qCAAqC;QACrC,6DAA6D;QAE7D,IAAI,CAAC,iBAAiB,GAAG,IAAI,CAAC;QAC9B,MAAM,IAAI,CAAC,kBAAkB,CAAC,QAAQ,CAAC,CAAC;IAC5C,CAAC;IAYM,OAAO,CAAC,EAAU,EAAE,IAAmB,EAAE,OAAe;QAC3D,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,EAAE,EAAE,cAAc,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC;IAChE,CAAC;IAEM,KAAK,CAAC,OAAO,CAAC,EAAU,EAAE,IAAmB;QAChD,OAAO,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,EAAE;YACrC,IAAI,CAAC,MAAM,CAAC,cAAc,CAAC,EAAE,SAAS,EAAE,0BAA0B,EAAE,EAAE,KAAK,CAAC,CAAC;YAC7E,MAAM,KAAK,CAAC;QAChB,CAAC,CAAC,CAAC;IACP,CAAC;IAED,IAAW,aAAa,KAAK,OAAO,IAAI,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC;IAC1D,KAAK,CAAC,WAAW,CAAC,SAAwB,EAAE,KAAa;QAC5D,OAAO,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;IACtD,CAAC;IAEM,KAAK,CAAC,eAAe,CAAC,MAAsB;QAC/C,MAAM,IAAI,KAAK,CAAC,KAAK,CAAC,CAAC;IAC3B,CAAC;IAED,sEAAsE;IAC/D,KAAK,CAAC,KAAK,CAAC,IAAW,EAAE,OAAiB,EAAE,OAAe,EAAE,GAAW;QAC3E,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,GAAG,CAAC,CAAC;IAC3D,CAAC;IAED,wFAAwF;IACxF,yBAAyB;IAClB,KAAK,CAAC,UAAU,CAAC,IAAqB;QACzC,OAAO,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;IACzC,CAAC;IAEM,KAAK,CAAC,eAAe,CAAC,OAAkB;QAC3C,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,eAAe,CAAC,OAAO,CAAC,CAAC;QACzD,IAAI,IAAI,EAAE;YACN,MAAM,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC;SACnC;QACD,OAAO,IAAI,CAAC;IAChB,CAAC;IAEM,KAAK,CAAC,QAAQ,CAAC,EAAU;QAC5B,IAAI,IAAI,CAAC,eAAe,CAAC,EAAE,CAAC,EAAE;YAC1B,OAAO,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;SACpC;QACD,iEAAiE;QACjE,6FAA6F;QAC7F,oGAAoG;QACpG,uCAAuC;QAEvC,mGAAmG;QACnG,eAAe;QACf,MAAM,CAAC,IAAI,CAAC,iBAAiB,EAAE,KAAK,CAAC,0BAA0B,CAAC,CAAC;QACjE,MAAM,IAAI,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACvC,MAAM,CAAC,IAAI,KAAK,SAAS,EAAE,KAAK,CAAC,8BAA8B,CAAC,CAAC;QACjE,OAAO,IAAI,CAAC;IAChB,CAAC;IAEM,KAAK,CAAC,wBAAwB,CAAC,OAAqB,EAAE,OAAwB;QACjF,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;IACtE,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,mHAAmH;IACnH,mDAAmD;IAC3C,KAAK,CAAC,kBAAkB,CAC5B,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;YAC9D,OAAO,OAAO,CAAC;SAClB;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;YAClD,MAAM,CAAC,UAAU,KAAK,SAAS,EAAE,KAAK,CAAC,iCAAiC,CAAC,CAAC;YAC1E,MAAM,CAAC,KAAK,KAAK,IAAI,CAAC,YAAY,EAAE,KAAK,CAAC,6CAA6C,CAAC,CAAC;YACzF,UAAU,GAAG,IAAI,cAAc,EAAE,CAAC;YAClC,cAAc,GAAG,IAAI,CAAC;SACzB;aAAM;YACH,MAAM,CAAC,KAAK,KAAK,IAAI,CAAC,YAAY,EAAE,KAAK,CAAC,6CAA6C,CAAC,CAAC;SAC5F;QAED,MAAM,UAAU,qBAAqB,OAAO,CAAC,CAAC;QAC9C,UAAU,CAAC,IAAI,qBAAQ,UAAU,CAAC,IAAI,CAAC,CAAC;QACxC,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;YACzC,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;gBACd,KAAK,WAAW,CAAC,IAAI;oBACjB,8CAA8C;oBAC9C,uEAAuE;oBACvE,IAAI,GAAG,CAAC,IAAI,KAAK,EAAE,IAAI,GAAG,KAAK,UAAU,EAAE;wBACvC,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,kBAAkB,CAAC,GAAG,EAAE,OAAO,EAAE,KAAK,GAAG,CAAC,EAAE,UAAU,CAAC,CAAC;wBAChF,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC;wBAC5B,IAAI,IAAI,CAAC,IAAI,KAAK,EAAE,EAAE;4BAClB,gEAAgE;4BAChE,OAAO,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;yBAC/B;qBACJ;oBACD,MAAM;gBACV,KAAK,WAAW,CAAC,IAAI;oBACjB,IAAI,UAAU,IAAI,OAAO,GAAG,CAAC,OAAO,IAAI,QAAQ,IAAI,GAAG,CAAC,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC,cAAc,EAAE;wBAC1F,UAAU,CAAC,OAAO,CAAC,OAAO,EAAE,GAAG,CAAC,OAAO,CAAC,CAAC;wBACzC,gEAAgE;wBAChE,OAAO,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;qBAC/B;oBACD,MAAM;gBACV,KAAK,WAAW,CAAC,MAAM,CAAC,CAAC;oBACrB,oBAAoB;oBACpB,yBAAyB;oBACzB,2EAA2E;oBAC3E,wFAAwF;oBACxF,IAAI,UAAU,GAAG,GAAG,CAAC,MAAM,CAAC;oBAC5B,IAAI,UAAU,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE;wBAC5B,UAAU,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;qBACrC;oBACD,2EAA2E;oBAC3E,MAAM,CAAC,KAAK,KAAK,CAAC,EAAE,KAAK,CAAC,iCAAiC,CAAC,CAAC;oBAC7D,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EACjC,KAAK,CAAC,sDAAsD,CAAC,CAAC;oBAClE,MAAM;iBACT;gBACD,KAAK,WAAW,CAAC,UAAU;oBACvB,MAAM,CAAC,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,oCAAoC,CAAC,CAAC;oBACjF,MAAM;gBACV;oBACI,eAAe,CAAC,GAAG,EAAE,iBAAkB,GAAW,CAAC,IAAI,EAAE,CAAC,CAAC;aAClE;SACJ;QAED,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,KAAK,SAAS,EAAE,KAAK,CAAC,gCAAgC,CAAC,CAAC;QACvG,IAAI,cAAc,EAAE;YAChB,yFAAyF;YACzF,4FAA4F;YAC5F,qGAAqG;YACrG,iEAAiE;YACjE,+CAA+C;YAC/C,MAAM,CAAC,UAAU,KAAK,SAAS,EAAE,KAAK,CAAC,mBAAmB,CAAC,CAAC;YAC5D,MAAM,OAAO,GAAG,UAAU,CAAC,wBAAwB,EAAE,CAAC;YACtD,IAAI,OAAO,KAAK,SAAS,EAAE;gBACvB,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,GAAG;oBACvC,IAAI,EAAE,WAAW,CAAC,IAAI;oBACtB,OAAO;iBACV,CAAC;aACL;SACJ;QACD,OAAO,UAAU,CAAC;IACtB,CAAC;IAES,eAAe,CAAC,EAAU;QAChC,OAAO,CAAC,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;IAChD,CAAC;;AArOD,4FAA4F;AAC5F,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     IDocumentStorageService,\n    IDocumentStorageServicePolicies,\n     ISummaryContext,\n} from \"@fluidframework/driver-definitions\";\nimport {\n    ICreateBlobResponse,\n    ISnapshotTree,\n    ISummaryHandle,\n    ISummaryTree,\n    IVersion,\n    SummaryType,\n    ITree,\n} from \"@fluidframework/protocol-definitions\";\nimport {\n    assert,\n    bufferToString,\n    stringToBuffer,\n    unreachableCase,\n    fromUtf8ToBase64,\n    Uint8ArrayToString,\n } from \"@fluidframework/common-utils\";\nimport { ITelemetryLogger } from \"@fluidframework/common-definitions\";\n\n// Gate that when flipped, instructs to compress small blobs.\n// We have to first ship with this gate off, such that we can get to saturation bits\n// that can understand compressed format. And only after that flip it.\nfunction gatesAllowPacking() {\n    try {\n        // Leave override for testing purposes\n        // eslint-disable-next-line no-null/no-null\n        if (typeof localStorage === \"object\" && localStorage !== null) {\n            if  (localStorage.FluidAggregateBlobs === \"1\") {\n                return true;\n            }\n            if  (localStorage.FluidAggregateBlobs === \"0\") {\n                return false;\n            }\n        }\n    } catch (e) {}\n\n    // We are starting disabled.\n    return false;\n}\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    if (blob instanceof Uint8Array) { // IsoBuffer does not have ctor, so it's not in proto chain :(\n        return Uint8ArrayToString(blob, encoding);\n    }\n    return bufferToString(blob, encoding);\n}\n\n /**\n  * Class responsible for aggregating smaller blobs into one and unpacking it later on.\n  */\nclass BlobAggregator {\n    private readonly content: [string, string][]= [];\n\n    public addBlob(key: string, content: string) {\n        this.content.push([key, content]);\n    }\n\n    public getAggregatedBlobContent() {\n        if (this.content.length === 0) {\n            return undefined;\n        }\n        return JSON.stringify(this.content);\n    }\n\n    static load(input: ArrayBufferLike) {\n        const data = bufferToString2(input, \"utf-8\");\n        return JSON.parse(data) as [string, string][];\n    }\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 */\nexport abstract class SnapshotExtractor {\n    protected readonly aggregatedBlobName = \"__big\";\n    protected readonly virtualIdPrefix = \"__\";\n\n    // counter for generation of virtual storage IDs\n    protected virtualIdCounter = 0;\n    protected getNextVirtualId() {\n        return `${this.virtualIdPrefix}${++this.virtualIdCounter}`;\n    }\n\n    abstract getBlob(id: string, tree: ISnapshotTree): Promise<ArrayBufferLike>;\n    abstract setBlob(id: string, tree: ISnapshotTree, content: string);\n\n    public async unpackSnapshotCore(snapshot: ISnapshotTree, level = 0): Promise<void> {\n        for (const key of Object.keys(snapshot.trees)) {\n            const obj = snapshot.trees[key];\n            await this.unpackSnapshotCore(obj, level + 1);\n        }\n\n        // For future proof, we will support multiple aggregated blobs with any name\n        // that starts with this.aggregatedBlobName\n        for (const key of Object.keys(snapshot.blobs)) {\n            if (!key.startsWith(this.aggregatedBlobName)) { continue; }\n            const blobId = snapshot.blobs[key];\n            if (blobId !== undefined) {\n                const blob = await this.getBlob(blobId, snapshot);\n                for (const [path, value] of BlobAggregator.load(blob)) {\n                    const id = this.getNextVirtualId();\n                    this.setBlob(id, snapshot, value);\n                    const pathSplit = path.split(\"/\");\n                    let subTree = snapshot;\n                    for (const subPath of pathSplit.slice(0, pathSplit.length - 1)) {\n                        if (subTree.trees[subPath] === undefined) {\n                            subTree.trees[subPath] = { blobs: {}, commits: {}, trees: {}};\n                        }\n                        subTree = subTree.trees[subPath];\n                    }\n                    const blobName = pathSplit[pathSplit.length - 1];\n                    assert(subTree.blobs[blobName] === undefined, 0x0f6 /* \"real blob ID exists\" */);\n                    subTree.blobs[blobName] = id;\n                }\n                // eslint-disable-next-line @typescript-eslint/no-dynamic-delete\n                delete snapshot.blobs[this.aggregatedBlobName];\n            }\n        }\n    }\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    public async getBlob(id: string, tree: ISnapshotTree): Promise<ArrayBufferLike> {\n        const blob = tree.blobs[id];\n        assert(blob !== undefined, 0x0f7 /* \"aggregate blob missing\" */);\n        return stringToBuffer(blob, \"base64\");\n    }\n\n    public setBlob(id: string, tree: ISnapshotTree, content: string) {\n        assert(tree.blobs[id] === undefined, 0x0f8 /* \"blob from aggregate blob exists on its own\" */);\n        tree.blobs[id] = fromUtf8ToBase64(content);\n    }\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 */\nexport class BlobAggregationStorage extends SnapshotExtractor implements IDocumentStorageService {\n    // Tells data store if it can use incremental summary (i.e. reuse DDSs from previous summary\n    // when only one DDS changed).\n    // The answer has to be know long before we enable actual packing. The reason for the is the following:\n    // A the moment when we enable packing, we should assume that all clients out there wil already have bits\n    // that can unpack properly (i.e. enough time passed since we deployed bits that can unpack)\n    // But we can still have clients where some of them already pack, and some do not. If one summary was\n    // using packing, then it relies on non-incremental summaries going forward, even if next client who\n    // produced summary is not packing!\n    // This can have slight improvement by enabling it per file (based on \"did summary we loaded from contain\n    // aggregated blobs\"), but that's harder to make reliable, so going for simplicity.\n    static readonly fullDataStoreSummaries = true;\n\n    protected loadedFromSummary = false;\n\n    protected virtualBlobs = new Map<string, ArrayBufferLike>();\n\n    static wrap(\n        storage: IDocumentStorageService,\n        logger: ITelemetryLogger,\n        allowPacking = gatesAllowPacking(),\n        packingLevel = 2,\n    ) {\n        if (storage instanceof BlobAggregationStorage) {\n            return storage;\n        }\n        // Always create BlobAggregationStorage even if storage is not asking for packing.\n        // This is mostly to avoid cases where future changes in policy would result in inability to\n        // load old files that were created with aggregation on.\n        const minBlobSize = storage.policies?.minBlobSize;\n        return new BlobAggregationStorage(storage, logger, allowPacking, packingLevel, minBlobSize);\n    }\n\n    static async unpackSnapshot(snapshot: ISnapshotTree) {\n        const converter = new SnapshotExtractorInPlace();\n        await converter.unpackSnapshotCore(snapshot);\n    }\n\n    public get policies(): IDocumentStorageServicePolicies | undefined {\n        const policies = this.storage.policies;\n        if (policies) {\n            return { ...policies, minBlobSize: undefined };\n        }\n    }\n\n    public async unpackSnapshot(snapshot: ISnapshotTree) {\n        // SummarizerNodeWithGC.refreshLatestSummary can call it when this.loadedFromSummary === false\n        // (I assumed after file was created)\n        // assert(!this.loadedFromSummary, \"unpack without summary\");\n\n        this.loadedFromSummary = true;\n        await this.unpackSnapshotCore(snapshot);\n    }\n\n    protected constructor(\n        private readonly storage: IDocumentStorageService,\n        private readonly logger: ITelemetryLogger,\n        private readonly allowPacking: boolean,\n        private readonly packingLevel: number,\n        private readonly blobCutOffSize?: number)\n    {\n        super();\n    }\n\n    public setBlob(id: string, tree: ISnapshotTree, content: string) {\n        this.virtualBlobs.set(id, stringToBuffer(content, \"utf-8\"));\n    }\n\n    public async getBlob(id: string, tree: ISnapshotTree): Promise<ArrayBufferLike> {\n        return this.readBlob(id).catch((error) => {\n            this.logger.sendErrorEvent({ eventName: \"BlobDedupNoAggregateBlob\" }, error);\n            throw error;\n        });\n    }\n\n    public get repositoryUrl() { return this.storage.repositoryUrl; }\n    public async getVersions(versionId: string | null, count: number) {\n        return this.storage.getVersions(versionId, count);\n    }\n\n    public async downloadSummary(handle: ISummaryHandle): Promise<ISummaryTree> {\n        throw new Error(\"NYI\");\n    }\n\n    // This is only used through Container.snapshot() for testing purposes\n    public async write(root: ITree, parents: string[], message: string, ref: string) {\n        return this.storage.write(root, parents, message, ref);\n    }\n\n    // for now we are not optimizing these blobs, with assumption that this API is used only\n    // for big blobs (images)\n    public async createBlob(file: ArrayBufferLike): Promise<ICreateBlobResponse> {\n        return this.storage.createBlob(file);\n    }\n\n    public async getSnapshotTree(version?: IVersion): Promise<ISnapshotTree | null> {\n        const tree = await this.storage.getSnapshotTree(version);\n        if (tree) {\n            await this.unpackSnapshot(tree);\n        }\n        return tree;\n    }\n\n    public async readBlob(id: string): Promise<ArrayBufferLike> {\n        if (this.isRealStorageId(id)) {\n            return this.storage.readBlob(id);\n        }\n        // We support only reading blobs from the summary we loaded from.\n        // This may need to be extended to any general summary in the future as runtime usage pattern\n        // of storage changes (for example, data stores start to load from recent summary, not from original\n        // summary whole container loaded from)\n\n        // are there other ways we can get here? createFile is one flow, but we should not be reading blobs\n        // in such flow\n        assert(this.loadedFromSummary, 0x0f9 /* \"never read summary\" */);\n        const blob = this.virtualBlobs.get(id);\n        assert(blob !== undefined, 0x0fa /* \"virtual blob not found\" */);\n        return blob;\n    }\n\n    public async uploadSummaryWithContext(summary: ISummaryTree, context: ISummaryContext): Promise<string> {\n        const summaryNew = this.allowPacking ? await this.compressSmallBlobs(summary) : summary;\n        return this.storage.uploadSummaryWithContext(summaryNew, context);\n    }\n\n    // For simplification, we assume that\n    // - blob aggregation is done at data store level only for now\n    // - data store either reuses previous summary, or generates full summary, i.e. there is no partial (some DDS)\n    // summary produced by data stores.\n    // These simplifications allow us not to touch handles, as they are self-contained (either do not use aggregated\n    // blob Or contain aggregated blob that stays relevant for that sub-tree)\n    // Note:\n    // From perf perspective, it makes sense to place aggregated blobs one level up in the tree not to create extra\n    // tree nodes (i.e. have shallow tree with less edges). But that creates problems with reusability of trees at\n    // incremental summary time - we would need to understand handles and parse them. In current design we can skip\n    // that step because if data store is reused, the hole sub-tree is reused included aggregated blob embedded into it\n    // and that means we can do nothing and be correct!\n    private async compressSmallBlobs(\n        summary: ISummaryTree,\n        path = \"\",\n        level = 0,\n        aggregatorArg?: BlobAggregator): Promise<ISummaryTree>\n    {\n        if (this.blobCutOffSize === undefined || this.blobCutOffSize < 0) {\n            return summary;\n        }\n\n        let shouldCompress: boolean = false;\n\n        let aggregator = aggregatorArg;\n        // checking if this is a dataStore tree, since we only pack at data store level\n        if (Object.keys(summary.tree).includes(\".component\")) {\n            assert(aggregator === undefined, 0x0fb /* \"logic err with aggregator\" */);\n            assert(level === this.packingLevel, 0x23b /* \"we are not packing at the right level\" */);\n            aggregator = new BlobAggregator();\n            shouldCompress = true;\n        } else {\n            assert(level !== this.packingLevel, 0x23c /* \"we are not packing at the right level\" */);\n        }\n\n        const newSummary: ISummaryTree = {...summary};\n        newSummary.tree = { ...newSummary.tree};\n        for (const key of Object.keys(summary.tree)) {\n            const obj = summary.tree[key];\n            // Get path relative to root of data store (where we do aggregation)\n            const newPath = shouldCompress ? key : `${path}/${key}`;\n            switch (obj.type) {\n                case SummaryType.Tree:\n                    // If client created empty tree, keep it as is\n                    // Also do not package search blobs - they are part of storage contract\n                    if (obj.tree !== {} && key !== \"__search\") {\n                        const tree = await this.compressSmallBlobs(obj, newPath, level + 1, aggregator);\n                        newSummary.tree[key] = tree;\n                        if (tree.tree === {}) {\n                            // eslint-disable-next-line @typescript-eslint/no-dynamic-delete\n                            delete newSummary.tree[key];\n                        }\n                    }\n                    break;\n                case SummaryType.Blob:\n                    if (aggregator && typeof obj.content == \"string\" && obj.content.length < this.blobCutOffSize) {\n                        aggregator.addBlob(newPath, obj.content);\n                        // eslint-disable-next-line @typescript-eslint/no-dynamic-delete\n                        delete newSummary.tree[key];\n                    }\n                    break;\n                case SummaryType.Handle: {\n                    // Would be nice to:\n                    // Trees: expand the tree\n                    // Blobs: parse handle and ensure it points to real blob, not virtual blob.\n                    // We can avoid it for now given data store is the granularity of incremental summaries.\n                    let handlePath = obj.handle;\n                    if (handlePath.startsWith(\"/\")) {\n                        handlePath = handlePath.substr(1);\n                    }\n                    // Ensure only whole data stores can be reused, no reusing at deeper level!\n                    assert(level === 0, 0x0fc /* \"tree reuse at lower level\" */);\n                    assert(handlePath.indexOf(\"/\") === -1,\n                        0x0fd /* \"data stores are writing incremental summaries!\" */);\n                    break;\n                }\n                case SummaryType.Attachment:\n                    assert(this.isRealStorageId(obj.id), 0x0fe /* \"attachment is aggregate blob\" */);\n                    break;\n                default:\n                    unreachableCase(obj, `Unknown type: ${(obj as any).type}`);\n            }\n        }\n\n        assert(newSummary.tree[this.aggregatedBlobName] === undefined, 0x0ff /* \"duplicate aggregate blob\" */);\n        if (shouldCompress) {\n            // Note: It would be great to add code here to unpack aggregate blob back to normal blobs\n            // If only one blob made it into aggregate. Currently that does not happen as we always have\n            // at least one .component blob and at least one DDS that has .attributes blob, so it's not an issue.\n            // But it's possible that in future that would be great addition!\n            // Good news - it's backward compatible change.\n            assert(aggregator !== undefined, 0x100 /* \"logic error\" */);\n            const content = aggregator.getAggregatedBlobContent();\n            if (content !== undefined) {\n                newSummary.tree[this.aggregatedBlobName] = {\n                    type: SummaryType.Blob,\n                    content,\n                };\n            }\n        }\n        return newSummary;\n    }\n\n    protected isRealStorageId(id: string): boolean {\n        return !id.startsWith(this.virtualIdPrefix);\n    }\n}\n"]}

package/lib/packageVersion.d.ts

@@ -5,5 +5,5 @@
  * THIS IS AN AUTOGENERATED FILE. DO NOT EDIT THIS FILE DIRECTLY
  */
 export declare const pkgName = "@fluidframework/driver-utils";
-export declare const pkgVersion = "0.51.0-43124";
+export declare const pkgVersion = "0.52.0-44610";
 //# sourceMappingURL=packageVersion.d.ts.map

package/lib/packageVersion.js

@@ -5,5 +5,5 @@
  * THIS IS AN AUTOGENERATED FILE. DO NOT EDIT THIS FILE DIRECTLY
  */
 export const pkgName = "@fluidframework/driver-utils";
-export const pkgVersion = "0.51.0-43124";
+export const pkgVersion = "0.52.0-44610";
 //# sourceMappingURL=packageVersion.js.map

package/lib/packageVersion.js.map

@@ -1 +1 @@
-{"version":3,"file":"packageVersion.js","sourceRoot":"","sources":["../src/packageVersion.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,MAAM,CAAC,MAAM,OAAO,GAAG,8BAA8B,CAAC;AACtD,MAAM,CAAC,MAAM,UAAU,GAAG,cAAc,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n *\n * THIS IS AN AUTOGENERATED FILE. DO NOT EDIT THIS FILE DIRECTLY\n */\n\nexport const pkgName = \"@fluidframework/driver-utils\";\nexport const pkgVersion = \"0.51.0-43124\";\n"]}
+{"version":3,"file":"packageVersion.js","sourceRoot":"","sources":["../src/packageVersion.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,MAAM,CAAC,MAAM,OAAO,GAAG,8BAA8B,CAAC;AACtD,MAAM,CAAC,MAAM,UAAU,GAAG,cAAc,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n *\n * THIS IS AN AUTOGENERATED FILE. DO NOT EDIT THIS FILE DIRECTLY\n */\n\nexport const pkgName = \"@fluidframework/driver-utils\";\nexport const pkgVersion = \"0.52.0-44610\";\n"]}

package/lib/summaryForCreateNew.js

@@ -2,6 +2,7 @@
  * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
  * Licensed under the MIT License.
  */
+import { SummaryType, } from "@fluidframework/protocol-definitions";
 /**
  * Combine the app summary and protocol summary in 1 tree.
  * @param appSummary - Summary of the app.
@@ -9,7 +10,7 @@
  */
 export function combineAppAndProtocolSummary(appSummary, protocolSummary) {
     const createNewSummary = {
-        type: 1 /* Tree */,
+        type: SummaryType.Tree,
         tree: {
             ".protocol": protocolSummary,
             ".app": appSummary,

package/lib/summaryForCreateNew.js.map

@@ -1 +1 @@
-{"version":3,"file":"summaryForCreateNew.js","sourceRoot":"","sources":["../src/summaryForCreateNew.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAUH;;;;GAIG;AACH,MAAM,UAAU,4BAA4B,CACxC,UAAwB,EACxB,eAA6B;IAE7B,MAAM,gBAAgB,GAAiB;QACnC,IAAI,cAAkB;QACtB,IAAI,EAAE;YACF,WAAW,EAAE,eAAe;YAC5B,MAAM,EAAE,UAAU;SACrB;KACJ,CAAC;IACF,OAAO,gBAAgB,CAAC;AAC5B,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,mCAAmC,CAC/C,eAA6B;;IAE7B,MAAM,cAAc,GAAG,eAAe,CAAC,IAAI,CAAC,UAA0B,CAAC;IACvE,MAAM,kBAAkB,GAAG,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,OAAiB,CAAwB,CAAC;IAC/F,kBAAkB,CAAC,IAAI,SAAG,kBAAkB,CAAC,IAAI,mCAAI,CAAC,CAAC;IACvD,OAAO,kBAAkB,CAAC;AAC9B,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,kCAAkC,CAC9C,eAA6B;IAE7B,MAAM,gBAAgB,GAAG,eAAe,CAAC,IAAI,CAAC,YAA4B,CAAC;IAC3E,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,gBAAgB,CAAC,OAAiB,CAAmC,CAAC;IACtG,OAAO,YAAY,CAAC;AACxB,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport {\n    ISummaryTree,\n    SummaryType,\n    ISummaryBlob,\n    ICommittedProposal,\n    IDocumentAttributes,\n} from \"@fluidframework/protocol-definitions\";\n\n/**\n * Combine the app summary and protocol summary in 1 tree.\n * @param appSummary - Summary of the app.\n * @param protocolSummary - Summary of the protocol.\n */\nexport function combineAppAndProtocolSummary(\n    appSummary: ISummaryTree,\n    protocolSummary: ISummaryTree,\n): ISummaryTree {\n    const createNewSummary: ISummaryTree = {\n        type: SummaryType.Tree,\n        tree: {\n            \".protocol\": protocolSummary,\n            \".app\": appSummary,\n        },\n    };\n    return createNewSummary;\n}\n\n/**\n * Extract the attributes from the protocol summary.\n * @param protocolSummary - protocol summary from which the values are to be extracted.\n */\nexport function getDocAttributesFromProtocolSummary(\n    protocolSummary: ISummaryTree,\n): IDocumentAttributes {\n    const attributesBlob = protocolSummary.tree.attributes as ISummaryBlob;\n    const documentAttributes = JSON.parse(attributesBlob.content as string) as IDocumentAttributes;\n    documentAttributes.term = documentAttributes.term ?? 1;\n    return documentAttributes;\n}\n\n/**\n * Extract quorum values from the protocol summary.\n * @param protocolSummary - protocol summary from which the values are to be extracted.\n */\nexport function getQuorumValuesFromProtocolSummary(\n    protocolSummary: ISummaryTree,\n): [string, ICommittedProposal][] {\n    const quorumValuesBlob = protocolSummary.tree.quorumValues as ISummaryBlob;\n    const quorumValues = JSON.parse(quorumValuesBlob.content as string) as [string, ICommittedProposal][];\n    return quorumValues;\n}\n"]}
+{"version":3,"file":"summaryForCreateNew.js","sourceRoot":"","sources":["../src/summaryForCreateNew.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAEH,WAAW,GAId,MAAM,sCAAsC,CAAC;AAE9C;;;;GAIG;AACH,MAAM,UAAU,4BAA4B,CACxC,UAAwB,EACxB,eAA6B;IAE7B,MAAM,gBAAgB,GAAiB;QACnC,IAAI,EAAE,WAAW,CAAC,IAAI;QACtB,IAAI,EAAE;YACF,WAAW,EAAE,eAAe;YAC5B,MAAM,EAAE,UAAU;SACrB;KACJ,CAAC;IACF,OAAO,gBAAgB,CAAC;AAC5B,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,mCAAmC,CAC/C,eAA6B;;IAE7B,MAAM,cAAc,GAAG,eAAe,CAAC,IAAI,CAAC,UAA0B,CAAC;IACvE,MAAM,kBAAkB,GAAG,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,OAAiB,CAAwB,CAAC;IAC/F,kBAAkB,CAAC,IAAI,SAAG,kBAAkB,CAAC,IAAI,mCAAI,CAAC,CAAC;IACvD,OAAO,kBAAkB,CAAC;AAC9B,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,kCAAkC,CAC9C,eAA6B;IAE7B,MAAM,gBAAgB,GAAG,eAAe,CAAC,IAAI,CAAC,YAA4B,CAAC;IAC3E,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,gBAAgB,CAAC,OAAiB,CAAmC,CAAC;IACtG,OAAO,YAAY,CAAC;AACxB,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport {\n    ISummaryTree,\n    SummaryType,\n    ISummaryBlob,\n    ICommittedProposal,\n    IDocumentAttributes,\n} from \"@fluidframework/protocol-definitions\";\n\n/**\n * Combine the app summary and protocol summary in 1 tree.\n * @param appSummary - Summary of the app.\n * @param protocolSummary - Summary of the protocol.\n */\nexport function combineAppAndProtocolSummary(\n    appSummary: ISummaryTree,\n    protocolSummary: ISummaryTree,\n): ISummaryTree {\n    const createNewSummary: ISummaryTree = {\n        type: SummaryType.Tree,\n        tree: {\n            \".protocol\": protocolSummary,\n            \".app\": appSummary,\n        },\n    };\n    return createNewSummary;\n}\n\n/**\n * Extract the attributes from the protocol summary.\n * @param protocolSummary - protocol summary from which the values are to be extracted.\n */\nexport function getDocAttributesFromProtocolSummary(\n    protocolSummary: ISummaryTree,\n): IDocumentAttributes {\n    const attributesBlob = protocolSummary.tree.attributes as ISummaryBlob;\n    const documentAttributes = JSON.parse(attributesBlob.content as string) as IDocumentAttributes;\n    documentAttributes.term = documentAttributes.term ?? 1;\n    return documentAttributes;\n}\n\n/**\n * Extract quorum values from the protocol summary.\n * @param protocolSummary - protocol summary from which the values are to be extracted.\n */\nexport function getQuorumValuesFromProtocolSummary(\n    protocolSummary: ISummaryTree,\n): [string, ICommittedProposal][] {\n    const quorumValuesBlob = protocolSummary.tree.quorumValues as ISummaryBlob;\n    const quorumValues = JSON.parse(quorumValuesBlob.content as string) as [string, ICommittedProposal][];\n    return quorumValues;\n}\n"]}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@fluidframework/driver-utils",
-  "version": "0.51.0-43124",
+  "version": "0.52.0-44610",
   "description": "Collection of utility functions for Fluid drivers",
   "homepage": "https://fluidframework.com",
   "repository": "https://github.com/microsoft/FluidFramework",
@@ -57,20 +57,20 @@
   "dependencies": {
     "@fluidframework/common-definitions": "^0.20.1",
     "@fluidframework/common-utils": "^0.32.1",
-    "@fluidframework/core-interfaces": "^0.40.0",
-    "@fluidframework/driver-definitions": "^0.41.0",
-    "@fluidframework/gitresources": "^0.1033.0",
-    "@fluidframework/protocol-base": "^0.1033.0",
-    "@fluidframework/protocol-definitions": "^0.1025.0",
-    "@fluidframework/telemetry-utils": "0.51.0-43124",
-    "axios": "^0.21.1",
+    "@fluidframework/core-interfaces": "^0.41.0-0",
+    "@fluidframework/driver-definitions": "^0.42.0-0",
+    "@fluidframework/gitresources": "^0.1034.0-0",
+    "@fluidframework/protocol-base": "^0.1034.0-0",
+    "@fluidframework/protocol-definitions": "^0.1026.0-0",
+    "@fluidframework/telemetry-utils": "0.52.0-44610",
+    "axios": "^0.21.2",
     "uuid": "^8.3.1"
   },
   "devDependencies": {
     "@fluidframework/build-common": "^0.23.0",
     "@fluidframework/eslint-config-fluid": "^0.24.0",
-    "@fluidframework/mocha-test-setup": "0.51.0-43124",
-    "@fluidframework/runtime-utils": "0.51.0-43124",
+    "@fluidframework/mocha-test-setup": "0.52.0-44610",
+    "@fluidframework/runtime-utils": "0.52.0-44610",
     "@microsoft/api-extractor": "^7.16.1",
     "@types/mocha": "^8.2.2",
     "@types/node": "^12.19.0",

package/src/packageVersion.ts

@@ -6,4 +6,4 @@
  */
 
 export const pkgName = "@fluidframework/driver-utils";
-export const pkgVersion = "0.51.0-43124";
+export const pkgVersion = "0.52.0-44610";