npm - @fluidframework/odsp-driver - Versions diffs - 2.0.0-internal.2.1.2 → 2.0.0-internal.2.2.0 - Mend

@fluidframework/odsp-driver 2.0.0-internal.2.1.2 → 2.0.0-internal.2.2.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (83) hide show

package/.eslintrc.js +1 -1
package/dist/compactSnapshotParser.d.ts +1 -2
package/dist/compactSnapshotParser.d.ts.map +1 -1
package/dist/compactSnapshotParser.js +6 -2
package/dist/compactSnapshotParser.js.map +1 -1
package/dist/fetchSnapshot.d.ts.map +1 -1
package/dist/fetchSnapshot.js +13 -18
package/dist/fetchSnapshot.js.map +1 -1
package/dist/localOdspDriver/localOdspDeltaStorageService.d.ts +17 -0
package/dist/localOdspDriver/localOdspDeltaStorageService.d.ts.map +1 -0
package/dist/localOdspDriver/localOdspDeltaStorageService.js +35 -0
package/dist/localOdspDriver/localOdspDeltaStorageService.js.map +1 -0
package/dist/localOdspDriver/localOdspDocumentService.d.ts +1 -0
package/dist/localOdspDriver/localOdspDocumentService.d.ts.map +1 -1
package/dist/localOdspDriver/localOdspDocumentService.js +5 -2
package/dist/localOdspDriver/localOdspDocumentService.js.map +1 -1
package/dist/odspDeltaStorageService.d.ts +0 -1
package/dist/odspDeltaStorageService.d.ts.map +1 -1
package/dist/odspDeltaStorageService.js +4 -20
package/dist/odspDeltaStorageService.js.map +1 -1
package/dist/odspDocumentDeltaConnection.js +1 -1
package/dist/odspDocumentDeltaConnection.js.map +1 -1
package/dist/odspDocumentService.d.ts.map +1 -1
package/dist/odspDocumentService.js +9 -2
package/dist/odspDocumentService.js.map +1 -1
package/dist/odspUtils.d.ts +4 -0
package/dist/odspUtils.d.ts.map +1 -1
package/dist/odspUtils.js +32 -1
package/dist/odspUtils.js.map +1 -1
package/dist/packageVersion.d.ts +1 -1
package/dist/packageVersion.js +1 -1
package/dist/packageVersion.js.map +1 -1
package/dist/zipItDataRepresentationUtils.d.ts +17 -2
package/dist/zipItDataRepresentationUtils.d.ts.map +1 -1
package/dist/zipItDataRepresentationUtils.js +15 -2
package/dist/zipItDataRepresentationUtils.js.map +1 -1
package/lib/compactSnapshotParser.d.ts +1 -2
package/lib/compactSnapshotParser.d.ts.map +1 -1
package/lib/compactSnapshotParser.js +6 -2
package/lib/compactSnapshotParser.js.map +1 -1
package/lib/fetchSnapshot.d.ts.map +1 -1
package/lib/fetchSnapshot.js +14 -19
package/lib/fetchSnapshot.js.map +1 -1
package/lib/localOdspDriver/localOdspDeltaStorageService.d.ts +17 -0
package/lib/localOdspDriver/localOdspDeltaStorageService.d.ts.map +1 -0
package/lib/localOdspDriver/localOdspDeltaStorageService.js +31 -0
package/lib/localOdspDriver/localOdspDeltaStorageService.js.map +1 -0
package/lib/localOdspDriver/localOdspDocumentService.d.ts +1 -0
package/lib/localOdspDriver/localOdspDocumentService.d.ts.map +1 -1
package/lib/localOdspDriver/localOdspDocumentService.js +6 -3
package/lib/localOdspDriver/localOdspDocumentService.js.map +1 -1
package/lib/odspDeltaStorageService.d.ts +0 -1
package/lib/odspDeltaStorageService.d.ts.map +1 -1
package/lib/odspDeltaStorageService.js +5 -21
package/lib/odspDeltaStorageService.js.map +1 -1
package/lib/odspDocumentDeltaConnection.js +1 -1
package/lib/odspDocumentDeltaConnection.js.map +1 -1
package/lib/odspDocumentService.d.ts.map +1 -1
package/lib/odspDocumentService.js +10 -3
package/lib/odspDocumentService.js.map +1 -1
package/lib/odspUtils.d.ts +4 -0
package/lib/odspUtils.d.ts.map +1 -1
package/lib/odspUtils.js +28 -0
package/lib/odspUtils.js.map +1 -1
package/lib/packageVersion.d.ts +1 -1
package/lib/packageVersion.js +1 -1
package/lib/packageVersion.js.map +1 -1
package/lib/zipItDataRepresentationUtils.d.ts +17 -2
package/lib/zipItDataRepresentationUtils.d.ts.map +1 -1
package/lib/zipItDataRepresentationUtils.js +15 -2
package/lib/zipItDataRepresentationUtils.js.map +1 -1
package/package.json +19 -14
package/prettier.config.cjs +8 -0
package/src/compactSnapshotParser.ts +16 -12
package/src/fetchSnapshot.ts +29 -24
package/src/localOdspDriver/localOdspDeltaStorageService.ts +46 -0
package/src/localOdspDriver/localOdspDocumentService.ts +9 -3
package/src/odspDeltaStorageService.ts +5 -22
package/src/odspDocumentDeltaConnection.ts +1 -1
package/src/odspDocumentService.ts +9 -2
package/src/odspUtils.ts +37 -0
package/src/packageVersion.ts +1 -1
package/src/zipItDataRepresentationUtils.ts +18 -3

package/dist/zipItDataRepresentationUtils.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"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;QACD,IAAA,qBAAM,EAAC,MAAM,KAAK,YAAY,CAAC,MAAM,EAAE,KAAK,CAAC,sBAAsB,CAAC,CAAC;QAErE,MAAM,MAAM,GAAG,IAAA,iCAAkB,EAAC,YAAY,EAAE,OAAO,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;QACvF,IAAI,MAAM,CAAC,MAAM,KAAK,gBAAgB,CAAC,MAAM,GAAG,CAAC,EAAE;YAC/C,mDAAmD;YACnD,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,+BAA+B;YAC/B,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;AA/PD,4BA+PC;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 assert(length === stringBuffer.length, 0x418 / properly encoded /);\n\n const result = Uint8ArrayToString(stringBuffer, \"utf-8\").split(String.fromCharCode(0));\n if (result.length === stringsToResolve.length + 1) {\n // All is good, we expect all the cases to get here\n for (let i = 0; i < stringsToResolve.length; i++) {\n stringsToResolve[i].content = result[i];\n }\n } else {\n // String content has \\0 chars!\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"]}
1	+ {"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;AAC/D,2CAAsC;AAEtC,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,CAAC,gBAAgB,EAAE,iBAAiB,CAAC,GAAG,IAAA,mBAAO,EAAC,GAAG,EAAE,CAAC,IAAI,CAAC,aAAa,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;QAChG,MAAM,CAAC,EAAE,eAAe,CAAC,GAAG,IAAA,mBAAO,EAAC,GAAG,EAAE,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,gBAAgB,EAAE,MAAM,CAAC,CAAC,CAAC;QAC9F,OAAO,EAAE,iBAAiB,EAAE,eAAe,EAAE,CAAC;IACjD,CAAC;IAEF;;;OAGG;IACO,aAAa,CAAC,MAAkB,EAAE,MAAwB;QAChE,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,OAAO,gBAAgB,CAAC;IAC5B,CAAC;IAEO,WAAW,CAAC,MAAkB,EAAE,gBAA0C,EAAE,MAAwB;QACxG;;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;QACD,IAAA,qBAAM,EAAC,MAAM,KAAK,YAAY,CAAC,MAAM,EAAE,KAAK,CAAC,sBAAsB,CAAC,CAAC;QAErE,MAAM,MAAM,GAAG,IAAA,iCAAkB,EAAC,YAAY,EAAE,OAAO,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;QACvF,IAAI,MAAM,CAAC,MAAM,KAAK,gBAAgB,CAAC,MAAM,GAAG,CAAC,EAAE;YAC/C,mDAAmD;YACnD,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,+BAA+B;YAC/B,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;AA7QD,4BA6QC;AAEA;;;GAGG;AACJ,MAAa,WAAY,SAAQ,QAAQ;IACrC,MAAM,CAAC,IAAI,CAAC,MAAkB,EAAE,MAAwB;QACpD,MAAM,OAAO,GAAG,IAAI,WAAW,EAAE,CAAC;QAClC,MAAM,cAAc,GAAG,OAAO,CAAC,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QACpD,IAAA,qBAAM,EAAC,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,4CAA4C,CAAC,CAAC;QACvE,OAAO,EAAE,OAAO,EAAE,cAAc,EAAE,CAAC;IACvC,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\";\nimport { measure } from \"./odspUtils\";\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 [stringsToResolve, durationStructure] = measure(() => this.loadStructure(buffer, logger));\n const [, durationStrings] = measure(() => this.loadStrings(buffer, stringsToResolve, logger));\n return { durationStructure, durationStrings };\n }\n\n /\n Load and parse the buffer into a tree.\n * @param buffer - buffer to read from.\n /\n protected loadStructure(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 return stringsToResolve;\n }\n\n private loadStrings(buffer: ReadBuffer, stringsToResolve: IStringElementInternal[], logger: ITelemetryLogger) {\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 assert(length === stringBuffer.length, 0x418 / properly encoded /);\n\n const result = Uint8ArrayToString(stringBuffer, \"utf-8\").split(String.fromCharCode(0));\n if (result.length === stringsToResolve.length + 1) {\n // All is good, we expect all the cases to get here\n for (let i = 0; i < stringsToResolve.length; i++) {\n stringsToResolve[i].content = result[i];\n }\n } else {\n // String content has \\0 chars!\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) {\n const builder = new TreeBuilder();\n const telemetryProps = builder.load(buffer, logger);\n assert(buffer.eof, 0x233 / \"Unexpected data at the end of buffer\" */);\n return { builder, telemetryProps };\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/compactSnapshotParser.d.ts CHANGED Viewed

@@ -11,8 +11,7 @@ export declare const currentReadVersion = "1.0";
  * represents how many times slower parsing path is executed. This will be then logged into telemetry.
  */
 export interface ISnapshotContentsWithProps extends ISnapshotContents {
-    slowBlobStructureCount?: number;
-    slowTreeStructureCount?: number;
+    telemetryProps: Record<string, number>;
 }
 /**
  * Converts snapshot from binary compact representation to tree/blobs/ops.

package/lib/compactSnapshotParser.d.ts.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"compactSnapshotParser.d.ts","sourceRoot":"","sources":["../src/compactSnapshotParser.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAIH,OAAO,EAAE,gBAAgB,EAAE,MAAM,oCAAoC,CAAC;AACtE,OAAO,EAAE,iBAAiB,EAAE,MAAM,mBAAmB,CAAC;~~AActD~~,eAAO,MAAM,sBAAsB,QAAQ,CAAC;AAC5C,eAAO,MAAM,kBAAkB,QAAQ,CAAC;~~AAQxC~~;;;GAGG;AACH,MAAM,WAAW,0BAA2B,SAAQ,iBAAiB;IACjE,~~sBAAsB~~,~~CAAC,~~EAAE,MAAM,CAAC~~;IAChC~~,~~sBAAsB~~,~~CAAC,~~EAAE,MAAM,CAAC;~~CACnC~~;AAsKD;;;;GAIG;AACH,wBAAgB,4BAA4B,CACxC,MAAM,EAAE,UAAU,EAClB,MAAM,EAAE,gBAAgB,GACzB,0BAA0B,~~CA0B5B~~"}
1	+ {"version":3,"file":"compactSnapshotParser.d.ts","sourceRoot":"","sources":["../src/compactSnapshotParser.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAIH,OAAO,EAAE,gBAAgB,EAAE,MAAM,oCAAoC,CAAC;AACtE,OAAO,EAAE,iBAAiB,EAAE,MAAM,mBAAmB,CAAC;AAetD,eAAO,MAAM,sBAAsB,QAAQ,CAAC;AAC5C,eAAO,MAAM,kBAAkB,QAAQ,CAAC;AAExC;;;GAGG;AACH,MAAM,WAAW,0BAA2B,SAAQ,iBAAiB;IACjE,cAAc,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CAC1C;AAsKD;;;;GAIG;AACH,wBAAgB,4BAA4B,CACxC,MAAM,EAAE,UAAU,EAClB,MAAM,EAAE,gBAAgB,GACzB,0BAA0B,CAoC5B"}

package/lib/compactSnapshotParser.js CHANGED Viewed

@@ -5,6 +5,7 @@
 import { assert } from "@fluidframework/common-utils";
 import { ReadBuffer } from "./ReadBufferUtils";
 import { assertBlobCoreInstance, getStringInstance, assertBoolInstance, assertNodeCoreInstance, assertNumberInstance, getNodeProps, TreeBuilder, } from "./zipItDataRepresentationUtils";
+import { measure } from "./odspUtils";
 export const snapshotMinReadVersion = "1.0";
 export const currentReadVersion = "1.0";
 /**
@@ -165,7 +166,7 @@ function readSnapshotSection(node) {
  * @returns - tree, blobs and ops from the snapshot.
  */
 export function parseCompactSnapshotResponse(buffer, logger) {
-    const builder = TreeBuilder.load(new ReadBuffer(buffer), logger);
+    const { builder, telemetryProps } = TreeBuilder.load(new ReadBuffer(buffer), logger);
     assert(builder.length === 1, 0x219 /* "1 root should be there" */);
     const root = builder.getNode(0);
     const records = getNodeProps(root);
@@ -177,6 +178,9 @@ export function parseCompactSnapshotResponse(buffer, logger) {
     assert(parseFloat(snapshotMinReadVersion) >= parseFloat(mrv), 0x20f /* "Driver min read version should >= to server minReadVersion" */);
     assert(parseFloat(cv) >= parseFloat(snapshotMinReadVersion), 0x210 /* "Snapshot should be created with minReadVersion or above" */);
     assert(currentReadVersion === cv, 0x2c2 /* "Create Version should be equal to currentReadVersion" */);
-    return Object.assign(Object.assign(Object.assign({}, readSnapshotSection(records.snapshot)), readBlobSection(records.blobs)), { ops: records.deltas !== undefined ? readOpsSection(records.deltas) : [], latestSequenceNumber: records.lsn });
+    const [snapshot, durationSnapshotTree] = measure(() => readSnapshotSection(records.snapshot));
+    const [blobs, durationBlobs] = measure(() => readBlobSection(records.blobs));
+    return Object.assign(Object.assign(Object.assign({}, snapshot), blobs), { ops: records.deltas !== undefined ? readOpsSection(records.deltas) : [], latestSequenceNumber: records.lsn, telemetryProps: Object.assign(Object.assign({}, telemetryProps), { durationSnapshotTree,
+            durationBlobs, slowTreeStructureCount: snapshot.slowTreeStructureCount, slowBlobStructureCount: blobs.slowBlobStructureCount }) });
 }
 //# sourceMappingURL=compactSnapshotParser.js.map

package/lib/compactSnapshotParser.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"compactSnapshotParser.js","sourceRoot":"","sources":["../src/compactSnapshotParser.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,8BAA8B,CAAC;AAItD,OAAO,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AAC/C,OAAO,EACH,sBAAsB,EACtB,iBAAiB,EACjB,kBAAkB,EAClB,sBAAsB,EACtB,oBAAoB,EACpB,YAAY,EAGZ,WAAW,GACd,MAAM,gCAAgC,CAAC;AAExC,MAAM,CAAC,MAAM,sBAAsB,GAAG,KAAK,CAAC;AAC5C,MAAM,CAAC,MAAM,kBAAkB,GAAG,KAAK,CAAC;AAiBxC;;;GAGG;AACH,SAAS,eAAe,CAAC,IAAe;IACpC,sBAAsB,CAAC,IAAI,EAAE,sCAAsC,CAAC,CAAC;IACrE,IAAI,sBAAsB,GAAG,CAAC,CAAC;IAC/B,MAAM,KAAK,GAA6B,IAAI,GAAG,EAAE,CAAC;IAClD,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE;QACrB,sBAAsB,CAAC,IAAI,EAAE,qBAAqB,CAAC,CAAC;QAEpD;;;;WAIG;QACH,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,KAAK,IAAI,IAAI,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,KAAK,MAAM,EAAE;YAC3F,oBAAoB;YACpB,iBAAiB;YACjB,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC;YAC1D,SAAS;SACZ;QAED;;WAEG;QACH,sBAAsB,IAAI,CAAC,CAAC;QAC5B,MAAM,OAAO,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC;QACnC,sBAAsB,CAAC,OAAO,CAAC,IAAI,EAAE,iCAAiC,CAAC,CAAC;QACxE,MAAM,EAAE,GAAG,iBAAiB,CAAC,OAAO,CAAC,EAAE,EAAE,0BAA0B,CAAC,CAAC;QACrE,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,OAAO,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;KAC3C;IACD,OAAO,EAAE,KAAK,EAAE,sBAAsB,EAAE,CAAC;AAC7C,CAAC;AAED;;;GAGG;AACH,SAAS,cAAc,CAAC,IAAe;IACnC,sBAAsB,CAAC,IAAI,EAAE,mCAAmC,CAAC,CAAC;IAClE,MAAM,GAAG,GAAgC,EAAE,CAAC;IAC5C,MAAM,OAAO,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC;IACnC,oBAAoB,CAAC,OAAO,CAAC,mBAAmB,EAAE,+BAA+B,CAAC,CAAC;IACnF,sBAAsB,CAAC,OAAO,CAAC,MAAM,EAAE,yBAAyB,CAAC,CAAC;IAClE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE;QAC5C,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;KACrD;IACD,MAAM,CAAC,OAAO,CAAC,mBAAmB,CAAC,OAAO,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,cAAc,EAClE,KAAK,CAAC,oCAAoC,CAAC,CAAC;IAChD,OAAO,GAAG,CAAC;AACf,CAAC;AAED;;;GAGG;AACH,SAAS,eAAe,CAAC,IAAc;IACnC,IAAI,sBAAsB,GAAG,CAAC,CAAC;IAC/B,MAAM,KAAK,GAAG,EAAE,CAAC;IACjB,MAAM,YAAY,GAAkB;QAChC,KAAK,EAAE,EAAE;QACT,KAAK;KACR,CAAC;IACF,KAAK,MAAM,QAAQ,IAAI,IAAI,EAAE;QACzB,sBAAsB,CAAC,QAAQ,EAAE,4BAA4B,CAAC,CAAC;QAE/D;;;;WAIG;QACF,MAAM,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC;QAC/B,IAAI,MAAM,GAAG,CAAC,IAAI,QAAQ,CAAC,cAAc,CAAC,CAAC,CAAC,KAAK,MAAM,EAAE;YACtD,IAAI,MAAM,KAAK,CAAC,EAAE;gBACd,MAAM,OAAO,GAAG,QAAQ,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC;gBAC3C,sBAAsB;gBACtB,wBAAwB;gBACxB,IAAI,OAAO,KAAK,UAAU,EAAE;oBACxB,MAAM,MAAM,GAAG,eAAe,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;oBACpD,KAAK,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,YAAY,CAAC;oBACnD,sBAAsB,IAAI,MAAM,CAAC,sBAAsB,CAAC;oBACxD,SAAS;iBACZ;gBACD,sBAAsB;gBACtB,qBAAqB;gBACrB,IAAI,OAAO,KAAK,OAAO,EAAE;oBACrB,YAAY,CAAC,KAAK,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;oBAClE,SAAS;iBACZ;aACJ;YAED,sBAAsB;YACtB,gBAAgB;YAChB,qBAAqB;YACrB,IAAI,MAAM,KAAK,CAAC;gBACR,QAAQ,CAAC,cAAc,CAAC,CAAC,CAAC,KAAK,UAAU;gBACzC,QAAQ,CAAC,cAAc,CAAC,CAAC,CAAC,KAAK,OAAO,EAAE;gBAC5C,YAAY,CAAC,KAAK,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;gBAClE,SAAS;aACZ;YAED,sBAAsB;YACtB,uBAAuB;YACvB,wBAAwB;YACxB,IAAI,MAAM,KAAK,CAAC;gBACR,QAAQ,CAAC,cAAc,CAAC,CAAC,CAAC,KAAK,cAAc;gBAC7C,QAAQ,CAAC,cAAc,CAAC,CAAC,CAAC,KAAK,UAAU,EAAE;gBAC/C,MAAM,MAAM,GAAG,eAAe,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;gBACpD,KAAK,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,YAAY,CAAC;gBACnD,sBAAsB,IAAI,MAAM,CAAC,sBAAsB,CAAC;gBACxD,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,4CAA4C,CAAC,CAAC;gBAChF,YAAY,CAAC,YAAY,GAAG,IAAI,CAAC;gBACjC,SAAS;aACZ;SACJ;QAED;;WAEG;QACH,sBAAsB,IAAI,CAAC,CAAC;QAC5B,MAAM,OAAO,GAAG,YAAY,CAAC,QAAQ,CAAC,CAAC;QAEvC,IAAI,OAAO,CAAC,YAAY,KAAK,SAAS,EAAE;YACpC,kBAAkB,CAAC,OAAO,CAAC,YAAY,EAAE,kCAAkC,CAAC,CAAC;YAC7E,MAAM,CAAC,OAAO,CAAC,YAAY,EAAE,KAAK,CAAC,8CAA8C,CAAC,CAAC;YACnF,YAAY,CAAC,YAAY,GAAG,IAAI,CAAC;SACpC;QAED,MAAM,IAAI,GAAG,iBAAiB,CAAC,OAAO,CAAC,IAAI,EAAE,4BAA4B,CAAC,CAAC;QAC3E,IAAI,OAAO,CAAC,KAAK,KAAK,SAAS,EAAE;YAC7B,YAAY,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,iBAAiB,CAAC,OAAO,CAAC,KAAK,EAAE,6BAA6B,CAAC,CAAC;SAC9F;aAAM,IAAI,OAAO,CAAC,QAAQ,KAAK,SAAS,EAAE;YACvC,sBAAsB,CAAC,OAAO,CAAC,QAAQ,EAAE,kCAAkC,CAAC,CAAC;YAC7E,MAAM,MAAM,GAAG,eAAe,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;YACjD,KAAK,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,YAAY,CAAC;YAClC,sBAAsB,IAAI,MAAM,CAAC,sBAAsB,CAAC;SAC3D;aAAM;YACH,KAAK,CAAC,IAAI,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC;SAC1C;KACJ;IACD,OAAO,EAAE,YAAY,EAAE,sBAAsB,EAAE,CAAC;AACpD,CAAC;AAED;;;GAGG;AACH,SAAS,mBAAmB,CAAC,IAAe;IACxC,sBAAsB,CAAC,IAAI,EAAE,qCAAqC,CAAC,CAAC;IACpE,MAAM,OAAO,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC;IAEnC,sBAAsB,CAAC,OAAO,CAAC,SAAS,EAAE,sCAAsC,CAAC,CAAC;IAClF,oBAAoB,CAAC,OAAO,CAAC,cAAc,EAAE,yCAAyC,CAAC,CAAC;IACxF,MAAM,EAAE,YAAY,EAAE,sBAAsB,EAAE,GAAG,eAAe,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;IACpF,YAAY,CAAC,EAAE,GAAG,iBAAiB,CAAC,OAAO,CAAC,EAAE,EAAE,6BAA6B,CAAC,CAAC;IAC/E,MAAM,cAAc,GAAG,OAAO,CAAC,cAAc,CAAC,OAAO,EAAE,CAAC;IACxD,OAAO;QACH,cAAc;QACd,YAAY;QACZ,sBAAsB;KACzB,CAAC;AACN,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,4BAA4B,CACxC,MAAkB,EAClB,MAAwB;IAExB,MAAM,OAAO,GAAG,WAAW,CAAC,IAAI,CAAC,IAAI,UAAU,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC,CAAC;IACjE,MAAM,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,KAAK,CAAC,8BAA8B,CAAC,CAAC;IACnE,MAAM,IAAI,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IAEhC,MAAM,OAAO,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC;IAEnC,MAAM,GAAG,GAAG,iBAAiB,CAAC,OAAO,CAAC,GAAG,EAAE,iCAAiC,CAAC,CAAC;IAC9E,MAAM,EAAE,GAAG,iBAAiB,CAAC,OAAO,CAAC,EAAE,EAAE,gCAAgC,CAAC,CAAC;IAC3E,IAAI,OAAO,CAAC,GAAG,KAAK,SAAS,EAAE;QAC3B,oBAAoB,CAAC,OAAO,CAAC,GAAG,EAAE,wBAAwB,CAAC,CAAC;KAC/D;IAED,MAAM,CAAC,UAAU,CAAC,sBAAsB,CAAC,IAAI,UAAU,CAAC,GAAG,CAAC,EACxD,KAAK,CAAC,kEAAkE,CAAC,CAAC;IAC9E,MAAM,CAAC,UAAU,CAAC,EAAE,CAAC,IAAI,UAAU,CAAC,sBAAsB,CAAC,EACvD,KAAK,CAAC,+DAA+D,CAAC,CAAC;IAC3E,MAAM,CAAC,kBAAkB,KAAK,EAAE,EAC5B,KAAK,CAAC,4DAA4D,CAAC,CAAC;IAExE,qDACO,mBAAmB,CAAC,OAAO,CAAC,QAAQ,CAAC,GACrC,eAAe,CAAC,OAAO,CAAC,KAAK,CAAC,KACjC,GAAG,EAAE,OAAO,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,cAAc,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,EACvE,oBAAoB,EAAE,OAAO,CAAC,GAAG,IACnC;AACN,CAAC","sourcesContent":["/!\n Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n /\n\nimport { assert } from \"@fluidframework/common-utils\";\nimport { ISequencedDocumentMessage, ISnapshotTree } from \"@fluidframework/protocol-definitions\";\nimport { ITelemetryLogger } from \"@fluidframework/common-definitions\";\nimport { ISnapshotContents } from \"./odspPublicUtils\";\nimport { ReadBuffer } from \"./ReadBufferUtils\";\nimport {\n assertBlobCoreInstance,\n getStringInstance,\n assertBoolInstance,\n assertNodeCoreInstance,\n assertNumberInstance,\n getNodeProps,\n NodeCore,\n NodeTypes,\n TreeBuilder,\n} from \"./zipItDataRepresentationUtils\";\n\nexport const snapshotMinReadVersion = \"1.0\";\nexport const currentReadVersion = \"1.0\";\n\ninterface ISnapshotSection {\n snapshotTree: ISnapshotTree;\n sequenceNumber: number;\n slowTreeStructureCount: number;\n}\n\n/\n The parsing is significantly faster if the position of props is well known instead of dynamic. So these variables\n * represents how many times slower parsing path is executed. This will be then logged into telemetry.\n /\nexport interface ISnapshotContentsWithProps extends ISnapshotContents {\n slowBlobStructureCount?: number;\n slowTreeStructureCount?: number;\n}\n\n/\n Recreates blobs section of the tree.\n * @param node - tree node to read blob section from\n /\nfunction readBlobSection(node: NodeTypes) {\n assertNodeCoreInstance(node, \"TreeBlobs should be of type NodeCore\");\n let slowBlobStructureCount = 0;\n const blobs: Map<string, ArrayBuffer> = new Map();\n for (const blob of node) {\n assertNodeCoreInstance(blob, \"blob should be node\");\n\n /\n Perf optimization - the most common cases!\n * This is essentially unrolling code below for faster processing\n * It speeds up tree parsing by 2-3x times!\n /\n if (blob.length === 4 && blob.getMaybeString(0) === \"id\" && blob.getMaybeString(2) === \"data\") {\n // \"id\": <node name>\n // \"data\": <blob>\n blobs.set(blob.getString(1), blob.getBlob(3).arrayBuffer);\n continue;\n }\n\n /\n More generalized workflow\n /\n slowBlobStructureCount += 1;\n const records = getNodeProps(blob);\n assertBlobCoreInstance(records.data, \"data should be of BlobCore type\");\n const id = getStringInstance(records.id, \"blob id should be string\");\n blobs.set(id, records.data.arrayBuffer);\n }\n return { blobs, slowBlobStructureCount };\n}\n\n/\n Recreates ops section of the tree.\n * @param node - tree node to read ops section from\n /\nfunction readOpsSection(node: NodeTypes) {\n assertNodeCoreInstance(node, \"Deltas should be of type NodeCore\");\n const ops: ISequencedDocumentMessage[] = [];\n const records = getNodeProps(node);\n assertNumberInstance(records.firstSequenceNumber, \"Seq number should be a number\");\n assertNodeCoreInstance(records.deltas, \"Deltas should be a Node\");\n for (let i = 0; i < records.deltas.length; ++i) {\n ops.push(JSON.parse(records.deltas.getString(i)));\n }\n assert(records.firstSequenceNumber.valueOf() === ops[0].sequenceNumber,\n 0x280 / \"Validate first op seq number\" /);\n return ops;\n}\n\n/\n Recreates snapshot tree out of tree representation.\n * @param node - tree node to de-serialize from\n /\nfunction readTreeSection(node: NodeCore) {\n let slowTreeStructureCount = 0;\n const trees = {};\n const snapshotTree: ISnapshotTree = {\n blobs: {},\n trees,\n };\n for (const treeNode of node) {\n assertNodeCoreInstance(treeNode, \"tree nodes should be nodes\");\n\n /\n Perf optimization - the most common cases!\n * This is essentially unrolling code below for faster processing\n * It speeds up tree parsing by 2-3x times!\n /\n const length = treeNode.length;\n if (length > 0 && treeNode.getMaybeString(0) === \"name\") {\n if (length === 4) {\n const content = treeNode.getMaybeString(2);\n // \"name\": <node name>\n // \"children\": <blob id>\n if (content === \"children\") {\n const result = readTreeSection(treeNode.getNode(3));\n trees[treeNode.getString(1)] = result.snapshotTree;\n slowTreeStructureCount += result.slowTreeStructureCount;\n continue;\n }\n // \"name\": <node name>\n // \"value\": <blob id>\n if (content === \"value\") {\n snapshotTree.blobs[treeNode.getString(1)] = treeNode.getString(3);\n continue;\n }\n }\n\n // \"name\": <node name>\n // \"nodeType\": 3\n // \"value\": <blob id>\n if (length === 6 &&\n treeNode.getMaybeString(2) === \"nodeType\" &&\n treeNode.getMaybeString(4) === \"value\") {\n snapshotTree.blobs[treeNode.getString(1)] = treeNode.getString(5);\n continue;\n }\n\n // \"name\": <node name>\n // \"unreferenced\": true\n // \"children\": <blob id>\n if (length === 6 &&\n treeNode.getMaybeString(2) === \"unreferenced\" &&\n treeNode.getMaybeString(4) === \"children\") {\n const result = readTreeSection(treeNode.getNode(5));\n trees[treeNode.getString(1)] = result.snapshotTree;\n slowTreeStructureCount += result.slowTreeStructureCount;\n assert(treeNode.getBool(3), 0x3db / Unreferenced if present should be true /);\n snapshotTree.unreferenced = true;\n continue;\n }\n }\n\n /\n More generalized workflow\n /\n slowTreeStructureCount += 1;\n const records = getNodeProps(treeNode);\n\n if (records.unreferenced !== undefined) {\n assertBoolInstance(records.unreferenced, \"Unreferenced flag should be bool\");\n assert(records.unreferenced, 0x281 / \"Unreferenced if present should be true\" /);\n snapshotTree.unreferenced = true;\n }\n\n const path = getStringInstance(records.name, \"Path name should be string\");\n if (records.value !== undefined) {\n snapshotTree.blobs[path] = getStringInstance(records.value, \"Blob value should be string\");\n } else if (records.children !== undefined) {\n assertNodeCoreInstance(records.children, \"Trees should be of type NodeCore\");\n const result = readTreeSection(records.children);\n trees[path] = result.snapshotTree;\n slowTreeStructureCount += result.slowTreeStructureCount;\n } else {\n trees[path] = { blobs: {}, trees: {} };\n }\n }\n return { snapshotTree, slowTreeStructureCount };\n}\n\n/\n Recreates snapshot tree out of tree representation.\n * @param node - tree node to de-serialize from\n /\nfunction readSnapshotSection(node: NodeTypes): ISnapshotSection {\n assertNodeCoreInstance(node, \"Snapshot should be of type NodeCore\");\n const records = getNodeProps(node);\n\n assertNodeCoreInstance(records.treeNodes, \"TreeNodes should be of type NodeCore\");\n assertNumberInstance(records.sequenceNumber, \"sequenceNumber should be of type number\");\n const { snapshotTree, slowTreeStructureCount } = readTreeSection(records.treeNodes);\n snapshotTree.id = getStringInstance(records.id, \"snapshotId should be string\");\n const sequenceNumber = records.sequenceNumber.valueOf();\n return {\n sequenceNumber,\n snapshotTree,\n slowTreeStructureCount,\n };\n}\n\n/\n Converts snapshot from binary compact representation to tree/blobs/ops.\n * @param buffer - Compact snapshot to be parsed into tree/blobs/ops.\n * @returns - tree, blobs and ops from the snapshot.\n /\nexport function parseCompactSnapshotResponse(\n buffer: Uint8Array,\n logger: ITelemetryLogger,\n): ISnapshotContentsWithProps {\n const builder = TreeBuilder.load(new ReadBuffer(buffer), logger);\n assert(builder.length === 1, 0x219 / \"1 root should be there\" /);\n const root = builder.getNode(0);\n\n const records = getNodeProps(root);\n\n const mrv = getStringInstance(records.mrv, \"minReadVersion should be string\");\n const cv = getStringInstance(records.cv, \"createVersion should be string\");\n if (records.lsn !== undefined) {\n assertNumberInstance(records.lsn, \"lsn should be a number\");\n }\n\n assert(parseFloat(snapshotMinReadVersion) >= parseFloat(mrv),\n 0x20f / \"Driver min read version should >= to server minReadVersion\" /);\n assert(parseFloat(cv) >= parseFloat(snapshotMinReadVersion),\n 0x210 / \"Snapshot should be created with minReadVersion or above\" /);\n assert(currentReadVersion === cv,\n 0x2c2 / \"Create Version should be equal to currentReadVersion\" */);\n\n return {\n ...readSnapshotSection(records.snapshot),\n ...readBlobSection(records.blobs),\n ops: records.deltas !== undefined ? readOpsSection(records.deltas) : [],\n latestSequenceNumber: records.lsn,\n };\n}\n"]}
1	+ {"version":3,"file":"compactSnapshotParser.js","sourceRoot":"","sources":["../src/compactSnapshotParser.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,8BAA8B,CAAC;AAItD,OAAO,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AAC/C,OAAO,EACH,sBAAsB,EACtB,iBAAiB,EACjB,kBAAkB,EAClB,sBAAsB,EACtB,oBAAoB,EACpB,YAAY,EAGZ,WAAW,GACd,MAAM,gCAAgC,CAAC;AACxC,OAAO,EAAE,OAAO,EAAE,MAAM,aAAa,CAAC;AAEtC,MAAM,CAAC,MAAM,sBAAsB,GAAG,KAAK,CAAC;AAC5C,MAAM,CAAC,MAAM,kBAAkB,GAAG,KAAK,CAAC;AAUxC;;;GAGG;AACH,SAAS,eAAe,CAAC,IAAe;IACpC,sBAAsB,CAAC,IAAI,EAAE,sCAAsC,CAAC,CAAC;IACrE,IAAI,sBAAsB,GAAG,CAAC,CAAC;IAC/B,MAAM,KAAK,GAA6B,IAAI,GAAG,EAAE,CAAC;IAClD,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE;QACrB,sBAAsB,CAAC,IAAI,EAAE,qBAAqB,CAAC,CAAC;QAEpD;;;;WAIG;QACH,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,KAAK,IAAI,IAAI,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,KAAK,MAAM,EAAE;YAC3F,oBAAoB;YACpB,iBAAiB;YACjB,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC;YAC1D,SAAS;SACZ;QAED;;WAEG;QACH,sBAAsB,IAAI,CAAC,CAAC;QAC5B,MAAM,OAAO,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC;QACnC,sBAAsB,CAAC,OAAO,CAAC,IAAI,EAAE,iCAAiC,CAAC,CAAC;QACxE,MAAM,EAAE,GAAG,iBAAiB,CAAC,OAAO,CAAC,EAAE,EAAE,0BAA0B,CAAC,CAAC;QACrE,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,OAAO,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;KAC3C;IACD,OAAO,EAAE,KAAK,EAAE,sBAAsB,EAAE,CAAC;AAC7C,CAAC;AAED;;;GAGG;AACH,SAAS,cAAc,CAAC,IAAe;IACnC,sBAAsB,CAAC,IAAI,EAAE,mCAAmC,CAAC,CAAC;IAClE,MAAM,GAAG,GAAgC,EAAE,CAAC;IAC5C,MAAM,OAAO,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC;IACnC,oBAAoB,CAAC,OAAO,CAAC,mBAAmB,EAAE,+BAA+B,CAAC,CAAC;IACnF,sBAAsB,CAAC,OAAO,CAAC,MAAM,EAAE,yBAAyB,CAAC,CAAC;IAClE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE;QAC5C,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;KACrD;IACD,MAAM,CAAC,OAAO,CAAC,mBAAmB,CAAC,OAAO,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,cAAc,EAClE,KAAK,CAAC,oCAAoC,CAAC,CAAC;IAChD,OAAO,GAAG,CAAC;AACf,CAAC;AAED;;;GAGG;AACH,SAAS,eAAe,CAAC,IAAc;IACnC,IAAI,sBAAsB,GAAG,CAAC,CAAC;IAC/B,MAAM,KAAK,GAAG,EAAE,CAAC;IACjB,MAAM,YAAY,GAAkB;QAChC,KAAK,EAAE,EAAE;QACT,KAAK;KACR,CAAC;IACF,KAAK,MAAM,QAAQ,IAAI,IAAI,EAAE;QACzB,sBAAsB,CAAC,QAAQ,EAAE,4BAA4B,CAAC,CAAC;QAE/D;;;;WAIG;QACF,MAAM,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC;QAC/B,IAAI,MAAM,GAAG,CAAC,IAAI,QAAQ,CAAC,cAAc,CAAC,CAAC,CAAC,KAAK,MAAM,EAAE;YACtD,IAAI,MAAM,KAAK,CAAC,EAAE;gBACd,MAAM,OAAO,GAAG,QAAQ,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC;gBAC3C,sBAAsB;gBACtB,wBAAwB;gBACxB,IAAI,OAAO,KAAK,UAAU,EAAE;oBACxB,MAAM,MAAM,GAAG,eAAe,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;oBACpD,KAAK,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,YAAY,CAAC;oBACnD,sBAAsB,IAAI,MAAM,CAAC,sBAAsB,CAAC;oBACxD,SAAS;iBACZ;gBACD,sBAAsB;gBACtB,qBAAqB;gBACrB,IAAI,OAAO,KAAK,OAAO,EAAE;oBACrB,YAAY,CAAC,KAAK,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;oBAClE,SAAS;iBACZ;aACJ;YAED,sBAAsB;YACtB,gBAAgB;YAChB,qBAAqB;YACrB,IAAI,MAAM,KAAK,CAAC;gBACR,QAAQ,CAAC,cAAc,CAAC,CAAC,CAAC,KAAK,UAAU;gBACzC,QAAQ,CAAC,cAAc,CAAC,CAAC,CAAC,KAAK,OAAO,EAAE;gBAC5C,YAAY,CAAC,KAAK,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;gBAClE,SAAS;aACZ;YAED,sBAAsB;YACtB,uBAAuB;YACvB,wBAAwB;YACxB,IAAI,MAAM,KAAK,CAAC;gBACR,QAAQ,CAAC,cAAc,CAAC,CAAC,CAAC,KAAK,cAAc;gBAC7C,QAAQ,CAAC,cAAc,CAAC,CAAC,CAAC,KAAK,UAAU,EAAE;gBAC/C,MAAM,MAAM,GAAG,eAAe,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;gBACpD,KAAK,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,YAAY,CAAC;gBACnD,sBAAsB,IAAI,MAAM,CAAC,sBAAsB,CAAC;gBACxD,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,4CAA4C,CAAC,CAAC;gBAChF,YAAY,CAAC,YAAY,GAAG,IAAI,CAAC;gBACjC,SAAS;aACZ;SACJ;QAED;;WAEG;QACH,sBAAsB,IAAI,CAAC,CAAC;QAC5B,MAAM,OAAO,GAAG,YAAY,CAAC,QAAQ,CAAC,CAAC;QAEvC,IAAI,OAAO,CAAC,YAAY,KAAK,SAAS,EAAE;YACpC,kBAAkB,CAAC,OAAO,CAAC,YAAY,EAAE,kCAAkC,CAAC,CAAC;YAC7E,MAAM,CAAC,OAAO,CAAC,YAAY,EAAE,KAAK,CAAC,8CAA8C,CAAC,CAAC;YACnF,YAAY,CAAC,YAAY,GAAG,IAAI,CAAC;SACpC;QAED,MAAM,IAAI,GAAG,iBAAiB,CAAC,OAAO,CAAC,IAAI,EAAE,4BAA4B,CAAC,CAAC;QAC3E,IAAI,OAAO,CAAC,KAAK,KAAK,SAAS,EAAE;YAC7B,YAAY,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,iBAAiB,CAAC,OAAO,CAAC,KAAK,EAAE,6BAA6B,CAAC,CAAC;SAC9F;aAAM,IAAI,OAAO,CAAC,QAAQ,KAAK,SAAS,EAAE;YACvC,sBAAsB,CAAC,OAAO,CAAC,QAAQ,EAAE,kCAAkC,CAAC,CAAC;YAC7E,MAAM,MAAM,GAAG,eAAe,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;YACjD,KAAK,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,YAAY,CAAC;YAClC,sBAAsB,IAAI,MAAM,CAAC,sBAAsB,CAAC;SAC3D;aAAM;YACH,KAAK,CAAC,IAAI,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC;SAC1C;KACJ;IACD,OAAO,EAAE,YAAY,EAAE,sBAAsB,EAAE,CAAC;AACpD,CAAC;AAED;;;GAGG;AACH,SAAS,mBAAmB,CAAC,IAAe;IACxC,sBAAsB,CAAC,IAAI,EAAE,qCAAqC,CAAC,CAAC;IACpE,MAAM,OAAO,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC;IAEnC,sBAAsB,CAAC,OAAO,CAAC,SAAS,EAAE,sCAAsC,CAAC,CAAC;IAClF,oBAAoB,CAAC,OAAO,CAAC,cAAc,EAAE,yCAAyC,CAAC,CAAC;IACxF,MAAM,EAAE,YAAY,EAAE,sBAAsB,EAAE,GAAG,eAAe,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;IACpF,YAAY,CAAC,EAAE,GAAG,iBAAiB,CAAC,OAAO,CAAC,EAAE,EAAE,6BAA6B,CAAC,CAAC;IAC/E,MAAM,cAAc,GAAG,OAAO,CAAC,cAAc,CAAC,OAAO,EAAE,CAAC;IACxD,OAAO;QACH,cAAc;QACd,YAAY;QACZ,sBAAsB;KACzB,CAAC;AACN,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,4BAA4B,CACxC,MAAkB,EAClB,MAAwB;IAExB,MAAM,EAAE,OAAO,EAAE,cAAc,EAAE,GAAG,WAAW,CAAC,IAAI,CAAC,IAAI,UAAU,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC,CAAC;IACrF,MAAM,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,KAAK,CAAC,8BAA8B,CAAC,CAAC;IACnE,MAAM,IAAI,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IAEhC,MAAM,OAAO,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC;IAEnC,MAAM,GAAG,GAAG,iBAAiB,CAAC,OAAO,CAAC,GAAG,EAAE,iCAAiC,CAAC,CAAC;IAC9E,MAAM,EAAE,GAAG,iBAAiB,CAAC,OAAO,CAAC,EAAE,EAAE,gCAAgC,CAAC,CAAC;IAC3E,IAAI,OAAO,CAAC,GAAG,KAAK,SAAS,EAAE;QAC3B,oBAAoB,CAAC,OAAO,CAAC,GAAG,EAAE,wBAAwB,CAAC,CAAC;KAC/D;IAED,MAAM,CAAC,UAAU,CAAC,sBAAsB,CAAC,IAAI,UAAU,CAAC,GAAG,CAAC,EACxD,KAAK,CAAC,kEAAkE,CAAC,CAAC;IAC9E,MAAM,CAAC,UAAU,CAAC,EAAE,CAAC,IAAI,UAAU,CAAC,sBAAsB,CAAC,EACvD,KAAK,CAAC,+DAA+D,CAAC,CAAC;IAC3E,MAAM,CAAC,kBAAkB,KAAK,EAAE,EAC5B,KAAK,CAAC,4DAA4D,CAAC,CAAC;IAExE,MAAM,CAAC,QAAQ,EAAE,oBAAoB,CAAC,GAAG,OAAO,CAAC,GAAG,EAAE,CAAC,mBAAmB,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC;IAC9F,MAAM,CAAC,KAAK,EAAE,aAAa,CAAC,GAAG,OAAO,CAAC,GAAG,EAAE,CAAC,eAAe,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC;IAE7E,qDACO,QAAQ,GACR,KAAK,KACR,GAAG,EAAE,OAAO,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,cAAc,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,EACvE,oBAAoB,EAAE,OAAO,CAAC,GAAG,EACjC,cAAc,kCACP,cAAc,KACjB,oBAAoB;YACpB,aAAa,EACb,sBAAsB,EAAE,QAAQ,CAAC,sBAAsB,EACvD,sBAAsB,EAAE,KAAK,CAAC,sBAAsB,OAE1D;AACN,CAAC","sourcesContent":["/!\n Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n /\n\nimport { assert } from \"@fluidframework/common-utils\";\nimport { ISequencedDocumentMessage, ISnapshotTree } from \"@fluidframework/protocol-definitions\";\nimport { ITelemetryLogger } from \"@fluidframework/common-definitions\";\nimport { ISnapshotContents } from \"./odspPublicUtils\";\nimport { ReadBuffer } from \"./ReadBufferUtils\";\nimport {\n assertBlobCoreInstance,\n getStringInstance,\n assertBoolInstance,\n assertNodeCoreInstance,\n assertNumberInstance,\n getNodeProps,\n NodeCore,\n NodeTypes,\n TreeBuilder,\n} from \"./zipItDataRepresentationUtils\";\nimport { measure } from \"./odspUtils\";\n\nexport const snapshotMinReadVersion = \"1.0\";\nexport const currentReadVersion = \"1.0\";\n\n/\n The parsing is significantly faster if the position of props is well known instead of dynamic. So these variables\n * represents how many times slower parsing path is executed. This will be then logged into telemetry.\n /\nexport interface ISnapshotContentsWithProps extends ISnapshotContents {\n telemetryProps: Record<string, number>;\n}\n\n/\n Recreates blobs section of the tree.\n * @param node - tree node to read blob section from\n /\nfunction readBlobSection(node: NodeTypes) {\n assertNodeCoreInstance(node, \"TreeBlobs should be of type NodeCore\");\n let slowBlobStructureCount = 0;\n const blobs: Map<string, ArrayBuffer> = new Map();\n for (const blob of node) {\n assertNodeCoreInstance(blob, \"blob should be node\");\n\n /\n Perf optimization - the most common cases!\n * This is essentially unrolling code below for faster processing\n * It speeds up tree parsing by 2-3x times!\n /\n if (blob.length === 4 && blob.getMaybeString(0) === \"id\" && blob.getMaybeString(2) === \"data\") {\n // \"id\": <node name>\n // \"data\": <blob>\n blobs.set(blob.getString(1), blob.getBlob(3).arrayBuffer);\n continue;\n }\n\n /\n More generalized workflow\n /\n slowBlobStructureCount += 1;\n const records = getNodeProps(blob);\n assertBlobCoreInstance(records.data, \"data should be of BlobCore type\");\n const id = getStringInstance(records.id, \"blob id should be string\");\n blobs.set(id, records.data.arrayBuffer);\n }\n return { blobs, slowBlobStructureCount };\n}\n\n/\n Recreates ops section of the tree.\n * @param node - tree node to read ops section from\n /\nfunction readOpsSection(node: NodeTypes) {\n assertNodeCoreInstance(node, \"Deltas should be of type NodeCore\");\n const ops: ISequencedDocumentMessage[] = [];\n const records = getNodeProps(node);\n assertNumberInstance(records.firstSequenceNumber, \"Seq number should be a number\");\n assertNodeCoreInstance(records.deltas, \"Deltas should be a Node\");\n for (let i = 0; i < records.deltas.length; ++i) {\n ops.push(JSON.parse(records.deltas.getString(i)));\n }\n assert(records.firstSequenceNumber.valueOf() === ops[0].sequenceNumber,\n 0x280 / \"Validate first op seq number\" /);\n return ops;\n}\n\n/\n Recreates snapshot tree out of tree representation.\n * @param node - tree node to de-serialize from\n /\nfunction readTreeSection(node: NodeCore) {\n let slowTreeStructureCount = 0;\n const trees = {};\n const snapshotTree: ISnapshotTree = {\n blobs: {},\n trees,\n };\n for (const treeNode of node) {\n assertNodeCoreInstance(treeNode, \"tree nodes should be nodes\");\n\n /\n Perf optimization - the most common cases!\n * This is essentially unrolling code below for faster processing\n * It speeds up tree parsing by 2-3x times!\n /\n const length = treeNode.length;\n if (length > 0 && treeNode.getMaybeString(0) === \"name\") {\n if (length === 4) {\n const content = treeNode.getMaybeString(2);\n // \"name\": <node name>\n // \"children\": <blob id>\n if (content === \"children\") {\n const result = readTreeSection(treeNode.getNode(3));\n trees[treeNode.getString(1)] = result.snapshotTree;\n slowTreeStructureCount += result.slowTreeStructureCount;\n continue;\n }\n // \"name\": <node name>\n // \"value\": <blob id>\n if (content === \"value\") {\n snapshotTree.blobs[treeNode.getString(1)] = treeNode.getString(3);\n continue;\n }\n }\n\n // \"name\": <node name>\n // \"nodeType\": 3\n // \"value\": <blob id>\n if (length === 6 &&\n treeNode.getMaybeString(2) === \"nodeType\" &&\n treeNode.getMaybeString(4) === \"value\") {\n snapshotTree.blobs[treeNode.getString(1)] = treeNode.getString(5);\n continue;\n }\n\n // \"name\": <node name>\n // \"unreferenced\": true\n // \"children\": <blob id>\n if (length === 6 &&\n treeNode.getMaybeString(2) === \"unreferenced\" &&\n treeNode.getMaybeString(4) === \"children\") {\n const result = readTreeSection(treeNode.getNode(5));\n trees[treeNode.getString(1)] = result.snapshotTree;\n slowTreeStructureCount += result.slowTreeStructureCount;\n assert(treeNode.getBool(3), 0x3db / Unreferenced if present should be true /);\n snapshotTree.unreferenced = true;\n continue;\n }\n }\n\n /\n More generalized workflow\n /\n slowTreeStructureCount += 1;\n const records = getNodeProps(treeNode);\n\n if (records.unreferenced !== undefined) {\n assertBoolInstance(records.unreferenced, \"Unreferenced flag should be bool\");\n assert(records.unreferenced, 0x281 / \"Unreferenced if present should be true\" /);\n snapshotTree.unreferenced = true;\n }\n\n const path = getStringInstance(records.name, \"Path name should be string\");\n if (records.value !== undefined) {\n snapshotTree.blobs[path] = getStringInstance(records.value, \"Blob value should be string\");\n } else if (records.children !== undefined) {\n assertNodeCoreInstance(records.children, \"Trees should be of type NodeCore\");\n const result = readTreeSection(records.children);\n trees[path] = result.snapshotTree;\n slowTreeStructureCount += result.slowTreeStructureCount;\n } else {\n trees[path] = { blobs: {}, trees: {} };\n }\n }\n return { snapshotTree, slowTreeStructureCount };\n}\n\n/\n Recreates snapshot tree out of tree representation.\n * @param node - tree node to de-serialize from\n /\nfunction readSnapshotSection(node: NodeTypes) {\n assertNodeCoreInstance(node, \"Snapshot should be of type NodeCore\");\n const records = getNodeProps(node);\n\n assertNodeCoreInstance(records.treeNodes, \"TreeNodes should be of type NodeCore\");\n assertNumberInstance(records.sequenceNumber, \"sequenceNumber should be of type number\");\n const { snapshotTree, slowTreeStructureCount } = readTreeSection(records.treeNodes);\n snapshotTree.id = getStringInstance(records.id, \"snapshotId should be string\");\n const sequenceNumber = records.sequenceNumber.valueOf();\n return {\n sequenceNumber,\n snapshotTree,\n slowTreeStructureCount,\n };\n}\n\n/\n Converts snapshot from binary compact representation to tree/blobs/ops.\n * @param buffer - Compact snapshot to be parsed into tree/blobs/ops.\n * @returns - tree, blobs and ops from the snapshot.\n /\nexport function parseCompactSnapshotResponse(\n buffer: Uint8Array,\n logger: ITelemetryLogger,\n): ISnapshotContentsWithProps {\n const { builder, telemetryProps } = TreeBuilder.load(new ReadBuffer(buffer), logger);\n assert(builder.length === 1, 0x219 / \"1 root should be there\" /);\n const root = builder.getNode(0);\n\n const records = getNodeProps(root);\n\n const mrv = getStringInstance(records.mrv, \"minReadVersion should be string\");\n const cv = getStringInstance(records.cv, \"createVersion should be string\");\n if (records.lsn !== undefined) {\n assertNumberInstance(records.lsn, \"lsn should be a number\");\n }\n\n assert(parseFloat(snapshotMinReadVersion) >= parseFloat(mrv),\n 0x20f / \"Driver min read version should >= to server minReadVersion\" /);\n assert(parseFloat(cv) >= parseFloat(snapshotMinReadVersion),\n 0x210 / \"Snapshot should be created with minReadVersion or above\" /);\n assert(currentReadVersion === cv,\n 0x2c2 / \"Create Version should be equal to currentReadVersion\" */);\n\n const [snapshot, durationSnapshotTree] = measure(() => readSnapshotSection(records.snapshot));\n const [blobs, durationBlobs] = measure(() => readBlobSection(records.blobs));\n\n return {\n ...snapshot,\n ...blobs,\n ops: records.deltas !== undefined ? readOpsSection(records.deltas) : [],\n latestSequenceNumber: records.lsn,\n telemetryProps: {\n ...telemetryProps,\n durationSnapshotTree,\n durationBlobs,\n slowTreeStructureCount: snapshot.slowTreeStructureCount,\n slowBlobStructureCount: blobs.slowBlobStructureCount,\n },\n };\n}\n"]}

package/lib/fetchSnapshot.d.ts.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"fetchSnapshot.d.ts","sourceRoot":"","sources":["../src/fetchSnapshot.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,OAAO,IAAI,eAAe,EAAE,MAAM,kBAAkB,CAAC;AAE9D,OAAO,EAAE,gBAAgB,EAAE,MAAM,oCAAoC,CAAC;AAItE,OAAO,EACH,gBAAgB,EAChB,gBAAgB,EAEhB,+BAA+B,EAClC,MAAM,yCAAyC,CAAC;AAGjD,OAAO,EAAE,aAAa,EAAwB,wBAAwB,EAA8B,MAAM,aAAa,CAAC;AAGxH,OAAO,EAKH,aAAa,~~EAChB~~,MAAM,aAAa,CAAC;AACrB,OAAO,EAAE,iBAAiB,EAAE,MAAM,mBAAmB,CAAC;AAGtD,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;~~AAU9C~~;;GAEG;AACH,oBAAY,yBAAyB;IACjC,IAAI,IAAI;IACR,MAAM,IAAI;IACV,aAAa,IAAI;CACpB;AAED;;;;;;;;;GASG;AACH,wBAAsB,aAAa,CAC/B,WAAW,EAAE,MAAM,EACnB,KAAK,EAAE,MAAM,GAAG,IAAI,EACpB,SAAS,EAAE,MAAM,EACjB,iBAAiB,EAAE,OAAO,EAC1B,sCAAsC,EAAE,OAAO,EAC/C,MAAM,EAAE,gBAAgB,EACxB,kBAAkB,EAAE,CAAC,GAAG,EAAE,MAAM,EAAE,YAAY,EAAE;IAAE,CAAC,KAAK,EAAE,MAAM,GAAG,GAAG,CAAC;CAAE,KAAK,OAAO,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,GAC9G,OAAO,CAAC,iBAAiB,CAAC,CAoB5B;AAED,wBAAsB,uBAAuB,CACzC,eAAe,EAAE,gBAAgB,EACjC,mBAAmB,EAAE,+BAA+B,EACpD,eAAe,EAAE,gBAAgB,GAAG,SAAS,EAC7C,sCAAsC,EAAE,OAAO,EAC/C,MAAM,EAAE,gBAAgB,EACxB,kBAAkB,EAAE,CAChB,oBAAoB,EAAE,gBAAgB,EACtC,YAAY,EAAE,MAAM,EACpB,eAAe,EAAE,gBAAgB,GAAG,SAAS,EAC7C,UAAU,CAAC,EAAE,eAAe,KAC3B,OAAO,CAAC,kCAAkC,CAAC,EAChD,UAAU,EAAE,CAAC,cAAc,EAAE,wBAAwB,KAAK,OAAO,CAAC,IAAI,CAAC,EACvE,aAAa,EAAE,MAAM,OAAO,CAAC,IAAI,CAAC,EAClC,oBAAoB,CAAC,EAAE,OAAO,GAC/B,OAAO,CAAC,iBAAiB,CAAC,CA4D5B;~~AA+TD~~,MAAM,WAAW,kCAAkC;IAC/C,YAAY,EAAE,aAAa,CAAC,QAAQ,CAAC,CAAC;IACtC,UAAU,EAAE,MAAM,CAAC;IACnB,cAAc,EAAE;QAAE,CAAC,KAAK,EAAE,MAAM,GAAG,GAAG,CAAC;KAAE,CAAC;CAC7C;AAiDD,wBAAgB,qBAAqB,CAAC,QAAQ,EAAE,aAAa,QAK5D;AAWD;;;;;;;;;;GAUG;AACH,wBAAsB,gBAAgB,CAClC,eAAe,EAAE,gBAAgB,EACjC,YAAY,EAAE,MAAM,EACpB,MAAM,EAAE,gBAAgB,EACxB,eAAe,EAAE,gBAAgB,GAAG,SAAS,EAC7C,uBAAuB,CAAC,EAAE,yBAAyB,EACnD,UAAU,CAAC,EAAE,eAAe,EAC5B,YAAY,CAAC,EAAE,YAAY,EAC3B,YAAY,CAAC,EAAE,MAAM,GACtB,OAAO,CAAC,kCAAkC,CAAC,CAwC7C"}
1	+ {"version":3,"file":"fetchSnapshot.d.ts","sourceRoot":"","sources":["../src/fetchSnapshot.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,OAAO,IAAI,eAAe,EAAE,MAAM,kBAAkB,CAAC;AAE9D,OAAO,EAAE,gBAAgB,EAAE,MAAM,oCAAoC,CAAC;AAItE,OAAO,EACH,gBAAgB,EAChB,gBAAgB,EAEhB,+BAA+B,EAClC,MAAM,yCAAyC,CAAC;AAGjD,OAAO,EAAE,aAAa,EAAwB,wBAAwB,EAA8B,MAAM,aAAa,CAAC;AAGxH,OAAO,EAKH,aAAa,EAGhB,MAAM,aAAa,CAAC;AACrB,OAAO,EAAE,iBAAiB,EAAE,MAAM,mBAAmB,CAAC;AAGtD,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAG9C;;GAEG;AACH,oBAAY,yBAAyB;IACjC,IAAI,IAAI;IACR,MAAM,IAAI;IACV,aAAa,IAAI;CACpB;AAED;;;;;;;;;GASG;AACH,wBAAsB,aAAa,CAC/B,WAAW,EAAE,MAAM,EACnB,KAAK,EAAE,MAAM,GAAG,IAAI,EACpB,SAAS,EAAE,MAAM,EACjB,iBAAiB,EAAE,OAAO,EAC1B,sCAAsC,EAAE,OAAO,EAC/C,MAAM,EAAE,gBAAgB,EACxB,kBAAkB,EAAE,CAAC,GAAG,EAAE,MAAM,EAAE,YAAY,EAAE;IAAE,CAAC,KAAK,EAAE,MAAM,GAAG,GAAG,CAAC;CAAE,KAAK,OAAO,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,GAC9G,OAAO,CAAC,iBAAiB,CAAC,CAoB5B;AAED,wBAAsB,uBAAuB,CACzC,eAAe,EAAE,gBAAgB,EACjC,mBAAmB,EAAE,+BAA+B,EACpD,eAAe,EAAE,gBAAgB,GAAG,SAAS,EAC7C,sCAAsC,EAAE,OAAO,EAC/C,MAAM,EAAE,gBAAgB,EACxB,kBAAkB,EAAE,CAChB,oBAAoB,EAAE,gBAAgB,EACtC,YAAY,EAAE,MAAM,EACpB,eAAe,EAAE,gBAAgB,GAAG,SAAS,EAC7C,UAAU,CAAC,EAAE,eAAe,KAC3B,OAAO,CAAC,kCAAkC,CAAC,EAChD,UAAU,EAAE,CAAC,cAAc,EAAE,wBAAwB,KAAK,OAAO,CAAC,IAAI,CAAC,EACvE,aAAa,EAAE,MAAM,OAAO,CAAC,IAAI,CAAC,EAClC,oBAAoB,CAAC,EAAE,OAAO,GAC/B,OAAO,CAAC,iBAAiB,CAAC,CA4D5B;AAyUD,MAAM,WAAW,kCAAkC;IAC/C,YAAY,EAAE,aAAa,CAAC,QAAQ,CAAC,CAAC;IACtC,UAAU,EAAE,MAAM,CAAC;IACnB,cAAc,EAAE;QAAE,CAAC,KAAK,EAAE,MAAM,GAAG,GAAG,CAAC;KAAE,CAAC;CAC7C;AAiDD,wBAAgB,qBAAqB,CAAC,QAAQ,EAAE,aAAa,QAK5D;AAWD;;;;;;;;;;GAUG;AACH,wBAAsB,gBAAgB,CAClC,eAAe,EAAE,gBAAgB,EACjC,YAAY,EAAE,MAAM,EACpB,MAAM,EAAE,gBAAgB,EACxB,eAAe,EAAE,gBAAgB,GAAG,SAAS,EAC7C,uBAAuB,CAAC,EAAE,yBAAyB,EACnD,UAAU,CAAC,EAAE,eAAe,EAC5B,YAAY,CAAC,EAAE,YAAY,EAC3B,YAAY,CAAC,EAAE,MAAM,GACtB,OAAO,CAAC,kCAAkC,CAAC,CAwC7C"}

package/lib/fetchSnapshot.js CHANGED Viewed

@@ -12,16 +12,10 @@ import { isRuntimeMessage, NonRetryableError } from "@fluidframework/driver-util
 import { persistedCacheValueVersion } from "./contracts";
 import { getQueryString } from "./getQueryString";
 import { getUrlAndHeadersWithAuth } from "./getUrlAndHeadersWithAuth";
-import { fetchAndParseAsJSONHelper, fetchHelper, getWithRetryForTokenRefresh, getWithRetryForTokenRefreshRepeat, } from "./odspUtils";
+import { fetchAndParseAsJSONHelper, fetchHelper, getWithRetryForTokenRefresh, getWithRetryForTokenRefreshRepeat, measure, measureP, } from "./odspUtils";
 import { convertOdspSnapshotToSnapshotTreeAndBlobs } from "./odspSnapshotParser";
 import { currentReadVersion, parseCompactSnapshotResponse } from "./compactSnapshotParser";
 import { pkgVersion } from "./packageVersion";
-async function measure(callback) {
-    const start = performance.now();
-    const result = await callback();
-    const time = performance.now() - start;
-    return [result, time];
-}
 /**
  * Enum to support different types of snapshot formats.
  */
@@ -125,14 +119,14 @@ async function fetchLatestSnapshotCore(odspResolvedUrl, storageTokenFetcher, sna
         }
         // This event measures only successful cases of getLatest call (no tokens, no retries).
         return PerformanceEvent.timedExecAsync(logger, perfEvent, async (event) => {
-            var _a, _b, _c, _d, _e, _f, _g, _h, _j, _k, _l, _m, _o;
+            var _a, _b, _c, _d, _e, _f, _g, _h, _j, _k, _l;
             let controller;
             let fetchTimeout;
             if ((snapshotOptions === null || snapshotOptions === void 0 ? void 0 : snapshotOptions.timeout) !== undefined) {
                 controller = new AbortController();
                 fetchTimeout = setTimeout(() => controller.abort(), snapshotOptions.timeout);
             }
-            const [response, fetchTime] = await measure(async () => snapshotDownloader(odspResolvedUrl, storageToken, snapshotOptions, controller)).finally(() => {
+            const [response, fetchTime] = await measureP(async () => snapshotDownloader(odspResolvedUrl, storageToken, snapshotOptions, controller)).finally(() => {
                 // Clear the fetchTimeout once the response is fetched.
                 if (fetchTimeout !== undefined) {
                     clearTimeout(fetchTimeout);
@@ -156,28 +150,29 @@ async function fetchLatestSnapshotCore(odspResolvedUrl, storageTokenFetcher, sna
                 switch (contentTypeToRead) {
                     case "application/json": {
                         let text;
-                        [text, receiveContentTime] = await measure(async () => odspResponse.content.text());
+                        [text, receiveContentTime] = await measureP(async () => odspResponse.content.text());
                         propsToLog.bodySize = text.length;
                         let content;
-                        [content, parseTime] = await measure(() => JSON.parse(text));
+                        [content, parseTime] = measure(() => JSON.parse(text));
                         validateBlobsAndTrees(content);
                         const snapshotContents = convertOdspSnapshotToSnapshotTreeAndBlobs(content);
-                        parsedSnapshotContents = Object.assign(Object.assign({}, odspResponse), { content: snapshotContents });
+                        parsedSnapshotContents = Object.assign(Object.assign({}, odspResponse), { content: Object.assign(Object.assign({}, snapshotContents), { telemetryProps: {} }) });
                         break;
                     }
                     case "application/ms-fluid": {
                         let content;
                         [content, receiveContentTime] =
-                            await measure(async () => odspResponse.content.arrayBuffer());
+                            await measureP(async () => odspResponse.content.arrayBuffer());
                         propsToLog.bodySize = content.byteLength;
                         let snapshotContents;
-                        [snapshotContents, parseTime] = await measure(() => parseCompactSnapshotResponse(new Uint8Array(content), logger));
+                        [snapshotContents, parseTime] = measure(() => parseCompactSnapshotResponse(new Uint8Array(content), logger));
                         if (snapshotContents.snapshotTree.trees === undefined ||
                             snapshotContents.snapshotTree.blobs === undefined) {
                             throw new NonRetryableError("Returned odsp snapshot is malformed. No trees or blobs!", DriverErrorType.incorrectServerResponse, propsToLog);
                         }
-                        const slowTreeParseCodePaths = (_a = snapshotContents.slowTreeStructureCount) !== null && _a !== void 0 ? _a : 0;
-                        const slowBlobParseCodePaths = (_b = snapshotContents.slowBlobStructureCount) !== null && _b !== void 0 ? _b : 0;
+                        const props = snapshotContents.telemetryProps;
+                        const slowTreeParseCodePaths = (_a = props.slowTreeStructureCount) !== null && _a !== void 0 ? _a : 0;
+                        const slowBlobParseCodePaths = (_b = props.slowBlobStructureCount) !== null && _b !== void 0 ? _b : 0;
                         if (slowTreeParseCodePaths > 10 || slowBlobParseCodePaths > 10) {
                             logger.sendErrorEvent({
                                 eventName: "SlowSnapshotParseCodePaths",
@@ -276,8 +271,8 @@ async function fetchLatestSnapshotCore(odspResolvedUrl, storageTokenFetcher, sna
                 // eslint-disable-next-line @typescript-eslint/no-floating-promises
                 putInCache(valueWithEpoch);
             }
-            event.end(Object.assign({ trees, blobs: (_g = (_f = snapshot.blobs) === null || _f === void 0 ? void 0 : _f.size) !== null && _g !== void 0 ? _g : 0, leafNodes: numBlobs, encodedBlobsSize,
-                sequenceNumber, ops: (_j = (_h = snapshot.ops) === null || _h === void 0 ? void 0 : _h.length) !== null && _j !== void 0 ? _j : 0, slowTreeStructureCount: (_k = snapshot.slowTreeStructureCount) !== null && _k !== void 0 ? _k : 0, slowBlobStructureCount: (_l = snapshot.slowBlobStructureCount) !== null && _l !== void 0 ? _l : 0, userOps: (_o = (_m = snapshot.ops) === null || _m === void 0 ? void 0 : _m.filter((op) => isRuntimeMessage(op)).length) !== null && _o !== void 0 ? _o : 0, headers: Object.keys(response.requestHeaders).length !== 0 ? true : undefined,
+            event.end(Object.assign(Object.assign({ trees, blobs: (_g = (_f = snapshot.blobs) === null || _f === void 0 ? void 0 : _f.size) !== null && _g !== void 0 ? _g : 0, leafNodes: numBlobs, encodedBlobsSize,
+                sequenceNumber, ops: (_j = (_h = snapshot.ops) === null || _h === void 0 ? void 0 : _h.length) !== null && _j !== void 0 ? _j : 0, userOps: (_l = (_k = snapshot.ops) === null || _k === void 0 ? void 0 : _k.filter((op) => isRuntimeMessage(op)).length) !== null && _l !== void 0 ? _l : 0, headers: Object.keys(response.requestHeaders).length !== 0 ? true : undefined,
                 // Interval between the first fetch until the last byte of the last redirect.
                 redirectTime,
                 // Interval between start and finish of the domain name lookup for the resource.
@@ -313,7 +308,7 @@ async function fetchLatestSnapshotCore(odspResolvedUrl, storageTokenFetcher, sna
                 // Azure Fluid Relay service; desc=S, FRP; desc=False. Here, FRL is the duration taken for redeem,
                 // Azure Fluid Relay service is the redeem status (S means success), and FRP is a flag to indicate
                 // if the permission has changed.
-                sltelemetry: odspResponse.headers.get("x-fluid-sltelemetry") }, propsToLog));
+                sltelemetry: odspResponse.headers.get("x-fluid-sltelemetry") }, propsToLog), parsedSnapshotContents.content.telemetryProps));
             return snapshot;
         }).catch((error) => {
             // We hit these errors in stress tests, under load