@fluidframework/odsp-driver 1.2.7 → 2.0.0-dev.1.3.0.96595

package/.mocharc.js

@@ -0,0 +1,12 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+
+'use strict';
+
+const getFluidTestMochaConfig = require('@fluidframework/mocha-test-setup/mocharc-common');
+
+const packageDir = __dirname;
+const config = getFluidTestMochaConfig(packageDir);
+module.exports = config;

package/README.md

@@ -6,3 +6,22 @@ the client and the ODSP server to retrieve Fluid content and connect to the Flui
 The ODSP Fluid service is not a publicly available service, and currently it is not possible to use this driver
 to connect to it. This driver is present as an illustration of a different Fluid driver implementation.
 Developers should not depend on this driver for their own solutions.
+
+
+## ODSP APIs
+
+Documenting some basics about opds-driver specific apis that are relevant for creation or loading of a Fluid file from ODSP.
+
+### /snapshot API
+
+- Creates a new Fluid file with the contents as the summary provided in the request body.
+- The creation of file along with the summary is done in a single api call to reduce the number of round trips during new file creation.
+- Also supports creation of sharing link for the file if appropriate request headers are provided in the api call. This feature was introduced to save the number of round trips that a host app makes while creating a file and then creating a sharing link. 
+	1. Earlier only `&createLinkType=csl` parameter was supported which could create organizational scoped sharing links. Feature is gated by `enableShareLinkWithCreate` provided via `HostStoragePolicy`. (createLinkType is now deprecated, so prefer using option 2 below)
+	1. Now, providing appropriate values for `&createLinkScope` and `&createLinkRole` request parameters will let you create sharing links with various permission scopes. See `resolvedUrl` definition for more details. Feature is gated by `enableSingleRequestForShareLinkWithCreate ` provided via `HostStoragePolicy`.
+
+### /trees/latest API
+
+- Fetches the snapshot of an existing Fluid file.
+- Earlier, application needed to redeem the sharing link of the file before a /trees/latest fetch could be made. To reduce the number of round trips made to ODSP, redemption of the share link now happens along with fetching latest snapshot in the same api request by passing share link in `&sl` request parameter.
+- This api is also preflight-less, which means it is not preceded by an OPTIONS call in the browsers to reduce the network trips to the server.

package/dist/ReadBufferUtils.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"ReadBufferUtils.d.ts","sourceRoot":"","sources":["../src/ReadBufferUtils.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAIH;;;GAGG;AACH,qBAAa,UAAU;IAOP,SAAS,CAAC,QAAQ,CAAC,IAAI,EAAE,UAAU;IAN/C,SAAS,CAAC,KAAK,SAAK;IAEpB,IAAW,MAAM,eAEhB;gBAE8B,IAAI,EAAE,UAAU;IAO/C,IAAW,GAAG,YAA8C;IAC5D,IAAW,GAAG,WAAyB;IACvC,IAAW,MAAM,WAA+B;IAEzC,KAAK,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM;IAIhC,KAAK;IAIL,IAAI,CAAC,SAAS,SAAI,GAAG,MAAM;IAc3B,IAAI,CAAC,MAAM,EAAE,MAAM;CAI7B"}
+{"version":3,"file":"ReadBufferUtils.d.ts","sourceRoot":"","sources":["../src/ReadBufferUtils.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAIH;;;GAGG;AACH,qBAAa,UAAU;IAOP,SAAS,CAAC,QAAQ,CAAC,IAAI,EAAE,UAAU;IAN/C,SAAS,CAAC,KAAK,SAAK;IAEpB,IAAW,MAAM,eAEhB;gBAE8B,IAAI,EAAE,UAAU;IAO/C,IAAW,GAAG,YAA8C;IAC5D,IAAW,GAAG,WAAyB;IACvC,IAAW,MAAM,WAA+B;IAEzC,KAAK,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM;IAIhC,KAAK;IAIL,IAAI,CAAC,SAAS,SAAI,GAAG,MAAM;IAc3B,IAAI,CAAC,MAAM,EAAE,MAAM;CAK7B"}

package/dist/ReadBufferUtils.js

@@ -47,6 +47,7 @@ class ReadBuffer {
     skip(length) {
         (0, common_utils_1.assert)(length >= 0, 0x224 /* "Skip length should be positive" */);
         this.index += length;
+        (0, common_utils_1.assert)(this.index <= this.data.length, 0x3dc /* skipping past size of buffer */);
     }
 }
 exports.ReadBuffer = ReadBuffer;

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,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"]}
+{"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;QACrB,IAAA,qBAAM,EAAC,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,kCAAkC,CAAC,CAAC;IACrF,CAAC;CACJ;AA7CD,gCA6CC","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        assert(this.index <= this.data.length, 0x3dc /* skipping past size of buffer */);\n    }\n}\n"]}

package/dist/WriteBufferUtils.d.ts

@@ -2,8 +2,7 @@
  * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
  * Licensed under the MIT License.
  */
-import { ReadBuffer } from "./ReadBufferUtils";
-import { NodeCore, TreeBuilder } from "./zipItDataRepresentationUtils";
+import { NodeCore } from "./zipItDataRepresentationUtils";
 /**
  * Buffer class, used to sequentially writ data.
  * Used by tree code to serialize tree into binary representation.
@@ -13,7 +12,7 @@ export declare class WriteBuffer {
     protected index: number;
     protected push(code: number): void;
     write(codeArg: number, lengthArg?: number): void;
-    done(): ReadBuffer;
+    done(): Uint8Array;
 }
 /**
  * Calculate how many bytes are required to encode an integer. This is always power of 2.
@@ -28,8 +27,7 @@ declare class NodeCoreSerializer extends NodeCore {
 }
 export declare class TreeBuilderSerializer extends NodeCoreSerializer {
     constructor();
-    static load(buffer: ReadBuffer): TreeBuilder;
-    serialize(): ReadBuffer;
+    serialize(): Uint8Array;
 }
 export {};
 //# sourceMappingURL=WriteBufferUtils.d.ts.map

package/dist/WriteBufferUtils.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"WriteBufferUtils.d.ts","sourceRoot":"","sources":["../src/WriteBufferUtils.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAGH,OAAO,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AAC/C,OAAO,EAOH,QAAQ,EACR,WAAW,EACd,MAAM,gCAAgC,CAAC;AAExC;;;GAGG;AACH,qBAAa,WAAW;IACpB,SAAS,CAAC,IAAI,CAAC,EAAE,UAAU,CAAwB;IACnD,SAAS,CAAC,KAAK,SAAK;IAEpB,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM;IAiBpB,KAAK,CAAC,OAAO,EAAE,MAAM,EAAE,SAAS,SAAI;IAWpC,IAAI,IAAI,UAAU;CAQ5B;AAyDD;;;;;GAKG;AACF,wBAAgB,UAAU,CAAC,MAAM,EAAE,MAAM,UAezC;AA+FD,cAAM,kBAAmB,SAAQ,QAAQ;;IAK9B,SAAS,CAAC,MAAM,EAAE,WAAW;CAGvC;AAED,qBAAa,qBAAsB,SAAQ,kBAAkB;;IAKzD,MAAM,CAAC,IAAI,CAAC,MAAM,EAAE,UAAU,GAAG,WAAW;IAIrC,SAAS,IAAI,UAAU;CAKjC"}
+{"version":3,"file":"WriteBufferUtils.d.ts","sourceRoot":"","sources":["../src/WriteBufferUtils.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAGH,OAAO,EAOH,QAAQ,EACX,MAAM,gCAAgC,CAAC;AAExC;;;GAGG;AACH,qBAAa,WAAW;IACpB,SAAS,CAAC,IAAI,CAAC,EAAE,UAAU,CAAwB;IACnD,SAAS,CAAC,KAAK,SAAK;IAEpB,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM;IAiBpB,KAAK,CAAC,OAAO,EAAE,MAAM,EAAE,SAAS,SAAI;IAWpC,IAAI,IAAI,UAAU;CAQ5B;AAyDD;;;;;GAKG;AACF,wBAAgB,UAAU,CAAC,MAAM,EAAE,MAAM,UAezC;AA8GD,cAAM,kBAAmB,SAAQ,QAAQ;;IAK9B,SAAS,CAAC,MAAM,EAAE,WAAW;CAGvC;AAED,qBAAa,qBAAsB,SAAQ,kBAAkB;;IAKlD,SAAS,IAAI,UAAU;CAKjC"}

package/dist/WriteBufferUtils.js

@@ -6,7 +6,6 @@
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.TreeBuilderSerializer = exports.calcLength = exports.WriteBuffer = void 0;
 const common_utils_1 = require("@fluidframework/common-utils");
-const ReadBufferUtils_1 = require("./ReadBufferUtils");
 const zipItDataRepresentationUtils_1 = require("./zipItDataRepresentationUtils");
 /**
  * Buffer class, used to sequentially writ data.
@@ -47,7 +46,7 @@ class WriteBuffer {
         (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));
+        const buffer = this.data.subarray(0, this.index);
         this.data = undefined;
         return buffer;
     }
@@ -128,59 +127,61 @@ exports.calcLength = calcLength;
 /**
  * Implementation of serialization of blobs in buffer with Marker Codes etc.
  * @param buffer - Buffer to serialize to.
- * @param blob - blob to be serialized.
+ * @param content - string to be serialized.
  * @param dictionary - Const strings dictionary to be used while serializing.
  */
-function serializeBlob(buffer, blob, dictionary) {
-    const data = blob.buffer;
-    const lengthOfDataLen = calcLength(data.length);
-    if (blob.constString) {
-        const content = blob.toString();
-        let id = dictionary.get(content);
-        let idLength;
-        if (id === undefined) {
-            id = dictionary.size + 1;
-            idLength = calcLength(id);
-            dictionary.set(content, id);
-            let code;
-            if (lengthOfDataLen > 1 || idLength > 1) {
-                code = zipItDataRepresentationUtils_1.MarkerCodes.ConstStringDeclareBig;
-            }
-            else {
-                code = zipItDataRepresentationUtils_1.MarkerCodes.ConstStringDeclare;
-            }
-            // Write marker code for const string.
-            buffer.write(code);
-            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.
-            buffer.write(data.length, bytes);
-            // Write const string data.
-            for (const element of data) {
-                buffer.write(element);
-            }
+function serializeDictionaryString(buffer, content, dictionary) {
+    let id = dictionary.get(content);
+    let idLength;
+    if (id === undefined) {
+        const data = common_utils_1.IsoBuffer.from(content, "utf8");
+        const lengthOfDataLen = calcLength(data.length);
+        id = dictionary.size + 1;
+        idLength = calcLength(id);
+        dictionary.set(content, id);
+        const code = lengthOfDataLen > 1 || idLength > 1
+            ? zipItDataRepresentationUtils_1.MarkerCodes.ConstStringDeclareBig
+            : zipItDataRepresentationUtils_1.MarkerCodes.ConstStringDeclare;
+        // Write marker code for const string.
+        buffer.write(code);
+        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.
+        buffer.write(data.length, bytes);
+        // Write const string data.
+        for (const element of data) {
+            buffer.write(element);
         }
-        else {
-            idLength = calcLength(id);
-        }
-        // Write Marker Code
-        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 ? (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);
-            for (const element of data) {
-                buffer.write(element);
-            }
+        idLength = calcLength(id);
+    }
+    // Write Marker Code
+    buffer.write((0, zipItDataRepresentationUtils_1.getValueSafely)(constStringBytesToCodeMap, idLength));
+    // Write id of const string
+    buffer.write(id, idLength);
+}
+function serializeString(buffer, content, codeMap = binaryBytesToCodeMap) {
+    serializeBlob(buffer, common_utils_1.IsoBuffer.from(content, "utf8"), utf8StringBytesToCodeMap);
+}
+/**
+ * Implementation of serialization of blobs in buffer with Marker Codes etc.
+ * @param buffer - Buffer to serialize to.
+ * @param blob - blob to be serialized.
+ * @param dictionary - Const strings dictionary to be used while serializing.
+ */
+function serializeBlob(buffer, data, codeMap = binaryBytesToCodeMap) {
+    const lengthOfDataLen = calcLength(data.length);
+    // Write Marker code.
+    buffer.write((0, zipItDataRepresentationUtils_1.getValueSafely)(codeMap, lengthOfDataLen));
+    // Write actual data if length greater than 0, otherwise Marker Code is enough.
+    if (lengthOfDataLen > 0) {
+        buffer.write(data.length, lengthOfDataLen);
+        for (const element of data) {
+            buffer.write(element);
         }
     }
 }
@@ -203,7 +204,7 @@ function serializeNodeCore(buffer, nodeCore, dictionary) {
             buffer.write(endCode);
         }
         else if (child instanceof zipItDataRepresentationUtils_1.BlobCore) {
-            serializeBlob(buffer, child, dictionary);
+            serializeBlob(buffer, child.buffer);
         }
         else if (typeof child === "number") {
             // Calculate length in which integer will be stored
@@ -219,7 +220,13 @@ function serializeNodeCore(buffer, nodeCore, dictionary) {
             buffer.write(boolToCodeMap[child ? 1 : 0]);
         }
         else {
-            (0, common_utils_1.unreachableCase)(child, "Unsupported node type");
+            (0, common_utils_1.assert)(child._stringElement, 0x3dd /* Unsupported node type */);
+            if (child.dictionary) {
+                serializeDictionaryString(buffer, child.content, dictionary);
+            }
+            else {
+                serializeString(buffer, child.content);
+            }
         }
     }
 }
@@ -235,9 +242,6 @@ class TreeBuilderSerializer extends NodeCoreSerializer {
     constructor() {
         super();
     }
-    static load(buffer) {
-        return zipItDataRepresentationUtils_1.TreeBuilder.load(buffer);
-    }
     serialize() {
         const buffer = new WriteBuffer();
         super.serialize(buffer);

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,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,gCAAgC,CAAC,CAAC;IAC/D,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 */);\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,+DAAiE;AACjE,iFAQwC;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,gCAAgC,CAAC,CAAC;IAC/D,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,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;QACjD,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;AACF,SAAS,yBAAyB,CAAC,MAAmB,EAAE,OAAe,EAAE,UAA+B;IACrG,IAAI,EAAE,GAAG,UAAU,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;IACjC,IAAI,QAAgB,CAAC;IACrB,IAAI,EAAE,KAAK,SAAS,EAAE;QAClB,MAAM,IAAI,GAAG,wBAAS,CAAC,IAAI,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;QAC7C,MAAM,eAAe,GAAG,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAEhD,EAAE,GAAG,UAAU,CAAC,IAAI,GAAG,CAAC,CAAC;QACzB,QAAQ,GAAG,UAAU,CAAC,EAAE,CAAC,CAAC;QAC1B,UAAU,CAAC,GAAG,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;QAC5B,MAAM,IAAI,GAAG,eAAe,GAAG,CAAC,IAAI,QAAQ,GAAG,CAAC;YAC5C,CAAC,CAAC,0CAAW,CAAC,qBAAqB;YACnC,CAAC,CAAC,0CAAW,CAAC,kBAAkB,CAAC;QACrC,sCAAsC;QACtC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QACnB,MAAM,KAAK,GAAG,IAAA,6CAAc,EAAC,6CAAc,EAAE,IAAI,CAAC,CAAC;QACnD,IAAA,qBAAM,EAAC,KAAK,IAAI,eAAe,EAAE,KAAK,CAAC,+DAA+D,CAAC,CAAC;QACxG,IAAA,qBAAM,EAAC,KAAK,IAAI,QAAQ,EAAE,KAAK,CAAC,yDAAyD,CAAC,CAAC;QAC3F,wCAAwC;QACxC,MAAM,CAAC,KAAK,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;QACxB,gCAAgC;QAChC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QACjC,2BAA2B;QAC3B,KAAK,MAAM,OAAO,IAAI,IAAI,EAAE;YACxB,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;SACzB;KACJ;SAAM;QACH,QAAQ,GAAG,UAAU,CAAC,EAAE,CAAC,CAAC;KAC7B;IACD,oBAAoB;IACpB,MAAM,CAAC,KAAK,CAAC,IAAA,6CAAc,EAAC,yBAAyB,EAAE,QAAQ,CAAC,CAAC,CAAC;IAClE,2BAA2B;IAC3B,MAAM,CAAC,KAAK,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;AAC/B,CAAC;AAED,SAAS,eAAe,CAAC,MAAmB,EAAE,OAAe,EAAE,OAAO,GAAG,oBAAoB;IACzF,aAAa,CACT,MAAM,EACN,wBAAS,CAAC,IAAI,CAAC,OAAO,EAAE,MAAM,CAAC,EAC/B,wBAAwB,CAAC,CAAC;AAClC,CAAC;AAED;;;;;GAKG;AACH,SAAS,aAAa,CAAC,MAAmB,EAAE,IAAgB,EAAE,UAAkC,oBAAoB;IAChH,MAAM,eAAe,GAAG,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAChD,qBAAqB;IACrB,MAAM,CAAC,KAAK,CAAC,IAAA,6CAAc,EAAC,OAAO,EAAE,eAAe,CAAC,CAAC,CAAC;IACvD,+EAA+E;IAC/E,IAAI,eAAe,GAAG,CAAC,EAAE;QACrB,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,eAAe,CAAC,CAAC;QAC3C,KAAK,MAAM,OAAO,IAAI,IAAI,EAAE;YACxB,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;SACzB;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,CAAC,MAAM,CAAC,CAAC;SACvC;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,qBAAM,EAAC,KAAK,CAAC,cAAc,EAAE,KAAK,CAAC,2BAA2B,CAAC,CAAC;YAChE,IAAI,KAAK,CAAC,UAAU,EAAE;gBAClB,yBAAyB,CAAC,MAAM,EAAE,KAAK,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC;aAChE;iBAAM;gBACH,eAAe,CAAC,MAAM,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC;aAC1C;SACJ;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;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;AAVD,sDAUC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { assert, IsoBuffer } from \"@fluidframework/common-utils\";\nimport {\n    BlobCore,\n    codeToBytesMap,\n    getValueSafely,\n    MarkerCodes,\n    MarkerCodesEnd,\n    MarkerCodesStart,\n    NodeCore,\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 */);\n    }\n\n    public done(): Uint8Array {\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 = 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 content - string to be serialized.\n * @param dictionary - Const strings dictionary to be used while serializing.\n */\n function serializeDictionaryString(buffer: WriteBuffer, content: string, dictionary: Map<string, number>) {\n    let id = dictionary.get(content);\n    let idLength: number;\n    if (id === undefined) {\n        const data = IsoBuffer.from(content, \"utf8\");\n        const lengthOfDataLen = calcLength(data.length);\n\n        id = dictionary.size + 1;\n        idLength = calcLength(id);\n        dictionary.set(content, id);\n        const code = lengthOfDataLen > 1 || idLength > 1\n            ? MarkerCodes.ConstStringDeclareBig\n            : MarkerCodes.ConstStringDeclare;\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}\n\nfunction serializeString(buffer: WriteBuffer, content: string, codeMap = binaryBytesToCodeMap) {\n    serializeBlob(\n        buffer,\n        IsoBuffer.from(content, \"utf8\"),\n        utf8StringBytesToCodeMap);\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, data: Uint8Array, codeMap: Record<number, number> = binaryBytesToCodeMap) {\n    const lengthOfDataLen = calcLength(data.length);\n    // Write Marker code.\n    buffer.write(getValueSafely(codeMap, 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 * 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.buffer);\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            assert(child._stringElement, 0x3dd /* Unsupported node type */);\n            if (child.dictionary) {\n                serializeDictionaryString(buffer, child.content, dictionary);\n            } else {\n                serializeString(buffer, child.content);\n            }\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    public serialize(): Uint8Array {\n        const buffer = new WriteBuffer();\n        super.serialize(buffer);\n        return buffer.done();\n    }\n}\n"]}

package/dist/compactSnapshotParser.d.ts

@@ -2,8 +2,8 @@
  * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
  * Licensed under the MIT License.
  */
+import { ITelemetryLogger } from "@fluidframework/common-definitions";
 import { ISnapshotContents } from "./odspPublicUtils";
-import { ReadBuffer } from "./ReadBufferUtils";
 export declare const snapshotMinReadVersion = "1.0";
 export declare const currentReadVersion = "1.0";
 /**
@@ -11,5 +11,5 @@ export declare const currentReadVersion = "1.0";
  * @param buffer - Compact snapshot to be parsed into tree/blobs/ops.
  * @returns - tree, blobs and ops from the snapshot.
  */
-export declare function parseCompactSnapshotResponse(buffer: ReadBuffer): ISnapshotContents;
+export declare function parseCompactSnapshotResponse(buffer: Uint8Array, logger: ITelemetryLogger): ISnapshotContents;
 //# sourceMappingURL=compactSnapshotParser.d.ts.map

package/dist/compactSnapshotParser.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"compactSnapshotParser.d.ts","sourceRoot":"","sources":["../src/compactSnapshotParser.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAIH,OAAO,EAAE,iBAAiB,EAAE,MAAM,mBAAmB,CAAC;AACtD,OAAO,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AAa/C,eAAO,MAAM,sBAAsB,QAAQ,CAAC;AAC5C,eAAO,MAAM,kBAAkB,QAAQ,CAAC;AAkGxC;;;;GAIG;AACH,wBAAgB,4BAA4B,CAAC,MAAM,EAAE,UAAU,GAAG,iBAAiB,CA2BlF"}
+{"version":3,"file":"compactSnapshotParser.d.ts","sourceRoot":"","sources":["../src/compactSnapshotParser.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAIH,OAAO,EAAE,gBAAgB,EAAE,MAAM,oCAAoC,CAAC;AACtE,OAAO,EAAE,iBAAiB,EAAE,MAAM,mBAAmB,CAAC;AActD,eAAO,MAAM,sBAAsB,QAAQ,CAAC;AAC5C,eAAO,MAAM,kBAAkB,QAAQ,CAAC;AAgKxC;;;;GAIG;AACH,wBAAgB,4BAA4B,CAAC,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,gBAAgB,GAAG,iBAAiB,CA0B5G"}

package/dist/compactSnapshotParser.js

@@ -6,6 +6,7 @@
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.parseCompactSnapshotResponse = exports.currentReadVersion = exports.snapshotMinReadVersion = void 0;
 const common_utils_1 = require("@fluidframework/common-utils");
+const ReadBufferUtils_1 = require("./ReadBufferUtils");
 const zipItDataRepresentationUtils_1 = require("./zipItDataRepresentationUtils");
 exports.snapshotMinReadVersion = "1.0";
 exports.currentReadVersion = "1.0";
@@ -16,12 +17,26 @@ exports.currentReadVersion = "1.0";
 function readBlobSection(node) {
     (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 = (0, zipItDataRepresentationUtils_1.getAndValidateNodeProps)(blob, ["id", "data"]);
+    for (const blob of node) {
+        (0, zipItDataRepresentationUtils_1.assertNodeCoreInstance)(blob, "blob should be node");
+        /**
+         * Perf optimization - the most common cases!
+         * This is essentially unrolling code below for faster processing
+         * It speeds up tree parsing by 2-3x times!
+         */
+        if (blob.length === 4 && blob.getMaybeString(0) === "id" && blob.getMaybeString(2) === "data") {
+            // "id": <node name>
+            // "data": <blob>
+            blobs.set(blob.getString(1), blob.getBlob(3).arrayBuffer);
+            continue;
+        }
+        /**
+         * More generalized workflow
+         */
+        const records = (0, zipItDataRepresentationUtils_1.getNodeProps)(blob);
         (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);
+        const id = (0, zipItDataRepresentationUtils_1.getStringInstance)(records.id, "blob id should be string");
+        blobs.set(id, records.data.arrayBuffer);
     }
     return blobs;
 }
@@ -32,7 +47,7 @@ function readBlobSection(node) {
 function readOpsSection(node) {
     (0, zipItDataRepresentationUtils_1.assertNodeCoreInstance)(node, "Deltas should be of type NodeCore");
     const ops = [];
-    const records = (0, zipItDataRepresentationUtils_1.getAndValidateNodeProps)(node, ["firstSequenceNumber", "deltas"]);
+    const records = (0, zipItDataRepresentationUtils_1.getNodeProps)(node);
     (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) {
@@ -46,32 +61,75 @@ function readOpsSection(node) {
  * @param node - tree node to de-serialize from
  */
 function readTreeSection(node) {
+    const trees = {};
     const snapshotTree = {
         blobs: {},
-        commits: {},
-        trees: {},
+        trees,
     };
-    for (let count = 0; count < node.length; count++) {
-        const treeNode = node.getNode(count);
-        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();
+    for (const treeNode of node) {
+        (0, zipItDataRepresentationUtils_1.assertNodeCoreInstance)(treeNode, "tree nodes should be nodes");
+        /**
+         * Perf optimization - the most common cases!
+         * This is essentially unrolling code below for faster processing
+         * It speeds up tree parsing by 2-3x times!
+         */
+        const length = treeNode.length;
+        if (length > 0 && treeNode.getMaybeString(0) === "name") {
+            if (length === 4) {
+                const content = treeNode.getMaybeString(2);
+                // "name": <node name>
+                // "children": <blob id>
+                if (content === "children") {
+                    trees[treeNode.getString(1)] = readTreeSection(treeNode.getNode(3));
+                    continue;
+                }
+                // "name": <node name>
+                // "value": <blob id>
+                if (content === "value") {
+                    snapshotTree.blobs[treeNode.getString(1)] = treeNode.getString(3);
+                    continue;
+                }
+            }
+            // "name": <node name>
+            // "nodeType": 3
+            // "value": <blob id>
+            if (length === 6 &&
+                treeNode.getMaybeString(2) === "nodeType" &&
+                treeNode.getMaybeString(4) === "value") {
+                snapshotTree.blobs[treeNode.getString(1)] = treeNode.getString(5);
+                continue;
+            }
+            // "name": <node name>
+            // "unreferenced": true
+            // "children": <blob id>
+            if (length === 6 &&
+                treeNode.getMaybeString(2) === "unreferenced" &&
+                treeNode.getMaybeString(4) === "children") {
+                trees[treeNode.getString(1)] = readTreeSection(treeNode.getNode(5));
+                (0, common_utils_1.assert)(treeNode.getBool(3), 0x3db /* Unreferenced if present should be true */);
+                snapshotTree.unreferenced = true;
+                continue;
+            }
+        }
+        /**
+         * More generalized workflow
+         */
+        const records = (0, zipItDataRepresentationUtils_1.getNodeProps)(treeNode);
+        if (records.unreferenced !== undefined) {
+            (0, zipItDataRepresentationUtils_1.assertBoolInstance)(records.unreferenced, "Unreferenced flag should be bool");
+            (0, common_utils_1.assert)(records.unreferenced, 0x281 /* "Unreferenced if present should be true" */);
+            snapshotTree.unreferenced = true;
+        }
+        const path = (0, zipItDataRepresentationUtils_1.getStringInstance)(records.name, "Path name should be string");
         if (records.value !== undefined) {
-            (0, zipItDataRepresentationUtils_1.assertBlobCoreInstance)(records.value, "Blob value should be BlobCore");
-            snapshotTree.blobs[path] = records.value.toString();
+            snapshotTree.blobs[path] = (0, zipItDataRepresentationUtils_1.getStringInstance)(records.value, "Blob value should be string");
         }
         else if (records.children !== undefined) {
             (0, zipItDataRepresentationUtils_1.assertNodeCoreInstance)(records.children, "Trees should be of type NodeCore");
-            snapshotTree.trees[path] = readTreeSection(records.children);
+            trees[path] = readTreeSection(records.children);
         }
         else {
-            snapshotTree.trees[path] = { blobs: {}, commits: {}, trees: {} };
-        }
-        if (records.unreferenced !== undefined) {
-            (0, zipItDataRepresentationUtils_1.assertBoolInstance)(records.unreferenced, "Unreferenced flag should be bool");
-            const unreferenced = records.unreferenced.valueOf();
-            (0, common_utils_1.assert)(unreferenced, 0x281 /* "Unreferenced if present should be true" */);
-            snapshotTree.unreferenced = unreferenced;
+            trees[path] = { blobs: {}, trees: {} };
         }
     }
     return snapshotTree;
@@ -82,12 +140,11 @@ function readTreeSection(node) {
  */
 function readSnapshotSection(node) {
     (0, zipItDataRepresentationUtils_1.assertNodeCoreInstance)(node, "Snapshot should be of type NodeCore");
-    const records = (0, zipItDataRepresentationUtils_1.getAndValidateNodeProps)(node, ["id", "sequenceNumber", "treeNodes"]);
+    const records = (0, zipItDataRepresentationUtils_1.getNodeProps)(node);
     (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();
+    snapshotTree.id = (0, zipItDataRepresentationUtils_1.getStringInstance)(records.id, "snapshotId should be string");
     const sequenceNumber = records.sequenceNumber.valueOf();
     return {
         sequenceNumber,
@@ -99,19 +156,19 @@ function readSnapshotSection(node) {
  * @param buffer - Compact snapshot to be parsed into tree/blobs/ops.
  * @returns - tree, blobs and ops from the snapshot.
  */
-function parseCompactSnapshotResponse(buffer) {
-    const builder = zipItDataRepresentationUtils_1.TreeBuilder.load(buffer);
+function parseCompactSnapshotResponse(buffer, logger) {
+    const builder = zipItDataRepresentationUtils_1.TreeBuilder.load(new ReadBufferUtils_1.ReadBuffer(buffer), logger);
     (0, common_utils_1.assert)(builder.length === 1, 0x219 /* "1 root should be there" */);
     const root = builder.getNode(0);
-    const records = (0, zipItDataRepresentationUtils_1.getAndValidateNodeProps)(root, ["mrv", "cv", "lsn", "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");
+    const records = (0, zipItDataRepresentationUtils_1.getNodeProps)(root);
+    const mrv = (0, zipItDataRepresentationUtils_1.getStringInstance)(records.mrv, "minReadVersion should be string");
+    const cv = (0, zipItDataRepresentationUtils_1.getStringInstance)(records.cv, "createVersion should be string");
     if (records.lsn !== undefined) {
         (0, zipItDataRepresentationUtils_1.assertNumberInstance)(records.lsn, "lsn should be a number");
     }
-    (0, common_utils_1.assert)(parseFloat(exports.snapshotMinReadVersion) >= parseFloat(records.mrv.toString()), 0x20f /* "Driver min read version should >= to server minReadVersion" */);
-    (0, common_utils_1.assert)(parseFloat(records.cv.toString()) >= parseFloat(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" */);
+    (0, common_utils_1.assert)(parseFloat(exports.snapshotMinReadVersion) >= parseFloat(mrv), 0x20f /* "Driver min read version should >= to server minReadVersion" */);
+    (0, common_utils_1.assert)(parseFloat(cv) >= parseFloat(exports.snapshotMinReadVersion), 0x210 /* "Snapshot should be created with minReadVersion or above" */);
+    (0, common_utils_1.assert)(exports.currentReadVersion === cv, 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) : [], latestSequenceNumber: records.lsn });
 }
 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;AAKtD,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,GAAoB;QAClC,KAAK,EAAE,EAAE;QACT,OAAO,EAAE,EAAE;QACX,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,IAAI,OAAO,CAAC,QAAQ,KAAK,SAAS,EAAE;YACvC,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;aAAM;YACH,YAAY,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC;SACpE;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,KAAK,EAAE,UAAU,EAAE,OAAO,EAAE,QAAQ,CAAC,EAAE,KAAK,CAAC,CAAC;IAEhE,IAAA,qDAAsB,EAAC,OAAO,CAAC,GAAG,EAAE,2CAA2C,CAAC,CAAC;IACjF,IAAA,qDAAsB,EAAC,OAAO,CAAC,EAAE,EAAE,0CAA0C,CAAC,CAAC;IAC/E,IAAI,OAAO,CAAC,GAAG,KAAK,SAAS,EAAE;QAC3B,IAAA,mDAAoB,EAAC,OAAO,CAAC,GAAG,EAAE,wBAAwB,CAAC,CAAC;KAC/D;IAED,IAAA,qBAAM,EAAC,UAAU,CAAC,8BAAsB,CAAC,IAAI,UAAU,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,EAC3E,KAAK,CAAC,kEAAkE,CAAC,CAAC;IAC9E,IAAA,qBAAM,EAAC,UAAU,CAAC,OAAO,CAAC,EAAE,CAAC,QAAQ,EAAE,CAAC,IAAI,UAAU,CAAC,8BAAsB,CAAC,EAC1E,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;IAExE,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,EACvE,oBAAoB,EAAE,OAAO,CAAC,GAAG,IACnC;AACN,CAAC;AA3BD,oEA2BC","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 \"./odspPublicUtils\";\nimport { ReadBuffer } from \"./ReadBufferUtils\";\nimport { ISnapshotTreeEx } from \"./contracts\";\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: ISnapshotTreeEx = {\n        blobs: {},\n        commits: {},\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 if (records.children !== undefined) {\n            assertNodeCoreInstance(records.children, \"Trees should be of type NodeCore\");\n            snapshotTree.trees[path] = readTreeSection(records.children);\n        } else {\n            snapshotTree.trees[path] = { blobs: {}, commits: {}, trees: {} };\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\", \"lsn\", \"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    if (records.lsn !== undefined) {\n        assertNumberInstance(records.lsn, \"lsn should be a number\");\n    }\n\n    assert(parseFloat(snapshotMinReadVersion) >= parseFloat(records.mrv.toString()),\n        0x20f /* \"Driver min read version should >= to server minReadVersion\" */);\n    assert(parseFloat(records.cv.toString()) >= parseFloat(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\n    return {\n        ...readSnapshotSection(records.snapshot),\n        blobs: readBlobSection(records.blobs),\n        ops: records.deltas !== undefined ? readOpsSection(records.deltas) : [],\n        latestSequenceNumber: records.lsn,\n    };\n}\n"]}
+{"version":3,"file":"compactSnapshotParser.js","sourceRoot":"","sources":["../src/compactSnapshotParser.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,+DAAsD;AAItD,uDAA+C;AAC/C,iFAUwC;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,MAAM,IAAI,IAAI,IAAI,EAAE;QACrB,IAAA,qDAAsB,EAAC,IAAI,EAAE,qBAAqB,CAAC,CAAC;QAEpD;;;;WAIG;QACH,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,KAAK,IAAI,IAAI,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,KAAK,MAAM,EAAE;YAC3F,oBAAoB;YACpB,iBAAiB;YACjB,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC;YAC1D,SAAS;SACZ;QAED;;WAEG;QACH,MAAM,OAAO,GAAG,IAAA,2CAAY,EAAC,IAAI,CAAC,CAAC;QACnC,IAAA,qDAAsB,EAAC,OAAO,CAAC,IAAI,EAAE,iCAAiC,CAAC,CAAC;QACxE,MAAM,EAAE,GAAG,IAAA,gDAAiB,EAAC,OAAO,CAAC,EAAE,EAAE,0BAA0B,CAAC,CAAC;QACrE,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,OAAO,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;KAC3C;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,2CAAY,EAAC,IAAI,CAAC,CAAC;IACnC,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,KAAK,GAAG,EAAE,CAAC;IACjB,MAAM,YAAY,GAAkB;QAChC,KAAK,EAAE,EAAE;QACT,KAAK;KACR,CAAC;IACF,KAAK,MAAM,QAAQ,IAAI,IAAI,EAAE;QACzB,IAAA,qDAAsB,EAAC,QAAQ,EAAE,4BAA4B,CAAC,CAAC;QAE/D;;;;WAIG;QACF,MAAM,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC;QAC/B,IAAI,MAAM,GAAG,CAAC,IAAI,QAAQ,CAAC,cAAc,CAAC,CAAC,CAAC,KAAK,MAAM,EAAE;YACtD,IAAI,MAAM,KAAK,CAAC,EAAE;gBACd,MAAM,OAAO,GAAG,QAAQ,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC;gBAC3C,sBAAsB;gBACtB,wBAAwB;gBACxB,IAAI,OAAO,KAAK,UAAU,EAAE;oBACxB,KAAK,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,GAAG,eAAe,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;oBACpE,SAAS;iBACZ;gBACD,sBAAsB;gBACtB,qBAAqB;gBACrB,IAAI,OAAO,KAAK,OAAO,EAAE;oBACrB,YAAY,CAAC,KAAK,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;oBAClE,SAAS;iBACZ;aACJ;YAED,sBAAsB;YACtB,gBAAgB;YAChB,qBAAqB;YACrB,IAAI,MAAM,KAAK,CAAC;gBACR,QAAQ,CAAC,cAAc,CAAC,CAAC,CAAC,KAAK,UAAU;gBACzC,QAAQ,CAAC,cAAc,CAAC,CAAC,CAAC,KAAK,OAAO,EAAE;gBAC5C,YAAY,CAAC,KAAK,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;gBAClE,SAAS;aACZ;YAED,sBAAsB;YACtB,uBAAuB;YACvB,wBAAwB;YACxB,IAAI,MAAM,KAAK,CAAC;gBACR,QAAQ,CAAC,cAAc,CAAC,CAAC,CAAC,KAAK,cAAc;gBAC7C,QAAQ,CAAC,cAAc,CAAC,CAAC,CAAC,KAAK,UAAU,EAAE;gBAC/C,KAAK,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,GAAG,eAAe,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;gBACpE,IAAA,qBAAM,EAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,4CAA4C,CAAC,CAAC;gBAChF,YAAY,CAAC,YAAY,GAAG,IAAI,CAAC;gBACjC,SAAS;aACZ;SACJ;QAED;;WAEG;QACH,MAAM,OAAO,GAAG,IAAA,2CAAY,EAAC,QAAQ,CAAC,CAAC;QAEvC,IAAI,OAAO,CAAC,YAAY,KAAK,SAAS,EAAE;YACpC,IAAA,iDAAkB,EAAC,OAAO,CAAC,YAAY,EAAE,kCAAkC,CAAC,CAAC;YAC7E,IAAA,qBAAM,EAAC,OAAO,CAAC,YAAY,EAAE,KAAK,CAAC,8CAA8C,CAAC,CAAC;YACnF,YAAY,CAAC,YAAY,GAAG,IAAI,CAAC;SACpC;QAED,MAAM,IAAI,GAAG,IAAA,gDAAiB,EAAC,OAAO,CAAC,IAAI,EAAE,4BAA4B,CAAC,CAAC;QAC3E,IAAI,OAAO,CAAC,KAAK,KAAK,SAAS,EAAE;YAC7B,YAAY,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,IAAA,gDAAiB,EAAC,OAAO,CAAC,KAAK,EAAE,6BAA6B,CAAC,CAAC;SAC9F;aAAM,IAAI,OAAO,CAAC,QAAQ,KAAK,SAAS,EAAE;YACvC,IAAA,qDAAsB,EAAC,OAAO,CAAC,QAAQ,EAAE,kCAAkC,CAAC,CAAC;YAC7E,KAAK,CAAC,IAAI,CAAC,GAAG,eAAe,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;SACnD;aAAM;YACH,KAAK,CAAC,IAAI,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC;SAC1C;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,2CAAY,EAAC,IAAI,CAAC,CAAC;IAEnC,IAAA,qDAAsB,EAAC,OAAO,CAAC,SAAS,EAAE,sCAAsC,CAAC,CAAC;IAClF,IAAA,mDAAoB,EAAC,OAAO,CAAC,cAAc,EAAE,yCAAyC,CAAC,CAAC;IACxF,MAAM,YAAY,GAAkB,eAAe,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;IACvE,YAAY,CAAC,EAAE,GAAG,IAAA,gDAAiB,EAAC,OAAO,CAAC,EAAE,EAAE,6BAA6B,CAAC,CAAC;IAC/E,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,EAAE,MAAwB;IACrF,MAAM,OAAO,GAAG,0CAAW,CAAC,IAAI,CAAC,IAAI,4BAAU,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC,CAAC;IACjE,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,2CAAY,EAAC,IAAI,CAAC,CAAC;IAEnC,MAAM,GAAG,GAAG,IAAA,gDAAiB,EAAC,OAAO,CAAC,GAAG,EAAE,iCAAiC,CAAC,CAAC;IAC9E,MAAM,EAAE,GAAG,IAAA,gDAAiB,EAAC,OAAO,CAAC,EAAE,EAAE,gCAAgC,CAAC,CAAC;IAC3E,IAAI,OAAO,CAAC,GAAG,KAAK,SAAS,EAAE;QAC3B,IAAA,mDAAoB,EAAC,OAAO,CAAC,GAAG,EAAE,wBAAwB,CAAC,CAAC;KAC/D;IAED,IAAA,qBAAM,EAAC,UAAU,CAAC,8BAAsB,CAAC,IAAI,UAAU,CAAC,GAAG,CAAC,EACxD,KAAK,CAAC,kEAAkE,CAAC,CAAC;IAC9E,IAAA,qBAAM,EAAC,UAAU,CAAC,EAAE,CAAC,IAAI,UAAU,CAAC,8BAAsB,CAAC,EACvD,KAAK,CAAC,+DAA+D,CAAC,CAAC;IAC3E,IAAA,qBAAM,EAAC,0BAAkB,KAAK,EAAE,EAC5B,KAAK,CAAC,4DAA4D,CAAC,CAAC;IAExE,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,EACvE,oBAAoB,EAAE,OAAO,CAAC,GAAG,IACnC;AACN,CAAC;AA1BD,oEA0BC","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 { ITelemetryLogger } from \"@fluidframework/common-definitions\";\nimport { ISnapshotContents } from \"./odspPublicUtils\";\nimport { ReadBuffer } from \"./ReadBufferUtils\";\nimport {\n    assertBlobCoreInstance,\n    getStringInstance,\n    assertBoolInstance,\n    assertNodeCoreInstance,\n    assertNumberInstance,\n    getNodeProps,\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 (const blob of node) {\n        assertNodeCoreInstance(blob, \"blob should be node\");\n\n        /**\n         * Perf optimization - the most common cases!\n         * This is essentially unrolling code below for faster processing\n         * It speeds up tree parsing by 2-3x times!\n         */\n        if (blob.length === 4 && blob.getMaybeString(0) === \"id\" && blob.getMaybeString(2) === \"data\") {\n            // \"id\": <node name>\n            // \"data\": <blob>\n            blobs.set(blob.getString(1), blob.getBlob(3).arrayBuffer);\n            continue;\n        }\n\n        /**\n         * More generalized workflow\n         */\n        const records = getNodeProps(blob);\n        assertBlobCoreInstance(records.data, \"data should be of BlobCore type\");\n        const id = getStringInstance(records.id, \"blob id should be string\");\n        blobs.set(id, 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 = getNodeProps(node);\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 trees = {};\n    const snapshotTree: ISnapshotTree = {\n        blobs: {},\n        trees,\n    };\n    for (const treeNode of node) {\n        assertNodeCoreInstance(treeNode, \"tree nodes should be nodes\");\n\n        /**\n         * Perf optimization - the most common cases!\n         * This is essentially unrolling code below for faster processing\n         * It speeds up tree parsing by 2-3x times!\n         */\n         const length = treeNode.length;\n         if (length > 0 && treeNode.getMaybeString(0) === \"name\") {\n            if (length === 4) {\n                const content = treeNode.getMaybeString(2);\n                // \"name\": <node name>\n                // \"children\": <blob id>\n                if (content === \"children\") {\n                    trees[treeNode.getString(1)] = readTreeSection(treeNode.getNode(3));\n                    continue;\n                }\n                // \"name\": <node name>\n                // \"value\": <blob id>\n                if (content === \"value\") {\n                    snapshotTree.blobs[treeNode.getString(1)] = treeNode.getString(3);\n                    continue;\n                }\n            }\n\n            // \"name\": <node name>\n            // \"nodeType\": 3\n            // \"value\": <blob id>\n            if (length === 6 &&\n                    treeNode.getMaybeString(2) === \"nodeType\" &&\n                    treeNode.getMaybeString(4) === \"value\") {\n                snapshotTree.blobs[treeNode.getString(1)] = treeNode.getString(5);\n                continue;\n            }\n\n            // \"name\": <node name>\n            // \"unreferenced\": true\n            // \"children\": <blob id>\n            if (length === 6 &&\n                    treeNode.getMaybeString(2) === \"unreferenced\" &&\n                    treeNode.getMaybeString(4) === \"children\") {\n                trees[treeNode.getString(1)] = readTreeSection(treeNode.getNode(5));\n                assert(treeNode.getBool(3), 0x3db /* Unreferenced if present should be true */);\n                snapshotTree.unreferenced = true;\n                continue;\n            }\n        }\n\n        /**\n         * More generalized workflow\n         */\n        const records = getNodeProps(treeNode);\n\n        if (records.unreferenced !== undefined) {\n            assertBoolInstance(records.unreferenced, \"Unreferenced flag should be bool\");\n            assert(records.unreferenced, 0x281 /* \"Unreferenced if present should be true\" */);\n            snapshotTree.unreferenced = true;\n        }\n\n        const path = getStringInstance(records.name, \"Path name should be string\");\n        if (records.value !== undefined) {\n            snapshotTree.blobs[path] = getStringInstance(records.value, \"Blob value should be string\");\n        } else if (records.children !== undefined) {\n            assertNodeCoreInstance(records.children, \"Trees should be of type NodeCore\");\n            trees[path] = readTreeSection(records.children);\n        } else {\n            trees[path] = { blobs: {}, trees: {} };\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 = getNodeProps(node);\n\n    assertNodeCoreInstance(records.treeNodes, \"TreeNodes should be of type NodeCore\");\n    assertNumberInstance(records.sequenceNumber, \"sequenceNumber should be of type number\");\n    const snapshotTree: ISnapshotTree = readTreeSection(records.treeNodes);\n    snapshotTree.id = getStringInstance(records.id, \"snapshotId should be string\");\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: Uint8Array, logger: ITelemetryLogger): ISnapshotContents {\n    const builder = TreeBuilder.load(new ReadBuffer(buffer), logger);\n    assert(builder.length === 1, 0x219 /* \"1 root should be there\" */);\n    const root = builder.getNode(0);\n\n    const records = getNodeProps(root);\n\n    const mrv = getStringInstance(records.mrv, \"minReadVersion should be string\");\n    const cv = getStringInstance(records.cv, \"createVersion should be string\");\n    if (records.lsn !== undefined) {\n        assertNumberInstance(records.lsn, \"lsn should be a number\");\n    }\n\n    assert(parseFloat(snapshotMinReadVersion) >= parseFloat(mrv),\n        0x20f /* \"Driver min read version should >= to server minReadVersion\" */);\n    assert(parseFloat(cv) >= parseFloat(snapshotMinReadVersion),\n        0x210 /* \"Snapshot should be created with minReadVersion or above\" */);\n    assert(currentReadVersion === cv,\n        0x2c2 /* \"Create Version should be equal to currentReadVersion\" */);\n\n    return {\n        ...readSnapshotSection(records.snapshot),\n        blobs: readBlobSection(records.blobs),\n        ops: records.deltas !== undefined ? readOpsSection(records.deltas) : [],\n        latestSequenceNumber: records.lsn,\n    };\n}\n"]}