npm - @fluidframework/tree - Versions diffs - 2.0.0-dev-rc.1.0.0.224419 - Mend

@fluidframework/tree 2.0.0-dev-rc.1.0.0.224419

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 (2212) hide show

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

@@ -0,0 +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,SAAS,CAAC;AACvD,OAAO,EAGN,gBAAgB,EAEhB,iBAAiB,EACjB,YAAY,EACZ,WAAW,EACX,kBAAkB,EAClB,aAAa,EACb,eAAe,EACf,UAAU,EAUV,YAAY,EACZ,cAAc,EACd,aAAa,GACb,MAAM,sBAAsB,CAAC;AAC9B,OAAO,EAAE,QAAQ,EAAsC,MAAM,SAAS,CAAC;AACvE,0EAA0E;AAC1E,sDAAsD;AACtD,OAAO,EAAE,cAAc,EAAE,aAAa,EAAE,MAAM,yCAAyC,CAAC;AAExF,sDAAsD;AACtD,OAAO,EAAE,QAAQ,EAAE,MAAM,2BAA2B,CAAC;AACrD,OAAO,EAAE,uBAAuB,EAAmB,MAAM,gBAAgB,CAAC;AAC1E,OAAO,EAAiE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAClG,OAAO,EAAE,oBAAoB,EAAE,WAAW,EAAE,WAAW,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AAE5F,OAAO,EAAE,mBAAmB,EAAE,kBAAkB,EAAE,MAAM,aAAa,CAAC;AACtE,OAAO,EAAe,aAAa,EAAE,qBAAqB,EAAE,MAAM,WAAW,CAAC;AAE9E,yDAAyD;AACzD,MAAM,UAAU,gBAAgB,CAC/B,KAAkC;IAElC,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,CAAuB,CAAC;SACxE;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,CACN,YAAY,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,oBAAoB,CAAC,YAAY,CAAC,CACrD,CAAC;SACxB;QACD,+CAA+C;QAC/C,KAAK,UAAU,CAAC,QAAQ,CAAC,CAAC;YACzB,wFAAwF;YACxF,mEAAmE;YACnE,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,MAAsB;IACpD,IAAI,kBAAkB,IAAI,MAAM,EAAE;QACjC,OAAO,MAAM,CAAC,kBAAkB,CAAwB,CAAC;KACzD;IACD,OAAO,SAAS,CAAC;AAClB,CAAC;AAED,MAAM,UAAU,oBAAoB,CACnC,QAAsB;IAEtB,MAAM,WAAW,GAAG,oBAAoB,CAAC,QAAQ,CAAC,CAAC;IACnD,IAAI,WAAW,KAAK,SAAS,EAAE;QAC9B,OAAO,WAAiC,CAAC;KACzC;IAED,MAAM,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC;IAC/B,IAAI,MAA0B,CAAC;IAC/B,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,WAEE,CAAC;YACxB,MAAM,GAAG,IAAI,YAAY,CAAC,QAAQ,CAAC,CAAC;SACpC;aAAM;YACN,MAAM,GACL,MACA,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;SACnB;KACD;SAAM;QACN,yCAAyC;QACzC,2FAA2F;QAC3F,MAAM,GAAG,eAAe,CAAU,QAAQ,EAAE,KAAK,CAAC,CAAC;KACnD;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,OAAO,QAAQ,CAAC,KAA2B,CAAC;KAC5C;IACD,IAAI,KAAyB,CAAC;IAC9B,IAAI,WAAW,CAAC,MAAM,CAAC,EAAE;QACxB,KAAK,GAAG,cAAc,CAAC,yBAAyB,EAAE,YAAY,CAAuB,CAAC;KACtF;SAAM,IAAI,iBAAiB,CAAC,MAAM,CAAC,EAAE;QACrC,KAAK,GAAG,eAAe,CAAC,yBAAyB,EAAE,YAAY,CAAuB,CAAC;KACvF;SAAM,IAAI,kBAAkB,CAAC,MAAM,CAAC,EAAE;QACtC,KAAK,GAAG,iBAAiB,CACxB,MAAM,EACN,yBAAyB,EACzB,YAAY,CACU,CAAC;KACxB;SAAM;QACN,IAAI,CAAC,wBAAwB,CAAC,CAAC;KAC/B;IACD,WAAW,CAAC,KAAiB,EAAE,QAAQ,CAAC,CAAC;IACzC,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,WAAW,GAAG,QAAQ,CAAC,MAAM,CAAC,gBAAgB,CAAC,GAAG,CAAC,GAAe,CAAC,CAAC;YAE1E,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,KAEmB,CAAC;oBAEvC,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,CAA4B,CAAC;IAC9B,OAAO,KAAK,CAAC;AACd,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAAG,CAA8B,IAAqB,EAAE,EAAE,CACtF,WAAW,CAAC,IAAI,CAAC,CAAC,OAAwC,CAAC;AAE5D,gGAAgG;AAChG,8DAA8D;AAC9D,SAAS,gCAAgC,CACxC,eAAuB,EACvB,OAAoF;IAEpF,OAAO,qBAAqB,CAC3B,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAuB,EAAE,CAC1C,CAAC,YAAY,uBAAuB,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAC1D,EACD,eAAe,CACf,CAAC;AACH,CAAC;AAED,wCAAwC;AAExC,2FAA2F;AAE3F;;GAEG;AACH,MAAM,CAAC,MAAM,uBAAuB,GAA0B;IAC7D,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,CAAwB,KAAa;YACzC,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,CAA2B,CAAC;QAC5D,CAAC;KACD;IACD,QAAQ,EAAE;QACT,KAAK,CAEJ,KAAa,EACb,GAAG,KAAkF;YAErF,MAAM,aAAa,GAAG,gBAAgB,CAAC,IAAI,CAAC,CAAC;YAE7C,MAAM,EAAE,OAAO,EAAE,cAAc,EAAE,GAAG,gCAAgC,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;YACnF,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,KAAkF;YAErF,MAAM,aAAa,GAAG,gBAAgB,CAAC,IAAI,CAAC,CAAC;YAE7C,MAAM,EAAE,OAAO,EAAE,cAAc,EAAE,GAAG,gCAAgC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;YAC/E,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,KAAkF;YAErF,MAAM,aAAa,GAAG,gBAAgB,CAAC,IAAI,CAAC,CAAC;YAE7C,MAAM,EAAE,OAAO,EAAE,cAAc,EAAE,GAAG,gCAAgC,CACnE,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,CAAwB,KAAa;YACzC,gBAAgB,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QACxC,CAAC;KACD;IACD,WAAW,EAAE;QACZ,KAAK,CAAwB,KAAc,EAAE,GAAY;YACxD,gBAAgB,CAAC,IAAI,CAAC,CAAC,WAAW,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QAChD,CAAC;KACD;IACD,WAAW,EAAE;QACZ,KAAK,CAAwB,WAAmB,EAAE,MAAwB;YACzE,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,CAAwB,WAAmB,EAAE,MAAwB;YACzE,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,MAAwB;YAExB,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,MAAwB;YAExB,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,MAAwB;YAExB,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,MAAwB;YAExB,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,wGAAwG;AACxG,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,uBAAuB,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC;AAClD,CAAC,CAAC,CAAC;AAEH,qDAAqD;AAErD,MAAM,aAAa,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,SAAS,EAAE,uBAAuB,CAAC,CAAC;AAE/E,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,eAAe,CACvB,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,aAAa,EAAE;YAC5B,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,GAA4B,IAAI,KAAK,CAA0B,YAAmB,EAAE;QAC9F,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,6GAA6G;gBAC7G,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,KAA4C;YAE5C,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,GACjB,kBAAkB,IAAI,IAAI,GAAG,EAAkD,CAAC;IAEjF,kGAAkG;IAClG,uDAAuD;IACvD,MAAM,KAAK,GAAG,IAAI,KAAK,CACtB,YAAmE,EACnE;QACC,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,CACD,CAAC;IACF,OAAO,KAAK,CAAC;AACd,CAAC;AAiCD,MAAM,UAAU,kBAAkB,CACjC,MAAe,EACf,OAAqC,EACrC,yBAAkC,EAClC,MAAe;IAEf,oEAAoE;IACpE,IAAI,QAAmE,CAAC;IACxE,IAAI,KAAe,CAAC;IACpB,IAAI,MAAM,YAAY,gBAAgB,EAAE;QACvC,MAAM,WAAW,GAAG,WAAW,CAAC,MAAM,CAAC,IAAI,EAAE,OAA6C,CAAC,CAAC;QAC5F,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,eAAe,EAAE;QAC7C,8DAA8D;QAC9D,MAAM,WAAW,GAAG,WAAW,CAAC,MAAM,CAAC,IAAI,EAAE,OAA6C,CAAC,CAAC;QAC5F,QAAQ,GAAG,aAAa,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;QAC9C,KAAK,GAAG,eAAe,CAAC,yBAAyB,EAAE,MAAM,CAAC,CAAC;KAC3D;SAAM,IAAI,MAAM,YAAY,aAAa,EAAE;QAC3C,MAAM,WAAW,GAAG,WAAW,CAAC,MAAM,CAAC,IAAI,EAAE,OAA6C,CAAC,CAAC;QAC5F,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,CACL,CAAC,CAAC,OAAO,YAAY,QAAQ,CAAC,EAC9B,KAAK,CAAC,uDAAuD,CAC7D,CAAC;IAEF,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,KAAK,YAAY,QAAQ,EAAE;QAC9B,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,0DAA0D,CAChE,CAAC;YACF,MAAM,CACL,iBAAiB,CAAC,QAAQ,CAAC,MAAM,CAAC,EAClC,KAAK,CAAC,6CAA6C,CACnD,CAAC;YACF,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,EAAE,EAAE,CAClC,OAAO,CACN,gBAAgB,CACf,QAA8C,EAC9C,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,QAA0C,EAAE,GAAG,CAAC,CAAC,CACzE,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,gBAAgB,CACxB,QAA4C,EAC5C,KAAa;IAEb,MAAM,KAAK,GAAG,QAAQ,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;IAC7C,MAAM,CACL,KAAK,EAAE,MAAM,CAAC,IAAI,KAAK,UAAU,CAAC,QAAQ,EAC1C,KAAK,CAAC,iDAAiD,CACvD,CAAC;IACF,OAAQ,KAA6C,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;AACtE,CAAC;AAED,SAAS,eAAe,CACvB,OAAuC,EACvC,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,KAA6C,CAAC,YAAY,CAAC;AACpE,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,OAAQ,KAAmF;SACzF,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,2HAA2H;IAC3H,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\";\nimport {\n\tAllowedTypes,\n\tTreeFieldSchema,\n\tObjectNodeSchema,\n\tTreeNodeSchema,\n\tschemaIsFieldNode,\n\tschemaIsLeaf,\n\tschemaIsMap,\n\tschemaIsObjectNode,\n\tMapNodeSchema,\n\tFieldNodeSchema,\n\tFieldKinds,\n\tFlexTreeFieldNode,\n\tFlexTreeMapNode,\n\tFlexTreeObjectNode,\n\tFlexTreeOptionalField,\n\tFlexTreeRequiredField,\n\tFlexTreeSequenceField,\n\tFlexTreeNode,\n\tFlexTreeTypedField,\n\tFlexTreeUnknownUnboxed,\n\tonNextChange,\n\ttypeNameSymbol,\n\tisFluidHandle,\n} from \"../feature-libraries\";\nimport { EmptyKey, FieldKey, TreeNodeSchemaIdentifier } from \"../core\";\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\";\nimport { type TreeNodeSchema as TreeNodeSchemaClass } from \"../class-tree\";\n// eslint-disable-next-line import/no-internal-modules\nimport { NodeKind } from \"../class-tree/schemaTypes\";\nimport { IterableTreeListContent, TreeListNodeOld } from \"./treeListNode\";\nimport { TreeField, TypedNode, TreeMapNode, TreeObjectNode, Unhydrated, TreeNode } from \"./types\";\nimport { tryGetFlexNodeTarget, setFlexNode, getFlexNode, tryGetFlexNode } from \"./flexNode\";\nimport { InsertableTreeNodeUnion, InsertableTypedNode } from \"./insertable\";\nimport { cursorFromFieldData, cursorFromNodeData } from \"./toMapTree\";\nimport { RawTreeNode, createRawNode, extractRawNodeContent } from \"./rawNode\";\n\n/** Retrieve the associated proxy for the given field. */\nexport function getProxyForField<TSchema extends TreeFieldSchema>(\n\tfield: FlexTreeTypedField<TSchema>,\n): TreeField<TSchema> {\n\tswitch (field.schema.kind) {\n\t\tcase FieldKinds.required: {\n\t\t\tconst asValue = field as FlexTreeTypedField<\n\t\t\t\tTreeFieldSchema<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) as TreeField<TSchema>;\n\t\t}\n\t\tcase FieldKinds.optional: {\n\t\t\tconst asValue = field as FlexTreeTypedField<\n\t\t\t\tTreeFieldSchema<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 (\n\t\t\t\tmaybeContent === undefined ? undefined : getOrCreateNodeProxy(maybeContent)\n\t\t\t) as TreeField<TSchema>;\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 list proxy, making\n\t\t\t// this case unreachable as long as users follow the 'list 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: TreeNodeSchema): TreeNodeSchemaClass | undefined {\n\tif (simpleSchemaSymbol in schema) {\n\t\treturn schema[simpleSchemaSymbol] as TreeNodeSchemaClass;\n\t}\n\treturn undefined;\n}\n\nexport function getOrCreateNodeProxy<TSchema extends TreeNodeSchema>(\n\tflexNode: FlexTreeNode,\n): TypedNode<TSchema> {\n\tconst cachedProxy = tryGetFlexNodeTarget(flexNode);\n\tif (cachedProxy !== undefined) {\n\t\treturn cachedProxy as TypedNode<TSchema>;\n\t}\n\n\tconst schema = flexNode.schema;\n\tlet output: TypedNode<TSchema>;\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 (\n\t\t\t\tdummy: FlexTreeNode,\n\t\t\t) => TypedNode<TSchema>;\n\t\t\toutput = new simpleSchema(flexNode);\n\t\t} else {\n\t\t\toutput = (\n\t\t\t\tschema as unknown as { create: (data: FlexTreeNode) => TypedNode<TSchema> }\n\t\t\t).create(flexNode);\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<TSchema>(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<TSchema extends TreeNodeSchema>(\n\tflexNode: FlexTreeNode,\n\tallowAdditionalProperties: boolean,\n\ttargetObject?: object,\n): TypedNode<TSchema> {\n\tconst schema = flexNode.schema;\n\tif (schemaIsLeaf(schema)) {\n\t\treturn flexNode.value as TypedNode<TSchema>;\n\t}\n\tlet proxy: TypedNode<TSchema>;\n\tif (schemaIsMap(schema)) {\n\t\tproxy = createMapProxy(allowAdditionalProperties, targetObject) as TypedNode<TSchema>;\n\t} else if (schemaIsFieldNode(schema)) {\n\t\tproxy = createListProxy(allowAdditionalProperties, targetObject) as TypedNode<TSchema>;\n\t} else if (schemaIsObjectNode(schema)) {\n\t\tproxy = createObjectProxy(\n\t\t\tschema,\n\t\t\tallowAdditionalProperties,\n\t\t\ttargetObject,\n\t\t) as TypedNode<TSchema>;\n\t} else {\n\t\tfail(\"unrecognized node kind\");\n\t}\n\tsetFlexNode(proxy as TreeNode, 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 ObjectNodeSchema>(\n\tschema: TSchema,\n\tallowAdditionalProperties: boolean,\n\ttargetObject: object = {},\n): TreeObjectNode<TSchema> {\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 fieldSchema = flexNode.schema.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<AllowedTypes>\n\t\t\t\t\t\t| FlexTreeOptionalField<AllowedTypes>;\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 TreeObjectNode<TSchema>;\n\treturn proxy;\n}\n\n/**\n * Given a list proxy, returns its underlying LazySequence field.\n */\nexport const getSequenceField = <TTypes extends AllowedTypes>(list: TreeListNodeOld) =>\n\tgetFlexNode(list).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 contextualizeInsertedListContent(\n\tinsertedAtIndex: number,\n\tcontent: readonly (InsertableContent | IterableTreeListContent<InsertableContent>)[],\n): ExtractedFactoryContent {\n\treturn extractFactoryContent(\n\t\tcontent.flatMap((c): InsertableContent[] =>\n\t\t\tc instanceof IterableTreeListContent ? Array.from(c) : [c],\n\t\t),\n\t\tinsertedAtIndex,\n\t);\n}\n\n// #region Create dispatch map for lists\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 SharedListNode dispatch object.\n */\nexport const listPrototypeProperties: 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: TreeListNodeOld, index: number): FlexTreeUnknownUnboxed | 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) as FlexTreeUnknownUnboxed;\n\t\t},\n\t},\n\tinsertAt: {\n\t\tvalue(\n\t\t\tthis: TreeListNodeOld,\n\t\t\tindex: number,\n\t\t\t...value: readonly (InsertableContent | IterableTreeListContent<InsertableContent>)[]\n\t\t): void {\n\t\t\tconst sequenceField = getSequenceField(this);\n\n\t\t\tconst { content, hydrateProxies } = contextualizeInsertedListContent(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: TreeListNodeOld,\n\t\t\t...value: readonly (InsertableContent | IterableTreeListContent<InsertableContent>)[]\n\t\t): void {\n\t\t\tconst sequenceField = getSequenceField(this);\n\n\t\t\tconst { content, hydrateProxies } = contextualizeInsertedListContent(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: TreeListNodeOld,\n\t\t\t...value: readonly (InsertableContent | IterableTreeListContent<InsertableContent>)[]\n\t\t): void {\n\t\t\tconst sequenceField = getSequenceField(this);\n\n\t\t\tconst { content, hydrateProxies } = contextualizeInsertedListContent(\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: TreeListNodeOld, index: number): void {\n\t\t\tgetSequenceField(this).removeAt(index);\n\t\t},\n\t},\n\tremoveRange: {\n\t\tvalue(this: TreeListNodeOld, start?: number, end?: number): void {\n\t\t\tgetSequenceField(this).removeRange(start, end);\n\t\t},\n\t},\n\tmoveToStart: {\n\t\tvalue(this: TreeListNodeOld, sourceIndex: number, source?: TreeListNodeOld): 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: TreeListNodeOld, sourceIndex: number, source?: TreeListNodeOld): 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: TreeListNodeOld,\n\t\t\tindex: number,\n\t\t\tsourceIndex: number,\n\t\t\tsource?: TreeListNodeOld,\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: TreeListNodeOld,\n\t\t\tsourceStart: number,\n\t\t\tsourceEnd: number,\n\t\t\tsource?: TreeListNodeOld,\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: TreeListNodeOld,\n\t\t\tsourceStart: number,\n\t\t\tsourceEnd: number,\n\t\t\tsource?: TreeListNodeOld,\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: TreeListNodeOld,\n\t\t\tindex: number,\n\t\t\tsourceStart: number,\n\t\t\tsourceEnd: number,\n\t\t\tsource?: TreeListNodeOld,\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 list 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\tlistPrototypeProperties[fn.name] = { value: fn };\n});\n\n/* eslint-enable @typescript-eslint/unbound-method */\n\nconst listPrototype = Object.create(Object.prototype, listPrototypeProperties);\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 list 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 list functionality from {@link listPrototype}.\n */\nfunction createListProxy<TTypes extends AllowedTypes>(\n\tallowAdditionalProperties: boolean,\n\tcustomTargetObject?: object,\n): TreeListNodeOld<TTypes> {\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(listPrototype, {\n\t\t\tlength: {\n\t\t\t\tget(this: TreeListNodeOld) {\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: TreeListNodeOld<TTypes> = new Proxy<TreeListNodeOld<TTypes>>(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 list 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\t*value(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: InsertableTreeNodeUnion<AllowedTypes>,\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\t*value(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<TSchema extends MapNodeSchema>(\n\tallowAdditionalProperties: boolean,\n\tcustomTargetObject?: object,\n): TreeMapNode<TSchema> {\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 =\n\t\tcustomTargetObject ?? new Map<string, TreeField<TSchema[\"info\"], \"notEmpty\">>();\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<TSchema>>(\n\t\ttargetObject as Map<string, TreeField<TSchema[\"info\"], \"notEmpty\">>,\n\t\t{\n\t\t\tget: (target, key, receiver): unknown => {\n\t\t\t\t// Pass the proxy as the receiver here, so that any methods on the prototype receive `proxy` as `this`.\n\t\t\t\treturn Reflect.get(dispatch, key, proxy);\n\t\t\t},\n\t\t\tgetOwnPropertyDescriptor: (target, key): PropertyDescriptor | undefined => {\n\t\t\t\treturn Reflect.getOwnPropertyDescriptor(dispatch, key);\n\t\t\t},\n\t\t\thas: (target, key) => {\n\t\t\t\treturn Reflect.has(dispatch, key);\n\t\t\t},\n\t\t\tset: (target, key, newValue): boolean => {\n\t\t\t\treturn allowAdditionalProperties ? Reflect.set(dispatch, key, newValue) : false;\n\t\t\t},\n\t\t\townKeys: (target) => {\n\t\t\t\t// All of Map's properties are inherited via its prototype, so there is nothing to return here,\n\t\t\t\treturn [];\n\t\t\t},\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<TSchema extends ObjectNodeSchema>(\n\tschema: TSchema,\n\tcontent: InsertableTypedNode<TSchema>,\n\tallowAdditionalProperties: boolean,\n\ttarget?: object,\n): Unhydrated<TreeObjectNode<TSchema>>;\nexport function createRawNodeProxy<TSchema extends FieldNodeSchema>(\n\tschema: TSchema,\n\tcontent: InsertableTypedNode<TSchema>,\n\tallowAdditionalProperties: boolean,\n\ttarget?: object,\n): Unhydrated<TreeListNodeOld<TSchema[\"info\"][\"allowedTypes\"]>>;\nexport function createRawNodeProxy<TSchema extends MapNodeSchema>(\n\tschema: TSchema,\n\tcontent: InsertableTypedNode<TSchema>,\n\tallowAdditionalProperties: boolean,\n\ttarget?: object,\n): Unhydrated<TreeMapNode<TSchema>>;\nexport function createRawNodeProxy<TSchema extends TreeNodeSchema>(\n\tschema: TSchema,\n\tcontent: InsertableTypedNode<TSchema>,\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<TSchema, InsertableTypedNode<TreeNodeSchema>>;\n\tlet proxy: TreeNode;\n\tif (schema instanceof ObjectNodeSchema) {\n\t\tconst contentCopy = copyContent(schema.name, content as InsertableTypedNode<typeof schema>);\n\t\tflexNode = createRawNode(schema, contentCopy);\n\t\tproxy = createObjectProxy(schema, allowAdditionalProperties, target);\n\t} else if (schema instanceof FieldNodeSchema) {\n\t\t// simple-tree uses field nodes exclusively to represent lists\n\t\tconst contentCopy = copyContent(schema.name, content as InsertableTypedNode<typeof schema>);\n\t\tflexNode = createRawNode(schema, contentCopy);\n\t\tproxy = createListProxy(allowAdditionalProperties, target);\n\t} else if (schema instanceof MapNodeSchema) {\n\t\tconst contentCopy = copyContent(schema.name, content as InsertableTypedNode<typeof schema>);\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 list content, this must be the index in the list 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(\n\t\t!(content instanceof TreeNode),\n\t\t0x844 /* Unhydrated insertion content should have FlexNode */,\n\t);\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 (input instanceof TreeNode) {\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 list 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 list */,\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 list */,\n\t\t\t);\n\t\t\thydrators.forEach(([i, hydrate]) =>\n\t\t\t\thydrate(\n\t\t\t\t\tgetListChildNode(\n\t\t\t\t\t\tflexNode as FlexTreeFieldNode<FieldNodeSchema>,\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<MapNodeSchema>, 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 getListChildNode(\n\tlistNode: FlexTreeFieldNode<FieldNodeSchema>,\n\tindex: number,\n): FlexTreeNode | undefined {\n\tconst field = listNode.tryGetField(EmptyKey);\n\tassert(\n\t\tfield?.schema.kind === FieldKinds.sequence,\n\t\t0x7fc /* Expected sequence field when hydrating list */,\n\t);\n\treturn (field as FlexTreeSequenceField<AllowedTypes>).boxedAt(index);\n}\n\nfunction getMapChildNode(\n\tmapNode: FlexTreeMapNode<MapNodeSchema>,\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<AllowedTypes>).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 (field as FlexTreeRequiredField<AllowedTypes> | FlexTreeOptionalField<AllowedTypes>)\n\t\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 a list).\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"]}

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

@@ -0,0 +1,96 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { FieldKey, TreeNodeSchemaIdentifier } from "../core";
+import { EditableTreeEvents, FieldNodeSchema, FlexTreeContext, FlexTreeField, FlexTreeNode, FlexTreeTypedNode, FlexTreeEntityKind, FlexTreeMapNode, FlexTreeObjectNode, FlexTreeTypedField, FlexTreeUnboxField, FlexibleFieldContent, boxedIterator, flexTreeMarker, onNextChange, LocalNodeKey, MapNodeSchema, ObjectNodeSchema, TreeNodeSchema, TreeStatus, FlexTreeFieldNode } from "../feature-libraries";
+import { InsertableTypedNode } from "./insertable";
+/** Stores the content of the raw node, i.e. the data that was passed to the factory */
+declare const nodeContent: unique symbol;
+interface HasNodeContent<T> {
+    [nodeContent]: T;
+}
+/**
+ * Retrieve the content of a raw object node created via {@link createRawNode}.
+ * @remarks
+ * Raw nodes should only ever be processed as input once.
+ * Therefore, this extraction removes the content from the node and will error if called twice on the same node.
+ */
+export declare function extractRawNodeContent<TSchema extends MapNodeSchema, TContent extends InsertableTypedNode<TSchema>>(node: RawMapNode<TSchema, TContent>): TContent;
+export declare function extractRawNodeContent<TSchema extends FieldNodeSchema, TContent extends InsertableTypedNode<TSchema>>(node: RawFieldNode<TSchema, TContent>): TContent;
+export declare function extractRawNodeContent<TSchema extends ObjectNodeSchema, TContent extends object>(node: RawObjectNode<TSchema, TContent>): TContent;
+export declare function extractRawNodeContent(node: FlexTreeNode): object | undefined;
+/**
+ * Creates a 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<TSchema extends MapNodeSchema, TContent extends InsertableTypedNode<TSchema>>(schema: TSchema, content: TContent): RawMapNode<TSchema, TContent>;
+export declare function createRawNode<TSchema extends FieldNodeSchema, TContent extends InsertableTypedNode<TSchema>>(schema: TSchema, content: TContent): RawFieldNode<TSchema, TContent>;
+export declare function createRawNode<TSchema extends ObjectNodeSchema, TContent extends InsertableTypedNode<TSchema>>(schema: TSchema, content: TContent): RawObjectNode<TSchema, TContent>;
+/**
+ * The base implementation of a node created by {@link createRawNode}.
+ */
+export declare abstract class RawTreeNode<TSchema extends TreeNodeSchema, TContent> implements FlexTreeNode, HasNodeContent<TContent> {
+    readonly schema: TSchema;
+    readonly [flexTreeMarker]: FlexTreeEntityKind.Node;
+    readonly [nodeContent]: TContent;
+    readonly type: TreeNodeSchemaIdentifier;
+    constructor(schema: TSchema, content: TContent);
+    get context(): FlexTreeContext;
+    get parentField(): {
+        parent: FlexTreeField;
+        index: number;
+    };
+    is<TSchemaInner extends TreeNodeSchema>(schema: TSchemaInner): this is FlexTreeTypedNode<TSchemaInner>;
+    tryGetField(key: FieldKey): FlexTreeField | undefined;
+    [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 ObjectNodeSchema, 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 MapNodeSchema, TContent extends InsertableTypedNode<TSchema>> extends RawTreeNode<TSchema, TContent> 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 FieldNodeSchema, TContent extends InsertableTypedNode<TSchema>> extends RawTreeNode<TSchema, TContent> implements FlexTreeFieldNode<TSchema> {
+    get content(): FlexTreeUnboxField<TSchema["info"]>;
+    get boxedContent(): FlexTreeTypedField<TSchema["info"]>;
+}
+export {};
+//# sourceMappingURL=rawNode.d.ts.map

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

@@ -0,0 +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,SAAS,CAAC;AAC7D,OAAO,EACN,kBAAkB,EAClB,eAAe,EACf,eAAe,EACf,aAAa,EACb,YAAY,EACZ,iBAAiB,EACjB,kBAAkB,EAClB,eAAe,EACf,kBAAkB,EAClB,kBAAkB,EAClB,kBAAkB,EAClB,oBAAoB,EACpB,aAAa,EACb,cAAc,EACd,YAAY,EACZ,YAAY,EACZ,aAAa,EACb,gBAAgB,EAChB,cAAc,EAEd,UAAU,EACV,iBAAiB,EACjB,MAAM,sBAAsB,CAAC;AAE9B,OAAO,EAAE,mBAAmB,EAAE,MAAM,cAAc,CAAC;AAEnD,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,CACpC,OAAO,SAAS,aAAa,EAC7B,QAAQ,SAAS,mBAAmB,CAAC,OAAO,CAAC,EAC5C,IAAI,EAAE,UAAU,CAAC,OAAO,EAAE,QAAQ,CAAC,GAAG,QAAQ,CAAC;AACjD,wBAAgB,qBAAqB,CACpC,OAAO,SAAS,eAAe,EAC/B,QAAQ,SAAS,mBAAmB,CAAC,OAAO,CAAC,EAC5C,IAAI,EAAE,YAAY,CAAC,OAAO,EAAE,QAAQ,CAAC,GAAG,QAAQ,CAAC;AACnD,wBAAgB,qBAAqB,CAAC,OAAO,SAAS,gBAAgB,EAAE,QAAQ,SAAS,MAAM,EAC9F,IAAI,EAAE,aAAa,CAAC,OAAO,EAAE,QAAQ,CAAC,GACpC,QAAQ,CAAC;AACZ,wBAAgB,qBAAqB,CAAC,IAAI,EAAE,YAAY,GAAG,MAAM,GAAG,SAAS,CAAC;AAW9E;;;;;;;GAOG;AACH,wBAAgB,aAAa,CAC5B,OAAO,SAAS,aAAa,EAC7B,QAAQ,SAAS,mBAAmB,CAAC,OAAO,CAAC,EAC5C,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,QAAQ,GAAG,UAAU,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;AACrE,wBAAgB,aAAa,CAC5B,OAAO,SAAS,eAAe,EAC/B,QAAQ,SAAS,mBAAmB,CAAC,OAAO,CAAC,EAC5C,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,QAAQ,GAAG,YAAY,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;AACvE,wBAAgB,aAAa,CAC5B,OAAO,SAAS,gBAAgB,EAChC,QAAQ,SAAS,mBAAmB,CAAC,OAAO,CAAC,EAC5C,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,QAAQ,GAAG,aAAa,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;AA0BxE;;GAEG;AACH,8BAAsB,WAAW,CAAC,OAAO,SAAS,cAAc,EAAE,QAAQ,CACzE,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,cAAc,EAC5C,MAAM,EAAE,YAAY,GAClB,IAAI,IAAI,iBAAiB,CAAC,YAAY,CAAC;IAInC,WAAW,CAAC,GAAG,EAAE,QAAQ,GAAG,aAAa,GAAG,SAAS;IAIrD,CAAC,aAAa,CAAC,IAAI,gBAAgB,CAAC,aAAa,CAAC;IAIlD,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,gBAAgB,EAAE,QAAQ,SAAS,MAAM,CACnF,SAAQ,WAAW,CAAC,OAAO,EAAE,QAAQ,CACrC,YAAW,kBAAkB;IAE7B,IAAW,YAAY,IAAI,YAAY,GAAG,SAAS,CAElD;CACD;AAED;;GAEG;AACH,qBAAa,UAAU,CACrB,OAAO,SAAS,aAAa,EAC7B,QAAQ,SAAS,mBAAmB,CAAC,OAAO,CAAC,CAE9C,SAAQ,WAAW,CAAC,OAAO,EAAE,QAAQ,CACrC,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;IAIM,CAAC,aAAa,CAAC,IAAI,gBAAgB,CAAC,kBAAkB,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC;CAG/E;AAED;;GAEG;AACH,qBAAa,YAAY,CACvB,OAAO,SAAS,eAAe,EAC/B,QAAQ,SAAS,mBAAmB,CAAC,OAAO,CAAC,CAE9C,SAAQ,WAAW,CAAC,OAAO,EAAE,QAAQ,CACrC,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"}

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

@@ -0,0 +1,132 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+var _a;
+import { FieldNodeSchema, FlexTreeEntityKind, boxedIterator, flexTreeMarker, onNextChange, MapNodeSchema, ObjectNodeSchema, } from "../feature-libraries";
+import { fail } from "../util";
+/** Stores the content of the raw node, i.e. the data that was passed to the factory */
+const nodeContent = Symbol();
+export function extractRawNodeContent(node) {
+    if (node instanceof RawTreeNode) {
+        const content = node[nodeContent] ?? fail("Node content may only be extracted once");
+        Reflect.deleteProperty(node, nodeContent);
+        return content;
+    }
+    return undefined;
+}
+export function createRawNode(schema, content) {
+    if (schema instanceof ObjectNodeSchema) {
+        return new RawObjectNode(schema, content);
+    }
+    if (schema instanceof MapNodeSchema) {
+        return new RawMapNode(schema, content);
+    }
+    if (schema instanceof FieldNodeSchema) {
+        return new RawFieldNode(schema, content);
+    }
+    fail("Unrecognized schema");
+}
+/**
+ * The base implementation of a node created by {@link createRawNode}.
+ */
+export class RawTreeNode {
+    constructor(schema, content) {
+        this.schema = schema;
+        this[_a] = FlexTreeEntityKind.Node;
+        this.type = schema.name;
+        this[nodeContent] = content;
+    }
+    get context() {
+        throw rawError("Getting context");
+    }
+    get parentField() {
+        throw rawError("Accessing parentage");
+    }
+    is(schema) {
+        return schema === this.schema;
+    }
+    tryGetField(key) {
+        throw rawError("Reading fields");
+    }
+    [(_a = flexTreeMarker, boxedIterator)]() {
+        throw rawError("Boxed iteration");
+    }
+    treeStatus() {
+        // TODO: We could add a new TreeStatus for "raw" nodes.
+        throw rawError("Status querying");
+    }
+    on(eventName, listener) {
+        throw rawError("Event registration");
+    }
+    [onNextChange](fn) {
+        throw rawError("onNextChange event registration");
+    }
+}
+/**
+ * The implementation of an object node created by {@link createRawNode}.
+ */
+export class RawObjectNode extends RawTreeNode {
+    get localNodeKey() {
+        throw rawError("Reading local node keys");
+    }
+}
+/**
+ * The implementation of a map node created by {@link createRawNode}.
+ */
+export class RawMapNode extends RawTreeNode {
+    get size() {
+        return this[nodeContent].size;
+    }
+    has(key) {
+        return this[nodeContent].has(key);
+    }
+    get(key) {
+        return this[nodeContent].get(key);
+    }
+    getBoxed(key) {
+        throw rawError("Reading boxed map values");
+    }
+    keys() {
+        return this[nodeContent].keys();
+    }
+    values() {
+        throw rawError("Iterating map values");
+    }
+    entries() {
+        throw rawError("Iterating map entries");
+    }
+    forEach(callbackFn, thisArg) {
+        throw rawError("Iterating maps with forEach");
+    }
+    set(key, value) {
+        throw rawError("Setting a map entry");
+    }
+    delete(key) {
+        throw rawError("Deleting a map entry");
+    }
+    get asObject() {
+        throw rawError("Converting a map to an object");
+    }
+    [Symbol.iterator]() {
+        return this.entries();
+    }
+    [boxedIterator]() {
+        throw rawError("Boxed iteration");
+    }
+}
+/**
+ * The implementation of a field node created by {@link createRawNode}.
+ */
+export class RawFieldNode extends RawTreeNode {
+    get content() {
+        throw rawError("Reading content of a list");
+    }
+    get boxedContent() {
+        throw rawError("Reading boxed content of a list");
+    }
+}
+function rawError(message) {
+    return new Error(`${message ?? "Operation"} is not supported on content which has not yet been inserted into the tree`);
+}
+//# sourceMappingURL=rawNode.js.map

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

@@ -0,0 +1 @@

+ {"version":3,"file":"rawNode.js","sourceRoot":"","sources":["../../src/simple-tree/rawNode.ts"],"names":[],"mappings":"AAAA;;;GAGG;;AAGH,OAAO,EAEN,eAAe,EAKf,kBAAkB,EAMlB,aAAa,EACb,cAAc,EACd,YAAY,EAEZ,aAAa,EACb,gBAAgB,GAKhB,MAAM,sBAAsB,CAAC;AAC9B,OAAO,EAAE,IAAI,EAAE,MAAM,SAAS,CAAC;AAG/B,uFAAuF;AACvF,MAAM,WAAW,GAAG,MAAM,EAAE,CAAC;AAuB7B,MAAM,UAAU,qBAAqB,CAAC,IAAY;IACjD,IAAI,IAAI,YAAY,WAAW,EAAE;QAChC,MAAM,OAAO,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,IAAI,CAAC,yCAAyC,CAAC,CAAC;QACrF,OAAO,CAAC,cAAc,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC;QAC1C,OAAO,OAAiB,CAAC;KACzB;IAED,OAAO,SAAS,CAAC;AAClB,CAAC;AAsBD,MAAM,UAAU,aAAa,CAC5B,MAAe,EACf,OAAiB;IAEjB,IAAI,MAAM,YAAY,gBAAgB,EAAE;QACvC,OAAO,IAAI,aAAa,CACvB,MAAM,EACN,OAA6C,CACX,CAAC;KACpC;IACD,IAAI,MAAM,YAAY,aAAa,EAAE;QACpC,OAAO,IAAI,UAAU,CAAC,MAAM,EAAE,OAA6C,CAG1E,CAAC;KACF;IACD,IAAI,MAAM,YAAY,eAAe,EAAE;QACtC,OAAO,IAAI,YAAY,CACtB,MAAM,EACN,OAA6C,CACX,CAAC;KACpC;IACD,IAAI,CAAC,qBAAqB,CAAC,CAAC;AAC7B,CAAC;AAED;;GAEG;AACH,MAAM,OAAgB,WAAW;IAOhC,YACiB,MAAe,EAC/B,OAAiB;QADD,WAAM,GAAN,MAAM,CAAS;QALhB,QAAgB,GAAG,kBAAkB,CAAC,IAAa,CAAC;QAQnE,IAAI,CAAC,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC;QACxB,IAAI,CAAC,WAAW,CAAC,GAAG,OAAO,CAAC;IAC7B,CAAC;IAED,IAAW,OAAO;QACjB,MAAM,QAAQ,CAAC,iBAAiB,CAAC,CAAC;IACnC,CAAC;IAED,IAAW,WAAW;QACrB,MAAM,QAAQ,CAAC,qBAAqB,CAAC,CAAC;IACvC,CAAC;IAEM,EAAE,CACR,MAAoB;QAEpB,OAAQ,MAAkB,KAAK,IAAI,CAAC,MAAM,CAAC;IAC5C,CAAC;IAEM,WAAW,CAAC,GAAa;QAC/B,MAAM,QAAQ,CAAC,gBAAgB,CAAC,CAAC;IAClC,CAAC;IAEM,OA9BU,cAAc,EA8BvB,aAAa,EAAC;QACrB,MAAM,QAAQ,CAAC,iBAAiB,CAAC,CAAC;IACnC,CAAC;IAEM,UAAU;QAChB,uDAAuD;QACvD,MAAM,QAAQ,CAAC,iBAAiB,CAAC,CAAC;IACnC,CAAC;IAIM,EAAE,CACR,SAAY,EACZ,QAA+B;QAE/B,MAAM,QAAQ,CAAC,oBAAoB,CAAC,CAAC;IACtC,CAAC;IAEM,CAAC,YAAY,CAAC,CAAC,EAAgC;QACrD,MAAM,QAAQ,CAAC,iCAAiC,CAAC,CAAC;IACnD,CAAC;CACD;AAED;;GAEG;AACH,MAAM,OAAO,aACZ,SAAQ,WAA8B;IAGtC,IAAW,YAAY;QACtB,MAAM,QAAQ,CAAC,yBAAyB,CAAC,CAAC;IAC3C,CAAC;CACD;AAED;;GAEG;AACH,MAAM,OAAO,UAIZ,SAAQ,WAA8B;IAGtC,IAAW,IAAI;QACd,OAAO,IAAI,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC;IAC/B,CAAC;IACM,GAAG,CAAC,GAAW;QACrB,OAAO,IAAI,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACnC,CAAC;IACM,GAAG,CAAC,GAAW;QACrB,OAAO,IAAI,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,GAAG,CAAwC,CAAC;IAC1E,CAAC;IACM,QAAQ,CAAC,GAAW;QAC1B,MAAM,QAAQ,CAAC,0BAA0B,CAAC,CAAC;IAC5C,CAAC;IACM,IAAI;QACV,OAAO,IAAI,CAAC,WAAW,CAAC,CAAC,IAAI,EAAgC,CAAC;IAC/D,CAAC;IACM,MAAM;QACZ,MAAM,QAAQ,CAAC,sBAAsB,CAAC,CAAC;IACxC,CAAC;IACM,OAAO;QAGb,MAAM,QAAQ,CAAC,uBAAuB,CAAC,CAAC;IACzC,CAAC;IACM,OAAO,CACb,UAIS,EACT,OAAa;QAEb,MAAM,QAAQ,CAAC,6BAA6B,CAAC,CAAC;IAC/C,CAAC;IACM,GAAG,CAAC,GAAW,EAAE,KAAwD;QAC/E,MAAM,QAAQ,CAAC,qBAAqB,CAAC,CAAC;IACvC,CAAC;IACM,MAAM,CAAC,GAAW;QACxB,MAAM,QAAQ,CAAC,sBAAsB,CAAC,CAAC;IACxC,CAAC;IAED,IAAW,QAAQ;QAGlB,MAAM,QAAQ,CAAC,+BAA+B,CAAC,CAAC;IACjD,CAAC;IAEM,CAAC,MAAM,CAAC,QAAQ,CAAC;QAGvB,OAAO,IAAI,CAAC,OAAO,EAAE,CAAC;IACvB,CAAC;IAEM,CAAC,aAAa,CAAC;QACrB,MAAM,QAAQ,CAAC,iBAAiB,CAAC,CAAC;IACnC,CAAC;CACD;AAED;;GAEG;AACH,MAAM,OAAO,YAIZ,SAAQ,WAA8B;IAGtC,IAAW,OAAO;QACjB,MAAM,QAAQ,CAAC,2BAA2B,CAAC,CAAC;IAC7C,CAAC;IAED,IAAW,YAAY;QACtB,MAAM,QAAQ,CAAC,iCAAiC,CAAC,CAAC;IACnD,CAAC;CACD;AAED,SAAS,QAAQ,CAAC,OAAgB;IACjC,OAAO,IAAI,KAAK,CACf,GACC,OAAO,IAAI,WACZ,4EAA4E,CAC5E,CAAC;AACH,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { FieldKey, TreeNodeSchemaIdentifier } from \"../core\";\nimport {\n\tEditableTreeEvents,\n\tFieldNodeSchema,\n\tFlexTreeContext,\n\tFlexTreeField,\n\tFlexTreeNode,\n\tFlexTreeTypedNode,\n\tFlexTreeEntityKind,\n\tFlexTreeMapNode,\n\tFlexTreeObjectNode,\n\tFlexTreeTypedField,\n\tFlexTreeUnboxField,\n\tFlexibleFieldContent,\n\tboxedIterator,\n\tflexTreeMarker,\n\tonNextChange,\n\tLocalNodeKey,\n\tMapNodeSchema,\n\tObjectNodeSchema,\n\tTreeNodeSchema,\n\tTreeNodeSchemaBase,\n\tTreeStatus,\n\tFlexTreeFieldNode,\n} from \"../feature-libraries\";\nimport { fail } from \"../util\";\nimport { InsertableTypedNode } from \"./insertable\";\n\n/** Stores the content of the raw node, i.e. the data that was passed to the factory */\nconst nodeContent = Symbol();\ninterface HasNodeContent<T> {\n\t[nodeContent]: T;\n}\n\n/**\n * Retrieve the content of a raw object node created via {@link createRawNode}.\n * @remarks\n * Raw nodes should only ever be processed as input once.\n * Therefore, this extraction removes the content from the node and will error if called twice on the same node.\n */\nexport function extractRawNodeContent<\n\tTSchema extends MapNodeSchema,\n\tTContent extends InsertableTypedNode<TSchema>,\n>(node: RawMapNode<TSchema, TContent>): TContent;\nexport function extractRawNodeContent<\n\tTSchema extends FieldNodeSchema,\n\tTContent extends InsertableTypedNode<TSchema>,\n>(node: RawFieldNode<TSchema, TContent>): TContent;\nexport function extractRawNodeContent<TSchema extends ObjectNodeSchema, TContent extends object>(\n\tnode: RawObjectNode<TSchema, TContent>,\n): TContent;\nexport function extractRawNodeContent(node: FlexTreeNode): object | undefined;\nexport function extractRawNodeContent(node: object): object | undefined {\n\tif (node instanceof RawTreeNode) {\n\t\tconst content = node[nodeContent] ?? fail(\"Node content may only be extracted once\");\n\t\tReflect.deleteProperty(node, nodeContent);\n\t\treturn content as object;\n\t}\n\n\treturn undefined;\n}\n\n/**\n * Creates a node that pretends to satisfy the given schema while wrapping the given node content.\n * Retrieve the node content via {@link extractRawNodeContent}.\n *\n * @remarks This is useful for creating \"raw\" nodes: nodes which capture data about a pending insertion but are not yet inserted.\n * These raw nodes can be then used on the right-hand side of an assignment (via `=`) to the tree.\n * However, many of their properties and methods are currently unimplemented and will error if accessed.\n */\nexport function createRawNode<\n\tTSchema extends MapNodeSchema,\n\tTContent extends InsertableTypedNode<TSchema>,\n>(schema: TSchema, content: TContent): RawMapNode<TSchema, TContent>;\nexport function createRawNode<\n\tTSchema extends FieldNodeSchema,\n\tTContent extends InsertableTypedNode<TSchema>,\n>(schema: TSchema, content: TContent): RawFieldNode<TSchema, TContent>;\nexport function createRawNode<\n\tTSchema extends ObjectNodeSchema,\n\tTContent extends InsertableTypedNode<TSchema>,\n>(schema: TSchema, content: TContent): RawObjectNode<TSchema, TContent>;\nexport function createRawNode<TSchema extends TreeNodeSchemaBase, TContent>(\n\tschema: TSchema,\n\tcontent: TContent,\n): RawTreeNode<TSchema, TContent> {\n\tif (schema instanceof ObjectNodeSchema) {\n\t\treturn new RawObjectNode(\n\t\t\tschema,\n\t\t\tcontent as InsertableTypedNode<typeof schema>,\n\t\t) as RawTreeNode<TSchema, TContent>;\n\t}\n\tif (schema instanceof MapNodeSchema) {\n\t\treturn new RawMapNode(schema, content as InsertableTypedNode<typeof schema>) as RawTreeNode<\n\t\t\tTSchema,\n\t\t\tTContent\n\t\t>;\n\t}\n\tif (schema instanceof FieldNodeSchema) {\n\t\treturn new RawFieldNode(\n\t\t\tschema,\n\t\t\tcontent as InsertableTypedNode<typeof schema>,\n\t\t) as RawTreeNode<TSchema, TContent>;\n\t}\n\tfail(\"Unrecognized schema\");\n}\n\n/**\n * The base implementation of a node created by {@link createRawNode}.\n */\nexport abstract class RawTreeNode<TSchema extends TreeNodeSchema, TContent>\n\timplements FlexTreeNode, HasNodeContent<TContent>\n{\n\tpublic readonly [flexTreeMarker] = FlexTreeEntityKind.Node as const;\n\tpublic readonly [nodeContent]: TContent;\n\n\tpublic readonly type: TreeNodeSchemaIdentifier;\n\tpublic constructor(\n\t\tpublic readonly schema: TSchema,\n\t\tcontent: TContent,\n\t) {\n\t\tthis.type = schema.name;\n\t\tthis[nodeContent] = content;\n\t}\n\n\tpublic get context(): FlexTreeContext {\n\t\tthrow rawError(\"Getting context\");\n\t}\n\n\tpublic get parentField(): { parent: FlexTreeField; index: number } {\n\t\tthrow rawError(\"Accessing parentage\");\n\t}\n\n\tpublic is<TSchemaInner extends TreeNodeSchema>(\n\t\tschema: TSchemaInner,\n\t): this is FlexTreeTypedNode<TSchemaInner> {\n\t\treturn (schema as unknown) === this.schema;\n\t}\n\n\tpublic tryGetField(key: FieldKey): FlexTreeField | undefined {\n\t\tthrow rawError(\"Reading fields\");\n\t}\n\n\tpublic [boxedIterator](): IterableIterator<FlexTreeField> {\n\t\tthrow rawError(\"Boxed iteration\");\n\t}\n\n\tpublic treeStatus(): TreeStatus {\n\t\t// TODO: We could add a new TreeStatus for \"raw\" nodes.\n\t\tthrow rawError(\"Status querying\");\n\t}\n\n\tpublic value: undefined;\n\n\tpublic on<K extends keyof EditableTreeEvents>(\n\t\teventName: K,\n\t\tlistener: EditableTreeEvents[K],\n\t): () => void {\n\t\tthrow rawError(\"Event registration\");\n\t}\n\n\tpublic [onNextChange](fn: (node: FlexTreeNode) => void): () => void {\n\t\tthrow rawError(\"onNextChange event registration\");\n\t}\n}\n\n/**\n * The implementation of an object node created by {@link createRawNode}.\n */\nexport class RawObjectNode<TSchema extends ObjectNodeSchema, TContent extends object>\n\textends RawTreeNode<TSchema, TContent>\n\timplements FlexTreeObjectNode\n{\n\tpublic get localNodeKey(): LocalNodeKey | undefined {\n\t\tthrow rawError(\"Reading local node keys\");\n\t}\n}\n\n/**\n * The implementation of a map node created by {@link createRawNode}.\n */\nexport class RawMapNode<\n\t\tTSchema extends MapNodeSchema,\n\t\tTContent extends InsertableTypedNode<TSchema>,\n\t>\n\textends RawTreeNode<TSchema, TContent>\n\timplements FlexTreeMapNode<TSchema>\n{\n\tpublic get size(): number {\n\t\treturn this[nodeContent].size;\n\t}\n\tpublic has(key: string): boolean {\n\t\treturn this[nodeContent].has(key);\n\t}\n\tpublic get(key: string): FlexTreeUnboxField<TSchema[\"info\"]> {\n\t\treturn this[nodeContent].get(key) as FlexTreeUnboxField<TSchema[\"info\"]>;\n\t}\n\tpublic getBoxed(key: string): FlexTreeTypedField<TSchema[\"info\"]> {\n\t\tthrow rawError(\"Reading boxed map values\");\n\t}\n\tpublic keys(): IterableIterator<FieldKey> {\n\t\treturn this[nodeContent].keys() as IterableIterator<FieldKey>;\n\t}\n\tpublic values(): IterableIterator<FlexTreeUnboxField<TSchema[\"info\"], \"notEmpty\">> {\n\t\tthrow rawError(\"Iterating map values\");\n\t}\n\tpublic entries(): IterableIterator<\n\t\t[FieldKey, FlexTreeUnboxField<TSchema[\"info\"], \"notEmpty\">]\n\t> {\n\t\tthrow rawError(\"Iterating map entries\");\n\t}\n\tpublic forEach(\n\t\tcallbackFn: (\n\t\t\tvalue: FlexTreeUnboxField<TSchema[\"info\"], \"notEmpty\">,\n\t\t\tkey: FieldKey,\n\t\t\tmap: FlexTreeMapNode<TSchema>,\n\t\t) => void,\n\t\tthisArg?: any,\n\t): void {\n\t\tthrow rawError(\"Iterating maps with forEach\");\n\t}\n\tpublic set(key: string, value: FlexibleFieldContent<TSchema[\"info\"]> | undefined): void {\n\t\tthrow rawError(\"Setting a map entry\");\n\t}\n\tpublic delete(key: string): void {\n\t\tthrow rawError(\"Deleting a map entry\");\n\t}\n\n\tpublic get asObject(): {\n\t\treadonly [P in FieldKey]?: FlexTreeUnboxField<TSchema[\"info\"], \"notEmpty\">;\n\t} {\n\t\tthrow rawError(\"Converting a map to an object\");\n\t}\n\n\tpublic [Symbol.iterator](): IterableIterator<\n\t\t[FieldKey, FlexTreeUnboxField<TSchema[\"info\"], \"notEmpty\">]\n\t> {\n\t\treturn this.entries();\n\t}\n\n\tpublic [boxedIterator](): IterableIterator<FlexTreeTypedField<TSchema[\"info\"]>> {\n\t\tthrow rawError(\"Boxed iteration\");\n\t}\n}\n\n/**\n * The implementation of a field node created by {@link createRawNode}.\n */\nexport class RawFieldNode<\n\t\tTSchema extends FieldNodeSchema,\n\t\tTContent extends InsertableTypedNode<TSchema>,\n\t>\n\textends RawTreeNode<TSchema, TContent>\n\timplements FlexTreeFieldNode<TSchema>\n{\n\tpublic get content(): FlexTreeUnboxField<TSchema[\"info\"]> {\n\t\tthrow rawError(\"Reading content of a list\");\n\t}\n\n\tpublic get boxedContent(): FlexTreeTypedField<TSchema[\"info\"]> {\n\t\tthrow rawError(\"Reading boxed content of a list\");\n\t}\n}\n\nfunction rawError(message?: string): Error {\n\treturn new Error(\n\t\t`${\n\t\t\tmessage ?? \"Operation\"\n\t\t} is not supported on content which has not yet been inserted into the tree`,\n\t);\n}\n"]}

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

@@ -0,0 +1,101 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { type FieldKey, type MapTree } from "../core";
+import { type CursorWithNode, type TreeNodeSchema, FlexTreeSchema, type AllowedTypeSet, TreeFieldSchema, typeNameSymbol } from "../feature-libraries";
+import { InsertableTreeField, InsertableTypedNode } from "./insertable";
+/**
+ * Module notes:
+ *
+ * The flow of the below code is in terms of the structure of the input data. We then verify that the associated
+ * schema is appropriate for that kind of data. This is fine while we have a 1:1 mapping of kind of input data to
+ * the kind of schema we expect for it (e.g. an input that is an array always need to be associated with a sequence in
+ * the schema). If/when we begin accepting kinds of input data that are ambiguous (e.g. accepting an input that is an
+ * array of key/value tuples to instantiate a map) we may need to rethink the structure here to be based more on the
+ * schema than on the input data.
+ */
+/**
+ * Transforms an input {@link TypedNode} tree to a {@link MapTree}, and wraps the tree in a {@link CursorWithNode}.
+ * @param data - The input tree to be converted.
+ * @param globalSchema - Schema for the whole tree for interperting `Any`.
+ * @param typeSet - The set of types allowed by the parent context. Used to validate the input tree.
+ *
+ * @returns A cursor (in nodes mode) for the mapped tree if the input data was defined. Otherwise, returns `undefined`.
+ */
+export declare function cursorFromNodeData(data: InsertableTypedNode<TreeNodeSchema>, globalSchema: FlexTreeSchema, typeSet: AllowedTypeSet): CursorWithNode<MapTree> | undefined;
+/**
+ * Transforms an input {@link TreeField} tree to a list of {@link MapTree}s, and wraps the tree in a {@link CursorWithNode}.
+ * @param data - The input tree to be converted.
+ * @param globalSchema - Schema for the whole tree for interperting `Any`.
+ */
+export declare function cursorFromFieldData(data: InsertableTreeField, globalSchema: FlexTreeSchema, fieldSchema: TreeFieldSchema): CursorWithNode<MapTree>;
+/**
+ * Transforms an input {@link TypedNode} tree to a {@link MapTree}.
+ * @param data - The input tree to be converted.
+ * If the data is an unsupported value (e.g. NaN), a fallback value will be used when supported,
+ * otherwise an error will be thrown.
+ *
+ * Fallbacks:
+ *
+ * * `NaN` =\> `null`
+ *
+ * * `+/-∞` =\> `null`
+ *
+ * * `-0` =\> `+0`
+ *
+ * @param globalSchema - Schema for the whole tree for interperting `Any`.
+ * @param typeSet - The set of types allowed by the parent context. Used to validate the input tree.
+ */
+export declare function nodeDataToMapTree(data: InsertableTypedNode<TreeNodeSchema>, globalSchema: FlexTreeSchema, typeSet: AllowedTypeSet): MapTree;
+/**
+ * Transforms an input {@link TreeField} tree to a list of {@link MapTree}s.
+ * @param data - The input tree to be converted.
+ * If the input is a sequence containing 1 or more `undefined` values, those values will be mapped as `null` if supported.
+ * Othewise, an error will be thrown.
+ * @param globalSchema - Schema for the whole tree. Used to select the valid types when encountering `any`.
+ */
+export declare function fieldDataToMapTrees(data: InsertableTreeField, globalSchema: FlexTreeSchema, fieldSchema: TreeFieldSchema): MapTree[];
+/**
+ * @returns all types for which the data is schema-compatible.
+ */
+export declare function getPossibleTypes(globalSchema: FlexTreeSchema, typeSet: AllowedTypeSet, data: ContextuallyTypedNodeData): TreeNodeSchema[];
+/**
+ * Content of a tree which needs external schema information to interpret.
+ *
+ * This format is intended for concise authoring of tree literals when the schema is statically known.
+ *
+ * Once schema aware APIs are implemented, they can be used to provide schema specific subsets of this type.
+ */
+export type ContextuallyTypedNodeData = ContextuallyTypedNodeDataObject | number | string | boolean | null | readonly ContextuallyTypedNodeData[];
+/**
+ * Content of a field which needs external schema information to interpret.
+ *
+ * This format is intended for concise authoring of tree literals when the schema is statically known.
+ *
+ * Once schema aware APIs are implemented, they can be used to provide schema specific subsets of this type.
+ */
+export type ContextuallyTypedFieldData = ContextuallyTypedNodeData | undefined;
+/**
+ * Object case of {@link ContextuallyTypedNodeData}.
+ */
+export interface ContextuallyTypedNodeDataObject {
+    /**
+     * The type of the node.
+     * If this node is well-formed, it must follow this schema.
+     */
+    readonly [typeNameSymbol]?: string;
+    /**
+     * Fields of this node, indexed by their field keys.
+     *
+     * Allow explicit undefined for compatibility with EditableTree, and type-safety on read.
+     */
+    [key: FieldKey]: ContextuallyTypedFieldData;
+    /**
+     * Fields of this node, indexed by their field keys as strings.
+     *
+     * Allow unbranded field keys as a convenience for literals.
+     */
+    [key: string]: ContextuallyTypedFieldData;
+}
+//# sourceMappingURL=toMapTree.d.ts.map

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

@@ -0,0 +1 @@

+ {"version":3,"file":"toMapTree.d.ts","sourceRoot":"","sources":["../../src/simple-tree/toMapTree.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAMH,OAAO,EAAY,KAAK,QAAQ,EAAE,KAAK,OAAO,EAAE,MAAM,SAAS,CAAC;AAIhE,OAAO,EAIN,KAAK,cAAc,EAGnB,KAAK,cAAc,EACnB,cAAc,EACd,KAAK,cAAc,EACnB,eAAe,EAOf,cAAc,EACd,MAAM,sBAAsB,CAAC;AAE9B,OAAO,EAAE,mBAAmB,EAAE,mBAAmB,EAAE,MAAM,cAAc,CAAC;AAExE;;;;;;;;;GASG;AAEH;;;;;;;GAOG;AACH,wBAAgB,kBAAkB,CACjC,IAAI,EAAE,mBAAmB,CAAC,cAAc,CAAC,EACzC,YAAY,EAAE,cAAc,EAC5B,OAAO,EAAE,cAAc,GACrB,cAAc,CAAC,OAAO,CAAC,GAAG,SAAS,CAMrC;AAED;;;;GAIG;AACH,wBAAgB,mBAAmB,CAClC,IAAI,EAAE,mBAAmB,EACzB,YAAY,EAAE,cAAc,EAC5B,WAAW,EAAE,eAAe,GAC1B,cAAc,CAAC,OAAO,CAAC,CAGzB;AAED;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAgB,iBAAiB,CAChC,IAAI,EAAE,mBAAmB,CAAC,cAAc,CAAC,EACzC,YAAY,EAAE,cAAc,EAC5B,OAAO,EAAE,cAAc,GACrB,OAAO,CA4BT;AAED;;;;;;GAMG;AACH,wBAAgB,mBAAmB,CAClC,IAAI,EAAE,mBAAmB,EACzB,YAAY,EAAE,cAAc,EAC5B,WAAW,EAAE,eAAe,GAC1B,OAAO,EAAE,CAkCX;AAgLD;;GAEG;AACH,wBAAgB,gBAAgB,CAC/B,YAAY,EAAE,cAAc,EAC5B,OAAO,EAAE,cAAc,EACvB,IAAI,EAAE,yBAAyB,oBAY/B;AA4CD;;;;;;GAMG;AACH,MAAM,MAAM,yBAAyB,GAClC,+BAA+B,GAC/B,MAAM,GACN,MAAM,GACN,OAAO,GAEP,IAAI,GACJ,SAAS,yBAAyB,EAAE,CAAC;AAExC;;;;;;GAMG;AACH,MAAM,MAAM,0BAA0B,GAAG,yBAAyB,GAAG,SAAS,CAAC;AAE/E;;GAEG;AACH,MAAM,WAAW,+BAA+B;IAC/C;;;OAGG;IACH,QAAQ,CAAC,CAAC,cAAc,CAAC,CAAC,EAAE,MAAM,CAAC;IAEnC;;;;OAIG;IAEH,CAAC,GAAG,EAAE,QAAQ,GAAG,0BAA0B,CAAC;IAE5C;;;;OAIG;IACH,CAAC,GAAG,EAAE,MAAM,GAAG,0BAA0B,CAAC;CAC1C"}