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

package/dist/zipItDataRepresentationUtils.js

@@ -4,7 +4,7 @@
  * Licensed under the MIT License.
  */
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.assertBoolInstance = exports.assertNumberInstance = exports.assertNodeCoreInstance = exports.assertBlobCoreInstance = exports.TreeBuilder = exports.NodeCore = exports.addBoolProperty = exports.addNumberProperty = exports.addStringProperty = exports.BlobShallowCopy = exports.BlobCore = exports.iterate = exports.iteratePairs = exports.getAndValidateNodeProps = exports.getValueSafely = exports.codeToBytesMap = exports.MarkerCodesEnd = exports.MarkerCodesStart = exports.MarkerCodes = void 0;
+exports.assertBoolInstance = exports.assertNumberInstance = exports.assertNodeCoreInstance = exports.assertBlobCoreInstance = exports.getStringInstance = exports.getMaybeStringInstance = exports.TreeBuilder = exports.NodeCore = exports.addBoolProperty = exports.addNumberProperty = exports.addDictionaryStringProperty = exports.addStringProperty = exports.BlobShallowCopy = exports.BlobCore = exports.iterate = exports.iteratePairs = exports.getNodeProps = exports.getValueSafely = exports.codeToBytesMap = exports.MarkerCodesEnd = exports.MarkerCodesStart = exports.MarkerCodes = void 0;
 /**
  * Data representation which is followed(zipIt Protocol) here is described in this document:
  * https://microsoft.sharepoint-df.com/:w:/t/ODSPFileStore/ER06b64K_XdDjEyAKl-UT60BJiId39SCVkYSyo_2pvH9gQ?e=KYQ0c5
@@ -101,23 +101,15 @@ function getValueSafely(map, key) {
     return val;
 }
 exports.getValueSafely = getValueSafely;
-function getAndValidateNodeProps(node, props, enforceAllProps = true) {
-    const propSet = new Set(props);
+function getNodeProps(node) {
     const res = {};
     for (const [keyNode, valueNode] of node.iteratePairs()) {
-        assertBlobCoreInstance(keyNode, "keynode should be a blob");
-        const keyStr = keyNode.toString();
-        if (propSet.has(keyStr)) {
-            propSet.delete(keyStr);
-            res[keyStr] = valueNode;
-        }
-    }
-    if (enforceAllProps) {
-        (0, common_utils_1.assert)(propSet.size === 0, 0x288 /* All properties should exist */);
+        const id = getStringInstance(keyNode, "keynode should be a string");
+        res[id] = valueNode;
     }
     return res;
 }
-exports.getAndValidateNodeProps = getAndValidateNodeProps;
+exports.getNodeProps = getNodeProps;
 function iteratePairs(it) {
     const res = {
         next: () => {
@@ -150,19 +142,8 @@ exports.iterate = iterate;
 class BlobCore {
     /**
      * Represents a blob.
-     * @param constString - Whether it contains const string declaration.
-     * @param useUtf8Code - Represents if the utf8 string marker code should be used when representing.
      */
-    constructor(constString, useUtf8Code = false) {
-        this.constString = constString;
-        this.useUtf8Code = useUtf8Code;
-    }
-    get arrayBuffer() {
-        return (0, common_utils_1.Uint8ArrayToArrayBuffer)(this.buffer);
-    }
-    toString() {
-        return (0, common_utils_1.Uint8ArrayToString)(this.buffer, "utf-8");
-    }
+    constructor() { }
 }
 exports.BlobCore = BlobCore;
 /**
@@ -174,23 +155,24 @@ class BlobDeepCopy extends BlobCore {
     /**
      * Represents a deep copy of the blob.
      * @param data - Data array of the blob
-     * @param constString - Whether it contains const string declaration.
-     * @param useUtf8Code - Represents if the utf8 string marker code should be used when representing.
      */
-    constructor(data, constString, useUtf8Code = false) {
-        super(constString, useUtf8Code);
+    constructor(data) {
+        super();
         this.data = data;
     }
     get buffer() {
         return this.data;
     }
-    static read(buffer, lengthLen, constString) {
+    get arrayBuffer() {
+        return (0, common_utils_1.Uint8ArrayToArrayBuffer)(this.buffer);
+    }
+    static read(buffer, lengthLen) {
         const length = buffer.read(lengthLen);
         const data = new Uint8Array(length);
         for (let counter = 0; counter < length; counter++) {
             data[counter] = buffer.read();
         }
-        return new BlobDeepCopy(data, constString);
+        return new BlobDeepCopy(data);
     }
 }
 /**
@@ -203,37 +185,46 @@ class BlobShallowCopy extends BlobCore {
      * @param data - Data array of the blob
      * @param start - Start point of the blob in the buffer.
      * @param end - End point of the blob in the buffer.
-     * @param constString - Whether it contains const string declaration.
      */
-    constructor(data, start, end, constString) {
-        super(constString);
+    constructor(data, start, end) {
+        super();
         this.data = data;
         this.start = start;
         this.end = end;
     }
     get buffer() {
-        return this.data.buffer.subarray(this.start, this.end);
+        return this.data.subarray(this.start, this.end);
+    }
+    // Equivalent to Uint8ArrayToArrayBuffer(this.buffer)
+    get arrayBuffer() {
+        const offset = this.data.byteOffset;
+        return this.data.buffer.slice(this.start + offset, this.end + offset);
     }
-    static read(buffer, lengthLen, constString) {
+    static read(buffer, lengthLen) {
         const length = buffer.read(lengthLen);
         const pos = buffer.pos;
         buffer.skip(length);
-        return new BlobShallowCopy(buffer, pos, pos + length, constString);
+        return new BlobShallowCopy(buffer.buffer, pos, pos + length);
     }
 }
 exports.BlobShallowCopy = BlobShallowCopy;
-const addStringProperty = (node, a, b, encodeValAsConstString = false) => {
-    node.addString(a, true);
-    node.addString(b, encodeValAsConstString);
+const addStringProperty = (node, a, b) => {
+    node.addDictionaryString(a);
+    node.addString(b);
 };
 exports.addStringProperty = addStringProperty;
+const addDictionaryStringProperty = (node, a, b) => {
+    node.addDictionaryString(a);
+    node.addString(b);
+};
+exports.addDictionaryStringProperty = addDictionaryStringProperty;
 const addNumberProperty = (node, a, b) => {
-    node.addString(a, true);
+    node.addDictionaryString(a);
     node.addNumber(b);
 };
 exports.addNumberProperty = addNumberProperty;
 const addBoolProperty = (node, a, b) => {
-    node.addString(a, true);
+    node.addDictionaryString(a);
     node.addBool(b);
 };
 exports.addBoolProperty = addBoolProperty;
@@ -260,8 +251,11 @@ class NodeCore {
     get(index) { return this.children[index]; }
     getString(index) {
         const node = this.children[index];
-        assertBlobCoreInstance(node, "getString should return stringblob");
-        return node.toString();
+        return getStringInstance(node, "getString should return string");
+    }
+    getMaybeString(index) {
+        const node = this.children[index];
+        return getMaybeStringInstance(node);
     }
     getBlob(index) {
         const node = this.children[index];
@@ -288,11 +282,22 @@ class NodeCore {
         this.children.push(node);
         return node;
     }
-    addBlob(blob, constString, useUtf8Code = false) {
-        this.children.push(new BlobDeepCopy(blob, constString, useUtf8Code));
+    addBlob(blob) {
+        this.children.push(new BlobDeepCopy(blob));
     }
-    addString(payload, constString) {
-        this.addBlob(common_utils_1.IsoBuffer.from(payload, "utf-8"), constString, true);
+    addDictionaryString(payload) {
+        this.children.push({
+            content: payload,
+            dictionary: true,
+            _stringElement: true,
+        });
+    }
+    addString(payload) {
+        this.children.push({
+            content: payload,
+            dictionary: false,
+            _stringElement: true,
+        });
     }
     addNumber(payload) {
         (0, common_utils_1.assert)(Number.isInteger(payload), 0x231 /* "Number should be an integer" */);
@@ -302,59 +307,88 @@ class NodeCore {
     addBool(payload) {
         this.children.push(payload);
     }
+    // Can we do more efficiently here, without extra objects somehow??
+    static readString(buffer, code, dictionary) {
+        const lengthLen = getValueSafely(exports.codeToBytesMap, code);
+        const length = buffer.read(lengthLen);
+        const startPos = buffer.pos;
+        buffer.skip(length);
+        const result = {
+            // Note: Setting here property 'content: undefined' makes code substantially slower!
+            dictionary,
+            _stringElement: true,
+            startPos,
+            endPos: buffer.pos,
+        };
+        // We are lying here in terms of presence of `content` property.
+        // This will be addressed at the bottom of NodeCore.load() by resolving all strings at once!
+        // It's equivalent (but much slower!) to do it here via
+        // result.content = Uint8ArrayToString(buffer.buffer.subarray(startPos, buffer.pos), "utf-8");
+        return result;
+    }
     /**
      * Load and parse the buffer into a tree.
      * @param buffer - buffer to read from.
      */
-    load(buffer, dictionary) {
+    load(buffer, logger) {
+        const stack = [];
+        const stringsToResolve = [];
+        const dictionary = [];
+        let children = this.children;
         for (; !buffer.eof;) {
-            let childValue;
             const code = buffer.read();
             switch (code) {
                 case MarkerCodesStart.list:
                 case MarkerCodesStart.set: {
-                    childValue = new NodeCore(code === MarkerCodesStart.set ? "set" : "list");
-                    this.children.push(childValue);
-                    childValue.load(buffer, dictionary);
-                    break;
+                    const childValue = new NodeCore(code === MarkerCodesStart.set ? "set" : "list");
+                    children.push(childValue);
+                    stack.push(children);
+                    children = childValue.children;
+                    continue;
                 }
                 case MarkerCodes.ConstStringDeclare:
                 case MarkerCodes.ConstStringDeclareBig:
                     {
                         const stringId = buffer.read(getValueSafely(exports.codeToBytesMap, code));
-                        const constString = BlobShallowCopy.read(buffer, getValueSafely(exports.codeToBytesMap, code), true);
+                        const constString = NodeCore.readString(buffer, code, true /* dictionary */);
+                        stringsToResolve.push(constString);
                         dictionary[stringId] = constString;
-                        break;
+                        continue;
                     }
                 case MarkerCodes.ConstString8Id:
                 case MarkerCodes.ConstString16Id:
                 case MarkerCodes.ConstString32Id:
                     {
                         const stringId = buffer.read(getValueSafely(exports.codeToBytesMap, code));
-                        childValue = dictionary[stringId];
-                        this.children.push(childValue);
-                        break;
+                        const content = dictionary[stringId];
+                        (0, common_utils_1.assert)(content !== undefined, 0x3de /* const string not found */);
+                        children.push(content);
+                        continue;
                     }
                 case MarkerCodes.StringEmpty:
                 case MarkerCodes.String8Length:
                 case MarkerCodes.String16Length:
                 case MarkerCodes.String32Length:
+                    {
+                        const str = NodeCore.readString(buffer, code, false /* dictionary */);
+                        stringsToResolve.push(str);
+                        children.push(str);
+                        continue;
+                    }
                 case MarkerCodes.BinaryEmpty:
                 case MarkerCodes.BinarySingle8:
                 case MarkerCodes.BinarySingle16:
                 case MarkerCodes.BinarySingle32:
                 case MarkerCodes.BinarySingle64:
                     {
-                        childValue = BlobShallowCopy.read(buffer, getValueSafely(exports.codeToBytesMap, code), false);
-                        this.children.push(childValue);
-                        break;
+                        children.push(BlobShallowCopy.read(buffer, getValueSafely(exports.codeToBytesMap, code)));
+                        continue;
                     }
                 // If integer is 0.
                 case MarkerCodes.Int0:
                     {
-                        childValue = 0;
-                        this.children.push(childValue);
-                        break;
+                        children.push(0);
+                        continue;
                     }
                 case MarkerCodes.UInt8:
                 case MarkerCodes.UInt16:
@@ -365,23 +399,66 @@ class NodeCore {
                 case MarkerCodes.Int32:
                 case MarkerCodes.Int64:
                     {
-                        childValue = buffer.read(getValueSafely(exports.codeToBytesMap, code));
-                        this.children.push(childValue);
-                        break;
+                        children.push(buffer.read(getValueSafely(exports.codeToBytesMap, code)));
+                        continue;
                     }
                 case MarkerCodes.BoolTrue:
-                    this.children.push(true);
-                    break;
+                    children.push(true);
+                    continue;
                 case MarkerCodes.BoolFalse:
-                    this.children.push(false);
-                    break;
+                    children.push(false);
+                    continue;
                 case MarkerCodesEnd.list:
                 case MarkerCodesEnd.set:
-                    return;
+                    // Note: We are not checking that end marker matches start marker.
+                    // I.e. that we do not have a case where we start a 'list' but end with a 'set'
+                    // Checking it would require more state tracking that seems not very useful, given
+                    // our code does not care.
+                    children = stack.pop();
+                    // To my surprise, checking children !== undefined adds measurable cost!
+                    // We will rely on children.push() crashing in case of mismatch, and check below
+                    // (outside of the loop)
+                    continue;
                 default:
                     throw new Error(`Invalid code: ${code}`);
             }
         }
+        // This also ensures that stack.length === 0.
+        (0, common_utils_1.assert)(children === this.children, 0x3e7 /* Unpaired start/end list/set markers! */);
+        /**
+         * Process all the strings at once!
+         */
+        let length = 0;
+        for (const el of stringsToResolve) {
+            length += el.endPos - el.startPos + 1;
+        }
+        const stringBuffer = new Uint8Array(length);
+        length = 0;
+        const input = buffer.buffer;
+        (0, common_utils_1.assert)(input.byteOffset === 0, 0x3e8 /* code below assumes no offset */);
+        for (const el of stringsToResolve) {
+            for (let it = el.startPos; it < el.endPos; it++) {
+                stringBuffer[length] = input[it];
+                length++;
+            }
+            stringBuffer[length] = 0;
+            length++;
+        }
+        if (length === stringBuffer.length) {
+            // All is good, we expect all the cases to get here
+            const result = (0, common_utils_1.Uint8ArrayToString)(stringBuffer, "utf-8").split(String.fromCharCode(0));
+            (0, common_utils_1.assert)(result.length === stringsToResolve.length + 1, 0x3e9 /* String content has \0 chars! */);
+            for (let i = 0; i < stringsToResolve.length; i++) {
+                stringsToResolve[i].content = result[i];
+            }
+        }
+        else {
+            // Recovery code
+            logger.sendErrorEvent({ eventName: "StringParsingError" });
+            for (const el of stringsToResolve) {
+                (0, common_utils_1.assert)(el.content === (0, common_utils_1.Uint8ArrayToString)(input.subarray(el.startPos, el.endPos), "utf-8"), 0x3ea /* test */);
+            }
+        }
     }
 }
 exports.NodeCore = NodeCore;
@@ -390,15 +467,29 @@ exports.NodeCore = NodeCore;
  * Provides loading and serialization capabilities.
  */
 class TreeBuilder extends NodeCore {
-    static load(buffer) {
+    static load(buffer, logger) {
         const builder = new TreeBuilder();
-        const dictionary = new Array();
-        builder.load(buffer, dictionary);
+        builder.load(buffer, logger);
         (0, common_utils_1.assert)(buffer.eof, 0x233 /* "Unexpected data at the end of buffer" */);
         return builder;
     }
 }
 exports.TreeBuilder = TreeBuilder;
+function getMaybeStringInstance(node) {
+    const maybeString = node;
+    if (maybeString._stringElement) {
+        return maybeString.content;
+    }
+}
+exports.getMaybeStringInstance = getMaybeStringInstance;
+function getStringInstance(node, message) {
+    const maybeString = node;
+    if (maybeString._stringElement) {
+        return maybeString.content;
+    }
+    throwBufferParseException(node, "BlobCore", message);
+}
+exports.getStringInstance = getStringInstance;
 function assertBlobCoreInstance(node, message) {
     if (node instanceof BlobCore) {
         return;
@@ -447,6 +538,9 @@ function getNodeType(value) {
     else if (typeof value === "boolean") {
         return "Boolean";
     }
+    else if (value._stringElement) {
+        return "String";
+    }
     return "UnknownType";
 }
 //# sourceMappingURL=zipItDataRepresentationUtils.js.map

package/dist/zipItDataRepresentationUtils.js.map

@@ -1 +1 @@
-{"version":3,"file":"zipItDataRepresentationUtils.js","sourceRoot":"","sources":["../src/zipItDataRepresentationUtils.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH;;;EAGE;AAEF,+DAA8G;AAC9G,+DAAiE;AACjE,2EAAqE;AAErE,qDAA+D;AAE/D,mCAAmC;AACnC,wJAAwJ;AACxJ;;;GAGG;AACH,IAAY,WA8BX;AA9BD,WAAY,WAAW;IACnB,sDAAa,CAAA;IACb,wDAAc,CAAA;IAEd,4DAAgB,CAAA;IAChB,gEAAkB,CAAA;IAClB,kEAAmB,CAAA;IACnB,kEAAmB,CAAA;IAEnB,kEAAmB,CAAA;IACnB,oEAAoB,CAAA;IACpB,oEAAoB,CAAA;IACpB,0EAAuB,CAAA;IACvB,gFAA0B,CAAA;IAE1B,6CAAQ,CAAA;IACR,+CAAS,CAAA;IACT,iDAAU,CAAA;IACV,iDAAU,CAAA;IACV,iDAAU,CAAA;IACV,6CAAQ,CAAA;IACR,+CAAS,CAAA;IACT,+CAAS,CAAA;IACT,+CAAS,CAAA;IAET,4DAAgB,CAAA;IAChB,gEAAkB,CAAA;IAClB,kEAAmB,CAAA;IACnB,kEAAmB,CAAA;IACnB,kEAAmB,CAAA;AACvB,CAAC,EA9BW,WAAW,GAAX,mBAAW,KAAX,mBAAW,QA8BtB;AAED;;GAEG;AACH,IAAY,gBAGX;AAHD,WAAY,gBAAgB;IACxB,wDAAW,CAAA;IACX,sDAAU,CAAA;AACd,CAAC,EAHW,gBAAgB,GAAhB,wBAAgB,KAAhB,wBAAgB,QAG3B;AAED;;GAEG;AACH,IAAY,cAGX;AAHD,WAAY,cAAc;IACtB,oDAAW,CAAA;IACX,kDAAU,CAAA;AACd,CAAC,EAHW,cAAc,GAAd,sBAAc,KAAd,sBAAc,QAGzB;AAED;;;EAGE;AACW,QAAA,cAAc,GAAG;IAC1B,wBAAwB;IACxB,CAAC,EAAE,CAAC;IACJ,CAAC,EAAE,CAAC;IACJ,CAAC,EAAE,CAAC;IACJ,CAAC,EAAE,CAAC;IACJ,CAAC,EAAE,CAAC;IACJ,CAAC,EAAE,CAAC;IACJ,CAAC,EAAE,CAAC;IACJ,CAAC,EAAE,CAAC;IACJ,CAAC,EAAE,CAAC;IAEJ,uBAAuB;IACvB,EAAE,EAAE,CAAC;IACL,EAAE,EAAE,CAAC;IACL,EAAE,EAAE,CAAC;IACL,EAAE,EAAE,CAAC;IAEL,EAAE,EAAE,CAAC;IACL,EAAE,EAAE,CAAC;IACL,EAAE,EAAE,CAAC;IAEL,EAAE,EAAE,CAAC;IACL,EAAE,EAAE,CAAC;IAEL,uBAAuB;IACvB,EAAE,EAAE,CAAC;IACL,EAAE,EAAE,CAAC;IACL,EAAE,EAAE,CAAC;IACL,EAAE,EAAE,CAAC;IACL,EAAE,EAAE,CAAC;CACR,CAAC;AAEF,SAAgB,cAAc,CAAC,GAAiC,EAAE,GAAW;IACzE,MAAM,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;IACrB,IAAA,qBAAM,EAAC,GAAG,KAAK,SAAS,EAAE,KAAK,CAAC,+BAA+B,CAAC,CAAC;IACjE,OAAO,GAAG,CAAC;AACf,CAAC;AAJD,wCAIC;AAED,SAAgB,uBAAuB,CAAC,IAAc,EAAE,KAAe,EAAE,eAAe,GAAG,IAAI;IAC3F,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC;IAC/B,MAAM,GAAG,GAA8B,EAAE,CAAC;IAC1C,KAAK,MAAM,CAAC,OAAO,EAAE,SAAS,CAAC,IAAI,IAAI,CAAC,YAAY,EAAE,EAAE;QACpD,sBAAsB,CAAC,OAAO,EAAE,0BAA0B,CAAC,CAAC;QAC5D,MAAM,MAAM,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC;QAClC,IAAI,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE;YACrB,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YACvB,GAAG,CAAC,MAAM,CAAC,GAAG,SAAS,CAAC;SAC3B;KACJ;IACD,IAAI,eAAe,EAAE;QACjB,IAAA,qBAAM,EAAC,OAAO,CAAC,IAAI,KAAK,CAAC,EAAE,KAAK,CAAC,iCAAiC,CAAC,CAAC;KACvE;IACD,OAAO,GAAG,CAAC;AACf,CAAC;AAfD,0DAeC;AAED,SAAgB,YAAY,CAAI,EAAuB;IACnD,MAAM,GAAG,GAA6B;QAClC,IAAI,EAAE,GAAG,EAAE;YACP,MAAM,CAAC,GAAG,EAAE,CAAC,IAAI,EAAE,CAAC;YACpB,IAAI,CAAC,CAAC,IAAI,EAAE;gBACR,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;aAC3C;YACD,MAAM,CAAC,GAAG,EAAE,CAAC,IAAI,EAAE,CAAC;YACpB,IAAA,qBAAM,EAAC,CAAC,CAAC,IAAI,KAAK,IAAI,EAAE,KAAK,CAAC,wBAAwB,CAAC,CAAC;YACxD,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;QACvD,CAAC;QACD,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,GAAG,EAAE,GAAG,OAAO,GAAG,CAAC,CAAC,CAAC;KAC3C,CAAC;IACF,OAAO,GAAG,CAAC;AACf,CAAC;AAdD,oCAcC;AAED;;;GAGG;AACH,SAAgB,OAAO,CAAI,GAAsD;IAC7E,OAAO,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC;AAClC,CAAC;AAFD,0BAEC;AAED;;;;GAIG;AACH,MAAsB,QAAQ;IAM1B;;;;OAIG;IACH,YAA4B,WAAoB,EAAkB,cAAuB,KAAK;QAAlE,gBAAW,GAAX,WAAW,CAAS;QAAkB,gBAAW,GAAX,WAAW,CAAiB;IAAG,CAAC;IATlG,IAAW,WAAW;QAClB,OAAO,IAAA,sCAAuB,EAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAChD,CAAC;IASM,QAAQ;QACX,OAAO,IAAA,iCAAkB,EAAC,IAAI,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IACpD,CAAC;CACJ;AAhBD,4BAgBC;AAED;;;;EAIE;AACF,MAAM,YAAa,SAAQ,QAAQ;IAC/B;;;;;OAKG;IACH,YAA+B,IAAgB,EAAE,WAAoB,EAAE,cAAuB,KAAK;QAC/F,KAAK,CAAC,WAAW,EAAE,WAAW,CAAC,CAAC;QADL,SAAI,GAAJ,IAAI,CAAY;IAE/C,CAAC;IAED,IAAW,MAAM;QACb,OAAO,IAAI,CAAC,IAAI,CAAC;IACrB,CAAC;IAEM,MAAM,CAAC,IAAI,CAAC,MAAkB,EAAE,SAAiB,EAAE,WAAoB;QAC1E,MAAM,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACtC,MAAM,IAAI,GAAG,IAAI,UAAU,CAAC,MAAM,CAAC,CAAC;QACpC,KAAK,IAAI,OAAO,GAAG,CAAC,EAAE,OAAO,GAAG,MAAM,EAAE,OAAO,EAAE,EAAE;YAC/C,IAAI,CAAC,OAAO,CAAC,GAAG,MAAM,CAAC,IAAI,EAAE,CAAC;SACjC;QACD,OAAO,IAAI,YAAY,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC;IAC/C,CAAC;CACJ;AAED;;;GAGG;AACF,MAAa,eAAgB,SAAQ,QAAQ;IAC1C;;;;;;OAMG;IACH,YACc,IAAgB,EAChB,KAAa,EACb,GAAW,EACrB,WAAoB;QAEpB,KAAK,CAAC,WAAW,CAAC,CAAC;QALT,SAAI,GAAJ,IAAI,CAAY;QAChB,UAAK,GAAL,KAAK,CAAQ;QACb,QAAG,GAAH,GAAG,CAAQ;IAIzB,CAAC;IAED,IAAW,MAAM;QACb,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;IAC3D,CAAC;IAEM,MAAM,CAAC,IAAI,CAAC,MAAkB,EAAE,SAAiB,EAAE,WAAoB;QAC1E,MAAM,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACtC,MAAM,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC;QACvB,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACpB,OAAO,IAAI,eAAe,CAAC,MAAM,EAAE,GAAG,EAAE,GAAG,GAAG,MAAM,EAAE,WAAW,CAAC,CAAC;IACvE,CAAC;CACJ;AA3BA,0CA2BA;AAEM,MAAM,iBAAiB,GAC1B,CAAC,IAAc,EAAE,CAAS,EAAE,CAAS,EAAE,yBAAkC,KAAK,EAAE,EAAE;IAC9E,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IAAC,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,sBAAsB,CAAC,CAAC;AACvE,CAAC,CAAC;AAHO,QAAA,iBAAiB,qBAGxB;AACC,MAAM,iBAAiB,GAAG,CAAC,IAAc,EAAE,CAAS,EAAE,CAAS,EAAE,EAAE;IACtE,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;AAC/C,CAAC,CAAC;AAFW,QAAA,iBAAiB,qBAE5B;AACK,MAAM,eAAe,GAAG,CAAC,IAAc,EAAE,CAAS,EAAE,CAAU,EAAE,EAAE;IACrE,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;AAC7C,CAAC,CAAC;AAFW,QAAA,eAAe,mBAE1B;AAaF;;GAEG;AACH,MAAa,QAAQ;IAOjB,YAAmB,OAAsB,KAAK;QAA3B,SAAI,GAAJ,IAAI,CAAuB;QAN9C,2BAA2B;QACV,aAAQ,GAAgB,EAAE,CAAC;IAKK,CAAC;IAJlD,IAAW,KAAK;QACZ,OAAO,IAAI,CAAC,QAAQ,CAAC;IACzB,CAAC;IAIM,CAAC,MAAM,CAAC,QAAQ,CAAC;QACpB,OAAO,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC;IAC5C,CAAC;IAEM,YAAY;QACf,IAAA,qBAAM,EAAC,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,CAAC,EAAE,KAAK,CAAC,qBAAqB,CAAC,CAAC;QAC7D,OAAO,YAAY,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC;IACvC,CAAC;IAED,IAAW,MAAM,KAAK,OAAO,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC;IAE7C,GAAG,CAAC,KAAa,IAAI,OAAO,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAEnD,SAAS,CAAC,KAAa;QAC1B,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QAClC,sBAAsB,CAAC,IAAI,EAAE,oCAAoC,CAAC,CAAC;QACnE,OAAO,IAAI,CAAC,QAAQ,EAAE,CAAC;IAC3B,CAAC;IAEM,OAAO,CAAC,KAAa;QACxB,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QAClC,sBAAsB,CAAC,IAAI,EAAE,8BAA8B,CAAC,CAAC;QAC7D,OAAO,IAAI,CAAC;IAChB,CAAC;IAEM,OAAO,CAAC,KAAa;QACxB,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QAClC,sBAAsB,CAAC,IAAI,EAAE,8BAA8B,CAAC,CAAC;QAC7D,OAAO,IAAI,CAAC;IAChB,CAAC;IAEM,SAAS,CAAC,KAAa;QAC1B,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QAClC,oBAAoB,CAAC,IAAI,EAAE,kCAAkC,CAAC,CAAC;QAC/D,OAAO,IAAI,CAAC;IAChB,CAAC;IAEM,OAAO,CAAC,KAAa;QACxB,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QAClC,kBAAkB,CAAC,IAAI,EAAE,iCAAiC,CAAC,CAAC;QAC5D,OAAO,IAAI,CAAC;IAChB,CAAC;IAEM,OAAO,CAAC,IAAoB;QAC/B,MAAM,IAAI,GAAG,IAAI,QAAQ,CAAC,IAAI,CAAC,CAAC;QAChC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACzB,OAAO,IAAI,CAAC;IAChB,CAAC;IAEM,OAAO,CAAC,IAAgB,EAAE,WAAoB,EAAE,cAAuB,KAAK;QAC/E,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,YAAY,CAAC,IAAI,EAAE,WAAW,EAAE,WAAW,CAAC,CAAC,CAAC;IACzE,CAAC;IAEM,SAAS,CAAC,OAAe,EAAE,WAAoB;QAClD,IAAI,CAAC,OAAO,CAAC,wBAAS,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,CAAC,EAAE,WAAW,EAAE,IAAI,CAAC,CAAC;IACtE,CAAC;IAEM,SAAS,CAAC,OAA2B;QACxC,IAAA,qBAAM,EAAC,MAAM,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,KAAK,CAAC,mCAAmC,CAAC,CAAC;QAC7E,IAAA,qBAAM,EAAC,OAAO,KAAK,SAAS,IAAI,OAAO,IAAI,CAAC,EAAE,KAAK,CAAC,sCAAsC,CAAC,CAAC;QAC5F,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAChC,CAAC;IAEM,OAAO,CAAC,OAAgB;QAC3B,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAChC,CAAC;IAED;;;OAGG;IACO,IAAI,CAAC,MAAkB,EAAE,UAAsB;QACrD,OAAM,CAAC,MAAM,CAAC,GAAG,GAAG;YAChB,IAAI,UAAiC,CAAC;YACtC,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,EAAE,CAAC;YAC3B,QAAQ,IAAI,EAAE;gBACV,KAAK,gBAAgB,CAAC,IAAI,CAAC;gBAC3B,KAAK,gBAAgB,CAAC,GAAG,CAAC,CAAC;oBACvB,UAAU,GAAG,IAAI,QAAQ,CAAC,IAAI,KAAK,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;oBAC1E,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;oBAC/B,UAAU,CAAC,IAAI,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;oBACpC,MAAM;iBACT;gBACD,KAAK,WAAW,CAAC,kBAAkB,CAAC;gBACpC,KAAK,WAAW,CAAC,qBAAqB;oBACtC;wBACI,MAAM,QAAQ,GAAG,MAAM,CAAC,IAAI,CAAC,cAAc,CAAC,sBAAc,EAAE,IAAI,CAAC,CAAC,CAAC;wBACnE,MAAM,WAAW,GAAG,eAAe,CAAC,IAAI,CAAC,MAAM,EAAE,cAAc,CAAC,sBAAc,EAAE,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC;wBAC7F,UAAU,CAAC,QAAQ,CAAC,GAAG,WAAW,CAAC;wBACnC,MAAM;qBACT;gBACD,KAAK,WAAW,CAAC,cAAc,CAAC;gBAChC,KAAK,WAAW,CAAC,eAAe,CAAC;gBACjC,KAAK,WAAW,CAAC,eAAe;oBAChC;wBACI,MAAM,QAAQ,GAAG,MAAM,CAAC,IAAI,CAAC,cAAc,CAAC,sBAAc,EAAE,IAAI,CAAC,CAAC,CAAC;wBACnE,UAAU,GAAG,UAAU,CAAC,QAAQ,CAAC,CAAC;wBAClC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;wBAC/B,MAAM;qBACT;gBACD,KAAK,WAAW,CAAC,WAAW,CAAC;gBAC7B,KAAK,WAAW,CAAC,aAAa,CAAC;gBAC/B,KAAK,WAAW,CAAC,cAAc,CAAC;gBAChC,KAAK,WAAW,CAAC,cAAc,CAAC;gBAChC,KAAK,WAAW,CAAC,WAAW,CAAC;gBAC7B,KAAK,WAAW,CAAC,aAAa,CAAC;gBAC/B,KAAK,WAAW,CAAC,cAAc,CAAC;gBAChC,KAAK,WAAW,CAAC,cAAc,CAAC;gBAChC,KAAK,WAAW,CAAC,cAAc;oBAC/B;wBACI,UAAU,GAAG,eAAe,CAAC,IAAI,CAAC,MAAM,EAAE,cAAc,CAAC,sBAAc,EAAE,IAAI,CAAC,EAAE,KAAK,CAAC,CAAC;wBACvF,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;wBAC/B,MAAM;qBACT;gBACD,mBAAmB;gBACnB,KAAK,WAAW,CAAC,IAAI;oBACrB;wBACI,UAAU,GAAG,CAAC,CAAC;wBACf,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;wBAC/B,MAAM;qBACT;gBACD,KAAK,WAAW,CAAC,KAAK,CAAC;gBACvB,KAAK,WAAW,CAAC,MAAM,CAAC;gBACxB,KAAK,WAAW,CAAC,MAAM,CAAC;gBACxB,KAAK,WAAW,CAAC,MAAM,CAAC;gBACxB,KAAK,WAAW,CAAC,IAAI,CAAC;gBACtB,KAAK,WAAW,CAAC,KAAK,CAAC;gBACvB,KAAK,WAAW,CAAC,KAAK,CAAC;gBACvB,KAAK,WAAW,CAAC,KAAK;oBACtB;wBACI,UAAU,GAAG,MAAM,CAAC,IAAI,CAAC,cAAc,CAAC,sBAAc,EAAE,IAAI,CAAC,CAAC,CAAC;wBAC/D,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;wBAC/B,MAAM;qBACT;gBACD,KAAK,WAAW,CAAC,QAAQ;oBACrB,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBACzB,MAAM;gBACV,KAAK,WAAW,CAAC,SAAS;oBACtB,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;oBAC1B,MAAM;gBACV,KAAK,cAAc,CAAC,IAAI,CAAC;gBACzB,KAAK,cAAc,CAAC,GAAG;oBACnB,OAAO;gBACX;oBACI,MAAM,IAAI,KAAK,CAAC,iBAAiB,IAAI,EAAE,CAAC,CAAC;aAChD;SACJ;IACL,CAAC;CACJ;AA7JD,4BA6JC;AAEA;;;GAGG;AACJ,MAAa,WAAY,SAAQ,QAAQ;IACrC,MAAM,CAAC,IAAI,CAAC,MAAkB;QAC1B,MAAM,OAAO,GAAG,IAAI,WAAW,EAAE,CAAC;QAClC,MAAM,UAAU,GAAG,IAAI,KAAK,EAAY,CAAC;QACzC,OAAO,CAAC,IAAI,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;QACjC,IAAA,qBAAM,EAAC,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,4CAA4C,CAAC,CAAC;QACvE,OAAO,OAAO,CAAC;IACnB,CAAC;CACJ;AARD,kCAQC;AAED,SAAgB,sBAAsB,CAClC,IAAe,EACf,OAAe;IAEf,IAAI,IAAI,YAAY,QAAQ,EAAE;QAC1B,OAAO;KACV;IACD,yBAAyB,CAAC,IAAI,EAAE,UAAU,EAAE,OAAO,CAAC,CAAC;AACzD,CAAC;AARD,wDAQC;AAED,SAAgB,sBAAsB,CAClC,IAAe,EACf,OAAe;IAEf,IAAI,IAAI,YAAY,QAAQ,EAAE;QAC1B,OAAO;KACV;IACD,yBAAyB,CAAC,IAAI,EAAE,UAAU,EAAE,OAAO,CAAC,CAAC;AACzD,CAAC;AARD,wDAQC;AAED,SAAgB,oBAAoB,CAChC,IAAe,EACf,OAAe;IAEf,IAAI,OAAO,IAAI,KAAK,QAAQ,EAAE;QAC1B,OAAO;KACV;IACD,yBAAyB,CAAC,IAAI,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;AACvD,CAAC;AARD,oDAQC;AAED,SAAgB,kBAAkB,CAC9B,IAAe,EACf,OAAe;IAEf,IAAI,OAAO,IAAI,KAAK,SAAS,EAAE;QAC3B,OAAO;KACV;IACD,yBAAyB,CAAC,IAAI,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC;AACxD,CAAC;AARD,gDAQC;AAED,SAAS,yBAAyB,CAC9B,IAAe,EACf,gBAA0B,EAC1B,OAAe;IAEf,MAAM,IAAI,gCAAiB,CACvB,6BAA6B,OAAO,EAAE,EACtC,oCAAe,CAAC,uBAAuB,EACvC;QACI,QAAQ,EAAE,WAAW,CAAC,IAAI,CAAC;QAC3B,gBAAgB;QAChB,aAAa,EAAb,2BAAa;KAChB,CAAC,CAAC;AACX,CAAC;AAED,SAAS,WAAW,CAAC,KAAgB;IACjC,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE;QAC3B,OAAO,QAAQ,CAAC;KACnB;SAAM,IAAI,KAAK,YAAY,QAAQ,EAAE;QAClC,OAAO,UAAU,CAAC;KACrB;SAAM,IAAI,KAAK,YAAY,QAAQ,EAAE;QAClC,OAAO,UAAU,CAAC;KACrB;SAAM,IAAI,OAAO,KAAK,KAAK,SAAS,EAAE;QACnC,OAAO,SAAS,CAAC;KACpB;IACD,OAAO,aAAa,CAAC;AACzB,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\n/**\n * Data representation which is followed(zipIt Protocol) here is described in this document:\n * https://microsoft.sharepoint-df.com/:w:/t/ODSPFileStore/ER06b64K_XdDjEyAKl-UT60BJiId39SCVkYSyo_2pvH9gQ?e=KYQ0c5\n*/\n\nimport { assert, IsoBuffer, Uint8ArrayToArrayBuffer, Uint8ArrayToString } from \"@fluidframework/common-utils\";\nimport { NonRetryableError } from \"@fluidframework/driver-utils\";\nimport { DriverErrorType } from \"@fluidframework/driver-definitions\";\nimport { ReadBuffer } from \"./ReadBufferUtils\";\nimport { pkgVersion as driverVersion } from \"./packageVersion\";\n\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 * Control codes used by tree serialization / decentralization code. Same as on server. These can be found on\n * filestore code on server too at above link.\n */\nexport enum MarkerCodes {\n    BoolTrue = 11,  // value = true\n    BoolFalse = 12, // value = false\n\n    StringEmpty = 13,       // value = \"\"\n    String8Length = 14,     // unsigned-8-bit little-endian length, follows by UTF-8 bytes of length\n    String16Length = 15,    // unsigned-16-bit little-endian length, follows by UTF-8 bytes of length\n    String32Length = 16,    // unsigned-32-bit little-endian length, follows by UTF-8 bytes of length\n\n    ConstString8Id = 17,     // unsigned-8-bit little-endian const string id follows\n    ConstString16Id = 18,    // unsigned-16-bit little-endian const string id follows\n    ConstString32Id = 19,    // unsigned-32-bit little-endian const string id follows\n    ConstStringDeclare = 20, // Code for declaring a const string with size <= 1 byte\n    ConstStringDeclareBig = 21, // Code for declaring a const string with size > 1 byte. It is represented in 4 bytes.\n\n    Int0 = 1,   // value = 0\n    UInt8 = 3,  // unsigned-8-bit little-endian follows\n    UInt16 = 5, // unsigned-16-bit little-endian follows\n    UInt32 = 7, // unsigned-32-bit little-endian follows\n    UInt64 = 9, // unsigned-64-bit little-endian follows\n    Int8 = 2,   // signed-8-bit little-endian follows\n    Int16 = 4,  // signed-16-bit little-endian follows\n    Int32 = 6,  // signed-32-bit little-endian follows\n    Int64 = 8,  // signed-64-bit little-endian follows\n\n    BinaryEmpty = 32,        // value = byte[]\n    BinarySingle8 = 33,      // unsigned-8-bit little-endian length, follows by bytes of length\n    BinarySingle16 = 34,     // unsigned-16-bit little-endian length, follows by bytes of length\n    BinarySingle32 = 35,     // unsigned-32-bit little-endian length, follows by bytes of length\n    BinarySingle64 = 36,     // unsigned-64-bit little-endian length, follows by bytes of length\n}\n\n/**\n * Control codes used by tree serialization / decentralization code. They mark the start of sections.\n */\nexport enum MarkerCodesStart {\n    \"list\" = 49,\n    \"set\" = 51,\n}\n\n/**\n * Control codes used by tree serialization / decentralization code. They mark the end of sections.\n */\nexport enum MarkerCodesEnd {\n    \"list\" = 50,\n    \"set\" = 52,\n}\n\n/**\n * This contains mapping of Marker Codes to number of bytes in which the corresponding data\n * will be stored.\n*/\nexport const codeToBytesMap = {\n    // Integer code to bytes\n    1: 0,\n    2: 1,\n    3: 1,\n    4: 2,\n    5: 2,\n    6: 4,\n    7: 4,\n    8: 8,\n    9: 8,\n\n    // String code to Bytes\n    13: 0,\n    14: 1,\n    15: 2,\n    16: 4,\n\n    17: 1,\n    18: 2,\n    19: 4,\n\n    20: 1,\n    21: 4,\n\n    // Binary code to bytes\n    32: 0,\n    33: 1,\n    34: 2,\n    35: 4,\n    36: 8,\n};\n\nexport function getValueSafely(map: { [index: number]: number; }, key: number) {\n    const val = map[key];\n    assert(val !== undefined, 0x287 /* key must exist in the map */);\n    return val;\n}\n\nexport function getAndValidateNodeProps(node: NodeCore, props: string[], enforceAllProps = true) {\n    const propSet = new Set(props);\n    const res: Record<string, NodeTypes> = {};\n    for (const [keyNode, valueNode] of node.iteratePairs()) {\n        assertBlobCoreInstance(keyNode, \"keynode should be a blob\");\n        const keyStr = keyNode.toString();\n        if (propSet.has(keyStr)) {\n            propSet.delete(keyStr);\n            res[keyStr] = valueNode;\n        }\n    }\n    if (enforceAllProps) {\n        assert(propSet.size === 0, 0x288 /* All properties should exist */);\n    }\n    return res;\n}\n\nexport function iteratePairs<T>(it: IterableIterator<T>) {\n    const res: IterableIterator<[T, T]> = {\n        next: () => {\n            const a = it.next();\n            if (a.done) {\n                return { value: undefined, done: true };\n            }\n            const b = it.next();\n            assert(b.done !== true, 0x22b /* \"Should be a pair\" */);\n            return { value: [a.value, b.value], done: b.done };\n        },\n        [Symbol.iterator]: () => { return res; },\n    };\n    return res;\n}\n\n/**\n * Helper function that returns iterator from an object\n * @param obj - object that supports iteration\n */\nexport function iterate<T>(obj: { [Symbol.iterator]: () => IterableIterator<T>; }) {\n    return obj[Symbol.iterator]();\n}\n\n/**\n * Base class to represent binary blob element.\n * Binary blob is one of three types supported as a leaf node of a tree.\n * Note: concrete implementations (derived classes) are not exposed from this module\n */\nexport abstract class BlobCore {\n    public abstract get buffer(): Uint8Array;\n    public get arrayBuffer(): ArrayBufferLike {\n        return Uint8ArrayToArrayBuffer(this.buffer);\n    }\n\n    /**\n     * Represents a blob.\n     * @param constString - Whether it contains const string declaration.\n     * @param useUtf8Code - Represents if the utf8 string marker code should be used when representing.\n     */\n    constructor(public readonly constString: boolean, public readonly useUtf8Code: boolean = false) {}\n\n    public toString() {\n        return Uint8ArrayToString(this.buffer, \"utf-8\");\n    }\n}\n\n/**\n * \"deep copy\" blob, holds to binary data passed in\n * It is called deep copy as a counter-part to BlobShallowCopy, which\n * is a reference to underlying binary stream (ReadBuffer).\n*/\nclass BlobDeepCopy extends BlobCore {\n    /**\n     * Represents a deep copy of the blob.\n     * @param data - Data array of the blob\n     * @param constString - Whether it contains const string declaration.\n     * @param useUtf8Code - Represents if the utf8 string marker code should be used when representing.\n     */\n    constructor(protected readonly data: Uint8Array, constString: boolean, useUtf8Code: boolean = false) {\n        super(constString, useUtf8Code);\n    }\n\n    public get buffer() {\n        return this.data;\n    }\n\n    public static read(buffer: ReadBuffer, lengthLen: number, constString: boolean): BlobCore {\n        const length = buffer.read(lengthLen);\n        const data = new Uint8Array(length);\n        for (let counter = 0; counter < length; counter++) {\n            data[counter] = buffer.read();\n        }\n        return new BlobDeepCopy(data, constString);\n    }\n}\n\n/**\n * Shallow copy blob, keeps a reference to portion of ReadBuffer\n * it was constructed from. It takes much less memory compared to BlobDeepCopy\n */\n export class BlobShallowCopy extends BlobCore {\n    /**\n     * Represents a shallow copy of the blob. It is not a separate blob, just reference to original blobs.\n     * @param data - Data array of the blob\n     * @param start - Start point of the blob in the buffer.\n     * @param end - End point of the blob in the buffer.\n     * @param constString - Whether it contains const string declaration.\n     */\n    constructor(\n        protected data: ReadBuffer,\n        protected start: number,\n        protected end: number,\n        constString: boolean,\n    ) {\n        super(constString);\n    }\n\n    public get buffer() {\n        return this.data.buffer.subarray(this.start, this.end);\n    }\n\n    public static read(buffer: ReadBuffer, lengthLen: number, constString: boolean): BlobCore {\n        const length = buffer.read(lengthLen);\n        const pos = buffer.pos;\n        buffer.skip(length);\n        return new BlobShallowCopy(buffer, pos, pos + length, constString);\n    }\n}\n\nexport const addStringProperty =\n    (node: NodeCore, a: string, b: string, encodeValAsConstString: boolean = false) => {\n        node.addString(a, true); node.addString(b, encodeValAsConstString);\n    };\nexport const addNumberProperty = (node: NodeCore, a: string, b: number) => {\n    node.addString(a, true); node.addNumber(b);\n};\nexport const addBoolProperty = (node: NodeCore, a: string, b: boolean) => {\n    node.addString(a, true); node.addBool(b);\n};\n\n/**\n * Three leaf types supported by tree:\n * 1. Node (sub-tree)\n * 2. binary blob\n * 3. integer\n * 4. boolean\n */\nexport type NodeTypes = NodeCore | BlobCore | number | boolean;\n\nexport type NodeCoreTypes = \"list\" | \"set\";\n\n/**\n * Node - node in the tree (non-leaf element of the tree)\n */\nexport class NodeCore {\n    // It is an array of nodes.\n    private readonly children: NodeTypes[] = [];\n    public get nodes() {\n        return this.children;\n    }\n\n    constructor(public type: NodeCoreTypes = \"set\") {}\n\n    public [Symbol.iterator]() {\n        return this.children[Symbol.iterator]();\n    }\n\n    public iteratePairs() {\n        assert((this.length % 2) === 0, 0x22c /* \"reading pairs\" */);\n        return iteratePairs(iterate(this));\n    }\n\n    public get length() { return this.children.length; }\n\n    public get(index: number) { return this.children[index]; }\n\n    public getString(index: number): string {\n        const node = this.children[index];\n        assertBlobCoreInstance(node, \"getString should return stringblob\");\n        return node.toString();\n    }\n\n    public getBlob(index: number): BlobCore {\n        const node = this.children[index];\n        assertBlobCoreInstance(node, \"getBlob should return a blob\");\n        return node;\n    }\n\n    public getNode(index: number): NodeCore {\n        const node = this.children[index];\n        assertNodeCoreInstance(node, \"getNode should return a node\");\n        return node;\n    }\n\n    public getNumber(index: number): number {\n        const node = this.children[index];\n        assertNumberInstance(node, \"getNumber should return a number\");\n        return node;\n    }\n\n    public getBool(index: number): boolean {\n        const node = this.children[index];\n        assertBoolInstance(node, \"getBool should return a boolean\");\n        return node;\n    }\n\n    public addNode(type?: NodeCoreTypes): NodeCore {\n        const node = new NodeCore(type);\n        this.children.push(node);\n        return node;\n    }\n\n    public addBlob(blob: Uint8Array, constString: boolean, useUtf8Code: boolean = false) {\n        this.children.push(new BlobDeepCopy(blob, constString, useUtf8Code));\n    }\n\n    public addString(payload: string, constString: boolean) {\n        this.addBlob(IsoBuffer.from(payload, \"utf-8\"), constString, true);\n    }\n\n    public addNumber(payload: number | undefined) {\n        assert(Number.isInteger(payload), 0x231 /* \"Number should be an integer\" */);\n        assert(payload !== undefined && payload >= 0, 0x232 /* \"Payload should not be negative\" */);\n        this.children.push(payload);\n    }\n\n    public addBool(payload: boolean) {\n        this.children.push(payload);\n    }\n\n    /**\n     * Load and parse the buffer into a tree.\n     * @param buffer - buffer to read from.\n     */\n    protected load(buffer: ReadBuffer, dictionary: BlobCore[]) {\n        for (;!buffer.eof;) {\n            let childValue: NodeTypes | undefined;\n            const code = buffer.read();\n            switch (code) {\n                case MarkerCodesStart.list:\n                case MarkerCodesStart.set: {\n                    childValue = new NodeCore(code === MarkerCodesStart.set ? \"set\" : \"list\");\n                    this.children.push(childValue);\n                    childValue.load(buffer, dictionary);\n                    break;\n                }\n                case MarkerCodes.ConstStringDeclare:\n                case MarkerCodes.ConstStringDeclareBig:\n                {\n                    const stringId = buffer.read(getValueSafely(codeToBytesMap, code));\n                    const constString = BlobShallowCopy.read(buffer, getValueSafely(codeToBytesMap, code), true);\n                    dictionary[stringId] = constString;\n                    break;\n                }\n                case MarkerCodes.ConstString8Id:\n                case MarkerCodes.ConstString16Id:\n                case MarkerCodes.ConstString32Id:\n                {\n                    const stringId = buffer.read(getValueSafely(codeToBytesMap, code));\n                    childValue = dictionary[stringId];\n                    this.children.push(childValue);\n                    break;\n                }\n                case MarkerCodes.StringEmpty:\n                case MarkerCodes.String8Length:\n                case MarkerCodes.String16Length:\n                case MarkerCodes.String32Length:\n                case MarkerCodes.BinaryEmpty:\n                case MarkerCodes.BinarySingle8:\n                case MarkerCodes.BinarySingle16:\n                case MarkerCodes.BinarySingle32:\n                case MarkerCodes.BinarySingle64:\n                {\n                    childValue = BlobShallowCopy.read(buffer, getValueSafely(codeToBytesMap, code), false);\n                    this.children.push(childValue);\n                    break;\n                }\n                // If integer is 0.\n                case MarkerCodes.Int0:\n                {\n                    childValue = 0;\n                    this.children.push(childValue);\n                    break;\n                }\n                case MarkerCodes.UInt8:\n                case MarkerCodes.UInt16:\n                case MarkerCodes.UInt32:\n                case MarkerCodes.UInt64:\n                case MarkerCodes.Int8:\n                case MarkerCodes.Int16:\n                case MarkerCodes.Int32:\n                case MarkerCodes.Int64:\n                {\n                    childValue = buffer.read(getValueSafely(codeToBytesMap, code));\n                    this.children.push(childValue);\n                    break;\n                }\n                case MarkerCodes.BoolTrue:\n                    this.children.push(true);\n                    break;\n                case MarkerCodes.BoolFalse:\n                    this.children.push(false);\n                    break;\n                case MarkerCodesEnd.list:\n                case MarkerCodesEnd.set:\n                    return;\n                default:\n                    throw new Error(`Invalid code: ${code}`);\n            }\n        }\n    }\n}\n\n /**\n  * TreeBuilder - Root of the tree.\n  * Provides loading and serialization capabilities.\n  */\nexport class TreeBuilder extends NodeCore {\n    static load(buffer: ReadBuffer): TreeBuilder {\n        const builder = new TreeBuilder();\n        const dictionary = new Array<BlobCore>();\n        builder.load(buffer, dictionary);\n        assert(buffer.eof, 0x233 /* \"Unexpected data at the end of buffer\" */);\n        return builder;\n    }\n}\n\nexport function assertBlobCoreInstance(\n    node: NodeTypes,\n    message: string,\n): asserts node is BlobCore {\n    if (node instanceof BlobCore) {\n        return;\n    }\n    throwBufferParseException(node, \"BlobCore\", message);\n}\n\nexport function assertNodeCoreInstance(\n    node: NodeTypes,\n    message: string,\n): asserts node is NodeCore {\n    if (node instanceof NodeCore) {\n        return;\n    }\n    throwBufferParseException(node, \"NodeCore\", message);\n}\n\nexport function assertNumberInstance(\n    node: NodeTypes,\n    message: string,\n): asserts node is number {\n    if (typeof node === \"number\") {\n        return;\n    }\n    throwBufferParseException(node, \"Number\", message);\n}\n\nexport function assertBoolInstance(\n    node: NodeTypes,\n    message: string,\n): asserts node is boolean {\n    if (typeof node === \"boolean\") {\n        return;\n    }\n    throwBufferParseException(node, \"Boolean\", message);\n}\n\nfunction throwBufferParseException(\n    node: NodeTypes,\n    expectedNodeType: NodeType,\n    message: string,\n): never {\n    throw new NonRetryableError(\n        `Buffer parsing exception: ${message}`,\n        DriverErrorType.incorrectServerResponse,\n        {\n            nodeType: getNodeType(node),\n            expectedNodeType,\n            driverVersion,\n        });\n}\n\nfunction getNodeType(value: NodeTypes): NodeType {\n    if (typeof value === \"number\") {\n        return \"Number\";\n    } else if (value instanceof BlobCore) {\n        return \"BlobCore\";\n    } else if (value instanceof NodeCore) {\n        return \"NodeCore\";\n    } else if (typeof value === \"boolean\") {\n        return \"Boolean\";\n    }\n    return \"UnknownType\";\n}\n\ntype NodeType = \"Number\" | \"BlobCore\" | \"NodeCore\" | \"Boolean\" | \"UnknownType\";\n"]}
+{"version":3,"file":"zipItDataRepresentationUtils.js","sourceRoot":"","sources":["../src/zipItDataRepresentationUtils.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH;;;EAGE;AAEF,+DAAmG;AAEnG,+DAAiE;AACjE,2EAAqE;AAErE,qDAA+D;AAE/D,mCAAmC;AACnC,wJAAwJ;AACxJ;;;GAGG;AACH,IAAY,WA8BX;AA9BD,WAAY,WAAW;IACnB,sDAAa,CAAA;IACb,wDAAc,CAAA;IAEd,4DAAgB,CAAA;IAChB,gEAAkB,CAAA;IAClB,kEAAmB,CAAA;IACnB,kEAAmB,CAAA;IAEnB,kEAAmB,CAAA;IACnB,oEAAoB,CAAA;IACpB,oEAAoB,CAAA;IACpB,0EAAuB,CAAA;IACvB,gFAA0B,CAAA;IAE1B,6CAAQ,CAAA;IACR,+CAAS,CAAA;IACT,iDAAU,CAAA;IACV,iDAAU,CAAA;IACV,iDAAU,CAAA;IACV,6CAAQ,CAAA;IACR,+CAAS,CAAA;IACT,+CAAS,CAAA;IACT,+CAAS,CAAA;IAET,4DAAgB,CAAA;IAChB,gEAAkB,CAAA;IAClB,kEAAmB,CAAA;IACnB,kEAAmB,CAAA;IACnB,kEAAmB,CAAA;AACvB,CAAC,EA9BW,WAAW,GAAX,mBAAW,KAAX,mBAAW,QA8BtB;AAED;;GAEG;AACH,IAAY,gBAGX;AAHD,WAAY,gBAAgB;IACxB,wDAAW,CAAA;IACX,sDAAU,CAAA;AACd,CAAC,EAHW,gBAAgB,GAAhB,wBAAgB,KAAhB,wBAAgB,QAG3B;AAED;;GAEG;AACH,IAAY,cAGX;AAHD,WAAY,cAAc;IACtB,oDAAW,CAAA;IACX,kDAAU,CAAA;AACd,CAAC,EAHW,cAAc,GAAd,sBAAc,KAAd,sBAAc,QAGzB;AAED;;;EAGE;AACW,QAAA,cAAc,GAAG;IAC1B,wBAAwB;IACxB,CAAC,EAAE,CAAC;IACJ,CAAC,EAAE,CAAC;IACJ,CAAC,EAAE,CAAC;IACJ,CAAC,EAAE,CAAC;IACJ,CAAC,EAAE,CAAC;IACJ,CAAC,EAAE,CAAC;IACJ,CAAC,EAAE,CAAC;IACJ,CAAC,EAAE,CAAC;IACJ,CAAC,EAAE,CAAC;IAEJ,uBAAuB;IACvB,EAAE,EAAE,CAAC;IACL,EAAE,EAAE,CAAC;IACL,EAAE,EAAE,CAAC;IACL,EAAE,EAAE,CAAC;IAEL,EAAE,EAAE,CAAC;IACL,EAAE,EAAE,CAAC;IACL,EAAE,EAAE,CAAC;IAEL,EAAE,EAAE,CAAC;IACL,EAAE,EAAE,CAAC;IAEL,uBAAuB;IACvB,EAAE,EAAE,CAAC;IACL,EAAE,EAAE,CAAC;IACL,EAAE,EAAE,CAAC;IACL,EAAE,EAAE,CAAC;IACL,EAAE,EAAE,CAAC;CACR,CAAC;AAEF,SAAgB,cAAc,CAAC,GAAiC,EAAE,GAAW;IACzE,MAAM,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;IACrB,IAAA,qBAAM,EAAC,GAAG,KAAK,SAAS,EAAE,KAAK,CAAC,+BAA+B,CAAC,CAAC;IACjE,OAAO,GAAG,CAAC;AACf,CAAC;AAJD,wCAIC;AAED,SAAgB,YAAY,CAAC,IAAc;IACvC,MAAM,GAAG,GAA8B,EAAE,CAAC;IAC1C,KAAK,MAAM,CAAC,OAAO,EAAE,SAAS,CAAC,IAAI,IAAI,CAAC,YAAY,EAAE,EAAE;QACpD,MAAM,EAAE,GAAG,iBAAiB,CAAC,OAAO,EAAE,4BAA4B,CAAC,CAAC;QACpE,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC;KACvB;IACD,OAAO,GAAG,CAAC;AACf,CAAC;AAPD,oCAOC;AAED,SAAgB,YAAY,CAAI,EAAuB;IACnD,MAAM,GAAG,GAA6B;QAClC,IAAI,EAAE,GAAG,EAAE;YACP,MAAM,CAAC,GAAG,EAAE,CAAC,IAAI,EAAE,CAAC;YACpB,IAAI,CAAC,CAAC,IAAI,EAAE;gBACR,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;aAC3C;YACD,MAAM,CAAC,GAAG,EAAE,CAAC,IAAI,EAAE,CAAC;YACpB,IAAA,qBAAM,EAAC,CAAC,CAAC,IAAI,KAAK,IAAI,EAAE,KAAK,CAAC,wBAAwB,CAAC,CAAC;YACxD,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;QACvD,CAAC;QACD,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,GAAG,EAAE,GAAG,OAAO,GAAG,CAAC,CAAC,CAAC;KAC3C,CAAC;IACF,OAAO,GAAG,CAAC;AACf,CAAC;AAdD,oCAcC;AAED;;;GAGG;AACH,SAAgB,OAAO,CAAI,GAAsD;IAC7E,OAAO,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC;AAClC,CAAC;AAFD,0BAEC;AAED;;;;GAIG;AACH,MAAsB,QAAQ;IAI1B;;OAEG;IACH,gBAAe,CAAC;CACnB;AARD,4BAQC;AAED;;;;EAIE;AACF,MAAM,YAAa,SAAQ,QAAQ;IAC/B;;;OAGG;IACH,YAA+B,IAAgB;QAC3C,KAAK,EAAE,CAAC;QADmB,SAAI,GAAJ,IAAI,CAAY;IAE/C,CAAC;IAED,IAAW,MAAM;QACb,OAAO,IAAI,CAAC,IAAI,CAAC;IACrB,CAAC;IAED,IAAW,WAAW;QAClB,OAAO,IAAA,sCAAuB,EAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAChD,CAAC;IAEM,MAAM,CAAC,IAAI,CAAC,MAAkB,EAAE,SAAiB;QACpD,MAAM,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACtC,MAAM,IAAI,GAAG,IAAI,UAAU,CAAC,MAAM,CAAC,CAAC;QACpC,KAAK,IAAI,OAAO,GAAG,CAAC,EAAE,OAAO,GAAG,MAAM,EAAE,OAAO,EAAE,EAAE;YAC/C,IAAI,CAAC,OAAO,CAAC,GAAG,MAAM,CAAC,IAAI,EAAE,CAAC;SACjC;QACD,OAAO,IAAI,YAAY,CAAC,IAAI,CAAC,CAAC;IAClC,CAAC;CACJ;AAED;;;GAGG;AACF,MAAa,eAAgB,SAAQ,QAAQ;IAC1C;;;;;OAKG;IACH,YACc,IAAgB,EAChB,KAAa,EACb,GAAW;QAErB,KAAK,EAAE,CAAC;QAJE,SAAI,GAAJ,IAAI,CAAY;QAChB,UAAK,GAAL,KAAK,CAAQ;QACb,QAAG,GAAH,GAAG,CAAQ;IAGzB,CAAC;IAED,IAAW,MAAM;QACb,OAAO,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;IACpD,CAAC;IAED,qDAAqD;IACrD,IAAW,WAAW;QAClB,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC;QACpC,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,GAAG,MAAM,EAAE,IAAI,CAAC,GAAG,GAAG,MAAM,CAAC,CAAC;IAC1E,CAAC;IAEM,MAAM,CAAC,IAAI,CAAC,MAAkB,EAAE,SAAiB;QACpD,MAAM,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACtC,MAAM,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC;QACvB,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACpB,OAAO,IAAI,eAAe,CAAC,MAAM,CAAC,MAAM,EAAE,GAAG,EAAE,GAAG,GAAG,MAAM,CAAC,CAAC;IACjE,CAAC;CACJ;AA/BA,0CA+BA;AAEM,MAAM,iBAAiB,GAC1B,CAAC,IAAc,EAAE,CAAS,EAAE,CAAS,EAAE,EAAE;IACrC,IAAI,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC;IAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;AACnD,CAAC,CAAC;AAHO,QAAA,iBAAiB,qBAGxB;AACC,MAAM,2BAA2B,GACpC,CAAC,IAAc,EAAE,CAAS,EAAE,CAAS,EAAE,EAAE;IACrC,IAAI,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC;IAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;AACnD,CAAC,CAAC;AAHO,QAAA,2BAA2B,+BAGlC;AACC,MAAM,iBAAiB,GAAG,CAAC,IAAc,EAAE,CAAS,EAAE,CAAS,EAAE,EAAE;IACtE,IAAI,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC;IAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;AACnD,CAAC,CAAC;AAFW,QAAA,iBAAiB,qBAE5B;AACK,MAAM,eAAe,GAAG,CAAC,IAAc,EAAE,CAAS,EAAE,CAAU,EAAE,EAAE;IACrE,IAAI,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC;IAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;AACjD,CAAC,CAAC;AAFW,QAAA,eAAe,mBAE1B;AAyBF;;GAEG;AACH,MAAa,QAAQ;IAOjB,YAAmB,OAAsB,KAAK;QAA3B,SAAI,GAAJ,IAAI,CAAuB;QAN9C,2BAA2B;QACV,aAAQ,GAAgB,EAAE,CAAC;IAKK,CAAC;IAJlD,IAAW,KAAK;QACZ,OAAO,IAAI,CAAC,QAAQ,CAAC;IACzB,CAAC;IAIM,CAAC,MAAM,CAAC,QAAQ,CAAC;QACpB,OAAO,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC;IAC5C,CAAC;IAEM,YAAY;QACf,IAAA,qBAAM,EAAC,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,CAAC,EAAE,KAAK,CAAC,qBAAqB,CAAC,CAAC;QAC7D,OAAO,YAAY,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC;IACvC,CAAC;IAED,IAAW,MAAM,KAAK,OAAO,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC;IAE7C,GAAG,CAAC,KAAa,IAAI,OAAO,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAEnD,SAAS,CAAC,KAAa;QAC1B,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QAClC,OAAO,iBAAiB,CAAC,IAAI,EAAE,gCAAgC,CAAC,CAAC;IACrE,CAAC;IAEM,cAAc,CAAC,KAAa;QAC/B,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QAClC,OAAO,sBAAsB,CAAC,IAAI,CAAC,CAAC;IACxC,CAAC;IAEM,OAAO,CAAC,KAAa;QACxB,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QAClC,sBAAsB,CAAC,IAAI,EAAE,8BAA8B,CAAC,CAAC;QAC7D,OAAO,IAAI,CAAC;IAChB,CAAC;IAEM,OAAO,CAAC,KAAa;QACxB,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QAClC,sBAAsB,CAAC,IAAI,EAAE,8BAA8B,CAAC,CAAC;QAC7D,OAAO,IAAI,CAAC;IAChB,CAAC;IAEM,SAAS,CAAC,KAAa;QAC1B,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QAClC,oBAAoB,CAAC,IAAI,EAAE,kCAAkC,CAAC,CAAC;QAC/D,OAAO,IAAI,CAAC;IAChB,CAAC;IAEM,OAAO,CAAC,KAAa;QACxB,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QAClC,kBAAkB,CAAC,IAAI,EAAE,iCAAiC,CAAC,CAAC;QAC5D,OAAO,IAAI,CAAC;IAChB,CAAC;IAEM,OAAO,CAAC,IAAoB;QAC/B,MAAM,IAAI,GAAG,IAAI,QAAQ,CAAC,IAAI,CAAC,CAAC;QAChC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACzB,OAAO,IAAI,CAAC;IAChB,CAAC;IAEM,OAAO,CAAC,IAAgB;QAC3B,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC;IAC/C,CAAC;IAEM,mBAAmB,CAAC,OAAe;QACtC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC;YACf,OAAO,EAAE,OAAO;YAChB,UAAU,EAAE,IAAI;YAChB,cAAc,EAAE,IAAI;SACvB,CAAC,CAAC;IACP,CAAC;IAEM,SAAS,CAAC,OAAe;QAC5B,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC;YACf,OAAO,EAAE,OAAO;YAChB,UAAU,EAAE,KAAK;YACjB,cAAc,EAAE,IAAI;SACvB,CAAC,CAAC;IACP,CAAC;IAEM,SAAS,CAAC,OAA2B;QACxC,IAAA,qBAAM,EAAC,MAAM,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,KAAK,CAAC,mCAAmC,CAAC,CAAC;QAC7E,IAAA,qBAAM,EAAC,OAAO,KAAK,SAAS,IAAI,OAAO,IAAI,CAAC,EAAE,KAAK,CAAC,sCAAsC,CAAC,CAAC;QAC5F,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAChC,CAAC;IAEM,OAAO,CAAC,OAAgB;QAC3B,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAChC,CAAC;IAED,mEAAmE;IAC3D,MAAM,CAAC,UAAU,CAAC,MAAkB,EAAE,IAAY,EAAE,UAAmB;QAC3E,MAAM,SAAS,GAAG,cAAc,CAAC,sBAAc,EAAE,IAAI,CAAC,CAAC;QACvD,MAAM,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACtC,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC;QAC5B,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACpB,MAAM,MAAM,GAA2B;YACnC,oFAAoF;YACpF,UAAU;YACV,cAAc,EAAE,IAAI;YACpB,QAAQ;YACR,MAAM,EAAE,MAAM,CAAC,GAAG;SACrB,CAAC;QAEF,gEAAgE;QAChE,4FAA4F;QAC5F,uDAAuD;QACvD,8FAA8F;QAC9F,OAAO,MAAiD,CAAC;IAC7D,CAAC;IAED;;;OAGG;IACO,IAAI,CAAC,MAAkB,EAAE,MAAwB;QACvD,MAAM,KAAK,GAAkB,EAAE,CAAC;QAChC,MAAM,gBAAgB,GAA6B,EAAE,CAAC;QACtD,MAAM,UAAU,GAAqB,EAAE,CAAC;QAExC,IAAI,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC7B,OAAM,CAAC,MAAM,CAAC,GAAG,GAAG;YAChB,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,EAAE,CAAC;YAC3B,QAAQ,IAAI,EAAE;gBACV,KAAK,gBAAgB,CAAC,IAAI,CAAC;gBAC3B,KAAK,gBAAgB,CAAC,GAAG,CAAC,CAAC;oBACvB,MAAM,UAAU,GAAG,IAAI,QAAQ,CAAC,IAAI,KAAK,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;oBAChF,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;oBAC1B,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;oBACrB,QAAQ,GAAG,UAAU,CAAC,QAAQ,CAAC;oBAC/B,SAAS;iBACZ;gBACD,KAAK,WAAW,CAAC,kBAAkB,CAAC;gBACpC,KAAK,WAAW,CAAC,qBAAqB;oBACtC;wBACI,MAAM,QAAQ,GAAG,MAAM,CAAC,IAAI,CAAC,cAAc,CAAC,sBAAc,EAAE,IAAI,CAAC,CAAC,CAAC;wBACnE,MAAM,WAAW,GAAG,QAAQ,CAAC,UAAU,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,gBAAgB,CAAC,CAAC;wBAC7E,gBAAgB,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;wBACnC,UAAU,CAAC,QAAQ,CAAC,GAAG,WAAW,CAAC;wBACnC,SAAS;qBACZ;gBACD,KAAK,WAAW,CAAC,cAAc,CAAC;gBAChC,KAAK,WAAW,CAAC,eAAe,CAAC;gBACjC,KAAK,WAAW,CAAC,eAAe;oBAChC;wBACI,MAAM,QAAQ,GAAG,MAAM,CAAC,IAAI,CAAC,cAAc,CAAC,sBAAc,EAAE,IAAI,CAAC,CAAC,CAAC;wBACnE,MAAM,OAAO,GAAG,UAAU,CAAC,QAAQ,CAAC,CAAC;wBACrC,IAAA,qBAAM,EAAC,OAAO,KAAK,SAAS,EAAE,KAAK,CAAC,4BAA4B,CAAC,CAAC;wBAClE,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;wBACvB,SAAS;qBACZ;gBACD,KAAK,WAAW,CAAC,WAAW,CAAC;gBAC7B,KAAK,WAAW,CAAC,aAAa,CAAC;gBAC/B,KAAK,WAAW,CAAC,cAAc,CAAC;gBAChC,KAAK,WAAW,CAAC,cAAc;oBAC/B;wBACI,MAAM,GAAG,GAAG,QAAQ,CAAC,UAAU,CAAC,MAAM,EAAE,IAAI,EAAE,KAAK,CAAC,gBAAgB,CAAC,CAAC;wBACtE,gBAAgB,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;wBAC3B,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;wBACnB,SAAS;qBACZ;gBACD,KAAK,WAAW,CAAC,WAAW,CAAC;gBAC7B,KAAK,WAAW,CAAC,aAAa,CAAC;gBAC/B,KAAK,WAAW,CAAC,cAAc,CAAC;gBAChC,KAAK,WAAW,CAAC,cAAc,CAAC;gBAChC,KAAK,WAAW,CAAC,cAAc;oBAC/B;wBACI,QAAQ,CAAC,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,MAAM,EAAE,cAAc,CAAC,sBAAc,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;wBAClF,SAAS;qBACZ;gBACD,mBAAmB;gBACnB,KAAK,WAAW,CAAC,IAAI;oBACrB;wBACI,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;wBACjB,SAAS;qBACZ;gBACD,KAAK,WAAW,CAAC,KAAK,CAAC;gBACvB,KAAK,WAAW,CAAC,MAAM,CAAC;gBACxB,KAAK,WAAW,CAAC,MAAM,CAAC;gBACxB,KAAK,WAAW,CAAC,MAAM,CAAC;gBACxB,KAAK,WAAW,CAAC,IAAI,CAAC;gBACtB,KAAK,WAAW,CAAC,KAAK,CAAC;gBACvB,KAAK,WAAW,CAAC,KAAK,CAAC;gBACvB,KAAK,WAAW,CAAC,KAAK;oBACtB;wBACI,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,cAAc,CAAC,sBAAc,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;wBACjE,SAAS;qBACZ;gBACD,KAAK,WAAW,CAAC,QAAQ;oBACrB,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBACpB,SAAS;gBACb,KAAK,WAAW,CAAC,SAAS;oBACtB,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;oBACrB,SAAS;gBACb,KAAK,cAAc,CAAC,IAAI,CAAC;gBACzB,KAAK,cAAc,CAAC,GAAG;oBACnB,kEAAkE;oBAClE,+EAA+E;oBAC/E,kFAAkF;oBAClF,0BAA0B;oBAC1B,QAAQ,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;oBAExB,wEAAwE;oBACxE,gFAAgF;oBAChF,wBAAwB;oBACxB,SAAS;gBACb;oBACI,MAAM,IAAI,KAAK,CAAC,iBAAiB,IAAI,EAAE,CAAC,CAAC;aAChD;SACJ;QAED,6CAA6C;QAC7C,IAAA,qBAAM,EAAC,QAAQ,KAAK,IAAI,CAAC,QAAQ,EAAE,KAAK,CAAC,0CAA0C,CAAC,CAAC;QAErF;;WAEG;QACH,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,KAAK,MAAM,EAAE,IAAI,gBAAgB,EAAE;YAC/B,MAAM,IAAI,EAAE,CAAC,MAAM,GAAG,EAAE,CAAC,QAAQ,GAAG,CAAC,CAAC;SACzC;QACD,MAAM,YAAY,GAAG,IAAI,UAAU,CAAC,MAAM,CAAC,CAAC;QAE5C,MAAM,GAAG,CAAC,CAAC;QACX,MAAM,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC;QAC5B,IAAA,qBAAM,EAAC,KAAK,CAAC,UAAU,KAAK,CAAC,EAAE,KAAK,CAAC,kCAAkC,CAAC,CAAC;QAEzE,KAAK,MAAM,EAAE,IAAI,gBAAgB,EAAE;YAC/B,KAAK,IAAI,EAAE,GAAG,EAAE,CAAC,QAAQ,EAAE,EAAE,GAAG,EAAE,CAAC,MAAM,EAAE,EAAE,EAAE,EAAE;gBAC7C,YAAY,CAAC,MAAM,CAAC,GAAG,KAAK,CAAC,EAAE,CAAC,CAAC;gBACjC,MAAM,EAAE,CAAC;aACZ;YACD,YAAY,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YACzB,MAAM,EAAE,CAAC;SACZ;QAED,IAAI,MAAM,KAAK,YAAY,CAAC,MAAM,EAAE;YAChC,mDAAmD;YACnD,MAAM,MAAM,GAAG,IAAA,iCAAkB,EAAC,YAAY,EAAE,OAAO,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;YACvF,IAAA,qBAAM,EAAC,MAAM,CAAC,MAAM,KAAK,gBAAgB,CAAC,MAAM,GAAG,CAAC,EAAE,KAAK,CAAC,kCAAkC,CAAC,CAAC;YAChG,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,gBAAgB,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gBAC9C,gBAAgB,CAAC,CAAC,CAAC,CAAC,OAAO,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;aAC3C;SACJ;aAAM;YACH,gBAAgB;YAChB,MAAM,CAAC,cAAc,CAAC,EAAE,SAAS,EAAE,oBAAoB,EAAE,CAAC,CAAC;YAC3D,KAAK,MAAM,EAAE,IAAI,gBAAgB,EAAE;gBAC/B,IAAA,qBAAM,EAAC,EAAE,CAAC,OAAO,KAAK,IAAA,iCAAkB,EAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC,QAAQ,EAAE,EAAE,CAAC,MAAM,CAAC,EAAE,OAAO,CAAC,EACrF,KAAK,CAAC,UAAU,CAAC,CAAC;aACzB;SACJ;IACL,CAAC;CACJ;AA9PD,4BA8PC;AAEA;;;GAGG;AACJ,MAAa,WAAY,SAAQ,QAAQ;IACrC,MAAM,CAAC,IAAI,CAAC,MAAkB,EAAE,MAAwB;QACpD,MAAM,OAAO,GAAG,IAAI,WAAW,EAAE,CAAC;QAClC,OAAO,CAAC,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QAC7B,IAAA,qBAAM,EAAC,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,4CAA4C,CAAC,CAAC;QACvE,OAAO,OAAO,CAAC;IACnB,CAAC;CACJ;AAPD,kCAOC;AAED,SAAgB,sBAAsB,CAAC,IAAe;IAClD,MAAM,WAAW,GAAG,IAAsB,CAAC;IAC3C,IAAI,WAAW,CAAC,cAAc,EAAE;QAC5B,OAAO,WAAW,CAAC,OAAO,CAAC;KAC9B;AACL,CAAC;AALD,wDAKC;AAED,SAAgB,iBAAiB,CAC7B,IAAe,EACf,OAAe;IAEf,MAAM,WAAW,GAAG,IAAsB,CAAC;IAC3C,IAAI,WAAW,CAAC,cAAc,EAAE;QAC5B,OAAO,WAAW,CAAC,OAAO,CAAC;KAC9B;IACD,yBAAyB,CAAC,IAAI,EAAE,UAAU,EAAE,OAAO,CAAC,CAAC;AACzD,CAAC;AATD,8CASC;AAED,SAAgB,sBAAsB,CAClC,IAAe,EACf,OAAe;IAEf,IAAI,IAAI,YAAY,QAAQ,EAAE;QAC1B,OAAO;KACV;IACD,yBAAyB,CAAC,IAAI,EAAE,UAAU,EAAE,OAAO,CAAC,CAAC;AACzD,CAAC;AARD,wDAQC;AAED,SAAgB,sBAAsB,CAClC,IAAe,EACf,OAAe;IAEf,IAAI,IAAI,YAAY,QAAQ,EAAE;QAC1B,OAAO;KACV;IACD,yBAAyB,CAAC,IAAI,EAAE,UAAU,EAAE,OAAO,CAAC,CAAC;AACzD,CAAC;AARD,wDAQC;AAED,SAAgB,oBAAoB,CAChC,IAAe,EACf,OAAe;IAEf,IAAI,OAAO,IAAI,KAAK,QAAQ,EAAE;QAC1B,OAAO;KACV;IACD,yBAAyB,CAAC,IAAI,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;AACvD,CAAC;AARD,oDAQC;AAED,SAAgB,kBAAkB,CAC9B,IAAe,EACf,OAAe;IAEf,IAAI,OAAO,IAAI,KAAK,SAAS,EAAE;QAC3B,OAAO;KACV;IACD,yBAAyB,CAAC,IAAI,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC;AACxD,CAAC;AARD,gDAQC;AAED,SAAS,yBAAyB,CAC9B,IAAe,EACf,gBAA0B,EAC1B,OAAe;IAEf,MAAM,IAAI,gCAAiB,CACvB,6BAA6B,OAAO,EAAE,EACtC,oCAAe,CAAC,uBAAuB,EACvC;QACI,QAAQ,EAAE,WAAW,CAAC,IAAI,CAAC;QAC3B,gBAAgB;QAChB,aAAa,EAAb,2BAAa;KAChB,CAAC,CAAC;AACX,CAAC;AAED,SAAS,WAAW,CAAC,KAAgB;IACjC,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE;QAC3B,OAAO,QAAQ,CAAC;KACnB;SAAM,IAAI,KAAK,YAAY,QAAQ,EAAE;QAClC,OAAO,UAAU,CAAC;KACrB;SAAM,IAAI,KAAK,YAAY,QAAQ,EAAE;QAClC,OAAO,UAAU,CAAC;KACrB;SAAM,IAAI,OAAO,KAAK,KAAK,SAAS,EAAE;QACnC,OAAO,SAAS,CAAC;KACpB;SAAM,IAAI,KAAK,CAAC,cAAc,EAAE;QAC7B,OAAO,QAAQ,CAAC;KACnB;IACD,OAAO,aAAa,CAAC;AACzB,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\n/**\n * Data representation which is followed(zipIt Protocol) here is described in this document:\n * https://microsoft.sharepoint-df.com/:w:/t/ODSPFileStore/ER06b64K_XdDjEyAKl-UT60BJiId39SCVkYSyo_2pvH9gQ?e=KYQ0c5\n*/\n\nimport { assert, Uint8ArrayToArrayBuffer, Uint8ArrayToString } from \"@fluidframework/common-utils\";\nimport { ITelemetryLogger } from \"@fluidframework/common-definitions\";\nimport { NonRetryableError } from \"@fluidframework/driver-utils\";\nimport { DriverErrorType } from \"@fluidframework/driver-definitions\";\nimport { ReadBuffer } from \"./ReadBufferUtils\";\nimport { pkgVersion as driverVersion } from \"./packageVersion\";\n\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 * Control codes used by tree serialization / decentralization code. Same as on server. These can be found on\n * filestore code on server too at above link.\n */\nexport enum MarkerCodes {\n    BoolTrue = 11,  // value = true\n    BoolFalse = 12, // value = false\n\n    StringEmpty = 13,       // value = \"\"\n    String8Length = 14,     // unsigned-8-bit little-endian length, follows by UTF-8 bytes of length\n    String16Length = 15,    // unsigned-16-bit little-endian length, follows by UTF-8 bytes of length\n    String32Length = 16,    // unsigned-32-bit little-endian length, follows by UTF-8 bytes of length\n\n    ConstString8Id = 17,     // unsigned-8-bit little-endian const string id follows\n    ConstString16Id = 18,    // unsigned-16-bit little-endian const string id follows\n    ConstString32Id = 19,    // unsigned-32-bit little-endian const string id follows\n    ConstStringDeclare = 20, // Code for declaring a const string with size <= 1 byte\n    ConstStringDeclareBig = 21, // Code for declaring a const string with size > 1 byte. It is represented in 4 bytes.\n\n    Int0 = 1,   // value = 0\n    UInt8 = 3,  // unsigned-8-bit little-endian follows\n    UInt16 = 5, // unsigned-16-bit little-endian follows\n    UInt32 = 7, // unsigned-32-bit little-endian follows\n    UInt64 = 9, // unsigned-64-bit little-endian follows\n    Int8 = 2,   // signed-8-bit little-endian follows\n    Int16 = 4,  // signed-16-bit little-endian follows\n    Int32 = 6,  // signed-32-bit little-endian follows\n    Int64 = 8,  // signed-64-bit little-endian follows\n\n    BinaryEmpty = 32,        // value = byte[]\n    BinarySingle8 = 33,      // unsigned-8-bit little-endian length, follows by bytes of length\n    BinarySingle16 = 34,     // unsigned-16-bit little-endian length, follows by bytes of length\n    BinarySingle32 = 35,     // unsigned-32-bit little-endian length, follows by bytes of length\n    BinarySingle64 = 36,     // unsigned-64-bit little-endian length, follows by bytes of length\n}\n\n/**\n * Control codes used by tree serialization / decentralization code. They mark the start of sections.\n */\nexport enum MarkerCodesStart {\n    \"list\" = 49,\n    \"set\" = 51,\n}\n\n/**\n * Control codes used by tree serialization / decentralization code. They mark the end of sections.\n */\nexport enum MarkerCodesEnd {\n    \"list\" = 50,\n    \"set\" = 52,\n}\n\n/**\n * This contains mapping of Marker Codes to number of bytes in which the corresponding data\n * will be stored.\n*/\nexport const codeToBytesMap = {\n    // Integer code to bytes\n    1: 0,\n    2: 1,\n    3: 1,\n    4: 2,\n    5: 2,\n    6: 4,\n    7: 4,\n    8: 8,\n    9: 8,\n\n    // String code to Bytes\n    13: 0,\n    14: 1,\n    15: 2,\n    16: 4,\n\n    17: 1,\n    18: 2,\n    19: 4,\n\n    20: 1,\n    21: 4,\n\n    // Binary code to bytes\n    32: 0,\n    33: 1,\n    34: 2,\n    35: 4,\n    36: 8,\n};\n\nexport function getValueSafely(map: { [index: number]: number; }, key: number) {\n    const val = map[key];\n    assert(val !== undefined, 0x287 /* key must exist in the map */);\n    return val;\n}\n\nexport function getNodeProps(node: NodeCore) {\n    const res: Record<string, NodeTypes> = {};\n    for (const [keyNode, valueNode] of node.iteratePairs()) {\n        const id = getStringInstance(keyNode, \"keynode should be a string\");\n        res[id] = valueNode;\n    }\n    return res;\n}\n\nexport function iteratePairs<T>(it: IterableIterator<T>) {\n    const res: IterableIterator<[T, T]> = {\n        next: () => {\n            const a = it.next();\n            if (a.done) {\n                return { value: undefined, done: true };\n            }\n            const b = it.next();\n            assert(b.done !== true, 0x22b /* \"Should be a pair\" */);\n            return { value: [a.value, b.value], done: b.done };\n        },\n        [Symbol.iterator]: () => { return res; },\n    };\n    return res;\n}\n\n/**\n * Helper function that returns iterator from an object\n * @param obj - object that supports iteration\n */\nexport function iterate<T>(obj: { [Symbol.iterator]: () => IterableIterator<T>; }) {\n    return obj[Symbol.iterator]();\n}\n\n/**\n * Base class to represent binary blob element.\n * Binary blob is one of three types supported as a leaf node of a tree.\n * Note: concrete implementations (derived classes) are not exposed from this module\n */\nexport abstract class BlobCore {\n    public abstract get buffer(): Uint8Array;\n    public abstract get arrayBuffer(): ArrayBufferLike;\n\n    /**\n     * Represents a blob.\n     */\n    constructor() {}\n}\n\n/**\n * \"deep copy\" blob, holds to binary data passed in\n * It is called deep copy as a counter-part to BlobShallowCopy, which\n * is a reference to underlying binary stream (ReadBuffer).\n*/\nclass BlobDeepCopy extends BlobCore {\n    /**\n     * Represents a deep copy of the blob.\n     * @param data - Data array of the blob\n     */\n    constructor(protected readonly data: Uint8Array) {\n        super();\n    }\n\n    public get buffer() {\n        return this.data;\n    }\n\n    public get arrayBuffer(): ArrayBufferLike {\n        return Uint8ArrayToArrayBuffer(this.buffer);\n    }\n\n    public static read(buffer: ReadBuffer, lengthLen: number): BlobCore {\n        const length = buffer.read(lengthLen);\n        const data = new Uint8Array(length);\n        for (let counter = 0; counter < length; counter++) {\n            data[counter] = buffer.read();\n        }\n        return new BlobDeepCopy(data);\n    }\n}\n\n/**\n * Shallow copy blob, keeps a reference to portion of ReadBuffer\n * it was constructed from. It takes much less memory compared to BlobDeepCopy\n */\n export class BlobShallowCopy extends BlobCore {\n    /**\n     * Represents a shallow copy of the blob. It is not a separate blob, just reference to original blobs.\n     * @param data - Data array of the blob\n     * @param start - Start point of the blob in the buffer.\n     * @param end - End point of the blob in the buffer.\n     */\n    constructor(\n        protected data: Uint8Array,\n        protected start: number,\n        protected end: number,\n    ) {\n        super();\n    }\n\n    public get buffer() {\n        return this.data.subarray(this.start, this.end);\n    }\n\n    // Equivalent to Uint8ArrayToArrayBuffer(this.buffer)\n    public get arrayBuffer(): ArrayBufferLike {\n        const offset = this.data.byteOffset;\n        return this.data.buffer.slice(this.start + offset, this.end + offset);\n    }\n\n    public static read(buffer: ReadBuffer, lengthLen: number): BlobCore {\n        const length = buffer.read(lengthLen);\n        const pos = buffer.pos;\n        buffer.skip(length);\n        return new BlobShallowCopy(buffer.buffer, pos, pos + length);\n    }\n}\n\nexport const addStringProperty =\n    (node: NodeCore, a: string, b: string) => {\n        node.addDictionaryString(a); node.addString(b);\n    };\nexport const addDictionaryStringProperty =\n    (node: NodeCore, a: string, b: string) => {\n        node.addDictionaryString(a); node.addString(b);\n    };\nexport const addNumberProperty = (node: NodeCore, a: string, b: number) => {\n    node.addDictionaryString(a); node.addNumber(b);\n};\nexport const addBoolProperty = (node: NodeCore, a: string, b: boolean) => {\n    node.addDictionaryString(a); node.addBool(b);\n};\n\nexport interface IStringElement {\n    content: string;\n    dictionary: boolean;\n    _stringElement: true;\n}\n\nexport interface IStringElementInternal extends Omit<IStringElement, \"content\"> {\n    content?: string;\n    startPos: number;\n    endPos: number;\n}\n\n/**\n * Three leaf types supported by tree:\n * 1. Node (sub-tree)\n * 2. binary blob\n * 3. integer\n * 4. boolean\n */\nexport type NodeTypes = NodeCore | BlobCore | number | boolean | IStringElement;\n\nexport type NodeCoreTypes = \"list\" | \"set\";\n\n/**\n * Node - node in the tree (non-leaf element of the tree)\n */\nexport class NodeCore {\n    // It is an array of nodes.\n    private readonly children: NodeTypes[] = [];\n    public get nodes() {\n        return this.children;\n    }\n\n    constructor(public type: NodeCoreTypes = \"set\") {}\n\n    public [Symbol.iterator]() {\n        return this.children[Symbol.iterator]();\n    }\n\n    public iteratePairs() {\n        assert((this.length % 2) === 0, 0x22c /* \"reading pairs\" */);\n        return iteratePairs(iterate(this));\n    }\n\n    public get length() { return this.children.length; }\n\n    public get(index: number) { return this.children[index]; }\n\n    public getString(index: number): string {\n        const node = this.children[index];\n        return getStringInstance(node, \"getString should return string\");\n    }\n\n    public getMaybeString(index: number) {\n        const node = this.children[index];\n        return getMaybeStringInstance(node);\n    }\n\n    public getBlob(index: number): BlobCore {\n        const node = this.children[index];\n        assertBlobCoreInstance(node, \"getBlob should return a blob\");\n        return node;\n    }\n\n    public getNode(index: number): NodeCore {\n        const node = this.children[index];\n        assertNodeCoreInstance(node, \"getNode should return a node\");\n        return node;\n    }\n\n    public getNumber(index: number): number {\n        const node = this.children[index];\n        assertNumberInstance(node, \"getNumber should return a number\");\n        return node;\n    }\n\n    public getBool(index: number): boolean {\n        const node = this.children[index];\n        assertBoolInstance(node, \"getBool should return a boolean\");\n        return node;\n    }\n\n    public addNode(type?: NodeCoreTypes): NodeCore {\n        const node = new NodeCore(type);\n        this.children.push(node);\n        return node;\n    }\n\n    public addBlob(blob: Uint8Array) {\n        this.children.push(new BlobDeepCopy(blob));\n    }\n\n    public addDictionaryString(payload: string) {\n        this.children.push({\n            content: payload,\n            dictionary: true,\n            _stringElement: true,\n        });\n    }\n\n    public addString(payload: string) {\n        this.children.push({\n            content: payload,\n            dictionary: false,\n            _stringElement: true,\n        });\n    }\n\n    public addNumber(payload: number | undefined) {\n        assert(Number.isInteger(payload), 0x231 /* \"Number should be an integer\" */);\n        assert(payload !== undefined && payload >= 0, 0x232 /* \"Payload should not be negative\" */);\n        this.children.push(payload);\n    }\n\n    public addBool(payload: boolean) {\n        this.children.push(payload);\n    }\n\n    // Can we do more efficiently here, without extra objects somehow??\n    private static readString(buffer: ReadBuffer, code: number, dictionary: boolean) {\n        const lengthLen = getValueSafely(codeToBytesMap, code);\n        const length = buffer.read(lengthLen);\n        const startPos = buffer.pos;\n        buffer.skip(length);\n        const result: IStringElementInternal = {\n            // Note: Setting here property 'content: undefined' makes code substantially slower!\n            dictionary,\n            _stringElement: true,\n            startPos,\n            endPos: buffer.pos,\n        };\n\n        // We are lying here in terms of presence of `content` property.\n        // This will be addressed at the bottom of NodeCore.load() by resolving all strings at once!\n        // It's equivalent (but much slower!) to do it here via\n        // result.content = Uint8ArrayToString(buffer.buffer.subarray(startPos, buffer.pos), \"utf-8\");\n        return result as IStringElementInternal & IStringElement;\n    }\n\n    /**\n     * Load and parse the buffer into a tree.\n     * @param buffer - buffer to read from.\n     */\n    protected load(buffer: ReadBuffer, logger: ITelemetryLogger) {\n        const stack: NodeTypes[][] = [];\n        const stringsToResolve: IStringElementInternal[] = [];\n        const dictionary: IStringElement[] = [];\n\n        let children = this.children;\n        for (;!buffer.eof;) {\n            const code = buffer.read();\n            switch (code) {\n                case MarkerCodesStart.list:\n                case MarkerCodesStart.set: {\n                    const childValue = new NodeCore(code === MarkerCodesStart.set ? \"set\" : \"list\");\n                    children.push(childValue);\n                    stack.push(children);\n                    children = childValue.children;\n                    continue;\n                }\n                case MarkerCodes.ConstStringDeclare:\n                case MarkerCodes.ConstStringDeclareBig:\n                {\n                    const stringId = buffer.read(getValueSafely(codeToBytesMap, code));\n                    const constString = NodeCore.readString(buffer, code, true /* dictionary */);\n                    stringsToResolve.push(constString);\n                    dictionary[stringId] = constString;\n                    continue;\n                }\n                case MarkerCodes.ConstString8Id:\n                case MarkerCodes.ConstString16Id:\n                case MarkerCodes.ConstString32Id:\n                {\n                    const stringId = buffer.read(getValueSafely(codeToBytesMap, code));\n                    const content = dictionary[stringId];\n                    assert(content !== undefined, 0x3de /* const string not found */);\n                    children.push(content);\n                    continue;\n                }\n                case MarkerCodes.StringEmpty:\n                case MarkerCodes.String8Length:\n                case MarkerCodes.String16Length:\n                case MarkerCodes.String32Length:\n                {\n                    const str = NodeCore.readString(buffer, code, false /* dictionary */);\n                    stringsToResolve.push(str);\n                    children.push(str);\n                    continue;\n                }\n                case MarkerCodes.BinaryEmpty:\n                case MarkerCodes.BinarySingle8:\n                case MarkerCodes.BinarySingle16:\n                case MarkerCodes.BinarySingle32:\n                case MarkerCodes.BinarySingle64:\n                {\n                    children.push(BlobShallowCopy.read(buffer, getValueSafely(codeToBytesMap, code)));\n                    continue;\n                }\n                // If integer is 0.\n                case MarkerCodes.Int0:\n                {\n                    children.push(0);\n                    continue;\n                }\n                case MarkerCodes.UInt8:\n                case MarkerCodes.UInt16:\n                case MarkerCodes.UInt32:\n                case MarkerCodes.UInt64:\n                case MarkerCodes.Int8:\n                case MarkerCodes.Int16:\n                case MarkerCodes.Int32:\n                case MarkerCodes.Int64:\n                {\n                    children.push(buffer.read(getValueSafely(codeToBytesMap, code)));\n                    continue;\n                }\n                case MarkerCodes.BoolTrue:\n                    children.push(true);\n                    continue;\n                case MarkerCodes.BoolFalse:\n                    children.push(false);\n                    continue;\n                case MarkerCodesEnd.list:\n                case MarkerCodesEnd.set:\n                    // Note: We are not checking that end marker matches start marker.\n                    // I.e. that we do not have a case where we start a 'list' but end with a 'set'\n                    // Checking it would require more state tracking that seems not very useful, given\n                    // our code does not care.\n                    children = stack.pop()!;\n\n                    // To my surprise, checking children !== undefined adds measurable cost!\n                    // We will rely on children.push() crashing in case of mismatch, and check below\n                    // (outside of the loop)\n                    continue;\n                default:\n                    throw new Error(`Invalid code: ${code}`);\n            }\n        }\n\n        // This also ensures that stack.length === 0.\n        assert(children === this.children, 0x3e7 /* Unpaired start/end list/set markers! */);\n\n        /**\n         * Process all the strings at once!\n         */\n        let length = 0;\n        for (const el of stringsToResolve) {\n            length += el.endPos - el.startPos + 1;\n        }\n        const stringBuffer = new Uint8Array(length);\n\n        length = 0;\n        const input = buffer.buffer;\n        assert(input.byteOffset === 0, 0x3e8 /* code below assumes no offset */);\n\n        for (const el of stringsToResolve) {\n            for (let it = el.startPos; it < el.endPos; it++) {\n                stringBuffer[length] = input[it];\n                length++;\n            }\n            stringBuffer[length] = 0;\n            length++;\n        }\n\n        if (length === stringBuffer.length) {\n            // All is good, we expect all the cases to get here\n            const result = Uint8ArrayToString(stringBuffer, \"utf-8\").split(String.fromCharCode(0));\n            assert(result.length === stringsToResolve.length + 1, 0x3e9 /* String content has \\0 chars! */);\n            for (let i = 0; i < stringsToResolve.length; i++) {\n                stringsToResolve[i].content = result[i];\n            }\n        } else {\n            // Recovery code\n            logger.sendErrorEvent({ eventName: \"StringParsingError\" });\n            for (const el of stringsToResolve) {\n                assert(el.content === Uint8ArrayToString(input.subarray(el.startPos, el.endPos), \"utf-8\"),\n                    0x3ea /* test */);\n            }\n        }\n    }\n}\n\n /**\n  * TreeBuilder - Root of the tree.\n  * Provides loading and serialization capabilities.\n  */\nexport class TreeBuilder extends NodeCore {\n    static load(buffer: ReadBuffer, logger: ITelemetryLogger): TreeBuilder {\n        const builder = new TreeBuilder();\n        builder.load(buffer, logger);\n        assert(buffer.eof, 0x233 /* \"Unexpected data at the end of buffer\" */);\n        return builder;\n    }\n}\n\nexport function getMaybeStringInstance(node: NodeTypes): string | undefined {\n    const maybeString = node as IStringElement;\n    if (maybeString._stringElement) {\n        return maybeString.content;\n    }\n}\n\nexport function getStringInstance(\n    node: NodeTypes,\n    message: string,\n): string {\n    const maybeString = node as IStringElement;\n    if (maybeString._stringElement) {\n        return maybeString.content;\n    }\n    throwBufferParseException(node, \"BlobCore\", message);\n}\n\nexport function assertBlobCoreInstance(\n    node: NodeTypes,\n    message: string,\n): asserts node is BlobCore {\n    if (node instanceof BlobCore) {\n        return;\n    }\n    throwBufferParseException(node, \"BlobCore\", message);\n}\n\nexport function assertNodeCoreInstance(\n    node: NodeTypes,\n    message: string,\n): asserts node is NodeCore {\n    if (node instanceof NodeCore) {\n        return;\n    }\n    throwBufferParseException(node, \"NodeCore\", message);\n}\n\nexport function assertNumberInstance(\n    node: NodeTypes,\n    message: string,\n): asserts node is number {\n    if (typeof node === \"number\") {\n        return;\n    }\n    throwBufferParseException(node, \"Number\", message);\n}\n\nexport function assertBoolInstance(\n    node: NodeTypes,\n    message: string,\n): asserts node is boolean {\n    if (typeof node === \"boolean\") {\n        return;\n    }\n    throwBufferParseException(node, \"Boolean\", message);\n}\n\nfunction throwBufferParseException(\n    node: NodeTypes,\n    expectedNodeType: NodeType,\n    message: string,\n): never {\n    throw new NonRetryableError(\n        `Buffer parsing exception: ${message}`,\n        DriverErrorType.incorrectServerResponse,\n        {\n            nodeType: getNodeType(node),\n            expectedNodeType,\n            driverVersion,\n        });\n}\n\nfunction getNodeType(value: NodeTypes): NodeType {\n    if (typeof value === \"number\") {\n        return \"Number\";\n    } else if (value instanceof BlobCore) {\n        return \"BlobCore\";\n    } else if (value instanceof NodeCore) {\n        return \"NodeCore\";\n    } else if (typeof value === \"boolean\") {\n        return \"Boolean\";\n    } else if (value._stringElement) {\n        return \"String\";\n    }\n    return \"UnknownType\";\n}\n\ntype NodeType = \"Number\" | \"BlobCore\" | \"NodeCore\" | \"Boolean\" | \"UnknownType\" | \"String\";\n"]}

package/lib/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/lib/ReadBufferUtils.js

@@ -44,6 +44,7 @@ export class ReadBuffer {
     skip(length) {
         assert(length >= 0, 0x224 /* "Skip length should be positive" */);
         this.index += length;
+        assert(this.index <= this.data.length, 0x3dc /* skipping past size of buffer */);
     }
 }
 //# sourceMappingURL=ReadBufferUtils.js.map

package/lib/ReadBufferUtils.js.map

@@ -1 +1 @@
-{"version":3,"file":"ReadBufferUtils.js","sourceRoot":"","sources":["../src/ReadBufferUtils.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,8BAA8B,CAAC;AAEtD;;;GAGG;AACH,MAAM,OAAO,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,MAAM,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,MAAM,CAAC,MAAM,IAAI,CAAC,EAAE,KAAK,CAAC,sCAAsC,CAAC,CAAC;QAClE,IAAI,CAAC,KAAK,IAAI,MAAM,CAAC;IACzB,CAAC;CACJ","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,OAAO,EAAE,MAAM,EAAE,MAAM,8BAA8B,CAAC;AAEtD;;;GAGG;AACH,MAAM,OAAO,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,MAAM,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,MAAM,CAAC,MAAM,IAAI,CAAC,EAAE,KAAK,CAAC,sCAAsC,CAAC,CAAC;QAClE,IAAI,CAAC,KAAK,IAAI,MAAM,CAAC;QACrB,MAAM,CAAC,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,kCAAkC,CAAC,CAAC;IACrF,CAAC;CACJ","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/lib/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/lib/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"}