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/feature-libraries/flex-tree/events.spec.js.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"events.spec.js","sourceRoot":"","sources":["../../../../src/test/feature-libraries/flex-tree/events.spec.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,OAAO,EAAE,MAAM,IAAI,MAAM,EAAE,MAAM,QAAQ,CAAC;AAE1C,OAAO,EAAE,UAAU,EAAE,MAAM,qCAAqC,CAAC;AACjE,OAAO,EAAE,UAAU,EAAE,iBAAiB,EAAE,MAAM,+BAA+B,CAAC;AAC9E,OAAO,EAAE,gBAAgB,EAAE,MAAM,sCAAsC,CAAC;AACxE,OAAO,EAAE,aAAa,EAAE,IAAI,EAAE,MAAM,2BAA2B,CAAC;AAChE,OAAO,EAAE,mBAAmB,EAAE,MAAM,gBAAgB,CAAC;AACrD,sDAAsD;AACtD,OAAO,EAAE,YAAY,EAAE,MAAM,uDAAuD,CAAC;AAErF,QAAQ,CAAC,iCAAiC,EAAE,GAAG,EAAE;IAChD,MAAM,OAAO,GAAG,IAAI,aAAa,CAAC;QACjC,KAAK,EAAE,iCAAiC;QACxC,SAAS,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC;KACzB,CAAC,CAAC;IACH,MAAM,iBAAiB,GAAG,OAAO,CAAC,MAAM,CAAC,aAAa,EAAE;QACvD,aAAa,EAAE,aAAa,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC;KAClD,CAAC,CAAC;IACH,MAAM,YAAY,GAAG,OAAO,CAAC,MAAM,CAAC,QAAQ,EAAE;QAC7C,KAAK,EAAE,aAAa,CAAC,QAAQ,CAAC,iBAAiB,CAAC;QAChD,QAAQ,EAAE,aAAa,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC;QAC7C,gBAAgB,EAAE,aAAa,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC;QACrD,gBAAgB,EAAE,aAAa,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC;KACrD,CAAC,CAAC;IACH,MAAM,MAAM,GAAG,OAAO,CAAC,UAAU,CAAC,aAAa,CAAC,KAAK,CAAC,UAAU,CAAC,QAAQ,EAAE,YAAY,CAAC,CAAC,CAAC;IAC1F,MAAM,OAAO,GAAG,IAAI,iBAAiB,CAAC;QACrC,aAAa,EAAE,gBAAgB;QAC/B,MAAM,EAAE,UAAU,CAAC,SAAS;KAC5B,CAAC,CAAC;IAEH,EAAE,CAAC,mCAAmC,EAAE,GAAG,EAAE;QAC5C,MAAM,IAAI,GAAG,mBAAmB,CAAC;YAChC,WAAW,EAAE;gBACZ,QAAQ,EAAE,gBAAgB;gBAC1B,gBAAgB,EAAE,SAAS;gBAC3B,gBAAgB,EAAE,EAAE;gBACpB,KAAK,EAAE,EAAE,aAAa,EAAE,yBAAyB,EAAE;aACnD;YACD,MAAM;SACN,CAAC,CAAC,OAAO,CAAC;QAEX,IAAI,qBAAqB,GAAG,CAAC,CAAC;QAC9B,IAAI,oBAAoB,GAAG,CAAC,CAAC;QAC7B,IAAI,sBAAsB,GAAG,CAAC,CAAC;QAC/B,IAAI,qBAAqB,GAAG,CAAC,CAAC;QAE9B,IAAI,CAAC,EAAE,CAAC,cAAc,EAAE,CAAC,IAAa,EAAE,EAAE;YACzC,qBAAqB,EAAE,CAAC;QACzB,CAAC,CAAC,CAAC;QACH,IAAI,CAAC,EAAE,CAAC,aAAa,EAAE,CAAC,IAAa,EAAE,EAAE;YACxC,oBAAoB,EAAE,CAAC;QACxB,CAAC,CAAC,CAAC;QAEH,MAAM,CAAC,WAAW,CAAC,qBAAqB,EAAE,CAAC,CAAC,CAAC;QAC7C,MAAM,CAAC,WAAW,CAAC,oBAAoB,EAAE,CAAC,CAAC,CAAC;QAE5C,yEAAyE;QACzE,IAAI,CAAC,QAAQ,GAAG,YAAY,CAAC;QAE7B,MAAM,CAAC,WAAW,CAAC,qBAAqB,EAAE,CAAC,CAAC,CAAC;QAC7C,MAAM,CAAC,WAAW,CAAC,oBAAoB,EAAE,CAAC,CAAC,CAAC;QAE5C,gGAAgG;QAChG,IAAI,CAAC,gBAAgB,GAAG,CAAC,CAAC;QAE1B,MAAM,CAAC,WAAW,CAAC,qBAAqB,EAAE,CAAC,CAAC,CAAC;QAC7C,MAAM,CAAC,WAAW,CAAC,oBAAoB,EAAE,CAAC,CAAC,CAAC;QAE5C,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,cAAc,EAAE,CAAC,IAAa,EAAE,EAAE;YAC/C,sBAAsB,EAAE,CAAC;QAC1B,CAAC,CAAC,CAAC;QACH,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,aAAa,EAAE,CAAC,IAAa,EAAE,EAAE;YAC9C,qBAAqB,EAAE,CAAC;QACzB,CAAC,CAAC,CAAC;QAEH,MAAM,CAAC,WAAW,CAAC,sBAAsB,EAAE,CAAC,CAAC,CAAC;QAC9C,MAAM,CAAC,WAAW,CAAC,qBAAqB,EAAE,CAAC,CAAC,CAAC;QAE7C,0FAA0F;QAC1F,IAAI,CAAC,KAAK,CAAC,aAAa,GAAG,8BAA8B,CAAC;QAE1D,MAAM,CAAC,WAAW,CAAC,qBAAqB,EAAE,CAAC,CAAC,CAAC;QAC7C,MAAM,CAAC,WAAW,CAAC,oBAAoB,EAAE,CAAC,CAAC,CAAC;QAC5C,MAAM,CAAC,WAAW,CAAC,sBAAsB,EAAE,CAAC,CAAC,CAAC;QAC9C,MAAM,CAAC,WAAW,CAAC,qBAAqB,EAAE,CAAC,CAAC,CAAC;QAE7C,gEAAgE;QAChE,8GAA8G;QAC9G,IAAI,CAAC,UAAU,CAAC,OAAO,GAAG;YACzB,aAAa,EAAE,6BAA6B;SAC5C,CAAC;QAEF,MAAM,CAAC,WAAW,CAAC,qBAAqB,EAAE,CAAC,CAAC,CAAC;QAC7C,MAAM,CAAC,WAAW,CAAC,oBAAoB,EAAE,CAAC,CAAC,CAAC;QAC5C,qDAAqD;QACrD,MAAM,CAAC,WAAW,CAAC,sBAAsB,EAAE,CAAC,CAAC,CAAC;QAC9C,MAAM,CAAC,WAAW,CAAC,qBAAqB,EAAE,CAAC,CAAC,CAAC;QAE7C,+GAA+G;QAC/G,IAAI,CAAC,KAAK,CAAC,aAAa,GAAG,yBAAyB,CAAC;QAErD,MAAM,CAAC,WAAW,CAAC,qBAAqB,EAAE,CAAC,CAAC,CAAC;QAC7C,MAAM,CAAC,WAAW,CAAC,oBAAoB,EAAE,CAAC,CAAC,CAAC;QAC5C,qDAAqD;QACrD,MAAM,CAAC,WAAW,CAAC,sBAAsB,EAAE,CAAC,CAAC,CAAC;QAC9C,MAAM,CAAC,WAAW,CAAC,qBAAqB,EAAE,CAAC,CAAC,CAAC;QAE7C,sEAAsE;QACtE,IAAI,CAAC,gBAAgB,GAAG,SAAS,CAAC;QAElC,MAAM,CAAC,WAAW,CAAC,qBAAqB,EAAE,CAAC,CAAC,CAAC;QAC7C,MAAM,CAAC,WAAW,CAAC,oBAAoB,EAAE,CAAC,CAAC,CAAC;QAE5C,6FAA6F;QAC7F,oDAAoD;QACpD,IAAI,CAAC,gBAAgB,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAErD,MAAM,CAAC,WAAW,CAAC,qBAAqB,EAAE,EAAE,CAAC,CAAC;QAC9C,MAAM,CAAC,WAAW,CAAC,oBAAoB,EAAE,EAAE,CAAC,CAAC;QAE7C,6FAA6F;QAC7F,oDAAoD;QACpD,IAAI,CAAC,gBAAgB,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;QAErC,MAAM,CAAC,WAAW,CAAC,qBAAqB,EAAE,EAAE,CAAC,CAAC;QAC9C,MAAM,CAAC,WAAW,CAAC,oBAAoB,EAAE,EAAE,CAAC,CAAC;QAE7C,yFAAyF;QACzF,mHAAmH;QACnH,gHAAgH;QAChH,IAAI,CAAC,gBAAgB,CAAC,cAAc,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAE3C,MAAM,CAAC,WAAW,CAAC,qBAAqB,EAAE,EAAE,CAAC,CAAC;QAC9C,MAAM,CAAC,WAAW,CAAC,oBAAoB,EAAE,EAAE,CAAC,CAAC;IAC9C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,gDAAgD,EAAE,GAAG,EAAE;QACzD,MAAM,IAAI,GAAG,mBAAmB,CAAC;YAChC,WAAW,EAAE;gBACZ,QAAQ,EAAE,gBAAgB;gBAC1B,gBAAgB,EAAE,SAAS;gBAC3B,gBAAgB,EAAE,EAAE;gBACpB,KAAK,EAAE,EAAE,aAAa,EAAE,yBAAyB,EAAE;aACnD;YACD,MAAM;SACN,CAAC,CAAC,OAAO,CAAC;QAEX,IAAI,aAAa,GAAG,CAAC,CAAC;QACtB,IAAI,YAAY,GAAG,CAAC,CAAC;QAErB,IAAI,CAAC,EAAE,CAAC,cAAc,EAAE,CAAC,IAAa,EAAE,EAAE;YACzC,aAAa,EAAE,CAAC;YAChB,MAAM,CAAC,WAAW,CAAC,aAAa,EAAE,YAAY,GAAG,CAAC,EAAE,iCAAiC,CAAC,CAAC;QACxF,CAAC,CAAC,CAAC;QACH,IAAI,CAAC,EAAE,CAAC,aAAa,EAAE,CAAC,IAAa,EAAE,EAAE;YACxC,YAAY,EAAE,CAAC;YACf,MAAM,CAAC,WAAW,CAAC,YAAY,EAAE,aAAa,EAAE,gCAAgC,CAAC,CAAC;QACnF,CAAC,CAAC,CAAC;QAEH,8CAA8C;QAC9C,2BAA2B;QAC3B,IAAI,CAAC,QAAQ,GAAG,YAAY,CAAC;QAC7B,yCAAyC;QACzC,IAAI,CAAC,gBAAgB,GAAG,CAAC,CAAC;QAC1B,gBAAgB;QAChB,IAAI,CAAC,gBAAgB,GAAG,SAAS,CAAC;QAClC,6BAA6B;QAC7B,6DAA6D;QAC7D,IAAI,CAAC,gBAAgB,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACrD,+BAA+B;QAC/B,4DAA4D;QAC5D,IAAI,CAAC,gBAAgB,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;QACrC,+BAA+B;QAC/B,yDAAyD;QACzD,kHAAkH;QAClH,6FAA6F;QAC7F,IAAI,CAAC,gBAAgB,CAAC,cAAc,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC3C,8BAA8B;QAC9B,IAAI,CAAC,KAAK,CAAC,aAAa,GAAG,qBAAqB,CAAC;QACjD,8GAA8G;QAC9G,IAAI,CAAC,UAAU,CAAC,OAAO,GAAG;YACzB,aAAa,EAAE,8BAA8B;SAC7C,CAAC;QACF,IAAI,CAAC,KAAK,CAAC,aAAa,GAAG,yBAAyB,CAAC;QAErD,6GAA6G;QAC7G,MAAM,CAAC,WAAW,CAAC,aAAa,EAAE,EAAE,CAAC,CAAC;QACtC,MAAM,CAAC,WAAW,CAAC,YAAY,EAAE,EAAE,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,2CAA2C,EAAE,GAAG,EAAE;QACpD,MAAM,IAAI,GAAG,mBAAmB,CAAC;YAChC,WAAW,EAAE;gBACZ,QAAQ,EAAE,gBAAgB;gBAC1B,gBAAgB,EAAE,SAAS;gBAC3B,gBAAgB,EAAE,EAAE;gBACpB,KAAK,EAAE,EAAE,aAAa,EAAE,yBAAyB,EAAE;aACnD;YACD,MAAM;SACN,CAAC,CAAC,OAAO,CAAC;QAEX,IAAI,iBAAiB,GAAG,CAAC,CAAC;QAC1B,IAAI,gBAAgB,GAAG,CAAC,CAAC;QACzB,IAAI,kBAAkB,GAAG,CAAC,CAAC;QAC3B,IAAI,iBAAiB,GAAG,CAAC,CAAC;QAE1B,sCAAsC;QACtC,IAAI,CAAC,EAAE,CAAC,cAAc,EAAE,CAAC,KAAc,EAAE,EAAE;YAC1C,MAAM,CAAC,WAAW,CAAE,KAAa,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;YAChD,iBAAiB,EAAE,CAAC;QACrB,CAAC,CAAC,CAAC;QACH,IAAI,CAAC,EAAE,CAAC,aAAa,EAAE,CAAC,KAAc,EAAE,EAAE;YACzC,MAAM,CAAC,WAAW,CAAE,KAAa,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;YAChD,gBAAgB,EAAE,CAAC;QACpB,CAAC,CAAC,CAAC;QACH,uCAAuC;QACvC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,cAAc,EAAE,CAAC,KAAc,EAAE,EAAE;YAChD,MAAM,CAAC,WAAW,CAAE,KAAa,CAAC,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;YACtD,kBAAkB,EAAE,CAAC;QACtB,CAAC,CAAC,CAAC;QACH,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,aAAa,EAAE,CAAC,KAAc,EAAE,EAAE;YAC/C,MAAM,CAAC,WAAW,CAAE,KAAa,CAAC,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;YACtD,iBAAiB,EAAE,CAAC;QACrB,CAAC,CAAC,CAAC;QAEH,yEAAyE;QACzE,iBAAiB;QACjB,IAAI,CAAC,QAAQ,GAAG,YAAY,CAAC;QAC7B,yCAAyC;QACzC,IAAI,CAAC,gBAAgB,GAAG,CAAC,CAAC;QAC1B,gBAAgB;QAChB,IAAI,CAAC,gBAAgB,GAAG,SAAS,CAAC;QAClC,6BAA6B;QAC7B,6DAA6D;QAC7D,IAAI,CAAC,gBAAgB,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACrD,+BAA+B;QAC/B,4DAA4D;QAC5D,IAAI,CAAC,gBAAgB,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;QACrC,+BAA+B;QAC/B,yDAAyD;QACzD,kHAAkH;QAClH,6FAA6F;QAC7F,IAAI,CAAC,gBAAgB,CAAC,cAAc,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAE3C,+EAA+E;QAC/E,MAAM,CAAC,WAAW,CAAC,iBAAiB,EAAE,EAAE,CAAC,CAAC;QAC1C,MAAM,CAAC,WAAW,CAAC,gBAAgB,EAAE,EAAE,CAAC,CAAC;QAEzC,iDAAiD;QACjD,iHAAiH;QACjH,kCAAkC;QAElC,IAAI,CAAC,KAAK,CAAC,aAAa,GAAG,qBAAqB,CAAC;QAEjD,+EAA+E;QAC/E,MAAM,CAAC,WAAW,CAAC,iBAAiB,EAAE,EAAE,CAAC,CAAC;QAC1C,MAAM,CAAC,WAAW,CAAC,gBAAgB,EAAE,EAAE,CAAC,CAAC;QACzC,MAAM,CAAC,WAAW,CAAC,kBAAkB,EAAE,CAAC,CAAC,CAAC;QAC1C,MAAM,CAAC,WAAW,CAAC,iBAAiB,EAAE,CAAC,CAAC,CAAC;IAC1C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,uCAAuC,EAAE,GAAG,EAAE;QAChD,MAAM,IAAI,GAAG,mBAAmB,CAAC;YAChC,WAAW,EAAE;gBACZ,QAAQ,EAAE,gBAAgB;gBAC1B,gBAAgB,EAAE,SAAS;gBAC3B,gBAAgB,EAAE,EAAE;gBACpB,KAAK,EAAE,EAAE,aAAa,EAAE,yBAAyB,EAAE;aACnD;YACD,MAAM;SACN,CAAC,CAAC,OAAO,CAAC;QAEX,IAAI,cAAc,GAAG,KAAK,CAAC;QAC3B,IAAI,aAAa,GAAG,KAAK,CAAC;QAE1B,MAAM,uBAAuB,GAAG,IAAI,CAAC,EAAE,CAAC,cAAc,EAAE,CAAC,IAAa,EAAE,EAAE;YACzE,MAAM,CAAC,WAAW,CACjB,cAAc,EACd,KAAK,EACL,+CAA+C,CAC/C,CAAC;YACF,cAAc,GAAG,IAAI,CAAC;QACvB,CAAC,CAAC,CAAC;QACH,MAAM,sBAAsB,GAAG,IAAI,CAAC,EAAE,CAAC,aAAa,EAAE,CAAC,IAAa,EAAE,EAAE;YACvE,MAAM,CAAC,WAAW,CACjB,aAAa,EACb,KAAK,EACL,+CAA+C,CAC/C,CAAC;YACF,aAAa,GAAG,IAAI,CAAC;QACtB,CAAC,CAAC,CAAC;QAEH,kDAAkD;QAClD,IAAI,CAAC,QAAQ,GAAG,cAAc,CAAC;QAE/B,+BAA+B;QAC/B,MAAM,CAAC,WAAW,CAAC,cAAc,EAAE,IAAI,CAAC,CAAC;QACzC,MAAM,CAAC,WAAW,CAAC,aAAa,EAAE,IAAI,CAAC,CAAC;QAExC,mBAAmB;QACnB,sBAAsB,EAAE,CAAC;QACzB,uBAAuB,EAAE,CAAC;QAE1B,uFAAuF;QACvF,IAAI,CAAC,QAAQ,GAAG,cAAc,CAAC;IAChC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,sEAAsE,EAAE,GAAG,EAAE;QAC/E,MAAM,aAAa,GAAG,EAAE,CAAC;QACzB,MAAM,IAAI,GAAG,mBAAmB,CAAC;YAChC,WAAW,EAAE;gBACZ,QAAQ,EAAE,gBAAgB;gBAC1B,gBAAgB,EAAE,aAAa;gBAC/B,gBAAgB,EAAE,EAAE;gBACpB,KAAK,EAAE,EAAE,aAAa,EAAE,yBAAyB,EAAE;aACnD;YACD,MAAM;SACN,CAAC,CAAC,OAAO,CAAC;QAEX,IAAI,kBAAkB,GAAG,CAAC,CAAC;QAE3B,IAAI,CAAC,EAAE,CAAC,cAAc,EAAE,CAAC,IAAa,EAAE,EAAE;YACzC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,gBAAgB,EAAE,aAAa,CAAC,CAAC;YACzD,kBAAkB,EAAE,CAAC;QACtB,CAAC,CAAC,CAAC;QACH,IAAI,CAAC,EAAE,CAAC,aAAa,EAAE,CAAC,IAAa,EAAE,EAAE;YACxC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,gBAAgB,EAAE,SAAS,CAAC,CAAC;YACrD,kBAAkB,EAAE,CAAC;QACtB,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,gBAAgB,GAAG,SAAS,CAAC;QAClC,MAAM,CAAC,WAAW,CAAC,kBAAkB,EAAE,CAAC,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,sEAAsE,EAAE,GAAG,EAAE;QAC/E,MAAM,IAAI,GAAG,mBAAmB,CAAC;YAChC,WAAW,EAAE;gBACZ,QAAQ,EAAE,gBAAgB;gBAC1B,gBAAgB,EAAE,SAAS;gBAC3B,gBAAgB,EAAE,EAAE;gBACpB,KAAK,EAAE,EAAE,aAAa,EAAE,yBAAyB,EAAE;aACnD;YACD,MAAM;SACN,CAAC,CAAC,OAAO,CAAC;QAEX,MAAM,SAAS,GAAG,EAAE,CAAC;QAErB,IAAI,kBAAkB,GAAG,CAAC,CAAC;QAE3B,IAAI,CAAC,EAAE,CAAC,cAAc,EAAE,CAAC,IAAa,EAAE,EAAE;YACzC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,gBAAgB,EAAE,SAAS,CAAC,CAAC;YACrD,kBAAkB,EAAE,CAAC;QACtB,CAAC,CAAC,CAAC;QACH,IAAI,CAAC,EAAE,CAAC,aAAa,EAAE,CAAC,IAAa,EAAE,EAAE;YACxC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,gBAAgB,EAAE,SAAS,CAAC,CAAC;YACrD,kBAAkB,EAAE,CAAC;QACtB,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,gBAAgB,GAAG,SAAS,CAAC;QAClC,MAAM,CAAC,WAAW,CAAC,kBAAkB,EAAE,CAAC,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,yEAAyE,EAAE,GAAG,EAAE;QAClF,MAAM,IAAI,GAAG,mBAAmB,CAAC;YAChC,WAAW,EAAE;gBACZ,QAAQ,EAAE,gBAAgB;gBAC1B,gBAAgB,EAAE,SAAS;gBAC3B,gBAAgB,EAAE,EAAE;gBACpB,KAAK,EAAE,EAAE,aAAa,EAAE,yBAAyB,EAAE;aACnD;YACD,MAAM;SACN,CAAC,CAAC,OAAO,CAAC;QACX,IAAI,kBAAkB,GAAG,CAAC,CAAC;QAC3B,MAAM,SAAS,GAAG,MAAM,CAAC;QAEzB,IAAI,CAAC,EAAE,CAAC,cAAc,EAAE,CAAC,IAAa,EAAE,EAAE;YACzC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,EAAE,gBAAgB,CAAC,CAAC;YACpD,kBAAkB,EAAE,CAAC;QACtB,CAAC,CAAC,CAAC;QACH,IAAI,CAAC,EAAE,CAAC,aAAa,EAAE,CAAC,IAAa,EAAE,EAAE;YACxC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;YAC7C,kBAAkB,EAAE,CAAC;QACtB,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,QAAQ,GAAG,SAAS,CAAC;QAC1B,MAAM,CAAC,WAAW,CAAC,kBAAkB,EAAE,CAAC,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,6EAA6E,EAAE,GAAG,EAAE;QACtF,MAAM,IAAI,GAAG,mBAAmB,CAAC;YAChC,WAAW,EAAE;gBACZ,QAAQ,EAAE,gBAAgB;gBAC1B,gBAAgB,EAAE,SAAS;gBAC3B,gBAAgB,EAAE,EAAE;gBACpB,KAAK,EAAE,EAAE,aAAa,EAAE,yBAAyB,EAAE;aACnD;YACD,MAAM;SACN,CAAC,CAAC,OAAO,CAAC;QAEX,IAAI,kBAAkB,GAAG,CAAC,CAAC;QAE3B,IAAI,CAAC,EAAE,CAAC,cAAc,EAAE,CAAC,IAAa,EAAE,EAAE;YACzC,kBAAkB,EAAE,CAAC;YACrB,QAAQ,kBAAkB,EAAE;gBAC3B,KAAK,CAAC,CAAC,CAAC;oBACP,kCAAkC;oBAClC,MAAM,CAAC,SAAS,CAAC,CAAC,GAAG,IAAI,CAAC,gBAAgB,CAAC,EAAE,EAAE,CAAC,CAAC;oBACjD,MAAM;iBACN;gBACD,KAAK,CAAC,CAAC,CAAC;oBACP,mCAAmC;oBACnC,MAAM,CAAC,SAAS,CAAC,CAAC,GAAG,IAAI,CAAC,gBAAgB,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;oBAClD,MAAM;iBACN;gBACD,KAAK,CAAC,CAAC,CAAC;oBACP,kCAAkC;oBAClC,MAAM,CAAC,SAAS,CAAC,CAAC,GAAG,IAAI,CAAC,gBAAgB,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;oBACrD,MAAM;iBACN;gBACD,aAAa;aACb;QACF,CAAC,CAAC,CAAC;QACH,IAAI,CAAC,EAAE,CAAC,aAAa,EAAE,CAAC,IAAa,EAAE,EAAE;YACxC,kBAAkB,EAAE,CAAC;YACrB,QAAQ,kBAAkB,EAAE;gBAC3B,KAAK,CAAC,CAAC,CAAC;oBACP,iCAAiC;oBACjC,MAAM,CAAC,SAAS,CAAC,CAAC,GAAG,IAAI,CAAC,gBAAgB,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;oBAClD,MAAM;iBACN;gBACD,KAAK,CAAC,CAAC,CAAC;oBACP,kCAAkC;oBAClC,MAAM,CAAC,SAAS,CAAC,CAAC,GAAG,IAAI,CAAC,gBAAgB,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;oBACrD,MAAM;iBACN;gBACD,KAAK,CAAC,CAAC,CAAC;oBACP,iCAAiC;oBACjC,MAAM,CAAC,SAAS,CAAC,CAAC,GAAG,IAAI,CAAC,gBAAgB,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;oBACxD,MAAM;iBACN;gBACD,aAAa;aACb;QACF,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,gBAAgB,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC/C,MAAM,CAAC,WAAW,CAAC,kBAAkB,EAAE,CAAC,CAAC,CAAC,CAAC,mCAAmC;IAC/E,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,gFAAgF,EAAE,GAAG,EAAE;QACzF,MAAM,IAAI,GAAG,mBAAmB,CAAC;YAChC,WAAW,EAAE;gBACZ,QAAQ,EAAE,gBAAgB;gBAC1B,gBAAgB,EAAE,SAAS;gBAC3B,gBAAgB,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;gBACjC,KAAK,EAAE,EAAE,aAAa,EAAE,yBAAyB,EAAE;aACnD;YACD,MAAM;SACN,CAAC,CAAC,OAAO,CAAC;QAEX,IAAI,kBAAkB,GAAG,CAAC,CAAC;QAE3B,IAAI,CAAC,EAAE,CAAC,cAAc,EAAE,CAAC,IAAa,EAAE,EAAE;YACzC,kBAAkB,EAAE,CAAC;YACrB,IAAI,kBAAkB,KAAK,CAAC,EAAE;gBAC7B,iCAAiC;gBACjC,MAAM,CAAC,SAAS,CAAC,CAAC,GAAG,IAAI,CAAC,gBAAgB,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;aAC9D;iBAAM,IAAI,kBAAkB,KAAK,CAAC,EAAE;gBACpC,kCAAkC;gBAClC,MAAM,CAAC,SAAS,CAAC,CAAC,GAAG,IAAI,CAAC,gBAAgB,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;aAC3D;QACF,CAAC,CAAC,CAAC;QACH,IAAI,CAAC,EAAE,CAAC,aAAa,EAAE,CAAC,IAAa,EAAE,EAAE;YACxC,kBAAkB,EAAE,CAAC;YACrB,IAAI,kBAAkB,KAAK,CAAC,EAAE;gBAC7B,gCAAgC;gBAChC,MAAM,CAAC,SAAS,CAAC,CAAC,GAAG,IAAI,CAAC,gBAAgB,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;aAC3D;iBAAM,IAAI,kBAAkB,KAAK,CAAC,EAAE;gBACpC,iCAAiC;gBACjC,MAAM,CAAC,SAAS,CAAC,CAAC,GAAG,IAAI,CAAC,gBAAgB,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;aACxD;QACF,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,gBAAgB,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACxC,MAAM,CAAC,WAAW,CAAC,kBAAkB,EAAE,CAAC,CAAC,CAAC,CAAC,kCAAkC;IAC9E,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,2EAA2E,EAAE,GAAG,EAAE;QACpF,MAAM,IAAI,GAAG,mBAAmB,CAAC;YAChC,WAAW,EAAE;gBACZ,QAAQ,EAAE,gBAAgB;gBAC1B,gBAAgB,EAAE,SAAS;gBAC3B,gBAAgB,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;gBAC3B,KAAK,EAAE,EAAE,aAAa,EAAE,yBAAyB,EAAE;aACnD;YACD,MAAM;SACN,CAAC,CAAC,OAAO,CAAC;QAEX,IAAI,kBAAkB,GAAG,CAAC,CAAC;QAE3B,IAAI,CAAC,EAAE,CAAC,cAAc,EAAE,CAAC,IAAa,EAAE,EAAE;YACzC,kBAAkB,EAAE,CAAC;YACrB,QAAQ,kBAAkB,EAAE;gBAC3B,KAAK,CAAC,CAAC,CAAC;oBACP,kCAAkC;oBAClC,MAAM,CAAC,SAAS,CAAC,CAAC,GAAG,IAAI,CAAC,gBAAgB,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;oBACxD,MAAM;iBACN;gBACD,KAAK,CAAC,CAAC,CAAC;oBACP,mCAAmC;oBACnC,MAAM,CAAC,SAAS,CAAC,CAAC,GAAG,IAAI,CAAC,gBAAgB,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;oBACrD,MAAM;iBACN;gBACD,KAAK,CAAC,CAAC,CAAC;oBACP,qCAAqC;oBACrC,MAAM,CAAC,SAAS,CAAC,CAAC,GAAG,IAAI,CAAC,gBAAgB,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;oBAClD,MAAM;iBACN;gBACD,KAAK,CAAC,CAAC,CAAC;oBACP,sCAAsC;oBACtC,MAAM,CAAC,SAAS,CAAC,CAAC,GAAG,IAAI,CAAC,gBAAgB,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;oBACrD,MAAM;iBACN;gBACD,aAAa;aACb;QACF,CAAC,CAAC,CAAC;QACH,IAAI,CAAC,EAAE,CAAC,aAAa,EAAE,CAAC,IAAa,EAAE,EAAE;YACxC,kBAAkB,EAAE,CAAC;YACrB,QAAQ,kBAAkB,EAAE;gBAC3B,KAAK,CAAC,CAAC,CAAC;oBACP,iCAAiC;oBACjC,MAAM,CAAC,SAAS,CAAC,CAAC,GAAG,IAAI,CAAC,gBAAgB,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;oBACrD,MAAM;iBACN;gBACD,KAAK,CAAC,CAAC,CAAC;oBACP,kCAAkC;oBAClC,MAAM,CAAC,SAAS,CAAC,CAAC,GAAG,IAAI,CAAC,gBAAgB,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;oBAClD,MAAM;iBACN;gBACD,KAAK,CAAC,CAAC,CAAC;oBACP,oCAAoC;oBACpC,MAAM,CAAC,SAAS,CAAC,CAAC,GAAG,IAAI,CAAC,gBAAgB,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;oBACrD,MAAM;iBACN;gBACD,KAAK,CAAC,CAAC,CAAC;oBACP,qCAAqC;oBACrC,MAAM,CAAC,SAAS,CAAC,CAAC,GAAG,IAAI,CAAC,gBAAgB,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;oBACxD,MAAM;iBACN;gBACD,aAAa;aACb;QACF,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,gBAAgB,CAAC,cAAc,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC3C,MAAM,CAAC,WAAW,CAAC,kBAAkB,EAAE,CAAC,CAAC,CAAC,CAAC,kEAAkE;IAC9G,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,6CAA6C,EAAE,GAAG,EAAE;QACtD,MAAM,IAAI,GAAG,mBAAmB,CAAC;YAChC,WAAW,EAAE;gBACZ,QAAQ,EAAE,gBAAgB;gBAC1B,gBAAgB,EAAE,SAAS;gBAC3B,gBAAgB,EAAE,EAAE;gBACpB,KAAK,EAAE,EAAE,aAAa,EAAE,yBAAyB,EAAE;aACnD;YACD,MAAM;SACN,CAAC,CAAC,OAAO,CAAC;QAEX,IAAI,aAAa,GAAG,CAAC,CAAC;QACtB,IAAI,YAAY,GAAG,CAAC,CAAC;QACrB,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,cAAc,EAAE,CAAC,IAAa,EAAE,EAAE;YAC/C,aAAa,EAAE,CAAC;QACjB,CAAC,CAAC,CAAC;QACH,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,aAAa,EAAE,CAAC,IAAa,EAAE,EAAE;YAC9C,YAAY,EAAE,CAAC;QAChB,CAAC,CAAC,CAAC;QAEH,8GAA8G;QAC9G,IAAI,CAAC,UAAU,CAAC,OAAO,GAAG,EAAE,aAAa,EAAE,WAAW,EAAE,CAAC;QAEzD,yDAAyD;QACzD,MAAM,CAAC,WAAW,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC;QACrC,MAAM,CAAC,WAAW,CAAC,YAAY,EAAE,CAAC,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,8CAA8C,EAAE,GAAG,EAAE;QACvD,MAAM,IAAI,GAAG,mBAAmB,CAAC;YAChC,WAAW,EAAE;gBACZ,QAAQ,EAAE,gBAAgB;gBAC1B,gBAAgB,EAAE,SAAS;gBAC3B,gBAAgB,EAAE,EAAE;gBACpB,KAAK,EAAE,EAAE,aAAa,EAAE,yBAAyB,EAAE;aACnD;YACD,MAAM;SACN,CAAC,CAAC,OAAO,CAAC;QAEX,IAAI,iBAAiB,GAAG,CAAC,CAAC;QAC1B,IAAI,gBAAgB,GAAG,CAAC,CAAC;QACzB,IAAI,kBAAkB,GAAG,CAAC,CAAC;QAC3B,IAAI,iBAAiB,GAAG,CAAC,CAAC;QAE1B,IAAI,CAAC,EAAE,CAAC,cAAc,EAAE,CAAC,IAAa,EAAE,EAAE;YACzC,iBAAiB,EAAE,CAAC;YACpB,iEAAiE;YACjE,MAAM,CAAC,WAAW,CAAC,iBAAiB,EAAE,kBAAkB,CAAC,CAAC;QAC3D,CAAC,CAAC,CAAC;QACH,IAAI,CAAC,EAAE,CAAC,aAAa,EAAE,CAAC,IAAa,EAAE,EAAE;YACxC,gBAAgB,EAAE,CAAC;YACnB,iEAAiE;YACjE,MAAM,CAAC,WAAW,CAAC,gBAAgB,EAAE,iBAAiB,CAAC,CAAC;QACzD,CAAC,CAAC,CAAC;QACH,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,cAAc,EAAE,CAAC,IAAa,EAAE,EAAE;YAC/C,mEAAmE;YACnE,MAAM,CAAC,WAAW,CAAC,kBAAkB,EAAE,iBAAiB,CAAC,CAAC;YAC1D,kBAAkB,EAAE,CAAC;QACtB,CAAC,CAAC,CAAC;QACH,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,aAAa,EAAE,CAAC,IAAa,EAAE,EAAE;YAC9C,mEAAmE;YACnE,MAAM,CAAC,WAAW,CAAC,iBAAiB,EAAE,gBAAgB,CAAC,CAAC;YACxD,iBAAiB,EAAE,CAAC;QACrB,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,KAAK,CAAC,aAAa,GAAG,WAAW,CAAC;QAEvC,MAAM,CAAC,WAAW,CAAC,iBAAiB,EAAE,CAAC,CAAC,CAAC;QACzC,MAAM,CAAC,WAAW,CAAC,gBAAgB,EAAE,CAAC,CAAC,CAAC;QACxC,MAAM,CAAC,WAAW,CAAC,kBAAkB,EAAE,CAAC,CAAC,CAAC;QAC1C,MAAM,CAAC,WAAW,CAAC,iBAAiB,EAAE,CAAC,CAAC,CAAC;IAC1C,CAAC,CAAC,CAAC;AACJ,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,oBAAoB,EAAE,GAAG,EAAE;IACnC,MAAM,EAAE,GAAG,IAAI,aAAa,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC;IAChD,MAAM,MAAM,GAAG,EAAE,CAAC,MAAM,CAAC,QAAQ,EAAE,EAAE,OAAO,EAAE,EAAE,CAAC,MAAM,EAAE,CAAC,CAAC;IAC3D,MAAM,MAAM,GAAG,EAAE,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;IACrC,MAAM,WAAW,GAAG,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC;IAEnC,EAAE,CAAC,mCAAmC,EAAE,GAAG,EAAE;QAC5C,MAAM,QAAQ,GAAG,mBAAmB,CAAC,EAAE,MAAM,EAAE,WAAW,EAAE,CAAC,CAAC,OAAO,CAAC;QACtE,IAAI,iBAAiB,GAAG,CAAC,CAAC;QAC1B,QAAQ,CAAC,YAAY,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,iBAAiB,IAAI,CAAC,CAAC,CAAC,CAAC;QACvD,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC;QAC5B,QAAQ,CAAC,OAAO,GAAG,CAAC,CAAC;QACrB,MAAM,CAAC,KAAK,CAAC,iBAAiB,EAAE,CAAC,CAAC,CAAC;QACnC,QAAQ,CAAC,OAAO,GAAG,EAAE,CAAC;QACtB,MAAM,CAAC,KAAK,CAAC,iBAAiB,EAAE,CAAC,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,yCAAyC,EAAE,GAAG,EAAE;QAClD,MAAM,QAAQ,GAAG,mBAAmB,CAAC,EAAE,MAAM,EAAE,WAAW,EAAE,CAAC,CAAC,OAAO,CAAC;QACtE,IAAI,sBAAsB,GAAG,CAAC,CAAC;QAC/B,QAAQ,CAAC,YAAY,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,sBAAsB,IAAI,CAAC,CAAC,CAAC,CAAC;QAC5D,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,sBAAsB,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAClF,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,iEAAiE,EAAE,GAAG,EAAE;QAC1E,MAAM,QAAQ,GAAG,mBAAmB,CAAC,EAAE,MAAM,EAAE,WAAW,EAAE,CAAC,CAAC,OAAO,CAAC;QACtE,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC;QAC5B,QAAQ,CAAC,YAAY,CAAC,CAAC,GAAG,EAAE;YAC3B,MAAM,IAAI,KAAK,EAAE,CAAC;QACnB,CAAC,CAAC,CAAC;QACH,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,QAAQ,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC;QAC5C,QAAQ,CAAC,YAAY,CAAC,CAAC,GAAG,EAAE,GAAE,CAAC,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,0BAA0B,EAAE,GAAG,EAAE;QACnC,MAAM,QAAQ,GAAG,mBAAmB,CAAC,EAAE,MAAM,EAAE,WAAW,EAAE,CAAC,CAAC,OAAO,CAAC;QACtE,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC;QAC5B,IAAI,sBAAsB,GAAG,KAAK,CAAC;QACnC,MAAM,GAAG,GAAG,QAAQ,CAAC,YAAY,CAAC,CAAC,GAAG,EAAE;YACvC,sBAAsB,GAAG,IAAI,CAAC;QAC/B,CAAC,CAAC,CAAC;QACH,GAAG,EAAE,CAAC;QACN,QAAQ,CAAC,OAAO,GAAG,CAAC,CAAC;QACrB,MAAM,CAAC,KAAK,CAAC,sBAAsB,EAAE,KAAK,CAAC,CAAC;IAC7C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,6DAA6D,EAAE,GAAG,EAAE;QACtE,MAAM,QAAQ,GAAG,mBAAmB,CAAC,EAAE,MAAM,EAAE,WAAW,EAAE,CAAC,CAAC,OAAO,CAAC;QACtE,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC;QAC5B,MAAM,GAAG,GAAG,QAAQ,CAAC,YAAY,CAAC,CAAC,GAAG,EAAE,GAAE,CAAC,CAAC,CAAC;QAC7C,QAAQ,CAAC,OAAO,GAAG,CAAC,CAAC;QACrB,GAAG,EAAE,CAAC;QACN,IAAI,sBAAsB,GAAG,KAAK,CAAC;QACnC,QAAQ,CAAC,YAAY,CAAC,CAAC,GAAG,EAAE;YAC3B,sBAAsB,GAAG,IAAI,CAAC;QAC/B,CAAC,CAAC,CAAC;QACH,GAAG,EAAE,CAAC;QACN,QAAQ,CAAC,OAAO,GAAG,EAAE,CAAC;QACtB,MAAM,CAAC,KAAK,CAAC,sBAAsB,EAAE,IAAI,CAAC,CAAC;IAC5C,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 */\nimport { strict as assert } from \"assert\";\n\nimport { FieldKinds } from \"../../../feature-libraries/index.js\";\nimport { ForestType, SharedTreeFactory } from \"../../../shared-tree/index.js\";\nimport { typeboxValidator } from \"../../../external-utilities/index.js\";\nimport { SchemaBuilder, leaf } from \"../../../domains/index.js\";\nimport { flexTreeWithContent } from \"../../utils.js\";\n// eslint-disable-next-line import/no-internal-modules\nimport { onNextChange } from \"../../../feature-libraries/flex-tree/flexTreeTypes.js\";\n\ndescribe(\"beforeChange/afterChange events\", () => {\n\tconst builder = new SchemaBuilder({\n\t\tscope: \"beforeChange/afterChange events\",\n\t\tlibraries: [leaf.library],\n\t});\n\tconst myInnerNodeSchema = builder.object(\"myInnerNode\", {\n\t\tmyInnerString: SchemaBuilder.required(leaf.string),\n\t});\n\tconst myNodeSchema = builder.object(\"myNode\", {\n\t\tchild: SchemaBuilder.required(myInnerNodeSchema),\n\t\tmyString: SchemaBuilder.required(leaf.string),\n\t\tmyOptionalNumber: SchemaBuilder.optional(leaf.number),\n\t\tmyNumberSequence: SchemaBuilder.sequence(leaf.number),\n\t});\n\tconst schema = builder.intoSchema(SchemaBuilder.field(FieldKinds.required, myNodeSchema));\n\tconst factory = new SharedTreeFactory({\n\t\tjsonValidator: typeboxValidator,\n\t\tforest: ForestType.Reference,\n\t});\n\n\tit(\"fire the expected number of times\", () => {\n\t\tconst root = flexTreeWithContent({\n\t\t\tinitialTree: {\n\t\t\t\tmyString: \"initial string\",\n\t\t\t\tmyOptionalNumber: undefined,\n\t\t\t\tmyNumberSequence: [],\n\t\t\t\tchild: { myInnerString: \"initial string in child\" },\n\t\t\t},\n\t\t\tschema,\n\t\t}).content;\n\n\t\tlet rootBeforeChangeCount = 0;\n\t\tlet rootAfterChangeCount = 0;\n\t\tlet childBeforeChangeCount = 0;\n\t\tlet childAfterChangeCount = 0;\n\n\t\troot.on(\"beforeChange\", (args: unknown) => {\n\t\t\trootBeforeChangeCount++;\n\t\t});\n\t\troot.on(\"afterChange\", (args: unknown) => {\n\t\t\trootAfterChangeCount++;\n\t\t});\n\n\t\tassert.strictEqual(rootBeforeChangeCount, 0);\n\t\tassert.strictEqual(rootAfterChangeCount, 0);\n\n\t\t// Replace existing node - myString; should fire events on the root node.\n\t\troot.myString = \"new string\";\n\n\t\tassert.strictEqual(rootBeforeChangeCount, 1);\n\t\tassert.strictEqual(rootAfterChangeCount, 1);\n\n\t\t// Add node where there was none before - myOptionalNumber; should fire events on the root node.\n\t\troot.myOptionalNumber = 3;\n\n\t\tassert.strictEqual(rootBeforeChangeCount, 2);\n\t\tassert.strictEqual(rootAfterChangeCount, 2);\n\n\t\troot.child.on(\"beforeChange\", (args: unknown) => {\n\t\t\tchildBeforeChangeCount++;\n\t\t});\n\t\troot.child.on(\"afterChange\", (args: unknown) => {\n\t\t\tchildAfterChangeCount++;\n\t\t});\n\n\t\tassert.strictEqual(childBeforeChangeCount, 0);\n\t\tassert.strictEqual(childAfterChangeCount, 0);\n\n\t\t// Replace myInnerString in child; should fire events on the child node and the root node.\n\t\troot.child.myInnerString = \"new string in original child\";\n\n\t\tassert.strictEqual(rootBeforeChangeCount, 3);\n\t\tassert.strictEqual(rootAfterChangeCount, 3);\n\t\tassert.strictEqual(childBeforeChangeCount, 1);\n\t\tassert.strictEqual(childAfterChangeCount, 1);\n\n\t\t// Replace the whole child; should fire events on the root node.\n\t\t// TODO: update to `root.child = <something>;` once assignment to struct nodes is implemented in EditableTree2\n\t\troot.boxedChild.content = {\n\t\t\tmyInnerString: \"initial string in new child\",\n\t\t};\n\n\t\tassert.strictEqual(rootBeforeChangeCount, 4);\n\t\tassert.strictEqual(rootAfterChangeCount, 4);\n\t\t// No events should have fired on the old child node.\n\t\tassert.strictEqual(childBeforeChangeCount, 1);\n\t\tassert.strictEqual(childAfterChangeCount, 1);\n\n\t\t// Replace myInnerString in new child node; should fire events on the root node (but not on the old child node)\n\t\troot.child.myInnerString = \"new string in new child\";\n\n\t\tassert.strictEqual(rootBeforeChangeCount, 5);\n\t\tassert.strictEqual(rootAfterChangeCount, 5);\n\t\t// No events should have fired on the old child node.\n\t\tassert.strictEqual(childBeforeChangeCount, 1);\n\t\tassert.strictEqual(childAfterChangeCount, 1);\n\n\t\t// Remove node - myOptionalNumber; should fire events on the root node\n\t\troot.myOptionalNumber = undefined;\n\n\t\tassert.strictEqual(rootBeforeChangeCount, 6);\n\t\tassert.strictEqual(rootAfterChangeCount, 6);\n\n\t\t// Insert nodes into a sequence field - myNumberSequence; should fire events on the root node\n\t\t// NOTE: events will fire for each node individually\n\t\troot.myNumberSequence.insertAtStart([0, 1, 2, 3, 4]);\n\n\t\tassert.strictEqual(rootBeforeChangeCount, 11);\n\t\tassert.strictEqual(rootAfterChangeCount, 11);\n\n\t\t// Remove nodes into a sequence field - myNumberSequence; should fire events on the root node\n\t\t// NOTE: events will fire for each node individually\n\t\troot.myNumberSequence.removeRange(3);\n\n\t\tassert.strictEqual(rootBeforeChangeCount, 13);\n\t\tassert.strictEqual(rootAfterChangeCount, 13);\n\n\t\t// Move nodes in a sequence field - myNumberSequence; should fire events on the root node\n\t\t// NOTE: events will fire for each node individually. Also this is a special case where the events are fired twice:\n\t\t// once when detaching the nodes from the source location, and again when attaching them at the target location.\n\t\troot.myNumberSequence.moveRangeToEnd(0, 2);\n\n\t\tassert.strictEqual(rootBeforeChangeCount, 17);\n\t\tassert.strictEqual(rootAfterChangeCount, 17);\n\t});\n\n\tit(\"fire in the expected order and always together\", () => {\n\t\tconst root = flexTreeWithContent({\n\t\t\tinitialTree: {\n\t\t\t\tmyString: \"initial string\",\n\t\t\t\tmyOptionalNumber: undefined,\n\t\t\t\tmyNumberSequence: [],\n\t\t\t\tchild: { myInnerString: \"initial string in child\" },\n\t\t\t},\n\t\t\tschema,\n\t\t}).content;\n\n\t\tlet beforeCounter = 0;\n\t\tlet afterCounter = 0;\n\n\t\troot.on(\"beforeChange\", (args: unknown) => {\n\t\t\tbeforeCounter++;\n\t\t\tassert.strictEqual(beforeCounter, afterCounter + 1, \"beforeChange fired out of order\");\n\t\t});\n\t\troot.on(\"afterChange\", (args: unknown) => {\n\t\t\tafterCounter++;\n\t\t\tassert.strictEqual(afterCounter, beforeCounter, \"afterChange fired out of order\");\n\t\t});\n\n\t\t// Make updates of different kinds to the tree\n\t\t// Replace an existing node\n\t\troot.myString = \"new string\";\n\t\t// Add a node where there was none before\n\t\troot.myOptionalNumber = 3;\n\t\t// Remove a node\n\t\troot.myOptionalNumber = undefined;\n\t\t// Insert nodes in a sequence\n\t\t// NOTE: events will fire for each inserted node (so 5 times)\n\t\troot.myNumberSequence.insertAtStart([0, 1, 2, 3, 4]);\n\t\t// Remove nodes from a sequence\n\t\t// NOTE: events will fire for each removed node (so 2 times)\n\t\troot.myNumberSequence.removeRange(3);\n\t\t// Move nodes within a sequence\n\t\t// NOTE: events will fire for each moved node (so 2 time)\n\t\t// NOTE: this is a special case where the beforeChange/afterChange events are fired twice for each node: once when\n\t\t// detaching it from the source location, and again when attaching it at the target location.\n\t\troot.myNumberSequence.moveRangeToEnd(0, 2);\n\t\t// Other miscellaneous updates\n\t\troot.child.myInnerString = \"new string in child\";\n\t\t// TODO: update to `root.child = <something>;` once assignment to struct nodes is implemented in EditableTree2\n\t\troot.boxedChild.content = {\n\t\t\tmyInnerString: \"original string in new child\",\n\t\t};\n\t\troot.child.myInnerString = \"new string in new child\";\n\n\t\t// Check the number of events fired is correct (otherwise the assertions in the listeners might not have ran)\n\t\tassert.strictEqual(beforeCounter, 17);\n\t\tassert.strictEqual(afterCounter, 17);\n\t});\n\n\tit(\"event argument contains the expected node\", () => {\n\t\tconst root = flexTreeWithContent({\n\t\t\tinitialTree: {\n\t\t\t\tmyString: \"initial string\",\n\t\t\t\tmyOptionalNumber: undefined,\n\t\t\t\tmyNumberSequence: [],\n\t\t\t\tchild: { myInnerString: \"initial string in child\" },\n\t\t\t},\n\t\t\tschema,\n\t\t}).content;\n\n\t\tlet rootBeforeCounter = 0;\n\t\tlet rootAfterCounter = 0;\n\t\tlet childBeforeCounter = 0;\n\t\tlet childAfterCounter = 0;\n\n\t\t// Listeners to validate the root node\n\t\troot.on(\"beforeChange\", (event: unknown) => {\n\t\t\tassert.strictEqual((event as any).target, root);\n\t\t\trootBeforeCounter++;\n\t\t});\n\t\troot.on(\"afterChange\", (event: unknown) => {\n\t\t\tassert.strictEqual((event as any).target, root);\n\t\t\trootAfterCounter++;\n\t\t});\n\t\t// Listeners to validate the child node\n\t\troot.child.on(\"beforeChange\", (event: unknown) => {\n\t\t\tassert.strictEqual((event as any).target, root.child);\n\t\t\tchildBeforeCounter++;\n\t\t});\n\t\troot.child.on(\"afterChange\", (event: unknown) => {\n\t\t\tassert.strictEqual((event as any).target, root.child);\n\t\t\tchildAfterCounter++;\n\t\t});\n\n\t\t// Validate changes to fields directly on the node that has the listeners\n\t\t// Replace a node\n\t\troot.myString = \"new string\";\n\t\t// Add a node where there was none before\n\t\troot.myOptionalNumber = 3;\n\t\t// Remove a node\n\t\troot.myOptionalNumber = undefined;\n\t\t// Insert nodes in a sequence\n\t\t// NOTE: events will fire for each inserted node (so 5 times)\n\t\troot.myNumberSequence.insertAtStart([0, 1, 2, 3, 4]);\n\t\t// Remove nodes from a sequence\n\t\t// NOTE: events will fire for each removed node (so 2 times)\n\t\troot.myNumberSequence.removeRange(3);\n\t\t// Move nodes within a sequence\n\t\t// NOTE: events will fire for each moved node (so 2 time)\n\t\t// NOTE: this is a special case where the beforeChange/afterChange events are fired twice for each node: once when\n\t\t// detaching it from the source location, and again when attaching it at the target location.\n\t\troot.myNumberSequence.moveRangeToEnd(0, 2);\n\n\t\t// Make sure the listeners fired (otherwise assertions might not have executed)\n\t\tassert.strictEqual(rootBeforeCounter, 14);\n\t\tassert.strictEqual(rootAfterCounter, 14);\n\n\t\t// Validate changes to fields of descendant nodes\n\t\t// The listeners on the root node should still see the root node (not the child node, i.e., the one that changed)\n\t\t// as the argument passed to them.\n\n\t\troot.child.myInnerString = \"new string in child\";\n\n\t\t// Make sure the listeners fired (otherwise assertions might not have executed)\n\t\tassert.strictEqual(rootBeforeCounter, 15);\n\t\tassert.strictEqual(rootAfterCounter, 15);\n\t\tassert.strictEqual(childBeforeCounter, 1);\n\t\tassert.strictEqual(childAfterCounter, 1);\n\t});\n\n\tit(\"listeners can be removed successfully\", () => {\n\t\tconst root = flexTreeWithContent({\n\t\t\tinitialTree: {\n\t\t\t\tmyString: \"initial string\",\n\t\t\t\tmyOptionalNumber: undefined,\n\t\t\t\tmyNumberSequence: [],\n\t\t\t\tchild: { myInnerString: \"initial string in child\" },\n\t\t\t},\n\t\t\tschema,\n\t\t}).content;\n\n\t\tlet beforeHasFired = false;\n\t\tlet afterHasFired = false;\n\n\t\tconst unsubscribeBeforeChange = root.on(\"beforeChange\", (args: unknown) => {\n\t\t\tassert.strictEqual(\n\t\t\t\tbeforeHasFired,\n\t\t\t\tfalse,\n\t\t\t\t\"beforeChange listener ran after being removed\",\n\t\t\t);\n\t\t\tbeforeHasFired = true;\n\t\t});\n\t\tconst unsubscribeAfterChange = root.on(\"afterChange\", (args: unknown) => {\n\t\t\tassert.strictEqual(\n\t\t\t\tafterHasFired,\n\t\t\t\tfalse,\n\t\t\t\t\"beforeChange listener ran after being removed\",\n\t\t\t);\n\t\t\tafterHasFired = true;\n\t\t});\n\n\t\t// Make a change that causes the listeners to fire\n\t\troot.myString = \"new string 1\";\n\n\t\t// Confirm listeners fired once\n\t\tassert.strictEqual(beforeHasFired, true);\n\t\tassert.strictEqual(afterHasFired, true);\n\n\t\t// Remove listeners\n\t\tunsubscribeAfterChange();\n\t\tunsubscribeBeforeChange();\n\n\t\t// Make another change; if the listeners fire again, they'll cause an assertion failure\n\t\troot.myString = \"new string 2\";\n\t});\n\n\tit(\"tree is in correct state when events fire - primitive node deletions\", () => {\n\t\tconst initialNumber = 20;\n\t\tconst root = flexTreeWithContent({\n\t\t\tinitialTree: {\n\t\t\t\tmyString: \"initial string\",\n\t\t\t\tmyOptionalNumber: initialNumber,\n\t\t\t\tmyNumberSequence: [],\n\t\t\t\tchild: { myInnerString: \"initial string in child\" },\n\t\t\t},\n\t\t\tschema,\n\t\t}).content;\n\n\t\tlet totalListenerCalls = 0;\n\n\t\troot.on(\"beforeChange\", (args: unknown) => {\n\t\t\tassert.strictEqual(root.myOptionalNumber, initialNumber);\n\t\t\ttotalListenerCalls++;\n\t\t});\n\t\troot.on(\"afterChange\", (args: unknown) => {\n\t\t\tassert.strictEqual(root.myOptionalNumber, undefined);\n\t\t\ttotalListenerCalls++;\n\t\t});\n\n\t\troot.myOptionalNumber = undefined;\n\t\tassert.strictEqual(totalListenerCalls, 2);\n\t});\n\n\tit(\"tree is in correct state when events fire - primitive node additions\", () => {\n\t\tconst root = flexTreeWithContent({\n\t\t\tinitialTree: {\n\t\t\t\tmyString: \"initial string\",\n\t\t\t\tmyOptionalNumber: undefined,\n\t\t\t\tmyNumberSequence: [],\n\t\t\t\tchild: { myInnerString: \"initial string in child\" },\n\t\t\t},\n\t\t\tschema,\n\t\t}).content;\n\n\t\tconst newNumber = 20;\n\n\t\tlet totalListenerCalls = 0;\n\n\t\troot.on(\"beforeChange\", (args: unknown) => {\n\t\t\tassert.strictEqual(root.myOptionalNumber, undefined);\n\t\t\ttotalListenerCalls++;\n\t\t});\n\t\troot.on(\"afterChange\", (args: unknown) => {\n\t\t\tassert.strictEqual(root.myOptionalNumber, newNumber);\n\t\t\ttotalListenerCalls++;\n\t\t});\n\n\t\troot.myOptionalNumber = newNumber;\n\t\tassert.strictEqual(totalListenerCalls, 2);\n\t});\n\n\tit(\"tree is in correct state when events fire - primitive node replacements\", () => {\n\t\tconst root = flexTreeWithContent({\n\t\t\tinitialTree: {\n\t\t\t\tmyString: \"initial string\",\n\t\t\t\tmyOptionalNumber: undefined,\n\t\t\t\tmyNumberSequence: [],\n\t\t\t\tchild: { myInnerString: \"initial string in child\" },\n\t\t\t},\n\t\t\tschema,\n\t\t}).content;\n\t\tlet totalListenerCalls = 0;\n\t\tconst newString = \"John\";\n\n\t\troot.on(\"beforeChange\", (args: unknown) => {\n\t\t\tassert.strictEqual(root.myString, \"initial string\");\n\t\t\ttotalListenerCalls++;\n\t\t});\n\t\troot.on(\"afterChange\", (args: unknown) => {\n\t\t\tassert.strictEqual(root.myString, newString);\n\t\t\ttotalListenerCalls++;\n\t\t});\n\n\t\troot.myString = newString;\n\t\tassert.strictEqual(totalListenerCalls, 2);\n\t});\n\n\tit(\"tree is in correct state when events fire - node inserts to sequence fields\", () => {\n\t\tconst root = flexTreeWithContent({\n\t\t\tinitialTree: {\n\t\t\t\tmyString: \"initial string\",\n\t\t\t\tmyOptionalNumber: undefined,\n\t\t\t\tmyNumberSequence: [],\n\t\t\t\tchild: { myInnerString: \"initial string in child\" },\n\t\t\t},\n\t\t\tschema,\n\t\t}).content;\n\n\t\tlet totalListenerCalls = 0;\n\n\t\troot.on(\"beforeChange\", (args: unknown) => {\n\t\t\ttotalListenerCalls++;\n\t\t\tswitch (totalListenerCalls) {\n\t\t\t\tcase 1: {\n\t\t\t\t\t// Before inserting the first node\n\t\t\t\t\tassert.deepEqual([...root.myNumberSequence], []);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tcase 3: {\n\t\t\t\t\t// Before inserting the second node\n\t\t\t\t\tassert.deepEqual([...root.myNumberSequence], [0]);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tcase 5: {\n\t\t\t\t\t// Before inserting the third node\n\t\t\t\t\tassert.deepEqual([...root.myNumberSequence], [0, 1]);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t// No default\n\t\t\t}\n\t\t});\n\t\troot.on(\"afterChange\", (args: unknown) => {\n\t\t\ttotalListenerCalls++;\n\t\t\tswitch (totalListenerCalls) {\n\t\t\t\tcase 2: {\n\t\t\t\t\t// After inserting the first node\n\t\t\t\t\tassert.deepEqual([...root.myNumberSequence], [0]);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tcase 4: {\n\t\t\t\t\t// After inserting the second node\n\t\t\t\t\tassert.deepEqual([...root.myNumberSequence], [0, 1]);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tcase 6: {\n\t\t\t\t\t// After inserting the third node\n\t\t\t\t\tassert.deepEqual([...root.myNumberSequence], [0, 1, 2]);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t// No default\n\t\t\t}\n\t\t});\n\n\t\troot.myNumberSequence.insertAtStart([0, 1, 2]);\n\t\tassert.strictEqual(totalListenerCalls, 6); // 3 inserted nodes * 2 events each\n\t});\n\n\tit(\"tree is in correct state when events fire - node removals from sequence fields\", () => {\n\t\tconst root = flexTreeWithContent({\n\t\t\tinitialTree: {\n\t\t\t\tmyString: \"initial string\",\n\t\t\t\tmyOptionalNumber: undefined,\n\t\t\t\tmyNumberSequence: [0, 1, 2, 3, 4],\n\t\t\t\tchild: { myInnerString: \"initial string in child\" },\n\t\t\t},\n\t\t\tschema,\n\t\t}).content;\n\n\t\tlet totalListenerCalls = 0;\n\n\t\troot.on(\"beforeChange\", (args: unknown) => {\n\t\t\ttotalListenerCalls++;\n\t\t\tif (totalListenerCalls === 1) {\n\t\t\t\t// Before removing the first node\n\t\t\t\tassert.deepEqual([...root.myNumberSequence], [0, 1, 2, 3, 4]);\n\t\t\t} else if (totalListenerCalls === 3) {\n\t\t\t\t// Before removing the second node\n\t\t\t\tassert.deepEqual([...root.myNumberSequence], [0, 2, 3, 4]);\n\t\t\t}\n\t\t});\n\t\troot.on(\"afterChange\", (args: unknown) => {\n\t\t\ttotalListenerCalls++;\n\t\t\tif (totalListenerCalls === 2) {\n\t\t\t\t// After removing the first node\n\t\t\t\tassert.deepEqual([...root.myNumberSequence], [0, 2, 3, 4]);\n\t\t\t} else if (totalListenerCalls === 4) {\n\t\t\t\t// After removing the second node\n\t\t\t\tassert.deepEqual([...root.myNumberSequence], [0, 3, 4]);\n\t\t\t}\n\t\t});\n\n\t\troot.myNumberSequence.removeRange(1, 3);\n\t\tassert.strictEqual(totalListenerCalls, 4); // 2 removed nodes * 2 events each\n\t});\n\n\tit(\"tree is in correct state when events fire - node moves in sequence fields\", () => {\n\t\tconst root = flexTreeWithContent({\n\t\t\tinitialTree: {\n\t\t\t\tmyString: \"initial string\",\n\t\t\t\tmyOptionalNumber: undefined,\n\t\t\t\tmyNumberSequence: [0, 1, 2],\n\t\t\t\tchild: { myInnerString: \"initial string in child\" },\n\t\t\t},\n\t\t\tschema,\n\t\t}).content;\n\n\t\tlet totalListenerCalls = 0;\n\n\t\troot.on(\"beforeChange\", (args: unknown) => {\n\t\t\ttotalListenerCalls++;\n\t\t\tswitch (totalListenerCalls) {\n\t\t\t\tcase 1: {\n\t\t\t\t\t// Before detaching the first node\n\t\t\t\t\tassert.deepEqual([...root.myNumberSequence], [0, 1, 2]);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tcase 3: {\n\t\t\t\t\t// Before detaching the second node\n\t\t\t\t\tassert.deepEqual([...root.myNumberSequence], [1, 2]);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tcase 5: {\n\t\t\t\t\t// Before re-attaching the first node\n\t\t\t\t\tassert.deepEqual([...root.myNumberSequence], [2]);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tcase 7: {\n\t\t\t\t\t// Before re-attaching the second node\n\t\t\t\t\tassert.deepEqual([...root.myNumberSequence], [2, 0]);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t// No default\n\t\t\t}\n\t\t});\n\t\troot.on(\"afterChange\", (args: unknown) => {\n\t\t\ttotalListenerCalls++;\n\t\t\tswitch (totalListenerCalls) {\n\t\t\t\tcase 2: {\n\t\t\t\t\t// After detaching the first node\n\t\t\t\t\tassert.deepEqual([...root.myNumberSequence], [1, 2]);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tcase 4: {\n\t\t\t\t\t// After detaching the second node\n\t\t\t\t\tassert.deepEqual([...root.myNumberSequence], [2]);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tcase 6: {\n\t\t\t\t\t// After re-attaching the first node\n\t\t\t\t\tassert.deepEqual([...root.myNumberSequence], [2, 0]);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tcase 8: {\n\t\t\t\t\t// After re-attaching the second node\n\t\t\t\t\tassert.deepEqual([...root.myNumberSequence], [2, 0, 1]);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t// No default\n\t\t\t}\n\t\t});\n\n\t\troot.myNumberSequence.moveRangeToEnd(0, 2);\n\t\tassert.strictEqual(totalListenerCalls, 8); // 2 moved nodes * 2 events each * 2 times fired (detach + attach)\n\t});\n\n\tit(\"not emitted by nodes when they are replaced\", () => {\n\t\tconst root = flexTreeWithContent({\n\t\t\tinitialTree: {\n\t\t\t\tmyString: \"initial string\",\n\t\t\t\tmyOptionalNumber: undefined,\n\t\t\t\tmyNumberSequence: [],\n\t\t\t\tchild: { myInnerString: \"initial string in child\" },\n\t\t\t},\n\t\t\tschema,\n\t\t}).content;\n\n\t\tlet beforeCounter = 0;\n\t\tlet afterCounter = 0;\n\t\troot.child.on(\"beforeChange\", (args: unknown) => {\n\t\t\tbeforeCounter++;\n\t\t});\n\t\troot.child.on(\"afterChange\", (args: unknown) => {\n\t\t\tafterCounter++;\n\t\t});\n\n\t\t// TODO: update to `root.child = <something>;` once assignment to struct nodes is implemented in EditableTree2\n\t\troot.boxedChild.content = { myInnerString: \"something\" };\n\n\t\t// Events shouldn't have fired on the original child node\n\t\tassert.strictEqual(beforeCounter, 0);\n\t\tassert.strictEqual(afterCounter, 0);\n\t});\n\n\tit(\"bubble up from the affected node to the root\", () => {\n\t\tconst root = flexTreeWithContent({\n\t\t\tinitialTree: {\n\t\t\t\tmyString: \"initial string\",\n\t\t\t\tmyOptionalNumber: undefined,\n\t\t\t\tmyNumberSequence: [],\n\t\t\t\tchild: { myInnerString: \"initial string in child\" },\n\t\t\t},\n\t\t\tschema,\n\t\t}).content;\n\n\t\tlet rootBeforeCounter = 0;\n\t\tlet rootAfterCounter = 0;\n\t\tlet childBeforeCounter = 0;\n\t\tlet childAfterCounter = 0;\n\n\t\troot.on(\"beforeChange\", (args: unknown) => {\n\t\t\trootBeforeCounter++;\n\t\t\t// Counts should match only after root counter has been increased\n\t\t\tassert.strictEqual(rootBeforeCounter, childBeforeCounter);\n\t\t});\n\t\troot.on(\"afterChange\", (args: unknown) => {\n\t\t\trootAfterCounter++;\n\t\t\t// Counts should match only after root counter has been increased\n\t\t\tassert.strictEqual(rootAfterCounter, childAfterCounter);\n\t\t});\n\t\troot.child.on(\"beforeChange\", (args: unknown) => {\n\t\t\t// Counts should match only before child counter has been increased\n\t\t\tassert.strictEqual(childBeforeCounter, rootBeforeCounter);\n\t\t\tchildBeforeCounter++;\n\t\t});\n\t\troot.child.on(\"afterChange\", (args: unknown) => {\n\t\t\t// Counts should match only before child counter has been increased\n\t\t\tassert.strictEqual(childAfterCounter, rootAfterCounter);\n\t\t\tchildAfterCounter++;\n\t\t});\n\n\t\troot.child.myInnerString = \"new value\";\n\n\t\tassert.strictEqual(rootBeforeCounter, 1);\n\t\tassert.strictEqual(rootAfterCounter, 1);\n\t\tassert.strictEqual(childBeforeCounter, 1);\n\t\tassert.strictEqual(childAfterCounter, 1);\n\t});\n});\n\ndescribe(\"onNextChange event\", () => {\n\tconst sb = new SchemaBuilder({ scope: \"test\" });\n\tconst object = sb.object(\"object\", { content: sb.number });\n\tconst schema = sb.intoSchema(object);\n\tconst initialTree = { content: 3 };\n\n\tit(\"fires exactly once after a change\", () => {\n\t\tconst editNode = flexTreeWithContent({ schema, initialTree }).content;\n\t\tlet onNextChangeCount = 0;\n\t\teditNode[onNextChange](() => (onNextChangeCount += 1));\n\t\tassert(editNode.is(object));\n\t\teditNode.content = 7;\n\t\tassert.equal(onNextChangeCount, 1);\n\t\teditNode.content = 12;\n\t\tassert.equal(onNextChangeCount, 1);\n\t});\n\n\tit(\"can have at most one listener at a time\", () => {\n\t\tconst editNode = flexTreeWithContent({ schema, initialTree }).content;\n\t\tlet onNextChangeEventCount = 0;\n\t\teditNode[onNextChange](() => (onNextChangeEventCount += 1));\n\t\tassert.throws(() => editNode[onNextChange](() => (onNextChangeEventCount += 1)));\n\t});\n\n\tit(\"can be subscribed to again after throwing and catching an error\", () => {\n\t\tconst editNode = flexTreeWithContent({ schema, initialTree }).content;\n\t\tassert(editNode.is(object));\n\t\teditNode[onNextChange](() => {\n\t\t\tthrow new Error();\n\t\t});\n\t\tassert.throws(() => (editNode.content = 7));\n\t\teditNode[onNextChange](() => {});\n\t});\n\n\tit(\"can be unsubscribed from\", () => {\n\t\tconst editNode = flexTreeWithContent({ schema, initialTree }).content;\n\t\tassert(editNode.is(object));\n\t\tlet onNextChangeEventFired = false;\n\t\tconst off = editNode[onNextChange](() => {\n\t\t\tonNextChangeEventFired = true;\n\t\t});\n\t\toff();\n\t\teditNode.content = 7;\n\t\tassert.equal(onNextChangeEventFired, false);\n\t});\n\n\tit(\"unsubscription has no effect if the event has already fired\", () => {\n\t\tconst editNode = flexTreeWithContent({ schema, initialTree }).content;\n\t\tassert(editNode.is(object));\n\t\tconst off = editNode[onNextChange](() => {});\n\t\teditNode.content = 7;\n\t\toff();\n\t\tlet onNextChangeEventFired = false;\n\t\teditNode[onNextChange](() => {\n\t\t\tonNextChangeEventFired = true;\n\t\t});\n\t\toff();\n\t\teditNode.content = 13;\n\t\tassert.equal(onNextChangeEventFired, true);\n\t});\n});\n"]}

package/lib/test/feature-libraries/flex-tree/lazyField.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=lazyField.spec.d.ts.map

package/lib/test/feature-libraries/flex-tree/lazyField.spec.d.ts.map DELETED Viewed

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

package/lib/test/feature-libraries/flex-tree/lazyField.spec.js DELETED Viewed

@@ -1,326 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-/* eslint-disable import/no-internal-modules */
-import { strict as assert } from "assert";
-import { validateAssertionError } from "@fluidframework/test-runtime-utils";
-import { Any, FieldKinds, cursorForJsonableTreeNode, cursorForJsonableTreeField, FlexFieldSchema, } from "../../../feature-libraries/index.js";
-import { rootFieldKey } from "../../../core/index.js";
-import { forestWithContent, flexTreeViewWithContent } from "../../utils.js";
-import { leaf, leaf as leafDomain, SchemaBuilder } from "../../../domains/index.js";
-import { brand } from "../../../util/index.js";
-import { LazyField, LazyOptionalField, LazySequence, LazyValueField, } from "../../../feature-libraries/flex-tree/lazyField.js";
-import { getReadonlyContext, initializeCursor, readonlyTreeWithContent, rootFieldAnchor, } from "./utils.js";
-const detachedField = brand("detached");
-const detachedFieldAnchor = { parent: undefined, fieldKey: detachedField };
-/**
- * Test {@link LazyField} implementation.
- */
-class TestLazyField extends LazyField {
-}
-describe("LazyField", () => {
-    it("LazyField implementations do not allow edits to detached trees", () => {
-        const builder = new SchemaBuilder({ scope: "lazyTree" });
-        builder.object("empty", {});
-        const schema = builder.intoSchema(FlexFieldSchema.create(FieldKinds.optional, [Any]));
-        const forest = forestWithContent({ schema, initialTree: {} });
-        const context = getReadonlyContext(forest, schema);
-        const cursor = initializeCursor(context, detachedFieldAnchor);
-        const sequenceField = new LazySequence(context, FlexFieldSchema.create(FieldKinds.sequence, [Any]), cursor, detachedFieldAnchor);
-        const optionalField = new LazyOptionalField(context, FlexFieldSchema.create(FieldKinds.optional, [Any]), cursor, detachedFieldAnchor);
-        const valueField = new LazyValueField(context, FlexFieldSchema.create(FieldKinds.required, [Any]), cursor, detachedFieldAnchor);
-        cursor.free();
-        assert.throws(() => sequenceField.insertAt(0, [1]), (e) => validateAssertionError(e, /only allowed on fields with TreeStatus.InDocument status/));
-        assert.throws(() => (optionalField.content = undefined), (e) => validateAssertionError(e, /only allowed on fields with TreeStatus.InDocument status/));
-        assert.throws(() => (valueField.content = {}), (e) => validateAssertionError(e, /only allowed on fields with TreeStatus.InDocument status/));
-    });
-    it("is", () => {
-        // #region Tree and schema initialization
-        const builder = new SchemaBuilder({ scope: "test", libraries: [leafDomain.library] });
-        const rootSchema = FlexFieldSchema.create(FieldKinds.optional, [
-            builder.object("object", {}),
-        ]);
-        const schema = builder.intoSchema(rootSchema);
-        // Note: this tree initialization is strictly to enable construction of the lazy field.
-        // The test cases below are strictly in terms of the schema of the created fields.
-        const { context, cursor } = readonlyTreeWithContent({ schema, initialTree: {} });
-        // #endregion
-        // #region OptionalField<Any>
-        const anyOptionalField = new TestLazyField(context, FlexFieldSchema.create(FieldKinds.optional, [Any]), cursor, detachedFieldAnchor);
-        assert(anyOptionalField.is(FlexFieldSchema.create(FieldKinds.optional, [Any])));
-        assert(!anyOptionalField.is(FlexFieldSchema.create(FieldKinds.optional, [])));
-        assert(!anyOptionalField.is(FlexFieldSchema.create(FieldKinds.optional, [leafDomain.boolean])));
-        assert(!anyOptionalField.is(FlexFieldSchema.create(FieldKinds.required, [])));
-        assert(!anyOptionalField.is(FlexFieldSchema.create(FieldKinds.required, [Any])));
-        assert(!anyOptionalField.is(FlexFieldSchema.create(FieldKinds.required, [leafDomain.boolean])));
-        assert(!anyOptionalField.is(FlexFieldSchema.create(FieldKinds.sequence, [])));
-        assert(!anyOptionalField.is(FlexFieldSchema.create(FieldKinds.sequence, [Any])));
-        assert(!anyOptionalField.is(FlexFieldSchema.create(FieldKinds.sequence, [leafDomain.boolean])));
-        // #endregion
-        // #region OptionalField<Primitive>
-        const booleanOptionalField = new LazyOptionalField(context, FlexFieldSchema.create(FieldKinds.optional, [leafDomain.boolean]), cursor, detachedFieldAnchor);
-        assert(booleanOptionalField.is(FlexFieldSchema.create(FieldKinds.optional, [leafDomain.boolean])));
-        assert(!booleanOptionalField.is(FlexFieldSchema.create(FieldKinds.optional, [Any])));
-        assert(!booleanOptionalField.is(FlexFieldSchema.create(FieldKinds.optional, [leafDomain.number])));
-        assert(!booleanOptionalField.is(FlexFieldSchema.create(FieldKinds.required, [])));
-        assert(!booleanOptionalField.is(FlexFieldSchema.create(FieldKinds.required, [Any])));
-        assert(!booleanOptionalField.is(FlexFieldSchema.create(FieldKinds.required, [leafDomain.boolean])));
-        assert(!booleanOptionalField.is(FlexFieldSchema.create(FieldKinds.required, [leafDomain.number])));
-        assert(!booleanOptionalField.is(FlexFieldSchema.create(FieldKinds.sequence, [])));
-        assert(!booleanOptionalField.is(FlexFieldSchema.create(FieldKinds.sequence, [Any])));
-        assert(!booleanOptionalField.is(FlexFieldSchema.create(FieldKinds.sequence, [leafDomain.boolean])));
-        assert(!booleanOptionalField.is(FlexFieldSchema.create(FieldKinds.sequence, [leafDomain.number])));
-        assert(!booleanOptionalField.is(FlexFieldSchema.create(FieldKinds.optional, [])));
-        // #endregion
-    });
-    it("parent", () => {
-        const builder = new SchemaBuilder({ scope: "test", libraries: [leafDomain.library] });
-        const struct = builder.object("object", {
-            foo: FlexFieldSchema.create(FieldKinds.optional, leafDomain.primitives),
-        });
-        const rootSchema = FlexFieldSchema.create(FieldKinds.optional, [struct]);
-        const schema = builder.intoSchema(rootSchema);
-        const { context, cursor } = readonlyTreeWithContent({
-            schema,
-            initialTree: {
-                foo: "Hello world",
-            },
-        });
-        const rootField = new TestLazyField(context, rootSchema, cursor, rootFieldAnchor);
-        assert.equal(rootField.parent, undefined);
-        const parentPath = {
-            parent: undefined,
-            parentField: rootFieldKey,
-            parentIndex: 0,
-        };
-        const parentAnchor = context.forest.anchors.track(parentPath);
-        // Move cursor down to leaf field
-        cursor.enterNode(0);
-        cursor.enterField(brand("foo"));
-        const leafField = new TestLazyField(context, FlexFieldSchema.create(FieldKinds.optional, leafDomain.primitives), cursor, {
-            parent: parentAnchor,
-            fieldKey: brand("foo"),
-        });
-        assert.equal(leafField.parent, rootField.boxedAt(0));
-    });
-});
-describe("LazyOptionalField", () => {
-    const builder = new SchemaBuilder({ scope: "test", libraries: [leafDomain.library] });
-    const rootSchema = FlexFieldSchema.create(FieldKinds.optional, [leafDomain.number]);
-    const schema = builder.intoSchema(rootSchema);
-    describe("Field with value", () => {
-        const { context, cursor } = readonlyTreeWithContent({ schema, initialTree: 42 });
-        const field = new LazyOptionalField(context, rootSchema, cursor, rootFieldAnchor);
-        it("atIndex", () => {
-            assert.equal(field.atIndex(0), 42);
-        });
-        it("boxedAt", () => {
-            const boxedResult = field.boxedAt(0) ?? assert.fail();
-            assert.equal(boxedResult.schema, leafDomain.number);
-            assert.equal(boxedResult.value, 42);
-        });
-        it("length", () => {
-            assert.equal(field.length, 1);
-        });
-        it("map", () => {
-            assert.deepEqual(field.map((value) => value), [42]);
-        });
-        it("mapBoxed", () => {
-            const mapResult = field.mapBoxed((value) => value);
-            assert.equal(mapResult.length, 1);
-            assert.equal(mapResult[0].value, 42);
-        });
-    });
-    describe("Field without value", () => {
-        const { context, cursor } = readonlyTreeWithContent({
-            schema,
-            initialTree: undefined,
-        });
-        const field = new LazyOptionalField(context, rootSchema, cursor, rootFieldAnchor);
-        it("atIndex", () => {
-            // Invalid to request the value if there isn't one.
-            assert.throws(() => field.atIndex(0));
-        });
-        it("boxedAt", () => {
-            assert.equal(field.boxedAt(0), undefined);
-        });
-        it("length", () => {
-            assert.equal(field.length, 0);
-        });
-        it("map", () => {
-            assert.deepEqual(field.map((value) => value), []);
-        });
-        it("mapBoxed", () => {
-            assert.deepEqual(field.mapBoxed((value) => value), []);
-        });
-    });
-    it("content", () => {
-        const view = flexTreeViewWithContent({
-            schema,
-            initialTree: 5,
-        });
-        assert.equal(view.flexTree.content, 5);
-        view.flexTree.content = 6;
-        assert.equal(view.flexTree.content, 6);
-        view.flexTree.content = undefined;
-        assert.equal(view.flexTree.content, undefined);
-        view.flexTree.content = cursorForJsonableTreeNode({
-            type: leaf.string.name,
-            value: 7,
-        });
-        assert.equal(view.flexTree.content, 7);
-    });
-});
-describe("LazyValueField", () => {
-    const builder = new SchemaBuilder({ scope: "test", libraries: [leafDomain.library] });
-    const rootSchema = FlexFieldSchema.create(FieldKinds.required, [leafDomain.string]);
-    const schema = builder.intoSchema(rootSchema);
-    const initialTree = "Hello world";
-    const { context, cursor } = readonlyTreeWithContent({ schema, initialTree });
-    const field = new LazyValueField(context, rootSchema, cursor, rootFieldAnchor);
-    it("atIndex", () => {
-        assert.equal(field.atIndex(0), initialTree);
-    });
-    it("boxedAt", () => {
-        const boxedResult = field.boxedAt(0) ?? assert.fail();
-        assert.equal(boxedResult.schema, leafDomain.string);
-        assert.equal(boxedResult.value, initialTree);
-    });
-    it("length", () => {
-        assert.equal(field.length, 1);
-    });
-    it("map", () => {
-        assert.deepEqual(field.map((value) => value), [initialTree]);
-    });
-    it("mapBoxed", () => {
-        const mapResult = field.mapBoxed((value) => value);
-        assert.equal(mapResult.length, 1);
-        assert.equal(mapResult[0].value, initialTree);
-    });
-    it("content", () => {
-        const view = flexTreeViewWithContent({
-            schema,
-            initialTree: "X",
-        });
-        assert.equal(view.flexTree.content, "X");
-        view.flexTree.content = "Y";
-        assert.equal(view.flexTree.content, "Y");
-        const zCursor = cursorForJsonableTreeNode({ type: leaf.string.name, value: "Z" });
-        view.flexTree.content = zCursor;
-        assert.equal(view.flexTree.content, "Z");
-    });
-});
-describe("LazySequence", () => {
-    const builder = new SchemaBuilder({ scope: "test", libraries: [leafDomain.library] });
-    const rootSchema = FlexFieldSchema.create(FieldKinds.sequence, [leafDomain.number]);
-    const schema = builder.intoSchema(rootSchema);
-    /**
-     * Creates a tree with a sequence of numbers at the root, and returns the sequence
-     */
-    function testSequence(data) {
-        const { context, cursor } = readonlyTreeWithContent({
-            schema,
-            initialTree: data,
-        });
-        return new LazySequence(context, rootSchema, cursor, rootFieldAnchor);
-    }
-    function testMutableSequence(data) {
-        const view = flexTreeViewWithContent({
-            schema,
-            initialTree: data,
-        });
-        return view.flexTree;
-    }
-    it("atIndex", () => {
-        const sequence = testSequence([37, 42]);
-        assert.equal(sequence.length, 2);
-        assert.equal(sequence.atIndex(0), 37);
-        assert.equal(sequence.atIndex(1), 42);
-        assert.throws(() => sequence.atIndex(2));
-    });
-    it("at", () => {
-        const sequence = testSequence([37, 42]);
-        assert.equal(sequence.length, 2);
-        assert.equal(sequence.at(0), 37);
-        assert.equal(sequence.at(1), 42);
-        assert.equal(sequence.at(-1), 42); // Negative index > -sequence.length
-        assert.equal(sequence.at(-2), 37); // Negative index > -sequence.length
-        assert.equal(sequence.at(2), undefined); // Positive index >= sequence.length
-        assert.equal(sequence.at(-3), undefined); // Negative index < -sequence.length
-    });
-    it("boxedAt", () => {
-        const sequence = testSequence([37, 42]);
-        const boxedResult0 = sequence.boxedAt(0) ?? assert.fail();
-        assert.equal(boxedResult0.schema, leafDomain.number);
-        assert.equal(boxedResult0.value, 37);
-        const boxedResult1 = sequence.boxedAt(1) ?? assert.fail();
-        assert.equal(boxedResult1.schema, leafDomain.number);
-        assert.equal(boxedResult1.value, 42);
-        const boxedResultNeg1 = sequence.boxedAt(-1) ?? assert.fail();
-        assert.equal(boxedResultNeg1.schema, leafDomain.number);
-        assert.equal(boxedResultNeg1.value, 42);
-        assert.equal(sequence.boxedAt(2), undefined);
-        assert.equal((sequence.boxedAt(-2) ?? assert.fail()).value, 37);
-    });
-    it("length", () => {
-        assert.equal(testSequence([]).length, 0);
-        assert.equal(testSequence([37, 42]).length, 2);
-    });
-    it("map", () => {
-        const sequence = testSequence([1, 2]);
-        const mapResult = sequence.map((value) => value * 2);
-        assert.deepEqual(mapResult, [2, 4]);
-    });
-    it("mapBoxed", () => {
-        const sequence = testSequence([37, 42]);
-        const mapResult = sequence.mapBoxed((value) => value);
-        assert.equal(mapResult.length, 2);
-        assert.equal(mapResult[0].schema, leafDomain.number);
-        assert.equal(mapResult[0].value, 37);
-        assert.equal(mapResult[1].schema, leafDomain.number);
-        assert.equal(mapResult[1].value, 42);
-    });
-    it("asArray", () => {
-        const sequence = testSequence([37, 42]);
-        const array = [...sequence];
-        assert.deepEqual(array, [37, 42]);
-    });
-    describe("insertAt", () => {
-        it("basic use", () => {
-            const sequence = testMutableSequence([]);
-            assert.deepEqual([...sequence], []);
-            sequence.insertAt(0, []);
-            assert.deepEqual([...sequence], []);
-            sequence.insertAt(0, [10]);
-            assert.deepEqual([...sequence], [10]);
-            sequence.insertAt(0, [11]);
-            assert.deepEqual([...sequence], [11, 10]);
-            sequence.insertAt(1, [12]);
-            assert.deepEqual([...sequence], [11, 12, 10]);
-            sequence.insertAt(3, [13]);
-            assert.deepEqual([...sequence], [11, 12, 10, 13]);
-            sequence.insertAt(1, [1, 2, 3]);
-            assert.deepEqual([...sequence], [11, 1, 2, 3, 12, 10, 13]);
-            assert.throws(() => sequence.insertAt(-1, []), (e) => validateAssertionError(e, /index/));
-            assert.throws(() => sequence.insertAt(0.5, []), (e) => validateAssertionError(e, /index/));
-            assert.throws(() => sequence.insertAt(NaN, []), (e) => validateAssertionError(e, /index/));
-            assert.throws(() => sequence.insertAt(Number.POSITIVE_INFINITY, []), (e) => validateAssertionError(e, /index/));
-            assert.throws(() => sequence.insertAt(8, []), (e) => validateAssertionError(e, /index/));
-        });
-        it("with cursors", () => {
-            const sequence = testMutableSequence([]);
-            assert.deepEqual([...sequence], []);
-            sequence.insertAt(0, cursorForJsonableTreeField([]));
-            assert.deepEqual([...sequence], []);
-            sequence.insertAt(0, cursorForJsonableTreeField([{ type: leaf.number.name, value: 10 }]));
-            assert.deepEqual([...sequence], [10]);
-            sequence.insertAt(0, cursorForJsonableTreeField([
-                { type: leaf.number.name, value: 11 },
-                { type: leaf.number.name, value: 12 },
-            ]));
-            assert.deepEqual([...sequence], [11, 12, 10]);
-        });
-    });
-});
-//# sourceMappingURL=lazyField.spec.js.map

package/lib/test/feature-libraries/flex-tree/lazyField.spec.js.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"lazyField.spec.js","sourceRoot":"","sources":["../../../../src/test/feature-libraries/flex-tree/lazyField.spec.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,+CAA+C;AAE/C,OAAO,EAAE,MAAM,IAAI,MAAM,EAAE,MAAM,QAAQ,CAAC;AAE1C,OAAO,EAAE,sBAAsB,EAAE,MAAM,oCAAoC,CAAC;AAE5E,OAAO,EAEN,GAAG,EACH,UAAU,EACV,yBAAyB,EACzB,0BAA0B,EAC1B,eAAe,GACf,MAAM,qCAAqC,CAAC;AAC7C,OAAO,EAAyB,YAAY,EAAU,MAAM,wBAAwB,CAAC;AACrF,OAAO,EAAE,iBAAiB,EAAE,uBAAuB,EAAE,MAAM,gBAAgB,CAAC;AAC5E,OAAO,EAAE,IAAI,EAAE,IAAI,IAAI,UAAU,EAAE,aAAa,EAAE,MAAM,2BAA2B,CAAC;AACpF,OAAO,EAAE,KAAK,EAAE,MAAM,wBAAwB,CAAC;AAC/C,OAAO,EACN,SAAS,EACT,iBAAiB,EACjB,YAAY,EACZ,cAAc,GACd,MAAM,mDAAmD,CAAC;AAC3D,OAAO,EACN,kBAAkB,EAClB,gBAAgB,EAChB,uBAAuB,EACvB,eAAe,GACf,MAAM,YAAY,CAAC;AAEpB,MAAM,aAAa,GAAa,KAAK,CAAC,UAAU,CAAC,CAAC;AAClD,MAAM,mBAAmB,GAAgB,EAAE,MAAM,EAAE,SAAS,EAAE,QAAQ,EAAE,aAAa,EAAE,CAAC;AAExF;;GAEG;AACH,MAAM,aAA+C,SAAQ,SAG5D;CAAG;AAEJ,QAAQ,CAAC,WAAW,EAAE,GAAG,EAAE;IAC1B,EAAE,CAAC,gEAAgE,EAAE,GAAG,EAAE;QACzE,MAAM,OAAO,GAAG,IAAI,aAAa,CAAC,EAAE,KAAK,EAAE,UAAU,EAAE,CAAC,CAAC;QACzD,OAAO,CAAC,MAAM,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;QAC5B,MAAM,MAAM,GAAG,OAAO,CAAC,UAAU,CAAC,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACtF,MAAM,MAAM,GAAG,iBAAiB,CAAC,EAAE,MAAM,EAAE,WAAW,EAAE,EAAE,EAAE,CAAC,CAAC;QAC9D,MAAM,OAAO,GAAG,kBAAkB,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QACnD,MAAM,MAAM,GAAG,gBAAgB,CAAC,OAAO,EAAE,mBAAmB,CAAC,CAAC;QAE9D,MAAM,aAAa,GAAG,IAAI,YAAY,CACrC,OAAO,EACP,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC,EAClD,MAAM,EACN,mBAAmB,CACnB,CAAC;QACF,MAAM,aAAa,GAAG,IAAI,iBAAiB,CAC1C,OAAO,EACP,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC,EAClD,MAAM,EACN,mBAAmB,CACnB,CAAC;QACF,MAAM,UAAU,GAAG,IAAI,cAAc,CACpC,OAAO,EACP,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC,EAClD,MAAM,EACN,mBAAmB,CACnB,CAAC;QACF,MAAM,CAAC,IAAI,EAAE,CAAC;QACd,MAAM,CAAC,MAAM,CACZ,GAAG,EAAE,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EACpC,CAAC,CAAQ,EAAE,EAAE,CACZ,sBAAsB,CACrB,CAAC,EACD,0DAA0D,CAC1D,CACF,CAAC;QACF,MAAM,CAAC,MAAM,CACZ,GAAG,EAAE,CAAC,CAAC,aAAa,CAAC,OAAO,GAAG,SAAS,CAAC,EACzC,CAAC,CAAQ,EAAE,EAAE,CACZ,sBAAsB,CACrB,CAAC,EACD,0DAA0D,CAC1D,CACF,CAAC;QACF,MAAM,CAAC,MAAM,CACZ,GAAG,EAAE,CAAC,CAAC,UAAU,CAAC,OAAO,GAAG,EAAE,CAAC,EAC/B,CAAC,CAAQ,EAAE,EAAE,CACZ,sBAAsB,CACrB,CAAC,EACD,0DAA0D,CAC1D,CACF,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,IAAI,EAAE,GAAG,EAAE;QACb,yCAAyC;QAEzC,MAAM,OAAO,GAAG,IAAI,aAAa,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC,UAAU,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QACtF,MAAM,UAAU,GAAG,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE;YAC9D,OAAO,CAAC,MAAM,CAAC,QAAQ,EAAE,EAAE,CAAC;SAC5B,CAAC,CAAC;QACH,MAAM,MAAM,GAAG,OAAO,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC;QAE9C,uFAAuF;QACvF,kFAAkF;QAClF,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,uBAAuB,CAAC,EAAE,MAAM,EAAE,WAAW,EAAE,EAAE,EAAE,CAAC,CAAC;QAEjF,aAAa;QAEb,6BAA6B;QAE7B,MAAM,gBAAgB,GAAG,IAAI,aAAa,CACzC,OAAO,EACP,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC,EAClD,MAAM,EACN,mBAAmB,CACnB,CAAC;QAEF,MAAM,CAAC,gBAAgB,CAAC,EAAE,CAAC,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAEhF,MAAM,CAAC,CAAC,gBAAgB,CAAC,EAAE,CAAC,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;QAC9E,MAAM,CACL,CAAC,gBAAgB,CAAC,EAAE,CAAC,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,CACvF,CAAC;QACF,MAAM,CAAC,CAAC,gBAAgB,CAAC,EAAE,CAAC,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;QAC9E,MAAM,CAAC,CAAC,gBAAgB,CAAC,EAAE,CAAC,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACjF,MAAM,CACL,CAAC,gBAAgB,CAAC,EAAE,CAAC,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,CACvF,CAAC;QACF,MAAM,CAAC,CAAC,gBAAgB,CAAC,EAAE,CAAC,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;QAC9E,MAAM,CAAC,CAAC,gBAAgB,CAAC,EAAE,CAAC,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACjF,MAAM,CACL,CAAC,gBAAgB,CAAC,EAAE,CAAC,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,CACvF,CAAC;QAEF,aAAa;QAEb,mCAAmC;QAEnC,MAAM,oBAAoB,GAAG,IAAI,iBAAiB,CACjD,OAAO,EACP,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,EACjE,MAAM,EACN,mBAAmB,CACnB,CAAC;QAEF,MAAM,CACL,oBAAoB,CAAC,EAAE,CACtB,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CACjE,CACD,CAAC;QAEF,MAAM,CAAC,CAAC,oBAAoB,CAAC,EAAE,CAAC,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACrF,MAAM,CACL,CAAC,oBAAoB,CAAC,EAAE,CACvB,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAChE,CACD,CAAC;QACF,MAAM,CAAC,CAAC,oBAAoB,CAAC,EAAE,CAAC,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;QAClF,MAAM,CAAC,CAAC,oBAAoB,CAAC,EAAE,CAAC,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACrF,MAAM,CACL,CAAC,oBAAoB,CAAC,EAAE,CACvB,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CACjE,CACD,CAAC;QACF,MAAM,CACL,CAAC,oBAAoB,CAAC,EAAE,CACvB,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAChE,CACD,CAAC;QACF,MAAM,CAAC,CAAC,oBAAoB,CAAC,EAAE,CAAC,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;QAClF,MAAM,CAAC,CAAC,oBAAoB,CAAC,EAAE,CAAC,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACrF,MAAM,CACL,CAAC,oBAAoB,CAAC,EAAE,CACvB,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CACjE,CACD,CAAC;QACF,MAAM,CACL,CAAC,oBAAoB,CAAC,EAAE,CACvB,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAChE,CACD,CAAC;QACF,MAAM,CAAC,CAAC,oBAAoB,CAAC,EAAE,CAAC,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;QAElF,aAAa;IACd,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,QAAQ,EAAE,GAAG,EAAE;QACjB,MAAM,OAAO,GAAG,IAAI,aAAa,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC,UAAU,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QACtF,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,QAAQ,EAAE;YACvC,GAAG,EAAE,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,UAAU,CAAC,UAAU,CAAC;SACvE,CAAC,CAAC;QACH,MAAM,UAAU,GAAG,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC;QACzE,MAAM,MAAM,GAAG,OAAO,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC;QAE9C,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,uBAAuB,CAAC;YACnD,MAAM;YACN,WAAW,EAAE;gBACZ,GAAG,EAAE,aAAa;aAClB;SACD,CAAC,CAAC;QAEH,MAAM,SAAS,GAAG,IAAI,aAAa,CAAC,OAAO,EAAE,UAAU,EAAE,MAAM,EAAE,eAAe,CAAC,CAAC;QAClF,MAAM,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;QAE1C,MAAM,UAAU,GAAW;YAC1B,MAAM,EAAE,SAAS;YACjB,WAAW,EAAE,YAAY;YACzB,WAAW,EAAE,CAAC;SACd,CAAC;QACF,MAAM,YAAY,GAAG,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;QAE9D,iCAAiC;QACjC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QACpB,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;QAEhC,MAAM,SAAS,GAAG,IAAI,aAAa,CAClC,OAAO,EACP,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,UAAU,CAAC,UAAU,CAAC,EAClE,MAAM,EACN;YACC,MAAM,EAAE,YAAY;YACpB,QAAQ,EAAE,KAAK,CAAC,KAAK,CAAC;SACtB,CACD,CAAC;QACF,MAAM,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;IACtD,CAAC,CAAC,CAAC;AACJ,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,mBAAmB,EAAE,GAAG,EAAE;IAClC,MAAM,OAAO,GAAG,IAAI,aAAa,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC,UAAU,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;IACtF,MAAM,UAAU,GAAG,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC;IACpF,MAAM,MAAM,GAAG,OAAO,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC;IAE9C,QAAQ,CAAC,kBAAkB,EAAE,GAAG,EAAE;QACjC,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,uBAAuB,CAAC,EAAE,MAAM,EAAE,WAAW,EAAE,EAAE,EAAE,CAAC,CAAC;QACjF,MAAM,KAAK,GAAG,IAAI,iBAAiB,CAAC,OAAO,EAAE,UAAU,EAAE,MAAM,EAAE,eAAe,CAAC,CAAC;QAElF,EAAE,CAAC,SAAS,EAAE,GAAG,EAAE;YAClB,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QACpC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,SAAS,EAAE,GAAG,EAAE;YAClB,MAAM,WAAW,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,IAAI,EAAE,CAAC;YACtD,MAAM,CAAC,KAAK,CAAC,WAAW,CAAC,MAAM,EAAE,UAAU,CAAC,MAAM,CAAC,CAAC;YACpD,MAAM,CAAC,KAAK,CAAC,WAAW,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;QACrC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,QAAQ,EAAE,GAAG,EAAE;YACjB,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QAC/B,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,KAAK,EAAE,GAAG,EAAE;YACd,MAAM,CAAC,SAAS,CACf,KAAK,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,EAC3B,CAAC,EAAE,CAAC,CACJ,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,UAAU,EAAE,GAAG,EAAE;YACnB,MAAM,SAAS,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC;YACnD,MAAM,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;YAClC,MAAM,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;QACtC,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,qBAAqB,EAAE,GAAG,EAAE;QACpC,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,uBAAuB,CAAC;YACnD,MAAM;YACN,WAAW,EAAE,SAAS;SACtB,CAAC,CAAC;QACH,MAAM,KAAK,GAAG,IAAI,iBAAiB,CAAC,OAAO,EAAE,UAAU,EAAE,MAAM,EAAE,eAAe,CAAC,CAAC;QAElF,EAAE,CAAC,SAAS,EAAE,GAAG,EAAE;YAClB,mDAAmD;YACnD,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;QACvC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,SAAS,EAAE,GAAG,EAAE;YAClB,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;QAC3C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,QAAQ,EAAE,GAAG,EAAE;YACjB,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QAC/B,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,KAAK,EAAE,GAAG,EAAE;YACd,MAAM,CAAC,SAAS,CACf,KAAK,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,EAC3B,EAAE,CACF,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,UAAU,EAAE,GAAG,EAAE;YACnB,MAAM,CAAC,SAAS,CACf,KAAK,CAAC,QAAQ,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,EAChC,EAAE,CACF,CAAC;QACH,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,SAAS,EAAE,GAAG,EAAE;QAClB,MAAM,IAAI,GAAG,uBAAuB,CAAC;YACpC,MAAM;YACN,WAAW,EAAE,CAAC;SACd,CAAC,CAAC;QACH,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;QACvC,IAAI,CAAC,QAAQ,CAAC,OAAO,GAAG,CAAC,CAAC;QAC1B,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;QACvC,IAAI,CAAC,QAAQ,CAAC,OAAO,GAAG,SAAS,CAAC;QAClC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;QAC/C,IAAI,CAAC,QAAQ,CAAC,OAAO,GAAG,yBAAyB,CAAC;YACjD,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI;YACtB,KAAK,EAAE,CAAC;SACR,CAAC,CAAC;QACH,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;AACJ,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,gBAAgB,EAAE,GAAG,EAAE;IAC/B,MAAM,OAAO,GAAG,IAAI,aAAa,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC,UAAU,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;IACtF,MAAM,UAAU,GAAG,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC;IACpF,MAAM,MAAM,GAAG,OAAO,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC;IAE9C,MAAM,WAAW,GAAG,aAAa,CAAC;IAElC,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,uBAAuB,CAAC,EAAE,MAAM,EAAE,WAAW,EAAE,CAAC,CAAC;IAE7E,MAAM,KAAK,GAAG,IAAI,cAAc,CAAC,OAAO,EAAE,UAAU,EAAE,MAAM,EAAE,eAAe,CAAC,CAAC;IAE/E,EAAE,CAAC,SAAS,EAAE,GAAG,EAAE;QAClB,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC;IAC7C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,SAAS,EAAE,GAAG,EAAE;QAClB,MAAM,WAAW,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,IAAI,EAAE,CAAC;QACtD,MAAM,CAAC,KAAK,CAAC,WAAW,CAAC,MAAM,EAAE,UAAU,CAAC,MAAM,CAAC,CAAC;QACpD,MAAM,CAAC,KAAK,CAAC,WAAW,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC;IAC9C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,QAAQ,EAAE,GAAG,EAAE;QACjB,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IAC/B,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,KAAK,EAAE,GAAG,EAAE;QACd,MAAM,CAAC,SAAS,CACf,KAAK,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,EAC3B,CAAC,WAAW,CAAC,CACb,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,UAAU,EAAE,GAAG,EAAE;QACnB,MAAM,SAAS,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC;QACnD,MAAM,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QAClC,MAAM,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC;IAC/C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,SAAS,EAAE,GAAG,EAAE;QAClB,MAAM,IAAI,GAAG,uBAAuB,CAAC;YACpC,MAAM;YACN,WAAW,EAAE,GAAG;SAChB,CAAC,CAAC;QACH,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;QACzC,IAAI,CAAC,QAAQ,CAAC,OAAO,GAAG,GAAG,CAAC;QAC5B,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;QACzC,MAAM,OAAO,GAAG,yBAAyB,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC;QAClF,IAAI,CAAC,QAAQ,CAAC,OAAO,GAAG,OAAO,CAAC;QAChC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;IAC1C,CAAC,CAAC,CAAC;AACJ,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,cAAc,EAAE,GAAG,EAAE;IAC7B,MAAM,OAAO,GAAG,IAAI,aAAa,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC,UAAU,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;IACtF,MAAM,UAAU,GAAG,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC;IACpF,MAAM,MAAM,GAAG,OAAO,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC;IAE9C;;OAEG;IACH,SAAS,YAAY,CAAC,IAAc;QACnC,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,uBAAuB,CAAC;YACnD,MAAM;YACN,WAAW,EAAE,IAAI;SACjB,CAAC,CAAC;QACH,OAAO,IAAI,YAAY,CAAC,OAAO,EAAE,UAAU,EAAE,MAAM,EAAE,eAAe,CAAC,CAAC;IACvE,CAAC;IAED,SAAS,mBAAmB,CAAC,IAAc;QAC1C,MAAM,IAAI,GAAG,uBAAuB,CAAC;YACpC,MAAM;YACN,WAAW,EAAE,IAAI;SACjB,CAAC,CAAC;QACH,OAAO,IAAI,CAAC,QAAQ,CAAC;IACtB,CAAC;IAED,EAAE,CAAC,SAAS,EAAE,GAAG,EAAE;QAClB,MAAM,QAAQ,GAAG,YAAY,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;QACxC,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QACjC,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QACtC,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QACtC,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,IAAI,EAAE,GAAG,EAAE;QACb,MAAM,QAAQ,GAAG,YAAY,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;QACxC,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QACjC,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QACjC,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QACjC,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,oCAAoC;QACvE,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,oCAAoC;QACvE,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,oCAAoC;QAC7E,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,oCAAoC;IAC/E,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,SAAS,EAAE,GAAG,EAAE;QAClB,MAAM,QAAQ,GAAG,YAAY,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;QACxC,MAAM,YAAY,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,IAAI,EAAE,CAAC;QAC1D,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,MAAM,EAAE,UAAU,CAAC,MAAM,CAAC,CAAC;QACrD,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;QAErC,MAAM,YAAY,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,IAAI,EAAE,CAAC;QAC1D,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,MAAM,EAAE,UAAU,CAAC,MAAM,CAAC,CAAC;QACrD,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;QAErC,MAAM,eAAe,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,IAAI,EAAE,CAAC;QAC9D,MAAM,CAAC,KAAK,CAAC,eAAe,CAAC,MAAM,EAAE,UAAU,CAAC,MAAM,CAAC,CAAC;QACxD,MAAM,CAAC,KAAK,CAAC,eAAe,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;QAExC,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;QAC7C,MAAM,CAAC,KAAK,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;IACjE,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,QAAQ,EAAE,GAAG,EAAE;QACjB,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QACzC,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IAChD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,KAAK,EAAE,GAAG,EAAE;QACd,MAAM,QAAQ,GAAG,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACtC,MAAM,SAAS,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;QACrD,MAAM,CAAC,SAAS,CAAC,SAAS,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,UAAU,EAAE,GAAG,EAAE;QACnB,MAAM,QAAQ,GAAG,YAAY,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;QACxC,MAAM,SAAS,GAAG,QAAQ,CAAC,QAAQ,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC;QACtD,MAAM,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QAClC,MAAM,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,UAAU,CAAC,MAAM,CAAC,CAAC;QACrD,MAAM,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;QACrC,MAAM,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,UAAU,CAAC,MAAM,CAAC,CAAC;QACrD,MAAM,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,SAAS,EAAE,GAAG,EAAE;QAClB,MAAM,QAAQ,GAAG,YAAY,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;QACxC,MAAM,KAAK,GAAG,CAAC,GAAG,QAAQ,CAAC,CAAC;QAC5B,MAAM,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,UAAU,EAAE,GAAG,EAAE;QACzB,EAAE,CAAC,WAAW,EAAE,GAAG,EAAE;YACpB,MAAM,QAAQ,GAAG,mBAAmB,CAAC,EAAE,CAAC,CAAC;YACzC,MAAM,CAAC,SAAS,CAAC,CAAC,GAAG,QAAQ,CAAC,EAAE,EAAE,CAAC,CAAC;YACpC,QAAQ,CAAC,QAAQ,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YACzB,MAAM,CAAC,SAAS,CAAC,CAAC,GAAG,QAAQ,CAAC,EAAE,EAAE,CAAC,CAAC;YACpC,QAAQ,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAC3B,MAAM,CAAC,SAAS,CAAC,CAAC,GAAG,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACtC,QAAQ,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAC3B,MAAM,CAAC,SAAS,CAAC,CAAC,GAAG,QAAQ,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;YAC1C,QAAQ,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAC3B,MAAM,CAAC,SAAS,CAAC,CAAC,GAAG,QAAQ,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;YAC9C,QAAQ,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAC3B,MAAM,CAAC,SAAS,CAAC,CAAC,GAAG,QAAQ,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;YAClD,QAAQ,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAChC,MAAM,CAAC,SAAS,CAAC,CAAC,GAAG,QAAQ,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;YAC3D,MAAM,CAAC,MAAM,CACZ,GAAG,EAAE,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,EAC/B,CAAC,CAAQ,EAAE,EAAE,CAAC,sBAAsB,CAAC,CAAC,EAAE,OAAO,CAAC,CAChD,CAAC;YACF,MAAM,CAAC,MAAM,CACZ,GAAG,EAAE,CAAC,QAAQ,CAAC,QAAQ,CAAC,GAAG,EAAE,EAAE,CAAC,EAChC,CAAC,CAAQ,EAAE,EAAE,CAAC,sBAAsB,CAAC,CAAC,EAAE,OAAO,CAAC,CAChD,CAAC;YACF,MAAM,CAAC,MAAM,CACZ,GAAG,EAAE,CAAC,QAAQ,CAAC,QAAQ,CAAC,GAAG,EAAE,EAAE,CAAC,EAChC,CAAC,CAAQ,EAAE,EAAE,CAAC,sBAAsB,CAAC,CAAC,EAAE,OAAO,CAAC,CAChD,CAAC;YACF,MAAM,CAAC,MAAM,CACZ,GAAG,EAAE,CAAC,QAAQ,CAAC,QAAQ,CAAC,MAAM,CAAC,iBAAiB,EAAE,EAAE,CAAC,EACrD,CAAC,CAAQ,EAAE,EAAE,CAAC,sBAAsB,CAAC,CAAC,EAAE,OAAO,CAAC,CAChD,CAAC;YACF,MAAM,CAAC,MAAM,CACZ,GAAG,EAAE,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,EAAE,EAAE,CAAC,EAC9B,CAAC,CAAQ,EAAE,EAAE,CAAC,sBAAsB,CAAC,CAAC,EAAE,OAAO,CAAC,CAChD,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,cAAc,EAAE,GAAG,EAAE;YACvB,MAAM,QAAQ,GAAG,mBAAmB,CAAC,EAAE,CAAC,CAAC;YACzC,MAAM,CAAC,SAAS,CAAC,CAAC,GAAG,QAAQ,CAAC,EAAE,EAAE,CAAC,CAAC;YACpC,QAAQ,CAAC,QAAQ,CAAC,CAAC,EAAE,0BAA0B,CAAC,EAAE,CAAC,CAAC,CAAC;YACrD,MAAM,CAAC,SAAS,CAAC,CAAC,GAAG,QAAQ,CAAC,EAAE,EAAE,CAAC,CAAC;YACpC,QAAQ,CAAC,QAAQ,CAChB,CAAC,EACD,0BAA0B,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,CAAC,CACnE,CAAC;YACF,MAAM,CAAC,SAAS,CAAC,CAAC,GAAG,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACtC,QAAQ,CAAC,QAAQ,CAChB,CAAC,EACD,0BAA0B,CAAC;gBAC1B,EAAE,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE;gBACrC,EAAE,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE;aACrC,CAAC,CACF,CAAC;YACF,MAAM,CAAC,SAAS,CAAC,CAAC,GAAG,QAAQ,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;QAC/C,CAAC,CAAC,CAAC;IACJ,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\n/* eslint-disable import/no-internal-modules */\n\nimport { strict as assert } from \"assert\";\n\nimport { validateAssertionError } from \"@fluidframework/test-runtime-utils\";\n\nimport {\n\ttype FlexAllowedTypes,\n\tAny,\n\tFieldKinds,\n\tcursorForJsonableTreeNode,\n\tcursorForJsonableTreeField,\n\tFlexFieldSchema,\n} from \"../../../feature-libraries/index.js\";\nimport { FieldAnchor, FieldKey, rootFieldKey, UpPath } from \"../../../core/index.js\";\nimport { forestWithContent, flexTreeViewWithContent } from \"../../utils.js\";\nimport { leaf, leaf as leafDomain, SchemaBuilder } from \"../../../domains/index.js\";\nimport { brand } from \"../../../util/index.js\";\nimport {\n\tLazyField,\n\tLazyOptionalField,\n\tLazySequence,\n\tLazyValueField,\n} from \"../../../feature-libraries/flex-tree/lazyField.js\";\nimport {\n\tgetReadonlyContext,\n\tinitializeCursor,\n\treadonlyTreeWithContent,\n\trootFieldAnchor,\n} from \"./utils.js\";\n\nconst detachedField: FieldKey = brand(\"detached\");\nconst detachedFieldAnchor: FieldAnchor = { parent: undefined, fieldKey: detachedField };\n\n/**\n * Test {@link LazyField} implementation.\n */\nclass TestLazyField<TTypes extends FlexAllowedTypes> extends LazyField<\n\ttypeof FieldKinds.optional,\n\tTTypes\n> {}\n\ndescribe(\"LazyField\", () => {\n\tit(\"LazyField implementations do not allow edits to detached trees\", () => {\n\t\tconst builder = new SchemaBuilder({ scope: \"lazyTree\" });\n\t\tbuilder.object(\"empty\", {});\n\t\tconst schema = builder.intoSchema(FlexFieldSchema.create(FieldKinds.optional, [Any]));\n\t\tconst forest = forestWithContent({ schema, initialTree: {} });\n\t\tconst context = getReadonlyContext(forest, schema);\n\t\tconst cursor = initializeCursor(context, detachedFieldAnchor);\n\n\t\tconst sequenceField = new LazySequence(\n\t\t\tcontext,\n\t\t\tFlexFieldSchema.create(FieldKinds.sequence, [Any]),\n\t\t\tcursor,\n\t\t\tdetachedFieldAnchor,\n\t\t);\n\t\tconst optionalField = new LazyOptionalField(\n\t\t\tcontext,\n\t\t\tFlexFieldSchema.create(FieldKinds.optional, [Any]),\n\t\t\tcursor,\n\t\t\tdetachedFieldAnchor,\n\t\t);\n\t\tconst valueField = new LazyValueField(\n\t\t\tcontext,\n\t\t\tFlexFieldSchema.create(FieldKinds.required, [Any]),\n\t\t\tcursor,\n\t\t\tdetachedFieldAnchor,\n\t\t);\n\t\tcursor.free();\n\t\tassert.throws(\n\t\t\t() => sequenceField.insertAt(0, [1]),\n\t\t\t(e: Error) =>\n\t\t\t\tvalidateAssertionError(\n\t\t\t\t\te,\n\t\t\t\t\t/only allowed on fields with TreeStatus.InDocument status/,\n\t\t\t\t),\n\t\t);\n\t\tassert.throws(\n\t\t\t() => (optionalField.content = undefined),\n\t\t\t(e: Error) =>\n\t\t\t\tvalidateAssertionError(\n\t\t\t\t\te,\n\t\t\t\t\t/only allowed on fields with TreeStatus.InDocument status/,\n\t\t\t\t),\n\t\t);\n\t\tassert.throws(\n\t\t\t() => (valueField.content = {}),\n\t\t\t(e: Error) =>\n\t\t\t\tvalidateAssertionError(\n\t\t\t\t\te,\n\t\t\t\t\t/only allowed on fields with TreeStatus.InDocument status/,\n\t\t\t\t),\n\t\t);\n\t});\n\n\tit(\"is\", () => {\n\t\t// #region Tree and schema initialization\n\n\t\tconst builder = new SchemaBuilder({ scope: \"test\", libraries: [leafDomain.library] });\n\t\tconst rootSchema = FlexFieldSchema.create(FieldKinds.optional, [\n\t\t\tbuilder.object(\"object\", {}),\n\t\t]);\n\t\tconst schema = builder.intoSchema(rootSchema);\n\n\t\t// Note: this tree initialization is strictly to enable construction of the lazy field.\n\t\t// The test cases below are strictly in terms of the schema of the created fields.\n\t\tconst { context, cursor } = readonlyTreeWithContent({ schema, initialTree: {} });\n\n\t\t// #endregion\n\n\t\t// #region OptionalField<Any>\n\n\t\tconst anyOptionalField = new TestLazyField(\n\t\t\tcontext,\n\t\t\tFlexFieldSchema.create(FieldKinds.optional, [Any]),\n\t\t\tcursor,\n\t\t\tdetachedFieldAnchor,\n\t\t);\n\n\t\tassert(anyOptionalField.is(FlexFieldSchema.create(FieldKinds.optional, [Any])));\n\n\t\tassert(!anyOptionalField.is(FlexFieldSchema.create(FieldKinds.optional, [])));\n\t\tassert(\n\t\t\t!anyOptionalField.is(FlexFieldSchema.create(FieldKinds.optional, [leafDomain.boolean])),\n\t\t);\n\t\tassert(!anyOptionalField.is(FlexFieldSchema.create(FieldKinds.required, [])));\n\t\tassert(!anyOptionalField.is(FlexFieldSchema.create(FieldKinds.required, [Any])));\n\t\tassert(\n\t\t\t!anyOptionalField.is(FlexFieldSchema.create(FieldKinds.required, [leafDomain.boolean])),\n\t\t);\n\t\tassert(!anyOptionalField.is(FlexFieldSchema.create(FieldKinds.sequence, [])));\n\t\tassert(!anyOptionalField.is(FlexFieldSchema.create(FieldKinds.sequence, [Any])));\n\t\tassert(\n\t\t\t!anyOptionalField.is(FlexFieldSchema.create(FieldKinds.sequence, [leafDomain.boolean])),\n\t\t);\n\n\t\t// #endregion\n\n\t\t// #region OptionalField<Primitive>\n\n\t\tconst booleanOptionalField = new LazyOptionalField(\n\t\t\tcontext,\n\t\t\tFlexFieldSchema.create(FieldKinds.optional, [leafDomain.boolean]),\n\t\t\tcursor,\n\t\t\tdetachedFieldAnchor,\n\t\t);\n\n\t\tassert(\n\t\t\tbooleanOptionalField.is(\n\t\t\t\tFlexFieldSchema.create(FieldKinds.optional, [leafDomain.boolean]),\n\t\t\t),\n\t\t);\n\n\t\tassert(!booleanOptionalField.is(FlexFieldSchema.create(FieldKinds.optional, [Any])));\n\t\tassert(\n\t\t\t!booleanOptionalField.is(\n\t\t\t\tFlexFieldSchema.create(FieldKinds.optional, [leafDomain.number]),\n\t\t\t),\n\t\t);\n\t\tassert(!booleanOptionalField.is(FlexFieldSchema.create(FieldKinds.required, [])));\n\t\tassert(!booleanOptionalField.is(FlexFieldSchema.create(FieldKinds.required, [Any])));\n\t\tassert(\n\t\t\t!booleanOptionalField.is(\n\t\t\t\tFlexFieldSchema.create(FieldKinds.required, [leafDomain.boolean]),\n\t\t\t),\n\t\t);\n\t\tassert(\n\t\t\t!booleanOptionalField.is(\n\t\t\t\tFlexFieldSchema.create(FieldKinds.required, [leafDomain.number]),\n\t\t\t),\n\t\t);\n\t\tassert(!booleanOptionalField.is(FlexFieldSchema.create(FieldKinds.sequence, [])));\n\t\tassert(!booleanOptionalField.is(FlexFieldSchema.create(FieldKinds.sequence, [Any])));\n\t\tassert(\n\t\t\t!booleanOptionalField.is(\n\t\t\t\tFlexFieldSchema.create(FieldKinds.sequence, [leafDomain.boolean]),\n\t\t\t),\n\t\t);\n\t\tassert(\n\t\t\t!booleanOptionalField.is(\n\t\t\t\tFlexFieldSchema.create(FieldKinds.sequence, [leafDomain.number]),\n\t\t\t),\n\t\t);\n\t\tassert(!booleanOptionalField.is(FlexFieldSchema.create(FieldKinds.optional, [])));\n\n\t\t// #endregion\n\t});\n\n\tit(\"parent\", () => {\n\t\tconst builder = new SchemaBuilder({ scope: \"test\", libraries: [leafDomain.library] });\n\t\tconst struct = builder.object(\"object\", {\n\t\t\tfoo: FlexFieldSchema.create(FieldKinds.optional, leafDomain.primitives),\n\t\t});\n\t\tconst rootSchema = FlexFieldSchema.create(FieldKinds.optional, [struct]);\n\t\tconst schema = builder.intoSchema(rootSchema);\n\n\t\tconst { context, cursor } = readonlyTreeWithContent({\n\t\t\tschema,\n\t\t\tinitialTree: {\n\t\t\t\tfoo: \"Hello world\",\n\t\t\t},\n\t\t});\n\n\t\tconst rootField = new TestLazyField(context, rootSchema, cursor, rootFieldAnchor);\n\t\tassert.equal(rootField.parent, undefined);\n\n\t\tconst parentPath: UpPath = {\n\t\t\tparent: undefined,\n\t\t\tparentField: rootFieldKey,\n\t\t\tparentIndex: 0,\n\t\t};\n\t\tconst parentAnchor = context.forest.anchors.track(parentPath);\n\n\t\t// Move cursor down to leaf field\n\t\tcursor.enterNode(0);\n\t\tcursor.enterField(brand(\"foo\"));\n\n\t\tconst leafField = new TestLazyField(\n\t\t\tcontext,\n\t\t\tFlexFieldSchema.create(FieldKinds.optional, leafDomain.primitives),\n\t\t\tcursor,\n\t\t\t{\n\t\t\t\tparent: parentAnchor,\n\t\t\t\tfieldKey: brand(\"foo\"),\n\t\t\t},\n\t\t);\n\t\tassert.equal(leafField.parent, rootField.boxedAt(0));\n\t});\n});\n\ndescribe(\"LazyOptionalField\", () => {\n\tconst builder = new SchemaBuilder({ scope: \"test\", libraries: [leafDomain.library] });\n\tconst rootSchema = FlexFieldSchema.create(FieldKinds.optional, [leafDomain.number]);\n\tconst schema = builder.intoSchema(rootSchema);\n\n\tdescribe(\"Field with value\", () => {\n\t\tconst { context, cursor } = readonlyTreeWithContent({ schema, initialTree: 42 });\n\t\tconst field = new LazyOptionalField(context, rootSchema, cursor, rootFieldAnchor);\n\n\t\tit(\"atIndex\", () => {\n\t\t\tassert.equal(field.atIndex(0), 42);\n\t\t});\n\n\t\tit(\"boxedAt\", () => {\n\t\t\tconst boxedResult = field.boxedAt(0) ?? assert.fail();\n\t\t\tassert.equal(boxedResult.schema, leafDomain.number);\n\t\t\tassert.equal(boxedResult.value, 42);\n\t\t});\n\n\t\tit(\"length\", () => {\n\t\t\tassert.equal(field.length, 1);\n\t\t});\n\n\t\tit(\"map\", () => {\n\t\t\tassert.deepEqual(\n\t\t\t\tfield.map((value) => value),\n\t\t\t\t[42],\n\t\t\t);\n\t\t});\n\n\t\tit(\"mapBoxed\", () => {\n\t\t\tconst mapResult = field.mapBoxed((value) => value);\n\t\t\tassert.equal(mapResult.length, 1);\n\t\t\tassert.equal(mapResult[0].value, 42);\n\t\t});\n\t});\n\n\tdescribe(\"Field without value\", () => {\n\t\tconst { context, cursor } = readonlyTreeWithContent({\n\t\t\tschema,\n\t\t\tinitialTree: undefined,\n\t\t});\n\t\tconst field = new LazyOptionalField(context, rootSchema, cursor, rootFieldAnchor);\n\n\t\tit(\"atIndex\", () => {\n\t\t\t// Invalid to request the value if there isn't one.\n\t\t\tassert.throws(() => field.atIndex(0));\n\t\t});\n\n\t\tit(\"boxedAt\", () => {\n\t\t\tassert.equal(field.boxedAt(0), undefined);\n\t\t});\n\n\t\tit(\"length\", () => {\n\t\t\tassert.equal(field.length, 0);\n\t\t});\n\n\t\tit(\"map\", () => {\n\t\t\tassert.deepEqual(\n\t\t\t\tfield.map((value) => value),\n\t\t\t\t[],\n\t\t\t);\n\t\t});\n\n\t\tit(\"mapBoxed\", () => {\n\t\t\tassert.deepEqual(\n\t\t\t\tfield.mapBoxed((value) => value),\n\t\t\t\t[],\n\t\t\t);\n\t\t});\n\t});\n\n\tit(\"content\", () => {\n\t\tconst view = flexTreeViewWithContent({\n\t\t\tschema,\n\t\t\tinitialTree: 5,\n\t\t});\n\t\tassert.equal(view.flexTree.content, 5);\n\t\tview.flexTree.content = 6;\n\t\tassert.equal(view.flexTree.content, 6);\n\t\tview.flexTree.content = undefined;\n\t\tassert.equal(view.flexTree.content, undefined);\n\t\tview.flexTree.content = cursorForJsonableTreeNode({\n\t\t\ttype: leaf.string.name,\n\t\t\tvalue: 7,\n\t\t});\n\t\tassert.equal(view.flexTree.content, 7);\n\t});\n});\n\ndescribe(\"LazyValueField\", () => {\n\tconst builder = new SchemaBuilder({ scope: \"test\", libraries: [leafDomain.library] });\n\tconst rootSchema = FlexFieldSchema.create(FieldKinds.required, [leafDomain.string]);\n\tconst schema = builder.intoSchema(rootSchema);\n\n\tconst initialTree = \"Hello world\";\n\n\tconst { context, cursor } = readonlyTreeWithContent({ schema, initialTree });\n\n\tconst field = new LazyValueField(context, rootSchema, cursor, rootFieldAnchor);\n\n\tit(\"atIndex\", () => {\n\t\tassert.equal(field.atIndex(0), initialTree);\n\t});\n\n\tit(\"boxedAt\", () => {\n\t\tconst boxedResult = field.boxedAt(0) ?? assert.fail();\n\t\tassert.equal(boxedResult.schema, leafDomain.string);\n\t\tassert.equal(boxedResult.value, initialTree);\n\t});\n\n\tit(\"length\", () => {\n\t\tassert.equal(field.length, 1);\n\t});\n\n\tit(\"map\", () => {\n\t\tassert.deepEqual(\n\t\t\tfield.map((value) => value),\n\t\t\t[initialTree],\n\t\t);\n\t});\n\n\tit(\"mapBoxed\", () => {\n\t\tconst mapResult = field.mapBoxed((value) => value);\n\t\tassert.equal(mapResult.length, 1);\n\t\tassert.equal(mapResult[0].value, initialTree);\n\t});\n\n\tit(\"content\", () => {\n\t\tconst view = flexTreeViewWithContent({\n\t\t\tschema,\n\t\t\tinitialTree: \"X\",\n\t\t});\n\t\tassert.equal(view.flexTree.content, \"X\");\n\t\tview.flexTree.content = \"Y\";\n\t\tassert.equal(view.flexTree.content, \"Y\");\n\t\tconst zCursor = cursorForJsonableTreeNode({ type: leaf.string.name, value: \"Z\" });\n\t\tview.flexTree.content = zCursor;\n\t\tassert.equal(view.flexTree.content, \"Z\");\n\t});\n});\n\ndescribe(\"LazySequence\", () => {\n\tconst builder = new SchemaBuilder({ scope: \"test\", libraries: [leafDomain.library] });\n\tconst rootSchema = FlexFieldSchema.create(FieldKinds.sequence, [leafDomain.number]);\n\tconst schema = builder.intoSchema(rootSchema);\n\n\t/**\n\t * Creates a tree with a sequence of numbers at the root, and returns the sequence\n\t */\n\tfunction testSequence(data: number[]) {\n\t\tconst { context, cursor } = readonlyTreeWithContent({\n\t\t\tschema,\n\t\t\tinitialTree: data,\n\t\t});\n\t\treturn new LazySequence(context, rootSchema, cursor, rootFieldAnchor);\n\t}\n\n\tfunction testMutableSequence(data: number[]) {\n\t\tconst view = flexTreeViewWithContent({\n\t\t\tschema,\n\t\t\tinitialTree: data,\n\t\t});\n\t\treturn view.flexTree;\n\t}\n\n\tit(\"atIndex\", () => {\n\t\tconst sequence = testSequence([37, 42]);\n\t\tassert.equal(sequence.length, 2);\n\t\tassert.equal(sequence.atIndex(0), 37);\n\t\tassert.equal(sequence.atIndex(1), 42);\n\t\tassert.throws(() => sequence.atIndex(2));\n\t});\n\n\tit(\"at\", () => {\n\t\tconst sequence = testSequence([37, 42]);\n\t\tassert.equal(sequence.length, 2);\n\t\tassert.equal(sequence.at(0), 37);\n\t\tassert.equal(sequence.at(1), 42);\n\t\tassert.equal(sequence.at(-1), 42); // Negative index > -sequence.length\n\t\tassert.equal(sequence.at(-2), 37); // Negative index > -sequence.length\n\t\tassert.equal(sequence.at(2), undefined); // Positive index >= sequence.length\n\t\tassert.equal(sequence.at(-3), undefined); // Negative index < -sequence.length\n\t});\n\n\tit(\"boxedAt\", () => {\n\t\tconst sequence = testSequence([37, 42]);\n\t\tconst boxedResult0 = sequence.boxedAt(0) ?? assert.fail();\n\t\tassert.equal(boxedResult0.schema, leafDomain.number);\n\t\tassert.equal(boxedResult0.value, 37);\n\n\t\tconst boxedResult1 = sequence.boxedAt(1) ?? assert.fail();\n\t\tassert.equal(boxedResult1.schema, leafDomain.number);\n\t\tassert.equal(boxedResult1.value, 42);\n\n\t\tconst boxedResultNeg1 = sequence.boxedAt(-1) ?? assert.fail();\n\t\tassert.equal(boxedResultNeg1.schema, leafDomain.number);\n\t\tassert.equal(boxedResultNeg1.value, 42);\n\n\t\tassert.equal(sequence.boxedAt(2), undefined);\n\t\tassert.equal((sequence.boxedAt(-2) ?? assert.fail()).value, 37);\n\t});\n\n\tit(\"length\", () => {\n\t\tassert.equal(testSequence([]).length, 0);\n\t\tassert.equal(testSequence([37, 42]).length, 2);\n\t});\n\n\tit(\"map\", () => {\n\t\tconst sequence = testSequence([1, 2]);\n\t\tconst mapResult = sequence.map((value) => value * 2);\n\t\tassert.deepEqual(mapResult, [2, 4]);\n\t});\n\n\tit(\"mapBoxed\", () => {\n\t\tconst sequence = testSequence([37, 42]);\n\t\tconst mapResult = sequence.mapBoxed((value) => value);\n\t\tassert.equal(mapResult.length, 2);\n\t\tassert.equal(mapResult[0].schema, leafDomain.number);\n\t\tassert.equal(mapResult[0].value, 37);\n\t\tassert.equal(mapResult[1].schema, leafDomain.number);\n\t\tassert.equal(mapResult[1].value, 42);\n\t});\n\n\tit(\"asArray\", () => {\n\t\tconst sequence = testSequence([37, 42]);\n\t\tconst array = [...sequence];\n\t\tassert.deepEqual(array, [37, 42]);\n\t});\n\n\tdescribe(\"insertAt\", () => {\n\t\tit(\"basic use\", () => {\n\t\t\tconst sequence = testMutableSequence([]);\n\t\t\tassert.deepEqual([...sequence], []);\n\t\t\tsequence.insertAt(0, []);\n\t\t\tassert.deepEqual([...sequence], []);\n\t\t\tsequence.insertAt(0, [10]);\n\t\t\tassert.deepEqual([...sequence], [10]);\n\t\t\tsequence.insertAt(0, [11]);\n\t\t\tassert.deepEqual([...sequence], [11, 10]);\n\t\t\tsequence.insertAt(1, [12]);\n\t\t\tassert.deepEqual([...sequence], [11, 12, 10]);\n\t\t\tsequence.insertAt(3, [13]);\n\t\t\tassert.deepEqual([...sequence], [11, 12, 10, 13]);\n\t\t\tsequence.insertAt(1, [1, 2, 3]);\n\t\t\tassert.deepEqual([...sequence], [11, 1, 2, 3, 12, 10, 13]);\n\t\t\tassert.throws(\n\t\t\t\t() => sequence.insertAt(-1, []),\n\t\t\t\t(e: Error) => validateAssertionError(e, /index/),\n\t\t\t);\n\t\t\tassert.throws(\n\t\t\t\t() => sequence.insertAt(0.5, []),\n\t\t\t\t(e: Error) => validateAssertionError(e, /index/),\n\t\t\t);\n\t\t\tassert.throws(\n\t\t\t\t() => sequence.insertAt(NaN, []),\n\t\t\t\t(e: Error) => validateAssertionError(e, /index/),\n\t\t\t);\n\t\t\tassert.throws(\n\t\t\t\t() => sequence.insertAt(Number.POSITIVE_INFINITY, []),\n\t\t\t\t(e: Error) => validateAssertionError(e, /index/),\n\t\t\t);\n\t\t\tassert.throws(\n\t\t\t\t() => sequence.insertAt(8, []),\n\t\t\t\t(e: Error) => validateAssertionError(e, /index/),\n\t\t\t);\n\t\t});\n\n\t\tit(\"with cursors\", () => {\n\t\t\tconst sequence = testMutableSequence([]);\n\t\t\tassert.deepEqual([...sequence], []);\n\t\t\tsequence.insertAt(0, cursorForJsonableTreeField([]));\n\t\t\tassert.deepEqual([...sequence], []);\n\t\t\tsequence.insertAt(\n\t\t\t\t0,\n\t\t\t\tcursorForJsonableTreeField([{ type: leaf.number.name, value: 10 }]),\n\t\t\t);\n\t\t\tassert.deepEqual([...sequence], [10]);\n\t\t\tsequence.insertAt(\n\t\t\t\t0,\n\t\t\t\tcursorForJsonableTreeField([\n\t\t\t\t\t{ type: leaf.number.name, value: 11 },\n\t\t\t\t\t{ type: leaf.number.name, value: 12 },\n\t\t\t\t]),\n\t\t\t);\n\t\t\tassert.deepEqual([...sequence], [11, 12, 10]);\n\t\t});\n\t});\n});\n"]}

package/lib/test/feature-libraries/flex-tree/lazyNode.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=lazyNode.spec.d.ts.map

package/lib/test/feature-libraries/flex-tree/lazyNode.spec.d.ts.map DELETED Viewed

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