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

	@@ -1 +1 @@
1	- {"version":3,"file":"proxies.js","sourceRoot":"","sources":["../../src/simple-tree/proxies.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,4BAA4B,CAAC;AAEpD,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,eAAe,EAAE,MAAM,kBAAkB,CAAC;AAChE,OAAO,EAGN,oBAAoB,EAEpB,iBAAiB,EACjB,YAAY,EACZ,WAAW,EACX,kBAAkB,EAClB,iBAAiB,EACjB,mBAAmB,EACnB,UAAU,EASV,YAAY,EACZ,cAAc,EACd,aAAa,GAEb,MAAM,+BAA+B,CAAC;AACvC,OAAO,EAAE,QAAQ,EAAiD,MAAM,kBAAkB,CAAC;AAC3F,0EAA0E;AAC1E,sDAAsD;AACtD,OAAO,EAAE,cAAc,EAAE,aAAa,EAAE,MAAM,4CAA4C,CAAC;AAC3F,OAAO,EAGN,QAAQ,GAER,MAAM,kBAAkB,CAAC;AAC1B,OAAO,EAAE,wBAAwB,EAAiB,MAAM,oBAAoB,CAAC;AAE7E,OAAO,EAAE,oBAAoB,EAAE,WAAW,EAAE,WAAW,EAAE,cAAc,EAAE,MAAM,eAAe,CAAC;AAC/F,OAAO,EAAE,mBAAmB,EAAE,kBAAkB,EAAE,MAAM,gBAAgB,CAAC;AACzE,OAAO,EAAe,aAAa,EAAE,qBAAqB,EAAE,MAAM,cAAc,CAAC;AAEjF;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,UAAU,CAAC,SAAkB;IAC5C,OAAO,cAAc,CAAC,SAAS,CAAC,KAAK,SAAS,CAAC;AAChD,CAAC;AAED;;KAEK;AACL,MAAM,UAAU,gBAAgB,CAAC,KAAoB;IACpD,QAAQ,KAAK,CAAC,MAAM,CAAC,IAAI,EAAE;QAC1B,KAAK,UAAU,CAAC,QAAQ,CAAC,CAAC;YACzB,MAAM,OAAO,GAAG,KAEf,CAAC;YAEF,yFAAyF;YACzF,8FAA8F;YAC9F,qBAAqB;YACrB,OAAO,oBAAoB,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC;SAClD;QACD,KAAK,UAAU,CAAC,QAAQ,CAAC,CAAC;YACzB,MAAM,OAAO,GAAG,KAEf,CAAC;YAEF,yFAAyF;YACzF,8FAA8F;YAC9F,qBAAqB;YAErB,MAAM,YAAY,GAAG,OAAO,CAAC,YAAY,CAAC;YAE1C,6FAA6F;YAC7F,kFAAkF;YAClF,OAAO,YAAY,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,oBAAoB,CAAC,YAAY,CAAC,CAAC;SACnF;QACD,+CAA+C;QAC/C,KAAK,UAAU,CAAC,QAAQ,CAAC,CAAC;YACzB,8FAA8F;YAC9F,oEAAoE;YACpE,IAAI,CAAC,iCAAiC,CAAC,CAAC;SACxC;QACD;YACC,IAAI,CAAC,oBAAoB,CAAC,CAAC;KAC5B;AACF,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,MAAM,kBAAkB,GAAkB,MAAM,CAAC,cAAc,CAAC,CAAC;AAExE,MAAM,UAAU,cAAc,CAAC,MAA0B;IACxD,IAAI,kBAAkB,IAAI,MAAM,EAAE;QACjC,OAAO,MAAM,CAAC,kBAAkB,CAAwB,CAAC;KACzD;IACD,OAAO,SAAS,CAAC;AAClB,CAAC;AAED,MAAM,UAAU,oBAAoB,CAAC,QAAsB;IAC1D,MAAM,WAAW,GAAG,oBAAoB,CAAC,QAAQ,CAAC,CAAC;IACnD,IAAI,WAAW,KAAK,SAAS,EAAE;QAC9B,OAAO,WAAW,CAAC;KACnB;IAED,MAAM,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC;IAC/B,IAAI,MAA4B,CAAC;IACjC,MAAM,WAAW,GAAG,cAAc,CAAC,MAAM,CAAC,CAAC;IAC3C,IAAI,WAAW,KAAK,SAAS,EAAE;QAC9B,IAAI,OAAO,WAAW,KAAK,UAAU,EAAE;YACtC,MAAM,YAAY,GAAG,WAA+D,CAAC;YACrF,MAAM,GAAG,IAAI,YAAY,CAAC,QAAQ,CAAC,CAAC;SACpC;aAAM;YACN,MAAM,GAAI,MAAkE,CAAC,MAAM,CAClF,QAAQ,CACR,CAAC;SACF;KACD;SAAM;QACN,yCAAyC;QACzC,2FAA2F;QAC3F,MAAM,GAAG,eAAe,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;KAC1C;IACD,OAAO,MAAM,CAAC;AACf,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,eAAe,CAC9B,QAAsB,EACtB,yBAAkC,EAClC,YAAqB;IAErB,MAAM,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC;IAC/B,IAAI,YAAY,CAAC,MAAM,CAAC,EAAE;QACzB,uDAAuD;QACvD,MAAM,CAAC,QAAQ,CAAC,KAAK,KAAK,SAAS,EAAE,KAAK,CAAC,0BAA0B,CAAC,CAAC;QACvE,OAAO,QAAQ,CAAC,KAAK,CAAC;KACtB;IACD,IAAI,KAAe,CAAC;IACpB,IAAI,WAAW,CAAC,MAAM,CAAC,EAAE;QACxB,KAAK,GAAG,cAAc,CAAC,yBAAyB,EAAE,YAAY,CAAC,CAAC;KAChE;SAAM,IAAI,iBAAiB,CAAC,MAAM,CAAC,EAAE;QACrC,KAAK,GAAG,oBAAoB,CAAC,yBAAyB,EAAE,YAAY,CAAC,CAAC;KACtE;SAAM,IAAI,kBAAkB,CAAC,MAAM,CAAC,EAAE;QACtC,KAAK,GAAG,iBAAiB,CAAC,MAAM,EAAE,yBAAyB,EAAE,YAAY,CAAC,CAAC;KAC3E;SAAM;QACN,IAAI,CAAC,wBAAwB,CAAC,CAAC;KAC/B;IACD,WAAW,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;IAC7B,OAAO,KAAK,CAAC;AACd,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,iBAAiB,CAChC,MAAe,EACf,yBAAkC,EAClC,eAAuB,EAAE;IAEzB,kGAAkG;IAClG,kGAAkG;IAClG,sEAAsE;IACtE,EAAE;IACF,sGAAsG;IACtG,wFAAwF;IAExF,kGAAkG;IAClG,uDAAuD;IACvD,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC,YAAY,EAAE;QACrC,GAAG,CAAC,MAAM,EAAE,GAAG;YACd,MAAM,KAAK,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC,WAAW,CAAC,GAAe,CAAC,CAAC;YAC9D,IAAI,KAAK,KAAK,SAAS,EAAE;gBACxB,OAAO,gBAAgB,CAAC,KAAK,CAAC,CAAC;aAC/B;YAED,uGAAuG;YACvG,OAAO,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;QACxC,CAAC;QACD,GAAG,CAAC,MAAM,EAAE,GAAG,EAAE,KAAwB;YACxC,MAAM,QAAQ,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC;YACpC,MAAM,cAAc,GAAG,QAAQ,CAAC,MAAM,CAAC;YACvC,MAAM,CAAC,cAAc,YAAY,oBAAoB,EAAE,KAAK,CAAC,oBAAoB,CAAC,CAAC;YACnF,MAAM,WAAW,GAAG,cAAc,CAAC,gBAAgB,CAAC,GAAG,CAAC,GAAe,CAAC,CAAC;YAEzE,IAAI,WAAW,KAAK,SAAS,EAAE;gBAC9B,OAAO,yBAAyB,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;aAC3E;YAED,4DAA4D;YAC5D,MAAM,CAAC,QAAQ,YAAY,cAAc,EAAE,KAAK,CAAC,qBAAqB,CAAC,CAAC;YACxE,MAAM,CAAC,OAAO,GAAG,KAAK,QAAQ,EAAE,KAAK,CAAC,iBAAiB,CAAC,CAAC;YACzD,MAAM,KAAK,GAAG,aAAa,CAAC,QAAQ,EAAE,KAAK,CAAC,GAAG,CAAC,EAAE,WAAW,CAAC,CAAC;YAE/D,QAAQ,KAAK,CAAC,MAAM,CAAC,IAAI,EAAE;gBAC1B,KAAK,UAAU,CAAC,QAAQ,CAAC;gBACzB,KAAK,UAAU,CAAC,QAAQ,CAAC,CAAC;oBACzB,MAAM,UAAU,GAAG,KAEuB,CAAC;oBAE3C,MAAM,EAAE,OAAO,EAAE,cAAc,EAAE,GAAG,qBAAqB,CAAC,KAAK,CAAC,CAAC;oBACjE,MAAM,MAAM,GAAG,kBAAkB,CAChC,OAAO,EACP,QAAQ,CAAC,OAAO,CAAC,MAAM,EACvB,WAAW,CAAC,cAAc,CAC1B,CAAC;oBACF,cAAc,CACb,QAAQ,EACR,GAAG,EAAE;wBACJ,UAAU,CAAC,OAAO,GAAG,MAAM,CAAC;oBAC7B,CAAC,EACD,GAAG,EAAE,CAAC,cAAc,CAAC,UAAU,CAAC,YAAY,CAAC,CAC7C,CAAC;oBACF,MAAM;iBACN;gBAED;oBACC,IAAI,CAAC,mBAAmB,CAAC,CAAC;aAC3B;YAED,OAAO,IAAI,CAAC;QACb,CAAC;QACD,GAAG,EAAE,CAAC,MAAM,EAAE,GAAG,EAAE,EAAE;YACpB,OAAO,CACN,MAAM,CAAC,gBAAgB,CAAC,GAAG,CAAC,GAAe,CAAC;gBAC5C,CAAC,yBAAyB,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAC9D,CAAC;QACH,CAAC;QACD,OAAO,EAAE,CAAC,MAAM,EAAE,EAAE;YACnB,OAAO;gBACN,GAAG,MAAM,CAAC,gBAAgB,CAAC,IAAI,EAAE;gBACjC,GAAG,CAAC,yBAAyB,CAAC,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;aAC7D,CAAC;QACH,CAAC;QACD,wBAAwB,EAAE,CAAC,MAAM,EAAE,GAAG,EAAE,EAAE;YACzC,MAAM,KAAK,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC,WAAW,CAAC,GAAe,CAAC,CAAC;YAE9D,IAAI,KAAK,KAAK,SAAS,EAAE;gBACxB,OAAO,yBAAyB;oBAC/B,CAAC,CAAC,OAAO,CAAC,wBAAwB,CAAC,MAAM,EAAE,GAAG,CAAC;oBAC/C,CAAC,CAAC,SAAS,CAAC;aACb;YAED,MAAM,CAAC,GAAuB;gBAC7B,KAAK,EAAE,gBAAgB,CAAC,KAAK,CAAC;gBAC9B,QAAQ,EAAE,IAAI;gBACd,UAAU,EAAE,IAAI;gBAChB,YAAY,EAAE,IAAI,EAAE,kEAAkE;aACtF,CAAC;YAEF,OAAO,CAAC,CAAC;QACV,CAAC;KACD,CAAa,CAAC;IACf,OAAO,KAAK,CAAC;AACd,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAAG,CAAkC,SAAwB,EAAE,EAAE,CAC7F,WAAW,CAAC,SAAS,CAAC,CAAC,OAAwC,CAAC;AAEjE,gGAAgG;AAChG,8DAA8D;AAC9D,SAAS,iCAAiC,CACzC,eAAuB,EACvB,OAAqF;IAErF,OAAO,qBAAqB,CAC3B,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAuB,EAAE,CAC1C,CAAC,YAAY,wBAAwB,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAC3D,EACD,eAAe,CACf,CAAC;AACH,CAAC;AAED,8CAA8C;AAE9C,2FAA2F;AAE3F;;GAEG;AACH,MAAM,CAAC,MAAM,4BAA4B,GAA0B;IAClE,4FAA4F;IAC5F,+GAA+G;IAC/G,qFAAqF;IACrF,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE;QAClB,KAAK,EAAE,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,QAAQ,CAAC;KACvC;IACD,EAAE,EAAE;QACH,KAAK,CAAsB,KAAa;YACvC,MAAM,KAAK,GAAG,gBAAgB,CAAC,IAAI,CAAC,CAAC;YACrC,MAAM,GAAG,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;YAEjC,IAAI,GAAG,KAAK,SAAS,EAAE;gBACtB,OAAO,GAAG,CAAC;aACX;YAED,OAAO,oBAAoB,CAAC,GAAG,CAAC,CAAC;QAClC,CAAC;KACD;IACD,QAAQ,EAAE;QACT,KAAK,CAEJ,KAAa,EACb,GAAG,KAAmF;YAEtF,MAAM,aAAa,GAAG,gBAAgB,CAAC,IAAI,CAAC,CAAC;YAE7C,MAAM,EAAE,OAAO,EAAE,cAAc,EAAE,GAAG,iCAAiC,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;YACpF,MAAM,MAAM,GAAG,mBAAmB,CACjC,OAAO,EACP,aAAa,CAAC,OAAO,CAAC,MAAM,EAC5B,aAAa,CAAC,MAAM,CACpB,CAAC;YAEF,cAAc,CACb,WAAW,CAAC,IAAI,CAAC,EACjB,GAAG,EAAE,CAAC,aAAa,CAAC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC,EAC3C,CAAC,YAAY,EAAE,EAAE,CAAC,cAAc,CAAC,YAAY,CAAC,CAC9C,CAAC;QACH,CAAC;KACD;IACD,aAAa,EAAE;QACd,KAAK,CAEJ,GAAG,KAAmF;YAEtF,MAAM,aAAa,GAAG,gBAAgB,CAAC,IAAI,CAAC,CAAC;YAE7C,MAAM,EAAE,OAAO,EAAE,cAAc,EAAE,GAAG,iCAAiC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;YAChF,MAAM,MAAM,GAAG,mBAAmB,CACjC,OAAO,EACP,aAAa,CAAC,OAAO,CAAC,MAAM,EAC5B,aAAa,CAAC,MAAM,CACpB,CAAC;YAEF,cAAc,CACb,WAAW,CAAC,IAAI,CAAC,EACjB,GAAG,EAAE,CAAC,aAAa,CAAC,aAAa,CAAC,MAAM,CAAC,EACzC,CAAC,YAAY,EAAE,EAAE,CAAC,cAAc,CAAC,YAAY,CAAC,CAC9C,CAAC;QACH,CAAC;KACD;IACD,WAAW,EAAE;QACZ,KAAK,CAEJ,GAAG,KAAmF;YAEtF,MAAM,aAAa,GAAG,gBAAgB,CAAC,IAAI,CAAC,CAAC;YAE7C,MAAM,EAAE,OAAO,EAAE,cAAc,EAAE,GAAG,iCAAiC,CACpE,IAAI,CAAC,MAAM,EACX,KAAK,CACL,CAAC;YACF,MAAM,MAAM,GAAG,mBAAmB,CACjC,OAAO,EACP,aAAa,CAAC,OAAO,CAAC,MAAM,EAC5B,aAAa,CAAC,MAAM,CACpB,CAAC;YAEF,cAAc,CACb,WAAW,CAAC,IAAI,CAAC,EACjB,GAAG,EAAE,CAAC,aAAa,CAAC,WAAW,CAAC,MAAM,CAAC,EACvC,CAAC,YAAY,EAAE,EAAE,CAAC,cAAc,CAAC,YAAY,CAAC,CAC9C,CAAC;QACH,CAAC;KACD;IACD,QAAQ,EAAE;QACT,KAAK,CAAsB,KAAa;YACvC,gBAAgB,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QACxC,CAAC;KACD;IACD,WAAW,EAAE;QACZ,KAAK,CAAsB,KAAc,EAAE,GAAY;YACtD,gBAAgB,CAAC,IAAI,CAAC,CAAC,WAAW,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QAChD,CAAC;KACD;IACD,WAAW,EAAE;QACZ,KAAK,CAAsB,WAAmB,EAAE,MAAsB;YACrE,IAAI,MAAM,KAAK,SAAS,EAAE;gBACzB,gBAAgB,CAAC,IAAI,CAAC,CAAC,WAAW,CAAC,WAAW,EAAE,gBAAgB,CAAC,MAAM,CAAC,CAAC,CAAC;aAC1E;iBAAM;gBACN,gBAAgB,CAAC,IAAI,CAAC,CAAC,WAAW,CAAC,WAAW,CAAC,CAAC;aAChD;QACF,CAAC;KACD;IACD,SAAS,EAAE;QACV,KAAK,CAAsB,WAAmB,EAAE,MAAsB;YACrE,IAAI,MAAM,KAAK,SAAS,EAAE;gBACzB,gBAAgB,CAAC,IAAI,CAAC,CAAC,SAAS,CAAC,WAAW,EAAE,gBAAgB,CAAC,MAAM,CAAC,CAAC,CAAC;aACxE;iBAAM;gBACN,gBAAgB,CAAC,IAAI,CAAC,CAAC,SAAS,CAAC,WAAW,CAAC,CAAC;aAC9C;QACF,CAAC;KACD;IACD,WAAW,EAAE;QACZ,KAAK,CAEJ,KAAa,EACb,WAAmB,EACnB,MAAsB;YAEtB,IAAI,MAAM,KAAK,SAAS,EAAE;gBACzB,gBAAgB,CAAC,IAAI,CAAC,CAAC,WAAW,CAAC,KAAK,EAAE,WAAW,EAAE,gBAAgB,CAAC,MAAM,CAAC,CAAC,CAAC;aACjF;iBAAM;gBACN,gBAAgB,CAAC,IAAI,CAAC,CAAC,WAAW,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC;aACvD;QACF,CAAC;KACD;IACD,gBAAgB,EAAE;QACjB,KAAK,CAEJ,WAAmB,EACnB,SAAiB,EACjB,MAAsB;YAEtB,IAAI,MAAM,KAAK,SAAS,EAAE;gBACzB,gBAAgB,CAAC,IAAI,CAAC,CAAC,gBAAgB,CACtC,WAAW,EACX,SAAS,EACT,gBAAgB,CAAC,MAAM,CAAC,CACxB,CAAC;aACF;iBAAM;gBACN,gBAAgB,CAAC,IAAI,CAAC,CAAC,gBAAgB,CAAC,WAAW,EAAE,SAAS,CAAC,CAAC;aAChE;QACF,CAAC;KACD;IACD,cAAc,EAAE;QACf,KAAK,CAEJ,WAAmB,EACnB,SAAiB,EACjB,MAAsB;YAEtB,IAAI,MAAM,KAAK,SAAS,EAAE;gBACzB,gBAAgB,CAAC,IAAI,CAAC,CAAC,cAAc,CACpC,WAAW,EACX,SAAS,EACT,gBAAgB,CAAC,MAAM,CAAC,CACxB,CAAC;aACF;iBAAM;gBACN,gBAAgB,CAAC,IAAI,CAAC,CAAC,cAAc,CAAC,WAAW,EAAE,SAAS,CAAC,CAAC;aAC9D;QACF,CAAC;KACD;IACD,gBAAgB,EAAE;QACjB,KAAK,CAEJ,KAAa,EACb,WAAmB,EACnB,SAAiB,EACjB,MAAsB;YAEtB,IAAI,MAAM,KAAK,SAAS,EAAE;gBACzB,gBAAgB,CAAC,IAAI,CAAC,CAAC,gBAAgB,CACtC,KAAK,EACL,WAAW,EACX,SAAS,EACT,gBAAgB,CAAC,MAAM,CAAC,CACxB,CAAC;aACF;iBAAM;gBACN,gBAAgB,CAAC,IAAI,CAAC,CAAC,gBAAgB,CAAC,KAAK,EAAE,WAAW,EAAE,SAAS,CAAC,CAAC;aACvE;QACF,CAAC;KACD;CACD,CAAC;AAEF,sDAAsD;AAEtD,uGAAuG;AACvG,8GAA8G;AAC9G,8FAA8F;AAC9F,EAAE;AACF,sGAAsG;AACtG,sDAAsD;AAEtD,kGAAkG;AAClG,6BAA6B;AAC7B;IACC,KAAK,CAAC,SAAS,CAAC,MAAM;IACtB,8BAA8B;IAC9B,KAAK,CAAC,SAAS,CAAC,OAAO;IACvB,KAAK,CAAC,SAAS,CAAC,KAAK;IACrB,wBAAwB;IACxB,KAAK,CAAC,SAAS,CAAC,MAAM;IACtB,KAAK,CAAC,SAAS,CAAC,IAAI;IACpB,KAAK,CAAC,SAAS,CAAC,SAAS;IACzB,KAAK,CAAC,SAAS,CAAC,IAAI;IACpB,KAAK,CAAC,SAAS,CAAC,OAAO;IACvB,KAAK,CAAC,SAAS,CAAC,OAAO;IACvB,KAAK,CAAC,SAAS,CAAC,QAAQ;IACxB,KAAK,CAAC,SAAS,CAAC,OAAO;IACvB,KAAK,CAAC,SAAS,CAAC,IAAI;IACpB,KAAK,CAAC,SAAS,CAAC,IAAI;IACpB,KAAK,CAAC,SAAS,CAAC,WAAW;IAC3B,0BAA0B;IAC1B,KAAK,CAAC,SAAS,CAAC,GAAG;IACnB,uBAAuB;IACvB,wBAAwB;IACxB,KAAK,CAAC,SAAS,CAAC,MAAM;IACtB,KAAK,CAAC,SAAS,CAAC,WAAW;IAC3B,2BAA2B;IAC3B,yBAAyB;IACzB,KAAK,CAAC,SAAS,CAAC,KAAK;IACrB,KAAK,CAAC,SAAS,CAAC,IAAI;IACpB,wBAAwB;IACxB,0BAA0B;IAC1B,KAAK,CAAC,SAAS,CAAC,cAAc;IAC9B,KAAK,CAAC,SAAS,CAAC,QAAQ;IACxB,2BAA2B;IAC3B,KAAK,CAAC,SAAS,CAAC,MAAM;CACtB,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE;IAChB,4BAA4B,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC;AACvD,CAAC,CAAC,CAAC;AAEH,qDAAqD;AAErD,MAAM,kBAAkB,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,SAAS,EAAE,4BAA4B,CAAC,CAAC;AAEzF,aAAa;AAEb;;GAEG;AACH,SAAS,OAAO,CAAC,GAAoB,EAAE,MAAc;IACpD,IAAI,OAAO,GAAG,KAAK,QAAQ,EAAE;QAC5B,oFAAoF;QACpF,mEAAmE;QACnE,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;QAE7B,uEAAuE;QACvE,IAAI,MAAM,CAAC,SAAS,CAAC,QAAQ,CAAC,EAAE;YAC/B,OAAO,CAAC,IAAI,QAAQ,IAAI,QAAQ,GAAG,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC;SACjE;KACD;AACF,CAAC;AAED;;;;;;GAMG;AACH,SAAS,oBAAoB,CAC5B,yBAAkC,EAClC,kBAA2B;IAE3B,MAAM,YAAY,GAAG,kBAAkB,IAAI,EAAE,CAAC;IAE9C,sGAAsG;IACtG,8FAA8F;IAC9F,qFAAqF;IACrF,4CAA4C;IAC5C,EAAE;IACF,6FAA6F;IAC7F,MAAM,QAAQ,GACb,kBAAkB;QAClB,MAAM,CAAC,MAAM,CAAC,kBAAkB,EAAE;YACjC,MAAM,EAAE;gBACP,GAAG;oBACF,OAAO,gBAAgB,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC;gBACtC,CAAC;gBACD,GAAG,KAAI,CAAC;gBACR,UAAU,EAAE,KAAK;gBACjB,YAAY,EAAE,KAAK;aACnB;SACD,CAAC,CAAC;IAEJ,oGAAoG;IACpG,sGAAsG;IACtG,oGAAoG;IACpG,MAAM,KAAK,GAAkB,IAAI,KAAK,CAAgB,YAAmB,EAAE;QAC1E,GAAG,EAAE,CAAC,MAAM,EAAE,GAAG,EAAE,EAAE;YACpB,MAAM,KAAK,GAAG,gBAAgB,CAAC,KAAK,CAAC,CAAC;YACtC,MAAM,UAAU,GAAG,OAAO,CAAC,GAAG,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;YAE9C,IAAI,UAAU,KAAK,SAAS,EAAE;gBAC7B,8DAA8D;gBAC9D,2CAA2C;gBAC3C,OAAO,OAAO,CAAC,GAAG,CAAC,QAAQ,EAAE,GAAG,EAAE,KAAK,CAAY,CAAC;aACpD;YAED,MAAM,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;YAExC,IAAI,KAAK,KAAK,SAAS,EAAE;gBACxB,OAAO,SAAS,CAAC;aACjB;YAED,yFAAyF;YACzF,8FAA8F;YAC9F,qBAAqB;YACrB,OAAO,oBAAoB,CAAC,KAAK,CAAC,CAAC;QACpC,CAAC;QACD,GAAG,EAAE,CAAC,MAAM,EAAE,GAAG,EAAE,QAAQ,EAAE,QAAQ,EAAE,EAAE;YACxC,wFAAwF;YACxF,iFAAiF;YACjF,IAAI,GAAG,KAAK,MAAM,CAAC,kBAAkB,EAAE;gBACtC,OAAO,OAAO,CAAC,GAAG,CAAC,QAAQ,EAAE,GAAG,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC;aACnD;YAED,MAAM,KAAK,GAAG,gBAAgB,CAAC,KAAK,CAAC,CAAC;YACtC,MAAM,UAAU,GAAG,OAAO,CAAC,GAAG,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;YAC9C,IAAI,UAAU,KAAK,SAAS,EAAE;gBAC7B,mHAAmH;gBACnH,OAAO,KAAK,CAAC;aACb;YACD,OAAO,yBAAyB,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,GAAG,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;QAC/E,CAAC;QACD,GAAG,EAAE,CAAC,MAAM,EAAE,GAAG,EAAE,EAAE;YACpB,MAAM,KAAK,GAAG,gBAAgB,CAAC,KAAK,CAAC,CAAC;YACtC,MAAM,UAAU,GAAG,OAAO,CAAC,GAAG,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;YAC9C,OAAO,UAAU,KAAK,SAAS,IAAI,OAAO,CAAC,GAAG,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;QAC/D,CAAC;QACD,OAAO,EAAE,CAAC,MAAM,EAAE,EAAE;YACnB,MAAM,KAAK,GAAG,gBAAgB,CAAC,KAAK,CAAC,CAAC;YAEtC,+EAA+E;YAC/E,mEAAmE;YACnE,OAAO,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;QACxF,CAAC;QACD,wBAAwB,EAAE,CAAC,MAAM,EAAE,GAAG,EAAE,EAAE;YACzC,MAAM,KAAK,GAAG,gBAAgB,CAAC,KAAK,CAAC,CAAC;YACtC,MAAM,UAAU,GAAG,OAAO,CAAC,GAAG,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;YAC9C,IAAI,UAAU,KAAK,SAAS,EAAE;gBAC7B,MAAM,GAAG,GAAG,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;gBACtC,8FAA8F;gBAC9F,yGAAyG;gBACzG,OAAO;oBACN,yFAAyF;oBACzF,yFAAyF;oBACzF,qBAAqB;oBACrB,KAAK,EAAE,GAAG,KAAK,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,oBAAoB,CAAC,GAAG,CAAC;oBAC1D,QAAQ,EAAE,IAAI;oBACd,UAAU,EAAE,IAAI;oBAChB,YAAY,EAAE,IAAI;iBAClB,CAAC;aACF;iBAAM,IAAI,GAAG,KAAK,QAAQ,EAAE;gBAC5B,gGAAgG;gBAChG,2FAA2F;gBAC3F,OAAO;oBACN,KAAK,EAAE,gBAAgB,CAAC,KAAK,CAAC,CAAC,MAAM;oBACrC,QAAQ,EAAE,IAAI;oBACd,UAAU,EAAE,KAAK;oBACjB,YAAY,EAAE,KAAK;iBACnB,CAAC;aACF;YACD,OAAO,OAAO,CAAC,wBAAwB,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;QACxD,CAAC;KACD,CAAC,CAAC;IACH,OAAO,KAAK,CAAC;AACd,CAAC;AAED,uCAAuC;AAEvC,MAAM,CAAC,MAAM,oBAAoB,GAA0B;IAC1D,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE;QAClB,KAAK;YACJ,OAAO,IAAI,CAAC,OAAO,EAAE,CAAC;QACvB,CAAC;KACD;IACD,MAAM,EAAE;QACP,KAAK,CAAoB,GAAW;YACnC,MAAM,IAAI,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC;YAC/B,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAClB,CAAC;KACD;IACD,OAAO,EAAE;QACR,CAAC,KAAK;YACL,MAAM,IAAI,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC;YAC/B,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,IAAI,EAAE,EAAE;gBAC9B,MAAM,CAAC,GAAG,EAAE,gBAAgB,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;aAClD;QACF,CAAC;KACD;IACD,GAAG,EAAE;QACJ,KAAK,CAAoB,GAAW;YACnC,MAAM,IAAI,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC;YAC/B,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;YACjC,OAAO,gBAAgB,CAAC,KAAK,CAAC,CAAC;QAChC,CAAC;KACD;IACD,GAAG,EAAE;QACJ,KAAK,CAAoB,GAAW;YACnC,MAAM,IAAI,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC;YAC/B,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACtB,CAAC;KACD;IACD,IAAI,EAAE;QACL,KAAK;YACJ,MAAM,IAAI,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC;YAC/B,OAAO,IAAI,CAAC,IAAI,EAAE,CAAC;QACpB,CAAC;KACD;IACD,GAAG,EAAE;QACJ,KAAK,CAEJ,GAAW,EACX,KAA+C;YAE/C,MAAM,IAAI,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC;YAE/B,MAAM,EAAE,OAAO,EAAE,cAAc,EAAE,GAAG,qBAAqB,CAAC,KAAuB,CAAC,CAAC;YACnF,MAAM,MAAM,GAAG,kBAAkB,CAChC,OAAO,EACP,IAAI,CAAC,OAAO,CAAC,MAAM,EACnB,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,cAAc,CACpC,CAAC;YACF,cAAc,CACb,IAAI,EACJ,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,EACrC,CAAC,OAAO,EAAE,EAAE,CAAC,cAAc,CAAC,eAAe,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC,CAC1D,CAAC;YACF,OAAO,IAAI,CAAC;QACb,CAAC;KACD;IACD,IAAI,EAAE;QACL,GAAG;YACF,OAAO,WAAW,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC;QAC/B,CAAC;KACD;IACD,MAAM,EAAE;QACP,CAAC,KAAK;YACL,KAAK,MAAM,CAAC,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,OAAO,EAAE,EAAE;gBACvC,MAAM,KAAK,CAAC;aACZ;QACF,CAAC;KACD;IACD,qEAAqE;CACrE,CAAC;AAEF,MAAM,YAAY,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,SAAS,EAAE,oBAAoB,CAAC,CAAC;AAE3E,aAAa;AAEb;;;;;;GAMG;AACH,SAAS,cAAc,CACtB,yBAAkC,EAClC,kBAA2B;IAE3B,sFAAsF;IACtF,MAAM,QAAQ,GACb,kBAAkB;QAClB,MAAM,CAAC,MAAM,CAAC,YAAY,EAAE;QAC3B,8DAA8D;SAC9D,CAAC,CAAC;IACJ,MAAM,YAAY,GAAW,kBAAkB,IAAI,IAAI,GAAG,EAAoB,CAAC;IAE/E,kGAAkG;IAClG,uDAAuD;IACvD,MAAM,KAAK,GAAG,IAAI,KAAK,CAAc,YAA2B,EAAE;QACjE,GAAG,EAAE,CAAC,MAAM,EAAE,GAAG,EAAE,QAAQ,EAAW,EAAE;YACvC,uGAAuG;YACvG,OAAO,OAAO,CAAC,GAAG,CAAC,QAAQ,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;QAC1C,CAAC;QACD,wBAAwB,EAAE,CAAC,MAAM,EAAE,GAAG,EAAkC,EAAE;YACzE,OAAO,OAAO,CAAC,wBAAwB,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;QACxD,CAAC;QACD,GAAG,EAAE,CAAC,MAAM,EAAE,GAAG,EAAE,EAAE;YACpB,OAAO,OAAO,CAAC,GAAG,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;QACnC,CAAC;QACD,GAAG,EAAE,CAAC,MAAM,EAAE,GAAG,EAAE,QAAQ,EAAW,EAAE;YACvC,OAAO,yBAAyB,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,EAAE,GAAG,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;QACjF,CAAC;QACD,OAAO,EAAE,CAAC,MAAM,EAAE,EAAE;YACnB,+FAA+F;YAC/F,OAAO,EAAE,CAAC;QACX,CAAC;KACD,CAAC,CAAC;IACH,OAAO,KAAK,CAAC;AACd,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,kBAAkB,CACjC,MAA0B,EAC1B,OAA0D,EAC1D,yBAAkC,EAClC,MAAe;IAEf,oEAAoE;IACpE,IAAI,QAAmF,CAAC;IACxF,IAAI,KAAe,CAAC;IACpB,IAAI,MAAM,YAAY,oBAAoB,EAAE;QAC3C,MAAM,WAAW,GAAG,WAAW,CAAC,MAAM,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QACtD,QAAQ,GAAG,aAAa,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;QAC9C,KAAK,GAAG,iBAAiB,CAAC,MAAM,EAAE,yBAAyB,EAAE,MAAM,CAAC,CAAC;KACrE;SAAM,IAAI,MAAM,YAAY,mBAAmB,EAAE;QACjD,oEAAoE;QACpE,MAAM,WAAW,GAAG,WAAW,CAAC,MAAM,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QACtD,QAAQ,GAAG,aAAa,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;QAC9C,KAAK,GAAG,oBAAoB,CAAC,yBAAyB,EAAE,MAAM,CAAC,CAAC;KAChE;SAAM,IAAI,MAAM,YAAY,iBAAiB,EAAE;QAC/C,MAAM,WAAW,GAAG,WAAW,CAAC,MAAM,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QACtD,QAAQ,GAAG,aAAa,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;QAC9C,KAAK,GAAG,cAAc,CAAC,yBAAyB,EAAE,MAAM,CAAC,CAAC;KAC1D;SAAM;QACN,IAAI,CAAC,6BAA6B,CAAC,CAAC;KACpC;IAED,OAAO,WAAW,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;AACrC,CAAC;AAED,SAAS,WAAW,CAAmB,QAAkC,EAAE,OAAU;IACpF,MAAM,IAAI,GACT,OAAO,YAAY,GAAG;QACrB,CAAC,CAAE,IAAI,GAAG,CAAC,OAAO,CAAO;QACzB,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC;YACxB,CAAC,CAAE,OAAO,CAAC,KAAK,EAAQ;YACxB,CAAC,CAAC,EAAE,GAAG,OAAO,EAAE,CAAC;IAEnB,OAAO,MAAM,CAAC,cAAc,CAAC,IAAI,EAAE,cAAc,EAAE,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,CAAC;AACzE,CAAC;AAGD,MAAM,YAAY,GAAkB,GAAG,EAAE,GAAE,CAAC,CAAC;AAe7C;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,MAAM,UAAU,qBAAqB,CACpC,KAAwB,EACxB,eAAe,GAAG,CAAC;IAEnB,IAAI,OAAuB,CAAC;IAC5B,IAAI,WAAW,GAAG,KAAK,CAAC;IACxB,MAAM,WAAW,GAAG,cAAc,CAAC,KAAK,CAAC,CAAC;IAC1C,IAAI,WAAW,KAAK,SAAS,EAAE;QAC9B,MAAM,cAAc,GAAG,qBAAqB,CAAC,WAAW,CAAC,CAAC;QAC1D,IAAI,cAAc,KAAK,SAAS,EAAE;YACjC,uEAAuE;YACvE,MAAM,IAAI,KAAK,CAAC,kDAAkD,CAAC,CAAC;SACpE;QACD,OAAO,GAAG,cAAc,CAAC;QACzB,WAAW,GAAG,IAAI,CAAC;KACnB;SAAM;QACN,OAAO,GAAG,KAAuB,CAAC;KAClC;IAED,MAAM,CAAC,CAAC,UAAU,CAAC,OAAO,CAAC,EAAE,KAAK,CAAC,uDAAuD,CAAC,CAAC;IAE5F,IAAI,IAAc,CAAC;IACnB,IAAI,gBAAyC,CAAC;IAC9C,IAAI,eAAe,CAAC,OAAO,CAAC,EAAE;QAC7B,IAAI,GAAG,QAAQ,CAAC,KAAK,CAAC;QACtB,gBAAgB,GAAG,mBAAmB,CACrC,OAAoC,EACpC,eAAe,CACf,CAAC;KACF;SAAM,IAAI,OAAO,YAAY,GAAG,EAAE;QAClC,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC;QACpB,gBAAgB,GAAG,iBAAiB,CAAC,OAA8C,CAAC,CAAC;KACrF;SAAM,IAAI,OAAO,OAAO,KAAK,QAAQ,IAAI,OAAO,KAAK,IAAI,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,EAAE;QACtF,IAAI,GAAG,QAAQ,CAAC,MAAM,CAAC;QACvB,gBAAgB,GAAG,oBAAoB,CAAC,OAAiB,CAAC,CAAC;KAC3D;SAAM;QACN,gBAAgB,GAAG,EAAE,OAAO,EAAE,cAAc,EAAE,YAAY,EAAE,CAAC;QAC7D,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC;KACrB;IAED,IAAI,UAAU,CAAC,KAAK,CAAC,EAAE;QACtB,MAAM,cAAc,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC;QAC1C,MAAM,CAAC,cAAc,KAAK,IAAI,EAAE,KAAK,CAAC,8CAA8C,CAAC,CAAC;KACtF;IAED,IAAI,WAAW,EAAE;QAChB,OAAO;YACN,OAAO,EAAE,gBAAgB,CAAC,OAAO;YACjC,cAAc,EAAE,CAAC,QAAQ,EAAE,EAAE;gBAC5B,gEAAgE;gBAChE,WAAW,CAAC,KAAiB,EAAE,QAAQ,IAAI,IAAI,CAAC,oBAAoB,CAAC,CAAC,CAAC;gBACvE,gBAAgB,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC;YAC3C,CAAC;SACD,CAAC;KACF;IAED,OAAO,gBAAgB,CAAC;AACzB,CAAC;AAED;;GAEG;AACH,SAAS,mBAAmB,CAC3B,KAAgC,EAChC,eAAuB;IAEvB,MAAM,MAAM,GAAqB,EAAE,CAAC;IACpC,IAAI,cAAc,IAAI,KAAK,EAAE;QAC5B,MAAM,CAAC,cAAc,CAAC,MAAM,EAAE,cAAc,EAAE,EAAE,KAAK,EAAE,KAAK,CAAC,cAAc,CAAC,EAAE,CAAC,CAAC;KAChF;IACD,MAAM,SAAS,GAA8C,EAAE,CAAC;IAChE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QACtC,MAAM,EAAE,OAAO,EAAE,YAAY,EAAE,cAAc,EAAE,GAAG,qBAAqB,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QAClF,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QAC1B,wGAAwG;QACxG,IAAI,cAAc,KAAK,YAAY,EAAE;YACpC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC,CAAC;SACpC;KACD;IACD,OAAO;QACN,OAAO,EAAE,MAAM;QACf,cAAc,EAAE,CAAC,QAAkC,EAAE,EAAE;YACtD,MAAM,CACL,QAAQ,KAAK,SAAS,EACtB,KAAK,CAAC,gEAAgE,CACtE,CAAC;YACF,MAAM,CACL,iBAAiB,CAAC,QAAQ,CAAC,MAAM,CAAC,EAClC,KAAK,CAAC,mDAAmD,CACzD,CAAC;YACF,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,EAAE,EAAE,CAClC,OAAO,CACN,qBAAqB,CACpB,QAAkD,EAClD,eAAe,GAAG,CAAC,CACnB,CACD,CACD,CAAC;QACH,CAAC;KACD,CAAC;AACH,CAAC;AAED,SAAS,iBAAiB,CAAC,KAA0C;IACpE,MAAM,MAAM,GAAG,IAAI,GAAG,EAAE,CAAC;IACzB,IAAI,cAAc,IAAI,KAAK,EAAE;QAC5B,MAAM,CAAC,cAAc,CAAC,MAAM,EAAE,cAAc,EAAE,EAAE,KAAK,EAAE,KAAK,CAAC,cAAc,CAAC,EAAE,CAAC,CAAC;KAChF;IACD,MAAM,SAAS,GAA4C,EAAE,CAAC;IAC9D,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,KAAK,EAAE;QACjC,MAAM,EAAE,OAAO,EAAE,YAAY,EAAE,cAAc,EAAE,GAAG,qBAAqB,CAAC,KAAK,CAAC,CAAC;QAC/E,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,YAAY,CAAC,CAAC;QAC9B,yGAAyG;QACzG,IAAI,cAAc,KAAK,YAAY,EAAE;YACpC,SAAS,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,cAAc,CAAC,CAAC,CAAC;SACtC;KACD;IACD,OAAO;QACN,OAAO,EAAE,MAAM;QACf,cAAc,EAAE,CAAC,QAAkC,EAAE,EAAE;YACtD,MAAM,CACL,QAAQ,KAAK,SAAS,EACtB,KAAK,CAAC,yDAAyD,CAC/D,CAAC;YACF,MAAM,CAAC,WAAW,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,KAAK,CAAC,0CAA0C,CAAC,CAAC;YACvF,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,EAAE,OAAO,CAAC,EAAE,EAAE,CACpC,OAAO,CAAC,eAAe,CAAC,QAA8C,EAAE,GAAG,CAAC,CAAC,CAC7E,CAAC;QACH,CAAC;KACD,CAAC;AACH,CAAC;AAED,SAAS,oBAAoB,CAAC,KAE7B;IACA,MAAM,MAAM,GAAmC,EAAE,CAAC;IAClD,IAAI,cAAc,IAAI,KAAK,EAAE;QAC5B,MAAM,CAAC,cAAc,CAAC,MAAM,EAAE,cAAc,EAAE,EAAE,KAAK,EAAE,KAAK,CAAC,cAAc,CAAC,EAAE,CAAC,CAAC;KAChF;IACD,MAAM,SAAS,GAA4C,EAAE,CAAC;IAC9D,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE;QACjD,sDAAsD;QACtD,8IAA8I;QAC9I,IAAI,KAAK,KAAK,SAAS,EAAE;YACxB,MAAM,EAAE,OAAO,EAAE,YAAY,EAAE,cAAc,EAAE,GAAG,qBAAqB,CAAC,KAAK,CAAC,CAAC;YAC/E,MAAM,CAAC,GAAG,CAAC,GAAG,YAAY,CAAC;YAC3B,SAAS,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,cAAc,CAAC,CAAC,CAAC;SACtC;KACD;IAED,OAAO;QACN,OAAO,EAAE,MAAM;QACf,cAAc,EAAE,CAAC,QAAkC,EAAE,EAAE;YACtD,MAAM,CACL,QAAQ,KAAK,SAAS,EACtB,KAAK,CAAC,4DAA4D,CAClE,CAAC;YACF,MAAM,CACL,kBAAkB,CAAC,QAAQ,CAAC,MAAM,CAAC,EACnC,KAAK,CAAC,wDAAwD,CAC9D,CAAC;YACF,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,EAAE,OAAO,CAAC,EAAE,EAAE,CACpC,OAAO,CAAC,kBAAkB,CAAC,QAA8B,EAAE,GAAG,CAAC,CAAC,CAChE,CAAC;QACH,CAAC;KACD,CAAC;AACH,CAAC;AAyBD,SAAS,qBAAqB,CAC7B,SAAiD,EACjD,KAAa;IAEb,MAAM,KAAK,GAAG,SAAS,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;IAC9C,MAAM,CACL,KAAK,EAAE,MAAM,CAAC,IAAI,KAAK,UAAU,CAAC,QAAQ,EAC1C,KAAK,CAAC,uDAAuD,CAC7D,CAAC;IACF,OAAQ,KAAiD,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;AAC1E,CAAC;AAED,SAAS,eAAe,CACvB,OAA2C,EAC3C,GAAW;IAEX,MAAM,KAAK,GAAG,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;IACpC,MAAM,CACL,KAAK,CAAC,MAAM,CAAC,IAAI,KAAK,UAAU,CAAC,QAAQ,EACzC,KAAK,CAAC,sDAAsD,CAC5D,CAAC;IACF,OAAQ,KAAiD,CAAC,YAAY,CAAC;AACxE,CAAC;AAED,SAAS,kBAAkB,CAAC,UAA8B,EAAE,GAAW;IACtE,MAAM,KAAK,GACV,UAAU,CAAC,WAAW,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,uCAAuC,CAAC,CAAC;IACrF,MAAM,CACL,KAAK,CAAC,MAAM,CAAC,IAAI,KAAK,UAAU,CAAC,QAAQ,IAAI,KAAK,CAAC,MAAM,CAAC,IAAI,KAAK,UAAU,CAAC,QAAQ,EACtF,KAAK,CAAC,8CAA8C,CACpD,CAAC;IACF,OACC,KACA,CAAC,YAAY,CAAC;AAChB,CAAC;AAED;;;GAGG;AACH,SAAS,cAAc,CACtB,MAAS,EACT,MAA2B,EAC3B,KAA2B;IAE3B,MAAM,aAAa,GAAG,MAAM,CAAC,YAAY,CAAC,CAAC,GAAG,EAAE,CAAC,KAAK,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC;IAClE,MAAM,CAAC,MAAM,CAAC,CAAC;IACf,0GAA0G;IAC1G,kIAAkI;IAClI,gIAAgI;IAChI,aAAa,EAAE,CAAC;AACjB,CAAC;AAED,4GAA4G;AAC5G,SAAS,WAAW,CAAC,IAAc;IAClC,OAAO,CACN,cAAc,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,EAAE,IAAI;QAC9C,IAAI,CAAC,0CAA0C,CAAC,CAChD,CAAC;AACH,CAAC","sourcesContent":["/!\n Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n /\n\nimport { assert } from \"@fluidframework/core-utils\";\nimport { IFluidHandle } from \"@fluidframework/core-interfaces\";\nimport { brand, fail, isReadonlyArray } from \"../util/index.js\";\nimport {\n\tFlexAllowedTypes,\n\tFlexFieldSchema,\n\tFlexObjectNodeSchema,\n\tFlexTreeNodeSchema,\n\tschemaIsFieldNode,\n\tschemaIsLeaf,\n\tschemaIsMap,\n\tschemaIsObjectNode,\n\tFlexMapNodeSchema,\n\tFlexFieldNodeSchema,\n\tFieldKinds,\n\tFlexTreeFieldNode,\n\tFlexTreeMapNode,\n\tFlexTreeObjectNode,\n\tFlexTreeOptionalField,\n\tFlexTreeRequiredField,\n\tFlexTreeSequenceField,\n\tFlexTreeNode,\n\tFlexTreeTypedField,\n\tonNextChange,\n\ttypeNameSymbol,\n\tisFluidHandle,\n\tFlexTreeField,\n} from \"../feature-libraries/index.js\";\nimport { EmptyKey, FieldKey, TreeNodeSchemaIdentifier, TreeValue } from \"../core/index.js\";\n// TODO: decide how to deal with dependencies on flex-tree implementation.\n// eslint-disable-next-line import/no-internal-modules\nimport { LazyObjectNode, getBoxedField } from \"../feature-libraries/flex-tree/lazyNode.js\";\nimport {\n\ttype TreeNodeSchema as TreeNodeSchemaClass,\n\ttype InsertableTypedNode,\n\tNodeKind,\n\tTreeMapNode,\n} from \"./schemaTypes.js\";\nimport { IterableTreeArrayContent, TreeArrayNode } from \"./treeArrayNode.js\";\nimport { Unhydrated, TreeNode } from \"./types.js\";\nimport { tryGetFlexNodeTarget, setFlexNode, getFlexNode, tryGetFlexNode } from \"./flexNode.js\";\nimport { cursorFromFieldData, cursorFromNodeData } from \"./toMapTree.js\";\nimport { RawTreeNode, createRawNode, extractRawNodeContent } from \"./rawNode.js\";\n\n/\n Detects if the given 'candidate' is a TreeNode.\n \n @remarks\n * Supports both Hydrated and {@link Unhydrated} TreeNodes, both of which return true.\n \n Because the common usage is to check if a value being inserted/set is a TreeNode,\n * this function permits calling with primitives as well as objects.\n \n Primitives will always return false (as they are copies of data, not references to nodes).\n \n @param candidate - Value which may be a TreeNode\n * @returns true if the given 'candidate' is a hydrated TreeNode.\n /\nexport function isTreeNode(candidate: unknown): candidate is TreeNode \| Unhydrated<TreeNode> {\n\treturn tryGetFlexNode(candidate) !== undefined;\n}\n\n/\n Retrieve the associated proxy for the given field.\n * /\nexport function getProxyForField(field: FlexTreeField): TreeNode \| TreeValue \| undefined {\n\tswitch (field.schema.kind) {\n\t\tcase FieldKinds.required: {\n\t\t\tconst asValue = field as FlexTreeTypedField<\n\t\t\t\tFlexFieldSchema<typeof FieldKinds.required>\n\t\t\t>;\n\n\t\t\t// TODO: Ideally, we would return leaves without first boxing them. However, this is not\n\t\t\t// as simple as calling '.content' since this skips the node and returns the FieldNode's\n\t\t\t// inner field.\n\t\t\treturn getOrCreateNodeProxy(asValue.boxedContent);\n\t\t}\n\t\tcase FieldKinds.optional: {\n\t\t\tconst asValue = field as FlexTreeTypedField<\n\t\t\t\tFlexFieldSchema<typeof FieldKinds.optional>\n\t\t\t>;\n\n\t\t\t// TODO: Ideally, we would return leaves without first boxing them. However, this is not\n\t\t\t// as simple as calling '.content' since this skips the node and returns the FieldNode's\n\t\t\t// inner field.\n\n\t\t\tconst maybeContent = asValue.boxedContent;\n\n\t\t\t// Normally, empty fields are unreachable due to the behavior of 'tryGetField'. However, the\n\t\t\t// root field is a special case where the field is always present (even if empty).\n\t\t\treturn maybeContent === undefined ? undefined : getOrCreateNodeProxy(maybeContent);\n\t\t}\n\t\t// TODO: Remove if/when 'FieldNode' is removed.\n\t\tcase FieldKinds.sequence: {\n\t\t\t// 'getProxyForNode' handles FieldNodes by unconditionally creating a array node proxy, making\n\t\t\t// this case unreachable as long as users follow the 'array recipe'.\n\t\t\tfail(\"'sequence' field is unexpected.\");\n\t\t}\n\t\tdefault:\n\t\t\tfail(\"invalid field kind\");\n\t}\n}\n\n/\n A symbol for storing TreeNodeSchemaClass on FlexTreeNode's schema.\n /\nexport const simpleSchemaSymbol: unique symbol = Symbol(`simpleSchema`);\n\nexport function getClassSchema(schema: FlexTreeNodeSchema): TreeNodeSchemaClass \| undefined {\n\tif (simpleSchemaSymbol in schema) {\n\t\treturn schema[simpleSchemaSymbol] as TreeNodeSchemaClass;\n\t}\n\treturn undefined;\n}\n\nexport function getOrCreateNodeProxy(flexNode: FlexTreeNode): TreeNode \| TreeValue {\n\tconst cachedProxy = tryGetFlexNodeTarget(flexNode);\n\tif (cachedProxy !== undefined) {\n\t\treturn cachedProxy;\n\t}\n\n\tconst schema = flexNode.schema;\n\tlet output: TreeNode \| TreeValue;\n\tconst classSchema = getClassSchema(schema);\n\tif (classSchema !== undefined) {\n\t\tif (typeof classSchema === \"function\") {\n\t\t\tconst simpleSchema = classSchema as unknown as new (dummy: FlexTreeNode) => TreeNode;\n\t\t\toutput = new simpleSchema(flexNode);\n\t\t} else {\n\t\t\toutput = (schema as unknown as { create: (data: FlexTreeNode) => TreeNode }).create(\n\t\t\t\tflexNode,\n\t\t\t);\n\t\t}\n\t} else {\n\t\t// Fallback to createNodeProxy if needed.\n\t\t// TODO: maybe remove this fallback and error once migration to class based schema is done.\n\t\toutput = createNodeProxy(flexNode, false);\n\t}\n\treturn output;\n}\n\n/\n @param flexNode - underlying tree node which this proxy should wrap.\n * @param allowAdditionalProperties - If true, setting of unexpected properties will be forwarded to the target object.\n * Otherwise setting of unexpected properties will error.\n * @param customTargetObject - Target object of the proxy.\n * If not provided an empty collection of the relevant type is used for the target and a separate object created to dispatch methods.\n * If provided, the customTargetObject will be used as both the dispatch object and the proxy target, and therefor must provide needed functionality depending on the schema kind.\n /\nexport function createNodeProxy(\n\tflexNode: FlexTreeNode,\n\tallowAdditionalProperties: boolean,\n\ttargetObject?: object,\n): TreeNode \| TreeValue {\n\tconst schema = flexNode.schema;\n\tif (schemaIsLeaf(schema)) {\n\t\t// Can't use `??` here since null is a valid TreeValue.\n\t\tassert(flexNode.value !== undefined, 0x887 / Leaf must have value /);\n\t\treturn flexNode.value;\n\t}\n\tlet proxy: TreeNode;\n\tif (schemaIsMap(schema)) {\n\t\tproxy = createMapProxy(allowAdditionalProperties, targetObject);\n\t} else if (schemaIsFieldNode(schema)) {\n\t\tproxy = createArrayNodeProxy(allowAdditionalProperties, targetObject);\n\t} else if (schemaIsObjectNode(schema)) {\n\t\tproxy = createObjectProxy(schema, allowAdditionalProperties, targetObject);\n\t} else {\n\t\tfail(\"unrecognized node kind\");\n\t}\n\tsetFlexNode(proxy, flexNode);\n\treturn proxy;\n}\n\n/\n @param allowAdditionalProperties - If true, setting of unexpected properties will be forwarded to the target object.\n * Otherwise setting of unexpected properties will error.\n * @param customTargetObject - Target object of the proxy.\n * If not provided `{}` is used for the target.\n /\nexport function createObjectProxy<TSchema extends FlexObjectNodeSchema>(\n\tschema: TSchema,\n\tallowAdditionalProperties: boolean,\n\ttargetObject: object = {},\n): TreeNode {\n\t// To satisfy 'deepEquals' level scrutiny, the target of the proxy must be an object with the same\n\t// prototype as an object literal '{}'. This is because 'deepEquals' uses 'Object.getPrototypeOf'\n\t// as a way to quickly reject objects with different prototype chains.\n\t//\n\t// (Note that the prototype of an object literal appears as '[Object: null prototype] {}', not because\n\t// the prototype is null, but because the prototype object itself has a null prototype.)\n\n\t// TODO: Although the target is an object literal, it's still worthwhile to try experimenting with\n\t// a dispatch object to see if it improves performance.\n\tconst proxy = new Proxy(targetObject, {\n\t\tget(target, key): unknown {\n\t\t\tconst field = getFlexNode(proxy).tryGetField(key as FieldKey);\n\t\t\tif (field !== undefined) {\n\t\t\t\treturn getProxyForField(field);\n\t\t\t}\n\n\t\t\t// Pass the proxy as the receiver here, so that any methods on the prototype receive `proxy` as `this`.\n\t\t\treturn Reflect.get(target, key, proxy);\n\t\t},\n\t\tset(target, key, value: InsertableContent) {\n\t\t\tconst flexNode = getFlexNode(proxy);\n\t\t\tconst flexNodeSchema = flexNode.schema;\n\t\t\tassert(flexNodeSchema instanceof FlexObjectNodeSchema, 0x888 / invalid schema /);\n\t\t\tconst fieldSchema = flexNodeSchema.objectNodeFields.get(key as FieldKey);\n\n\t\t\tif (fieldSchema === undefined) {\n\t\t\t\treturn allowAdditionalProperties ? Reflect.set(target, key, value) : false;\n\t\t\t}\n\n\t\t\t// TODO: Is it safe to assume 'content' is a LazyObjectNode?\n\t\t\tassert(flexNode instanceof LazyObjectNode, 0x7e0 / invalid content /);\n\t\t\tassert(typeof key === \"string\", 0x7e1 / invalid key /);\n\t\t\tconst field = getBoxedField(flexNode, brand(key), fieldSchema);\n\n\t\t\tswitch (field.schema.kind) {\n\t\t\t\tcase FieldKinds.required:\n\t\t\t\tcase FieldKinds.optional: {\n\t\t\t\t\tconst typedField = field as\n\t\t\t\t\t\t\| FlexTreeRequiredField<FlexAllowedTypes>\n\t\t\t\t\t\t\| FlexTreeOptionalField<FlexAllowedTypes>;\n\n\t\t\t\t\tconst { content, hydrateProxies } = extractFactoryContent(value);\n\t\t\t\t\tconst cursor = cursorFromNodeData(\n\t\t\t\t\t\tcontent,\n\t\t\t\t\t\tflexNode.context.schema,\n\t\t\t\t\t\tfieldSchema.allowedTypeSet,\n\t\t\t\t\t);\n\t\t\t\t\tmodifyChildren(\n\t\t\t\t\t\tflexNode,\n\t\t\t\t\t\t() => {\n\t\t\t\t\t\t\ttypedField.content = cursor;\n\t\t\t\t\t\t},\n\t\t\t\t\t\t() => hydrateProxies(typedField.boxedContent),\n\t\t\t\t\t);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\tdefault:\n\t\t\t\t\tfail(\"invalid FieldKind\");\n\t\t\t}\n\n\t\t\treturn true;\n\t\t},\n\t\thas: (target, key) => {\n\t\t\treturn (\n\t\t\t\tschema.objectNodeFields.has(key as FieldKey) \|\|\n\t\t\t\t(allowAdditionalProperties ? Reflect.has(target, key) : false)\n\t\t\t);\n\t\t},\n\t\townKeys: (target) => {\n\t\t\treturn [\n\t\t\t\t...schema.objectNodeFields.keys(),\n\t\t\t\t...(allowAdditionalProperties ? Reflect.ownKeys(target) : []),\n\t\t\t];\n\t\t},\n\t\tgetOwnPropertyDescriptor: (target, key) => {\n\t\t\tconst field = getFlexNode(proxy).tryGetField(key as FieldKey);\n\n\t\t\tif (field === undefined) {\n\t\t\t\treturn allowAdditionalProperties\n\t\t\t\t\t? Reflect.getOwnPropertyDescriptor(target, key)\n\t\t\t\t\t: undefined;\n\t\t\t}\n\n\t\t\tconst p: PropertyDescriptor = {\n\t\t\t\tvalue: getProxyForField(field),\n\t\t\t\twritable: true,\n\t\t\t\tenumerable: true,\n\t\t\t\tconfigurable: true, // Must be 'configurable' if property is absent from proxy target.\n\t\t\t};\n\n\t\t\treturn p;\n\t\t},\n\t}) as TreeNode;\n\treturn proxy;\n}\n\n/\n Given a array node proxy, returns its underlying LazySequence field.\n /\nexport const getSequenceField = <TTypes extends FlexAllowedTypes>(arrayNode: TreeArrayNode) =>\n\tgetFlexNode(arrayNode).content as FlexTreeSequenceField<TTypes>;\n\n// Used by 'insert()' APIs to converts new content (expressed as a proxy union) to contextually\n// typed data prior to forwarding to 'LazySequence.insert()'.\nfunction contextualizeInsertedArrayContent(\n\tinsertedAtIndex: number,\n\tcontent: readonly (InsertableContent \| IterableTreeArrayContent<InsertableContent>)[],\n): ExtractedFactoryContent {\n\treturn extractFactoryContent(\n\t\tcontent.flatMap((c): InsertableContent[] =>\n\t\t\tc instanceof IterableTreeArrayContent ? Array.from(c) : [c],\n\t\t),\n\t\tinsertedAtIndex,\n\t);\n}\n\n// #region Create dispatch map for array nodes\n\n// TODO: Experiment with alternative dispatch methods to see if we can improve performance.\n\n/\n PropertyDescriptorMap used to build the prototype for our array node dispatch object.\n /\nexport const arrayNodePrototypeProperties: PropertyDescriptorMap = {\n\t// We manually add [Symbol.iterator] to the dispatch map rather than use '[fn.name] = fn' as\n\t// below when adding 'Array.prototype.' properties to this map because 'Array.prototype[Symbol.iterator].name'\n\t// returns \"values\" (i.e., Symbol.iterator is an alias for the '.values()' function.)\n\t[Symbol.iterator]: {\n\t\tvalue: Array.prototype[Symbol.iterator],\n\t},\n\tat: {\n\t\tvalue(this: TreeArrayNode, index: number): TreeNode \| TreeValue \| undefined {\n\t\t\tconst field = getSequenceField(this);\n\t\t\tconst val = field.boxedAt(index);\n\n\t\t\tif (val === undefined) {\n\t\t\t\treturn val;\n\t\t\t}\n\n\t\t\treturn getOrCreateNodeProxy(val);\n\t\t},\n\t},\n\tinsertAt: {\n\t\tvalue(\n\t\t\tthis: TreeArrayNode,\n\t\t\tindex: number,\n\t\t\t...value: readonly (InsertableContent \| IterableTreeArrayContent<InsertableContent>)[]\n\t\t): void {\n\t\t\tconst sequenceField = getSequenceField(this);\n\n\t\t\tconst { content, hydrateProxies } = contextualizeInsertedArrayContent(index, value);\n\t\t\tconst cursor = cursorFromFieldData(\n\t\t\t\tcontent,\n\t\t\t\tsequenceField.context.schema,\n\t\t\t\tsequenceField.schema,\n\t\t\t);\n\n\t\t\tmodifyChildren(\n\t\t\t\tgetFlexNode(this),\n\t\t\t\t() => sequenceField.insertAt(index, cursor),\n\t\t\t\t(listFlexNode) => hydrateProxies(listFlexNode),\n\t\t\t);\n\t\t},\n\t},\n\tinsertAtStart: {\n\t\tvalue(\n\t\t\tthis: TreeArrayNode,\n\t\t\t...value: readonly (InsertableContent \| IterableTreeArrayContent<InsertableContent>)[]\n\t\t): void {\n\t\t\tconst sequenceField = getSequenceField(this);\n\n\t\t\tconst { content, hydrateProxies } = contextualizeInsertedArrayContent(0, value);\n\t\t\tconst cursor = cursorFromFieldData(\n\t\t\t\tcontent,\n\t\t\t\tsequenceField.context.schema,\n\t\t\t\tsequenceField.schema,\n\t\t\t);\n\n\t\t\tmodifyChildren(\n\t\t\t\tgetFlexNode(this),\n\t\t\t\t() => sequenceField.insertAtStart(cursor),\n\t\t\t\t(listFlexNode) => hydrateProxies(listFlexNode),\n\t\t\t);\n\t\t},\n\t},\n\tinsertAtEnd: {\n\t\tvalue(\n\t\t\tthis: TreeArrayNode,\n\t\t\t...value: readonly (InsertableContent \| IterableTreeArrayContent<InsertableContent>)[]\n\t\t): void {\n\t\t\tconst sequenceField = getSequenceField(this);\n\n\t\t\tconst { content, hydrateProxies } = contextualizeInsertedArrayContent(\n\t\t\t\tthis.length,\n\t\t\t\tvalue,\n\t\t\t);\n\t\t\tconst cursor = cursorFromFieldData(\n\t\t\t\tcontent,\n\t\t\t\tsequenceField.context.schema,\n\t\t\t\tsequenceField.schema,\n\t\t\t);\n\n\t\t\tmodifyChildren(\n\t\t\t\tgetFlexNode(this),\n\t\t\t\t() => sequenceField.insertAtEnd(cursor),\n\t\t\t\t(listFlexNode) => hydrateProxies(listFlexNode),\n\t\t\t);\n\t\t},\n\t},\n\tremoveAt: {\n\t\tvalue(this: TreeArrayNode, index: number): void {\n\t\t\tgetSequenceField(this).removeAt(index);\n\t\t},\n\t},\n\tremoveRange: {\n\t\tvalue(this: TreeArrayNode, start?: number, end?: number): void {\n\t\t\tgetSequenceField(this).removeRange(start, end);\n\t\t},\n\t},\n\tmoveToStart: {\n\t\tvalue(this: TreeArrayNode, sourceIndex: number, source?: TreeArrayNode): void {\n\t\t\tif (source !== undefined) {\n\t\t\t\tgetSequenceField(this).moveToStart(sourceIndex, getSequenceField(source));\n\t\t\t} else {\n\t\t\t\tgetSequenceField(this).moveToStart(sourceIndex);\n\t\t\t}\n\t\t},\n\t},\n\tmoveToEnd: {\n\t\tvalue(this: TreeArrayNode, sourceIndex: number, source?: TreeArrayNode): void {\n\t\t\tif (source !== undefined) {\n\t\t\t\tgetSequenceField(this).moveToEnd(sourceIndex, getSequenceField(source));\n\t\t\t} else {\n\t\t\t\tgetSequenceField(this).moveToEnd(sourceIndex);\n\t\t\t}\n\t\t},\n\t},\n\tmoveToIndex: {\n\t\tvalue(\n\t\t\tthis: TreeArrayNode,\n\t\t\tindex: number,\n\t\t\tsourceIndex: number,\n\t\t\tsource?: TreeArrayNode,\n\t\t): void {\n\t\t\tif (source !== undefined) {\n\t\t\t\tgetSequenceField(this).moveToIndex(index, sourceIndex, getSequenceField(source));\n\t\t\t} else {\n\t\t\t\tgetSequenceField(this).moveToIndex(index, sourceIndex);\n\t\t\t}\n\t\t},\n\t},\n\tmoveRangeToStart: {\n\t\tvalue(\n\t\t\tthis: TreeArrayNode,\n\t\t\tsourceStart: number,\n\t\t\tsourceEnd: number,\n\t\t\tsource?: TreeArrayNode,\n\t\t): void {\n\t\t\tif (source !== undefined) {\n\t\t\t\tgetSequenceField(this).moveRangeToStart(\n\t\t\t\t\tsourceStart,\n\t\t\t\t\tsourceEnd,\n\t\t\t\t\tgetSequenceField(source),\n\t\t\t\t);\n\t\t\t} else {\n\t\t\t\tgetSequenceField(this).moveRangeToStart(sourceStart, sourceEnd);\n\t\t\t}\n\t\t},\n\t},\n\tmoveRangeToEnd: {\n\t\tvalue(\n\t\t\tthis: TreeArrayNode,\n\t\t\tsourceStart: number,\n\t\t\tsourceEnd: number,\n\t\t\tsource?: TreeArrayNode,\n\t\t): void {\n\t\t\tif (source !== undefined) {\n\t\t\t\tgetSequenceField(this).moveRangeToEnd(\n\t\t\t\t\tsourceStart,\n\t\t\t\t\tsourceEnd,\n\t\t\t\t\tgetSequenceField(source),\n\t\t\t\t);\n\t\t\t} else {\n\t\t\t\tgetSequenceField(this).moveRangeToEnd(sourceStart, sourceEnd);\n\t\t\t}\n\t\t},\n\t},\n\tmoveRangeToIndex: {\n\t\tvalue(\n\t\t\tthis: TreeArrayNode,\n\t\t\tindex: number,\n\t\t\tsourceStart: number,\n\t\t\tsourceEnd: number,\n\t\t\tsource?: TreeArrayNode,\n\t\t): void {\n\t\t\tif (source !== undefined) {\n\t\t\t\tgetSequenceField(this).moveRangeToIndex(\n\t\t\t\t\tindex,\n\t\t\t\t\tsourceStart,\n\t\t\t\t\tsourceEnd,\n\t\t\t\t\tgetSequenceField(source),\n\t\t\t\t);\n\t\t\t} else {\n\t\t\t\tgetSequenceField(this).moveRangeToIndex(index, sourceStart, sourceEnd);\n\t\t\t}\n\t\t},\n\t},\n};\n\n/* eslint-disable @typescript-eslint/unbound-method /\n\n// For compatibility, we are initially implement 'readonly T[]' by applying the Array.prototype methods\n// to the array node proxy. Over time, we should replace these with efficient implementations on LazySequence\n// to avoid re-entering the proxy as these methods access 'length' and the indexed properties.\n//\n// For brevity, the current implementation dynamically builds a property descriptor map from a list of\n// Array functions we want to re-expose via the proxy.\n\n// TODO: This assumes 'Function.name' matches the property name on 'Array.prototype', which may be\n// dubious across JS engines.\n[\n\tArray.prototype.concat,\n\t// Array.prototype.copyWithin,\n\tArray.prototype.entries,\n\tArray.prototype.every,\n\t// Array.prototype.fill,\n\tArray.prototype.filter,\n\tArray.prototype.find,\n\tArray.prototype.findIndex,\n\tArray.prototype.flat,\n\tArray.prototype.flatMap,\n\tArray.prototype.forEach,\n\tArray.prototype.includes,\n\tArray.prototype.indexOf,\n\tArray.prototype.join,\n\tArray.prototype.keys,\n\tArray.prototype.lastIndexOf,\n\t// Array.prototype.length,\n\tArray.prototype.map,\n\t// Array.prototype.pop,\n\t// Array.prototype.push,\n\tArray.prototype.reduce,\n\tArray.prototype.reduceRight,\n\t// Array.prototype.reverse,\n\t// Array.prototype.shift,\n\tArray.prototype.slice,\n\tArray.prototype.some,\n\t// Array.prototype.sort,\n\t// Array.prototype.splice,\n\tArray.prototype.toLocaleString,\n\tArray.prototype.toString,\n\t// Array.prototype.unshift,\n\tArray.prototype.values,\n].forEach((fn) => {\n\tarrayNodePrototypeProperties[fn.name] = { value: fn };\n});\n\n/ eslint-enable @typescript-eslint/unbound-method /\n\nconst arrayNodePrototype = Object.create(Object.prototype, arrayNodePrototypeProperties);\n\n// #endregion\n\n/\n Helper to coerce property keys to integer indexes (or undefined if not an in-range integer).\n /\nfunction asIndex(key: string \| symbol, length: number) {\n\tif (typeof key === \"string\") {\n\t\t// TODO: It may be worth a '0' <= ch <= '9' check before calling 'Number' to quickly\n\t\t// reject 'length' as an index, or even parsing integers ourselves.\n\t\tconst asNumber = Number(key);\n\n\t\t// TODO: See 'matrix/range.ts' for fast integer coercing + range check.\n\t\tif (Number.isInteger(asNumber)) {\n\t\t\treturn 0 <= asNumber && asNumber < length ? asNumber : undefined;\n\t\t}\n\t}\n}\n\n/\n @param allowAdditionalProperties - If true, setting of unexpected properties will be forwarded to the target object.\n * Otherwise setting of unexpected properties will error.\n * @param customTargetObject - Target object of the proxy.\n * If not provided `[]` is used for the target and a separate object created to dispatch array methods.\n * If provided, the customTargetObject will be used as both the dispatch object and the proxy target, and therefor must provide `length` and the array functionality from {@link arrayNodePrototype}.\n /\nfunction createArrayNodeProxy(\n\tallowAdditionalProperties: boolean,\n\tcustomTargetObject?: object,\n): TreeArrayNode {\n\tconst targetObject = customTargetObject ?? [];\n\n\t// Create a 'dispatch' object that this Proxy forwards to instead of the proxy target, because we need\n\t// the proxy target to be a plain JS array (see comments below when we instantiate the Proxy).\n\t// Own properties on the dispatch object are surfaced as own properties of the proxy.\n\t// (e.g., 'length', which is defined below).\n\t//\n\t// Properties normally inherited from 'Array.prototype' are surfaced via the prototype chain.\n\tconst dispatch: object =\n\t\tcustomTargetObject ??\n\t\tObject.create(arrayNodePrototype, {\n\t\t\tlength: {\n\t\t\t\tget(this: TreeArrayNode) {\n\t\t\t\t\treturn getSequenceField(this).length;\n\t\t\t\t},\n\t\t\t\tset() {},\n\t\t\t\tenumerable: false,\n\t\t\t\tconfigurable: false,\n\t\t\t},\n\t\t});\n\n\t// To satisfy 'deepEquals' level scrutiny, the target of the proxy must be an array literal in order\n\t// to pass 'Object.getPrototypeOf'. It also satisfies 'Array.isArray' and 'Object.prototype.toString'\n\t// requirements without use of Array[Symbol.species], which is potentially on a path ot deprecation.\n\tconst proxy: TreeArrayNode = new Proxy<TreeArrayNode>(targetObject as any, {\n\t\tget: (target, key) => {\n\t\t\tconst field = getSequenceField(proxy);\n\t\t\tconst maybeIndex = asIndex(key, field.length);\n\n\t\t\tif (maybeIndex === undefined) {\n\t\t\t\t// Pass the proxy as the receiver here, so that any methods on\n\t\t\t\t// the prototype receive `proxy` as `this`.\n\t\t\t\treturn Reflect.get(dispatch, key, proxy) as unknown;\n\t\t\t}\n\n\t\t\tconst value = field.boxedAt(maybeIndex);\n\n\t\t\tif (value === undefined) {\n\t\t\t\treturn undefined;\n\t\t\t}\n\n\t\t\t// TODO: Ideally, we would return leaves without first boxing them. However, this is not\n\t\t\t// as simple as calling '.content' since this skips the node and returns the FieldNode's\n\t\t\t// inner field.\n\t\t\treturn getOrCreateNodeProxy(value);\n\t\t},\n\t\tset: (target, key, newValue, receiver) => {\n\t\t\t// 'Symbol.isConcatSpreadable' may be set on an Array instance to modify the behavior of\n\t\t\t// the concat method. We allow this property to be added to the dispatch object.\n\t\t\tif (key === Symbol.isConcatSpreadable) {\n\t\t\t\treturn Reflect.set(dispatch, key, newValue, proxy);\n\t\t\t}\n\n\t\t\tconst field = getSequenceField(proxy);\n\t\t\tconst maybeIndex = asIndex(key, field.length);\n\t\t\tif (maybeIndex !== undefined) {\n\t\t\t\t// For MVP, we otherwise disallow setting properties (mutation is only available via the array node mutation APIs).\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\treturn allowAdditionalProperties ? Reflect.set(target, key, newValue) : false;\n\t\t},\n\t\thas: (target, key) => {\n\t\t\tconst field = getSequenceField(proxy);\n\t\t\tconst maybeIndex = asIndex(key, field.length);\n\t\t\treturn maybeIndex !== undefined \|\| Reflect.has(dispatch, key);\n\t\t},\n\t\townKeys: (target) => {\n\t\t\tconst field = getSequenceField(proxy);\n\n\t\t\t// TODO: Would a lazy iterator to produce the indexes work / be more efficient?\n\t\t\t// TODO: Need to surface 'Symbol.isConcatSpreadable' as an own key.\n\t\t\treturn Array.from({ length: field.length }, (_, index) => `${index}`).concat(\"length\");\n\t\t},\n\t\tgetOwnPropertyDescriptor: (target, key) => {\n\t\t\tconst field = getSequenceField(proxy);\n\t\t\tconst maybeIndex = asIndex(key, field.length);\n\t\t\tif (maybeIndex !== undefined) {\n\t\t\t\tconst val = field.boxedAt(maybeIndex);\n\t\t\t\t// To satisfy 'deepEquals' level scrutiny, the property descriptor for indexed properties must\n\t\t\t\t// be a simple value property (as opposed to using getter) and declared writable/enumerable/configurable.\n\t\t\t\treturn {\n\t\t\t\t\t// TODO: Ideally, we would return leaves without first boxing them. However, this is not\n\t\t\t\t\t// as simple as calling '.at' since this skips the node and returns the FieldNode's\n\t\t\t\t\t// inner field.\n\t\t\t\t\tvalue: val === undefined ? val : getOrCreateNodeProxy(val),\n\t\t\t\t\twritable: true, // For MVP, disallow setting indexed properties.\n\t\t\t\t\tenumerable: true,\n\t\t\t\t\tconfigurable: true,\n\t\t\t\t};\n\t\t\t} else if (key === \"length\") {\n\t\t\t\t// To satisfy 'deepEquals' level scrutiny, the property descriptor for 'length' must be a simple\n\t\t\t\t// value property (as opposed to using getter) and be declared writable / non-configurable.\n\t\t\t\treturn {\n\t\t\t\t\tvalue: getSequenceField(proxy).length,\n\t\t\t\t\twritable: true,\n\t\t\t\t\tenumerable: false,\n\t\t\t\t\tconfigurable: false,\n\t\t\t\t};\n\t\t\t}\n\t\t\treturn Reflect.getOwnPropertyDescriptor(dispatch, key);\n\t\t},\n\t});\n\treturn proxy;\n}\n\n// #region Create dispatch map for maps\n\nexport const mapStaticDispatchMap: PropertyDescriptorMap = {\n\t[Symbol.iterator]: {\n\t\tvalue(this: TreeMapNode) {\n\t\t\treturn this.entries();\n\t\t},\n\t},\n\tdelete: {\n\t\tvalue(this: TreeMapNode, key: string): void {\n\t\t\tconst node = getFlexNode(this);\n\t\t\tnode.delete(key);\n\t\t},\n\t},\n\tentries: {\n\t\tvalue(this: TreeMapNode): IterableIterator<[string, unknown]> {\n\t\t\tconst node = getFlexNode(this);\n\t\t\tfor (const key of node.keys()) {\n\t\t\t\tyield [key, getProxyForField(node.getBoxed(key))];\n\t\t\t}\n\t\t},\n\t},\n\tget: {\n\t\tvalue(this: TreeMapNode, key: string): unknown {\n\t\t\tconst node = getFlexNode(this);\n\t\t\tconst field = node.getBoxed(key);\n\t\t\treturn getProxyForField(field);\n\t\t},\n\t},\n\thas: {\n\t\tvalue(this: TreeMapNode, key: string): boolean {\n\t\t\tconst node = getFlexNode(this);\n\t\t\treturn node.has(key);\n\t\t},\n\t},\n\tkeys: {\n\t\tvalue(this: TreeMapNode): IterableIterator<string> {\n\t\t\tconst node = getFlexNode(this);\n\t\t\treturn node.keys();\n\t\t},\n\t},\n\tset: {\n\t\tvalue(\n\t\t\tthis: TreeMapNode,\n\t\t\tkey: string,\n\t\t\tvalue: InsertableTypedNode<TreeNodeSchemaClass>,\n\t\t): TreeMapNode {\n\t\t\tconst node = getFlexNode(this);\n\n\t\t\tconst { content, hydrateProxies } = extractFactoryContent(value as FactoryContent);\n\t\t\tconst cursor = cursorFromNodeData(\n\t\t\t\tcontent,\n\t\t\t\tnode.context.schema,\n\t\t\t\tnode.schema.mapFields.allowedTypeSet,\n\t\t\t);\n\t\t\tmodifyChildren(\n\t\t\t\tnode,\n\t\t\t\t(mapNode) => mapNode.set(key, cursor),\n\t\t\t\t(mapNode) => hydrateProxies(getMapChildNode(mapNode, key)),\n\t\t\t);\n\t\t\treturn this;\n\t\t},\n\t},\n\tsize: {\n\t\tget(this: TreeMapNode) {\n\t\t\treturn getFlexNode(this).size;\n\t\t},\n\t},\n\tvalues: {\n\t\tvalue(this: TreeMapNode): IterableIterator<unknown> {\n\t\t\tfor (const [, value] of this.entries()) {\n\t\t\t\tyield value;\n\t\t\t}\n\t\t},\n\t},\n\t// TODO: add `clear` once we have established merge semantics for it.\n};\n\nconst mapPrototype = Object.create(Object.prototype, mapStaticDispatchMap);\n\n// #endregion\n\n/\n @param allowAdditionalProperties - If true, setting of unexpected properties will be forwarded to the target object.\n * Otherwise setting of unexpected properties will error.\n * @param customTargetObject - Target object of the proxy.\n * If not provided `new Map()` is used for the target and a separate object created to dispatch map methods.\n * If provided, the customTargetObject will be used as both the dispatch object and the proxy target, and therefor must provide the map functionality from {@link mapPrototype}.\n /\nfunction createMapProxy(\n\tallowAdditionalProperties: boolean,\n\tcustomTargetObject?: object,\n): TreeMapNode {\n\t// Create a 'dispatch' object that this Proxy forwards to instead of the proxy target.\n\tconst dispatch: object =\n\t\tcustomTargetObject ??\n\t\tObject.create(mapPrototype, {\n\t\t\t// Empty - JavaScript Maps do not expose any \"own\" properties.\n\t\t});\n\tconst targetObject: object = customTargetObject ?? new Map<string, TreeNode>();\n\n\t// TODO: Although the target is an object literal, it's still worthwhile to try experimenting with\n\t// a dispatch object to see if it improves performance.\n\tconst proxy = new Proxy<TreeMapNode>(targetObject as TreeMapNode, {\n\t\tget: (target, key, receiver): unknown => {\n\t\t\t// Pass the proxy as the receiver here, so that any methods on the prototype receive `proxy` as `this`.\n\t\t\treturn Reflect.get(dispatch, key, proxy);\n\t\t},\n\t\tgetOwnPropertyDescriptor: (target, key): PropertyDescriptor \| undefined => {\n\t\t\treturn Reflect.getOwnPropertyDescriptor(dispatch, key);\n\t\t},\n\t\thas: (target, key) => {\n\t\t\treturn Reflect.has(dispatch, key);\n\t\t},\n\t\tset: (target, key, newValue): boolean => {\n\t\t\treturn allowAdditionalProperties ? Reflect.set(dispatch, key, newValue) : false;\n\t\t},\n\t\townKeys: (target) => {\n\t\t\t// All of Map's properties are inherited via its prototype, so there is nothing to return here,\n\t\t\treturn [];\n\t\t},\n\t});\n\treturn proxy;\n}\n\n/\n Create a proxy to a {@link TreeObjectNode} that is backed by a raw object node (see {@link createRawNode}).\n * @param schema - the schema of the object node\n * @param content - the content to be stored in the raw node.\n * A copy of content is stored, the input `content` is not modified and can be safely reused in another call to {@link createRawObjectProxy}.\n * @param allowAdditionalProperties - If true, setting of unexpected properties will be forwarded to the target object.\n * Otherwise setting of unexpected properties will error.\n * @param customTargetObject - Target object of the proxy.\n * If not provided `{}` is used for the target.\n * @remarks\n * Because this proxy is backed by a raw node, it has the same limitations as the node created by {@link createRawNode}.\n * Most of its properties and methods will error if read/called.\n /\nexport function createRawNodeProxy(\n\tschema: FlexTreeNodeSchema,\n\tcontent: InsertableTypedNode<TreeNodeSchemaClass> & object,\n\tallowAdditionalProperties: boolean,\n\ttarget?: object,\n): Unhydrated<TreeNode> {\n\t// Shallow copy the content and then add the type name symbol to it.\n\tlet flexNode: RawTreeNode<FlexTreeNodeSchema, InsertableTypedNode<TreeNodeSchemaClass>>;\n\tlet proxy: TreeNode;\n\tif (schema instanceof FlexObjectNodeSchema) {\n\t\tconst contentCopy = copyContent(schema.name, content);\n\t\tflexNode = createRawNode(schema, contentCopy);\n\t\tproxy = createObjectProxy(schema, allowAdditionalProperties, target);\n\t} else if (schema instanceof FlexFieldNodeSchema) {\n\t\t// simple-tree uses field nodes exclusively to represent array nodes\n\t\tconst contentCopy = copyContent(schema.name, content);\n\t\tflexNode = createRawNode(schema, contentCopy);\n\t\tproxy = createArrayNodeProxy(allowAdditionalProperties, target);\n\t} else if (schema instanceof FlexMapNodeSchema) {\n\t\tconst contentCopy = copyContent(schema.name, content);\n\t\tflexNode = createRawNode(schema, contentCopy);\n\t\tproxy = createMapProxy(allowAdditionalProperties, target);\n\t} else {\n\t\tfail(\"Unrecognized content schema\");\n\t}\n\n\treturn setFlexNode(proxy, flexNode);\n}\n\nfunction copyContent<T extends object>(typeName: TreeNodeSchemaIdentifier, content: T): T {\n\tconst copy =\n\t\tcontent instanceof Map\n\t\t\t? (new Map(content) as T)\n\t\t\t: Array.isArray(content)\n\t\t\t? (content.slice() as T)\n\t\t\t: { ...content };\n\n\treturn Object.defineProperty(copy, typeNameSymbol, { value: typeName });\n}\n\ntype ProxyHydrator = (flexNode: FlexTreeNode \| undefined) => void;\nconst noopHydrator: ProxyHydrator = () => {};\n\n/* The result returned by {@link extractFactoryContent} and its related helpers. /\ninterface ExtractedFactoryContent<out T = FactoryContent> {\n\t/* The content with the factory subtrees replaced. /\n\treadonly content: T;\n\t/\n\t A function which walks all factory-created object that underwent replacement/extraction.\n\t * Before hydration, those objects are unusable (see {@link createRawObjectProxy}).\n\t * However, after the content is fully inserted into the tree the `hydrateProxies` function may be invoked in order to update the contents of these objects such that they become a mirror of the content in the tree.\n\t * This must be done before any calls to {@link getOrCreateNodeProxy} so that the \"edit node to proxy\" mapping is correctly updated (see {@link setFlexNode}).\n\t /\n\treadonly hydrateProxies: ProxyHydrator;\n}\n\n/\n Given a content tree that is to be inserted into the shared tree, replace all subtrees that were created by factories\n * (via {@link SharedTreeObjectFactory.create}) with the content that was passed to those factories.\n * @param content - the content being inserted which may be, and/or may contain, factory-created content\n * @param insertedAtIndex - if the content being inserted is array node content, this must be the index in the array node at which the content is being inserted\n * @returns the result of the content replacement and a {@link ExtractedFactoryContent.hydrateProxies} function which must be invoked if present.\n * @remarks\n * This functions works recursively.\n * Factory-created objects that are nested inside of the content passed to other factory-created objects, and so on, will be in-lined.\n * This function also adds the hidden {@link typeNameSymbol} of each object schema to the output.\n * @example\n * ```ts\n * const x = foo.create({\n * a: 3, b: bar.create({\n * c: [baz.create({ d: 5 })]\n * })\n * });\n * const y = extractFactoryContent(x);\n * y === {\n * [typeNameSymbol]: \"foo\", a: 3, b: {\n * [typeNameSymbol]: \"bar\", c: [{ [typeNameSymbol]: \"baz\", d: 5 }]\n * }\n * }\n * ```\n /\nexport function extractFactoryContent(\n\tinput: InsertableContent,\n\tinsertedAtIndex = 0,\n): ExtractedFactoryContent {\n\tlet content: FactoryContent;\n\tlet fromFactory = false;\n\tconst rawFlexNode = tryGetFlexNode(input);\n\tif (rawFlexNode !== undefined) {\n\t\tconst factoryContent = extractRawNodeContent(rawFlexNode);\n\t\tif (factoryContent === undefined) {\n\t\t\t// We were passed a proxy, but that proxy doesn't have any raw content.\n\t\t\tthrow new Error(\"Cannot insert a node that is already in the tree\");\n\t\t}\n\t\tcontent = factoryContent;\n\t\tfromFactory = true;\n\t} else {\n\t\tcontent = input as FactoryContent;\n\t}\n\n\tassert(!isTreeNode(content), 0x844 / Unhydrated insertion content should have FlexNode /);\n\n\tlet type: NodeKind;\n\tlet extractedContent: ExtractedFactoryContent;\n\tif (isReadonlyArray(content)) {\n\t\ttype = NodeKind.Array;\n\t\textractedContent = extractContentArray(\n\t\t\tcontent as readonly FactoryContent[],\n\t\t\tinsertedAtIndex,\n\t\t);\n\t} else if (content instanceof Map) {\n\t\ttype = NodeKind.Map;\n\t\textractedContent = extractContentMap(content as ReadonlyMap<string, FactoryContent>);\n\t} else if (typeof content === \"object\" && content !== null && !isFluidHandle(content)) {\n\t\ttype = NodeKind.Object;\n\t\textractedContent = extractContentObject(content as object);\n\t} else {\n\t\textractedContent = { content, hydrateProxies: noopHydrator };\n\t\ttype = NodeKind.Leaf;\n\t}\n\n\tif (isTreeNode(input)) {\n\t\tconst kindFromSchema = getNodeKind(input);\n\t\tassert(kindFromSchema === type, 0x845 / kind of data should match kind of schema /);\n\t}\n\n\tif (fromFactory) {\n\t\treturn {\n\t\t\tcontent: extractedContent.content,\n\t\t\thydrateProxies: (flexNode) => {\n\t\t\t\t// This makes the input proxy usable and updates the proxy cache\n\t\t\t\tsetFlexNode(input as TreeNode, flexNode ?? fail(\"Expected edit node\"));\n\t\t\t\textractedContent.hydrateProxies(flexNode);\n\t\t\t},\n\t\t};\n\t}\n\n\treturn extractedContent;\n}\n\n/\n @param insertedAtIndex - Supply this if the extracted array content will be inserted into an existing array node in the tree.\n /\nfunction extractContentArray(\n\tinput: readonly FactoryContent[],\n\tinsertedAtIndex: number,\n): ExtractedFactoryContent {\n\tconst output: FactoryContent[] = [];\n\tif (typeNameSymbol in input) {\n\t\tObject.defineProperty(output, typeNameSymbol, { value: input[typeNameSymbol] });\n\t}\n\tconst hydrators: [index: number, hydrate: ProxyHydrator][] = [];\n\tfor (let i = 0; i < input.length; i++) {\n\t\tconst { content: childContent, hydrateProxies } = extractFactoryContent(input[i]);\n\t\toutput.push(childContent);\n\t\t// The conditional here is an optimization so that primitive items don't incur boxed reads for hydration\n\t\tif (hydrateProxies !== noopHydrator) {\n\t\t\thydrators.push([i, hydrateProxies]);\n\t\t}\n\t}\n\treturn {\n\t\tcontent: output,\n\t\thydrateProxies: (flexNode: FlexTreeNode \| undefined) => {\n\t\t\tassert(\n\t\t\t\tflexNode !== undefined,\n\t\t\t\t0x7f6 / Expected edit node to be defined when hydrating array node /,\n\t\t\t);\n\t\t\tassert(\n\t\t\t\tschemaIsFieldNode(flexNode.schema),\n\t\t\t\t0x7f7 / Expected field node when hydrating array node /,\n\t\t\t);\n\t\t\thydrators.forEach(([i, hydrate]) =>\n\t\t\t\thydrate(\n\t\t\t\t\tgetArrayNodeChildNode(\n\t\t\t\t\t\tflexNode as FlexTreeFieldNode<FlexFieldNodeSchema>,\n\t\t\t\t\t\tinsertedAtIndex + i,\n\t\t\t\t\t),\n\t\t\t\t),\n\t\t\t);\n\t\t},\n\t};\n}\n\nfunction extractContentMap(input: ReadonlyMap<string, FactoryContent>): ExtractedFactoryContent {\n\tconst output = new Map();\n\tif (typeNameSymbol in input) {\n\t\tObject.defineProperty(output, typeNameSymbol, { value: input[typeNameSymbol] });\n\t}\n\tconst hydrators: [key: string, hydrate: ProxyHydrator][] = [];\n\tfor (const [key, value] of input) {\n\t\tconst { content: childContent, hydrateProxies } = extractFactoryContent(value);\n\t\toutput.set(key, childContent);\n\t\t// The conditional here is an optimization so that primitive values don't incur boxed reads for hydration\n\t\tif (hydrateProxies !== noopHydrator) {\n\t\t\thydrators.push([key, hydrateProxies]);\n\t\t}\n\t}\n\treturn {\n\t\tcontent: output,\n\t\thydrateProxies: (flexNode: FlexTreeNode \| undefined) => {\n\t\t\tassert(\n\t\t\t\tflexNode !== undefined,\n\t\t\t\t0x7f8 / Expected edit node to be defined when hydrating map /,\n\t\t\t);\n\t\t\tassert(schemaIsMap(flexNode.schema), 0x7f9 / Expected map node when hydrating map /);\n\t\t\thydrators.forEach(([key, hydrate]) =>\n\t\t\t\thydrate(getMapChildNode(flexNode as FlexTreeMapNode<FlexMapNodeSchema>, key)),\n\t\t\t);\n\t\t},\n\t};\n}\n\nfunction extractContentObject(input: {\n\treadonly [P in string]?: FactoryContent;\n}): ExtractedFactoryContent {\n\tconst output: Record<string, FactoryContent> = {};\n\tif (typeNameSymbol in input) {\n\t\tObject.defineProperty(output, typeNameSymbol, { value: input[typeNameSymbol] });\n\t}\n\tconst hydrators: [key: string, hydrate: ProxyHydrator][] = [];\n\tfor (const [key, value] of Object.entries(input)) {\n\t\t// Treat undefined fields and missing fields the same.\n\t\t// Generally tree does not require explicit undefined values at runtime despite some of the schema aware type checking currently requiring it.\n\t\tif (value !== undefined) {\n\t\t\tconst { content: childContent, hydrateProxies } = extractFactoryContent(value);\n\t\t\toutput[key] = childContent;\n\t\t\thydrators.push([key, hydrateProxies]);\n\t\t}\n\t}\n\n\treturn {\n\t\tcontent: output,\n\t\thydrateProxies: (flexNode: FlexTreeNode \| undefined) => {\n\t\t\tassert(\n\t\t\t\tflexNode !== undefined,\n\t\t\t\t0x7fa / Expected edit node to be defined when hydrating object /,\n\t\t\t);\n\t\t\tassert(\n\t\t\t\tschemaIsObjectNode(flexNode.schema),\n\t\t\t\t0x7fb / Expected object node when hydrating object content /,\n\t\t\t);\n\t\t\thydrators.forEach(([key, hydrate]) =>\n\t\t\t\thydrate(getObjectChildNode(flexNode as FlexTreeObjectNode, key)),\n\t\t\t);\n\t\t},\n\t};\n}\n\n/\n Content which can be used to build a node.\n * @remarks\n * Can contain unhydrated nodes, but can not be an unhydrated node at the root.\n /\nexport type FactoryContent =\n\t\| IFluidHandle\n\t\| string\n\t\| number\n\t\| boolean\n\t// eslint-disable-next-line @rushstack/no-new-null\n\t\| null\n\t\| ReadonlyMap<string, InsertableContent>\n\t\| readonly InsertableContent[]\n\t\| {\n\t\t\treadonly [P in string]?: InsertableContent;\n\t };\n\n/\n Content which can be inserted into a tree.\n /\nexport type InsertableContent = Unhydrated<TreeNode> \| FactoryContent;\n\nfunction getArrayNodeChildNode(\n\tarrayNode: FlexTreeFieldNode<FlexFieldNodeSchema>,\n\tindex: number,\n): FlexTreeNode \| undefined {\n\tconst field = arrayNode.tryGetField(EmptyKey);\n\tassert(\n\t\tfield?.schema.kind === FieldKinds.sequence,\n\t\t0x7fc / Expected sequence field when hydrating array node /,\n\t);\n\treturn (field as FlexTreeSequenceField<FlexAllowedTypes>).boxedAt(index);\n}\n\nfunction getMapChildNode(\n\tmapNode: FlexTreeMapNode<FlexMapNodeSchema>,\n\tkey: string,\n): FlexTreeNode \| undefined {\n\tconst field = mapNode.getBoxed(key);\n\tassert(\n\t\tfield.schema.kind === FieldKinds.optional,\n\t\t0x7fd / Sequence field kind is unsupported as map values /,\n\t);\n\treturn (field as FlexTreeOptionalField<FlexAllowedTypes>).boxedContent;\n}\n\nfunction getObjectChildNode(objectNode: FlexTreeObjectNode, key: string): FlexTreeNode \| undefined {\n\tconst field =\n\t\tobjectNode.tryGetField(brand(key)) ?? fail(\"Expected a field for inserted content\");\n\tassert(\n\t\tfield.schema.kind === FieldKinds.required \|\| field.schema.kind === FieldKinds.optional,\n\t\t0x7fe / Expected required or optional field kind /,\n\t);\n\treturn (\n\t\tfield as FlexTreeRequiredField<FlexAllowedTypes> \| FlexTreeOptionalField<FlexAllowedTypes>\n\t).boxedContent;\n}\n\n/\n Run the given function `modify`.\n * If the function results in any changes to the direct children of `parent`, `after` will be run immediately thereafter.\n */\nfunction modifyChildren<T extends FlexTreeNode>(\n\tparent: T,\n\tmodify: (parent: T) => void,\n\tafter?: (parent: T) => void,\n): void {\n\tconst offNextChange = parent[onNextChange](() => after?.(parent));\n\tmodify(parent);\n\t// `onNextChange` unsubscribes itself after firing once. However, there is no guarantee that it will fire.\n\t// For example, the `modify` function may result in a no-op that doesn't trigger an edit (e.g. inserting `[]` into an array node).\n\t// In those cases, we must unsubscribe manually here. If `modify` was not a no-op, it does no harm to call this function anyway.\n\toffNextChange();\n}\n\n// TODO: Replace this with calls to `Tree.schema(node).kind` when dependency cycles are no longer a problem.\nfunction getNodeKind(node: TreeNode): NodeKind {\n\treturn (\n\t\tgetClassSchema(getFlexNode(node).schema)?.kind ??\n\t\tfail(\"NodeBase should always have class schema\")\n\t);\n}\n"]}
1	+ {"version":3,"file":"proxies.js","sourceRoot":"","sources":["../../src/simple-tree/proxies.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAGH,OAAO,EAAE,MAAM,EAAE,MAAM,qCAAqC,CAAC;AAE7D,OAAO,EACN,QAAQ,GAKR,MAAM,kBAAkB,CAAC;AAE1B,OAAO,EACN,UAAU,EAKV,aAAa,EACb,cAAc,GACd,MAAM,+BAA+B,CAAC;AACvC,OAAO,EAAW,KAAK,EAAE,IAAI,EAAE,eAAe,EAAE,MAAM,kBAAkB,CAAC;AAEzE,OAAO,EAAE,WAAW,EAAE,cAAc,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAC7E,OAAO,EAAE,qBAAqB,EAAE,MAAM,cAAc,CAAC;AACrD,OAAO,EAAE,sBAAsB,EAAE,MAAM,oBAAoB,CAAC;AAC5D,OAAO,EAAE,QAAQ,EAAE,MAAM,kBAAkB,CAAC;AAG5C;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,UAAU,CAAC,SAAkB;IAC5C,OAAO,cAAc,CAAC,SAAS,CAAC,KAAK,SAAS,CAAC;AAChD,CAAC;AAED;;KAEK;AACL,MAAM,UAAU,gBAAgB,CAAC,KAAoB;IACpD,QAAQ,KAAK,CAAC,MAAM,CAAC,IAAI,EAAE;QAC1B,KAAK,UAAU,CAAC,QAAQ,CAAC,CAAC;YACzB,MAAM,OAAO,GAAG,KAEf,CAAC;YAEF,yFAAyF;YACzF,8FAA8F;YAC9F,qBAAqB;YACrB,OAAO,oBAAoB,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC;SAClD;QACD,KAAK,UAAU,CAAC,QAAQ,CAAC,CAAC;YACzB,MAAM,OAAO,GAAG,KAEf,CAAC;YAEF,yFAAyF;YACzF,8FAA8F;YAC9F,qBAAqB;YAErB,MAAM,YAAY,GAAG,OAAO,CAAC,YAAY,CAAC;YAE1C,6FAA6F;YAC7F,kFAAkF;YAClF,OAAO,YAAY,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,oBAAoB,CAAC,YAAY,CAAC,CAAC;SACnF;QACD,+CAA+C;QAC/C,KAAK,UAAU,CAAC,QAAQ,CAAC,CAAC;YACzB,8FAA8F;YAC9F,oEAAoE;YACpE,IAAI,CAAC,iCAAiC,CAAC,CAAC;SACxC;QACD,KAAK,UAAU,CAAC,UAAU,CAAC,CAAC;YAC3B,MAAM,UAAU,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YACpC,MAAM,CAAC,UAAU,KAAK,SAAS,EAAE,KAAK,CAAC,2BAA2B,CAAC,CAAC;YACpE,OAAO,oBAAoB,CAAC,UAAU,CAAC,CAAC;SACxC;QAED;YACC,IAAI,CAAC,oBAAoB,CAAC,CAAC;KAC5B;AACF,CAAC;AAED,MAAM,UAAU,oBAAoB,CAAC,QAAsB;IAC1D,MAAM,WAAW,GAAG,WAAW,CAAC,QAAQ,CAAC,CAAC;IAC1C,IAAI,WAAW,KAAK,SAAS,EAAE;QAC9B,OAAO,WAAW,CAAC;KACnB;IAED,MAAM,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC;IAC/B,MAAM,WAAW,GAAG,sBAAsB,CAAC,MAAM,CAAC,CAAC;IACnD,MAAM,CAAC,WAAW,KAAK,SAAS,EAAE,KAAK,CAAC,yBAAyB,CAAC,CAAC;IACnE,IAAI,OAAO,WAAW,KAAK,UAAU,EAAE;QACtC,MAAM,YAAY,GAAG,WAA+D,CAAC;QACrF,OAAO,IAAI,YAAY,CAAC,QAAQ,CAAC,CAAC;KAClC;SAAM;QACN,OAAQ,WAAwD,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;KAClF;AACF,CAAC;AAgBD;;;;;;;;;GASG;AACH,MAAM,UAAU,uBAAuB,CACtC,OAA0B,EAC1B,MAA2B;IAE3B,IAAI,eAAe,CAAC,OAAO,CAAC,EAAE;QAC7B,OAAO,4BAA4B,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;KACrD;IAED,MAAM,OAAO,GAAqB;QACjC,QAAQ,EAAE,EAAE,MAAM,EAAE,SAAS,EAAE,WAAW,EAAE,QAAQ,EAAE,WAAW,EAAE,CAAC,EAAE;QACtE,UAAU,EAAE,EAAE;KACd,CAAC;IACF,MAAM,gBAAgB,GAAG,qBAAqB,CAAC,OAAO,EAAE;QACvD,IAAI,EAAE,OAAO,CAAC,QAAQ;QACtB,YAAY,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE;YAC1B,OAAO,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;QAC7C,CAAC;KACD,CAAC,CAAC;IAEH,WAAW,CAAC,CAAC,OAAO,CAAC,EAAE,MAAM,CAAC,CAAC;IAC/B,OAAO,gBAAgB,CAAC;AACzB,CAAC;AAED,SAAS,4BAA4B,CACpC,OAAqC,EACrC,MAA2B;IAE3B,MAAM,OAAO,GAAuB,EAAE,CAAC;IACvC,MAAM,gBAAgB,GAAqB,EAAE,CAAC;IAC9C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QACxC,OAAO,CAAC,IAAI,CAAC;YACZ,QAAQ,EAAE;gBACT,MAAM,EAAE,SAAS;gBACjB,WAAW,EAAE,QAAQ;gBACrB,WAAW,EAAE,CAAC;aACd;YACD,UAAU,EAAE,EAAE;SACd,CAAC,CAAC;QACH,gBAAgB,CAAC,IAAI,CACpB,qBAAqB,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;YACjC,IAAI,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,QAAQ;YACzB,YAAY,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE;gBAC1B,OAAO,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;YAChD,CAAC;SACD,CAAC,CACF,CAAC;KACF;IAED,WAAW,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;IAC7B,OAAO,gBAAgB,CAAC;AACzB,CAAC;AAED,SAAS,WAAW,CAAC,OAA2B,EAAE,MAA2B;IAC5E,sIAAsI;IACtI,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE;QACvB,8GAA8G;QAC9G,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,MAAM,GAAG,GAAG,MAAM,CAAC,EAAE,CAAC,uBAAuB,EAAE,CAAC,QAAQ,EAAE,EAAE;YAC1D,OAAO,CAAC,CAAC,CAAC,CAAC,QAA4B,CAAC,WAAW,GAAG,QAAQ,CAAC;YAChE,KAAK,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,OAAO,CAAC,CAAC,CAAC,CAAC,UAAU,EAAE;gBACpD,WAAW,CAAC,MAAM,CAAC,OAAO,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;aACzC;YACD,IAAI,EAAE,CAAC,KAAK,OAAO,CAAC,MAAM,EAAE;gBAC3B,GAAG,EAAE,CAAC;aACN;QACF,CAAC,CAAC,CAAC;KACH;AACF,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AACH,MAAM,UAAU,qBAAqB,CACpC,KAAwB,EACxB,YAGC;IAED,IAAI,OAAuB,CAAC;IAC5B,MAAM,WAAW,GAAG,cAAc,CAAC,KAAK,CAAC,CAAC;IAC1C,IAAI,WAAW,KAAK,SAAS,EAAE;QAC9B,MAAM,cAAc,GAAG,qBAAqB,CAAC,WAAW,CAAC,CAAC;QAC1D,IAAI,cAAc,KAAK,SAAS,EAAE;YACjC,uEAAuE;YACvE,MAAM,IAAI,KAAK,CAAC,kDAAkD,CAAC,CAAC;SACpE;QACD,YAAY,EAAE,YAAY,CAAC,YAAY,CAAC,IAAI,EAAE,KAAiB,CAAC,CAAC;QACjE,OAAO,GAAG,cAAc,CAAC;KACzB;SAAM;QACN,OAAO,GAAG,KAAuB,CAAC;KAClC;IAED,MAAM,CAAC,CAAC,UAAU,CAAC,OAAO,CAAC,EAAE,KAAK,CAAC,uDAAuD,CAAC,CAAC;IAE5F,IAAI,IAAc,CAAC;IACnB,IAAI,gBAAgC,CAAC;IACrC,IAAI,eAAe,CAAC,OAAO,CAAC,EAAE;QAC7B,IAAI,GAAG,QAAQ,CAAC,KAAK,CAAC;QACtB,gBAAgB,GAAG,mBAAmB,CAAC,OAAoC,EAAE,YAAY,CAAC,CAAC;KAC3F;SAAM,IAAI,OAAO,YAAY,GAAG,EAAE;QAClC,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC;QACpB,gBAAgB,GAAG,iBAAiB,CACnC,OAA8C,EAC9C,YAAY,CACZ,CAAC;KACF;SAAM,IAAI,OAAO,OAAO,KAAK,QAAQ,IAAI,OAAO,KAAK,IAAI,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,EAAE;QACtF,IAAI,GAAG,QAAQ,CAAC,MAAM,CAAC;QACvB,gBAAgB,GAAG,oBAAoB,CAAC,OAAiB,EAAE,YAAY,CAAC,CAAC;KACzE;SAAM;QACN,gBAAgB,GAAG,OAAO,CAAC;QAC3B,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC;KACrB;IAED,IAAI,WAAW,KAAK,SAAS,EAAE;QAC9B,MAAM,cAAc,GACnB,sBAAsB,CAAC,WAAW,CAAC,MAAM,CAAC,EAAE,IAAI;YAChD,IAAI,CAAC,0CAA0C,CAAC,CAAC;QAElD,MAAM,CAAC,cAAc,KAAK,IAAI,EAAE,KAAK,CAAC,8CAA8C,CAAC,CAAC;KACtF;IAED,OAAO,gBAAgB,CAAC;AACzB,CAAC;AAED,SAAS,mBAAmB,CAC3B,KAAgC,EAChC,YAKY;IAEZ,MAAM,MAAM,GAAqB,EAAE,CAAC;IACpC,IAAI,cAAc,IAAI,KAAK,EAAE;QAC5B,MAAM,CAAC,cAAc,CAAC,MAAM,EAAE,cAAc,EAAE,EAAE,KAAK,EAAE,KAAK,CAAC,cAAc,CAAC,EAAE,CAAC,CAAC;KAChF;IACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QACtC,MAAM,YAAY,GAAG,qBAAqB,CACzC,KAAK,CAAC,CAAC,CAAC,EACR,YAAY,KAAK,SAAS;YACzB,CAAC,CAAC;gBACA,IAAI,EAAE;oBACL,MAAM,EAAE,YAAY,CAAC,IAAI;oBACzB,WAAW,EAAE,QAAQ;oBACrB,WAAW,EAAE,CAAC;iBACd;gBACD,YAAY,EAAE,YAAY,EAAE,YAAY;aACvC;YACH,CAAC,CAAC,SAAS,CACZ,CAAC;QACF,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;KAC1B;IACD,OAAO,MAAM,CAAC;AACf,CAAC;AAED,SAAS,iBAAiB,CACzB,KAA0C,EAC1C,YAKY;IAEZ,MAAM,MAAM,GAAG,IAAI,GAAG,EAAE,CAAC;IACzB,IAAI,cAAc,IAAI,KAAK,EAAE;QAC5B,MAAM,CAAC,cAAc,CAAC,MAAM,EAAE,cAAc,EAAE,EAAE,KAAK,EAAE,KAAK,CAAC,cAAc,CAAC,EAAE,CAAC,CAAC;KAChF;IACD,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,KAAK,EAAE;QACjC,MAAM,YAAY,GAAG,qBAAqB,CACzC,KAAK,EACL,YAAY,KAAK,SAAS;YACzB,CAAC,CAAC;gBACA,IAAI,EAAE;oBACL,MAAM,EAAE,YAAY,CAAC,IAAI;oBACzB,WAAW,EAAE,KAAK,CAAC,GAAG,CAAC;oBACvB,WAAW,EAAE,CAAC;iBACd;gBACD,YAAY,EAAE,YAAY,EAAE,YAAY;aACvC;YACH,CAAC,CAAC,SAAS,CACZ,CAAC;QACF,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,YAAY,CAAC,CAAC;KAC9B;IACD,OAAO,MAAM,CAAC;AACf,CAAC;AAED,SAAS,oBAAoB,CAC5B,KAEC,EACD,YAKY;IAEZ,MAAM,MAAM,GAAmC,EAAE,CAAC;IAClD,IAAI,cAAc,IAAI,KAAK,EAAE;QAC5B,MAAM,CAAC,cAAc,CAAC,MAAM,EAAE,cAAc,EAAE,EAAE,KAAK,EAAE,KAAK,CAAC,cAAc,CAAC,EAAE,CAAC,CAAC;KAChF;IACD,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE;QACjD,sDAAsD;QACtD,8IAA8I;QAC9I,IAAI,KAAK,KAAK,SAAS,EAAE;YACxB,MAAM,YAAY,GAAG,qBAAqB,CACzC,KAAK,EACL,YAAY,KAAK,SAAS;gBACzB,CAAC,CAAC;oBACA,IAAI,EAAE;wBACL,MAAM,EAAE,YAAY,CAAC,IAAI;wBACzB,WAAW,EAAE,KAAK,CAAC,GAAG,CAAC;wBACvB,WAAW,EAAE,CAAC;qBACd;oBACD,YAAY,EAAE,YAAY,EAAE,YAAY;iBACvC;gBACH,CAAC,CAAC,SAAS,CACZ,CAAC;YACF,MAAM,CAAC,GAAG,CAAC,GAAG,YAAY,CAAC;SAC3B;KACD;IACD,OAAO,MAAM,CAAC;AACf,CAAC;AA2BD;;GAEG;AACH,MAAM,UAAU,eAAe,CAAC,QAAkC,EAAE,IAAY;IAC/E,MAAM,CAAC,cAAc,CAAC,IAAI,EAAE,cAAc,EAAE,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,CAAC;AAClE,CAAC","sourcesContent":["/!\n Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n /\n\nimport { IFluidHandle } from \"@fluidframework/core-interfaces\";\nimport { assert } from \"@fluidframework/core-utils/internal\";\n\nimport {\n\tEmptyKey,\n\tIForestSubscription,\n\tTreeNodeSchemaIdentifier,\n\tTreeValue,\n\tUpPath,\n} from \"../core/index.js\";\n\nimport {\n\tFieldKinds,\n\tFlexFieldSchema,\n\tFlexTreeField,\n\tFlexTreeNode,\n\tFlexTreeTypedField,\n\tisFluidHandle,\n\ttypeNameSymbol,\n} from \"../feature-libraries/index.js\";\nimport { Mutable, brand, fail, isReadonlyArray } from \"../util/index.js\";\n\nimport { anchorProxy, tryGetFlexNode, tryGetProxy } from \"./proxyBinding.js\";\nimport { extractRawNodeContent } from \"./rawNode.js\";\nimport { tryGetSimpleNodeSchema } from \"./schemaCaching.js\";\nimport { NodeKind } from \"./schemaTypes.js\";\nimport { TreeNode, Unhydrated } from \"./types.js\";\n\n/\n Detects if the given 'candidate' is a TreeNode.\n \n @remarks\n * Supports both Hydrated and {@link Unhydrated} TreeNodes, both of which return true.\n \n Because the common usage is to check if a value being inserted/set is a TreeNode,\n * this function permits calling with primitives as well as objects.\n \n Primitives will always return false (as they are copies of data, not references to nodes).\n \n @param candidate - Value which may be a TreeNode\n * @returns true if the given 'candidate' is a hydrated TreeNode.\n /\nexport function isTreeNode(candidate: unknown): candidate is TreeNode \| Unhydrated<TreeNode> {\n\treturn tryGetFlexNode(candidate) !== undefined;\n}\n\n/\n Retrieve the associated proxy for the given field.\n * /\nexport function getProxyForField(field: FlexTreeField): TreeNode \| TreeValue \| undefined {\n\tswitch (field.schema.kind) {\n\t\tcase FieldKinds.required: {\n\t\t\tconst asValue = field as FlexTreeTypedField<\n\t\t\t\tFlexFieldSchema<typeof FieldKinds.required>\n\t\t\t>;\n\n\t\t\t// TODO: Ideally, we would return leaves without first boxing them. However, this is not\n\t\t\t// as simple as calling '.content' since this skips the node and returns the FieldNode's\n\t\t\t// inner field.\n\t\t\treturn getOrCreateNodeProxy(asValue.boxedContent);\n\t\t}\n\t\tcase FieldKinds.optional: {\n\t\t\tconst asValue = field as FlexTreeTypedField<\n\t\t\t\tFlexFieldSchema<typeof FieldKinds.optional>\n\t\t\t>;\n\n\t\t\t// TODO: Ideally, we would return leaves without first boxing them. However, this is not\n\t\t\t// as simple as calling '.content' since this skips the node and returns the FieldNode's\n\t\t\t// inner field.\n\n\t\t\tconst maybeContent = asValue.boxedContent;\n\n\t\t\t// Normally, empty fields are unreachable due to the behavior of 'tryGetField'. However, the\n\t\t\t// root field is a special case where the field is always present (even if empty).\n\t\t\treturn maybeContent === undefined ? undefined : getOrCreateNodeProxy(maybeContent);\n\t\t}\n\t\t// TODO: Remove if/when 'FieldNode' is removed.\n\t\tcase FieldKinds.sequence: {\n\t\t\t// 'getProxyForNode' handles FieldNodes by unconditionally creating a array node proxy, making\n\t\t\t// this case unreachable as long as users follow the 'array recipe'.\n\t\t\tfail(\"'sequence' field is unexpected.\");\n\t\t}\n\t\tcase FieldKinds.identifier: {\n\t\t\tconst identifier = field.boxedAt(0);\n\t\t\tassert(identifier !== undefined, 0x91a / identifier must exist /);\n\t\t\treturn getOrCreateNodeProxy(identifier);\n\t\t}\n\n\t\tdefault:\n\t\t\tfail(\"invalid field kind\");\n\t}\n}\n\nexport function getOrCreateNodeProxy(flexNode: FlexTreeNode): TreeNode \| TreeValue {\n\tconst cachedProxy = tryGetProxy(flexNode);\n\tif (cachedProxy !== undefined) {\n\t\treturn cachedProxy;\n\t}\n\n\tconst schema = flexNode.schema;\n\tconst classSchema = tryGetSimpleNodeSchema(schema);\n\tassert(classSchema !== undefined, 0x91b / node without schema /);\n\tif (typeof classSchema === \"function\") {\n\t\tconst simpleSchema = classSchema as unknown as new (dummy: FlexTreeNode) => TreeNode;\n\t\treturn new simpleSchema(flexNode);\n\t} else {\n\t\treturn (classSchema as { create(data: FlexTreeNode): TreeNode }).create(flexNode);\n\t}\n}\n\n// #region Content insertion and proxy binding\n\n/* The path of a proxy, relative to the root of the content tree that the proxy belongs to /\ninterface RelativeProxyPath {\n\treadonly path: UpPath;\n\treadonly proxy: TreeNode;\n}\n\n/* All {@link RelativeProxyPath}s that are under the given root path /\ninterface RootedProxyPaths {\n\treadonly rootPath: UpPath;\n\treadonly proxyPaths: RelativeProxyPath[];\n}\n\n/\n Records any proxies in the given content tree and does the necessary bookkeeping to ensure they are synchronized with subsequent reads of the tree.\n * @remarks If the content tree contains any proxies, this function must be called just prior to inserting the content into the tree.\n * Specifically, no other content may be inserted into the tree between the invocation of this function and the insertion of `content`.\n * The insertion of `content` must occur or else this function will cause memory leaks.\n * @param content - the tree of content to be inserted, of which any of its object/map/array nodes might be a proxy\n * @param anchors - the {@link AnchorSet} for the tree\n * @returns The content after having all proxies replaced inline with plain javascript objects.\n * See {@link extractFactoryContent} for more details.\n /\nexport function prepareContentForInsert(\n\tcontent: InsertableContent,\n\tforest: IForestSubscription,\n): FactoryContent {\n\tif (isReadonlyArray(content)) {\n\t\treturn prepareArrayContentForInsert(content, forest);\n\t}\n\n\tconst proxies: RootedProxyPaths = {\n\t\trootPath: { parent: undefined, parentField: EmptyKey, parentIndex: 0 },\n\t\tproxyPaths: [],\n\t};\n\tconst extractedContent = extractFactoryContent(content, {\n\t\tpath: proxies.rootPath,\n\t\tonVisitProxy: (p, proxy) => {\n\t\t\tproxies.proxyPaths.push({ path: p, proxy });\n\t\t},\n\t});\n\n\tbindProxies([proxies], forest);\n\treturn extractedContent;\n}\n\nfunction prepareArrayContentForInsert(\n\tcontent: readonly InsertableContent[],\n\tforest: IForestSubscription,\n): FactoryContent {\n\tconst proxies: RootedProxyPaths[] = [];\n\tconst extractedContent: FactoryContent[] = [];\n\tfor (let i = 0; i < content.length; i++) {\n\t\tproxies.push({\n\t\t\trootPath: {\n\t\t\t\tparent: undefined,\n\t\t\t\tparentField: EmptyKey,\n\t\t\t\tparentIndex: 0,\n\t\t\t},\n\t\t\tproxyPaths: [],\n\t\t});\n\t\textractedContent.push(\n\t\t\textractFactoryContent(content[i], {\n\t\t\t\tpath: proxies[i].rootPath,\n\t\t\t\tonVisitProxy: (p, proxy) => {\n\t\t\t\t\tproxies[i].proxyPaths.push({ path: p, proxy });\n\t\t\t\t},\n\t\t\t}),\n\t\t);\n\t}\n\n\tbindProxies(proxies, forest);\n\treturn extractedContent;\n}\n\nfunction bindProxies(proxies: RootedProxyPaths[], forest: IForestSubscription): void {\n\t// Only subscribe to the event if there is at least one proxy tree to hydrate - this is not the case when inserting an empty array [].\n\tif (proxies.length > 0) {\n\t\t// Creating a new array emits one event per element in the array, so listen to the event once for each element\n\t\tlet i = 0;\n\t\tconst off = forest.on(\"afterRootFieldCreated\", (fieldKey) => {\n\t\t\t(proxies[i].rootPath as Mutable<UpPath>).parentField = fieldKey;\n\t\t\tfor (const { path, proxy } of proxies[i].proxyPaths) {\n\t\t\t\tanchorProxy(forest.anchors, path, proxy);\n\t\t\t}\n\t\t\tif (++i === proxies.length) {\n\t\t\t\toff();\n\t\t\t}\n\t\t});\n\t}\n}\n\n/\n Given a content tree that is to be inserted into the shared tree, replace all subtrees that were created by factories\n * (via {@link SharedTreeObjectFactory.create}) with the content that was passed to those factories.\n * @param content - the content being inserted which may be, and/or may contain, factory-created content\n * @param onVisitProxy - an optional callback that will run for each proxy (i.e. object created by a factory) found in the inserted content\n * @param insertedAtIndex - if the content being inserted is array node content, this must be the index in the array node at which the content is being inserted\n * @returns the result of the content replacement and a {@link ExtractedFactoryContent.hydrateProxies} function which must be invoked if present.\n * @remarks\n * This functions works recursively.\n * Factory-created objects that are nested inside of the content passed to other factory-created objects, and so on, will be in-lined.\n * This function also adds the hidden {@link typeNameSymbol} of each object schema to the output.\n * @example\n * ```ts\n * const x = foo.create({\n * a: 3, b: bar.create({\n * c: [baz.create({ d: 5 })]\n * })\n * });\n * const y = extractFactoryContent(x);\n * y === {\n * [typeNameSymbol]: \"foo\", a: 3, b: {\n * [typeNameSymbol]: \"bar\", c: [{ [typeNameSymbol]: \"baz\", d: 5 }]\n * }\n * }\n * ```\n /\nexport function extractFactoryContent(\n\tinput: InsertableContent,\n\tvisitProxies?: {\n\t\tpath: UpPath;\n\t\tonVisitProxy: (path: UpPath, proxy: TreeNode) => void;\n\t},\n): FactoryContent {\n\tlet content: FactoryContent;\n\tconst rawFlexNode = tryGetFlexNode(input);\n\tif (rawFlexNode !== undefined) {\n\t\tconst factoryContent = extractRawNodeContent(rawFlexNode);\n\t\tif (factoryContent === undefined) {\n\t\t\t// We were passed a proxy, but that proxy doesn't have any raw content.\n\t\t\tthrow new Error(\"Cannot insert a node that is already in the tree\");\n\t\t}\n\t\tvisitProxies?.onVisitProxy(visitProxies.path, input as TreeNode);\n\t\tcontent = factoryContent;\n\t} else {\n\t\tcontent = input as FactoryContent;\n\t}\n\n\tassert(!isTreeNode(content), 0x844 / Unhydrated insertion content should have FlexNode /);\n\n\tlet type: NodeKind;\n\tlet extractedContent: FactoryContent;\n\tif (isReadonlyArray(content)) {\n\t\ttype = NodeKind.Array;\n\t\textractedContent = extractContentArray(content as readonly FactoryContent[], visitProxies);\n\t} else if (content instanceof Map) {\n\t\ttype = NodeKind.Map;\n\t\textractedContent = extractContentMap(\n\t\t\tcontent as ReadonlyMap<string, FactoryContent>,\n\t\t\tvisitProxies,\n\t\t);\n\t} else if (typeof content === \"object\" && content !== null && !isFluidHandle(content)) {\n\t\ttype = NodeKind.Object;\n\t\textractedContent = extractContentObject(content as object, visitProxies);\n\t} else {\n\t\textractedContent = content;\n\t\ttype = NodeKind.Leaf;\n\t}\n\n\tif (rawFlexNode !== undefined) {\n\t\tconst kindFromSchema =\n\t\t\ttryGetSimpleNodeSchema(rawFlexNode.schema)?.kind ??\n\t\t\tfail(\"NodeBase should always have class schema\");\n\n\t\tassert(kindFromSchema === type, 0x845 / kind of data should match kind of schema /);\n\t}\n\n\treturn extractedContent;\n}\n\nfunction extractContentArray(\n\tinput: readonly FactoryContent[],\n\tvisitProxies:\n\t\t\| {\n\t\t\t\tpath: UpPath;\n\t\t\t\tonVisitProxy: (path: UpPath, proxy: TreeNode) => void;\n\t\t }\n\t\t\| undefined,\n): FactoryContent {\n\tconst output: FactoryContent[] = [];\n\tif (typeNameSymbol in input) {\n\t\tObject.defineProperty(output, typeNameSymbol, { value: input[typeNameSymbol] });\n\t}\n\tfor (let i = 0; i < input.length; i++) {\n\t\tconst childContent = extractFactoryContent(\n\t\t\tinput[i],\n\t\t\tvisitProxies !== undefined\n\t\t\t\t? {\n\t\t\t\t\t\tpath: {\n\t\t\t\t\t\t\tparent: visitProxies.path,\n\t\t\t\t\t\t\tparentField: EmptyKey,\n\t\t\t\t\t\t\tparentIndex: i,\n\t\t\t\t\t\t},\n\t\t\t\t\t\tonVisitProxy: visitProxies?.onVisitProxy,\n\t\t\t\t }\n\t\t\t\t: undefined,\n\t\t);\n\t\toutput.push(childContent);\n\t}\n\treturn output;\n}\n\nfunction extractContentMap(\n\tinput: ReadonlyMap<string, FactoryContent>,\n\tvisitProxies:\n\t\t\| {\n\t\t\t\tpath: UpPath;\n\t\t\t\tonVisitProxy: (path: UpPath, proxy: TreeNode) => void;\n\t\t }\n\t\t\| undefined,\n): FactoryContent {\n\tconst output = new Map();\n\tif (typeNameSymbol in input) {\n\t\tObject.defineProperty(output, typeNameSymbol, { value: input[typeNameSymbol] });\n\t}\n\tfor (const [key, value] of input) {\n\t\tconst childContent = extractFactoryContent(\n\t\t\tvalue,\n\t\t\tvisitProxies !== undefined\n\t\t\t\t? {\n\t\t\t\t\t\tpath: {\n\t\t\t\t\t\t\tparent: visitProxies.path,\n\t\t\t\t\t\t\tparentField: brand(key),\n\t\t\t\t\t\t\tparentIndex: 0,\n\t\t\t\t\t\t},\n\t\t\t\t\t\tonVisitProxy: visitProxies?.onVisitProxy,\n\t\t\t\t }\n\t\t\t\t: undefined,\n\t\t);\n\t\toutput.set(key, childContent);\n\t}\n\treturn output;\n}\n\nfunction extractContentObject(\n\tinput: {\n\t\treadonly [P in string]?: FactoryContent;\n\t},\n\tvisitProxies:\n\t\t\| {\n\t\t\t\tpath: UpPath;\n\t\t\t\tonVisitProxy: (path: UpPath, proxy: TreeNode) => void;\n\t\t }\n\t\t\| undefined,\n): FactoryContent {\n\tconst output: Record<string, FactoryContent> = {};\n\tif (typeNameSymbol in input) {\n\t\tObject.defineProperty(output, typeNameSymbol, { value: input[typeNameSymbol] });\n\t}\n\tfor (const [key, value] of Object.entries(input)) {\n\t\t// Treat undefined fields and missing fields the same.\n\t\t// Generally tree does not require explicit undefined values at runtime despite some of the schema aware type checking currently requiring it.\n\t\tif (value !== undefined) {\n\t\t\tconst childContent = extractFactoryContent(\n\t\t\t\tvalue,\n\t\t\t\tvisitProxies !== undefined\n\t\t\t\t\t? {\n\t\t\t\t\t\t\tpath: {\n\t\t\t\t\t\t\t\tparent: visitProxies.path,\n\t\t\t\t\t\t\t\tparentField: brand(key),\n\t\t\t\t\t\t\t\tparentIndex: 0,\n\t\t\t\t\t\t\t},\n\t\t\t\t\t\t\tonVisitProxy: visitProxies?.onVisitProxy,\n\t\t\t\t\t }\n\t\t\t\t\t: undefined,\n\t\t\t);\n\t\t\toutput[key] = childContent;\n\t\t}\n\t}\n\treturn output;\n}\n\n// #endregion Content insertion and proxy binding\n\n/\n Content which can be used to build a node.\n * @remarks\n * Can contain unhydrated nodes, but can not be an unhydrated node at the root.\n /\nexport type FactoryContent =\n\t\| IFluidHandle\n\t\| string\n\t\| number\n\t\| boolean\n\t// eslint-disable-next-line @rushstack/no-new-null\n\t\| null\n\t\| ReadonlyMap<string, InsertableContent>\n\t\| readonly InsertableContent[]\n\t\| {\n\t\t\treadonly [P in string]?: InsertableContent;\n\t };\n\n/\n Content which can be inserted into a tree.\n /\nexport type InsertableContent = Unhydrated<TreeNode> \| FactoryContent;\n\n/\n Brand `copy` with the type (under {@link typeNameSymbol}) to avoid ambiguity when inferring types from this data.\n */\nexport function markContentType(typeName: TreeNodeSchemaIdentifier, copy: object): void {\n\tObject.defineProperty(copy, typeNameSymbol, { value: typeName });\n}\n"]}

package/lib/simple-tree/proxyBinding.d.ts ADDED Viewed

@@ -0,0 +1,48 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { AnchorSet, UpPath } from "../core/index.js";
+import { FlexTreeNodeSchema, FlexMapNodeSchema, FlexObjectNodeSchema, FlexTreeMapNode, FlexTreeNode, FlexTreeObjectNode } from "../feature-libraries/index.js";
+import { WithType } from "./schemaTypes.js";
+import { TreeArrayNode } from "./arrayNode.js";
+import { TreeNode } from "./types.js";
+import { TreeMapNode } from "./mapNode.js";
+/**
+ * Creates an anchor node and associates it with the given proxy.
+ * @privateRemarks Use `forgetters` to cleanup the anchor allocated by this function once the anchor is no longer needed.
+ * In practice, this happens when either the anchor node is destroyed, or another anchor to the same node is created by a new flex node.
+ */
+export declare function anchorProxy(anchors: AnchorSet, path: UpPath, proxy: TreeNode): void;
+/**
+ * Retrieves the flex node associated with the given target via {@link setFlexNode}.
+ * @remarks Fails if the flex node has not been set.
+ */
+export declare function getFlexNode(proxy: TypedNode<FlexObjectNodeSchema>, allowFreed?: true): FlexTreeObjectNode;
+export declare function getFlexNode(proxy: TreeArrayNode, allowFreed?: true): FlexTreeNode;
+export declare function getFlexNode(proxy: TreeMapNode, allowFreed?: true): FlexTreeMapNode<FlexMapNodeSchema>;
+export declare function getFlexNode(proxy: TreeNode, allowFreed?: true): FlexTreeNode;
+/**
+ * Retrieves the flex node associated with the given target via {@link setFlexNode}, if any.
+ */
+export declare function tryGetFlexNode(target: unknown): FlexTreeNode | undefined;
+/**
+ * Retrieves the proxy associated with the given flex node via {@link setFlexNode}, if any.
+ */
+export declare function tryGetProxy(flexNode: FlexTreeNode): TreeNode | undefined;
+/**
+ * Associate the given proxy and the given flex node.
+ * @returns The proxy
+ * @remarks
+ * This creates a 1:1 mapping between the proxy and tree node.
+ * Either can be retrieved from the other via {@link getFlexNode}/{@link tryGetFlexNode} or {@link tryGetProxy}.
+ * If the given proxy is already mapped to an flex node, the existing mapping will be overwritten.
+ * If the given flex node is already mapped to a different proxy, this function will fail.
+ */
+export declare function setFlexNode<TProxy extends TreeNode>(proxy: TProxy, flexNode: FlexTreeNode): TProxy;
+/**
+ * Given a node's schema, return the corresponding object in the proxy-based API.
+ */
+type TypedNode<TSchema extends FlexTreeNodeSchema> = TreeNode & WithType<TSchema["name"]>;
+export {};
+//# sourceMappingURL=proxyBinding.d.ts.map

package/lib/simple-tree/proxyBinding.d.ts.map ADDED Viewed

@@ -0,0 +1 @@

+ {"version":3,"file":"proxyBinding.d.ts","sourceRoot":"","sources":["../../src/simple-tree/proxyBinding.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAIH,OAAO,EAAc,SAAS,EAAE,MAAM,EAAc,MAAM,kBAAkB,CAAC;AAC7E,OAAO,EAEN,kBAAkB,EAClB,iBAAiB,EACjB,oBAAoB,EACpB,eAAe,EACf,YAAY,EACZ,kBAAkB,EAGlB,MAAM,+BAA+B,CAAC;AAGvC,OAAO,EAAE,QAAQ,EAAE,MAAM,kBAAkB,CAAC;AAC5C,OAAO,EAAE,aAAa,EAAE,MAAM,gBAAgB,CAAC;AAC/C,OAAO,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AAItC,OAAO,EAAE,WAAW,EAAE,MAAM,cAAc,CAAC;AA0B3C;;;;GAIG;AACH,wBAAgB,WAAW,CAAC,OAAO,EAAE,SAAS,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,QAAQ,GAAG,IAAI,CAcnF;AAED;;;GAGG;AACH,wBAAgB,WAAW,CAC1B,KAAK,EAAE,SAAS,CAAC,oBAAoB,CAAC,EACtC,UAAU,CAAC,EAAE,IAAI,GACf,kBAAkB,CAAC;AACtB,wBAAgB,WAAW,CAAC,KAAK,EAAE,aAAa,EAAE,UAAU,CAAC,EAAE,IAAI,GAAG,YAAY,CAAC;AACnF,wBAAgB,WAAW,CAC1B,KAAK,EAAE,WAAW,EAClB,UAAU,CAAC,EAAE,IAAI,GACf,eAAe,CAAC,iBAAiB,CAAC,CAAC;AACtC,wBAAgB,WAAW,CAAC,KAAK,EAAE,QAAQ,EAAE,UAAU,CAAC,EAAE,IAAI,GAAG,YAAY,CAAC;AAyB9E;;GAEG;AACH,wBAAgB,cAAc,CAAC,MAAM,EAAE,OAAO,GAAG,YAAY,GAAG,SAAS,CAOxE;AAED;;GAEG;AACH,wBAAgB,WAAW,CAAC,QAAQ,EAAE,YAAY,GAAG,QAAQ,GAAG,SAAS,CAExE;AAED;;;;;;;;GAQG;AACH,wBAAgB,WAAW,CAAC,MAAM,SAAS,QAAQ,EAClD,KAAK,EAAE,MAAM,EACb,QAAQ,EAAE,YAAY,GACpB,MAAM,CAgBR;AAmBD;;GAEG;AACH,KAAK,SAAS,CAAC,OAAO,SAAS,kBAAkB,IAAI,QAAQ,GAAG,QAAQ,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC"}

package/lib/simple-tree/proxyBinding.js ADDED Viewed

@@ -0,0 +1,124 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { assert } from "@fluidframework/core-utils/internal";
+import { anchorSlot } from "../core/index.js";
+import { ContextSlot, assertFlexTreeEntityNotFreed, flexTreeSlot, } from "../feature-libraries/index.js";
+import { fail } from "../util/index.js";
+import { RawTreeNode } from "./rawNode.js";
+// TODO: decide how to deal with dependencies on flex-tree implementation.
+// eslint-disable-next-line import/no-internal-modules
+import { makeTree } from "../feature-libraries/flex-tree/lazyNode.js";
+// This file contains various maps and helpers for supporting proxy binding (a.k.a. proxy hydration).
+// See ./ProxyBinding.md for a high-level overview of the process.
+/**
+ * An anchor slot which associates an anchor with its corresponding node proxy, if there is one.
+ */
+const proxySlot = anchorSlot();
+// The following records are maintained as WeakMaps, rather than a private symbol (e.g. like `targetSymbol`) on the node proxy itself.
+// The map behaves essentially the same, except that performing a lookup in the map will not perform a property read/get on the key object (as is the case with a symbol).
+// Since `SharedTreeNodes` are proxies with non-trivial `get` traps, this choice is meant to prevent the confusion of the lookup passing through multiple objects
+// via the trap, or the trap not properly handling the special symbol, etc.
+/** A reverse mapping of {@link proxySlot} that is updated at the same time. */
+const proxyToAnchorNode = new WeakMap();
+/**
+ * Maps proxies to their "raw" tree nodes.
+ * The raw node exists when the proxy is first created but before it has been associated with a real {@link FlexTreeNode}.
+ * For example, after a user calls `const proxy = new Foo({})` but before `proxy` is inserted into the tree and queried.
+ */
+const proxyToRawFlexNode = new WeakMap();
+/** Used by `anchorProxy` as an optimization to ensure that only one anchor is remembered at a time for a given anchor node */
+const anchorForgetters = new WeakMap();
+/**
+ * Creates an anchor node and associates it with the given proxy.
+ * @privateRemarks Use `forgetters` to cleanup the anchor allocated by this function once the anchor is no longer needed.
+ * In practice, this happens when either the anchor node is destroyed, or another anchor to the same node is created by a new flex node.
+ */
+export function anchorProxy(anchors, path, proxy) {
+    assert(!anchorForgetters.has(proxy), 0x91c /* Proxy anchor should not be set twice */);
+    const anchor = anchors.track(path);
+    const anchorNode = anchors.locate(anchor) ?? fail("Expected anchor node to be present");
+    bindProxyToAnchorNode(proxy, anchorNode);
+    const forget = () => {
+        if (anchors.locate(anchor)) {
+            anchors.forget(anchor);
+        }
+        anchorForgetters.delete(proxy);
+        off();
+    };
+    anchorForgetters.set(proxy, forget);
+    const off = anchorNode.on("afterDestroy", forget);
+}
+export function getFlexNode(proxy, allowFreed = false) {
+    const anchorNode = proxyToAnchorNode.get(proxy);
+    if (anchorNode !== undefined) {
+        // The proxy is bound to an anchor node, but it may or may not have an actual flex node yet
+        const flexNode = anchorNode.slots.get(flexTreeSlot);
+        if (flexNode !== undefined) {
+            return flexNode; // If it does have a flex node, return it...
+        } // ...otherwise, the flex node must be created
+        const context = anchorNode.anchorSet.slots.get(ContextSlot) ?? fail("missing context");
+        const cursor = context.forest.allocateCursor();
+        context.forest.moveCursorToPath(anchorNode, cursor);
+        const newFlexNode = makeTree(context, cursor);
+        cursor.free();
+        // Calling this is a performance improvement, however, do this only after demand to avoid momentarily having no anchors to anchorNode
+        anchorForgetters?.get(proxy)?.();
+        if (!allowFreed) {
+            assertFlexTreeEntityNotFreed(newFlexNode);
+        }
+        return newFlexNode;
+    }
+    return proxyToRawFlexNode.get(proxy) ?? fail("Expected raw tree node for proxy");
+}
+/**
+ * Retrieves the flex node associated with the given target via {@link setFlexNode}, if any.
+ */
+export function tryGetFlexNode(target) {
+    // Calling 'WeakMap.get()' with primitives (numbers, strings, etc.) will return undefined.
+    // This is in contrast to 'WeakMap.set()', which will throw a TypeError if given a non-object key.
+    return (proxyToAnchorNode.get(target)?.slots.get(flexTreeSlot) ??
+        proxyToRawFlexNode.get(target));
+}
+/**
+ * Retrieves the proxy associated with the given flex node via {@link setFlexNode}, if any.
+ */
+export function tryGetProxy(flexNode) {
+    return flexNode.anchorNode.slots.get(proxySlot);
+}
+/**
+ * Associate the given proxy and the given flex node.
+ * @returns The proxy
+ * @remarks
+ * This creates a 1:1 mapping between the proxy and tree node.
+ * Either can be retrieved from the other via {@link getFlexNode}/{@link tryGetFlexNode} or {@link tryGetProxy}.
+ * If the given proxy is already mapped to an flex node, the existing mapping will be overwritten.
+ * If the given flex node is already mapped to a different proxy, this function will fail.
+ */
+export function setFlexNode(proxy, flexNode) {
+    const existingFlexNode = proxyToAnchorNode.get(proxy)?.slots.get(flexTreeSlot);
+    assert(existingFlexNode === undefined, 0x91d /* Cannot associate a flex node with multiple targets */);
+    if (flexNode instanceof RawTreeNode) {
+        proxyToRawFlexNode.set(proxy, flexNode);
+    }
+    else {
+        assert(tryGetProxy(flexNode) === undefined, 0x7f5 /* Cannot associate an flex node with multiple targets */);
+        bindProxyToAnchorNode(proxy, flexNode.anchorNode);
+    }
+    return proxy;
+}
+/**
+ * Bi-directionally associates the given proxy to the given anchor node.
+ * @remarks Cleans up mappings to raw flex nodes - it is assumed that they are no longer needed once the proxy has an anchor node.
+ */
+function bindProxyToAnchorNode(proxy, anchorNode) {
+    // If the proxy currently has a raw node, forget it
+    proxyToRawFlexNode.delete(proxy);
+    // Once a proxy has been associated with an anchor node, it should never change to another anchor node
+    assert(!proxyToAnchorNode.has(proxy), 0x91e /* Proxy has already been bound to a different anchor node */);
+    proxyToAnchorNode.set(proxy, anchorNode);
+    // However, it's fine for an anchor node to rotate through different proxies when the content at that place in the tree is replaced.
+    anchorNode.slots.set(proxySlot, proxy);
+}
+//# sourceMappingURL=proxyBinding.js.map

package/lib/simple-tree/proxyBinding.js.map ADDED Viewed

@@ -0,0 +1 @@

+ {"version":3,"file":"proxyBinding.js","sourceRoot":"","sources":["../../src/simple-tree/proxyBinding.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,qCAAqC,CAAC;AAE7D,OAAO,EAAiC,UAAU,EAAE,MAAM,kBAAkB,CAAC;AAC7E,OAAO,EACN,WAAW,EAOX,4BAA4B,EAC5B,YAAY,GACZ,MAAM,+BAA+B,CAAC;AACvC,OAAO,EAAE,IAAI,EAAE,MAAM,kBAAkB,CAAC;AACxC,OAAO,EAAE,WAAW,EAAE,MAAM,cAAc,CAAC;AAI3C,0EAA0E;AAC1E,sDAAsD;AACtD,OAAO,EAAE,QAAQ,EAAE,MAAM,4CAA4C,CAAC;AAGtE,qGAAqG;AACrG,kEAAkE;AAElE;;GAEG;AACH,MAAM,SAAS,GAAG,UAAU,EAAY,CAAC;AAEzC,sIAAsI;AACtI,0KAA0K;AAC1K,iKAAiK;AACjK,2EAA2E;AAE3E,+EAA+E;AAC/E,MAAM,iBAAiB,GAAG,IAAI,OAAO,EAAwB,CAAC;AAC9D;;;;GAIG;AACH,MAAM,kBAAkB,GAAG,IAAI,OAAO,EAAsD,CAAC;AAC7F,8HAA8H;AAC9H,MAAM,gBAAgB,GAAG,IAAI,OAAO,EAAwB,CAAC;AAE7D;;;;GAIG;AACH,MAAM,UAAU,WAAW,CAAC,OAAkB,EAAE,IAAY,EAAE,KAAe;IAC5E,MAAM,CAAC,CAAC,gBAAgB,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,KAAK,CAAC,0CAA0C,CAAC,CAAC;IACvF,MAAM,MAAM,GAAG,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IACnC,MAAM,UAAU,GAAG,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC,oCAAoC,CAAC,CAAC;IACxF,qBAAqB,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC;IACzC,MAAM,MAAM,GAAG,GAAG,EAAE;QACnB,IAAI,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE;YAC3B,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;SACvB;QACD,gBAAgB,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAC/B,GAAG,EAAE,CAAC;IACP,CAAC,CAAC;IACF,gBAAgB,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IACpC,MAAM,GAAG,GAAG,UAAU,CAAC,EAAE,CAAC,cAAc,EAAE,MAAM,CAAC,CAAC;AACnD,CAAC;AAgBD,MAAM,UAAU,WAAW,CAAC,KAAe,EAAE,UAAU,GAAG,KAAK;IAC9D,MAAM,UAAU,GAAG,iBAAiB,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IAChD,IAAI,UAAU,KAAK,SAAS,EAAE;QAC7B,2FAA2F;QAC3F,MAAM,QAAQ,GAAG,UAAU,CAAC,KAAK,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;QACpD,IAAI,QAAQ,KAAK,SAAS,EAAE;YAC3B,OAAO,QAAQ,CAAC,CAAC,4CAA4C;SAC7D,CAAC,8CAA8C;QAChD,MAAM,OAAO,GAAG,UAAU,CAAC,SAAS,CAAC,KAAK,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,IAAI,CAAC,iBAAiB,CAAC,CAAC;QACvF,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,cAAc,EAAE,CAAC;QAC/C,OAAO,CAAC,MAAM,CAAC,gBAAgB,CAAC,UAAU,EAAE,MAAM,CAAC,CAAC;QACpD,MAAM,WAAW,GAAG,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;QAC9C,MAAM,CAAC,IAAI,EAAE,CAAC;QACd,qIAAqI;QACrI,gBAAgB,EAAE,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC;QACjC,IAAI,CAAC,UAAU,EAAE;YAChB,4BAA4B,CAAC,WAAW,CAAC,CAAC;SAC1C;QACD,OAAO,WAAW,CAAC;KACnB;IAED,OAAO,kBAAkB,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,kCAAkC,CAAC,CAAC;AAClF,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,cAAc,CAAC,MAAe;IAC7C,0FAA0F;IAC1F,kGAAkG;IAClG,OAAO,CACN,iBAAiB,CAAC,GAAG,CAAC,MAAkB,CAAC,EAAE,KAAK,CAAC,GAAG,CAAC,YAAY,CAAC;QAClE,kBAAkB,CAAC,GAAG,CAAC,MAAkB,CAAC,CAC1C,CAAC;AACH,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,WAAW,CAAC,QAAsB;IACjD,OAAO,QAAQ,CAAC,UAAU,CAAC,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;AACjD,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,WAAW,CAC1B,KAAa,EACb,QAAsB;IAEtB,MAAM,gBAAgB,GAAG,iBAAiB,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,KAAK,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;IAC/E,MAAM,CACL,gBAAgB,KAAK,SAAS,EAC9B,KAAK,CAAC,wDAAwD,CAC9D,CAAC;IACF,IAAI,QAAQ,YAAY,WAAW,EAAE;QACpC,kBAAkB,CAAC,GAAG,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;KACxC;SAAM;QACN,MAAM,CACL,WAAW,CAAC,QAAQ,CAAC,KAAK,SAAS,EACnC,KAAK,CAAC,yDAAyD,CAC/D,CAAC;QACF,qBAAqB,CAAC,KAAK,EAAE,QAAQ,CAAC,UAAU,CAAC,CAAC;KAClD;IACD,OAAO,KAAK,CAAC;AACd,CAAC;AAED;;;GAGG;AACH,SAAS,qBAAqB,CAAC,KAAe,EAAE,UAAsB;IACrE,mDAAmD;IACnD,kBAAkB,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IACjC,sGAAsG;IACtG,MAAM,CACL,CAAC,iBAAiB,CAAC,GAAG,CAAC,KAAK,CAAC,EAC7B,KAAK,CAAC,6DAA6D,CACnE,CAAC;IACF,iBAAiB,CAAC,GAAG,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC;IACzC,oIAAoI;IACpI,UAAU,CAAC,KAAK,CAAC,GAAG,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;AACxC,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { assert } from \"@fluidframework/core-utils/internal\";\n\nimport { AnchorNode, AnchorSet, UpPath, anchorSlot } from \"../core/index.js\";\nimport {\n\tContextSlot,\n\tFlexTreeNodeSchema,\n\tFlexMapNodeSchema,\n\tFlexObjectNodeSchema,\n\tFlexTreeMapNode,\n\tFlexTreeNode,\n\tFlexTreeObjectNode,\n\tassertFlexTreeEntityNotFreed,\n\tflexTreeSlot,\n} from \"../feature-libraries/index.js\";\nimport { fail } from \"../util/index.js\";\nimport { RawTreeNode } from \"./rawNode.js\";\nimport { WithType } from \"./schemaTypes.js\";\nimport { TreeArrayNode } from \"./arrayNode.js\";\nimport { TreeNode } from \"./types.js\";\n// TODO: decide how to deal with dependencies on flex-tree implementation.\n// eslint-disable-next-line import/no-internal-modules\nimport { makeTree } from \"../feature-libraries/flex-tree/lazyNode.js\";\nimport { TreeMapNode } from \"./mapNode.js\";\n\n// This file contains various maps and helpers for supporting proxy binding (a.k.a. proxy hydration).\n// See ./ProxyBinding.md for a high-level overview of the process.\n\n/**\n * An anchor slot which associates an anchor with its corresponding node proxy, if there is one.\n */\nconst proxySlot = anchorSlot<TreeNode>();\n\n// The following records are maintained as WeakMaps, rather than a private symbol (e.g. like `targetSymbol`) on the node proxy itself.\n// The map behaves essentially the same, except that performing a lookup in the map will not perform a property read/get on the key object (as is the case with a symbol).\n// Since `SharedTreeNodes` are proxies with non-trivial `get` traps, this choice is meant to prevent the confusion of the lookup passing through multiple objects\n// via the trap, or the trap not properly handling the special symbol, etc.\n\n/** A reverse mapping of {@link proxySlot} that is updated at the same time. */\nconst proxyToAnchorNode = new WeakMap<TreeNode, AnchorNode>();\n/**\n * Maps proxies to their \"raw\" tree nodes.\n * The raw node exists when the proxy is first created but before it has been associated with a real {@link FlexTreeNode}.\n * For example, after a user calls `const proxy = new Foo({})` but before `proxy` is inserted into the tree and queried.\n */\nconst proxyToRawFlexNode = new WeakMap<TreeNode, RawTreeNode<FlexTreeNodeSchema, unknown>>();\n/** Used by `anchorProxy` as an optimization to ensure that only one anchor is remembered at a time for a given anchor node */\nconst anchorForgetters = new WeakMap<TreeNode, () => void>();\n\n/**\n * Creates an anchor node and associates it with the given proxy.\n * @privateRemarks Use `forgetters` to cleanup the anchor allocated by this function once the anchor is no longer needed.\n * In practice, this happens when either the anchor node is destroyed, or another anchor to the same node is created by a new flex node.\n */\nexport function anchorProxy(anchors: AnchorSet, path: UpPath, proxy: TreeNode): void {\n\tassert(!anchorForgetters.has(proxy), 0x91c /* Proxy anchor should not be set twice */);\n\tconst anchor = anchors.track(path);\n\tconst anchorNode = anchors.locate(anchor) ?? fail(\"Expected anchor node to be present\");\n\tbindProxyToAnchorNode(proxy, anchorNode);\n\tconst forget = () => {\n\t\tif (anchors.locate(anchor)) {\n\t\t\tanchors.forget(anchor);\n\t\t}\n\t\tanchorForgetters.delete(proxy);\n\t\toff();\n\t};\n\tanchorForgetters.set(proxy, forget);\n\tconst off = anchorNode.on(\"afterDestroy\", forget);\n}\n\n/**\n * Retrieves the flex node associated with the given target via {@link setFlexNode}.\n * @remarks Fails if the flex node has not been set.\n */\nexport function getFlexNode(\n\tproxy: TypedNode<FlexObjectNodeSchema>,\n\tallowFreed?: true,\n): FlexTreeObjectNode;\nexport function getFlexNode(proxy: TreeArrayNode, allowFreed?: true): FlexTreeNode;\nexport function getFlexNode(\n\tproxy: TreeMapNode,\n\tallowFreed?: true,\n): FlexTreeMapNode<FlexMapNodeSchema>;\nexport function getFlexNode(proxy: TreeNode, allowFreed?: true): FlexTreeNode;\nexport function getFlexNode(proxy: TreeNode, allowFreed = false): FlexTreeNode {\n\tconst anchorNode = proxyToAnchorNode.get(proxy);\n\tif (anchorNode !== undefined) {\n\t\t// The proxy is bound to an anchor node, but it may or may not have an actual flex node yet\n\t\tconst flexNode = anchorNode.slots.get(flexTreeSlot);\n\t\tif (flexNode !== undefined) {\n\t\t\treturn flexNode; // If it does have a flex node, return it...\n\t\t} // ...otherwise, the flex node must be created\n\t\tconst context = anchorNode.anchorSet.slots.get(ContextSlot) ?? fail(\"missing context\");\n\t\tconst cursor = context.forest.allocateCursor();\n\t\tcontext.forest.moveCursorToPath(anchorNode, cursor);\n\t\tconst newFlexNode = makeTree(context, cursor);\n\t\tcursor.free();\n\t\t// Calling this is a performance improvement, however, do this only after demand to avoid momentarily having no anchors to anchorNode\n\t\tanchorForgetters?.get(proxy)?.();\n\t\tif (!allowFreed) {\n\t\t\tassertFlexTreeEntityNotFreed(newFlexNode);\n\t\t}\n\t\treturn newFlexNode;\n\t}\n\n\treturn proxyToRawFlexNode.get(proxy) ?? fail(\"Expected raw tree node for proxy\");\n}\n\n/**\n * Retrieves the flex node associated with the given target via {@link setFlexNode}, if any.\n */\nexport function tryGetFlexNode(target: unknown): FlexTreeNode | undefined {\n\t// Calling 'WeakMap.get()' with primitives (numbers, strings, etc.) will return undefined.\n\t// This is in contrast to 'WeakMap.set()', which will throw a TypeError if given a non-object key.\n\treturn (\n\t\tproxyToAnchorNode.get(target as TreeNode)?.slots.get(flexTreeSlot) ??\n\t\tproxyToRawFlexNode.get(target as TreeNode)\n\t);\n}\n\n/**\n * Retrieves the proxy associated with the given flex node via {@link setFlexNode}, if any.\n */\nexport function tryGetProxy(flexNode: FlexTreeNode): TreeNode | undefined {\n\treturn flexNode.anchorNode.slots.get(proxySlot);\n}\n\n/**\n * Associate the given proxy and the given flex node.\n * @returns The proxy\n * @remarks\n * This creates a 1:1 mapping between the proxy and tree node.\n * Either can be retrieved from the other via {@link getFlexNode}/{@link tryGetFlexNode} or {@link tryGetProxy}.\n * If the given proxy is already mapped to an flex node, the existing mapping will be overwritten.\n * If the given flex node is already mapped to a different proxy, this function will fail.\n */\nexport function setFlexNode<TProxy extends TreeNode>(\n\tproxy: TProxy,\n\tflexNode: FlexTreeNode,\n): TProxy {\n\tconst existingFlexNode = proxyToAnchorNode.get(proxy)?.slots.get(flexTreeSlot);\n\tassert(\n\t\texistingFlexNode === undefined,\n\t\t0x91d /* Cannot associate a flex node with multiple targets */,\n\t);\n\tif (flexNode instanceof RawTreeNode) {\n\t\tproxyToRawFlexNode.set(proxy, flexNode);\n\t} else {\n\t\tassert(\n\t\t\ttryGetProxy(flexNode) === undefined,\n\t\t\t0x7f5 /* Cannot associate an flex node with multiple targets */,\n\t\t);\n\t\tbindProxyToAnchorNode(proxy, flexNode.anchorNode);\n\t}\n\treturn proxy;\n}\n\n/**\n * Bi-directionally associates the given proxy to the given anchor node.\n * @remarks Cleans up mappings to raw flex nodes - it is assumed that they are no longer needed once the proxy has an anchor node.\n */\nfunction bindProxyToAnchorNode(proxy: TreeNode, anchorNode: AnchorNode): void {\n\t// If the proxy currently has a raw node, forget it\n\tproxyToRawFlexNode.delete(proxy);\n\t// Once a proxy has been associated with an anchor node, it should never change to another anchor node\n\tassert(\n\t\t!proxyToAnchorNode.has(proxy),\n\t\t0x91e /* Proxy has already been bound to a different anchor node */,\n\t);\n\tproxyToAnchorNode.set(proxy, anchorNode);\n\t// However, it's fine for an anchor node to rotate through different proxies when the content at that place in the tree is replaced.\n\tanchorNode.slots.set(proxySlot, proxy);\n}\n\n/**\n * Given a node's schema, return the corresponding object in the proxy-based API.\n */\ntype TypedNode<TSchema extends FlexTreeNodeSchema> = TreeNode & WithType<TSchema[\"name\"]>;\n"]}

package/lib/simple-tree/rawNode.d.ts CHANGED Viewed

@@ -2,11 +2,10 @@
  * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
  * Licensed under the MIT License.
  */
-import { FieldKey, TreeNodeSchemaIdentifier } from "../core/index.js";
-import { EditableTreeEvents, FlexFieldNodeSchema, FlexTreeContext, FlexTreeField, FlexTreeNode, FlexTreeTypedNode, FlexTreeEntityKind, FlexTreeMapNode, FlexTreeObjectNode, FlexTreeTypedField, FlexTreeUnboxField, FlexibleFieldContent, flexTreeMarker, onNextChange, LocalNodeKey, FlexMapNodeSchema, FlexObjectNodeSchema, FlexTreeNodeSchema, TreeStatus, FlexTreeFieldNode } from "../feature-libraries/index.js";
-import { InsertableContent } from "./proxies.js";
+import { AnchorNode, FieldKey, TreeNodeSchemaIdentifier } from "../core/index.js";
+import { FlexTreeContext, FlexTreeEntityKind, FlexTreeField, FlexTreeNode, FlexTreeNodeEvents, FlexTreeNodeSchema, FlexTreeTypedNode, TreeStatus, flexTreeMarker } from "../feature-libraries/index.js";
 /** Stores the content of the raw node, i.e. the data that was passed to the factory */
-declare const nodeContent: unique symbol;
+export declare const nodeContent: unique symbol;
 interface HasNodeContent<T> {
     [nodeContent]: T;
 }
@@ -18,18 +17,15 @@ interface HasNodeContent<T> {
  */
 export declare function extractRawNodeContent(node: object): object | undefined;
 /**
- * Creates a node that pretends to satisfy the given schema while wrapping the given node content.
+ * Node that pretends to satisfy the given schema while wrapping the given node content.
  * Retrieve the node content via {@link extractRawNodeContent}.
  *
  * @remarks This is useful for creating "raw" nodes: nodes which capture data about a pending insertion but are not yet inserted.
  * These raw nodes can be then used on the right-hand side of an assignment (via `=`) to the tree.
  * However, many of their properties and methods are currently unimplemented and will error if accessed.
  */
-export declare function createRawNode(schema: FlexTreeNodeSchema, content: InsertableContent): RawTreeNode<FlexTreeNodeSchema, InsertableContent>;
-/**
- * The base implementation of a node created by {@link createRawNode}.
- */
 export declare abstract class RawTreeNode<TSchema extends FlexTreeNodeSchema, TContent> implements FlexTreeNode, HasNodeContent<TContent> {
+    #private;
     readonly schema: TSchema;
     readonly [flexTreeMarker]: FlexTreeEntityKind.Node;
     readonly [nodeContent]: TContent;
@@ -42,50 +38,13 @@ export declare abstract class RawTreeNode<TSchema extends FlexTreeNodeSchema, TC
     };
     is<TSchemaInner extends FlexTreeNodeSchema>(schema: TSchemaInner): this is FlexTreeTypedNode<TSchemaInner>;
     tryGetField(key: FieldKey): FlexTreeField | undefined;
+    getBoxed(key: string): never;
     boxedIterator(): IterableIterator<FlexTreeField>;
     treeStatus(): TreeStatus;
     value: undefined;
-    on<K extends keyof EditableTreeEvents>(eventName: K, listener: EditableTreeEvents[K]): () => void;
-    [onNextChange](fn: (node: FlexTreeNode) => void): () => void;
-}
-/**
- * The implementation of an object node created by {@link createRawNode}.
- */
-export declare class RawObjectNode<TSchema extends FlexObjectNodeSchema, TContent extends object> extends RawTreeNode<TSchema, TContent> implements FlexTreeObjectNode {
-    get localNodeKey(): LocalNodeKey | undefined;
-}
-/**
- * The implementation of a map node created by {@link createRawNode}.
- */
-export declare class RawMapNode<TSchema extends FlexMapNodeSchema> extends RawTreeNode<TSchema, ReadonlyMap<string, InsertableContent>> implements FlexTreeMapNode<TSchema> {
-    get size(): number;
-    has(key: string): boolean;
-    get(key: string): FlexTreeUnboxField<TSchema["info"]>;
-    getBoxed(key: string): FlexTreeTypedField<TSchema["info"]>;
-    keys(): IterableIterator<FieldKey>;
-    values(): IterableIterator<FlexTreeUnboxField<TSchema["info"], "notEmpty">>;
-    entries(): IterableIterator<[
-        FieldKey,
-        FlexTreeUnboxField<TSchema["info"], "notEmpty">
-    ]>;
-    forEach(callbackFn: (value: FlexTreeUnboxField<TSchema["info"], "notEmpty">, key: FieldKey, map: FlexTreeMapNode<TSchema>) => void, thisArg?: any): void;
-    set(key: string, value: FlexibleFieldContent<TSchema["info"]> | undefined): void;
-    delete(key: string): void;
-    get asObject(): {
-        readonly [P in FieldKey]?: FlexTreeUnboxField<TSchema["info"], "notEmpty">;
-    };
-    [Symbol.iterator](): IterableIterator<[
-        FieldKey,
-        FlexTreeUnboxField<TSchema["info"], "notEmpty">
-    ]>;
-    boxedIterator(): IterableIterator<FlexTreeTypedField<TSchema["info"]>>;
-}
-/**
- * The implementation of a field node created by {@link createRawNode}.
- */
-export declare class RawFieldNode<TSchema extends FlexFieldNodeSchema> extends RawTreeNode<TSchema, InsertableContent> implements FlexTreeFieldNode<TSchema> {
-    get content(): FlexTreeUnboxField<TSchema["info"]>;
-    get boxedContent(): FlexTreeTypedField<TSchema["info"]>;
+    on<K extends keyof FlexTreeNodeEvents>(eventName: K, listener: FlexTreeNodeEvents[K]): () => void;
+    get anchorNode(): AnchorNode;
 }
+export declare function rawError(message?: string): Error;
 export {};
 //# sourceMappingURL=rawNode.d.ts.map

package/lib/simple-tree/rawNode.d.ts.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"rawNode.d.ts","sourceRoot":"","sources":["../../src/simple-tree/rawNode.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,QAAQ,EAAE,wBAAwB,EAAE,MAAM,kBAAkB,CAAC;~~AACtE~~,OAAO,EACN,kBAAkB,EAClB,~~mBAAmB,EACnB,eAAe,EACf,~~aAAa,EACb,YAAY,EACZ,~~iBAAiB,EACjB,~~kBAAkB,EAClB,~~eAAe,EACf,~~kBAAkB,EAClB,~~kBAAkB,EAClB,kBAAkB,EAClB,oBAAoB,EACpB,cAAc,EACd,YAAY,EACZ,YAAY,EACZ,~~iBAAiB,EACjB,~~oBAAoB,EACpB,kBAAkB,EAClB,~~UAAU,EACV,~~iBAAiB~~,~~EACjB~~,MAAM,+BAA+B,CAAC;~~AAEvC~~,~~OAAO,EAAE,iBAAiB,EAAE,MAAM,cAAc,CAAC;AAEjD,~~uFAAuF;AACvF,~~QAAA~~,MAAM,WAAW,eAAW,CAAC;~~AAC7B~~,UAAU,cAAc,CAAC,CAAC;IACzB,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC;CACjB;AAED;;;;;GAKG;AACH,wBAAgB,qBAAqB,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS,CAQtE;AAED;;;;;;;GAOG;AACH,~~wBAAgB,aAAa,CAC5B,MAAM,EAAE,kBAAkB,EAC1B,OAAO,EAAE,iBAAiB,GACxB,WAAW,CAAC,kBAAkB,EAAE,iBAAiB,CAAC,CAWpD;AAED;;GAEG;AACH,~~8BAAsB,WAAW,CAAC,OAAO,SAAS,kBAAkB,EAAE,QAAQ,CAC7E,YAAW,YAAY,EAAE,cAAc,CAAC,QAAQ,CAAC~~;aAOhC~~,MAAM,EAAE,OAAO;~~IALhC~~,SAAgB,CAAC,cAAc,CAAC,0BAAoC;IACpE,SAAgB,CAAC,WAAW,CAAC,EAAE,QAAQ,CAAC;~~IAExC~~,SAAgB,IAAI,EAAE,wBAAwB,CAAC;~~gBAE9B~~,MAAM,EAAE,OAAO,EAC/B,OAAO,EAAE,QAAQ;IAMlB,IAAW,OAAO,IAAI,eAAe,CAEpC;IAED,IAAW,WAAW,IAAI;QAAE,MAAM,EAAE,aAAa,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAEjE;IAEM,EAAE,CAAC,YAAY,SAAS,kBAAkB,EAChD,MAAM,EAAE,YAAY,GAClB,IAAI,IAAI,iBAAiB,CAAC,YAAY,CAAC;IAInC,WAAW,CAAC,GAAG,EAAE,QAAQ,GAAG,aAAa,GAAG,SAAS;IAIrD,aAAa,IAAI,gBAAgB,CAAC,aAAa,CAAC;IAIhD,UAAU,IAAI,UAAU;IAKxB,KAAK,EAAE,SAAS,CAAC;IAEjB,EAAE,CAAC,CAAC,SAAS,MAAM,kBAAkB,EAC3C,SAAS,EAAE,CAAC,EACZ,QAAQ,EAAE,kBAAkB,CAAC,CAAC,CAAC,GAC7B,MAAM,IAAI;~~IAIN~~,CAAC,YAAY,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,EAAE,YAAY,KAAK,IAAI,GAAG,MAAM,IAAI;CAGnE;AAED;;GAEG;AACH,qBAAa,aAAa,CAAC,OAAO,SAAS,oBAAoB,EAAE,QAAQ,SAAS,MAAM,CACvF,SAAQ,WAAW,CAAC,OAAO,EAAE,QAAQ,CACrC,YAAW,kBAAkB;IAE7B,IAAW,~~YAAY~~,IAAI,~~YAAY~~,~~GAAG,SAAS,CAElD~~;CACD;AAED~~;;GAEG;AACH~~,~~qBAAa~~,UAAU,CAAC,OAAO,SAAS,iBAAiB,CACxD,SAAQ,WAAW,CAAC,OAAO,EAAE,WAAW,CAAC,MAAM,EAAE,iBAAiB,CAAC,CACnE,YAAW,eAAe,CAAC,OAAO,CAAC;IAEnC,IAAW,IAAI,IAAI,MAAM,CAExB;IACM,GAAG,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO;IAGzB,GAAG,CAAC,GAAG,EAAE,MAAM,GAAG,kBAAkB,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IAGrD,QAAQ,CAAC,~~GAAG,EAAE,MAAM,GAAG,kBAAkB,CAAC,~~OAAO,CAAC,~~MAAM,CAAC,CAAC;IAG1D,IAAI,IAAI,gBAAgB,CAAC,QAAQ,CAAC;IAGlC,MAAM,IAAI,gBAAgB,CAAC,kBAAkB,CAAC,OAAO,CAAC,MAAM,CAAC,~~EAAE,~~UAAU,CAAC,CAAC;IAG3E,OAAO,IAAI,gBAAgB,CACjC;QAAC,QAAQ;QAAE,kBAAkB,CAAC,OAAO,CAAC,~~MAAM,~~CAAC,EAAE,UAAU,CAAC;KAAC,CAC3D;IAGM,OAAO,CACb,UAAU,EAAE,CACX,KAAK,EAAE,kBAAkB,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,UAAU,CAAC,EACtD,~~GAAG,~~EAAE,QAAQ,EACb,GAAG,EAAE,eAAe,CAAC,OAAO,CAAC,KACzB,IAAI,EACT,OAAO,CAAC,EAAE,GAAG,GACX,IAAI;IAGA,GAAG,CAAC,GAAG,EAAE,MAAM,EAAE,~~KAAK,EAAE,oBAAoB,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,SAAS,GAAG,IAAI;IAGhF,MAAM,CAAC,GAAG,EAAE,MAAM,GAAG,IAAI;IAIhC,IAAW,QAAQ,IAAI;QACtB,QAAQ,EAAE,CAAC,IAAI,QAAQ,CAAC,CAAC,EAAE,kBAAkB,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,UAAU,CAAC;KAC1E,CAEA;IAEM,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,gBAAgB,CAC3C;QAAC,QAAQ;QAAE,kBAAkB,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,UAAU,CAAC;KAAC,CAC3D;IAIe,aAAa,IAAI,gBAAgB,CAAC,kBAAkB,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC;CAGtF;AAED;;GAEG;AACH,qBAAa,YAAY,CAAC,OAAO,SAAS,mBAAmB,CAC5D,SAAQ,WAAW,CAAC,OAAO,EAAE,iBAAiB,CAC9C,YAAW,iBAAiB,CAAC,OAAO,CAAC;IAErC,IAAW,OAAO,IAAI,kBAAkB,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAExD;IAED,IAAW,YAAY,IAAI,kBAAkB,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAE7D;CACD"}
1	+ {"version":3,"file":"rawNode.d.ts","sourceRoot":"","sources":["../../src/simple-tree/rawNode.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAU,UAAU,EAAE,QAAQ,EAAE,wBAAwB,EAAE,MAAM,kBAAkB,CAAC;AAC1F,OAAO,EACN,eAAe,EACf,kBAAkB,EAClB,aAAa,EACb,YAAY,EACZ,kBAAkB,EAClB,kBAAkB,EAClB,iBAAiB,EACjB,UAAU,EACV,cAAc,EACd,MAAM,+BAA+B,CAAC;AAGvC,uFAAuF;AACvF,eAAO,MAAM,WAAW,eAAW,CAAC;AACpC,UAAU,cAAc,CAAC,CAAC;IACzB,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC;CACjB;AAED;;;;;GAKG;AACH,wBAAgB,qBAAqB,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS,CAQtE;AAED;;;;;;;GAOG;AACH,8BAAsB,WAAW,CAAC,OAAO,SAAS,kBAAkB,EAAE,QAAQ,CAC7E,YAAW,YAAY,EAAE,cAAc,CAAC,QAAQ,CAAC;;aAUhC,MAAM,EAAE,OAAO;IARhC,SAAgB,CAAC,cAAc,CAAC,0BAAoC;IACpE,SAAgB,CAAC,WAAW,CAAC,EAAE,QAAQ,CAAC;IAIxC,SAAgB,IAAI,EAAE,wBAAwB,CAAC;gBAG9B,MAAM,EAAE,OAAO,EAC/B,OAAO,EAAE,QAAQ;IAMlB,IAAW,OAAO,IAAI,eAAe,CAEpC;IAED,IAAW,WAAW,IAAI;QAAE,MAAM,EAAE,aAAa,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAEjE;IAEM,EAAE,CAAC,YAAY,SAAS,kBAAkB,EAChD,MAAM,EAAE,YAAY,GAClB,IAAI,IAAI,iBAAiB,CAAC,YAAY,CAAC;IAInC,WAAW,CAAC,GAAG,EAAE,QAAQ,GAAG,aAAa,GAAG,SAAS;IAIrD,QAAQ,CAAC,GAAG,EAAE,MAAM,GAAG,KAAK;IAI5B,aAAa,IAAI,gBAAgB,CAAC,aAAa,CAAC;IAIhD,UAAU,IAAI,UAAU;IAKxB,KAAK,EAAE,SAAS,CAAC;IAEjB,EAAE,CAAC,CAAC,SAAS,MAAM,kBAAkB,EAC3C,SAAS,EAAE,CAAC,EACZ,QAAQ,EAAE,kBAAkB,CAAC,CAAC,CAAC,GAC7B,MAAM,IAAI;IAIb,IAAW,UAAU,IAAI,UAAU,CAElC;CACD;AAED,wBAAgB,QAAQ,CAAC,OAAO,CAAC,EAAE,MAAM,GAAG,KAAK,CAMhD"}