@fluid-experimental/tree 0.58.2001 → 0.59.2000-61729

package/lib/test/EditLog.tests.js.map

@@ -1 +1 @@
-{"version":3,"file":"EditLog.tests.js","sourceRoot":"","sources":["../../src/test/EditLog.tests.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,MAAM,CAAC;AAC9B,OAAO,EAAE,SAAS,EAAE,MAAM,8BAA8B,CAAC;AACzD,OAAO,EAAc,OAAO,EAAE,iBAAiB,EAAE,MAAM,YAAY,CAAC;AAGpE,OAAO,EAAE,kBAAkB,EAAE,MAAM,WAAW,CAAC;AAC/C,OAAO,EAAE,OAAO,EAAuB,MAAM,YAAY,CAAC;AAE1D;;;;;;GAMG;AACH,SAAS,wBAAwB,CAChC,cAAc,GAAG,CAAC,EAClB,aAAa,GAAG,CAAC,EACjB,sBAAsB,GAAG,GAAG;IAE5B,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,MAAM,UAAU,GAA8B,EAAE,CAAC;IAEjD,IAAI,cAAc,GAA4B,EAAE,CAAC;IACjD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,cAAc,GAAG,aAAa,EAAE,CAAC,EAAE,EAAE;QACxD,MAAM,EAAE,EAAE,EAAE,aAAa,EAAE,GAAG,iBAAiB,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC;QAC7D,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAEjB,cAAc,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;QAEnC,IAAI,cAAc,CAAC,MAAM,KAAK,aAAa,EAAE;YAC5C,UAAU,CAAC,IAAI,CAAC,cAAc,CAAC,KAAK,EAAE,CAAC,CAAC;YACxC,cAAc,GAAG,EAAE,CAAC;SACpB;KACD;IAED,MAAM,OAAO,GAAiB,UAAU,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE;QACtD,OAAO;YACN,GAAG,EAAE,KAAK,IAAI,EAAE;gBACf,OAAO,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC;YACzD,CAAC;SACD,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAI,aAAa,GAAG,CAAC,CAAC;IACtB,MAAM,eAAe,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE;QAC7C,MAAM,MAAM,GAAG;YACd,aAAa;YACb,KAAK;SACL,CAAC;QACF,aAAa,GAAG,aAAa,GAAG,CAAC,CAAC;QAClC,OAAO,MAAM,CAAC;IACf,CAAC,CAAC,CAAC;IAEH,MAAM,OAAO,GAAG,IAAI,OAAO,CAAS,EAAE,UAAU,EAAE,eAAe,EAAE,OAAO,EAAE,EAAE,SAAS,EAAE,sBAAsB,CAAC,CAAC;IAEjH,OAAO,OAAO,CAAC;AAChB,CAAC;AAED,QAAQ,CAAC,SAAS,EAAE,GAAG,EAAE;IACxB,MAAM,KAAK,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC;IAC1B,MAAM,KAAK,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC;IAC1B,MAAM,EAAE,EAAE,EAAE,GAAG,EAAE,aAAa,EAAE,cAAc,EAAE,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC;IAC5E,MAAM,EAAE,EAAE,EAAE,GAAG,EAAE,aAAa,EAAE,cAAc,EAAE,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC;IAE5E,EAAE,CAAC,yCAAyC,EAAE,GAAG,EAAE;QAClD,MAAM,UAAU,GAAG,CAAC,EAAE,aAAa,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,cAAc,EAAE,cAAc,CAAC,EAAE,CAAC,CAAC;QACnF,MAAM,OAAO,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAE3B,MAAM,GAAG,GAAG,IAAI,OAAO,CAAC,EAAE,UAAU,EAAE,OAAO,EAAE,CAAC,CAAC;QACjD,MAAM,CAAC,GAAG,CAAC,kBAAkB,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,oDAAoD,CAAC,CAAC;QACjG,MAAM,CAAC,GAAG,CAAC,sBAAsB,CAAC,CAAC,EAAE,CAAC,KAAK,CAC1C,UAAU,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,EAC1B,qEAAqE,CACrE,CAAC;QACF,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAC1B,UAAU,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,EAC1B,qEAAqE,CACrE,CAAC;QAEF,MAAM,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,EAAE,iDAAiD,CAAC,CAAC;QAC7F,MAAM,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,EAAE,iDAAiD,CAAC,CAAC;IAC9F,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,sDAAsD,EAAE,GAAG,EAAE;QAC/D,MAAM,UAAU,GAAG,CAAC,EAAE,aAAa,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,cAAc,EAAE,cAAc,CAAC,EAAE,CAAC,CAAC;QACnF,MAAM,OAAO,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAE3B,MAAM,GAAG,GAAG,IAAI,OAAO,CAAC,EAAE,UAAU,EAAE,OAAO,EAAE,CAAC,CAAC;QAEjD,MAAM,CAAC,GAAG,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC1C,MAAM,CAAC,GAAG,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,mDAAmD,EAAE,GAAG,EAAE;QAC5D,MAAM,UAAU,GAAG,CAAC,EAAE,aAAa,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,cAAc,CAAC,EAAE,CAAC,CAAC;QACnE,MAAM,OAAO,GAAG,CAAC,GAAG,CAAC,CAAC;QAEtB,MAAM,GAAG,GAAG,IAAI,OAAO,CAAC,EAAE,UAAU,EAAE,OAAO,EAAE,CAAC,CAAC;QACjD,GAAG,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;QAExB,MAAM,CAAC,GAAG,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC1C,MAAM,CAAC,GAAG,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,iBAAiB,EAAE,GAAG,EAAE;QAChC,EAAE,CAAC,yCAAyC,EAAE,GAAG,EAAE;YAClD,MAAM,UAAU,GAAG,CAAC,EAAE,aAAa,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,cAAc,CAAC,EAAE,CAAC,CAAC;YACnE,MAAM,OAAO,GAAG,CAAC,GAAG,CAAC,CAAC;YACtB,MAAM,GAAG,GAAG,IAAI,OAAO,CAAC,EAAE,UAAU,EAAE,OAAO,EAAE,CAAC,CAAC;YACjD,MAAM,CAAC,GAAG,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC9C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,wDAAwD,EAAE,GAAG,EAAE;YACjE,MAAM,UAAU,GAAG,CAAC,EAAE,aAAa,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,cAAc,CAAC,EAAE,CAAC,CAAC;YACnE,MAAM,OAAO,GAAG,CAAC,sCAAgD,CAAC,CAAC;YACnE,MAAM,GAAG,GAAG,IAAI,OAAO,CAAC,EAAE,UAAU,EAAE,OAAO,EAAE,CAAC,CAAC;YACjD,MAAM,CAAC,GAAG,CAAC,eAAe,CAAC,sCAAgD,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;QACnG,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,+BAA+B,EAAE,KAAK,IAAI,EAAE;QAC9C,MAAM,UAAU,GAAG,CAAC,EAAE,aAAa,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,cAAc,EAAE,cAAc,CAAC,EAAE,CAAC,CAAC;QACnF,MAAM,OAAO,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAE3B,MAAM,GAAG,GAAG,IAAI,OAAO,CAAC,EAAE,UAAU,EAAE,OAAO,EAAE,CAAC,CAAC;QAEjD,MAAM,CAAC,CAAC,MAAM,GAAG,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QACvD,MAAM,CAAC,CAAC,MAAM,GAAG,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IACxD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,iCAAiC,EAAE,KAAK,IAAI,EAAE;QAChD,MAAM,UAAU,GAAG,CAAC,EAAE,aAAa,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,cAAc,EAAE,cAAc,CAAC,EAAE,CAAC,CAAC;QACnF,MAAM,OAAO,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAE3B,MAAM,GAAG,GAAG,IAAI,OAAO,CAAC,EAAE,UAAU,EAAE,OAAO,EAAE,CAAC,CAAC;QAEjD,MAAM,WAAW,GAAG,MAAM,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;QAC9C,MAAM,WAAW,GAAG,MAAM,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;QAE9C,MAAM,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC;QACxC,MAAM,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC;QACxC,MAAM,CAAC,kBAAkB,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QAC9D,MAAM,CAAC,kBAAkB,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;IAC/D,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,iBAAiB,EAAE,GAAG,EAAE;QAC1B,MAAM,GAAG,GAAG,IAAI,OAAO,EAAE,CAAC;QAE1B,GAAG,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;QACxB,GAAG,CAAC,gBAAgB,CAAC,KAAK,EAAE,EAAE,cAAc,EAAE,CAAC,EAAE,uBAAuB,EAAE,CAAC,EAAE,CAAC,CAAC;QAE/E,wDAAwD;QACxD,MAAM,mBAAmB,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAEvC,GAAG,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,MAAM,EAAE,EAAE;YAC9B,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,mBAAmB,CAAC,GAAG,EAAE,CAAC,CAAC;QACpD,CAAC,CAAC,CAAC;QAEH,MAAM,CAAC,mBAAmB,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAChD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,yBAAyB,EAAE,GAAG,EAAE;QAClC,MAAM,GAAG,GAAG,IAAI,OAAO,EAAE,CAAC;QAE1B,GAAG,CAAC,gBAAgB,CAAC,KAAK,EAAE,EAAE,cAAc,EAAE,CAAC,EAAE,uBAAuB,EAAE,CAAC,EAAE,CAAC,CAAC;QAC/E,MAAM,CAAC,GAAG,CAAC,sBAAsB,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC/C,MAAM,CAAC,GAAG,CAAC,kBAAkB,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,uCAAuC,CAAC,CAAC;QAEpF,GAAG,CAAC,gBAAgB,CAAC,KAAK,EAAE,EAAE,cAAc,EAAE,CAAC,EAAE,uBAAuB,EAAE,CAAC,EAAE,CAAC,CAAC;QAC/E,MAAM,CAAC,GAAG,CAAC,sBAAsB,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC/C,MAAM,CAAC,GAAG,CAAC,kBAAkB,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,uCAAuC,CAAC,CAAC;QACpF,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAChC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,qBAAqB,EAAE,GAAG,EAAE;QAC9B,MAAM,GAAG,GAAG,IAAI,OAAO,EAAE,CAAC;QAE1B,GAAG,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;QACxB,MAAM,CAAC,GAAG,CAAC,kBAAkB,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC3C,MAAM,CAAC,GAAG,CAAC,sBAAsB,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,mCAAmC,CAAC,CAAC;QAEpF,GAAG,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;QACxB,MAAM,CAAC,GAAG,CAAC,kBAAkB,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC3C,MAAM,CAAC,GAAG,CAAC,sBAAsB,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,mCAAmC,CAAC,CAAC;QACpF,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAChC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,mDAAmD,EAAE,GAAG,EAAE;QAC5D,MAAM,GAAG,GAAG,IAAI,OAAO,EAAE,CAAC;QAE1B,MAAM,CAAC,GAAG,CAAC,iBAAiB,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACxC,GAAG,CAAC,gBAAgB,CAAC,KAAK,EAAE,EAAE,cAAc,EAAE,CAAC,EAAE,uBAAuB,EAAE,CAAC,EAAE,CAAC,CAAC;QAC/E,MAAM,CAAC,GAAG,CAAC,iBAAiB,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACxC,GAAG,CAAC,gBAAgB,CAAC,KAAK,EAAE,EAAE,cAAc,EAAE,EAAE,EAAE,uBAAuB,EAAE,EAAE,EAAE,qBAAqB,EAAE,EAAE,EAAE,CAAC,CAAC;QAC5G,MAAM,CAAC,GAAG,CAAC,iBAAiB,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACzC,MAAM,CAAC,GAAG,EAAE,CACX,GAAG,CAAC,gBAAgB,CAAC,WAAuC,EAAE;YAC7D,cAAc,EAAE,EAAE;YAClB,uBAAuB,EAAE,EAAE;SAC3B,CAAC,CACF,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;IACxB,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,oCAAoC,EAAE,GAAG,EAAE;QAC7C,MAAM,GAAG,GAAG,IAAI,OAAO,EAAE,CAAC;QAE1B,GAAG,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;QACxB,GAAG,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;QACxB,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,gBAAgB,CAAC,KAAK,EAAE,EAAE,cAAc,EAAE,CAAC,EAAE,uBAAuB,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;IACjH,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,2BAA2B,EAAE,KAAK,IAAI,EAAE;QAC1C,MAAM,GAAG,GAAG,IAAI,OAAO,EAAE,CAAC;QAE1B,GAAG,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;QACxB,MAAM,CAAC,GAAG,CAAC,kBAAkB,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC3C,IAAI,WAAW,GAAG,MAAM,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;QAC5C,MAAM,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC;QACxC,MAAM,CAAC,kBAAkB,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,EAAE,gCAAgC,CAAC,CAAC;QAE9F,GAAG,CAAC,gBAAgB,CAAC,KAAK,EAAE,EAAE,cAAc,EAAE,CAAC,EAAE,uBAAuB,EAAE,CAAC,EAAE,CAAC,CAAC;QAC/E,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC/B,MAAM,CAAC,GAAG,CAAC,sBAAsB,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC/C,MAAM,CAAC,GAAG,CAAC,kBAAkB,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,uCAAuC,CAAC,CAAC;QACpF,WAAW,GAAG,MAAM,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;QACxC,MAAM,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC;QACxC,MAAM,CAAC,kBAAkB,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,EAAE,oCAAoC,CAAC,CAAC;IACnG,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,qCAAqC,EAAE,KAAK,IAAI,EAAE;QACpD,MAAM,GAAG,GAAG,IAAI,OAAO,EAAE,CAAC;QAC1B,GAAG,CAAC,gBAAgB,CAAC,KAAK,EAAE,EAAE,cAAc,EAAE,CAAC,EAAE,uBAAuB,EAAE,CAAC,EAAE,CAAC,CAAC;QAC/E,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,gBAAgB,CAAC,KAAK,EAAE,EAAE,cAAc,EAAE,CAAC,EAAE,uBAAuB,EAAE,CAAC,EAAE,CAAC,CAAC;aAC1F,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC;aACf,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,SAAS,CAAC;aAC5B,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;IAC9B,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,mCAAmC,EAAE,KAAK,IAAI,EAAE;QAClD,MAAM,GAAG,GAAG,IAAI,OAAO,EAAE,CAAC;QAC1B,MAAM,GAAG,GAAa,EAAE,CAAC;QAEzB,MAAM,QAAQ,GAAG,EAAE,CAAC;QACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE;YAClC,MAAM,IAAI,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC;YACzB,GAAG,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;YACvB,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAClB,MAAM,CAAC,GAAG,CAAC,YAAY,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,uDAAuD,CAAC,CAAC;SACrG;QACD,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,kBAAkB,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,EAAE,qCAAqC,CAAC,CAAC;QAE9G,GAAG,CAAC,kBAAkB,EAAE,CAAC;QAEzB,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,sDAAsD,CAAC,CAAC;QAE/F,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC;aAChB,MAAM,CAAC,GAAG,CAAC,sBAAsB,CAAC;aAClC,GAAG,CAAC,MAAM,CAAC,QAAQ,EAAE,yCAAyC,CAAC,CAAC;IACnE,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,mDAAmD,EAAE,GAAG,EAAE;QAC5D,MAAM,SAAS,qBAAsB,KAAK,CAAE,CAAC;QAC7C,MAAM,SAAS,qBAAsB,KAAK,CAAE,CAAC;QAC7C,MAAM,EAAE,aAAa,EAAE,kBAAkB,EAAE,GAAG,iBAAiB,CAAC,SAAS,CAAC,CAAC;QAC3E,MAAM,EAAE,aAAa,EAAE,kBAAkB,EAAE,GAAG,iBAAiB,CAAC,SAAS,CAAC,CAAC;QAE3E,MAAM,UAAU,GAAG,CAAC,EAAE,aAAa,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,cAAc,EAAE,cAAc,CAAC,EAAE,CAAC,CAAC;QACnF,MAAM,cAAc,GAAG,CAAC,EAAE,aAAa,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,kBAAkB,EAAE,kBAAkB,CAAC,EAAE,CAAC,CAAC;QAC/F,MAAM,OAAO,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAE3B,MAAM,IAAI,GAAG,IAAI,OAAO,CAAC,EAAE,UAAU,EAAE,OAAO,EAAE,CAAC,CAAC;QAClD,MAAM,IAAI,GAAG,IAAI,OAAO,CAAC,EAAE,UAAU,EAAE,cAAc,EAAE,OAAO,EAAE,CAAC,CAAC;QAElE,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC;QAErC,MAAM,IAAI,GAAG,IAAI,OAAO,CAAS;YAChC,UAAU,EAAE,CAAC,EAAE,aAAa,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,cAAc,CAAC,EAAE,CAAC;YAC3D,OAAO,EAAE,CAAC,GAAG,CAAC;SACd,CAAC,CAAC;QACH,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC;QAE7B,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC;QAErC,MAAM,YAAY,GAAG,IAAI,OAAO,CAAC;YAChC,UAAU,EAAE,CAAC,EAAE,aAAa,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,cAAc,CAAC,EAAE,CAAC;YAC3D,OAAO,EAAE,CAAC,GAAG,CAAC;SACd,CAAC,CAAC;QAEH,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC;IAC/C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,gEAAgE,EAAE,GAAG,EAAE;QACzE,MAAM,GAAG,GAAG,IAAI,OAAO,EAAE,CAAC;QAE1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,aAAa,EAAE,CAAC,EAAE,EAAE;YAC3C,MAAM,IAAI,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC;YACzB,GAAG,CAAC,gBAAgB,CAAC,IAAI,EAAE,EAAE,cAAc,EAAE,CAAC,GAAG,CAAC,EAAE,uBAAuB,EAAE,CAAC,EAAE,CAAC,CAAC;YAClF,MAAM,CAAC,GAAG,CAAC,iBAAiB,EAAE,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;SACjE;QAED,MAAM,IAAI,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC;QACzB,GAAG,CAAC,gBAAgB,CAAC,IAAI,EAAE;YAC1B,cAAc,EAAE,GAAG,CAAC,aAAa;YACjC,uBAAuB,EAAE,GAAG,CAAC,aAAa,GAAG,CAAC;SAC9C,CAAC,CAAC;QACH,MAAM,CAAC,GAAG,CAAC,iBAAiB,EAAE,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAClE,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,8BAA8B,EAAE,KAAK,IAAI,EAAE;QAC7C,MAAM,GAAG,GAAG,wBAAwB,EAAE,CAAC;QAEvC,kDAAkD;QAClD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE;YAC5B,MAAM,CAAC,CAAC,MAAM,GAAG,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;SAClE;IACF,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,qDAAqD,EAAE,KAAK,IAAI,EAAE;QACpE,MAAM,cAAc,GAAG,CAAC,CAAC;QACzB,MAAM,aAAa,GAAG,CAAC,CAAC;QACxB,MAAM,GAAG,GAAG,wBAAwB,CAAC,cAAc,EAAE,aAAa,EAAE,GAAG,CAAC,CAAC;QAEzE,yCAAyC;QACzC,MAAM,GAAG,CAAC,cAAc,CAAC,cAAc,GAAG,aAAa,GAAG,CAAC,CAAC,CAAC;QAE7D,iDAAiD;QACjD,MAAM,IAAI,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC;QACzB,GAAG,CAAC,gBAAgB,CAAC,IAAI,EAAE;YAC1B,cAAc,EAAE,GAAG,CAAC,aAAa;YACjC,uBAAuB,EAAE,GAAG,CAAC,aAAa,GAAG,CAAC;SAC9C,CAAC,CAAC;QAEH,MAAM,CAAC,GAAG,CAAC,YAAY,CAAC,cAAc,GAAG,aAAa,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC5E,CAAC,CAAC,CAAC;AACJ,CAAC,CAAC,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { expect } from 'chai';\nimport { IsoBuffer } from '@fluidframework/common-utils';\nimport { EditHandle, EditLog, separateEditAndId } from '../EditLog';\nimport { Change } from '../default-edits';\nimport { EditId } from '../Identifiers';\nimport { assertNotUndefined } from '../Common';\nimport { newEdit, Edit, EditWithoutId } from '../generic';\n\n/**\n * Creates an edit log with the specified number of chunks, stored as handles instead of edits.\n * @param numberOfChunks - The number of chunks to add to the edit log.\n * @param editsPerChunk - The number of edits per chunk that gets added to the edit log.\n * @param editsPerChunkOnEditLog - The number of edits per chunk that gets set for future edits to the edit log.\n * @returns The edit log created with handles.\n */\nfunction createEditLogWithHandles(\n\tnumberOfChunks = 2,\n\teditsPerChunk = 5,\n\teditsPerChunkOnEditLog = 100\n): EditLog<Change> {\n\tconst editIds: EditId[] = [];\n\tconst editChunks: EditWithoutId<Change>[][] = [];\n\n\tlet inProgessChunk: EditWithoutId<Change>[] = [];\n\tfor (let i = 0; i < numberOfChunks * editsPerChunk; i++) {\n\t\tconst { id, editWithoutId } = separateEditAndId(newEdit([]));\n\t\teditIds.push(id);\n\n\t\tinProgessChunk.push(editWithoutId);\n\n\t\tif (inProgessChunk.length === editsPerChunk) {\n\t\t\teditChunks.push(inProgessChunk.slice());\n\t\t\tinProgessChunk = [];\n\t\t}\n\t}\n\n\tconst handles: EditHandle[] = editChunks.map((chunk) => {\n\t\treturn {\n\t\t\tget: async () => {\n\t\t\t\treturn IsoBuffer.from(JSON.stringify({ edits: chunk }));\n\t\t\t},\n\t\t};\n\t});\n\n\tlet startRevision = 0;\n\tconst handlesWithKeys = handles.map((chunk) => {\n\t\tconst handle = {\n\t\t\tstartRevision,\n\t\t\tchunk,\n\t\t};\n\t\tstartRevision = startRevision + 5;\n\t\treturn handle;\n\t});\n\n\tconst editLog = new EditLog<Change>({ editChunks: handlesWithKeys, editIds }, undefined, editsPerChunkOnEditLog);\n\n\treturn editLog;\n}\n\ndescribe('EditLog', () => {\n\tconst edit0 = newEdit([]);\n\tconst edit1 = newEdit([]);\n\tconst { id: id0, editWithoutId: editWithoutId0 } = separateEditAndId(edit0);\n\tconst { id: id1, editWithoutId: editWithoutId1 } = separateEditAndId(edit1);\n\n\tit('can be constructed from sequenced edits', () => {\n\t\tconst editChunks = [{ startRevision: 0, chunk: [editWithoutId0, editWithoutId1] }];\n\t\tconst editIds = [id0, id1];\n\n\t\tconst log = new EditLog({ editChunks, editIds });\n\t\texpect(log.numberOfLocalEdits).to.equal(0, 'Newly initialized log should not have local edits.');\n\t\texpect(log.numberOfSequencedEdits).to.equal(\n\t\t\teditChunks[0].chunk.length,\n\t\t\t'Log should have as many sequenced edits as it was initialized with.'\n\t\t);\n\t\texpect(log.length).to.equal(\n\t\t\teditChunks[0].chunk.length,\n\t\t\t\"Log's total length should match its sequenced edits on construction\"\n\t\t);\n\n\t\texpect(log.getIdAtIndex(0)).to.equal(id0, 'Log should have edits in order of construction.');\n\t\texpect(log.getIdAtIndex(1)).to.equal(id1, 'Log should have edits in order of construction.');\n\t});\n\n\tit('can get the index from an edit id of sequenced edits', () => {\n\t\tconst editChunks = [{ startRevision: 0, chunk: [editWithoutId0, editWithoutId1] }];\n\t\tconst editIds = [id0, id1];\n\n\t\tconst log = new EditLog({ editChunks, editIds });\n\n\t\texpect(log.getIndexOfId(id0)).to.equal(0);\n\t\texpect(log.getIndexOfId(id1)).to.equal(1);\n\t});\n\n\tit('can get the index from an edit id of a local edit', () => {\n\t\tconst editChunks = [{ startRevision: 0, chunk: [editWithoutId0] }];\n\t\tconst editIds = [id0];\n\n\t\tconst log = new EditLog({ editChunks, editIds });\n\t\tlog.addLocalEdit(edit1);\n\n\t\texpect(log.getIndexOfId(id0)).to.equal(0);\n\t\texpect(log.getIndexOfId(id1)).to.equal(1);\n\t});\n\n\tdescribe('tryGetIndexOfId', () => {\n\t\tit('can get the index from an existing edit', () => {\n\t\t\tconst editChunks = [{ startRevision: 0, chunk: [editWithoutId0] }];\n\t\t\tconst editIds = [id0];\n\t\t\tconst log = new EditLog({ editChunks, editIds });\n\t\t\texpect(log.tryGetIndexOfId(id0)).to.equal(0);\n\t\t});\n\n\t\tit('returns undefined when queried with a nonexistent edit', () => {\n\t\t\tconst editChunks = [{ startRevision: 0, chunk: [editWithoutId0] }];\n\t\t\tconst editIds = ['f9379af1-6f1a-4f71-8f8c-859359621404' as EditId];\n\t\t\tconst log = new EditLog({ editChunks, editIds });\n\t\t\texpect(log.tryGetIndexOfId('aa203fc3-bc28-437d-b01c-f9398dc859ef' as EditId)).to.equal(undefined);\n\t\t});\n\t});\n\n\tit('can get an edit from an index', async () => {\n\t\tconst editChunks = [{ startRevision: 0, chunk: [editWithoutId0, editWithoutId1] }];\n\t\tconst editIds = [id0, id1];\n\n\t\tconst log = new EditLog({ editChunks, editIds });\n\n\t\texpect((await log.getEditAtIndex(0)).id).to.equal(id0);\n\t\texpect((await log.getEditAtIndex(1)).id).to.equal(id1);\n\t});\n\n\tit('can get an edit from an edit id', async () => {\n\t\tconst editChunks = [{ startRevision: 0, chunk: [editWithoutId0, editWithoutId1] }];\n\t\tconst editIds = [id0, id1];\n\n\t\tconst log = new EditLog({ editChunks, editIds });\n\n\t\tconst editFromId0 = await log.tryGetEdit(id0);\n\t\tconst editFromId1 = await log.tryGetEdit(id1);\n\n\t\texpect(editFromId0).to.not.be.undefined;\n\t\texpect(editFromId1).to.not.be.undefined;\n\t\texpect(assertNotUndefined(editFromId0).id).to.equal(edit0.id);\n\t\texpect(assertNotUndefined(editFromId1).id).to.equal(edit1.id);\n\t});\n\n\tit('can be iterated', () => {\n\t\tconst log = new EditLog();\n\n\t\tlog.addLocalEdit(edit1);\n\t\tlog.addSequencedEdit(edit0, { sequenceNumber: 1, referenceSequenceNumber: 0 });\n\n\t\t// Sequenced edits should be iterated before local edits\n\t\tconst expectedEditIdStack = [id1, id0];\n\n\t\tlog.editIds.forEach((editId) => {\n\t\t\texpect(editId).to.equal(expectedEditIdStack.pop());\n\t\t});\n\n\t\texpect(expectedEditIdStack.length).to.equal(0);\n\t});\n\n\tit('can add sequenced edits', () => {\n\t\tconst log = new EditLog();\n\n\t\tlog.addSequencedEdit(edit0, { sequenceNumber: 1, referenceSequenceNumber: 0 });\n\t\texpect(log.numberOfSequencedEdits).to.equal(1);\n\t\texpect(log.numberOfLocalEdits).to.equal(0, 'Log should have only sequenced edits.');\n\n\t\tlog.addSequencedEdit(edit1, { sequenceNumber: 2, referenceSequenceNumber: 1 });\n\t\texpect(log.numberOfSequencedEdits).to.equal(2);\n\t\texpect(log.numberOfLocalEdits).to.equal(0, 'Log should have only sequenced edits.');\n\t\texpect(log.length).to.equal(2);\n\t});\n\n\tit('can add local edits', () => {\n\t\tconst log = new EditLog();\n\n\t\tlog.addLocalEdit(edit0);\n\t\texpect(log.numberOfLocalEdits).to.equal(1);\n\t\texpect(log.numberOfSequencedEdits).to.equal(0, 'Log should have only local edits.');\n\n\t\tlog.addLocalEdit(edit1);\n\t\texpect(log.numberOfLocalEdits).to.equal(2);\n\t\texpect(log.numberOfSequencedEdits).to.equal(0, 'Log should have only local edits.');\n\t\texpect(log.length).to.equal(2);\n\t});\n\n\tit('tracks the min sequence number of sequenced edits', () => {\n\t\tconst log = new EditLog();\n\n\t\texpect(log.minSequenceNumber).equals(0);\n\t\tlog.addSequencedEdit(edit0, { sequenceNumber: 1, referenceSequenceNumber: 0 });\n\t\texpect(log.minSequenceNumber).equals(0);\n\t\tlog.addSequencedEdit(edit1, { sequenceNumber: 43, referenceSequenceNumber: 42, minimumSequenceNumber: 42 });\n\t\texpect(log.minSequenceNumber).equals(42);\n\t\texpect(() =>\n\t\t\tlog.addSequencedEdit('fake-edit' as unknown as Edit<unknown>, {\n\t\t\t\tsequenceNumber: 44,\n\t\t\t\treferenceSequenceNumber: 43,\n\t\t\t})\n\t\t).throws('min number');\n\t});\n\n\tit('detects causal ordering violations', () => {\n\t\tconst log = new EditLog();\n\n\t\tlog.addLocalEdit(edit0);\n\t\tlog.addLocalEdit(edit1);\n\t\texpect(() => log.addSequencedEdit(edit1, { sequenceNumber: 1, referenceSequenceNumber: 0 })).throws('ordering');\n\t});\n\n\tit('can sequence a local edit', async () => {\n\t\tconst log = new EditLog();\n\n\t\tlog.addLocalEdit(edit0);\n\t\texpect(log.numberOfLocalEdits).to.equal(1);\n\t\tlet editFromId0 = await log.tryGetEdit(id0);\n\t\texpect(editFromId0).to.not.be.undefined;\n\t\texpect(assertNotUndefined(editFromId0).id).equals(edit0.id, 'Log should contain local edit.');\n\n\t\tlog.addSequencedEdit(edit0, { sequenceNumber: 1, referenceSequenceNumber: 0 });\n\t\texpect(log.length).to.equal(1);\n\t\texpect(log.numberOfSequencedEdits).to.equal(1);\n\t\texpect(log.numberOfLocalEdits).to.equal(0, 'Log should have only sequenced edits.');\n\t\teditFromId0 = await log.tryGetEdit(id0);\n\t\texpect(editFromId0).to.not.be.undefined;\n\t\texpect(assertNotUndefined(editFromId0).id).equals(edit0.id, 'Log should contain sequenced edit.');\n\t});\n\n\tit('Throws on duplicate sequenced edits', async () => {\n\t\tconst log = new EditLog();\n\t\tlog.addSequencedEdit(edit0, { sequenceNumber: 1, referenceSequenceNumber: 0 });\n\t\texpect(() => log.addSequencedEdit(edit0, { sequenceNumber: 1, referenceSequenceNumber: 0 }))\n\t\t\t.to.throw(Error)\n\t\t\t.that.has.property('message')\n\t\t\t.which.matches(/Duplicate/);\n\t});\n\n\tit('can sequence multiple local edits', async () => {\n\t\tconst log = new EditLog();\n\t\tconst ids: EditId[] = [];\n\n\t\tconst numEdits = 10;\n\t\tfor (let i = 0; i < numEdits; i++) {\n\t\t\tconst edit = newEdit([]);\n\t\t\tlog.addLocalEdit(edit);\n\t\t\tids.push(edit.id);\n\t\t\texpect(log.getIndexOfId(edit.id)).equals(i, 'Local edits should be appended to the end of the log.');\n\t\t}\n\t\texpect(log.length).equals(log.numberOfLocalEdits).and.equals(numEdits, 'Only local edits should be present.');\n\n\t\tlog.sequenceLocalEdits();\n\n\t\texpect(log.editIds).to.deep.equal(ids, 'Sequencing a local edit should not change its index.');\n\n\t\texpect(log.length)\n\t\t\t.equals(log.numberOfSequencedEdits)\n\t\t\t.and.equals(numEdits, 'Only sequenced edits should be present.');\n\t});\n\n\tit('can correctly compare equality to other edit logs', () => {\n\t\tconst edit0Copy: Edit<Change> = { ...edit0 };\n\t\tconst edit1Copy: Edit<Change> = { ...edit1 };\n\t\tconst { editWithoutId: editWithoutId0Copy } = separateEditAndId(edit0Copy);\n\t\tconst { editWithoutId: editWithoutId1Copy } = separateEditAndId(edit1Copy);\n\n\t\tconst editChunks = [{ startRevision: 0, chunk: [editWithoutId0, editWithoutId1] }];\n\t\tconst editChunksCopy = [{ startRevision: 0, chunk: [editWithoutId0Copy, editWithoutId1Copy] }];\n\t\tconst editIds = [id0, id1];\n\n\t\tconst log0 = new EditLog({ editChunks, editIds });\n\t\tconst log1 = new EditLog({ editChunks: editChunksCopy, editIds });\n\n\t\texpect(log0.equals(log1)).to.be.true;\n\n\t\tconst log2 = new EditLog<Change>({\n\t\t\teditChunks: [{ startRevision: 0, chunk: [editWithoutId0] }],\n\t\t\teditIds: [id0],\n\t\t});\n\t\tlog2.addLocalEdit(edit1Copy);\n\n\t\texpect(log0.equals(log2)).to.be.true;\n\n\t\tconst differentLog = new EditLog({\n\t\t\teditChunks: [{ startRevision: 0, chunk: [editWithoutId0] }],\n\t\t\teditIds: [id0],\n\t\t});\n\n\t\texpect(log0.equals(differentLog)).to.be.false;\n\t});\n\n\tit('creates a new edit chunk once the previous one has been filled', () => {\n\t\tconst log = new EditLog();\n\n\t\tfor (let i = 0; i < log.editsPerChunk; i++) {\n\t\t\tconst edit = newEdit([]);\n\t\t\tlog.addSequencedEdit(edit, { sequenceNumber: i + 1, referenceSequenceNumber: i });\n\t\t\texpect(log.getEditLogSummary().editChunks.length).to.be.equal(1);\n\t\t}\n\n\t\tconst edit = newEdit([]);\n\t\tlog.addSequencedEdit(edit, {\n\t\t\tsequenceNumber: log.editsPerChunk,\n\t\t\treferenceSequenceNumber: log.editsPerChunk - 1,\n\t\t});\n\t\texpect(log.getEditLogSummary().editChunks.length).to.be.equal(2);\n\t});\n\n\tit('can load edits from a handle', async () => {\n\t\tconst log = createEditLogWithHandles();\n\n\t\t// Check that each edit can be retrieved correctly\n\t\tfor (let i = 0; i < 10; i++) {\n\t\t\texpect((await log.getEditAtIndex(i)).id).to.equal(log.editIds[i]);\n\t\t}\n\t});\n\n\tit('can add edits to logs with varying edit chunk sizes', async () => {\n\t\tconst numberOfChunks = 2;\n\t\tconst editsPerChunk = 5;\n\t\tconst log = createEditLogWithHandles(numberOfChunks, editsPerChunk, 100);\n\n\t\t// Load the edits for the last edit chunk\n\t\tawait log.getEditAtIndex(numberOfChunks * editsPerChunk - 1);\n\n\t\t// Add a sequenced edit and check it's been added\n\t\tconst edit = newEdit([]);\n\t\tlog.addSequencedEdit(edit, {\n\t\t\tsequenceNumber: log.editsPerChunk,\n\t\t\treferenceSequenceNumber: log.editsPerChunk - 1,\n\t\t});\n\n\t\texpect(log.getIdAtIndex(numberOfChunks * editsPerChunk)).to.equal(edit.id);\n\t});\n});\n"]}
+{"version":3,"file":"EditLog.tests.js","sourceRoot":"","sources":["../../src/test/EditLog.tests.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,MAAM,CAAC;AAC9B,OAAO,EAAE,SAAS,EAAE,MAAM,8BAA8B,CAAC;AACzD,OAAO,EAAE,OAAO,EAAE,iBAAiB,EAAE,MAAM,YAAY,CAAC;AAExD,OAAO,EAAE,kBAAkB,EAAE,MAAM,WAAW,CAAC;AAE/C,OAAO,EAAE,OAAO,EAAE,MAAM,kBAAkB,CAAC;AAI3C;;;;;;GAMG;AACH,SAAS,wBAAwB,CAAC,cAAc,GAAG,CAAC,EAAE,aAAa,GAAG,CAAC;IACtE,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,MAAM,UAAU,GAAmC,EAAE,CAAC;IAEtD,IAAI,cAAc,GAAiC,EAAE,CAAC;IACtD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,cAAc,GAAG,aAAa,EAAE,CAAC,EAAE,EAAE;QACxD,MAAM,EAAE,EAAE,EAAE,aAAa,EAAE,GAAG,iBAAiB,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC;QAC7D,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAEjB,cAAc,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;QAEnC,IAAI,cAAc,CAAC,MAAM,KAAK,aAAa,EAAE;YAC5C,UAAU,CAAC,IAAI,CAAC,cAAc,CAAC,KAAK,EAAE,CAAC,CAAC;YACxC,cAAc,GAAG,EAAE,CAAC;SACpB;KACD;IAED,MAAM,OAAO,GAAsB,UAAU,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE;QAC3D,OAAO;YACN,YAAY,EAAE,WAAW;YACzB,GAAG,EAAE,KAAK,IAAI,EAAE;gBACf,OAAO,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC;YACzD,CAAC;SACD,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAI,aAAa,GAAG,CAAC,CAAC;IACtB,MAAM,eAAe,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,UAAU,EAAE,EAAE;QAClD,MAAM,MAAM,GAAG;YACd,aAAa;YACb,KAAK,EAAE;gBACN,GAAG,EAAE,KAAK,IAAI,EAAE,CAEd,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,UAAU,CAAC,GAAG,EAAE,CAAC,CAAC,QAAQ,EAAE,CAI5D,CAAC,KAAK;gBACR,UAAU;aACV;SACD,CAAC;QACF,aAAa,GAAG,aAAa,GAAG,CAAC,CAAC;QAClC,OAAO,MAAM,CAAC;IACf,CAAC,CAAC,CAAC;IAEH,MAAM,OAAO,GAAG,IAAI,OAAO,CAAC,EAAE,UAAU,EAAE,eAAe,EAAE,OAAO,EAAE,CAAC,CAAC;IAEtE,OAAO,OAAO,CAAC;AAChB,CAAC;AAED,QAAQ,CAAC,SAAS,EAAE,GAAG,EAAE;IACxB,MAAM,KAAK,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC;IAC1B,MAAM,KAAK,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC;IAC1B,MAAM,EAAE,EAAE,EAAE,GAAG,EAAE,aAAa,EAAE,cAAc,EAAE,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC;IAC5E,MAAM,EAAE,EAAE,EAAE,GAAG,EAAE,aAAa,EAAE,cAAc,EAAE,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC;IAE5E,EAAE,CAAC,yCAAyC,EAAE,GAAG,EAAE;QAClD,MAAM,UAAU,GAAG,CAAC,EAAE,aAAa,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,cAAc,EAAE,cAAc,CAAC,EAAE,CAAC,CAAC;QACnF,MAAM,OAAO,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAE3B,MAAM,GAAG,GAAG,IAAI,OAAO,CAAC,EAAE,UAAU,EAAE,OAAO,EAAE,CAAC,CAAC;QACjD,MAAM,CAAC,GAAG,CAAC,kBAAkB,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,oDAAoD,CAAC,CAAC;QACjG,MAAM,CAAC,GAAG,CAAC,sBAAsB,CAAC,CAAC,EAAE,CAAC,KAAK,CAC1C,UAAU,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,EAC1B,qEAAqE,CACrE,CAAC;QACF,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAC1B,UAAU,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,EAC1B,qEAAqE,CACrE,CAAC;QAEF,MAAM,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,EAAE,iDAAiD,CAAC,CAAC;QAC7F,MAAM,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,EAAE,iDAAiD,CAAC,CAAC;IAC9F,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,sDAAsD,EAAE,GAAG,EAAE;QAC/D,MAAM,UAAU,GAAG,CAAC,EAAE,aAAa,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,cAAc,EAAE,cAAc,CAAC,EAAE,CAAC,CAAC;QACnF,MAAM,OAAO,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAE3B,MAAM,GAAG,GAAG,IAAI,OAAO,CAAC,EAAE,UAAU,EAAE,OAAO,EAAE,CAAC,CAAC;QAEjD,MAAM,CAAC,GAAG,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC1C,MAAM,CAAC,GAAG,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,mDAAmD,EAAE,GAAG,EAAE;QAC5D,MAAM,UAAU,GAAG,CAAC,EAAE,aAAa,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,cAAc,CAAC,EAAE,CAAC,CAAC;QACnE,MAAM,OAAO,GAAG,CAAC,GAAG,CAAC,CAAC;QAEtB,MAAM,GAAG,GAAG,IAAI,OAAO,CAAC,EAAE,UAAU,EAAE,OAAO,EAAE,CAAC,CAAC;QACjD,GAAG,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;QAExB,MAAM,CAAC,GAAG,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC1C,MAAM,CAAC,GAAG,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,iBAAiB,EAAE,GAAG,EAAE;QAChC,EAAE,CAAC,yCAAyC,EAAE,GAAG,EAAE;YAClD,MAAM,UAAU,GAAG,CAAC,EAAE,aAAa,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,cAAc,CAAC,EAAE,CAAC,CAAC;YACnE,MAAM,OAAO,GAAG,CAAC,GAAG,CAAC,CAAC;YACtB,MAAM,GAAG,GAAG,IAAI,OAAO,CAAC,EAAE,UAAU,EAAE,OAAO,EAAE,CAAC,CAAC;YACjD,MAAM,CAAC,GAAG,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC9C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,wDAAwD,EAAE,GAAG,EAAE;YACjE,MAAM,UAAU,GAAG,CAAC,EAAE,aAAa,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,cAAc,CAAC,EAAE,CAAC,CAAC;YACnE,MAAM,OAAO,GAAG,CAAC,sCAAgD,CAAC,CAAC;YACnE,MAAM,GAAG,GAAG,IAAI,OAAO,CAAC,EAAE,UAAU,EAAE,OAAO,EAAE,CAAC,CAAC;YACjD,MAAM,CAAC,GAAG,CAAC,eAAe,CAAC,sCAAgD,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;QACnG,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,+BAA+B,EAAE,KAAK,IAAI,EAAE;QAC9C,MAAM,UAAU,GAAG,CAAC,EAAE,aAAa,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,cAAc,EAAE,cAAc,CAAC,EAAE,CAAC,CAAC;QACnF,MAAM,OAAO,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAE3B,MAAM,GAAG,GAAG,IAAI,OAAO,CAAC,EAAE,UAAU,EAAE,OAAO,EAAE,CAAC,CAAC;QAEjD,MAAM,CAAC,CAAC,MAAM,GAAG,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QACvD,MAAM,CAAC,CAAC,MAAM,GAAG,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IACxD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,iCAAiC,EAAE,KAAK,IAAI,EAAE;QAChD,MAAM,UAAU,GAAG,CAAC,EAAE,aAAa,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,cAAc,EAAE,cAAc,CAAC,EAAE,CAAC,CAAC;QACnF,MAAM,OAAO,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAE3B,MAAM,GAAG,GAAG,IAAI,OAAO,CAAC,EAAE,UAAU,EAAE,OAAO,EAAE,CAAC,CAAC;QAEjD,MAAM,WAAW,GAAG,MAAM,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;QAC9C,MAAM,WAAW,GAAG,MAAM,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;QAE9C,MAAM,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC;QACxC,MAAM,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC;QACxC,MAAM,CAAC,kBAAkB,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QAC9D,MAAM,CAAC,kBAAkB,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;IAC/D,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,iBAAiB,EAAE,GAAG,EAAE;QAC1B,MAAM,GAAG,GAAG,IAAI,OAAO,EAAE,CAAC;QAE1B,GAAG,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;QACxB,GAAG,CAAC,gBAAgB,CAAC,KAAK,EAAE,EAAE,cAAc,EAAE,CAAC,EAAE,uBAAuB,EAAE,CAAC,EAAE,CAAC,CAAC;QAE/E,wDAAwD;QACxD,MAAM,mBAAmB,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAEvC,GAAG,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,MAAM,EAAE,EAAE;YAC9B,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,mBAAmB,CAAC,GAAG,EAAE,CAAC,CAAC;QACpD,CAAC,CAAC,CAAC;QAEH,MAAM,CAAC,mBAAmB,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAChD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,yBAAyB,EAAE,GAAG,EAAE;QAClC,MAAM,GAAG,GAAG,IAAI,OAAO,EAAE,CAAC;QAE1B,GAAG,CAAC,gBAAgB,CAAC,KAAK,EAAE,EAAE,cAAc,EAAE,CAAC,EAAE,uBAAuB,EAAE,CAAC,EAAE,CAAC,CAAC;QAC/E,MAAM,CAAC,GAAG,CAAC,sBAAsB,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC/C,MAAM,CAAC,GAAG,CAAC,kBAAkB,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,uCAAuC,CAAC,CAAC;QAEpF,GAAG,CAAC,gBAAgB,CAAC,KAAK,EAAE,EAAE,cAAc,EAAE,CAAC,EAAE,uBAAuB,EAAE,CAAC,EAAE,CAAC,CAAC;QAC/E,MAAM,CAAC,GAAG,CAAC,sBAAsB,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC/C,MAAM,CAAC,GAAG,CAAC,kBAAkB,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,uCAAuC,CAAC,CAAC;QACpF,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAChC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,qBAAqB,EAAE,GAAG,EAAE;QAC9B,MAAM,GAAG,GAAG,IAAI,OAAO,EAAE,CAAC;QAE1B,GAAG,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;QACxB,MAAM,CAAC,GAAG,CAAC,kBAAkB,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC3C,MAAM,CAAC,GAAG,CAAC,sBAAsB,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,mCAAmC,CAAC,CAAC;QAEpF,GAAG,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;QACxB,MAAM,CAAC,GAAG,CAAC,kBAAkB,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC3C,MAAM,CAAC,GAAG,CAAC,sBAAsB,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,mCAAmC,CAAC,CAAC;QACpF,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAChC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,mDAAmD,EAAE,GAAG,EAAE;QAC5D,MAAM,GAAG,GAAG,IAAI,OAAO,EAAE,CAAC;QAE1B,MAAM,CAAC,GAAG,CAAC,iBAAiB,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACxC,GAAG,CAAC,gBAAgB,CAAC,KAAK,EAAE,EAAE,cAAc,EAAE,CAAC,EAAE,uBAAuB,EAAE,CAAC,EAAE,CAAC,CAAC;QAC/E,MAAM,CAAC,GAAG,CAAC,iBAAiB,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACxC,GAAG,CAAC,gBAAgB,CAAC,KAAK,EAAE,EAAE,cAAc,EAAE,EAAE,EAAE,uBAAuB,EAAE,EAAE,EAAE,qBAAqB,EAAE,EAAE,EAAE,CAAC,CAAC;QAC5G,MAAM,CAAC,GAAG,CAAC,iBAAiB,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACzC,MAAM,CAAC,GAAG,EAAE,CACX,GAAG,CAAC,gBAAgB,CAAC,WAAuC,EAAE;YAC7D,cAAc,EAAE,EAAE;YAClB,uBAAuB,EAAE,EAAE;SAC3B,CAAC,CACF,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;IACxB,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,oCAAoC,EAAE,GAAG,EAAE;QAC7C,MAAM,GAAG,GAAG,IAAI,OAAO,EAAE,CAAC;QAE1B,GAAG,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;QACxB,GAAG,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;QACxB,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,gBAAgB,CAAC,KAAK,EAAE,EAAE,cAAc,EAAE,CAAC,EAAE,uBAAuB,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;IACjH,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,2BAA2B,EAAE,KAAK,IAAI,EAAE;QAC1C,MAAM,GAAG,GAAG,IAAI,OAAO,EAAE,CAAC;QAE1B,GAAG,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;QACxB,MAAM,CAAC,GAAG,CAAC,kBAAkB,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC3C,IAAI,WAAW,GAAG,MAAM,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;QAC5C,MAAM,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC;QACxC,MAAM,CAAC,kBAAkB,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,EAAE,gCAAgC,CAAC,CAAC;QAE9F,GAAG,CAAC,gBAAgB,CAAC,KAAK,EAAE,EAAE,cAAc,EAAE,CAAC,EAAE,uBAAuB,EAAE,CAAC,EAAE,CAAC,CAAC;QAC/E,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC/B,MAAM,CAAC,GAAG,CAAC,sBAAsB,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC/C,MAAM,CAAC,GAAG,CAAC,kBAAkB,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,uCAAuC,CAAC,CAAC;QACpF,WAAW,GAAG,MAAM,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;QACxC,MAAM,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC;QACxC,MAAM,CAAC,kBAAkB,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,EAAE,oCAAoC,CAAC,CAAC;IACnG,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,qCAAqC,EAAE,KAAK,IAAI,EAAE;QACpD,MAAM,GAAG,GAAG,IAAI,OAAO,EAAE,CAAC;QAC1B,GAAG,CAAC,gBAAgB,CAAC,KAAK,EAAE,EAAE,cAAc,EAAE,CAAC,EAAE,uBAAuB,EAAE,CAAC,EAAE,CAAC,CAAC;QAC/E,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,gBAAgB,CAAC,KAAK,EAAE,EAAE,cAAc,EAAE,CAAC,EAAE,uBAAuB,EAAE,CAAC,EAAE,CAAC,CAAC;aAC1F,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC;aACf,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,SAAS,CAAC;aAC5B,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;IAC9B,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,mCAAmC,EAAE,KAAK,IAAI,EAAE;QAClD,MAAM,GAAG,GAAG,IAAI,OAAO,EAAE,CAAC;QAC1B,MAAM,GAAG,GAAa,EAAE,CAAC;QAEzB,MAAM,QAAQ,GAAG,EAAE,CAAC;QACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE;YAClC,MAAM,IAAI,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC;YACzB,GAAG,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;YACvB,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAClB,MAAM,CAAC,GAAG,CAAC,YAAY,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,uDAAuD,CAAC,CAAC;SACrG;QACD,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,kBAAkB,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,EAAE,qCAAqC,CAAC,CAAC;QAE9G,GAAG,CAAC,kBAAkB,EAAE,CAAC;QAEzB,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,sDAAsD,CAAC,CAAC;QAE/F,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC;aAChB,MAAM,CAAC,GAAG,CAAC,sBAAsB,CAAC;aAClC,GAAG,CAAC,MAAM,CAAC,QAAQ,EAAE,yCAAyC,CAAC,CAAC;IACnE,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,mDAAmD,EAAE,GAAG,EAAE;QAC5D,MAAM,SAAS,qBAA2B,KAAK,CAAE,CAAC;QAClD,MAAM,SAAS,qBAA2B,KAAK,CAAE,CAAC;QAClD,MAAM,EAAE,aAAa,EAAE,kBAAkB,EAAE,GAAG,iBAAiB,CAAC,SAAS,CAAC,CAAC;QAC3E,MAAM,EAAE,aAAa,EAAE,kBAAkB,EAAE,GAAG,iBAAiB,CAAC,SAAS,CAAC,CAAC;QAE3E,MAAM,UAAU,GAAG,CAAC,EAAE,aAAa,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,cAAc,EAAE,cAAc,CAAC,EAAE,CAAC,CAAC;QACnF,MAAM,cAAc,GAAG,CAAC,EAAE,aAAa,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,kBAAkB,EAAE,kBAAkB,CAAC,EAAE,CAAC,CAAC;QAC/F,MAAM,OAAO,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAE3B,MAAM,IAAI,GAAG,IAAI,OAAO,CAAC,EAAE,UAAU,EAAE,OAAO,EAAE,CAAC,CAAC;QAClD,MAAM,IAAI,GAAG,IAAI,OAAO,CAAC,EAAE,UAAU,EAAE,cAAc,EAAE,OAAO,EAAE,CAAC,CAAC;QAElE,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC;QAErC,MAAM,IAAI,GAAG,IAAI,OAAO,CAAc;YACrC,UAAU,EAAE,CAAC,EAAE,aAAa,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,cAAc,CAAC,EAAE,CAAC;YAC3D,OAAO,EAAE,CAAC,GAAG,CAAC;SACd,CAAC,CAAC;QACH,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC;QAE7B,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC;QAErC,MAAM,YAAY,GAAG,IAAI,OAAO,CAAC;YAChC,UAAU,EAAE,CAAC,EAAE,aAAa,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,cAAc,CAAC,EAAE,CAAC;YAC3D,OAAO,EAAE,CAAC,GAAG,CAAC;SACd,CAAC,CAAC;QAEH,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC;IAC/C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,gEAAgE,EAAE,GAAG,EAAE;QACzE,MAAM,GAAG,GAAG,IAAI,OAAO,EAAE,CAAC;QAE1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,aAAa,EAAE,CAAC,EAAE,EAAE;YAC3C,MAAM,IAAI,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC;YACzB,GAAG,CAAC,gBAAgB,CAAC,IAAI,EAAE,EAAE,cAAc,EAAE,CAAC,GAAG,CAAC,EAAE,uBAAuB,EAAE,CAAC,EAAE,CAAC,CAAC;YAClF,MAAM,CAAC,GAAG,CAAC,iBAAiB,EAAE,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;SACjE;QAED,MAAM,IAAI,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC;QACzB,GAAG,CAAC,gBAAgB,CAAC,IAAI,EAAE;YAC1B,cAAc,EAAE,GAAG,CAAC,aAAa;YACjC,uBAAuB,EAAE,GAAG,CAAC,aAAa,GAAG,CAAC;SAC9C,CAAC,CAAC;QACH,MAAM,CAAC,GAAG,CAAC,iBAAiB,EAAE,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAClE,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,8BAA8B,EAAE,KAAK,IAAI,EAAE;QAC7C,MAAM,GAAG,GAAG,wBAAwB,EAAE,CAAC;QAEvC,kDAAkD;QAClD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE;YAC5B,MAAM,CAAC,CAAC,MAAM,GAAG,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;SAClE;IACF,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,qDAAqD,EAAE,KAAK,IAAI,EAAE;QACpE,MAAM,cAAc,GAAG,CAAC,CAAC;QACzB,MAAM,aAAa,GAAG,CAAC,CAAC;QACxB,MAAM,GAAG,GAAG,wBAAwB,CAAC,cAAc,EAAE,aAAa,CAAC,CAAC;QAEpE,yCAAyC;QACzC,MAAM,GAAG,CAAC,cAAc,CAAC,cAAc,GAAG,aAAa,GAAG,CAAC,CAAC,CAAC;QAE7D,iDAAiD;QACjD,MAAM,IAAI,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC;QACzB,GAAG,CAAC,gBAAgB,CAAC,IAAI,EAAE;YAC1B,cAAc,EAAE,GAAG,CAAC,aAAa;YACjC,uBAAuB,EAAE,GAAG,CAAC,aAAa,GAAG,CAAC;SAC9C,CAAC,CAAC;QAEH,MAAM,CAAC,GAAG,CAAC,YAAY,CAAC,cAAc,GAAG,aAAa,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC5E,CAAC,CAAC,CAAC;AACJ,CAAC,CAAC,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { expect } from 'chai';\nimport { IsoBuffer } from '@fluidframework/common-utils';\nimport { EditLog, separateEditAndId } from '../EditLog';\nimport { EditId } from '../Identifiers';\nimport { assertNotUndefined } from '../Common';\nimport { Edit, EditChunkContents, EditWithoutId, FluidEditHandle } from '../persisted-types';\nimport { newEdit } from '../EditUtilities';\n\ntype DummyChange = never;\n\n/**\n * Creates an edit log with the specified number of chunks, stored as handles instead of edits.\n * @param numberOfChunks - The number of chunks to add to the edit log.\n * @param editsPerChunk - The number of edits per chunk that gets added to the edit log.\n * @param editsPerChunkOnEditLog - The number of edits per chunk that gets set for future edits to the edit log.\n * @returns The edit log created with handles.\n */\nfunction createEditLogWithHandles(numberOfChunks = 2, editsPerChunk = 5): EditLog<DummyChange> {\n\tconst editIds: EditId[] = [];\n\tconst editChunks: EditWithoutId<DummyChange>[][] = [];\n\n\tlet inProgessChunk: EditWithoutId<DummyChange>[] = [];\n\tfor (let i = 0; i < numberOfChunks * editsPerChunk; i++) {\n\t\tconst { id, editWithoutId } = separateEditAndId(newEdit([]));\n\t\teditIds.push(id);\n\n\t\tinProgessChunk.push(editWithoutId);\n\n\t\tif (inProgessChunk.length === editsPerChunk) {\n\t\t\teditChunks.push(inProgessChunk.slice());\n\t\t\tinProgessChunk = [];\n\t\t}\n\t}\n\n\tconst handles: FluidEditHandle[] = editChunks.map((chunk) => {\n\t\treturn {\n\t\t\tabsolutePath: 'test blob',\n\t\t\tget: async () => {\n\t\t\t\treturn IsoBuffer.from(JSON.stringify({ edits: chunk }));\n\t\t\t},\n\t\t};\n\t});\n\n\tlet startRevision = 0;\n\tconst handlesWithKeys = handles.map((baseHandle) => {\n\t\tconst handle = {\n\t\t\tstartRevision,\n\t\t\tchunk: {\n\t\t\t\tget: async () =>\n\t\t\t\t\t(\n\t\t\t\t\t\tJSON.parse(IsoBuffer.from(await baseHandle.get()).toString()) as Omit<\n\t\t\t\t\t\t\tEditChunkContents,\n\t\t\t\t\t\t\t'edits'\n\t\t\t\t\t\t> & { edits: EditWithoutId<DummyChange>[] }\n\t\t\t\t\t).edits,\n\t\t\t\tbaseHandle,\n\t\t\t},\n\t\t};\n\t\tstartRevision = startRevision + 5;\n\t\treturn handle;\n\t});\n\n\tconst editLog = new EditLog({ editChunks: handlesWithKeys, editIds });\n\n\treturn editLog;\n}\n\ndescribe('EditLog', () => {\n\tconst edit0 = newEdit([]);\n\tconst edit1 = newEdit([]);\n\tconst { id: id0, editWithoutId: editWithoutId0 } = separateEditAndId(edit0);\n\tconst { id: id1, editWithoutId: editWithoutId1 } = separateEditAndId(edit1);\n\n\tit('can be constructed from sequenced edits', () => {\n\t\tconst editChunks = [{ startRevision: 0, chunk: [editWithoutId0, editWithoutId1] }];\n\t\tconst editIds = [id0, id1];\n\n\t\tconst log = new EditLog({ editChunks, editIds });\n\t\texpect(log.numberOfLocalEdits).to.equal(0, 'Newly initialized log should not have local edits.');\n\t\texpect(log.numberOfSequencedEdits).to.equal(\n\t\t\teditChunks[0].chunk.length,\n\t\t\t'Log should have as many sequenced edits as it was initialized with.'\n\t\t);\n\t\texpect(log.length).to.equal(\n\t\t\teditChunks[0].chunk.length,\n\t\t\t\"Log's total length should match its sequenced edits on construction\"\n\t\t);\n\n\t\texpect(log.getIdAtIndex(0)).to.equal(id0, 'Log should have edits in order of construction.');\n\t\texpect(log.getIdAtIndex(1)).to.equal(id1, 'Log should have edits in order of construction.');\n\t});\n\n\tit('can get the index from an edit id of sequenced edits', () => {\n\t\tconst editChunks = [{ startRevision: 0, chunk: [editWithoutId0, editWithoutId1] }];\n\t\tconst editIds = [id0, id1];\n\n\t\tconst log = new EditLog({ editChunks, editIds });\n\n\t\texpect(log.getIndexOfId(id0)).to.equal(0);\n\t\texpect(log.getIndexOfId(id1)).to.equal(1);\n\t});\n\n\tit('can get the index from an edit id of a local edit', () => {\n\t\tconst editChunks = [{ startRevision: 0, chunk: [editWithoutId0] }];\n\t\tconst editIds = [id0];\n\n\t\tconst log = new EditLog({ editChunks, editIds });\n\t\tlog.addLocalEdit(edit1);\n\n\t\texpect(log.getIndexOfId(id0)).to.equal(0);\n\t\texpect(log.getIndexOfId(id1)).to.equal(1);\n\t});\n\n\tdescribe('tryGetIndexOfId', () => {\n\t\tit('can get the index from an existing edit', () => {\n\t\t\tconst editChunks = [{ startRevision: 0, chunk: [editWithoutId0] }];\n\t\t\tconst editIds = [id0];\n\t\t\tconst log = new EditLog({ editChunks, editIds });\n\t\t\texpect(log.tryGetIndexOfId(id0)).to.equal(0);\n\t\t});\n\n\t\tit('returns undefined when queried with a nonexistent edit', () => {\n\t\t\tconst editChunks = [{ startRevision: 0, chunk: [editWithoutId0] }];\n\t\t\tconst editIds = ['f9379af1-6f1a-4f71-8f8c-859359621404' as EditId];\n\t\t\tconst log = new EditLog({ editChunks, editIds });\n\t\t\texpect(log.tryGetIndexOfId('aa203fc3-bc28-437d-b01c-f9398dc859ef' as EditId)).to.equal(undefined);\n\t\t});\n\t});\n\n\tit('can get an edit from an index', async () => {\n\t\tconst editChunks = [{ startRevision: 0, chunk: [editWithoutId0, editWithoutId1] }];\n\t\tconst editIds = [id0, id1];\n\n\t\tconst log = new EditLog({ editChunks, editIds });\n\n\t\texpect((await log.getEditAtIndex(0)).id).to.equal(id0);\n\t\texpect((await log.getEditAtIndex(1)).id).to.equal(id1);\n\t});\n\n\tit('can get an edit from an edit id', async () => {\n\t\tconst editChunks = [{ startRevision: 0, chunk: [editWithoutId0, editWithoutId1] }];\n\t\tconst editIds = [id0, id1];\n\n\t\tconst log = new EditLog({ editChunks, editIds });\n\n\t\tconst editFromId0 = await log.tryGetEdit(id0);\n\t\tconst editFromId1 = await log.tryGetEdit(id1);\n\n\t\texpect(editFromId0).to.not.be.undefined;\n\t\texpect(editFromId1).to.not.be.undefined;\n\t\texpect(assertNotUndefined(editFromId0).id).to.equal(edit0.id);\n\t\texpect(assertNotUndefined(editFromId1).id).to.equal(edit1.id);\n\t});\n\n\tit('can be iterated', () => {\n\t\tconst log = new EditLog();\n\n\t\tlog.addLocalEdit(edit1);\n\t\tlog.addSequencedEdit(edit0, { sequenceNumber: 1, referenceSequenceNumber: 0 });\n\n\t\t// Sequenced edits should be iterated before local edits\n\t\tconst expectedEditIdStack = [id1, id0];\n\n\t\tlog.editIds.forEach((editId) => {\n\t\t\texpect(editId).to.equal(expectedEditIdStack.pop());\n\t\t});\n\n\t\texpect(expectedEditIdStack.length).to.equal(0);\n\t});\n\n\tit('can add sequenced edits', () => {\n\t\tconst log = new EditLog();\n\n\t\tlog.addSequencedEdit(edit0, { sequenceNumber: 1, referenceSequenceNumber: 0 });\n\t\texpect(log.numberOfSequencedEdits).to.equal(1);\n\t\texpect(log.numberOfLocalEdits).to.equal(0, 'Log should have only sequenced edits.');\n\n\t\tlog.addSequencedEdit(edit1, { sequenceNumber: 2, referenceSequenceNumber: 1 });\n\t\texpect(log.numberOfSequencedEdits).to.equal(2);\n\t\texpect(log.numberOfLocalEdits).to.equal(0, 'Log should have only sequenced edits.');\n\t\texpect(log.length).to.equal(2);\n\t});\n\n\tit('can add local edits', () => {\n\t\tconst log = new EditLog();\n\n\t\tlog.addLocalEdit(edit0);\n\t\texpect(log.numberOfLocalEdits).to.equal(1);\n\t\texpect(log.numberOfSequencedEdits).to.equal(0, 'Log should have only local edits.');\n\n\t\tlog.addLocalEdit(edit1);\n\t\texpect(log.numberOfLocalEdits).to.equal(2);\n\t\texpect(log.numberOfSequencedEdits).to.equal(0, 'Log should have only local edits.');\n\t\texpect(log.length).to.equal(2);\n\t});\n\n\tit('tracks the min sequence number of sequenced edits', () => {\n\t\tconst log = new EditLog();\n\n\t\texpect(log.minSequenceNumber).equals(0);\n\t\tlog.addSequencedEdit(edit0, { sequenceNumber: 1, referenceSequenceNumber: 0 });\n\t\texpect(log.minSequenceNumber).equals(0);\n\t\tlog.addSequencedEdit(edit1, { sequenceNumber: 43, referenceSequenceNumber: 42, minimumSequenceNumber: 42 });\n\t\texpect(log.minSequenceNumber).equals(42);\n\t\texpect(() =>\n\t\t\tlog.addSequencedEdit('fake-edit' as unknown as Edit<unknown>, {\n\t\t\t\tsequenceNumber: 44,\n\t\t\t\treferenceSequenceNumber: 43,\n\t\t\t})\n\t\t).throws('min number');\n\t});\n\n\tit('detects causal ordering violations', () => {\n\t\tconst log = new EditLog();\n\n\t\tlog.addLocalEdit(edit0);\n\t\tlog.addLocalEdit(edit1);\n\t\texpect(() => log.addSequencedEdit(edit1, { sequenceNumber: 1, referenceSequenceNumber: 0 })).throws('ordering');\n\t});\n\n\tit('can sequence a local edit', async () => {\n\t\tconst log = new EditLog();\n\n\t\tlog.addLocalEdit(edit0);\n\t\texpect(log.numberOfLocalEdits).to.equal(1);\n\t\tlet editFromId0 = await log.tryGetEdit(id0);\n\t\texpect(editFromId0).to.not.be.undefined;\n\t\texpect(assertNotUndefined(editFromId0).id).equals(edit0.id, 'Log should contain local edit.');\n\n\t\tlog.addSequencedEdit(edit0, { sequenceNumber: 1, referenceSequenceNumber: 0 });\n\t\texpect(log.length).to.equal(1);\n\t\texpect(log.numberOfSequencedEdits).to.equal(1);\n\t\texpect(log.numberOfLocalEdits).to.equal(0, 'Log should have only sequenced edits.');\n\t\teditFromId0 = await log.tryGetEdit(id0);\n\t\texpect(editFromId0).to.not.be.undefined;\n\t\texpect(assertNotUndefined(editFromId0).id).equals(edit0.id, 'Log should contain sequenced edit.');\n\t});\n\n\tit('Throws on duplicate sequenced edits', async () => {\n\t\tconst log = new EditLog();\n\t\tlog.addSequencedEdit(edit0, { sequenceNumber: 1, referenceSequenceNumber: 0 });\n\t\texpect(() => log.addSequencedEdit(edit0, { sequenceNumber: 1, referenceSequenceNumber: 0 }))\n\t\t\t.to.throw(Error)\n\t\t\t.that.has.property('message')\n\t\t\t.which.matches(/Duplicate/);\n\t});\n\n\tit('can sequence multiple local edits', async () => {\n\t\tconst log = new EditLog();\n\t\tconst ids: EditId[] = [];\n\n\t\tconst numEdits = 10;\n\t\tfor (let i = 0; i < numEdits; i++) {\n\t\t\tconst edit = newEdit([]);\n\t\t\tlog.addLocalEdit(edit);\n\t\t\tids.push(edit.id);\n\t\t\texpect(log.getIndexOfId(edit.id)).equals(i, 'Local edits should be appended to the end of the log.');\n\t\t}\n\t\texpect(log.length).equals(log.numberOfLocalEdits).and.equals(numEdits, 'Only local edits should be present.');\n\n\t\tlog.sequenceLocalEdits();\n\n\t\texpect(log.editIds).to.deep.equal(ids, 'Sequencing a local edit should not change its index.');\n\n\t\texpect(log.length)\n\t\t\t.equals(log.numberOfSequencedEdits)\n\t\t\t.and.equals(numEdits, 'Only sequenced edits should be present.');\n\t});\n\n\tit('can correctly compare equality to other edit logs', () => {\n\t\tconst edit0Copy: Edit<DummyChange> = { ...edit0 };\n\t\tconst edit1Copy: Edit<DummyChange> = { ...edit1 };\n\t\tconst { editWithoutId: editWithoutId0Copy } = separateEditAndId(edit0Copy);\n\t\tconst { editWithoutId: editWithoutId1Copy } = separateEditAndId(edit1Copy);\n\n\t\tconst editChunks = [{ startRevision: 0, chunk: [editWithoutId0, editWithoutId1] }];\n\t\tconst editChunksCopy = [{ startRevision: 0, chunk: [editWithoutId0Copy, editWithoutId1Copy] }];\n\t\tconst editIds = [id0, id1];\n\n\t\tconst log0 = new EditLog({ editChunks, editIds });\n\t\tconst log1 = new EditLog({ editChunks: editChunksCopy, editIds });\n\n\t\texpect(log0.equals(log1)).to.be.true;\n\n\t\tconst log2 = new EditLog<DummyChange>({\n\t\t\teditChunks: [{ startRevision: 0, chunk: [editWithoutId0] }],\n\t\t\teditIds: [id0],\n\t\t});\n\t\tlog2.addLocalEdit(edit1Copy);\n\n\t\texpect(log0.equals(log2)).to.be.true;\n\n\t\tconst differentLog = new EditLog({\n\t\t\teditChunks: [{ startRevision: 0, chunk: [editWithoutId0] }],\n\t\t\teditIds: [id0],\n\t\t});\n\n\t\texpect(log0.equals(differentLog)).to.be.false;\n\t});\n\n\tit('creates a new edit chunk once the previous one has been filled', () => {\n\t\tconst log = new EditLog();\n\n\t\tfor (let i = 0; i < log.editsPerChunk; i++) {\n\t\t\tconst edit = newEdit([]);\n\t\t\tlog.addSequencedEdit(edit, { sequenceNumber: i + 1, referenceSequenceNumber: i });\n\t\t\texpect(log.getEditLogSummary().editChunks.length).to.be.equal(1);\n\t\t}\n\n\t\tconst edit = newEdit([]);\n\t\tlog.addSequencedEdit(edit, {\n\t\t\tsequenceNumber: log.editsPerChunk,\n\t\t\treferenceSequenceNumber: log.editsPerChunk - 1,\n\t\t});\n\t\texpect(log.getEditLogSummary().editChunks.length).to.be.equal(2);\n\t});\n\n\tit('can load edits from a handle', async () => {\n\t\tconst log = createEditLogWithHandles();\n\n\t\t// Check that each edit can be retrieved correctly\n\t\tfor (let i = 0; i < 10; i++) {\n\t\t\texpect((await log.getEditAtIndex(i)).id).to.equal(log.editIds[i]);\n\t\t}\n\t});\n\n\tit('can add edits to logs with varying edit chunk sizes', async () => {\n\t\tconst numberOfChunks = 2;\n\t\tconst editsPerChunk = 5;\n\t\tconst log = createEditLogWithHandles(numberOfChunks, editsPerChunk);\n\n\t\t// Load the edits for the last edit chunk\n\t\tawait log.getEditAtIndex(numberOfChunks * editsPerChunk - 1);\n\n\t\t// Add a sequenced edit and check it's been added\n\t\tconst edit = newEdit([]);\n\t\tlog.addSequencedEdit(edit, {\n\t\t\tsequenceNumber: log.editsPerChunk,\n\t\t\treferenceSequenceNumber: log.editsPerChunk - 1,\n\t\t});\n\n\t\texpect(log.getIdAtIndex(numberOfChunks * editsPerChunk)).to.equal(edit.id);\n\t});\n});\n"]}

package/lib/test/EditUtilities.tests.d.ts

@@ -0,0 +1,6 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+export {};
+//# sourceMappingURL=EditUtilities.tests.d.ts.map

package/lib/test/EditUtilities.tests.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"EditUtilities.tests.d.ts","sourceRoot":"","sources":["../../src/test/EditUtilities.tests.ts"],"names":[],"mappings":"AAAA;;;GAGG"}

package/lib/test/EditUtilities.tests.js

@@ -0,0 +1,503 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { expect } from 'chai';
+import { assert } from '@fluidframework/common-utils';
+import { MockFluidDataStoreRuntime } from '@fluidframework/test-runtime-utils';
+import { FluidSerializer } from '@fluidframework/shared-object-base';
+import { getChangeNodeFromView } from '../SerializationUtilities';
+import { noop } from '../Common';
+import { convertTreeNodes, deepCompareNodes, internalizeBuildNode, PlaceValidationResult, RangeValidationResultKind, validateStablePlace, validateStableRange, walkTree, } from '../EditUtilities';
+import { Side } from '../persisted-types';
+import { comparePayloads } from '../PayloadUtilities';
+import { refreshTestTree } from './utilities/TestUtilities';
+describe('EditUtilities', () => {
+    const testTree = refreshTestTree(undefined, undefined, /* expensiveValidation: */ true);
+    describe('validateStablePlace', () => {
+        it('accepts valid places', () => {
+            expect(validateStablePlace(testTree.view, {
+                referenceSibling: testTree.left.identifier,
+                side: Side.Before,
+            })).deep.equals({
+                result: PlaceValidationResult.Valid,
+                referenceSibling: testTree.left.identifier,
+                side: Side.Before,
+            });
+        });
+        it('detects malformed places', () => {
+            expect(validateStablePlace(testTree.view, {
+                referenceTrait: testTree.left.traitLocation,
+                referenceSibling: testTree.left.identifier,
+                side: Side.Before,
+            })).deep.equals({ result: PlaceValidationResult.Malformed });
+        });
+        it('detects missing siblings', () => {
+            expect(validateStablePlace(testTree.view, {
+                referenceSibling: testTree.generateNodeId(),
+                side: Side.Before,
+            })).deep.equals({ result: PlaceValidationResult.MissingSibling });
+        });
+        it('detects missing parents', () => {
+            expect(validateStablePlace(testTree.view, {
+                referenceTrait: {
+                    parent: testTree.generateNodeId(),
+                    label: testTree.left.traitLabel,
+                },
+                side: Side.Before,
+            })).deep.equals({ result: PlaceValidationResult.MissingParent });
+        });
+        it('detects root places', () => {
+            expect(validateStablePlace(testTree.view, {
+                referenceSibling: testTree.identifier,
+                side: Side.Before,
+            })).deep.equals({ result: PlaceValidationResult.SiblingIsRootOrDetached });
+        });
+    });
+    describe('validateStableRange', () => {
+        it('accepts valid ranges', () => {
+            const validatedRange = validateStableRange(testTree.view, {
+                start: { referenceSibling: testTree.left.identifier, side: Side.Before },
+                end: { referenceSibling: testTree.left.identifier, side: Side.After },
+            });
+            expect(validatedRange.result).to.equal(RangeValidationResultKind.Valid);
+            if (validatedRange.result === RangeValidationResultKind.Valid) {
+                expect(validatedRange.start.referenceSibling).to.equal(testTree.left.identifier);
+                expect(validatedRange.start.referenceTrait).to.be.undefined;
+                expect(validatedRange.start.side).to.equal(Side.Before);
+                expect(validatedRange.end.referenceSibling).to.equal(testTree.left.identifier);
+                expect(validatedRange.end.referenceTrait).to.be.undefined;
+                expect(validatedRange.end.side).to.equal(Side.After);
+            }
+            else {
+                expect.fail();
+            }
+        });
+        it('detects inverted ranges', () => {
+            expect(validateStableRange(testTree.view, {
+                start: { referenceSibling: testTree.left.identifier, side: Side.After },
+                end: { referenceSibling: testTree.left.identifier, side: Side.Before },
+            })).deep.equals({ result: RangeValidationResultKind.Inverted });
+        });
+        it('detects when place are in different traits', () => {
+            expect(validateStableRange(testTree.view, {
+                start: { referenceSibling: testTree.left.identifier, side: Side.Before },
+                end: { referenceSibling: testTree.right.identifier, side: Side.After },
+            })).deep.equals({ result: RangeValidationResultKind.PlacesInDifferentTraits });
+        });
+        it('detects malformed places', () => {
+            const start = {
+                referenceTrait: testTree.left.traitLocation,
+                referenceSibling: testTree.left.identifier,
+                side: Side.Before,
+            };
+            expect(validateStableRange(testTree.view, {
+                // trait and sibling should be mutually exclusive
+                start,
+                end: { referenceSibling: testTree.left.identifier, side: Side.After },
+            })).deep.equals({
+                result: {
+                    kind: RangeValidationResultKind.BadPlace,
+                    place: start,
+                    placeFailure: PlaceValidationResult.Malformed,
+                },
+            });
+        });
+        it('detects invalid places', () => {
+            const start = {
+                referenceSibling: testTree.generateNodeId(),
+                side: Side.Before,
+            };
+            expect(validateStableRange(testTree.view, {
+                start,
+                end: { referenceSibling: testTree.right.identifier, side: Side.After },
+            })).deep.equals({
+                result: {
+                    kind: RangeValidationResultKind.BadPlace,
+                    place: start,
+                    placeFailure: PlaceValidationResult.MissingSibling,
+                },
+            });
+        });
+    });
+    describe('Tree node conversion', () => {
+        it('can clone a tree', () => {
+            const clone = convertTreeNodes(getChangeNodeFromView(testTree.view), (node) => (Object.assign({}, node)));
+            expect(testTree).to.not.equal(clone);
+            expect(deepCompareNodes(testTree, clone)).to.be.true;
+        });
+        it('can clone a leaf', () => {
+            let converted = false;
+            expect(convertTreeNodes(42, (n) => {
+                converted = true;
+                return n;
+            }, isNumber)).to.equal(42);
+            expect(converted).to.be.false;
+        });
+        it('can clone a tree with a leaf', () => {
+            const leafTrait = 'main';
+            const leafId = testTree.generateNodeId();
+            const tree = Object.assign(Object.assign({}, testTree.buildLeaf(testTree.generateNodeId())), { payload: 'payload', traits: { [leafTrait]: [testTree.buildLeaf(leafId)] } });
+            const clone = convertTreeNodes(tree, (node) => (Object.assign({}, node)));
+            assert(typeof clone !== 'number', '');
+            expect(clone.definition).to.equal(tree.definition);
+            expect(clone.identifier).to.equal(tree.identifier);
+            expect(clone.payload).to.equal(tree.payload);
+            expect(clone.traits[leafTrait][0].identifier).to.equal(leafId);
+        });
+        it('correctly invokes the convert function', () => {
+            const node = Object.assign(Object.assign({}, testTree.buildLeaf(testTree.generateNodeId())), { payload: 'payload' });
+            let converted = false;
+            convertTreeNodes(node, (n) => {
+                converted = true;
+                expect(node.definition).to.equal(node.definition);
+                expect(node.identifier).to.equal(node.identifier);
+                expect(node.payload).to.equal(node.payload);
+                return n;
+            }, isNumber);
+            expect(converted).to.be.true;
+        });
+        it('can convert a node', () => {
+            const node = Object.assign(Object.assign({}, testTree.buildLeaf(testTree.generateNodeId())), { payload: 'payload' });
+            const id = testTree.generateNodeId();
+            const converted = convertTreeNodes(node, (_) => ({ definition: '_def', identifier: id, payload: 'payload2' }), isNumber);
+            expect(converted).to.deep.equal({ definition: '_def', identifier: id, payload: 'payload2', traits: {} });
+        });
+        it('creates empty trait objects for the root', () => {
+            const node = Object.assign({}, testTree.buildLeaf(testTree.generateNodeId()));
+            const converted = convertTreeNodes(node, (n) => internalizeBuildNode(n, testTree), isNumber);
+            assert(typeof converted !== 'number', 'unexpected detached ID');
+            expect(converted.traits).to.not.be.undefined;
+        });
+        it('creates empty trait objects for children', () => {
+            const node = Object.assign(Object.assign({}, testTree.buildLeaf()), { traits: { main: Object.assign({}, testTree.buildLeaf()) } });
+            const converted = convertTreeNodes(node, (n) => internalizeBuildNode(n, testTree), isNumber);
+            assert(typeof converted !== 'number', 'unexpected detached ID');
+            expect(converted.traits).to.not.be.undefined;
+        });
+        it('can convert a tree with children', () => {
+            const childA = Object.assign(Object.assign({}, testTree.buildLeaf(testTree.generateNodeId())), { payload: 'a' });
+            const childB = Object.assign(Object.assign({}, testTree.buildLeaf(testTree.generateNodeId())), { payload: 'b' });
+            const node = Object.assign(Object.assign({}, testTree.buildLeaf(testTree.generateNodeId())), { traits: { main: [childA, childB] } });
+            const converted = convertTreeNodes(node, (node) => {
+                if (node.identifier === childB.identifier) {
+                    return { definition: node.definition, identifier: node.identifier, payload: 'c' };
+                }
+                return node;
+            });
+            expect(converted).to.deep.equal({
+                definition: node.definition,
+                identifier: node.identifier,
+                traits: {
+                    main: [
+                        { definition: childA.definition, identifier: childA.identifier, payload: 'a', traits: {} },
+                        { definition: childB.definition, identifier: childB.identifier, payload: 'c', traits: {} },
+                    ],
+                },
+            });
+        });
+        it('can convert a tree with a grandchild', () => {
+            const grandchild = Object.assign(Object.assign({}, testTree.buildLeaf(testTree.generateNodeId())), { payload: 'g' });
+            const child = Object.assign(Object.assign({}, testTree.buildLeaf(testTree.generateNodeId())), { traits: { main: [grandchild] } });
+            const parent = Object.assign(Object.assign({}, testTree.buildLeaf(testTree.generateNodeId())), { traits: { main: [child] } });
+            const converted = convertTreeNodes(parent, (node) => {
+                if (node.identifier === grandchild.identifier) {
+                    return { definition: node.definition, identifier: node.identifier, payload: 'h' };
+                }
+                return node;
+            });
+            expect(converted).to.deep.equal({
+                definition: parent.definition,
+                identifier: parent.identifier,
+                traits: {
+                    main: [
+                        {
+                            definition: child.definition,
+                            identifier: child.identifier,
+                            traits: {
+                                main: [
+                                    {
+                                        definition: grandchild.definition,
+                                        identifier: grandchild.identifier,
+                                        payload: 'h',
+                                        traits: {},
+                                    },
+                                ],
+                            },
+                        },
+                    ],
+                },
+            });
+        });
+        it('walks trees in a consistent order', () => {
+            // Construct two trees that are the same but have their traits defined in different orders
+            const buildTreeA = {
+                definition: 'parent',
+                traits: {
+                    left: {
+                        definition: 'left child',
+                        traits: {
+                            left: {
+                                definition: 'left grandchild under left',
+                            },
+                            right: {
+                                definition: 'right grandchild under left',
+                            },
+                            main: [
+                                { definition: 'grandchild A under left main' },
+                                { definition: 'grandchild B under left main' },
+                                { definition: 'grandchild C under left main' },
+                            ],
+                        },
+                    },
+                    right: {
+                        definition: 'right child',
+                        traits: {
+                            left: {
+                                definition: 'left grandchild under right',
+                            },
+                            right: {
+                                definition: 'right grandchild under right',
+                            },
+                            main: [
+                                { definition: 'grandchild A under right main' },
+                                { definition: 'grandchild B under right main' },
+                                { definition: 'grandchild C under right main' },
+                            ],
+                        },
+                    },
+                    main: [
+                        { definition: 'child A under main' },
+                        { definition: 'child B under main' },
+                        { definition: 'child C under main' },
+                    ],
+                },
+            };
+            const buildTreeB = {
+                definition: 'parent',
+                traits: {
+                    right: {
+                        definition: 'right child',
+                        traits: {
+                            left: {
+                                definition: 'left grandchild under right',
+                            },
+                            main: [
+                                { definition: 'grandchild A under right main' },
+                                { definition: 'grandchild B under right main' },
+                                { definition: 'grandchild C under right main' },
+                            ],
+                            right: {
+                                definition: 'right grandchild under right',
+                            },
+                        },
+                    },
+                    main: [
+                        { definition: 'child A under main' },
+                        { definition: 'child B under main' },
+                        { definition: 'child C under main' },
+                    ],
+                    left: {
+                        definition: 'left child',
+                        traits: {
+                            main: [
+                                { definition: 'grandchild A under left main' },
+                                { definition: 'grandchild B under left main' },
+                                { definition: 'grandchild C under left main' },
+                            ],
+                            right: {
+                                definition: 'right grandchild under left',
+                            },
+                            left: {
+                                definition: 'left grandchild under left',
+                            },
+                        },
+                    },
+                },
+            };
+            // Record the order in which the tree walk visits each node in each tree
+            const definitionsA = [];
+            walkTree(buildTreeA, (n) => definitionsA.push(n.definition), (x) => typeof x === 'number');
+            const definitionsB = [];
+            walkTree(buildTreeB, (n) => definitionsB.push(n.definition), (x) => typeof x === 'number');
+            // The orders should be the same, even though the trees had their traits defined in different orders
+            expect(definitionsA).to.deep.equal(definitionsB);
+        });
+    });
+    describe('Build tree internalization', () => {
+        it('does not copy extraneous properties from input tree', () => {
+            const node = Object.assign(Object.assign({}, testTree.buildLeaf(testTree.generateNodeId())), { traits: { main: [testTree.buildLeaf(testTree.generateNodeId())] } });
+            node.extra = 'This is extra data that should not be copied';
+            const converted = convertTreeNodes(node, (node) => internalizeBuildNode(node, testTree), isNumber);
+            expect(converted).to.deep.equal({
+                definition: node.definition,
+                identifier: node.identifier,
+                traits: node.traits,
+            });
+        });
+        it('does not copy extraneous properties from converter', () => {
+            const node = testTree.buildLeaf(testTree.generateNodeId());
+            expect(Object.prototype.hasOwnProperty.call(node, 'payload')).to.be.false;
+            const converted = convertTreeNodes(node, (node) => internalizeBuildNode(node, testTree), isNumber);
+            expect(Object.prototype.hasOwnProperty.call(converted, 'payload')).to.be.false;
+        });
+    });
+    function isNumber(node) {
+        return typeof node === 'number';
+    }
+    describe('comparePayloads', () => {
+        const serializer = new FluidSerializer(new MockFluidDataStoreRuntime().IFluidHandleContext, () => { });
+        const binder = { bind: noop };
+        let Equality;
+        (function (Equality) {
+            Equality[Equality["Equal"] = 0] = "Equal";
+            Equality[Equality["Unequal"] = 1] = "Unequal";
+            Equality[Equality["Unspecified"] = 2] = "Unspecified";
+        })(Equality || (Equality = {}));
+        function checkEquality(equal, equality) {
+            if (equality !== Equality.Unspecified) {
+                expect(equal).equals(equality === Equality.Equal);
+            }
+        }
+        function check(a, b, flags) {
+            // Check reflexive
+            expect(comparePayloads(a, a)).equal(true);
+            expect(comparePayloads(b, b)).equal(true);
+            checkEquality(comparePayloads(a, b), flags.initial);
+            // Check commutative
+            checkEquality(comparePayloads(b, a), flags.initial);
+            const [aString, aDeserialized] = checkSerialization(a, flags.roundtrip);
+            const [bString, bDeserialized] = checkSerialization(b, flags.roundtrip);
+            checkEquality(aString === bString, flags.serialized);
+            checkEquality(comparePayloads(aDeserialized, bDeserialized), flags.deserialized);
+            // Check commutative
+            checkEquality(comparePayloads(bDeserialized, aDeserialized), flags.deserialized);
+        }
+        function checkSerialization(a, roundtrip) {
+            const aString = serializer.stringify(a, binder);
+            const a2 = serializer.parse(aString);
+            const aString2 = serializer.stringify(a2, binder);
+            expect(aString2).equal(aString);
+            checkEquality(comparePayloads(a, a2), roundtrip);
+            // Check second round trip, should always be equal
+            const a3 = serializer.parse(aString2);
+            expect(comparePayloads(a3, a2)).true;
+            return [aString, a2];
+        }
+        const allEqual = {
+            initial: Equality.Equal,
+            serialized: Equality.Equal,
+            deserialized: Equality.Equal,
+            roundtrip: Equality.Equal,
+        };
+        // For when the inputs are logically equal, but may serialize differently due to field ordering.
+        const allEqualUnstable = {
+            initial: Equality.Equal,
+            serialized: Equality.Unspecified,
+            deserialized: Equality.Equal,
+            roundtrip: Equality.Equal,
+        };
+        const allUnequal = {
+            initial: Equality.Unequal,
+            serialized: Equality.Unequal,
+            deserialized: Equality.Unequal,
+            roundtrip: Equality.Equal,
+        };
+        it('compares numbers correctly', () => {
+            check(0, 0, allEqual);
+            check(1, 1, allEqual);
+            check(0, 1, allUnequal);
+            check(-1, 1, allUnequal);
+            check(5.2, 5.200000001, allUnequal);
+        });
+        it('compares strings', () => {
+            check('', '', allEqual);
+            check(' ', '', allUnequal);
+            check('1', '+1', allUnequal);
+            // This character makes sure multi-byte utf-8 and multi-word utf-16 at least somewhat work
+            // Cases like unicode normalization are not covered here here. Normalization or not will be considered ok.
+            check('𤭢', '𤭢', allEqual);
+            check('𤭢', '', allUnequal);
+            check('several characters', 'several characters', allEqual);
+            check('several characters', 'several_characters', allUnequal);
+        });
+        it('compares arrays', () => {
+            check([], [], allEqual);
+            check([1], [1], allEqual);
+            check([[1]], [[1]], allEqual);
+            check([[1]], [[2]], allUnequal);
+            check([], [1], allUnequal);
+            check([1, 2], [2, 1], allUnequal);
+        });
+        it('compares objects', () => {
+            check({ 1: 'x' }, { 1: 'x' }, allEqual);
+            check({ x: 'x' }, { y: 'x' }, allUnequal);
+            check({ x: 'x' }, { x: {} }, allUnequal);
+            check({ x: {} }, { x: {} }, allEqual);
+            check({ x: [1, 2, 3, 5] }, { x: [1, 2, 3, 4] }, allUnequal);
+            check({ 1: 'x' }, {}, allUnequal);
+            check({ x: 'x' }, { x: 'x', y: 'x' }, allUnequal);
+            check({ field: 'a' }, { field: 'b' }, allUnequal);
+            // Fluid Serialization arbitrarily orders fields.
+            // Thus any object with more than one field may have non-deterministic serialization.
+            // However objects have field order, and we need to check comparePayloads is not impacted by it.
+            check({ y: 'a', x: 'b' }, { x: 'b', y: 'a' }, allEqualUnstable);
+        });
+        it('compares mixed types', () => {
+            check({ 0: 1 }, [1], allUnequal);
+            // Rationale: 'undefined' is reserved for future use (see 'SetValue' interface)
+            check(null, 'null', allUnequal);
+            check(null, 'null', allUnequal);
+            check(1, '1', allUnequal);
+            check(null, 0, allUnequal);
+            check('', 0, allUnequal);
+        });
+        const sameAfter = {
+            initial: Equality.Unspecified,
+            serialized: Equality.Unspecified,
+            deserialized: Equality.Equal,
+            roundtrip: Equality.Unspecified,
+        };
+        const differentAfter = {
+            initial: Equality.Unequal,
+            serialized: Equality.Unequal,
+            deserialized: Equality.Unequal,
+            roundtrip: Equality.Unspecified,
+        };
+        it('lossy cases', () => {
+            // Undefined fields are omitted in json, and thus lost on the round trip.
+            check({ x: undefined }, { y: undefined }, sameAfter);
+            check({ x: undefined }, {}, sameAfter);
+            // NaN and Infinity become null
+            check(NaN, NaN, sameAfter);
+            check(NaN, 7, differentAfter);
+            check(Infinity, Infinity, sameAfter);
+            check(-Infinity, Infinity, sameAfter);
+            check(NaN, 'NaN', differentAfter);
+            // json loses -0 on round trip
+            check(-0, -0, sameAfter);
+        });
+        it('compares handles', () => {
+            // This is used instead of MockHandle so equal handles compare deeply equal.
+            function makeMockHandle(data) {
+                // `/` prefix is needed to prevent serializing from modifying handle.
+                const handleObject = { absolutePath: `/${data}`, IFluidHandle: undefined };
+                handleObject.IFluidHandle = handleObject;
+                return handleObject;
+            }
+            // Theoretically handles serialize as objects with 2 fields and thus serialization is allowed to be non-deterministic
+            // so use allEqualUnstable not allEqual.
+            check(makeMockHandle('x'), makeMockHandle('x'), allEqualUnstable);
+            check(makeMockHandle('x'), makeMockHandle('y'), allUnequal);
+            check({ x: makeMockHandle('x') }, makeMockHandle('x'), allUnequal);
+        });
+        // These are cases that are allowed by the type system and produce unexpected results due to Json serialization.
+        // Clear documentation and/or adjustments to equality, type checking or serialization would help with these cases.
+        it.skip('strange cases', () => {
+            // Top level undefined fails in JSON.parse.
+            // Rationale: 'undefined' is reserved for future use (see 'SetValue' interface.)
+            check(undefined, null, sameAfter);
+        });
+    });
+});
+//# sourceMappingURL=EditUtilities.tests.js.map