@fluid-experimental/tree 0.58.2002 → 0.58.3000-61081

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

@@ -0,0 +1 @@
+{"version":3,"file":"MergeHealthTelemetryHeartbeat.tests.js","sourceRoot":"","sources":["../../src/test/MergeHealthTelemetryHeartbeat.tests.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,MAAM,CAAC;AAG9B,OAAO,EAAE,uCAAuC,EAAE,MAAM,gBAAgB,CAAC;AAGzE,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,WAAW,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC;AAC9E,OAAO,EAAE,gBAAgB,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAC;AAClE,OAAO,EAAE,mBAAmB,EAAE,MAAM,wBAAwB,CAAC;AAC7D,OAAO,EAAE,SAAS,EAAY,MAAM,sBAAsB,CAAC;AAC3D,OAAO,EAAE,mBAAmB,EAAE,aAAa,EAAE,MAAM,2BAA2B,CAAC;AAE/E,KAAK,UAAU,cAAc;IAC5B,MAAM,MAAM,GAA0B,EAAE,CAAC;IACzC,MAAM,EAAE,IAAI,EAAE,uBAAuB,EAAE,GAAG,mBAAmB,CAAC;QAC7D,SAAS,EAAE,KAAK;QAChB,MAAM,EAAE,EAAE,IAAI,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE;QAC/C,YAAY,EAAE,IAAI;KAClB,CAAC,CAAC;IACH,MAAM,QAAQ,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC;IACrC,MAAM,EAAE,IAAI,EAAE,cAAc,EAAE,GAAG,mBAAmB,CAAC;QACpD,uBAAuB;QACvB,EAAE,EAAE,sBAAsB;QAC1B,SAAS,EAAE,KAAK;QAChB,YAAY,EAAE,IAAI;KAClB,CAAC,CAAC;IACH,MAAM,SAAS,GAAG,IAAI,uCAAuC,EAAE,CAAC;IAChE,uBAAuB,CAAC,kBAAkB,EAAE,CAAC;IAC7C,MAAM,IAAI,CAAC,SAAS,CAAC,eAAe,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC;IAC/D,SAAS,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;IAC3B,OAAO;QACN,IAAI;QACJ,QAAQ;QACR,cAAc;QACd,uBAAuB;QACvB,MAAM;QACN,SAAS;KACT,CAAC;AACH,CAAC;AAED,KAAK,UAAU,KAAK,CAAC,IAAgB,EAAE,uBAAoD;IAC1F,uBAAuB,CAAC,kBAAkB,EAAE,CAAC;IAC7C,OAAO,IAAI,CAAC,SAAS,CAAC,eAAe,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC;AACjE,CAAC;AAED,SAAS,YAAY,CACpB,oBAA4B,EAC5B,SAIC;IAED,OAAO,EAAE,CAAC,cAAc,oBAAoB,EAAE,EAAE,KAAK,IAAI,EAAE;QAC1D,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,cAAc,EAAE,uBAAuB,EAAE,MAAM,EAAE,SAAS,EAAE,GAAG,MAAM,cAAc,EAAE,CAAC;QAC9G,MAAM,MAAM,GAAG,SAAS,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,cAAc,EAAE,CAAC,CAAC;QAC7D,SAAS,CAAC,SAAS,EAAE,CAAC;QACtB,IAAI,MAAM,CAAC,eAAe,KAAK,SAAS,EAAE;YACzC,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,eAAe,EAAE;gBAC1C,cAAc,CAAC,SAAS,CAAC,GAAG,IAAI,CAAC,CAAC;aAClC;SACD;QACD,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,KAAK,EAAE;YAChC,IAAI,CAAC,SAAS,CAAC,GAAG,IAAI,CAAC,CAAC;SACxB;QACD,MAAM,KAAK,CAAC,IAAI,EAAE,uBAAuB,CAAC,CAAC;QAC3C,SAAS,CAAC,cAAc,EAAE,CAAC;QAC3B,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;QACrC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;IAC1C,CAAC,CAAC,CAAC;AACJ,CAAC;AAED,SAAS,kBAAkB,CAC1B,oBAA4B,EAC5B,MAAqF,EACrF,MAAqC;IAErC,OAAO,EAAE,CAAC,qBAAqB,oBAAoB,EAAE,EAAE,GAAG,EAAE;QAC3D,MAAM,MAAM,GAA0B,EAAE,CAAC;QACzC,MAAM,MAAM,GAAG,EAAE,IAAI,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACvD,MAAM,SAAS,GAAG,IAAI,uCAAuC,EAAE,CAAC;QAChE,IAAI,aAAwC,CAAC;QAC7C,MAAM,QAAQ,GAAG;YAChB,EAAE,EAAE,CAAC,KAAa,EAAE,QAAkC,EAAE,EAAE;gBACzD,aAAa,GAAG,QAAQ,CAAC;YAC1B,CAAC;SACD,CAAC;QACF,SAAS,CAAC,UAAU,CAAC,QAAsB,CAAC,CAAC;QAC7C,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE;YAC3B,aAAa,iBACZ,IAAI,EAAE,QAAQ,EACd,MAAM,EACN,IAAI,EAAE,EAAE,EACR,kBAAkB,EAAE,EAAE,EACtB,KAAK,EAAE,EAAE,EACT,QAAQ,EAAE,IAAI,EACd,OAAO,EAAE;oBACR,MAAM,EAAE,UAAU,CAAC,OAAO;iBAC1B,IACE,KAAK,EACP,CAAC;SACH;QACD,SAAS,CAAC,cAAc,EAAE,CAAC;QAC3B,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;QACrC,MAAM,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACxC,MAAM,CAAC,KAAK,CAAC,CAAC;IACf,CAAC,CAAC,CAAC;AACJ,CAAC;AAED,QAAQ,CAAC,yCAAyC,EAAE,GAAG,EAAE;IACxD,EAAE,CAAC,gDAAgD,EAAE,KAAK,IAAI,EAAE;QAC/D,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,uBAAuB,EAAE,MAAM,EAAE,SAAS,EAAE,GAAG,MAAM,cAAc,EAAE,CAAC;QAC9F,IAAI,CAAC,SAAS,CAAC,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAC,EAAE,WAAW,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC/F,MAAM,KAAK,CAAC,IAAI,EAAE,uBAAuB,CAAC,CAAC;QAC3C,oDAAoD;QACpD,MAAM,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,SAAS,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACrD,wCAAwC;QACxC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;IAChC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,8BAA8B,EAAE,KAAK,IAAI,EAAE;QAC7C,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,uBAAuB,EAAE,MAAM,EAAE,SAAS,EAAE,GAAG,MAAM,cAAc,EAAE,CAAC;QAC9F,IAAI,CAAC,SAAS,CAAC,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAC,EAAE,WAAW,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC/F,MAAM,KAAK,CAAC,IAAI,EAAE,uBAAuB,CAAC,CAAC;QAC3C,SAAS,CAAC,cAAc,EAAE,CAAC;QAC3B,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAChC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC;YAC1B,QAAQ,EAAE,WAAW;YACrB,SAAS,EAAE,iDAAiD;SAC5D,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,qDAAqD,EAAE,KAAK,IAAI,EAAE;QACpE,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,cAAc,EAAE,uBAAuB,EAAE,MAAM,EAAE,SAAS,EAAE,GAAG,MAAM,cAAc,EAAE,CAAC;QAC9G,cAAc,CAAC,SAAS,CACvB,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC,SAAS,EAAE,CAAC,EAAE,WAAW,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC,CAAC,CACjG,CAAC;QACF,MAAM,KAAK,CAAC,IAAI,EAAE,uBAAuB,CAAC,CAAC;QAC3C,SAAS,CAAC,cAAc,EAAE,CAAC;QAC3B,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IACjC,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,8BAA8B,EAAE,GAAG,EAAE;QAC7C,YAAY,CAAC,aAAa,EAAE,CAAC,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC,CAAC;YAC9C,KAAK,EAAE;gBACN,MAAM,CAAC,UAAU,CAAC,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAC,EAAE,WAAW,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;gBAC3E,MAAM,CAAC,UAAU,CAChB,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAC,EACtB,WAAW,CAAC,KAAK,CAAC,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,CAAC,CAChE;aACD;YACD,MAAM,EAAE,CAAC,KAAK,EAAE,EAAE;gBACjB,MAAM,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBAClC,MAAM,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACzC,CAAC;SACD,CAAC,CAAC,CAAC;QAEJ,YAAY,CAAC,4BAA4B,EAAE,CAAC,EAAE,QAAQ,EAAE,cAAc,EAAE,EAAE,EAAE,CAAC,CAAC;YAC7E,eAAe,EAAE,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC;YAC/F,KAAK,EAAE,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAC,EAAE,WAAW,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC;YACpF,MAAM,EAAE,CAAC,KAAK,EAAE,EAAE;gBACjB,MAAM,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACxC,MAAM,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACtC,MAAM,CAAC,KAAK,CAAC,2BAA2B,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACpD,MAAM,CAAC,KAAK,CAAC,4BAA4B,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACtD,CAAC;SACD,CAAC,CAAC,CAAC;QAEJ,YAAY,CACX,gEAAgE,EAChE,CAAC,EAAE,QAAQ,EAAE,cAAc,EAAE,EAAE,EAAE,CAAC,CAAC;YAClC,eAAe,EAAE,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC;YAC1F,KAAK,EAAE,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAC,EAAE,WAAW,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC;YACpF,MAAM,EAAE,CAAC,KAAK,EAAE,EAAE;gBACjB,MAAM,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACxC,MAAM,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACtC,MAAM,CAAC,KAAK,CAAC,2BAA2B,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACpD,MAAM,CAAC,KAAK,CAAC,4BAA4B,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACtD,CAAC;SACD,CAAC,CACF,CAAC;QAEF,YAAY,CACX,+DAA+D,EAC/D,CAAC,EAAE,QAAQ,EAAE,cAAc,EAAE,EAAE,EAAE,CAAC,CAAC;YAClC,mEAAmE;YACnE,eAAe,EAAE;gBAChB,MAAM,CAAC,IAAI,CACV,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC,EAC3D,WAAW,CAAC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,aAAa,CAAC,SAAS,CAAC,cAAc,CAAC,CAAC,CAC3E;aACD;YACD,KAAK,EAAE;gBACN;oBACC,MAAM,CAAC,MAAM,CACZ,WAAW,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CACrD,WAAW,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAChD,CACD;iBACD;aACD;YACD,MAAM,EAAE,CAAC,KAAK,EAAE,EAAE;gBACjB,MAAM,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACxC,MAAM,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACtC,MAAM,CAAC,KAAK,CAAC,2BAA2B,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACpD,MAAM,CAAC,KAAK,CAAC,2CAA2C,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACrE,CAAC;SACD,CAAC,CACF,CAAC;QAEF,YAAY,CAAC,6DAA6D,EAAE,CAAC,EAAE,QAAQ,EAAE,cAAc,EAAE,EAAE,EAAE,CAAC,CAAC;YAC9G,6EAA6E;YAC7E,eAAe,EAAE;gBAChB,MAAM,CAAC,IAAI,CACV,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC,EAC5D,WAAW,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,SAAS,CAAC,cAAc,CAAC,CAAC,CAC5E;aACD;YACD,KAAK,EAAE;gBACN;oBACC,MAAM,CAAC,MAAM,CACZ,WAAW,CAAC,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,WAAW,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CACzF;iBACD;aACD;YACD,MAAM,EAAE,CAAC,KAAK,EAAE,EAAE;gBACjB,MAAM,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACxC,MAAM,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACtC,MAAM,CAAC,KAAK,CAAC,2BAA2B,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACpD,MAAM,CAAC,KAAK,CAAC,yBAAyB,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACnD,CAAC;SACD,CAAC,CAAC,CAAC;QAEJ,YAAY,CACX,+DAA+D,EAC/D,CAAC,EAAE,QAAQ,EAAE,cAAc,EAAE,EAAE,EAAE,CAAC,CAAC;YAClC,eAAe,EAAE,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC;YAC/F,KAAK,EAAE;gBACN,MAAM,CAAC,UAAU,CAChB,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAC,EACtB,WAAW,CAAC,SAAS,CAAC,EAAE,MAAM,EAAE,QAAQ,CAAC,IAAI,CAAC,UAAU,EAAE,KAAK,EAAE,QAAQ,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAC5F;aACD;YACD,MAAM,EAAE,CAAC,KAAK,EAAE,EAAE;gBACjB,MAAM,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACxC,MAAM,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACtC,MAAM,CAAC,KAAK,CAAC,2BAA2B,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACpD,MAAM,CAAC,KAAK,CAAC,4BAA4B,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACtD,CAAC;SACD,CAAC,CACF,CAAC;QAEF,YAAY,CAAC,4BAA4B,EAAE,CAAC,EAAE,QAAQ,EAAE,cAAc,EAAE,EAAE,EAAE,CAAC,CAAC;YAC7E,eAAe,EAAE,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC;YAC/F,KAAK,EAAE,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACzD,MAAM,EAAE,CAAC,KAAK,EAAE,EAAE;gBACjB,MAAM,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACxC,MAAM,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACvC,CAAC;SACD,CAAC,CAAC,CAAC;QAEJ,YAAY,CAAC,6BAA6B,EAAE,CAAC,EAAE,QAAQ,EAAE,cAAc,EAAE,EAAE,EAAE,CAAC,CAAC;YAC9E,eAAe,EAAE,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC;YAC/F,KAAK,EAAE;gBACN;oBACC;wBACC,IAAI,EAAE,UAAU,CAAC,UAAU;wBAC3B,WAAW,EAAE,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC;wBAC5C,MAAM,EAAE,gBAAgB,CAAC,iBAAiB;qBAC1C;iBACD;aACD;YACD,MAAM,EAAE,CAAC,KAAK,EAAE,EAAE;gBACjB,MAAM,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACxC,MAAM,CAAC,KAAK,CAAC,wBAAwB,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACjD,MAAM,CAAC,KAAK,CAAC,6BAA6B,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACvD,CAAC;SACD,CAAC,CAAC,CAAC;QAEJ,YAAY,CAAC,8BAA8B,EAAE,CAAC,EAAE,QAAQ,EAAE,cAAc,EAAE,EAAE,EAAE,CAAC,CAAC;YAC/E,eAAe,EAAE;gBAChB,MAAM,CAAC,IAAI,CACV,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC,EAC5D,WAAW,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC,CAC5D;aACD;YACD,KAAK,EAAE;gBACN;oBACC;wBACC,IAAI,EAAE,UAAU,CAAC,UAAU;wBAC3B,WAAW,EAAE,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC;wBACzD,MAAM,EAAE,CAAC;wBACT,MAAM,EAAE,gBAAgB,CAAC,iBAAiB;qBAC1C;iBACD;aACD;YACD,MAAM,EAAE,CAAC,KAAK,EAAE,EAAE;gBACjB,MAAM,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACxC,MAAM,CAAC,KAAK,CAAC,wBAAwB,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACjD,MAAM,CAAC,KAAK,CAAC,8BAA8B,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACxD,CAAC;SACD,CAAC,CAAC,CAAC;QAEJ,YAAY,CAAC,8BAA8B,EAAE,CAAC,EAAE,QAAQ,EAAE,cAAc,EAAE,EAAE,EAAE,CAAC,CAAC;YAC/E,eAAe,EAAE;gBAChB,MAAM,CAAC,IAAI,CACV,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC,EAC5D,WAAW,CAAC,SAAS,CAAC;oBACrB,MAAM,EAAE,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,cAAc,CAAC;oBACjD,KAAK,EAAE,QAAQ,CAAC,IAAI,CAAC,UAAU;iBAC/B,CAAC,CACF;aACD;YACD,KAAK,EAAE;gBACN;oBACC;wBACC,IAAI,EAAE,UAAU,CAAC,UAAU;wBAC3B,WAAW,EAAE,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC;wBAC7C,UAAU,EAAE,QAAQ,CAAC,UAAU;wBAC/B,MAAM,EAAE,gBAAgB,CAAC,iBAAiB;qBAC1C;iBACD;aACD;YACD,MAAM,EAAE,CAAC,KAAK,EAAE,EAAE;gBACjB,MAAM,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACxC,MAAM,CAAC,KAAK,CAAC,wBAAwB,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACjD,MAAM,CAAC,KAAK,CAAC,8BAA8B,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACxD,CAAC;SACD,CAAC,CAAC,CAAC;QAEJ,YAAY,CAAC,6BAA6B,EAAE,CAAC,EAAE,QAAQ,EAAE,cAAc,EAAE,EAAE,EAAE,CAAC,CAAC;YAC9E,eAAe,EAAE;gBAChB,MAAM,CAAC,IAAI,CACV,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC,EAC3D,WAAW,CAAC,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC,CAC7D;aACD;YACD,KAAK,EAAE;gBACN;oBACC;wBACC,IAAI,EAAE,UAAU,CAAC,UAAU;wBAC3B,WAAW,EAAE,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC;wBAC5C,KAAK,EAAE,QAAQ,CAAC,IAAI,CAAC,UAAU;wBAC/B,MAAM,EAAE,gBAAgB,CAAC,iBAAiB;qBAC1C;iBACD;aACD;YACD,MAAM,EAAE,CAAC,KAAK,EAAE,EAAE;gBACjB,MAAM,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACxC,MAAM,CAAC,KAAK,CAAC,wBAAwB,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACjD,MAAM,CAAC,KAAK,CAAC,6BAA6B,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACvD,CAAC;SACD,CAAC,CAAC,CAAC;QAEJ,YAAY,CAAC,+BAA+B,EAAE,CAAC,EAAE,QAAQ,EAAE,cAAc,EAAE,EAAE,EAAE;YAC9E,MAAM,iBAAiB,GAAG,cAAc,CAAC;YACzC,OAAO;gBACN,eAAe,EAAE;oBAChB,MAAM,CAAC,UAAU,CAChB,CAAC,SAAS,CAAC,cAAc,CAAC,cAAc,CAAC,iBAAiB,CAAC,CAAC,CAAC,EAC7D,WAAW,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC,CAC5D;iBACD;gBACD,KAAK,EAAE;oBACN,MAAM,CAAC,UAAU,CAChB,CAAC,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,CAAC,iBAAiB,CAAC,CAAC,CAAC,EAChE,WAAW,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAChC;iBACD;gBACD,MAAM,EAAE,CAAC,KAAK,EAAE,EAAE;oBACjB,MAAM,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;oBACxC,MAAM,CAAC,KAAK,CAAC,mBAAmB,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBAC7C,CAAC;aACD,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,YAAY,CAAC,0BAA0B,EAAE,CAAC,EAAE,QAAQ,EAAE,cAAc,EAAE,EAAE,EAAE,CAAC,CAAC;YAC3E,eAAe,EAAE,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC;YAC/F,KAAK,EAAE,CAAC,CAAC,MAAM,CAAC,YAAY,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;YACxD,MAAM,EAAE,CAAC,KAAK,EAAE,EAAE;gBACjB,MAAM,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACxC,MAAM,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACxC,CAAC;SACD,CAAC,CAAC,CAAC;QAEJ,gEAAgE;QAChE,kBAAkB,CACjB,aAAa,EACb;YACC,EAAE,kBAAkB,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE;YACrC,EAAE,kBAAkB,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE;YACrC,EAAE,kBAAkB,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE;YACrC,EAAE,kBAAkB,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE;YACrC,EAAE,kBAAkB,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,EAAE;SACtC,EACD,CAAC,KAAK,EAAE,EAAE;YACT,MAAM,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,MAAM,CAAC,kBAAkB,CAAC,CAAC;QACtD,CAAC,CACD,CAAC;QAEF,2FAA2F;QAC3F,kBAAkB,CACjB,oCAAoC,EACpC;YACC;gBACC,IAAI,EAAE,EAAE,gBAAgB,EAAE,EAAE,EAAE;aAC9B;YACD;gBACC,IAAI,EAAE,EAAE,gBAAgB,EAAE,EAAE,EAAE;aAC9B;YACD;gBACC,IAAI,EAAE,EAAE,gBAAgB,EAAE,EAAE,EAAE;aAC9B;SACD,EACD,CAAC,KAAK,EAAE,EAAE;YACT,MAAM,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QAC1C,CAAC,CACD,CAAC;QAEF,sHAAsH;QACtH,gCAAgC;QAChC,kBAAkB,CACjB,8BAA8B,EAC9B;YACC;gBACC,OAAO,EAAE;oBACR,MAAM,EAAE,UAAU,CAAC,SAAS;oBAC5B,OAAO,EAAE,EAAE,IAAI,EAAE,mBAAmB,CAAC,WAAW,CAAC,sBAAsB,EAAE;iBACzE;aACD;SACD,EACD,CAAC,KAAK,EAAE,EAAE;YACT,8HAA8H;YAC9H,4BAA4B;YAC5B,MAAM,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACxC,MAAM,CAAC,KAAK,CAAC,kBAAkB,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC5C,CAAC,CACD,CAAC;IACH,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 { ITelemetryBaseEvent } from '@fluidframework/common-definitions';\nimport { MockContainerRuntimeFactory } from '@fluidframework/test-runtime-utils';\nimport { SharedTreeMergeHealthTelemetryHeartbeat } from '../MergeHealth';\nimport { SequencedEditAppliedEventArguments, SharedTree } from '../SharedTree';\nimport { RevisionView } from '../RevisionView';\nimport { Change, ChangeType, StablePlace, StableRange } from '../ChangeTypes';\nimport { ConstraintEffect, EditStatus } from '../persisted-types';\nimport { TransactionInternal } from '../TransactionInternal';\nimport { buildLeaf, TestTree } from './utilities/TestNode';\nimport { setUpTestSharedTree, setUpTestTree } from './utilities/TestUtilities';\n\nasync function setupHeartbeat() {\n\tconst events: ITelemetryBaseEvent[] = [];\n\tconst { tree, containerRuntimeFactory } = setUpTestSharedTree({\n\t\tlocalMode: false,\n\t\tlogger: { send: (event) => events.push(event) },\n\t\tallowInvalid: true,\n\t});\n\tconst testTree = setUpTestTree(tree);\n\tconst { tree: concurrentTree } = setUpTestSharedTree({\n\t\tcontainerRuntimeFactory,\n\t\tid: 'secondTestSharedTree',\n\t\tlocalMode: false,\n\t\tallowInvalid: true,\n\t});\n\tconst heartbeat = new SharedTreeMergeHealthTelemetryHeartbeat();\n\tcontainerRuntimeFactory.processAllMessages();\n\tawait tree.logViewer.getRevisionView(Number.POSITIVE_INFINITY);\n\theartbeat.attachTree(tree);\n\treturn {\n\t\ttree,\n\t\ttestTree,\n\t\tconcurrentTree,\n\t\tcontainerRuntimeFactory,\n\t\tevents,\n\t\theartbeat,\n\t};\n}\n\nasync function flush(tree: SharedTree, containerRuntimeFactory: MockContainerRuntimeFactory): Promise<RevisionView> {\n\tcontainerRuntimeFactory.processAllMessages();\n\treturn tree.logViewer.getRevisionView(Number.POSITIVE_INFINITY);\n}\n\nfunction itAggregates(\n\tnameOfAggregatedData: string,\n\tparamFunc: (params: { tree: SharedTree; testTree: TestTree; concurrentTree: SharedTree }) => {\n\t\tedits: Change[][];\n\t\tconcurrentEdits?: Change[][];\n\t\taction: (ITelemetryBaseEvent) => void;\n\t}\n): Mocha.Test {\n\treturn it(`Aggregates ${nameOfAggregatedData}`, async () => {\n\t\tconst { tree, testTree, concurrentTree, containerRuntimeFactory, events, heartbeat } = await setupHeartbeat();\n\t\tconst params = paramFunc({ tree, testTree, concurrentTree });\n\t\theartbeat.clearData();\n\t\tif (params.concurrentEdits !== undefined) {\n\t\t\tfor (const edit of params.concurrentEdits) {\n\t\t\t\tconcurrentTree.applyEdit(...edit);\n\t\t\t}\n\t\t}\n\t\tfor (const edit of params.edits) {\n\t\t\ttree.applyEdit(...edit);\n\t\t}\n\t\tawait flush(tree, containerRuntimeFactory);\n\t\theartbeat.flushHeartbeat();\n\t\texpect(events.length).greaterThan(0);\n\t\tparams.action(events[events.length - 1]);\n\t});\n}\n\nfunction itAggregatesMocked(\n\tnameOfAggregatedData: string,\n\tparams: readonly Partial<Record<keyof SequencedEditAppliedEventArguments, unknown>>[],\n\taction: (ITelemetryBaseEvent) => void\n): Mocha.Test {\n\treturn it(`Aggregates mocked ${nameOfAggregatedData}`, () => {\n\t\tconst events: ITelemetryBaseEvent[] = [];\n\t\tconst logger = { send: (event) => events.push(event) };\n\t\tconst heartbeat = new SharedTreeMergeHealthTelemetryHeartbeat();\n\t\tlet savedListener!: (...args: any[]) => void;\n\t\tconst mockTree = {\n\t\t\ton: (event: string, listener: (...args: any[]) => void) => {\n\t\t\t\tsavedListener = listener;\n\t\t\t},\n\t\t};\n\t\theartbeat.attachTree(mockTree as SharedTree);\n\t\tfor (const param of params) {\n\t\t\tsavedListener({\n\t\t\t\ttree: mockTree,\n\t\t\t\tlogger,\n\t\t\t\tedit: {},\n\t\t\t\treconciliationPath: [],\n\t\t\t\tsteps: [],\n\t\t\t\twasLocal: true,\n\t\t\t\toutcome: {\n\t\t\t\t\tstatus: EditStatus.Applied,\n\t\t\t\t},\n\t\t\t\t...param,\n\t\t\t});\n\t\t}\n\t\theartbeat.flushHeartbeat();\n\t\texpect(events.length).greaterThan(0);\n\t\tconst event = events[events.length - 1];\n\t\taction(event);\n\t});\n}\n\ndescribe('SharedTreeMergeHealthTelemetryHeartbeat', () => {\n\tit('Does not automatically send data synchronously', async () => {\n\t\tconst { tree, testTree, containerRuntimeFactory, events, heartbeat } = await setupHeartbeat();\n\t\ttree.applyEdit(...Change.insertTree([testTree.buildLeaf()], StablePlace.after(testTree.left)));\n\t\tawait flush(tree, containerRuntimeFactory);\n\t\t// Expect some data to have made it to the heartbeat\n\t\texpect(heartbeat.getStats(tree).editCount).equals(1);\n\t\t// Expect no data was sent to the logger\n\t\texpect(events).deep.equals([]);\n\t});\n\n\tit('Can be flushed synchronously', async () => {\n\t\tconst { tree, testTree, containerRuntimeFactory, events, heartbeat } = await setupHeartbeat();\n\t\ttree.applyEdit(...Change.insertTree([testTree.buildLeaf()], StablePlace.after(testTree.left)));\n\t\tawait flush(tree, containerRuntimeFactory);\n\t\theartbeat.flushHeartbeat();\n\t\texpect(events.length).equals(1);\n\t\texpect(events[0]).contains({\n\t\t\tcategory: 'Heartbeat',\n\t\t\teventName: 'SharedTree:SequencedEditApplied:EditMergeHealth',\n\t\t});\n\t});\n\n\tit('Does not send data if no local edits have been made', async () => {\n\t\tconst { tree, testTree, concurrentTree, containerRuntimeFactory, events, heartbeat } = await setupHeartbeat();\n\t\tconcurrentTree.applyEdit(\n\t\t\t...Change.insertTree([buildLeaf()], StablePlace.after(testTree.left.translateId(concurrentTree)))\n\t\t);\n\t\tawait flush(tree, containerRuntimeFactory);\n\t\theartbeat.flushHeartbeat();\n\t\texpect(events.length).equals(0);\n\t});\n\n\tdescribe('Aggregates merge health data', () => {\n\t\titAggregates('edit counts', ({ testTree }) => ({\n\t\t\tedits: [\n\t\t\t\tChange.insertTree([testTree.buildLeaf()], StablePlace.after(testTree.left)),\n\t\t\t\tChange.insertTree(\n\t\t\t\t\t[testTree.buildLeaf()],\n\t\t\t\t\tStablePlace.after(testTree.buildLeaf(testTree.generateNodeId()))\n\t\t\t\t),\n\t\t\t],\n\t\t\taction: (event) => {\n\t\t\t\texpect(event.editCount).equals(2);\n\t\t\t\texpect(event.failedEditCount).equals(1);\n\t\t\t},\n\t\t}));\n\n\t\titAggregates('preventable place failures', ({ testTree, concurrentTree }) => ({\n\t\t\tconcurrentEdits: [[Change.delete(StableRange.only(testTree.left.translateId(concurrentTree)))]],\n\t\t\tedits: [Change.insertTree([testTree.buildLeaf()], StablePlace.after(testTree.left))],\n\t\t\taction: (event) => {\n\t\t\t\texpect(event.failedEditCount).equals(1);\n\t\t\t\texpect(event.badPlaceCount).equals(1);\n\t\t\t\texpect(event.deletedSiblingBadPlaceCount).equals(1);\n\t\t\t\texpect(event.deletedAncestorBadPlaceCount).equals(0);\n\t\t\t},\n\t\t}));\n\n\t\titAggregates(\n\t\t\t'failures for the parent of a sibling-based place being deleted',\n\t\t\t({ testTree, concurrentTree }) => ({\n\t\t\t\tconcurrentEdits: [[Change.delete(StableRange.only(testTree.translateId(concurrentTree)))]],\n\t\t\t\tedits: [Change.insertTree([testTree.buildLeaf()], StablePlace.after(testTree.left))],\n\t\t\t\taction: (event) => {\n\t\t\t\t\texpect(event.failedEditCount).equals(1);\n\t\t\t\t\texpect(event.badPlaceCount).equals(1);\n\t\t\t\t\texpect(event.deletedSiblingBadPlaceCount).equals(1);\n\t\t\t\t\texpect(event.deletedAncestorBadPlaceCount).equals(0);\n\t\t\t\t},\n\t\t\t})\n\t\t);\n\n\t\titAggregates(\n\t\t\t'failures for a range made of valid places in different traits',\n\t\t\t({ testTree, concurrentTree }) => ({\n\t\t\t\t// Move the \"right\" node to another trait to make the range invalid\n\t\t\t\tconcurrentEdits: [\n\t\t\t\t\tChange.move(\n\t\t\t\t\t\tStableRange.only(testTree.left.translateId(concurrentTree)),\n\t\t\t\t\t\tStablePlace.atEndOf(testTree.right.traitLocation.translate(concurrentTree))\n\t\t\t\t\t),\n\t\t\t\t],\n\t\t\t\tedits: [\n\t\t\t\t\t[\n\t\t\t\t\t\tChange.delete(\n\t\t\t\t\t\t\tStableRange.from(StablePlace.before(testTree.left)).to(\n\t\t\t\t\t\t\t\tStablePlace.atEndOf(testTree.left.traitLocation)\n\t\t\t\t\t\t\t)\n\t\t\t\t\t\t),\n\t\t\t\t\t],\n\t\t\t\t],\n\t\t\t\taction: (event) => {\n\t\t\t\t\texpect(event.failedEditCount).equals(1);\n\t\t\t\t\texpect(event.badRangeCount).equals(1);\n\t\t\t\t\texpect(event.deletedSiblingBadRangeCount).equals(0);\n\t\t\t\t\texpect(event.updatedRangeHasPlacesInDifferentTraitsCount).equals(1);\n\t\t\t\t},\n\t\t\t})\n\t\t);\n\n\t\titAggregates('failures for a range made of valid places that are inverted', ({ testTree, concurrentTree }) => ({\n\t\t\t// Move the \"right\" node to the start of the trait to make the range inverted\n\t\t\tconcurrentEdits: [\n\t\t\t\tChange.move(\n\t\t\t\t\tStableRange.only(testTree.right.translateId(concurrentTree)),\n\t\t\t\t\tStablePlace.atStartOf(testTree.left.traitLocation.translate(concurrentTree))\n\t\t\t\t),\n\t\t\t],\n\t\t\tedits: [\n\t\t\t\t[\n\t\t\t\t\tChange.delete(\n\t\t\t\t\t\tStableRange.from(StablePlace.after(testTree.left)).to(StablePlace.before(testTree.right))\n\t\t\t\t\t),\n\t\t\t\t],\n\t\t\t],\n\t\t\taction: (event) => {\n\t\t\t\texpect(event.failedEditCount).equals(1);\n\t\t\t\texpect(event.badRangeCount).equals(1);\n\t\t\t\texpect(event.deletedSiblingBadRangeCount).equals(0);\n\t\t\t\texpect(event.updatedRangeInvertedCount).equals(1);\n\t\t\t},\n\t\t}));\n\n\t\titAggregates(\n\t\t\t'failures for the parent of a parent-based place being deleted',\n\t\t\t({ testTree, concurrentTree }) => ({\n\t\t\t\tconcurrentEdits: [[Change.delete(StableRange.only(testTree.left.translateId(concurrentTree)))]],\n\t\t\t\tedits: [\n\t\t\t\t\tChange.insertTree(\n\t\t\t\t\t\t[testTree.buildLeaf()],\n\t\t\t\t\t\tStablePlace.atStartOf({ parent: testTree.left.identifier, label: testTree.left.traitLabel })\n\t\t\t\t\t),\n\t\t\t\t],\n\t\t\t\taction: (event) => {\n\t\t\t\t\texpect(event.failedEditCount).equals(1);\n\t\t\t\t\texpect(event.badPlaceCount).equals(1);\n\t\t\t\t\texpect(event.deletedSiblingBadPlaceCount).equals(0);\n\t\t\t\t\texpect(event.deletedAncestorBadPlaceCount).equals(1);\n\t\t\t\t},\n\t\t\t})\n\t\t);\n\n\t\titAggregates('preventable range failures', ({ testTree, concurrentTree }) => ({\n\t\t\tconcurrentEdits: [[Change.delete(StableRange.only(testTree.left.translateId(concurrentTree)))]],\n\t\t\tedits: [[Change.delete(StableRange.only(testTree.left))]],\n\t\t\taction: (event) => {\n\t\t\t\texpect(event.failedEditCount).equals(1);\n\t\t\t\texpect(event.badRangeCount).equals(1);\n\t\t\t},\n\t\t}));\n\n\t\titAggregates('range constraint violations', ({ testTree, concurrentTree }) => ({\n\t\t\tconcurrentEdits: [[Change.delete(StableRange.only(testTree.left.translateId(concurrentTree)))]],\n\t\t\tedits: [\n\t\t\t\t[\n\t\t\t\t\t{\n\t\t\t\t\t\ttype: ChangeType.Constraint,\n\t\t\t\t\t\ttoConstrain: StableRange.only(testTree.left),\n\t\t\t\t\t\teffect: ConstraintEffect.InvalidAndDiscard,\n\t\t\t\t\t},\n\t\t\t\t],\n\t\t\t],\n\t\t\taction: (event) => {\n\t\t\t\texpect(event.failedEditCount).equals(1);\n\t\t\t\texpect(event.constraintViolationCount).equals(1);\n\t\t\t\texpect(event.rangeConstraintViolationCount).equals(1);\n\t\t\t},\n\t\t}));\n\n\t\titAggregates('length constraint violations', ({ testTree, concurrentTree }) => ({\n\t\t\tconcurrentEdits: [\n\t\t\t\tChange.move(\n\t\t\t\t\tStableRange.only(testTree.right.translateId(concurrentTree)),\n\t\t\t\t\tStablePlace.after(testTree.left.translateId(concurrentTree))\n\t\t\t\t),\n\t\t\t],\n\t\t\tedits: [\n\t\t\t\t[\n\t\t\t\t\t{\n\t\t\t\t\t\ttype: ChangeType.Constraint,\n\t\t\t\t\t\ttoConstrain: StableRange.all(testTree.left.traitLocation),\n\t\t\t\t\t\tlength: 1,\n\t\t\t\t\t\teffect: ConstraintEffect.InvalidAndDiscard,\n\t\t\t\t\t},\n\t\t\t\t],\n\t\t\t],\n\t\t\taction: (event) => {\n\t\t\t\texpect(event.failedEditCount).equals(1);\n\t\t\t\texpect(event.constraintViolationCount).equals(1);\n\t\t\t\texpect(event.lengthConstraintViolationCount).equals(1);\n\t\t\t},\n\t\t}));\n\n\t\titAggregates('parent constraint violations', ({ testTree, concurrentTree }) => ({\n\t\t\tconcurrentEdits: [\n\t\t\t\tChange.move(\n\t\t\t\t\tStableRange.only(testTree.right.translateId(concurrentTree)),\n\t\t\t\t\tStablePlace.atStartOf({\n\t\t\t\t\t\tparent: testTree.left.translateId(concurrentTree),\n\t\t\t\t\t\tlabel: testTree.left.traitLabel,\n\t\t\t\t\t})\n\t\t\t\t),\n\t\t\t],\n\t\t\tedits: [\n\t\t\t\t[\n\t\t\t\t\t{\n\t\t\t\t\t\ttype: ChangeType.Constraint,\n\t\t\t\t\t\ttoConstrain: StableRange.only(testTree.right),\n\t\t\t\t\t\tparentNode: testTree.identifier,\n\t\t\t\t\t\teffect: ConstraintEffect.InvalidAndDiscard,\n\t\t\t\t\t},\n\t\t\t\t],\n\t\t\t],\n\t\t\taction: (event) => {\n\t\t\t\texpect(event.failedEditCount).equals(1);\n\t\t\t\texpect(event.constraintViolationCount).equals(1);\n\t\t\t\texpect(event.parentConstraintViolationCount).equals(1);\n\t\t\t},\n\t\t}));\n\n\t\titAggregates('label constraint violations', ({ testTree, concurrentTree }) => ({\n\t\t\tconcurrentEdits: [\n\t\t\t\tChange.move(\n\t\t\t\t\tStableRange.only(testTree.left.translateId(concurrentTree)),\n\t\t\t\t\tStablePlace.after(testTree.right.translateId(concurrentTree))\n\t\t\t\t),\n\t\t\t],\n\t\t\tedits: [\n\t\t\t\t[\n\t\t\t\t\t{\n\t\t\t\t\t\ttype: ChangeType.Constraint,\n\t\t\t\t\t\ttoConstrain: StableRange.only(testTree.left),\n\t\t\t\t\t\tlabel: testTree.left.traitLabel,\n\t\t\t\t\t\teffect: ConstraintEffect.InvalidAndDiscard,\n\t\t\t\t\t},\n\t\t\t\t],\n\t\t\t],\n\t\t\taction: (event) => {\n\t\t\t\texpect(event.failedEditCount).equals(1);\n\t\t\t\texpect(event.constraintViolationCount).equals(1);\n\t\t\t\texpect(event.labelConstraintViolationCount).equals(1);\n\t\t\t},\n\t\t}));\n\n\t\titAggregates('failures due to ID collisions', ({ testTree, concurrentTree }) => {\n\t\t\tconst duplicateOverride = 'duplicate ID';\n\t\t\treturn {\n\t\t\t\tconcurrentEdits: [\n\t\t\t\t\tChange.insertTree(\n\t\t\t\t\t\t[buildLeaf(concurrentTree.generateNodeId(duplicateOverride))],\n\t\t\t\t\t\tStablePlace.after(testTree.left.translateId(concurrentTree))\n\t\t\t\t\t),\n\t\t\t\t],\n\t\t\t\tedits: [\n\t\t\t\t\tChange.insertTree(\n\t\t\t\t\t\t[testTree.buildLeaf(testTree.generateNodeId(duplicateOverride))],\n\t\t\t\t\t\tStablePlace.after(testTree.left)\n\t\t\t\t\t),\n\t\t\t\t],\n\t\t\t\taction: (event) => {\n\t\t\t\t\texpect(event.failedEditCount).equals(1);\n\t\t\t\t\texpect(event.idAlreadyInUseCount).equals(1);\n\t\t\t\t},\n\t\t\t};\n\t\t});\n\n\t\titAggregates('failures due unknown IDs', ({ testTree, concurrentTree }) => ({\n\t\t\tconcurrentEdits: [[Change.delete(StableRange.only(testTree.left.translateId(concurrentTree)))]],\n\t\t\tedits: [[Change.clearPayload(testTree.left.identifier)]],\n\t\t\taction: (event) => {\n\t\t\t\texpect(event.failedEditCount).equals(1);\n\t\t\t\texpect(event.unknownIdCount).equals(1);\n\t\t\t},\n\t\t}));\n\n\t\t// This test uses itAggregatesMocked to streamline the test code\n\t\titAggregatesMocked(\n\t\t\t'path length',\n\t\t\t[\n\t\t\t\t{ reconciliationPath: { length: 0 } },\n\t\t\t\t{ reconciliationPath: { length: 1 } },\n\t\t\t\t{ reconciliationPath: { length: 1 } },\n\t\t\t\t{ reconciliationPath: { length: 2 } },\n\t\t\t\t{ reconciliationPath: { length: 42 } },\n\t\t\t],\n\t\t\t(event) => {\n\t\t\t\texpect(event.pathLengths).equals('0:1,1:2,2:1,42:1');\n\t\t\t}\n\t\t);\n\n\t\t// This test uses itAggregatesMocked because multiple attempts are currently not being made\n\t\titAggregatesMocked(\n\t\t\t'maximum attempt number for an edit',\n\t\t\t[\n\t\t\t\t{\n\t\t\t\t\tedit: { pastAttemptCount: 40 },\n\t\t\t\t},\n\t\t\t\t{\n\t\t\t\t\tedit: { pastAttemptCount: 42 },\n\t\t\t\t},\n\t\t\t\t{\n\t\t\t\t\tedit: { pastAttemptCount: 41 },\n\t\t\t\t},\n\t\t\t],\n\t\t\t(event) => {\n\t\t\t\texpect(event.maxAttemptCount).equals(42);\n\t\t\t}\n\t\t);\n\n\t\t// This test uses itAggregatesMocked because there should be no way for a sequenced edit to become a malformed edit in\n\t\t// the face of concurrent edits.\n\t\titAggregatesMocked(\n\t\t\t'failures due malformed edits',\n\t\t\t[\n\t\t\t\t{\n\t\t\t\t\toutcome: {\n\t\t\t\t\t\tstatus: EditStatus.Malformed,\n\t\t\t\t\t\tfailure: { kind: TransactionInternal.FailureKind.UnusedDetachedSequence },\n\t\t\t\t\t},\n\t\t\t\t},\n\t\t\t],\n\t\t\t(event) => {\n\t\t\t\t// This test has to mock a lot of things because there should be no way for a sequenced edit to become a malformed edit in the\n\t\t\t\t// face of concurrent edits.\n\t\t\t\texpect(event.failedEditCount).equals(1);\n\t\t\t\texpect(event.malformedEditCount).equals(1);\n\t\t\t}\n\t\t);\n\t});\n});\n"]}

package/lib/test/NumericUuid.perf.tests.d.ts

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

package/lib/test/NumericUuid.perf.tests.d.ts.map

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

package/lib/test/NumericUuid.perf.tests.js

@@ -0,0 +1,68 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { benchmark, BenchmarkType } from '@fluid-tools/benchmark';
+import { v4 } from 'uuid';
+import { defaultClusterCapacity } from '../id-compressor/IdCompressor';
+import { getPositiveDelta, incrementUuid, numericUuidFromStableId, stableIdFromNumericUuid, assertIsStableId, } from '../id-compressor/NumericUuid';
+describe('NumericUuid Perf', () => {
+    const stableId = assertIsStableId('4779fbf2-2012-4510-b4f0-28a99a9f8946');
+    const stableId2 = assertIsStableId('5ccf492c-6a82-438c-9129-d76467525912');
+    const stableId3 = assertIsStableId('5ccf492c-6a82-438c-9129-d76467515912');
+    const uuid = numericUuidFromStableId(stableId);
+    const uuid2 = numericUuidFromStableId(stableId2);
+    const uuid3 = numericUuidFromStableId(stableId3);
+    const deltaMax = 2 ** 52 - 1;
+    const type = BenchmarkType.Measurement;
+    benchmark({
+        type,
+        title: `convert uuid string to numeric uuid`,
+        benchmarkFn: () => {
+            numericUuidFromStableId(stableId);
+        },
+    });
+    benchmark({
+        type,
+        title: `incrementing a uuid`,
+        benchmarkFn: () => {
+            incrementUuid(uuid, defaultClusterCapacity);
+        },
+    });
+    benchmark({
+        type,
+        title: `convert a uuid string into a session uuid`,
+        benchmarkFn: () => {
+            numericUuidFromStableId(stableId);
+        },
+    });
+    benchmark({
+        type,
+        title: `convert an numeric uuid into a uuid string`,
+        benchmarkFn: () => {
+            stableIdFromNumericUuid(uuid);
+        },
+    });
+    benchmark({
+        type,
+        title: `compute the delta between two distant numeric uuids`,
+        benchmarkFn: () => {
+            getPositiveDelta(uuid, uuid2, deltaMax);
+        },
+    });
+    benchmark({
+        type,
+        title: `compute the delta between two close numeric uuids`,
+        benchmarkFn: () => {
+            getPositiveDelta(uuid2, uuid3, deltaMax);
+        },
+    });
+    benchmark({
+        type,
+        title: `generate a random v4 uuid string and remove separators`,
+        benchmarkFn: () => {
+            v4();
+        },
+    });
+});
+//# sourceMappingURL=NumericUuid.perf.tests.js.map

package/lib/test/NumericUuid.perf.tests.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"NumericUuid.perf.tests.js","sourceRoot":"","sources":["../../src/test/NumericUuid.perf.tests.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,SAAS,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AAClE,OAAO,EAAE,EAAE,EAAE,MAAM,MAAM,CAAC;AAC1B,OAAO,EAAE,sBAAsB,EAAE,MAAM,+BAA+B,CAAC;AACvE,OAAO,EACN,gBAAgB,EAChB,aAAa,EACb,uBAAuB,EACvB,uBAAuB,EACvB,gBAAgB,GAChB,MAAM,8BAA8B,CAAC;AAGtC,QAAQ,CAAC,kBAAkB,EAAE,GAAG,EAAE;IACjC,MAAM,QAAQ,GAAG,gBAAgB,CAAC,sCAAsC,CAAC,CAAC;IAC1E,MAAM,SAAS,GAAG,gBAAgB,CAAC,sCAAsC,CAAC,CAAC;IAC3E,MAAM,SAAS,GAAG,gBAAgB,CAAC,sCAAsC,CAAC,CAAC;IAC3E,MAAM,IAAI,GAAG,uBAAuB,CAAC,QAAQ,CAAC,CAAC;IAC/C,MAAM,KAAK,GAAG,uBAAuB,CAAC,SAAS,CAAC,CAAC;IACjD,MAAM,KAAK,GAAG,uBAAuB,CAAC,SAAS,CAAC,CAAC;IACjD,MAAM,QAAQ,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;IAC7B,MAAM,IAAI,GAAG,aAAa,CAAC,WAAW,CAAC;IACvC,SAAS,CAAC;QACT,IAAI;QACJ,KAAK,EAAE,qCAAqC;QAC5C,WAAW,EAAE,GAAG,EAAE;YACjB,uBAAuB,CAAC,QAAQ,CAAC,CAAC;QACnC,CAAC;KACD,CAAC,CAAC;IACH,SAAS,CAAC;QACT,IAAI;QACJ,KAAK,EAAE,qBAAqB;QAC5B,WAAW,EAAE,GAAG,EAAE;YACjB,aAAa,CAAC,IAAI,EAAE,sBAAsB,CAAC,CAAC;QAC7C,CAAC;KACD,CAAC,CAAC;IACH,SAAS,CAAC;QACT,IAAI;QACJ,KAAK,EAAE,2CAA2C;QAClD,WAAW,EAAE,GAAG,EAAE;YACjB,uBAAuB,CAAC,QAAQ,CAAC,CAAC;QACnC,CAAC;KACD,CAAC,CAAC;IACH,SAAS,CAAC;QACT,IAAI;QACJ,KAAK,EAAE,4CAA4C;QACnD,WAAW,EAAE,GAAG,EAAE;YACjB,uBAAuB,CAAC,IAAI,CAAC,CAAC;QAC/B,CAAC;KACD,CAAC,CAAC;IACH,SAAS,CAAC;QACT,IAAI;QACJ,KAAK,EAAE,qDAAqD;QAC5D,WAAW,EAAE,GAAG,EAAE;YACjB,gBAAgB,CAAC,IAAI,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC;QACzC,CAAC;KACD,CAAC,CAAC;IACH,SAAS,CAAC;QACT,IAAI;QACJ,KAAK,EAAE,mDAAmD;QAC1D,WAAW,EAAE,GAAG,EAAE;YACjB,gBAAgB,CAAC,KAAK,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC;QAC1C,CAAC;KACD,CAAC,CAAC;IACH,SAAS,CAAC;QACT,IAAI;QACJ,KAAK,EAAE,wDAAwD;QAC/D,WAAW,EAAE,GAAG,EAAE;YACjB,EAAE,EAAgB,CAAC;QACpB,CAAC;KACD,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 { benchmark, BenchmarkType } from '@fluid-tools/benchmark';\nimport { v4 } from 'uuid';\nimport { defaultClusterCapacity } from '../id-compressor/IdCompressor';\nimport {\n\tgetPositiveDelta,\n\tincrementUuid,\n\tnumericUuidFromStableId,\n\tstableIdFromNumericUuid,\n\tassertIsStableId,\n} from '../id-compressor/NumericUuid';\nimport { UuidString } from '../Identifiers';\n\ndescribe('NumericUuid Perf', () => {\n\tconst stableId = assertIsStableId('4779fbf2-2012-4510-b4f0-28a99a9f8946');\n\tconst stableId2 = assertIsStableId('5ccf492c-6a82-438c-9129-d76467525912');\n\tconst stableId3 = assertIsStableId('5ccf492c-6a82-438c-9129-d76467515912');\n\tconst uuid = numericUuidFromStableId(stableId);\n\tconst uuid2 = numericUuidFromStableId(stableId2);\n\tconst uuid3 = numericUuidFromStableId(stableId3);\n\tconst deltaMax = 2 ** 52 - 1;\n\tconst type = BenchmarkType.Measurement;\n\tbenchmark({\n\t\ttype,\n\t\ttitle: `convert uuid string to numeric uuid`,\n\t\tbenchmarkFn: () => {\n\t\t\tnumericUuidFromStableId(stableId);\n\t\t},\n\t});\n\tbenchmark({\n\t\ttype,\n\t\ttitle: `incrementing a uuid`,\n\t\tbenchmarkFn: () => {\n\t\t\tincrementUuid(uuid, defaultClusterCapacity);\n\t\t},\n\t});\n\tbenchmark({\n\t\ttype,\n\t\ttitle: `convert a uuid string into a session uuid`,\n\t\tbenchmarkFn: () => {\n\t\t\tnumericUuidFromStableId(stableId);\n\t\t},\n\t});\n\tbenchmark({\n\t\ttype,\n\t\ttitle: `convert an numeric uuid into a uuid string`,\n\t\tbenchmarkFn: () => {\n\t\t\tstableIdFromNumericUuid(uuid);\n\t\t},\n\t});\n\tbenchmark({\n\t\ttype,\n\t\ttitle: `compute the delta between two distant numeric uuids`,\n\t\tbenchmarkFn: () => {\n\t\t\tgetPositiveDelta(uuid, uuid2, deltaMax);\n\t\t},\n\t});\n\tbenchmark({\n\t\ttype,\n\t\ttitle: `compute the delta between two close numeric uuids`,\n\t\tbenchmarkFn: () => {\n\t\t\tgetPositiveDelta(uuid2, uuid3, deltaMax);\n\t\t},\n\t});\n\tbenchmark({\n\t\ttype,\n\t\ttitle: `generate a random v4 uuid string and remove separators`,\n\t\tbenchmarkFn: () => {\n\t\t\tv4() as UuidString;\n\t\t},\n\t});\n});\n"]}

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

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

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

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

package/lib/test/NumericUuid.tests.js

@@ -0,0 +1,191 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+/* eslint-disable no-bitwise */
+import { expect } from 'chai';
+import Prando from 'prando';
+import { compareStrings } from '../Common';
+import { numericUuidEquals, createSessionId, getPositiveDelta, incrementUuid, numericUuidFromStableId, stableIdFromNumericUuid, ensureSessionUuid, isStableId, assertIsStableId, } from '../id-compressor/NumericUuid';
+import { integerToStableId } from './utilities/IdCompressorTestUtilities';
+describe('NumericUuid', () => {
+    it('can detect non-v4 variant 2 UUIDs', () => {
+        expect(isStableId('00000000-0000-0000-0000-000000000000')).to.be.false;
+        expect(isStableId('ffffffff-ffff-ffff-ffff-ffffffffffff')).to.be.false;
+        expect(isStableId('8e8fec9a10ea4d158308ed35bc7f1e66')).to.be.false;
+        expect(isStableId('8e8fec9a-10ea-4d15-8308-ed35bc7f1e66')).to.be.true;
+        [...new Array(16).keys()]
+            .map((n) => [n, n.toString(16)])
+            .forEach(([n, char]) => {
+            const expectUuidVersion = expect(isStableId(`00000000-0000-${char}000-b000-000000000000`));
+            if (char === '4') {
+                expectUuidVersion.to.be.true;
+            }
+            else {
+                expectUuidVersion.to.be.false;
+            }
+            const expectUuidVariant = expect(isStableId(`00000000-0000-4000-${char}000-000000000000`));
+            if (n >= 8 && n <= 11) {
+                expectUuidVariant.to.be.true;
+            }
+            else {
+                expectUuidVariant.to.be.false;
+            }
+        });
+    });
+    const maxStableId = assertIsStableId('ffffffff-ffff-4fff-bfff-ffffffffffff');
+    it('detects increment overflow', () => {
+        const uuid = numericUuidFromStableId(maxStableId);
+        expect(() => stableIdFromNumericUuid(uuid, 1)).to.throw('Exceeded maximum numeric UUID');
+        expect(() => stableIdFromNumericUuid(incrementUuid(uuid, 1))).to.throw('Exceeded maximum numeric UUID');
+        expect(() => stableIdFromNumericUuid(uuid, 256)).to.throw('Exceeded maximum numeric UUID');
+        expect(() => stableIdFromNumericUuid(incrementUuid(uuid, 256))).to.throw('Exceeded maximum numeric UUID');
+        expect(() => stableIdFromNumericUuid(uuid, Number.MAX_SAFE_INTEGER)).to.throw('Exceeded maximum numeric UUID');
+        expect(() => stableIdFromNumericUuid(incrementUuid(uuid, Number.MAX_SAFE_INTEGER))).to.throw('Exceeded maximum numeric UUID');
+    });
+    it('can rehydrate a valid session UUID', () => {
+        const uuid = assertIsStableId('44f95a8b-c52b-4828-a000-0000f0000003');
+        const sessionUuid = numericUuidFromStableId(uuid);
+        expect(stableIdFromNumericUuid(sessionUuid)).to.equal(uuid);
+    });
+    it('can create valid session UUIDs', () => {
+        for (let i = 0; i < 100; i++) {
+            const sessionId = createSessionId();
+            expect(sessionId.length).to.equal(36);
+            expect(() => {
+                const sessionNumericUuid = numericUuidFromStableId(sessionId);
+                expect(stableIdFromNumericUuid(sessionNumericUuid)).to.equal(sessionId);
+            }).to.not.throw();
+        }
+    });
+    const maxUuidBigint = bigIntFromStableId(maxStableId);
+    it('ensures that session UUIDs are resistant to overflow', () => {
+        const uuid = assertIsStableId('ffffffff-ffff-4fff-bfff-ffffffffffff');
+        for (let i = 0; i < 128; i++) {
+            const ensuredUuid = ensureSessionUuid(uuid);
+            expect(isStableId(ensuredUuid)).to.be.true;
+            const ensuredBigint = bigIntFromStableId(ensuredUuid);
+            expect(maxUuidBigint - ensuredBigint > Number.MAX_SAFE_INTEGER).to.be.true;
+        }
+    });
+    it('correctly adjusts session UUIDs that are in danger of overflow', () => {
+        const dangerous = [
+            assertIsStableId('ffffffff-ffff-4fff-bfff-ffffffffffff'),
+            assertIsStableId('ffffffff-ffff-4fff-bff0-000000000000'),
+            assertIsStableId('ffffffff-ffff-4fff-bf00-000000000000'),
+        ];
+        const safe = [
+            assertIsStableId('ffffffff-ffff-4fff-beff-ffffffffffff'),
+            assertIsStableId('ffffffff-ffff-4fff-bef0-000000000000'),
+            assertIsStableId('ffffffff-ffff-4fff-be00-000000000000'),
+        ];
+        dangerous.forEach((stableId) => expect(ensureSessionUuid(stableId)).to.not.equal(stableId));
+        safe.forEach((stableId) => expect(ensureSessionUuid(stableId)).to.equal(stableId));
+    });
+    const stableIds = [
+        assertIsStableId('748540ca-b7c5-4c99-83ff-c1b8e02c09d6'),
+        assertIsStableId('748540ca-b7c5-4c99-83ef-c1b8e02c09d6'),
+        assertIsStableId('748540ca-b7c5-4c99-831f-c1b8e02c09d6'),
+        assertIsStableId('0002c79e-b536-4776-b000-000266c252d5'),
+        assertIsStableId('082533b9-6d05-4068-a008-fe2cc43543f7'),
+        assertIsStableId('2c9fa1f8-48d5-4554-a466-000000000000'),
+        assertIsStableId('2c9fa1f8-48d5-4000-a000-000000000000'),
+        assertIsStableId('10000000-0000-4000-b000-000000000000'),
+        assertIsStableId('10000000-0000-4000-b020-000000000000'),
+        assertIsStableId('10000000-0000-4000-b00f-ffffffffffff'),
+        assertIsStableId('10000000-0000-4000-b040-000000000000'),
+        assertIsStableId('f0000000-0000-4000-8000-000000000000'),
+        assertIsStableId('efffffff-ffff-4fff-bfff-ffffffffffff'),
+        integerToStableId(0),
+        integerToStableId(1),
+        integerToStableId(77),
+        integerToStableId(1024),
+        integerToStableId(2 ** 32 - 1),
+        integerToStableId(2 ** 52 - 1),
+        integerToStableId(Number.MAX_SAFE_INTEGER),
+        integerToStableId(Number.MAX_SAFE_INTEGER - 1),
+    ];
+    describe('incrementing', () => {
+        const prando = new Prando('incrementing');
+        const incrementAmounts = [
+            ...[...new Array(53).keys()].map((n) => 2 ** n - 1),
+            ...[...new Array(10).keys()].map((_) => prando.nextInt(0, Number.MAX_SAFE_INTEGER)),
+        ];
+        stableIds.forEach((stableId) => {
+            it(`can increment ${stableId}`, () => {
+                const uuid = numericUuidFromStableId(stableId);
+                incrementAmounts.forEach((incrementAmount) => {
+                    const bigintIncremented = bigIntFromStableId(stableId) + BigInt(incrementAmount);
+                    const incremented = incrementUuid(uuid, incrementAmount);
+                    const bigintStr = integerToStableId(bigintIncremented);
+                    expect(stableIdFromNumericUuid(incremented)).to.equal(bigintStr);
+                });
+            });
+        });
+    });
+    it('delta calculation can calculate the integer delta between stable ids', () => {
+        stableIds.forEach((stableIdA) => {
+            const uuidA = numericUuidFromStableId(stableIdA);
+            const bigintA = bigIntFromStableId(stableIdA);
+            const arbitraryMaxDelta = 2 ** 32 - 1;
+            stableIds.forEach((stableIdB) => {
+                const uuidB = numericUuidFromStableId(stableIdB);
+                const bigintB = bigIntFromStableId(stableIdB);
+                const realDelta = bigintA - bigintB;
+                const numericDelta = getPositiveDelta(uuidA, uuidB, Number.MAX_SAFE_INTEGER);
+                if (realDelta > Number.MAX_SAFE_INTEGER || realDelta < 0) {
+                    expect(numericDelta).to.equal(undefined);
+                }
+                else {
+                    expect(numericDelta).to.equal(Number(realDelta));
+                }
+                const numericDeltaCapped = getPositiveDelta(uuidA, uuidB, arbitraryMaxDelta);
+                if (realDelta >= 0 && realDelta <= arbitraryMaxDelta) {
+                    expect(numericDeltaCapped).to.equal(Number(realDelta));
+                }
+                else {
+                    expect(numericDeltaCapped).to.equal(undefined);
+                }
+            });
+        });
+    });
+    it('can round trip between stable ID and uuid', () => {
+        stableIds.forEach((stableId) => {
+            const uuid = numericUuidFromStableId(stableId);
+            const roundTripped = stableIdFromNumericUuid(uuid);
+            expect(stableId).to.equal(roundTripped);
+        });
+    });
+    it('can compare numeric uuids', () => {
+        stableIds.forEach((stableIdA) => {
+            stableIds.forEach((stableIdB) => {
+                const numericA = numericUuidFromStableId(stableIdA);
+                const numericB = numericUuidFromStableId(stableIdB);
+                const comparedNumeric = numericUuidEquals(numericA, numericB);
+                const comparedStrings = compareStrings(stableIdA, stableIdB);
+                expect(comparedNumeric).to.equal(comparedStrings === 0);
+            });
+        });
+    });
+});
+function bigIntFromStableId(id) {
+    const minimized = id.replace(/-/g, '');
+    //      UUID | xxxxxxxx-xxxx-Vxxx-vxxx-xxxxxxxxxxxx | The StableId passed to this function, shown here in standard UUID notation
+    //   nibbles | hhhhhhhh hhhh  mmm llll llllllllllll | Whether or not each nibble is part of the "high", "middle" or "low" group below
+    // bit count | 44444444-4444-0444-2444-444444444444 | The number of bits per nibble that are used to encode the number
+    // Interpret numerically...
+    const highNibbles = BigInt(`0x${minimized.substr(0, 12)}`); // ...all nibbles above the version nibble,
+    const midNibbles = BigInt(`0x${minimized.substr(13, 3)}`); //  the nibbles below the version nibble and above the variant nibble,
+    const lowNibbles = BigInt(`0x${minimized.substr(16, 16)}`); // and the variant nibble and all nibbles below
+    // Count the number of bits that contribute to the number (i.e. are not reserved for version/variant) in...
+    const lowBitCount = BigInt(62); // ...the low nibbles
+    const midBitCount = BigInt(12); // and the mid nibbles
+    // Shift the values of each region by the appropriate number of bits
+    const highNumber = highNibbles << (midBitCount + lowBitCount);
+    const midNumber = midNibbles << lowBitCount;
+    // The low nibbles include the variant nibble because its two low bits are numerical (but its two upper bits are not). So mask them out:
+    const lowNumber = lowNibbles & BigInt('0x3fffffffffffffff'); // A nibble '0011' followed by 15 nibbles '1111'.
+    // Now that high and mid are shifted correctly, the final number is their sum:
+    return highNumber + midNumber + lowNumber;
+}
+//# sourceMappingURL=NumericUuid.tests.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"NumericUuid.tests.js","sourceRoot":"","sources":["../../src/test/NumericUuid.tests.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,+BAA+B;AAE/B,OAAO,EAAE,MAAM,EAAE,MAAM,MAAM,CAAC;AAC9B,OAAO,MAAM,MAAM,QAAQ,CAAC;AAC5B,OAAO,EAAE,cAAc,EAAE,MAAM,WAAW,CAAC;AAC3C,OAAO,EACN,iBAAiB,EACjB,eAAe,EACf,gBAAgB,EAChB,aAAa,EACb,uBAAuB,EACvB,uBAAuB,EACvB,iBAAiB,EACjB,UAAU,EACV,gBAAgB,GAChB,MAAM,8BAA8B,CAAC;AAEtC,OAAO,EAAE,iBAAiB,EAAE,MAAM,uCAAuC,CAAC;AAE1E,QAAQ,CAAC,aAAa,EAAE,GAAG,EAAE;IAC5B,EAAE,CAAC,mCAAmC,EAAE,GAAG,EAAE;QAC5C,MAAM,CAAC,UAAU,CAAC,sCAAsC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC;QACvE,MAAM,CAAC,UAAU,CAAC,sCAAsC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC;QACvE,MAAM,CAAC,UAAU,CAAC,kCAAkC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC;QACnE,MAAM,CAAC,UAAU,CAAC,sCAAsC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC;QACtE,CAAC,GAAG,IAAI,KAAK,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;aACvB,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC;aAC/B,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,EAAE;YACtB,MAAM,iBAAiB,GAAG,MAAM,CAAC,UAAU,CAAC,iBAAiB,IAAI,uBAAuB,CAAC,CAAC,CAAC;YAC3F,IAAI,IAAI,KAAK,GAAG,EAAE;gBACjB,iBAAiB,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC;aAC7B;iBAAM;gBACN,iBAAiB,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC;aAC9B;YAED,MAAM,iBAAiB,GAAG,MAAM,CAAC,UAAU,CAAC,sBAAsB,IAAI,kBAAkB,CAAC,CAAC,CAAC;YAC3F,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE;gBACtB,iBAAiB,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC;aAC7B;iBAAM;gBACN,iBAAiB,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC;aAC9B;QACF,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,MAAM,WAAW,GAAG,gBAAgB,CAAC,sCAAsC,CAAC,CAAC;IAE7E,EAAE,CAAC,4BAA4B,EAAE,GAAG,EAAE;QACrC,MAAM,IAAI,GAAG,uBAAuB,CAAC,WAAW,CAAC,CAAC;QAClD,MAAM,CAAC,GAAG,EAAE,CAAC,uBAAuB,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,+BAA+B,CAAC,CAAC;QACzF,MAAM,CAAC,GAAG,EAAE,CAAC,uBAAuB,CAAC,aAAa,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,+BAA+B,CAAC,CAAC;QACxG,MAAM,CAAC,GAAG,EAAE,CAAC,uBAAuB,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,+BAA+B,CAAC,CAAC;QAC3F,MAAM,CAAC,GAAG,EAAE,CAAC,uBAAuB,CAAC,aAAa,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,+BAA+B,CAAC,CAAC;QAC1G,MAAM,CAAC,GAAG,EAAE,CAAC,uBAAuB,CAAC,IAAI,EAAE,MAAM,CAAC,gBAAgB,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,+BAA+B,CAAC,CAAC;QAC/G,MAAM,CAAC,GAAG,EAAE,CAAC,uBAAuB,CAAC,aAAa,CAAC,IAAI,EAAE,MAAM,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAC3F,+BAA+B,CAC/B,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,oCAAoC,EAAE,GAAG,EAAE;QAC7C,MAAM,IAAI,GAAG,gBAAgB,CAAC,sCAAsC,CAAC,CAAC;QACtE,MAAM,WAAW,GAAG,uBAAuB,CAAC,IAAI,CAAC,CAAC;QAClD,MAAM,CAAC,uBAAuB,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAC7D,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,gCAAgC,EAAE,GAAG,EAAE;QACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE;YAC7B,MAAM,SAAS,GAAG,eAAe,EAAE,CAAC;YACpC,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;YACtC,MAAM,CAAC,GAAG,EAAE;gBACX,MAAM,kBAAkB,GAAG,uBAAuB,CAAC,SAAS,CAAC,CAAC;gBAC9D,MAAM,CAAC,uBAAuB,CAAC,kBAAkB,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;YACzE,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC;SAClB;IACF,CAAC,CAAC,CAAC;IAEH,MAAM,aAAa,GAAG,kBAAkB,CAAC,WAAW,CAAC,CAAC;IAEtD,EAAE,CAAC,sDAAsD,EAAE,GAAG,EAAE;QAC/D,MAAM,IAAI,GAAG,gBAAgB,CAAC,sCAAsC,CAAC,CAAC;QACtE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE;YAC7B,MAAM,WAAW,GAAG,iBAAiB,CAAC,IAAI,CAAC,CAAC;YAC5C,MAAM,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC;YAC3C,MAAM,aAAa,GAAG,kBAAkB,CAAC,WAAW,CAAC,CAAC;YACtD,MAAM,CAAC,aAAa,GAAG,aAAa,GAAG,MAAM,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC;SAC3E;IACF,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,gEAAgE,EAAE,GAAG,EAAE;QACzE,MAAM,SAAS,GAAG;YACjB,gBAAgB,CAAC,sCAAsC,CAAC;YACxD,gBAAgB,CAAC,sCAAsC,CAAC;YACxD,gBAAgB,CAAC,sCAAsC,CAAC;SACxD,CAAC;QAEF,MAAM,IAAI,GAAG;YACZ,gBAAgB,CAAC,sCAAsC,CAAC;YACxD,gBAAgB,CAAC,sCAAsC,CAAC;YACxD,gBAAgB,CAAC,sCAAsC,CAAC;SACxD,CAAC;QAEF,SAAS,CAAC,OAAO,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,MAAM,CAAC,iBAAiB,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC;QAC5F,IAAI,CAAC,OAAO,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,MAAM,CAAC,iBAAiB,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC;IACpF,CAAC,CAAC,CAAC;IAEH,MAAM,SAAS,GAAG;QACjB,gBAAgB,CAAC,sCAAsC,CAAC;QACxD,gBAAgB,CAAC,sCAAsC,CAAC;QACxD,gBAAgB,CAAC,sCAAsC,CAAC;QACxD,gBAAgB,CAAC,sCAAsC,CAAC;QACxD,gBAAgB,CAAC,sCAAsC,CAAC;QACxD,gBAAgB,CAAC,sCAAsC,CAAC;QACxD,gBAAgB,CAAC,sCAAsC,CAAC;QACxD,gBAAgB,CAAC,sCAAsC,CAAC;QACxD,gBAAgB,CAAC,sCAAsC,CAAC;QACxD,gBAAgB,CAAC,sCAAsC,CAAC;QACxD,gBAAgB,CAAC,sCAAsC,CAAC;QACxD,gBAAgB,CAAC,sCAAsC,CAAC;QACxD,gBAAgB,CAAC,sCAAsC,CAAC;QACxD,iBAAiB,CAAC,CAAC,CAAC;QACpB,iBAAiB,CAAC,CAAC,CAAC;QACpB,iBAAiB,CAAC,EAAE,CAAC;QACrB,iBAAiB,CAAC,IAAI,CAAC;QACvB,iBAAiB,CAAC,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QAC9B,iBAAiB,CAAC,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QAC9B,iBAAiB,CAAC,MAAM,CAAC,gBAAgB,CAAC;QAC1C,iBAAiB,CAAC,MAAM,CAAC,gBAAgB,GAAG,CAAC,CAAC;KAC9C,CAAC;IAEF,QAAQ,CAAC,cAAc,EAAE,GAAG,EAAE;QAC7B,MAAM,MAAM,GAAG,IAAI,MAAM,CAAC,cAAc,CAAC,CAAC;QAC1C,MAAM,gBAAgB,GAAG;YACxB,GAAG,CAAC,GAAG,IAAI,KAAK,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACnD,GAAG,CAAC,GAAG,IAAI,KAAK,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,MAAM,CAAC,gBAAgB,CAAC,CAAC;SACnF,CAAC;QACF,SAAS,CAAC,OAAO,CAAC,CAAC,QAAQ,EAAE,EAAE;YAC9B,EAAE,CAAC,iBAAiB,QAAQ,EAAE,EAAE,GAAG,EAAE;gBACpC,MAAM,IAAI,GAAG,uBAAuB,CAAC,QAAQ,CAAC,CAAC;gBAE/C,gBAAgB,CAAC,OAAO,CAAC,CAAC,eAAe,EAAE,EAAE;oBAC5C,MAAM,iBAAiB,GAAG,kBAAkB,CAAC,QAAQ,CAAC,GAAG,MAAM,CAAC,eAAe,CAAC,CAAC;oBACjF,MAAM,WAAW,GAAG,aAAa,CAAC,IAAI,EAAE,eAAe,CAAC,CAAC;oBACzD,MAAM,SAAS,GAAG,iBAAiB,CAAC,iBAAiB,CAAC,CAAC;oBACvD,MAAM,CAAC,uBAAuB,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;gBAClE,CAAC,CAAC,CAAC;YACJ,CAAC,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,sEAAsE,EAAE,GAAG,EAAE;QAC/E,SAAS,CAAC,OAAO,CAAC,CAAC,SAAS,EAAE,EAAE;YAC/B,MAAM,KAAK,GAAG,uBAAuB,CAAC,SAAS,CAAC,CAAC;YACjD,MAAM,OAAO,GAAG,kBAAkB,CAAC,SAAS,CAAC,CAAC;YAC9C,MAAM,iBAAiB,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;YACtC,SAAS,CAAC,OAAO,CAAC,CAAC,SAAS,EAAE,EAAE;gBAC/B,MAAM,KAAK,GAAG,uBAAuB,CAAC,SAAS,CAAC,CAAC;gBACjD,MAAM,OAAO,GAAG,kBAAkB,CAAC,SAAS,CAAC,CAAC;gBAC9C,MAAM,SAAS,GAAG,OAAO,GAAG,OAAO,CAAC;gBACpC,MAAM,YAAY,GAAG,gBAAgB,CAAC,KAAK,EAAE,KAAK,EAAE,MAAM,CAAC,gBAAgB,CAAC,CAAC;gBAC7E,IAAI,SAAS,GAAG,MAAM,CAAC,gBAAgB,IAAI,SAAS,GAAG,CAAC,EAAE;oBACzD,MAAM,CAAC,YAAY,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;iBACzC;qBAAM;oBACN,MAAM,CAAC,YAAY,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC;iBACjD;gBACD,MAAM,kBAAkB,GAAG,gBAAgB,CAAC,KAAK,EAAE,KAAK,EAAE,iBAAiB,CAAC,CAAC;gBAC7E,IAAI,SAAS,IAAI,CAAC,IAAI,SAAS,IAAI,iBAAiB,EAAE;oBACrD,MAAM,CAAC,kBAAkB,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC;iBACvD;qBAAM;oBACN,MAAM,CAAC,kBAAkB,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;iBAC/C;YACF,CAAC,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,2CAA2C,EAAE,GAAG,EAAE;QACpD,SAAS,CAAC,OAAO,CAAC,CAAC,QAAQ,EAAE,EAAE;YAC9B,MAAM,IAAI,GAAG,uBAAuB,CAAC,QAAQ,CAAC,CAAC;YAC/C,MAAM,YAAY,GAAG,uBAAuB,CAAC,IAAI,CAAC,CAAC;YACnD,MAAM,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC;QACzC,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,2BAA2B,EAAE,GAAG,EAAE;QACpC,SAAS,CAAC,OAAO,CAAC,CAAC,SAAS,EAAE,EAAE;YAC/B,SAAS,CAAC,OAAO,CAAC,CAAC,SAAS,EAAE,EAAE;gBAC/B,MAAM,QAAQ,GAAG,uBAAuB,CAAC,SAAS,CAAC,CAAC;gBACpD,MAAM,QAAQ,GAAG,uBAAuB,CAAC,SAAS,CAAC,CAAC;gBACpD,MAAM,eAAe,GAAG,iBAAiB,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;gBAC9D,MAAM,eAAe,GAAG,cAAc,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;gBAC7D,MAAM,CAAC,eAAe,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,eAAe,KAAK,CAAC,CAAC,CAAC;YACzD,CAAC,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;AACJ,CAAC,CAAC,CAAC;AAEH,SAAS,kBAAkB,CAAC,EAAY;IACvC,MAAM,SAAS,GAAG,EAAE,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;IACvC,gIAAgI;IAChI,qIAAqI;IACrI,sHAAsH;IAEtH,2BAA2B;IAC3B,MAAM,WAAW,GAAG,MAAM,CAAC,KAAK,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,2CAA2C;IACvG,MAAM,UAAU,GAAG,MAAM,CAAC,KAAK,SAAS,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,sEAAsE;IACjI,MAAM,UAAU,GAAG,MAAM,CAAC,KAAK,SAAS,CAAC,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,+CAA+C;IAC3G,2GAA2G;IAC3G,MAAM,WAAW,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,qBAAqB;IACrD,MAAM,WAAW,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,sBAAsB;IACtD,oEAAoE;IACpE,MAAM,UAAU,GAAG,WAAW,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC,CAAC;IAC9D,MAAM,SAAS,GAAG,UAAU,IAAI,WAAW,CAAC;IAC5C,wIAAwI;IACxI,MAAM,SAAS,GAAG,UAAU,GAAG,MAAM,CAAC,oBAAoB,CAAC,CAAC,CAAC,iDAAiD;IAC9G,8EAA8E;IAC9E,OAAO,UAAU,GAAG,SAAS,GAAG,SAAS,CAAC;AAC3C,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\n/* eslint-disable no-bitwise */\n\nimport { expect } from 'chai';\nimport Prando from 'prando';\nimport { compareStrings } from '../Common';\nimport {\n\tnumericUuidEquals,\n\tcreateSessionId,\n\tgetPositiveDelta,\n\tincrementUuid,\n\tnumericUuidFromStableId,\n\tstableIdFromNumericUuid,\n\tensureSessionUuid,\n\tisStableId,\n\tassertIsStableId,\n} from '../id-compressor/NumericUuid';\nimport { StableId } from '../Identifiers';\nimport { integerToStableId } from './utilities/IdCompressorTestUtilities';\n\ndescribe('NumericUuid', () => {\n\tit('can detect non-v4 variant 2 UUIDs', () => {\n\t\texpect(isStableId('00000000-0000-0000-0000-000000000000')).to.be.false;\n\t\texpect(isStableId('ffffffff-ffff-ffff-ffff-ffffffffffff')).to.be.false;\n\t\texpect(isStableId('8e8fec9a10ea4d158308ed35bc7f1e66')).to.be.false;\n\t\texpect(isStableId('8e8fec9a-10ea-4d15-8308-ed35bc7f1e66')).to.be.true;\n\t\t[...new Array(16).keys()]\n\t\t\t.map((n) => [n, n.toString(16)])\n\t\t\t.forEach(([n, char]) => {\n\t\t\t\tconst expectUuidVersion = expect(isStableId(`00000000-0000-${char}000-b000-000000000000`));\n\t\t\t\tif (char === '4') {\n\t\t\t\t\texpectUuidVersion.to.be.true;\n\t\t\t\t} else {\n\t\t\t\t\texpectUuidVersion.to.be.false;\n\t\t\t\t}\n\n\t\t\t\tconst expectUuidVariant = expect(isStableId(`00000000-0000-4000-${char}000-000000000000`));\n\t\t\t\tif (n >= 8 && n <= 11) {\n\t\t\t\t\texpectUuidVariant.to.be.true;\n\t\t\t\t} else {\n\t\t\t\t\texpectUuidVariant.to.be.false;\n\t\t\t\t}\n\t\t\t});\n\t});\n\n\tconst maxStableId = assertIsStableId('ffffffff-ffff-4fff-bfff-ffffffffffff');\n\n\tit('detects increment overflow', () => {\n\t\tconst uuid = numericUuidFromStableId(maxStableId);\n\t\texpect(() => stableIdFromNumericUuid(uuid, 1)).to.throw('Exceeded maximum numeric UUID');\n\t\texpect(() => stableIdFromNumericUuid(incrementUuid(uuid, 1))).to.throw('Exceeded maximum numeric UUID');\n\t\texpect(() => stableIdFromNumericUuid(uuid, 256)).to.throw('Exceeded maximum numeric UUID');\n\t\texpect(() => stableIdFromNumericUuid(incrementUuid(uuid, 256))).to.throw('Exceeded maximum numeric UUID');\n\t\texpect(() => stableIdFromNumericUuid(uuid, Number.MAX_SAFE_INTEGER)).to.throw('Exceeded maximum numeric UUID');\n\t\texpect(() => stableIdFromNumericUuid(incrementUuid(uuid, Number.MAX_SAFE_INTEGER))).to.throw(\n\t\t\t'Exceeded maximum numeric UUID'\n\t\t);\n\t});\n\n\tit('can rehydrate a valid session UUID', () => {\n\t\tconst uuid = assertIsStableId('44f95a8b-c52b-4828-a000-0000f0000003');\n\t\tconst sessionUuid = numericUuidFromStableId(uuid);\n\t\texpect(stableIdFromNumericUuid(sessionUuid)).to.equal(uuid);\n\t});\n\n\tit('can create valid session UUIDs', () => {\n\t\tfor (let i = 0; i < 100; i++) {\n\t\t\tconst sessionId = createSessionId();\n\t\t\texpect(sessionId.length).to.equal(36);\n\t\t\texpect(() => {\n\t\t\t\tconst sessionNumericUuid = numericUuidFromStableId(sessionId);\n\t\t\t\texpect(stableIdFromNumericUuid(sessionNumericUuid)).to.equal(sessionId);\n\t\t\t}).to.not.throw();\n\t\t}\n\t});\n\n\tconst maxUuidBigint = bigIntFromStableId(maxStableId);\n\n\tit('ensures that session UUIDs are resistant to overflow', () => {\n\t\tconst uuid = assertIsStableId('ffffffff-ffff-4fff-bfff-ffffffffffff');\n\t\tfor (let i = 0; i < 128; i++) {\n\t\t\tconst ensuredUuid = ensureSessionUuid(uuid);\n\t\t\texpect(isStableId(ensuredUuid)).to.be.true;\n\t\t\tconst ensuredBigint = bigIntFromStableId(ensuredUuid);\n\t\t\texpect(maxUuidBigint - ensuredBigint > Number.MAX_SAFE_INTEGER).to.be.true;\n\t\t}\n\t});\n\n\tit('correctly adjusts session UUIDs that are in danger of overflow', () => {\n\t\tconst dangerous = [\n\t\t\tassertIsStableId('ffffffff-ffff-4fff-bfff-ffffffffffff'),\n\t\t\tassertIsStableId('ffffffff-ffff-4fff-bff0-000000000000'),\n\t\t\tassertIsStableId('ffffffff-ffff-4fff-bf00-000000000000'),\n\t\t];\n\n\t\tconst safe = [\n\t\t\tassertIsStableId('ffffffff-ffff-4fff-beff-ffffffffffff'),\n\t\t\tassertIsStableId('ffffffff-ffff-4fff-bef0-000000000000'),\n\t\t\tassertIsStableId('ffffffff-ffff-4fff-be00-000000000000'),\n\t\t];\n\n\t\tdangerous.forEach((stableId) => expect(ensureSessionUuid(stableId)).to.not.equal(stableId));\n\t\tsafe.forEach((stableId) => expect(ensureSessionUuid(stableId)).to.equal(stableId));\n\t});\n\n\tconst stableIds = [\n\t\tassertIsStableId('748540ca-b7c5-4c99-83ff-c1b8e02c09d6'),\n\t\tassertIsStableId('748540ca-b7c5-4c99-83ef-c1b8e02c09d6'),\n\t\tassertIsStableId('748540ca-b7c5-4c99-831f-c1b8e02c09d6'),\n\t\tassertIsStableId('0002c79e-b536-4776-b000-000266c252d5'),\n\t\tassertIsStableId('082533b9-6d05-4068-a008-fe2cc43543f7'),\n\t\tassertIsStableId('2c9fa1f8-48d5-4554-a466-000000000000'),\n\t\tassertIsStableId('2c9fa1f8-48d5-4000-a000-000000000000'),\n\t\tassertIsStableId('10000000-0000-4000-b000-000000000000'),\n\t\tassertIsStableId('10000000-0000-4000-b020-000000000000'), // 2^52\n\t\tassertIsStableId('10000000-0000-4000-b00f-ffffffffffff'),\n\t\tassertIsStableId('10000000-0000-4000-b040-000000000000'),\n\t\tassertIsStableId('f0000000-0000-4000-8000-000000000000'),\n\t\tassertIsStableId('efffffff-ffff-4fff-bfff-ffffffffffff'),\n\t\tintegerToStableId(0),\n\t\tintegerToStableId(1),\n\t\tintegerToStableId(77),\n\t\tintegerToStableId(1024),\n\t\tintegerToStableId(2 ** 32 - 1),\n\t\tintegerToStableId(2 ** 52 - 1),\n\t\tintegerToStableId(Number.MAX_SAFE_INTEGER),\n\t\tintegerToStableId(Number.MAX_SAFE_INTEGER - 1),\n\t];\n\n\tdescribe('incrementing', () => {\n\t\tconst prando = new Prando('incrementing');\n\t\tconst incrementAmounts = [\n\t\t\t...[...new Array(53).keys()].map((n) => 2 ** n - 1),\n\t\t\t...[...new Array(10).keys()].map((_) => prando.nextInt(0, Number.MAX_SAFE_INTEGER)),\n\t\t];\n\t\tstableIds.forEach((stableId) => {\n\t\t\tit(`can increment ${stableId}`, () => {\n\t\t\t\tconst uuid = numericUuidFromStableId(stableId);\n\n\t\t\t\tincrementAmounts.forEach((incrementAmount) => {\n\t\t\t\t\tconst bigintIncremented = bigIntFromStableId(stableId) + BigInt(incrementAmount);\n\t\t\t\t\tconst incremented = incrementUuid(uuid, incrementAmount);\n\t\t\t\t\tconst bigintStr = integerToStableId(bigintIncremented);\n\t\t\t\t\texpect(stableIdFromNumericUuid(incremented)).to.equal(bigintStr);\n\t\t\t\t});\n\t\t\t});\n\t\t});\n\t});\n\n\tit('delta calculation can calculate the integer delta between stable ids', () => {\n\t\tstableIds.forEach((stableIdA) => {\n\t\t\tconst uuidA = numericUuidFromStableId(stableIdA);\n\t\t\tconst bigintA = bigIntFromStableId(stableIdA);\n\t\t\tconst arbitraryMaxDelta = 2 ** 32 - 1;\n\t\t\tstableIds.forEach((stableIdB) => {\n\t\t\t\tconst uuidB = numericUuidFromStableId(stableIdB);\n\t\t\t\tconst bigintB = bigIntFromStableId(stableIdB);\n\t\t\t\tconst realDelta = bigintA - bigintB;\n\t\t\t\tconst numericDelta = getPositiveDelta(uuidA, uuidB, Number.MAX_SAFE_INTEGER);\n\t\t\t\tif (realDelta > Number.MAX_SAFE_INTEGER || realDelta < 0) {\n\t\t\t\t\texpect(numericDelta).to.equal(undefined);\n\t\t\t\t} else {\n\t\t\t\t\texpect(numericDelta).to.equal(Number(realDelta));\n\t\t\t\t}\n\t\t\t\tconst numericDeltaCapped = getPositiveDelta(uuidA, uuidB, arbitraryMaxDelta);\n\t\t\t\tif (realDelta >= 0 && realDelta <= arbitraryMaxDelta) {\n\t\t\t\t\texpect(numericDeltaCapped).to.equal(Number(realDelta));\n\t\t\t\t} else {\n\t\t\t\t\texpect(numericDeltaCapped).to.equal(undefined);\n\t\t\t\t}\n\t\t\t});\n\t\t});\n\t});\n\n\tit('can round trip between stable ID and uuid', () => {\n\t\tstableIds.forEach((stableId) => {\n\t\t\tconst uuid = numericUuidFromStableId(stableId);\n\t\t\tconst roundTripped = stableIdFromNumericUuid(uuid);\n\t\t\texpect(stableId).to.equal(roundTripped);\n\t\t});\n\t});\n\n\tit('can compare numeric uuids', () => {\n\t\tstableIds.forEach((stableIdA) => {\n\t\t\tstableIds.forEach((stableIdB) => {\n\t\t\t\tconst numericA = numericUuidFromStableId(stableIdA);\n\t\t\t\tconst numericB = numericUuidFromStableId(stableIdB);\n\t\t\t\tconst comparedNumeric = numericUuidEquals(numericA, numericB);\n\t\t\t\tconst comparedStrings = compareStrings(stableIdA, stableIdB);\n\t\t\t\texpect(comparedNumeric).to.equal(comparedStrings === 0);\n\t\t\t});\n\t\t});\n\t});\n});\n\nfunction bigIntFromStableId(id: StableId): bigint {\n\tconst minimized = id.replace(/-/g, '');\n\t//      UUID | xxxxxxxx-xxxx-Vxxx-vxxx-xxxxxxxxxxxx | The StableId passed to this function, shown here in standard UUID notation\n\t//   nibbles | hhhhhhhh hhhh  mmm llll llllllllllll | Whether or not each nibble is part of the \"high\", \"middle\" or \"low\" group below\n\t// bit count | 44444444-4444-0444-2444-444444444444 | The number of bits per nibble that are used to encode the number\n\n\t// Interpret numerically...\n\tconst highNibbles = BigInt(`0x${minimized.substr(0, 12)}`); // ...all nibbles above the version nibble,\n\tconst midNibbles = BigInt(`0x${minimized.substr(13, 3)}`); //  the nibbles below the version nibble and above the variant nibble,\n\tconst lowNibbles = BigInt(`0x${minimized.substr(16, 16)}`); // and the variant nibble and all nibbles below\n\t// Count the number of bits that contribute to the number (i.e. are not reserved for version/variant) in...\n\tconst lowBitCount = BigInt(62); // ...the low nibbles\n\tconst midBitCount = BigInt(12); // and the mid nibbles\n\t// Shift the values of each region by the appropriate number of bits\n\tconst highNumber = highNibbles << (midBitCount + lowBitCount);\n\tconst midNumber = midNibbles << lowBitCount;\n\t// The low nibbles include the variant nibble because its two low bits are numerical (but its two upper bits are not). So mask them out:\n\tconst lowNumber = lowNibbles & BigInt('0x3fffffffffffffff'); // A nibble '0011' followed by 15 nibbles '1111'.\n\t// Now that high and mid are shifted correctly, the final number is their sum:\n\treturn highNumber + midNumber + lowNumber;\n}\n"]}

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

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

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

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

package/lib/test/RevisionView.tests.js

@@ -0,0 +1,133 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { expect } from 'chai';
+import { getChangeNodeFromViewNode } from '../SerializationUtilities';
+import { convertTreeNodesToViewNodes, RevisionView } from '../RevisionView';
+import { StablePlace, StableRange } from '../ChangeTypes';
+import { detachRange, insertIntoTrait } from '../EditUtilities';
+import { expectDefined } from './utilities/TestCommon';
+import { refreshTestTree } from './utilities/TestUtilities';
+describe('RevisionView', () => {
+    const testTree = refreshTestTree();
+    describe('creation from a ChangeNode', () => {
+        it('ignores empty traits', () => {
+            const leaf = testTree.buildLeaf(testTree.generateNodeId());
+            const node = {
+                traits: {
+                    trait: [leaf],
+                    emptyTrait: [],
+                },
+                definition: testTree.definition,
+                identifier: testTree.identifier,
+            };
+            const view = RevisionView.fromTree(node);
+            const changeNode = getChangeNodeFromViewNode(view, testTree.identifier);
+            expect(changeNode.traits.trait[0].identifier).to.equal(leaf.identifier);
+            expect(changeNode.traits.emptyTrait).to.equal(undefined);
+        });
+    });
+    it('correctly converts tree nodes', () => {
+        const viewNodes = expectDefined(convertTreeNodesToViewNodes(testTree, (node) => ({
+            definition: node.definition,
+            identifier: node.identifier,
+        })));
+        let createdRoot = false;
+        let createdLeft = false;
+        let createdRight = false;
+        for (let viewNode = viewNodes.pop(); viewNode !== undefined; viewNode = viewNodes.pop()) {
+            switch (viewNode.identifier) {
+                case testTree.identifier:
+                    expect(createdRoot).to.be.false;
+                    expect(viewNode.definition).to.equal(testTree.definition);
+                    expect(viewNode.traits.size).to.equal(2);
+                    expect(viewNode.traits.get(testTree.left.traitLabel)).to.deep.equal([testTree.left.identifier]);
+                    expect(viewNode.traits.get(testTree.right.traitLabel)).to.deep.equal([testTree.right.identifier]);
+                    createdRoot = true;
+                    break;
+                case testTree.left.identifier:
+                    expect(createdLeft).to.be.false;
+                    expect(viewNode.definition).to.equal(testTree.left.definition);
+                    expect(viewNode.traits.size).to.equal(0);
+                    createdLeft = true;
+                    break;
+                case testTree.right.identifier:
+                    expect(createdRight).to.be.false;
+                    expect(viewNode.definition).to.equal(testTree.right.definition);
+                    expect(viewNode.traits.size).to.equal(0);
+                    createdRight = true;
+                    break;
+                default:
+                    expect.fail('Unexpected view node ID');
+            }
+        }
+    });
+    it('correctly handles tree node conversion failure', () => {
+        let nodesConverted = 0;
+        const viewNodes = convertTreeNodesToViewNodes(testTree, (node) => {
+            if (nodesConverted++ >= 2) {
+                return undefined;
+            }
+            return {
+                definition: node.definition,
+                identifier: node.identifier,
+            };
+        });
+        expect(viewNodes).to.be.undefined;
+    });
+});
+describe('TransactionView', () => {
+    const testTree = refreshTestTree();
+    const traitLabel = 'trait';
+    function getTree() {
+        const childA = testTree.buildLeaf(testTree.generateNodeId());
+        const childB = testTree.buildLeaf(testTree.generateNodeId());
+        const parent = {
+            traits: {
+                [traitLabel]: [childA, childB],
+            },
+            definition: testTree.definition,
+            identifier: testTree.identifier,
+        };
+        return { parent, childA, childB };
+    }
+    it('can detach a single node in a trait', () => {
+        var _a;
+        const { parent, childA, childB } = getTree();
+        const startingView = RevisionView.fromTree(parent).openForTransaction();
+        const { view } = detachRange(startingView, StableRange.only(childA));
+        expect(view.size).to.equal(3);
+        expect(view.hasNode(childA.identifier)).to.be.true;
+        expect(view.tryGetParentViewNode(childA.identifier)).to.be.undefined;
+        expect((_a = view.tryGetParentViewNode(childB.identifier)) === null || _a === void 0 ? void 0 : _a.identifier).to.equal(parent.identifier);
+        expect(view.getIndexInTrait(childB.identifier)).to.equal(0);
+    });
+    it('can detach an entire trait', () => {
+        const { parent, childA, childB } = getTree();
+        const startingView = RevisionView.fromTree(parent).openForTransaction();
+        const { view, detached } = detachRange(startingView, StableRange.all({ parent: parent.identifier, label: traitLabel }));
+        expect(detached).deep.equals([childA.identifier, childB.identifier]);
+        expect(view.size).to.equal(3);
+        expect(view.hasNode(childA.identifier)).to.be.true;
+        expect(view.hasNode(childB.identifier)).to.be.true;
+        expect(view.tryGetParentViewNode(childA.identifier)).to.be.undefined;
+        expect(view.tryGetParentViewNode(childB.identifier)).to.be.undefined;
+    });
+    it('can insert a node', () => {
+        var _a;
+        const { parent, childA, childB } = getTree();
+        const startingView = RevisionView.fromTree(parent).openForTransaction();
+        const newNode = testTree.buildLeaf(testTree.generateNodeId());
+        let view = startingView.addNodes([Object.assign(Object.assign({}, newNode), { traits: new Map() })]);
+        expect(view.size).to.equal(4);
+        expect(view.hasNode(newNode.identifier)).to.be.true;
+        expect(view.tryGetParentViewNode(newNode.identifier)).to.be.undefined;
+        view = insertIntoTrait(view, [newNode.identifier], StablePlace.atStartOf({ parent: parent.identifier, label: traitLabel }));
+        expect((_a = view.tryGetParentViewNode(newNode.identifier)) === null || _a === void 0 ? void 0 : _a.identifier).to.equal(parent.identifier);
+        expect(view.getIndexInTrait(newNode.identifier)).to.equal(0);
+        expect(view.getIndexInTrait(childA.identifier)).to.equal(1);
+        expect(view.getIndexInTrait(childB.identifier)).to.equal(2);
+    });
+});
+//# sourceMappingURL=RevisionView.tests.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"RevisionView.tests.js","sourceRoot":"","sources":["../../src/test/RevisionView.tests.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,MAAM,CAAC;AAE9B,OAAO,EAAE,yBAAyB,EAAE,MAAM,2BAA2B,CAAC;AAEtE,OAAO,EAAE,2BAA2B,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAC5E,OAAO,EAAE,WAAW,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC;AAC1D,OAAO,EAAE,WAAW,EAAE,eAAe,EAAE,MAAM,kBAAkB,CAAC;AAChE,OAAO,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AAEvD,OAAO,EAAE,eAAe,EAAE,MAAM,2BAA2B,CAAC;AAE5D,QAAQ,CAAC,cAAc,EAAE,GAAG,EAAE;IAC7B,MAAM,QAAQ,GAAG,eAAe,EAAE,CAAC;IAEnC,QAAQ,CAAC,4BAA4B,EAAE,GAAG,EAAE;QAC3C,EAAE,CAAC,sBAAsB,EAAE,GAAG,EAAE;YAC/B,MAAM,IAAI,GAAG,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,CAAC;YAC3D,MAAM,IAAI,GAAe;gBACxB,MAAM,EAAE;oBACP,KAAK,EAAE,CAAC,IAAI,CAAC;oBACb,UAAU,EAAE,EAAE;iBACd;gBACD,UAAU,EAAE,QAAQ,CAAC,UAAU;gBAC/B,UAAU,EAAE,QAAQ,CAAC,UAAU;aAC/B,CAAC;YAEF,MAAM,IAAI,GAAG,YAAY,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;YACzC,MAAM,UAAU,GAAG,yBAAyB,CAAC,IAAI,EAAE,QAAQ,CAAC,UAAU,CAAC,CAAC;YACxE,MAAM,CAAC,UAAU,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YACxE,MAAM,CAAC,UAAU,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;QAC1D,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,+BAA+B,EAAE,GAAG,EAAE;QACxC,MAAM,SAAS,GAAG,aAAa,CAC9B,2BAA2B,CAAW,QAAQ,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;YAC1D,UAAU,EAAE,IAAI,CAAC,UAAU;YAC3B,UAAU,EAAE,IAAI,CAAC,UAAU;SAC3B,CAAC,CAAC,CACH,CAAC;QACF,IAAI,WAAW,GAAG,KAAK,CAAC;QACxB,IAAI,WAAW,GAAG,KAAK,CAAC;QACxB,IAAI,YAAY,GAAG,KAAK,CAAC;QACzB,KAAK,IAAI,QAAQ,GAAG,SAAS,CAAC,GAAG,EAAE,EAAE,QAAQ,KAAK,SAAS,EAAE,QAAQ,GAAG,SAAS,CAAC,GAAG,EAAE,EAAE;YACxF,QAAQ,QAAQ,CAAC,UAAU,EAAE;gBAC5B,KAAK,QAAQ,CAAC,UAAU;oBACvB,MAAM,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC;oBAChC,MAAM,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;oBAC1D,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;oBACzC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;oBAChG,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC;oBAClG,WAAW,GAAG,IAAI,CAAC;oBACnB,MAAM;gBACP,KAAK,QAAQ,CAAC,IAAI,CAAC,UAAU;oBAC5B,MAAM,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC;oBAChC,MAAM,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;oBAC/D,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;oBACzC,WAAW,GAAG,IAAI,CAAC;oBACnB,MAAM;gBACP,KAAK,QAAQ,CAAC,KAAK,CAAC,UAAU;oBAC7B,MAAM,CAAC,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC;oBACjC,MAAM,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;oBAChE,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;oBACzC,YAAY,GAAG,IAAI,CAAC;oBACpB,MAAM;gBACP;oBACC,MAAM,CAAC,IAAI,CAAC,yBAAyB,CAAC,CAAC;aACxC;SACD;IACF,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,gDAAgD,EAAE,GAAG,EAAE;QACzD,IAAI,cAAc,GAAG,CAAC,CAAC;QACvB,MAAM,SAAS,GAAG,2BAA2B,CAAW,QAAQ,EAAE,CAAC,IAAI,EAAE,EAAE;YAC1E,IAAI,cAAc,EAAE,IAAI,CAAC,EAAE;gBAC1B,OAAO,SAAS,CAAC;aACjB;YACD,OAAO;gBACN,UAAU,EAAE,IAAI,CAAC,UAAU;gBAC3B,UAAU,EAAE,IAAI,CAAC,UAAU;aAC3B,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,MAAM,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,CAAC;IACnC,CAAC,CAAC,CAAC;AACJ,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,iBAAiB,EAAE,GAAG,EAAE;IAChC,MAAM,QAAQ,GAAG,eAAe,EAAE,CAAC;IACnC,MAAM,UAAU,GAAG,OAAqB,CAAC;IAEzC,SAAS,OAAO;QAKf,MAAM,MAAM,GAAG,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,CAAC;QAC7D,MAAM,MAAM,GAAG,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,CAAC;QAC7D,MAAM,MAAM,GAAe;YAC1B,MAAM,EAAE;gBACP,CAAC,UAAU,CAAC,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC;aAC9B;YACD,UAAU,EAAE,QAAQ,CAAC,UAAU;YAC/B,UAAU,EAAE,QAAQ,CAAC,UAAU;SAC/B,CAAC;QACF,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC;IACnC,CAAC;IAED,EAAE,CAAC,qCAAqC,EAAE,GAAG,EAAE;;QAC9C,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,OAAO,EAAE,CAAC;QAC7C,MAAM,YAAY,GAAG,YAAY,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,kBAAkB,EAAE,CAAC;QACxE,MAAM,EAAE,IAAI,EAAE,GAAG,WAAW,CAAC,YAAY,EAAE,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;QACrE,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC9B,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC;QACnD,MAAM,CAAC,IAAI,CAAC,oBAAoB,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,CAAC;QACrE,MAAM,OAAC,IAAI,CAAC,oBAAoB,CAAC,MAAM,CAAC,UAAU,CAAC,0CAAE,UAAU,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;QAC7F,MAAM,CAAC,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAC7D,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,4BAA4B,EAAE,GAAG,EAAE;QACrC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,OAAO,EAAE,CAAC;QAC7C,MAAM,YAAY,GAAG,YAAY,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,kBAAkB,EAAE,CAAC;QACxE,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,GAAG,WAAW,CACrC,YAAY,EACZ,WAAW,CAAC,GAAG,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,UAAU,EAAE,KAAK,EAAE,UAAU,EAAE,CAAC,CACjE,CAAC;QACF,MAAM,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,EAAE,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC;QACrE,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC9B,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC;QACnD,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC;QACnD,MAAM,CAAC,IAAI,CAAC,oBAAoB,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,CAAC;QACrE,MAAM,CAAC,IAAI,CAAC,oBAAoB,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,CAAC;IACtE,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,mBAAmB,EAAE,GAAG,EAAE;;QAC5B,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,OAAO,EAAE,CAAC;QAC7C,MAAM,YAAY,GAAG,YAAY,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,kBAAkB,EAAE,CAAC;QACxE,MAAM,OAAO,GAAG,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,CAAC;QAC9D,IAAI,IAAI,GAAG,YAAY,CAAC,QAAQ,CAAC,iCAAM,OAAO,KAAE,MAAM,EAAE,IAAI,GAAG,EAAE,IAAG,CAAC,CAAC;QACtE,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC9B,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC;QACpD,MAAM,CAAC,IAAI,CAAC,oBAAoB,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,CAAC;QACtE,IAAI,GAAG,eAAe,CACrB,IAAI,EACJ,CAAC,OAAO,CAAC,UAAU,CAAC,EACpB,WAAW,CAAC,SAAS,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,UAAU,EAAE,KAAK,EAAE,UAAU,EAAE,CAAC,CACvE,CAAC;QACF,MAAM,OAAC,IAAI,CAAC,oBAAoB,CAAC,OAAO,CAAC,UAAU,CAAC,0CAAE,UAAU,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;QAC9F,MAAM,CAAC,IAAI,CAAC,eAAe,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC7D,MAAM,CAAC,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC5D,MAAM,CAAC,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAC7D,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 { TraitLabel } from '../Identifiers';\nimport { getChangeNodeFromViewNode } from '../SerializationUtilities';\nimport { ChangeNode } from '../persisted-types';\nimport { convertTreeNodesToViewNodes, RevisionView } from '../RevisionView';\nimport { StablePlace, StableRange } from '../ChangeTypes';\nimport { detachRange, insertIntoTrait } from '../EditUtilities';\nimport { expectDefined } from './utilities/TestCommon';\nimport { LeafNode, TestNode } from './utilities/TestNode';\nimport { refreshTestTree } from './utilities/TestUtilities';\n\ndescribe('RevisionView', () => {\n\tconst testTree = refreshTestTree();\n\n\tdescribe('creation from a ChangeNode', () => {\n\t\tit('ignores empty traits', () => {\n\t\t\tconst leaf = testTree.buildLeaf(testTree.generateNodeId());\n\t\t\tconst node: ChangeNode = {\n\t\t\t\ttraits: {\n\t\t\t\t\ttrait: [leaf],\n\t\t\t\t\temptyTrait: [],\n\t\t\t\t},\n\t\t\t\tdefinition: testTree.definition,\n\t\t\t\tidentifier: testTree.identifier,\n\t\t\t};\n\n\t\t\tconst view = RevisionView.fromTree(node);\n\t\t\tconst changeNode = getChangeNodeFromViewNode(view, testTree.identifier);\n\t\t\texpect(changeNode.traits.trait[0].identifier).to.equal(leaf.identifier);\n\t\t\texpect(changeNode.traits.emptyTrait).to.equal(undefined);\n\t\t});\n\t});\n\n\tit('correctly converts tree nodes', () => {\n\t\tconst viewNodes = expectDefined(\n\t\t\tconvertTreeNodesToViewNodes<TestNode>(testTree, (node) => ({\n\t\t\t\tdefinition: node.definition,\n\t\t\t\tidentifier: node.identifier,\n\t\t\t}))\n\t\t);\n\t\tlet createdRoot = false;\n\t\tlet createdLeft = false;\n\t\tlet createdRight = false;\n\t\tfor (let viewNode = viewNodes.pop(); viewNode !== undefined; viewNode = viewNodes.pop()) {\n\t\t\tswitch (viewNode.identifier) {\n\t\t\t\tcase testTree.identifier:\n\t\t\t\t\texpect(createdRoot).to.be.false;\n\t\t\t\t\texpect(viewNode.definition).to.equal(testTree.definition);\n\t\t\t\t\texpect(viewNode.traits.size).to.equal(2);\n\t\t\t\t\texpect(viewNode.traits.get(testTree.left.traitLabel)).to.deep.equal([testTree.left.identifier]);\n\t\t\t\t\texpect(viewNode.traits.get(testTree.right.traitLabel)).to.deep.equal([testTree.right.identifier]);\n\t\t\t\t\tcreatedRoot = true;\n\t\t\t\t\tbreak;\n\t\t\t\tcase testTree.left.identifier:\n\t\t\t\t\texpect(createdLeft).to.be.false;\n\t\t\t\t\texpect(viewNode.definition).to.equal(testTree.left.definition);\n\t\t\t\t\texpect(viewNode.traits.size).to.equal(0);\n\t\t\t\t\tcreatedLeft = true;\n\t\t\t\t\tbreak;\n\t\t\t\tcase testTree.right.identifier:\n\t\t\t\t\texpect(createdRight).to.be.false;\n\t\t\t\t\texpect(viewNode.definition).to.equal(testTree.right.definition);\n\t\t\t\t\texpect(viewNode.traits.size).to.equal(0);\n\t\t\t\t\tcreatedRight = true;\n\t\t\t\t\tbreak;\n\t\t\t\tdefault:\n\t\t\t\t\texpect.fail('Unexpected view node ID');\n\t\t\t}\n\t\t}\n\t});\n\n\tit('correctly handles tree node conversion failure', () => {\n\t\tlet nodesConverted = 0;\n\t\tconst viewNodes = convertTreeNodesToViewNodes<TestNode>(testTree, (node) => {\n\t\t\tif (nodesConverted++ >= 2) {\n\t\t\t\treturn undefined;\n\t\t\t}\n\t\t\treturn {\n\t\t\t\tdefinition: node.definition,\n\t\t\t\tidentifier: node.identifier,\n\t\t\t};\n\t\t});\n\n\t\texpect(viewNodes).to.be.undefined;\n\t});\n});\n\ndescribe('TransactionView', () => {\n\tconst testTree = refreshTestTree();\n\tconst traitLabel = 'trait' as TraitLabel;\n\n\tfunction getTree(): {\n\t\tparent: ChangeNode;\n\t\tchildA: LeafNode<ChangeNode>;\n\t\tchildB: LeafNode<ChangeNode>;\n\t} {\n\t\tconst childA = testTree.buildLeaf(testTree.generateNodeId());\n\t\tconst childB = testTree.buildLeaf(testTree.generateNodeId());\n\t\tconst parent: ChangeNode = {\n\t\t\ttraits: {\n\t\t\t\t[traitLabel]: [childA, childB],\n\t\t\t},\n\t\t\tdefinition: testTree.definition,\n\t\t\tidentifier: testTree.identifier,\n\t\t};\n\t\treturn { parent, childA, childB };\n\t}\n\n\tit('can detach a single node in a trait', () => {\n\t\tconst { parent, childA, childB } = getTree();\n\t\tconst startingView = RevisionView.fromTree(parent).openForTransaction();\n\t\tconst { view } = detachRange(startingView, StableRange.only(childA));\n\t\texpect(view.size).to.equal(3);\n\t\texpect(view.hasNode(childA.identifier)).to.be.true;\n\t\texpect(view.tryGetParentViewNode(childA.identifier)).to.be.undefined;\n\t\texpect(view.tryGetParentViewNode(childB.identifier)?.identifier).to.equal(parent.identifier);\n\t\texpect(view.getIndexInTrait(childB.identifier)).to.equal(0);\n\t});\n\n\tit('can detach an entire trait', () => {\n\t\tconst { parent, childA, childB } = getTree();\n\t\tconst startingView = RevisionView.fromTree(parent).openForTransaction();\n\t\tconst { view, detached } = detachRange(\n\t\t\tstartingView,\n\t\t\tStableRange.all({ parent: parent.identifier, label: traitLabel })\n\t\t);\n\t\texpect(detached).deep.equals([childA.identifier, childB.identifier]);\n\t\texpect(view.size).to.equal(3);\n\t\texpect(view.hasNode(childA.identifier)).to.be.true;\n\t\texpect(view.hasNode(childB.identifier)).to.be.true;\n\t\texpect(view.tryGetParentViewNode(childA.identifier)).to.be.undefined;\n\t\texpect(view.tryGetParentViewNode(childB.identifier)).to.be.undefined;\n\t});\n\n\tit('can insert a node', () => {\n\t\tconst { parent, childA, childB } = getTree();\n\t\tconst startingView = RevisionView.fromTree(parent).openForTransaction();\n\t\tconst newNode = testTree.buildLeaf(testTree.generateNodeId());\n\t\tlet view = startingView.addNodes([{ ...newNode, traits: new Map() }]);\n\t\texpect(view.size).to.equal(4);\n\t\texpect(view.hasNode(newNode.identifier)).to.be.true;\n\t\texpect(view.tryGetParentViewNode(newNode.identifier)).to.be.undefined;\n\t\tview = insertIntoTrait(\n\t\t\tview,\n\t\t\t[newNode.identifier],\n\t\t\tStablePlace.atStartOf({ parent: parent.identifier, label: traitLabel })\n\t\t);\n\t\texpect(view.tryGetParentViewNode(newNode.identifier)?.identifier).to.equal(parent.identifier);\n\t\texpect(view.getIndexInTrait(newNode.identifier)).to.equal(0);\n\t\texpect(view.getIndexInTrait(childA.identifier)).to.equal(1);\n\t\texpect(view.getIndexInTrait(childB.identifier)).to.equal(2);\n\t});\n});\n"]}

package/lib/test/SharedTree.perf.tests.d.ts

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

package/lib/test/SharedTree.perf.tests.d.ts.map

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