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

package/lib/simple-tree/arrayNode.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"arrayNode.js","sourceRoot":"","sources":["../../src/simple-tree/arrayNode.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,qCAAqC,CAAC;AAC7D,OAAO,EAAE,QAAQ,EAAuC,MAAM,kBAAkB,CAAC;AACjF,OAAO,EAEN,mBAAmB,EAMnB,cAAc,GACd,MAAM,+BAA+B,CAAC;AACvC,OAAO,EAGN,oBAAoB,EACpB,eAAe,EACf,uBAAuB,GACvB,MAAM,cAAc,CAAC;AACtB,OAAO,EAAE,WAAW,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAC7D,OAAO,EAAE,oBAAoB,EAAE,mBAAmB,EAAE,MAAM,oBAAoB,CAAC;AAC/E,OAAO,EACN,QAAQ,GAQR,MAAM,kBAAkB,CAAC;AAC1B,OAAO,EAAE,mBAAmB,EAAE,MAAM,gBAAgB,CAAC;AAErD,OAAO,EAAE,IAAI,EAAE,MAAM,kBAAkB,CAAC;AACxC,OAAO,EAAE,aAAa,EAAE,MAAM,mBAAmB,CAAC;AAClD,OAAO,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,cAAc,CAAC;AA+KrD;;;GAGG;AACH,MAAM,CAAC,MAAM,aAAa,GAAG;IAC5B;;;;;;;;;OASG;IACH,MAAM,EAAE,CAAI,OAAoB,EAAE,EAAE,CAAC,MAAM,CAAC,OAAO,CAAC;CACpD,CAAC;AAEF;;;GAGG;AACH,IAAI,MAAgE,CAAC;AAErE;;;;GAIG;AACH,MAAM,OAAO,wBAAwB;IAKpC,YAAqC,OAAoB;QAApB,YAAO,GAAP,OAAO,CAAa;IAAG,CAAC;IAE7D;;OAEG;IACI,CAAC,MAAM,CAAC,QAAQ,CAAC;QACvB,OAAO,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC;IACxC,CAAC;CACD;AAZA;IACC,MAAM,GAAG,CAAK,OAAqB,EAAE,EAAE,CAAC,IAAI,wBAAwB,CAAC,OAAO,CAAC,CAAC;AAC/E,CAAC,GAAA,CAAA;AAYF;;GAEG;AACH,SAAS,gBAAgB,CACxB,SAAwB;IAExB,OAAO,WAAW,CAAC,SAAS,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAkC,CAAC;AACnF,CAAC;AAED,gGAAgG;AAChG,8DAA8D;AAC9D,SAAS,iCAAiC,CACzC,OAAqF,EACrF,aAAsD;IAEtD,OAAO,uBAAuB,CAC7B,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAuB,EAAE,CAC1C,CAAC,YAAY,wBAAwB,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAC3D,EACD,aAAa,CAAC,OAAO,CAAC,MAAM,CAC5B,CAAC;AACH,CAAC;AAED,8CAA8C;AAE9C,2FAA2F;AAE3F;;GAEG;AACH,MAAM,4BAA4B,GAA0B;IAC3D,4FAA4F;IAC5F,+GAA+G;IAC/G,qFAAqF;IACrF,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE;QAClB,KAAK,EAAE,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,QAAQ,CAAC;KACvC;IACD,EAAE,EAAE;QACH,KAAK,CAAsB,KAAa;YACvC,MAAM,KAAK,GAAG,gBAAgB,CAAC,IAAI,CAAC,CAAC;YACrC,MAAM,GAAG,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;YAEjC,IAAI,GAAG,KAAK,SAAS,EAAE;gBACtB,OAAO,GAAG,CAAC;aACX;YAED,OAAO,oBAAoB,CAAC,GAAG,CAAC,CAAC;QAClC,CAAC;KACD;IACD,QAAQ,EAAE;QACT,KAAK,CAEJ,KAAa,EACb,GAAG,KAAmF;YAEtF,MAAM,YAAY,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC;YACvC,MAAM,aAAa,GAAG,gBAAgB,CAAC,IAAI,CAAC,CAAC;YAE7C,MAAM,OAAO,GAAG,iCAAiC,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC;YAExE,MAAM,gBAAgB,GAAG,mBAAmB,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC;YAClE,MAAM,CAAC,gBAAgB,CAAC,IAAI,KAAK,QAAQ,CAAC,KAAK,EAAE,KAAK,CAAC,2BAA2B,CAAC,CAAC;YAEpF,MAAM,iBAAiB,GAAG,oBAAoB,CAC7C,aAAa,CAAC,MAAM,EACpB,gBAAgB,CAAC,IAA2B,CAC5C,CAAC;YAEF,aAAa,CAAC,QAAQ,CAAC,KAAK,EAAE,mBAAmB,CAAC,OAAO,EAAE,iBAAiB,CAAC,CAAC,CAAC;QAChF,CAAC;KACD;IACD,aAAa,EAAE;QACd,KAAK,CAEJ,GAAG,KAAmF;YAEtF,MAAM,YAAY,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC;YACvC,MAAM,aAAa,GAAG,gBAAgB,CAAC,IAAI,CAAC,CAAC;YAE7C,MAAM,OAAO,GAAG,iCAAiC,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC;YAExE,MAAM,gBAAgB,GAAG,mBAAmB,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC;YAClE,MAAM,CAAC,gBAAgB,CAAC,IAAI,KAAK,QAAQ,CAAC,KAAK,EAAE,KAAK,CAAC,2BAA2B,CAAC,CAAC;YAEpF,MAAM,iBAAiB,GAAG,oBAAoB,CAC7C,aAAa,CAAC,MAAM,EACpB,gBAAgB,CAAC,IAA2B,CAC5C,CAAC;YAEF,aAAa,CAAC,aAAa,CAAC,mBAAmB,CAAC,OAAO,EAAE,iBAAiB,CAAC,CAAC,CAAC;QAC9E,CAAC;KACD;IACD,WAAW,EAAE;QACZ,KAAK,CAEJ,GAAG,KAAmF;YAEtF,MAAM,YAAY,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC;YACvC,MAAM,aAAa,GAAG,gBAAgB,CAAC,IAAI,CAAC,CAAC;YAE7C,MAAM,OAAO,GAAG,iCAAiC,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC;YAExE,MAAM,gBAAgB,GAAG,mBAAmB,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC;YAClE,MAAM,CAAC,gBAAgB,CAAC,IAAI,KAAK,QAAQ,CAAC,KAAK,EAAE,KAAK,CAAC,2BAA2B,CAAC,CAAC;YAEpF,MAAM,iBAAiB,GAAG,oBAAoB,CAC7C,aAAa,CAAC,MAAM,EACpB,gBAAgB,CAAC,IAA2B,CAC5C,CAAC;YAEF,aAAa,CAAC,WAAW,CAAC,mBAAmB,CAAC,OAAO,EAAE,iBAAiB,CAAC,CAAC,CAAC;QAC5E,CAAC;KACD;IACD,QAAQ,EAAE;QACT,KAAK,CAAsB,KAAa;YACvC,gBAAgB,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QACxC,CAAC;KACD;IACD,WAAW,EAAE;QACZ,KAAK,CAAsB,KAAc,EAAE,GAAY;YACtD,gBAAgB,CAAC,IAAI,CAAC,CAAC,WAAW,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QAChD,CAAC;KACD;IACD,WAAW,EAAE;QACZ,KAAK,CAAsB,WAAmB,EAAE,MAAsB;YACrE,IAAI,MAAM,KAAK,SAAS,EAAE;gBACzB,gBAAgB,CAAC,IAAI,CAAC,CAAC,WAAW,CAAC,WAAW,EAAE,gBAAgB,CAAC,MAAM,CAAC,CAAC,CAAC;aAC1E;iBAAM;gBACN,gBAAgB,CAAC,IAAI,CAAC,CAAC,WAAW,CAAC,WAAW,CAAC,CAAC;aAChD;QACF,CAAC;KACD;IACD,SAAS,EAAE;QACV,KAAK,CAAsB,WAAmB,EAAE,MAAsB;YACrE,IAAI,MAAM,KAAK,SAAS,EAAE;gBACzB,gBAAgB,CAAC,IAAI,CAAC,CAAC,SAAS,CAAC,WAAW,EAAE,gBAAgB,CAAC,MAAM,CAAC,CAAC,CAAC;aACxE;iBAAM;gBACN,gBAAgB,CAAC,IAAI,CAAC,CAAC,SAAS,CAAC,WAAW,CAAC,CAAC;aAC9C;QACF,CAAC;KACD;IACD,WAAW,EAAE;QACZ,KAAK,CAEJ,KAAa,EACb,WAAmB,EACnB,MAAsB;YAEtB,IAAI,MAAM,KAAK,SAAS,EAAE;gBACzB,gBAAgB,CAAC,IAAI,CAAC,CAAC,WAAW,CAAC,KAAK,EAAE,WAAW,EAAE,gBAAgB,CAAC,MAAM,CAAC,CAAC,CAAC;aACjF;iBAAM;gBACN,gBAAgB,CAAC,IAAI,CAAC,CAAC,WAAW,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC;aACvD;QACF,CAAC;KACD;IACD,gBAAgB,EAAE;QACjB,KAAK,CAEJ,WAAmB,EACnB,SAAiB,EACjB,MAAsB;YAEtB,IAAI,MAAM,KAAK,SAAS,EAAE;gBACzB,gBAAgB,CAAC,IAAI,CAAC,CAAC,gBAAgB,CACtC,WAAW,EACX,SAAS,EACT,gBAAgB,CAAC,MAAM,CAAC,CACxB,CAAC;aACF;iBAAM;gBACN,gBAAgB,CAAC,IAAI,CAAC,CAAC,gBAAgB,CAAC,WAAW,EAAE,SAAS,CAAC,CAAC;aAChE;QACF,CAAC;KACD;IACD,cAAc,EAAE;QACf,KAAK,CAEJ,WAAmB,EACnB,SAAiB,EACjB,MAAsB;YAEtB,IAAI,MAAM,KAAK,SAAS,EAAE;gBACzB,gBAAgB,CAAC,IAAI,CAAC,CAAC,cAAc,CACpC,WAAW,EACX,SAAS,EACT,gBAAgB,CAAC,MAAM,CAAC,CACxB,CAAC;aACF;iBAAM;gBACN,gBAAgB,CAAC,IAAI,CAAC,CAAC,cAAc,CAAC,WAAW,EAAE,SAAS,CAAC,CAAC;aAC9D;QACF,CAAC;KACD;IACD,gBAAgB,EAAE;QACjB,KAAK,CAEJ,KAAa,EACb,WAAmB,EACnB,SAAiB,EACjB,MAAsB;YAEtB,IAAI,MAAM,KAAK,SAAS,EAAE;gBACzB,gBAAgB,CAAC,IAAI,CAAC,CAAC,gBAAgB,CACtC,KAAK,EACL,WAAW,EACX,SAAS,EACT,gBAAgB,CAAC,MAAM,CAAC,CACxB,CAAC;aACF;iBAAM;gBACN,gBAAgB,CAAC,IAAI,CAAC,CAAC,gBAAgB,CAAC,KAAK,EAAE,WAAW,EAAE,SAAS,CAAC,CAAC;aACvE;QACF,CAAC;KACD;CACD,CAAC;AAEF,sDAAsD;AAEtD,uGAAuG;AACvG,8GAA8G;AAC9G,8FAA8F;AAC9F,EAAE;AACF,sGAAsG;AACtG,sDAAsD;AAEtD,kGAAkG;AAClG,6BAA6B;AAC7B;IACC,KAAK,CAAC,SAAS,CAAC,MAAM;IACtB,8BAA8B;IAC9B,KAAK,CAAC,SAAS,CAAC,OAAO;IACvB,KAAK,CAAC,SAAS,CAAC,KAAK;IACrB,wBAAwB;IACxB,KAAK,CAAC,SAAS,CAAC,MAAM;IACtB,KAAK,CAAC,SAAS,CAAC,IAAI;IACpB,KAAK,CAAC,SAAS,CAAC,SAAS;IACzB,KAAK,CAAC,SAAS,CAAC,IAAI;IACpB,KAAK,CAAC,SAAS,CAAC,OAAO;IACvB,KAAK,CAAC,SAAS,CAAC,OAAO;IACvB,KAAK,CAAC,SAAS,CAAC,QAAQ;IACxB,KAAK,CAAC,SAAS,CAAC,OAAO;IACvB,KAAK,CAAC,SAAS,CAAC,IAAI;IACpB,KAAK,CAAC,SAAS,CAAC,IAAI;IACpB,KAAK,CAAC,SAAS,CAAC,WAAW;IAC3B,0BAA0B;IAC1B,KAAK,CAAC,SAAS,CAAC,GAAG;IACnB,uBAAuB;IACvB,wBAAwB;IACxB,KAAK,CAAC,SAAS,CAAC,MAAM;IACtB,KAAK,CAAC,SAAS,CAAC,WAAW;IAC3B,2BAA2B;IAC3B,yBAAyB;IACzB,KAAK,CAAC,SAAS,CAAC,KAAK;IACrB,KAAK,CAAC,SAAS,CAAC,IAAI;IACpB,wBAAwB;IACxB,0BAA0B;IAC1B,KAAK,CAAC,SAAS,CAAC,cAAc;IAC9B,KAAK,CAAC,SAAS,CAAC,QAAQ;IACxB,2BAA2B;IAC3B,KAAK,CAAC,SAAS,CAAC,MAAM;CACtB,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE;IAChB,4BAA4B,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC;AACvD,CAAC,CAAC,CAAC;AAEH,qDAAqD;AAErD,MAAM,kBAAkB,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,SAAS,EAAE,4BAA4B,CAAC,CAAC;AAEzF,aAAa;AAEb;;GAEG;AACH,SAAS,OAAO,CAAC,GAAoB,EAAE,MAAc;IACpD,IAAI,OAAO,GAAG,KAAK,QAAQ,EAAE;QAC5B,oFAAoF;QACpF,mEAAmE;QACnE,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;QAE7B,uEAAuE;QACvE,IAAI,MAAM,CAAC,SAAS,CAAC,QAAQ,CAAC,EAAE;YAC/B,OAAO,CAAC,IAAI,QAAQ,IAAI,QAAQ,GAAG,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC;SACjE;KACD;AACF,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,oBAAoB,CAC5B,yBAAkC,EAClC,kBAA2B;IAE3B,MAAM,YAAY,GAAG,kBAAkB,IAAI,EAAE,CAAC;IAE9C,sGAAsG;IACtG,8FAA8F;IAC9F,qFAAqF;IACrF,4CAA4C;IAC5C,EAAE;IACF,6FAA6F;IAC7F,MAAM,QAAQ,GACb,kBAAkB;QAClB,MAAM,CAAC,MAAM,CAAC,kBAAkB,EAAE;YACjC,uJAAuJ;YACvJ,MAAM,EAAE;gBACP,GAAG;oBACF,IAAI,CAAC,+BAA+B,CAAC,CAAC;gBACvC,CAAC;gBACD,GAAG;oBACF,IAAI,CAAC,+BAA+B,CAAC,CAAC;gBACvC,CAAC;gBACD,UAAU,EAAE,KAAK;gBACjB,YAAY,EAAE,KAAK;aACnB;SACD,CAAC,CAAC;IAEJ,oGAAoG;IACpG,sGAAsG;IACtG,oGAAoG;IACpG,MAAM,KAAK,GAAkB,IAAI,KAAK,CAAgB,YAAmB,EAAE;QAC1E,GAAG,EAAE,CAAC,MAAM,EAAE,GAAG,EAAE,EAAE;YACpB,MAAM,KAAK,GAAG,gBAAgB,CAAC,KAAK,CAAC,CAAC;YACtC,MAAM,UAAU,GAAG,OAAO,CAAC,GAAG,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;YAE9C,IAAI,UAAU,KAAK,SAAS,EAAE;gBAC7B,IAAI,GAAG,KAAK,QAAQ,EAAE;oBACrB,OAAO,KAAK,CAAC,MAAM,CAAC;iBACpB;gBAED,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,IAAI,GAAG,KAAK,QAAQ,EAAE;gBACrB,sHAAsH;gBACtH,4HAA4H;gBAC5H,mDAAmD;gBACnD,wFAAwF;gBACxF,OAAO,KAAK,CAAC;aACb;YAED,wFAAwF;YACxF,iFAAiF;YACjF,IAAI,GAAG,KAAK,MAAM,CAAC,kBAAkB,EAAE;gBACtC,OAAO,OAAO,CAAC,GAAG,CAAC,QAAQ,EAAE,GAAG,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC;aACnD;YAED,MAAM,KAAK,GAAG,gBAAgB,CAAC,KAAK,CAAC,CAAC;YACtC,MAAM,UAAU,GAAG,OAAO,CAAC,GAAG,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;YAC9C,IAAI,UAAU,KAAK,SAAS,EAAE;gBAC7B,mHAAmH;gBACnH,OAAO,KAAK,CAAC;aACb;YACD,OAAO,yBAAyB,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,GAAG,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;QAC/E,CAAC;QACD,GAAG,EAAE,CAAC,MAAM,EAAE,GAAG,EAAE,EAAE;YACpB,MAAM,KAAK,GAAG,gBAAgB,CAAC,KAAK,CAAC,CAAC;YACtC,MAAM,UAAU,GAAG,OAAO,CAAC,GAAG,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;YAC9C,OAAO,UAAU,KAAK,SAAS,IAAI,OAAO,CAAC,GAAG,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;QAC/D,CAAC;QACD,OAAO,EAAE,CAAC,MAAM,EAAE,EAAE;YACnB,MAAM,KAAK,GAAG,gBAAgB,CAAC,KAAK,CAAC,CAAC;YAEtC,+EAA+E;YAC/E,mEAAmE;YACnE,MAAM,IAAI,GAAwB,KAAK,CAAC,IAAI,CAC3C,EAAE,MAAM,EAAE,KAAK,CAAC,MAAM,EAAE,EACxB,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC,GAAG,KAAK,EAAE,CACxB,CAAC;YAEF,IAAI,yBAAyB,EAAE;gBAC9B,IAAI,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC;aACtC;iBAAM;gBACN,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;aACpB;YACD,OAAO,IAAI,CAAC;QACb,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,KAAK,CAAC,MAAM;oBACnB,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;;;;GAIG;AACH,MAAM,UAAU,WAAW,CAK1B,IAOC,EACD,YAAqB;IAErB,8EAA8E;IAC9E,4FAA4F;IAC5F,MAAM,MAAO,SAAQ,IAAI;QACxB,YAAmB,KAA8D;YAChF,KAAK,CAAC,KAAK,CAAC,CAAC;YAEb,MAAM,WAAW,GAAG,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC;YAEpD,IAAI,YAAY,EAAE;gBACjB,4JAA4J;gBAC5J,kEAAkE;gBAClE,MAAM,CAAC,cAAc,CAAC,IAAI,EAAE,QAAQ,EAAE;oBACrC,KAAK,EAAE,GAAG;oBACV,QAAQ,EAAE,IAAI;oBACd,UAAU,EAAE,KAAK;oBACjB,YAAY,EAAE,KAAK;iBACnB,CAAC,CAAC;aACH;YAED,MAAM,UAAU,GAAG,aAAa,CAAC,IAAI,CAAC,WAA6B,CAAC,CAAC;YACrE,MAAM,CAAC,UAAU,YAAY,mBAAmB,EAAE,KAAK,CAAC,yBAAyB,CAAC,CAAC;YACnF,MAAM,QAAQ,GAAiB,cAAc,CAAC,KAAK,CAAC;gBACnD,CAAC,CAAC,KAAK;gBACP,CAAC,CAAC,IAAI,YAAY,CAAC,UAAU,EAAE,WAAW,CAAC,UAAU,CAAC,IAAI,EAAE,KAAK,CAAW,CAAC,CAAC;YAE/E,MAAM,KAAK,GAAa,oBAAoB,CAAC,YAAY,EAAE,WAAW,CAAC,CAAC;YACxE,WAAW,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;YAC7B,OAAO,KAA0B,CAAC;QACnC,CAAC;KACD;IAED,4BAA4B;IAC5B,MAAM,CAAC,gBAAgB,CAAC,MAAM,CAAC,SAAS,EAAE,4BAA4B,CAAC,CAAC;IAExE,OAAO,MAON,CAAC;AACH,CAAC;AAED;;GAEG;AACH,MAAM,YACL,SAAQ,WAAuC;IAG/C,IAAW,OAAO;QACjB,MAAM,QAAQ,CAAC,kCAAkC,CAAC,CAAC;IACpD,CAAC;IAED,IAAW,YAAY;QACtB,MAAM,QAAQ,CAAC,wCAAwC,CAAC,CAAC;IAC1D,CAAC;CACD;AAED,SAAS,WAAW,CAAI,QAAkC,EAAE,OAAoB;IAC/E,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACjC,eAAe,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;IAChC,OAAO,IAAI,CAAC;AACb,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { assert } from \"@fluidframework/core-utils/internal\";\nimport { EmptyKey, TreeNodeSchemaIdentifier, TreeValue } from \"../core/index.js\";\nimport {\n\tFlexAllowedTypes,\n\tFlexFieldNodeSchema,\n\tFlexTreeFieldNode,\n\tFlexTreeNode,\n\tFlexTreeSequenceField,\n\tFlexTreeTypedField,\n\tFlexTreeUnboxField,\n\tisFlexTreeNode,\n} from \"../feature-libraries/index.js\";\nimport {\n\tFactoryContent,\n\tInsertableContent,\n\tgetOrCreateNodeProxy,\n\tmarkContentType,\n\tprepareContentForInsert,\n} from \"./proxies.js\";\nimport { getFlexNode, setFlexNode } from \"./proxyBinding.js\";\nimport { getSimpleFieldSchema, getSimpleNodeSchema } from \"./schemaCaching.js\";\nimport {\n\tNodeKind,\n\ttype ImplicitAllowedTypes,\n\ttype InsertableTreeNodeFromImplicitAllowedTypes,\n\ttype TreeNodeFromImplicitAllowedTypes,\n\tImplicitFieldSchema,\n\tTreeNodeSchemaClass,\n\tWithType,\n\tTreeNodeSchema,\n} from \"./schemaTypes.js\";\nimport { cursorFromFieldData } from \"./toMapTree.js\";\nimport { TreeNode } from \"./types.js\";\nimport { fail } from \"../util/index.js\";\nimport { getFlexSchema } from \"./toFlexSchema.js\";\nimport { RawTreeNode, rawError } from \"./rawNode.js\";\n\n/**\n * A generic array type, used to defined types like {@link (TreeArrayNode:interface)}.\n *\n * @privateRemarks\n * Inlining this into TreeArrayNode causes recursive array use to stop compiling.\n *\n * @public\n */\nexport interface TreeArrayNodeBase<out T, in TNew, in TMoveFrom>\n\textends ReadonlyArray<T>,\n\t\tTreeNode {\n\t/**\n\t * Inserts new item(s) at a specified location.\n\t * @param index - The index at which to insert `value`.\n\t * @param value - The content to insert.\n\t * @throws Throws if `index` is not in the range [0, `array.length`).\n\t */\n\tinsertAt(index: number, ...value: (TNew | IterableTreeArrayContent<TNew>)[]): void;\n\n\t/**\n\t * Inserts new item(s) at the start of the array.\n\t * @param value - The content to insert.\n\t */\n\tinsertAtStart(...value: (TNew | IterableTreeArrayContent<TNew>)[]): void;\n\n\t/**\n\t * Inserts new item(s) at the end of the array.\n\t * @param value - The content to insert.\n\t */\n\tinsertAtEnd(...value: (TNew | IterableTreeArrayContent<TNew>)[]): void;\n\n\t/**\n\t * Removes the item at the specified location.\n\t * @param index - The index at which to remove the item.\n\t * @throws Throws if `index` is not in the range [0, `array.length`).\n\t */\n\tremoveAt(index: number): void;\n\n\t/**\n\t * Removes all items between the specified indices.\n\t * @param start - The starting index of the range to remove (inclusive). Defaults to the start of the array.\n\t * @param end - The ending index of the range to remove (exclusive).\n\t * @throws Throws if `start` is not in the range [0, `array.length`).\n\t * @throws Throws if `end` is less than `start`.\n\t * If `end` is not supplied or is greater than the length of the array, all items after `start` are removed.\n\t */\n\tremoveRange(start?: number, end?: number): void;\n\n\t/**\n\t * Moves the specified item to the start of the array.\n\t * @param sourceIndex - The index of the item to move.\n\t * @throws Throws if `sourceIndex` is not in the range [0, `array.length`).\n\t */\n\tmoveToStart(sourceIndex: number): void;\n\n\t/**\n\t * Moves the specified item to the start of the array.\n\t * @param sourceIndex - The index of the item to move.\n\t * @param source - The source array to move the item out of.\n\t * @throws Throws if `sourceIndex` is not in the range [0, `array.length`).\n\t */\n\tmoveToStart(sourceIndex: number, source: TMoveFrom): void;\n\n\t/**\n\t * Moves the specified item to the end of the array.\n\t * @param sourceIndex - The index of the item to move.\n\t * @throws Throws if `sourceIndex` is not in the range [0, `array.length`).\n\t */\n\tmoveToEnd(sourceIndex: number): void;\n\n\t/**\n\t * Moves the specified item to the end of the array.\n\t * @param sourceIndex - The index of the item to move.\n\t * @param source - The source array to move the item out of.\n\t * @throws Throws if `sourceIndex` is not in the range [0, `array.length`).\n\t */\n\tmoveToEnd(sourceIndex: number, source: TMoveFrom): void;\n\n\t/**\n\t * Moves the specified item to the desired location in the array.\n\t * @param index - The index to move the item to.\n\t * This is based on the state of the array before moving the source item.\n\t * @param sourceIndex - The index of the item to move.\n\t * @throws Throws if any of the input indices are not in the range [0, `array.length`).\n\t */\n\tmoveToIndex(index: number, sourceIndex: number): void;\n\n\t/**\n\t * Moves the specified item to the desired location in the array.\n\t * @param index - The index to move the item to.\n\t * @param sourceIndex - The index of the item to move.\n\t * @param source - The source array to move the item out of.\n\t * @throws Throws if any of the input indices are not in the range [0, `array.length`).\n\t */\n\tmoveToIndex(index: number, sourceIndex: number, source: TMoveFrom): void;\n\n\t/**\n\t * Moves the specified items to the start of the array.\n\t * @param sourceStart - The starting index of the range to move (inclusive).\n\t * @param sourceEnd - The ending index of the range to move (exclusive)\n\t * @throws Throws if either of the input indices are not in the range [0, `array.length`) or if `sourceStart` is greater than `sourceEnd`.\n\t */\n\tmoveRangeToStart(sourceStart: number, sourceEnd: number): void;\n\n\t/**\n\t * Moves the specified items to the start of the array.\n\t * @param sourceStart - The starting index of the range to move (inclusive).\n\t * @param sourceEnd - The ending index of the range to move (exclusive)\n\t * @param source - The source array to move items out of.\n\t * @throws Throws if the types of any of the items being moved are not allowed in the destination array,\n\t * if either of the input indices are not in the range [0, `array.length`) or if `sourceStart` is greater than `sourceEnd`.\n\t */\n\tmoveRangeToStart(sourceStart: number, sourceEnd: number, source: TMoveFrom): void;\n\n\t/**\n\t * Moves the specified items to the end of the array.\n\t * @param sourceStart - The starting index of the range to move (inclusive).\n\t * @param sourceEnd - The ending index of the range to move (exclusive)\n\t * @throws Throws if either of the input indices are not in the range [0, `array.length`) or if `sourceStart` is greater than `sourceEnd`.\n\t */\n\tmoveRangeToEnd(sourceStart: number, sourceEnd: number): void;\n\n\t/**\n\t * Moves the specified items to the end of the array.\n\t * @param sourceStart - The starting index of the range to move (inclusive).\n\t * @param sourceEnd - The ending index of the range to move (exclusive)\n\t * @param source - The source array to move items out of.\n\t * @throws Throws if the types of any of the items being moved are not allowed in the destination array,\n\t * if either of the input indices are not in the range [0, `array.length`) or if `sourceStart` is greater than `sourceEnd`.\n\t */\n\tmoveRangeToEnd(sourceStart: number, sourceEnd: number, source: TMoveFrom): void;\n\n\t/**\n\t * Moves the specified items to the desired location within the array.\n\t * @param index - The index to move the items to.\n\t * This is based on the state of the array before moving the source items.\n\t * @param sourceStart - The starting index of the range to move (inclusive).\n\t * @param sourceEnd - The ending index of the range to move (exclusive)\n\t * @throws Throws if any of the input indices are not in the range [0, `array.length`) or if `sourceStart` is greater than `sourceEnd`.\n\t */\n\tmoveRangeToIndex(index: number, sourceStart: number, sourceEnd: number): void;\n\n\t/**\n\t * Moves the specified items to the desired location within the array.\n\t * @param index - The index to move the items to.\n\t * @param sourceStart - The starting index of the range to move (inclusive).\n\t * @param sourceEnd - The ending index of the range to move (exclusive)\n\t * @param source - The source array to move items out of.\n\t * @throws Throws if the types of any of the items being moved are not allowed in the destination array,\n\t * if any of the input indices are not in the range [0, `array.length`) or if `sourceStart` is greater than `sourceEnd`.\n\t */\n\tmoveRangeToIndex(\n\t\tindex: number,\n\t\tsourceStart: number,\n\t\tsourceEnd: number,\n\t\tsource: TMoveFrom,\n\t): void;\n}\n\n/**\n * A {@link TreeNode} which implements 'readonly T[]' and the array mutation APIs.\n *\n * @typeParam TAllowedTypes - Schema for types which are allowed as members of this array.\n *\n * @public\n */\nexport interface TreeArrayNode<TAllowedTypes extends ImplicitAllowedTypes = ImplicitAllowedTypes>\n\textends TreeArrayNodeBase<\n\t\tTreeNodeFromImplicitAllowedTypes<TAllowedTypes>,\n\t\tInsertableTreeNodeFromImplicitAllowedTypes<TAllowedTypes>,\n\t\tTreeArrayNode\n\t> {}\n\n/**\n * A {@link TreeNode} which implements 'readonly T[]' and the array mutation APIs.\n * @public\n */\nexport const TreeArrayNode = {\n\t/**\n\t * Wrap an iterable of items to inserted as consecutive items in a array.\n\t * @remarks\n\t * The object returned by this function can be inserted into a {@link (TreeArrayNode:interface)}.\n\t * Its contents will be inserted consecutively in the corresponding location in the array.\n\t * @example\n\t * ```ts\n\t * array.insertAtEnd(TreeArrayNode.spread(iterable))\n\t * ```\n\t */\n\tspread: <T>(content: Iterable<T>) => create(content),\n};\n\n/**\n * Package internal construction API.\n * Use {@link (TreeArrayNode:variable).spread} to create an instance of this type instead.\n */\nlet create: <T>(content: Iterable<T>) => IterableTreeArrayContent<T>;\n\n/**\n * Used to insert iterable content into a {@link (TreeArrayNode:interface)}.\n * Use {@link (TreeArrayNode:variable).spread} to create an instance of this type.\n * @public\n */\nexport class IterableTreeArrayContent<T> implements Iterable<T> {\n\tstatic {\n\t\tcreate = <T2>(content: Iterable<T2>) => new IterableTreeArrayContent(content);\n\t}\n\n\tprivate constructor(private readonly content: Iterable<T>) {}\n\n\t/**\n\t * Iterates over content for nodes to insert.\n\t */\n\tpublic [Symbol.iterator](): Iterator<T> {\n\t\treturn this.content[Symbol.iterator]();\n\t}\n}\n\n/**\n * Given a array node proxy, returns its underlying LazySequence field.\n */\nfunction getSequenceField<TTypes extends FlexAllowedTypes>(\n\tarrayNode: TreeArrayNode,\n): FlexTreeSequenceField<TTypes> {\n\treturn getFlexNode(arrayNode).getBoxed(EmptyKey) as FlexTreeSequenceField<TTypes>;\n}\n\n// Used by 'insert*()' APIs to converts new content (expressed as a proxy union) to contextually\n// typed data prior to forwarding to 'LazySequence.insert*()'.\nfunction contextualizeInsertedArrayContent(\n\tcontent: readonly (InsertableContent | IterableTreeArrayContent<InsertableContent>)[],\n\tsequenceField: FlexTreeSequenceField<FlexAllowedTypes>,\n): FactoryContent {\n\treturn prepareContentForInsert(\n\t\tcontent.flatMap((c): InsertableContent[] =>\n\t\t\tc instanceof IterableTreeArrayContent ? Array.from(c) : [c],\n\t\t),\n\t\tsequenceField.context.forest,\n\t);\n}\n\n// #region Create dispatch map for array nodes\n\n// TODO: Experiment with alternative dispatch methods to see if we can improve performance.\n\n/**\n * PropertyDescriptorMap used to build the prototype for our array node dispatch object.\n */\nconst arrayNodePrototypeProperties: PropertyDescriptorMap = {\n\t// We manually add [Symbol.iterator] to the dispatch map rather than use '[fn.name] = fn' as\n\t// below when adding 'Array.prototype.*' properties to this map because 'Array.prototype[Symbol.iterator].name'\n\t// returns \"values\" (i.e., Symbol.iterator is an alias for the '.values()' function.)\n\t[Symbol.iterator]: {\n\t\tvalue: Array.prototype[Symbol.iterator],\n\t},\n\tat: {\n\t\tvalue(this: TreeArrayNode, index: number): TreeNode | TreeValue | undefined {\n\t\t\tconst field = getSequenceField(this);\n\t\t\tconst val = field.boxedAt(index);\n\n\t\t\tif (val === undefined) {\n\t\t\t\treturn val;\n\t\t\t}\n\n\t\t\treturn getOrCreateNodeProxy(val);\n\t\t},\n\t},\n\tinsertAt: {\n\t\tvalue(\n\t\t\tthis: TreeArrayNode,\n\t\t\tindex: number,\n\t\t\t...value: readonly (InsertableContent | IterableTreeArrayContent<InsertableContent>)[]\n\t\t): void {\n\t\t\tconst sequenceNode = getFlexNode(this);\n\t\t\tconst sequenceField = getSequenceField(this);\n\n\t\t\tconst content = contextualizeInsertedArrayContent(value, sequenceField);\n\n\t\t\tconst simpleNodeSchema = getSimpleNodeSchema(sequenceNode.schema);\n\t\t\tassert(simpleNodeSchema.kind === NodeKind.Array, 0x912 /* Expected array schema */);\n\n\t\t\tconst simpleFieldSchema = getSimpleFieldSchema(\n\t\t\t\tsequenceField.schema,\n\t\t\t\tsimpleNodeSchema.info as ImplicitFieldSchema,\n\t\t\t);\n\n\t\t\tsequenceField.insertAt(index, cursorFromFieldData(content, simpleFieldSchema));\n\t\t},\n\t},\n\tinsertAtStart: {\n\t\tvalue(\n\t\t\tthis: TreeArrayNode,\n\t\t\t...value: readonly (InsertableContent | IterableTreeArrayContent<InsertableContent>)[]\n\t\t): void {\n\t\t\tconst sequenceNode = getFlexNode(this);\n\t\t\tconst sequenceField = getSequenceField(this);\n\n\t\t\tconst content = contextualizeInsertedArrayContent(value, sequenceField);\n\n\t\t\tconst simpleNodeSchema = getSimpleNodeSchema(sequenceNode.schema);\n\t\t\tassert(simpleNodeSchema.kind === NodeKind.Array, 0x913 /* Expected array schema */);\n\n\t\t\tconst simpleFieldSchema = getSimpleFieldSchema(\n\t\t\t\tsequenceField.schema,\n\t\t\t\tsimpleNodeSchema.info as ImplicitFieldSchema,\n\t\t\t);\n\n\t\t\tsequenceField.insertAtStart(cursorFromFieldData(content, simpleFieldSchema));\n\t\t},\n\t},\n\tinsertAtEnd: {\n\t\tvalue(\n\t\t\tthis: TreeArrayNode,\n\t\t\t...value: readonly (InsertableContent | IterableTreeArrayContent<InsertableContent>)[]\n\t\t): void {\n\t\t\tconst sequenceNode = getFlexNode(this);\n\t\t\tconst sequenceField = getSequenceField(this);\n\n\t\t\tconst content = contextualizeInsertedArrayContent(value, sequenceField);\n\n\t\t\tconst simpleNodeSchema = getSimpleNodeSchema(sequenceNode.schema);\n\t\t\tassert(simpleNodeSchema.kind === NodeKind.Array, 0x914 /* Expected array schema */);\n\n\t\t\tconst simpleFieldSchema = getSimpleFieldSchema(\n\t\t\t\tsequenceField.schema,\n\t\t\t\tsimpleNodeSchema.info as ImplicitFieldSchema,\n\t\t\t);\n\n\t\t\tsequenceField.insertAtEnd(cursorFromFieldData(content, simpleFieldSchema));\n\t\t},\n\t},\n\tremoveAt: {\n\t\tvalue(this: TreeArrayNode, index: number): void {\n\t\t\tgetSequenceField(this).removeAt(index);\n\t\t},\n\t},\n\tremoveRange: {\n\t\tvalue(this: TreeArrayNode, start?: number, end?: number): void {\n\t\t\tgetSequenceField(this).removeRange(start, end);\n\t\t},\n\t},\n\tmoveToStart: {\n\t\tvalue(this: TreeArrayNode, sourceIndex: number, source?: TreeArrayNode): void {\n\t\t\tif (source !== undefined) {\n\t\t\t\tgetSequenceField(this).moveToStart(sourceIndex, getSequenceField(source));\n\t\t\t} else {\n\t\t\t\tgetSequenceField(this).moveToStart(sourceIndex);\n\t\t\t}\n\t\t},\n\t},\n\tmoveToEnd: {\n\t\tvalue(this: TreeArrayNode, sourceIndex: number, source?: TreeArrayNode): void {\n\t\t\tif (source !== undefined) {\n\t\t\t\tgetSequenceField(this).moveToEnd(sourceIndex, getSequenceField(source));\n\t\t\t} else {\n\t\t\t\tgetSequenceField(this).moveToEnd(sourceIndex);\n\t\t\t}\n\t\t},\n\t},\n\tmoveToIndex: {\n\t\tvalue(\n\t\t\tthis: TreeArrayNode,\n\t\t\tindex: number,\n\t\t\tsourceIndex: number,\n\t\t\tsource?: TreeArrayNode,\n\t\t): void {\n\t\t\tif (source !== undefined) {\n\t\t\t\tgetSequenceField(this).moveToIndex(index, sourceIndex, getSequenceField(source));\n\t\t\t} else {\n\t\t\t\tgetSequenceField(this).moveToIndex(index, sourceIndex);\n\t\t\t}\n\t\t},\n\t},\n\tmoveRangeToStart: {\n\t\tvalue(\n\t\t\tthis: TreeArrayNode,\n\t\t\tsourceStart: number,\n\t\t\tsourceEnd: number,\n\t\t\tsource?: TreeArrayNode,\n\t\t): void {\n\t\t\tif (source !== undefined) {\n\t\t\t\tgetSequenceField(this).moveRangeToStart(\n\t\t\t\t\tsourceStart,\n\t\t\t\t\tsourceEnd,\n\t\t\t\t\tgetSequenceField(source),\n\t\t\t\t);\n\t\t\t} else {\n\t\t\t\tgetSequenceField(this).moveRangeToStart(sourceStart, sourceEnd);\n\t\t\t}\n\t\t},\n\t},\n\tmoveRangeToEnd: {\n\t\tvalue(\n\t\t\tthis: TreeArrayNode,\n\t\t\tsourceStart: number,\n\t\t\tsourceEnd: number,\n\t\t\tsource?: TreeArrayNode,\n\t\t): void {\n\t\t\tif (source !== undefined) {\n\t\t\t\tgetSequenceField(this).moveRangeToEnd(\n\t\t\t\t\tsourceStart,\n\t\t\t\t\tsourceEnd,\n\t\t\t\t\tgetSequenceField(source),\n\t\t\t\t);\n\t\t\t} else {\n\t\t\t\tgetSequenceField(this).moveRangeToEnd(sourceStart, sourceEnd);\n\t\t\t}\n\t\t},\n\t},\n\tmoveRangeToIndex: {\n\t\tvalue(\n\t\t\tthis: TreeArrayNode,\n\t\t\tindex: number,\n\t\t\tsourceStart: number,\n\t\t\tsourceEnd: number,\n\t\t\tsource?: TreeArrayNode,\n\t\t): void {\n\t\t\tif (source !== undefined) {\n\t\t\t\tgetSequenceField(this).moveRangeToIndex(\n\t\t\t\t\tindex,\n\t\t\t\t\tsourceStart,\n\t\t\t\t\tsourceEnd,\n\t\t\t\t\tgetSequenceField(source),\n\t\t\t\t);\n\t\t\t} else {\n\t\t\t\tgetSequenceField(this).moveRangeToIndex(index, sourceStart, sourceEnd);\n\t\t\t}\n\t\t},\n\t},\n};\n\n/* eslint-disable @typescript-eslint/unbound-method */\n\n// For compatibility, we are initially implement 'readonly T[]' by applying the Array.prototype methods\n// to the array node proxy.  Over time, we should replace these with efficient implementations on LazySequence\n// to avoid re-entering the proxy as these methods access 'length' and the indexed properties.\n//\n// For brevity, the current implementation dynamically builds a property descriptor map from a list of\n// Array functions we want to re-expose via the proxy.\n\n// TODO: This assumes 'Function.name' matches the property name on 'Array.prototype', which may be\n// dubious across JS engines.\n[\n\tArray.prototype.concat,\n\t// Array.prototype.copyWithin,\n\tArray.prototype.entries,\n\tArray.prototype.every,\n\t// Array.prototype.fill,\n\tArray.prototype.filter,\n\tArray.prototype.find,\n\tArray.prototype.findIndex,\n\tArray.prototype.flat,\n\tArray.prototype.flatMap,\n\tArray.prototype.forEach,\n\tArray.prototype.includes,\n\tArray.prototype.indexOf,\n\tArray.prototype.join,\n\tArray.prototype.keys,\n\tArray.prototype.lastIndexOf,\n\t// Array.prototype.length,\n\tArray.prototype.map,\n\t// Array.prototype.pop,\n\t// Array.prototype.push,\n\tArray.prototype.reduce,\n\tArray.prototype.reduceRight,\n\t// Array.prototype.reverse,\n\t// Array.prototype.shift,\n\tArray.prototype.slice,\n\tArray.prototype.some,\n\t// Array.prototype.sort,\n\t// Array.prototype.splice,\n\tArray.prototype.toLocaleString,\n\tArray.prototype.toString,\n\t// Array.prototype.unshift,\n\tArray.prototype.values,\n].forEach((fn) => {\n\tarrayNodePrototypeProperties[fn.name] = { value: fn };\n});\n\n/* eslint-enable @typescript-eslint/unbound-method */\n\nconst arrayNodePrototype = Object.create(Object.prototype, arrayNodePrototypeProperties);\n\n// #endregion\n\n/**\n * Helper to coerce property keys to integer indexes (or undefined if not an in-range integer).\n */\nfunction asIndex(key: string | symbol, length: number) {\n\tif (typeof key === \"string\") {\n\t\t// TODO: It may be worth a '0' <= ch <= '9' check before calling 'Number' to quickly\n\t\t// reject 'length' as an index, or even parsing integers ourselves.\n\t\tconst asNumber = Number(key);\n\n\t\t// TODO: See 'matrix/range.ts' for fast integer coercing + range check.\n\t\tif (Number.isInteger(asNumber)) {\n\t\t\treturn 0 <= asNumber && asNumber < length ? asNumber : undefined;\n\t\t}\n\t}\n}\n\n/**\n * @param allowAdditionalProperties - If true, setting of unexpected properties will be forwarded to the target object.\n * Otherwise setting of unexpected properties will error.\n * @param customTargetObject - Target object of the proxy.\n * If not provided `[]` is used for the target and a separate object created to dispatch array methods.\n * If provided, the customTargetObject will be used as both the dispatch object and the proxy target, and therefor must provide an own `length` value property\n * (which is not used but must exist for getOwnPropertyDescriptor invariants) and the array functionality from {@link arrayNodePrototype}.\n */\nfunction createArrayNodeProxy(\n\tallowAdditionalProperties: boolean,\n\tcustomTargetObject?: object,\n): TreeArrayNode {\n\tconst targetObject = customTargetObject ?? [];\n\n\t// Create a 'dispatch' object that this Proxy forwards to instead of the proxy target, because we need\n\t// the proxy target to be a plain JS array (see comments below when we instantiate the Proxy).\n\t// Own properties on the dispatch object are surfaced as own properties of the proxy.\n\t// (e.g., 'length', which is defined below).\n\t//\n\t// Properties normally inherited from 'Array.prototype' are surfaced via the prototype chain.\n\tconst dispatch: object =\n\t\tcustomTargetObject ??\n\t\tObject.create(arrayNodePrototype, {\n\t\t\t// This dispatch object's set of keys is used to implement `has` (for the `in` operator) for the non-numeric cases, and therefor must include `length`.\n\t\t\tlength: {\n\t\t\t\tget(this: TreeArrayNode) {\n\t\t\t\t\tfail(\"Proxy should intercept length\");\n\t\t\t\t},\n\t\t\t\tset() {\n\t\t\t\t\tfail(\"Proxy should intercept length\");\n\t\t\t\t},\n\t\t\t\tenumerable: false,\n\t\t\t\tconfigurable: false,\n\t\t\t},\n\t\t});\n\n\t// To satisfy 'deepEquals' level scrutiny, the target of the proxy must be an array literal in order\n\t// to pass 'Object.getPrototypeOf'.  It also satisfies 'Array.isArray' and 'Object.prototype.toString'\n\t// requirements without use of Array[Symbol.species], which is potentially on a path ot deprecation.\n\tconst proxy: TreeArrayNode = new Proxy<TreeArrayNode>(targetObject as any, {\n\t\tget: (target, key) => {\n\t\t\tconst field = getSequenceField(proxy);\n\t\t\tconst maybeIndex = asIndex(key, field.length);\n\n\t\t\tif (maybeIndex === undefined) {\n\t\t\t\tif (key === \"length\") {\n\t\t\t\t\treturn field.length;\n\t\t\t\t}\n\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\tif (key === \"length\") {\n\t\t\t\t// To allow \"length\" to look like \"length\" on an array, getOwnPropertyDescriptor has to report it as a writable value.\n\t\t\t\t// This means the proxy target must provide a length value, but since it can't use getters and setters, it can't be correct.\n\t\t\t\t// Therefor length has to be handled in this proxy.\n\t\t\t\t// Since its not actually mutable, return false so setting it will produce a type error.\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\t// 'Symbol.isConcatSpreadable' may be set on an Array instance to modify the behavior of\n\t\t\t// the concat method.  We allow this property to be added to the dispatch object.\n\t\t\tif (key === Symbol.isConcatSpreadable) {\n\t\t\t\treturn Reflect.set(dispatch, key, newValue, proxy);\n\t\t\t}\n\n\t\t\tconst field = getSequenceField(proxy);\n\t\t\tconst maybeIndex = asIndex(key, field.length);\n\t\t\tif (maybeIndex !== undefined) {\n\t\t\t\t// For MVP, we otherwise disallow setting properties (mutation is only available via the array node mutation APIs).\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\treturn allowAdditionalProperties ? Reflect.set(target, key, newValue) : false;\n\t\t},\n\t\thas: (target, key) => {\n\t\t\tconst field = getSequenceField(proxy);\n\t\t\tconst maybeIndex = asIndex(key, field.length);\n\t\t\treturn maybeIndex !== undefined || Reflect.has(dispatch, key);\n\t\t},\n\t\townKeys: (target) => {\n\t\t\tconst field = getSequenceField(proxy);\n\n\t\t\t// TODO: Would a lazy iterator to produce the indexes work / be more efficient?\n\t\t\t// TODO: Need to surface 'Symbol.isConcatSpreadable' as an own key.\n\t\t\tconst keys: (string | symbol)[] = Array.from(\n\t\t\t\t{ length: field.length },\n\t\t\t\t(_, index) => `${index}`,\n\t\t\t);\n\n\t\t\tif (allowAdditionalProperties) {\n\t\t\t\tkeys.push(...Reflect.ownKeys(target));\n\t\t\t} else {\n\t\t\t\tkeys.push(\"length\");\n\t\t\t}\n\t\t\treturn keys;\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: field.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/**\n * Define a {@link TreeNodeSchema} for a {@link (TreeArrayNode:interface)}.\n *\n * @param name - Unique identifier for this schema including the factory's scope.\n */\nexport function arraySchema<\n\tTName extends string,\n\tconst T extends ImplicitAllowedTypes,\n\tconst ImplicitlyConstructable extends boolean,\n>(\n\tbase: TreeNodeSchemaClass<\n\t\tTName,\n\t\tNodeKind.Array,\n\t\tTreeNode & WithType<TName>,\n\t\tIterable<InsertableTreeNodeFromImplicitAllowedTypes<T>>,\n\t\tImplicitlyConstructable,\n\t\tT\n\t>,\n\tcustomizable: boolean,\n) {\n\t// This class returns a proxy from its constructor to handle numeric indexing.\n\t// Alternatively it could extend a normal class which gets tons of numeric properties added.\n\tclass schema extends base {\n\t\tpublic constructor(input: Iterable<InsertableTreeNodeFromImplicitAllowedTypes<T>>) {\n\t\t\tsuper(input);\n\n\t\t\tconst proxyTarget = customizable ? this : undefined;\n\n\t\t\tif (customizable) {\n\t\t\t\t// Since proxy reports this as a \"non-configurable\" property, it must exist on the underlying object used as the proxy target, not as an inherited property.\n\t\t\t\t// This should not get used as the proxy should intercept all use.\n\t\t\t\tObject.defineProperty(this, \"length\", {\n\t\t\t\t\tvalue: NaN,\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\n\t\t\tconst flexSchema = getFlexSchema(this.constructor as TreeNodeSchema);\n\t\t\tassert(flexSchema instanceof FlexFieldNodeSchema, 0x915 /* invalid flex schema */);\n\t\t\tconst flexNode: FlexTreeNode = isFlexTreeNode(input)\n\t\t\t\t? input\n\t\t\t\t: new RawFieldNode(flexSchema, copyContent(flexSchema.name, input) as object);\n\n\t\t\tconst proxy: TreeNode = createArrayNodeProxy(customizable, proxyTarget);\n\t\t\tsetFlexNode(proxy, flexNode);\n\t\t\treturn proxy as unknown as schema;\n\t\t}\n\t}\n\n\t// Setup array functionality\n\tObject.defineProperties(schema.prototype, arrayNodePrototypeProperties);\n\n\treturn schema as TreeNodeSchemaClass<\n\t\tTName,\n\t\tNodeKind.Array,\n\t\tTreeArrayNode<T> & WithType<TName>,\n\t\tIterable<InsertableTreeNodeFromImplicitAllowedTypes<T>>,\n\t\tImplicitlyConstructable,\n\t\tT\n\t>;\n}\n\n/**\n * The implementation of a field node created by {@link createRawNode}.\n */\nclass RawFieldNode<TSchema extends FlexFieldNodeSchema>\n\textends RawTreeNode<TSchema, InsertableContent>\n\timplements FlexTreeFieldNode<TSchema>\n{\n\tpublic get content(): FlexTreeUnboxField<TSchema[\"info\"]> {\n\t\tthrow rawError(\"Reading content of an array node\");\n\t}\n\n\tpublic get boxedContent(): FlexTreeTypedField<TSchema[\"info\"]> {\n\t\tthrow rawError(\"Reading boxed content of an array node\");\n\t}\n}\n\nfunction copyContent<T>(typeName: TreeNodeSchemaIdentifier, content: Iterable<T>): T[] {\n\tconst copy = Array.from(content);\n\tmarkContentType(typeName, copy);\n\treturn copy;\n}\n"]}

package/lib/simple-tree/index.d.ts

@@ -3,16 +3,18 @@
  * Licensed under the MIT License.
  */
 export { ITree, TreeView, TreeViewEvents, TreeConfiguration, SchemaIncompatible } from "./tree.js";
-export { TreeNodeSchema, NodeFromSchema, NodeKind, TreeNodeSchemaClass, TreeNodeSchemaNonClass, TreeNodeSchemaCore, ImplicitFieldSchema, TreeFieldFromImplicitField, ImplicitAllowedTypes, TreeNodeFromImplicitAllowedTypes, InsertableTreeNodeFromImplicitAllowedTypes, TreeMapNode, TreeLeafValue, type, WithType, AllowedTypes, ApplyKind, FieldKind, FieldSchema, InsertableObjectFromSchemaRecord, InsertableTreeFieldFromImplicitField, InsertableTypedNode, NodeBuilderData, ObjectFromSchemaRecord, } from "./schemaTypes.js";
+export { TreeNodeSchema, NodeFromSchema, NodeKind, TreeNodeSchemaClass, TreeNodeSchemaNonClass, TreeNodeSchemaCore, ImplicitFieldSchema, TreeFieldFromImplicitField, ImplicitAllowedTypes, TreeNodeFromImplicitAllowedTypes, InsertableTreeNodeFromImplicitAllowedTypes, TreeLeafValue, type, WithType, AllowedTypes, ApplyKind, FieldKind, FieldSchema, InsertableTreeFieldFromImplicitField, InsertableTypedNode, NodeBuilderData, type FieldProps, normalizeFieldSchema, } from "./schemaTypes.js";
 export { SchemaFactory, type ScopedSchemaName } from "./schemaFactory.js";
-export { getFlexNode } from "./flexNode.js";
-export { treeNodeApi, TreeNodeApi, TreeNodeEvents } from "./treeApi.js";
+export { getFlexNode } from "./proxyBinding.js";
+export { treeNodeApi, TreeNodeApi, TreeChangeEvents } from "./treeApi.js";
 export { toFlexConfig } from "./toFlexSchema.js";
-export { ObjectFromSchemaRecordUnsafe, TreeFieldFromImplicitFieldUnsafe, TreeNodeFromImplicitAllowedTypesUnsafe, FieldSchemaUnsafe, InsertableTreeNodeFromImplicitAllowedTypesUnsafe, TreeArrayNodeUnsafe, TreeMapNodeUnsafe, InsertableObjectFromSchemaRecordUnsafe, InsertableTreeFieldFromImplicitFieldUnsafe, InsertableTypedNodeUnsafe, NodeBuilderDataUnsafe, NodeFromSchemaUnsafe, } from "./typesUnsafe.js";
-export { SchemaFactoryRecursive, ValidateRecursiveSchema } from "./schemaFactoryRecursive.js";
-export { getProxyForField } from "./proxies.js";
+export { ObjectFromSchemaRecordUnsafe, TreeObjectNodeUnsafe, TreeFieldFromImplicitFieldUnsafe, TreeNodeFromImplicitAllowedTypesUnsafe, FieldSchemaUnsafe, InsertableTreeNodeFromImplicitAllowedTypesUnsafe, TreeArrayNodeUnsafe, TreeMapNodeUnsafe, InsertableObjectFromSchemaRecordUnsafe, InsertableTreeFieldFromImplicitFieldUnsafe, InsertableTypedNodeUnsafe, NodeBuilderDataUnsafe, NodeFromSchemaUnsafe, } from "./typesUnsafe.js";
+export { ValidateRecursiveSchema } from "./schemaFactoryRecursive.js";
+export { getProxyForField, InsertableContent } from "./proxies.js";
 export { adaptEnum, enumFromStrings, singletonSchema, typedObjectValues, } from "./schemaCreationUtilities.js";
 export { RecursiveObject as test_RecursiveObject, base as test_RecursiveObject_base, RecursiveObjectPojoMode as test_RecursiveObjectPojoMode, } from "./testRecursiveDomain.js";
-export { TreeNode, Unhydrated, TreeArrayNodeBase } from "./types.js";
-export { TreeArrayNode, IterableTreeArrayContent } from "./treeArrayNode.js";
+export { TreeNode, Unhydrated } from "./types.js";
+export { TreeArrayNode, IterableTreeArrayContent, TreeArrayNodeBase } from "./arrayNode.js";
+export { InsertableObjectFromSchemaRecord, ObjectFromSchemaRecord, TreeObjectNode, setField, } from "./objectNode.js";
+export { TreeMapNode } from "./mapNode.js";
 //# sourceMappingURL=index.d.ts.map

package/lib/simple-tree/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/simple-tree/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,KAAK,EAAE,QAAQ,EAAE,cAAc,EAAE,iBAAiB,EAAE,kBAAkB,EAAE,MAAM,WAAW,CAAC;AACnG,OAAO,EACN,cAAc,EACd,cAAc,EACd,QAAQ,EACR,mBAAmB,EACnB,sBAAsB,EACtB,kBAAkB,EAClB,mBAAmB,EACnB,0BAA0B,EAC1B,oBAAoB,EACpB,gCAAgC,EAChC,0CAA0C,EAC1C,WAAW,EACX,aAAa,EACb,IAAI,EACJ,QAAQ,EACR,YAAY,EACZ,SAAS,EACT,SAAS,EACT,WAAW,EACX,gCAAgC,EAChC,oCAAoC,EACpC,mBAAmB,EACnB,eAAe,EACf,sBAAsB,GACtB,MAAM,kBAAkB,CAAC;AAC1B,OAAO,EAAE,aAAa,EAAE,KAAK,gBAAgB,EAAE,MAAM,oBAAoB,CAAC;AAC1E,OAAO,EAAE,WAAW,EAAE,MAAM,eAAe,CAAC;AAC5C,OAAO,EAAE,WAAW,EAAE,WAAW,EAAE,cAAc,EAAE,MAAM,cAAc,CAAC;AACxE,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AACjD,OAAO,EACN,4BAA4B,EAC5B,gCAAgC,EAChC,sCAAsC,EACtC,iBAAiB,EACjB,gDAAgD,EAChD,mBAAmB,EACnB,iBAAiB,EACjB,sCAAsC,EACtC,0CAA0C,EAC1C,yBAAyB,EACzB,qBAAqB,EACrB,oBAAoB,GACpB,MAAM,kBAAkB,CAAC;AAC1B,OAAO,EAAE,sBAAsB,EAAE,uBAAuB,EAAE,MAAM,6BAA6B,CAAC;AAC9F,OAAO,EAAE,gBAAgB,EAAE,MAAM,cAAc,CAAC;AAEhD,OAAO,EACN,SAAS,EACT,eAAe,EACf,eAAe,EACf,iBAAiB,GACjB,MAAM,8BAA8B,CAAC;AAItC,OAAO,EACN,eAAe,IAAI,oBAAoB,EACvC,IAAI,IAAI,yBAAyB,EACjC,uBAAuB,IAAI,4BAA4B,GACvD,MAAM,0BAA0B,CAAC;AAElC,OAAO,EAAE,QAAQ,EAAE,UAAU,EAAE,iBAAiB,EAAE,MAAM,YAAY,CAAC;AACrE,OAAO,EAAE,aAAa,EAAE,wBAAwB,EAAE,MAAM,oBAAoB,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/simple-tree/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,KAAK,EAAE,QAAQ,EAAE,cAAc,EAAE,iBAAiB,EAAE,kBAAkB,EAAE,MAAM,WAAW,CAAC;AACnG,OAAO,EACN,cAAc,EACd,cAAc,EACd,QAAQ,EACR,mBAAmB,EACnB,sBAAsB,EACtB,kBAAkB,EAClB,mBAAmB,EACnB,0BAA0B,EAC1B,oBAAoB,EACpB,gCAAgC,EAChC,0CAA0C,EAC1C,aAAa,EACb,IAAI,EACJ,QAAQ,EACR,YAAY,EACZ,SAAS,EACT,SAAS,EACT,WAAW,EACX,oCAAoC,EACpC,mBAAmB,EACnB,eAAe,EACf,KAAK,UAAU,EACf,oBAAoB,GACpB,MAAM,kBAAkB,CAAC;AAC1B,OAAO,EAAE,aAAa,EAAE,KAAK,gBAAgB,EAAE,MAAM,oBAAoB,CAAC;AAC1E,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAChD,OAAO,EAAE,WAAW,EAAE,WAAW,EAAE,gBAAgB,EAAE,MAAM,cAAc,CAAC;AAC1E,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AACjD,OAAO,EACN,4BAA4B,EAC5B,oBAAoB,EACpB,gCAAgC,EAChC,sCAAsC,EACtC,iBAAiB,EACjB,gDAAgD,EAChD,mBAAmB,EACnB,iBAAiB,EACjB,sCAAsC,EACtC,0CAA0C,EAC1C,yBAAyB,EACzB,qBAAqB,EACrB,oBAAoB,GACpB,MAAM,kBAAkB,CAAC;AAC1B,OAAO,EAAE,uBAAuB,EAAE,MAAM,6BAA6B,CAAC;AACtE,OAAO,EAAE,gBAAgB,EAAE,iBAAiB,EAAE,MAAM,cAAc,CAAC;AAEnE,OAAO,EACN,SAAS,EACT,eAAe,EACf,eAAe,EACf,iBAAiB,GACjB,MAAM,8BAA8B,CAAC;AAItC,OAAO,EACN,eAAe,IAAI,oBAAoB,EACvC,IAAI,IAAI,yBAAyB,EACjC,uBAAuB,IAAI,4BAA4B,GACvD,MAAM,0BAA0B,CAAC;AAElC,OAAO,EAAE,QAAQ,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AAClD,OAAO,EAAE,aAAa,EAAE,wBAAwB,EAAE,iBAAiB,EAAE,MAAM,gBAAgB,CAAC;AAC5F,OAAO,EACN,gCAAgC,EAChC,sBAAsB,EACtB,cAAc,EACd,QAAQ,GACR,MAAM,iBAAiB,CAAC;AACzB,OAAO,EAAE,WAAW,EAAE,MAAM,cAAc,CAAC"}

package/lib/simple-tree/index.js

@@ -3,17 +3,17 @@
  * Licensed under the MIT License.
  */
 export { TreeConfiguration } from "./tree.js";
-export { NodeKind, type, FieldKind, FieldSchema, } from "./schemaTypes.js";
+export { NodeKind, type, FieldKind, FieldSchema, normalizeFieldSchema, } from "./schemaTypes.js";
 export { SchemaFactory } from "./schemaFactory.js";
-export { getFlexNode } from "./flexNode.js";
+export { getFlexNode } from "./proxyBinding.js";
 export { treeNodeApi } from "./treeApi.js";
 export { toFlexConfig } from "./toFlexSchema.js";
-export { SchemaFactoryRecursive } from "./schemaFactoryRecursive.js";
 export { getProxyForField } from "./proxies.js";
 export { adaptEnum, enumFromStrings, singletonSchema, typedObjectValues, } from "./schemaCreationUtilities.js";
 // Exporting the schema (RecursiveObject) to test that recursive types are working correctly.
 // These are `@internal` so they can't be included in the `InternalClassTreeTypes` due to https://github.com/microsoft/rushstack/issues/3639
 export { RecursiveObject as test_RecursiveObject, base as test_RecursiveObject_base, RecursiveObjectPojoMode as test_RecursiveObjectPojoMode, } from "./testRecursiveDomain.js";
 export { TreeNode } from "./types.js";
-export { TreeArrayNode, IterableTreeArrayContent } from "./treeArrayNode.js";
+export { TreeArrayNode, IterableTreeArrayContent } from "./arrayNode.js";
+export { setField, } from "./objectNode.js";
 //# sourceMappingURL=index.js.map

package/lib/simple-tree/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/simple-tree/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAmC,iBAAiB,EAAsB,MAAM,WAAW,CAAC;AACnG,OAAO,EAGN,QAAQ,EAWR,IAAI,EAIJ,SAAS,EACT,WAAW,GAMX,MAAM,kBAAkB,CAAC;AAC1B,OAAO,EAAE,aAAa,EAAyB,MAAM,oBAAoB,CAAC;AAC1E,OAAO,EAAE,WAAW,EAAE,MAAM,eAAe,CAAC;AAC5C,OAAO,EAAE,WAAW,EAA+B,MAAM,cAAc,CAAC;AACxE,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AAejD,OAAO,EAAE,sBAAsB,EAA2B,MAAM,6BAA6B,CAAC;AAC9F,OAAO,EAAE,gBAAgB,EAAE,MAAM,cAAc,CAAC;AAEhD,OAAO,EACN,SAAS,EACT,eAAe,EACf,eAAe,EACf,iBAAiB,GACjB,MAAM,8BAA8B,CAAC;AAEtC,6FAA6F;AAC7F,4IAA4I;AAC5I,OAAO,EACN,eAAe,IAAI,oBAAoB,EACvC,IAAI,IAAI,yBAAyB,EACjC,uBAAuB,IAAI,4BAA4B,GACvD,MAAM,0BAA0B,CAAC;AAElC,OAAO,EAAE,QAAQ,EAAiC,MAAM,YAAY,CAAC;AACrE,OAAO,EAAE,aAAa,EAAE,wBAAwB,EAAE,MAAM,oBAAoB,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nexport { ITree, TreeView, TreeViewEvents, TreeConfiguration, SchemaIncompatible } from \"./tree.js\";\nexport {\n\tTreeNodeSchema,\n\tNodeFromSchema,\n\tNodeKind,\n\tTreeNodeSchemaClass,\n\tTreeNodeSchemaNonClass,\n\tTreeNodeSchemaCore,\n\tImplicitFieldSchema,\n\tTreeFieldFromImplicitField,\n\tImplicitAllowedTypes,\n\tTreeNodeFromImplicitAllowedTypes,\n\tInsertableTreeNodeFromImplicitAllowedTypes,\n\tTreeMapNode,\n\tTreeLeafValue,\n\ttype,\n\tWithType,\n\tAllowedTypes,\n\tApplyKind,\n\tFieldKind,\n\tFieldSchema,\n\tInsertableObjectFromSchemaRecord,\n\tInsertableTreeFieldFromImplicitField,\n\tInsertableTypedNode,\n\tNodeBuilderData,\n\tObjectFromSchemaRecord,\n} from \"./schemaTypes.js\";\nexport { SchemaFactory, type ScopedSchemaName } from \"./schemaFactory.js\";\nexport { getFlexNode } from \"./flexNode.js\";\nexport { treeNodeApi, TreeNodeApi, TreeNodeEvents } from \"./treeApi.js\";\nexport { toFlexConfig } from \"./toFlexSchema.js\";\nexport {\n\tObjectFromSchemaRecordUnsafe,\n\tTreeFieldFromImplicitFieldUnsafe,\n\tTreeNodeFromImplicitAllowedTypesUnsafe,\n\tFieldSchemaUnsafe,\n\tInsertableTreeNodeFromImplicitAllowedTypesUnsafe,\n\tTreeArrayNodeUnsafe,\n\tTreeMapNodeUnsafe,\n\tInsertableObjectFromSchemaRecordUnsafe,\n\tInsertableTreeFieldFromImplicitFieldUnsafe,\n\tInsertableTypedNodeUnsafe,\n\tNodeBuilderDataUnsafe,\n\tNodeFromSchemaUnsafe,\n} from \"./typesUnsafe.js\";\nexport { SchemaFactoryRecursive, ValidateRecursiveSchema } from \"./schemaFactoryRecursive.js\";\nexport { getProxyForField } from \"./proxies.js\";\n\nexport {\n\tadaptEnum,\n\tenumFromStrings,\n\tsingletonSchema,\n\ttypedObjectValues,\n} from \"./schemaCreationUtilities.js\";\n\n// Exporting the schema (RecursiveObject) to test that recursive types are working correctly.\n// These are `@internal` so they can't be included in the `InternalClassTreeTypes` due to https://github.com/microsoft/rushstack/issues/3639\nexport {\n\tRecursiveObject as test_RecursiveObject,\n\tbase as test_RecursiveObject_base,\n\tRecursiveObjectPojoMode as test_RecursiveObjectPojoMode,\n} from \"./testRecursiveDomain.js\";\n\nexport { TreeNode, Unhydrated, TreeArrayNodeBase } from \"./types.js\";\nexport { TreeArrayNode, IterableTreeArrayContent } from \"./treeArrayNode.js\";\n"]}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/simple-tree/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAmC,iBAAiB,EAAsB,MAAM,WAAW,CAAC;AACnG,OAAO,EAGN,QAAQ,EAUR,IAAI,EAIJ,SAAS,EACT,WAAW,EAKX,oBAAoB,GACpB,MAAM,kBAAkB,CAAC;AAC1B,OAAO,EAAE,aAAa,EAAyB,MAAM,oBAAoB,CAAC;AAC1E,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAChD,OAAO,EAAE,WAAW,EAAiC,MAAM,cAAc,CAAC;AAC1E,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AAiBjD,OAAO,EAAE,gBAAgB,EAAqB,MAAM,cAAc,CAAC;AAEnE,OAAO,EACN,SAAS,EACT,eAAe,EACf,eAAe,EACf,iBAAiB,GACjB,MAAM,8BAA8B,CAAC;AAEtC,6FAA6F;AAC7F,4IAA4I;AAC5I,OAAO,EACN,eAAe,IAAI,oBAAoB,EACvC,IAAI,IAAI,yBAAyB,EACjC,uBAAuB,IAAI,4BAA4B,GACvD,MAAM,0BAA0B,CAAC;AAElC,OAAO,EAAE,QAAQ,EAAc,MAAM,YAAY,CAAC;AAClD,OAAO,EAAE,aAAa,EAAE,wBAAwB,EAAqB,MAAM,gBAAgB,CAAC;AAC5F,OAAO,EAIN,QAAQ,GACR,MAAM,iBAAiB,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nexport { ITree, TreeView, TreeViewEvents, TreeConfiguration, SchemaIncompatible } from \"./tree.js\";\nexport {\n\tTreeNodeSchema,\n\tNodeFromSchema,\n\tNodeKind,\n\tTreeNodeSchemaClass,\n\tTreeNodeSchemaNonClass,\n\tTreeNodeSchemaCore,\n\tImplicitFieldSchema,\n\tTreeFieldFromImplicitField,\n\tImplicitAllowedTypes,\n\tTreeNodeFromImplicitAllowedTypes,\n\tInsertableTreeNodeFromImplicitAllowedTypes,\n\tTreeLeafValue,\n\ttype,\n\tWithType,\n\tAllowedTypes,\n\tApplyKind,\n\tFieldKind,\n\tFieldSchema,\n\tInsertableTreeFieldFromImplicitField,\n\tInsertableTypedNode,\n\tNodeBuilderData,\n\ttype FieldProps,\n\tnormalizeFieldSchema,\n} from \"./schemaTypes.js\";\nexport { SchemaFactory, type ScopedSchemaName } from \"./schemaFactory.js\";\nexport { getFlexNode } from \"./proxyBinding.js\";\nexport { treeNodeApi, TreeNodeApi, TreeChangeEvents } from \"./treeApi.js\";\nexport { toFlexConfig } from \"./toFlexSchema.js\";\nexport {\n\tObjectFromSchemaRecordUnsafe,\n\tTreeObjectNodeUnsafe,\n\tTreeFieldFromImplicitFieldUnsafe,\n\tTreeNodeFromImplicitAllowedTypesUnsafe,\n\tFieldSchemaUnsafe,\n\tInsertableTreeNodeFromImplicitAllowedTypesUnsafe,\n\tTreeArrayNodeUnsafe,\n\tTreeMapNodeUnsafe,\n\tInsertableObjectFromSchemaRecordUnsafe,\n\tInsertableTreeFieldFromImplicitFieldUnsafe,\n\tInsertableTypedNodeUnsafe,\n\tNodeBuilderDataUnsafe,\n\tNodeFromSchemaUnsafe,\n} from \"./typesUnsafe.js\";\nexport { ValidateRecursiveSchema } from \"./schemaFactoryRecursive.js\";\nexport { getProxyForField, InsertableContent } from \"./proxies.js\";\n\nexport {\n\tadaptEnum,\n\tenumFromStrings,\n\tsingletonSchema,\n\ttypedObjectValues,\n} from \"./schemaCreationUtilities.js\";\n\n// Exporting the schema (RecursiveObject) to test that recursive types are working correctly.\n// These are `@internal` so they can't be included in the `InternalClassTreeTypes` due to https://github.com/microsoft/rushstack/issues/3639\nexport {\n\tRecursiveObject as test_RecursiveObject,\n\tbase as test_RecursiveObject_base,\n\tRecursiveObjectPojoMode as test_RecursiveObjectPojoMode,\n} from \"./testRecursiveDomain.js\";\n\nexport { TreeNode, Unhydrated } from \"./types.js\";\nexport { TreeArrayNode, IterableTreeArrayContent, TreeArrayNodeBase } from \"./arrayNode.js\";\nexport {\n\tInsertableObjectFromSchemaRecord,\n\tObjectFromSchemaRecord,\n\tTreeObjectNode,\n\tsetField,\n} from \"./objectNode.js\";\nexport { TreeMapNode } from \"./mapNode.js\";\n"]}

package/lib/simple-tree/leafNodeSchema.d.ts

@@ -0,0 +1,11 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { NodeKind, TreeNodeSchema } from "./schemaTypes.js";
+export declare const stringSchema: TreeNodeSchema<"com.fluidframework.leaf.string", NodeKind.Leaf, string, string>;
+export declare const numberSchema: TreeNodeSchema<"com.fluidframework.leaf.number", NodeKind.Leaf, number, number>;
+export declare const booleanSchema: TreeNodeSchema<"com.fluidframework.leaf.boolean", NodeKind.Leaf, boolean, boolean>;
+export declare const nullSchema: TreeNodeSchema<"com.fluidframework.leaf.null", NodeKind.Leaf, null, null>;
+export declare const handleSchema: TreeNodeSchema<"com.fluidframework.leaf.handle", NodeKind.Leaf, import("@fluidframework/core-interfaces").IFluidHandle<import("@fluidframework/core-interfaces").FluidObject & import("@fluidframework/core-interfaces").IFluidLoadable>, import("@fluidframework/core-interfaces").IFluidHandle<import("@fluidframework/core-interfaces").FluidObject & import("@fluidframework/core-interfaces").IFluidLoadable>>;
+//# sourceMappingURL=leafNodeSchema.d.ts.map

package/lib/simple-tree/leafNodeSchema.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"leafNodeSchema.d.ts","sourceRoot":"","sources":["../../src/simple-tree/leafNodeSchema.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAcH,OAAO,EAAE,QAAQ,EAAE,cAAc,EAA0B,MAAM,kBAAkB,CAAC;AAkDpF,eAAO,MAAM,YAAY,iFAAwB,CAAC;AAClD,eAAO,MAAM,YAAY,iFAAwB,CAAC;AAClD,eAAO,MAAM,aAAa,oFAAyB,CAAC;AACpD,eAAO,MAAM,UAAU,2EAAsB,CAAC;AAC9C,eAAO,MAAM,YAAY,qZAAwB,CAAC"}

package/lib/simple-tree/leafNodeSchema.js

@@ -0,0 +1,48 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { assert } from "@fluidframework/core-utils/internal";
+import { leaf } from "../domains/index.js";
+import { isFlexTreeNode, valueSchemaAllows, } from "../feature-libraries/index.js";
+import { setFlexSchemaFromClassSchema } from "./schemaCaching.js";
+import { NodeKind } from "./schemaTypes.js";
+/**
+ * Instances of this class are schema for leaf nodes.
+ * @remarks
+ * Unlike other schema, leaf schema are class instances instead of classes themselves.
+ * This is because the instance type (the tree node type) for leaves are not objects,
+ * so those instances can't be instances of a schema based class.
+ * @privateRemarks
+ * This class refers to the underlying flex tree schema in its constructor, so this class can't be included in the package API.
+ */
+class LeafNodeSchema {
+    create(data) {
+        if (isFlexTreeNode(data)) {
+            const value = data.value;
+            assert(valueSchemaAllows(this.info, value), 0x916 /* invalid value */);
+            return value;
+        }
+        return data;
+    }
+    constructor(schema) {
+        this.kind = NodeKind.Leaf;
+        this.implicitlyConstructable = true;
+        setFlexSchemaFromClassSchema(this, schema);
+        this.identifier = schema.name;
+        this.info = schema.info;
+    }
+}
+/**
+ * Wrapper around LeafNodeSchema's constructor that provides the return type that is desired in the package public API.
+ */
+function makeLeaf(schema) {
+    return new LeafNodeSchema(schema);
+}
+// Leaf schema shared between all SchemaFactory instances.
+export const stringSchema = makeLeaf(leaf.string);
+export const numberSchema = makeLeaf(leaf.number);
+export const booleanSchema = makeLeaf(leaf.boolean);
+export const nullSchema = makeLeaf(leaf.null);
+export const handleSchema = makeLeaf(leaf.handle);
+//# sourceMappingURL=leafNodeSchema.js.map

package/lib/simple-tree/leafNodeSchema.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"leafNodeSchema.js","sourceRoot":"","sources":["../../src/simple-tree/leafNodeSchema.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,qCAAqC,CAAC;AAG7D,OAAO,EAAE,IAAI,EAAE,MAAM,qBAAqB,CAAC;AAC3C,OAAO,EAGN,cAAc,EACd,iBAAiB,GACjB,MAAM,+BAA+B,CAAC;AAEvC,OAAO,EAAE,4BAA4B,EAAE,MAAM,oBAAoB,CAAC;AAClE,OAAO,EAAE,QAAQ,EAA0C,MAAM,kBAAkB,CAAC;AAQpF;;;;;;;;GAQG;AACH,MAAM,cAAc;IAOZ,MAAM,CAAC,IAAyC;QACtD,IAAI,cAAc,CAAC,IAAI,CAAC,EAAE;YACzB,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;YACzB,MAAM,CAAC,iBAAiB,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,KAAK,CAAC,mBAAmB,CAAC,CAAC;YACvE,OAAO,KAAK,CAAC;SACb;QACD,OAAO,IAAI,CAAC;IACb,CAAC;IAED,YAAmB,MAAS;QAZZ,SAAI,GAAG,QAAQ,CAAC,IAAI,CAAC;QAErB,4BAAuB,GAAG,IAAa,CAAC;QAWvD,4BAA4B,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QAC3C,IAAI,CAAC,UAAU,GAAG,MAAM,CAAC,IAAwB,CAAC;QAClD,IAAI,CAAC,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC;IACzB,CAAC;CACD;AAED;;GAEG;AACH,SAAS,QAAQ,CAChB,MAAS;IAET,OAAO,IAAI,cAAc,CAAC,MAAM,CAAC,CAAC;AACnC,CAAC;AAED,0DAA0D;AAC1D,MAAM,CAAC,MAAM,YAAY,GAAG,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;AAClD,MAAM,CAAC,MAAM,YAAY,GAAG,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;AAClD,MAAM,CAAC,MAAM,aAAa,GAAG,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;AACpD,MAAM,CAAC,MAAM,UAAU,GAAG,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC9C,MAAM,CAAC,MAAM,YAAY,GAAG,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { assert } from \"@fluidframework/core-utils/internal\";\n\nimport { TreeNodeSchemaIdentifier, TreeValue } from \"../core/index.js\";\nimport { leaf } from \"../domains/index.js\";\nimport {\n\tLeafNodeSchema as FlexLeafNodeSchema,\n\tFlexTreeNode,\n\tisFlexTreeNode,\n\tvalueSchemaAllows,\n} from \"../feature-libraries/index.js\";\n\nimport { setFlexSchemaFromClassSchema } from \"./schemaCaching.js\";\nimport { NodeKind, TreeNodeSchema, TreeNodeSchemaNonClass } from \"./schemaTypes.js\";\n\ntype UnbrandedName<T extends FlexLeafNodeSchema> = T[\"name\"] extends TreeNodeSchemaIdentifier<\n\tinfer Name extends string\n>\n\t? Name\n\t: T[\"name\"];\n\n/**\n * Instances of this class are schema for leaf nodes.\n * @remarks\n * Unlike other schema, leaf schema are class instances instead of classes themselves.\n * This is because the instance type (the tree node type) for leaves are not objects,\n * so those instances can't be instances of a schema based class.\n * @privateRemarks\n * This class refers to the underlying flex tree schema in its constructor, so this class can't be included in the package API.\n */\nclass LeafNodeSchema<T extends FlexLeafNodeSchema>\n\timplements TreeNodeSchemaNonClass<UnbrandedName<T>, NodeKind.Leaf, TreeValue<T[\"info\"]>>\n{\n\tpublic readonly identifier: UnbrandedName<T>;\n\tpublic readonly kind = NodeKind.Leaf;\n\tpublic readonly info: T[\"info\"];\n\tpublic readonly implicitlyConstructable = true as const;\n\tpublic create(data: TreeValue<T[\"info\"]> | FlexTreeNode): TreeValue<T[\"info\"]> {\n\t\tif (isFlexTreeNode(data)) {\n\t\t\tconst value = data.value;\n\t\t\tassert(valueSchemaAllows(this.info, value), 0x916 /* invalid value */);\n\t\t\treturn value;\n\t\t}\n\t\treturn data;\n\t}\n\n\tpublic constructor(schema: T) {\n\t\tsetFlexSchemaFromClassSchema(this, schema);\n\t\tthis.identifier = schema.name as UnbrandedName<T>;\n\t\tthis.info = schema.info;\n\t}\n}\n\n/**\n * Wrapper around LeafNodeSchema's constructor that provides the return type that is desired in the package public API.\n */\nfunction makeLeaf<T extends FlexLeafNodeSchema>(\n\tschema: T,\n): TreeNodeSchema<UnbrandedName<T>, NodeKind.Leaf, TreeValue<T[\"info\"]>, TreeValue<T[\"info\"]>> {\n\treturn new LeafNodeSchema(schema);\n}\n\n// Leaf schema shared between all SchemaFactory instances.\nexport const stringSchema = makeLeaf(leaf.string);\nexport const numberSchema = makeLeaf(leaf.number);\nexport const booleanSchema = makeLeaf(leaf.boolean);\nexport const nullSchema = makeLeaf(leaf.null);\nexport const handleSchema = makeLeaf(leaf.handle);\n"]}

package/lib/simple-tree/mapNode.d.ts

@@ -0,0 +1,86 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { FieldKey } from "../core/index.js";
+import { FlexMapNodeSchema, FlexTreeMapNode, FlexTreeTypedField, FlexTreeUnboxField, FlexibleFieldContent } from "../feature-libraries/index.js";
+import { InsertableContent } from "./proxies.js";
+import { NodeKind, type ImplicitAllowedTypes, type InsertableTreeNodeFromImplicitAllowedTypes, TreeNodeSchemaClass, WithType, TreeNodeFromImplicitAllowedTypes } from "./schemaTypes.js";
+import { TreeNode } from "./types.js";
+import { RawTreeNode } from "./rawNode.js";
+/**
+ * A map of string keys to tree objects.
+ *
+ * @privateRemarks
+ * Add support for `clear` once we have established merge semantics for it.
+ *
+ * @public
+ */
+export interface TreeMapNode<T extends ImplicitAllowedTypes = ImplicitAllowedTypes> extends ReadonlyMap<string, TreeNodeFromImplicitAllowedTypes<T>>, TreeNode {
+    /**
+     * Adds or updates an entry in the map with a specified `key` and a `value`.
+     *
+     * @param key - The key of the element to add to the map.
+     * @param value - The value of the element to add to the map.
+     *
+     * @remarks
+     * Setting the value at a key to `undefined` is equivalent to calling {@link TreeMapNode.delete} with that key.
+     */
+    set(key: string, value: InsertableTreeNodeFromImplicitAllowedTypes<T> | undefined): void;
+    /**
+     * Removes the specified element from this map by its `key`.
+     *
+     * @remarks
+     * Note: unlike JavaScript's Map API, this method does not return a flag indicating whether or not the value was
+     * deleted.
+     *
+     * @privateRemarks
+     * Regarding the choice to not return a boolean: Since this data structure is distributed in nature, it isn't
+     * possible to tell whether or not the item was deleted as a result of this method call. Returning a "best guess"
+     * is more likely to create issues / promote bad usage patterns than offer useful information.
+     *
+     * @param key - The key of the element to remove from the map.
+     */
+    delete(key: string): void;
+}
+export declare const mapStaticDispatchMap: PropertyDescriptorMap;
+/**
+ * @param allowAdditionalProperties - If true, setting of unexpected properties will be forwarded to the target object.
+ * Otherwise setting of unexpected properties will error.
+ * @param customTargetObject - Target object of the proxy.
+ * If not provided `new Map()` is used for the target and a separate object created to dispatch map methods.
+ * 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}.
+ */
+export declare function createMapProxy(allowAdditionalProperties: boolean, customTargetObject?: object): TreeMapNode;
+/**
+ * Define a {@link TreeNodeSchema} for a {@link (TreeArrayNode:interface)}.
+ *
+ * @param name - Unique identifier for this schema including the factory's scope.
+ */
+export declare function mapSchema<TName extends string, const T extends ImplicitAllowedTypes, const ImplicitlyConstructable extends boolean>(base: TreeNodeSchemaClass<TName, NodeKind.Map, TreeNode & WithType<TName>, Iterable<[string, InsertableTreeNodeFromImplicitAllowedTypes<T>]>, ImplicitlyConstructable, T>, customizable: boolean): TreeNodeSchemaClass<TName, NodeKind.Map, TreeMapNode<T> & WithType<TName>, Iterable<[string, InsertableTreeNodeFromImplicitAllowedTypes<T>]>, ImplicitlyConstructable, T>;
+/**
+ * The implementation of a map node created by {@link createRawNode}.
+ */
+export declare class RawMapNode<TSchema extends FlexMapNodeSchema> extends RawTreeNode<TSchema, ReadonlyMap<string, InsertableContent>> implements FlexTreeMapNode<TSchema> {
+    get size(): number;
+    has(key: string): boolean;
+    get(key: string): FlexTreeUnboxField<TSchema["info"]>;
+    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"]>>;
+}
+//# sourceMappingURL=mapNode.d.ts.map

package/lib/simple-tree/mapNode.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"mapNode.d.ts","sourceRoot":"","sources":["../../src/simple-tree/mapNode.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAGH,OAAO,EAAE,QAAQ,EAA4B,MAAM,kBAAkB,CAAC;AACtE,OAAO,EACN,iBAAiB,EACjB,eAAe,EAEf,kBAAkB,EAClB,kBAAkB,EAClB,oBAAoB,EAEpB,MAAM,+BAA+B,CAAC;AACvC,OAAO,EACN,iBAAiB,EAIjB,MAAM,cAAc,CAAC;AAGtB,OAAO,EACN,QAAQ,EACR,KAAK,oBAAoB,EACzB,KAAK,0CAA0C,EAC/C,mBAAmB,EACnB,QAAQ,EAGR,gCAAgC,EAChC,MAAM,kBAAkB,CAAC;AAE1B,OAAO,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AAEtC,OAAO,EAAE,WAAW,EAAyB,MAAM,cAAc,CAAC;AAElE;;;;;;;GAOG;AACH,MAAM,WAAW,WAAW,CAAC,CAAC,SAAS,oBAAoB,GAAG,oBAAoB,CACjF,SAAQ,WAAW,CAAC,MAAM,EAAE,gCAAgC,CAAC,CAAC,CAAC,CAAC,EAC/D,QAAQ;IACT;;;;;;;;OAQG;IACH,GAAG,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,0CAA0C,CAAC,CAAC,CAAC,GAAG,SAAS,GAAG,IAAI,CAAC;IAEzF;;;;;;;;;;;;;OAaG;IACH,MAAM,CAAC,GAAG,EAAE,MAAM,GAAG,IAAI,CAAC;CAC1B;AAID,eAAO,MAAM,oBAAoB,EAAE,qBAsFlC,CAAC;AAMF;;;;;;GAMG;AACH,wBAAgB,cAAc,CAC7B,yBAAyB,EAAE,OAAO,EAClC,kBAAkB,CAAC,EAAE,MAAM,GACzB,WAAW,CA+Bb;AAED;;;;GAIG;AACH,wBAAgB,SAAS,CACxB,KAAK,SAAS,MAAM,EACpB,KAAK,CAAC,CAAC,SAAS,oBAAoB,EACpC,KAAK,CAAC,uBAAuB,SAAS,OAAO,EAE7C,IAAI,EAAE,mBAAmB,CACxB,KAAK,EACL,QAAQ,CAAC,GAAG,EACZ,QAAQ,GAAG,QAAQ,CAAC,KAAK,CAAC,EAC1B,QAAQ,CAAC,CAAC,MAAM,EAAE,0CAA0C,CAAC,CAAC,CAAC,CAAC,CAAC,EACjE,uBAAuB,EACvB,CAAC,CACD,EACD,YAAY,EAAE,OAAO,6KAuCrB;AAED;;GAEG;AACH,qBAAa,UAAU,CAAC,OAAO,SAAS,iBAAiB,CACxD,SAAQ,WAAW,CAAC,OAAO,EAAE,WAAW,CAAC,MAAM,EAAE,iBAAiB,CAAC,CACnE,YAAW,eAAe,CAAC,OAAO,CAAC;IAEnC,IAAW,IAAI,IAAI,MAAM,CAExB;IACM,GAAG,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO;IAGzB,GAAG,CAAC,GAAG,EAAE,MAAM,GAAG,kBAAkB,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IAGrD,IAAI,IAAI,gBAAgB,CAAC,QAAQ,CAAC;IAGlC,MAAM,IAAI,gBAAgB,CAAC,kBAAkB,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,UAAU,CAAC,CAAC;IAG3E,OAAO,IAAI,gBAAgB,CACjC;QAAC,QAAQ;QAAE,kBAAkB,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,UAAU,CAAC;KAAC,CAC3D;IAGM,OAAO,CACb,UAAU,EAAE,CACX,KAAK,EAAE,kBAAkB,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,UAAU,CAAC,EACtD,GAAG,EAAE,QAAQ,EACb,GAAG,EAAE,eAAe,CAAC,OAAO,CAAC,KACzB,IAAI,EACT,OAAO,CAAC,EAAE,GAAG,GACX,IAAI;IAGA,GAAG,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,oBAAoB,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,SAAS,GAAG,IAAI;IAGhF,MAAM,CAAC,GAAG,EAAE,MAAM,GAAG,IAAI;IAIhC,IAAW,QAAQ,IAAI;QACtB,QAAQ,EAAE,CAAC,IAAI,QAAQ,CAAC,CAAC,EAAE,kBAAkB,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,UAAU,CAAC;KAC1E,CAEA;IAEM,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,gBAAgB,CAC3C;QAAC,QAAQ;QAAE,kBAAkB,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,UAAU,CAAC;KAAC,CAC3D;IAIe,aAAa,IAAI,gBAAgB,CAAC,kBAAkB,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC;CAGtF"}

package/lib/simple-tree/mapNode.js

@@ -0,0 +1,198 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { assert } from "@fluidframework/core-utils/internal";
+import { FlexMapNodeSchema, isFlexTreeNode, } from "../feature-libraries/index.js";
+import { getProxyForField, markContentType, prepareContentForInsert, } from "./proxies.js";
+import { getFlexNode, setFlexNode } from "./proxyBinding.js";
+import { getSimpleNodeSchema } from "./schemaCaching.js";
+import { cursorFromNodeData } from "./toMapTree.js";
+import { getFlexSchema } from "./toFlexSchema.js";
+import { RawTreeNode, nodeContent, rawError } from "./rawNode.js";
+// #region Create dispatch map for maps
+export const mapStaticDispatchMap = {
+    [Symbol.iterator]: {
+        value() {
+            return this.entries();
+        },
+    },
+    delete: {
+        value(key) {
+            const node = getFlexNode(this);
+            node.delete(key);
+        },
+    },
+    entries: {
+        *value() {
+            const node = getFlexNode(this);
+            for (const key of node.keys()) {
+                yield [key, getProxyForField(node.getBoxed(key))];
+            }
+        },
+    },
+    get: {
+        value(key) {
+            const node = getFlexNode(this);
+            const field = node.getBoxed(key);
+            return getProxyForField(field);
+        },
+    },
+    has: {
+        value(key) {
+            const node = getFlexNode(this);
+            return node.has(key);
+        },
+    },
+    keys: {
+        value() {
+            const node = getFlexNode(this);
+            return node.keys();
+        },
+    },
+    set: {
+        value(key, value) {
+            const node = getFlexNode(this);
+            const content = prepareContentForInsert(value, node.context.forest);
+            const classSchema = getSimpleNodeSchema(node.schema);
+            const cursor = cursorFromNodeData(content, classSchema.info);
+            node.set(key, cursor);
+            return this;
+        },
+    },
+    size: {
+        get() {
+            return getFlexNode(this).size;
+        },
+    },
+    values: {
+        *value() {
+            for (const [, value] of this.entries()) {
+                yield value;
+            }
+        },
+    },
+    forEach: {
+        value(callbackFn, thisArg) {
+            if (thisArg === undefined) {
+                // We can't pass `callbackFn` to `FlexTreeMapNode` directly, or else the third argument ("map") will be a flex node instead of the proxy.
+                getFlexNode(this).forEach((v, k, _) => callbackFn(v, k, this), thisArg);
+            }
+            else {
+                const boundCallbackFn = callbackFn.bind(thisArg);
+                getFlexNode(this).forEach((v, k, _) => boundCallbackFn(v, k, this), thisArg);
+            }
+        },
+    },
+    // TODO: add `clear` once we have established merge semantics for it.
+};
+const mapPrototype = Object.create(Object.prototype, mapStaticDispatchMap);
+// #endregion
+/**
+ * @param allowAdditionalProperties - If true, setting of unexpected properties will be forwarded to the target object.
+ * Otherwise setting of unexpected properties will error.
+ * @param customTargetObject - Target object of the proxy.
+ * If not provided `new Map()` is used for the target and a separate object created to dispatch map methods.
+ * 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}.
+ */
+export function createMapProxy(allowAdditionalProperties, customTargetObject) {
+    // Create a 'dispatch' object that this Proxy forwards to instead of the proxy target.
+    const dispatch = customTargetObject ??
+        Object.create(mapPrototype, {
+        // Empty - JavaScript Maps do not expose any "own" properties.
+        });
+    const targetObject = customTargetObject ?? new Map();
+    // TODO: Although the target is an object literal, it's still worthwhile to try experimenting with
+    // a dispatch object to see if it improves performance.
+    const proxy = new Proxy(targetObject, {
+        get: (target, key, receiver) => {
+            // Pass the proxy as the receiver here, so that any methods on the prototype receive `proxy` as `this`.
+            return Reflect.get(dispatch, key, proxy);
+        },
+        getOwnPropertyDescriptor: (target, key) => {
+            return Reflect.getOwnPropertyDescriptor(dispatch, key);
+        },
+        has: (target, key) => {
+            return Reflect.has(dispatch, key);
+        },
+        set: (target, key, newValue) => {
+            return allowAdditionalProperties ? Reflect.set(dispatch, key, newValue) : false;
+        },
+        ownKeys: (target) => {
+            // All of Map's properties are inherited via its prototype, so there is nothing to return here,
+            return [];
+        },
+    });
+    return proxy;
+}
+/**
+ * Define a {@link TreeNodeSchema} for a {@link (TreeArrayNode:interface)}.
+ *
+ * @param name - Unique identifier for this schema including the factory's scope.
+ */
+export function mapSchema(base, customizable) {
+    class schema extends base {
+        constructor(input) {
+            super(input);
+            const proxyTarget = customizable ? this : undefined;
+            const flexSchema = getFlexSchema(this.constructor);
+            assert(flexSchema instanceof FlexMapNodeSchema, 0x917 /* invalid flex schema */);
+            const flexNode = isFlexTreeNode(input)
+                ? input
+                : new RawMapNode(flexSchema, copyContent(flexSchema.name, input));
+            const proxy = createMapProxy(customizable, proxyTarget);
+            setFlexNode(proxy, flexNode);
+            return proxy;
+        }
+    }
+    // Setup map functionality
+    Object.defineProperties(schema.prototype, mapStaticDispatchMap);
+    return schema;
+}
+/**
+ * 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);
+    }
+    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");
+    }
+}
+function copyContent(typeName, content) {
+    const copy = new Map(content);
+    markContentType(typeName, copy);
+    return copy;
+}
+//# sourceMappingURL=mapNode.js.map

package/lib/simple-tree/mapNode.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"mapNode.js","sourceRoot":"","sources":["../../src/simple-tree/mapNode.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,qCAAqC,CAAC;AAE7D,OAAO,EACN,iBAAiB,EAMjB,cAAc,GACd,MAAM,+BAA+B,CAAC;AACvC,OAAO,EAEN,gBAAgB,EAChB,eAAe,EACf,uBAAuB,GACvB,MAAM,cAAc,CAAC;AACtB,OAAO,EAAE,WAAW,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAC7D,OAAO,EAAE,mBAAmB,EAAE,MAAM,oBAAoB,CAAC;AAWzD,OAAO,EAAE,kBAAkB,EAAE,MAAM,gBAAgB,CAAC;AAEpD,OAAO,EAAE,aAAa,EAAE,MAAM,mBAAmB,CAAC;AAClD,OAAO,EAAE,WAAW,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,cAAc,CAAC;AAyClE,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,KAA0C;YAE1C,MAAM,IAAI,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC;YAC/B,MAAM,OAAO,GAAG,uBAAuB,CACtC,KAA0B,EAC1B,IAAI,CAAC,OAAO,CAAC,MAAM,CACnB,CAAC;YAEF,MAAM,WAAW,GAAG,mBAAmB,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACrD,MAAM,MAAM,GAAG,kBAAkB,CAAC,OAAO,EAAE,WAAW,CAAC,IAA4B,CAAC,CAAC;YAErF,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;YACtB,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,OAAO,EAAE;QACR,KAAK,CAEJ,UAAoF,EACpF,OAAa;YAEb,IAAI,OAAO,KAAK,SAAS,EAAE;gBAC1B,yIAAyI;gBACzI,WAAW,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,EAAE,OAAO,CAAC,CAAC;aACxE;iBAAM;gBACN,MAAM,eAAe,GAAG,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBACjD,WAAW,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,eAAe,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,EAAE,OAAO,CAAC,CAAC;aAC7E;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,MAAM,UAAU,cAAc,CAC7B,yBAAkC,EAClC,kBAA2B;IAE3B,sFAAsF;IACtF,MAAM,QAAQ,GACb,kBAAkB;QAClB,MAAM,CAAC,MAAM,CAAC,YAAY,EAAE;QAC3B,8DAA8D;SAC9D,CAAC,CAAC;IACJ,MAAM,YAAY,GAAW,kBAAkB,IAAI,IAAI,GAAG,EAAoB,CAAC;IAE/E,kGAAkG;IAClG,uDAAuD;IACvD,MAAM,KAAK,GAAG,IAAI,KAAK,CAAc,YAA2B,EAAE;QACjE,GAAG,EAAE,CAAC,MAAM,EAAE,GAAG,EAAE,QAAQ,EAAW,EAAE;YACvC,uGAAuG;YACvG,OAAO,OAAO,CAAC,GAAG,CAAC,QAAQ,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;QAC1C,CAAC;QACD,wBAAwB,EAAE,CAAC,MAAM,EAAE,GAAG,EAAkC,EAAE;YACzE,OAAO,OAAO,CAAC,wBAAwB,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;QACxD,CAAC;QACD,GAAG,EAAE,CAAC,MAAM,EAAE,GAAG,EAAE,EAAE;YACpB,OAAO,OAAO,CAAC,GAAG,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;QACnC,CAAC;QACD,GAAG,EAAE,CAAC,MAAM,EAAE,GAAG,EAAE,QAAQ,EAAW,EAAE;YACvC,OAAO,yBAAyB,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,EAAE,GAAG,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;QACjF,CAAC;QACD,OAAO,EAAE,CAAC,MAAM,EAAE,EAAE;YACnB,+FAA+F;YAC/F,OAAO,EAAE,CAAC;QACX,CAAC;KACD,CAAC,CAAC;IACH,OAAO,KAAK,CAAC;AACd,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,SAAS,CAKxB,IAOC,EACD,YAAqB;IAErB,MAAM,MAAO,SAAQ,IAAI;QACxB,YACC,KAAwE;YAExE,KAAK,CAAC,KAAK,CAAC,CAAC;YAEb,MAAM,WAAW,GAAG,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC;YAEpD,MAAM,UAAU,GAAG,aAAa,CAAC,IAAI,CAAC,WAA6B,CAAC,CAAC;YACrE,MAAM,CAAC,UAAU,YAAY,iBAAiB,EAAE,KAAK,CAAC,yBAAyB,CAAC,CAAC;YACjF,MAAM,QAAQ,GAAiB,cAAc,CAAC,KAAK,CAAC;gBACnD,CAAC,CAAC,KAAK;gBACP,CAAC,CAAC,IAAI,UAAU,CACd,UAAU,EACV,WAAW,CAAC,UAAU,CAAC,IAAI,EAAE,KAAK,CAGjC,CACA,CAAC;YAEL,MAAM,KAAK,GAAa,cAAc,CAAC,YAAY,EAAE,WAAW,CAAC,CAAC;YAClE,WAAW,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;YAC7B,OAAO,KAA0B,CAAC;QACnC,CAAC;KACD;IAED,0BAA0B;IAC1B,MAAM,CAAC,gBAAgB,CAAC,MAAM,CAAC,SAAS,EAAE,oBAAoB,CAAC,CAAC;IAEhE,OAAO,MAON,CAAC;AACH,CAAC;AAED;;GAEG;AACH,MAAM,OAAO,UACZ,SAAQ,WAA4D;IAGpE,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,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;IAEe,aAAa;QAC5B,MAAM,QAAQ,CAAC,iBAAiB,CAAC,CAAC;IACnC,CAAC;CACD;AAED,SAAS,WAAW,CACnB,QAAkC,EAClC,OAA8B;IAE9B,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC;IAC9B,eAAe,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;IAChC,OAAO,IAAI,CAAC;AACb,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { assert } from \"@fluidframework/core-utils/internal\";\nimport { FieldKey, TreeNodeSchemaIdentifier } from \"../core/index.js\";\nimport {\n\tFlexMapNodeSchema,\n\tFlexTreeMapNode,\n\tFlexTreeNode,\n\tFlexTreeTypedField,\n\tFlexTreeUnboxField,\n\tFlexibleFieldContent,\n\tisFlexTreeNode,\n} from \"../feature-libraries/index.js\";\nimport {\n\tInsertableContent,\n\tgetProxyForField,\n\tmarkContentType,\n\tprepareContentForInsert,\n} from \"./proxies.js\";\nimport { getFlexNode, setFlexNode } from \"./proxyBinding.js\";\nimport { getSimpleNodeSchema } from \"./schemaCaching.js\";\nimport {\n\tNodeKind,\n\ttype ImplicitAllowedTypes,\n\ttype InsertableTreeNodeFromImplicitAllowedTypes,\n\tTreeNodeSchemaClass,\n\tWithType,\n\tTreeNodeSchema,\n\tInsertableTypedNode,\n\tTreeNodeFromImplicitAllowedTypes,\n} from \"./schemaTypes.js\";\nimport { cursorFromNodeData } from \"./toMapTree.js\";\nimport { TreeNode } from \"./types.js\";\nimport { getFlexSchema } from \"./toFlexSchema.js\";\nimport { RawTreeNode, nodeContent, rawError } from \"./rawNode.js\";\n\n/**\n * A map of string keys to tree objects.\n *\n * @privateRemarks\n * Add support for `clear` once we have established merge semantics for it.\n *\n * @public\n */\nexport interface TreeMapNode<T extends ImplicitAllowedTypes = ImplicitAllowedTypes>\n\textends ReadonlyMap<string, TreeNodeFromImplicitAllowedTypes<T>>,\n\t\tTreeNode {\n\t/**\n\t * Adds or updates an entry in the map with a specified `key` and a `value`.\n\t *\n\t * @param key - The key of the element to add to the map.\n\t * @param value - The value of the element to add to the map.\n\t *\n\t * @remarks\n\t * Setting the value at a key to `undefined` is equivalent to calling {@link TreeMapNode.delete} with that key.\n\t */\n\tset(key: string, value: InsertableTreeNodeFromImplicitAllowedTypes<T> | undefined): void;\n\n\t/**\n\t * Removes the specified element from this map by its `key`.\n\t *\n\t * @remarks\n\t * Note: unlike JavaScript's Map API, this method does not return a flag indicating whether or not the value was\n\t * deleted.\n\t *\n\t * @privateRemarks\n\t * Regarding the choice to not return a boolean: Since this data structure is distributed in nature, it isn't\n\t * possible to tell whether or not the item was deleted as a result of this method call. Returning a \"best guess\"\n\t * is more likely to create issues / promote bad usage patterns than offer useful information.\n\t *\n\t * @param key - The key of the element to remove from the map.\n\t */\n\tdelete(key: string): void;\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: InsertableTypedNode<TreeNodeSchema>,\n\t\t): TreeMapNode {\n\t\t\tconst node = getFlexNode(this);\n\t\t\tconst content = prepareContentForInsert(\n\t\t\t\tvalue as InsertableContent,\n\t\t\t\tnode.context.forest,\n\t\t\t);\n\n\t\t\tconst classSchema = getSimpleNodeSchema(node.schema);\n\t\t\tconst cursor = cursorFromNodeData(content, classSchema.info as ImplicitAllowedTypes);\n\n\t\t\tnode.set(key, cursor);\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\tforEach: {\n\t\tvalue(\n\t\t\tthis: TreeMapNode,\n\t\t\tcallbackFn: (value: unknown, key: string, map: ReadonlyMap<string, unknown>) => void,\n\t\t\tthisArg?: any,\n\t\t): void {\n\t\t\tif (thisArg === undefined) {\n\t\t\t\t// We can't pass `callbackFn` to `FlexTreeMapNode` directly, or else the third argument (\"map\") will be a flex node instead of the proxy.\n\t\t\t\tgetFlexNode(this).forEach((v, k, _) => callbackFn(v, k, this), thisArg);\n\t\t\t} else {\n\t\t\t\tconst boundCallbackFn = callbackFn.bind(thisArg);\n\t\t\t\tgetFlexNode(this).forEach((v, k, _) => boundCallbackFn(v, k, this), thisArg);\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 */\nexport function createMapProxy(\n\tallowAdditionalProperties: boolean,\n\tcustomTargetObject?: object,\n): TreeMapNode {\n\t// Create a 'dispatch' object that this Proxy forwards to instead of the proxy target.\n\tconst dispatch: object =\n\t\tcustomTargetObject ??\n\t\tObject.create(mapPrototype, {\n\t\t\t// Empty - JavaScript Maps do not expose any \"own\" properties.\n\t\t});\n\tconst targetObject: object = customTargetObject ?? new Map<string, TreeNode>();\n\n\t// TODO: Although the target is an object literal, it's still worthwhile to try experimenting with\n\t// a dispatch object to see if it improves performance.\n\tconst proxy = new Proxy<TreeMapNode>(targetObject as TreeMapNode, {\n\t\tget: (target, key, receiver): unknown => {\n\t\t\t// Pass the proxy as the receiver here, so that any methods on the prototype receive `proxy` as `this`.\n\t\t\treturn Reflect.get(dispatch, key, proxy);\n\t\t},\n\t\tgetOwnPropertyDescriptor: (target, key): PropertyDescriptor | undefined => {\n\t\t\treturn Reflect.getOwnPropertyDescriptor(dispatch, key);\n\t\t},\n\t\thas: (target, key) => {\n\t\t\treturn Reflect.has(dispatch, key);\n\t\t},\n\t\tset: (target, key, newValue): boolean => {\n\t\t\treturn allowAdditionalProperties ? Reflect.set(dispatch, key, newValue) : false;\n\t\t},\n\t\townKeys: (target) => {\n\t\t\t// All of Map's properties are inherited via its prototype, so there is nothing to return here,\n\t\t\treturn [];\n\t\t},\n\t});\n\treturn proxy;\n}\n\n/**\n * Define a {@link TreeNodeSchema} for a {@link (TreeArrayNode:interface)}.\n *\n * @param name - Unique identifier for this schema including the factory's scope.\n */\nexport function mapSchema<\n\tTName extends string,\n\tconst T extends ImplicitAllowedTypes,\n\tconst ImplicitlyConstructable extends boolean,\n>(\n\tbase: TreeNodeSchemaClass<\n\t\tTName,\n\t\tNodeKind.Map,\n\t\tTreeNode & WithType<TName>,\n\t\tIterable<[string, InsertableTreeNodeFromImplicitAllowedTypes<T>]>,\n\t\tImplicitlyConstructable,\n\t\tT\n\t>,\n\tcustomizable: boolean,\n) {\n\tclass schema extends base {\n\t\tpublic constructor(\n\t\t\tinput: Iterable<[string, InsertableTreeNodeFromImplicitAllowedTypes<T>]>,\n\t\t) {\n\t\t\tsuper(input);\n\n\t\t\tconst proxyTarget = customizable ? this : undefined;\n\n\t\t\tconst flexSchema = getFlexSchema(this.constructor as TreeNodeSchema);\n\t\t\tassert(flexSchema instanceof FlexMapNodeSchema, 0x917 /* invalid flex schema */);\n\t\t\tconst flexNode: FlexTreeNode = isFlexTreeNode(input)\n\t\t\t\t? input\n\t\t\t\t: new RawMapNode(\n\t\t\t\t\t\tflexSchema,\n\t\t\t\t\t\tcopyContent(flexSchema.name, input) as ReadonlyMap<\n\t\t\t\t\t\t\tstring,\n\t\t\t\t\t\t\tInsertableContent\n\t\t\t\t\t\t>,\n\t\t\t\t  );\n\n\t\t\tconst proxy: TreeNode = createMapProxy(customizable, proxyTarget);\n\t\t\tsetFlexNode(proxy, flexNode);\n\t\t\treturn proxy as unknown as schema;\n\t\t}\n\t}\n\n\t// Setup map functionality\n\tObject.defineProperties(schema.prototype, mapStaticDispatchMap);\n\n\treturn schema as TreeNodeSchemaClass<\n\t\tTName,\n\t\tNodeKind.Map,\n\t\tTreeMapNode<T> & WithType<TName>,\n\t\tIterable<[string, InsertableTreeNodeFromImplicitAllowedTypes<T>]>,\n\t\tImplicitlyConstructable,\n\t\tT\n\t>;\n}\n\n/**\n * The implementation of a map node created by {@link createRawNode}.\n */\nexport class RawMapNode<TSchema extends FlexMapNodeSchema>\n\textends RawTreeNode<TSchema, ReadonlyMap<string, InsertableContent>>\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 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 override boxedIterator(): IterableIterator<FlexTreeTypedField<TSchema[\"info\"]>> {\n\t\tthrow rawError(\"Boxed iteration\");\n\t}\n}\n\nfunction copyContent<T>(\n\ttypeName: TreeNodeSchemaIdentifier,\n\tcontent: Iterable<[string, T]>,\n): Map<string, T> {\n\tconst copy = new Map(content);\n\tmarkContentType(typeName, copy);\n\treturn copy;\n}\n"]}