@fluidframework/odsp-driver 0.59.2001 → 0.59.3000

package/.eslintrc.js

@@ -14,6 +14,5 @@ module.exports = {
         "@typescript-eslint/no-non-null-assertion": "off",
         "@typescript-eslint/no-use-before-define": "off",
         "@typescript-eslint/strict-boolean-expressions": "off",
-        "no-null/no-null": "off",
     }
 }

package/dist/ReadBufferUtils.js

@@ -36,7 +36,7 @@ class ReadBuffer {
         let multiplier = 1;
         let length = lengthArg;
         while (length > 0) {
-            common_utils_1.assert(!this.eof, 0x223 /* "unexpected end of buffer" */);
+            (0, common_utils_1.assert)(!this.eof, 0x223 /* "unexpected end of buffer" */);
             res += this.data[this.index] * multiplier;
             this.index++;
             multiplier *= 256;
@@ -45,7 +45,7 @@ class ReadBuffer {
         return res;
     }
     skip(length) {
-        common_utils_1.assert(length >= 0, 0x224 /* "Skip length should be positive" */);
+        (0, common_utils_1.assert)(length >= 0, 0x224 /* "Skip length should be positive" */);
         this.index += length;
     }
 }

package/dist/ReadBufferUtils.js.map

@@ -1 +1 @@
-{"version":3,"file":"ReadBufferUtils.js","sourceRoot":"","sources":["../src/ReadBufferUtils.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,+DAAsD;AAEtD;;;GAGG;AACH,MAAa,UAAU;IAOnB,YAA+B,IAAgB;QAAhB,SAAI,GAAJ,IAAI,CAAY;QANrC,UAAK,GAAG,CAAC,CAAC;QAOhB,4DAA4D;QAC5D,+DAA+D;QAC/D,8DAA8D;QAC9D,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC/B,CAAC;IATD,IAAW,MAAM;QACb,OAAO,IAAI,CAAC,IAAI,CAAC;IACrB,CAAC;IASD,IAAW,GAAG,KAAK,OAAO,IAAI,CAAC,KAAK,KAAK,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IAC5D,IAAW,GAAG,KAAK,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;IACvC,IAAW,MAAM,KAAK,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IAEzC,KAAK,CAAC,KAAa,EAAE,GAAW;QACnC,OAAO,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;IACvC,CAAC;IAEM,KAAK;QACR,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;IACnB,CAAC;IAEM,IAAI,CAAC,SAAS,GAAG,CAAC;QACrB,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,IAAI,MAAM,GAAG,SAAS,CAAC;QACvB,OAAO,MAAM,GAAG,CAAC,EAAE;YACf,qBAAM,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE,KAAK,CAAC,gCAAgC,CAAC,CAAC;YAC1D,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,UAAU,CAAC;YAC1C,IAAI,CAAC,KAAK,EAAE,CAAC;YACb,UAAU,IAAI,GAAG,CAAC;YAClB,MAAM,EAAE,CAAC;SACZ;QACD,OAAO,GAAG,CAAC;IACf,CAAC;IAEM,IAAI,CAAC,MAAc;QACtB,qBAAM,CAAC,MAAM,IAAI,CAAC,EAAE,KAAK,CAAC,sCAAsC,CAAC,CAAC;QAClE,IAAI,CAAC,KAAK,IAAI,MAAM,CAAC;IACzB,CAAC;CACJ;AA5CD,gCA4CC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { assert } from \"@fluidframework/common-utils\";\n\n/**\n * Buffer class, used to sequentially read data.\n * Used by tree code to reconstruct a tree from binary representation.\n */\nexport class ReadBuffer {\n    protected index = 0;\n\n    public get buffer() {\n        return this.data;\n    }\n\n    constructor(protected readonly data: Uint8Array) {\n        // BlobShallowCopy will return to users parts of this array.\n        // We need to ensure that nobody can change it, as it will have\n        // catastrophic result and will be really hard to investigate.\n        Object.freeze(data.buffer);\n    }\n\n    public get eof() { return this.index === this.data.length; }\n    public get pos() { return this.index; }\n    public get length() { return this.data.length; }\n\n    public slice(start: number, end: number) {\n        return this.data.slice(start, end);\n    }\n\n    public reset() {\n        this.index = 0;\n    }\n\n    public read(lengthArg = 1): number {\n        let res = 0;\n        let multiplier = 1;\n        let length = lengthArg;\n        while (length > 0) {\n            assert(!this.eof, 0x223 /* \"unexpected end of buffer\" */);\n            res += this.data[this.index] * multiplier;\n            this.index++;\n            multiplier *= 256;\n            length--;\n        }\n        return res;\n    }\n\n    public skip(length: number) {\n        assert(length >= 0, 0x224 /* \"Skip length should be positive\" */);\n        this.index += length;\n    }\n}\n"]}
+{"version":3,"file":"ReadBufferUtils.js","sourceRoot":"","sources":["../src/ReadBufferUtils.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,+DAAsD;AAEtD;;;GAGG;AACH,MAAa,UAAU;IAOnB,YAA+B,IAAgB;QAAhB,SAAI,GAAJ,IAAI,CAAY;QANrC,UAAK,GAAG,CAAC,CAAC;QAOhB,4DAA4D;QAC5D,+DAA+D;QAC/D,8DAA8D;QAC9D,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC/B,CAAC;IATD,IAAW,MAAM;QACb,OAAO,IAAI,CAAC,IAAI,CAAC;IACrB,CAAC;IASD,IAAW,GAAG,KAAK,OAAO,IAAI,CAAC,KAAK,KAAK,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IAC5D,IAAW,GAAG,KAAK,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;IACvC,IAAW,MAAM,KAAK,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IAEzC,KAAK,CAAC,KAAa,EAAE,GAAW;QACnC,OAAO,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;IACvC,CAAC;IAEM,KAAK;QACR,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;IACnB,CAAC;IAEM,IAAI,CAAC,SAAS,GAAG,CAAC;QACrB,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,IAAI,MAAM,GAAG,SAAS,CAAC;QACvB,OAAO,MAAM,GAAG,CAAC,EAAE;YACf,IAAA,qBAAM,EAAC,CAAC,IAAI,CAAC,GAAG,EAAE,KAAK,CAAC,gCAAgC,CAAC,CAAC;YAC1D,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,UAAU,CAAC;YAC1C,IAAI,CAAC,KAAK,EAAE,CAAC;YACb,UAAU,IAAI,GAAG,CAAC;YAClB,MAAM,EAAE,CAAC;SACZ;QACD,OAAO,GAAG,CAAC;IACf,CAAC;IAEM,IAAI,CAAC,MAAc;QACtB,IAAA,qBAAM,EAAC,MAAM,IAAI,CAAC,EAAE,KAAK,CAAC,sCAAsC,CAAC,CAAC;QAClE,IAAI,CAAC,KAAK,IAAI,MAAM,CAAC;IACzB,CAAC;CACJ;AA5CD,gCA4CC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { assert } from \"@fluidframework/common-utils\";\n\n/**\n * Buffer class, used to sequentially read data.\n * Used by tree code to reconstruct a tree from binary representation.\n */\nexport class ReadBuffer {\n    protected index = 0;\n\n    public get buffer() {\n        return this.data;\n    }\n\n    constructor(protected readonly data: Uint8Array) {\n        // BlobShallowCopy will return to users parts of this array.\n        // We need to ensure that nobody can change it, as it will have\n        // catastrophic result and will be really hard to investigate.\n        Object.freeze(data.buffer);\n    }\n\n    public get eof() { return this.index === this.data.length; }\n    public get pos() { return this.index; }\n    public get length() { return this.data.length; }\n\n    public slice(start: number, end: number) {\n        return this.data.slice(start, end);\n    }\n\n    public reset() {\n        this.index = 0;\n    }\n\n    public read(lengthArg = 1): number {\n        let res = 0;\n        let multiplier = 1;\n        let length = lengthArg;\n        while (length > 0) {\n            assert(!this.eof, 0x223 /* \"unexpected end of buffer\" */);\n            res += this.data[this.index] * multiplier;\n            this.index++;\n            multiplier *= 256;\n            length--;\n        }\n        return res;\n    }\n\n    public skip(length: number) {\n        assert(length >= 0, 0x224 /* \"Skip length should be positive\" */);\n        this.index += length;\n    }\n}\n"]}

package/dist/WriteBufferUtils.js

@@ -18,7 +18,7 @@ class WriteBuffer {
         this.index = 0;
     }
     push(code) {
-        common_utils_1.assert(this.data !== undefined, 0x225 /* "Data should be there" */);
+        (0, common_utils_1.assert)(this.data !== undefined, 0x225 /* "Data should be there" */);
         const length = this.data.length;
         if (this.index === length) {
             const newData = new Uint8Array(length * 1.2 + 4096);
@@ -41,10 +41,10 @@ class WriteBuffer {
             code = Math.floor(code / 256);
             length--;
         }
-        common_utils_1.assert(code === 0, 0x226 /* `Should write complete data code= ${codeArg} ${lengthArg}` */);
+        (0, common_utils_1.assert)(code === 0, 0x226 /* `Should write complete data code= ${codeArg} ${lengthArg}` */);
     }
     done() {
-        common_utils_1.assert(this.data !== undefined, 0x227 /* "Data should be there" */);
+        (0, common_utils_1.assert)(this.data !== undefined, 0x227 /* "Data should be there" */);
         // We can slice it to have smaller memory representation.
         // But it will be way more expensive in terms of CPU cycles!
         const buffer = new ReadBufferUtils_1.ReadBuffer(this.data.subarray(0, this.index));
@@ -100,7 +100,7 @@ const integerBytesToCodeMap = {
 */
 const boolToCodeMap = [
     12,
-    11,
+    11, // true
 ];
 /**
  * Calculate how many bytes are required to encode an integer. This is always power of 2.
@@ -151,9 +151,9 @@ function serializeBlob(buffer, blob, dictionary) {
             }
             // Write marker code for const string.
             buffer.write(code);
-            const bytes = zipItDataRepresentationUtils_1.getValueSafely(zipItDataRepresentationUtils_1.codeToBytesMap, code);
-            common_utils_1.assert(bytes >= lengthOfDataLen, 0x283 /* "Length of data len should fit in the bytes from the map" */);
-            common_utils_1.assert(bytes >= idLength, 0x284 /* "Length of id should fit in the bytes from the map" */);
+            const bytes = (0, zipItDataRepresentationUtils_1.getValueSafely)(zipItDataRepresentationUtils_1.codeToBytesMap, code);
+            (0, common_utils_1.assert)(bytes >= lengthOfDataLen, 0x283 /* "Length of data len should fit in the bytes from the map" */);
+            (0, common_utils_1.assert)(bytes >= idLength, 0x284 /* "Length of id should fit in the bytes from the map" */);
             // Assign and write id for const string.
             buffer.write(id, bytes);
             // Write length of const string.
@@ -167,14 +167,14 @@ function serializeBlob(buffer, blob, dictionary) {
             idLength = calcLength(id);
         }
         // Write Marker Code
-        buffer.write(zipItDataRepresentationUtils_1.getValueSafely(constStringBytesToCodeMap, idLength));
+        buffer.write((0, zipItDataRepresentationUtils_1.getValueSafely)(constStringBytesToCodeMap, idLength));
         // Write id of const string
         buffer.write(id, idLength);
     }
     else {
         // Write Marker code.
-        buffer.write(blob.useUtf8Code ? zipItDataRepresentationUtils_1.getValueSafely(utf8StringBytesToCodeMap, lengthOfDataLen)
-            : zipItDataRepresentationUtils_1.getValueSafely(binaryBytesToCodeMap, lengthOfDataLen));
+        buffer.write(blob.useUtf8Code ? (0, zipItDataRepresentationUtils_1.getValueSafely)(utf8StringBytesToCodeMap, lengthOfDataLen)
+            : (0, zipItDataRepresentationUtils_1.getValueSafely)(binaryBytesToCodeMap, lengthOfDataLen));
         // Write actual data if length greater than 0, otherwise Marker Code is enough.
         if (lengthOfDataLen > 0) {
             buffer.write(data.length, lengthOfDataLen);
@@ -196,8 +196,8 @@ function serializeNodeCore(buffer, nodeCore, dictionary) {
             // For a tree node start and end with set/list start and end marker codes.
             const startCode = zipItDataRepresentationUtils_1.MarkerCodesStart[child.type];
             const endCode = zipItDataRepresentationUtils_1.MarkerCodesEnd[child.type];
-            common_utils_1.assert(startCode !== undefined, 0x285 /* "Start code should not undefined" */);
-            common_utils_1.assert(endCode !== undefined, 0x286 /* "End code should not undefined" */);
+            (0, common_utils_1.assert)(startCode !== undefined, 0x285 /* "Start code should not undefined" */);
+            (0, common_utils_1.assert)(endCode !== undefined, 0x286 /* "End code should not undefined" */);
             buffer.write(startCode);
             serializeNodeCore(buffer, child, dictionary);
             buffer.write(endCode);
@@ -209,7 +209,7 @@ function serializeNodeCore(buffer, nodeCore, dictionary) {
             // Calculate length in which integer will be stored
             const len = calcLength(child);
             // Write corresponding Marker code for length of integer.
-            buffer.write(zipItDataRepresentationUtils_1.getValueSafely(integerBytesToCodeMap, len));
+            buffer.write((0, zipItDataRepresentationUtils_1.getValueSafely)(integerBytesToCodeMap, len));
             // Write actual number if greater than 0, otherwise Marker Code is enough.
             if (len > 0) {
                 buffer.write(child, len);
@@ -219,7 +219,7 @@ function serializeNodeCore(buffer, nodeCore, dictionary) {
             buffer.write(boolToCodeMap[child ? 1 : 0]);
         }
         else {
-            common_utils_1.unreachableCase(child, "Unsupported node type");
+            (0, common_utils_1.unreachableCase)(child, "Unsupported node type");
         }
     }
 }

package/dist/WriteBufferUtils.js.map

@@ -1 +1 @@
-{"version":3,"file":"WriteBufferUtils.js","sourceRoot":"","sources":["../src/WriteBufferUtils.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,+DAAuE;AACvE,uDAA+C;AAC/C,iFASwC;AAExC;;;GAGG;AACH,MAAa,WAAW;IAAxB;QACc,SAAI,GAAgB,IAAI,UAAU,CAAC,IAAI,CAAC,CAAC;QACzC,UAAK,GAAG,CAAC,CAAC;IAsCxB,CAAC;IApCa,IAAI,CAAC,IAAY;QACvB,qBAAM,CAAC,IAAI,CAAC,IAAI,KAAK,SAAS,EAAE,KAAK,CAAC,4BAA4B,CAAC,CAAC;QACpE,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;QAChC,IAAI,IAAI,CAAC,KAAK,KAAK,MAAM,EAAE;YACvB,MAAM,OAAO,GAAG,IAAI,UAAU,CAAC,MAAM,GAAG,GAAG,GAAG,IAAI,CAAC,CAAC;YACpD,IAAI,KAAK,GAAG,CAAC,CAAC;YACd,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC;YAC1B,OAAO,KAAK,GAAG,MAAM,EAAE;gBACnB,OAAO,CAAC,KAAK,CAAC,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC;gBAChC,KAAK,EAAE,CAAC;aACX;YACD,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC;SACvB;QACD,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,IAAI,GAAG,GAAG,CAAC;QACnC,IAAI,CAAC,KAAK,EAAE,CAAC;IACjB,CAAC;IAEM,KAAK,CAAC,OAAe,EAAE,SAAS,GAAG,CAAC;QACvC,IAAI,IAAI,GAAG,OAAO,CAAC;QACnB,IAAI,MAAM,GAAG,SAAS,CAAC;QACvB,OAAO,MAAM,GAAG,CAAC,EAAE;YACf,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,GAAG,CAAC,CAAC;YACtB,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,GAAG,CAAC,CAAC;YAC9B,MAAM,EAAE,CAAC;SACZ;QACD,qBAAM,CAAC,IAAI,KAAK,CAAC,EAAE,KAAK,CAAC,gEAAgE,CAAC,CAAC;IAC/F,CAAC;IAEM,IAAI;QACP,qBAAM,CAAC,IAAI,CAAC,IAAI,KAAK,SAAS,EAAE,KAAK,CAAC,4BAA4B,CAAC,CAAC;QACpE,yDAAyD;QACzD,4DAA4D;QAC5D,MAAM,MAAM,GAAG,IAAI,4BAAU,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;QACjE,IAAI,CAAC,IAAI,GAAG,SAAS,CAAC;QACtB,OAAO,MAAM,CAAC;IAClB,CAAC;CACJ;AAxCD,kCAwCC;AAED,gHAAgH;AAChH,mDAAmD;AACnD,mCAAmC;AACnC,wJAAwJ;AAExJ;;EAEE;AACF,MAAM,wBAAwB,GAAG;IAC7B,CAAC,EAAE,EAAE;IACL,CAAC,EAAE,EAAE;IACL,CAAC,EAAE,EAAE;IACL,CAAC,EAAE,EAAE;CACR,CAAC;AAEF;;;EAGE;AACF,MAAM,oBAAoB,GAAG;IACzB,CAAC,EAAE,EAAE;IACL,CAAC,EAAE,EAAE;IACL,CAAC,EAAE,EAAE;IACL,CAAC,EAAE,EAAE;IACL,CAAC,EAAE,EAAE;CACR,CAAC;AAEF;;EAEE;AACF,MAAM,yBAAyB,GAAG;IAC9B,CAAC,EAAE,EAAE;IACL,CAAC,EAAE,EAAE;IACL,CAAC,EAAE,EAAE;CACR,CAAC;AAEF;;EAEE;AACF,MAAM,qBAAqB,GAAG;IAC1B,CAAC,EAAE,CAAC;IACJ,CAAC,EAAE,CAAC;IACJ,CAAC,EAAE,CAAC;IACJ,CAAC,EAAE,CAAC;IACJ,CAAC,EAAE,CAAC;CACP,CAAC;AAEF;;EAEE;AACF,MAAM,aAAa,GAAG;IAClB,EAAE;IACF,EAAE;CACL,CAAC;AAEF;;;;;GAKG;AACF,SAAgB,UAAU,CAAC,MAAc;IACtC,IAAI,MAAM,KAAK,CAAC,EAAE;QACd,OAAO,CAAC,CAAC;KACZ;IACD,IAAI,GAAG,GAAG,MAAM,CAAC;IACjB,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,OAAO,GAAG,GAAG,CAAC,EAAE;QACZ,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC;QAC5B,SAAS,EAAE,CAAC;KACf;IACD,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,OAAO,GAAG,GAAG,SAAS,EAAE;QACpB,GAAG,IAAI,CAAC,CAAC;KACZ;IACD,OAAO,GAAG,CAAC;AACf,CAAC;AAfA,gCAeA;AAED;;;;;GAKG;AACH,SAAS,aAAa,CAAC,MAAmB,EAAE,IAAc,EAAE,UAA+B;IACvF,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC;IACzB,MAAM,eAAe,GAAG,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAChD,IAAI,IAAI,CAAC,WAAW,EAAE;QAClB,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;QAChC,IAAI,EAAE,GAAG,UAAU,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QACjC,IAAI,QAAgB,CAAC;QACrB,IAAI,EAAE,KAAK,SAAS,EAAE;YAClB,EAAE,GAAG,UAAU,CAAC,IAAI,GAAG,CAAC,CAAC;YACzB,QAAQ,GAAG,UAAU,CAAC,EAAE,CAAC,CAAC;YAC1B,UAAU,CAAC,GAAG,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;YAC5B,IAAI,IAAY,CAAC;YACjB,IAAI,eAAe,GAAG,CAAC,IAAI,QAAQ,GAAG,CAAC,EAAE;gBACrC,IAAI,GAAG,0CAAW,CAAC,qBAAqB,CAAC;aAC5C;iBAAM;gBACH,IAAI,GAAG,0CAAW,CAAC,kBAAkB,CAAC;aACzC;YACD,sCAAsC;YACtC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YACnB,MAAM,KAAK,GAAG,6CAAc,CAAC,6CAAc,EAAE,IAAI,CAAC,CAAC;YACnD,qBAAM,CAAC,KAAK,IAAI,eAAe,EAAE,KAAK,CAAC,+DAA+D,CAAC,CAAC;YACxG,qBAAM,CAAC,KAAK,IAAI,QAAQ,EAAE,KAAK,CAAC,yDAAyD,CAAC,CAAC;YAC3F,wCAAwC;YACxC,MAAM,CAAC,KAAK,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;YACxB,gCAAgC;YAChC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;YACjC,2BAA2B;YAC3B,KAAK,MAAM,OAAO,IAAI,IAAI,EAAE;gBACxB,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;aACzB;SACJ;aAAM;YACH,QAAQ,GAAG,UAAU,CAAC,EAAE,CAAC,CAAC;SAC7B;QACD,oBAAoB;QACpB,MAAM,CAAC,KAAK,CAAC,6CAAc,CAAC,yBAAyB,EAAE,QAAQ,CAAC,CAAC,CAAC;QAClE,2BAA2B;QAC3B,MAAM,CAAC,KAAK,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;KAC9B;SAAM;QACH,qBAAqB;QACrB,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,6CAAc,CAAC,wBAAwB,EAAE,eAAe,CAAC;YACrF,CAAC,CAAC,6CAAc,CAAC,oBAAoB,EAAE,eAAe,CAAC,CAAC,CAAC;QAC7D,+EAA+E;QAC/E,IAAI,eAAe,GAAG,CAAC,EAAE;YACrB,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,eAAe,CAAC,CAAC;YAC3C,KAAK,MAAM,OAAO,IAAI,IAAI,EAAE;gBACxB,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;aACzB;SACJ;KACJ;AACL,CAAC;AAED;;;;;GAKG;AACH,SAAS,iBAAiB,CAAC,MAAmB,EAAE,QAAkB,EAAE,UAA+B;IAC/F,KAAK,MAAM,KAAK,IAAI,QAAQ,CAAC,KAAK,EAAE;QAChC,IAAI,KAAK,YAAY,uCAAQ,EAAE;YAC3B,0EAA0E;YAC1E,MAAM,SAAS,GAAG,+CAAgB,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YAC/C,MAAM,OAAO,GAAG,6CAAc,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YAC3C,qBAAM,CAAC,SAAS,KAAK,SAAS,EAAE,KAAK,CAAC,uCAAuC,CAAC,CAAC;YAC/E,qBAAM,CAAC,OAAO,KAAK,SAAS,EAAE,KAAK,CAAC,qCAAqC,CAAC,CAAC;YAC3E,MAAM,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;YACxB,iBAAiB,CAAC,MAAM,EAAE,KAAK,EAAE,UAAU,CAAC,CAAC;YAC7C,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;SACzB;aAAM,IAAI,KAAK,YAAY,uCAAQ,EAAE;YAClC,aAAa,CAAC,MAAM,EAAE,KAAK,EAAE,UAAU,CAAC,CAAC;SAC5C;aAAM,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE;YAClC,mDAAmD;YACnD,MAAM,GAAG,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC;YAC9B,yDAAyD;YACzD,MAAM,CAAC,KAAK,CAAC,6CAAc,CAAC,qBAAqB,EAAE,GAAG,CAAC,CAAC,CAAC;YACzD,0EAA0E;YAC1E,IAAI,GAAG,GAAG,CAAC,EAAE;gBACT,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;aAC5B;SACJ;aAAM,IAAI,OAAO,KAAK,KAAK,SAAS,EAAE;YACnC,MAAM,CAAC,KAAK,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;SAC9C;aAAM;YACH,8BAAe,CAAC,KAAK,EAAE,uBAAuB,CAAC,CAAC;SACnD;KACJ;AACL,CAAC;AAED,MAAM,kBAAmB,SAAQ,uCAAQ;IACrC;QACI,KAAK,EAAE,CAAC;IACZ,CAAC;IAEM,SAAS,CAAC,MAAmB;QAChC,iBAAiB,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,GAAG,EAAkB,CAAC,CAAC;IAC/D,CAAC;CACJ;AAED,MAAa,qBAAsB,SAAQ,kBAAkB;IACzD;QACI,KAAK,EAAE,CAAC;IACZ,CAAC;IAED,MAAM,CAAC,IAAI,CAAC,MAAkB;QAC1B,OAAO,0CAAW,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACpC,CAAC;IAEM,SAAS;QACZ,MAAM,MAAM,GAAG,IAAI,WAAW,EAAE,CAAC;QACjC,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;QACxB,OAAO,MAAM,CAAC,IAAI,EAAE,CAAC;IACzB,CAAC;CACJ;AAdD,sDAcC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { assert, unreachableCase } from \"@fluidframework/common-utils\";\nimport { ReadBuffer } from \"./ReadBufferUtils\";\nimport {\n    BlobCore,\n    codeToBytesMap,\n    getValueSafely,\n    MarkerCodes,\n    MarkerCodesEnd,\n    MarkerCodesStart,\n    NodeCore,\n    TreeBuilder,\n} from \"./zipItDataRepresentationUtils\";\n\n/**\n * Buffer class, used to sequentially writ data.\n * Used by tree code to serialize tree into binary representation.\n */\nexport class WriteBuffer {\n    protected data?: Uint8Array = new Uint8Array(4096);\n    protected index = 0;\n\n    protected push(code: number) {\n        assert(this.data !== undefined, 0x225 /* \"Data should be there\" */);\n        const length = this.data.length;\n        if (this.index === length) {\n            const newData = new Uint8Array(length * 1.2 + 4096);\n            let index = 0;\n            const oldData = this.data;\n            while (index < length) {\n                newData[index] = oldData[index];\n                index++;\n            }\n            this.data = newData;\n        }\n        this.data[this.index] = code % 256;\n        this.index++;\n    }\n\n    public write(codeArg: number, lengthArg = 1) {\n        let code = codeArg;\n        let length = lengthArg;\n        while (length > 0) {\n            this.push(code % 256);\n            code = Math.floor(code / 256);\n            length--;\n        }\n        assert(code === 0, 0x226 /* `Should write complete data code= ${codeArg} ${lengthArg}` */);\n    }\n\n    public done(): ReadBuffer {\n        assert(this.data !== undefined, 0x227 /* \"Data should be there\" */);\n        // We can slice it to have smaller memory representation.\n        // But it will be way more expensive in terms of CPU cycles!\n        const buffer = new ReadBuffer(this.data.subarray(0, this.index));\n        this.data = undefined;\n        return buffer;\n    }\n}\n\n// This list of maps below is reverse mapping of Marker Codes specified in zipItDataRepresentationUtils.ts file.\n// We can also found them on server filestore code.\n// eslint-disable-next-line max-len\n// https://onedrive.visualstudio.com/SharePoint%20Online/_git/SPO?path=/cobalt/Base/Property/BinaryEncodedPropertyReader.cs&version=GBmaster&_a=contents\n\n/**\n * This contains mapping of number of bytes representing the corresponding string length to Marker Codes.\n*/\nconst utf8StringBytesToCodeMap = {\n    0: 13,\n    1: 14,\n    2: 15,\n    4: 16,\n};\n\n/**\n * This contains mapping of number of bytes representing the corresponding length in which actual data(base64 string)\n * will be stored to Marker Codes.\n*/\nconst binaryBytesToCodeMap = {\n    0: 32,\n    1: 33,\n    2: 34,\n    4: 35,\n    8: 16,\n};\n\n/**\n * This contains mapping of number of bytes representing the corresponding const string id to Marker Codes.\n*/\nconst constStringBytesToCodeMap = {\n    1: 17,\n    2: 18,\n    4: 19,\n};\n\n/**\n * This contains mapping of number of bytes to Marker Codes representing the corresponding Integer.\n*/\nconst integerBytesToCodeMap = {\n    0: 1,\n    1: 3,\n    2: 5,\n    4: 7,\n    8: 9,\n};\n\n/**\n * This contains mapping of boolean to Marker Codes representing the corresponding bool value.\n*/\nconst boolToCodeMap = [\n    12, // false\n    11, // true\n];\n\n/**\n * Calculate how many bytes are required to encode an integer. This is always power of 2.\n * So if 6 bytes are required to store an integer than it will return 8. 0 is a special case for which we\n * return 0 as it is usually just represented by marker code and we don't store the actual data.\n * @param num - number to encode.\n */\n export function calcLength(numArg: number) {\n    if (numArg === 0) {\n        return 0;\n    }\n    let num = numArg;\n    let lengthLen = 0;\n    while (num > 0) {\n        num = Math.floor(num / 256);\n        lengthLen++;\n    }\n    let res = 1;\n    while (res < lengthLen) {\n        res *= 2;\n    }\n    return res;\n}\n\n/**\n * Implementation of serialization of blobs in buffer with Marker Codes etc.\n * @param buffer - Buffer to serialize to.\n * @param blob - blob to be serialized.\n * @param dictionary - Const strings dictionary to be used while serializing.\n */\nfunction serializeBlob(buffer: WriteBuffer, blob: BlobCore, dictionary: Map<string, number>) {\n    const data = blob.buffer;\n    const lengthOfDataLen = calcLength(data.length);\n    if (blob.constString) {\n        const content = blob.toString();\n        let id = dictionary.get(content);\n        let idLength: number;\n        if (id === undefined) {\n            id = dictionary.size + 1;\n            idLength = calcLength(id);\n            dictionary.set(content, id);\n            let code: number;\n            if (lengthOfDataLen > 1 || idLength > 1) {\n                code = MarkerCodes.ConstStringDeclareBig;\n            } else {\n                code = MarkerCodes.ConstStringDeclare;\n            }\n            // Write marker code for const string.\n            buffer.write(code);\n            const bytes = getValueSafely(codeToBytesMap, code);\n            assert(bytes >= lengthOfDataLen, 0x283 /* \"Length of data len should fit in the bytes from the map\" */);\n            assert(bytes >= idLength, 0x284 /* \"Length of id should fit in the bytes from the map\" */);\n            // Assign and write id for const string.\n            buffer.write(id, bytes);\n            // Write length of const string.\n            buffer.write(data.length, bytes);\n            // Write const string data.\n            for (const element of data) {\n                buffer.write(element);\n            }\n        } else {\n            idLength = calcLength(id);\n        }\n        // Write Marker Code\n        buffer.write(getValueSafely(constStringBytesToCodeMap, idLength));\n        // Write id of const string\n        buffer.write(id, idLength);\n    } else {\n        // Write Marker code.\n        buffer.write(blob.useUtf8Code ? getValueSafely(utf8StringBytesToCodeMap, lengthOfDataLen)\n            : getValueSafely(binaryBytesToCodeMap, lengthOfDataLen));\n        // Write actual data if length greater than 0, otherwise Marker Code is enough.\n        if (lengthOfDataLen > 0) {\n            buffer.write(data.length, lengthOfDataLen);\n            for (const element of data) {\n                buffer.write(element);\n            }\n        }\n    }\n}\n\n/**\n * Implementation of serialization of nodes with Marker Codes etc.\n * @param buffer - Buffer to serialize to.\n * @param nodeCore - Node to be serialized.\n * @param dictionary - Const strings dictionary to be used while serializing.\n */\nfunction serializeNodeCore(buffer: WriteBuffer, nodeCore: NodeCore, dictionary: Map<string, number>) {\n    for (const child of nodeCore.nodes) {\n        if (child instanceof NodeCore) {\n            // For a tree node start and end with set/list start and end marker codes.\n            const startCode = MarkerCodesStart[child.type];\n            const endCode = MarkerCodesEnd[child.type];\n            assert(startCode !== undefined, 0x285 /* \"Start code should not undefined\" */);\n            assert(endCode !== undefined, 0x286 /* \"End code should not undefined\" */);\n            buffer.write(startCode);\n            serializeNodeCore(buffer, child, dictionary);\n            buffer.write(endCode);\n        } else if (child instanceof BlobCore) {\n            serializeBlob(buffer, child, dictionary);\n        } else if (typeof child === \"number\") {\n            // Calculate length in which integer will be stored\n            const len = calcLength(child);\n            // Write corresponding Marker code for length of integer.\n            buffer.write(getValueSafely(integerBytesToCodeMap, len));\n            // Write actual number if greater than 0, otherwise Marker Code is enough.\n            if (len > 0) {\n                buffer.write(child, len);\n            }\n        } else if (typeof child === \"boolean\") {\n            buffer.write(boolToCodeMap[child ? 1 : 0]);\n        } else {\n            unreachableCase(child, \"Unsupported node type\");\n        }\n    }\n}\n\nclass NodeCoreSerializer extends NodeCore {\n    constructor() {\n        super();\n    }\n\n    public serialize(buffer: WriteBuffer) {\n        serializeNodeCore(buffer, this, new Map<string, number>());\n    }\n}\n\nexport class TreeBuilderSerializer extends NodeCoreSerializer {\n    constructor() {\n        super();\n    }\n\n    static load(buffer: ReadBuffer): TreeBuilder {\n        return TreeBuilder.load(buffer);\n    }\n\n    public serialize(): ReadBuffer {\n        const buffer = new WriteBuffer();\n        super.serialize(buffer);\n        return buffer.done();\n    }\n}\n"]}
+{"version":3,"file":"WriteBufferUtils.js","sourceRoot":"","sources":["../src/WriteBufferUtils.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,+DAAuE;AACvE,uDAA+C;AAC/C,iFASwC;AAExC;;;GAGG;AACH,MAAa,WAAW;IAAxB;QACc,SAAI,GAAgB,IAAI,UAAU,CAAC,IAAI,CAAC,CAAC;QACzC,UAAK,GAAG,CAAC,CAAC;IAsCxB,CAAC;IApCa,IAAI,CAAC,IAAY;QACvB,IAAA,qBAAM,EAAC,IAAI,CAAC,IAAI,KAAK,SAAS,EAAE,KAAK,CAAC,4BAA4B,CAAC,CAAC;QACpE,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;QAChC,IAAI,IAAI,CAAC,KAAK,KAAK,MAAM,EAAE;YACvB,MAAM,OAAO,GAAG,IAAI,UAAU,CAAC,MAAM,GAAG,GAAG,GAAG,IAAI,CAAC,CAAC;YACpD,IAAI,KAAK,GAAG,CAAC,CAAC;YACd,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC;YAC1B,OAAO,KAAK,GAAG,MAAM,EAAE;gBACnB,OAAO,CAAC,KAAK,CAAC,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC;gBAChC,KAAK,EAAE,CAAC;aACX;YACD,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC;SACvB;QACD,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,IAAI,GAAG,GAAG,CAAC;QACnC,IAAI,CAAC,KAAK,EAAE,CAAC;IACjB,CAAC;IAEM,KAAK,CAAC,OAAe,EAAE,SAAS,GAAG,CAAC;QACvC,IAAI,IAAI,GAAG,OAAO,CAAC;QACnB,IAAI,MAAM,GAAG,SAAS,CAAC;QACvB,OAAO,MAAM,GAAG,CAAC,EAAE;YACf,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,GAAG,CAAC,CAAC;YACtB,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,GAAG,CAAC,CAAC;YAC9B,MAAM,EAAE,CAAC;SACZ;QACD,IAAA,qBAAM,EAAC,IAAI,KAAK,CAAC,EAAE,KAAK,CAAC,gEAAgE,CAAC,CAAC;IAC/F,CAAC;IAEM,IAAI;QACP,IAAA,qBAAM,EAAC,IAAI,CAAC,IAAI,KAAK,SAAS,EAAE,KAAK,CAAC,4BAA4B,CAAC,CAAC;QACpE,yDAAyD;QACzD,4DAA4D;QAC5D,MAAM,MAAM,GAAG,IAAI,4BAAU,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;QACjE,IAAI,CAAC,IAAI,GAAG,SAAS,CAAC;QACtB,OAAO,MAAM,CAAC;IAClB,CAAC;CACJ;AAxCD,kCAwCC;AAED,gHAAgH;AAChH,mDAAmD;AACnD,mCAAmC;AACnC,wJAAwJ;AAExJ;;EAEE;AACF,MAAM,wBAAwB,GAAG;IAC7B,CAAC,EAAE,EAAE;IACL,CAAC,EAAE,EAAE;IACL,CAAC,EAAE,EAAE;IACL,CAAC,EAAE,EAAE;CACR,CAAC;AAEF;;;EAGE;AACF,MAAM,oBAAoB,GAAG;IACzB,CAAC,EAAE,EAAE;IACL,CAAC,EAAE,EAAE;IACL,CAAC,EAAE,EAAE;IACL,CAAC,EAAE,EAAE;IACL,CAAC,EAAE,EAAE;CACR,CAAC;AAEF;;EAEE;AACF,MAAM,yBAAyB,GAAG;IAC9B,CAAC,EAAE,EAAE;IACL,CAAC,EAAE,EAAE;IACL,CAAC,EAAE,EAAE;CACR,CAAC;AAEF;;EAEE;AACF,MAAM,qBAAqB,GAAG;IAC1B,CAAC,EAAE,CAAC;IACJ,CAAC,EAAE,CAAC;IACJ,CAAC,EAAE,CAAC;IACJ,CAAC,EAAE,CAAC;IACJ,CAAC,EAAE,CAAC;CACP,CAAC;AAEF;;EAEE;AACF,MAAM,aAAa,GAAG;IAClB,EAAE;IACF,EAAE,EAAE,OAAO;CACd,CAAC;AAEF;;;;;GAKG;AACF,SAAgB,UAAU,CAAC,MAAc;IACtC,IAAI,MAAM,KAAK,CAAC,EAAE;QACd,OAAO,CAAC,CAAC;KACZ;IACD,IAAI,GAAG,GAAG,MAAM,CAAC;IACjB,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,OAAO,GAAG,GAAG,CAAC,EAAE;QACZ,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC;QAC5B,SAAS,EAAE,CAAC;KACf;IACD,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,OAAO,GAAG,GAAG,SAAS,EAAE;QACpB,GAAG,IAAI,CAAC,CAAC;KACZ;IACD,OAAO,GAAG,CAAC;AACf,CAAC;AAfA,gCAeA;AAED;;;;;GAKG;AACH,SAAS,aAAa,CAAC,MAAmB,EAAE,IAAc,EAAE,UAA+B;IACvF,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC;IACzB,MAAM,eAAe,GAAG,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAChD,IAAI,IAAI,CAAC,WAAW,EAAE;QAClB,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;QAChC,IAAI,EAAE,GAAG,UAAU,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QACjC,IAAI,QAAgB,CAAC;QACrB,IAAI,EAAE,KAAK,SAAS,EAAE;YAClB,EAAE,GAAG,UAAU,CAAC,IAAI,GAAG,CAAC,CAAC;YACzB,QAAQ,GAAG,UAAU,CAAC,EAAE,CAAC,CAAC;YAC1B,UAAU,CAAC,GAAG,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;YAC5B,IAAI,IAAY,CAAC;YACjB,IAAI,eAAe,GAAG,CAAC,IAAI,QAAQ,GAAG,CAAC,EAAE;gBACrC,IAAI,GAAG,0CAAW,CAAC,qBAAqB,CAAC;aAC5C;iBAAM;gBACH,IAAI,GAAG,0CAAW,CAAC,kBAAkB,CAAC;aACzC;YACD,sCAAsC;YACtC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YACnB,MAAM,KAAK,GAAG,IAAA,6CAAc,EAAC,6CAAc,EAAE,IAAI,CAAC,CAAC;YACnD,IAAA,qBAAM,EAAC,KAAK,IAAI,eAAe,EAAE,KAAK,CAAC,+DAA+D,CAAC,CAAC;YACxG,IAAA,qBAAM,EAAC,KAAK,IAAI,QAAQ,EAAE,KAAK,CAAC,yDAAyD,CAAC,CAAC;YAC3F,wCAAwC;YACxC,MAAM,CAAC,KAAK,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;YACxB,gCAAgC;YAChC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;YACjC,2BAA2B;YAC3B,KAAK,MAAM,OAAO,IAAI,IAAI,EAAE;gBACxB,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;aACzB;SACJ;aAAM;YACH,QAAQ,GAAG,UAAU,CAAC,EAAE,CAAC,CAAC;SAC7B;QACD,oBAAoB;QACpB,MAAM,CAAC,KAAK,CAAC,IAAA,6CAAc,EAAC,yBAAyB,EAAE,QAAQ,CAAC,CAAC,CAAC;QAClE,2BAA2B;QAC3B,MAAM,CAAC,KAAK,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;KAC9B;SAAM;QACH,qBAAqB;QACrB,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,IAAA,6CAAc,EAAC,wBAAwB,EAAE,eAAe,CAAC;YACrF,CAAC,CAAC,IAAA,6CAAc,EAAC,oBAAoB,EAAE,eAAe,CAAC,CAAC,CAAC;QAC7D,+EAA+E;QAC/E,IAAI,eAAe,GAAG,CAAC,EAAE;YACrB,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,eAAe,CAAC,CAAC;YAC3C,KAAK,MAAM,OAAO,IAAI,IAAI,EAAE;gBACxB,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;aACzB;SACJ;KACJ;AACL,CAAC;AAED;;;;;GAKG;AACH,SAAS,iBAAiB,CAAC,MAAmB,EAAE,QAAkB,EAAE,UAA+B;IAC/F,KAAK,MAAM,KAAK,IAAI,QAAQ,CAAC,KAAK,EAAE;QAChC,IAAI,KAAK,YAAY,uCAAQ,EAAE;YAC3B,0EAA0E;YAC1E,MAAM,SAAS,GAAG,+CAAgB,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YAC/C,MAAM,OAAO,GAAG,6CAAc,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YAC3C,IAAA,qBAAM,EAAC,SAAS,KAAK,SAAS,EAAE,KAAK,CAAC,uCAAuC,CAAC,CAAC;YAC/E,IAAA,qBAAM,EAAC,OAAO,KAAK,SAAS,EAAE,KAAK,CAAC,qCAAqC,CAAC,CAAC;YAC3E,MAAM,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;YACxB,iBAAiB,CAAC,MAAM,EAAE,KAAK,EAAE,UAAU,CAAC,CAAC;YAC7C,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;SACzB;aAAM,IAAI,KAAK,YAAY,uCAAQ,EAAE;YAClC,aAAa,CAAC,MAAM,EAAE,KAAK,EAAE,UAAU,CAAC,CAAC;SAC5C;aAAM,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE;YAClC,mDAAmD;YACnD,MAAM,GAAG,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC;YAC9B,yDAAyD;YACzD,MAAM,CAAC,KAAK,CAAC,IAAA,6CAAc,EAAC,qBAAqB,EAAE,GAAG,CAAC,CAAC,CAAC;YACzD,0EAA0E;YAC1E,IAAI,GAAG,GAAG,CAAC,EAAE;gBACT,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;aAC5B;SACJ;aAAM,IAAI,OAAO,KAAK,KAAK,SAAS,EAAE;YACnC,MAAM,CAAC,KAAK,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;SAC9C;aAAM;YACH,IAAA,8BAAe,EAAC,KAAK,EAAE,uBAAuB,CAAC,CAAC;SACnD;KACJ;AACL,CAAC;AAED,MAAM,kBAAmB,SAAQ,uCAAQ;IACrC;QACI,KAAK,EAAE,CAAC;IACZ,CAAC;IAEM,SAAS,CAAC,MAAmB;QAChC,iBAAiB,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,GAAG,EAAkB,CAAC,CAAC;IAC/D,CAAC;CACJ;AAED,MAAa,qBAAsB,SAAQ,kBAAkB;IACzD;QACI,KAAK,EAAE,CAAC;IACZ,CAAC;IAED,MAAM,CAAC,IAAI,CAAC,MAAkB;QAC1B,OAAO,0CAAW,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACpC,CAAC;IAEM,SAAS;QACZ,MAAM,MAAM,GAAG,IAAI,WAAW,EAAE,CAAC;QACjC,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;QACxB,OAAO,MAAM,CAAC,IAAI,EAAE,CAAC;IACzB,CAAC;CACJ;AAdD,sDAcC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { assert, unreachableCase } from \"@fluidframework/common-utils\";\nimport { ReadBuffer } from \"./ReadBufferUtils\";\nimport {\n    BlobCore,\n    codeToBytesMap,\n    getValueSafely,\n    MarkerCodes,\n    MarkerCodesEnd,\n    MarkerCodesStart,\n    NodeCore,\n    TreeBuilder,\n} from \"./zipItDataRepresentationUtils\";\n\n/**\n * Buffer class, used to sequentially writ data.\n * Used by tree code to serialize tree into binary representation.\n */\nexport class WriteBuffer {\n    protected data?: Uint8Array = new Uint8Array(4096);\n    protected index = 0;\n\n    protected push(code: number) {\n        assert(this.data !== undefined, 0x225 /* \"Data should be there\" */);\n        const length = this.data.length;\n        if (this.index === length) {\n            const newData = new Uint8Array(length * 1.2 + 4096);\n            let index = 0;\n            const oldData = this.data;\n            while (index < length) {\n                newData[index] = oldData[index];\n                index++;\n            }\n            this.data = newData;\n        }\n        this.data[this.index] = code % 256;\n        this.index++;\n    }\n\n    public write(codeArg: number, lengthArg = 1) {\n        let code = codeArg;\n        let length = lengthArg;\n        while (length > 0) {\n            this.push(code % 256);\n            code = Math.floor(code / 256);\n            length--;\n        }\n        assert(code === 0, 0x226 /* `Should write complete data code= ${codeArg} ${lengthArg}` */);\n    }\n\n    public done(): ReadBuffer {\n        assert(this.data !== undefined, 0x227 /* \"Data should be there\" */);\n        // We can slice it to have smaller memory representation.\n        // But it will be way more expensive in terms of CPU cycles!\n        const buffer = new ReadBuffer(this.data.subarray(0, this.index));\n        this.data = undefined;\n        return buffer;\n    }\n}\n\n// This list of maps below is reverse mapping of Marker Codes specified in zipItDataRepresentationUtils.ts file.\n// We can also found them on server filestore code.\n// eslint-disable-next-line max-len\n// https://onedrive.visualstudio.com/SharePoint%20Online/_git/SPO?path=/cobalt/Base/Property/BinaryEncodedPropertyReader.cs&version=GBmaster&_a=contents\n\n/**\n * This contains mapping of number of bytes representing the corresponding string length to Marker Codes.\n*/\nconst utf8StringBytesToCodeMap = {\n    0: 13,\n    1: 14,\n    2: 15,\n    4: 16,\n};\n\n/**\n * This contains mapping of number of bytes representing the corresponding length in which actual data(base64 string)\n * will be stored to Marker Codes.\n*/\nconst binaryBytesToCodeMap = {\n    0: 32,\n    1: 33,\n    2: 34,\n    4: 35,\n    8: 16,\n};\n\n/**\n * This contains mapping of number of bytes representing the corresponding const string id to Marker Codes.\n*/\nconst constStringBytesToCodeMap = {\n    1: 17,\n    2: 18,\n    4: 19,\n};\n\n/**\n * This contains mapping of number of bytes to Marker Codes representing the corresponding Integer.\n*/\nconst integerBytesToCodeMap = {\n    0: 1,\n    1: 3,\n    2: 5,\n    4: 7,\n    8: 9,\n};\n\n/**\n * This contains mapping of boolean to Marker Codes representing the corresponding bool value.\n*/\nconst boolToCodeMap = [\n    12, // false\n    11, // true\n];\n\n/**\n * Calculate how many bytes are required to encode an integer. This is always power of 2.\n * So if 6 bytes are required to store an integer than it will return 8. 0 is a special case for which we\n * return 0 as it is usually just represented by marker code and we don't store the actual data.\n * @param num - number to encode.\n */\n export function calcLength(numArg: number) {\n    if (numArg === 0) {\n        return 0;\n    }\n    let num = numArg;\n    let lengthLen = 0;\n    while (num > 0) {\n        num = Math.floor(num / 256);\n        lengthLen++;\n    }\n    let res = 1;\n    while (res < lengthLen) {\n        res *= 2;\n    }\n    return res;\n}\n\n/**\n * Implementation of serialization of blobs in buffer with Marker Codes etc.\n * @param buffer - Buffer to serialize to.\n * @param blob - blob to be serialized.\n * @param dictionary - Const strings dictionary to be used while serializing.\n */\nfunction serializeBlob(buffer: WriteBuffer, blob: BlobCore, dictionary: Map<string, number>) {\n    const data = blob.buffer;\n    const lengthOfDataLen = calcLength(data.length);\n    if (blob.constString) {\n        const content = blob.toString();\n        let id = dictionary.get(content);\n        let idLength: number;\n        if (id === undefined) {\n            id = dictionary.size + 1;\n            idLength = calcLength(id);\n            dictionary.set(content, id);\n            let code: number;\n            if (lengthOfDataLen > 1 || idLength > 1) {\n                code = MarkerCodes.ConstStringDeclareBig;\n            } else {\n                code = MarkerCodes.ConstStringDeclare;\n            }\n            // Write marker code for const string.\n            buffer.write(code);\n            const bytes = getValueSafely(codeToBytesMap, code);\n            assert(bytes >= lengthOfDataLen, 0x283 /* \"Length of data len should fit in the bytes from the map\" */);\n            assert(bytes >= idLength, 0x284 /* \"Length of id should fit in the bytes from the map\" */);\n            // Assign and write id for const string.\n            buffer.write(id, bytes);\n            // Write length of const string.\n            buffer.write(data.length, bytes);\n            // Write const string data.\n            for (const element of data) {\n                buffer.write(element);\n            }\n        } else {\n            idLength = calcLength(id);\n        }\n        // Write Marker Code\n        buffer.write(getValueSafely(constStringBytesToCodeMap, idLength));\n        // Write id of const string\n        buffer.write(id, idLength);\n    } else {\n        // Write Marker code.\n        buffer.write(blob.useUtf8Code ? getValueSafely(utf8StringBytesToCodeMap, lengthOfDataLen)\n            : getValueSafely(binaryBytesToCodeMap, lengthOfDataLen));\n        // Write actual data if length greater than 0, otherwise Marker Code is enough.\n        if (lengthOfDataLen > 0) {\n            buffer.write(data.length, lengthOfDataLen);\n            for (const element of data) {\n                buffer.write(element);\n            }\n        }\n    }\n}\n\n/**\n * Implementation of serialization of nodes with Marker Codes etc.\n * @param buffer - Buffer to serialize to.\n * @param nodeCore - Node to be serialized.\n * @param dictionary - Const strings dictionary to be used while serializing.\n */\nfunction serializeNodeCore(buffer: WriteBuffer, nodeCore: NodeCore, dictionary: Map<string, number>) {\n    for (const child of nodeCore.nodes) {\n        if (child instanceof NodeCore) {\n            // For a tree node start and end with set/list start and end marker codes.\n            const startCode = MarkerCodesStart[child.type];\n            const endCode = MarkerCodesEnd[child.type];\n            assert(startCode !== undefined, 0x285 /* \"Start code should not undefined\" */);\n            assert(endCode !== undefined, 0x286 /* \"End code should not undefined\" */);\n            buffer.write(startCode);\n            serializeNodeCore(buffer, child, dictionary);\n            buffer.write(endCode);\n        } else if (child instanceof BlobCore) {\n            serializeBlob(buffer, child, dictionary);\n        } else if (typeof child === \"number\") {\n            // Calculate length in which integer will be stored\n            const len = calcLength(child);\n            // Write corresponding Marker code for length of integer.\n            buffer.write(getValueSafely(integerBytesToCodeMap, len));\n            // Write actual number if greater than 0, otherwise Marker Code is enough.\n            if (len > 0) {\n                buffer.write(child, len);\n            }\n        } else if (typeof child === \"boolean\") {\n            buffer.write(boolToCodeMap[child ? 1 : 0]);\n        } else {\n            unreachableCase(child, \"Unsupported node type\");\n        }\n    }\n}\n\nclass NodeCoreSerializer extends NodeCore {\n    constructor() {\n        super();\n    }\n\n    public serialize(buffer: WriteBuffer) {\n        serializeNodeCore(buffer, this, new Map<string, number>());\n    }\n}\n\nexport class TreeBuilderSerializer extends NodeCoreSerializer {\n    constructor() {\n        super();\n    }\n\n    static load(buffer: ReadBuffer): TreeBuilder {\n        return TreeBuilder.load(buffer);\n    }\n\n    public serialize(): ReadBuffer {\n        const buffer = new WriteBuffer();\n        super.serialize(buffer);\n        return buffer.done();\n    }\n}\n"]}

package/dist/checkUrl.js

@@ -13,7 +13,7 @@ const odspFluidFileLink_1 = require("./odspFluidFileLink");
  * before the entire Fluid loading process needs to be kicked off.
  */
 function checkUrl(documentUrl) {
-    const locator = odspFluidFileLink_1.getLocatorFromOdspUrl(documentUrl);
+    const locator = (0, odspFluidFileLink_1.getLocatorFromOdspUrl)(documentUrl);
     if (!locator) {
         return undefined;
     }

package/dist/checkUrl.js.map

@@ -1 +1 @@
-{"version":3,"file":"checkUrl.js","sourceRoot":"","sources":["../src/checkUrl.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAGH,2DAA4D;AAE5D;;;;;GAKG;AACH,SAAgB,QAAQ,CAAC,WAAgB;IACvC,MAAM,OAAO,GAAG,yCAAqB,CAAC,WAAW,CAAC,CAAC;IAEnD,IAAI,CAAC,OAAO,EAAE;QACZ,OAAO,SAAS,CAAC;KAClB;IAED,IAAI,UAA8B,CAAC;IACnC,IAAI;QACF,IAAI,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,OAAO,EAAE;YACpB,UAAU,GAAG,IAAI,GAAG,CAAC,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,OAAO,CAAC,CAAC,MAAM,CAAC;SAC/C;KACF;IAAC,WAAM,GAAE;IAEV,OAAO;QACL,eAAe,EAAE,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,oBAAoB;QAC9C,uEAAuE;QACvE,mBAAmB,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,SAAS;KAC3D,CAAC;AACJ,CAAC;AAnBD,4BAmBC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { DriverPreCheckInfo } from \"@fluidframework/driver-definitions\";\nimport { getLocatorFromOdspUrl } from \"./odspFluidFileLink\";\n\n/**\n * A check that returns DriverPreCheckInfo if the URL format is likely supported by this driver.\n * Note that returning information here is NOT a full guarentee that resolve will ultimately be successsful.\n * Instead, this should be used as a lightweight check that can filter out easily detectable unsupported URLs\n * before the entire Fluid loading process needs to be kicked off.\n */\nexport function checkUrl(documentUrl: URL): DriverPreCheckInfo | undefined {\n  const locator = getLocatorFromOdspUrl(documentUrl);\n\n  if (!locator) {\n    return undefined;\n  }\n\n  let siteOrigin: string | undefined;\n  try {\n    if (locator?.siteUrl) {\n      siteOrigin = new URL(locator?.siteUrl).origin;\n    }\n  } catch {}\n\n  return {\n    codeDetailsHint: locator?.containerPackageName,\n    // Add the snapshot endpoint, which has the same domain as the site URL\n    criticalBootDomains: siteOrigin ? [siteOrigin] : undefined,\n  };\n}\n"]}
+{"version":3,"file":"checkUrl.js","sourceRoot":"","sources":["../src/checkUrl.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAGH,2DAA4D;AAE5D;;;;;GAKG;AACH,SAAgB,QAAQ,CAAC,WAAgB;IACvC,MAAM,OAAO,GAAG,IAAA,yCAAqB,EAAC,WAAW,CAAC,CAAC;IAEnD,IAAI,CAAC,OAAO,EAAE;QACZ,OAAO,SAAS,CAAC;KAClB;IAED,IAAI,UAA8B,CAAC;IACnC,IAAI;QACF,IAAI,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,OAAO,EAAE;YACpB,UAAU,GAAG,IAAI,GAAG,CAAC,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,OAAO,CAAC,CAAC,MAAM,CAAC;SAC/C;KACF;IAAC,WAAM,GAAE;IAEV,OAAO;QACL,eAAe,EAAE,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,oBAAoB;QAC9C,uEAAuE;QACvE,mBAAmB,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,SAAS;KAC3D,CAAC;AACJ,CAAC;AAnBD,4BAmBC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { DriverPreCheckInfo } from \"@fluidframework/driver-definitions\";\nimport { getLocatorFromOdspUrl } from \"./odspFluidFileLink\";\n\n/**\n * A check that returns DriverPreCheckInfo if the URL format is likely supported by this driver.\n * Note that returning information here is NOT a full guarentee that resolve will ultimately be successsful.\n * Instead, this should be used as a lightweight check that can filter out easily detectable unsupported URLs\n * before the entire Fluid loading process needs to be kicked off.\n */\nexport function checkUrl(documentUrl: URL): DriverPreCheckInfo | undefined {\n  const locator = getLocatorFromOdspUrl(documentUrl);\n\n  if (!locator) {\n    return undefined;\n  }\n\n  let siteOrigin: string | undefined;\n  try {\n    if (locator?.siteUrl) {\n      siteOrigin = new URL(locator?.siteUrl).origin;\n    }\n  } catch {}\n\n  return {\n    codeDetailsHint: locator?.containerPackageName,\n    // Add the snapshot endpoint, which has the same domain as the site URL\n    criticalBootDomains: siteOrigin ? [siteOrigin] : undefined,\n  };\n}\n"]}

package/dist/compactSnapshotParser.js

@@ -14,13 +14,13 @@ exports.currentReadVersion = "1.0";
  * @param node - tree node to read blob section from
  */
 function readBlobSection(node) {
-    zipItDataRepresentationUtils_1.assertNodeCoreInstance(node, "TreeBlobs should be of type NodeCore");
+    (0, zipItDataRepresentationUtils_1.assertNodeCoreInstance)(node, "TreeBlobs should be of type NodeCore");
     const blobs = new Map();
     for (let count = 0; count < node.length; ++count) {
         const blob = node.getNode(count);
-        const records = zipItDataRepresentationUtils_1.getAndValidateNodeProps(blob, ["id", "data"]);
-        zipItDataRepresentationUtils_1.assertBlobCoreInstance(records.data, "data should be of BlobCore type");
-        zipItDataRepresentationUtils_1.assertBlobCoreInstance(records.id, "blob id should be of BlobCore type");
+        const records = (0, zipItDataRepresentationUtils_1.getAndValidateNodeProps)(blob, ["id", "data"]);
+        (0, zipItDataRepresentationUtils_1.assertBlobCoreInstance)(records.data, "data should be of BlobCore type");
+        (0, zipItDataRepresentationUtils_1.assertBlobCoreInstance)(records.id, "blob id should be of BlobCore type");
         blobs.set(records.id.toString(), records.data.arrayBuffer);
     }
     return blobs;
@@ -30,15 +30,15 @@ function readBlobSection(node) {
  * @param node - tree node to read ops section from
  */
 function readOpsSection(node) {
-    zipItDataRepresentationUtils_1.assertNodeCoreInstance(node, "Deltas should be of type NodeCore");
+    (0, zipItDataRepresentationUtils_1.assertNodeCoreInstance)(node, "Deltas should be of type NodeCore");
     const ops = [];
-    const records = zipItDataRepresentationUtils_1.getAndValidateNodeProps(node, ["firstSequenceNumber", "deltas"]);
-    zipItDataRepresentationUtils_1.assertNumberInstance(records.firstSequenceNumber, "Seq number should be a number");
-    zipItDataRepresentationUtils_1.assertNodeCoreInstance(records.deltas, "Deltas should be a Node");
+    const records = (0, zipItDataRepresentationUtils_1.getAndValidateNodeProps)(node, ["firstSequenceNumber", "deltas"]);
+    (0, zipItDataRepresentationUtils_1.assertNumberInstance)(records.firstSequenceNumber, "Seq number should be a number");
+    (0, zipItDataRepresentationUtils_1.assertNodeCoreInstance)(records.deltas, "Deltas should be a Node");
     for (let i = 0; i < records.deltas.length; ++i) {
         ops.push(JSON.parse(records.deltas.getString(i)));
     }
-    common_utils_1.assert(records.firstSequenceNumber.valueOf() === ops[0].sequenceNumber, 0x280 /* "Validate first op seq number" */);
+    (0, common_utils_1.assert)(records.firstSequenceNumber.valueOf() === ops[0].sequenceNumber, 0x280 /* "Validate first op seq number" */);
     return ops;
 }
 /**
@@ -52,21 +52,21 @@ function readTreeSection(node) {
     };
     for (let count = 0; count < node.length; count++) {
         const treeNode = node.getNode(count);
-        const records = zipItDataRepresentationUtils_1.getAndValidateNodeProps(treeNode, ["name", "value", "children", "unreferenced"], false);
-        zipItDataRepresentationUtils_1.assertBlobCoreInstance(records.name, "Path should be of BlobCore");
+        const records = (0, zipItDataRepresentationUtils_1.getAndValidateNodeProps)(treeNode, ["name", "value", "children", "unreferenced"], false);
+        (0, zipItDataRepresentationUtils_1.assertBlobCoreInstance)(records.name, "Path should be of BlobCore");
         const path = records.name.toString();
         if (records.value !== undefined) {
-            zipItDataRepresentationUtils_1.assertBlobCoreInstance(records.value, "Blob value should be BlobCore");
+            (0, zipItDataRepresentationUtils_1.assertBlobCoreInstance)(records.value, "Blob value should be BlobCore");
             snapshotTree.blobs[path] = records.value.toString();
         }
         else {
-            zipItDataRepresentationUtils_1.assertNodeCoreInstance(records.children, "Trees should be of type NodeCore");
+            (0, zipItDataRepresentationUtils_1.assertNodeCoreInstance)(records.children, "Trees should be of type NodeCore");
             snapshotTree.trees[path] = readTreeSection(records.children);
         }
         if (records.unreferenced !== undefined) {
-            zipItDataRepresentationUtils_1.assertBoolInstance(records.unreferenced, "Unreferenced flag should be bool");
+            (0, zipItDataRepresentationUtils_1.assertBoolInstance)(records.unreferenced, "Unreferenced flag should be bool");
             const unreferenced = records.unreferenced.valueOf();
-            common_utils_1.assert(unreferenced, 0x281 /* "Unreferenced if present should be true" */);
+            (0, common_utils_1.assert)(unreferenced, 0x281 /* "Unreferenced if present should be true" */);
             snapshotTree.unreferenced = unreferenced;
         }
     }
@@ -77,11 +77,11 @@ function readTreeSection(node) {
  * @param node - tree node to de-serialize from
  */
 function readSnapshotSection(node) {
-    zipItDataRepresentationUtils_1.assertNodeCoreInstance(node, "Snapshot should be of type NodeCore");
-    const records = zipItDataRepresentationUtils_1.getAndValidateNodeProps(node, ["id", "sequenceNumber", "treeNodes"]);
-    zipItDataRepresentationUtils_1.assertNodeCoreInstance(records.treeNodes, "TreeNodes should be of type NodeCore");
-    zipItDataRepresentationUtils_1.assertNumberInstance(records.sequenceNumber, "sequenceNumber should be of type number");
-    zipItDataRepresentationUtils_1.assertBlobCoreInstance(records.id, "snapshotId should be BlobCore");
+    (0, zipItDataRepresentationUtils_1.assertNodeCoreInstance)(node, "Snapshot should be of type NodeCore");
+    const records = (0, zipItDataRepresentationUtils_1.getAndValidateNodeProps)(node, ["id", "sequenceNumber", "treeNodes"]);
+    (0, zipItDataRepresentationUtils_1.assertNodeCoreInstance)(records.treeNodes, "TreeNodes should be of type NodeCore");
+    (0, zipItDataRepresentationUtils_1.assertNumberInstance)(records.sequenceNumber, "sequenceNumber should be of type number");
+    (0, zipItDataRepresentationUtils_1.assertBlobCoreInstance)(records.id, "snapshotId should be BlobCore");
     const snapshotTree = readTreeSection(records.treeNodes);
     snapshotTree.id = records.id.toString();
     const sequenceNumber = records.sequenceNumber.valueOf();
@@ -97,14 +97,14 @@ function readSnapshotSection(node) {
  */
 function parseCompactSnapshotResponse(buffer) {
     const builder = zipItDataRepresentationUtils_1.TreeBuilder.load(buffer);
-    common_utils_1.assert(builder.length === 1, 0x219 /* "1 root should be there" */);
+    (0, common_utils_1.assert)(builder.length === 1, 0x219 /* "1 root should be there" */);
     const root = builder.getNode(0);
-    const records = zipItDataRepresentationUtils_1.getAndValidateNodeProps(root, ["mrv", "cv", "snapshot", "blobs", "deltas"], false);
-    zipItDataRepresentationUtils_1.assertBlobCoreInstance(records.mrv, "minReadVersion should be of BlobCore type");
-    zipItDataRepresentationUtils_1.assertBlobCoreInstance(records.cv, "createVersion should be of BlobCore type");
-    common_utils_1.assert(exports.snapshotMinReadVersion >= records.mrv.toString(), 0x20f /* "Driver min read version should >= to server minReadVersion" */);
-    common_utils_1.assert(records.cv.toString() >= exports.snapshotMinReadVersion, 0x210 /* "Snapshot should be created with minReadVersion or above" */);
-    common_utils_1.assert(exports.currentReadVersion === records.cv.toString(), 0x2c2 /* "Create Version should be equal to currentReadVersion" */);
+    const records = (0, zipItDataRepresentationUtils_1.getAndValidateNodeProps)(root, ["mrv", "cv", "snapshot", "blobs", "deltas"], false);
+    (0, zipItDataRepresentationUtils_1.assertBlobCoreInstance)(records.mrv, "minReadVersion should be of BlobCore type");
+    (0, zipItDataRepresentationUtils_1.assertBlobCoreInstance)(records.cv, "createVersion should be of BlobCore type");
+    (0, common_utils_1.assert)(exports.snapshotMinReadVersion >= records.mrv.toString(), 0x20f /* "Driver min read version should >= to server minReadVersion" */);
+    (0, common_utils_1.assert)(records.cv.toString() >= exports.snapshotMinReadVersion, 0x210 /* "Snapshot should be created with minReadVersion or above" */);
+    (0, common_utils_1.assert)(exports.currentReadVersion === records.cv.toString(), 0x2c2 /* "Create Version should be equal to currentReadVersion" */);
     return Object.assign(Object.assign({}, readSnapshotSection(records.snapshot)), { blobs: readBlobSection(records.blobs), ops: records.deltas !== undefined ? readOpsSection(records.deltas) : [] });
 }
 exports.parseCompactSnapshotResponse = parseCompactSnapshotResponse;

package/dist/compactSnapshotParser.js.map

@@ -1 +1 @@
-{"version":3,"file":"compactSnapshotParser.js","sourceRoot":"","sources":["../src/compactSnapshotParser.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,+DAAsD;AAItD,iFASwC;AAE3B,QAAA,sBAAsB,GAAG,KAAK,CAAC;AAC/B,QAAA,kBAAkB,GAAG,KAAK,CAAC;AAOxC;;;GAGG;AACH,SAAS,eAAe,CAAC,IAAe;IACpC,qDAAsB,CAAC,IAAI,EAAE,sCAAsC,CAAC,CAAC;IACrE,MAAM,KAAK,GAA6B,IAAI,GAAG,EAAE,CAAC;IAClD,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,IAAI,CAAC,MAAM,EAAE,EAAE,KAAK,EAAE;QAC9C,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QACjC,MAAM,OAAO,GAAG,sDAAuB,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC;QAC9D,qDAAsB,CAAC,OAAO,CAAC,IAAI,EAAE,iCAAiC,CAAC,CAAC;QACxE,qDAAsB,CAAC,OAAO,CAAC,EAAE,EAAE,oCAAoC,CAAC,CAAC;QACzE,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,QAAQ,EAAE,EAAE,OAAO,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;KAC9D;IACD,OAAO,KAAK,CAAC;AACjB,CAAC;AAED;;;GAGG;AACH,SAAS,cAAc,CAAC,IAAe;IACnC,qDAAsB,CAAC,IAAI,EAAE,mCAAmC,CAAC,CAAC;IAClE,MAAM,GAAG,GAAgC,EAAE,CAAC;IAC5C,MAAM,OAAO,GAAG,sDAAuB,CAAC,IAAI,EAAE,CAAC,qBAAqB,EAAE,QAAQ,CAAC,CAAC,CAAC;IACjF,mDAAoB,CAAC,OAAO,CAAC,mBAAmB,EAAE,+BAA+B,CAAC,CAAC;IACnF,qDAAsB,CAAC,OAAO,CAAC,MAAM,EAAE,yBAAyB,CAAC,CAAC;IAClE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE;QAC5C,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;KACrD;IACD,qBAAM,CAAC,OAAO,CAAC,mBAAmB,CAAC,OAAO,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,cAAc,EAClE,KAAK,CAAC,oCAAoC,CAAC,CAAC;IAChD,OAAO,GAAG,CAAC;AACf,CAAC;AAED;;;GAGG;AACH,SAAS,eAAe,CAAC,IAAc;IACnC,MAAM,YAAY,GAAkB;QAChC,KAAK,EAAE,EAAE;QACT,KAAK,EAAE,EAAE;KACZ,CAAC;IACF,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,IAAI,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE;QAC9C,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QACrC,MAAM,OAAO,GAAG,sDAAuB,CAAC,QAAQ,EAC5C,CAAC,MAAM,EAAE,OAAO,EAAE,UAAU,EAAE,cAAc,CAAC,EAAE,KAAK,CAAC,CAAC;QAC1D,qDAAsB,CAAC,OAAO,CAAC,IAAI,EAAE,4BAA4B,CAAC,CAAC;QACnE,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC;QACrC,IAAI,OAAO,CAAC,KAAK,KAAK,SAAS,EAAE;YAC7B,qDAAsB,CAAC,OAAO,CAAC,KAAK,EAAE,+BAA+B,CAAC,CAAC;YACvE,YAAY,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC;SACvD;aAAM;YACH,qDAAsB,CAAC,OAAO,CAAC,QAAQ,EAAE,kCAAkC,CAAC,CAAC;YAC7E,YAAY,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,eAAe,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;SAChE;QACD,IAAI,OAAO,CAAC,YAAY,KAAK,SAAS,EAAE;YACpC,iDAAkB,CAAC,OAAO,CAAC,YAAY,EAAE,kCAAkC,CAAC,CAAC;YAC7E,MAAM,YAAY,GAAG,OAAO,CAAC,YAAY,CAAC,OAAO,EAAE,CAAC;YACpD,qBAAM,CAAC,YAAY,EAAE,KAAK,CAAC,8CAA8C,CAAC,CAAC;YAC3E,YAAY,CAAC,YAAY,GAAG,YAAY,CAAC;SAC5C;KACJ;IACD,OAAO,YAAY,CAAC;AACxB,CAAC;AAED;;;GAGG;AACH,SAAS,mBAAmB,CAAC,IAAe;IACxC,qDAAsB,CAAC,IAAI,EAAE,qCAAqC,CAAC,CAAC;IACpE,MAAM,OAAO,GAAG,sDAAuB,CAAC,IAAI,EACxC,CAAC,IAAI,EAAE,gBAAgB,EAAE,WAAW,CAAC,CAAC,CAAC;IAE3C,qDAAsB,CAAC,OAAO,CAAC,SAAS,EAAE,sCAAsC,CAAC,CAAC;IAClF,mDAAoB,CAAC,OAAO,CAAC,cAAc,EAAE,yCAAyC,CAAC,CAAC;IACxF,qDAAsB,CAAC,OAAO,CAAC,EAAE,EAAE,+BAA+B,CAAC,CAAC;IACpE,MAAM,YAAY,GAAkB,eAAe,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;IACvE,YAAY,CAAC,EAAE,GAAG,OAAO,CAAC,EAAE,CAAC,QAAQ,EAAE,CAAC;IACxC,MAAM,cAAc,GAAG,OAAO,CAAC,cAAc,CAAC,OAAO,EAAE,CAAC;IACxD,OAAO;QACH,cAAc;QACd,YAAY;KACf,CAAC;AACN,CAAC;AAED;;;;GAIG;AACH,SAAgB,4BAA4B,CAAC,MAAkB;IAC3D,MAAM,OAAO,GAAG,0CAAW,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACzC,qBAAM,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,KAAK,CAAC,8BAA8B,CAAC,CAAC;IACnE,MAAM,IAAI,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IAEhC,MAAM,OAAO,GAAG,sDAAuB,CAAC,IAAI,EACxC,CAAC,KAAK,EAAE,IAAI,EAAE,UAAU,EAAE,OAAO,EAAE,QAAQ,CAAC,EAAE,KAAK,CAAC,CAAC;IAEzD,qDAAsB,CAAC,OAAO,CAAC,GAAG,EAAE,2CAA2C,CAAC,CAAC;IACjF,qDAAsB,CAAC,OAAO,CAAC,EAAE,EAAE,0CAA0C,CAAC,CAAC;IAC/E,qBAAM,CAAC,8BAAsB,IAAI,OAAO,CAAC,GAAG,CAAC,QAAQ,EAAE,EACnD,KAAK,CAAC,kEAAkE,CAAC,CAAC;IAC9E,qBAAM,CAAC,OAAO,CAAC,EAAE,CAAC,QAAQ,EAAE,IAAI,8BAAsB,EAClD,KAAK,CAAC,+DAA+D,CAAC,CAAC;IAC3E,qBAAM,CAAC,0BAAkB,KAAK,OAAO,CAAC,EAAE,CAAC,QAAQ,EAAE,EAC/C,KAAK,CAAC,4DAA4D,CAAC,CAAC;IACxE,uCACO,mBAAmB,CAAC,OAAO,CAAC,QAAQ,CAAC,KACxC,KAAK,EAAE,eAAe,CAAC,OAAO,CAAC,KAAK,CAAC,EACrC,GAAG,EAAE,OAAO,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,cAAc,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,IACzE;AACN,CAAC;AArBD,oEAqBC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { assert } from \"@fluidframework/common-utils\";\nimport { ISequencedDocumentMessage, ISnapshotTree } from \"@fluidframework/protocol-definitions\";\nimport { ISnapshotContents } from \"./odspUtils\";\nimport { ReadBuffer } from \"./ReadBufferUtils\";\nimport {\n    assertBlobCoreInstance,\n    assertBoolInstance,\n    assertNodeCoreInstance,\n    assertNumberInstance,\n    getAndValidateNodeProps,\n    NodeCore,\n    NodeTypes,\n    TreeBuilder,\n} from \"./zipItDataRepresentationUtils\";\n\nexport const snapshotMinReadVersion = \"1.0\";\nexport const currentReadVersion = \"1.0\";\n\ninterface ISnapshotSection {\n    snapshotTree: ISnapshotTree,\n    sequenceNumber: number,\n}\n\n/**\n * Recreates blobs section of the tree.\n * @param node - tree node to read blob section from\n */\nfunction readBlobSection(node: NodeTypes) {\n    assertNodeCoreInstance(node, \"TreeBlobs should be of type NodeCore\");\n    const blobs: Map<string, ArrayBuffer> = new Map();\n    for (let count = 0; count < node.length; ++count) {\n        const blob = node.getNode(count);\n        const records = getAndValidateNodeProps(blob, [\"id\", \"data\"]);\n        assertBlobCoreInstance(records.data, \"data should be of BlobCore type\");\n        assertBlobCoreInstance(records.id, \"blob id should be of BlobCore type\");\n        blobs.set(records.id.toString(), records.data.arrayBuffer);\n    }\n    return blobs;\n}\n\n/**\n * Recreates ops section of the tree.\n * @param node - tree node to read ops section from\n */\nfunction readOpsSection(node: NodeTypes) {\n    assertNodeCoreInstance(node, \"Deltas should be of type NodeCore\");\n    const ops: ISequencedDocumentMessage[] = [];\n    const records = getAndValidateNodeProps(node, [\"firstSequenceNumber\", \"deltas\"]);\n    assertNumberInstance(records.firstSequenceNumber, \"Seq number should be a number\");\n    assertNodeCoreInstance(records.deltas, \"Deltas should be a Node\");\n    for (let i = 0; i < records.deltas.length; ++i) {\n        ops.push(JSON.parse(records.deltas.getString(i)));\n    }\n    assert(records.firstSequenceNumber.valueOf() === ops[0].sequenceNumber,\n        0x280 /* \"Validate first op seq number\" */);\n    return ops;\n}\n\n/**\n * Recreates snapshot tree out of tree representation.\n * @param node - tree node to de-serialize from\n */\nfunction readTreeSection(node: NodeCore) {\n    const snapshotTree: ISnapshotTree = {\n        blobs: {},\n        trees: {},\n    };\n    for (let count = 0; count < node.length; count++) {\n        const treeNode = node.getNode(count);\n        const records = getAndValidateNodeProps(treeNode,\n            [\"name\", \"value\", \"children\", \"unreferenced\"], false);\n        assertBlobCoreInstance(records.name, \"Path should be of BlobCore\");\n        const path = records.name.toString();\n        if (records.value !== undefined) {\n            assertBlobCoreInstance(records.value, \"Blob value should be BlobCore\");\n            snapshotTree.blobs[path] = records.value.toString();\n        } else {\n            assertNodeCoreInstance(records.children, \"Trees should be of type NodeCore\");\n            snapshotTree.trees[path] = readTreeSection(records.children);\n        }\n        if (records.unreferenced !== undefined) {\n            assertBoolInstance(records.unreferenced, \"Unreferenced flag should be bool\");\n            const unreferenced = records.unreferenced.valueOf();\n            assert(unreferenced, 0x281 /* \"Unreferenced if present should be true\" */);\n            snapshotTree.unreferenced = unreferenced;\n        }\n    }\n    return snapshotTree;\n}\n\n/**\n * Recreates snapshot tree out of tree representation.\n * @param node - tree node to de-serialize from\n */\nfunction readSnapshotSection(node: NodeTypes): ISnapshotSection {\n    assertNodeCoreInstance(node, \"Snapshot should be of type NodeCore\");\n    const records = getAndValidateNodeProps(node,\n        [\"id\", \"sequenceNumber\", \"treeNodes\"]);\n\n    assertNodeCoreInstance(records.treeNodes, \"TreeNodes should be of type NodeCore\");\n    assertNumberInstance(records.sequenceNumber, \"sequenceNumber should be of type number\");\n    assertBlobCoreInstance(records.id, \"snapshotId should be BlobCore\");\n    const snapshotTree: ISnapshotTree = readTreeSection(records.treeNodes);\n    snapshotTree.id = records.id.toString();\n    const sequenceNumber = records.sequenceNumber.valueOf();\n    return {\n        sequenceNumber,\n        snapshotTree,\n    };\n}\n\n/**\n * Converts snapshot from binary compact representation to tree/blobs/ops.\n * @param buffer - Compact snapshot to be parsed into tree/blobs/ops.\n * @returns - tree, blobs and ops from the snapshot.\n */\nexport function parseCompactSnapshotResponse(buffer: ReadBuffer): ISnapshotContents {\n    const builder = TreeBuilder.load(buffer);\n    assert(builder.length === 1, 0x219 /* \"1 root should be there\" */);\n    const root = builder.getNode(0);\n\n    const records = getAndValidateNodeProps(root,\n        [\"mrv\", \"cv\", \"snapshot\", \"blobs\", \"deltas\"], false);\n\n    assertBlobCoreInstance(records.mrv, \"minReadVersion should be of BlobCore type\");\n    assertBlobCoreInstance(records.cv, \"createVersion should be of BlobCore type\");\n    assert(snapshotMinReadVersion >= records.mrv.toString(),\n        0x20f /* \"Driver min read version should >= to server minReadVersion\" */);\n    assert(records.cv.toString() >= snapshotMinReadVersion,\n        0x210 /* \"Snapshot should be created with minReadVersion or above\" */);\n    assert(currentReadVersion === records.cv.toString(),\n        0x2c2 /* \"Create Version should be equal to currentReadVersion\" */);\n    return {\n        ...readSnapshotSection(records.snapshot),\n        blobs: readBlobSection(records.blobs),\n        ops: records.deltas !== undefined ? readOpsSection(records.deltas) : [],\n    };\n}\n"]}
+{"version":3,"file":"compactSnapshotParser.js","sourceRoot":"","sources":["../src/compactSnapshotParser.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,+DAAsD;AAItD,iFASwC;AAE3B,QAAA,sBAAsB,GAAG,KAAK,CAAC;AAC/B,QAAA,kBAAkB,GAAG,KAAK,CAAC;AAOxC;;;GAGG;AACH,SAAS,eAAe,CAAC,IAAe;IACpC,IAAA,qDAAsB,EAAC,IAAI,EAAE,sCAAsC,CAAC,CAAC;IACrE,MAAM,KAAK,GAA6B,IAAI,GAAG,EAAE,CAAC;IAClD,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,IAAI,CAAC,MAAM,EAAE,EAAE,KAAK,EAAE;QAC9C,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QACjC,MAAM,OAAO,GAAG,IAAA,sDAAuB,EAAC,IAAI,EAAE,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC;QAC9D,IAAA,qDAAsB,EAAC,OAAO,CAAC,IAAI,EAAE,iCAAiC,CAAC,CAAC;QACxE,IAAA,qDAAsB,EAAC,OAAO,CAAC,EAAE,EAAE,oCAAoC,CAAC,CAAC;QACzE,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,QAAQ,EAAE,EAAE,OAAO,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;KAC9D;IACD,OAAO,KAAK,CAAC;AACjB,CAAC;AAED;;;GAGG;AACH,SAAS,cAAc,CAAC,IAAe;IACnC,IAAA,qDAAsB,EAAC,IAAI,EAAE,mCAAmC,CAAC,CAAC;IAClE,MAAM,GAAG,GAAgC,EAAE,CAAC;IAC5C,MAAM,OAAO,GAAG,IAAA,sDAAuB,EAAC,IAAI,EAAE,CAAC,qBAAqB,EAAE,QAAQ,CAAC,CAAC,CAAC;IACjF,IAAA,mDAAoB,EAAC,OAAO,CAAC,mBAAmB,EAAE,+BAA+B,CAAC,CAAC;IACnF,IAAA,qDAAsB,EAAC,OAAO,CAAC,MAAM,EAAE,yBAAyB,CAAC,CAAC;IAClE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE;QAC5C,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;KACrD;IACD,IAAA,qBAAM,EAAC,OAAO,CAAC,mBAAmB,CAAC,OAAO,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,cAAc,EAClE,KAAK,CAAC,oCAAoC,CAAC,CAAC;IAChD,OAAO,GAAG,CAAC;AACf,CAAC;AAED;;;GAGG;AACH,SAAS,eAAe,CAAC,IAAc;IACnC,MAAM,YAAY,GAAkB;QAChC,KAAK,EAAE,EAAE;QACT,KAAK,EAAE,EAAE;KACZ,CAAC;IACF,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,IAAI,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE;QAC9C,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QACrC,MAAM,OAAO,GAAG,IAAA,sDAAuB,EAAC,QAAQ,EAC5C,CAAC,MAAM,EAAE,OAAO,EAAE,UAAU,EAAE,cAAc,CAAC,EAAE,KAAK,CAAC,CAAC;QAC1D,IAAA,qDAAsB,EAAC,OAAO,CAAC,IAAI,EAAE,4BAA4B,CAAC,CAAC;QACnE,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC;QACrC,IAAI,OAAO,CAAC,KAAK,KAAK,SAAS,EAAE;YAC7B,IAAA,qDAAsB,EAAC,OAAO,CAAC,KAAK,EAAE,+BAA+B,CAAC,CAAC;YACvE,YAAY,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC;SACvD;aAAM;YACH,IAAA,qDAAsB,EAAC,OAAO,CAAC,QAAQ,EAAE,kCAAkC,CAAC,CAAC;YAC7E,YAAY,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,eAAe,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;SAChE;QACD,IAAI,OAAO,CAAC,YAAY,KAAK,SAAS,EAAE;YACpC,IAAA,iDAAkB,EAAC,OAAO,CAAC,YAAY,EAAE,kCAAkC,CAAC,CAAC;YAC7E,MAAM,YAAY,GAAG,OAAO,CAAC,YAAY,CAAC,OAAO,EAAE,CAAC;YACpD,IAAA,qBAAM,EAAC,YAAY,EAAE,KAAK,CAAC,8CAA8C,CAAC,CAAC;YAC3E,YAAY,CAAC,YAAY,GAAG,YAAY,CAAC;SAC5C;KACJ;IACD,OAAO,YAAY,CAAC;AACxB,CAAC;AAED;;;GAGG;AACH,SAAS,mBAAmB,CAAC,IAAe;IACxC,IAAA,qDAAsB,EAAC,IAAI,EAAE,qCAAqC,CAAC,CAAC;IACpE,MAAM,OAAO,GAAG,IAAA,sDAAuB,EAAC,IAAI,EACxC,CAAC,IAAI,EAAE,gBAAgB,EAAE,WAAW,CAAC,CAAC,CAAC;IAE3C,IAAA,qDAAsB,EAAC,OAAO,CAAC,SAAS,EAAE,sCAAsC,CAAC,CAAC;IAClF,IAAA,mDAAoB,EAAC,OAAO,CAAC,cAAc,EAAE,yCAAyC,CAAC,CAAC;IACxF,IAAA,qDAAsB,EAAC,OAAO,CAAC,EAAE,EAAE,+BAA+B,CAAC,CAAC;IACpE,MAAM,YAAY,GAAkB,eAAe,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;IACvE,YAAY,CAAC,EAAE,GAAG,OAAO,CAAC,EAAE,CAAC,QAAQ,EAAE,CAAC;IACxC,MAAM,cAAc,GAAG,OAAO,CAAC,cAAc,CAAC,OAAO,EAAE,CAAC;IACxD,OAAO;QACH,cAAc;QACd,YAAY;KACf,CAAC;AACN,CAAC;AAED;;;;GAIG;AACH,SAAgB,4BAA4B,CAAC,MAAkB;IAC3D,MAAM,OAAO,GAAG,0CAAW,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACzC,IAAA,qBAAM,EAAC,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,KAAK,CAAC,8BAA8B,CAAC,CAAC;IACnE,MAAM,IAAI,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IAEhC,MAAM,OAAO,GAAG,IAAA,sDAAuB,EAAC,IAAI,EACxC,CAAC,KAAK,EAAE,IAAI,EAAE,UAAU,EAAE,OAAO,EAAE,QAAQ,CAAC,EAAE,KAAK,CAAC,CAAC;IAEzD,IAAA,qDAAsB,EAAC,OAAO,CAAC,GAAG,EAAE,2CAA2C,CAAC,CAAC;IACjF,IAAA,qDAAsB,EAAC,OAAO,CAAC,EAAE,EAAE,0CAA0C,CAAC,CAAC;IAC/E,IAAA,qBAAM,EAAC,8BAAsB,IAAI,OAAO,CAAC,GAAG,CAAC,QAAQ,EAAE,EACnD,KAAK,CAAC,kEAAkE,CAAC,CAAC;IAC9E,IAAA,qBAAM,EAAC,OAAO,CAAC,EAAE,CAAC,QAAQ,EAAE,IAAI,8BAAsB,EAClD,KAAK,CAAC,+DAA+D,CAAC,CAAC;IAC3E,IAAA,qBAAM,EAAC,0BAAkB,KAAK,OAAO,CAAC,EAAE,CAAC,QAAQ,EAAE,EAC/C,KAAK,CAAC,4DAA4D,CAAC,CAAC;IACxE,uCACO,mBAAmB,CAAC,OAAO,CAAC,QAAQ,CAAC,KACxC,KAAK,EAAE,eAAe,CAAC,OAAO,CAAC,KAAK,CAAC,EACrC,GAAG,EAAE,OAAO,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,cAAc,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,IACzE;AACN,CAAC;AArBD,oEAqBC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { assert } from \"@fluidframework/common-utils\";\nimport { ISequencedDocumentMessage, ISnapshotTree } from \"@fluidframework/protocol-definitions\";\nimport { ISnapshotContents } from \"./odspUtils\";\nimport { ReadBuffer } from \"./ReadBufferUtils\";\nimport {\n    assertBlobCoreInstance,\n    assertBoolInstance,\n    assertNodeCoreInstance,\n    assertNumberInstance,\n    getAndValidateNodeProps,\n    NodeCore,\n    NodeTypes,\n    TreeBuilder,\n} from \"./zipItDataRepresentationUtils\";\n\nexport const snapshotMinReadVersion = \"1.0\";\nexport const currentReadVersion = \"1.0\";\n\ninterface ISnapshotSection {\n    snapshotTree: ISnapshotTree;\n    sequenceNumber: number;\n}\n\n/**\n * Recreates blobs section of the tree.\n * @param node - tree node to read blob section from\n */\nfunction readBlobSection(node: NodeTypes) {\n    assertNodeCoreInstance(node, \"TreeBlobs should be of type NodeCore\");\n    const blobs: Map<string, ArrayBuffer> = new Map();\n    for (let count = 0; count < node.length; ++count) {\n        const blob = node.getNode(count);\n        const records = getAndValidateNodeProps(blob, [\"id\", \"data\"]);\n        assertBlobCoreInstance(records.data, \"data should be of BlobCore type\");\n        assertBlobCoreInstance(records.id, \"blob id should be of BlobCore type\");\n        blobs.set(records.id.toString(), records.data.arrayBuffer);\n    }\n    return blobs;\n}\n\n/**\n * Recreates ops section of the tree.\n * @param node - tree node to read ops section from\n */\nfunction readOpsSection(node: NodeTypes) {\n    assertNodeCoreInstance(node, \"Deltas should be of type NodeCore\");\n    const ops: ISequencedDocumentMessage[] = [];\n    const records = getAndValidateNodeProps(node, [\"firstSequenceNumber\", \"deltas\"]);\n    assertNumberInstance(records.firstSequenceNumber, \"Seq number should be a number\");\n    assertNodeCoreInstance(records.deltas, \"Deltas should be a Node\");\n    for (let i = 0; i < records.deltas.length; ++i) {\n        ops.push(JSON.parse(records.deltas.getString(i)));\n    }\n    assert(records.firstSequenceNumber.valueOf() === ops[0].sequenceNumber,\n        0x280 /* \"Validate first op seq number\" */);\n    return ops;\n}\n\n/**\n * Recreates snapshot tree out of tree representation.\n * @param node - tree node to de-serialize from\n */\nfunction readTreeSection(node: NodeCore) {\n    const snapshotTree: ISnapshotTree = {\n        blobs: {},\n        trees: {},\n    };\n    for (let count = 0; count < node.length; count++) {\n        const treeNode = node.getNode(count);\n        const records = getAndValidateNodeProps(treeNode,\n            [\"name\", \"value\", \"children\", \"unreferenced\"], false);\n        assertBlobCoreInstance(records.name, \"Path should be of BlobCore\");\n        const path = records.name.toString();\n        if (records.value !== undefined) {\n            assertBlobCoreInstance(records.value, \"Blob value should be BlobCore\");\n            snapshotTree.blobs[path] = records.value.toString();\n        } else {\n            assertNodeCoreInstance(records.children, \"Trees should be of type NodeCore\");\n            snapshotTree.trees[path] = readTreeSection(records.children);\n        }\n        if (records.unreferenced !== undefined) {\n            assertBoolInstance(records.unreferenced, \"Unreferenced flag should be bool\");\n            const unreferenced = records.unreferenced.valueOf();\n            assert(unreferenced, 0x281 /* \"Unreferenced if present should be true\" */);\n            snapshotTree.unreferenced = unreferenced;\n        }\n    }\n    return snapshotTree;\n}\n\n/**\n * Recreates snapshot tree out of tree representation.\n * @param node - tree node to de-serialize from\n */\nfunction readSnapshotSection(node: NodeTypes): ISnapshotSection {\n    assertNodeCoreInstance(node, \"Snapshot should be of type NodeCore\");\n    const records = getAndValidateNodeProps(node,\n        [\"id\", \"sequenceNumber\", \"treeNodes\"]);\n\n    assertNodeCoreInstance(records.treeNodes, \"TreeNodes should be of type NodeCore\");\n    assertNumberInstance(records.sequenceNumber, \"sequenceNumber should be of type number\");\n    assertBlobCoreInstance(records.id, \"snapshotId should be BlobCore\");\n    const snapshotTree: ISnapshotTree = readTreeSection(records.treeNodes);\n    snapshotTree.id = records.id.toString();\n    const sequenceNumber = records.sequenceNumber.valueOf();\n    return {\n        sequenceNumber,\n        snapshotTree,\n    };\n}\n\n/**\n * Converts snapshot from binary compact representation to tree/blobs/ops.\n * @param buffer - Compact snapshot to be parsed into tree/blobs/ops.\n * @returns - tree, blobs and ops from the snapshot.\n */\nexport function parseCompactSnapshotResponse(buffer: ReadBuffer): ISnapshotContents {\n    const builder = TreeBuilder.load(buffer);\n    assert(builder.length === 1, 0x219 /* \"1 root should be there\" */);\n    const root = builder.getNode(0);\n\n    const records = getAndValidateNodeProps(root,\n        [\"mrv\", \"cv\", \"snapshot\", \"blobs\", \"deltas\"], false);\n\n    assertBlobCoreInstance(records.mrv, \"minReadVersion should be of BlobCore type\");\n    assertBlobCoreInstance(records.cv, \"createVersion should be of BlobCore type\");\n    assert(snapshotMinReadVersion >= records.mrv.toString(),\n        0x20f /* \"Driver min read version should >= to server minReadVersion\" */);\n    assert(records.cv.toString() >= snapshotMinReadVersion,\n        0x210 /* \"Snapshot should be created with minReadVersion or above\" */);\n    assert(currentReadVersion === records.cv.toString(),\n        0x2c2 /* \"Create Version should be equal to currentReadVersion\" */);\n    return {\n        ...readSnapshotSection(records.snapshot),\n        blobs: readBlobSection(records.blobs),\n        ops: records.deltas !== undefined ? readOpsSection(records.deltas) : [],\n    };\n}\n"]}

package/dist/compactSnapshotWriter.js

@@ -15,9 +15,9 @@ const zipItDataRepresentationUtils_1 = require("./zipItDataRepresentationUtils")
  * @param latestSequenceNumber - latest seq number of the container.
 */
 function writeSnapshotProps(node, latestSequenceNumber) {
-    zipItDataRepresentationUtils_1.addStringProperty(node, "mrv", compactSnapshotParser_1.snapshotMinReadVersion);
-    zipItDataRepresentationUtils_1.addStringProperty(node, "cv", compactSnapshotParser_1.snapshotMinReadVersion);
-    zipItDataRepresentationUtils_1.addNumberProperty(node, "lsn", latestSequenceNumber);
+    (0, zipItDataRepresentationUtils_1.addStringProperty)(node, "mrv", compactSnapshotParser_1.snapshotMinReadVersion);
+    (0, zipItDataRepresentationUtils_1.addStringProperty)(node, "cv", compactSnapshotParser_1.snapshotMinReadVersion);
+    (0, zipItDataRepresentationUtils_1.addNumberProperty)(node, "lsn", latestSequenceNumber);
 }
 /**
  * Represents blobs in the tree.
@@ -30,13 +30,13 @@ function writeBlobsSection(snapshotNode, blobs) {
     const blobsNode = snapshotNode.addNode("list");
     for (const [storageBlobId, blob] of blobs) {
         const blobNode = blobsNode.addNode();
-        zipItDataRepresentationUtils_1.addStringProperty(blobNode, "id", storageBlobId, true);
+        (0, zipItDataRepresentationUtils_1.addStringProperty)(blobNode, "id", storageBlobId, true);
         blobNode.addString("data", true);
         if (blob instanceof ArrayBuffer) {
             blobNode.addBlob(new Uint8Array(blob), false);
         }
         else {
-            blobNode.addBlob(new Uint8Array(common_utils_1.stringToBuffer(blob.contents, (_a = blob.encoding) !== null && _a !== void 0 ? _a : "utf-8")), false);
+            blobNode.addBlob(new Uint8Array((0, common_utils_1.stringToBuffer)(blob.contents, (_a = blob.encoding) !== null && _a !== void 0 ? _a : "utf-8")), false);
         }
     }
 }
@@ -53,9 +53,9 @@ function writeTreeSection(snapshotNode, snapshotTree) {
 function writeTreeSectionCore(treesNode, snapshotTree) {
     for (const [path, value] of Object.entries(snapshotTree.trees)) {
         const treeNode = treesNode.addNode();
-        zipItDataRepresentationUtils_1.addStringProperty(treeNode, "name", path);
+        (0, zipItDataRepresentationUtils_1.addStringProperty)(treeNode, "name", path);
         if (snapshotTree.unreferenced) {
-            zipItDataRepresentationUtils_1.addBoolProperty(treeNode, "unreferenced", snapshotTree.unreferenced);
+            (0, zipItDataRepresentationUtils_1.addBoolProperty)(treeNode, "unreferenced", snapshotTree.unreferenced);
         }
         treeNode.addString("children", true);
         const childNode = treeNode.addNode("list");
@@ -64,8 +64,8 @@ function writeTreeSectionCore(treesNode, snapshotTree) {
     if (snapshotTree.blobs) {
         for (const [path, id] of Object.entries(snapshotTree.blobs)) {
             const blobNode = treesNode.addNode();
-            zipItDataRepresentationUtils_1.addStringProperty(blobNode, "name", path);
-            zipItDataRepresentationUtils_1.addStringProperty(blobNode, "value", id, true);
+            (0, zipItDataRepresentationUtils_1.addStringProperty)(blobNode, "name", path);
+            (0, zipItDataRepresentationUtils_1.addStringProperty)(blobNode, "value", id, true);
         }
     }
 }
@@ -80,10 +80,10 @@ function writeSnapshotSection(rootNode, snapshotTree, snapshotSequenceNumber) {
     rootNode.addString("snapshot", true);
     const snapshotNode = rootNode.addNode();
     const snapshotId = snapshotTree.id;
-    common_utils_1.assert(snapshotId !== undefined, 0x21b /* "Snapshot id should be provided" */);
-    zipItDataRepresentationUtils_1.addStringProperty(snapshotNode, "id", snapshotId);
-    zipItDataRepresentationUtils_1.addStringProperty(snapshotNode, "message", `Snapshot@${snapshotSequenceNumber}`);
-    zipItDataRepresentationUtils_1.addNumberProperty(snapshotNode, "sequenceNumber", snapshotSequenceNumber);
+    (0, common_utils_1.assert)(snapshotId !== undefined, 0x21b /* "Snapshot id should be provided" */);
+    (0, zipItDataRepresentationUtils_1.addStringProperty)(snapshotNode, "id", snapshotId);
+    (0, zipItDataRepresentationUtils_1.addStringProperty)(snapshotNode, "message", `Snapshot@${snapshotSequenceNumber}`);
+    (0, zipItDataRepresentationUtils_1.addNumberProperty)(snapshotNode, "sequenceNumber", snapshotSequenceNumber);
     // Add Trees
     writeTreeSection(snapshotNode, snapshotTree);
 }
@@ -100,7 +100,7 @@ function writeOpsSection(rootNode, ops) {
     if (firstSequenceNumber !== undefined) {
         rootNode.addString("deltas", true);
         const opsNode = rootNode.addNode();
-        zipItDataRepresentationUtils_1.addNumberProperty(opsNode, "firstSequenceNumber", firstSequenceNumber);
+        (0, zipItDataRepresentationUtils_1.addNumberProperty)(opsNode, "firstSequenceNumber", firstSequenceNumber);
         opsNode.addString("deltas", true);
         const deltaNode = opsNode.addNode("list");
         ops.forEach((op) => {
@@ -117,7 +117,7 @@ function convertToCompactSnapshot(snapshotContents) {
     const builder = new WriteBufferUtils_1.TreeBuilderSerializer();
     // Create the root node.
     const rootNode = builder.addNode();
-    common_utils_1.assert(snapshotContents.sequenceNumber !== undefined, 0x21c /* "Seq number should be provided" */);
+    (0, common_utils_1.assert)(snapshotContents.sequenceNumber !== undefined, 0x21c /* "Seq number should be provided" */);
     const ops = snapshotContents.ops;
     const latestSequenceNumber = ops.length > 0 ? ops[ops.length - 1].sequenceNumber : snapshotContents.sequenceNumber;
     writeSnapshotProps(rootNode, latestSequenceNumber);

package/dist/compactSnapshotWriter.js.map

@@ -1 +1 @@
-{"version":3,"file":"compactSnapshotWriter.js","sourceRoot":"","sources":["../src/compactSnapshotWriter.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,+DAAsE;AAEtE,mEAAiE;AAGjE,yDAA2D;AAC3D,iFAAiH;AAEjH;;;;EAIE;AACF,SAAS,kBAAkB,CAAC,IAAc,EAAE,oBAA4B;IACpE,gDAAiB,CAAC,IAAI,EAAE,KAAK,EAAE,8CAAsB,CAAC,CAAC;IACvD,gDAAiB,CAAC,IAAI,EAAE,IAAI,EAAE,8CAAsB,CAAC,CAAC;IACtD,gDAAiB,CAAC,IAAI,EAAE,KAAK,EAAE,oBAAoB,CAAC,CAAC;AACzD,CAAC;AAED;;;;EAIE;AACF,SAAS,iBAAiB,CAAC,YAAsB,EAAE,KAAuC;;IACtF,YAAY,CAAC,SAAS,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;IACtC,MAAM,SAAS,GAAG,YAAY,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IAC/C,KAAK,MAAM,CAAC,aAAa,EAAE,IAAI,CAAC,IAAI,KAAK,EAAE;QACvC,MAAM,QAAQ,GAAG,SAAS,CAAC,OAAO,EAAE,CAAC;QACrC,gDAAiB,CAAC,QAAQ,EAAE,IAAI,EAAE,aAAa,EAAE,IAAI,CAAC,CAAC;QACvD,QAAQ,CAAC,SAAS,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QACjC,IAAI,IAAI,YAAY,WAAW,EAAE;YAC7B,QAAQ,CAAC,OAAO,CAAC,IAAI,UAAU,CAAC,IAAI,CAAC,EAAE,KAAK,CAAC,CAAC;SACjD;aAAM;YACH,QAAQ,CAAC,OAAO,CAAC,IAAI,UAAU,CAAC,6BAAc,CAAC,IAAI,CAAC,QAAQ,QAAE,IAAI,CAAC,QAAQ,mCAAI,OAAO,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;SACpG;KACJ;AACL,CAAC;AAED;;;;EAIE;AACF,SAAS,gBAAgB,CAAC,YAAsB,EAAE,YAA2B;IACzE,YAAY,CAAC,SAAS,CAAC,WAAW,EAAE,IAAI,CAAC,CAAC;IAC1C,MAAM,SAAS,GAAG,YAAY,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IAC/C,oBAAoB,CAAC,SAAS,EAAE,YAAY,CAAC,CAAC;AAClD,CAAC;AAED,SAAS,oBAAoB,CAAC,SAAmB,EAAE,YAA2B;IAC1E,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE;QAC5D,MAAM,QAAQ,GAAG,SAAS,CAAC,OAAO,EAAE,CAAC;QACrC,gDAAiB,CAAC,QAAQ,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;QAC1C,IAAI,YAAY,CAAC,YAAY,EAAE;YAC3B,8CAAe,CAAC,QAAQ,EAAE,cAAc,EAAE,YAAY,CAAC,YAAY,CAAC,CAAC;SACxE;QACD,QAAQ,CAAC,SAAS,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;QACrC,MAAM,SAAS,GAAG,QAAQ,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QAC3C,oBAAoB,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;KAC1C;IAED,IAAI,YAAY,CAAC,KAAK,EAAE;QACpB,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE;YACzD,MAAM,QAAQ,GAAG,SAAS,CAAC,OAAO,EAAE,CAAC;YACrC,gDAAiB,CAAC,QAAQ,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;YAC1C,gDAAiB,CAAC,QAAQ,EAAE,OAAO,EAAE,EAAE,EAAE,IAAI,CAAC,CAAC;SAClD;KACJ;AACL,CAAC;AAED;;;;;;EAME;AACF,SAAS,oBAAoB,CACzB,QAAkB,EAClB,YAA2B,EAC3B,sBAA8B;IAE9B,QAAQ,CAAC,SAAS,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;IACrC,MAAM,YAAY,GAAG,QAAQ,CAAC,OAAO,EAAE,CAAC;IAExC,MAAM,UAAU,GAAG,YAAY,CAAC,EAAE,CAAC;IACnC,qBAAM,CAAC,UAAU,KAAK,SAAS,EAAE,KAAK,CAAC,sCAAsC,CAAC,CAAC;IAC/E,gDAAiB,CAAC,YAAY,EAAE,IAAI,EAAE,UAAU,CAAC,CAAC;IAClD,gDAAiB,CAAC,YAAY,EAAE,SAAS,EAAE,YAAY,sBAAsB,EAAE,CAAC,CAAC;IACjF,gDAAiB,CAAC,YAAY,EAAE,gBAAgB,EAAE,sBAAsB,CAAC,CAAC;IAE1E,YAAY;IACZ,gBAAgB,CAAC,YAAY,EAAE,YAAY,CAAC,CAAC;AACjD,CAAC;AAED;;;;EAIE;AACF,SAAS,eAAe,CAAC,QAAkB,EAAE,GAAgC;IACzE,IAAI,mBAAuC,CAAC;IAC5C,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE;QAChB,mBAAmB,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC;KAC/C;IACD,IAAI,mBAAmB,KAAK,SAAS,EAAE;QACnC,QAAQ,CAAC,SAAS,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;QACnC,MAAM,OAAO,GAAG,QAAQ,CAAC,OAAO,EAAE,CAAC;QACnC,gDAAiB,CAAC,OAAO,EAAE,qBAAqB,EAAE,mBAAmB,CAAC,CAAC;QACvE,OAAO,CAAC,SAAS,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;QAClC,MAAM,SAAS,GAAG,OAAO,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QAC1C,GAAG,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE;YACf,SAAS,CAAC,SAAS,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;QACnD,CAAC,CAAC,CAAC;KACN;AACL,CAAC;AAED;;;;GAIG;AACH,SAAgB,wBAAwB,CAAC,gBAAmC;IACxE,MAAM,OAAO,GAAG,IAAI,wCAAqB,EAAE,CAAC;IAC5C,wBAAwB;IACxB,MAAM,QAAQ,GAAG,OAAO,CAAC,OAAO,EAAE,CAAC;IACnC,qBAAM,CAAC,gBAAgB,CAAC,cAAc,KAAK,SAAS,EAAE,KAAK,CAAC,qCAAqC,CAAC,CAAC;IACnG,MAAM,GAAG,GAAG,gBAAgB,CAAC,GAAG,CAAC;IACjC,MAAM,oBAAoB,GAAG,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,gBAAgB,CAAC,cAAc,CAAC;IACnH,kBAAkB,CAAC,QAAQ,EAAE,oBAAoB,CAAC,CAAC;IAEnD,oBAAoB,CAChB,QAAQ,EACR,gBAAgB,CAAC,YAAY,EAC7B,gBAAgB,CAAC,cAAc,CAClC,CAAC;IAEF,YAAY;IACZ,iBAAiB,CAAC,QAAQ,EAAE,gBAAgB,CAAC,KAAK,CAAC,CAAC;IAEpD,2BAA2B;IAC3B,eAAe,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;IAE/B,OAAO,OAAO,CAAC,SAAS,EAAE,CAAC;AAC/B,CAAC;AAtBD,4DAsBC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { assert, stringToBuffer } from \"@fluidframework/common-utils\";\nimport { IBlob, ISequencedDocumentMessage, ISnapshotTree } from \"@fluidframework/protocol-definitions\";\nimport { snapshotMinReadVersion } from \"./compactSnapshotParser\";\nimport { ISnapshotContents } from \"./odspUtils\";\nimport { ReadBuffer } from \"./ReadBufferUtils\";\nimport { TreeBuilderSerializer } from \"./WriteBufferUtils\";\nimport { addBoolProperty, addNumberProperty, addStringProperty, NodeCore } from \"./zipItDataRepresentationUtils\";\n\n/**\n * Writes header section of the snapshot.\n * @param node - snapshot node to serialize to\n * @param latestSequenceNumber - latest seq number of the container.\n*/\nfunction writeSnapshotProps(node: NodeCore, latestSequenceNumber: number) {\n    addStringProperty(node, \"mrv\", snapshotMinReadVersion);\n    addStringProperty(node, \"cv\", snapshotMinReadVersion);\n    addNumberProperty(node, \"lsn\", latestSequenceNumber);\n}\n\n/**\n * Represents blobs in the tree.\n * @param snapshotNode - node to serialize to.\n * @param blobs - blobs that is being serialized\n*/\nfunction writeBlobsSection(snapshotNode: NodeCore, blobs: Map<string, IBlob | ArrayBuffer>) {\n    snapshotNode.addString(\"blobs\", true);\n    const blobsNode = snapshotNode.addNode(\"list\");\n    for (const [storageBlobId, blob] of blobs) {\n        const blobNode = blobsNode.addNode();\n        addStringProperty(blobNode, \"id\", storageBlobId, true);\n        blobNode.addString(\"data\", true);\n        if (blob instanceof ArrayBuffer) {\n            blobNode.addBlob(new Uint8Array(blob), false);\n        } else {\n            blobNode.addBlob(new Uint8Array(stringToBuffer(blob.contents, blob.encoding ?? \"utf-8\")), false);\n        }\n    }\n}\n\n/**\n * Represents and serializes tree part of the snapshot\n * @param snapshotNode - tree node to serialize to\n * @param snapshotTree - snapshot tree that is being serialized\n*/\nfunction writeTreeSection(snapshotNode: NodeCore, snapshotTree: ISnapshotTree) {\n    snapshotNode.addString(\"treeNodes\", true);\n    const treesNode = snapshotNode.addNode(\"list\");\n    writeTreeSectionCore(treesNode, snapshotTree);\n}\n\nfunction writeTreeSectionCore(treesNode: NodeCore, snapshotTree: ISnapshotTree) {\n    for (const [path, value] of Object.entries(snapshotTree.trees)) {\n        const treeNode = treesNode.addNode();\n        addStringProperty(treeNode, \"name\", path);\n        if (snapshotTree.unreferenced) {\n            addBoolProperty(treeNode, \"unreferenced\", snapshotTree.unreferenced);\n        }\n        treeNode.addString(\"children\", true);\n        const childNode = treeNode.addNode(\"list\");\n        writeTreeSectionCore(childNode, value);\n    }\n\n    if (snapshotTree.blobs) {\n        for (const [path, id] of Object.entries(snapshotTree.blobs)) {\n            const blobNode = treesNode.addNode();\n            addStringProperty(blobNode, \"name\", path);\n            addStringProperty(blobNode, \"value\", id, true);\n        }\n    }\n}\n\n/**\n * Represents (serializes) snapshot tree as generalizes tree\n * @param rootNode - tree node to serialize to\n * @param snapshotTree - snapshot tree that is being serialized\n * @param blobs - blobs mapping of the snapshot\n * @param snapshotSequenceNumber - seq number at which snapshot is taken\n*/\nfunction writeSnapshotSection(\n    rootNode: NodeCore,\n    snapshotTree: ISnapshotTree,\n    snapshotSequenceNumber: number,\n) {\n    rootNode.addString(\"snapshot\", true);\n    const snapshotNode = rootNode.addNode();\n\n    const snapshotId = snapshotTree.id;\n    assert(snapshotId !== undefined, 0x21b /* \"Snapshot id should be provided\" */);\n    addStringProperty(snapshotNode, \"id\", snapshotId);\n    addStringProperty(snapshotNode, \"message\", `Snapshot@${snapshotSequenceNumber}`);\n    addNumberProperty(snapshotNode, \"sequenceNumber\", snapshotSequenceNumber);\n\n    // Add Trees\n    writeTreeSection(snapshotNode, snapshotTree);\n}\n\n/**\n * Represents ops in the tree.\n * @param rootNode - node to serialize to.\n * @param ops - ops that is being serialized\n*/\nfunction writeOpsSection(rootNode: NodeCore, ops: ISequencedDocumentMessage[]) {\n    let firstSequenceNumber: number | undefined;\n    if (ops.length > 0) {\n        firstSequenceNumber = ops[0].sequenceNumber;\n    }\n    if (firstSequenceNumber !== undefined) {\n        rootNode.addString(\"deltas\", true);\n        const opsNode = rootNode.addNode();\n        addNumberProperty(opsNode, \"firstSequenceNumber\", firstSequenceNumber);\n        opsNode.addString(\"deltas\", true);\n        const deltaNode = opsNode.addNode(\"list\");\n        ops.forEach((op) => {\n            deltaNode.addString(JSON.stringify(op), false);\n        });\n    }\n}\n\n/**\n * Converts trees/blobs/ops to binary compact representation.\n * @param snapshotContents - snapshot tree contents to serialize\n * @returns - ReadBuffer - binary representation of the data.\n */\nexport function convertToCompactSnapshot(snapshotContents: ISnapshotContents): ReadBuffer {\n    const builder = new TreeBuilderSerializer();\n    // Create the root node.\n    const rootNode = builder.addNode();\n    assert(snapshotContents.sequenceNumber !== undefined, 0x21c /* \"Seq number should be provided\" */);\n    const ops = snapshotContents.ops;\n    const latestSequenceNumber = ops.length > 0 ? ops[ops.length - 1].sequenceNumber : snapshotContents.sequenceNumber;\n    writeSnapshotProps(rootNode, latestSequenceNumber);\n\n    writeSnapshotSection(\n        rootNode,\n        snapshotContents.snapshotTree,\n        snapshotContents.sequenceNumber,\n    );\n\n    // Add Blobs\n    writeBlobsSection(rootNode, snapshotContents.blobs);\n\n    // Then write the ops node.\n    writeOpsSection(rootNode, ops);\n\n    return builder.serialize();\n}\n"]}
+{"version":3,"file":"compactSnapshotWriter.js","sourceRoot":"","sources":["../src/compactSnapshotWriter.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,+DAAsE;AAEtE,mEAAiE;AAGjE,yDAA2D;AAC3D,iFAAiH;AAEjH;;;;EAIE;AACF,SAAS,kBAAkB,CAAC,IAAc,EAAE,oBAA4B;IACpE,IAAA,gDAAiB,EAAC,IAAI,EAAE,KAAK,EAAE,8CAAsB,CAAC,CAAC;IACvD,IAAA,gDAAiB,EAAC,IAAI,EAAE,IAAI,EAAE,8CAAsB,CAAC,CAAC;IACtD,IAAA,gDAAiB,EAAC,IAAI,EAAE,KAAK,EAAE,oBAAoB,CAAC,CAAC;AACzD,CAAC;AAED;;;;EAIE;AACF,SAAS,iBAAiB,CAAC,YAAsB,EAAE,KAAuC;;IACtF,YAAY,CAAC,SAAS,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;IACtC,MAAM,SAAS,GAAG,YAAY,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IAC/C,KAAK,MAAM,CAAC,aAAa,EAAE,IAAI,CAAC,IAAI,KAAK,EAAE;QACvC,MAAM,QAAQ,GAAG,SAAS,CAAC,OAAO,EAAE,CAAC;QACrC,IAAA,gDAAiB,EAAC,QAAQ,EAAE,IAAI,EAAE,aAAa,EAAE,IAAI,CAAC,CAAC;QACvD,QAAQ,CAAC,SAAS,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QACjC,IAAI,IAAI,YAAY,WAAW,EAAE;YAC7B,QAAQ,CAAC,OAAO,CAAC,IAAI,UAAU,CAAC,IAAI,CAAC,EAAE,KAAK,CAAC,CAAC;SACjD;aAAM;YACH,QAAQ,CAAC,OAAO,CAAC,IAAI,UAAU,CAAC,IAAA,6BAAc,EAAC,IAAI,CAAC,QAAQ,EAAE,MAAA,IAAI,CAAC,QAAQ,mCAAI,OAAO,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;SACpG;KACJ;AACL,CAAC;AAED;;;;EAIE;AACF,SAAS,gBAAgB,CAAC,YAAsB,EAAE,YAA2B;IACzE,YAAY,CAAC,SAAS,CAAC,WAAW,EAAE,IAAI,CAAC,CAAC;IAC1C,MAAM,SAAS,GAAG,YAAY,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IAC/C,oBAAoB,CAAC,SAAS,EAAE,YAAY,CAAC,CAAC;AAClD,CAAC;AAED,SAAS,oBAAoB,CAAC,SAAmB,EAAE,YAA2B;IAC1E,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE;QAC5D,MAAM,QAAQ,GAAG,SAAS,CAAC,OAAO,EAAE,CAAC;QACrC,IAAA,gDAAiB,EAAC,QAAQ,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;QAC1C,IAAI,YAAY,CAAC,YAAY,EAAE;YAC3B,IAAA,8CAAe,EAAC,QAAQ,EAAE,cAAc,EAAE,YAAY,CAAC,YAAY,CAAC,CAAC;SACxE;QACD,QAAQ,CAAC,SAAS,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;QACrC,MAAM,SAAS,GAAG,QAAQ,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QAC3C,oBAAoB,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;KAC1C;IAED,IAAI,YAAY,CAAC,KAAK,EAAE;QACpB,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE;YACzD,MAAM,QAAQ,GAAG,SAAS,CAAC,OAAO,EAAE,CAAC;YACrC,IAAA,gDAAiB,EAAC,QAAQ,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;YAC1C,IAAA,gDAAiB,EAAC,QAAQ,EAAE,OAAO,EAAE,EAAE,EAAE,IAAI,CAAC,CAAC;SAClD;KACJ;AACL,CAAC;AAED;;;;;;EAME;AACF,SAAS,oBAAoB,CACzB,QAAkB,EAClB,YAA2B,EAC3B,sBAA8B;IAE9B,QAAQ,CAAC,SAAS,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;IACrC,MAAM,YAAY,GAAG,QAAQ,CAAC,OAAO,EAAE,CAAC;IAExC,MAAM,UAAU,GAAG,YAAY,CAAC,EAAE,CAAC;IACnC,IAAA,qBAAM,EAAC,UAAU,KAAK,SAAS,EAAE,KAAK,CAAC,sCAAsC,CAAC,CAAC;IAC/E,IAAA,gDAAiB,EAAC,YAAY,EAAE,IAAI,EAAE,UAAU,CAAC,CAAC;IAClD,IAAA,gDAAiB,EAAC,YAAY,EAAE,SAAS,EAAE,YAAY,sBAAsB,EAAE,CAAC,CAAC;IACjF,IAAA,gDAAiB,EAAC,YAAY,EAAE,gBAAgB,EAAE,sBAAsB,CAAC,CAAC;IAE1E,YAAY;IACZ,gBAAgB,CAAC,YAAY,EAAE,YAAY,CAAC,CAAC;AACjD,CAAC;AAED;;;;EAIE;AACF,SAAS,eAAe,CAAC,QAAkB,EAAE,GAAgC;IACzE,IAAI,mBAAuC,CAAC;IAC5C,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE;QAChB,mBAAmB,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC;KAC/C;IACD,IAAI,mBAAmB,KAAK,SAAS,EAAE;QACnC,QAAQ,CAAC,SAAS,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;QACnC,MAAM,OAAO,GAAG,QAAQ,CAAC,OAAO,EAAE,CAAC;QACnC,IAAA,gDAAiB,EAAC,OAAO,EAAE,qBAAqB,EAAE,mBAAmB,CAAC,CAAC;QACvE,OAAO,CAAC,SAAS,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;QAClC,MAAM,SAAS,GAAG,OAAO,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QAC1C,GAAG,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE;YACf,SAAS,CAAC,SAAS,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;QACnD,CAAC,CAAC,CAAC;KACN;AACL,CAAC;AAED;;;;GAIG;AACH,SAAgB,wBAAwB,CAAC,gBAAmC;IACxE,MAAM,OAAO,GAAG,IAAI,wCAAqB,EAAE,CAAC;IAC5C,wBAAwB;IACxB,MAAM,QAAQ,GAAG,OAAO,CAAC,OAAO,EAAE,CAAC;IACnC,IAAA,qBAAM,EAAC,gBAAgB,CAAC,cAAc,KAAK,SAAS,EAAE,KAAK,CAAC,qCAAqC,CAAC,CAAC;IACnG,MAAM,GAAG,GAAG,gBAAgB,CAAC,GAAG,CAAC;IACjC,MAAM,oBAAoB,GAAG,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,gBAAgB,CAAC,cAAc,CAAC;IACnH,kBAAkB,CAAC,QAAQ,EAAE,oBAAoB,CAAC,CAAC;IAEnD,oBAAoB,CAChB,QAAQ,EACR,gBAAgB,CAAC,YAAY,EAC7B,gBAAgB,CAAC,cAAc,CAClC,CAAC;IAEF,YAAY;IACZ,iBAAiB,CAAC,QAAQ,EAAE,gBAAgB,CAAC,KAAK,CAAC,CAAC;IAEpD,2BAA2B;IAC3B,eAAe,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;IAE/B,OAAO,OAAO,CAAC,SAAS,EAAE,CAAC;AAC/B,CAAC;AAtBD,4DAsBC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { assert, stringToBuffer } from \"@fluidframework/common-utils\";\nimport { IBlob, ISequencedDocumentMessage, ISnapshotTree } from \"@fluidframework/protocol-definitions\";\nimport { snapshotMinReadVersion } from \"./compactSnapshotParser\";\nimport { ISnapshotContents } from \"./odspUtils\";\nimport { ReadBuffer } from \"./ReadBufferUtils\";\nimport { TreeBuilderSerializer } from \"./WriteBufferUtils\";\nimport { addBoolProperty, addNumberProperty, addStringProperty, NodeCore } from \"./zipItDataRepresentationUtils\";\n\n/**\n * Writes header section of the snapshot.\n * @param node - snapshot node to serialize to\n * @param latestSequenceNumber - latest seq number of the container.\n*/\nfunction writeSnapshotProps(node: NodeCore, latestSequenceNumber: number) {\n    addStringProperty(node, \"mrv\", snapshotMinReadVersion);\n    addStringProperty(node, \"cv\", snapshotMinReadVersion);\n    addNumberProperty(node, \"lsn\", latestSequenceNumber);\n}\n\n/**\n * Represents blobs in the tree.\n * @param snapshotNode - node to serialize to.\n * @param blobs - blobs that is being serialized\n*/\nfunction writeBlobsSection(snapshotNode: NodeCore, blobs: Map<string, IBlob | ArrayBuffer>) {\n    snapshotNode.addString(\"blobs\", true);\n    const blobsNode = snapshotNode.addNode(\"list\");\n    for (const [storageBlobId, blob] of blobs) {\n        const blobNode = blobsNode.addNode();\n        addStringProperty(blobNode, \"id\", storageBlobId, true);\n        blobNode.addString(\"data\", true);\n        if (blob instanceof ArrayBuffer) {\n            blobNode.addBlob(new Uint8Array(blob), false);\n        } else {\n            blobNode.addBlob(new Uint8Array(stringToBuffer(blob.contents, blob.encoding ?? \"utf-8\")), false);\n        }\n    }\n}\n\n/**\n * Represents and serializes tree part of the snapshot\n * @param snapshotNode - tree node to serialize to\n * @param snapshotTree - snapshot tree that is being serialized\n*/\nfunction writeTreeSection(snapshotNode: NodeCore, snapshotTree: ISnapshotTree) {\n    snapshotNode.addString(\"treeNodes\", true);\n    const treesNode = snapshotNode.addNode(\"list\");\n    writeTreeSectionCore(treesNode, snapshotTree);\n}\n\nfunction writeTreeSectionCore(treesNode: NodeCore, snapshotTree: ISnapshotTree) {\n    for (const [path, value] of Object.entries(snapshotTree.trees)) {\n        const treeNode = treesNode.addNode();\n        addStringProperty(treeNode, \"name\", path);\n        if (snapshotTree.unreferenced) {\n            addBoolProperty(treeNode, \"unreferenced\", snapshotTree.unreferenced);\n        }\n        treeNode.addString(\"children\", true);\n        const childNode = treeNode.addNode(\"list\");\n        writeTreeSectionCore(childNode, value);\n    }\n\n    if (snapshotTree.blobs) {\n        for (const [path, id] of Object.entries(snapshotTree.blobs)) {\n            const blobNode = treesNode.addNode();\n            addStringProperty(blobNode, \"name\", path);\n            addStringProperty(blobNode, \"value\", id, true);\n        }\n    }\n}\n\n/**\n * Represents (serializes) snapshot tree as generalizes tree\n * @param rootNode - tree node to serialize to\n * @param snapshotTree - snapshot tree that is being serialized\n * @param blobs - blobs mapping of the snapshot\n * @param snapshotSequenceNumber - seq number at which snapshot is taken\n*/\nfunction writeSnapshotSection(\n    rootNode: NodeCore,\n    snapshotTree: ISnapshotTree,\n    snapshotSequenceNumber: number,\n) {\n    rootNode.addString(\"snapshot\", true);\n    const snapshotNode = rootNode.addNode();\n\n    const snapshotId = snapshotTree.id;\n    assert(snapshotId !== undefined, 0x21b /* \"Snapshot id should be provided\" */);\n    addStringProperty(snapshotNode, \"id\", snapshotId);\n    addStringProperty(snapshotNode, \"message\", `Snapshot@${snapshotSequenceNumber}`);\n    addNumberProperty(snapshotNode, \"sequenceNumber\", snapshotSequenceNumber);\n\n    // Add Trees\n    writeTreeSection(snapshotNode, snapshotTree);\n}\n\n/**\n * Represents ops in the tree.\n * @param rootNode - node to serialize to.\n * @param ops - ops that is being serialized\n*/\nfunction writeOpsSection(rootNode: NodeCore, ops: ISequencedDocumentMessage[]) {\n    let firstSequenceNumber: number | undefined;\n    if (ops.length > 0) {\n        firstSequenceNumber = ops[0].sequenceNumber;\n    }\n    if (firstSequenceNumber !== undefined) {\n        rootNode.addString(\"deltas\", true);\n        const opsNode = rootNode.addNode();\n        addNumberProperty(opsNode, \"firstSequenceNumber\", firstSequenceNumber);\n        opsNode.addString(\"deltas\", true);\n        const deltaNode = opsNode.addNode(\"list\");\n        ops.forEach((op) => {\n            deltaNode.addString(JSON.stringify(op), false);\n        });\n    }\n}\n\n/**\n * Converts trees/blobs/ops to binary compact representation.\n * @param snapshotContents - snapshot tree contents to serialize\n * @returns - ReadBuffer - binary representation of the data.\n */\nexport function convertToCompactSnapshot(snapshotContents: ISnapshotContents): ReadBuffer {\n    const builder = new TreeBuilderSerializer();\n    // Create the root node.\n    const rootNode = builder.addNode();\n    assert(snapshotContents.sequenceNumber !== undefined, 0x21c /* \"Seq number should be provided\" */);\n    const ops = snapshotContents.ops;\n    const latestSequenceNumber = ops.length > 0 ? ops[ops.length - 1].sequenceNumber : snapshotContents.sequenceNumber;\n    writeSnapshotProps(rootNode, latestSequenceNumber);\n\n    writeSnapshotSection(\n        rootNode,\n        snapshotContents.snapshotTree,\n        snapshotContents.sequenceNumber,\n    );\n\n    // Add Blobs\n    writeBlobsSection(rootNode, snapshotContents.blobs);\n\n    // Then write the ops node.\n    writeOpsSection(rootNode, ops);\n\n    return builder.serialize();\n}\n"]}

package/dist/contracts.d.ts

@@ -65,7 +65,6 @@ export interface IDocumentStorageGetVersionsResponse {
     value: IDocumentStorageVersion[];
 }
 export interface IDocumentStorageVersion {
-    message: string;
     id: string;
 }
 /**

package/dist/contracts.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"contracts.d.ts","sourceRoot":"","sources":["../src/contracts.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,KAAK,GAAG,MAAM,sCAAsC,CAAC;AAC5D,OAAO,EAAE,iBAAiB,EAAE,MAAM,yCAAyC,CAAC;AAC5E,OAAO,EAAE,iBAAiB,EAAE,MAAM,aAAa,CAAC;AAEhD;;GAEG;AACH,MAAM,WAAW,uBAAuB;IAEpC,EAAE,EAAE,MAAM,CAAC;IAIX,eAAe,CAAC,EAAE,MAAM,CAAC;IACzB,QAAQ,EAAE,MAAM,CAAC;IAEjB,kBAAkB,EAAE,MAAM,CAAC;IAC3B,eAAe,EAAE,MAAM,CAAC;IAExB;;OAEG;IACH,oBAAoB,EAAE,MAAM,CAAC;IAE7B;;;;;OAKG;IACH,WAAW,CAAC,EAAE,MAAM,CAAC;IAErB;;OAEG;IACH,6BAA6B,CAAC,EAAE,MAAM,CAAC;CAC1C;AAED;;GAEG;AACH,MAAM,WAAW,gBAAgB;IAC7B;;;OAGG;IACH,IAAI,EAAE,MAAM,CAAC;IAEb;;;OAGG;IACH,OAAO,EAAE,MAAM,CAAC;IAEhB;;;OAGG;IACH,UAAU,CAAC,EAAE,MAAM,CAAC;CACvB;AAED;;;GAGG;AACH,MAAM,WAAW,wBAAwB;IACrC,KAAK,EAAE,GAAG,CAAC,yBAAyB,EAAE,GAAG,wBAAwB,EAAE,CAAC;CACvE;AAED,MAAM,WAAW,wBAAwB;IACrC,EAAE,EAAE,GAAG,CAAC,yBAAyB,CAAC;IAClC,cAAc,EAAE,MAAM,CAAC;CAC1B;AAED,MAAM,WAAW,mCAAmC;IAChD,KAAK,EAAE,uBAAuB,EAAE,CAAC;CACpC;AAED,MAAM,WAAW,uBAAuB;IACpC,OAAO,EAAE,MAAM,CAAC;IAChB,EAAE,EAAE,MAAM,CAAC;CACd;AAED;;;;GAIG;AAEH,MAAM,WAAW,mBAAmB;IAChC,IAAI,EAAE,WAAW,GAAG,SAAS,CAAC;IAC9B,OAAO,EAAE,MAAM,CAAC;IAChB,cAAc,EAAE,MAAM,CAAC;IACvB,OAAO,EAAE,oBAAoB,EAAE,CAAC;CACnC;AAED,MAAM,WAAW,qBAAqB;IAClC,EAAE,EAAE,MAAM,CAAC;CACd;AAED,oBAAY,oBAAoB,GAAG,0BAA0B,GAAG,2BAA2B,CAAC;AAE5F,MAAM,WAAW,yBAAyB;IACtC,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,GAAG,MAAM,GAAG,QAAQ,CAAC;CACpC;AAED,MAAM,WAAW,0BAA2B,SAAQ,yBAAyB;IACzE,KAAK,EAAE,oBAAoB,CAAC;IAE5B,YAAY,CAAC,EAAE,IAAI,CAAC;CACvB;AAED,MAAM,WAAW,2BAA4B,SAAQ,yBAAyB;IAC1E,EAAE,EAAE,MAAM,CAAC;CACd;AAED,oBAAY,oBAAoB,GAAG,gBAAgB,GAAG,gBAAgB,CAAC;AAEvE,MAAM,WAAW,gBAAgB;IAC7B,IAAI,EAAE,MAAM,CAAC;IACb,OAAO,CAAC,EAAE,oBAAoB,EAAE,CAAC;CACpC;AAED,MAAM,WAAW,gBAAgB;IAC7B,IAAI,EAAE,MAAM,CAAC;IACb,OAAO,EAAE,MAAM,CAAC;IAChB,QAAQ,EAAE,QAAQ,GAAG,OAAO,CAAC;CAChC;AAED;;;;GAIG;AAEH,MAAM,WAAW,0BAA0B;IACvC,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IAEb,YAAY,CAAC,EAAE,IAAI,CAAC;CACvB;AAED,MAAM,WAAW,4BAA4B;IACzC,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,QAAQ,CAAC;CAClB;AAED,MAAM,WAAW,0BAA0B;IACvC,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;CAChB;AAED,oBAAY,sBAAsB,GAC5B,0BAA0B,GAC1B,4BAA4B,GAC5B,0BAA0B,CAAC;AAEjC,MAAM,WAAW,mBAAmB;IAChC,OAAO,EAAE,sBAAsB,EAAE,CAAC;IAClC,EAAE,EAAE,MAAM,CAAC;IACX,cAAc,EAAE,MAAM,CAAC;CAC1B;AAED;;GAEG;AACH,MAAM,WAAW,iBAAiB;IAC9B,OAAO,EAAE,MAAM,CAAC;IAGhB,QAAQ,EAAE,QAAQ,GAAG,SAAS,CAAC;IAC/B,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,MAAM,CAAC;CAChB;AAED,MAAM,WAAW,aAAa;IAC1B,EAAE,EAAE,MAAM,CAAC;IACX,KAAK,EAAE,mBAAmB,EAAE,CAAC;IAC7B,KAAK,CAAC,EAAE,iBAAiB,EAAE,CAAC;IAC5B,GAAG,CAAC,EAAE,wBAAwB,EAAE,CAAC;CACpC;AAED;;;GAGG;AACH,MAAM,WAAW,yBAA0B,SAAQ,iBAAiB;IAChE,gBAAgB,CAAC,EAAE,OAAO,CAAC;CAC9B;AAED,MAAM,WAAW,mBAAmB;IAChC,gBAAgB,EAAE,MAAM,CAAC;IACzB,OAAO,EAAE,MAAM,CAAC;IAChB,EAAE,EAAE,MAAM,CAAC;IACX,MAAM,EAAE,MAAM,CAAC;IACf,OAAO,EAAE,MAAM,CAAC;IAChB,cAAc,EAAE,MAAM,CAAC;IACvB,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,sBAAsB,CAAC,EAAE,MAAM,CAAA;CAClC;AAED,MAAM,WAAW,wBAAwB;IACrC,KAAK,EAAE,GAAG,CAAC;IACX,UAAU,EAAE,MAAM,CAAC;IAEnB,OAAO,EAAE,CAAC,CAAC;CACd;AAED,eAAO,MAAM,0BAA0B,IAAI,CAAC;AAE5C,MAAM,WAAW,eAAe;IAC5B,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,MAAM,CAAC;IACb,mDAAmD;IACnD,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,EAAE,GAAG,CAAC,yBAAyB,EAAE,CAAC;CAC9C;AAED,MAAM,WAAW,iBAAiB;IAC9B,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,MAAM,CAAC;IACb,sBAAsB;IACtB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,2BAA2B,CAAC,EAAE,MAAM,CAAC;CACxC;AAED;;GAEG;AACH,MAAM,WAAW,oBAAqB,SAAQ,iBAAiB;IAC3D,cAAc,EAAE,MAAM,CAAC;CAC1B"}
+{"version":3,"file":"contracts.d.ts","sourceRoot":"","sources":["../src/contracts.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,KAAK,GAAG,MAAM,sCAAsC,CAAC;AAC5D,OAAO,EAAE,iBAAiB,EAAE,MAAM,yCAAyC,CAAC;AAC5E,OAAO,EAAE,iBAAiB,EAAE,MAAM,aAAa,CAAC;AAEhD;;GAEG;AACH,MAAM,WAAW,uBAAuB;IAEpC,EAAE,EAAE,MAAM,CAAC;IAIX,eAAe,CAAC,EAAE,MAAM,CAAC;IACzB,QAAQ,EAAE,MAAM,CAAC;IAEjB,kBAAkB,EAAE,MAAM,CAAC;IAC3B,eAAe,EAAE,MAAM,CAAC;IAExB;;OAEG;IACH,oBAAoB,EAAE,MAAM,CAAC;IAE7B;;;;;OAKG;IACH,WAAW,CAAC,EAAE,MAAM,CAAC;IAErB;;OAEG;IACH,6BAA6B,CAAC,EAAE,MAAM,CAAC;CAC1C;AAED;;GAEG;AACH,MAAM,WAAW,gBAAgB;IAC7B;;;OAGG;IACH,IAAI,EAAE,MAAM,CAAC;IAEb;;;OAGG;IACH,OAAO,EAAE,MAAM,CAAC;IAEhB;;;OAGG;IACH,UAAU,CAAC,EAAE,MAAM,CAAC;CACvB;AAED;;;GAGG;AACH,MAAM,WAAW,wBAAwB;IACrC,KAAK,EAAE,GAAG,CAAC,yBAAyB,EAAE,GAAG,wBAAwB,EAAE,CAAC;CACvE;AAED,MAAM,WAAW,wBAAwB;IACrC,EAAE,EAAE,GAAG,CAAC,yBAAyB,CAAC;IAClC,cAAc,EAAE,MAAM,CAAC;CAC1B;AAED,MAAM,WAAW,mCAAmC;IAChD,KAAK,EAAE,uBAAuB,EAAE,CAAC;CACpC;AAED,MAAM,WAAW,uBAAuB;IACpC,EAAE,EAAE,MAAM,CAAC;CACd;AAED;;;;GAIG;AAEH,MAAM,WAAW,mBAAmB;IAChC,IAAI,EAAE,WAAW,GAAG,SAAS,CAAC;IAC9B,OAAO,EAAE,MAAM,CAAC;IAChB,cAAc,EAAE,MAAM,CAAC;IACvB,OAAO,EAAE,oBAAoB,EAAE,CAAC;CACnC;AAED,MAAM,WAAW,qBAAqB;IAClC,EAAE,EAAE,MAAM,CAAC;CACd;AAED,oBAAY,oBAAoB,GAAG,0BAA0B,GAAG,2BAA2B,CAAC;AAE5F,MAAM,WAAW,yBAAyB;IACtC,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,GAAG,MAAM,GAAG,QAAQ,CAAC;CACpC;AAED,MAAM,WAAW,0BAA2B,SAAQ,yBAAyB;IACzE,KAAK,EAAE,oBAAoB,CAAC;IAE5B,YAAY,CAAC,EAAE,IAAI,CAAC;CACvB;AAED,MAAM,WAAW,2BAA4B,SAAQ,yBAAyB;IAC1E,EAAE,EAAE,MAAM,CAAC;CACd;AAED,oBAAY,oBAAoB,GAAG,gBAAgB,GAAG,gBAAgB,CAAC;AAEvE,MAAM,WAAW,gBAAgB;IAC7B,IAAI,EAAE,MAAM,CAAC;IACb,OAAO,CAAC,EAAE,oBAAoB,EAAE,CAAC;CACpC;AAED,MAAM,WAAW,gBAAgB;IAC7B,IAAI,EAAE,MAAM,CAAC;IACb,OAAO,EAAE,MAAM,CAAC;IAChB,QAAQ,EAAE,QAAQ,GAAG,OAAO,CAAC;CAChC;AAED;;;;GAIG;AAEH,MAAM,WAAW,0BAA0B;IACvC,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IAEb,YAAY,CAAC,EAAE,IAAI,CAAC;CACvB;AAED,MAAM,WAAW,4BAA4B;IACzC,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,QAAQ,CAAC;CAClB;AAED,MAAM,WAAW,0BAA0B;IACvC,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;CAChB;AAED,oBAAY,sBAAsB,GAC5B,0BAA0B,GAC1B,4BAA4B,GAC5B,0BAA0B,CAAC;AAEjC,MAAM,WAAW,mBAAmB;IAChC,OAAO,EAAE,sBAAsB,EAAE,CAAC;IAClC,EAAE,EAAE,MAAM,CAAC;IACX,cAAc,EAAE,MAAM,CAAC;CAC1B;AAED;;GAEG;AACH,MAAM,WAAW,iBAAiB;IAC9B,OAAO,EAAE,MAAM,CAAC;IAGhB,QAAQ,EAAE,QAAQ,GAAG,SAAS,CAAC;IAC/B,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,MAAM,CAAC;CAChB;AAED,MAAM,WAAW,aAAa;IAC1B,EAAE,EAAE,MAAM,CAAC;IACX,KAAK,EAAE,mBAAmB,EAAE,CAAC;IAC7B,KAAK,CAAC,EAAE,iBAAiB,EAAE,CAAC;IAC5B,GAAG,CAAC,EAAE,wBAAwB,EAAE,CAAC;CACpC;AAED;;;GAGG;AACH,MAAM,WAAW,yBAA0B,SAAQ,iBAAiB;IAChE,gBAAgB,CAAC,EAAE,OAAO,CAAC;CAC9B;AAED,MAAM,WAAW,mBAAmB;IAChC,gBAAgB,EAAE,MAAM,CAAC;IACzB,OAAO,EAAE,MAAM,CAAC;IAChB,EAAE,EAAE,MAAM,CAAC;IACX,MAAM,EAAE,MAAM,CAAC;IACf,OAAO,EAAE,MAAM,CAAC;IAChB,cAAc,EAAE,MAAM,CAAC;IACvB,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,sBAAsB,CAAC,EAAE,MAAM,CAAC;CACnC;AAED,MAAM,WAAW,wBAAwB;IACrC,KAAK,EAAE,GAAG,CAAC;IACX,UAAU,EAAE,MAAM,CAAC;IAEnB,OAAO,EAAE,CAAC,CAAC;CACd;AAED,eAAO,MAAM,0BAA0B,IAAI,CAAC;AAE5C,MAAM,WAAW,eAAe;IAC5B,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,MAAM,CAAC;IACb,mDAAmD;IACnD,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,EAAE,GAAG,CAAC,yBAAyB,EAAE,CAAC;CAC9C;AAED,MAAM,WAAW,iBAAiB;IAC9B,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,MAAM,CAAC;IACb,sBAAsB;IACtB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,2BAA2B,CAAC,EAAE,MAAM,CAAC;CACxC;AAED;;GAEG;AACH,MAAM,WAAW,oBAAqB,SAAQ,iBAAiB;IAC3D,cAAc,EAAE,MAAM,CAAC;CAC1B"}

package/dist/contracts.js.map

@@ -1 +1 @@
-{"version":3,"file":"contracts.js","sourceRoot":"","sources":["../src/contracts.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAqNU,QAAA,0BAA0B,GAAG,CAAC,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport * as api from \"@fluidframework/protocol-definitions\";\nimport { HostStoragePolicy } from \"@fluidframework/odsp-driver-definitions\";\nimport { ISnapshotContents } from \"./odspUtils\";\n\n/**\n * Socket storage discovery api response\n */\nexport interface ISocketStorageDiscovery {\n    // The id of the web socket\n    id: string;\n\n    // SPO gives us runtimeTenantId, we remap it to tenantId\n    // See getSocketStorageDiscovery\n    runtimeTenantId?: string;\n    tenantId: string;\n\n    snapshotStorageUrl: string;\n    deltaStorageUrl: string;\n\n    /**\n     * PUSH URL\n     */\n    deltaStreamSocketUrl: string;\n\n    /**\n     * The access token for PushChannel. Optionally returned, depending on implementation.\n     * OneDrive for Consumer implementation returns it and OneDrive for Business implementation\n     * does not return it and instead expects token to be returned via `getWebsocketToken` callback\n     * passed as a parameter to `OdspDocumentService.create()` factory.\n     */\n    socketToken?: string;\n\n    /**\n     * This is the time within which client has to refresh the session on (ODSP) relay service.\n     */\n    refreshSessionDurationSeconds?: number;\n}\n\n/**\n * Interface for error responses for the WebSocket connection\n */\nexport interface IOdspSocketError {\n    /**\n     * An error code number for the error that occurred\n     * It will be a valid HTTP status code\n     */\n    code: number;\n\n    /**\n     * A message about the error that occurred for debugging / logging purposes\n     * This should not be displayed to the user directly\n     */\n    message: string;\n\n    /**\n     * Optional Retry-After time in seconds\n     * The client should wait this many seconds before retrying its request\n     */\n    retryAfter?: number;\n}\n\n/**\n * Interface for delta storage response.\n * Contains either SequencedDocumentMessages or SequencedDeltaOpMessage.\n */\nexport interface IDeltaStorageGetResponse {\n    value: api.ISequencedDocumentMessage[] | ISequencedDeltaOpMessage[];\n}\n\nexport interface ISequencedDeltaOpMessage {\n    op: api.ISequencedDocumentMessage;\n    sequenceNumber: number;\n}\n\nexport interface IDocumentStorageGetVersionsResponse {\n    value: IDocumentStorageVersion[];\n}\n\nexport interface IDocumentStorageVersion {\n    message: string;\n    id: string;\n}\n\n/**\n *\n * Data structures that form ODSP Summary\n *\n */\n\nexport interface IOdspSummaryPayload {\n    type: \"container\" | \"channel\";\n    message: string;\n    sequenceNumber: number;\n    entries: OdspSummaryTreeEntry[];\n}\n\nexport interface IWriteSummaryResponse {\n    id: string;\n}\n\nexport type OdspSummaryTreeEntry = IOdspSummaryTreeValueEntry | IOdspSummaryTreeHandleEntry;\n\nexport interface IOdspSummaryTreeBaseEntry {\n    path: string;\n    type: \"blob\" | \"tree\" | \"commit\";\n}\n\nexport interface IOdspSummaryTreeValueEntry extends IOdspSummaryTreeBaseEntry {\n    value: OdspSummaryTreeValue;\n    // Indicates that this tree entry is unreferenced. If this is not present, the tree entry is considered referenced.\n    unreferenced?: true;\n}\n\nexport interface IOdspSummaryTreeHandleEntry extends IOdspSummaryTreeBaseEntry {\n    id: string;\n}\n\nexport type OdspSummaryTreeValue = IOdspSummaryTree | IOdspSummaryBlob;\n\nexport interface IOdspSummaryTree {\n    type: \"tree\";\n    entries?: OdspSummaryTreeEntry[];\n}\n\nexport interface IOdspSummaryBlob {\n    type: \"blob\";\n    content: string;\n    encoding: \"base64\" | \"utf-8\";\n}\n\n/**\n *\n * Data structures that form ODSP Snapshot\n *\n */\n\nexport interface IOdspSnapshotTreeEntryTree {\n    path: string;\n    type: \"tree\";\n    // Indicates that this tree entry is unreferenced. If this is not present, the tree entry is considered referenced.\n    unreferenced?: true;\n}\n\nexport interface IOdspSnapshotTreeEntryCommit {\n    id: string;\n    path: string;\n    type: \"commit\";\n}\n\nexport interface IOdspSnapshotTreeEntryBlob {\n    id: string;\n    path: string;\n    type: \"blob\";\n}\n\nexport type IOdspSnapshotTreeEntry =\n    | IOdspSnapshotTreeEntryTree\n    | IOdspSnapshotTreeEntryCommit\n    | IOdspSnapshotTreeEntryBlob;\n\nexport interface IOdspSnapshotCommit {\n    entries: IOdspSnapshotTreeEntry[];\n    id: string;\n    sequenceNumber: number;\n}\n\n/**\n * Blob content, represents blobs in downloaded snapshot.\n */\nexport interface IOdspSnapshotBlob {\n    content: string;\n    // SPO only uses \"base64\" today for download.\n    // We are adding undefined too, as temp way to roundtrip strings unchanged.\n    encoding: \"base64\" | undefined;\n    id: string;\n    size: number;\n}\n\nexport interface IOdspSnapshot {\n    id: string;\n    trees: IOdspSnapshotCommit[];\n    blobs?: IOdspSnapshotBlob[];\n    ops?: ISequencedDeltaOpMessage[];\n}\n\n/**\n * Same as HostStoragePolicy, but adds options that are internal to runtime.\n * All fields should be optional.\n */\nexport interface HostStoragePolicyInternal extends HostStoragePolicy {\n    summarizerClient?: boolean;\n}\n\nexport interface ICreateFileResponse {\n    \"@odata.context\": string;\n    driveId: string;\n    id: string;\n    itemId: string;\n    itemUrl: string;\n    sequenceNumber: number;\n    sharingLink?: string;\n    sharingLinkErrorReason?: string\n}\n\nexport interface IVersionedValueWithEpoch {\n    value: any;\n    fluidEpoch: string,\n    // This is same as \"persistedCacheValueVersion\" below. This represents the version of data stored in cache.\n    version: 3,\n}\n\nexport const persistedCacheValueVersion = 3;\n\nexport interface IGetOpsResponse {\n    nonce: string;\n    code: number;\n    /** Time in seconds. Currently never set by PUSH */\n    retryAfter?: number;\n    messages?: api.ISequencedDocumentMessage[];\n}\n\nexport interface IFlushOpsResponse {\n    nonce: string;\n    code: number;\n    /** Time in seconds */\n    retryAfter?: number;\n    lastPersistedSequenceNumber?: number;\n}\n\n/**\n * Represents the cached snapshot value.\n */\nexport interface ISnapshotCachedEntry extends ISnapshotContents {\n    cacheEntryTime: number,\n}\n"]}
+{"version":3,"file":"contracts.js","sourceRoot":"","sources":["../src/contracts.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAoNU,QAAA,0BAA0B,GAAG,CAAC,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport * as api from \"@fluidframework/protocol-definitions\";\nimport { HostStoragePolicy } from \"@fluidframework/odsp-driver-definitions\";\nimport { ISnapshotContents } from \"./odspUtils\";\n\n/**\n * Socket storage discovery api response\n */\nexport interface ISocketStorageDiscovery {\n    // The id of the web socket\n    id: string;\n\n    // SPO gives us runtimeTenantId, we remap it to tenantId\n    // See getSocketStorageDiscovery\n    runtimeTenantId?: string;\n    tenantId: string;\n\n    snapshotStorageUrl: string;\n    deltaStorageUrl: string;\n\n    /**\n     * PUSH URL\n     */\n    deltaStreamSocketUrl: string;\n\n    /**\n     * The access token for PushChannel. Optionally returned, depending on implementation.\n     * OneDrive for Consumer implementation returns it and OneDrive for Business implementation\n     * does not return it and instead expects token to be returned via `getWebsocketToken` callback\n     * passed as a parameter to `OdspDocumentService.create()` factory.\n     */\n    socketToken?: string;\n\n    /**\n     * This is the time within which client has to refresh the session on (ODSP) relay service.\n     */\n    refreshSessionDurationSeconds?: number;\n}\n\n/**\n * Interface for error responses for the WebSocket connection\n */\nexport interface IOdspSocketError {\n    /**\n     * An error code number for the error that occurred\n     * It will be a valid HTTP status code\n     */\n    code: number;\n\n    /**\n     * A message about the error that occurred for debugging / logging purposes\n     * This should not be displayed to the user directly\n     */\n    message: string;\n\n    /**\n     * Optional Retry-After time in seconds\n     * The client should wait this many seconds before retrying its request\n     */\n    retryAfter?: number;\n}\n\n/**\n * Interface for delta storage response.\n * Contains either SequencedDocumentMessages or SequencedDeltaOpMessage.\n */\nexport interface IDeltaStorageGetResponse {\n    value: api.ISequencedDocumentMessage[] | ISequencedDeltaOpMessage[];\n}\n\nexport interface ISequencedDeltaOpMessage {\n    op: api.ISequencedDocumentMessage;\n    sequenceNumber: number;\n}\n\nexport interface IDocumentStorageGetVersionsResponse {\n    value: IDocumentStorageVersion[];\n}\n\nexport interface IDocumentStorageVersion {\n    id: string;\n}\n\n/**\n *\n * Data structures that form ODSP Summary\n *\n */\n\nexport interface IOdspSummaryPayload {\n    type: \"container\" | \"channel\";\n    message: string;\n    sequenceNumber: number;\n    entries: OdspSummaryTreeEntry[];\n}\n\nexport interface IWriteSummaryResponse {\n    id: string;\n}\n\nexport type OdspSummaryTreeEntry = IOdspSummaryTreeValueEntry | IOdspSummaryTreeHandleEntry;\n\nexport interface IOdspSummaryTreeBaseEntry {\n    path: string;\n    type: \"blob\" | \"tree\" | \"commit\";\n}\n\nexport interface IOdspSummaryTreeValueEntry extends IOdspSummaryTreeBaseEntry {\n    value: OdspSummaryTreeValue;\n    // Indicates that this tree entry is unreferenced. If this is not present, the tree entry is considered referenced.\n    unreferenced?: true;\n}\n\nexport interface IOdspSummaryTreeHandleEntry extends IOdspSummaryTreeBaseEntry {\n    id: string;\n}\n\nexport type OdspSummaryTreeValue = IOdspSummaryTree | IOdspSummaryBlob;\n\nexport interface IOdspSummaryTree {\n    type: \"tree\";\n    entries?: OdspSummaryTreeEntry[];\n}\n\nexport interface IOdspSummaryBlob {\n    type: \"blob\";\n    content: string;\n    encoding: \"base64\" | \"utf-8\";\n}\n\n/**\n *\n * Data structures that form ODSP Snapshot\n *\n */\n\nexport interface IOdspSnapshotTreeEntryTree {\n    path: string;\n    type: \"tree\";\n    // Indicates that this tree entry is unreferenced. If this is not present, the tree entry is considered referenced.\n    unreferenced?: true;\n}\n\nexport interface IOdspSnapshotTreeEntryCommit {\n    id: string;\n    path: string;\n    type: \"commit\";\n}\n\nexport interface IOdspSnapshotTreeEntryBlob {\n    id: string;\n    path: string;\n    type: \"blob\";\n}\n\nexport type IOdspSnapshotTreeEntry =\n    | IOdspSnapshotTreeEntryTree\n    | IOdspSnapshotTreeEntryCommit\n    | IOdspSnapshotTreeEntryBlob;\n\nexport interface IOdspSnapshotCommit {\n    entries: IOdspSnapshotTreeEntry[];\n    id: string;\n    sequenceNumber: number;\n}\n\n/**\n * Blob content, represents blobs in downloaded snapshot.\n */\nexport interface IOdspSnapshotBlob {\n    content: string;\n    // SPO only uses \"base64\" today for download.\n    // We are adding undefined too, as temp way to roundtrip strings unchanged.\n    encoding: \"base64\" | undefined;\n    id: string;\n    size: number;\n}\n\nexport interface IOdspSnapshot {\n    id: string;\n    trees: IOdspSnapshotCommit[];\n    blobs?: IOdspSnapshotBlob[];\n    ops?: ISequencedDeltaOpMessage[];\n}\n\n/**\n * Same as HostStoragePolicy, but adds options that are internal to runtime.\n * All fields should be optional.\n */\nexport interface HostStoragePolicyInternal extends HostStoragePolicy {\n    summarizerClient?: boolean;\n}\n\nexport interface ICreateFileResponse {\n    \"@odata.context\": string;\n    driveId: string;\n    id: string;\n    itemId: string;\n    itemUrl: string;\n    sequenceNumber: number;\n    sharingLink?: string;\n    sharingLinkErrorReason?: string;\n}\n\nexport interface IVersionedValueWithEpoch {\n    value: any;\n    fluidEpoch: string;\n    // This is same as \"persistedCacheValueVersion\" below. This represents the version of data stored in cache.\n    version: 3;\n}\n\nexport const persistedCacheValueVersion = 3;\n\nexport interface IGetOpsResponse {\n    nonce: string;\n    code: number;\n    /** Time in seconds. Currently never set by PUSH */\n    retryAfter?: number;\n    messages?: api.ISequencedDocumentMessage[];\n}\n\nexport interface IFlushOpsResponse {\n    nonce: string;\n    code: number;\n    /** Time in seconds */\n    retryAfter?: number;\n    lastPersistedSequenceNumber?: number;\n}\n\n/**\n * Represents the cached snapshot value.\n */\nexport interface ISnapshotCachedEntry extends ISnapshotContents {\n    cacheEntryTime: number;\n}\n"]}