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/simple-tree/proxies.spec.js.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"proxies.spec.js","sourceRoot":"","sources":["../../../src/test/simple-tree/proxies.spec.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,IAAI,MAAM,EAAE,MAAM,QAAQ,CAAC;AAC1C,OAAO,EAAE,UAAU,EAAE,MAAM,oCAAoC,CAAC;AAChE,OAAO,EAAE,aAAa,EAAkB,aAAa,EAAE,MAAM,4BAA4B,CAAC;AAC1F,+CAA+C;AAC/C,sDAAsD;AACtD,OAAO,EAAE,UAAU,EAAE,MAAM,8BAA8B,CAAC;AAC1D,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,YAAY,CAAC;AAE7C,QAAQ,CAAC,qBAAqB,EAAE,GAAG,EAAE;IACpC,MAAM,EAAE,GAAG,IAAI,aAAa,CAAC,MAAM,CAAC,CAAC;IAErC,MAAM,WAAW,GAAG,EAAE,CAAC,MAAM,CAAC,QAAQ,EAAE;QACvC,OAAO,EAAE,EAAE,CAAC,MAAM;KAClB,CAAC,CAAC;IAEH,MAAM,MAAM,GAAG,EAAE,CAAC,MAAM,CAAC,QAAQ,EAAE;QAClC,MAAM,EAAE,WAAW;QACnB,IAAI,EAAE,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,MAAM,CAAC;QACzB,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,KAAK,EAAE,EAAE,CAAC,MAAM,CAAC;KAC7B,CAAC,CAAC;IAEH,MAAM,WAAW,GAAG;QACnB,MAAM,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE;QACvB,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC;QAClB,GAAG,EAAE,IAAI,GAAG,CAAC;YACZ,CAAC,KAAK,EAAE,OAAO,CAAC;YAChB,CAAC,KAAK,EAAE,OAAO,CAAC;SAChB,CAAC;KACF,CAAC;IAEF,EAAE,CAAC,yBAAyB,EAAE,GAAG,EAAE;QAClC,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;QAC1C,MAAM,WAAW,GAAG,IAAI,CAAC,MAAM,CAAC;QAChC,MAAM,gBAAgB,GAAG,IAAI,CAAC,MAAM,CAAC;QACrC,MAAM,CAAC,KAAK,CAAC,gBAAgB,EAAE,WAAW,CAAC,CAAC;IAC7C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,uBAAuB,EAAE,GAAG,EAAE;QAChC,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;QAC1C,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC;QAC5B,MAAM,cAAc,GAAG,IAAI,CAAC,IAAI,CAAC;QACjC,MAAM,CAAC,KAAK,CAAC,cAAc,EAAE,SAAS,CAAC,CAAC;IACzC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,sBAAsB,EAAE,GAAG,EAAE;QAC/B,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;QAC1C,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC;QAC1B,MAAM,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC;QAC/B,MAAM,CAAC,KAAK,CAAC,aAAa,EAAE,QAAQ,CAAC,CAAC;IACvC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,YAAY,EAAE,GAAG,EAAE;QACrB,aAAa;QACb,MAAM,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;QACvB,kBAAkB;QAClB,MAAM,CAAC,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC,CAAC;QACxB,mBAAmB;QACnB,MAAM,CAAC,UAAU,CAAC,IAAI,WAAW,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACpD,iBAAiB;QACjB,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC,CAAC,CAAC;IAClD,CAAC,CAAC,CAAC;AACJ,CAAC,CAAC,CAAC;AAEH,gGAAgG;AAChG,QAAQ,CAAC,kBAAkB,EAAE,GAAG,EAAE;IACjC,MAAM,EAAE,GAAG,IAAI,aAAa,CAAC,MAAM,CAAC,CAAC;IAErC,MAAM,WAAW,GAAG,EAAE,CAAC,MAAM,CAAC,aAAa,EAAE;QAC5C,OAAO,EAAE,EAAE,CAAC,MAAM;KAClB,CAAC,CAAC;IAEH,MAAM,WAAW,GAAG,EAAE,CAAC,MAAM,CAAC,aAAa,EAAE;QAC5C,OAAO,EAAE,EAAE,CAAC,MAAM;KAClB,CAAC,CAAC;IAEH,MAAM,MAAM,GAAG,EAAE,CAAC,MAAM,CAAC,QAAQ,EAAE;QAClC,OAAO,EAAE,EAAE,CAAC,MAAM;QAClB,KAAK,EAAE,WAAW;QAClB,QAAQ,EAAE,EAAE,CAAC,QAAQ,CAAC,WAAW,CAAC;QAClC,SAAS,EAAE,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC;QACjC,SAAS,EAAE,CAAC,WAAW,EAAE,WAAW,CAAC;QACrC,cAAc,EAAE,CAAC,EAAE,CAAC,MAAM,EAAE,WAAW,CAAC;QACxC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,KAAK,EAAE,EAAE,CAAC,MAAM,CAAC;QAC7B,IAAI,EAAE,EAAE,CAAC,KAAK,CAAC,WAAW,CAAC;QAC3B,MAAM,EAAE,EAAE,CAAC,MAAM;KACjB,CAAC,CAAC;IAEH,MAAM,WAAW,GAAG,GAAG,EAAE,CAAC,CAAC;QAC1B,OAAO,EAAE,EAAE;QACX,KAAK,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE;QACtB,QAAQ,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE;QACzB,SAAS,EAAE,IAAI;QACf,SAAS,EAAE,IAAI,WAAW,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC;QAC7C,cAAc,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE;QAC/B,GAAG,EAAE,IAAI,GAAG,CAAC;YACZ,CAAC,KAAK,EAAE,OAAO,CAAC;YAChB,CAAC,KAAK,EAAE,OAAO,CAAC;SAChB,CAAC;QACF,IAAI,EAAE,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC;QACxC,MAAM,EAAE,IAAI,UAAU,CAAC,EAAE,CAAC;KAC1B,CAAC,CAAC;IAEH,EAAE,CAAC,0BAA0B,EAAE,GAAG,EAAE;QACnC,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,EAAE,WAAW,EAAE,CAAC,CAAC;QAC5C,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;QAC/B,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,gBAAgB,EAAE,GAAG,EAAE;QACzB,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,EAAE,WAAW,EAAE,CAAC,CAAC;QAC5C,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QAClC,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,IAAI,EAAE;YAC1B,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;SAC5B;IACF,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,eAAe,EAAE,GAAG,EAAE;QACxB,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,EAAE,WAAW,EAAE,CAAC,CAAC;QAC5C,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAC/B,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,OAAO,CAAC,CAAC;QAC3C,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,OAAO,CAAC,CAAC;QAC3C,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,SAAS,CAAC,CAAC;IAC9C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,iDAAiD,EAAE,GAAG,EAAE;QAC1D,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,EAAE,WAAW,EAAE,CAAC,CAAC;QAC5C,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;IAC5C,CAAC,CAAC,CAAC;IAEH,yFAAyF;IACzF,EAAE,CAAC,4BAA4B,EAAE,GAAG,EAAE;QACrC,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,EAAE,WAAW,EAAE,CAAC,CAAC;QAC5C,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;QACxC,IAAI,CAAC,MAAM,GAAG,IAAI,UAAU,CAAC,EAAE,CAAC,CAAC;QACjC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;IACzC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,gBAAgB,EAAE,GAAG,EAAE;QACzB,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,EAAE,WAAW,EAAE,CAAC,CAAC;QAC5C,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;QACrC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,EAAE,OAAO,EAAE,EAAE,CAAC,CAAC;QACzC,MAAM,QAAQ,GAAG,IAAI,WAAW,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC;QAClD,IAAI,CAAC,KAAK,GAAG,QAAQ,CAAC;QACtB,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;QACnC,IAAI,CAAC,QAAQ,GAAG,IAAI,WAAW,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC;QACjD,IAAI,CAAC,QAAQ,GAAG,IAAI,WAAW,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,6FAA6F;QAC/I,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;IACzC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,kBAAkB,EAAE,GAAG,EAAE;QAC3B,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,EAAE,WAAW,EAAE,CAAC,CAAC;QAC5C,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,EAAE,OAAO,EAAE,EAAE,CAAC,CAAC;QACzC,IAAI,CAAC,QAAQ,GAAG,SAAS,CAAC;QAC1B,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;AACJ,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,gBAAgB,EAAE,GAAG,EAAE;IAC/B,QAAQ,CAAC,oCAAoC,EAAE,GAAG,EAAE;QACnD,MAAM,CAAC,GAAG,IAAI,aAAa,CAAC,MAAM,CAAC,CAAC;QACpC,MAAM,GAAG,GAAG,CAAC,CAAC,MAAM,CAAC,KAAK,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC;QAC9C,MAAM,MAAM,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAE5B,EAAE,CAAC,iBAAiB,EAAE,GAAG,EAAE;YAC1B,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;YAC5C,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;YACtC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC;YACrC,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;YAC5B,IAAI,CAAC,aAAa,EAAE,CAAC,CAAC,6FAA6F;YACnH,MAAM,CAAC,KAAK,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,+DAA+D;YAC/F,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,OAAO,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;QAChD,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,eAAe,EAAE,GAAG,EAAE;YACxB,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;YAC5C,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;YACtC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC;YACrC,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;YAC1B,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC,6FAA6F;YACjH,MAAM,CAAC,KAAK,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,+DAA+D;YAC/F,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,OAAO,CAAC,CAAC,CAAC;QAChD,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,YAAY,EAAE,GAAG,EAAE;YACrB,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;YACzD,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;YACnD,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC;YACrC,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;YAC1B,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,6FAA6F;YAC/G,MAAM,CAAC,KAAK,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,+DAA+D;YAC/F,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;QAC7D,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,MAAM,EAAE,GAAG,EAAE;YACf,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;YAC5C,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;YAClC,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;YACtC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC;QAC3C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,oBAAoB,EAAE,GAAG,EAAE;YAC7B,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;YAC5C,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;YACnC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC;YACrC,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;YAC1B,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;YACnC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YACtC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;QACpC,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,2BAA2B,EAAE,GAAG,EAAE;QAC1C,MAAM,CAAC,GAAG,IAAI,aAAa,CAAC,MAAM,CAAC,CAAC;QACpC,MAAM,MAAM,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;QAEjC,EAAE,CAAC,iBAAiB,EAAE,GAAG,EAAE;YAC1B,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;YACjC,IAAI,CAAC,aAAa,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YACjD,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAC/B,IAAI,CAAC,WAAW,EAAE,CAAC;YACnB,IAAI,CAAC,aAAa,CAAC,CAAC,EAAE,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACpD,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAClC,IAAI,CAAC,WAAW,EAAE,CAAC;YACnB,IAAI,CAAC,aAAa,CAAC,CAAC,EAAE,CAAC,EAAE,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YACxF,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC/C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,eAAe,EAAE,GAAG,EAAE;YACxB,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;YACjC,IAAI,CAAC,WAAW,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YAC/C,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAC/B,IAAI,CAAC,WAAW,EAAE,CAAC;YACnB,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAClD,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAClC,IAAI,CAAC,WAAW,EAAE,CAAC;YACnB,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,EAAE,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YACtF,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC/C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,YAAY,EAAE,GAAG,EAAE;YACrB,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;YACjC,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YAC/C,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAC/B,IAAI,CAAC,WAAW,EAAE,CAAC;YACnB,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAClD,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAClC,IAAI,CAAC,WAAW,EAAE,CAAC;YACnB,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YACtF,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC/C,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,qBAAqB,EAAE,GAAG,EAAE;QACpC,MAAM,CAAC,GAAG,IAAI,aAAa,CAAC,MAAM,CAAC,CAAC;QACpC,MAAM,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,KAAK,EAAE;YAC9B,OAAO,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC;YAC1B,OAAO,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC;YAC1B,QAAQ,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC;YAC5B,OAAO,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC;YAC1B,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC;SACxD,CAAC,CAAC;QACH,MAAM,WAAW,GAAG;YACnB,OAAO,EAAE,EAAE;YACX,OAAO,EAAE,EAAE;YACX,QAAQ,EAAE,EAAE;YACZ,OAAO,EAAE,EAAE;YACX,IAAI,EAAE,EAAE;SACR,CAAC;QACF,EAAE,CAAC,SAAS,EAAE,GAAG,EAAE;YAClB,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;YAC1C,IAAI,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;YAC9B,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC5B,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;YAC5B,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC3C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,UAAU,EAAE,GAAG,EAAE;YACnB,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;YAC1C,IAAI,CAAC,QAAQ,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;YAClC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;YACjC,IAAI,CAAC,QAAQ,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;YAChC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC;QACtD,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,SAAS,EAAE,GAAG,EAAE;YAClB,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;YAC1C,MAAM,OAAO,GAAG,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,EAAE,IAAI,UAAU,CAAC,CAAC,CAAC,EAAE,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;YAC1E,IAAI,CAAC,OAAO,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;YACvC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;YACrC,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;YACrC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;QACzC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,4BAA4B,EAAE,GAAG,EAAE;YACrC,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;YAC1C,MAAM,aAAa,GAA2C,IAAI,CAAC,IAAI,CAAC;YACxE,aAAa,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC;YAChC,MAAM,cAAc,GAA2C,IAAI,CAAC,IAAI,CAAC;YACzE,cAAc,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;YAChC,MAAM,cAAc,GAA4C,IAAI,CAAC,IAAI,CAAC;YAC1E,cAAc,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;YACjC,MAAM,MAAM,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC;YACjC,MAAM,aAAa,GAA2C,IAAI,CAAC,IAAI,CAAC;YACxE,aAAa,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;YAClC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC;QACtD,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,gBAAgB,EAAE,GAAG,EAAE;QAC/B,MAAM,CAAC,GAAG,IAAI,aAAa,CAAC,MAAM,CAAC,CAAC;QACpC,MAAM,MAAM,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;QAEjC,EAAE,CAAC,YAAY,EAAE,GAAG,EAAE;YACrB,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACxC,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAClC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;YACjB,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAChC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,eAAe,EAAE,GAAG,EAAE;YACxB,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAC3C,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACrC,IAAI,CAAC,WAAW,CAAC,YAAY,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC;YAC/C,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAChC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,qBAAqB,EAAE,GAAG,EAAE;YAC9B,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAC3C,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACrC,IAAI,CAAC,WAAW,CAAC,YAAY,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC;YAC/C,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAC/B,IAAI,CAAC,WAAW,EAAE,CAAC;YACnB,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QAC5B,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,0BAA0B,EAAE,GAAG,EAAE;YACnC,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAC3C,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACrC,IAAI,CAAC,WAAW,CAAC,YAAY,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC;YAC/C,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAC/B,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;YAC9B,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7B,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,6BAA6B,EAAE,GAAG,EAAE;YACtC,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAC3C,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACrC,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACvB,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACtC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,4BAA4B,EAAE,GAAG,EAAE;YACrC,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;YACjC,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;YAC3B,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC;QACzC,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,cAAc,EAAE,GAAG,EAAE;QAC7B,QAAQ,CAAC,sBAAsB,EAAE,GAAG,EAAE;YACrC,MAAM,CAAC,GAAG,IAAI,aAAa,CAAC,MAAM,CAAC,CAAC;YACpC,MAAM,MAAM,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;YACjC,MAAM,WAAW,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAEjC,EAAE,CAAC,eAAe,EAAE,GAAG,EAAE;gBACxB,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;gBAC1C,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;gBACrC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;gBACpB,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACtC,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,aAAa,EAAE,GAAG,EAAE;gBACtB,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;gBAC1C,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;gBACrC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;gBAClB,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACtC,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,eAAe,EAAE,GAAG,EAAE;gBACxB,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;gBAC1C,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;gBACrC,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBACvB,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;gBACrC,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBACvB,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;gBACrC,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBACvB,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACtC,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,oBAAoB,EAAE,GAAG,EAAE;gBAC7B,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;gBAC1C,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;gBACrC,IAAI,CAAC,gBAAgB,CAAC,kBAAkB,CAAC,CAAC,EAAE,gBAAgB,CAAC,CAAC,CAAC,CAAC;gBAChE,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACtC,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,kBAAkB,EAAE,GAAG,EAAE;gBAC3B,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;gBAC1C,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;gBACrC,IAAI,CAAC,cAAc,CAAC,kBAAkB,CAAC,CAAC,EAAE,gBAAgB,CAAC,CAAC,CAAC,CAAC;gBAC9D,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACtC,CAAC,CAAC,CAAC;YAEH,QAAQ,CAAC,oBAAoB,EAAE,GAAG,EAAE;gBACnC,SAAS,KAAK,CAAC,KAAa,EAAE,KAAa,EAAE,GAAW;oBACvD,MAAM,QAAQ,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;oBACtC,4CAA4C;oBAC5C,MAAM,KAAK,GAAG,QAAQ,CAAC,MAAM,CAAC,KAAK,EAAE,kBAAkB,CAAC,GAAG,GAAG,KAAK,CAAC,CAAC;oBACrE,2DAA2D;oBAC3D,QAAQ,CAAC,MAAM,CACd,KAAK,IAAI,KAAK;wBACb,CAAC,CAAC,KAAK,CAAC,6CAA6C;wBACrD,CAAC,CAAC,KAAK,IAAI,GAAG;4BACd,CAAC,CAAC,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,8DAA8D;4BACrF,CAAC,CAAC,KAAK,EAAE,mFAAmF;oBAC7F,kBAAkB,CAAC,CAAC,EACpB,GAAG,KAAK,CACR,CAAC;oBAEF,EAAE,CAAC,GAAG,MAAM,CACX,WAAW,CACX,sBAAsB,KAAK,YAAY,KAAK,UAAU,GAAG,QAAQ,MAAM,CACvE,QAAQ,CACR,EAAE,EAAE,GAAG,EAAE;wBACT,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;wBAC1C,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC;wBACpC,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;wBACzC,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;oBAClC,CAAC,CAAC,CAAC;gBACJ,CAAC;gBAED,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,WAAW,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE;oBACxD,uCAAuC;oBACvC,KAAK,IAAI,GAAG,GAAG,KAAK,GAAG,CAAC,EAAE,GAAG,IAAI,WAAW,CAAC,MAAM,EAAE,GAAG,EAAE,EAAE;wBAC3D,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,IAAI,WAAW,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE;4BACzD,KAAK,CAAC,KAAK,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;yBACzB;qBACD;iBACD;YACF,CAAC,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,QAAQ,CAAC,yBAAyB,EAAE,GAAG,EAAE;YACxC,MAAM,CAAC,GAAG,IAAI,aAAa,CAAC,MAAM,CAAC,CAAC;YAEpC,MAAM,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,QAAQ,EAAE;gBACjC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC;gBACxB,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC;aACxB,CAAC,CAAC;YAEH,MAAM,WAAW,GAAG;gBACnB,KAAK,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;gBACnB,KAAK,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;aACnB,CAAC;YAEF,EAAE,CAAC,eAAe,EAAE,GAAG,EAAE;gBACxB,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,OAAO,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;gBACtD,MAAM,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;gBACtC,MAAM,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;gBACtC,KAAK,CAAC,WAAW,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;gBAC5B,MAAM,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;gBAChC,MAAM,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;YAC7C,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,aAAa,EAAE,GAAG,EAAE;gBACtB,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,OAAO,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;gBACtD,MAAM,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;gBACtC,MAAM,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;gBACtC,KAAK,CAAC,SAAS,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;gBAC1B,MAAM,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;gBAChC,MAAM,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;YAC7C,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,eAAe,EAAE,GAAG,EAAE;gBACxB,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,OAAO,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;gBACtD,MAAM,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;gBACtC,MAAM,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;gBACtC,KAAK,CAAC,WAAW,CAAC,YAAY,CAAC,CAAC,EAAE,kBAAkB,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;gBAC/D,MAAM,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;gBAChC,MAAM,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;YAC7C,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,oBAAoB,EAAE,GAAG,EAAE;gBAC7B,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,OAAO,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;gBACtD,MAAM,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;gBACtC,MAAM,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;gBACtC,KAAK,CAAC,gBAAgB,CAAC,kBAAkB,CAAC,CAAC,EAAE,gBAAgB,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;gBACxE,MAAM,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;gBAChC,MAAM,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;YAC7C,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,kBAAkB,EAAE,GAAG,EAAE;gBAC3B,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,OAAO,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;gBACtD,MAAM,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;gBACtC,MAAM,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;gBACtC,KAAK,CAAC,cAAc,CAAC,kBAAkB,CAAC,CAAC,EAAE,gBAAgB,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;gBACtE,MAAM,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;gBAChC,MAAM,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;YAC7C,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,oBAAoB,EAAE,GAAG,EAAE;gBAC7B,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,OAAO,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;gBACtD,MAAM,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;gBACtC,MAAM,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;gBACtC,KAAK,CAAC,gBAAgB;gBACrB,YAAY,CAAC,CAAC;gBACd,kBAAkB,CAAC,CAAC;gBACpB,gBAAgB,CAAC,CAAC,EAClB,KAAK,CACL,CAAC;gBACF,MAAM,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;gBAChC,MAAM,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;YAC7C,CAAC,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,QAAQ,CAAC,sCAAsC,EAAE,GAAG,EAAE;YACrD,MAAM,CAAC,GAAG,IAAI,aAAa,CAAC,MAAM,CAAC,CAAC;YAEpC,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;YAC5C,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;YAE7C,MAAM,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,QAAQ,EAAE;gBACjC,KAAK;gBACL,KAAK;aACL,CAAC,CAAC;YAEH,MAAM,WAAW,GAAG;gBACnB,KAAK,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;gBACf,KAAK,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC;aAChB,CAAC;YAEF,0HAA0H;YAC1H,SAAS,aAAa,CACrB,IAAmC,EACnC,IAAe;gBAEf,OAAO,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC;YAC/C,CAAC;YAED,EAAE,CAAC,eAAe,EAAE,GAAG,EAAE;gBACxB,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;gBAC1C,MAAM,KAAK,GAAG,aAAa,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;gBACvC,MAAM,KAAK,GAAG,aAAa,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;gBACvC,KAAK,CAAC,WAAW,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;gBAC5B,MAAM,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;gBAC/B,MAAM,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;gBACtC,KAAK,CAAC,gBAAgB,CAAC,kBAAkB,CAAC,CAAC,EAAE,gBAAgB,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;gBACxE,MAAM,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;gBACrC,MAAM,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;YACjC,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,aAAa,EAAE,GAAG,EAAE;gBACtB,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;gBAC1C,MAAM,KAAK,GAAG,aAAa,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;gBACvC,MAAM,KAAK,GAAG,aAAa,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;gBACvC,KAAK,CAAC,SAAS,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;gBAC1B,MAAM,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;gBAC/B,MAAM,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;gBACtC,KAAK,CAAC,cAAc,CAAC,kBAAkB,CAAC,CAAC,EAAE,gBAAgB,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;gBACtE,MAAM,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;gBAClC,MAAM,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;YACpC,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,eAAe,EAAE,GAAG,EAAE;gBACxB,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;gBAC1C,MAAM,KAAK,GAAG,aAAa,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;gBACvC,MAAM,KAAK,GAAG,aAAa,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;gBACvC,KAAK,CAAC,WAAW,CAAC,YAAY,CAAC,CAAC,EAAE,iBAAiB,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;gBAC9D,MAAM,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;gBAC/B,MAAM,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;gBACtC,KAAK,CAAC,gBAAgB;gBACrB,YAAY,CAAC,CAAC;gBACd,kBAAkB,CAAC,CAAC;gBACpB,gBAAgB,CAAC,CAAC,EAClB,KAAK,CACL,CAAC;gBACF,MAAM,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;gBACrC,MAAM,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;YACjC,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,4BAA4B,EAAE,GAAG,EAAE;gBACrC,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;gBAC1C,MAAM,KAAK,GAAG,aAAa,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;gBACvC,MAAM,KAAK,GAAG,aAAa,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;gBACvC,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,CAClB,KAAK,CAAC,gBAAgB;gBACrB,YAAY,CAAC,CAAC;gBACd,kBAAkB,CAAC,CAAC;gBACpB,gBAAgB,CAAC,CAAC,EAClB,KAAK,CACL,CACD,CAAC;YACH,CAAC,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;AACJ,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,eAAe,EAAE,GAAG,EAAE;IAC9B,MAAM,EAAE,GAAG,IAAI,aAAa,CAAC,MAAM,CAAC,CAAC;IAErC,MAAM,MAAM,GAAG,EAAE,CAAC,MAAM,CAAC,QAAQ,EAAE,EAAE,OAAO,EAAE,EAAE,CAAC,MAAM,EAAE,CAAC,CAAC;IAE3D,MAAM,MAAM,GAAG,EAAE,CAAC,MAAM,CAAC,QAAQ,EAAE;QAClC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,MAAM,CAAC;QACtB,SAAS,EAAE,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC;KACzB,CAAC,CAAC;IAEH,MAAM,WAAW,GAAG;QACnB,GAAG,EAAE,IAAI,GAAG,CAAC;YACZ,CAAC,KAAK,EAAE,OAAO,CAAC;YAChB,CAAC,KAAK,EAAE,OAAO,CAAC;SAChB,CAAC;QACF,SAAS,EAAE,IAAI,GAAG,EAAE;KACpB,CAAC;IAEF,EAAE,CAAC,SAAS,EAAE,GAAG,EAAE;QAClB,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;QAC1C,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,EAAE;YAChD,CAAC,KAAK,EAAE,OAAO,CAAC;YAChB,CAAC,KAAK,EAAE,OAAO,CAAC;SAChB,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,MAAM,EAAE,GAAG,EAAE;QACf,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;QAC1C,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC;IAC/D,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,QAAQ,EAAE,GAAG,EAAE;QACjB,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;QAC1C,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC;IACrE,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,WAAW,EAAE,GAAG,EAAE;QACpB,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;QAC1C,MAAM,MAAM,GAAG,EAAE,CAAC;QAClB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,GAAG,EAAE;YAC7B,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;SACnB;QAED,MAAM,CAAC,SAAS,CAAC,MAAM,EAAE;YACxB,CAAC,KAAK,EAAE,OAAO,CAAC;YAChB,CAAC,KAAK,EAAE,OAAO,CAAC;SAChB,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,KAAK,EAAE,GAAG,EAAE;QACd,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;QAC1C,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,CAAC;QACxC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,CAAC;QACxC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,KAAK,CAAC,CAAC;IAC1C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,KAAK,EAAE,GAAG,EAAE;QACd,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;QAC1C,mBAAmB;QACnB,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;QAC1B,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAC/B,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;QAC5B,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,CAAC;QAExC,0BAA0B;QAC1B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;QAC1B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC,6FAA6F;QACxH,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAC/B,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;QAC5B,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,CAAC;QAExC,0BAA0B;QAC1B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;QAC/B,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAC/B,MAAM,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;IAC9B,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,YAAY,EAAE,GAAG,EAAE;QACrB,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;QAC1C,MAAM,CAAC,GAAG,IAAI,MAAM,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC;QACtC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAC7B,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,+DAA+D;QAC3G,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC;IAC7D,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,QAAQ,EAAE,GAAG,EAAE;QACjB,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;QAC1C,wBAAwB;QACxB,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACvB,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAC/B,MAAM,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;QAE7B,2BAA2B;QAC3B,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACvB,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IAChC,CAAC,CAAC,CAAC;AACJ,CAAC,CAAC,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { strict as assert } from \"assert\";\nimport { MockHandle } from \"@fluidframework/test-runtime-utils\";\nimport { TreeArrayNode, NodeFromSchema, SchemaFactory } from \"../../simple-tree/index.js\";\n// TODO: test other things from \"proxies\" file.\n// eslint-disable-next-line import/no-internal-modules\nimport { isTreeNode } from \"../../simple-tree/proxies.js\";\nimport { hydrate, pretty } from \"./utils.js\";\n\ndescribe(\"simple-tree proxies\", () => {\n\tconst sb = new SchemaFactory(\"test\");\n\n\tconst childSchema = sb.object(\"object\", {\n\t\tcontent: sb.number,\n\t});\n\n\tconst schema = sb.object(\"parent\", {\n\t\tobject: childSchema,\n\t\tlist: sb.array(sb.number),\n\t\tmap: sb.map(\"map\", sb.string),\n\t});\n\n\tconst initialTree = {\n\t\tobject: { content: 42 },\n\t\tlist: [42, 42, 42],\n\t\tmap: new Map([\n\t\t\t[\"foo\", \"Hello\"],\n\t\t\t[\"bar\", \"World\"],\n\t\t]),\n\t};\n\n\tit(\"cache and reuse objects\", () => {\n\t\tconst root = hydrate(schema, initialTree);\n\t\tconst objectProxy = root.object;\n\t\tconst objectProxyAgain = root.object;\n\t\tassert.equal(objectProxyAgain, objectProxy);\n\t});\n\n\tit(\"cache and reuse lists\", () => {\n\t\tconst root = hydrate(schema, initialTree);\n\t\tconst listProxy = root.list;\n\t\tconst listProxyAgain = root.list;\n\t\tassert.equal(listProxyAgain, listProxy);\n\t});\n\n\tit(\"cache and reuse maps\", () => {\n\t\tconst root = hydrate(schema, initialTree);\n\t\tconst mapProxy = root.map;\n\t\tconst mapProxyAgain = root.map;\n\t\tassert.equal(mapProxyAgain, mapProxy);\n\t});\n\n\tit(\"isTreeNode\", () => {\n\t\t// Non object\n\t\tassert(!isTreeNode(5));\n\t\t// Non node object\n\t\tassert(!isTreeNode({}));\n\t\t// Unhydrated node:\n\t\tassert(isTreeNode(new childSchema({ content: 5 })));\n\t\t// Hydrated node:\n\t\tassert(isTreeNode(hydrate(schema, initialTree)));\n\t});\n});\n\n// TODO: nest these tests in the top level block to reduce total number of top level test suites\ndescribe(\"SharedTreeObject\", () => {\n\tconst sb = new SchemaFactory(\"test\");\n\n\tconst numberChild = sb.object(\"numberChild\", {\n\t\tcontent: sb.number,\n\t});\n\n\tconst stringChild = sb.object(\"stringChild\", {\n\t\tcontent: sb.string,\n\t});\n\n\tconst schema = sb.object(\"parent\", {\n\t\tcontent: sb.number,\n\t\tchild: numberChild,\n\t\toptional: sb.optional(numberChild),\n\t\tpolyValue: [sb.number, sb.string],\n\t\tpolyChild: [numberChild, stringChild],\n\t\tpolyValueChild: [sb.number, numberChild],\n\t\tmap: sb.map(\"map\", sb.string),\n\t\tlist: sb.array(numberChild),\n\t\thandle: sb.handle,\n\t});\n\n\tconst initialTree = () => ({\n\t\tcontent: 42,\n\t\tchild: { content: 42 },\n\t\toptional: { content: 42 },\n\t\tpolyValue: \"42\",\n\t\tpolyChild: new stringChild({ content: \"42\" }),\n\t\tpolyValueChild: { content: 42 },\n\t\tmap: new Map([\n\t\t\t[\"foo\", \"Hello\"],\n\t\t\t[\"bar\", \"World\"],\n\t\t]),\n\t\tlist: [{ content: 42 }, { content: 42 }],\n\t\thandle: new MockHandle(42),\n\t});\n\n\tit(\"can read required fields\", () => {\n\t\tconst root = hydrate(schema, initialTree());\n\t\tassert.equal(root.content, 42);\n\t\tassert.equal(root.child.content, 42);\n\t});\n\n\tit(\"can read lists\", () => {\n\t\tconst root = hydrate(schema, initialTree());\n\t\tassert.equal(root.list.length, 2);\n\t\tfor (const x of root.list) {\n\t\t\tassert.equal(x.content, 42);\n\t\t}\n\t});\n\n\tit(\"can read maps\", () => {\n\t\tconst root = hydrate(schema, initialTree());\n\t\tassert.equal(root.map.size, 2);\n\t\tassert.equal(root.map.get(\"foo\"), \"Hello\");\n\t\tassert.equal(root.map.get(\"bar\"), \"World\");\n\t\tassert.equal(root.map.get(\"baz\"), undefined);\n\t});\n\n\tit(\"can read fields common to all polymorphic types\", () => {\n\t\tconst root = hydrate(schema, initialTree());\n\t\tassert.equal(root.polyChild.content, \"42\");\n\t});\n\n\t// TODO:#6133: Make this properly async and check that the value of the handle is correct\n\tit(\"can read and write handles\", () => {\n\t\tconst root = hydrate(schema, initialTree());\n\t\tassert.notEqual(root.handle, undefined);\n\t\troot.handle = new MockHandle(43);\n\t\tassert.notEqual(root.handle, undefined);\n\t});\n\n\tit(\"can set fields\", () => {\n\t\tconst root = hydrate(schema, initialTree());\n\t\tassert.equal(root.child.content, 42);\n\t\tassert.equal(root.optional?.content, 42);\n\t\tconst newChild = new numberChild({ content: 43 });\n\t\troot.child = newChild;\n\t\tassert.equal(root.child, newChild);\n\t\troot.optional = new numberChild({ content: 43 });\n\t\troot.optional = new numberChild({ content: 43 }); // Check that we can do a \"no-op\" change (a change which does not change the tree's content).\n\t\tassert.equal(root.optional.content, 43);\n\t});\n\n\tit(\"can unset fields\", () => {\n\t\tconst root = hydrate(schema, initialTree());\n\t\tassert.equal(root.optional?.content, 42);\n\t\troot.optional = undefined;\n\t\tassert.equal(root.optional, undefined);\n\t});\n});\n\ndescribe(\"SharedTreeList\", () => {\n\tdescribe(\"inserting nodes created by factory\", () => {\n\t\tconst _ = new SchemaFactory(\"test\");\n\t\tconst obj = _.object(\"Obj\", { id: _.string });\n\t\tconst schema = _.array(obj);\n\n\t\tit(\"insertAtStart()\", () => {\n\t\t\tconst root = hydrate(schema, [{ id: \"B\" }]);\n\t\t\tassert.deepEqual(root, [{ id: \"B\" }]);\n\t\t\tconst newItem = new obj({ id: \"A\" });\n\t\t\troot.insertAtStart(newItem);\n\t\t\troot.insertAtStart(); // Check that we can do a \"no-op\" change (a change which does not change the tree's content).\n\t\t\tassert.equal(newItem, root[0]); // Check that the inserted and read proxies are the same object\n\t\t\tassert.deepEqual(root, [newItem, { id: \"B\" }]);\n\t\t});\n\n\t\tit(\"insertAtEnd()\", () => {\n\t\t\tconst root = hydrate(schema, [{ id: \"A\" }]);\n\t\t\tassert.deepEqual(root, [{ id: \"A\" }]);\n\t\t\tconst newItem = new obj({ id: \"B\" });\n\t\t\troot.insertAtEnd(newItem);\n\t\t\troot.insertAtEnd(); // Check that we can do a \"no-op\" change (a change which does not change the tree's content).\n\t\t\tassert.equal(newItem, root[1]); // Check that the inserted and read proxies are the same object\n\t\t\tassert.deepEqual(root, [{ id: \"A\" }, newItem]);\n\t\t});\n\n\t\tit(\"insertAt()\", () => {\n\t\t\tconst root = hydrate(schema, [{ id: \"A\" }, { id: \"C\" }]);\n\t\t\tassert.deepEqual(root, [{ id: \"A\" }, { id: \"C\" }]);\n\t\t\tconst newItem = new obj({ id: \"B\" });\n\t\t\troot.insertAt(1, newItem);\n\t\t\troot.insertAt(1); // Check that we can do a \"no-op\" change (a change which does not change the tree's content).\n\t\t\tassert.equal(newItem, root[1]); // Check that the inserted and read proxies are the same object\n\t\t\tassert.deepEqual(root, [{ id: \"A\" }, newItem, { id: \"C\" }]);\n\t\t});\n\n\t\tit(\"at()\", () => {\n\t\t\tconst root = hydrate(schema, [{ id: \"B\" }]);\n\t\t\tassert.equal(root.at(0), root[0]);\n\t\t\tassert.deepEqual(root, [{ id: \"B\" }]);\n\t\t\tassert.deepEqual(root.at(0), { id: \"B\" });\n\t\t});\n\n\t\tit(\"at() with negative\", () => {\n\t\t\tconst root = hydrate(schema, [{ id: \"B\" }]);\n\t\t\tassert.equal(root.at(-1), root[0]);\n\t\t\tconst newItem = new obj({ id: \"C\" });\n\t\t\troot.insertAt(1, newItem);\n\t\t\tassert.equal(root.at(-1), root[1]);\n\t\t\tassert.equal(root.at(-1), root.at(1));\n\t\t\tassert.equal(root.at(-1), newItem);\n\t\t});\n\t});\n\n\tdescribe(\"inserting inlined content\", () => {\n\t\tconst _ = new SchemaFactory(\"test\");\n\t\tconst schema = _.array(_.number);\n\n\t\tit(\"insertAtStart()\", () => {\n\t\t\tconst list = hydrate(schema, []);\n\t\t\tlist.insertAtStart(TreeArrayNode.spread([0, 1]));\n\t\t\tassert.deepEqual(list, [0, 1]);\n\t\t\tlist.removeRange();\n\t\t\tlist.insertAtStart(0, TreeArrayNode.spread([1]), 2);\n\t\t\tassert.deepEqual(list, [0, 1, 2]);\n\t\t\tlist.removeRange();\n\t\t\tlist.insertAtStart(0, 1, TreeArrayNode.spread([2, 3]), 4, TreeArrayNode.spread([5, 6]));\n\t\t\tassert.deepEqual(list, [0, 1, 2, 3, 4, 5, 6]);\n\t\t});\n\n\t\tit(\"insertAtEnd()\", () => {\n\t\t\tconst list = hydrate(schema, []);\n\t\t\tlist.insertAtEnd(TreeArrayNode.spread([0, 1]));\n\t\t\tassert.deepEqual(list, [0, 1]);\n\t\t\tlist.removeRange();\n\t\t\tlist.insertAtEnd(0, TreeArrayNode.spread([1]), 2);\n\t\t\tassert.deepEqual(list, [0, 1, 2]);\n\t\t\tlist.removeRange();\n\t\t\tlist.insertAtEnd(0, 1, TreeArrayNode.spread([2, 3]), 4, TreeArrayNode.spread([5, 6]));\n\t\t\tassert.deepEqual(list, [0, 1, 2, 3, 4, 5, 6]);\n\t\t});\n\n\t\tit(\"insertAt()\", () => {\n\t\t\tconst list = hydrate(schema, []);\n\t\t\tlist.insertAt(0, TreeArrayNode.spread([0, 1]));\n\t\t\tassert.deepEqual(list, [0, 1]);\n\t\t\tlist.removeRange();\n\t\t\tlist.insertAt(0, 0, TreeArrayNode.spread([1]), 2);\n\t\t\tassert.deepEqual(list, [0, 1, 2]);\n\t\t\tlist.removeRange();\n\t\t\tlist.insertAt(0, 0, 1, TreeArrayNode.spread([2, 3]), 4, TreeArrayNode.spread([5, 6]));\n\t\t\tassert.deepEqual(list, [0, 1, 2, 3, 4, 5, 6]);\n\t\t});\n\t});\n\n\tdescribe(\"inserting primitive\", () => {\n\t\tconst _ = new SchemaFactory(\"test\");\n\t\tconst schema = _.object(\"Obj\", {\n\t\t\tnumbers: _.array(_.number),\n\t\t\tstrings: _.array(_.string),\n\t\t\tbooleans: _.array(_.boolean),\n\t\t\thandles: _.array(_.handle),\n\t\t\tpoly: _.array([_.number, _.string, _.boolean, _.handle]),\n\t\t});\n\t\tconst initialTree = {\n\t\t\tnumbers: [],\n\t\t\tstrings: [],\n\t\t\tbooleans: [],\n\t\t\thandles: [],\n\t\t\tpoly: [],\n\t\t};\n\t\tit(\"numbers\", () => {\n\t\t\tconst root = hydrate(schema, initialTree);\n\t\t\troot.numbers.insertAtStart(0);\n\t\t\troot.numbers.insertAt(1, 1);\n\t\t\troot.numbers.insertAtEnd(2);\n\t\t\tassert.deepEqual(root.numbers, [0, 1, 2]);\n\t\t});\n\n\t\tit(\"booleans\", () => {\n\t\t\tconst root = hydrate(schema, initialTree);\n\t\t\troot.booleans.insertAtStart(true);\n\t\t\troot.booleans.insertAt(1, false);\n\t\t\troot.booleans.insertAtEnd(true);\n\t\t\tassert.deepEqual(root.booleans, [true, false, true]);\n\t\t});\n\n\t\tit(\"handles\", () => {\n\t\t\tconst root = hydrate(schema, initialTree);\n\t\t\tconst handles = [new MockHandle(5), new MockHandle(6), new MockHandle(7)];\n\t\t\troot.handles.insertAtStart(handles[0]);\n\t\t\troot.handles.insertAt(1, handles[1]);\n\t\t\troot.handles.insertAtEnd(handles[2]);\n\t\t\tassert.deepEqual(root.handles, handles);\n\t\t});\n\n\t\tit(\"of multiple possible types\", () => {\n\t\t\tconst root = hydrate(schema, initialTree);\n\t\t\tconst allowsStrings: typeof root.numbers | typeof root.poly = root.poly;\n\t\t\tallowsStrings.insertAtStart(42);\n\t\t\tconst allowsStsrings: typeof root.strings | typeof root.poly = root.poly;\n\t\t\tallowsStsrings.insertAt(1, \"s\");\n\t\t\tconst allowsBooleans: typeof root.booleans | typeof root.poly = root.poly;\n\t\t\tallowsBooleans.insertAtEnd(true);\n\t\t\tconst handle = new MockHandle(5);\n\t\t\tconst allowsHandles: typeof root.handles | typeof root.poly = root.poly;\n\t\t\tallowsHandles.insertAtEnd(handle);\n\t\t\tassert.deepEqual(root.poly, [42, \"s\", true, handle]);\n\t\t});\n\t});\n\n\tdescribe(\"removing items\", () => {\n\t\tconst _ = new SchemaFactory(\"test\");\n\t\tconst schema = _.array(_.number);\n\n\t\tit(\"removeAt()\", () => {\n\t\t\tconst list = hydrate(schema, [0, 1, 2]);\n\t\t\tassert.deepEqual(list, [0, 1, 2]);\n\t\t\tlist.removeAt(1);\n\t\t\tassert.deepEqual(list, [0, 2]);\n\t\t});\n\n\t\tit(\"removeRange()\", () => {\n\t\t\tconst list = hydrate(schema, [0, 1, 2, 3]);\n\t\t\tassert.deepEqual(list, [0, 1, 2, 3]);\n\t\t\tlist.removeRange(/* start: */ 1, /* end: */ 3);\n\t\t\tassert.deepEqual(list, [0, 3]);\n\t\t});\n\n\t\tit(\"removeRange() - all\", () => {\n\t\t\tconst list = hydrate(schema, [0, 1, 2, 3]);\n\t\t\tassert.deepEqual(list, [0, 1, 2, 3]);\n\t\t\tlist.removeRange(/* start: */ 1, /* end: */ 3);\n\t\t\tassert.deepEqual(list, [0, 3]);\n\t\t\tlist.removeRange();\n\t\t\tassert.deepEqual(list, []);\n\t\t});\n\n\t\tit(\"removeRange() - past end\", () => {\n\t\t\tconst list = hydrate(schema, [0, 1, 2, 3]);\n\t\t\tassert.deepEqual(list, [0, 1, 2, 3]);\n\t\t\tlist.removeRange(/* start: */ 1, /* end: */ 3);\n\t\t\tassert.deepEqual(list, [0, 3]);\n\t\t\tlist.removeRange(1, Infinity);\n\t\t\tassert.deepEqual(list, [0]);\n\t\t});\n\n\t\tit(\"removeRange() - empty range\", () => {\n\t\t\tconst list = hydrate(schema, [0, 1, 2, 3]);\n\t\t\tassert.deepEqual(list, [0, 1, 2, 3]);\n\t\t\tlist.removeRange(2, 2);\n\t\t\tassert.deepEqual(list, [0, 1, 2, 3]);\n\t\t});\n\n\t\tit(\"removeRange() - empty list\", () => {\n\t\t\tconst list = hydrate(schema, []);\n\t\t\tassert.deepEqual(list, []);\n\t\t\tassert.throws(() => list.removeRange());\n\t\t});\n\t});\n\n\tdescribe(\"moving items\", () => {\n\t\tdescribe(\"within the same list\", () => {\n\t\t\tconst _ = new SchemaFactory(\"test\");\n\t\t\tconst schema = _.array(_.number);\n\t\t\tconst initialTree = [0, 1, 2, 3];\n\n\t\t\tit(\"moveToStart()\", () => {\n\t\t\t\tconst list = hydrate(schema, initialTree);\n\t\t\t\tassert.deepEqual(list, [0, 1, 2, 3]);\n\t\t\t\tlist.moveToStart(1);\n\t\t\t\tassert.deepEqual(list, [1, 0, 2, 3]);\n\t\t\t});\n\n\t\t\tit(\"moveToEnd()\", () => {\n\t\t\t\tconst list = hydrate(schema, initialTree);\n\t\t\t\tassert.deepEqual(list, [0, 1, 2, 3]);\n\t\t\t\tlist.moveToEnd(1);\n\t\t\t\tassert.deepEqual(list, [0, 2, 3, 1]);\n\t\t\t});\n\n\t\t\tit(\"moveToIndex()\", () => {\n\t\t\t\tconst list = hydrate(schema, initialTree);\n\t\t\t\tassert.deepEqual(list, [0, 1, 2, 3]);\n\t\t\t\tlist.moveToIndex(1, 2);\n\t\t\t\tassert.deepEqual(list, [0, 2, 1, 3]);\n\t\t\t\tlist.moveToIndex(2, 1);\n\t\t\t\tassert.deepEqual(list, [0, 2, 1, 3]);\n\t\t\t\tlist.moveToIndex(2, 0);\n\t\t\t\tassert.deepEqual(list, [2, 0, 1, 3]);\n\t\t\t});\n\n\t\t\tit(\"moveRangeToStart()\", () => {\n\t\t\t\tconst list = hydrate(schema, initialTree);\n\t\t\t\tassert.deepEqual(list, [0, 1, 2, 3]);\n\t\t\t\tlist.moveRangeToStart(/* sourceStart: */ 1, /* sourceEnd: */ 3);\n\t\t\t\tassert.deepEqual(list, [1, 2, 0, 3]);\n\t\t\t});\n\n\t\t\tit(\"moveRangeToEnd()\", () => {\n\t\t\t\tconst list = hydrate(schema, initialTree);\n\t\t\t\tassert.deepEqual(list, [0, 1, 2, 3]);\n\t\t\t\tlist.moveRangeToEnd(/* sourceStart: */ 1, /* sourceEnd: */ 3);\n\t\t\t\tassert.deepEqual(list, [0, 3, 1, 2]);\n\t\t\t});\n\n\t\t\tdescribe(\"moveRangeToIndex()\", () => {\n\t\t\t\tfunction check(index: number, start: number, end: number) {\n\t\t\t\t\tconst expected = initialTree.slice(0);\n\t\t\t\t\t// Remove the moved items from [start..end).\n\t\t\t\t\tconst moved = expected.splice(start, /* deleteCount: */ end - start);\n\t\t\t\t\t// Re-insert the moved items, adjusting index as necessary.\n\t\t\t\t\texpected.splice(\n\t\t\t\t\t\tindex <= start\n\t\t\t\t\t\t\t? index // If the index is <= start, it is unmodified\n\t\t\t\t\t\t\t: index >= end\n\t\t\t\t\t\t\t? index - moved.length // If the index is >= end, subtract the number of moved items.\n\t\t\t\t\t\t\t: start, // If the index is inside the moved window, slide it left to the starting position.\n\t\t\t\t\t\t/* deleteCount: */ 0,\n\t\t\t\t\t\t...moved,\n\t\t\t\t\t);\n\n\t\t\t\t\tit(`${pretty(\n\t\t\t\t\t\tinitialTree,\n\t\t\t\t\t)}.moveToStart(dest: ${index}, start: ${start}, end: ${end}) -> ${pretty(\n\t\t\t\t\t\texpected,\n\t\t\t\t\t)}`, () => {\n\t\t\t\t\t\tconst list = hydrate(schema, initialTree);\n\t\t\t\t\t\tassert.deepEqual(list, initialTree);\n\t\t\t\t\t\tlist.moveRangeToIndex(index, start, end);\n\t\t\t\t\t\tassert.deepEqual(list, expected);\n\t\t\t\t\t});\n\t\t\t\t}\n\n\t\t\t\tfor (let start = 0; start < initialTree.length; start++) {\n\t\t\t\t\t// TODO: Empty moves should be allowed.\n\t\t\t\t\tfor (let end = start + 1; end <= initialTree.length; end++) {\n\t\t\t\t\t\tfor (let index = 0; index <= initialTree.length; index++) {\n\t\t\t\t\t\t\tcheck(index, start, end);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t});\n\t\t});\n\n\t\tdescribe(\"between different lists\", () => {\n\t\t\tconst _ = new SchemaFactory(\"test\");\n\n\t\t\tconst schema = _.object(\"parent\", {\n\t\t\t\tlistA: _.array(_.string),\n\t\t\t\tlistB: _.array(_.string),\n\t\t\t});\n\n\t\t\tconst initialTree = {\n\t\t\t\tlistA: [\"a0\", \"a1\"],\n\t\t\t\tlistB: [\"b0\", \"b1\"],\n\t\t\t};\n\n\t\t\tit(\"moveToStart()\", () => {\n\t\t\t\tconst { listA, listB } = hydrate(schema, initialTree);\n\t\t\t\tassert.deepEqual(listA, [\"a0\", \"a1\"]);\n\t\t\t\tassert.deepEqual(listB, [\"b0\", \"b1\"]);\n\t\t\t\tlistB.moveToStart(0, listA);\n\t\t\t\tassert.deepEqual(listA, [\"a1\"]);\n\t\t\t\tassert.deepEqual(listB, [\"a0\", \"b0\", \"b1\"]);\n\t\t\t});\n\n\t\t\tit(\"moveToEnd()\", () => {\n\t\t\t\tconst { listA, listB } = hydrate(schema, initialTree);\n\t\t\t\tassert.deepEqual(listA, [\"a0\", \"a1\"]);\n\t\t\t\tassert.deepEqual(listB, [\"b0\", \"b1\"]);\n\t\t\t\tlistB.moveToEnd(0, listA);\n\t\t\t\tassert.deepEqual(listA, [\"a1\"]);\n\t\t\t\tassert.deepEqual(listB, [\"b0\", \"b1\", \"a0\"]);\n\t\t\t});\n\n\t\t\tit(\"moveToIndex()\", () => {\n\t\t\t\tconst { listA, listB } = hydrate(schema, initialTree);\n\t\t\t\tassert.deepEqual(listA, [\"a0\", \"a1\"]);\n\t\t\t\tassert.deepEqual(listB, [\"b0\", \"b1\"]);\n\t\t\t\tlistB.moveToIndex(/* index: */ 1, /* sourceStart: */ 0, listA);\n\t\t\t\tassert.deepEqual(listA, [\"a1\"]);\n\t\t\t\tassert.deepEqual(listB, [\"b0\", \"a0\", \"b1\"]);\n\t\t\t});\n\n\t\t\tit(\"moveRangeToStart()\", () => {\n\t\t\t\tconst { listA, listB } = hydrate(schema, initialTree);\n\t\t\t\tassert.deepEqual(listA, [\"a0\", \"a1\"]);\n\t\t\t\tassert.deepEqual(listB, [\"b0\", \"b1\"]);\n\t\t\t\tlistB.moveRangeToStart(/* sourceStart: */ 0, /* sourceEnd: */ 1, listA);\n\t\t\t\tassert.deepEqual(listA, [\"a1\"]);\n\t\t\t\tassert.deepEqual(listB, [\"a0\", \"b0\", \"b1\"]);\n\t\t\t});\n\n\t\t\tit(\"moveRangeToEnd()\", () => {\n\t\t\t\tconst { listA, listB } = hydrate(schema, initialTree);\n\t\t\t\tassert.deepEqual(listA, [\"a0\", \"a1\"]);\n\t\t\t\tassert.deepEqual(listB, [\"b0\", \"b1\"]);\n\t\t\t\tlistB.moveRangeToEnd(/* sourceStart: */ 0, /* sourceEnd: */ 1, listA);\n\t\t\t\tassert.deepEqual(listA, [\"a1\"]);\n\t\t\t\tassert.deepEqual(listB, [\"b0\", \"b1\", \"a0\"]);\n\t\t\t});\n\n\t\t\tit(\"moveRangeToIndex()\", () => {\n\t\t\t\tconst { listA, listB } = hydrate(schema, initialTree);\n\t\t\t\tassert.deepEqual(listA, [\"a0\", \"a1\"]);\n\t\t\t\tassert.deepEqual(listB, [\"b0\", \"b1\"]);\n\t\t\t\tlistB.moveRangeToIndex(\n\t\t\t\t\t/* index: */ 1,\n\t\t\t\t\t/* sourceStart: */ 0,\n\t\t\t\t\t/* sourceEnd: */ 1,\n\t\t\t\t\tlistA,\n\t\t\t\t);\n\t\t\t\tassert.deepEqual(listA, [\"a1\"]);\n\t\t\t\tassert.deepEqual(listB, [\"b0\", \"a0\", \"b1\"]);\n\t\t\t});\n\t\t});\n\n\t\tdescribe(\"between lists with overlapping types\", () => {\n\t\t\tconst _ = new SchemaFactory(\"test\");\n\n\t\t\tconst listA = _.array([_.string, _.number]);\n\t\t\tconst listB = _.array([_.number, _.boolean]);\n\n\t\t\tconst schema = _.object(\"parent\", {\n\t\t\t\tlistA,\n\t\t\t\tlistB,\n\t\t\t});\n\n\t\t\tconst initialTree = {\n\t\t\t\tlistA: [\"a\", 1],\n\t\t\t\tlistB: [2, true],\n\t\t\t};\n\n\t\t\t/** This function returns a union of both listA and listB, which exercises more interesting compile type-checking cases */\n\t\t\tfunction getEitherList(\n\t\t\t\troot: NodeFromSchema<typeof schema>,\n\t\t\t\tlist: \"a\" | \"b\",\n\t\t\t): NodeFromSchema<typeof listA> | NodeFromSchema<typeof listB> {\n\t\t\t\treturn list === \"a\" ? root.listA : root.listB;\n\t\t\t}\n\n\t\t\tit(\"move to start\", () => {\n\t\t\t\tconst root = hydrate(schema, initialTree);\n\t\t\t\tconst list1 = getEitherList(root, \"a\");\n\t\t\t\tconst list2 = getEitherList(root, \"b\");\n\t\t\t\tlist2.moveToStart(1, list1);\n\t\t\t\tassert.deepEqual(list1, [\"a\"]);\n\t\t\t\tassert.deepEqual(list2, [1, 2, true]);\n\t\t\t\tlist1.moveRangeToStart(/* sourceStart: */ 0, /* sourceEnd: */ 2, list2);\n\t\t\t\tassert.deepEqual(list1, [1, 2, \"a\"]);\n\t\t\t\tassert.deepEqual(list2, [true]);\n\t\t\t});\n\n\t\t\tit(\"move to end\", () => {\n\t\t\t\tconst root = hydrate(schema, initialTree);\n\t\t\t\tconst list1 = getEitherList(root, \"a\");\n\t\t\t\tconst list2 = getEitherList(root, \"b\");\n\t\t\t\tlist2.moveToEnd(1, list1);\n\t\t\t\tassert.deepEqual(list1, [\"a\"]);\n\t\t\t\tassert.deepEqual(list2, [2, true, 1]);\n\t\t\t\tlist1.moveRangeToEnd(/* sourceStart: */ 0, /* sourceEnd: */ 1, list2);\n\t\t\t\tassert.deepEqual(list1, [\"a\", 2]);\n\t\t\t\tassert.deepEqual(list2, [true, 1]);\n\t\t\t});\n\n\t\t\tit(\"move to index\", () => {\n\t\t\t\tconst root = hydrate(schema, initialTree);\n\t\t\t\tconst list1 = getEitherList(root, \"a\");\n\t\t\t\tconst list2 = getEitherList(root, \"b\");\n\t\t\t\tlist2.moveToIndex(/* index: */ 1, /* sourceIndex */ 1, list1);\n\t\t\t\tassert.deepEqual(list1, [\"a\"]);\n\t\t\t\tassert.deepEqual(list2, [2, 1, true]);\n\t\t\t\tlist1.moveRangeToIndex(\n\t\t\t\t\t/* index: */ 0,\n\t\t\t\t\t/* sourceStart: */ 0,\n\t\t\t\t\t/* sourceEnd: */ 2,\n\t\t\t\t\tlist2,\n\t\t\t\t);\n\t\t\t\tassert.deepEqual(list1, [2, 1, \"a\"]);\n\t\t\t\tassert.deepEqual(list2, [true]);\n\t\t\t});\n\n\t\t\tit(\"fails if incompatible type\", () => {\n\t\t\t\tconst root = hydrate(schema, initialTree);\n\t\t\t\tconst list1 = getEitherList(root, \"a\");\n\t\t\t\tconst list2 = getEitherList(root, \"b\");\n\t\t\t\tassert.throws(() =>\n\t\t\t\t\tlist2.moveRangeToIndex(\n\t\t\t\t\t\t/* index: */ 0,\n\t\t\t\t\t\t/* sourceStart: */ 0,\n\t\t\t\t\t\t/* sourceEnd: */ 1,\n\t\t\t\t\t\tlist1,\n\t\t\t\t\t),\n\t\t\t\t);\n\t\t\t});\n\t\t});\n\t});\n});\n\ndescribe(\"SharedTreeMap\", () => {\n\tconst sb = new SchemaFactory(\"test\");\n\n\tconst object = sb.object(\"object\", { content: sb.number });\n\n\tconst schema = sb.object(\"parent\", {\n\t\tmap: sb.map(sb.string),\n\t\tobjectMap: sb.map(object),\n\t});\n\n\tconst initialTree = {\n\t\tmap: new Map([\n\t\t\t[\"foo\", \"Hello\"],\n\t\t\t[\"bar\", \"World\"],\n\t\t]),\n\t\tobjectMap: new Map(),\n\t};\n\n\tit(\"entries\", () => {\n\t\tconst root = hydrate(schema, initialTree);\n\t\tassert.deepEqual(Array.from(root.map.entries()), [\n\t\t\t[\"foo\", \"Hello\"],\n\t\t\t[\"bar\", \"World\"],\n\t\t]);\n\t});\n\n\tit(\"keys\", () => {\n\t\tconst root = hydrate(schema, initialTree);\n\t\tassert.deepEqual(Array.from(root.map.keys()), [\"foo\", \"bar\"]);\n\t});\n\n\tit(\"values\", () => {\n\t\tconst root = hydrate(schema, initialTree);\n\t\tassert.deepEqual(Array.from(root.map.values()), [\"Hello\", \"World\"]);\n\t});\n\n\tit(\"iteration\", () => {\n\t\tconst root = hydrate(schema, initialTree);\n\t\tconst result = [];\n\t\tfor (const entry of root.map) {\n\t\t\tresult.push(entry);\n\t\t}\n\n\t\tassert.deepEqual(result, [\n\t\t\t[\"foo\", \"Hello\"],\n\t\t\t[\"bar\", \"World\"],\n\t\t]);\n\t});\n\n\tit(\"has\", () => {\n\t\tconst root = hydrate(schema, initialTree);\n\t\tassert.equal(root.map.has(\"foo\"), true);\n\t\tassert.equal(root.map.has(\"bar\"), true);\n\t\tassert.equal(root.map.has(\"baz\"), false);\n\t});\n\n\tit(\"set\", () => {\n\t\tconst root = hydrate(schema, initialTree);\n\t\t// Insert new value\n\t\troot.map.set(\"baz\", \"42\");\n\t\tassert.equal(root.map.size, 3);\n\t\tassert(root.map.has(\"baz\"));\n\t\tassert.equal(root.map.get(\"baz\"), \"42\");\n\n\t\t// Override existing value\n\t\troot.map.set(\"baz\", \"37\");\n\t\troot.map.set(\"baz\", \"37\"); // Check that we can do a \"no-op\" change (a change which does not change the tree's content).\n\t\tassert.equal(root.map.size, 3);\n\t\tassert(root.map.has(\"baz\"));\n\t\tassert.equal(root.map.get(\"baz\"), \"37\");\n\n\t\t// \"Un-set\" existing value\n\t\troot.map.set(\"baz\", undefined);\n\t\tassert.equal(root.map.size, 2);\n\t\tassert(!root.map.has(\"baz\"));\n\t});\n\n\tit(\"set object\", () => {\n\t\tconst root = hydrate(schema, initialTree);\n\t\tconst o = new object({ content: 42 });\n\t\troot.objectMap.set(\"foo\", o);\n\t\tassert.equal(root.objectMap.get(\"foo\"), o); // Check that the inserted and read proxies are the same object\n\t\tassert.equal(root.objectMap.get(\"foo\")?.content, o.content);\n\t});\n\n\tit(\"delete\", () => {\n\t\tconst root = hydrate(schema, initialTree);\n\t\t// Delete existing value\n\t\troot.map.delete(\"bar\");\n\t\tassert.equal(root.map.size, 1);\n\t\tassert(!root.map.has(\"bar\"));\n\n\t\t// Delete non-present value\n\t\troot.map.delete(\"baz\");\n\t\tassert.equal(root.map.size, 1);\n\t});\n});\n"]}

package/lib/test/simple-tree/rawObjectNode.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=rawObjectNode.spec.d.ts.map

package/lib/test/simple-tree/rawObjectNode.spec.d.ts.map DELETED Viewed

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

package/lib/test/simple-tree/rawObjectNode.spec.js DELETED Viewed

@@ -1,73 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-// This file contains several lambdas that do a simple property access
-/* eslint-disable import/no-internal-modules */
-import { strict as assert } from "assert";
-import { leaf } from "../../domains/index.js";
-import { brand } from "../../util/index.js";
-import { contextWithContentReadonly } from "../feature-libraries/flex-tree/utils.js";
-import { extractRawNodeContent, RawObjectNode } from "../../simple-tree/rawNode.js";
-import { FieldKinds, FlexFieldSchema, SchemaBuilderBase, } from "../../feature-libraries/index.js";
-describe("raw object nodes", () => {
-    function getRawObjectNode() {
-        const builder = new SchemaBuilderBase(FieldKinds.required, {
-            scope: "raw object test",
-            libraries: [leaf.library],
-        });
-        const objectSchema = builder.object("object", {
-            foo: leaf.number,
-            bar: FlexFieldSchema.create(FieldKinds.optional, [leaf.string]),
-            baz: FlexFieldSchema.create(FieldKinds.sequence, [leaf.boolean]),
-        });
-        const rootFieldSchema = FlexFieldSchema.create(FieldKinds.required, [objectSchema]);
-        const schema = builder.intoSchema(rootFieldSchema);
-        const context = contextWithContentReadonly({
-            schema,
-            initialTree: { foo: 42, baz: [] },
-        });
-        assert(context.root.is(rootFieldSchema));
-        const rawObjectNode = new RawObjectNode(objectSchema, {
-            foo: 42,
-            bar: undefined,
-            baz: [],
-        });
-        return { rawObjectNode, objectSchema };
-    }
-    it("allow reading schema data", () => {
-        const { rawObjectNode, objectSchema } = getRawObjectNode();
-        assert.equal(rawObjectNode.schema, objectSchema);
-        assert.equal(rawObjectNode.type, objectSchema.name);
-    });
-    it("allow reading value", () => {
-        const { rawObjectNode } = getRawObjectNode();
-        assert.equal(rawObjectNode.value, undefined);
-    });
-    it("disallow reading most node properties", () => {
-        const { rawObjectNode, objectSchema } = getRawObjectNode();
-        assert.throws(() => rawObjectNode.context);
-        assert.throws(() => rawObjectNode.parentField);
-        assert.throws(() => rawObjectNode.tryGetField(brand("foo")));
-        assert.throws(() => rawObjectNode.boxedIterator());
-        assert.throws(() => rawObjectNode.on("changing", () => { }));
-        assert.throws(() => rawObjectNode.treeStatus());
-        assert.throws(() => rawObjectNode.localNodeKey);
-    });
-    it("disallow reading fields", () => {
-        const { rawObjectNode } = getRawObjectNode();
-        assert.throws(() => rawObjectNode.tryGetField(brand("foo")));
-        assert.throws(() => rawObjectNode.tryGetField(brand("bar")));
-        assert.throws(() => rawObjectNode.tryGetField(brand("baz")));
-    });
-    it("expose their contents", () => {
-        const { rawObjectNode } = getRawObjectNode();
-        assert.equal(extractRawNodeContent(rawObjectNode)?.foo, 42);
-    });
-    it("can only have their contents read once", () => {
-        const { rawObjectNode } = getRawObjectNode();
-        assert.notEqual(extractRawNodeContent(rawObjectNode), undefined);
-        assert.throws(() => extractRawNodeContent(rawObjectNode));
-    });
-});
-//# sourceMappingURL=rawObjectNode.spec.js.map

package/lib/test/simple-tree/rawObjectNode.spec.js.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"rawObjectNode.spec.js","sourceRoot":"","sources":["../../../src/test/simple-tree/rawObjectNode.spec.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,sEAAsE;AACtE,+CAA+C;AAE/C,OAAO,EAAE,MAAM,IAAI,MAAM,EAAE,MAAM,QAAQ,CAAC;AAC1C,OAAO,EAAE,IAAI,EAAE,MAAM,wBAAwB,CAAC;AAC9C,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAC5C,OAAO,EAAE,0BAA0B,EAAE,MAAM,yCAAyC,CAAC;AACrF,OAAO,EAAE,qBAAqB,EAAE,aAAa,EAAE,MAAM,8BAA8B,CAAC;AACpF,OAAO,EACN,UAAU,EACV,eAAe,EAEf,iBAAiB,GACjB,MAAM,kCAAkC,CAAC;AAE1C,QAAQ,CAAC,kBAAkB,EAAE,GAAG,EAAE;IACjC,SAAS,gBAAgB;QACxB,MAAM,OAAO,GAAG,IAAI,iBAAiB,CAAC,UAAU,CAAC,QAAQ,EAAE;YAC1D,KAAK,EAAE,iBAAiB;YACxB,SAAS,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC;SACzB,CAAC,CAAC;QACH,MAAM,YAAY,GAAG,OAAO,CAAC,MAAM,CAAC,QAAQ,EAAE;YAC7C,GAAG,EAAE,IAAI,CAAC,MAAM;YAChB,GAAG,EAAE,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAC/D,GAAG,EAAE,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;SAChE,CAAC,CAAC;QACH,MAAM,eAAe,GAAG,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,YAAY,CAAC,CAAC,CAAC;QACpF,MAAM,MAAM,GAAG,OAAO,CAAC,UAAU,CAAC,eAAe,CAAC,CAAC;QACnD,MAAM,OAAO,GAAG,0BAA0B,CAAC;YAC1C,MAAM;YACN,WAAW,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE;SACjC,CAAC,CAAC;QAEH,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,eAAe,CAAC,CAAC,CAAC;QACzC,MAAM,aAAa,GAAG,IAAI,aAAa,CAAC,YAAoC,EAAE;YAC7E,GAAG,EAAE,EAAE;YACP,GAAG,EAAE,SAAS;YACd,GAAG,EAAE,EAAE;SACP,CAAC,CAAC;QACH,OAAO,EAAE,aAAa,EAAE,YAAY,EAAE,CAAC;IACxC,CAAC;IAED,EAAE,CAAC,2BAA2B,EAAE,GAAG,EAAE;QACpC,MAAM,EAAE,aAAa,EAAE,YAAY,EAAE,GAAG,gBAAgB,EAAE,CAAC;QAC3D,MAAM,CAAC,KAAK,CAAC,aAAa,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;QACjD,MAAM,CAAC,KAAK,CAAC,aAAa,CAAC,IAAI,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC;IACrD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,qBAAqB,EAAE,GAAG,EAAE;QAC9B,MAAM,EAAE,aAAa,EAAE,GAAG,gBAAgB,EAAE,CAAC;QAC7C,MAAM,CAAC,KAAK,CAAC,aAAa,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;IAC9C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,uCAAuC,EAAE,GAAG,EAAE;QAChD,MAAM,EAAE,aAAa,EAAE,YAAY,EAAE,GAAG,gBAAgB,EAAE,CAAC;QAC3D,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;QAC3C,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,aAAa,CAAC,WAAW,CAAC,CAAC;QAC/C,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,aAAa,CAAC,WAAW,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC7D,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,aAAa,CAAC,aAAa,EAAE,CAAC,CAAC;QACnD,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,aAAa,CAAC,EAAE,CAAC,UAAU,EAAE,GAAG,EAAE,GAAE,CAAC,CAAC,CAAC,CAAC;QAC5D,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,aAAa,CAAC,UAAU,EAAE,CAAC,CAAC;QAChD,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,aAAa,CAAC,YAAY,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,yBAAyB,EAAE,GAAG,EAAE;QAClC,MAAM,EAAE,aAAa,EAAE,GAAG,gBAAgB,EAAE,CAAC;QAC7C,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,aAAa,CAAC,WAAW,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC7D,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,aAAa,CAAC,WAAW,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC7D,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,aAAa,CAAC,WAAW,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAC9D,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,uBAAuB,EAAE,GAAG,EAAE;QAChC,MAAM,EAAE,aAAa,EAAE,GAAG,gBAAgB,EAAE,CAAC;QAC7C,MAAM,CAAC,KAAK,CAAE,qBAAqB,CAAC,aAAa,CAA6B,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC;IAC1F,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,wCAAwC,EAAE,GAAG,EAAE;QACjD,MAAM,EAAE,aAAa,EAAE,GAAG,gBAAgB,EAAE,CAAC;QAC7C,MAAM,CAAC,QAAQ,CAAC,qBAAqB,CAAC,aAAa,CAAC,EAAE,SAAS,CAAC,CAAC;QACjE,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,qBAAqB,CAAC,aAAa,CAAC,CAAC,CAAC;IAC3D,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// This file contains several lambdas that do a simple property access\n/* eslint-disable import/no-internal-modules */\n\nimport { strict as assert } from \"assert\";\nimport { leaf } from \"../../domains/index.js\";\nimport { brand } from \"../../util/index.js\";\nimport { contextWithContentReadonly } from \"../feature-libraries/flex-tree/utils.js\";\nimport { extractRawNodeContent, RawObjectNode } from \"../../simple-tree/rawNode.js\";\nimport {\n\tFieldKinds,\n\tFlexFieldSchema,\n\tFlexObjectNodeSchema,\n\tSchemaBuilderBase,\n} from \"../../feature-libraries/index.js\";\n\ndescribe(\"raw object nodes\", () => {\n\tfunction getRawObjectNode() {\n\t\tconst builder = new SchemaBuilderBase(FieldKinds.required, {\n\t\t\tscope: \"raw object test\",\n\t\t\tlibraries: [leaf.library],\n\t\t});\n\t\tconst objectSchema = builder.object(\"object\", {\n\t\t\tfoo: leaf.number,\n\t\t\tbar: FlexFieldSchema.create(FieldKinds.optional, [leaf.string]),\n\t\t\tbaz: FlexFieldSchema.create(FieldKinds.sequence, [leaf.boolean]),\n\t\t});\n\t\tconst rootFieldSchema = FlexFieldSchema.create(FieldKinds.required, [objectSchema]);\n\t\tconst schema = builder.intoSchema(rootFieldSchema);\n\t\tconst context = contextWithContentReadonly({\n\t\t\tschema,\n\t\t\tinitialTree: { foo: 42, baz: [] },\n\t\t});\n\n\t\tassert(context.root.is(rootFieldSchema));\n\t\tconst rawObjectNode = new RawObjectNode(objectSchema as FlexObjectNodeSchema, {\n\t\t\tfoo: 42,\n\t\t\tbar: undefined,\n\t\t\tbaz: [],\n\t\t});\n\t\treturn { rawObjectNode, objectSchema };\n\t}\n\n\tit(\"allow reading schema data\", () => {\n\t\tconst { rawObjectNode, objectSchema } = getRawObjectNode();\n\t\tassert.equal(rawObjectNode.schema, objectSchema);\n\t\tassert.equal(rawObjectNode.type, objectSchema.name);\n\t});\n\n\tit(\"allow reading value\", () => {\n\t\tconst { rawObjectNode } = getRawObjectNode();\n\t\tassert.equal(rawObjectNode.value, undefined);\n\t});\n\n\tit(\"disallow reading most node properties\", () => {\n\t\tconst { rawObjectNode, objectSchema } = getRawObjectNode();\n\t\tassert.throws(() => rawObjectNode.context);\n\t\tassert.throws(() => rawObjectNode.parentField);\n\t\tassert.throws(() => rawObjectNode.tryGetField(brand(\"foo\")));\n\t\tassert.throws(() => rawObjectNode.boxedIterator());\n\t\tassert.throws(() => rawObjectNode.on(\"changing\", () => {}));\n\t\tassert.throws(() => rawObjectNode.treeStatus());\n\t\tassert.throws(() => rawObjectNode.localNodeKey);\n\t});\n\n\tit(\"disallow reading fields\", () => {\n\t\tconst { rawObjectNode } = getRawObjectNode();\n\t\tassert.throws(() => rawObjectNode.tryGetField(brand(\"foo\")));\n\t\tassert.throws(() => rawObjectNode.tryGetField(brand(\"bar\")));\n\t\tassert.throws(() => rawObjectNode.tryGetField(brand(\"baz\")));\n\t});\n\n\tit(\"expose their contents\", () => {\n\t\tconst { rawObjectNode } = getRawObjectNode();\n\t\tassert.equal((extractRawNodeContent(rawObjectNode) as Record<string, unknown>)?.foo, 42);\n\t});\n\n\tit(\"can only have their contents read once\", () => {\n\t\tconst { rawObjectNode } = getRawObjectNode();\n\t\tassert.notEqual(extractRawNodeContent(rawObjectNode), undefined);\n\t\tassert.throws(() => extractRawNodeContent(rawObjectNode));\n\t});\n});\n"]}

package/lib/test/simple-tree/schemaCreationUtilities.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=schemaCreationUtilities.spec.d.ts.map

package/lib/test/simple-tree/schemaCreationUtilities.spec.d.ts.map DELETED Viewed

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

package/lib/test/simple-tree/schemaCreationUtilities.spec.js DELETED Viewed

@@ -1,153 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { strict as assert } from "node:assert";
-import { MockFluidDataStoreRuntime } from "@fluidframework/test-runtime-utils";
-import { unreachableCase } from "@fluidframework/core-utils";
-import { SchemaFactory, TreeConfiguration, } from "../../simple-tree/index.js";
-import { TreeFactory } from "../../treeFactory.js";
-import { enumFromStrings, typedObjectValues, adaptEnum,
-// eslint-disable-next-line import/no-internal-modules
- } from "../../simple-tree/schemaCreationUtilities.js";
-import { testIdCompressor } from "../utils.js";
-const schema = new SchemaFactory("test");
-describe("schemaCreationUtilities", () => {
-    it("enum type switch", () => {
-        const Mode = enumFromStrings(schema, ["Fun", "Cool", "Bonus"]);
-        class Parent extends schema.object("Parent", { mode: Object.values(Mode) }) {
-        }
-        const config = new TreeConfiguration(Parent, () => new Parent({
-            mode: new Mode.Bonus({}),
-        }));
-        const factory = new TreeFactory({});
-        const tree = factory.create(new MockFluidDataStoreRuntime({ idCompressor: testIdCompressor }), "tree");
-        const view = tree.schematize(config);
-        const mode = view.root.mode;
-        switch (true) {
-            case mode instanceof Mode.Bonus: {
-                // This one runs
-                break;
-            }
-            case mode instanceof Mode.Fun: {
-                assert.fail();
-            }
-            case mode instanceof Mode.Cool: {
-                assert.fail();
-            }
-            default:
-                assert.fail();
-        }
-    });
-    it("enumFromStrings example", () => {
-        const schemaFactory = new SchemaFactory("x");
-        const Mode = enumFromStrings(schemaFactory, ["Fun", "Cool"]);
-        const nodeFromString = Mode("Fun");
-        const nodeFromSchema = new Mode.Fun();
-        // eslint-disable-next-line no-constant-condition
-        if (false) {
-            // Check this compiles, but don't run it since node is unhydrated
-            const nameFromNode = nodeFromSchema.value;
-        }
-        class Parent extends schemaFactory.object("Parent", { mode: typedObjectValues(Mode) }) {
-        }
-    });
-    it("adaptEnum example", () => {
-        const schemaFactory = new SchemaFactory("x");
-        let Mode;
-        (function (Mode) {
-            Mode["a"] = "A";
-            Mode["b"] = "B";
-        })(Mode || (Mode = {}));
-        const ModeNodes = adaptEnum(schema, Mode);
-        const nodeFromString = ModeNodes(Mode.a);
-        const nodeFromSchema = new ModeNodes.a();
-        // eslint-disable-next-line no-constant-condition
-        if (false) {
-            // Check this compiles, but don't run it since node is unhydrated
-            const nameFromNode = nodeFromSchema.value;
-        }
-        class Parent extends schemaFactory.object("Parent", {
-            mode: typedObjectValues(ModeNodes),
-        }) {
-        }
-        const _test1 = new ModeNodes.a();
-        // @ts-expect-error Incompatible enums types should not be assignable.
-        const _test2 = new ModeNodes.b();
-    });
-    it("enum value switch", () => {
-        const Mode = enumFromStrings(schema, ["Fun", "Cool", "Bonus"]);
-        class Parent extends schema.object("Parent", { mode: typedObjectValues(Mode) }) {
-        }
-        const config = new TreeConfiguration(Parent, () => new Parent({
-            mode: new Mode.Bonus({}),
-        }));
-        const factory = new TreeFactory({});
-        const tree = factory.create(new MockFluidDataStoreRuntime({ idCompressor: testIdCompressor }), "tree");
-        const view = tree.schematize(config);
-        const mode = view.root.mode;
-        switch (mode.value) {
-            case "Fun": {
-                assert.fail();
-            }
-            case "Cool": {
-                assert.fail();
-            }
-            case "Bonus": {
-                // This one runs
-                break;
-            }
-            default:
-                unreachableCase(mode.value);
-        }
-    });
-    it("enum interop - enumFromStrings", () => {
-        const factory = new TreeFactory({});
-        let Day;
-        (function (Day) {
-            Day["Today"] = "Today";
-            Day["Tomorrow"] = "Tomorrow";
-        })(Day || (Day = {}));
-        const DayNodes = enumFromStrings(schema, typedObjectValues(Day));
-        const tree = factory.create(new MockFluidDataStoreRuntime({ idCompressor: testIdCompressor }), "tree");
-        const day = Day.Today;
-        const view = tree.schematize(new TreeConfiguration(typedObjectValues(DayNodes), () => DayNodes(day)));
-        switch (view.root.value) {
-            case Day.Today: {
-                // This one runs
-                break;
-            }
-            case Day.Tomorrow: {
-                assert.fail();
-            }
-            default:
-                unreachableCase(view.root.value);
-        }
-    });
-    it("enum interop - adaptEnum", () => {
-        const factory = new TreeFactory({});
-        let Day;
-        (function (Day) {
-            Day["Today"] = "today";
-            Day["Tomorrow"] = "tomorrow";
-        })(Day || (Day = {}));
-        const DayNodes = adaptEnum(schema, Day);
-        const tree = factory.create(new MockFluidDataStoreRuntime({ idCompressor: testIdCompressor }), "tree");
-        // Can convert enum to unhydrated node:
-        const x = DayNodes(Day.Today);
-        // Can construct unhydrated node from enum's key:
-        const y = new DayNodes.Today({});
-        const view = tree.schematize(new TreeConfiguration(typedObjectValues(DayNodes), () => DayNodes(Day.Today)));
-        switch (view.root.value) {
-            case Day.Today: {
-                break;
-            }
-            case Day.Tomorrow: {
-                assert.fail();
-            }
-            default:
-                unreachableCase(view.root);
-        }
-    });
-});
-//# sourceMappingURL=schemaCreationUtilities.spec.js.map

package/lib/test/simple-tree/schemaCreationUtilities.spec.js.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"schemaCreationUtilities.spec.js","sourceRoot":"","sources":["../../../src/test/simple-tree/schemaCreationUtilities.spec.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,IAAI,MAAM,EAAE,MAAM,aAAa,CAAC;AAE/C,OAAO,EAAE,yBAAyB,EAAE,MAAM,oCAAoC,CAAC;AAC/E,OAAO,EAAE,eAAe,EAAE,MAAM,4BAA4B,CAAC;AAC7D,OAAO,EAEN,aAAa,EACb,iBAAiB,GAEjB,MAAM,4BAA4B,CAAC;AACpC,OAAO,EAAE,WAAW,EAAE,MAAM,sBAAsB,CAAC;AACnD,OAAO,EACN,eAAe,EACf,iBAAiB,EACjB,SAAS;AACT,sDAAsD;EACtD,MAAM,8CAA8C,CAAC;AACtD,OAAO,EAAE,gBAAgB,EAAE,MAAM,aAAa,CAAC;AAE/C,MAAM,MAAM,GAAG,IAAI,aAAa,CAAC,MAAM,CAAC,CAAC;AAEzC,QAAQ,CAAC,yBAAyB,EAAE,GAAG,EAAE;IACxC,EAAE,CAAC,kBAAkB,EAAE,GAAG,EAAE;QAC3B,MAAM,IAAI,GAAG,eAAe,CAAC,MAAM,EAAE,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC;QAC/D,MAAM,MAAO,SAAQ,MAAM,CAAC,MAAM,CAAC,QAAQ,EAAE,EAAE,IAAI,EAAE,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;SAAG;QAC9E,MAAM,MAAM,GAAG,IAAI,iBAAiB,CACnC,MAAM,EACN,GAAG,EAAE,CACJ,IAAI,MAAM,CAAC;YACV,IAAI,EAAE,IAAI,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;SACxB,CAAC,CACH,CAAC;QAEF,MAAM,OAAO,GAAG,IAAI,WAAW,CAAC,EAAE,CAAC,CAAC;QACpC,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,CAC1B,IAAI,yBAAyB,CAAC,EAAE,YAAY,EAAE,gBAAgB,EAAE,CAAC,EACjE,MAAM,CACN,CAAC;QACF,MAAM,IAAI,GAAqB,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;QACvD,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;QAC5B,QAAQ,IAAI,EAAE;YACb,KAAK,IAAI,YAAY,IAAI,CAAC,KAAK,CAAC,CAAC;gBAChC,gBAAgB;gBAChB,MAAM;aACN;YACD,KAAK,IAAI,YAAY,IAAI,CAAC,GAAG,CAAC,CAAC;gBAC9B,MAAM,CAAC,IAAI,EAAE,CAAC;aACd;YACD,KAAK,IAAI,YAAY,IAAI,CAAC,IAAI,CAAC,CAAC;gBAC/B,MAAM,CAAC,IAAI,EAAE,CAAC;aACd;YACD;gBACC,MAAM,CAAC,IAAI,EAAE,CAAC;SACf;IACF,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,yBAAyB,EAAE,GAAG,EAAE;QAClC,MAAM,aAAa,GAAG,IAAI,aAAa,CAAC,GAAG,CAAC,CAAC;QAC7C,MAAM,IAAI,GAAG,eAAe,CAAC,aAAa,EAAE,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC;QAE7D,MAAM,cAAc,GAAS,IAAI,CAAC,KAAK,CAAC,CAAC;QACzC,MAAM,cAAc,GAAS,IAAI,IAAI,CAAC,GAAG,EAAE,CAAC;QAC5C,iDAAiD;QACjD,IAAI,KAAK,EAAE;YACV,iEAAiE;YACjE,MAAM,YAAY,GAAmB,cAAc,CAAC,KAAK,CAAC;SAC1D;QAED,MAAM,MAAO,SAAQ,aAAa,CAAC,MAAM,CAAC,QAAQ,EAAE,EAAE,IAAI,EAAE,iBAAiB,CAAC,IAAI,CAAC,EAAE,CAAC;SAAG;IAC1F,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,mBAAmB,EAAE,GAAG,EAAE;QAC5B,MAAM,aAAa,GAAG,IAAI,aAAa,CAAC,GAAG,CAAC,CAAC;QAE7C,IAAK,IAGJ;QAHD,WAAK,IAAI;YACR,eAAO,CAAA;YACP,eAAO,CAAA;QACR,CAAC,EAHI,IAAI,KAAJ,IAAI,QAGR;QACD,MAAM,SAAS,GAAG,SAAS,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QAE1C,MAAM,cAAc,GAAc,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACpD,MAAM,cAAc,GAAc,IAAI,SAAS,CAAC,CAAC,EAAE,CAAC;QACpD,iDAAiD;QACjD,IAAI,KAAK,EAAE;YACV,iEAAiE;YACjE,MAAM,YAAY,GAAS,cAAc,CAAC,KAAK,CAAC;SAChD;QACD,MAAM,MAAO,SAAQ,aAAa,CAAC,MAAM,CAAC,QAAQ,EAAE;YACnD,IAAI,EAAE,iBAAiB,CAAC,SAAS,CAAC;SAClC,CAAC;SAAG;QAEL,MAAM,MAAM,GAAqC,IAAI,SAAS,CAAC,CAAC,EAAE,CAAC;QACnE,sEAAsE;QACtE,MAAM,MAAM,GAAqC,IAAI,SAAS,CAAC,CAAC,EAAE,CAAC;IACpE,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,mBAAmB,EAAE,GAAG,EAAE;QAC5B,MAAM,IAAI,GAAG,eAAe,CAAC,MAAM,EAAE,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC;QAC/D,MAAM,MAAO,SAAQ,MAAM,CAAC,MAAM,CAAC,QAAQ,EAAE,EAAE,IAAI,EAAE,iBAAiB,CAAC,IAAI,CAAC,EAAE,CAAC;SAAG;QAClF,MAAM,MAAM,GAAG,IAAI,iBAAiB,CACnC,MAAM,EACN,GAAG,EAAE,CACJ,IAAI,MAAM,CAAC;YACV,IAAI,EAAE,IAAI,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;SACxB,CAAC,CACH,CAAC;QAEF,MAAM,OAAO,GAAG,IAAI,WAAW,CAAC,EAAE,CAAC,CAAC;QACpC,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,CAC1B,IAAI,yBAAyB,CAAC,EAAE,YAAY,EAAE,gBAAgB,EAAE,CAAC,EACjE,MAAM,CACN,CAAC;QACF,MAAM,IAAI,GAAqB,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;QACvD,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;QAC5B,QAAQ,IAAI,CAAC,KAAK,EAAE;YACnB,KAAK,KAAK,CAAC,CAAC;gBACX,MAAM,CAAC,IAAI,EAAE,CAAC;aACd;YACD,KAAK,MAAM,CAAC,CAAC;gBACZ,MAAM,CAAC,IAAI,EAAE,CAAC;aACd;YACD,KAAK,OAAO,CAAC,CAAC;gBACb,gBAAgB;gBAChB,MAAM;aACN;YACD;gBACC,eAAe,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;SAC7B;IACF,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,gCAAgC,EAAE,GAAG,EAAE;QACzC,MAAM,OAAO,GAAG,IAAI,WAAW,CAAC,EAAE,CAAC,CAAC;QAEpC,IAAK,GAGJ;QAHD,WAAK,GAAG;YACP,sBAAe,CAAA;YACf,4BAAqB,CAAA;QACtB,CAAC,EAHI,GAAG,KAAH,GAAG,QAGP;QAED,MAAM,QAAQ,GAAG,eAAe,CAAC,MAAM,EAAE,iBAAiB,CAAC,GAAG,CAAC,CAAC,CAAC;QAEjE,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,CAC1B,IAAI,yBAAyB,CAAC,EAAE,YAAY,EAAE,gBAAgB,EAAE,CAAC,EACjE,MAAM,CACN,CAAC;QAEF,MAAM,GAAG,GAAG,GAAG,CAAC,KAAK,CAAC;QAEtB,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAC3B,IAAI,iBAAiB,CAAC,iBAAiB,CAAC,QAAQ,CAAC,EAAE,GAAG,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CACvE,CAAC;QAEF,QAAQ,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE;YACxB,KAAK,GAAG,CAAC,KAAK,CAAC,CAAC;gBACf,gBAAgB;gBAChB,MAAM;aACN;YACD,KAAK,GAAG,CAAC,QAAQ,CAAC,CAAC;gBAClB,MAAM,CAAC,IAAI,EAAE,CAAC;aACd;YACD;gBACC,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;SAClC;IACF,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,0BAA0B,EAAE,GAAG,EAAE;QACnC,MAAM,OAAO,GAAG,IAAI,WAAW,CAAC,EAAE,CAAC,CAAC;QAEpC,IAAK,GAGJ;QAHD,WAAK,GAAG;YACP,sBAAe,CAAA;YACf,4BAAqB,CAAA;QACtB,CAAC,EAHI,GAAG,KAAH,GAAG,QAGP;QAED,MAAM,QAAQ,GAAG,SAAS,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;QAExC,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,CAC1B,IAAI,yBAAyB,CAAC,EAAE,YAAY,EAAE,gBAAgB,EAAE,CAAC,EACjE,MAAM,CACN,CAAC;QAEF,uCAAuC;QACvC,MAAM,CAAC,GAAG,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAC9B,iDAAiD;QACjD,MAAM,CAAC,GAAG,IAAI,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QAEjC,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAC3B,IAAI,iBAAiB,CAAC,iBAAiB,CAAC,QAAQ,CAAC,EAAE,GAAG,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAC7E,CAAC;QAEF,QAAQ,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE;YACxB,KAAK,GAAG,CAAC,KAAK,CAAC,CAAC;gBACf,MAAM;aACN;YACD,KAAK,GAAG,CAAC,QAAQ,CAAC,CAAC;gBAClB,MAAM,CAAC,IAAI,EAAE,CAAC;aACd;YACD;gBACC,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;SAC5B;IACF,CAAC,CAAC,CAAC;AACJ,CAAC,CAAC,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { strict as assert } from \"node:assert\";\n\nimport { MockFluidDataStoreRuntime } from \"@fluidframework/test-runtime-utils\";\nimport { unreachableCase } from \"@fluidframework/core-utils\";\nimport {\n\tNodeFromSchema,\n\tSchemaFactory,\n\tTreeConfiguration,\n\tTreeView,\n} from \"../../simple-tree/index.js\";\nimport { TreeFactory } from \"../../treeFactory.js\";\nimport {\n\tenumFromStrings,\n\ttypedObjectValues,\n\tadaptEnum,\n\t// eslint-disable-next-line import/no-internal-modules\n} from \"../../simple-tree/schemaCreationUtilities.js\";\nimport { testIdCompressor } from \"../utils.js\";\n\nconst schema = new SchemaFactory(\"test\");\n\ndescribe(\"schemaCreationUtilities\", () => {\n\tit(\"enum type switch\", () => {\n\t\tconst Mode = enumFromStrings(schema, [\"Fun\", \"Cool\", \"Bonus\"]);\n\t\tclass Parent extends schema.object(\"Parent\", { mode: Object.values(Mode) }) {}\n\t\tconst config = new TreeConfiguration(\n\t\t\tParent,\n\t\t\t() =>\n\t\t\t\tnew Parent({\n\t\t\t\t\tmode: new Mode.Bonus({}),\n\t\t\t\t}),\n\t\t);\n\n\t\tconst factory = new TreeFactory({});\n\t\tconst tree = factory.create(\n\t\t\tnew MockFluidDataStoreRuntime({ idCompressor: testIdCompressor }),\n\t\t\t\"tree\",\n\t\t);\n\t\tconst view: TreeView<Parent> = tree.schematize(config);\n\t\tconst mode = view.root.mode;\n\t\tswitch (true) {\n\t\t\tcase mode instanceof Mode.Bonus: {\n\t\t\t\t// This one runs\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase mode instanceof Mode.Fun: {\n\t\t\t\tassert.fail();\n\t\t\t}\n\t\t\tcase mode instanceof Mode.Cool: {\n\t\t\t\tassert.fail();\n\t\t\t}\n\t\t\tdefault:\n\t\t\t\tassert.fail();\n\t\t}\n\t});\n\n\tit(\"enumFromStrings example\", () => {\n\t\tconst schemaFactory = new SchemaFactory(\"x\");\n\t\tconst Mode = enumFromStrings(schemaFactory, [\"Fun\", \"Cool\"]);\n\t\ttype Mode = NodeFromSchema<(typeof Mode)[keyof typeof Mode]>;\n\t\tconst nodeFromString: Mode = Mode(\"Fun\");\n\t\tconst nodeFromSchema: Mode = new Mode.Fun();\n\t\t// eslint-disable-next-line no-constant-condition\n\t\tif (false) {\n\t\t\t// Check this compiles, but don't run it since node is unhydrated\n\t\t\tconst nameFromNode: \"Fun\" | \"Cool\" = nodeFromSchema.value;\n\t\t}\n\n\t\tclass Parent extends schemaFactory.object(\"Parent\", { mode: typedObjectValues(Mode) }) {}\n\t});\n\n\tit(\"adaptEnum example\", () => {\n\t\tconst schemaFactory = new SchemaFactory(\"x\");\n\n\t\tenum Mode {\n\t\t\ta = \"A\",\n\t\t\tb = \"B\",\n\t\t}\n\t\tconst ModeNodes = adaptEnum(schema, Mode);\n\t\ttype ModeNodes = NodeFromSchema<(typeof ModeNodes)[keyof typeof ModeNodes]>;\n\t\tconst nodeFromString: ModeNodes = ModeNodes(Mode.a);\n\t\tconst nodeFromSchema: ModeNodes = new ModeNodes.a();\n\t\t// eslint-disable-next-line no-constant-condition\n\t\tif (false) {\n\t\t\t// Check this compiles, but don't run it since node is unhydrated\n\t\t\tconst nameFromNode: Mode = nodeFromSchema.value;\n\t\t}\n\t\tclass Parent extends schemaFactory.object(\"Parent\", {\n\t\t\tmode: typedObjectValues(ModeNodes),\n\t\t}) {}\n\n\t\tconst _test1: InstanceType<typeof ModeNodes.a> = new ModeNodes.a();\n\t\t// @ts-expect-error Incompatible enums types should not be assignable.\n\t\tconst _test2: InstanceType<typeof ModeNodes.a> = new ModeNodes.b();\n\t});\n\n\tit(\"enum value switch\", () => {\n\t\tconst Mode = enumFromStrings(schema, [\"Fun\", \"Cool\", \"Bonus\"]);\n\t\tclass Parent extends schema.object(\"Parent\", { mode: typedObjectValues(Mode) }) {}\n\t\tconst config = new TreeConfiguration(\n\t\t\tParent,\n\t\t\t() =>\n\t\t\t\tnew Parent({\n\t\t\t\t\tmode: new Mode.Bonus({}),\n\t\t\t\t}),\n\t\t);\n\n\t\tconst factory = new TreeFactory({});\n\t\tconst tree = factory.create(\n\t\t\tnew MockFluidDataStoreRuntime({ idCompressor: testIdCompressor }),\n\t\t\t\"tree\",\n\t\t);\n\t\tconst view: TreeView<Parent> = tree.schematize(config);\n\t\tconst mode = view.root.mode;\n\t\tswitch (mode.value) {\n\t\t\tcase \"Fun\": {\n\t\t\t\tassert.fail();\n\t\t\t}\n\t\t\tcase \"Cool\": {\n\t\t\t\tassert.fail();\n\t\t\t}\n\t\t\tcase \"Bonus\": {\n\t\t\t\t// This one runs\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tdefault:\n\t\t\t\tunreachableCase(mode.value);\n\t\t}\n\t});\n\n\tit(\"enum interop - enumFromStrings\", () => {\n\t\tconst factory = new TreeFactory({});\n\n\t\tenum Day {\n\t\t\tToday = \"Today\",\n\t\t\tTomorrow = \"Tomorrow\",\n\t\t}\n\n\t\tconst DayNodes = enumFromStrings(schema, typedObjectValues(Day));\n\n\t\tconst tree = factory.create(\n\t\t\tnew MockFluidDataStoreRuntime({ idCompressor: testIdCompressor }),\n\t\t\t\"tree\",\n\t\t);\n\n\t\tconst day = Day.Today;\n\n\t\tconst view = tree.schematize(\n\t\t\tnew TreeConfiguration(typedObjectValues(DayNodes), () => DayNodes(day)),\n\t\t);\n\n\t\tswitch (view.root.value) {\n\t\t\tcase Day.Today: {\n\t\t\t\t// This one runs\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase Day.Tomorrow: {\n\t\t\t\tassert.fail();\n\t\t\t}\n\t\t\tdefault:\n\t\t\t\tunreachableCase(view.root.value);\n\t\t}\n\t});\n\n\tit(\"enum interop - adaptEnum\", () => {\n\t\tconst factory = new TreeFactory({});\n\n\t\tenum Day {\n\t\t\tToday = \"today\",\n\t\t\tTomorrow = \"tomorrow\",\n\t\t}\n\n\t\tconst DayNodes = adaptEnum(schema, Day);\n\n\t\tconst tree = factory.create(\n\t\t\tnew MockFluidDataStoreRuntime({ idCompressor: testIdCompressor }),\n\t\t\t\"tree\",\n\t\t);\n\n\t\t// Can convert enum to unhydrated node:\n\t\tconst x = DayNodes(Day.Today);\n\t\t// Can construct unhydrated node from enum's key:\n\t\tconst y = new DayNodes.Today({});\n\n\t\tconst view = tree.schematize(\n\t\t\tnew TreeConfiguration(typedObjectValues(DayNodes), () => DayNodes(Day.Today)),\n\t\t);\n\n\t\tswitch (view.root.value) {\n\t\t\tcase Day.Today: {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase Day.Tomorrow: {\n\t\t\t\tassert.fail();\n\t\t\t}\n\t\t\tdefault:\n\t\t\t\tunreachableCase(view.root);\n\t\t}\n\t});\n});\n"]}

package/lib/test/simple-tree/schemaFactory.examples.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=schemaFactory.examples.spec.d.ts.map

package/lib/test/simple-tree/schemaFactory.examples.spec.d.ts.map DELETED Viewed

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

package/lib/test/simple-tree/schemaFactory.examples.spec.js DELETED Viewed

@@ -1,107 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { strict as assert } from "node:assert";
-import { createIdCompressor } from "@fluidframework/id-compressor";
-import { MockFluidDataStoreRuntime } from "@fluidframework/test-runtime-utils";
-import { SchemaFactory, TreeConfiguration, treeNodeApi as Tree, } from "../../simple-tree/index.js";
-import { TreeFactory } from "../../treeFactory.js";
-// Since this no longer follows the builder pattern, it is a SchemaFactory instead of a SchemaBuilder.
-const schema = new SchemaFactory("com.example");
-/**
- * An example schema based type.
- * This doc comment will be visible in intellisense when referring to the schema (as a runtime value) or the instance type.
- */
-class Point extends schema.object("Point", {
-    x: schema.number,
-    y: schema.number,
-}) {
-}
-class Note extends schema.object("Note", {
-    /**
-     * Doc comment on a schema based field. Intellisense should work when referencing the field.
-     */
-    text: schema.string,
-    /**
-     * Example optional field.
-     * Works the same as before.
-     */
-    location: schema.optional(Point),
-}) {
-    constructor() {
-        super(...arguments);
-        // Schema based classes can have methods and extra session local properties.
-        // We don't have to recommend this as a design pattern, but it does just work.
-        this.isSelected = false;
-    }
-    // Methods also work, and can access the tree APIs as normal:
-    moveToFront() {
-        const parent = Tree.parent(this);
-        // instanceof just works: nothing special to learn for either JS or TS narrowing of unions.
-        if (parent instanceof NodeList) {
-            const key = Tree.key(this);
-            assert(typeof key === "number");
-            parent.moveToEnd(key);
-        }
-    }
-}
-class NodeMap extends schema.map("NoteMap", Note) {
-}
-class NodeList extends schema.array("NoteList", Note) {
-}
-// Example function working on some schema based types.
-// Note that there is no need to use Typed<typeof NodeMap> anymore (either inline or as a separate type declaration).
-function f(n) {
-    // These schema based types can have methods provided based on their node kind. In this case maps have `get`.
-    // The type returned from `get` is `Note | undefined`, and shows that way in the intellisense:
-    // It does not show some complex type expression equivalent to that which is a big improvement over the previous setup.
-    const item = n.get("x");
-    return item === undefined ? [] : [item];
-}
-class Canvas extends schema.object("Canvas", { stuff: [NodeMap, NodeList] }) {
-}
-const config1 = new TreeConfiguration(Canvas, () => new Canvas({
-    stuff: new NodeList([
-        { text: "a", location: undefined },
-        new Note({ text: "b", location: undefined }),
-    ]),
-}));
-const config2 = new TreeConfiguration(Canvas, () => new Canvas({
-    stuff: [
-        // Trees of insertable data can mix inline insertable content and unhydrated nodes:
-        { text: "a", location: undefined },
-        new Note({ text: "b", location: undefined }),
-    ],
-}));
-function setup(tree) {
-    const view = tree.schematize(config1);
-    const stuff = view.root.stuff;
-    if (stuff instanceof NodeMap) {
-        return f(stuff);
-    }
-    // Numeric indexing is supported on lists:
-    const secondItem = stuff[1];
-    // Methods on schema based types can be called as expected.
-    secondItem.moveToFront();
-    // Access to a schema based field. Intellisense for doc comment and navigate to source just work, as does refactor rename.
-    // Thus functionality isn't new, but its nice.
-    const s = secondItem.text;
-    // Lists are iterable:
-    const items = [...stuff];
-    return items;
-}
-describe("Class based end to end example", () => {
-    it("run example", () => {
-        const factory = new TreeFactory({});
-        const theTree = factory.create(new MockFluidDataStoreRuntime({ idCompressor: createIdCompressor() }), "tree");
-        setup(theTree);
-    });
-    // Confirm that the alternative syntax for the config from the example above (config2) actually works.
-    it("config2", () => {
-        const factory = new TreeFactory({});
-        const theTree = factory.create(new MockFluidDataStoreRuntime({ idCompressor: createIdCompressor() }), "tree");
-        const view = theTree.schematize(config2);
-    });
-});
-//# sourceMappingURL=schemaFactory.examples.spec.js.map

package/lib/test/simple-tree/schemaFactory.examples.spec.js.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"schemaFactory.examples.spec.js","sourceRoot":"","sources":["../../../src/test/simple-tree/schemaFactory.examples.spec.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,IAAI,MAAM,EAAE,MAAM,aAAa,CAAC;AAE/C,OAAO,EAAE,kBAAkB,EAAE,MAAM,+BAA+B,CAAC;AACnE,OAAO,EAAE,yBAAyB,EAAE,MAAM,oCAAoC,CAAC;AAC/E,OAAO,EACN,aAAa,EAEb,iBAAiB,EAEjB,WAAW,IAAI,IAAI,GACnB,MAAM,4BAA4B,CAAC;AACpC,OAAO,EAAE,WAAW,EAAE,MAAM,sBAAsB,CAAC;AAEnD,sGAAsG;AACtG,MAAM,MAAM,GAAG,IAAI,aAAa,CAAC,aAAa,CAAC,CAAC;AAEhD;;;GAGG;AACH,MAAM,KAAM,SAAQ,MAAM,CAAC,MAAM,CAAC,OAAO,EAAE;IAC1C,CAAC,EAAE,MAAM,CAAC,MAAM;IAChB,CAAC,EAAE,MAAM,CAAC,MAAM;CAChB,CAAC;CAAG;AAEL,MAAM,IAAK,SAAQ,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE;IACxC;;OAEG;IACH,IAAI,EAAE,MAAM,CAAC,MAAM;IACnB;;;OAGG;IACH,QAAQ,EAAE,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC;CAChC,CAAC;IAVF;;QAWC,4EAA4E;QAC5E,8EAA8E;QACvE,eAAU,GAAY,KAAK,CAAC;IAYpC,CAAC;IAVA,6DAA6D;IACtD,WAAW;QACjB,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACjC,2FAA2F;QAC3F,IAAI,MAAM,YAAY,QAAQ,EAAE;YAC/B,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAC3B,MAAM,CAAC,OAAO,GAAG,KAAK,QAAQ,CAAC,CAAC;YAChC,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;SACtB;IACF,CAAC;CACD;AAED,MAAM,OAAQ,SAAQ,MAAM,CAAC,GAAG,CAAC,SAAS,EAAE,IAAI,CAAC;CAAG;AACpD,MAAM,QAAS,SAAQ,MAAM,CAAC,KAAK,CAAC,UAAU,EAAE,IAAI,CAAC;CAAG;AAExD,uDAAuD;AACvD,qHAAqH;AACrH,SAAS,CAAC,CAAC,CAAU;IACpB,6GAA6G;IAC7G,8FAA8F;IAC9F,uHAAuH;IACvH,MAAM,IAAI,GAAqB,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC1C,OAAO,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;AACzC,CAAC;AAED,MAAM,MAAO,SAAQ,MAAM,CAAC,MAAM,CAAC,QAAQ,EAAE,EAAE,KAAK,EAAE,CAAC,OAAO,EAAE,QAAQ,CAAC,EAAE,CAAC;CAAG;AAE/E,MAAM,OAAO,GAAG,IAAI,iBAAiB,CACpC,MAAM,EACN,GAAG,EAAE,CACJ,IAAI,MAAM,CAAC;IACV,KAAK,EAAE,IAAI,QAAQ,CAAC;QACnB,EAAE,IAAI,EAAE,GAAG,EAAE,QAAQ,EAAE,SAAS,EAAE;QAClC,IAAI,IAAI,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,QAAQ,EAAE,SAAS,EAAE,CAAC;KAC5C,CAAC;CACF,CAAC,CACH,CAAC;AAEF,MAAM,OAAO,GAAG,IAAI,iBAAiB,CACpC,MAAM,EACN,GAAG,EAAE,CACJ,IAAI,MAAM,CAAC;IACV,KAAK,EAAE;QACN,mFAAmF;QACnF,EAAE,IAAI,EAAE,GAAG,EAAE,QAAQ,EAAE,SAAS,EAAE;QAClC,IAAI,IAAI,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,QAAQ,EAAE,SAAS,EAAE,CAAC;KAC5C;CACD,CAAC,CACH,CAAC;AAEF,SAAS,KAAK,CAAC,IAAW;IACzB,MAAM,IAAI,GAAqB,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;IACxD,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC;IAC9B,IAAI,KAAK,YAAY,OAAO,EAAE;QAC7B,OAAO,CAAC,CAAC,KAAK,CAAC,CAAC;KAChB;IACD,0CAA0C;IAC1C,MAAM,UAAU,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;IAC5B,2DAA2D;IAC3D,UAAU,CAAC,WAAW,EAAE,CAAC;IACzB,0HAA0H;IAC1H,8CAA8C;IAC9C,MAAM,CAAC,GAAW,UAAU,CAAC,IAAI,CAAC;IAClC,sBAAsB;IACtB,MAAM,KAAK,GAAW,CAAC,GAAG,KAAK,CAAC,CAAC;IACjC,OAAO,KAAK,CAAC;AACd,CAAC;AAED,QAAQ,CAAC,gCAAgC,EAAE,GAAG,EAAE;IAC/C,EAAE,CAAC,aAAa,EAAE,GAAG,EAAE;QACtB,MAAM,OAAO,GAAG,IAAI,WAAW,CAAC,EAAE,CAAC,CAAC;QACpC,MAAM,OAAO,GAAG,OAAO,CAAC,MAAM,CAC7B,IAAI,yBAAyB,CAAC,EAAE,YAAY,EAAE,kBAAkB,EAAE,EAAE,CAAC,EACrE,MAAM,CACN,CAAC;QACF,KAAK,CAAC,OAAO,CAAC,CAAC;IAChB,CAAC,CAAC,CAAC;IAEH,sGAAsG;IACtG,EAAE,CAAC,SAAS,EAAE,GAAG,EAAE;QAClB,MAAM,OAAO,GAAG,IAAI,WAAW,CAAC,EAAE,CAAC,CAAC;QACpC,MAAM,OAAO,GAAG,OAAO,CAAC,MAAM,CAC7B,IAAI,yBAAyB,CAAC,EAAE,YAAY,EAAE,kBAAkB,EAAE,EAAE,CAAC,EACrE,MAAM,CACN,CAAC;QACF,MAAM,IAAI,GAAqB,OAAO,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;IAC5D,CAAC,CAAC,CAAC;AACJ,CAAC,CAAC,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { strict as assert } from \"node:assert\";\n\nimport { createIdCompressor } from \"@fluidframework/id-compressor\";\nimport { MockFluidDataStoreRuntime } from \"@fluidframework/test-runtime-utils\";\nimport {\n\tSchemaFactory,\n\tITree,\n\tTreeConfiguration,\n\tTreeView,\n\ttreeNodeApi as Tree,\n} from \"../../simple-tree/index.js\";\nimport { TreeFactory } from \"../../treeFactory.js\";\n\n// Since this no longer follows the builder pattern, it is a SchemaFactory instead of a SchemaBuilder.\nconst schema = new SchemaFactory(\"com.example\");\n\n/**\n * An example schema based type.\n * This doc comment will be visible in intellisense when referring to the schema (as a runtime value) or the instance type.\n */\nclass Point extends schema.object(\"Point\", {\n\tx: schema.number,\n\ty: schema.number,\n}) {}\n\nclass Note extends schema.object(\"Note\", {\n\t/**\n\t * Doc comment on a schema based field. Intellisense should work when referencing the field.\n\t */\n\ttext: schema.string,\n\t/**\n\t * Example optional field.\n\t * Works the same as before.\n\t */\n\tlocation: schema.optional(Point),\n}) {\n\t// Schema based classes can have methods and extra session local properties.\n\t// We don't have to recommend this as a design pattern, but it does just work.\n\tpublic isSelected: boolean = false;\n\n\t// Methods also work, and can access the tree APIs as normal:\n\tpublic moveToFront(): void {\n\t\tconst parent = Tree.parent(this);\n\t\t// instanceof just works: nothing special to learn for either JS or TS narrowing of unions.\n\t\tif (parent instanceof NodeList) {\n\t\t\tconst key = Tree.key(this);\n\t\t\tassert(typeof key === \"number\");\n\t\t\tparent.moveToEnd(key);\n\t\t}\n\t}\n}\n\nclass NodeMap extends schema.map(\"NoteMap\", Note) {}\nclass NodeList extends schema.array(\"NoteList\", Note) {}\n\n// Example function working on some schema based types.\n// Note that there is no need to use Typed<typeof NodeMap> anymore (either inline or as a separate type declaration).\nfunction f(n: NodeMap): Note[] {\n\t// These schema based types can have methods provided based on their node kind. In this case maps have `get`.\n\t// The type returned from `get` is `Note | undefined`, and shows that way in the intellisense:\n\t// It does not show some complex type expression equivalent to that which is a big improvement over the previous setup.\n\tconst item: Note | undefined = n.get(\"x\");\n\treturn item === undefined ? [] : [item];\n}\n\nclass Canvas extends schema.object(\"Canvas\", { stuff: [NodeMap, NodeList] }) {}\n\nconst config1 = new TreeConfiguration(\n\tCanvas,\n\t() =>\n\t\tnew Canvas({\n\t\t\tstuff: new NodeList([\n\t\t\t\t{ text: \"a\", location: undefined },\n\t\t\t\tnew Note({ text: \"b\", location: undefined }),\n\t\t\t]),\n\t\t}),\n);\n\nconst config2 = new TreeConfiguration(\n\tCanvas,\n\t() =>\n\t\tnew Canvas({\n\t\t\tstuff: [\n\t\t\t\t// Trees of insertable data can mix inline insertable content and unhydrated nodes:\n\t\t\t\t{ text: \"a\", location: undefined },\n\t\t\t\tnew Note({ text: \"b\", location: undefined }),\n\t\t\t],\n\t\t}),\n);\n\nfunction setup(tree: ITree): Note[] {\n\tconst view: TreeView<Canvas> = tree.schematize(config1);\n\tconst stuff = view.root.stuff;\n\tif (stuff instanceof NodeMap) {\n\t\treturn f(stuff);\n\t}\n\t// Numeric indexing is supported on lists:\n\tconst secondItem = stuff[1];\n\t// Methods on schema based types can be called as expected.\n\tsecondItem.moveToFront();\n\t// Access to a schema based field. Intellisense for doc comment and navigate to source just work, as does refactor rename.\n\t// Thus functionality isn't new, but its nice.\n\tconst s: string = secondItem.text;\n\t// Lists are iterable:\n\tconst items: Note[] = [...stuff];\n\treturn items;\n}\n\ndescribe(\"Class based end to end example\", () => {\n\tit(\"run example\", () => {\n\t\tconst factory = new TreeFactory({});\n\t\tconst theTree = factory.create(\n\t\t\tnew MockFluidDataStoreRuntime({ idCompressor: createIdCompressor() }),\n\t\t\t\"tree\",\n\t\t);\n\t\tsetup(theTree);\n\t});\n\n\t// Confirm that the alternative syntax for the config from the example above (config2) actually works.\n\tit(\"config2\", () => {\n\t\tconst factory = new TreeFactory({});\n\t\tconst theTree = factory.create(\n\t\t\tnew MockFluidDataStoreRuntime({ idCompressor: createIdCompressor() }),\n\t\t\t\"tree\",\n\t\t);\n\t\tconst view: TreeView<Canvas> = theTree.schematize(config2);\n\t});\n});\n"]}

package/lib/test/simple-tree/schemaFactory.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=schemaFactory.spec.d.ts.map

package/lib/test/simple-tree/schemaFactory.spec.d.ts.map DELETED Viewed

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