npm - @fluidframework/tree - Versions diffs - 2.0.0-rc.2.0.2 → 2.0.0-rc.3.0.0 - Mend

@fluidframework/tree 2.0.0-rc.2.0.2 → 2.0.0-rc.3.0.0

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

Files changed (2507) hide show

package/lib/test/forestTestSuite.js.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"forestTestSuite.js","sourceRoot":"","sources":["../../src/test/forestTestSuite.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,IAAI,MAAM,EAAE,MAAM,QAAQ,CAAC;AAE1C,OAAO,EAEN,gBAAgB,EAChB,mBAAmB,EAKnB,cAAc,EACd,YAAY,EAEZ,SAAS,EAET,QAAQ,EAER,kBAAkB,EAGlB,kBAAkB,EAIlB,0BAA0B,GAC1B,MAAM,kBAAkB,CAAC;AAC1B,OAAO,EACN,kBAAkB,EAClB,UAAU,EACV,QAAQ,EACR,gBAAgB,EAChB,IAAI,GACJ,MAAM,qBAAqB,CAAC;AAC7B,OAAO,EAAE,gBAAgB,EAAE,MAAM,gCAAgC,CAAC;AAClE,OAAO,EAGN,KAAK,EACL,oBAAoB,EACpB,WAAW,GACX,MAAM,kBAAkB,CAAC;AAC1B,OAAO,EACN,UAAU,EACV,sBAAsB,EACtB,yBAAyB,EACzB,mBAAmB,EACnB,YAAY,EACZ,sBAAsB,EACtB,eAAe,EACf,gBAAgB,EAChB,iBAAiB,GACjB,MAAM,+BAA+B,CAAC;AACvC,OAAO,EACN,cAAc,EACd,qBAAqB,EACrB,gBAAgB,EAChB,sBAAsB,EACtB,oBAAoB,GACpB,MAAM,YAAY,CAAC;AACpB,OAAO,EAAE,4BAA4B,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAC;AAoBpF,MAAM,kBAAkB,GAAG,IAAI,iBAAiB,CAAC,UAAU,CAAC,QAAQ,EAAE;IACrE,KAAK,EAAE,oBAAoB;IAC3B,SAAS,EAAE,CAAC,UAAU,CAAC;CACvB,CAAC,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;AAExB,MAAM,OAAO,GAAG,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC;AAC9B,MAAM,QAAQ,GAAG,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC;AAChC,MAAM,QAAQ,GAAG,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC;AAE/B;;GAEG;AACH,MAAM,UAAU,UAAU,CAAC,MAA+B;IACzD,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC;IAC/B,QAAQ,CAAC,MAAM,CAAC,SAAS,EAAE,GAAG,EAAE;QAC/B,MAAM,aAAa,GAAmB;YACrC,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE;YACb,CAAC,EAAE,CAAC;SACJ,CAAC;QACF,MAAM,MAAM,GAAG,KAAK,CAAW,GAAG,CAAC,CAAC;QACpC,MAAM,MAAM,GAAG,KAAK,CAAW,GAAG,CAAC,CAAC;QACpC,MAAM,QAAQ,GAAa,KAAK,CAAC,KAAK,CAAC,CAAC;QAExC,uDAAuD;QACvD,QAAQ,CAAC,yBAAyB,EAAE,GAAG,EAAE;YACxC,wDAAwD;YACxD,MAAM,SAAS,GAA4B;gBAC1C,CAAC,WAAW,EAAE,CAAC,CAAC;gBAChB,CAAC,OAAO,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;gBACpB,CAAC,QAAQ,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC;gBAC5B,CAAC,gBAAgB,EAAE,EAAE,IAAI,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;aAC/D,CAAC;YACF,KAAK,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,SAAS,EAAE;gBACrC,EAAE,CAAC,IAAI,EAAE,GAAG,EAAE;oBACb,MAAM,MAAM,GAAG,IAAI,0BAA0B,EAAE,CAAC;oBAChD,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;oBAE/B,MAAM,eAAe,GAAG,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;oBAC9E,MAAM,CAAC,KAAK,CAAC;wBACZ,UAAU,EAAE,IAAI,GAAG,CAClB,WAAW,CAAC,UAAU,CAAC,UAAU,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CACvE;wBACD,eAAe;qBACf,CAAC,CAAC;oBAEH,2FAA2F;oBAC3F,MAAM,CAAC,CAAC,YAAY,CAAC,mBAAmB,EAAE,MAAM,EAAE,eAAe,CAAC,CAAC,CAAC;oBAEpE,gBAAgB,CAAC,MAAM,EAAE,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC,EAAE,oBAAoB,CAAC,CAAC;oBAEzE,MAAM,MAAM,GAAG,MAAM,CAAC,cAAc,EAAE,CAAC;oBACvC,mBAAmB,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;oBAEpC,8DAA8D;oBAC9D,MAAM,IAAI,GAAG,cAAc,CAAC,MAAM,EAAE,kBAAkB,CAAC,CAAC;oBACxD,MAAM,CAAC,IAAI,EAAE,CAAC;oBACd,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;gBAChC,CAAC,CAAC,CAAC;aACH;QACF,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,YAAY,EAAE,GAAG,EAAE;YACrB,MAAM,MAAM,GAAG,OAAO,CACrB,IAAI,0BAA0B,CAAC,gBAAgB,CAAC,sBAAsB,CAAC,CAAC,CACxE,CAAC;YACF,gBAAgB,CAAC,MAAM,EAAE,CAAC,gBAAgB,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,oBAAoB,CAAC,CAAC;YAE3E,MAAM,MAAM,GAAG,MAAM,CAAC,cAAc,EAAE,CAAC;YACvC,mBAAmB,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;YACpC,MAAM,OAAO,GAAG,MAAM,CAAC,IAAI,EAAE,CAAC;YAC9B,yCAAyC;YACzC,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,YAAY,EAAE,EAAE,OAAO,CAAC,YAAY,EAAE,CAAC,CAAC;YAChE,MAAM,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC;YAC3B,yCAAyC;YACzC,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,OAAO,EAAE,EAAE,MAAM,EAAE,OAAO,CAAC,YAAY,EAAE,CAAC,MAAM,CAAC,CAAC;YAC1E,MAAM,CAAC,OAAO,CAAC,SAAS,EAAE,CAAC,CAAC;YAC5B,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,OAAO,EAAE,EAAE,OAAO,CAAC,OAAO,EAAE,CAAC,CAAC;YACtD,MAAM,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;YAC5B,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;YACpB,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YAC9B,oEAAoE;YACpE,OAAO,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;YAC7B,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;YACrB,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YAC/B,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YAC9B,MAAM,CAAC,OAAO,CAAC,QAAQ,EAAE,CAAC,CAAC;YAC3B,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YAC/B,4DAA4D;YAC5D,MAAM,OAAO,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC;YAC/B,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,OAAO,EAAE,EAAE,OAAO,CAAC,OAAO,EAAE,CAAC,CAAC;YACtD,MAAM,CAAC,IAAI,EAAE,CAAC;YACd,OAAO,CAAC,IAAI,EAAE,CAAC;QAChB,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,uBAAuB,EAAE,GAAG,EAAE;YAChC,MAAM,MAAM,GAAG,OAAO,CACrB,IAAI,0BAA0B,CAAC,gBAAgB,CAAC,kBAAkB,CAAC,CAAC,CACpE,CAAC;YACF,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;YACvB,gBAAgB,CAAC,MAAM,EAAE,CAAC,gBAAgB,CAAC,EAAE,CAAC,CAAC,EAAE,oBAAoB,CAAC,CAAC;YACvE,MAAM,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QACzB,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,qBAAqB,EAAE,GAAG,EAAE;YAC9B,MAAM,MAAM,GAAG,OAAO,CACrB,IAAI,0BAA0B,CAAC,gBAAgB,CAAC,kBAAkB,CAAC,CAAC,CACpE,CAAC;YACF,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;YAEvB,MAAM,MAAM,GAAsB;gBACjC,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;aAC3C,CAAC;YACF,cAAc,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,gBAAgB,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,SAAS,EAAE;gBAC/E,EAAE,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,gBAAgB,CAAC,EAAE,CAAC,CAAC,EAAE;aACnD,CAAC,CAAC;YACH,MAAM,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QACzB,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,sDAAsD,EAAE,GAAG,EAAE;YAC/D,MAAM,MAAM,GAAG,OAAO,CAAC,IAAI,0BAA0B,EAAE,CAAC,CAAC;YACzD,MAAM,MAAM,GAAG,MAAM,CAAC,cAAc,EAAE,CAAC;YACvC,mBAAmB,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;YACpC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,SAAS,EAAE,EAAE,KAAK,CAAC,CAAC;QACzC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,qBAAqB,EAAE,GAAG,EAAE;YAC9B,MAAM,MAAM,GAAG,OAAO,CACrB,IAAI,0BAA0B,CAAC,gBAAgB,CAAC,kBAAkB,CAAC,CAAC,CACpE,CAAC;YAEF,gBAAgB,CAAC,MAAM,EAAE,CAAC,gBAAgB,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,oBAAoB,CAAC,CAAC;YAE3E,MAAM,UAAU,GAAW;gBAC1B,MAAM,EAAE,SAAS;gBACjB,WAAW,EAAE,YAAY;gBACzB,WAAW,EAAE,CAAC;aACd,CAAC;YAEF,MAAM,UAAU,GAAW;gBAC1B,MAAM,EAAE,UAAU;gBAClB,WAAW,EAAE,QAAQ;gBACrB,WAAW,EAAE,CAAC;aACd,CAAC;YAEF,MAAM,UAAU,GAAW;gBAC1B,MAAM,EAAE,UAAU;gBAClB,WAAW,EAAE,QAAQ;gBACrB,WAAW,EAAE,CAAC;aACd,CAAC;YAEF,MAAM,YAAY,GAAG,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;YACtD,MAAM,YAAY,GAAG,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;YACtD,MAAM,YAAY,GAAG,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;YAEtD,MAAM,MAAM,GAAG,MAAM,CAAC,cAAc,EAAE,CAAC;YACvC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,mBAAmB,CAAC,YAAY,EAAE,MAAM,CAAC,kCAA0B,CAAC;YACxF,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;YACtC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,mBAAmB,CAAC,YAAY,EAAE,MAAM,CAAC,kCAA0B,CAAC;YACxF,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YAC9B,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,mBAAmB,CAAC,YAAY,EAAE,MAAM,CAAC,kCAA0B,CAAC;YACxF,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAC/B,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,sBAAsB,EAAE,GAAG,EAAE;YAC/B,MAAM,MAAM,GAAG,OAAO,CACrB,IAAI,0BAA0B,CAAC,gBAAgB,CAAC,kBAAkB,CAAC,CAAC,CACpE,CAAC;YAEF,gBAAgB,CAAC,MAAM,EAAE,CAAC,gBAAgB,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,oBAAoB,CAAC,CAAC;YAE3E,MAAM,UAAU,GAAgB;gBAC/B,MAAM,EAAE,SAAS;gBACjB,KAAK,EAAE,YAAY;aACnB,CAAC;YAEF,MAAM,cAAc,GAAW;gBAC9B,MAAM,EAAE,SAAS;gBACjB,WAAW,EAAE,YAAY;gBACzB,WAAW,EAAE,CAAC;aACd,CAAC;YAEF,MAAM,SAAS,GAAgB;gBAC9B,MAAM,EAAE,cAAc;gBACtB,KAAK,EAAE,QAAQ;aACf,CAAC;YAEF,MAAM,YAAY,GAAG,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC;YAE1D,MAAM,MAAM,GAAG,MAAM,CAAC,cAAc,EAAE,CAAC;YACvC,MAAM,CAAC,KAAK,CACX,MAAM,CAAC,oBAAoB,CAAC,EAAE,QAAQ,EAAE,YAAY,EAAE,MAAM,EAAE,SAAS,EAAE,EAAE,MAAM,CAAC,kCAElF,CAAC;YAEF,qBAAqB,CAAC,MAAM,CAAC,YAAY,EAAE,EAAE,UAAU,CAAC,CAAC;YACzD,MAAM,CAAC,KAAK,CACX,MAAM,CAAC,oBAAoB,CAAC,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,EAAE,YAAY,EAAE,EAAE,MAAM,CAAC,kCAEjF,CAAC;YACF,qBAAqB,CAAC,MAAM,CAAC,YAAY,EAAE,EAAE,SAAS,CAAC,CAAC;QACzD,CAAC,CAAC,CAAC;QAEH,QAAQ,CAAC,kBAAkB,EAAE,GAAG,EAAE;YACjC,EAAE,CAAC,iCAAiC,EAAE,GAAG,EAAE;gBAC1C,MAAM,MAAM,GAAG,OAAO,CACrB,IAAI,0BAA0B,CAAC,gBAAgB,CAAC,kBAAkB,CAAC,CAAC,CACpE,CAAC;gBACF,gBAAgB,CAAC,MAAM,EAAE,CAAC,gBAAgB,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,oBAAoB,CAAC,CAAC;gBAE3E,MAAM,MAAM,GAAG,MAAM,CAAC,cAAc,EAAE,CAAC;gBACvC,MAAM,IAAI,GAAW;oBACpB,MAAM,EAAE,SAAS;oBACjB,WAAW,EAAE,YAAY;oBACzB,WAAW,EAAE,CAAC;iBACd,CAAC;gBAEF,MAAM,CAAC,gBAAgB,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;gBACtC,gBAAgB,CAAC,IAAI,EAAE,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC;YAC1C,CAAC,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,8BAA8B,EAAE,GAAG,EAAE;YACvC,MAAM,MAAM,GAAG,OAAO,CACrB,IAAI,0BAA0B,CAAC,gBAAgB,CAAC,kBAAkB,CAAC,CAAC,CACpE,CAAC;YACF,gBAAgB,CAAC,MAAM,EAAE,CAAC,gBAAgB,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,oBAAoB,CAAC,CAAC;YAE3E,MAAM,YAAY,GAAG,MAAM,CAAC,cAAc,EAAE,CAAC;YAC7C,mBAAmB,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;YAC1C,MAAM,QAAQ,GAAG,cAAc,CAAC,YAAY,EAAE,sBAAsB,CAAC,CAAC;YAEtE,MAAM,MAAM,GAAG,MAAM,CAAC,4BAA4B,EAAE,CAAC;YACrD,MAAM,CAAC,UAAU,CAAC,YAAY,CAAC,CAAC;YAChC,MAAM,MAAM,GAAG,cAAc,CAAC,MAAM,EAAE,sBAAsB,CAAC,CAAC;YAC9D,MAAM,CAAC,SAAS,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;QACpC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,0BAA0B,EAAE,GAAG,EAAE;YACnC,MAAM,MAAM,GAAG,OAAO,CACrB,IAAI,0BAA0B,CAAC,gBAAgB,CAAC,kBAAkB,CAAC,CAAC,CACpE,CAAC;YACF,gBAAgB,CAAC,MAAM,EAAE,CAAC,gBAAgB,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,oBAAoB,CAAC,CAAC;YAE3E,MAAM,MAAM,GAAG,MAAM,CAAC,cAAc,EAAE,CAAC;YACvC,mBAAmB,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;YACpC,MAAM,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC;YAC3B,MAAM,YAAY,GAAG,MAAM,CAAC,WAAW,EAAE,CAAC;YAC1C,MAAM,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;YAC5B,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;YACpB,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YAC9B,MAAM,YAAY,GAAG,MAAM,CAAC,WAAW,EAAE,CAAC;YAC1C,MAAM,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,CAAC;YAC1B,MAAM,YAAY,GAAG,MAAM,CAAC,WAAW,EAAE,CAAC;YAC1C,MAAM,CAAC,QAAQ,EAAE,CAAC;YAClB,MAAM,CAAC,SAAS,EAAE,CAAC;YACnB,MAAM,aAAa,GAAG,MAAM,CAAC,WAAW,EAAE,CAAC;YAE3C,MAAM,UAAU,GAAG,SAAS,CAAC,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC;YAClE,MAAM,UAAU,GAAG,SAAS,CAAC,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC;YAClE,MAAM,UAAU,GAAG,SAAS,CAAC,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC;YAClE,MAAM,WAAW,GAAG,SAAS,CAAC,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC,CAAC;YAEpE,MAAM,cAAc,GAAW;gBAC9B,MAAM,EAAE,SAAS;gBACjB,WAAW,EAAE,YAAY;gBACzB,WAAW,EAAE,CAAC;aACd,CAAC;YAEF,MAAM,CAAC,eAAe,CAAC,UAAU,EAAE,cAAc,CAAC,CAAC;YACnD,MAAM,CAAC,eAAe,CAAC,WAAW,EAAE,cAAc,CAAC,CAAC;YAEpD,MAAM,cAAc,GAAW;gBAC9B,MAAM,EAAE,cAAc;gBACtB,WAAW,EAAE,QAAQ;gBACrB,WAAW,EAAE,CAAC;aACd,CAAC;YAEF,MAAM,cAAc,GAAW;gBAC9B,MAAM,EAAE,cAAc;gBACtB,WAAW,EAAE,QAAQ;gBACrB,WAAW,EAAE,CAAC;aACd,CAAC;YAEF,MAAM,CAAC,eAAe,CAAC,UAAU,EAAE,cAAc,CAAC,CAAC;YACnD,MAAM,CAAC,eAAe,CAAC,UAAU,EAAE,cAAc,CAAC,CAAC;YAEnD,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,mBAAmB,CAAC,YAAY,EAAE,MAAM,CAAC,kCAA0B,CAAC;YACxF,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;YACtC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,mBAAmB,CAAC,YAAY,EAAE,MAAM,CAAC,kCAA0B,CAAC;YACxF,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YAC9B,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,mBAAmB,CAAC,YAAY,EAAE,MAAM,CAAC,kCAA0B,CAAC;YACxF,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YAE9B,sFAAsF;YACtF,0BAA0B;YAC1B,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;YACpC,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;YACpC,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;YACpC,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC;YACrC,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,OAAO,EAAE,CAAC,CAAC;QAClC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,iDAAiD,EAAE,GAAG,EAAE;YAC1D,MAAM,MAAM,GAAG,OAAO,CACrB,IAAI,0BAA0B,CAAC,gBAAgB,CAAC,kBAAkB,CAAC,CAAC,CACpE,CAAC;YAEF,gBAAgB,CAAC,MAAM,EAAE,CAAC,gBAAgB,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,oBAAoB,CAAC,CAAC;YAE3E,MAAM,MAAM,GAAG,MAAM,CAAC,cAAc,EAAE,CAAC;YACvC,mBAAmB,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;YACpC,MAAM,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC;YAC3B,MAAM,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;YAC5B,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;YACpB,MAAM,eAAe,GAAG,MAAM,CAAC,WAAW,EAAE,CAAC;YAC7C,MAAM,CAAC,KAAK,EAAE,CAAC;YAEf,MAAM,IAAI,GAAc,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC;YACvD,MAAM,KAAK,GAAkB,IAAI,GAAG,CAAC,CAAC,CAAC,YAAY,EAAE,EAAE,KAAK,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAC1E,cAAc,CAAC,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE,SAAS,EAAE,CAAC,EAAE,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAClF,cAAc,CAAC,KAAK,EAAE,MAAM,CAAC,OAAO,EAAE,SAAS,EAAE,SAAS,EAAE;gBAC3D,EAAE,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,EAAE;aAC1B,CAAC,CAAC;YAEH,MAAM,CAAC,KAAK,CACX,MAAM,CAAC,mBAAmB,CAAC,eAAe,EAAE,MAAM,CAAC,yCAEnD,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,6BAA6B,EAAE,GAAG,EAAE;YACtC,MAAM,MAAM,GAAG,OAAO,CACrB,IAAI,0BAA0B,CAAC,gBAAgB,CAAC,kBAAkB,CAAC,CAAC,CACpE,CAAC;YACF,MAAM,OAAO,GAAqB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACzC,gBAAgB,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,CAAC,gBAAgB,CAAC,EAAE,oBAAoB,CAAC,CAAC;YAE9E,MAAM,IAAI,GAAc;gBACvB,KAAK,EAAE,CAAC;gBACR,MAAM,EAAE,QAAQ;aAChB,CAAC;YACF,MAAM,kBAAkB,GAAG,IAAI,kBAAkB,CAChD,MAAM,EACN,oBAAoB,EAA+B,EACnD,oBAAoB,EAEpB,EAAE,aAAa,EAAE,gBAAgB,EAAE,CACnC,CAAC;YACF,MAAM,KAAK,GAAkB,IAAI,GAAG,CAA8B;gBACjE,CAAC,YAAY,EAAE,EAAE,KAAK,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;aACjC,CAAC,CAAC;YACH,cAAc,CAAC,KAAK,EAAE,MAAM,EAAE,kBAAkB,CAAC,CAAC;YAElD,MAAM,aAAa,GAAkB,KAAK,CACzC,kBAAkB,CAAC,UAAU,CAAC,CAAiB,CAAC,CAChD,CAAC;YACF,yCAAyC;YACzC,MAAM,MAAM,GAAG,MAAM,CAAC,cAAc,EAAE,CAAC;YACvC,mBAAmB,CAAC,MAAM,EAAE,MAAM,EAAE,aAAa,CAAC,CAAC;YACnD,MAAM,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC;YAC3B,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YAC9B,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,EAAE,EAAE,KAAK,CAAC,CAAC;YACvC,MAAM,CAAC,KAAK,EAAE,CAAC;YAEf,MAAM,CAAC,cAAc,EAAE,CAAC,OAAO,CAAC,kBAAkB,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC,CAAC;YAEtE,4CAA4C;YAC5C,MAAM,cAAc,GAAG,MAAM,CAAC,cAAc,EAAE,CAAC;YAC/C,mBAAmB,CAAC,MAAM,EAAE,cAAc,EAAE,aAAa,CAAC,CAAC;YAC3D,MAAM,CAAC,KAAK,CAAC,cAAc,CAAC,cAAc,EAAE,EAAE,CAAC,CAAC,CAAC;QAClD,CAAC,CAAC,CAAC;QAEH,QAAQ,CAAC,WAAW,EAAE,GAAG,EAAE;YAC1B,EAAE,CAAC,iBAAiB,EAAE,GAAG,EAAE;gBAC1B,MAAM,MAAM,GAAG,IAAI,0BAA0B,EAAE,CAAC;gBAChD,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;gBAC/B,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM,EAAE,MAAM,CAAC,OAAO,CAAC,CAAC;gBACnD,MAAM,MAAM,GAAG,KAAK,CAAC,cAAc,EAAE,CAAC;gBACtC,mBAAmB,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;gBACnC,2CAA2C;gBAC3C,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,SAAS,EAAE,EAAE,KAAK,CAAC,CAAC;YACzC,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,iBAAiB,EAAE,GAAG,EAAE;gBAC1B,MAAM,MAAM,GAAG,IAAI,0BAA0B,CAAC,gBAAgB,CAAC,kBAAkB,CAAC,CAAC,CAAC;gBACpF,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;gBAC/B,MAAM,OAAO,GAAqB,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC;gBACpD,gBAAgB,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,CAAC,gBAAgB,CAAC,EAAE,oBAAoB,CAAC,CAAC;gBAE9E,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM,EAAE,MAAM,CAAC,OAAO,CAAC,CAAC;gBACnD,MAAM,MAAM,GAAG,KAAK,CAAC,cAAc,EAAE,CAAC;gBACtC,mBAAmB,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;gBACnC,MAAM,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC;gBAC3B,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;gBAC9B,MAAM,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,CAAC;gBAC1B,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;gBACjC,MAAM,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,CAAC;gBAC1B,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;gBACnC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,EAAE,EAAE,KAAK,CAAC,CAAC;YACxC,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,iBAAiB,EAAE,GAAG,EAAE;gBAC1B,MAAM,MAAM,GAAG,IAAI,0BAA0B,CAAC,gBAAgB,CAAC,kBAAkB,CAAC,CAAC,CAAC;gBACpF,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;gBAC/B,gBAAgB,CAAC,MAAM,EAAE,CAAC,gBAAgB,CAAC,aAAa,CAAC,CAAC,EAAE,oBAAoB,CAAC,CAAC;gBAElF,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM,EAAE,MAAM,CAAC,OAAO,CAAC,CAAC;gBACnD,MAAM,MAAM,GAAG,KAAK,CAAC,cAAc,EAAE,CAAC;gBACtC,mBAAmB,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;gBACnC,MAAM,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC;gBAC3B,MAAM,SAAS,GAAG,kBAAkB,CAAC,MAAM,CAAC,CAAC;gBAC7C,MAAM,CAAC,SAAS,CAAC,aAAa,EAAE,SAAS,CAAC,CAAC;YAC5C,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,cAAc,EAAE,GAAG,EAAE;gBACvB,MAAM,MAAM,GAAG,IAAI,0BAA0B,CAAC,gBAAgB,CAAC,kBAAkB,CAAC,CAAC,CAAC;gBACpF,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;gBAC/B,gBAAgB,CAAC,MAAM,EAAE,CAAC,gBAAgB,CAAC,aAAa,CAAC,CAAC,EAAE,oBAAoB,CAAC,CAAC;gBAElF,MAAM,YAAY,GAAG,MAAM,CAAC,cAAc,EAAE,CAAC;gBAC7C,mBAAmB,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;gBAC1C,MAAM,CAAC,YAAY,CAAC,SAAS,EAAE,CAAC,CAAC;gBACjC,YAAY,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;gBAChC,MAAM,CAAC,YAAY,CAAC,SAAS,EAAE,CAAC,CAAC;gBACjC,MAAM,MAAM,GAAG,YAAY,CAAC,WAAW,EAAE,CAAC;gBAE1C,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM,EAAE,MAAM,CAAC,OAAO,CAAC,CAAC;gBACnD,MAAM,MAAM,GAAG,KAAK,CAAC,cAAc,EAAE,CAAC;gBACtC,KAAK,CAAC,mBAAmB,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;gBAC1C,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;YACvC,CAAC,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,sDAAsD,EAAE,GAAG,EAAE;YAC/D,MAAM,MAAM,GAAG,IAAI,0BAA0B,CAAC,gBAAgB,CAAC,sBAAsB,CAAC,CAAC,CAAC;YACxF,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;YAC/B,MAAM,OAAO,GAAmB;gBAC/B,EAAE,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE;gBACpC,EAAE,IAAI,EAAE,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE;gBACxC,EAAE,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE;aACzC,CAAC;YACF,gBAAgB,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,CAAC,yBAAyB,CAAC,EAAE,oBAAoB,CAAC,CAAC;YAEvF,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM,EAAE,MAAM,CAAC,OAAO,CAAC,CAAC;YACnD,MAAM,IAAI,GAAc,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC;YACvD,MAAM,KAAK,GAAkB,IAAI,GAAG,CAAC,CAAC,CAAC,YAAY,EAAE,EAAE,KAAK,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAC1E,cAAc,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;YAE7B,oCAAoC;YACpC,MAAM,WAAW,GAAG,KAAK,CAAC,cAAc,EAAE,CAAC;YAC3C,mBAAmB,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC;YACxC,MAAM,CAAC,WAAW,CAAC,SAAS,EAAE,CAAC,CAAC;YAChC,MAAM,CAAC,KAAK,CAAC,WAAW,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;YAEtC,uCAAuC;YACvC,MAAM,cAAc,GAAG,MAAM,CAAC,cAAc,EAAE,CAAC;YAC/C,mBAAmB,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC;YAC5C,MAAM,CAAC,cAAc,CAAC,SAAS,EAAE,CAAC,CAAC;YACnC,MAAM,CAAC,KAAK,CAAC,cAAc,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QACvC,CAAC,CAAC,CAAC;QAEH,QAAQ,CAAC,uBAAuB,EAAE,GAAG,EAAE;YACtC,IAAI,CAAC,MAAM,CAAC,oBAAoB,EAAE;gBACjC,EAAE,CAAC,oDAAoD,EAAE,GAAG,EAAE;oBAC7D,MAAM,MAAM,GAAG,OAAO,CACrB,IAAI,0BAA0B,CAAC,gBAAgB,CAAC,sBAAsB,CAAC,CAAC,CACxE,CAAC;oBACF,gBAAgB,CAAC,MAAM,EAAE,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,EAAE,oBAAoB,CAAC,CAAC;oBACtE,MAAM,MAAM,GAAG,MAAM,CAAC,cAAc,EAAE,CAAC;oBACvC,mBAAmB,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;oBAEpC,MAAM,IAAI,GAAc,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC;oBACvD,MAAM,KAAK,GAAkB,IAAI,GAAG,CAAC,CAAC,CAAC,YAAY,EAAE,EAAE,KAAK,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;oBAC1E,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,cAAc,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC;gBACpD,CAAC,CAAC,CAAC;aACH;YAED,EAAE,CAAC,iCAAiC,EAAE,GAAG,EAAE;gBAC1C,MAAM,MAAM,GAAG,OAAO,CACrB,IAAI,0BAA0B,CAAC,gBAAgB,CAAC,sBAAsB,CAAC,CAAC,CACxE,CAAC;gBACF,gBAAgB,CAAC,MAAM,EAAE,CAAC,gBAAgB,CAAC,aAAa,CAAC,CAAC,EAAE,oBAAoB,CAAC,CAAC;gBAElF,MAAM,QAAQ,GAAc;oBAC3B,KAAK,EAAE,CAAC;oBACR,MAAM,EAAE,IAAI,GAAG,CAAC;wBACf;4BACC,MAAM;4BACN;gCACC,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC;6BACxD;yBACD;qBACD,CAAC;iBACF,CAAC;gBACF,MAAM,KAAK,GAAkB,IAAI,GAAG,CAAC,CAAC,CAAC,YAAY,EAAE,EAAE,KAAK,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;gBAC9E,cAAc,CAAC,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE;oBACxC;wBACC,EAAE,EAAE,OAAO;wBACX,KAAK,EAAE;4BACN,yBAAyB,CAAC;gCACzB,IAAI,EAAE,IAAI,CAAC,OAAO,CAAC,IAAI;gCACvB,KAAK,EAAE,IAAI;6BACX,CAAC;yBACF;qBACD;iBACD,CAAC,CAAC;gBAEH,MAAM,MAAM,GAAG,MAAM,CAAC,cAAc,EAAE,CAAC;gBACvC,mBAAmB,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;gBACpC,MAAM,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC;gBAC3B,MAAM,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;gBAC1B,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,SAAS,EAAE,EAAE,IAAI,CAAC,CAAC;gBACvC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;YAClC,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,uBAAuB,EAAE,GAAG,EAAE;gBAChC,MAAM,MAAM,GAAG,OAAO,CACrB,IAAI,0BAA0B,CAAC,gBAAgB,CAAC,sBAAsB,CAAC,CAAC,CACxE,CAAC;gBACF,gBAAgB,CAAC,MAAM,EAAE,CAAC,gBAAgB,CAAC,aAAa,CAAC,CAAC,EAAE,oBAAoB,CAAC,CAAC;gBAElF,MAAM,QAAQ,GAAc;oBAC3B,KAAK,EAAE,CAAC;oBACR,MAAM,EAAE,IAAI,GAAG,CAAC;wBACf,CAAC,MAAM,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC;qBACtE,CAAC;iBACF,CAAC;gBACF,MAAM,KAAK,GAAkB,IAAI,GAAG,CAAC,CAAC,CAAC,YAAY,EAAE,EAAE,KAAK,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;gBAC9E,cAAc,CAAC,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE;oBACxC;wBACC,EAAE,EAAE,OAAO;wBACX,KAAK,EAAE;4BACN,yBAAyB,CAAC;gCACzB,IAAI,EAAE,IAAI,CAAC,OAAO,CAAC,IAAI;gCACvB,KAAK,EAAE,IAAI;6BACX,CAAC;yBACF;qBACD;iBACD,CAAC,CAAC;gBAEH,MAAM,MAAM,GAAG,MAAM,CAAC,cAAc,EAAE,CAAC;gBACvC,mBAAmB,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;gBACpC,MAAM,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC;gBAC3B,MAAM,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;gBAC1B,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,SAAS,EAAE,EAAE,IAAI,CAAC,CAAC;gBACvC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;YAClC,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,QAAQ,EAAE,GAAG,EAAE;gBACjB,MAAM,MAAM,GAAG,OAAO,CACrB,IAAI,0BAA0B,CAAC,gBAAgB,CAAC,kBAAkB,CAAC,CAAC,CACpE,CAAC;gBACF,MAAM,OAAO,GAAqB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBACzC,gBAAgB,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,CAAC,gBAAgB,CAAC,EAAE,oBAAoB,CAAC,CAAC;gBAE9E,MAAM,IAAI,GAAc;oBACvB,KAAK,EAAE,CAAC;oBACR,MAAM,EAAE,QAAQ;iBAChB,CAAC;gBACF,MAAM,KAAK,GAAkB,IAAI,GAAG,CAAC,CAAC,CAAC,YAAY,EAAE,EAAE,KAAK,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;gBAC1E,cAAc,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;gBAE9B,gDAAgD;gBAChD,MAAM,MAAM,GAAG,MAAM,CAAC,cAAc,EAAE,CAAC;gBACvC,mBAAmB,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;gBACpC,MAAM,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC;gBAC3B,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;gBAC9B,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,EAAE,EAAE,KAAK,CAAC,CAAC;YACxC,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,QAAQ,EAAE,GAAG,EAAE;gBACjB,MAAM,MAAM,GAAG,OAAO,CACrB,IAAI,0BAA0B,CAAC,gBAAgB,CAAC,kBAAkB,CAAC,CAAC,CACpE,CAAC;gBACF,MAAM,OAAO,GAAqB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBACzC,gBAAgB,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,CAAC,gBAAgB,CAAC,EAAE,oBAAoB,CAAC,CAAC;gBAC9E,MAAM,MAAM,GAAG,MAAM,CAAC,cAAc,EAAE,CAAC;gBACvC,mBAAmB,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;gBACpC,MAAM,CAAC,SAAS,EAAE,CAAC;gBACnB,MAAM,MAAM,GAAG,MAAM,CAAC,WAAW,EAAE,CAAC;gBACpC,MAAM,CAAC,KAAK,EAAE,CAAC;gBAEf,MAAM,IAAI,GAAc,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;gBACrC,MAAM,IAAI,GAAc;oBACvB,KAAK,EAAE,CAAC;oBACR,MAAM,EAAE,QAAQ;iBAChB,CAAC;gBACF,MAAM,KAAK,GAAkB,IAAI,GAAG,CAAC,CAAC,CAAC,YAAY,EAAE,EAAE,KAAK,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;gBAChF,cAAc,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;gBAE9B,gDAAgD;gBAChD,MAAM,MAAM,GAAG,MAAM,CAAC,cAAc,EAAE,CAAC;gBACvC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,mBAAmB,CAAC,MAAM,EAAE,MAAM,CAAC,kCAA0B,CAAC;gBAClF,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;gBAC9B,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,EAAE,EAAE,KAAK,CAAC,CAAC;YACxC,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,QAAQ,EAAE,GAAG,EAAE;gBACjB,MAAM,MAAM,GAAG,OAAO,CACrB,IAAI,0BAA0B,CAAC,gBAAgB,CAAC,kBAAkB,CAAC,CAAC,CACpE,CAAC;gBACF,MAAM,OAAO,GAAqB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBACzC,gBAAgB,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,CAAC,gBAAgB,CAAC,EAAE,oBAAoB,CAAC,CAAC;gBAE9E,MAAM,KAAK,GAAkB,IAAI,GAAG,CAAC;oBACpC,CAAC,YAAY,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC;iBAC1D,CAAC,CAAC;gBACH,cAAc,CAAC,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE;oBACxC,EAAE,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,EAAE;iBAC7C,CAAC,CAAC;gBAEH,MAAM,MAAM,GAAG,MAAM,CAAC,cAAc,EAAE,CAAC;gBACvC,mBAAmB,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;gBACpC,MAAM,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC;gBAC3B,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;gBAC9B,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,EAAE,EAAE,IAAI,CAAC,CAAC;gBACtC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;gBAC9B,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,EAAE,EAAE,IAAI,CAAC,CAAC;gBACtC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;gBAC9B,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,EAAE,EAAE,KAAK,CAAC,CAAC;YACxC,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,+BAA+B,EAAE,GAAG,EAAE;gBACxC,MAAM,MAAM,GAAG,OAAO,CACrB,IAAI,0BAA0B,CAAC,gBAAgB,CAAC,kBAAkB,CAAC,CAAC,CACpE,CAAC;gBAEF,MAAM,MAAM,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;gBAC5B,MAAM,OAAO,GAAc;oBAC1B,KAAK,EAAE,CAAC;oBACR,MAAM,EAAE,MAAM;iBACd,CAAC;gBACF,MAAM,MAAM,GAAc;oBACzB,KAAK,EAAE,CAAC;oBACR,MAAM,EAAE,MAAM;iBACd,CAAC;gBACF,MAAM,KAAK,GAAkB,IAAI,GAAG,CAAC;oBACpC;wBACC,YAAY;wBACZ;4BACC,MAAM,EAAE;gCACP;oCACC,EAAE,EAAE,OAAO;oCACX,MAAM,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,EAAE,KAAK,EAAE,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC;iCACjD;6BACD;4BACD,KAAK,EAAE,CAAC,MAAM,CAAC;4BACf,QAAQ,EAAE,CAAC,EAAE,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,EAAE,WAAW,EAAE,QAAQ,EAAE,CAAC;yBAC5D;qBACD;iBACD,CAAC,CAAC;gBACH,cAAc,CAAC,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE;oBACxC,EAAE,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,gBAAgB,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE;iBACpD,CAAC,CAAC;gBAEH,MAAM,MAAM,GAAG,MAAM,CAAC,cAAc,EAAE,CAAC;gBACvC,mBAAmB,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;gBACpC,MAAM,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC;gBAC3B,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;gBAC9B,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,EAAE,EAAE,KAAK,CAAC,CAAC;YACxC,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,sBAAsB,EAAE,GAAG,EAAE;gBAC/B,MAAM,MAAM,GAAG,OAAO,CACrB,IAAI,0BAA0B,CAAC,gBAAgB,CAAC,sBAAsB,CAAC,CAAC,CACxE,CAAC;gBACF,gBAAgB,CAAC,MAAM,EAAE,CAAC,gBAAgB,CAAC,aAAa,CAAC,CAAC,EAAE,oBAAoB,CAAC,CAAC;gBAElF,MAAM,MAAM,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;gBAC5B,MAAM,OAAO,GAAc;oBAC1B,KAAK,EAAE,CAAC;oBACR,MAAM,EAAE,MAAM;iBACd,CAAC;gBACF,MAAM,MAAM,GAAc;oBACzB,KAAK,EAAE,CAAC;oBACR,MAAM,EAAE,MAAM;iBACd,CAAC;gBACF,MAAM,MAAM,GAAc;oBACzB,KAAK,EAAE,CAAC;oBACR,MAAM,EAAE,IAAI,GAAG,CAAC;wBACf,CAAC,MAAM,EAAE,EAAE,KAAK,EAAE,CAAC,OAAO,CAAC,EAAE,CAAC;wBAC9B,CAAC,MAAM,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,MAAM,CAAC,EAAE,CAAC;qBAC3C,CAAC;iBACF,CAAC;gBACF,MAAM,KAAK,GAAkB,IAAI,GAAG,CAAC,CAAC,CAAC,YAAY,EAAE,EAAE,KAAK,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;gBAC5E,cAAc,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;gBAC9B,MAAM,MAAM,GAAG,MAAM,CAAC,cAAc,EAAE,CAAC;gBACvC,mBAAmB,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;gBACpC,MAAM,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC;gBAC3B,MAAM,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;gBAC1B,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,cAAc,EAAE,EAAE,CAAC,CAAC,CAAC;gBACzC,MAAM,CAAC,SAAS,EAAE,CAAC;gBACnB,MAAM,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;gBAC1B,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,cAAc,EAAE,EAAE,CAAC,CAAC,CAAC;YAC1C,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,mBAAmB,EAAE,GAAG,EAAE;gBAC5B,MAAM,MAAM,GAAG,OAAO,CACrB,IAAI,0BAA0B,CAAC,gBAAgB,CAAC,sBAAsB,CAAC,CAAC,CACxE,CAAC;gBACF,MAAM,OAAO,GAAqB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBACzC,gBAAgB,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,CAAC,gBAAgB,CAAC,EAAE,oBAAoB,CAAC,CAAC;gBAE9E,MAAM,KAAK,GAAkB,IAAI,GAAG,CAAC;oBACpC;wBACC,YAAY;wBACZ;4BACC,MAAM,EAAE;gCACP;oCACC,EAAE,EAAE,OAAO;oCACX,MAAM,EAAE,IAAI,GAAG,CAAC;wCACf;4CACC,KAAK,CAAC,UAAU,CAAC;4CACjB;gDACC,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC;6CACvC;yCACD;qCACD,CAAC;iCACF;6BACD;4BACD,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC;yBACtC;qBACD;iBACD,CAAC,CAAC;gBACH,cAAc,CAAC,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE;oBACxC;wBACC,EAAE,EAAE,OAAO;wBACX,KAAK,EAAE;4BACN,yBAAyB,CAAC;gCACzB,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI;gCACtB,KAAK,EAAE,CAAC;6BACR,CAAC;yBACF;qBACD;oBACD;wBACC,EAAE,EAAE,QAAQ;wBACZ,KAAK,EAAE;4BACN,yBAAyB,CAAC;gCACzB,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI;gCACtB,KAAK,EAAE,CAAC;6BACR,CAAC;yBACF;qBACD;iBACD,CAAC,CAAC;gBAEH,MAAM,MAAM,GAAG,MAAM,CAAC,cAAc,EAAE,CAAC;gBACvC,mBAAmB,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;gBACpC,MAAM,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC;gBAC3B,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;gBAC9B,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC;gBACrC,MAAM,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC;gBAC3B,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;gBAC9B,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,EAAE,EAAE,KAAK,CAAC,CAAC;gBACvC,MAAM,CAAC,SAAS,EAAE,CAAC;gBACnB,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,EAAE,EAAE,IAAI,CAAC,CAAC;gBACtC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;gBAC9B,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,EAAE,EAAE,IAAI,CAAC,CAAC;gBACtC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;gBAC9B,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,EAAE,EAAE,KAAK,CAAC,CAAC;YACxC,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,mBAAmB,EAAE,GAAG,EAAE;gBAC5B,MAAM,MAAM,GAAG,OAAO,CACrB,IAAI,0BAA0B,CAAC,gBAAgB,CAAC,sBAAsB,CAAC,CAAC,CACxE,CAAC;gBACF,gBAAgB,CAAC,MAAM,EAAE,CAAC,gBAAgB,CAAC,aAAa,CAAC,CAAC,EAAE,oBAAoB,CAAC,CAAC;gBAElF,MAAM,MAAM,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;gBAC5B,MAAM,IAAI,GAAc;oBACvB,KAAK,EAAE,CAAC;oBACR,MAAM,EAAE,QAAQ;oBAChB,MAAM,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;iBACtE,CAAC;gBACF,MAAM,KAAK,GAAkB,IAAI,GAAG,CAAC;oBACpC,CAAC,YAAY,EAAE,EAAE,KAAK,EAAE,CAAC,IAAI,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC;iBAC/D,CAAC,CAAC;gBACH,cAAc,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;gBAE9B,MAAM,MAAM,GAAG,MAAM,CAAC,cAAc,EAAE,CAAC;gBACvC,mBAAmB,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;gBACpC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,SAAS,EAAE,EAAE,IAAI,CAAC,CAAC;gBACvC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;gBACtC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,UAAU,EAAE,EAAE,IAAI,CAAC,CAAC;gBACxC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,WAAW,EAAE,EAAE,QAAQ,CAAC,CAAC;YAC9C,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,qBAAqB,EAAE,GAAG,EAAE;gBAC9B,MAAM,MAAM,GAAG,OAAO,CACrB,IAAI,0BAA0B,CAAC,gBAAgB,CAAC,sBAAsB,CAAC,CAAC,CACxE,CAAC;gBACF,gBAAgB,CAAC,MAAM,EAAE,CAAC,gBAAgB,CAAC,aAAa,CAAC,CAAC,EAAE,oBAAoB,CAAC,CAAC;gBAElF,MAAM,MAAM,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;gBAC5B,MAAM,IAAI,GAAc;oBACvB,KAAK,EAAE,CAAC;oBACR,MAAM,EAAE,IAAI,GAAG,CAAC;wBACf;4BACC,MAAM;4BACN;gCACC,KAAK,EAAE;oCACN;wCACC,KAAK,EAAE,CAAC;wCACR,MAAM,EAAE,MAAM;wCACd,MAAM,EAAE,IAAI,GAAG,CAAC;4CACf;gDACC,QAAQ;gDACR;oDACC,KAAK,EAAE;wDACN;4DACC,KAAK,EAAE,CAAC;4DACR,MAAM,EAAE,QAAQ;4DAChB,MAAM,EAAE,OAAO;yDACf;qDACD;iDACD;6CACD;yCACD,CAAC;qCACF;iCACD;6BACD;yBACD;wBACD,CAAC,MAAM,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC;qBACnD,CAAC;iBACF,CAAC;gBACF,MAAM,KAAK,GAAkB,IAAI,GAAG,CAAC,CAAC,CAAC,YAAY,EAAE,EAAE,KAAK,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;gBAC1E,cAAc,CAAC,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE;oBACxC,EAAE,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,EAAE;iBAC7C,CAAC,CAAC;gBAEH,MAAM,MAAM,GAAG,MAAM,CAAC,cAAc,EAAE,CAAC;gBACvC,mBAAmB,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;gBACpC,MAAM,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC;gBAC3B,MAAM,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;gBAC1B,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,cAAc,EAAE,EAAE,CAAC,CAAC,CAAC;gBACzC,MAAM,CAAC,SAAS,EAAE,CAAC;gBACnB,MAAM,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;gBAC1B,MAAM,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC;gBAC3B,MAAM,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;gBAC5B,MAAM,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC;gBAC3B,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;gBAC9B,MAAM,CAAC,QAAQ,EAAE,CAAC;gBAClB,MAAM,CAAC,SAAS,EAAE,CAAC;gBACnB,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,EAAE,EAAE,IAAI,CAAC,CAAC;YACvC,CAAC,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,QAAQ,CAAC,+BAA+B,EAAE,GAAG,EAAE;YAC9C,EAAE,CAAC,0CAA0C,EAAE,GAAG,EAAE;gBACnD,MAAM,MAAM,GAAG,OAAO,CACrB,IAAI,0BAA0B,CAAC,gBAAgB,CAAC,sBAAsB,CAAC,CAAC,CACxE,CAAC;gBACF,MAAM,KAAK,GAAkB,IAAI,GAAG,CAAC;oBACpC;wBACC,YAAY;wBACZ;4BACC,KAAK,EAAE;gCACN;oCACC,KAAK,EAAE,CAAC;oCACR,MAAM,EAAE,IAAI,GAAG,CAAC;wCACf;4CACC,MAAM;4CACN;gDACC,KAAK,EAAE;oDACN;wDACC,KAAK,EAAE,CAAC;wDACR,MAAM,EAAE,QAAQ;qDAChB;iDACD;6CACD;yCACD;qCACD,CAAC;iCACF;6BACD;yBACD;qBACD;iBACD,CAAC,CAAC;gBACH,MAAM,QAAQ,GAAqB,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;gBAC9C,gBAAgB,CAAC,MAAM,EAAE,CAAC,gBAAgB,CAAC,aAAa,CAAC,CAAC,EAAE,oBAAoB,CAAC,CAAC;gBAClF,cAAc,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;gBAC9B,MAAM,UAAU,GAAG,MAAM,CAAC,cAAc,EAAE,CAAC;gBAC3C,mBAAmB,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;gBACxC,MAAM,MAAM,GAAG,cAAc,CAAC,UAAU,EAAE,kBAAkB,CAAC,CAAC;gBAC9D,UAAU,CAAC,IAAI,EAAE,CAAC;gBAClB,MAAM,CAAC,SAAS,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;YACpC,CAAC,CAAC,CAAC;YACH,EAAE,CAAC,wCAAwC,EAAE,GAAG,EAAE;gBACjD,MAAM,OAAO,GAAG,IAAI,iBAAiB,CAAC,UAAU,CAAC,QAAQ,EAAE;oBAC1D,KAAK,EAAE,QAAQ;oBACf,SAAS,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC;iBACzB,CAAC,CAAC;gBACH,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,CAAC,MAAM,EAAE;oBACnC,CAAC,EAAE,IAAI,CAAC,MAAM;oBACd,CAAC,EAAE,IAAI,CAAC,MAAM;iBACd,CAAC,CAAC;gBACH,MAAM,MAAM,GAAG,OAAO,CAAC,UAAU,CAChC,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,IAAI,CAAC,CAAC,CACnD,CAAC;gBAEF,MAAM,MAAM,GAAG,OAAO,CAAC,IAAI,0BAA0B,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACjF,gBAAgB,CACf,MAAM,EACN;oBACC,sBAAsB,CAAC,EAAE,MAAM,EAAE,EAAE,IAAI,EAAE;wBACxC,CAAC,EAAE,CAAC,CAAC,CAAC;wBACN,CAAC,EAAE,CAAC,CAAC,CAAC;qBACN,CAAC;iBACF,EACD,oBAAoB,CACpB,CAAC;gBACF,MAAM,MAAM,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;gBAC5B,MAAM,OAAO,GAAc;oBAC1B,KAAK,EAAE,CAAC;oBACR,MAAM,EAAE,MAAM;iBACd,CAAC;gBACF,MAAM,MAAM,GAAc;oBACzB,KAAK,EAAE,CAAC;oBACR,MAAM,EAAE,MAAM;iBACd,CAAC;gBACF,MAAM,MAAM,GAAc;oBACzB,KAAK,EAAE,CAAC;oBACR,MAAM,EAAE,IAAI,GAAG,CAAC;wBACf,CAAC,MAAM,EAAE,EAAE,KAAK,EAAE,CAAC,OAAO,CAAC,EAAE,CAAC;wBAC9B,CAAC,MAAM,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,MAAM,CAAC,EAAE,CAAC;qBAC3C,CAAC;iBACF,CAAC;gBACF,MAAM,KAAK,GAAkB,IAAI,GAAG,CAAC,CAAC,CAAC,YAAY,EAAE,EAAE,KAAK,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;gBAC5E,cAAc,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;gBAC9B,MAAM,cAAc,GAAG,sBAAsB,CAAC,EAAE,MAAM,EAAE,EAAE,IAAI,EAAE;oBAC/D,CAAC,EAAE,EAAE;oBACL,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;iBACT,CAAC,CAAC;gBACH,MAAM,QAAQ,GAAmB,CAAC,sBAAsB,CAAC,cAAc,CAAC,CAAC,CAAC;gBAC1E,MAAM,UAAU,GAAG,MAAM,CAAC,cAAc,EAAE,CAAC;gBAC3C,mBAAmB,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;gBACxC,MAAM,MAAM,GAAG,cAAc,CAAC,UAAU,EAAE,sBAAsB,CAAC,CAAC;gBAClE,UAAU,CAAC,IAAI,EAAE,CAAC;gBAClB,MAAM,CAAC,SAAS,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;YACpC,CAAC,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,4BAA4B,CAC3B,eAAe,EACf,CAAC,IAAI,EAAe,EAAE;QACrB,MAAM,MAAM,GAAG,OAAO,CACrB,IAAI,0BAA0B,CAAC,gBAAgB,CAAC,cAAc,CAAC,CAAC,CAChE,CAAC;QACF,gBAAgB,CAAC,MAAM,EAAE,CAAC,yBAAyB,CAAC,IAAI,CAAC,CAAC,EAAE,oBAAoB,CAAC,CAAC;QAClF,MAAM,MAAM,GAAG,MAAM,CAAC,cAAc,EAAE,CAAC;QACvC,mBAAmB,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QACpC,MAAM,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC;QAC3B,OAAO,MAAM,CAAC;IACf,CAAC,EACD,sBAAsB,EACtB,IAAI,CACJ,CAAC;AACH,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { strict as assert } from \"assert\";\n\nimport {\n\tIEditableForest,\n\tinitializeForest,\n\tmoveToDetachedField,\n\tTreeNavigationResult,\n\tTreeStoredSchemaSubscription,\n\tFieldKey,\n\tJsonableTree,\n\tmapCursorField,\n\trootFieldKey,\n\tUpPath,\n\tclonePath,\n\tITreeCursor,\n\tEmptyKey,\n\tFieldUpPath,\n\tDetachedFieldIndex,\n\tForestRootId,\n\tDetachedField,\n\tdetachedFieldAsKey,\n\tDeltaFieldChanges,\n\tDeltaMark,\n\tDeltaFieldMap,\n\tTreeStoredSchemaRepository,\n} from \"../core/index.js\";\nimport {\n\tcursorToJsonObject,\n\tjsonSchema,\n\tjsonRoot,\n\tsingleJsonCursor,\n\tleaf,\n} from \"../domains/index.js\";\nimport { typeboxValidator } from \"../external-utilities/index.js\";\nimport {\n\tIdAllocator,\n\tJsonCompatible,\n\tbrand,\n\tidAllocatorFromMaxId,\n\tmapIterable,\n} from \"../util/index.js\";\nimport {\n\tFieldKinds,\n\tjsonableTreeFromCursor,\n\tcursorForJsonableTreeNode,\n\tdefaultSchemaPolicy,\n\tisNeverField,\n\tcursorForTypedTreeData,\n\tFlexFieldSchema,\n\tintoStoredSchema,\n\tSchemaBuilderBase,\n} from \"../feature-libraries/index.js\";\nimport {\n\tapplyTestDelta,\n\texpectEqualFieldPaths,\n\texpectEqualPaths,\n\tjsonSequenceRootSchema,\n\ttestRevisionTagCodec,\n} from \"./utils.js\";\nimport { testGeneralPurposeTreeCursor, testTreeSchema } from \"./cursorTestSuite.js\";\n\n/**\n * Configuration for the forest test suite.\n */\nexport interface ForestTestConfiguration {\n\tsuiteName: string;\n\tfactory: (schema: TreeStoredSchemaSubscription) => IEditableForest;\n\n\t/**\n\t * If true, skip the tests that ensure errors are thrown when applying deltas without clearing cursors.\n\t *\n\t * @remarks Errors from current cursors during edits are not required by the Forest API specification,\n\t * but are nice for debugging.\n\t * Performance oriented forest implementations may opt out of this check.\n\t * Applications wanting help debugging invalid forest API use should use cursors that include this check.\n\t */\n\tskipCursorErrorCheck?: true;\n}\n\nconst jsonDocumentSchema = new SchemaBuilderBase(FieldKinds.sequence, {\n\tscope: \"jsonDocumentSchema\",\n\tlibraries: [jsonSchema],\n}).intoSchema(jsonRoot);\n\nconst buildId = { minor: 42 };\nconst buildId2 = { minor: 442 };\nconst detachId = { minor: 43 };\n\n/**\n * Generic forest test suite\n */\nexport function testForest(config: ForestTestConfiguration): void {\n\tconst factory = config.factory;\n\tdescribe(config.suiteName, () => {\n\t\tconst nestedContent: JsonCompatible = {\n\t\t\tx: { foo: 2 },\n\t\t\ty: 1,\n\t\t};\n\t\tconst xField = brand<FieldKey>(\"x\");\n\t\tconst yField = brand<FieldKey>(\"y\");\n\t\tconst fooField: FieldKey = brand(\"foo\");\n\n\t\t// Use Json Cursor to insert and extract some Json data\n\t\tdescribe(\"insert and extract json\", () => {\n\t\t\t// eslint-disable-next-line @typescript-eslint/ban-types\n\t\t\tconst testCases: [string, {} | number][] = [\n\t\t\t\t[\"primitive\", 5],\n\t\t\t\t[\"array\", [1, 2, 3]],\n\t\t\t\t[\"object\", { blah: \"test\" }],\n\t\t\t\t[\"nested objects\", { blah: { foo: 5 }, baz: [{}, { foo: 3 }] }],\n\t\t\t];\n\t\t\tfor (const [name, data] of testCases) {\n\t\t\t\tit(name, () => {\n\t\t\t\t\tconst schema = new TreeStoredSchemaRepository();\n\t\t\t\t\tconst forest = factory(schema);\n\n\t\t\t\t\tconst rootFieldSchema = FlexFieldSchema.create(FieldKinds.optional, jsonRoot);\n\t\t\t\t\tschema.apply({\n\t\t\t\t\t\tnodeSchema: new Map(\n\t\t\t\t\t\t\tmapIterable(jsonSchema.nodeSchema.entries(), ([k, v]) => [k, v.stored]),\n\t\t\t\t\t\t),\n\t\t\t\t\t\trootFieldSchema,\n\t\t\t\t\t});\n\n\t\t\t\t\t// Check schema is actually valid. If we forgot to add some required types this would fail.\n\t\t\t\t\tassert(!isNeverField(defaultSchemaPolicy, schema, rootFieldSchema));\n\n\t\t\t\t\tinitializeForest(forest, [singleJsonCursor(data)], testRevisionTagCodec);\n\n\t\t\t\t\tconst reader = forest.allocateCursor();\n\t\t\t\t\tmoveToDetachedField(forest, reader);\n\n\t\t\t\t\t// copy data from reader into json object and compare to data.\n\t\t\t\t\tconst copy = mapCursorField(reader, cursorToJsonObject);\n\t\t\t\t\treader.free();\n\t\t\t\t\tassert.deepEqual(copy, [data]);\n\t\t\t\t});\n\t\t\t}\n\t\t});\n\n\t\tit(\"cursor use\", () => {\n\t\t\tconst forest = factory(\n\t\t\t\tnew TreeStoredSchemaRepository(intoStoredSchema(jsonSequenceRootSchema)),\n\t\t\t);\n\t\t\tinitializeForest(forest, [singleJsonCursor([1, 2])], testRevisionTagCodec);\n\n\t\t\tconst reader = forest.allocateCursor();\n\t\t\tmoveToDetachedField(forest, reader);\n\t\t\tconst reader2 = reader.fork();\n\t\t\t// Make sure fork is initialized properly\n\t\t\tassert.deepEqual(reader.getFieldPath(), reader2.getFieldPath());\n\t\t\tassert(reader.firstNode());\n\t\t\t// Make sure forks can move independently\n\t\t\tassert.deepEqual(reader.getPath()?.parent, reader2.getFieldPath().parent);\n\t\t\tassert(reader2.firstNode());\n\t\t\tassert.deepEqual(reader.getPath(), reader2.getPath());\n\t\t\treader.enterField(EmptyKey);\n\t\t\treader.enterNode(1);\n\t\t\tassert.equal(reader.value, 2);\n\t\t\t// Move reader two down to the same place, but by a different route.\n\t\t\treader2.enterField(EmptyKey);\n\t\t\treader2.enterNode(0);\n\t\t\tassert.equal(reader2.value, 1);\n\t\t\tassert.equal(reader.value, 2);\n\t\t\tassert(reader2.nextNode());\n\t\t\tassert.equal(reader2.value, 2);\n\t\t\t// Test a fork with a longer path and at a node not a field.\n\t\t\tconst reader3 = reader2.fork();\n\t\t\tassert.deepEqual(reader.getPath(), reader3.getPath());\n\t\t\treader.free();\n\t\t\treader2.free();\n\t\t});\n\n\t\tit(\"isEmpty: rootFieldKey\", () => {\n\t\t\tconst forest = factory(\n\t\t\t\tnew TreeStoredSchemaRepository(intoStoredSchema(jsonDocumentSchema)),\n\t\t\t);\n\t\t\tassert(forest.isEmpty);\n\t\t\tinitializeForest(forest, [singleJsonCursor([])], testRevisionTagCodec);\n\t\t\tassert(!forest.isEmpty);\n\t\t});\n\n\t\tit(\"isEmpty: other root\", () => {\n\t\t\tconst forest = factory(\n\t\t\t\tnew TreeStoredSchemaRepository(intoStoredSchema(jsonDocumentSchema)),\n\t\t\t);\n\t\t\tassert(forest.isEmpty);\n\n\t\t\tconst insert: DeltaFieldChanges = {\n\t\t\t\tlocal: [{ count: 1, attach: { minor: 1 } }],\n\t\t\t};\n\t\t\tapplyTestDelta(new Map([[brand(\"different root\"), insert]]), forest, undefined, [\n\t\t\t\t{ id: { minor: 1 }, trees: [singleJsonCursor([])] },\n\t\t\t]);\n\t\t\tassert(!forest.isEmpty);\n\t\t});\n\n\t\tit(\"moving a cursor to the root of an empty forest fails\", () => {\n\t\t\tconst forest = factory(new TreeStoredSchemaRepository());\n\t\t\tconst cursor = forest.allocateCursor();\n\t\t\tmoveToDetachedField(forest, cursor);\n\t\t\tassert.equal(cursor.firstNode(), false);\n\t\t});\n\n\t\tit(\"tryMoveCursorToNode\", () => {\n\t\t\tconst forest = factory(\n\t\t\t\tnew TreeStoredSchemaRepository(intoStoredSchema(jsonDocumentSchema)),\n\t\t\t);\n\n\t\t\tinitializeForest(forest, [singleJsonCursor([1, 2])], testRevisionTagCodec);\n\n\t\t\tconst parentPath: UpPath = {\n\t\t\t\tparent: undefined,\n\t\t\t\tparentField: rootFieldKey,\n\t\t\t\tparentIndex: 0,\n\t\t\t};\n\n\t\t\tconst childPath1: UpPath = {\n\t\t\t\tparent: parentPath,\n\t\t\t\tparentField: EmptyKey,\n\t\t\t\tparentIndex: 0,\n\t\t\t};\n\n\t\t\tconst childPath2: UpPath = {\n\t\t\t\tparent: parentPath,\n\t\t\t\tparentField: EmptyKey,\n\t\t\t\tparentIndex: 1,\n\t\t\t};\n\n\t\t\tconst parentAnchor = forest.anchors.track(parentPath);\n\t\t\tconst childAnchor1 = forest.anchors.track(childPath1);\n\t\t\tconst childAnchor2 = forest.anchors.track(childPath2);\n\n\t\t\tconst cursor = forest.allocateCursor();\n\t\t\tassert.equal(forest.tryMoveCursorToNode(parentAnchor, cursor), TreeNavigationResult.Ok);\n\t\t\tassert.equal(cursor.value, undefined);\n\t\t\tassert.equal(forest.tryMoveCursorToNode(childAnchor1, cursor), TreeNavigationResult.Ok);\n\t\t\tassert.equal(cursor.value, 1);\n\t\t\tassert.equal(forest.tryMoveCursorToNode(childAnchor2, cursor), TreeNavigationResult.Ok);\n\t\t\tassert.equal(cursor.value, 2);\n\t\t});\n\n\t\tit(\"tryMoveCursorToField\", () => {\n\t\t\tconst forest = factory(\n\t\t\t\tnew TreeStoredSchemaRepository(intoStoredSchema(jsonDocumentSchema)),\n\t\t\t);\n\n\t\t\tinitializeForest(forest, [singleJsonCursor([1, 2])], testRevisionTagCodec);\n\n\t\t\tconst parentPath: FieldUpPath = {\n\t\t\t\tparent: undefined,\n\t\t\t\tfield: rootFieldKey,\n\t\t\t};\n\n\t\t\tconst parentNodePath: UpPath = {\n\t\t\t\tparent: undefined,\n\t\t\t\tparentField: rootFieldKey,\n\t\t\t\tparentIndex: 0,\n\t\t\t};\n\n\t\t\tconst childPath: FieldUpPath = {\n\t\t\t\tparent: parentNodePath,\n\t\t\t\tfield: EmptyKey,\n\t\t\t};\n\n\t\t\tconst parentAnchor = forest.anchors.track(parentNodePath);\n\n\t\t\tconst cursor = forest.allocateCursor();\n\t\t\tassert.equal(\n\t\t\t\tforest.tryMoveCursorToField({ fieldKey: rootFieldKey, parent: undefined }, cursor),\n\t\t\t\tTreeNavigationResult.Ok,\n\t\t\t);\n\n\t\t\texpectEqualFieldPaths(cursor.getFieldPath(), parentPath);\n\t\t\tassert.equal(\n\t\t\t\tforest.tryMoveCursorToField({ fieldKey: EmptyKey, parent: parentAnchor }, cursor),\n\t\t\t\tTreeNavigationResult.Ok,\n\t\t\t);\n\t\t\texpectEqualFieldPaths(cursor.getFieldPath(), childPath);\n\t\t});\n\n\t\tdescribe(\"moveCursorToPath\", () => {\n\t\t\tit(\"moves cursor to specified path.\", () => {\n\t\t\t\tconst forest = factory(\n\t\t\t\t\tnew TreeStoredSchemaRepository(intoStoredSchema(jsonDocumentSchema)),\n\t\t\t\t);\n\t\t\t\tinitializeForest(forest, [singleJsonCursor([1, 2])], testRevisionTagCodec);\n\n\t\t\t\tconst cursor = forest.allocateCursor();\n\t\t\t\tconst path: UpPath = {\n\t\t\t\t\tparent: undefined,\n\t\t\t\t\tparentField: rootFieldKey,\n\t\t\t\t\tparentIndex: 0,\n\t\t\t\t};\n\n\t\t\t\tforest.moveCursorToPath(path, cursor);\n\t\t\t\texpectEqualPaths(path, cursor.getPath());\n\t\t\t});\n\t\t});\n\n\t\tit(\"getCursorAboveDetachedFields\", () => {\n\t\t\tconst forest = factory(\n\t\t\t\tnew TreeStoredSchemaRepository(intoStoredSchema(jsonDocumentSchema)),\n\t\t\t);\n\t\t\tinitializeForest(forest, [singleJsonCursor([1, 2])], testRevisionTagCodec);\n\n\t\t\tconst forestCursor = forest.allocateCursor();\n\t\t\tmoveToDetachedField(forest, forestCursor);\n\t\t\tconst expected = mapCursorField(forestCursor, jsonableTreeFromCursor);\n\n\t\t\tconst cursor = forest.getCursorAboveDetachedFields();\n\t\t\tcursor.enterField(rootFieldKey);\n\t\t\tconst actual = mapCursorField(cursor, jsonableTreeFromCursor);\n\t\t\tassert.deepEqual(actual, expected);\n\t\t});\n\n\t\tit(\"anchors creation and use\", () => {\n\t\t\tconst forest = factory(\n\t\t\t\tnew TreeStoredSchemaRepository(intoStoredSchema(jsonDocumentSchema)),\n\t\t\t);\n\t\t\tinitializeForest(forest, [singleJsonCursor([1, 2])], testRevisionTagCodec);\n\n\t\t\tconst cursor = forest.allocateCursor();\n\t\t\tmoveToDetachedField(forest, cursor);\n\t\t\tassert(cursor.firstNode());\n\t\t\tconst parentAnchor = cursor.buildAnchor();\n\t\t\tcursor.enterField(EmptyKey);\n\t\t\tcursor.enterNode(0);\n\t\t\tassert.equal(cursor.value, 1);\n\t\t\tconst childAnchor1 = cursor.buildAnchor();\n\t\t\tassert(cursor.nextNode());\n\t\t\tconst childAnchor2 = cursor.buildAnchor();\n\t\t\tcursor.exitNode();\n\t\t\tcursor.exitField();\n\t\t\tconst parentAnchor2 = cursor.buildAnchor();\n\n\t\t\tconst parentPath = clonePath(forest.anchors.locate(parentAnchor));\n\t\t\tconst childPath1 = clonePath(forest.anchors.locate(childAnchor1));\n\t\t\tconst childPath2 = clonePath(forest.anchors.locate(childAnchor2));\n\t\t\tconst parentPath2 = clonePath(forest.anchors.locate(parentAnchor2));\n\n\t\t\tconst expectedParent: UpPath = {\n\t\t\t\tparent: undefined,\n\t\t\t\tparentField: rootFieldKey,\n\t\t\t\tparentIndex: 0,\n\t\t\t};\n\n\t\t\tassert.deepStrictEqual(parentPath, expectedParent);\n\t\t\tassert.deepStrictEqual(parentPath2, expectedParent);\n\n\t\t\tconst expectedChild1: UpPath = {\n\t\t\t\tparent: expectedParent,\n\t\t\t\tparentField: EmptyKey,\n\t\t\t\tparentIndex: 0,\n\t\t\t};\n\n\t\t\tconst expectedChild2: UpPath = {\n\t\t\t\tparent: expectedParent,\n\t\t\t\tparentField: EmptyKey,\n\t\t\t\tparentIndex: 1,\n\t\t\t};\n\n\t\t\tassert.deepStrictEqual(childPath1, expectedChild1);\n\t\t\tassert.deepStrictEqual(childPath2, expectedChild2);\n\n\t\t\tassert.equal(forest.tryMoveCursorToNode(parentAnchor, cursor), TreeNavigationResult.Ok);\n\t\t\tassert.equal(cursor.value, undefined);\n\t\t\tassert.equal(forest.tryMoveCursorToNode(childAnchor1, cursor), TreeNavigationResult.Ok);\n\t\t\tassert.equal(cursor.value, 1);\n\t\t\tassert.equal(forest.tryMoveCursorToNode(childAnchor2, cursor), TreeNavigationResult.Ok);\n\t\t\tassert.equal(cursor.value, 2);\n\n\t\t\t// Cleanup is not required for this test (since anchor set will go out of scope here),\n\t\t\t// But make sure it works:\n\t\t\tforest.anchors.forget(parentAnchor);\n\t\t\tforest.anchors.forget(childAnchor1);\n\t\t\tforest.anchors.forget(childAnchor2);\n\t\t\tforest.anchors.forget(parentAnchor2);\n\t\t\tassert(forest.anchors.isEmpty());\n\t\t});\n\n\t\tit(\"using an anchor that went away returns NotFound\", () => {\n\t\t\tconst forest = factory(\n\t\t\t\tnew TreeStoredSchemaRepository(intoStoredSchema(jsonDocumentSchema)),\n\t\t\t);\n\n\t\t\tinitializeForest(forest, [singleJsonCursor([1, 2])], testRevisionTagCodec);\n\n\t\t\tconst cursor = forest.allocateCursor();\n\t\t\tmoveToDetachedField(forest, cursor);\n\t\t\tassert(cursor.firstNode());\n\t\t\tcursor.enterField(EmptyKey);\n\t\t\tcursor.enterNode(0);\n\t\t\tconst firstNodeAnchor = cursor.buildAnchor();\n\t\t\tcursor.clear();\n\n\t\t\tconst mark: DeltaMark = { count: 1, detach: detachId };\n\t\t\tconst delta: DeltaFieldMap = new Map([[rootFieldKey, { local: [mark] }]]);\n\t\t\tapplyTestDelta(delta, forest, undefined, undefined, [{ id: detachId, count: 1 }]);\n\t\t\tapplyTestDelta(delta, forest.anchors, undefined, undefined, [\n\t\t\t\t{ id: detachId, count: 1 },\n\t\t\t]);\n\n\t\t\tassert.equal(\n\t\t\t\tforest.tryMoveCursorToNode(firstNodeAnchor, cursor),\n\t\t\t\tTreeNavigationResult.NotFound,\n\t\t\t);\n\t\t});\n\n\t\tit(\"can destroy detached fields\", () => {\n\t\t\tconst forest = factory(\n\t\t\t\tnew TreeStoredSchemaRepository(intoStoredSchema(jsonDocumentSchema)),\n\t\t\t);\n\t\t\tconst content: JsonCompatible[] = [1, 2];\n\t\t\tinitializeForest(forest, content.map(singleJsonCursor), testRevisionTagCodec);\n\n\t\t\tconst mark: DeltaMark = {\n\t\t\t\tcount: 1,\n\t\t\t\tdetach: detachId,\n\t\t\t};\n\t\t\tconst detachedFieldIndex = new DetachedFieldIndex(\n\t\t\t\t\"test\",\n\t\t\t\tidAllocatorFromMaxId() as IdAllocator<ForestRootId>,\n\t\t\t\ttestRevisionTagCodec,\n\n\t\t\t\t{ jsonValidator: typeboxValidator },\n\t\t\t);\n\t\t\tconst delta: DeltaFieldMap = new Map<FieldKey, DeltaFieldChanges>([\n\t\t\t\t[rootFieldKey, { local: [mark] }],\n\t\t\t]);\n\t\t\tapplyTestDelta(delta, forest, detachedFieldIndex);\n\n\t\t\tconst detachedField: DetachedField = brand(\n\t\t\t\tdetachedFieldIndex.toFieldKey(0 as ForestRootId),\n\t\t\t);\n\t\t\t// `1` should be under the detached field\n\t\t\tconst reader = forest.allocateCursor();\n\t\t\tmoveToDetachedField(forest, reader, detachedField);\n\t\t\tassert(reader.firstNode());\n\t\t\tassert.equal(reader.value, 1);\n\t\t\tassert.equal(reader.nextNode(), false);\n\t\t\treader.clear();\n\n\t\t\tforest.acquireVisitor().destroy(detachedFieldAsKey(detachedField), 1);\n\n\t\t\t// check the detached field no longer exists\n\t\t\tconst detachedCursor = forest.allocateCursor();\n\t\t\tmoveToDetachedField(forest, detachedCursor, detachedField);\n\t\t\tassert.equal(detachedCursor.getFieldLength(), 0);\n\t\t});\n\n\t\tdescribe(\"can clone\", () => {\n\t\t\tit(\"an empty forest\", () => {\n\t\t\t\tconst schema = new TreeStoredSchemaRepository();\n\t\t\t\tconst forest = factory(schema);\n\t\t\t\tconst clone = forest.clone(schema, forest.anchors);\n\t\t\t\tconst reader = clone.allocateCursor();\n\t\t\t\tmoveToDetachedField(clone, reader);\n\t\t\t\t// Expect no nodes under the detached field\n\t\t\t\tassert.equal(reader.firstNode(), false);\n\t\t\t});\n\n\t\t\tit(\"primitive nodes\", () => {\n\t\t\t\tconst schema = new TreeStoredSchemaRepository(intoStoredSchema(jsonDocumentSchema));\n\t\t\t\tconst forest = factory(schema);\n\t\t\t\tconst content: JsonCompatible[] = [1, true, \"test\"];\n\t\t\t\tinitializeForest(forest, content.map(singleJsonCursor), testRevisionTagCodec);\n\n\t\t\t\tconst clone = forest.clone(schema, forest.anchors);\n\t\t\t\tconst reader = clone.allocateCursor();\n\t\t\t\tmoveToDetachedField(clone, reader);\n\t\t\t\tassert(reader.firstNode());\n\t\t\t\tassert.equal(reader.value, 1);\n\t\t\t\tassert(reader.nextNode());\n\t\t\t\tassert.equal(reader.value, true);\n\t\t\t\tassert(reader.nextNode());\n\t\t\t\tassert.equal(reader.value, \"test\");\n\t\t\t\tassert.equal(reader.nextNode(), false);\n\t\t\t});\n\n\t\t\tit(\"multiple fields\", () => {\n\t\t\t\tconst schema = new TreeStoredSchemaRepository(intoStoredSchema(jsonDocumentSchema));\n\t\t\t\tconst forest = factory(schema);\n\t\t\t\tinitializeForest(forest, [singleJsonCursor(nestedContent)], testRevisionTagCodec);\n\n\t\t\t\tconst clone = forest.clone(schema, forest.anchors);\n\t\t\t\tconst reader = clone.allocateCursor();\n\t\t\t\tmoveToDetachedField(clone, reader);\n\t\t\t\tassert(reader.firstNode());\n\t\t\t\tconst fromClone = cursorToJsonObject(reader);\n\t\t\t\tassert.deepEqual(nestedContent, fromClone);\n\t\t\t});\n\n\t\t\tit(\"with anchors\", () => {\n\t\t\t\tconst schema = new TreeStoredSchemaRepository(intoStoredSchema(jsonDocumentSchema));\n\t\t\t\tconst forest = factory(schema);\n\t\t\t\tinitializeForest(forest, [singleJsonCursor(nestedContent)], testRevisionTagCodec);\n\n\t\t\t\tconst forestReader = forest.allocateCursor();\n\t\t\t\tmoveToDetachedField(forest, forestReader);\n\t\t\t\tassert(forestReader.firstNode());\n\t\t\t\tforestReader.enterField(xField);\n\t\t\t\tassert(forestReader.firstNode());\n\t\t\t\tconst anchor = forestReader.buildAnchor();\n\n\t\t\t\tconst clone = forest.clone(schema, forest.anchors);\n\t\t\t\tconst reader = clone.allocateCursor();\n\t\t\t\tclone.tryMoveCursorToNode(anchor, reader);\n\t\t\t\tassert.equal(reader.value, undefined);\n\t\t\t});\n\t\t});\n\n\t\tit(\"editing a cloned forest does not modify the original\", () => {\n\t\t\tconst schema = new TreeStoredSchemaRepository(intoStoredSchema(jsonSequenceRootSchema));\n\t\t\tconst forest = factory(schema);\n\t\t\tconst content: JsonableTree[] = [\n\t\t\t\t{ type: leaf.number.name, value: 1 },\n\t\t\t\t{ type: leaf.boolean.name, value: true },\n\t\t\t\t{ type: leaf.string.name, value: \"test\" },\n\t\t\t];\n\t\t\tinitializeForest(forest, content.map(cursorForJsonableTreeNode), testRevisionTagCodec);\n\n\t\t\tconst clone = forest.clone(schema, forest.anchors);\n\t\t\tconst mark: DeltaMark = { count: 1, detach: detachId };\n\t\t\tconst delta: DeltaFieldMap = new Map([[rootFieldKey, { local: [mark] }]]);\n\t\t\tapplyTestDelta(delta, clone);\n\n\t\t\t// Check the clone has the new value\n\t\t\tconst cloneReader = clone.allocateCursor();\n\t\t\tmoveToDetachedField(clone, cloneReader);\n\t\t\tassert(cloneReader.firstNode());\n\t\t\tassert.equal(cloneReader.value, true);\n\n\t\t\t// Check the original has the old value\n\t\t\tconst originalReader = forest.allocateCursor();\n\t\t\tmoveToDetachedField(forest, originalReader);\n\t\t\tassert(originalReader.firstNode());\n\t\t\tassert.equal(originalReader.value, 1);\n\t\t});\n\n\t\tdescribe(\"can apply deltas with\", () => {\n\t\t\tif (!config.skipCursorErrorCheck) {\n\t\t\t\tit(\"ensures cursors are cleared before applying deltas\", () => {\n\t\t\t\t\tconst forest = factory(\n\t\t\t\t\t\tnew TreeStoredSchemaRepository(intoStoredSchema(jsonSequenceRootSchema)),\n\t\t\t\t\t);\n\t\t\t\t\tinitializeForest(forest, [singleJsonCursor(1)], testRevisionTagCodec);\n\t\t\t\t\tconst cursor = forest.allocateCursor();\n\t\t\t\t\tmoveToDetachedField(forest, cursor);\n\n\t\t\t\t\tconst mark: DeltaMark = { count: 1, detach: detachId };\n\t\t\t\t\tconst delta: DeltaFieldMap = new Map([[rootFieldKey, { local: [mark] }]]);\n\t\t\t\t\tassert.throws(() => applyTestDelta(delta, forest));\n\t\t\t\t});\n\t\t\t}\n\n\t\t\tit(\"set fields as remove and insert\", () => {\n\t\t\t\tconst forest = factory(\n\t\t\t\t\tnew TreeStoredSchemaRepository(intoStoredSchema(jsonSequenceRootSchema)),\n\t\t\t\t);\n\t\t\t\tinitializeForest(forest, [singleJsonCursor(nestedContent)], testRevisionTagCodec);\n\n\t\t\t\tconst setField: DeltaMark = {\n\t\t\t\t\tcount: 1,\n\t\t\t\t\tfields: new Map([\n\t\t\t\t\t\t[\n\t\t\t\t\t\t\txField,\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tlocal: [{ count: 1, detach: detachId, attach: buildId }],\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\tconst delta: DeltaFieldMap = new Map([[rootFieldKey, { local: [setField] }]]);\n\t\t\t\tapplyTestDelta(delta, forest, undefined, [\n\t\t\t\t\t{\n\t\t\t\t\t\tid: buildId,\n\t\t\t\t\t\ttrees: [\n\t\t\t\t\t\t\tcursorForJsonableTreeNode({\n\t\t\t\t\t\t\t\ttype: leaf.boolean.name,\n\t\t\t\t\t\t\t\tvalue: true,\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\n\t\t\t\tconst reader = forest.allocateCursor();\n\t\t\t\tmoveToDetachedField(forest, reader);\n\t\t\t\tassert(reader.firstNode());\n\t\t\t\treader.enterField(xField);\n\t\t\t\tassert.equal(reader.firstNode(), true);\n\t\t\t\tassert.equal(reader.value, true);\n\t\t\t});\n\n\t\t\tit(\"set fields as replace\", () => {\n\t\t\t\tconst forest = factory(\n\t\t\t\t\tnew TreeStoredSchemaRepository(intoStoredSchema(jsonSequenceRootSchema)),\n\t\t\t\t);\n\t\t\t\tinitializeForest(forest, [singleJsonCursor(nestedContent)], testRevisionTagCodec);\n\n\t\t\t\tconst setField: DeltaMark = {\n\t\t\t\t\tcount: 1,\n\t\t\t\t\tfields: new Map([\n\t\t\t\t\t\t[xField, { local: [{ count: 1, detach: detachId, attach: buildId }] }],\n\t\t\t\t\t]),\n\t\t\t\t};\n\t\t\t\tconst delta: DeltaFieldMap = new Map([[rootFieldKey, { local: [setField] }]]);\n\t\t\t\tapplyTestDelta(delta, forest, undefined, [\n\t\t\t\t\t{\n\t\t\t\t\t\tid: buildId,\n\t\t\t\t\t\ttrees: [\n\t\t\t\t\t\t\tcursorForJsonableTreeNode({\n\t\t\t\t\t\t\t\ttype: leaf.boolean.name,\n\t\t\t\t\t\t\t\tvalue: true,\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\n\t\t\t\tconst reader = forest.allocateCursor();\n\t\t\t\tmoveToDetachedField(forest, reader);\n\t\t\t\tassert(reader.firstNode());\n\t\t\t\treader.enterField(xField);\n\t\t\t\tassert.equal(reader.firstNode(), true);\n\t\t\t\tassert.equal(reader.value, true);\n\t\t\t});\n\n\t\t\tit(\"remove\", () => {\n\t\t\t\tconst forest = factory(\n\t\t\t\t\tnew TreeStoredSchemaRepository(intoStoredSchema(jsonDocumentSchema)),\n\t\t\t\t);\n\t\t\t\tconst content: JsonCompatible[] = [1, 2];\n\t\t\t\tinitializeForest(forest, content.map(singleJsonCursor), testRevisionTagCodec);\n\n\t\t\t\tconst mark: DeltaMark = {\n\t\t\t\t\tcount: 1,\n\t\t\t\t\tdetach: detachId,\n\t\t\t\t};\n\t\t\t\tconst delta: DeltaFieldMap = new Map([[rootFieldKey, { local: [mark] }]]);\n\t\t\t\tapplyTestDelta(delta, forest);\n\n\t\t\t\t// Inspect resulting tree: should just have `2`.\n\t\t\t\tconst reader = forest.allocateCursor();\n\t\t\t\tmoveToDetachedField(forest, reader);\n\t\t\t\tassert(reader.firstNode());\n\t\t\t\tassert.equal(reader.value, 2);\n\t\t\t\tassert.equal(reader.nextNode(), false);\n\t\t\t});\n\n\t\t\tit(\"a skip\", () => {\n\t\t\t\tconst forest = factory(\n\t\t\t\t\tnew TreeStoredSchemaRepository(intoStoredSchema(jsonDocumentSchema)),\n\t\t\t\t);\n\t\t\t\tconst content: JsonCompatible[] = [1, 2];\n\t\t\t\tinitializeForest(forest, content.map(singleJsonCursor), testRevisionTagCodec);\n\t\t\t\tconst cursor = forest.allocateCursor();\n\t\t\t\tmoveToDetachedField(forest, cursor);\n\t\t\t\tcursor.firstNode();\n\t\t\t\tconst anchor = cursor.buildAnchor();\n\t\t\t\tcursor.clear();\n\n\t\t\t\tconst skip: DeltaMark = { count: 1 };\n\t\t\t\tconst mark: DeltaMark = {\n\t\t\t\t\tcount: 1,\n\t\t\t\t\tdetach: detachId,\n\t\t\t\t};\n\t\t\t\tconst delta: DeltaFieldMap = new Map([[rootFieldKey, { local: [skip, mark] }]]);\n\t\t\t\tapplyTestDelta(delta, forest);\n\n\t\t\t\t// Inspect resulting tree: should just have `1`.\n\t\t\t\tconst reader = forest.allocateCursor();\n\t\t\t\tassert.equal(forest.tryMoveCursorToNode(anchor, reader), TreeNavigationResult.Ok);\n\t\t\t\tassert.equal(reader.value, 1);\n\t\t\t\tassert.equal(reader.nextNode(), false);\n\t\t\t});\n\n\t\t\tit(\"insert\", () => {\n\t\t\t\tconst forest = factory(\n\t\t\t\t\tnew TreeStoredSchemaRepository(intoStoredSchema(jsonDocumentSchema)),\n\t\t\t\t);\n\t\t\t\tconst content: JsonCompatible[] = [1, 2];\n\t\t\t\tinitializeForest(forest, content.map(singleJsonCursor), testRevisionTagCodec);\n\n\t\t\t\tconst delta: DeltaFieldMap = new Map([\n\t\t\t\t\t[rootFieldKey, { local: [{ count: 1, attach: buildId }] }],\n\t\t\t\t]);\n\t\t\t\tapplyTestDelta(delta, forest, undefined, [\n\t\t\t\t\t{ id: buildId, trees: [singleJsonCursor(3)] },\n\t\t\t\t]);\n\n\t\t\t\tconst reader = forest.allocateCursor();\n\t\t\t\tmoveToDetachedField(forest, reader);\n\t\t\t\tassert(reader.firstNode());\n\t\t\t\tassert.equal(reader.value, 3);\n\t\t\t\tassert.equal(reader.nextNode(), true);\n\t\t\t\tassert.equal(reader.value, 1);\n\t\t\t\tassert.equal(reader.nextNode(), true);\n\t\t\t\tassert.equal(reader.value, 2);\n\t\t\t\tassert.equal(reader.nextNode(), false);\n\t\t\t});\n\n\t\t\tit(\"move-out under transient node\", () => {\n\t\t\t\tconst forest = factory(\n\t\t\t\t\tnew TreeStoredSchemaRepository(intoStoredSchema(jsonDocumentSchema)),\n\t\t\t\t);\n\n\t\t\t\tconst moveId = { minor: 1 };\n\t\t\t\tconst moveOut: DeltaMark = {\n\t\t\t\t\tcount: 1,\n\t\t\t\t\tdetach: moveId,\n\t\t\t\t};\n\t\t\t\tconst moveIn: DeltaMark = {\n\t\t\t\t\tcount: 1,\n\t\t\t\t\tattach: moveId,\n\t\t\t\t};\n\t\t\t\tconst delta: DeltaFieldMap = new Map([\n\t\t\t\t\t[\n\t\t\t\t\t\trootFieldKey,\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tglobal: [\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\tid: buildId,\n\t\t\t\t\t\t\t\t\tfields: new Map([[xField, { local: [moveOut] }]]),\n\t\t\t\t\t\t\t\t},\n\t\t\t\t\t\t\t],\n\t\t\t\t\t\t\tlocal: [moveIn],\n\t\t\t\t\t\t\trelocate: [{ id: buildId, count: 1, destination: detachId }],\n\t\t\t\t\t\t},\n\t\t\t\t\t],\n\t\t\t\t]);\n\t\t\t\tapplyTestDelta(delta, forest, undefined, [\n\t\t\t\t\t{ id: buildId, trees: [singleJsonCursor({ x: 0 })] },\n\t\t\t\t]);\n\n\t\t\t\tconst reader = forest.allocateCursor();\n\t\t\t\tmoveToDetachedField(forest, reader);\n\t\t\t\tassert(reader.firstNode());\n\t\t\t\tassert.equal(reader.value, 0);\n\t\t\t\tassert.equal(reader.nextNode(), false);\n\t\t\t});\n\n\t\t\tit(\"move out and move in\", () => {\n\t\t\t\tconst forest = factory(\n\t\t\t\t\tnew TreeStoredSchemaRepository(intoStoredSchema(jsonSequenceRootSchema)),\n\t\t\t\t);\n\t\t\t\tinitializeForest(forest, [singleJsonCursor(nestedContent)], testRevisionTagCodec);\n\n\t\t\t\tconst moveId = { minor: 0 };\n\t\t\t\tconst moveOut: DeltaMark = {\n\t\t\t\t\tcount: 1,\n\t\t\t\t\tdetach: moveId,\n\t\t\t\t};\n\t\t\t\tconst moveIn: DeltaMark = {\n\t\t\t\t\tcount: 1,\n\t\t\t\t\tattach: moveId,\n\t\t\t\t};\n\t\t\t\tconst modify: DeltaMark = {\n\t\t\t\t\tcount: 1,\n\t\t\t\t\tfields: new Map([\n\t\t\t\t\t\t[xField, { local: [moveOut] }],\n\t\t\t\t\t\t[yField, { local: [{ count: 1 }, moveIn] }],\n\t\t\t\t\t]),\n\t\t\t\t};\n\t\t\t\tconst delta: DeltaFieldMap = new Map([[rootFieldKey, { local: [modify] }]]);\n\t\t\t\tapplyTestDelta(delta, forest);\n\t\t\t\tconst reader = forest.allocateCursor();\n\t\t\t\tmoveToDetachedField(forest, reader);\n\t\t\t\tassert(reader.firstNode());\n\t\t\t\treader.enterField(xField);\n\t\t\t\tassert.equal(reader.getFieldLength(), 0);\n\t\t\t\treader.exitField();\n\t\t\t\treader.enterField(yField);\n\t\t\t\tassert.equal(reader.getFieldLength(), 2);\n\t\t\t});\n\n\t\t\tit(\"insert and modify\", () => {\n\t\t\t\tconst forest = factory(\n\t\t\t\t\tnew TreeStoredSchemaRepository(intoStoredSchema(jsonSequenceRootSchema)),\n\t\t\t\t);\n\t\t\t\tconst content: JsonCompatible[] = [1, 2];\n\t\t\t\tinitializeForest(forest, content.map(singleJsonCursor), testRevisionTagCodec);\n\n\t\t\t\tconst delta: DeltaFieldMap = new Map([\n\t\t\t\t\t[\n\t\t\t\t\t\trootFieldKey,\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tglobal: [\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\tid: buildId,\n\t\t\t\t\t\t\t\t\tfields: new Map([\n\t\t\t\t\t\t\t\t\t\t[\n\t\t\t\t\t\t\t\t\t\t\tbrand(\"newField\"),\n\t\t\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\t\t\tlocal: [{ count: 1, attach: buildId2 }],\n\t\t\t\t\t\t\t\t\t\t\t},\n\t\t\t\t\t\t\t\t\t\t],\n\t\t\t\t\t\t\t\t\t]),\n\t\t\t\t\t\t\t\t},\n\t\t\t\t\t\t\t],\n\t\t\t\t\t\t\tlocal: [{ count: 1, attach: buildId }],\n\t\t\t\t\t\t},\n\t\t\t\t\t],\n\t\t\t\t]);\n\t\t\t\tapplyTestDelta(delta, forest, undefined, [\n\t\t\t\t\t{\n\t\t\t\t\t\tid: buildId,\n\t\t\t\t\t\ttrees: [\n\t\t\t\t\t\t\tcursorForJsonableTreeNode({\n\t\t\t\t\t\t\t\ttype: leaf.number.name,\n\t\t\t\t\t\t\t\tvalue: 3,\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\t{\n\t\t\t\t\t\tid: buildId2,\n\t\t\t\t\t\ttrees: [\n\t\t\t\t\t\t\tcursorForJsonableTreeNode({\n\t\t\t\t\t\t\t\ttype: leaf.number.name,\n\t\t\t\t\t\t\t\tvalue: 4,\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\n\t\t\t\tconst reader = forest.allocateCursor();\n\t\t\t\tmoveToDetachedField(forest, reader);\n\t\t\t\tassert(reader.firstNode());\n\t\t\t\tassert.equal(reader.value, 3);\n\t\t\t\treader.enterField(brand(\"newField\"));\n\t\t\t\tassert(reader.firstNode());\n\t\t\t\tassert.equal(reader.value, 4);\n\t\t\t\tassert.equal(reader.nextNode(), false);\n\t\t\t\treader.exitField();\n\t\t\t\tassert.equal(reader.nextNode(), true);\n\t\t\t\tassert.equal(reader.value, 1);\n\t\t\t\tassert.equal(reader.nextNode(), true);\n\t\t\t\tassert.equal(reader.value, 2);\n\t\t\t\tassert.equal(reader.nextNode(), false);\n\t\t\t});\n\n\t\t\tit(\"modify and remove\", () => {\n\t\t\t\tconst forest = factory(\n\t\t\t\t\tnew TreeStoredSchemaRepository(intoStoredSchema(jsonSequenceRootSchema)),\n\t\t\t\t);\n\t\t\t\tinitializeForest(forest, [singleJsonCursor(nestedContent)], testRevisionTagCodec);\n\n\t\t\t\tconst moveId = { minor: 0 };\n\t\t\t\tconst mark: DeltaMark = {\n\t\t\t\t\tcount: 1,\n\t\t\t\t\tdetach: detachId,\n\t\t\t\t\tfields: new Map([[xField, { local: [{ count: 1, detach: moveId }] }]]),\n\t\t\t\t};\n\t\t\t\tconst delta: DeltaFieldMap = new Map([\n\t\t\t\t\t[rootFieldKey, { local: [mark, { count: 1, attach: moveId }] }],\n\t\t\t\t]);\n\t\t\t\tapplyTestDelta(delta, forest);\n\n\t\t\t\tconst reader = forest.allocateCursor();\n\t\t\t\tmoveToDetachedField(forest, reader);\n\t\t\t\tassert.equal(reader.firstNode(), true);\n\t\t\t\tassert.equal(reader.value, undefined);\n\t\t\t\tassert.equal(reader.firstField(), true);\n\t\t\t\tassert.equal(reader.getFieldKey(), fooField);\n\t\t\t});\n\n\t\t\tit(\"modify and move out\", () => {\n\t\t\t\tconst forest = factory(\n\t\t\t\t\tnew TreeStoredSchemaRepository(intoStoredSchema(jsonSequenceRootSchema)),\n\t\t\t\t);\n\t\t\t\tinitializeForest(forest, [singleJsonCursor(nestedContent)], testRevisionTagCodec);\n\n\t\t\t\tconst moveId = { minor: 0 };\n\t\t\t\tconst mark: DeltaMark = {\n\t\t\t\t\tcount: 1,\n\t\t\t\t\tfields: new Map([\n\t\t\t\t\t\t[\n\t\t\t\t\t\t\txField,\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tlocal: [\n\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\tcount: 1,\n\t\t\t\t\t\t\t\t\t\tdetach: moveId,\n\t\t\t\t\t\t\t\t\t\tfields: new Map([\n\t\t\t\t\t\t\t\t\t\t\t[\n\t\t\t\t\t\t\t\t\t\t\t\tfooField,\n\t\t\t\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\t\t\t\tlocal: [\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tcount: 1,\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tdetach: detachId,\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tattach: buildId,\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t},\n\t\t\t\t\t\t\t\t\t\t\t\t\t],\n\t\t\t\t\t\t\t\t\t\t\t\t},\n\t\t\t\t\t\t\t\t\t\t\t],\n\t\t\t\t\t\t\t\t\t\t]),\n\t\t\t\t\t\t\t\t\t},\n\t\t\t\t\t\t\t\t],\n\t\t\t\t\t\t\t},\n\t\t\t\t\t\t],\n\t\t\t\t\t\t[yField, { local: [{ count: 1, attach: moveId }] }],\n\t\t\t\t\t]),\n\t\t\t\t};\n\t\t\t\tconst delta: DeltaFieldMap = new Map([[rootFieldKey, { local: [mark] }]]);\n\t\t\t\tapplyTestDelta(delta, forest, undefined, [\n\t\t\t\t\t{ id: buildId, trees: [singleJsonCursor(3)] },\n\t\t\t\t]);\n\n\t\t\t\tconst reader = forest.allocateCursor();\n\t\t\t\tmoveToDetachedField(forest, reader);\n\t\t\t\tassert(reader.firstNode());\n\t\t\t\treader.enterField(xField);\n\t\t\t\tassert.equal(reader.getFieldLength(), 0);\n\t\t\t\treader.exitField();\n\t\t\t\treader.enterField(yField);\n\t\t\t\tassert(reader.firstNode());\n\t\t\t\treader.enterField(fooField);\n\t\t\t\tassert(reader.firstNode());\n\t\t\t\tassert.equal(reader.value, 3);\n\t\t\t\treader.exitNode();\n\t\t\t\treader.exitField();\n\t\t\t\tassert.equal(reader.nextNode(), true);\n\t\t\t});\n\t\t});\n\n\t\tdescribe(\"Does not leave an empty field\", () => {\n\t\t\tit(\"when removing the last node in the field\", () => {\n\t\t\t\tconst forest = factory(\n\t\t\t\t\tnew TreeStoredSchemaRepository(intoStoredSchema(jsonSequenceRootSchema)),\n\t\t\t\t);\n\t\t\t\tconst delta: DeltaFieldMap = new Map([\n\t\t\t\t\t[\n\t\t\t\t\t\trootFieldKey,\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tlocal: [\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\tcount: 1,\n\t\t\t\t\t\t\t\t\tfields: new Map([\n\t\t\t\t\t\t\t\t\t\t[\n\t\t\t\t\t\t\t\t\t\t\txField,\n\t\t\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\t\t\tlocal: [\n\t\t\t\t\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tcount: 1,\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tdetach: detachId,\n\t\t\t\t\t\t\t\t\t\t\t\t\t},\n\t\t\t\t\t\t\t\t\t\t\t\t],\n\t\t\t\t\t\t\t\t\t\t\t},\n\t\t\t\t\t\t\t\t\t\t],\n\t\t\t\t\t\t\t\t\t]),\n\t\t\t\t\t\t\t\t},\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\tconst expected: JsonCompatible[] = [{ y: 1 }];\n\t\t\t\tinitializeForest(forest, [singleJsonCursor(nestedContent)], testRevisionTagCodec);\n\t\t\t\tapplyTestDelta(delta, forest);\n\t\t\t\tconst readCursor = forest.allocateCursor();\n\t\t\t\tmoveToDetachedField(forest, readCursor);\n\t\t\t\tconst actual = mapCursorField(readCursor, cursorToJsonObject);\n\t\t\t\treadCursor.free();\n\t\t\t\tassert.deepEqual(actual, expected);\n\t\t\t});\n\t\t\tit(\"when moving the last node in the field\", () => {\n\t\t\t\tconst builder = new SchemaBuilderBase(FieldKinds.sequence, {\n\t\t\t\t\tscope: \"moving\",\n\t\t\t\t\tlibraries: [leaf.library],\n\t\t\t\t});\n\t\t\t\tconst root = builder.object(\"root\", {\n\t\t\t\t\tx: leaf.number,\n\t\t\t\t\ty: leaf.number,\n\t\t\t\t});\n\t\t\t\tconst schema = builder.intoSchema(\n\t\t\t\t\tFlexFieldSchema.create(FieldKinds.optional, [root]),\n\t\t\t\t);\n\n\t\t\t\tconst forest = factory(new TreeStoredSchemaRepository(intoStoredSchema(schema)));\n\t\t\t\tinitializeForest(\n\t\t\t\t\tforest,\n\t\t\t\t\t[\n\t\t\t\t\t\tcursorForTypedTreeData({ schema }, root, {\n\t\t\t\t\t\t\tx: [2],\n\t\t\t\t\t\t\ty: [1],\n\t\t\t\t\t\t}),\n\t\t\t\t\t],\n\t\t\t\t\ttestRevisionTagCodec,\n\t\t\t\t);\n\t\t\t\tconst moveId = { minor: 0 };\n\t\t\t\tconst moveOut: DeltaMark = {\n\t\t\t\t\tcount: 1,\n\t\t\t\t\tdetach: moveId,\n\t\t\t\t};\n\t\t\t\tconst moveIn: DeltaMark = {\n\t\t\t\t\tcount: 1,\n\t\t\t\t\tattach: moveId,\n\t\t\t\t};\n\t\t\t\tconst modify: DeltaMark = {\n\t\t\t\t\tcount: 1,\n\t\t\t\t\tfields: new Map([\n\t\t\t\t\t\t[xField, { local: [moveOut] }],\n\t\t\t\t\t\t[yField, { local: [{ count: 1 }, moveIn] }],\n\t\t\t\t\t]),\n\t\t\t\t};\n\t\t\t\tconst delta: DeltaFieldMap = new Map([[rootFieldKey, { local: [modify] }]]);\n\t\t\t\tapplyTestDelta(delta, forest);\n\t\t\t\tconst expectedCursor = cursorForTypedTreeData({ schema }, root, {\n\t\t\t\t\tx: [],\n\t\t\t\t\ty: [1, 2],\n\t\t\t\t});\n\t\t\t\tconst expected: JsonableTree[] = [jsonableTreeFromCursor(expectedCursor)];\n\t\t\t\tconst readCursor = forest.allocateCursor();\n\t\t\t\tmoveToDetachedField(forest, readCursor);\n\t\t\t\tconst actual = mapCursorField(readCursor, jsonableTreeFromCursor);\n\t\t\t\treadCursor.free();\n\t\t\t\tassert.deepEqual(actual, expected);\n\t\t\t});\n\t\t});\n\t});\n\n\ttestGeneralPurposeTreeCursor(\n\t\t\"forest cursor\",\n\t\t(data): ITreeCursor => {\n\t\t\tconst forest = factory(\n\t\t\t\tnew TreeStoredSchemaRepository(intoStoredSchema(testTreeSchema)),\n\t\t\t);\n\t\t\tinitializeForest(forest, [cursorForJsonableTreeNode(data)], testRevisionTagCodec);\n\t\t\tconst cursor = forest.allocateCursor();\n\t\t\tmoveToDetachedField(forest, cursor);\n\t\t\tassert(cursor.firstNode());\n\t\t\treturn cursor;\n\t\t},\n\t\tjsonableTreeFromCursor,\n\t\ttrue,\n\t);\n}\n"]}

package/lib/test/objMerge.d.ts DELETED Viewed

@@ -1,24 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-export declare class Merged {
-}
-export declare class Conflicted extends Merged {
-    constructor(o: unknown);
-}
-export declare class ConflictedMap extends Map {
-    constructor(map: Map<unknown, unknown>);
-}
-export declare class Conflict extends Merged {
-    readonly lhs: unknown;
-    readonly rhs: unknown;
-    constructor(lhs: unknown, rhs: unknown);
-}
-/**
- * Utility function for comparing two objects.
- * Supports data that could be roundtrip through `JSON.stringify`/`JSON.parse`.
- * @returns An object that represents a merged view of the given objects.
- */
-export declare function merge<T>(lhs: T, rhs: T): Conflicted | Conflict | ConflictedMap | T;
-//# sourceMappingURL=objMerge.d.ts.map

package/lib/test/objMerge.d.ts.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"objMerge.d.ts","sourceRoot":"","sources":["../../src/test/objMerge.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAKH,qBAAa,MAAM;CAAG;AAEtB,qBAAa,UAAW,SAAQ,MAAM;gBAClB,CAAC,EAAE,OAAO;CAI7B;AAED,qBAAa,aAAc,SAAQ,GAAG;gBAClB,GAAG,EAAE,GAAG,CAAC,OAAO,EAAE,OAAO,CAAC;CAO7C;AAED,qBAAa,QAAS,SAAQ,MAAM;aAElB,GAAG,EAAE,OAAO;aACZ,GAAG,EAAE,OAAO;gBADZ,GAAG,EAAE,OAAO,EACZ,GAAG,EAAE,OAAO;CAI7B;AAGD;;;;GAIG;AACH,wBAAgB,KAAK,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,UAAU,GAAG,QAAQ,GAAG,aAAa,GAAG,CAAC,CAuDlF"}

package/lib/test/objMerge.js DELETED Viewed

@@ -1,181 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { fail } from "../util/index.js";
-// eslint-disable-next-line @typescript-eslint/no-extraneous-class
-export class Merged {
-}
-export class Conflicted extends Merged {
-    constructor(o) {
-        super();
-        Object.assign(this, o);
-    }
-}
-export class ConflictedMap extends Map {
-    constructor(map) {
-        super();
-        for (const [key, value] of map) {
-            this.set(key, value);
-        }
-        Object.assign(this, map);
-    }
-}
-export class Conflict extends Merged {
-    constructor(lhs, rhs) {
-        super();
-        this.lhs = lhs;
-        this.rhs = rhs;
-    }
-}
-// TODO: In theory we should also look at object fields on maps and arrays.
-/**
- * Utility function for comparing two objects.
- * Supports data that could be roundtrip through `JSON.stringify`/`JSON.parse`.
- * @returns An object that represents a merged view of the given objects.
- */
-export function merge(lhs, rhs) {
-    if (hasConflict(lhs) || hasConflict(rhs)) {
-        fail("This function does not accept its output type as an input type");
-    }
-    // === is not reflective because of how NaN is handled, so use Object.is instead.
-    // This treats -0 and +0 as different.
-    // Since -0 is not preserved in serialization round trips,
-    // it can be handed in any way that is reflective and commutative, so this is fine.
-    if (Object.is(lhs, rhs)) {
-        return lhs;
-    }
-    // Primitives which are equal would have early returned above, so now if the values are not both objects,
-    // they are unequal.
-    if (typeof lhs !== "object" || typeof rhs !== "object") {
-        return new Conflict(lhs, rhs);
-    }
-    // null is of type object, and needs to be treated as distinct from the empty object.
-    // Handling it early also avoids type errors trying to access its keys.
-    if (lhs === null || rhs === null) {
-        return new Conflict(lhs, rhs);
-    }
-    // Special case IFluidHandles, comparing them only by their absolutePath
-    // Detect them using JavaScript feature detection pattern: they have a `IFluidHandle`
-    // field that is set to the parent object.
-    {
-        const aHandle = lhs;
-        const bHandle = rhs;
-        if (aHandle.IFluidHandle === aHandle) {
-            if (bHandle.IFluidHandle !== bHandle) {
-                return new Conflict(lhs, rhs);
-            }
-            return aHandle.absolutePath === bHandle.absolutePath ? lhs : new Conflict(lhs, rhs);
-        }
-    }
-    if (Array.isArray(lhs) !== Array.isArray(rhs)) {
-        return new Conflict(lhs, rhs);
-    }
-    if (Array.isArray(lhs) && Array.isArray(rhs)) {
-        return mergeArrays(lhs, rhs);
-    }
-    if (lhs instanceof Map !== rhs instanceof Map) {
-        return new Conflict(lhs, rhs);
-    }
-    if (lhs instanceof Map && rhs instanceof Map) {
-        return mergeMaps(lhs, rhs);
-    }
-    return mergeObjects(lhs, rhs);
-}
-function mergeObjects(lhs, rhs) {
-    // Fluid Serialization (like Json) only keeps enumerable properties, so we can ignore non-enumerable ones.
-    const lhsKeys = Object.keys(lhs);
-    const rhsKeys = Object.keys(rhs);
-    const selfKeys = [];
-    const lhsObj = lhs;
-    const rhsObj = rhs;
-    let same = true;
-    const out = {};
-    for (const key of lhsKeys) {
-        if (key in rhs === false) {
-            same = false;
-            out[key] = new Conflict(lhsObj[key], undefined);
-        }
-        else {
-            // The JavaScript feature detection pattern, used for IFluidHandle, uses a field that is set to the
-            // parent object.
-            // Detect this pattern and special case it to avoid infinite recursion.
-            const aSelf = Object.is(lhsObj[key], lhsObj);
-            const bSelf = Object.is(rhsObj[key], rhsObj);
-            if (aSelf === true && bSelf === true) {
-                selfKeys.push(key);
-            }
-            const d = merge(lhsObj[key], rhsObj[key]);
-            same = same && !hasConflict(d);
-            out[key] = d;
-        }
-    }
-    for (const key of rhsKeys) {
-        if (key in lhs === false) {
-            same = false;
-            out[key] = new Conflict(undefined, rhsObj[key]);
-        }
-    }
-    const final = same ? out : new Conflicted(out);
-    for (const key of selfKeys) {
-        out[key] = final;
-    }
-    return final;
-}
-function mergeArrays(lhs, rhs) {
-    let same = true;
-    const out = [];
-    for (let i = 0; i < lhs.length; i += 1) {
-        const d = merge(lhs[i], rhs[i]);
-        same = same && !hasConflict(d);
-        out.push(d);
-    }
-    for (let i = lhs.length; i < rhs.length; i += 1) {
-        const d = merge(lhs[i], rhs[i]);
-        same = same && !hasConflict(d);
-        out.push(d);
-    }
-    return same ? out : new Conflicted(out);
-}
-function mergeMaps(lhs, rhs) {
-    // Fluid Serialization (like Json) only keeps enumerable properties, so we can ignore non-enumerable ones.
-    const lhsKeys = lhs.keys();
-    const rhsKeys = rhs.keys();
-    const selfKeys = [];
-    let same = true;
-    const out = new Map();
-    for (const key of lhsKeys) {
-        if (!rhs.has(key)) {
-            same = false;
-            out.set(key, new Conflict(lhs.get(key), undefined));
-        }
-        else {
-            // The JavaScript feature detection pattern, used for IFluidHandle, uses a field that is set to the
-            // parent object.
-            // Detect this pattern and special case it to avoid infinite recursion.
-            const aSelf = Object.is(lhs.get(key), lhs);
-            const bSelf = Object.is(rhs.get(key), rhs);
-            if (aSelf === true && bSelf === true) {
-                selfKeys.push(key);
-            }
-            const d = merge(lhs.get(key), rhs.get(key));
-            same = same && !hasConflict(d);
-            out.set(key, d);
-        }
-    }
-    for (const key of rhsKeys) {
-        if (!lhs.has(key)) {
-            same = false;
-            out.set(key, new Conflict(undefined, rhs.get(key)));
-        }
-    }
-    const final = same ? out : new ConflictedMap(out);
-    for (const key of selfKeys) {
-        out.set(key, final);
-    }
-    return final;
-}
-function hasConflict(a) {
-    return a instanceof Merged || a instanceof ConflictedMap;
-}
-//# sourceMappingURL=objMerge.js.map

package/lib/test/objMerge.js.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"objMerge.js","sourceRoot":"","sources":["../../src/test/objMerge.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,IAAI,EAAE,MAAM,kBAAkB,CAAC;AAExC,kEAAkE;AAClE,MAAM,OAAO,MAAM;CAAG;AAEtB,MAAM,OAAO,UAAW,SAAQ,MAAM;IACrC,YAAmB,CAAU;QAC5B,KAAK,EAAE,CAAC;QACR,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IACxB,CAAC;CACD;AAED,MAAM,OAAO,aAAc,SAAQ,GAAG;IACrC,YAAmB,GAA0B;QAC5C,KAAK,EAAE,CAAC;QACR,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,GAAG,EAAE;YAC/B,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;SACrB;QACD,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;IAC1B,CAAC;CACD;AAED,MAAM,OAAO,QAAS,SAAQ,MAAM;IACnC,YACiB,GAAY,EACZ,GAAY;QAE5B,KAAK,EAAE,CAAC;QAHQ,QAAG,GAAH,GAAG,CAAS;QACZ,QAAG,GAAH,GAAG,CAAS;IAG7B,CAAC;CACD;AAED,2EAA2E;AAC3E;;;;GAIG;AACH,MAAM,UAAU,KAAK,CAAI,GAAM,EAAE,GAAM;IACtC,IAAI,WAAW,CAAC,GAAG,CAAC,IAAI,WAAW,CAAC,GAAG,CAAC,EAAE;QACzC,IAAI,CAAC,gEAAgE,CAAC,CAAC;KACvE;IAED,iFAAiF;IACjF,sCAAsC;IACtC,0DAA0D;IAC1D,mFAAmF;IACnF,IAAI,MAAM,CAAC,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE;QACxB,OAAO,GAAG,CAAC;KACX;IAED,yGAAyG;IACzG,oBAAoB;IACpB,IAAI,OAAO,GAAG,KAAK,QAAQ,IAAI,OAAO,GAAG,KAAK,QAAQ,EAAE;QACvD,OAAO,IAAI,QAAQ,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;KAC9B;IAED,qFAAqF;IACrF,uEAAuE;IACvE,IAAI,GAAG,KAAK,IAAI,IAAI,GAAG,KAAK,IAAI,EAAE;QACjC,OAAO,IAAI,QAAQ,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;KAC9B;IAED,wEAAwE;IACxE,qFAAqF;IACrF,0CAA0C;IAC1C;QACC,MAAM,OAAO,GAAG,GAAmE,CAAC;QACpF,MAAM,OAAO,GAAG,GAAmE,CAAC;QACpF,IAAI,OAAO,CAAC,YAAY,KAAK,OAAO,EAAE;YACrC,IAAI,OAAO,CAAC,YAAY,KAAK,OAAO,EAAE;gBACrC,OAAO,IAAI,QAAQ,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;aAC9B;YACD,OAAO,OAAO,CAAC,YAAY,KAAK,OAAO,CAAC,YAAY,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,QAAQ,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;SACpF;KACD;IAED,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE;QAC9C,OAAO,IAAI,QAAQ,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;KAC9B;IACD,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE;QAC7C,OAAO,WAAW,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;KAC7B;IAED,IAAI,GAAG,YAAY,GAAG,KAAK,GAAG,YAAY,GAAG,EAAE;QAC9C,OAAO,IAAI,QAAQ,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;KAC9B;IAED,IAAI,GAAG,YAAY,GAAG,IAAI,GAAG,YAAY,GAAG,EAAE;QAC7C,OAAO,SAAS,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;KAC3B;IAED,OAAO,YAAY,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;AAC/B,CAAC;AAED,SAAS,YAAY,CAAC,GAAW,EAAE,GAAW;IAC7C,0GAA0G;IAC1G,MAAM,OAAO,GAAG,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACjC,MAAM,OAAO,GAAG,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACjC,MAAM,QAAQ,GAAa,EAAE,CAAC;IAE9B,MAAM,MAAM,GAAG,GAA8B,CAAC;IAC9C,MAAM,MAAM,GAAG,GAA8B,CAAC;IAC9C,IAAI,IAAI,GAAG,IAAI,CAAC;IAChB,MAAM,GAAG,GAA4B,EAAE,CAAC;IACxC,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE;QAC1B,IAAI,GAAG,IAAI,GAAG,KAAK,KAAK,EAAE;YACzB,IAAI,GAAG,KAAK,CAAC;YACb,GAAG,CAAC,GAAG,CAAC,GAAG,IAAI,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,SAAS,CAAC,CAAC;SAChD;aAAM;YACN,mGAAmG;YACnG,iBAAiB;YACjB,uEAAuE;YACvE,MAAM,KAAK,GAAG,MAAM,CAAC,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC,CAAC;YAC7C,MAAM,KAAK,GAAG,MAAM,CAAC,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC,CAAC;YAC7C,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,KAAK,IAAI,EAAE;gBACrC,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;aACnB;YACD,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;YAC1C,IAAI,GAAG,IAAI,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;YAC/B,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;SACb;KACD;IACD,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE;QAC1B,IAAI,GAAG,IAAI,GAAG,KAAK,KAAK,EAAE;YACzB,IAAI,GAAG,KAAK,CAAC;YACb,GAAG,CAAC,GAAG,CAAC,GAAG,IAAI,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;SAChD;KACD;IACD,MAAM,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,UAAU,CAAC,GAAG,CAAC,CAAC;IAC/C,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE;QAC3B,GAAG,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;KACjB;IACD,OAAO,KAAK,CAAC;AACd,CAAC;AAED,SAAS,WAAW,CAAC,GAAc,EAAE,GAAc;IAClD,IAAI,IAAI,GAAG,IAAI,CAAC;IAChB,MAAM,GAAG,GAAG,EAAE,CAAC;IACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE;QACvC,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAChC,IAAI,GAAG,IAAI,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;QAC/B,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;KACZ;IACD,KAAK,IAAI,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE;QAChD,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAChC,IAAI,GAAG,IAAI,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;QAC/B,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;KACZ;IACD,OAAO,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,UAAU,CAAC,GAAG,CAAC,CAAC;AACzC,CAAC;AAED,SAAS,SAAS,CAAC,GAA0B,EAAE,GAA0B;IACxE,0GAA0G;IAC1G,MAAM,OAAO,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC;IAC3B,MAAM,OAAO,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC;IAC3B,MAAM,QAAQ,GAAc,EAAE,CAAC;IAE/B,IAAI,IAAI,GAAG,IAAI,CAAC;IAChB,MAAM,GAAG,GAAG,IAAI,GAAG,EAAE,CAAC;IACtB,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE;QAC1B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE;YAClB,IAAI,GAAG,KAAK,CAAC;YACb,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC;SACpD;aAAM;YACN,mGAAmG;YACnG,iBAAiB;YACjB,uEAAuE;YACvE,MAAM,KAAK,GAAG,MAAM,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC;YAC3C,MAAM,KAAK,GAAG,MAAM,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC;YAC3C,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,KAAK,IAAI,EAAE;gBACrC,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;aACnB;YACD,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;YAC5C,IAAI,GAAG,IAAI,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;YAC/B,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;SAChB;KACD;IACD,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE;QAC1B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE;YAClB,IAAI,GAAG,KAAK,CAAC;YACb,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,QAAQ,CAAC,SAAS,EAAE,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;SACpD;KACD;IACD,MAAM,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,aAAa,CAAC,GAAG,CAAC,CAAC;IAClD,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE;QAC3B,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;KACpB;IACD,OAAO,KAAK,CAAC;AACd,CAAC;AAED,SAAS,WAAW,CAAC,CAAU;IAC9B,OAAO,CAAC,YAAY,MAAM,IAAI,CAAC,YAAY,aAAa,CAAC;AAC1D,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { fail } from \"../util/index.js\";\n\n// eslint-disable-next-line @typescript-eslint/no-extraneous-class\nexport class Merged {}\n\nexport class Conflicted extends Merged {\n\tpublic constructor(o: unknown) {\n\t\tsuper();\n\t\tObject.assign(this, o);\n\t}\n}\n\nexport class ConflictedMap extends Map {\n\tpublic constructor(map: Map<unknown, unknown>) {\n\t\tsuper();\n\t\tfor (const [key, value] of map) {\n\t\t\tthis.set(key, value);\n\t\t}\n\t\tObject.assign(this, map);\n\t}\n}\n\nexport class Conflict extends Merged {\n\tpublic constructor(\n\t\tpublic readonly lhs: unknown,\n\t\tpublic readonly rhs: unknown,\n\t) {\n\t\tsuper();\n\t}\n}\n\n// TODO: In theory we should also look at object fields on maps and arrays.\n/**\n * Utility function for comparing two objects.\n * Supports data that could be roundtrip through `JSON.stringify`/`JSON.parse`.\n * @returns An object that represents a merged view of the given objects.\n */\nexport function merge<T>(lhs: T, rhs: T): Conflicted | Conflict | ConflictedMap | T {\n\tif (hasConflict(lhs) || hasConflict(rhs)) {\n\t\tfail(\"This function does not accept its output type as an input type\");\n\t}\n\n\t// === is not reflective because of how NaN is handled, so use Object.is instead.\n\t// This treats -0 and +0 as different.\n\t// Since -0 is not preserved in serialization round trips,\n\t// it can be handed in any way that is reflective and commutative, so this is fine.\n\tif (Object.is(lhs, rhs)) {\n\t\treturn lhs;\n\t}\n\n\t// Primitives which are equal would have early returned above, so now if the values are not both objects,\n\t// they are unequal.\n\tif (typeof lhs !== \"object\" || typeof rhs !== \"object\") {\n\t\treturn new Conflict(lhs, rhs);\n\t}\n\n\t// null is of type object, and needs to be treated as distinct from the empty object.\n\t// Handling it early also avoids type errors trying to access its keys.\n\tif (lhs === null || rhs === null) {\n\t\treturn new Conflict(lhs, rhs);\n\t}\n\n\t// Special case IFluidHandles, comparing them only by their absolutePath\n\t// Detect them using JavaScript feature detection pattern: they have a `IFluidHandle`\n\t// field that is set to the parent object.\n\t{\n\t\tconst aHandle = lhs as unknown as { IFluidHandle?: unknown; absolutePath?: string };\n\t\tconst bHandle = rhs as unknown as { IFluidHandle?: unknown; absolutePath?: string };\n\t\tif (aHandle.IFluidHandle === aHandle) {\n\t\t\tif (bHandle.IFluidHandle !== bHandle) {\n\t\t\t\treturn new Conflict(lhs, rhs);\n\t\t\t}\n\t\t\treturn aHandle.absolutePath === bHandle.absolutePath ? lhs : new Conflict(lhs, rhs);\n\t\t}\n\t}\n\n\tif (Array.isArray(lhs) !== Array.isArray(rhs)) {\n\t\treturn new Conflict(lhs, rhs);\n\t}\n\tif (Array.isArray(lhs) && Array.isArray(rhs)) {\n\t\treturn mergeArrays(lhs, rhs);\n\t}\n\n\tif (lhs instanceof Map !== rhs instanceof Map) {\n\t\treturn new Conflict(lhs, rhs);\n\t}\n\n\tif (lhs instanceof Map && rhs instanceof Map) {\n\t\treturn mergeMaps(lhs, rhs);\n\t}\n\n\treturn mergeObjects(lhs, rhs);\n}\n\nfunction mergeObjects(lhs: object, rhs: object): object | Conflicted {\n\t// Fluid Serialization (like Json) only keeps enumerable properties, so we can ignore non-enumerable ones.\n\tconst lhsKeys = Object.keys(lhs);\n\tconst rhsKeys = Object.keys(rhs);\n\tconst selfKeys: string[] = [];\n\n\tconst lhsObj = lhs as Record<string, unknown>;\n\tconst rhsObj = rhs as Record<string, unknown>;\n\tlet same = true;\n\tconst out: Record<string, unknown> = {};\n\tfor (const key of lhsKeys) {\n\t\tif (key in rhs === false) {\n\t\t\tsame = false;\n\t\t\tout[key] = new Conflict(lhsObj[key], undefined);\n\t\t} else {\n\t\t\t// The JavaScript feature detection pattern, used for IFluidHandle, uses a field that is set to the\n\t\t\t// parent object.\n\t\t\t// Detect this pattern and special case it to avoid infinite recursion.\n\t\t\tconst aSelf = Object.is(lhsObj[key], lhsObj);\n\t\t\tconst bSelf = Object.is(rhsObj[key], rhsObj);\n\t\t\tif (aSelf === true && bSelf === true) {\n\t\t\t\tselfKeys.push(key);\n\t\t\t}\n\t\t\tconst d = merge(lhsObj[key], rhsObj[key]);\n\t\t\tsame = same && !hasConflict(d);\n\t\t\tout[key] = d;\n\t\t}\n\t}\n\tfor (const key of rhsKeys) {\n\t\tif (key in lhs === false) {\n\t\t\tsame = false;\n\t\t\tout[key] = new Conflict(undefined, rhsObj[key]);\n\t\t}\n\t}\n\tconst final = same ? out : new Conflicted(out);\n\tfor (const key of selfKeys) {\n\t\tout[key] = final;\n\t}\n\treturn final;\n}\n\nfunction mergeArrays(lhs: unknown[], rhs: unknown[]): unknown[] | Conflicted {\n\tlet same = true;\n\tconst out = [];\n\tfor (let i = 0; i < lhs.length; i += 1) {\n\t\tconst d = merge(lhs[i], rhs[i]);\n\t\tsame = same && !hasConflict(d);\n\t\tout.push(d);\n\t}\n\tfor (let i = lhs.length; i < rhs.length; i += 1) {\n\t\tconst d = merge(lhs[i], rhs[i]);\n\t\tsame = same && !hasConflict(d);\n\t\tout.push(d);\n\t}\n\treturn same ? out : new Conflicted(out);\n}\n\nfunction mergeMaps(lhs: Map<unknown, unknown>, rhs: Map<unknown, unknown>): Map<unknown, unknown> {\n\t// Fluid Serialization (like Json) only keeps enumerable properties, so we can ignore non-enumerable ones.\n\tconst lhsKeys = lhs.keys();\n\tconst rhsKeys = rhs.keys();\n\tconst selfKeys: unknown[] = [];\n\n\tlet same = true;\n\tconst out = new Map();\n\tfor (const key of lhsKeys) {\n\t\tif (!rhs.has(key)) {\n\t\t\tsame = false;\n\t\t\tout.set(key, new Conflict(lhs.get(key), undefined));\n\t\t} else {\n\t\t\t// The JavaScript feature detection pattern, used for IFluidHandle, uses a field that is set to the\n\t\t\t// parent object.\n\t\t\t// Detect this pattern and special case it to avoid infinite recursion.\n\t\t\tconst aSelf = Object.is(lhs.get(key), lhs);\n\t\t\tconst bSelf = Object.is(rhs.get(key), rhs);\n\t\t\tif (aSelf === true && bSelf === true) {\n\t\t\t\tselfKeys.push(key);\n\t\t\t}\n\t\t\tconst d = merge(lhs.get(key), rhs.get(key));\n\t\t\tsame = same && !hasConflict(d);\n\t\t\tout.set(key, d);\n\t\t}\n\t}\n\tfor (const key of rhsKeys) {\n\t\tif (!lhs.has(key)) {\n\t\t\tsame = false;\n\t\t\tout.set(key, new Conflict(undefined, rhs.get(key)));\n\t\t}\n\t}\n\tconst final = same ? out : new ConflictedMap(out);\n\tfor (const key of selfKeys) {\n\t\tout.set(key, final);\n\t}\n\treturn final;\n}\n\nfunction hasConflict(a: unknown): boolean {\n\treturn a instanceof Merged || a instanceof ConflictedMap;\n}\n"]}

package/lib/test/rebase/findAncestor.spec.d.ts DELETED Viewed

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

package/lib/test/rebase/findAncestor.spec.d.ts.map DELETED Viewed

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

package/lib/test/rebase/findAncestor.spec.js DELETED Viewed

@@ -1,139 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { strict as assert } from "assert";
-// Allow importing from these specific files which are being tested:
-/* eslint-disable-next-line import/no-internal-modules */
-import { findAncestor, findCommonAncestor } from "../../core/rebase/index.js";
-function node(parent) {
-    return {
-        parent,
-    };
-}
-describe("findAncestor", () => {
-    function assertAncestor(descendant, expectedAncestor, expectedPath) {
-        let foundAncestor = findAncestor(descendant, (n) => n === expectedAncestor);
-        assert.equal(foundAncestor, expectedAncestor);
-        const path = [];
-        foundAncestor = findAncestor([descendant, path], (n) => n === expectedAncestor);
-        assert.equal(foundAncestor, expectedAncestor);
-        assert.deepEqual(path, expectedPath);
-    }
-    it("returns undefined for undefined descendant", () => {
-        assertAncestor(undefined, undefined, []);
-    });
-    it("finds nothing", () => {
-        const a = node();
-        assertAncestor(a, undefined, []);
-    });
-    it("finds self", () => {
-        const a = node();
-        assertAncestor(a, a, []);
-    });
-    it("finds parent", () => {
-        const a = node();
-        const b = node(a);
-        assertAncestor(b, a, [b]);
-    });
-    it("finds ancestor", () => {
-        const a = node();
-        const b = node(a);
-        const c = node(b);
-        assertAncestor(c, a, [b, c]);
-    });
-    it("finds farthest ancestor", () => {
-        const a = node();
-        const b = node(a);
-        const c = node(b);
-        assert.equal(findAncestor(a), a);
-        assert.equal(findAncestor(c), a);
-    });
-    it("has a working example doc comment", () => {
-        const g = { id: "g" }; // Grandparent
-        const p = { parent: g, id: "p" }; // Parent
-        const c = { parent: p, id: "c" }; // Child
-        const path = [];
-        const ancestor = findAncestor([c, path], (n) => n.id === "g");
-        assert.equal(ancestor, g);
-        assert.deepEqual(path, [p, c]);
-    });
-});
-describe("findCommonAncestor", () => {
-    function assertCommonAncestor(a, b, expectedAncestor, expectedPathA, expectedPathB) {
-        const foundPathA = [];
-        const foundPathB = [];
-        const foundAncestor = findCommonAncestor([a, foundPathA], [b, foundPathB]);
-        assert.equal(foundAncestor, expectedAncestor, "Found unexpected ancestor node");
-        assert.deepEqual(foundPathA, expectedPathA);
-        assert.deepEqual(foundPathB, expectedPathB);
-    }
-    it("finds nothing", () => {
-        const a = node();
-        const b = node();
-        assertCommonAncestor(a, b, undefined, [], []);
-    });
-    it("accepts the same node as both inputs", () => {
-        // (A)
-        const a = node();
-        assertCommonAncestor(a, a, a, [], []);
-    });
-    it("finds root parent (inclusive)", () => {
-        // (A)─(B)
-        const a = node();
-        const b = node(a);
-        assertCommonAncestor(a, b, a, [], [b]);
-    });
-    it("finds parent (inclusive)", () => {
-        // A ─(B)─(C)
-        const a = node();
-        const b = node(a);
-        const c = node(b);
-        assertCommonAncestor(b, c, b, [], [c]);
-    });
-    it("finds ancestor (inclusive) on same branch", () => {
-        // (A)─ B ─(C)
-        const a = node();
-        const b = node(a);
-        const c = node(b);
-        assertCommonAncestor(a, c, a, [], [b, c]);
-    });
-    it("finds ancestor on same branch", () => {
-        // A ─ B ─(C)─ D ─(E)
-        const a = node();
-        const b = node(a);
-        const c = node(b);
-        const d = node(c);
-        const e = node(d);
-        assertCommonAncestor(c, e, c, [], [d, e]);
-    });
-    it("finds parent", () => {
-        // A ─(B)
-        // └─(C)
-        const a = node();
-        const b = node(a);
-        const c = node(a);
-        assertCommonAncestor(b, c, a, [b], [c]);
-    });
-    it("finds ancestor", () => {
-        // A ─ B ─(C)
-        // └─ D ─(E)
-        const a = node();
-        const b = node(a);
-        const c = node(b);
-        const d = node(a);
-        const e = node(d);
-        assertCommonAncestor(c, e, a, [b, c], [d, e]);
-    });
-    it("has a working example doc comment", () => {
-        const shared = {};
-        const a = { parent: shared };
-        const b1 = { parent: shared };
-        const b2 = { parent: b1 };
-        const pathB = [];
-        const ancestor = findCommonAncestor(a, [b2, pathB]);
-        assert.equal(ancestor, shared);
-        assert.deepEqual(pathB, [b1, b2]);
-    });
-});
-//# sourceMappingURL=findAncestor.spec.js.map

package/lib/test/rebase/findAncestor.spec.js.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"findAncestor.spec.js","sourceRoot":"","sources":["../../../src/test/rebase/findAncestor.spec.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,IAAI,MAAM,EAAE,MAAM,QAAQ,CAAC;AAE1C,oEAAoE;AACpE,yDAAyD;AACzD,OAAO,EAAE,YAAY,EAAE,kBAAkB,EAAE,MAAM,4BAA4B,CAAC;AAM9E,SAAS,IAAI,CAAC,MAAa;IAC1B,OAAO;QACN,MAAM;KACN,CAAC;AACH,CAAC;AAED,QAAQ,CAAC,cAAc,EAAE,GAAG,EAAE;IAC7B,SAAS,cAAc,CACtB,UAA4B,EAC5B,gBAAkC,EAClC,YAAoB;QAEpB,IAAI,aAAa,GAAG,YAAY,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,gBAAgB,CAAC,CAAC;QAC5E,MAAM,CAAC,KAAK,CAAC,aAAa,EAAE,gBAAgB,CAAC,CAAC;QAC9C,MAAM,IAAI,GAAW,EAAE,CAAC;QACxB,aAAa,GAAG,YAAY,CAAC,CAAC,UAAU,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,gBAAgB,CAAC,CAAC;QAChF,MAAM,CAAC,KAAK,CAAC,aAAa,EAAE,gBAAgB,CAAC,CAAC;QAC9C,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC;IACtC,CAAC;IAED,EAAE,CAAC,4CAA4C,EAAE,GAAG,EAAE;QACrD,cAAc,CAAC,SAAS,EAAE,SAAS,EAAE,EAAE,CAAC,CAAC;IAC1C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,eAAe,EAAE,GAAG,EAAE;QACxB,MAAM,CAAC,GAAG,IAAI,EAAE,CAAC;QACjB,cAAc,CAAC,CAAC,EAAE,SAAS,EAAE,EAAE,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,YAAY,EAAE,GAAG,EAAE;QACrB,MAAM,CAAC,GAAG,IAAI,EAAE,CAAC;QACjB,cAAc,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;IAC1B,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,cAAc,EAAE,GAAG,EAAE;QACvB,MAAM,CAAC,GAAG,IAAI,EAAE,CAAC;QACjB,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QAClB,cAAc,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3B,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,gBAAgB,EAAE,GAAG,EAAE;QACzB,MAAM,CAAC,GAAG,IAAI,EAAE,CAAC;QACjB,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QAClB,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QAClB,cAAc,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAC9B,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,yBAAyB,EAAE,GAAG,EAAE;QAClC,MAAM,CAAC,GAAG,IAAI,EAAE,CAAC;QACjB,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QAClB,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QAClB,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACjC,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,mCAAmC,EAAE,GAAG,EAAE;QAK5C,MAAM,CAAC,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,cAAc;QACrC,MAAM,CAAC,GAAG,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,SAAS;QAC3C,MAAM,CAAC,GAAG,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,QAAQ;QAC1C,MAAM,IAAI,GAAe,EAAE,CAAC;QAC5B,MAAM,QAAQ,GAAG,YAAY,CAAW,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC;QACxE,MAAM,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;QAC1B,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAChC,CAAC,CAAC,CAAC;AACJ,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,oBAAoB,EAAE,GAAG,EAAE;IACnC,SAAS,oBAAoB,CAC5B,CAAO,EACP,CAAO,EACP,gBAAkC,EAClC,aAAqB,EACrB,aAAqB;QAErB,MAAM,UAAU,GAAW,EAAE,CAAC;QAC9B,MAAM,UAAU,GAAW,EAAE,CAAC;QAC9B,MAAM,aAAa,GAAG,kBAAkB,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,EAAE,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC;QAC3E,MAAM,CAAC,KAAK,CAAC,aAAa,EAAE,gBAAgB,EAAE,gCAAgC,CAAC,CAAC;QAChF,MAAM,CAAC,SAAS,CAAC,UAAU,EAAE,aAAa,CAAC,CAAC;QAC5C,MAAM,CAAC,SAAS,CAAC,UAAU,EAAE,aAAa,CAAC,CAAC;IAC7C,CAAC;IAED,EAAE,CAAC,eAAe,EAAE,GAAG,EAAE;QACxB,MAAM,CAAC,GAAG,IAAI,EAAE,CAAC;QACjB,MAAM,CAAC,GAAG,IAAI,EAAE,CAAC;QACjB,oBAAoB,CAAC,CAAC,EAAE,CAAC,EAAE,SAAS,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;IAC/C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,sCAAsC,EAAE,GAAG,EAAE;QAC/C,MAAM;QACN,MAAM,CAAC,GAAG,IAAI,EAAE,CAAC;QACjB,oBAAoB,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;IACvC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,+BAA+B,EAAE,GAAG,EAAE;QACxC,UAAU;QACV,MAAM,CAAC,GAAG,IAAI,EAAE,CAAC;QACjB,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QAClB,oBAAoB,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,0BAA0B,EAAE,GAAG,EAAE;QACnC,aAAa;QACb,MAAM,CAAC,GAAG,IAAI,EAAE,CAAC;QACjB,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QAClB,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QAClB,oBAAoB,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,2CAA2C,EAAE,GAAG,EAAE;QACpD,cAAc;QACd,MAAM,CAAC,GAAG,IAAI,EAAE,CAAC;QACjB,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QAClB,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QAClB,oBAAoB,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,+BAA+B,EAAE,GAAG,EAAE;QACxC,qBAAqB;QACrB,MAAM,CAAC,GAAG,IAAI,EAAE,CAAC;QACjB,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QAClB,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QAClB,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QAClB,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QAClB,oBAAoB,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,cAAc,EAAE,GAAG,EAAE;QACvB,SAAS;QACT,QAAQ;QACR,MAAM,CAAC,GAAG,IAAI,EAAE,CAAC;QACjB,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QAClB,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QAClB,oBAAoB,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACzC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,gBAAgB,EAAE,GAAG,EAAE;QACzB,aAAa;QACb,YAAY;QACZ,MAAM,CAAC,GAAG,IAAI,EAAE,CAAC;QACjB,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QAClB,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QAClB,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QAClB,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QAClB,oBAAoB,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAC/C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,mCAAmC,EAAE,GAAG,EAAE;QAI5C,MAAM,MAAM,GAAG,EAAE,CAAC;QAClB,MAAM,CAAC,GAAG,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC;QAC7B,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC;QAC9B,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC;QAC1B,MAAM,KAAK,GAAe,EAAE,CAAC;QAC7B,MAAM,QAAQ,GAAG,kBAAkB,CAAW,CAAC,EAAE,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC;QAC9D,MAAM,CAAC,KAAK,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;QAC/B,MAAM,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;IACnC,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 { strict as assert } from \"assert\";\n\n// Allow importing from these specific files which are being tested:\n/* eslint-disable-next-line import/no-internal-modules */\nimport { findAncestor, findCommonAncestor } from \"../../core/rebase/index.js\";\n\ninterface Node {\n\tparent?: Node;\n}\n\nfunction node(parent?: Node): Node {\n\treturn {\n\t\tparent,\n\t};\n}\n\ndescribe(\"findAncestor\", () => {\n\tfunction assertAncestor(\n\t\tdescendant: Node | undefined,\n\t\texpectedAncestor: Node | undefined,\n\t\texpectedPath: Node[],\n\t): void {\n\t\tlet foundAncestor = findAncestor(descendant, (n) => n === expectedAncestor);\n\t\tassert.equal(foundAncestor, expectedAncestor);\n\t\tconst path: Node[] = [];\n\t\tfoundAncestor = findAncestor([descendant, path], (n) => n === expectedAncestor);\n\t\tassert.equal(foundAncestor, expectedAncestor);\n\t\tassert.deepEqual(path, expectedPath);\n\t}\n\n\tit(\"returns undefined for undefined descendant\", () => {\n\t\tassertAncestor(undefined, undefined, []);\n\t});\n\n\tit(\"finds nothing\", () => {\n\t\tconst a = node();\n\t\tassertAncestor(a, undefined, []);\n\t});\n\n\tit(\"finds self\", () => {\n\t\tconst a = node();\n\t\tassertAncestor(a, a, []);\n\t});\n\n\tit(\"finds parent\", () => {\n\t\tconst a = node();\n\t\tconst b = node(a);\n\t\tassertAncestor(b, a, [b]);\n\t});\n\n\tit(\"finds ancestor\", () => {\n\t\tconst a = node();\n\t\tconst b = node(a);\n\t\tconst c = node(b);\n\t\tassertAncestor(c, a, [b, c]);\n\t});\n\n\tit(\"finds farthest ancestor\", () => {\n\t\tconst a = node();\n\t\tconst b = node(a);\n\t\tconst c = node(b);\n\t\tassert.equal(findAncestor(a), a);\n\t\tassert.equal(findAncestor(c), a);\n\t});\n\n\tit(\"has a working example doc comment\", () => {\n\t\tinterface Parented {\n\t\t\tid: string;\n\t\t\tparent?: Parented;\n\t\t}\n\t\tconst g = { id: \"g\" }; // Grandparent\n\t\tconst p = { parent: g, id: \"p\" }; // Parent\n\t\tconst c = { parent: p, id: \"c\" }; // Child\n\t\tconst path: Parented[] = [];\n\t\tconst ancestor = findAncestor<Parented>([c, path], (n) => n.id === \"g\");\n\t\tassert.equal(ancestor, g);\n\t\tassert.deepEqual(path, [p, c]);\n\t});\n});\n\ndescribe(\"findCommonAncestor\", () => {\n\tfunction assertCommonAncestor(\n\t\ta: Node,\n\t\tb: Node,\n\t\texpectedAncestor: Node | undefined,\n\t\texpectedPathA: Node[],\n\t\texpectedPathB: Node[],\n\t): void {\n\t\tconst foundPathA: Node[] = [];\n\t\tconst foundPathB: Node[] = [];\n\t\tconst foundAncestor = findCommonAncestor([a, foundPathA], [b, foundPathB]);\n\t\tassert.equal(foundAncestor, expectedAncestor, \"Found unexpected ancestor node\");\n\t\tassert.deepEqual(foundPathA, expectedPathA);\n\t\tassert.deepEqual(foundPathB, expectedPathB);\n\t}\n\n\tit(\"finds nothing\", () => {\n\t\tconst a = node();\n\t\tconst b = node();\n\t\tassertCommonAncestor(a, b, undefined, [], []);\n\t});\n\n\tit(\"accepts the same node as both inputs\", () => {\n\t\t// (A)\n\t\tconst a = node();\n\t\tassertCommonAncestor(a, a, a, [], []);\n\t});\n\n\tit(\"finds root parent (inclusive)\", () => {\n\t\t// (A)─(B)\n\t\tconst a = node();\n\t\tconst b = node(a);\n\t\tassertCommonAncestor(a, b, a, [], [b]);\n\t});\n\n\tit(\"finds parent (inclusive)\", () => {\n\t\t// A ─(B)─(C)\n\t\tconst a = node();\n\t\tconst b = node(a);\n\t\tconst c = node(b);\n\t\tassertCommonAncestor(b, c, b, [], [c]);\n\t});\n\n\tit(\"finds ancestor (inclusive) on same branch\", () => {\n\t\t// (A)─ B ─(C)\n\t\tconst a = node();\n\t\tconst b = node(a);\n\t\tconst c = node(b);\n\t\tassertCommonAncestor(a, c, a, [], [b, c]);\n\t});\n\n\tit(\"finds ancestor on same branch\", () => {\n\t\t// A ─ B ─(C)─ D ─(E)\n\t\tconst a = node();\n\t\tconst b = node(a);\n\t\tconst c = node(b);\n\t\tconst d = node(c);\n\t\tconst e = node(d);\n\t\tassertCommonAncestor(c, e, c, [], [d, e]);\n\t});\n\n\tit(\"finds parent\", () => {\n\t\t// A ─(B)\n\t\t// └─(C)\n\t\tconst a = node();\n\t\tconst b = node(a);\n\t\tconst c = node(a);\n\t\tassertCommonAncestor(b, c, a, [b], [c]);\n\t});\n\n\tit(\"finds ancestor\", () => {\n\t\t// A ─ B ─(C)\n\t\t// └─ D ─(E)\n\t\tconst a = node();\n\t\tconst b = node(a);\n\t\tconst c = node(b);\n\t\tconst d = node(a);\n\t\tconst e = node(d);\n\t\tassertCommonAncestor(c, e, a, [b, c], [d, e]);\n\t});\n\n\tit(\"has a working example doc comment\", () => {\n\t\tinterface Parented {\n\t\t\tparent?: Parented;\n\t\t}\n\t\tconst shared = {};\n\t\tconst a = { parent: shared };\n\t\tconst b1 = { parent: shared };\n\t\tconst b2 = { parent: b1 };\n\t\tconst pathB: Parented[] = [];\n\t\tconst ancestor = findCommonAncestor<Parented>(a, [b2, pathB]);\n\t\tassert.equal(ancestor, shared);\n\t\tassert.deepEqual(pathB, [b1, b2]);\n\t});\n});\n"]}

package/lib/test/rebase/fuzz.d.ts DELETED Viewed

@@ -1,16 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { ChangeRebaser } from "../../core/index.js";
-/**
- *
- * @param rebaser - `ChangeRebaser` instance used to combine generated changes
- * @param changeGenerator - Random change generator function
- * @param seed - Seed used to randomly generate and combine the changes
- * @param maxCombinations - Maximum number of changes to combine in order
- * to produce the final change. Must be greater or equal to 0.
- * @returns A random change resulting from the combination of several random changes.
- */
-export declare function generateFuzzyCombinedChange<TChange>(rebaser: ChangeRebaser<TChange>, changeGenerator: (seed: number) => TChange, seed: number, maxCombinations: number): TChange;
-//# sourceMappingURL=fuzz.d.ts.map

package/lib/test/rebase/fuzz.d.ts.map DELETED Viewed

	@@ -1 +0,0 @@
1	- {"version":3,"file":"fuzz.d.ts","sourceRoot":"","sources":["../../../src/test/rebase/fuzz.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAIH,OAAO,EAAE,aAAa,EAAkD,MAAM,qBAAqB,CAAC;AAQpG;;;;;;;;GAQG;AACH,wBAAgB,2BAA2B,CAAC,OAAO,EAClD,OAAO,EAAE,aAAa,CAAC,OAAO,CAAC,EAC/B,eAAe,EAAE,CAAC,IAAI,EAAE,MAAM,KAAK,OAAO,EAC1C,IAAI,EAAE,MAAM,EACZ,eAAe,EAAE,MAAM,GACrB,OAAO,CAuCT"}