npm - @fluidframework/tree - Versions diffs - 2.1.0 → 2.2.0 - Mend

@fluidframework/tree 2.1.0 → 2.2.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (1457) hide show

package/dist/core/tree/anchorSet.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"anchorSet.js","sourceRoot":"","sources":["../../../src/core/tree/anchorSet.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,kEAA6D;AAE7D,oDAAuE;AACvE,kDAS6B;AAa7B,yCAAkD;AAYlD;;GAEG;AACH,MAAM,WAAW,GAAW,IAAA,gBAAK,EAAC,CAAC,CAAC,CAAC;AA8MrC;;;;;;;;;;;;;;;GAeG;AACH,SAAgB,UAAU;IACzB,OAAO,IAAA,sBAAW,GAAwB,CAAC;AAC5C,CAAC;AAFD,gCAEC;AAED;;;;;;;;;;;GAWG;AACH,MAAa,SAAS;IAkCrB;QAjCiB,WAAM,GAAG,IAAA,wBAAa,GAAuB,CAAC;QAC/D;;;WAGG;QACK,kBAAa,GAAG,CAAC,CAAC;QAE1B;;;;WAIG;QACI,qBAAgB,GAAG,CAAC,CAAC;QAE5B;;;;;;;;;;WAUG;QACc,SAAI,GAAG,IAAI,QAAQ,CAAC,IAAI,EAAE,mBAAQ,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC;QAEnE,8GAA8G;QAC9G,yDAAyD;QACxC,iBAAY,GAA0B,IAAI,GAAG,EAAE,CAAC;QAKhE,IAAI,CAAC,EAAE,CAAC,cAAc,EAAE,GAAG,EAAE;YAC5B,IAAI,CAAC,gBAAgB,IAAI,CAAC,CAAC;QAC5B,CAAC,CAAC,CAAC;IACJ,CAAC;IAED;;;;;;OAMG;IACH,0BAA0B;IAC1B,8DAA8D;IAC9D,IAAW,KAAK;QACf,OAAO,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC;IACxB,CAAC;IAEM,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC;QACxB,MAAM,KAAK,GAAe,EAAE,CAAC;QAC7B,IAAI,IAAI,GAAyB,IAAI,CAAC,IAAI,CAAC;QAC3C,OAAO,IAAI,KAAK,SAAS,EAAE,CAAC;YAC3B,MAAM,IAAI,CAAC;YACX,KAAK,MAAM,CAAC,CAAC,EAAE,QAAQ,CAAC,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAC3C,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;oBAC9B,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBACnB,CAAC;YACF,CAAC;YACD,IAAI,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC;QACpB,CAAC;IACF,CAAC;IAEM,EAAE,CACR,SAAY,EACZ,QAAgC;QAEhC,OAAO,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;IAC5C,CAAC;IAED;;;OAGG;IACI,OAAO;QACb,OAAO,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,KAAK,CAAC,CAAC;IACtC,CAAC;IAEM,MAAM,CAAC,MAAc;QAC3B,IAAI,MAAM,KAAK,WAAW,EAAE,CAAC;YAC5B,OAAO,SAAS,CAAC;QAClB,CAAC;QAED,MAAM,IAAI,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAC3C,IAAA,iBAAM,EACL,IAAI,KAAK,SAAS,EAClB,KAAK,CAAC,yDAAyD,CAC/D,CAAC;QACF,OAAO,IAAI,CAAC,MAAM,KAAK,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC;IACxD,CAAC;IAEM,MAAM,CAAC,MAAc;QAC3B,IAAI,MAAM,KAAK,WAAW,EAAE,CAAC;YAC5B,MAAM,IAAI,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAC3C,IAAA,iBAAM,EAAC,IAAI,KAAK,SAAS,EAAE,KAAK,CAAC,kCAAkC,CAAC,CAAC;YACrE,IAAI,CAAC,SAAS,EAAE,CAAC;YACjB,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAClC,CAAC;IACF,CAAC;IAED;;;;;OAKG;IACH,kDAAkD;IAC3C,KAAK,CAAC,IAAmB;QAC/B,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;YACnB,OAAO,WAAW,CAAC;QACpB,CAAC;QAED,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;QACxC,MAAM,MAAM,GAAW,IAAA,gBAAK,EAAC,IAAI,CAAC,aAAa,EAAE,CAAC,CAAC;QACnD,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;QACzC,OAAO,MAAM,CAAC;IACf,CAAC;IAED;;OAEG;IACK,UAAU,CAAC,IAAY;QAC9B,IAAI,IAAI,YAAY,QAAQ,IAAI,IAAI,CAAC,SAAS,KAAK,IAAI,EAAE,CAAC;YACzD,IAAI,CAAC,MAAM,EAAE,CAAC;YACd,OAAO,IAAI,CAAC;QACb,CAAC;QACD,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,IAAI,CAAC;QACxC,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;QAE3C,MAAM,KAAK,GAAG,UAAU,CAAC,gBAAgB,CAAC,IAAI,CAAC,WAAW,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;QAE9E,iGAAiG;QACjG,UAAU,CAAC,SAAS,EAAE,CAAC;QAEvB,OAAO,KAAK,CAAC;IACd,CAAC;IAED;;OAEG;IACK,IAAI,CAAC,IAAY;QACxB,IAAI,IAAI,YAAY,QAAQ,EAAE,CAAC;YAC9B,IAAI,IAAI,CAAC,SAAS,KAAK,IAAI,EAAE,CAAC;gBAC7B,OAAO,IAAI,CAAC;YACb,CAAC;QACF,CAAC;QACD,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,IAAI,CAAC;QACxC,MAAM,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACrC,OAAO,UAAU,EAAE,WAAW,CAAC,IAAI,CAAC,WAAW,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;IACpE,CAAC;IAED;;;;;;;;OAQG;IACI,eAAe,CAAC,YAAoB;QAC1C,IAAI,IAAI,GAAuB,YAAY,CAAC;QAC5C,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,OAAO,IAAI,KAAK,SAAS,EAAE,CAAC;YAC3B,IAAI,IAAI,YAAY,QAAQ,IAAI,IAAI,CAAC,SAAS,KAAK,IAAI,EAAE,CAAC;gBACzD,MAAM;YACP,CAAC;YACD,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACjB,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC;QACpB,CAAC;QAED,4CAA4C;QAC5C,oDAAoD;QAEpD,IAAI,QAA4B,CAAC;QACjC,OAAO,CAAC,QAAQ,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC,KAAK,SAAS,EAAE,CAAC;YAC/C,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,YAAY,QAAQ,EAAE,CAAC;gBACpD,+EAA+E;gBAC/E,MAAM,KAAK,GAAG,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,WAAW,CAC5C,QAAQ,CAAC,WAAW,EACpB,QAAQ,CAAC,WAAW,CACpB,CAAC;gBACF,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;oBACzB,IAAI,GAAG,KAAK,CAAC;oBACb,SAAS;gBACV,CAAC;YACF,CAAC;YACD,oGAAoG;YACpG,kDAAkD;YAClD,IAAI,IAAI,KAAK,QAAQ,CAAC,MAAM,IAAI,CAAC,CAAC,QAAQ,YAAY,QAAQ,CAAC,EAAE,CAAC;gBACjE,uFAAuF;gBACvF,IAAI,GAAG,QAAQ,CAAC;YACjB,CAAC;iBAAM,CAAC;gBACP,IAAI,GAAG;oBACN,MAAM,EAAE,IAAI;oBACZ,WAAW,EAAE,QAAQ,CAAC,WAAW;oBACjC,WAAW,EAAE,QAAQ,CAAC,WAAW;iBACjC,CAAC;YACH,CAAC;QACF,CAAC;QAED,OAAO,IAAI,IAAI,IAAA,eAAI,EAAC,iCAAiC,CAAC,CAAC;IACxD,CAAC;IAED;;;OAGG;IACK,UAAU,CAAC,KAA0B;QAC5C,MAAM,KAAK,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC;QACzB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACzB,oEAAoE;YACpE,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;YAC1B,IAAA,iBAAM,EAAC,IAAI,CAAC,MAAM,KAAK,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,4BAA4B,CAAC,CAAC;YACzE,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC,QAAQ,CAAC;YAC9B,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,cAAc,EAAE,IAAI,CAAC,CAAC;YACvC,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC;gBAC/C,KAAK,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC,CAAC;YACzB,CAAC;QACF,CAAC;IACF,CAAC;IAED;;;;;;;;;OASG;IACK,aAAa,CAAC,SAAiB,EAAE,KAAa;QACrD,IAAA,iBAAM,EAAC,KAAK,GAAG,CAAC,EAAE,KAAK,CAAC,4BAA4B,CAAC,CAAC;QAEtD,MAAM,YAAY,GAAG,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9D,MAAM,cAAc,GAAG,YAAY,EAAE,QAAQ,EAAE,GAAG,CAAC,SAAS,CAAC,WAAW,CAAC,CAAC;QAC1E,IAAI,KAAK,GAAe,EAAE,CAAC;QAE3B,IAAI,cAAc,KAAK,SAAS,EAAE,CAAC;YAClC,IAAI,oBAAoB,GAAG,CAAC,CAAC;YAC7B,IAAI,gBAAgB,GAAG,CAAC,CAAC;YACzB,IAAI,KAAK,GAAG,CAAC,CAAC;YACd,OACC,KAAK,GAAG,cAAc,CAAC,MAAM;gBAC7B,cAAc,CAAC,KAAK,CAAC,CAAC,WAAW,GAAG,SAAS,CAAC,WAAW,EACxD,CAAC;gBACF,oBAAoB,EAAE,CAAC;gBACvB,KAAK,EAAE,CAAC;YACT,CAAC;YACD,OACC,KAAK,GAAG,cAAc,CAAC,MAAM;gBAC7B,cAAc,CAAC,KAAK,CAAC,CAAC,WAAW,GAAG,SAAS,CAAC,WAAW,GAAG,KAAK,EAChE,CAAC;gBACF,gBAAgB,EAAE,CAAC;gBACnB,KAAK,EAAE,CAAC;YACT,CAAC;YACD,OAAO,KAAK,GAAG,cAAc,CAAC,MAAM,EAAE,CAAC;gBACtC,4DAA4D;gBAC5D,cAAc,CAAC,KAAK,CAAC,CAAC,WAAW,IAAI,KAAK,CAAC;gBAC3C,KAAK,EAAE,CAAC;YACT,CAAC;YACD,wCAAwC;YACxC,KAAK,GAAG,cAAc,CAAC,MAAM,CAAC,oBAAoB,EAAE,gBAAgB,CAAC,CAAC;YACtE,IAAI,cAAc,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACjC,oEAAoE;gBACpE,YAAa,CAAC,eAAe,CAAC,SAAS,CAAC,WAAW,CAAC,CAAC;YACtD,CAAC;QACF,CAAC;QAED,OAAO,KAAK,CAAC;IACd,CAAC;IAED;;;;;;;OAOG;IACK,WAAW,CAClB,WAAmB,EACnB,KAAa,EACb,UAA2D;QAE3D,IAAA,iBAAM,EAAC,UAAU,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,KAAK,CAAC,0CAA0C,CAAC,CAAC;QAEtF,gEAAgE;QAChE,MAAM,eAAe,GAAG,IAAI,CAAC,UAAU,CAAC,WAAW,CAAC,MAAM,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC;QAEzE,+BAA+B;QAC/B,KAAK,MAAM,IAAI,IAAI,UAAU,CAAC,KAAK,EAAE,CAAC;YACrC,IAAI,CAAC,WAAW,IAAI,WAAW,CAAC,WAAW,GAAG,UAAU,CAAC,gBAAgB,CAAC;YAC1E,IAAI,CAAC,UAAU,GAAG,eAAe,CAAC;YAClC,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC,WAAW,CAAC;QAC5C,CAAC;QAED,oCAAoC;QACpC,MAAM,KAAK,GAAG,eAAe,CAAC,QAAQ,CAAC,GAAG,CAAC,WAAW,CAAC,WAAW,CAAC,CAAC;QACpE,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACzB,eAAe,CAAC,QAAQ,CAAC,GAAG,CAAC,WAAW,CAAC,WAAW,EAAE,UAAU,CAAC,KAAK,CAAC,CAAC;QACzE,CAAC;aAAM,CAAC;YACP,iCAAiC;YACjC,MAAM,kBAAkB,GAAG,IAAI,CAAC,qBAAqB,CACpD,KAAK,EACL,WAAW,CAAC,WAAW,EACvB,KAAK,CACL,CAAC;YAEF,iFAAiF;YACjF,KAAK,CAAC,MAAM,CAAC,kBAAkB,EAAE,CAAC,EAAE,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC;QAC1D,CAAC;QAED,eAAe,CAAC,SAAS,EAAE,CAAC;IAC7B,CAAC;IAED;;;;;;;;;;OAUG;IACK,qBAAqB,CAC5B,KAAiB,EACjB,eAAuB,EACvB,KAAa;QAEb,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,OAAO,KAAK,GAAG,KAAK,CAAC,MAAM,IAAI,KAAK,CAAC,KAAK,CAAC,CAAC,WAAW,GAAG,eAAe,EAAE,CAAC;YAC3E,KAAK,EAAE,CAAC;QACT,CAAC;QACD,MAAM,oBAAoB,GAAG,KAAK,CAAC;QACnC,OAAO,KAAK,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;YAC7B,KAAK,CAAC,KAAK,CAAC,CAAC,WAAW,IAAI,KAAK,CAAC;YAClC,KAAK,EAAE,CAAC;QACT,CAAC;QAED,OAAO,oBAAoB,CAAC;IAC7B,CAAC;IAED;;;;;;;;;;;;;;;;OAgBG;IACK,YAAY,CAAC,WAAmB,EAAE,WAAmB,EAAE,KAAa;QAC3E,MAAM,KAAK,GAAG,IAAI,CAAC,aAAa,CAAC,WAAW,EAAE,KAAK,CAAC,CAAC;QACrD,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACtB,IAAI,CAAC,WAAW,CAAC,WAAW,EAAE,KAAK,EAAE;gBACpC,gBAAgB,EAAE,WAAW,CAAC,WAAW;gBACzC,KAAK;aACL,CAAC,CAAC;QACJ,CAAC;aAAM,CAAC;YACP,yFAAyF;YACzF,2BAA2B;YAC3B,IAAI,CAAC,cAAc,CAAC,WAAW,EAAE,KAAK,CAAC,CAAC;QACzC,CAAC;IACF,CAAC;IAEO,cAAc,CAAC,IAAY,EAAE,KAAa;QACjD,MAAM,KAAK,GAAG,IAAI,CAAC,aAAa,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QAC9C,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;IACxB,CAAC;IAED;;;;;OAKG;IACK,cAAc,CAAC,oBAA4B,EAAE,MAAc;QAClE,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,oBAAoB,CAAC,MAAM,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC;QACrE,MAAM,KAAK,GAAG,QAAQ,EAAE,QAAQ,CAAC,GAAG,CAAC,oBAAoB,CAAC,WAAW,CAAC,CAAC;QACvE,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACzB,IAAI,CAAC,qBAAqB,CAAC,KAAK,EAAE,oBAAoB,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;QAC7E,CAAC;IACF,CAAC;IAED;;;;;;;;;;OAUG;IACI,cAAc;QACpB,IAAA,iBAAM,EACL,IAAI,CAAC,aAAa,KAAK,SAAS,EAChC,KAAK,CAAC,4DAA4D,CAClE,CAAC;QAEF,MAAM,mBAAmB,GAAe,EAAE,CAAC;QAC3C,MAAM,OAAO,GAAG;YACf,SAAS,EAAE,IAAI;YACf,0EAA0E;YAC1E,sCAAsC;YACtC,aAAa,CAAC,QAAwC,EAAE,QAAqB;gBAC5E,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;oBACzD,QAAQ,EAAE,CAAC;gBACZ,CAAC;qBAAM,CAAC;oBACP,IAAA,iBAAM,EAAC,IAAI,CAAC,MAAM,KAAK,SAAS,EAAE,KAAK,CAAC,uBAAuB,CAAC,CAAC;oBACjE,aAAa;oBACb,6FAA6F;oBAC7F,gIAAgI;oBAChI,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC,eAAe,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;oBAC1D,IAAI,IAAI,CAAC,MAAM,YAAY,QAAQ,EAAE,CAAC;wBACrC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;wBACrB,mBAAmB,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;wBACtC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;oBACvB,CAAC;gBACF,CAAC;YACF,CAAC;YACD,0GAA0G;YAC1G,iJAAiJ;YACjJ,yJAAyJ;YACzJ,YAAY,EAAE,IAAI,GAAG,EAA8B;YACnD,WAAW,EAAE,SAAiC;YAC9C,MAAM,EAAE,SAA+B;YACvC,cAAc,EAAE,EAAqD;YAErE,sGAAsG;YACtG,mCAAmC;YACnC,kCAAkC;YAClC,0BAA0B;YAC1B,4GAA4G;YAC5G,6EAA6E;YAC7E,+GAA+G;YAC/G,0EAA0E;YAC1E,0GAA0G;YAC1G,iDAAiD;YACjD,gHAAgH;YAChH,iHAAiH;YACjH,iHAAiH;YACjH,+GAA+G;YAC/G,iHAAiH;YACjH,iHAAiH;YACjH,gHAAgH;YAChH,sCAAsC;YACtC,YAAY,EAAE,CAAC;YACf,+BAA+B,EAAE,CAAC;YAElC,IAAI;gBACH,IAAA,iBAAM,EACL,IAAI,CAAC,SAAS,CAAC,aAAa,KAAK,SAAS,EAC1C,KAAK,CAAC,0CAA0C,CAChD,CAAC;gBACF,KAAK,MAAM,IAAI,IAAI,mBAAmB,EAAE,CAAC;oBACxC,IAAI,CAAC,SAAS,EAAE,CAAC;gBAClB,CAAC;gBACD,IAAI,CAAC,SAAS,CAAC,aAAa,GAAG,SAAS,CAAC;gBACzC,MAAM,cAAc,GAAG,IAAI,GAAG,EAAsB,CAAC;gBACrD,KAAK,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,IAAI,CAAC,cAAc,EAAE,CAAC;oBACnD,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;wBAC/B,cAAc,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;oBAC9B,CAAC;oBACD,MAAM,aAAa,GAAG,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;oBAC/C,IAAI,aAAa,EAAE,QAAQ,CAAC,KAAK,CAAC,IAAI,KAAK,EAAE,CAAC;wBAC7C,SAAS;oBACV,CAAC;oBACD,aAAa,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;oBAC3B,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;gBAC/B,CAAC;YACF,CAAC;YACD,sBAAsB;gBACrB,IAAI,CAAC,aAAa,CACjB,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,kBAAkB,EAAE,CAAC,CAAC,EAC3C,GAAG,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,kBAAkB,EAAE,IAAI,CAAC,SAAS,CAAC,CACpE,CAAC;YACH,CAAC;YACD,qBAAqB;gBACpB,IAAI,CAAC,aAAa,CACjB,CAAC,CAAC,EAAE,EAAE;oBACL,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,iBAAiB,EAAE,CAAC,CAAC,CAAC;oBACpC,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC;wBACxB,IAAI,EAAE,CAAC;wBACP,KAAK,EAAE,2BAA2B;qBAClC,CAAC,CAAC;gBACJ,CAAC,EACD,GAAG,EAAE,GAAE,CAAC,CACR,CAAC;YACH,CAAC;YACD,YAAY,CAAC,MAAgB,EAAE,KAAa,EAAE,WAAuB;gBACpE,IAAA,iBAAM,EACL,IAAI,CAAC,WAAW,KAAK,SAAS,EAC9B,KAAK,CAAC,2CAA2C,CACjD,CAAC;gBACF,MAAM,eAAe,GAAgB;oBACpC,MAAM,EAAE,IAAI,CAAC,MAAM;oBACnB,KAAK,EAAE,IAAI,CAAC,WAAW;oBACvB,KAAK,EAAE,WAAW;iBAClB,CAAC;gBACF,MAAM,UAAU,GAAwB,IAAA,gBAAK,EAAC;oBAC7C,KAAK,EAAE,MAAM;oBACb,KAAK,EAAE,CAAC;oBACR,GAAG,EAAE,KAAK;iBACV,CAAC,CAAC;gBACH,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,EAAE,CAAC;oBACnD,KAAK,MAAM,WAAW,IAAI,QAAQ,EAAE,CAAC;wBACpC,WAAW,CAAC,YAAY,CAAC,UAAU,EAAE,eAAe,CAAC,CAAC;oBACvD,CAAC;gBACF,CAAC;YACF,CAAC;YACD,WAAW,CAAC,MAAgB,EAAE,WAAkB;gBAC/C,IAAA,iBAAM,EACL,IAAI,CAAC,WAAW,KAAK,SAAS,EAC9B,KAAK,CAAC,2CAA2C,CACjD,CAAC;gBACF,MAAM,UAAU,GAAwB,IAAA,gBAAK,EAAC;oBAC7C,KAAK,EAAE,MAAM;oBACb,KAAK,EAAE,CAAC;iBACR,CAAC,CAAC;gBACH,MAAM,eAAe,GAAgB;oBACpC,MAAM,EAAE,IAAI,CAAC,MAAM;oBACnB,KAAK,EAAE,IAAI,CAAC,WAAW;oBACvB,GAAG,WAAW;iBACd,CAAC;gBACF,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,EAAE,CAAC;oBACnD,KAAK,MAAM,WAAW,IAAI,QAAQ,EAAE,CAAC;wBACpC,WAAW,CAAC,WAAW,CAAC,UAAU,EAAE,eAAe,CAAC,CAAC;oBACtD,CAAC;gBACF,CAAC;YACF,CAAC;YACD,MAAM,CAAC,MAAgB,EAAE,KAAa,EAAE,WAAuB;gBAC9D,IAAI,CAAC,sBAAsB,EAAE,CAAC;gBAC9B,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,KAAK,EAAE,WAAW,CAAC,CAAC;gBAC5C,IAAI,CAAC,qBAAqB,EAAE,CAAC;YAC9B,CAAC;YACD,UAAU,CAAC,MAAgB,EAAE,KAAa,EAAE,WAAuB;gBAClE,IAAA,iBAAM,EACL,IAAI,CAAC,WAAW,KAAK,SAAS,EAC9B,KAAK,CAAC,2CAA2C,CACjD,CAAC;gBACF,MAAM,UAAU,GAAG;oBAClB,MAAM,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI;oBAC3B,WAAW,EAAE,MAAM;oBACnB,WAAW,EAAE,CAAC;iBACd,CAAC;gBACF,MAAM,eAAe,GAAG;oBACvB,MAAM,EAAE,IAAI,CAAC,MAAM;oBACnB,WAAW,EAAE,IAAI,CAAC,WAAW;oBAC7B,WAAW,EAAE,WAAW;iBACxB,CAAC;gBACF,IAAI,CAAC,SAAS,CAAC,YAAY,CAAC,UAAU,EAAE,eAAe,EAAE,KAAK,CAAC,CAAC;gBAChE,IAAI,CAAC,+BAA+B,GAAG,IAAI,CAAC,YAAY,CAAC;YAC1D,CAAC;YACD,YAAY,CAAC,MAAa,EAAE,WAAqB;gBAChD,IAAA,iBAAM,EACL,IAAI,CAAC,WAAW,KAAK,SAAS,EAC9B,KAAK,CAAC,2CAA2C,CACjD,CAAC;gBACF,MAAM,UAAU,GAAgB;oBAC/B,MAAM,EAAE,IAAI,CAAC,MAAM;oBACnB,KAAK,EAAE,IAAI,CAAC,WAAW;oBACvB,GAAG,MAAM;iBACT,CAAC;gBACF,MAAM,eAAe,GAAwB,IAAA,gBAAK,EAAC;oBAClD,KAAK,EAAE,WAAW;oBAClB,KAAK,EAAE,CAAC;iBACR,CAAC,CAAC;gBACH,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,EAAE,CAAC;oBACnD,KAAK,MAAM,WAAW,IAAI,QAAQ,EAAE,CAAC;wBACpC,WAAW,CAAC,YAAY,CAAC,UAAU,EAAE,eAAe,CAAC,CAAC;oBACvD,CAAC;gBACF,CAAC;YACF,CAAC;YACD,WAAW,CAAC,MAAkB,EAAE,KAAa,EAAE,WAAqB;gBACnE,IAAA,iBAAM,EACL,IAAI,CAAC,WAAW,KAAK,SAAS,EAC9B,KAAK,CAAC,2CAA2C,CACjD,CAAC;gBACF,MAAM,UAAU,GAAgB;oBAC/B,MAAM,EAAE,IAAI,CAAC,MAAM;oBACnB,KAAK,EAAE,IAAI,CAAC,WAAW;oBACvB,KAAK,EAAE,MAAM;iBACb,CAAC;gBACF,MAAM,eAAe,GAAwB,IAAA,gBAAK,EAAC;oBAClD,KAAK,EAAE,WAAW;oBAClB,KAAK,EAAE,CAAC;oBACR,GAAG,EAAE,KAAK;iBACV,CAAC,CAAC;gBACH,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,EAAE,CAAC;oBACnD,KAAK,MAAM,WAAW,IAAI,QAAQ,EAAE,CAAC;wBACpC,WAAW,CAAC,WAAW,CAAC,UAAU,EAAE,eAAe,CAAC,CAAC;oBACtD,CAAC;gBACF,CAAC;YACF,CAAC;YACD,MAAM,CAAC,MAAa,EAAE,WAAqB;gBAC1C,IAAI,CAAC,sBAAsB,EAAE,CAAC;gBAC9B,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;gBACrC,IAAI,CAAC,qBAAqB,EAAE,CAAC;YAC9B,CAAC;YACD,UAAU,CAAC,MAAa,EAAE,WAAqB;gBAC9C,IAAA,iBAAM,EACL,IAAI,CAAC,WAAW,KAAK,SAAS,EAC9B,KAAK,CAAC,2CAA2C,CACjD,CAAC;gBACF,MAAM,UAAU,GAAG;oBAClB,MAAM,EAAE,IAAI,CAAC,MAAM;oBACnB,WAAW,EAAE,IAAI,CAAC,WAAW;oBAC7B,WAAW,EAAE,MAAM,CAAC,KAAK;iBACzB,CAAC;gBACF,MAAM,eAAe,GAAG;oBACvB,MAAM,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI;oBAC3B,WAAW,EAAE,WAAW;oBACxB,WAAW,EAAE,CAAC;iBACd,CAAC;gBACF,IAAI,CAAC,SAAS,CAAC,YAAY,CAAC,UAAU,EAAE,eAAe,EAAE,MAAM,CAAC,GAAG,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;gBACpF,IAAI,CAAC,+BAA+B,GAAG,IAAI,CAAC,YAAY,CAAC;YAC1D,CAAC;YACD,aAAa,CAAC,UAAoB,EAAE,UAAiB,EAAE,WAAqB;gBAC3E,IAAA,iBAAM,EACL,IAAI,CAAC,WAAW,KAAK,SAAS,EAC9B,KAAK,CAAC,4CAA4C,CAClD,CAAC;gBACF,MAAM,cAAc,GAAgB;oBACnC,MAAM,EAAE,IAAI,CAAC,MAAM;oBACnB,KAAK,EAAE,IAAI,CAAC,WAAW;oBACvB,GAAG,UAAU;iBACb,CAAC;gBACF,MAAM,kBAAkB,GAAwB,IAAA,gBAAK,EAAC;oBACrD,KAAK,EAAE,UAAU;oBACjB,KAAK,EAAE,CAAC;oBACR,GAAG,EAAE,UAAU,CAAC,GAAG,GAAG,UAAU,CAAC,KAAK;iBACtC,CAAC,CAAC;gBACH,MAAM,uBAAuB,GAAwB,IAAA,gBAAK,EAAC;oBAC1D,KAAK,EAAE,WAAW;oBAClB,KAAK,EAAE,CAAC;iBACR,CAAC,CAAC;gBACH,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,EAAE,CAAC;oBACnD,KAAK,MAAM,WAAW,IAAI,QAAQ,EAAE,CAAC;wBACpC,WAAW,CAAC,aAAa,CACxB,kBAAkB,EAClB,cAAc,EACd,uBAAuB,CACvB,CAAC;oBACH,CAAC;gBACF,CAAC;YACF,CAAC;YACD,YAAY,CAAC,gBAA0B,EAAE,UAAiB,EAAE,UAAoB;gBAC/E,IAAA,iBAAM,EACL,IAAI,CAAC,WAAW,KAAK,SAAS,EAC9B,KAAK,CAAC,4CAA4C,CAClD,CAAC;gBACF,MAAM,cAAc,GAAgB;oBACnC,MAAM,EAAE,IAAI,CAAC,MAAM;oBACnB,KAAK,EAAE,IAAI,CAAC,WAAW;oBACvB,GAAG,UAAU;iBACb,CAAC;gBACF,MAAM,kBAAkB,GAAwB,IAAA,gBAAK,EAAC;oBACrD,KAAK,EAAE,gBAAgB;oBACvB,KAAK,EAAE,CAAC;iBACR,CAAC,CAAC;gBACH,MAAM,uBAAuB,GAAwB,IAAA,gBAAK,EAAC;oBAC1D,KAAK,EAAE,UAAU;oBACjB,KAAK,EAAE,CAAC;oBACR,GAAG,EAAE,UAAU,CAAC,GAAG,GAAG,UAAU,CAAC,KAAK;iBACtC,CAAC,CAAC;gBACH,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,EAAE,CAAC;oBACnD,KAAK,MAAM,WAAW,IAAI,QAAQ,EAAE,CAAC;wBACpC,WAAW,CAAC,YAAY,CACvB,kBAAkB,EAClB,cAAc,EACd,uBAAuB,CACvB,CAAC;oBACH,CAAC;gBACF,CAAC;YACF,CAAC;YACD,OAAO,CACN,gBAA0B,EAC1B,KAAY,EACZ,qBAA+B;gBAE/B,IAAI,CAAC,sBAAsB,EAAE,CAAC;gBAC9B,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,qBAAqB,CAAC,CAAC;gBAC9C,IAAI,CAAC,UAAU,CAAC,gBAAgB,EAAE,KAAK,CAAC,GAAG,GAAG,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;gBACxE,IAAI,CAAC,qBAAqB,EAAE,CAAC;YAC9B,CAAC;YACD,OAAO,CAAC,aAAuB,EAAE,KAAa;gBAC7C,IAAI,CAAC,SAAS,CAAC,cAAc,CAC5B;oBACC,MAAM,EAAE,SAAS;oBACjB,WAAW,EAAE,aAAa;oBAC1B,WAAW,EAAE,CAAC;iBACd,EACD,KAAK,CACL,CAAC;YACH,CAAC;YACD,aAAa,CAAC,aAAuB,EAAE,KAAa;gBACnD,MAAM,KAAK,GAAwB,IAAA,gBAAK,EAAC;oBACxC,KAAK,EAAE,aAAa;oBACpB,KAAK,EAAE,CAAC;oBACR,GAAG,EAAE,KAAK;iBACV,CAAC,CAAC;gBACH,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,EAAE,CAAC;oBACnD,KAAK,MAAM,WAAW,IAAI,QAAQ,EAAE,CAAC;wBACpC,WAAW,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;oBAClC,CAAC;gBACF,CAAC;YACF,CAAC;YACD,MAAM,CAAC,OAAyB,EAAE,WAAqB;gBACtD,2EAA2E;gBAC3E,oCAAoC;YACrC,CAAC;YACD,WAAW,CAAC,OAAyB,EAAE,WAAqB;gBAC3D,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,EAAE,CAAC;oBACnD,KAAK,MAAM,WAAW,IAAI,QAAQ,EAAE,CAAC;wBACpC,MAAM,SAAS,GAAwB,IAAA,gBAAK,EAAC;4BAC5C,KAAK,EAAE,WAAW;4BAClB,KAAK,EAAE,CAAC;4BACR,GAAG,EAAE,OAAO,CAAC,MAAM;yBACnB,CAAC,CAAC;wBACH,WAAW,CAAC,WAAW,CAAC,SAAS,CAAC,CAAC;oBACpC,CAAC;gBACF,CAAC;YACF,CAAC;YACD,SAAS,CAAC,KAAa;gBACtB,IAAA,iBAAM,EAAC,IAAI,CAAC,WAAW,KAAK,SAAS,EAAE,KAAK,CAAC,sCAAsC,CAAC,CAAC;gBAErF,IAAI,CAAC,MAAM,GAAG;oBACb,MAAM,EAAE,IAAI,CAAC,MAAM;oBACnB,WAAW,EAAE,IAAI,CAAC,WAAW;oBAC7B,WAAW,EAAE,KAAK;iBAClB,CAAC;gBACF,IAAI,CAAC,WAAW,GAAG,SAAS,CAAC;gBAC7B,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,EAAE;oBACxB,mCAAmC;oBACnC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;wBAC/B,MAAM,QAAQ,GAA2B,CAAC,CAAC,MAAM,CAAC,cAAc,CAC/D,iBAAiB,EACjB,CAAC,CACD,CAAC;wBACF,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;4BACzB,IAAI,CAAC,YAAY,CAAC,GAAG,CACpB,CAAC,EACD,IAAI,GAAG,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAoB,EAAE,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC,CAClE,CAAC;wBACH,CAAC;oBACF,CAAC;gBACF,CAAC,CAAC,CAAC;gBACH,IAAI,CAAC,YAAY,EAAE,CAAC;YACrB,CAAC;YACD,QAAQ,CAAC,KAAa;gBACrB,IAAA,iBAAM,EAAC,IAAI,CAAC,MAAM,KAAK,SAAS,EAAE,KAAK,CAAC,2BAA2B,CAAC,CAAC;gBACrE,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,EAAE;oBACxB,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,gBAAgB,EAAE,CAAC,CAAC,CAAC;oBACnC,IAAI,IAAI,CAAC,+BAA+B,KAAK,IAAI,CAAC,YAAY,EAAE,CAAC;wBAChE,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC;4BACxB,IAAI,EAAE,CAAC;4BACP,KAAK,EAAE,0BAA0B;yBACjC,CAAC,CAAC;wBACH,IAAI,CAAC,+BAA+B,EAAE,CAAC;oBACxC,CAAC;oBACD,mEAAmE;oBACnE,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBAC7B,CAAC,CAAC,CAAC;gBACH,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;gBAC3B,IAAI,CAAC,WAAW,GAAG,MAAM,CAAC,WAAW,CAAC;gBACtC,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC;gBAC5B,IAAI,CAAC,YAAY,EAAE,CAAC;YACrB,CAAC;YACD,UAAU,CAAC,GAAa;gBACvB,IAAI,CAAC,WAAW,GAAG,GAAG,CAAC;YACxB,CAAC;YACD,SAAS,CAAC,GAAa;gBACtB,IAAI,CAAC,WAAW,GAAG,SAAS,CAAC;YAC9B,CAAC;SACD,CAAC;QACF,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,cAAc,EAAE,IAAI,CAAC,CAAC;QACvC,IAAI,CAAC,aAAa,GAAG,OAAO,CAAC;QAC7B,OAAO,OAAO,CAAC;IAChB,CAAC;CACD;AA7xBD,8BA6xBC;AAED;;GAEG;AACH,IAAK,MAuBJ;AAvBD,WAAK,MAAM;IACV;;;OAGG;IACH,qCAAK,CAAA;IACL;;;;;;OAMG;IACH,2CAAQ,CAAA;IACR;;;;;;;OAOG;IACH,2CAAQ,CAAA;AACT,CAAC,EAvBI,MAAM,KAAN,MAAM,QAuBV;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4BG;AACH,MAAM,QAAS,SAAQ,+BAAoB;IAuB1C;;;;OAIG;IACH,YACiB,SAAoB,EAC7B,WAAqB,EACrB,WAAmB;IAC1B;;;;;;;;;;OAUG;IACI,UAAgC;QAEvC,KAAK,CAAC,CAAC,CAAC,CAAC;QAhBO,cAAS,GAAT,SAAS,CAAW;QAC7B,gBAAW,GAAX,WAAW,CAAU;QACrB,gBAAW,GAAX,WAAW,CAAQ;QAYnB,eAAU,GAAV,UAAU,CAAsB;QA1CjC,WAAM,GAAW,MAAM,CAAC,KAAK,CAAC;QACrC;;WAEG;QACa,WAAM,GAAG,IAAA,wBAAa,EAAe,GAAG,EAAE,CAAC,IAAI,CAAC,eAAe,EAAE,CAAC,CAAC;QAEnF;;;;;;;;;WASG;QACa,aAAQ,GAA8B,IAAI,GAAG,EAAE,CAAC;QAEhE,0BAA0B;QAC1B,8DAA8D;QAC9C,UAAK,GAAsC,IAAI,GAAG,EAAE,CAAC;IAyBrE,CAAC;IAEM,EAAE,CACR,SAAY,EACZ,QAAyB;QAEzB,OAAO,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;IAC5C,CAAC;IAEM,KAAK,CAAC,GAAa,EAAE,KAAa;QACxC,yCAAyC;QACzC,OAAO,CACN,IAAI,CAAC,WAAW,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,WAAW,EAAE,GAAG,EAAE,WAAW,EAAE,KAAK,EAAE,CACtF,CAAC;IACH,CAAC;IAEM,mBAAmB,CAAC,GAAa,EAAE,KAAa;QACtD,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC;QAC5D,MAAM,IAAI,GACT,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,IAAA,eAAI,EAAC,4CAA4C,CAAC,CAAC;QACrF,OAAO,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;IACvB,CAAC;IAED;;;;;OAKG;IACK,MAAM;QACb,OAAO,IAAI,CAAC,UAAU,KAAK,SAAS,CAAC;IACtC,CAAC;IAED,IAAW,MAAM;QAChB,IAAA,iBAAM,EAAC,IAAI,CAAC,MAAM,KAAK,MAAM,CAAC,QAAQ,EAAE,KAAK,CAAC,mCAAmC,CAAC,CAAC;QACnF,IAAA,iBAAM,EACL,IAAI,CAAC,UAAU,KAAK,SAAS,EAC7B,KAAK,CAAC,4FAA4F,CAClG,CAAC;QACF,kEAAkE;QAClE,IAAI,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,EAAE,CAAC;YAC9B,OAAO,SAAS,CAAC;QAClB,CAAC;QACD,OAAO,IAAI,CAAC,UAAU,CAAC;IACxB,CAAC;IAEM,MAAM,CAAC,KAAK,GAAG,CAAC;QACtB,IAAA,iBAAM,EAAC,IAAI,CAAC,MAAM,KAAK,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,4BAA4B,CAAC,CAAC;QACzE,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC;IAC5B,CAAC;IAEM,SAAS,CAAC,KAAK,GAAG,CAAC;QACzB,IAAA,iBAAM,EAAC,IAAI,CAAC,MAAM,KAAK,MAAM,CAAC,QAAQ,EAAE,KAAK,CAAC,mCAAmC,CAAC,CAAC;QACnF,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC;IAC9B,CAAC;IAED,oCAAoC;IACpC,iEAAiE;IACvD,cAAc;QACvB,IAAI,CAAC,eAAe,EAAE,CAAC;IACxB,CAAC;IAED;;;OAGG;IACI,gBAAgB,CAAC,GAAa,EAAE,KAAa;QACnD,IAAA,iBAAM,EAAC,IAAI,CAAC,MAAM,KAAK,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,4BAA4B,CAAC,CAAC;QACzE,IAAI,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACnC,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACzB,KAAK,GAAG,EAAE,CAAC;YACX,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAC/B,CAAC;QACD,6DAA6D;QAC7D,IAAI,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,KAAK,KAAK,CAAC,CAAC;QACvD,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACzB,KAAK,GAAG,IAAI,QAAQ,CAAC,IAAI,CAAC,SAAS,EAAE,GAAG,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;YACvD,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAClB,6BAA6B;YAC7B,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,GAAG,CAAC,CAAC,WAAW,CAAC,CAAC;QACrD,CAAC;aAAM,CAAC;YACP,KAAK,CAAC,MAAM,EAAE,CAAC;QAChB,CAAC;QACD,OAAO,KAAK,CAAC;IACd,CAAC;IAED;;;OAGG;IACI,WAAW,CAAC,GAAa,EAAE,KAAa;QAC9C,IAAA,iBAAM,EAAC,IAAI,CAAC,MAAM,KAAK,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,4BAA4B,CAAC,CAAC;QACzE,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAErC,mFAAmF;QACnF,OAAO,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,KAAK,KAAK,CAAC,CAAC;IACpD,CAAC;IAED;;;;OAIG;IACI,WAAW,CAAC,KAAe;QACjC,IAAA,iBAAM,EAAC,IAAI,CAAC,MAAM,KAAK,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,4BAA4B,CAAC,CAAC;QACzE,MAAM,GAAG,GAAG,KAAK,CAAC,WAAW,CAAC;QAC9B,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACrC,gGAAgG;QAChG,yFAAyF;QACzF,MAAM,UAAU,GAAG,KAAK,EAAE,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC;QAC/C,IAAA,iBAAM,EAAC,UAAU,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,0CAA0C,CAAC,CAAC;QAC5E,KAAK,EAAE,MAAM,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;QAC7B,IAAI,KAAK,EAAE,MAAM,KAAK,CAAC,EAAE,CAAC;YACzB,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC;QAC3B,CAAC;IACF,CAAC;IAED;;;;OAIG;IACI,eAAe,CAAC,GAAa;QACnC,IAAA,iBAAM,EAAC,IAAI,CAAC,MAAM,KAAK,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,4BAA4B,CAAC,CAAC;QACzE,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAC1B,IAAI,CAAC,eAAe,EAAE,CAAC;IACxB,CAAC;IAED;;;;;;OAMG;IACK,eAAe;QACtB,IAAA,iBAAM,EAAC,IAAI,CAAC,MAAM,KAAK,MAAM,CAAC,QAAQ,EAAE,KAAK,CAAC,mCAAmC,CAAC,CAAC;QACnF,IAAI,IAAI,CAAC,cAAc,EAAE,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,YAAY,EAAE,EAAE,CAAC;YACtF,IAAI,IAAI,CAAC,MAAM,KAAK,MAAM,CAAC,KAAK,EAAE,CAAC;gBAClC,IAAI,CAAC,UAAU,EAAE,WAAW,CAAC,IAAI,CAAC,CAAC;YACpC,CAAC;YACD,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC,QAAQ,CAAC;QAC/B,CAAC;IACF,CAAC;CACD","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 { type Listenable, createEmitter } from \"../../events/index.js\";\nimport {\n\ttype Brand,\n\ttype BrandedKey,\n\ttype BrandedMapSubset,\n\ttype Opaque,\n\tReferenceCountedBase,\n\tbrand,\n\tbrandedSlot,\n\tfail,\n} from \"../../util/index.js\";\nimport type { FieldKey } from \"../schema-stored/index.js\";\n\nimport type as Delta from \"./delta.js\";\nimport type {\n\tDetachedPlaceUpPath,\n\tDetachedRangeUpPath,\n\tPlaceIndex,\n\tPlaceUpPath,\n\tRange,\n\tRangeUpPath,\n\tUpPath,\n} from \"./pathTree.js\";\nimport { EmptyKey, type Value } from \"./types.js\";\nimport type { DeltaVisitor } from \"./visitDelta.js\";\nimport type { PathVisitor } from \"./visitPath.js\";\nimport type { AnnouncedVisitor } from \"./visitorUtils.js\";\n\n/*\n A way to refer to a particular tree location within an {@link AnchorSet}.\n * Associated with a ref count on the underlying {@link AnchorNode}.\n * @internal\n /\nexport type Anchor = Brand<number, \"rebaser.Anchor\">;\n\n/\n A singleton which represents a permanently invalid location (i.e. there is never a node there)\n /\nconst NeverAnchor: Anchor = brand(0);\n\n/\n Maps anchors (which must be ones this locator knows about) to paths.\n * @internal\n /\nexport interface AnchorLocator {\n\t/\n\t Get the current location of an Anchor.\n\t * The returned value should not be used after an edit has occurred.\n\t \n\t TODO: support extra/custom return types for specific/custom anchor types:\n\t * for now caller must rely on data in anchor + returned node location\n\t * (not ideal for anchors for places or ranges instead of nodes).\n\t /\n\tlocate(anchor: Anchor): AnchorNode \| undefined;\n}\n\n/\n Stores arbitrary, user-defined data on an {@link Anchor}.\n * This data is preserved over the course of that anchor's lifetime.\n * @see {@link anchorSlot} for creation and an example use case.\n * @internal\n /\nexport type AnchorSlot<TContent> = BrandedKey<Opaque<Brand<number, \"AnchorSlot\">>, TContent>;\n\n/\n Events for {@link AnchorNode}.\n * These events are triggered while the internal data structures are being updated.\n * Thus these events must not trigger reading of the anchorSet or forest.\n \n TODO:\n * - Include sub-deltas in events.\n * - Add more events.\n \n @internal\n /\nexport interface AnchorEvents {\n\t/\n\t When the anchor node will never get reused by its AnchorSet.\n\t * This means that the content it corresponds to has been permanently destroyed.\n\t \n\t @remarks\n\t * When this happens depends entirely on how the anchorSet is used.\n\t * It's possible nodes removed from the tree will be kept indefinitely, and thus never trigger this event, or they may be discarded immediately.\n\t \n\t @privateRemarks\n\t * The specifics of the delta visit algorithm can impact the behavior of these events.\n\t * Refer to the privateRemarks of specific events and/or the documentation of the delta visit algorithm (as of\n\t * 2024-04-02, src/core/tree/visitDelta.ts) for more information.\n\t /\n\tafterDestroy(anchor: AnchorNode): void;\n\n\t/\n\t Emitted in the middle of applying a batch of changes (i.e. during a delta a visit), if one or more of this node's\n\t * direct children are about to change due to updates from the batch.\n\t \n\t @remarks\n\t * Does not include edits of child subtrees: instead only includes changes to nodes which are direct children in this\n\t * node's fields.\n\t /\n\tchildrenChanging(anchor: AnchorNode): void;\n\n\t/\n\t Emitted in the middle of applying a batch of changes (i.e. during a delta a visit), if one or more of this node's\n\t * direct children just changed due to updates from the batch.\n\t \n\t @remarks\n\t * Does not include edits of child subtrees: instead only includes changes to nodes which are direct children in this\n\t * node's fields.\n\t \n\t Compare to {@link AnchorEvents.childrenChangedAfterBatch} which is emitted after the whole batch has been applied.\n\t /\n\tchildrenChanged(anchor: AnchorNode): void;\n\n\t/\n\t Emitted after a batch of changes has been applied (i.e. when a delta visit completes), if one or more of this node's\n\t * direct children changed due to updates from the batch.\n\t \n\t @remarks\n\t * Does not include edits of child subtrees: instead only includes changes to nodes which are direct children in this\n\t * node's fields.\n\t \n\t This event is guaranteed to be emitted on a given node only once per batch.\n\t \n\t Compare to {@link AnchorEvents.childrenChanged} which is emitted in the middle of the batch/delta-visit.\n\t /\n\tchildrenChangedAfterBatch(anchor: AnchorNode): void;\n\n\t/\n\t Emitted in the middle of applying a batch of changes (i.e. during a delta a visit), if something in the subtree\n\t * rooted at `anchor` _may_ be about to change due to updates from the batch.\n\t \n\t @remarks\n\t * The event can optionally return a {@link PathVisitor} to traverse the subtree.\n\t * Called on every parent (transitively) when a change is occurring.\n\t /\n\tsubtreeChanging(anchor: AnchorNode): PathVisitor \| void;\n\n\t/\n\t Emitted in the middle of applying a batch of changes (i.e. during a delta a visit), if something in the subtree\n\t * rooted at `anchor` _may_ have just changed due to updates from the batch.\n\t \n\t @remarks\n\t * While this event is always emitted in the presence of changes to the subtree,\n\t * it may also be emitted even though no changes have been made to the subtree.\n\t * It may be emitted multiple times within the application of a single edit or transaction.\n\t \n\t If this event is emitted by a node, it will later be emitted by all its ancestors up to the root as well, at\n\t * least once on each ancestor.\n\t \n\t Compare to {@link AnchorEvents.subtreeChangedAfterBatch} which is emitted after the whole batch has been applied.\n\t \n\t @privateRemarks\n\t * The delta visit algorithm is complicated and it may fire this event multiple times for the same change to a node.\n\t * The change to the tree may not be visible until the event fires for the last time.\n\t * Refer to the documentation of the delta visit algorithm for more details.\n\t /\n\tsubtreeChanged(anchor: AnchorNode): void;\n\n\t/\n\t Emitted after a batch of changes has been applied (i.e. when a delta visit completes), if something in the subtree\n\t * rooted at `anchor` changed due to updates from the batch.\n\t \n\t @remarks\n\t * If this event is emitted by a node, it will later be emitted by all its ancestors up to the root as well, from bottom to top.\n\t \n\t This event is guaranteed to be emitted on a given node only once per batch.\n\t \n\t Compare to {@link AnchorEvents.subtreeChanged} which is emitted in the middle of the batch/delta-visit.\n\t \n\t @privateRemarks\n\t * Note that because this is fired after the full batch of changes is applied, it guarantees that something in the\n\t * subtree changed, compared to {@link AnchorEvents.subtreeChanged} or {@link AnchorEvents.subtreeChanging} which\n\t * fire when something _may_ have changed or _may_ be about to change.\n\t /\n\tsubtreeChangedAfterBatch(anchor: AnchorNode): void;\n\n\t/\n\t Value on this node is changing.\n\t /\n\tvalueChanging(anchor: AnchorNode, value: Value): void;\n}\n\n/\n Events for {@link AnchorSet}.\n * These events are triggered while the internal data structures are being updated.\n * Thus these events must not trigger reading of the anchorSet or forest.\n \n TODO:\n * - Design how events should be ordered.\n * - Include sub-deltas in events.\n * - Add more events.\n \n @internal\n /\nexport interface AnchorSetRootEvents {\n\t/\n\t What children are at the root is changing.\n\t /\n\tchildrenChanging(anchors: AnchorSet): void;\n\n\t/\n\t Something in the tree is changing.\n\t /\n\ttreeChanging(anchors: AnchorSet): void;\n}\n\n/\n Node in a tree of anchors.\n * @internal\n /\nexport interface AnchorNode extends UpPath<AnchorNode>, Listenable<AnchorEvents> {\n\t/\n\t Allows access to data stored on the Anchor in \"slots\".\n\t * Use {@link anchorSlot} to create slots.\n\t /\n\t// See note on BrandedKey\n\t// eslint-disable-next-line @typescript-eslint/no-explicit-any\n\treadonly slots: BrandedMapSubset<AnchorSlot<any>>;\n\n\t/\n\t The set this anchor node is part of.\n\t /\n\treadonly anchorSet: AnchorSet;\n\n\t/\n\t Gets a child of this node.\n\t \n\t @remarks\n\t * This does not return an AnchorNode since there might not be one, and lazily creating one here would have messy lifetime management (See {@link AnchorNode#getOrCreateChildRef})\n\t * If an AnchorNode is required, use the AnchorSet to track then locate the returned path.\n\t * TODO:\n\t * Revisit this API.\n\t * Perhaps if we use weak down pointers and remove ref counting, we can make this return a AnchorNode.\n\t \n\t /\n\tchild(key: FieldKey, index: number): UpPath<AnchorNode>;\n\n\t/*\n\t Gets a child AnchorNode (creating it if needed), and an Anchor owning a ref to it.\n\t * Caller is responsible for freeing the returned Anchor, and must not use the AnchorNode after that.\n\t /\n\tgetOrCreateChildRef(key: FieldKey, index: number): [Anchor, AnchorNode];\n}\n\n/\n Define a strongly typed slot on anchors in which data can be stored.\n \n @remarks\n * This is mainly useful for caching data associated with a location in the tree.\n \n Example usage:\n * ```typescript\n * const counterSlot = anchorSlot<number>();\n \n function useSlot(anchor: AnchorNode): void {\n * \tanchor.slots.set(counterSlot, 1 + anchor.slots.get(counterSlot) ?? 0);\n * }\n * ```\n * @internal\n /\nexport function anchorSlot<TContent>(): AnchorSlot<TContent> {\n\treturn brandedSlot<AnchorSlot<TContent>>();\n}\n\n/\n Collection of Anchors at a specific revision.\n \n See `Rebaser` for how to update across revisions.\n \n TODO: this should not be package exported.\n * If it's needed outside the package an Interface should be used instead which can reduce its\n * API surface to a small subset.\n \n @sealed\n * @internal\n /\nexport class AnchorSet implements Listenable<AnchorSetRootEvents>, AnchorLocator {\n\tprivate readonly events = createEmitter<AnchorSetRootEvents>();\n\t/\n\t Incrementing counter to give each anchor in this set a unique index for its identifier.\n\t * \"0\" is reserved for the `NeverAnchor`.\n\t /\n\tprivate anchorCounter = 1;\n\n\t/\n\t Incrementing number that is bumped each time that the {@link AnchorSet} is changed.\n\t * This allows consumers to cache state associated with a particular generation number and later determine if that state may have been invalidated using a comparison with the current generation number.\n\t * For example, anchor slots can be used to cache the removal status of a node to memoize repeated walks up the tree.\n\t /\n\tpublic generationNumber = 0;\n\n\t/\n\t Special root node under which all anchors in this anchor set are transitively parented.\n\t * This does not appear in the UpPaths (instead they use undefined for the root).\n\t * Immediate children of this root are in detached fields (which have their identifiers used as the field keys).\n\t \n\t This is allocated with refCount one, which is never freed so it is never cleaned up\n\t * (as long as this AnchorSet is not garbage collected).\n\t \n\t There should never be any children other than the special root detached field under this between transactions:\n\t * TODO: check for and enforce this.\n\t /\n\tprivate readonly root = new PathNode(this, EmptyKey, 0, undefined);\n\n\t// TODO: anchor system could be optimized a bit to avoid the maps (Anchor is ref to Path, path has ref count).\n\t// For now use this more encapsulated approach with maps.\n\tprivate readonly anchorToPath: Map<Anchor, PathNode> = new Map();\n\n\tprivate activeVisitor?: DeltaVisitor;\n\n\tpublic constructor() {\n\t\tthis.on(\"treeChanging\", () => {\n\t\t\tthis.generationNumber += 1;\n\t\t});\n\t}\n\n\t/\n\t Allows access to data stored on the AnchorSet in \"slots\".\n\t * Use {@link anchorSlot} to create slots.\n\t \n\t @privateRemarks\n\t * This forwards to the slots of the special above root anchor which locate can't access.\n\t /\n\t// See note on BrandedKey.\n\t// eslint-disable-next-line @typescript-eslint/no-explicit-any\n\tpublic get slots(): BrandedMapSubset<AnchorSlot<any>> {\n\t\treturn this.root.slots;\n\t}\n\n\tpublic [Symbol.iterator](): IterableIterator<AnchorNode> {\n\t\tconst stack: PathNode[] = [];\n\t\tlet node: PathNode \| undefined = this.root;\n\t\twhile (node !== undefined) {\n\t\t\tyield node;\n\t\t\tfor (const [_, children] of node.children) {\n\t\t\t\tfor (const child of children) {\n\t\t\t\t\tstack.push(child);\n\t\t\t\t}\n\t\t\t}\n\t\t\tnode = stack.pop();\n\t\t}\n\t}\n\n\tpublic on<K extends keyof AnchorSetRootEvents>(\n\t\teventName: K,\n\t\tlistener: AnchorSetRootEvents[K],\n\t): () => void {\n\t\treturn this.events.on(eventName, listener);\n\t}\n\n\t/*\n\t Check if there are currently no anchors tracked.\n\t * Mainly for testing anchor cleanup.\n\t /\n\tpublic isEmpty(): boolean {\n\t\treturn this.root.children.size === 0;\n\t}\n\n\tpublic locate(anchor: Anchor): AnchorNode \| undefined {\n\t\tif (anchor === NeverAnchor) {\n\t\t\treturn undefined;\n\t\t}\n\n\t\tconst path = this.anchorToPath.get(anchor);\n\t\tassert(\n\t\t\tpath !== undefined,\n\t\t\t0x3a6 / Cannot locate anchor which is not in this AnchorSet /,\n\t\t);\n\t\treturn path.status === Status.Alive ? path : undefined;\n\t}\n\n\tpublic forget(anchor: Anchor): void {\n\t\tif (anchor !== NeverAnchor) {\n\t\t\tconst path = this.anchorToPath.get(anchor);\n\t\t\tassert(path !== undefined, 0x351 / cannot forget unknown Anchor /);\n\t\t\tpath.removeRef();\n\t\t\tthis.anchorToPath.delete(anchor);\n\t\t}\n\t}\n\n\t/\n\t TODO: Add APIs need to allow callers of this function to reduce copying here.\n\t * Ex: maybe return something extending UpPath here.\n\t * @param path - the path to the node to be tracked. If null, returns an anchor\n\t * which is permanently invalid.\n\t /\n\t// eslint-disable-next-line @rushstack/no-new-null\n\tpublic track(path: UpPath \| null): Anchor {\n\t\tif (path === null) {\n\t\t\treturn NeverAnchor;\n\t\t}\n\n\t\tconst foundPath = this.trackInner(path);\n\t\tconst anchor: Anchor = brand(this.anchorCounter++);\n\t\tthis.anchorToPath.set(anchor, foundPath);\n\t\treturn anchor;\n\t}\n\n\t/\n\t Finds a path node, creating if needed, and adds a ref count to it.\n\t /\n\tprivate trackInner(path: UpPath): PathNode {\n\t\tif (path instanceof PathNode && path.anchorSet === this) {\n\t\t\tpath.addRef();\n\t\t\treturn path;\n\t\t}\n\t\tconst parent = path.parent ?? this.root;\n\t\tconst parentPath = this.trackInner(parent);\n\n\t\tconst child = parentPath.getOrCreateChild(path.parentField, path.parentIndex);\n\n\t\t// Now that child is added (if needed), remove the extra ref that we added in the recursive call.\n\t\tparentPath.removeRef();\n\n\t\treturn child;\n\t}\n\n\t/\n\t Finds a path node if it already exists.\n\t /\n\tprivate find(path: UpPath): PathNode \| undefined {\n\t\tif (path instanceof PathNode) {\n\t\t\tif (path.anchorSet === this) {\n\t\t\t\treturn path;\n\t\t\t}\n\t\t}\n\t\tconst parent = path.parent ?? this.root;\n\t\tconst parentPath = this.find(parent);\n\t\treturn parentPath?.tryGetChild(path.parentField, path.parentIndex);\n\t}\n\n\t/\n\t Returns an equivalent path making as much of it with PathNodes as possible.\n\t * This allows future operations (like find, track, locate) on this path (and derived ones) to be faster.\n\t * Note that the returned path may use AnchorNodes from this AnchorSet,\n\t * but does not have a tracked reference to them, so this should not be held onto across anything that might free an AnchorNode.\n\t \n\t @remarks\n\t * Also ensures that any PathNode in the path is from this AnchorSet.\n\t /\n\tpublic internalizePath(originalPath: UpPath): UpPath {\n\t\tlet path: UpPath \| undefined = originalPath;\n\t\tconst stack: UpPath[] = [];\n\t\twhile (path !== undefined) {\n\t\t\tif (path instanceof PathNode && path.anchorSet === this) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tstack.push(path);\n\t\t\tpath = path.parent;\n\t\t}\n\n\t\t// Now `path` contains an internalized path.\n\t\t// It just needs the paths from stackOut to wrap it.\n\n\t\tlet wrapWith: UpPath \| undefined;\n\t\twhile ((wrapWith = stack.pop()) !== undefined) {\n\t\t\tif (path === undefined \|\| path instanceof PathNode) {\n\t\t\t\t// If path already has an anchor, get an anchor for it's child if there is one:\n\t\t\t\tconst child = (path ?? this.root).tryGetChild(\n\t\t\t\t\twrapWith.parentField,\n\t\t\t\t\twrapWith.parentIndex,\n\t\t\t\t);\n\t\t\t\tif (child !== undefined) {\n\t\t\t\t\tpath = child;\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t}\n\t\t\t// Replacing this if with a ternary makes the documentation harder to include and hurts readability.\n\t\t\t// eslint-disable-next-line unicorn/prefer-ternary\n\t\t\tif (path === wrapWith.parent && !(wrapWith instanceof PathNode)) {\n\t\t\t\t// path is safe to reuse from input path, so use it to avoid allocating another object.\n\t\t\t\tpath = wrapWith;\n\t\t\t} else {\n\t\t\t\tpath = {\n\t\t\t\t\tparent: path,\n\t\t\t\t\tparentField: wrapWith.parentField,\n\t\t\t\t\tparentIndex: wrapWith.parentIndex,\n\t\t\t\t};\n\t\t\t}\n\t\t}\n\n\t\treturn path ?? fail(\"internalize path must be a path\");\n\t}\n\n\t/\n\t Recursively marks the given `nodes` and their descendants as disposed and pointing to a deleted node.\n\t * Note that this does NOT detach the nodes.\n\t /\n\tprivate deepDelete(nodes: readonly PathNode[]): void {\n\t\tconst stack = [...nodes];\n\t\twhile (stack.length > 0) {\n\t\t\t// eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n\t\t\tconst node = stack.pop()!;\n\t\t\tassert(node.status === Status.Alive, 0x408 / PathNode must be alive /);\n\t\t\tnode.status = Status.Dangling;\n\t\t\tnode.events.emit(\"afterDestroy\", node);\n\t\t\tfor (const children of node.children.values()) {\n\t\t\t\tstack.push(...children);\n\t\t\t}\n\t\t}\n\t}\n\n\t/\n\t Decouple nodes from their parent.\n\t * This removes the reference from the parent to the decoupled children, and updates the indexes of the remaining children accordingly.\n\t * This does NOT update the decoupled children: both their index and parent are left at their existing values.\n\t * To decouple and fixup the children, see `removeChildren` and `moveChildren`.\n\t * @param startPath - The path to the first node that is being decoupled.\n\t * @param count - number of siblings that are decoupled from the original tree.\n\t \n\t TODO: tests\n\t /\n\tprivate decoupleNodes(startPath: UpPath, count: number): PathNode[] {\n\t\tassert(count > 0, 0x681 / count must be positive /);\n\n\t\tconst sourceParent = this.find(startPath.parent ?? this.root);\n\t\tconst sourceChildren = sourceParent?.children?.get(startPath.parentField);\n\t\tlet nodes: PathNode[] = [];\n\n\t\tif (sourceChildren !== undefined) {\n\t\t\tlet numberBeforeDecouple = 0;\n\t\t\tlet numberToDecouple = 0;\n\t\t\tlet index = 0;\n\t\t\twhile (\n\t\t\t\tindex < sourceChildren.length &&\n\t\t\t\tsourceChildren[index].parentIndex < startPath.parentIndex\n\t\t\t) {\n\t\t\t\tnumberBeforeDecouple++;\n\t\t\t\tindex++;\n\t\t\t}\n\t\t\twhile (\n\t\t\t\tindex < sourceChildren.length &&\n\t\t\t\tsourceChildren[index].parentIndex < startPath.parentIndex + count\n\t\t\t) {\n\t\t\t\tnumberToDecouple++;\n\t\t\t\tindex++;\n\t\t\t}\n\t\t\twhile (index < sourceChildren.length) {\n\t\t\t\t// Fix indexes in source after moved items (subtract count).\n\t\t\t\tsourceChildren[index].parentIndex -= count;\n\t\t\t\tindex++;\n\t\t\t}\n\t\t\t// Sever the parent -> child connections\n\t\t\tnodes = sourceChildren.splice(numberBeforeDecouple, numberToDecouple);\n\t\t\tif (sourceChildren.length === 0) {\n\t\t\t\t// eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n\t\t\t\tsourceParent!.afterEmptyField(startPath.parentField);\n\t\t\t}\n\t\t}\n\n\t\treturn nodes;\n\t}\n\n\t/\n\t Couple nodes to a parent.\n\t * @param destination - where the siblings are coupled to.\n\t * @param count - number of siblings that are coupled in the original tree.\n\t * @param coupleInfo - this object contains the nodes to couple and the parent index of the first node that is coupled in the original tree.\n\t \n\t TODO: tests\n\t /\n\tprivate coupleNodes(\n\t\tdestination: UpPath,\n\t\tcount: number,\n\t\tcoupleInfo: { startParentIndex: number; nodes: PathNode[] },\n\t): void {\n\t\tassert(coupleInfo.nodes.length > 0, 0x682 / coupleInfo must have nodes to couple /);\n\n\t\t// The destination needs to be created if it does not exist yet.\n\t\tconst destinationPath = this.trackInner(destination.parent ?? this.root);\n\n\t\t// Update nodes for new parent.\n\t\tfor (const node of coupleInfo.nodes) {\n\t\t\tnode.parentIndex += destination.parentIndex - coupleInfo.startParentIndex;\n\t\t\tnode.parentPath = destinationPath;\n\t\t\tnode.parentField = destination.parentField;\n\t\t}\n\n\t\t// Update new parent to add children\n\t\tconst field = destinationPath.children.get(destination.parentField);\n\t\tif (field === undefined) {\n\t\t\tdestinationPath.children.set(destination.parentField, coupleInfo.nodes);\n\t\t} else {\n\t\t\t// Update existing field contents\n\t\t\tconst numberBeforeCouple = this.increaseParentIndexes(\n\t\t\t\tfield,\n\t\t\t\tdestination.parentIndex,\n\t\t\t\tcount,\n\t\t\t);\n\n\t\t\t// TODO: this will fail for very large numbers of anchors due to argument limits.\n\t\t\tfield.splice(numberBeforeCouple, 0, ...coupleInfo.nodes);\n\t\t}\n\n\t\tdestinationPath.removeRef();\n\t}\n\n\t/\n\t Updates the parent indexes within `field` to account for `count` children being inserted at `fromParentIndex`. Note that\n\t * `fromParentIndex` is the logical position within the field, not the index with the sparse PathNode array.\n\t \n\t @param field - the field to update.\n\t * @param fromParentIndex - the logical index within the field to start updating from.\n\t * @param count - the number to increase parent indexes.\n\t * @returns the number of items in the field that are not increased.\n\t \n\t TODO: tests\n\t /\n\tprivate increaseParentIndexes(\n\t\tfield: PathNode[],\n\t\tfromParentIndex: number,\n\t\tcount: number,\n\t): number {\n\t\tlet index = 0;\n\t\twhile (index < field.length && field[index].parentIndex < fromParentIndex) {\n\t\t\tindex++;\n\t\t}\n\t\tconst numberBeforeIncrease = index;\n\t\twhile (index < field.length) {\n\t\t\tfield[index].parentIndex += count;\n\t\t\tindex++;\n\t\t}\n\n\t\treturn numberBeforeIncrease;\n\t}\n\n\t/\n\t Updates paths for a range move (including re-parenting path items and updating indexes).\n\t * @param sourceStart - where the siblings are removed from.\n\t * @param destination - where the siblings are moved to.\n\t * @param count - number of siblings to move.\n\t \n\t TODO:\n\t * How should anchors that become invalid, then valid again (ex: into content that was deleted, then undone) work?\n\t * Add an API to resurrect them? Store them in special detached fields? Store them in special non-detached fields?\n\t \n\t TODO:\n\t * How should custom anchors work (ex: ones not just tied to a specific Node)?\n\t * This design assumes they can be expressed in terms of a Node anchor + some extra stuff,\n\t * but we don't have an API for the extra stuff yet.\n\t \n\t TODO: tests\n\t /\n\tprivate moveChildren(sourceStart: UpPath, destination: UpPath, count: number): void {\n\t\tconst nodes = this.decoupleNodes(sourceStart, count);\n\t\tif (nodes.length > 0) {\n\t\t\tthis.coupleNodes(destination, count, {\n\t\t\t\tstartParentIndex: sourceStart.parentIndex,\n\t\t\t\tnodes,\n\t\t\t});\n\t\t} else {\n\t\t\t// If there are no nodes to move, we still need to update the parent indexes of the nodes\n\t\t\t// affected in the move in.\n\t\t\tthis.offsetChildren(destination, count);\n\t\t}\n\t}\n\n\tprivate removeChildren(path: UpPath, count: number): void {\n\t\tconst nodes = this.decoupleNodes(path, count);\n\t\tthis.deepDelete(nodes);\n\t}\n\n\t/\n\t Updates the parent indexes of all the nodes located at right side of the given path by the given offset.\n\t * @param firstSiblingToOffset - the path to offset children of.\n\t * @param offset - the offset to apply to the children.\n\t \n\t /\n\tprivate offsetChildren(firstSiblingToOffset: UpPath, offset: number): void {\n\t\tconst nodePath = this.find(firstSiblingToOffset.parent ?? this.root);\n\t\tconst field = nodePath?.children.get(firstSiblingToOffset.parentField);\n\t\tif (field !== undefined) {\n\t\t\tthis.increaseParentIndexes(field, firstSiblingToOffset.parentIndex, offset);\n\t\t}\n\t}\n\n\t/*\n\t Provides a visitor that can be used to mutate this {@link AnchorSet}.\n\t \n\t @returns A visitor that can be used to mutate this {@link AnchorSet}.\n\t \n\t @remarks\n\t * Mutating the {@link AnchorSet} does NOT update the forest.\n\t * The visitor must be released after use by calling {@link DeltaVisitor.free} on it.\n\t * It is invalid to acquire a visitor without releasing the previous one,\n\t * and this method will throw an error if this is attempted.\n\t /\n\tpublic acquireVisitor(): AnnouncedVisitor & DeltaVisitor {\n\t\tassert(\n\t\t\tthis.activeVisitor === undefined,\n\t\t\t0x767 / Must release existing visitor before acquiring another /,\n\t\t);\n\n\t\tconst referencedPathNodes: PathNode[] = [];\n\t\tconst visitor = {\n\t\t\tanchorSet: this,\n\t\t\t// Run `withNode` on anchorNode for parent if there is such an anchorNode.\n\t\t\t// If at root, run `withRoot` instead.\n\t\t\tmaybeWithNode(withNode: (anchorNode: PathNode) => void, withRoot?: () => void) {\n\t\t\t\tif (this.parent === undefined && withRoot !== undefined) {\n\t\t\t\t\twithRoot();\n\t\t\t\t} else {\n\t\t\t\t\tassert(this.parent !== undefined, 0x5b0 / parent must exist /);\n\t\t\t\t\t// TODO:Perf:\n\t\t\t\t\t// When traversing to a depth D when there are not anchors in that subtree, this goes O(D^2).\n\t\t\t\t\t// Delta traversal should early out in this case because no work is needed (and all move outs are known to not contain anchors).\n\t\t\t\t\tthis.parent = this.anchorSet.internalizePath(this.parent);\n\t\t\t\t\tif (this.parent instanceof PathNode) {\n\t\t\t\t\t\tthis.parent.addRef();\n\t\t\t\t\t\treferencedPathNodes.push(this.parent);\n\t\t\t\t\t\twithNode(this.parent);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t},\n\t\t\t// Lookup table for path visitors collected from {@link AnchorEvents.visitSubtreeChanging} emitted events.\n\t\t\t// The key is the path of the node that the visitor is registered on. The code ensures that the path visitor visits only the appropriate subtrees\n\t\t\t// by maintaining the mapping only during time between the {@link DeltaVisitor.enterNode} and {@link DeltaVisitor.exitNode} calls for a given anchorNode.\n\t\t\tpathVisitors: new Map<PathNode, Set<PathVisitor>>(),\n\t\t\tparentField: undefined as FieldKey \| undefined,\n\t\t\tparent: undefined as UpPath \| undefined,\n\t\t\tbufferedEvents: [] as { node: PathNode; event: keyof AnchorEvents }[],\n\n\t\t\t// 'currentDepth' and 'depthThresholdForSubtreeChanged' serve to keep track of when do we need to emit\n\t\t\t// subtreeChangedAfterBatch events.\n\t\t\t// The algorithm works as follows:\n\t\t\t// - Initialize both to 0.\n\t\t\t// - As we walk the tree from the root towards the leaves, when we enter a node increment currentDepth by 1.\n\t\t\t// - When we edit a node, set depthThresholdForSubtreeChanged = currentDepth.\n\t\t\t// Intuitively, depthThresholdForSubtreeChanged means \"as you walk the tree towards the root, when you exit a\n\t\t\t// node at this depth you should emit a subtreeChangedAfterBatch event\".\n\t\t\t// - When we exit a node, if d === currentDepth then emit a subtreeChangedAfterBatch and decrement d by 1.\n\t\t\t// Then decrement currentDepth unconditionally.\n\t\t\t// Note that the event will be emitted when exiting a node that was edited (depthThresholdForSubtreeChanged will\n\t\t\t// have been set to the current depth when the edit happened), it will be emitted when exiting a node that is the\n\t\t\t// parent of a node that already emitted the event (because both depthThresholdForSubtreeChanged and currentDepth\n\t\t\t// get decremented when exiting a node so they stay in sync), and if we're already emitting the event but start\n\t\t\t// walking the tree back towards the leaves in a path where no edits happen, currentDepth will be increased again\n\t\t\t// as we walk that path, depthThresholdForSubtreeChanged will not, and thus no event will be emitted when walking\n\t\t\t// back up that path, until we get back to the depth where we were already emitting the event, and will continue\n\t\t\t// emitting it on the way to the root.\n\t\t\tcurrentDepth: 0,\n\t\t\tdepthThresholdForSubtreeChanged: 0,\n\n\t\t\tfree() {\n\t\t\t\tassert(\n\t\t\t\t\tthis.anchorSet.activeVisitor !== undefined,\n\t\t\t\t\t0x768 / Multiple free calls for same visitor /,\n\t\t\t\t);\n\t\t\t\tfor (const node of referencedPathNodes) {\n\t\t\t\t\tnode.removeRef();\n\t\t\t\t}\n\t\t\t\tthis.anchorSet.activeVisitor = undefined;\n\t\t\t\tconst alreadyEmitted = new Map<PathNode, string[]>();\n\t\t\t\tfor (const { node, event } of this.bufferedEvents) {\n\t\t\t\t\tif (!alreadyEmitted.has(node)) {\n\t\t\t\t\t\talreadyEmitted.set(node, []);\n\t\t\t\t\t}\n\t\t\t\t\tconst emittedEvents = alreadyEmitted.get(node);\n\t\t\t\t\tif (emittedEvents?.includes(event) ?? false) {\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t\temittedEvents?.push(event);\n\t\t\t\t\tnode.events.emit(event, node);\n\t\t\t\t}\n\t\t\t},\n\t\t\tnotifyChildrenChanging(): void {\n\t\t\t\tthis.maybeWithNode(\n\t\t\t\t\t(p) => p.events.emit(\"childrenChanging\", p),\n\t\t\t\t\t() => this.anchorSet.events.emit(\"childrenChanging\", this.anchorSet),\n\t\t\t\t);\n\t\t\t},\n\t\t\tnotifyChildrenChanged(): void {\n\t\t\t\tthis.maybeWithNode(\n\t\t\t\t\t(p) => {\n\t\t\t\t\t\tp.events.emit(\"childrenChanged\", p);\n\t\t\t\t\t\tthis.bufferedEvents.push({\n\t\t\t\t\t\t\tnode: p,\n\t\t\t\t\t\t\tevent: \"childrenChangedAfterBatch\",\n\t\t\t\t\t\t});\n\t\t\t\t\t},\n\t\t\t\t\t() => {},\n\t\t\t\t);\n\t\t\t},\n\t\t\tbeforeAttach(source: FieldKey, count: number, destination: PlaceIndex): void {\n\t\t\t\tassert(\n\t\t\t\t\tthis.parentField !== undefined,\n\t\t\t\t\t0x7a0 / Must be in a field in order to attach /,\n\t\t\t\t);\n\t\t\t\tconst destinationPath: PlaceUpPath = {\n\t\t\t\t\tparent: this.parent,\n\t\t\t\t\tfield: this.parentField,\n\t\t\t\t\tindex: destination,\n\t\t\t\t};\n\t\t\t\tconst sourcePath: DetachedRangeUpPath = brand({\n\t\t\t\t\tfield: source,\n\t\t\t\t\tstart: 0,\n\t\t\t\t\tend: count,\n\t\t\t\t});\n\t\t\t\tfor (const visitors of this.pathVisitors.values()) {\n\t\t\t\t\tfor (const pathVisitor of visitors) {\n\t\t\t\t\t\tpathVisitor.beforeAttach(sourcePath, destinationPath);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t},\n\t\t\tafterAttach(source: FieldKey, destination: Range): void {\n\t\t\t\tassert(\n\t\t\t\t\tthis.parentField !== undefined,\n\t\t\t\t\t0x7a1 / Must be in a field in order to attach /,\n\t\t\t\t);\n\t\t\t\tconst sourcePath: DetachedPlaceUpPath = brand({\n\t\t\t\t\tfield: source,\n\t\t\t\t\tindex: 0,\n\t\t\t\t});\n\t\t\t\tconst destinationPath: RangeUpPath = {\n\t\t\t\t\tparent: this.parent,\n\t\t\t\t\tfield: this.parentField,\n\t\t\t\t\t...destination,\n\t\t\t\t};\n\t\t\t\tfor (const visitors of this.pathVisitors.values()) {\n\t\t\t\t\tfor (const pathVisitor of visitors) {\n\t\t\t\t\t\tpathVisitor.afterAttach(sourcePath, destinationPath);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t},\n\t\t\tattach(source: FieldKey, count: number, destination: PlaceIndex): void {\n\t\t\t\tthis.notifyChildrenChanging();\n\t\t\t\tthis.attachEdit(source, count, destination);\n\t\t\t\tthis.notifyChildrenChanged();\n\t\t\t},\n\t\t\tattachEdit(source: FieldKey, count: number, destination: PlaceIndex): void {\n\t\t\t\tassert(\n\t\t\t\t\tthis.parentField !== undefined,\n\t\t\t\t\t0x7a2 / Must be in a field in order to attach /,\n\t\t\t\t);\n\t\t\t\tconst sourcePath = {\n\t\t\t\t\tparent: this.anchorSet.root,\n\t\t\t\t\tparentField: source,\n\t\t\t\t\tparentIndex: 0,\n\t\t\t\t};\n\t\t\t\tconst destinationPath = {\n\t\t\t\t\tparent: this.parent,\n\t\t\t\t\tparentField: this.parentField,\n\t\t\t\t\tparentIndex: destination,\n\t\t\t\t};\n\t\t\t\tthis.anchorSet.moveChildren(sourcePath, destinationPath, count);\n\t\t\t\tthis.depthThresholdForSubtreeChanged = this.currentDepth;\n\t\t\t},\n\t\t\tbeforeDetach(source: Range, destination: FieldKey): void {\n\t\t\t\tassert(\n\t\t\t\t\tthis.parentField !== undefined,\n\t\t\t\t\t0x7a3 / Must be in a field in order to attach /,\n\t\t\t\t);\n\t\t\t\tconst sourcePath: RangeUpPath = {\n\t\t\t\t\tparent: this.parent,\n\t\t\t\t\tfield: this.parentField,\n\t\t\t\t\t...source,\n\t\t\t\t};\n\t\t\t\tconst destinationPath: DetachedPlaceUpPath = brand({\n\t\t\t\t\tfield: destination,\n\t\t\t\t\tindex: 0,\n\t\t\t\t});\n\t\t\t\tfor (const visitors of this.pathVisitors.values()) {\n\t\t\t\t\tfor (const pathVisitor of visitors) {\n\t\t\t\t\t\tpathVisitor.beforeDetach(sourcePath, destinationPath);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t},\n\t\t\tafterDetach(source: PlaceIndex, count: number, destination: FieldKey): void {\n\t\t\t\tassert(\n\t\t\t\t\tthis.parentField !== undefined,\n\t\t\t\t\t0x7a4 / Must be in a field in order to attach /,\n\t\t\t\t);\n\t\t\t\tconst sourcePath: PlaceUpPath = {\n\t\t\t\t\tparent: this.parent,\n\t\t\t\t\tfield: this.parentField,\n\t\t\t\t\tindex: source,\n\t\t\t\t};\n\t\t\t\tconst destinationPath: DetachedRangeUpPath = brand({\n\t\t\t\t\tfield: destination,\n\t\t\t\t\tstart: 0,\n\t\t\t\t\tend: count,\n\t\t\t\t});\n\t\t\t\tfor (const visitors of this.pathVisitors.values()) {\n\t\t\t\t\tfor (const pathVisitor of visitors) {\n\t\t\t\t\t\tpathVisitor.afterDetach(sourcePath, destinationPath);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t},\n\t\t\tdetach(source: Range, destination: FieldKey): void {\n\t\t\t\tthis.notifyChildrenChanging();\n\t\t\t\tthis.detachEdit(source, destination);\n\t\t\t\tthis.notifyChildrenChanged();\n\t\t\t},\n\t\t\tdetachEdit(source: Range, destination: FieldKey): void {\n\t\t\t\tassert(\n\t\t\t\t\tthis.parentField !== undefined,\n\t\t\t\t\t0x7a5 / Must be in a field in order to detach /,\n\t\t\t\t);\n\t\t\t\tconst sourcePath = {\n\t\t\t\t\tparent: this.parent,\n\t\t\t\t\tparentField: this.parentField,\n\t\t\t\t\tparentIndex: source.start,\n\t\t\t\t};\n\t\t\t\tconst destinationPath = {\n\t\t\t\t\tparent: this.anchorSet.root,\n\t\t\t\t\tparentField: destination,\n\t\t\t\t\tparentIndex: 0,\n\t\t\t\t};\n\t\t\t\tthis.anchorSet.moveChildren(sourcePath, destinationPath, source.end - source.start);\n\t\t\t\tthis.depthThresholdForSubtreeChanged = this.currentDepth;\n\t\t\t},\n\t\t\tbeforeReplace(newContent: FieldKey, oldContent: Range, destination: FieldKey): void {\n\t\t\t\tassert(\n\t\t\t\t\tthis.parentField !== undefined,\n\t\t\t\t\t0x7a6 / Must be in a field in order to replace /,\n\t\t\t\t);\n\t\t\t\tconst oldContentPath: RangeUpPath = {\n\t\t\t\t\tparent: this.parent,\n\t\t\t\t\tfield: this.parentField,\n\t\t\t\t\t...oldContent,\n\t\t\t\t};\n\t\t\t\tconst newNodesSourcePath: DetachedRangeUpPath = brand({\n\t\t\t\t\tfield: newContent,\n\t\t\t\t\tstart: 0,\n\t\t\t\t\tend: oldContent.end - oldContent.start,\n\t\t\t\t});\n\t\t\t\tconst oldNodesDestinationPath: DetachedPlaceUpPath = brand({\n\t\t\t\t\tfield: destination,\n\t\t\t\t\tindex: 0,\n\t\t\t\t});\n\t\t\t\tfor (const visitors of this.pathVisitors.values()) {\n\t\t\t\t\tfor (const pathVisitor of visitors) {\n\t\t\t\t\t\tpathVisitor.beforeReplace(\n\t\t\t\t\t\t\tnewNodesSourcePath,\n\t\t\t\t\t\t\toldContentPath,\n\t\t\t\t\t\t\toldNodesDestinationPath,\n\t\t\t\t\t\t);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t},\n\t\t\tafterReplace(newContentSource: FieldKey, newContent: Range, oldContent: FieldKey): void {\n\t\t\t\tassert(\n\t\t\t\t\tthis.parentField !== undefined,\n\t\t\t\t\t0x7a7 / Must be in a field in order to replace /,\n\t\t\t\t);\n\t\t\t\tconst newContentPath: RangeUpPath = {\n\t\t\t\t\tparent: this.parent,\n\t\t\t\t\tfield: this.parentField,\n\t\t\t\t\t...newContent,\n\t\t\t\t};\n\t\t\t\tconst newNodesSourcePath: DetachedPlaceUpPath = brand({\n\t\t\t\t\tfield: newContentSource,\n\t\t\t\t\tindex: 0,\n\t\t\t\t});\n\t\t\t\tconst oldNodesDestinationPath: DetachedRangeUpPath = brand({\n\t\t\t\t\tfield: oldContent,\n\t\t\t\t\tstart: 0,\n\t\t\t\t\tend: newContent.end - newContent.start,\n\t\t\t\t});\n\t\t\t\tfor (const visitors of this.pathVisitors.values()) {\n\t\t\t\t\tfor (const pathVisitor of visitors) {\n\t\t\t\t\t\tpathVisitor.afterReplace(\n\t\t\t\t\t\t\tnewNodesSourcePath,\n\t\t\t\t\t\t\tnewContentPath,\n\t\t\t\t\t\t\toldNodesDestinationPath,\n\t\t\t\t\t\t);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t},\n\t\t\treplace(\n\t\t\t\tnewContentSource: FieldKey,\n\t\t\t\trange: Range,\n\t\t\t\toldContentDestination: FieldKey,\n\t\t\t): void {\n\t\t\t\tthis.notifyChildrenChanging();\n\t\t\t\tthis.detachEdit(range, oldContentDestination);\n\t\t\t\tthis.attachEdit(newContentSource, range.end - range.start, range.start);\n\t\t\t\tthis.notifyChildrenChanged();\n\t\t\t},\n\t\t\tdestroy(detachedField: FieldKey, count: number): void {\n\t\t\t\tthis.anchorSet.removeChildren(\n\t\t\t\t\t{\n\t\t\t\t\t\tparent: undefined,\n\t\t\t\t\t\tparentField: detachedField,\n\t\t\t\t\t\tparentIndex: 0,\n\t\t\t\t\t},\n\t\t\t\t\tcount,\n\t\t\t\t);\n\t\t\t},\n\t\t\tbeforeDestroy(detachedField: FieldKey, count: number): void {\n\t\t\t\tconst range: DetachedRangeUpPath = brand({\n\t\t\t\t\tfield: detachedField,\n\t\t\t\t\tstart: 0,\n\t\t\t\t\tend: count,\n\t\t\t\t});\n\t\t\t\tfor (const visitors of this.pathVisitors.values()) {\n\t\t\t\t\tfor (const pathVisitor of visitors) {\n\t\t\t\t\t\tpathVisitor.beforeDestroy(range);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t},\n\t\t\tcreate(content: Delta.ProtoNodes, destination: FieldKey): void {\n\t\t\t\t// Nothing to do since content can only be created in a new detached field,\n\t\t\t\t// which cannot contain any anchors.\n\t\t\t},\n\t\t\tafterCreate(content: Delta.ProtoNodes, destination: FieldKey): void {\n\t\t\t\tfor (const visitors of this.pathVisitors.values()) {\n\t\t\t\t\tfor (const pathVisitor of visitors) {\n\t\t\t\t\t\tconst rangePath: DetachedRangeUpPath = brand({\n\t\t\t\t\t\t\tfield: destination,\n\t\t\t\t\t\t\tstart: 0,\n\t\t\t\t\t\t\tend: content.length,\n\t\t\t\t\t\t});\n\t\t\t\t\t\tpathVisitor.afterCreate(rangePath);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t},\n\t\t\tenterNode(index: number): void {\n\t\t\t\tassert(this.parentField !== undefined, 0x3ab / Must be in a field to enter node /);\n\n\t\t\t\tthis.parent = {\n\t\t\t\t\tparent: this.parent,\n\t\t\t\t\tparentField: this.parentField,\n\t\t\t\t\tparentIndex: index,\n\t\t\t\t};\n\t\t\t\tthis.parentField = undefined;\n\t\t\t\tthis.maybeWithNode((p) => {\n\t\t\t\t\t// avoid multiple pass side-effects\n\t\t\t\t\tif (!this.pathVisitors.has(p)) {\n\t\t\t\t\t\tconst visitors: (PathVisitor \| void)[] = p.events.emitAndCollect(\n\t\t\t\t\t\t\t\"subtreeChanging\",\n\t\t\t\t\t\t\tp,\n\t\t\t\t\t\t);\n\t\t\t\t\t\tif (visitors.length > 0) {\n\t\t\t\t\t\t\tthis.pathVisitors.set(\n\t\t\t\t\t\t\t\tp,\n\t\t\t\t\t\t\t\tnew Set(visitors.filter((v): v is PathVisitor => v !== undefined)),\n\t\t\t\t\t\t\t);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t});\n\t\t\t\tthis.currentDepth++;\n\t\t\t},\n\t\t\texitNode(index: number): void {\n\t\t\t\tassert(this.parent !== undefined, 0x3ac / Must have parent node /);\n\t\t\t\tthis.maybeWithNode((p) => {\n\t\t\t\t\tp.events.emit(\"subtreeChanged\", p);\n\t\t\t\t\tif (this.depthThresholdForSubtreeChanged === this.currentDepth) {\n\t\t\t\t\t\tthis.bufferedEvents.push({\n\t\t\t\t\t\t\tnode: p,\n\t\t\t\t\t\t\tevent: \"subtreeChangedAfterBatch\",\n\t\t\t\t\t\t});\n\t\t\t\t\t\tthis.depthThresholdForSubtreeChanged--;\n\t\t\t\t\t}\n\t\t\t\t\t// Remove subtree path visitors added at this node if there are any\n\t\t\t\t\tthis.pathVisitors.delete(p);\n\t\t\t\t});\n\t\t\t\tconst parent = this.parent;\n\t\t\t\tthis.parentField = parent.parentField;\n\t\t\t\tthis.parent = parent.parent;\n\t\t\t\tthis.currentDepth--;\n\t\t\t},\n\t\t\tenterField(key: FieldKey): void {\n\t\t\t\tthis.parentField = key;\n\t\t\t},\n\t\t\texitField(key: FieldKey): void {\n\t\t\t\tthis.parentField = undefined;\n\t\t\t},\n\t\t};\n\t\tthis.events.emit(\"treeChanging\", this);\n\t\tthis.activeVisitor = visitor;\n\t\treturn visitor;\n\t}\n}\n\n/\n Indicates the status of a `NodePath`.\n /\nenum Status {\n\t/\n\t Indicates the `NodePath` is being maintained and corresponds to a valid\n\t * (i.e., not removed) node in the document.\n\t /\n\tAlive,\n\t/\n\t Indicates the `NodePath` is not being maintained by the `AnchorSet`.\n\t * The `NodePath` may or may not correspond to a valid node in the document.\n\t \n\t Accessing such a node is invalid.\n\t * Nodes in this state are retained to detect use-after-free bugs.\n\t /\n\tDisposed,\n\t/\n\t Indicates the `NodePath` corresponds to a removed node in the document.\n\t * Such `NodePath`s are not maintained by the `AnchorSet` (other than updating\n\t * their status to `Disposed` when appropriate).\n\t \n\t Accessing such a node is invalid.\n\t * Nodes in this state are retained to detect use-after-free bugs.\n\t /\n\tDangling,\n}\n\n/\n Tree of anchors.\n \n Contains both child and parent pointers, which are kept in sync.\n \n Each anchor is equivalent to a path through the tree.\n * This tree structure stores a collection of these paths, but deduplicating the common prefixes of the tree\n * prefix-tree style.\n \n These anchors are used instead of just holding onto the node objects in forests for several reasons:\n \n - Update policy might be more complex than just tracking a node object in the forest.\n \n - Not all forests will have node objects: some may use compressed binary formats with no objects to reference.\n \n - Anchors are needed even when not using forests, and for nodes that are outside the currently loaded part of the\n * forest.\n \n - Forest in general do not need to support up pointers, but they are needed for anchors.\n \n Thus this can be thought of as a sparse copy of the subset of trees which are used as anchors,\n * plus the parent paths for them.\n \n ReferenceCountedBase tracks the number of references to this from external sources (`Anchors` via `AnchorSet`.).\n * Kept alive as if any of the follow are true:\n * 1. there are children.\n * 2. refcount is non-zero.\n * 3. events are registered.\n /\nclass PathNode extends ReferenceCountedBase implements UpPath<PathNode>, AnchorNode {\n\tpublic status: Status = Status.Alive;\n\t/\n\t Event emitter for this anchor.\n\t /\n\tpublic readonly events = createEmitter<AnchorEvents>(() => this.considerDispose());\n\n\t/\n\t PathNode arrays are kept sorted the PathNode's parentIndex for efficient search.\n\t * Users of this field must take care to maintain invariants (correct parent pointers, not empty child arrays etc.)\n\t \n\t Performance Note:\n\t * Large child lists could be updated more efficiently here using a data-structure optimized\n\t * for efficient prefix sum updates, such as a Fenwick tree or Finger tree.\n\t * This would be complicated by the need for parent pointers (including indexes),\n\t * but is possible to do.\n\t /\n\tpublic readonly children: Map<FieldKey, PathNode[]> = new Map();\n\n\t// See note on BrandedKey.\n\t// eslint-disable-next-line @typescript-eslint/no-explicit-any\n\tpublic readonly slots: BrandedMapSubset<AnchorSlot<any>> = new Map();\n\n\t/\n\t Construct a PathNode with refcount 1.\n\t * @param anchorSet - used to determine if this PathNode is already part of a specific anchorSet\n\t * to early out UpPath walking.\n\t /\n\tpublic constructor(\n\t\tpublic readonly anchorSet: AnchorSet,\n\t\tpublic parentField: FieldKey,\n\t\tpublic parentIndex: number,\n\t\t/\n\t\t The parent of this `PathNode` (an up pointer in the `PathNode` tree).\n\t\t * If the status of this node is `Alive`, then there must be a corresponding down pointer from the\n\t\t * `parentPath` node to this node.\n\t\t * When undefined, this node is the {@link AnchorSet.root} for `this.anchorSet` and thus has no parent.\n\t\t \n\t\t When updating the tree, `AnchorSet` may transiently leave the up and down pointers inconsistent\n\t\t * (updating down pointers first), but must ensure they are consistent before the editing operation returns\n\t\t * to non-`AnchorSet` code.\n\t\t * This consistency guarantee only applies to nodes that are `Alive`.\n\t\t /\n\t\tpublic parentPath: PathNode \| undefined,\n\t) {\n\t\tsuper(1);\n\t}\n\n\tpublic on<K extends keyof AnchorEvents>(\n\t\teventName: K,\n\t\tlistener: AnchorEvents[K],\n\t): () => void {\n\t\treturn this.events.on(eventName, listener);\n\t}\n\n\tpublic child(key: FieldKey, index: number): UpPath<AnchorNode> {\n\t\t// Fast path: if child exists, return it.\n\t\treturn (\n\t\t\tthis.tryGetChild(key, index) ?? { parent: this, parentField: key, parentIndex: index }\n\t\t);\n\t}\n\n\tpublic getOrCreateChildRef(key: FieldKey, index: number): [Anchor, AnchorNode] {\n\t\tconst anchor = this.anchorSet.track(this.child(key, index));\n\t\tconst node =\n\t\t\tthis.anchorSet.locate(anchor) ?? fail(\"cannot reference child that does not exist\");\n\t\treturn [anchor, node];\n\t}\n\n\t/\n\t @returns true iff this PathNode is the special root node that sits above all the detached fields.\n\t * In this case, the fields are detached sequences.\n\t * Note that the special root node should never appear in an UpPath\n\t * since UpPaths represent this root as `undefined`.\n\t /\n\tprivate isRoot(): boolean {\n\t\treturn this.parentPath === undefined;\n\t}\n\n\tpublic get parent(): PathNode \| undefined {\n\t\tassert(this.status !== Status.Disposed, 0x409 / PathNode must not be disposed /);\n\t\tassert(\n\t\t\tthis.parentPath !== undefined,\n\t\t\t0x355 / PathNode.parent is an UpPath API and thus should never be called on the root PathNode. /,\n\t\t);\n\t\t// Root PathNode corresponds to the undefined root for UpPath API.\n\t\tif (this.parentPath.isRoot()) {\n\t\t\treturn undefined;\n\t\t}\n\t\treturn this.parentPath;\n\t}\n\n\tpublic addRef(count = 1): void {\n\t\tassert(this.status === Status.Alive, 0x40a / PathNode must be alive /);\n\t\tthis.referenceAdded(count);\n\t}\n\n\tpublic removeRef(count = 1): void {\n\t\tassert(this.status !== Status.Disposed, 0x40b / PathNode must not be disposed /);\n\t\tthis.referenceRemoved(count);\n\t}\n\n\t// Called when refcount is set to 0.\n\t// Node may be kept alive by children or events after this point.\n\tprotected onUnreferenced(): void {\n\t\tthis.considerDispose();\n\t}\n\n\t/\n\t Gets a child, adding a ref to it.\n\t * Creates child (with 1 ref) if needed.\n\t /\n\tpublic getOrCreateChild(key: FieldKey, index: number): PathNode {\n\t\tassert(this.status === Status.Alive, 0x40c / PathNode must be alive /);\n\t\tlet field = this.children.get(key);\n\t\tif (field === undefined) {\n\t\t\tfield = [];\n\t\t\tthis.children.set(key, field);\n\t\t}\n\t\t// TODO: should do more optimized search (ex: binary search).\n\t\tlet child = field.find((c) => c.parentIndex === index);\n\t\tif (child === undefined) {\n\t\t\tchild = new PathNode(this.anchorSet, key, index, this);\n\t\t\tfield.push(child);\n\t\t\t// Keep list sorted by index.\n\t\t\tfield.sort((a, b) => a.parentIndex - b.parentIndex);\n\t\t} else {\n\t\t\tchild.addRef();\n\t\t}\n\t\treturn child;\n\t}\n\n\t/\n\t Gets a child if it exists.\n\t * Does NOT add a ref.\n\t /\n\tpublic tryGetChild(key: FieldKey, index: number): PathNode \| undefined {\n\t\tassert(this.status === Status.Alive, 0x40d / PathNode must be alive /);\n\t\tconst field = this.children.get(key);\n\n\t\t// TODO: should do more optimized search (ex: binary search or better) using index.\n\t\treturn field?.find((c) => c.parentIndex === index);\n\t}\n\n\t/\n\t Removes reference from this to `child`.\n\t * Since PathNodes are doubly linked,\n\t * the caller must ensure that the reference from child to parent is also removed (or the child is no longer used).\n\t /\n\tpublic removeChild(child: PathNode): void {\n\t\tassert(this.status === Status.Alive, 0x40e / PathNode must be alive /);\n\t\tconst key = child.parentField;\n\t\tconst field = this.children.get(key);\n\t\t// TODO: should do more optimized search (ex: binary search or better) using child.parentIndex()\n\t\t// Note that this is the index in the list of child paths, not the index within the field\n\t\tconst childIndex = field?.indexOf(child) ?? -1;\n\t\tassert(childIndex !== -1, 0x35c / child must be parented to be removed /);\n\t\tfield?.splice(childIndex, 1);\n\t\tif (field?.length === 0) {\n\t\t\tthis.afterEmptyField(key);\n\t\t}\n\t}\n\n\t/\n\t Call this after directly editing the child array for a field to be empty.\n\t * Handles cleaning up unneeded data\n\t * (like the field in the map, and possibly this entire PathNode and its parents if they are no longer needed.)\n\t /\n\tpublic afterEmptyField(key: FieldKey): void {\n\t\tassert(this.status === Status.Alive, 0x40f / PathNode must be alive /);\n\t\tthis.children.delete(key);\n\t\tthis.considerDispose();\n\t}\n\n\t/\n\t If node is no longer needed (has no references, no children and no events):\n\t * removes this from parent if alive, and sets this to disposed.\n\t * Must only be called when .\n\t \n\t Allowed when dangling (but not when disposed).\n\t /\n\tprivate considerDispose(): void {\n\t\tassert(this.status !== Status.Disposed, 0x41d / PathNode must not be disposed */);\n\t\tif (this.isUnreferenced() && this.children.size === 0 && !this.events.hasListeners()) {\n\t\t\tif (this.status === Status.Alive) {\n\t\t\t\tthis.parentPath?.removeChild(this);\n\t\t\t}\n\t\t\tthis.status = Status.Disposed;\n\t\t}\n\t}\n}\n"]}
1	+ {"version":3,"file":"anchorSet.js","sourceRoot":"","sources":["../../../src/core/tree/anchorSet.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,6DAA6D;AAE7D,kEAA6D;AAE7D,oDAAuE;AACvE,kDAS6B;AAa7B,yCAAkD;AAWlD;;GAEG;AACH,MAAM,WAAW,GAAW,IAAA,gBAAK,EAAC,CAAC,CAAC,CAAC;AAuMrC;;;;;;;;;;;;;;GAcG;AACH,SAAgB,UAAU;IACzB,OAAO,IAAA,sBAAW,GAAwB,CAAC;AAC5C,CAAC;AAFD,gCAEC;AAED;;;;;;;;;;GAUG;AACH,MAAa,SAAS;IAkCrB;QAjCiB,WAAM,GAAG,IAAA,wBAAa,GAAuB,CAAC;QAC/D;;;WAGG;QACK,kBAAa,GAAG,CAAC,CAAC;QAE1B;;;;WAIG;QACI,qBAAgB,GAAG,CAAC,CAAC;QAE5B;;;;;;;;;;WAUG;QACc,SAAI,GAAG,IAAI,QAAQ,CAAC,IAAI,EAAE,mBAAQ,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC;QAEnE,8GAA8G;QAC9G,yDAAyD;QACxC,iBAAY,GAA0B,IAAI,GAAG,EAAE,CAAC;QAKhE,IAAI,CAAC,EAAE,CAAC,cAAc,EAAE,GAAG,EAAE;YAC5B,IAAI,CAAC,gBAAgB,IAAI,CAAC,CAAC;QAC5B,CAAC,CAAC,CAAC;IACJ,CAAC;IAED;;;;;;OAMG;IACH,0BAA0B;IAC1B,8DAA8D;IAC9D,IAAW,KAAK;QACf,OAAO,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC;IACxB,CAAC;IAEM,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC;QACxB,MAAM,KAAK,GAAe,EAAE,CAAC;QAC7B,IAAI,IAAI,GAAyB,IAAI,CAAC,IAAI,CAAC;QAC3C,OAAO,IAAI,KAAK,SAAS,EAAE,CAAC;YAC3B,MAAM,IAAI,CAAC;YACX,KAAK,MAAM,CAAC,CAAC,EAAE,QAAQ,CAAC,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAC3C,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;oBAC9B,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBACnB,CAAC;YACF,CAAC;YACD,IAAI,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC;QACpB,CAAC;IACF,CAAC;IAEM,EAAE,CACR,SAAY,EACZ,QAAgC;QAEhC,OAAO,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;IAC5C,CAAC;IAED;;;OAGG;IACI,OAAO;QACb,OAAO,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,KAAK,CAAC,CAAC;IACtC,CAAC;IAEM,MAAM,CAAC,MAAc;QAC3B,IAAI,MAAM,KAAK,WAAW,EAAE,CAAC;YAC5B,OAAO,SAAS,CAAC;QAClB,CAAC;QAED,MAAM,IAAI,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAC3C,IAAA,iBAAM,EACL,IAAI,KAAK,SAAS,EAClB,KAAK,CAAC,yDAAyD,CAC/D,CAAC;QACF,OAAO,IAAI,CAAC,MAAM,KAAK,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC;IACxD,CAAC;IAEM,MAAM,CAAC,MAAc;QAC3B,IAAI,MAAM,KAAK,WAAW,EAAE,CAAC;YAC5B,MAAM,IAAI,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAC3C,IAAA,iBAAM,EAAC,IAAI,KAAK,SAAS,EAAE,KAAK,CAAC,kCAAkC,CAAC,CAAC;YACrE,IAAI,CAAC,SAAS,EAAE,CAAC;YACjB,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAClC,CAAC;IACF,CAAC;IAED;;;;;OAKG;IACH,kDAAkD;IAC3C,KAAK,CAAC,IAAmB;QAC/B,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;YACnB,OAAO,WAAW,CAAC;QACpB,CAAC;QAED,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;QACxC,MAAM,MAAM,GAAW,IAAA,gBAAK,EAAC,IAAI,CAAC,aAAa,EAAE,CAAC,CAAC;QACnD,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;QACzC,OAAO,MAAM,CAAC;IACf,CAAC;IAED;;OAEG;IACK,UAAU,CAAC,IAAY;QAC9B,IAAI,IAAI,YAAY,QAAQ,IAAI,IAAI,CAAC,SAAS,KAAK,IAAI,EAAE,CAAC;YACzD,IAAI,CAAC,MAAM,EAAE,CAAC;YACd,OAAO,IAAI,CAAC;QACb,CAAC;QACD,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,IAAI,CAAC;QACxC,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;QAE3C,MAAM,KAAK,GAAG,UAAU,CAAC,gBAAgB,CAAC,IAAI,CAAC,WAAW,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;QAE9E,iGAAiG;QACjG,UAAU,CAAC,SAAS,EAAE,CAAC;QAEvB,OAAO,KAAK,CAAC;IACd,CAAC;IAED;;OAEG;IACK,IAAI,CAAC,IAAY;QACxB,IAAI,IAAI,YAAY,QAAQ,EAAE,CAAC;YAC9B,IAAI,IAAI,CAAC,SAAS,KAAK,IAAI,EAAE,CAAC;gBAC7B,OAAO,IAAI,CAAC;YACb,CAAC;QACF,CAAC;QACD,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,IAAI,CAAC;QACxC,MAAM,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACrC,OAAO,UAAU,EAAE,WAAW,CAAC,IAAI,CAAC,WAAW,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;IACpE,CAAC;IAED;;;;;;;;OAQG;IACI,eAAe,CAAC,YAAoB;QAC1C,IAAI,IAAI,GAAuB,YAAY,CAAC;QAC5C,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,OAAO,IAAI,KAAK,SAAS,EAAE,CAAC;YAC3B,IAAI,IAAI,YAAY,QAAQ,IAAI,IAAI,CAAC,SAAS,KAAK,IAAI,EAAE,CAAC;gBACzD,MAAM;YACP,CAAC;YACD,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACjB,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC;QACpB,CAAC;QAED,4CAA4C;QAC5C,oDAAoD;QAEpD,IAAI,QAA4B,CAAC;QACjC,OAAO,CAAC,QAAQ,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC,KAAK,SAAS,EAAE,CAAC;YAC/C,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,YAAY,QAAQ,EAAE,CAAC;gBACpD,+EAA+E;gBAC/E,MAAM,KAAK,GAAG,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,WAAW,CAC5C,QAAQ,CAAC,WAAW,EACpB,QAAQ,CAAC,WAAW,CACpB,CAAC;gBACF,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;oBACzB,IAAI,GAAG,KAAK,CAAC;oBACb,SAAS;gBACV,CAAC;YACF,CAAC;YACD,oGAAoG;YACpG,kDAAkD;YAClD,IAAI,IAAI,KAAK,QAAQ,CAAC,MAAM,IAAI,CAAC,CAAC,QAAQ,YAAY,QAAQ,CAAC,EAAE,CAAC;gBACjE,uFAAuF;gBACvF,IAAI,GAAG,QAAQ,CAAC;YACjB,CAAC;iBAAM,CAAC;gBACP,IAAI,GAAG;oBACN,MAAM,EAAE,IAAI;oBACZ,WAAW,EAAE,QAAQ,CAAC,WAAW;oBACjC,WAAW,EAAE,QAAQ,CAAC,WAAW;iBACjC,CAAC;YACH,CAAC;QACF,CAAC;QAED,OAAO,IAAI,IAAI,IAAA,eAAI,EAAC,iCAAiC,CAAC,CAAC;IACxD,CAAC;IAED;;;OAGG;IACK,UAAU,CAAC,KAA0B;QAC5C,MAAM,KAAK,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC;QACzB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACzB,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;YAC1B,IAAA,iBAAM,EAAC,IAAI,CAAC,MAAM,KAAK,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,4BAA4B,CAAC,CAAC;YACzE,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC,QAAQ,CAAC;YAC9B,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,cAAc,EAAE,IAAI,CAAC,CAAC;YACvC,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC;gBAC/C,KAAK,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC,CAAC;YACzB,CAAC;QACF,CAAC;IACF,CAAC;IAED;;;;;;;;;OASG;IACK,aAAa,CAAC,SAAiB,EAAE,KAAa;QACrD,IAAA,iBAAM,EAAC,KAAK,GAAG,CAAC,EAAE,KAAK,CAAC,4BAA4B,CAAC,CAAC;QAEtD,MAAM,YAAY,GAAG,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9D,MAAM,cAAc,GAAG,YAAY,EAAE,QAAQ,EAAE,GAAG,CAAC,SAAS,CAAC,WAAW,CAAC,CAAC;QAC1E,IAAI,KAAK,GAAe,EAAE,CAAC;QAE3B,IAAI,cAAc,KAAK,SAAS,EAAE,CAAC;YAClC,IAAI,oBAAoB,GAAG,CAAC,CAAC;YAC7B,IAAI,gBAAgB,GAAG,CAAC,CAAC;YACzB,IAAI,KAAK,GAAG,CAAC,CAAC;YACd,OACC,KAAK,GAAG,cAAc,CAAC,MAAM;gBAC7B,cAAc,CAAC,KAAK,CAAE,CAAC,WAAW,GAAG,SAAS,CAAC,WAAW,EACzD,CAAC;gBACF,oBAAoB,EAAE,CAAC;gBACvB,KAAK,EAAE,CAAC;YACT,CAAC;YACD,OACC,KAAK,GAAG,cAAc,CAAC,MAAM;gBAC7B,cAAc,CAAC,KAAK,CAAE,CAAC,WAAW,GAAG,SAAS,CAAC,WAAW,GAAG,KAAK,EACjE,CAAC;gBACF,gBAAgB,EAAE,CAAC;gBACnB,KAAK,EAAE,CAAC;YACT,CAAC;YACD,OAAO,KAAK,GAAG,cAAc,CAAC,MAAM,EAAE,CAAC;gBACtC,4DAA4D;gBAC5D,cAAc,CAAC,KAAK,CAAE,CAAC,WAAW,IAAI,KAAK,CAAC;gBAC5C,KAAK,EAAE,CAAC;YACT,CAAC;YACD,wCAAwC;YACxC,KAAK,GAAG,cAAc,CAAC,MAAM,CAAC,oBAAoB,EAAE,gBAAgB,CAAC,CAAC;YACtE,IAAI,cAAc,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACjC,YAAa,CAAC,eAAe,CAAC,SAAS,CAAC,WAAW,CAAC,CAAC;YACtD,CAAC;QACF,CAAC;QAED,OAAO,KAAK,CAAC;IACd,CAAC;IAED;;;;;;;OAOG;IACK,WAAW,CAClB,WAAmB,EACnB,KAAa,EACb,UAA2D;QAE3D,IAAA,iBAAM,EAAC,UAAU,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,KAAK,CAAC,0CAA0C,CAAC,CAAC;QAEtF,gEAAgE;QAChE,MAAM,eAAe,GAAG,IAAI,CAAC,UAAU,CAAC,WAAW,CAAC,MAAM,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC;QAEzE,+BAA+B;QAC/B,KAAK,MAAM,IAAI,IAAI,UAAU,CAAC,KAAK,EAAE,CAAC;YACrC,IAAI,CAAC,WAAW,IAAI,WAAW,CAAC,WAAW,GAAG,UAAU,CAAC,gBAAgB,CAAC;YAC1E,IAAI,CAAC,UAAU,GAAG,eAAe,CAAC;YAClC,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC,WAAW,CAAC;QAC5C,CAAC;QAED,oCAAoC;QACpC,MAAM,KAAK,GAAG,eAAe,CAAC,QAAQ,CAAC,GAAG,CAAC,WAAW,CAAC,WAAW,CAAC,CAAC;QACpE,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACzB,eAAe,CAAC,QAAQ,CAAC,GAAG,CAAC,WAAW,CAAC,WAAW,EAAE,UAAU,CAAC,KAAK,CAAC,CAAC;QACzE,CAAC;aAAM,CAAC;YACP,iCAAiC;YACjC,MAAM,kBAAkB,GAAG,IAAI,CAAC,qBAAqB,CACpD,KAAK,EACL,WAAW,CAAC,WAAW,EACvB,KAAK,CACL,CAAC;YAEF,iFAAiF;YACjF,KAAK,CAAC,MAAM,CAAC,kBAAkB,EAAE,CAAC,EAAE,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC;QAC1D,CAAC;QAED,eAAe,CAAC,SAAS,EAAE,CAAC;IAC7B,CAAC;IAED;;;;;;;;;;OAUG;IACK,qBAAqB,CAC5B,KAAiB,EACjB,eAAuB,EACvB,KAAa;QAEb,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,OAAO,KAAK,GAAG,KAAK,CAAC,MAAM,IAAI,KAAK,CAAC,KAAK,CAAE,CAAC,WAAW,GAAG,eAAe,EAAE,CAAC;YAC5E,KAAK,EAAE,CAAC;QACT,CAAC;QACD,MAAM,oBAAoB,GAAG,KAAK,CAAC;QACnC,OAAO,KAAK,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;YAC7B,KAAK,CAAC,KAAK,CAAE,CAAC,WAAW,IAAI,KAAK,CAAC;YACnC,KAAK,EAAE,CAAC;QACT,CAAC;QAED,OAAO,oBAAoB,CAAC;IAC7B,CAAC;IAED;;;;;;;;;;;;;;;;OAgBG;IACK,YAAY,CAAC,WAAmB,EAAE,WAAmB,EAAE,KAAa;QAC3E,MAAM,KAAK,GAAG,IAAI,CAAC,aAAa,CAAC,WAAW,EAAE,KAAK,CAAC,CAAC;QACrD,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACtB,IAAI,CAAC,WAAW,CAAC,WAAW,EAAE,KAAK,EAAE;gBACpC,gBAAgB,EAAE,WAAW,CAAC,WAAW;gBACzC,KAAK;aACL,CAAC,CAAC;QACJ,CAAC;aAAM,CAAC;YACP,yFAAyF;YACzF,2BAA2B;YAC3B,IAAI,CAAC,cAAc,CAAC,WAAW,EAAE,KAAK,CAAC,CAAC;QACzC,CAAC;IACF,CAAC;IAEO,cAAc,CAAC,IAAY,EAAE,KAAa;QACjD,MAAM,KAAK,GAAG,IAAI,CAAC,aAAa,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QAC9C,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;IACxB,CAAC;IAED;;;;;OAKG;IACK,cAAc,CAAC,oBAA4B,EAAE,MAAc;QAClE,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,oBAAoB,CAAC,MAAM,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC;QACrE,MAAM,KAAK,GAAG,QAAQ,EAAE,QAAQ,CAAC,GAAG,CAAC,oBAAoB,CAAC,WAAW,CAAC,CAAC;QACvE,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACzB,IAAI,CAAC,qBAAqB,CAAC,KAAK,EAAE,oBAAoB,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;QAC7E,CAAC;IACF,CAAC;IAED;;;;;;;;;;OAUG;IACI,cAAc;QACpB,IAAA,iBAAM,EACL,IAAI,CAAC,aAAa,KAAK,SAAS,EAChC,KAAK,CAAC,4DAA4D,CAClE,CAAC;QAEF,MAAM,mBAAmB,GAAe,EAAE,CAAC;QAC3C,MAAM,OAAO,GAAG;YACf,SAAS,EAAE,IAAI;YACf,0EAA0E;YAC1E,sCAAsC;YACtC,aAAa,CAAC,QAAwC,EAAE,QAAqB;gBAC5E,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;oBACzD,QAAQ,EAAE,CAAC;gBACZ,CAAC;qBAAM,CAAC;oBACP,IAAA,iBAAM,EAAC,IAAI,CAAC,MAAM,KAAK,SAAS,EAAE,KAAK,CAAC,uBAAuB,CAAC,CAAC;oBACjE,aAAa;oBACb,6FAA6F;oBAC7F,gIAAgI;oBAChI,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC,eAAe,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;oBAC1D,IAAI,IAAI,CAAC,MAAM,YAAY,QAAQ,EAAE,CAAC;wBACrC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;wBACrB,mBAAmB,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;wBACtC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;oBACvB,CAAC;gBACF,CAAC;YACF,CAAC;YACD,0GAA0G;YAC1G,iJAAiJ;YACjJ,yJAAyJ;YACzJ,YAAY,EAAE,IAAI,GAAG,EAA8B;YACnD,WAAW,EAAE,SAAiC;YAC9C,MAAM,EAAE,SAA+B;YACvC,cAAc,EAAE,EAAqD;YAErE,sGAAsG;YACtG,mCAAmC;YACnC,kCAAkC;YAClC,0BAA0B;YAC1B,4GAA4G;YAC5G,6EAA6E;YAC7E,+GAA+G;YAC/G,0EAA0E;YAC1E,0GAA0G;YAC1G,iDAAiD;YACjD,gHAAgH;YAChH,iHAAiH;YACjH,iHAAiH;YACjH,+GAA+G;YAC/G,iHAAiH;YACjH,iHAAiH;YACjH,gHAAgH;YAChH,sCAAsC;YACtC,YAAY,EAAE,CAAC;YACf,+BAA+B,EAAE,CAAC;YAElC,IAAI;gBACH,IAAA,iBAAM,EACL,IAAI,CAAC,SAAS,CAAC,aAAa,KAAK,SAAS,EAC1C,KAAK,CAAC,0CAA0C,CAChD,CAAC;gBACF,KAAK,MAAM,IAAI,IAAI,mBAAmB,EAAE,CAAC;oBACxC,IAAI,CAAC,SAAS,EAAE,CAAC;gBAClB,CAAC;gBACD,IAAI,CAAC,SAAS,CAAC,aAAa,GAAG,SAAS,CAAC;gBACzC,MAAM,cAAc,GAAG,IAAI,GAAG,EAAsB,CAAC;gBACrD,KAAK,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,IAAI,CAAC,cAAc,EAAE,CAAC;oBACnD,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;wBAC/B,cAAc,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;oBAC9B,CAAC;oBACD,MAAM,aAAa,GAAG,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;oBAC/C,IAAI,aAAa,EAAE,QAAQ,CAAC,KAAK,CAAC,IAAI,KAAK,EAAE,CAAC;wBAC7C,SAAS;oBACV,CAAC;oBACD,aAAa,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;oBAC3B,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;gBAC/B,CAAC;YACF,CAAC;YACD,sBAAsB;gBACrB,IAAI,CAAC,aAAa,CACjB,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,kBAAkB,EAAE,CAAC,CAAC,EAC3C,GAAG,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,kBAAkB,EAAE,IAAI,CAAC,SAAS,CAAC,CACpE,CAAC;YACH,CAAC;YACD,qBAAqB;gBACpB,IAAI,CAAC,aAAa,CACjB,CAAC,CAAC,EAAE,EAAE;oBACL,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,iBAAiB,EAAE,CAAC,CAAC,CAAC;oBACpC,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC;wBACxB,IAAI,EAAE,CAAC;wBACP,KAAK,EAAE,2BAA2B;qBAClC,CAAC,CAAC;gBACJ,CAAC,EACD,GAAG,EAAE,GAAE,CAAC,CACR,CAAC;YACH,CAAC;YACD,YAAY,CAAC,MAAgB,EAAE,KAAa,EAAE,WAAuB;gBACpE,IAAA,iBAAM,EACL,IAAI,CAAC,WAAW,KAAK,SAAS,EAC9B,KAAK,CAAC,2CAA2C,CACjD,CAAC;gBACF,MAAM,eAAe,GAAgB;oBACpC,MAAM,EAAE,IAAI,CAAC,MAAM;oBACnB,KAAK,EAAE,IAAI,CAAC,WAAW;oBACvB,KAAK,EAAE,WAAW;iBAClB,CAAC;gBACF,MAAM,UAAU,GAAwB,IAAA,gBAAK,EAAC;oBAC7C,KAAK,EAAE,MAAM;oBACb,KAAK,EAAE,CAAC;oBACR,GAAG,EAAE,KAAK;iBACV,CAAC,CAAC;gBACH,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,EAAE,CAAC;oBACnD,KAAK,MAAM,WAAW,IAAI,QAAQ,EAAE,CAAC;wBACpC,WAAW,CAAC,YAAY,CAAC,UAAU,EAAE,eAAe,CAAC,CAAC;oBACvD,CAAC;gBACF,CAAC;YACF,CAAC;YACD,WAAW,CAAC,MAAgB,EAAE,WAAkB;gBAC/C,IAAA,iBAAM,EACL,IAAI,CAAC,WAAW,KAAK,SAAS,EAC9B,KAAK,CAAC,2CAA2C,CACjD,CAAC;gBACF,MAAM,UAAU,GAAwB,IAAA,gBAAK,EAAC;oBAC7C,KAAK,EAAE,MAAM;oBACb,KAAK,EAAE,CAAC;iBACR,CAAC,CAAC;gBACH,MAAM,eAAe,GAAgB;oBACpC,MAAM,EAAE,IAAI,CAAC,MAAM;oBACnB,KAAK,EAAE,IAAI,CAAC,WAAW;oBACvB,GAAG,WAAW;iBACd,CAAC;gBACF,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,EAAE,CAAC;oBACnD,KAAK,MAAM,WAAW,IAAI,QAAQ,EAAE,CAAC;wBACpC,WAAW,CAAC,WAAW,CAAC,UAAU,EAAE,eAAe,CAAC,CAAC;oBACtD,CAAC;gBACF,CAAC;YACF,CAAC;YACD,MAAM,CAAC,MAAgB,EAAE,KAAa,EAAE,WAAuB;gBAC9D,IAAI,CAAC,sBAAsB,EAAE,CAAC;gBAC9B,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,KAAK,EAAE,WAAW,CAAC,CAAC;gBAC5C,IAAI,CAAC,qBAAqB,EAAE,CAAC;YAC9B,CAAC;YACD,UAAU,CAAC,MAAgB,EAAE,KAAa,EAAE,WAAuB;gBAClE,IAAA,iBAAM,EACL,IAAI,CAAC,WAAW,KAAK,SAAS,EAC9B,KAAK,CAAC,2CAA2C,CACjD,CAAC;gBACF,MAAM,UAAU,GAAG;oBAClB,MAAM,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI;oBAC3B,WAAW,EAAE,MAAM;oBACnB,WAAW,EAAE,CAAC;iBACd,CAAC;gBACF,MAAM,eAAe,GAAG;oBACvB,MAAM,EAAE,IAAI,CAAC,MAAM;oBACnB,WAAW,EAAE,IAAI,CAAC,WAAW;oBAC7B,WAAW,EAAE,WAAW;iBACxB,CAAC;gBACF,IAAI,CAAC,SAAS,CAAC,YAAY,CAAC,UAAU,EAAE,eAAe,EAAE,KAAK,CAAC,CAAC;gBAChE,IAAI,CAAC,+BAA+B,GAAG,IAAI,CAAC,YAAY,CAAC;YAC1D,CAAC;YACD,YAAY,CAAC,MAAa,EAAE,WAAqB;gBAChD,IAAA,iBAAM,EACL,IAAI,CAAC,WAAW,KAAK,SAAS,EAC9B,KAAK,CAAC,2CAA2C,CACjD,CAAC;gBACF,MAAM,UAAU,GAAgB;oBAC/B,MAAM,EAAE,IAAI,CAAC,MAAM;oBACnB,KAAK,EAAE,IAAI,CAAC,WAAW;oBACvB,GAAG,MAAM;iBACT,CAAC;gBACF,MAAM,eAAe,GAAwB,IAAA,gBAAK,EAAC;oBAClD,KAAK,EAAE,WAAW;oBAClB,KAAK,EAAE,CAAC;iBACR,CAAC,CAAC;gBACH,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,EAAE,CAAC;oBACnD,KAAK,MAAM,WAAW,IAAI,QAAQ,EAAE,CAAC;wBACpC,WAAW,CAAC,YAAY,CAAC,UAAU,EAAE,eAAe,CAAC,CAAC;oBACvD,CAAC;gBACF,CAAC;YACF,CAAC;YACD,WAAW,CAAC,MAAkB,EAAE,KAAa,EAAE,WAAqB;gBACnE,IAAA,iBAAM,EACL,IAAI,CAAC,WAAW,KAAK,SAAS,EAC9B,KAAK,CAAC,2CAA2C,CACjD,CAAC;gBACF,MAAM,UAAU,GAAgB;oBAC/B,MAAM,EAAE,IAAI,CAAC,MAAM;oBACnB,KAAK,EAAE,IAAI,CAAC,WAAW;oBACvB,KAAK,EAAE,MAAM;iBACb,CAAC;gBACF,MAAM,eAAe,GAAwB,IAAA,gBAAK,EAAC;oBAClD,KAAK,EAAE,WAAW;oBAClB,KAAK,EAAE,CAAC;oBACR,GAAG,EAAE,KAAK;iBACV,CAAC,CAAC;gBACH,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,EAAE,CAAC;oBACnD,KAAK,MAAM,WAAW,IAAI,QAAQ,EAAE,CAAC;wBACpC,WAAW,CAAC,WAAW,CAAC,UAAU,EAAE,eAAe,CAAC,CAAC;oBACtD,CAAC;gBACF,CAAC;YACF,CAAC;YACD,MAAM,CAAC,MAAa,EAAE,WAAqB;gBAC1C,IAAI,CAAC,sBAAsB,EAAE,CAAC;gBAC9B,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;gBACrC,IAAI,CAAC,qBAAqB,EAAE,CAAC;YAC9B,CAAC;YACD,UAAU,CAAC,MAAa,EAAE,WAAqB;gBAC9C,IAAA,iBAAM,EACL,IAAI,CAAC,WAAW,KAAK,SAAS,EAC9B,KAAK,CAAC,2CAA2C,CACjD,CAAC;gBACF,MAAM,UAAU,GAAG;oBAClB,MAAM,EAAE,IAAI,CAAC,MAAM;oBACnB,WAAW,EAAE,IAAI,CAAC,WAAW;oBAC7B,WAAW,EAAE,MAAM,CAAC,KAAK;iBACzB,CAAC;gBACF,MAAM,eAAe,GAAG;oBACvB,MAAM,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI;oBAC3B,WAAW,EAAE,WAAW;oBACxB,WAAW,EAAE,CAAC;iBACd,CAAC;gBACF,IAAI,CAAC,SAAS,CAAC,YAAY,CAAC,UAAU,EAAE,eAAe,EAAE,MAAM,CAAC,GAAG,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;gBACpF,IAAI,CAAC,+BAA+B,GAAG,IAAI,CAAC,YAAY,CAAC;YAC1D,CAAC;YACD,aAAa,CAAC,UAAoB,EAAE,UAAiB,EAAE,WAAqB;gBAC3E,IAAA,iBAAM,EACL,IAAI,CAAC,WAAW,KAAK,SAAS,EAC9B,KAAK,CAAC,4CAA4C,CAClD,CAAC;gBACF,MAAM,cAAc,GAAgB;oBACnC,MAAM,EAAE,IAAI,CAAC,MAAM;oBACnB,KAAK,EAAE,IAAI,CAAC,WAAW;oBACvB,GAAG,UAAU;iBACb,CAAC;gBACF,MAAM,kBAAkB,GAAwB,IAAA,gBAAK,EAAC;oBACrD,KAAK,EAAE,UAAU;oBACjB,KAAK,EAAE,CAAC;oBACR,GAAG,EAAE,UAAU,CAAC,GAAG,GAAG,UAAU,CAAC,KAAK;iBACtC,CAAC,CAAC;gBACH,MAAM,uBAAuB,GAAwB,IAAA,gBAAK,EAAC;oBAC1D,KAAK,EAAE,WAAW;oBAClB,KAAK,EAAE,CAAC;iBACR,CAAC,CAAC;gBACH,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,EAAE,CAAC;oBACnD,KAAK,MAAM,WAAW,IAAI,QAAQ,EAAE,CAAC;wBACpC,WAAW,CAAC,aAAa,CACxB,kBAAkB,EAClB,cAAc,EACd,uBAAuB,CACvB,CAAC;oBACH,CAAC;gBACF,CAAC;YACF,CAAC;YACD,YAAY,CAAC,gBAA0B,EAAE,UAAiB,EAAE,UAAoB;gBAC/E,IAAA,iBAAM,EACL,IAAI,CAAC,WAAW,KAAK,SAAS,EAC9B,KAAK,CAAC,4CAA4C,CAClD,CAAC;gBACF,MAAM,cAAc,GAAgB;oBACnC,MAAM,EAAE,IAAI,CAAC,MAAM;oBACnB,KAAK,EAAE,IAAI,CAAC,WAAW;oBACvB,GAAG,UAAU;iBACb,CAAC;gBACF,MAAM,kBAAkB,GAAwB,IAAA,gBAAK,EAAC;oBACrD,KAAK,EAAE,gBAAgB;oBACvB,KAAK,EAAE,CAAC;iBACR,CAAC,CAAC;gBACH,MAAM,uBAAuB,GAAwB,IAAA,gBAAK,EAAC;oBAC1D,KAAK,EAAE,UAAU;oBACjB,KAAK,EAAE,CAAC;oBACR,GAAG,EAAE,UAAU,CAAC,GAAG,GAAG,UAAU,CAAC,KAAK;iBACtC,CAAC,CAAC;gBACH,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,EAAE,CAAC;oBACnD,KAAK,MAAM,WAAW,IAAI,QAAQ,EAAE,CAAC;wBACpC,WAAW,CAAC,YAAY,CACvB,kBAAkB,EAClB,cAAc,EACd,uBAAuB,CACvB,CAAC;oBACH,CAAC;gBACF,CAAC;YACF,CAAC;YACD,OAAO,CACN,gBAA0B,EAC1B,KAAY,EACZ,qBAA+B;gBAE/B,IAAI,CAAC,sBAAsB,EAAE,CAAC;gBAC9B,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,qBAAqB,CAAC,CAAC;gBAC9C,IAAI,CAAC,UAAU,CAAC,gBAAgB,EAAE,KAAK,CAAC,GAAG,GAAG,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;gBACxE,IAAI,CAAC,qBAAqB,EAAE,CAAC;YAC9B,CAAC;YACD,OAAO,CAAC,aAAuB,EAAE,KAAa;gBAC7C,IAAI,CAAC,SAAS,CAAC,cAAc,CAC5B;oBACC,MAAM,EAAE,SAAS;oBACjB,WAAW,EAAE,aAAa;oBAC1B,WAAW,EAAE,CAAC;iBACd,EACD,KAAK,CACL,CAAC;YACH,CAAC;YACD,aAAa,CAAC,aAAuB,EAAE,KAAa;gBACnD,MAAM,KAAK,GAAwB,IAAA,gBAAK,EAAC;oBACxC,KAAK,EAAE,aAAa;oBACpB,KAAK,EAAE,CAAC;oBACR,GAAG,EAAE,KAAK;iBACV,CAAC,CAAC;gBACH,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,EAAE,CAAC;oBACnD,KAAK,MAAM,WAAW,IAAI,QAAQ,EAAE,CAAC;wBACpC,WAAW,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;oBAClC,CAAC;gBACF,CAAC;YACF,CAAC;YACD,MAAM,CAAC,OAAyB,EAAE,WAAqB;gBACtD,2EAA2E;gBAC3E,oCAAoC;YACrC,CAAC;YACD,WAAW,CAAC,OAAyB,EAAE,WAAqB;gBAC3D,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,EAAE,CAAC;oBACnD,KAAK,MAAM,WAAW,IAAI,QAAQ,EAAE,CAAC;wBACpC,MAAM,SAAS,GAAwB,IAAA,gBAAK,EAAC;4BAC5C,KAAK,EAAE,WAAW;4BAClB,KAAK,EAAE,CAAC;4BACR,GAAG,EAAE,OAAO,CAAC,MAAM;yBACnB,CAAC,CAAC;wBACH,WAAW,CAAC,WAAW,CAAC,SAAS,CAAC,CAAC;oBACpC,CAAC;gBACF,CAAC;YACF,CAAC;YACD,SAAS,CAAC,KAAa;gBACtB,IAAA,iBAAM,EAAC,IAAI,CAAC,WAAW,KAAK,SAAS,EAAE,KAAK,CAAC,sCAAsC,CAAC,CAAC;gBAErF,IAAI,CAAC,MAAM,GAAG;oBACb,MAAM,EAAE,IAAI,CAAC,MAAM;oBACnB,WAAW,EAAE,IAAI,CAAC,WAAW;oBAC7B,WAAW,EAAE,KAAK;iBAClB,CAAC;gBACF,IAAI,CAAC,WAAW,GAAG,SAAS,CAAC;gBAC7B,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,EAAE;oBACxB,mCAAmC;oBACnC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;wBAC/B,MAAM,QAAQ,GAA2B,CAAC,CAAC,MAAM,CAAC,cAAc,CAC/D,iBAAiB,EACjB,CAAC,CACD,CAAC;wBACF,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;4BACzB,IAAI,CAAC,YAAY,CAAC,GAAG,CACpB,CAAC,EACD,IAAI,GAAG,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAoB,EAAE,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC,CAClE,CAAC;wBACH,CAAC;oBACF,CAAC;gBACF,CAAC,CAAC,CAAC;gBACH,IAAI,CAAC,YAAY,EAAE,CAAC;YACrB,CAAC;YACD,QAAQ,CAAC,KAAa;gBACrB,IAAA,iBAAM,EAAC,IAAI,CAAC,MAAM,KAAK,SAAS,EAAE,KAAK,CAAC,2BAA2B,CAAC,CAAC;gBACrE,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,EAAE;oBACxB,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,gBAAgB,EAAE,CAAC,CAAC,CAAC;oBACnC,IAAI,IAAI,CAAC,+BAA+B,KAAK,IAAI,CAAC,YAAY,EAAE,CAAC;wBAChE,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC;4BACxB,IAAI,EAAE,CAAC;4BACP,KAAK,EAAE,0BAA0B;yBACjC,CAAC,CAAC;wBACH,IAAI,CAAC,+BAA+B,EAAE,CAAC;oBACxC,CAAC;oBACD,mEAAmE;oBACnE,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBAC7B,CAAC,CAAC,CAAC;gBACH,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;gBAC3B,IAAI,CAAC,WAAW,GAAG,MAAM,CAAC,WAAW,CAAC;gBACtC,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC;gBAC5B,IAAI,CAAC,YAAY,EAAE,CAAC;YACrB,CAAC;YACD,UAAU,CAAC,GAAa;gBACvB,IAAI,CAAC,WAAW,GAAG,GAAG,CAAC;YACxB,CAAC;YACD,SAAS,CAAC,GAAa;gBACtB,IAAI,CAAC,WAAW,GAAG,SAAS,CAAC;YAC9B,CAAC;SACD,CAAC;QACF,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,cAAc,EAAE,IAAI,CAAC,CAAC;QACvC,IAAI,CAAC,aAAa,GAAG,OAAO,CAAC;QAC7B,OAAO,OAAO,CAAC;IAChB,CAAC;CACD;AA3xBD,8BA2xBC;AAED;;GAEG;AACH,IAAK,MAuBJ;AAvBD,WAAK,MAAM;IACV;;;OAGG;IACH,qCAAK,CAAA;IACL;;;;;;OAMG;IACH,2CAAQ,CAAA;IACR;;;;;;;OAOG;IACH,2CAAQ,CAAA;AACT,CAAC,EAvBI,MAAM,KAAN,MAAM,QAuBV;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4BG;AACH,MAAM,QAAS,SAAQ,+BAAoB;IAuB1C;;;;OAIG;IACH,YACiB,SAAoB,EAC7B,WAAqB,EACrB,WAAmB;IAC1B;;;;;;;;;;OAUG;IACI,UAAgC;QAEvC,KAAK,CAAC,CAAC,CAAC,CAAC;QAhBO,cAAS,GAAT,SAAS,CAAW;QAC7B,gBAAW,GAAX,WAAW,CAAU;QACrB,gBAAW,GAAX,WAAW,CAAQ;QAYnB,eAAU,GAAV,UAAU,CAAsB;QA1CjC,WAAM,GAAW,MAAM,CAAC,KAAK,CAAC;QACrC;;WAEG;QACa,WAAM,GAAG,IAAA,wBAAa,EAAe,GAAG,EAAE,CAAC,IAAI,CAAC,eAAe,EAAE,CAAC,CAAC;QAEnF;;;;;;;;;WASG;QACa,aAAQ,GAA8B,IAAI,GAAG,EAAE,CAAC;QAEhE,0BAA0B;QAC1B,8DAA8D;QAC9C,UAAK,GAAsC,IAAI,GAAG,EAAE,CAAC;IAyBrE,CAAC;IAEM,EAAE,CACR,SAAY,EACZ,QAAyB;QAEzB,OAAO,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;IAC5C,CAAC;IAEM,KAAK,CAAC,GAAa,EAAE,KAAa;QACxC,yCAAyC;QACzC,OAAO,CACN,IAAI,CAAC,WAAW,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,WAAW,EAAE,GAAG,EAAE,WAAW,EAAE,KAAK,EAAE,CACtF,CAAC;IACH,CAAC;IAEM,mBAAmB,CAAC,GAAa,EAAE,KAAa;QACtD,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC;QAC5D,MAAM,IAAI,GACT,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,IAAA,eAAI,EAAC,4CAA4C,CAAC,CAAC;QACrF,OAAO,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;IACvB,CAAC;IAED;;;;;OAKG;IACK,MAAM;QACb,OAAO,IAAI,CAAC,UAAU,KAAK,SAAS,CAAC;IACtC,CAAC;IAED,IAAW,MAAM;QAChB,IAAA,iBAAM,EAAC,IAAI,CAAC,MAAM,KAAK,MAAM,CAAC,QAAQ,EAAE,KAAK,CAAC,mCAAmC,CAAC,CAAC;QACnF,IAAA,iBAAM,EACL,IAAI,CAAC,UAAU,KAAK,SAAS,EAC7B,KAAK,CAAC,4FAA4F,CAClG,CAAC;QACF,kEAAkE;QAClE,IAAI,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,EAAE,CAAC;YAC9B,OAAO,SAAS,CAAC;QAClB,CAAC;QACD,OAAO,IAAI,CAAC,UAAU,CAAC;IACxB,CAAC;IAEM,MAAM,CAAC,KAAK,GAAG,CAAC;QACtB,IAAA,iBAAM,EAAC,IAAI,CAAC,MAAM,KAAK,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,4BAA4B,CAAC,CAAC;QACzE,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC;IAC5B,CAAC;IAEM,SAAS,CAAC,KAAK,GAAG,CAAC;QACzB,IAAA,iBAAM,EAAC,IAAI,CAAC,MAAM,KAAK,MAAM,CAAC,QAAQ,EAAE,KAAK,CAAC,mCAAmC,CAAC,CAAC;QACnF,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC;IAC9B,CAAC;IAED,oCAAoC;IACpC,iEAAiE;IACvD,cAAc;QACvB,IAAI,CAAC,eAAe,EAAE,CAAC;IACxB,CAAC;IAED;;;OAGG;IACI,gBAAgB,CAAC,GAAa,EAAE,KAAa;QACnD,IAAA,iBAAM,EAAC,IAAI,CAAC,MAAM,KAAK,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,4BAA4B,CAAC,CAAC;QACzE,IAAI,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACnC,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACzB,KAAK,GAAG,EAAE,CAAC;YACX,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAC/B,CAAC;QACD,6DAA6D;QAC7D,IAAI,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,KAAK,KAAK,CAAC,CAAC;QACvD,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACzB,KAAK,GAAG,IAAI,QAAQ,CAAC,IAAI,CAAC,SAAS,EAAE,GAAG,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;YACvD,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAClB,6BAA6B;YAC7B,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,GAAG,CAAC,CAAC,WAAW,CAAC,CAAC;QACrD,CAAC;aAAM,CAAC;YACP,KAAK,CAAC,MAAM,EAAE,CAAC;QAChB,CAAC;QACD,OAAO,KAAK,CAAC;IACd,CAAC;IAED;;;OAGG;IACI,WAAW,CAAC,GAAa,EAAE,KAAa;QAC9C,IAAA,iBAAM,EAAC,IAAI,CAAC,MAAM,KAAK,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,4BAA4B,CAAC,CAAC;QACzE,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAErC,mFAAmF;QACnF,OAAO,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,KAAK,KAAK,CAAC,CAAC;IACpD,CAAC;IAED;;;;OAIG;IACI,WAAW,CAAC,KAAe;QACjC,IAAA,iBAAM,EAAC,IAAI,CAAC,MAAM,KAAK,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,4BAA4B,CAAC,CAAC;QACzE,MAAM,GAAG,GAAG,KAAK,CAAC,WAAW,CAAC;QAC9B,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACrC,gGAAgG;QAChG,yFAAyF;QACzF,MAAM,UAAU,GAAG,KAAK,EAAE,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC;QAC/C,IAAA,iBAAM,EAAC,UAAU,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,0CAA0C,CAAC,CAAC;QAC5E,KAAK,EAAE,MAAM,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;QAC7B,IAAI,KAAK,EAAE,MAAM,KAAK,CAAC,EAAE,CAAC;YACzB,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC;QAC3B,CAAC;IACF,CAAC;IAED;;;;OAIG;IACI,eAAe,CAAC,GAAa;QACnC,IAAA,iBAAM,EAAC,IAAI,CAAC,MAAM,KAAK,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,4BAA4B,CAAC,CAAC;QACzE,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAC1B,IAAI,CAAC,eAAe,EAAE,CAAC;IACxB,CAAC;IAED;;;;;;OAMG;IACK,eAAe;QACtB,IAAA,iBAAM,EAAC,IAAI,CAAC,MAAM,KAAK,MAAM,CAAC,QAAQ,EAAE,KAAK,CAAC,mCAAmC,CAAC,CAAC;QACnF,IAAI,IAAI,CAAC,cAAc,EAAE,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,YAAY,EAAE,EAAE,CAAC;YACtF,IAAI,IAAI,CAAC,MAAM,KAAK,MAAM,CAAC,KAAK,EAAE,CAAC;gBAClC,IAAI,CAAC,UAAU,EAAE,WAAW,CAAC,IAAI,CAAC,CAAC;YACpC,CAAC;YACD,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC,QAAQ,CAAC;QAC/B,CAAC;IACF,CAAC;CACD","sourcesContent":["/!\n Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n /\n\n/ eslint-disable @typescript-eslint/no-non-null-assertion /\n\nimport { assert } from \"@fluidframework/core-utils/internal\";\n\nimport { type Listenable, createEmitter } from \"../../events/index.js\";\nimport {\n\ttype Brand,\n\ttype BrandedKey,\n\ttype BrandedMapSubset,\n\ttype Opaque,\n\tReferenceCountedBase,\n\tbrand,\n\tbrandedSlot,\n\tfail,\n} from \"../../util/index.js\";\nimport type { FieldKey } from \"../schema-stored/index.js\";\n\nimport type as Delta from \"./delta.js\";\nimport type {\n\tDetachedPlaceUpPath,\n\tDetachedRangeUpPath,\n\tPlaceIndex,\n\tPlaceUpPath,\n\tRange,\n\tRangeUpPath,\n\tUpPath,\n} from \"./pathTree.js\";\nimport { EmptyKey, type Value } from \"./types.js\";\nimport type { DeltaVisitor } from \"./visitDelta.js\";\nimport type { PathVisitor } from \"./visitPath.js\";\nimport type { AnnouncedVisitor } from \"./visitorUtils.js\";\n\n/*\n A way to refer to a particular tree location within an {@link AnchorSet}.\n * Associated with a ref count on the underlying {@link AnchorNode}.\n /\nexport type Anchor = Brand<number, \"rebaser.Anchor\">;\n\n/\n A singleton which represents a permanently invalid location (i.e. there is never a node there)\n /\nconst NeverAnchor: Anchor = brand(0);\n\n/\n Maps anchors (which must be ones this locator knows about) to paths.\n /\nexport interface AnchorLocator {\n\t/\n\t Get the current location of an Anchor.\n\t * The returned value should not be used after an edit has occurred.\n\t \n\t TODO: support extra/custom return types for specific/custom anchor types:\n\t * for now caller must rely on data in anchor + returned node location\n\t * (not ideal for anchors for places or ranges instead of nodes).\n\t /\n\tlocate(anchor: Anchor): AnchorNode \| undefined;\n}\n\n/\n Stores arbitrary, user-defined data on an {@link Anchor}.\n * This data is preserved over the course of that anchor's lifetime.\n * @see {@link anchorSlot} for creation and an example use case.\n /\nexport type AnchorSlot<TContent> = BrandedKey<Opaque<Brand<number, \"AnchorSlot\">>, TContent>;\n\n/\n Events for {@link AnchorNode}.\n * These events are triggered while the internal data structures are being updated.\n * Thus these events must not trigger reading of the anchorSet or forest.\n \n TODO:\n * - Include sub-deltas in events.\n * - Add more events.\n /\nexport interface AnchorEvents {\n\t/\n\t When the anchor node will never get reused by its AnchorSet.\n\t * This means that the content it corresponds to has been permanently destroyed.\n\t \n\t @remarks\n\t * When this happens depends entirely on how the anchorSet is used.\n\t * It's possible nodes removed from the tree will be kept indefinitely, and thus never trigger this event, or they may be discarded immediately.\n\t \n\t @privateRemarks\n\t * The specifics of the delta visit algorithm can impact the behavior of these events.\n\t * Refer to the privateRemarks of specific events and/or the documentation of the delta visit algorithm (as of\n\t * 2024-04-02, src/core/tree/visitDelta.ts) for more information.\n\t /\n\tafterDestroy(anchor: AnchorNode): void;\n\n\t/\n\t Emitted in the middle of applying a batch of changes (i.e. during a delta a visit), if one or more of this node's\n\t * direct children are about to change due to updates from the batch.\n\t \n\t @remarks\n\t * Does not include edits of child subtrees: instead only includes changes to nodes which are direct children in this\n\t * node's fields.\n\t /\n\tchildrenChanging(anchor: AnchorNode): void;\n\n\t/\n\t Emitted in the middle of applying a batch of changes (i.e. during a delta a visit), if one or more of this node's\n\t * direct children just changed due to updates from the batch.\n\t \n\t @remarks\n\t * Does not include edits of child subtrees: instead only includes changes to nodes which are direct children in this\n\t * node's fields.\n\t \n\t Compare to {@link AnchorEvents.childrenChangedAfterBatch} which is emitted after the whole batch has been applied.\n\t /\n\tchildrenChanged(anchor: AnchorNode): void;\n\n\t/\n\t Emitted after a batch of changes has been applied (i.e. when a delta visit completes), if one or more of this node's\n\t * direct children changed due to updates from the batch.\n\t \n\t @remarks\n\t * Does not include edits of child subtrees: instead only includes changes to nodes which are direct children in this\n\t * node's fields.\n\t \n\t This event is guaranteed to be emitted on a given node only once per batch.\n\t \n\t Compare to {@link AnchorEvents.childrenChanged} which is emitted in the middle of the batch/delta-visit.\n\t /\n\tchildrenChangedAfterBatch(anchor: AnchorNode): void;\n\n\t/\n\t Emitted in the middle of applying a batch of changes (i.e. during a delta a visit), if something in the subtree\n\t * rooted at `anchor` _may_ be about to change due to updates from the batch.\n\t \n\t @remarks\n\t * The event can optionally return a {@link PathVisitor} to traverse the subtree.\n\t * Called on every parent (transitively) when a change is occurring.\n\t /\n\tsubtreeChanging(anchor: AnchorNode): PathVisitor \| void;\n\n\t/\n\t Emitted in the middle of applying a batch of changes (i.e. during a delta a visit), if something in the subtree\n\t * rooted at `anchor` _may_ have just changed due to updates from the batch.\n\t \n\t @remarks\n\t * While this event is always emitted in the presence of changes to the subtree,\n\t * it may also be emitted even though no changes have been made to the subtree.\n\t * It may be emitted multiple times within the application of a single edit or transaction.\n\t \n\t If this event is emitted by a node, it will later be emitted by all its ancestors up to the root as well, at\n\t * least once on each ancestor.\n\t \n\t Compare to {@link AnchorEvents.subtreeChangedAfterBatch} which is emitted after the whole batch has been applied.\n\t \n\t @privateRemarks\n\t * The delta visit algorithm is complicated and it may fire this event multiple times for the same change to a node.\n\t * The change to the tree may not be visible until the event fires for the last time.\n\t * Refer to the documentation of the delta visit algorithm for more details.\n\t /\n\tsubtreeChanged(anchor: AnchorNode): void;\n\n\t/\n\t Emitted after a batch of changes has been applied (i.e. when a delta visit completes), if something in the subtree\n\t * rooted at `anchor` changed due to updates from the batch.\n\t \n\t @remarks\n\t * If this event is emitted by a node, it will later be emitted by all its ancestors up to the root as well, from bottom to top.\n\t \n\t This event is guaranteed to be emitted on a given node only once per batch.\n\t \n\t Compare to {@link AnchorEvents.subtreeChanged} which is emitted in the middle of the batch/delta-visit.\n\t \n\t @privateRemarks\n\t * Note that because this is fired after the full batch of changes is applied, it guarantees that something in the\n\t * subtree changed, compared to {@link AnchorEvents.subtreeChanged} or {@link AnchorEvents.subtreeChanging} which\n\t * fire when something _may_ have changed or _may_ be about to change.\n\t /\n\tsubtreeChangedAfterBatch(anchor: AnchorNode): void;\n\n\t/\n\t Value on this node is changing.\n\t /\n\tvalueChanging(anchor: AnchorNode, value: Value): void;\n}\n\n/\n Events for {@link AnchorSet}.\n * These events are triggered while the internal data structures are being updated.\n * Thus these events must not trigger reading of the anchorSet or forest.\n \n TODO:\n * - Design how events should be ordered.\n * - Include sub-deltas in events.\n * - Add more events.\n /\nexport interface AnchorSetRootEvents {\n\t/\n\t What children are at the root is changing.\n\t /\n\tchildrenChanging(anchors: AnchorSet): void;\n\n\t/\n\t Something in the tree is changing.\n\t /\n\ttreeChanging(anchors: AnchorSet): void;\n}\n\n/\n Node in a tree of anchors.\n /\nexport interface AnchorNode extends UpPath<AnchorNode>, Listenable<AnchorEvents> {\n\t/\n\t Allows access to data stored on the Anchor in \"slots\".\n\t * Use {@link anchorSlot} to create slots.\n\t /\n\t// See note on BrandedKey\n\t// eslint-disable-next-line @typescript-eslint/no-explicit-any\n\treadonly slots: BrandedMapSubset<AnchorSlot<any>>;\n\n\t/\n\t The set this anchor node is part of.\n\t /\n\treadonly anchorSet: AnchorSet;\n\n\t/\n\t Gets a child of this node.\n\t \n\t @remarks\n\t * This does not return an AnchorNode since there might not be one, and lazily creating one here would have messy lifetime management (See {@link AnchorNode#getOrCreateChildRef})\n\t * If an AnchorNode is required, use the AnchorSet to track then locate the returned path.\n\t * TODO:\n\t * Revisit this API.\n\t * Perhaps if we use weak down pointers and remove ref counting, we can make this return a AnchorNode.\n\t \n\t /\n\tchild(key: FieldKey, index: number): UpPath<AnchorNode>;\n\n\t/*\n\t Gets a child AnchorNode (creating it if needed), and an Anchor owning a ref to it.\n\t * Caller is responsible for freeing the returned Anchor, and must not use the AnchorNode after that.\n\t /\n\tgetOrCreateChildRef(key: FieldKey, index: number): [Anchor, AnchorNode];\n}\n\n/\n Define a strongly typed slot on anchors in which data can be stored.\n \n @remarks\n * This is mainly useful for caching data associated with a location in the tree.\n \n Example usage:\n * ```typescript\n * const counterSlot = anchorSlot<number>();\n \n function useSlot(anchor: AnchorNode): void {\n * \tanchor.slots.set(counterSlot, 1 + anchor.slots.get(counterSlot) ?? 0);\n * }\n * ```\n /\nexport function anchorSlot<TContent>(): AnchorSlot<TContent> {\n\treturn brandedSlot<AnchorSlot<TContent>>();\n}\n\n/\n Collection of Anchors at a specific revision.\n \n See `Rebaser` for how to update across revisions.\n \n TODO: this should not be package exported.\n * If it's needed outside the package an Interface should be used instead which can reduce its\n * API surface to a small subset.\n \n @sealed\n /\nexport class AnchorSet implements Listenable<AnchorSetRootEvents>, AnchorLocator {\n\tprivate readonly events = createEmitter<AnchorSetRootEvents>();\n\t/\n\t Incrementing counter to give each anchor in this set a unique index for its identifier.\n\t * \"0\" is reserved for the `NeverAnchor`.\n\t /\n\tprivate anchorCounter = 1;\n\n\t/\n\t Incrementing number that is bumped each time that the {@link AnchorSet} is changed.\n\t * This allows consumers to cache state associated with a particular generation number and later determine if that state may have been invalidated using a comparison with the current generation number.\n\t * For example, anchor slots can be used to cache the removal status of a node to memoize repeated walks up the tree.\n\t /\n\tpublic generationNumber = 0;\n\n\t/\n\t Special root node under which all anchors in this anchor set are transitively parented.\n\t * This does not appear in the UpPaths (instead they use undefined for the root).\n\t * Immediate children of this root are in detached fields (which have their identifiers used as the field keys).\n\t \n\t This is allocated with refCount one, which is never freed so it is never cleaned up\n\t * (as long as this AnchorSet is not garbage collected).\n\t \n\t There should never be any children other than the special root detached field under this between transactions:\n\t * TODO: check for and enforce this.\n\t /\n\tprivate readonly root = new PathNode(this, EmptyKey, 0, undefined);\n\n\t// TODO: anchor system could be optimized a bit to avoid the maps (Anchor is ref to Path, path has ref count).\n\t// For now use this more encapsulated approach with maps.\n\tprivate readonly anchorToPath: Map<Anchor, PathNode> = new Map();\n\n\tprivate activeVisitor?: DeltaVisitor;\n\n\tpublic constructor() {\n\t\tthis.on(\"treeChanging\", () => {\n\t\t\tthis.generationNumber += 1;\n\t\t});\n\t}\n\n\t/\n\t Allows access to data stored on the AnchorSet in \"slots\".\n\t * Use {@link anchorSlot} to create slots.\n\t \n\t @privateRemarks\n\t * This forwards to the slots of the special above root anchor which locate can't access.\n\t /\n\t// See note on BrandedKey.\n\t// eslint-disable-next-line @typescript-eslint/no-explicit-any\n\tpublic get slots(): BrandedMapSubset<AnchorSlot<any>> {\n\t\treturn this.root.slots;\n\t}\n\n\tpublic [Symbol.iterator](): IterableIterator<AnchorNode> {\n\t\tconst stack: PathNode[] = [];\n\t\tlet node: PathNode \| undefined = this.root;\n\t\twhile (node !== undefined) {\n\t\t\tyield node;\n\t\t\tfor (const [_, children] of node.children) {\n\t\t\t\tfor (const child of children) {\n\t\t\t\t\tstack.push(child);\n\t\t\t\t}\n\t\t\t}\n\t\t\tnode = stack.pop();\n\t\t}\n\t}\n\n\tpublic on<K extends keyof AnchorSetRootEvents>(\n\t\teventName: K,\n\t\tlistener: AnchorSetRootEvents[K],\n\t): () => void {\n\t\treturn this.events.on(eventName, listener);\n\t}\n\n\t/*\n\t Check if there are currently no anchors tracked.\n\t * Mainly for testing anchor cleanup.\n\t /\n\tpublic isEmpty(): boolean {\n\t\treturn this.root.children.size === 0;\n\t}\n\n\tpublic locate(anchor: Anchor): AnchorNode \| undefined {\n\t\tif (anchor === NeverAnchor) {\n\t\t\treturn undefined;\n\t\t}\n\n\t\tconst path = this.anchorToPath.get(anchor);\n\t\tassert(\n\t\t\tpath !== undefined,\n\t\t\t0x3a6 / Cannot locate anchor which is not in this AnchorSet /,\n\t\t);\n\t\treturn path.status === Status.Alive ? path : undefined;\n\t}\n\n\tpublic forget(anchor: Anchor): void {\n\t\tif (anchor !== NeverAnchor) {\n\t\t\tconst path = this.anchorToPath.get(anchor);\n\t\t\tassert(path !== undefined, 0x351 / cannot forget unknown Anchor /);\n\t\t\tpath.removeRef();\n\t\t\tthis.anchorToPath.delete(anchor);\n\t\t}\n\t}\n\n\t/\n\t TODO: Add APIs need to allow callers of this function to reduce copying here.\n\t * Ex: maybe return something extending UpPath here.\n\t * @param path - the path to the node to be tracked. If null, returns an anchor\n\t * which is permanently invalid.\n\t /\n\t// eslint-disable-next-line @rushstack/no-new-null\n\tpublic track(path: UpPath \| null): Anchor {\n\t\tif (path === null) {\n\t\t\treturn NeverAnchor;\n\t\t}\n\n\t\tconst foundPath = this.trackInner(path);\n\t\tconst anchor: Anchor = brand(this.anchorCounter++);\n\t\tthis.anchorToPath.set(anchor, foundPath);\n\t\treturn anchor;\n\t}\n\n\t/\n\t Finds a path node, creating if needed, and adds a ref count to it.\n\t /\n\tprivate trackInner(path: UpPath): PathNode {\n\t\tif (path instanceof PathNode && path.anchorSet === this) {\n\t\t\tpath.addRef();\n\t\t\treturn path;\n\t\t}\n\t\tconst parent = path.parent ?? this.root;\n\t\tconst parentPath = this.trackInner(parent);\n\n\t\tconst child = parentPath.getOrCreateChild(path.parentField, path.parentIndex);\n\n\t\t// Now that child is added (if needed), remove the extra ref that we added in the recursive call.\n\t\tparentPath.removeRef();\n\n\t\treturn child;\n\t}\n\n\t/\n\t Finds a path node if it already exists.\n\t /\n\tprivate find(path: UpPath): PathNode \| undefined {\n\t\tif (path instanceof PathNode) {\n\t\t\tif (path.anchorSet === this) {\n\t\t\t\treturn path;\n\t\t\t}\n\t\t}\n\t\tconst parent = path.parent ?? this.root;\n\t\tconst parentPath = this.find(parent);\n\t\treturn parentPath?.tryGetChild(path.parentField, path.parentIndex);\n\t}\n\n\t/\n\t Returns an equivalent path making as much of it with PathNodes as possible.\n\t * This allows future operations (like find, track, locate) on this path (and derived ones) to be faster.\n\t * Note that the returned path may use AnchorNodes from this AnchorSet,\n\t * but does not have a tracked reference to them, so this should not be held onto across anything that might free an AnchorNode.\n\t \n\t @remarks\n\t * Also ensures that any PathNode in the path is from this AnchorSet.\n\t /\n\tpublic internalizePath(originalPath: UpPath): UpPath {\n\t\tlet path: UpPath \| undefined = originalPath;\n\t\tconst stack: UpPath[] = [];\n\t\twhile (path !== undefined) {\n\t\t\tif (path instanceof PathNode && path.anchorSet === this) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tstack.push(path);\n\t\t\tpath = path.parent;\n\t\t}\n\n\t\t// Now `path` contains an internalized path.\n\t\t// It just needs the paths from stackOut to wrap it.\n\n\t\tlet wrapWith: UpPath \| undefined;\n\t\twhile ((wrapWith = stack.pop()) !== undefined) {\n\t\t\tif (path === undefined \|\| path instanceof PathNode) {\n\t\t\t\t// If path already has an anchor, get an anchor for it's child if there is one:\n\t\t\t\tconst child = (path ?? this.root).tryGetChild(\n\t\t\t\t\twrapWith.parentField,\n\t\t\t\t\twrapWith.parentIndex,\n\t\t\t\t);\n\t\t\t\tif (child !== undefined) {\n\t\t\t\t\tpath = child;\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t}\n\t\t\t// Replacing this if with a ternary makes the documentation harder to include and hurts readability.\n\t\t\t// eslint-disable-next-line unicorn/prefer-ternary\n\t\t\tif (path === wrapWith.parent && !(wrapWith instanceof PathNode)) {\n\t\t\t\t// path is safe to reuse from input path, so use it to avoid allocating another object.\n\t\t\t\tpath = wrapWith;\n\t\t\t} else {\n\t\t\t\tpath = {\n\t\t\t\t\tparent: path,\n\t\t\t\t\tparentField: wrapWith.parentField,\n\t\t\t\t\tparentIndex: wrapWith.parentIndex,\n\t\t\t\t};\n\t\t\t}\n\t\t}\n\n\t\treturn path ?? fail(\"internalize path must be a path\");\n\t}\n\n\t/\n\t Recursively marks the given `nodes` and their descendants as disposed and pointing to a deleted node.\n\t * Note that this does NOT detach the nodes.\n\t /\n\tprivate deepDelete(nodes: readonly PathNode[]): void {\n\t\tconst stack = [...nodes];\n\t\twhile (stack.length > 0) {\n\t\t\tconst node = stack.pop()!;\n\t\t\tassert(node.status === Status.Alive, 0x408 / PathNode must be alive /);\n\t\t\tnode.status = Status.Dangling;\n\t\t\tnode.events.emit(\"afterDestroy\", node);\n\t\t\tfor (const children of node.children.values()) {\n\t\t\t\tstack.push(...children);\n\t\t\t}\n\t\t}\n\t}\n\n\t/\n\t Decouple nodes from their parent.\n\t * This removes the reference from the parent to the decoupled children, and updates the indexes of the remaining children accordingly.\n\t * This does NOT update the decoupled children: both their index and parent are left at their existing values.\n\t * To decouple and fixup the children, see `removeChildren` and `moveChildren`.\n\t * @param startPath - The path to the first node that is being decoupled.\n\t * @param count - number of siblings that are decoupled from the original tree.\n\t \n\t TODO: tests\n\t /\n\tprivate decoupleNodes(startPath: UpPath, count: number): PathNode[] {\n\t\tassert(count > 0, 0x681 / count must be positive /);\n\n\t\tconst sourceParent = this.find(startPath.parent ?? this.root);\n\t\tconst sourceChildren = sourceParent?.children?.get(startPath.parentField);\n\t\tlet nodes: PathNode[] = [];\n\n\t\tif (sourceChildren !== undefined) {\n\t\t\tlet numberBeforeDecouple = 0;\n\t\t\tlet numberToDecouple = 0;\n\t\t\tlet index = 0;\n\t\t\twhile (\n\t\t\t\tindex < sourceChildren.length &&\n\t\t\t\tsourceChildren[index]!.parentIndex < startPath.parentIndex\n\t\t\t) {\n\t\t\t\tnumberBeforeDecouple++;\n\t\t\t\tindex++;\n\t\t\t}\n\t\t\twhile (\n\t\t\t\tindex < sourceChildren.length &&\n\t\t\t\tsourceChildren[index]!.parentIndex < startPath.parentIndex + count\n\t\t\t) {\n\t\t\t\tnumberToDecouple++;\n\t\t\t\tindex++;\n\t\t\t}\n\t\t\twhile (index < sourceChildren.length) {\n\t\t\t\t// Fix indexes in source after moved items (subtract count).\n\t\t\t\tsourceChildren[index]!.parentIndex -= count;\n\t\t\t\tindex++;\n\t\t\t}\n\t\t\t// Sever the parent -> child connections\n\t\t\tnodes = sourceChildren.splice(numberBeforeDecouple, numberToDecouple);\n\t\t\tif (sourceChildren.length === 0) {\n\t\t\t\tsourceParent!.afterEmptyField(startPath.parentField);\n\t\t\t}\n\t\t}\n\n\t\treturn nodes;\n\t}\n\n\t/\n\t Couple nodes to a parent.\n\t * @param destination - where the siblings are coupled to.\n\t * @param count - number of siblings that are coupled in the original tree.\n\t * @param coupleInfo - this object contains the nodes to couple and the parent index of the first node that is coupled in the original tree.\n\t \n\t TODO: tests\n\t /\n\tprivate coupleNodes(\n\t\tdestination: UpPath,\n\t\tcount: number,\n\t\tcoupleInfo: { startParentIndex: number; nodes: PathNode[] },\n\t): void {\n\t\tassert(coupleInfo.nodes.length > 0, 0x682 / coupleInfo must have nodes to couple /);\n\n\t\t// The destination needs to be created if it does not exist yet.\n\t\tconst destinationPath = this.trackInner(destination.parent ?? this.root);\n\n\t\t// Update nodes for new parent.\n\t\tfor (const node of coupleInfo.nodes) {\n\t\t\tnode.parentIndex += destination.parentIndex - coupleInfo.startParentIndex;\n\t\t\tnode.parentPath = destinationPath;\n\t\t\tnode.parentField = destination.parentField;\n\t\t}\n\n\t\t// Update new parent to add children\n\t\tconst field = destinationPath.children.get(destination.parentField);\n\t\tif (field === undefined) {\n\t\t\tdestinationPath.children.set(destination.parentField, coupleInfo.nodes);\n\t\t} else {\n\t\t\t// Update existing field contents\n\t\t\tconst numberBeforeCouple = this.increaseParentIndexes(\n\t\t\t\tfield,\n\t\t\t\tdestination.parentIndex,\n\t\t\t\tcount,\n\t\t\t);\n\n\t\t\t// TODO: this will fail for very large numbers of anchors due to argument limits.\n\t\t\tfield.splice(numberBeforeCouple, 0, ...coupleInfo.nodes);\n\t\t}\n\n\t\tdestinationPath.removeRef();\n\t}\n\n\t/\n\t Updates the parent indexes within `field` to account for `count` children being inserted at `fromParentIndex`. Note that\n\t * `fromParentIndex` is the logical position within the field, not the index with the sparse PathNode array.\n\t \n\t @param field - the field to update.\n\t * @param fromParentIndex - the logical index within the field to start updating from.\n\t * @param count - the number to increase parent indexes.\n\t * @returns the number of items in the field that are not increased.\n\t \n\t TODO: tests\n\t /\n\tprivate increaseParentIndexes(\n\t\tfield: PathNode[],\n\t\tfromParentIndex: number,\n\t\tcount: number,\n\t): number {\n\t\tlet index = 0;\n\t\twhile (index < field.length && field[index]!.parentIndex < fromParentIndex) {\n\t\t\tindex++;\n\t\t}\n\t\tconst numberBeforeIncrease = index;\n\t\twhile (index < field.length) {\n\t\t\tfield[index]!.parentIndex += count;\n\t\t\tindex++;\n\t\t}\n\n\t\treturn numberBeforeIncrease;\n\t}\n\n\t/\n\t Updates paths for a range move (including re-parenting path items and updating indexes).\n\t * @param sourceStart - where the siblings are removed from.\n\t * @param destination - where the siblings are moved to.\n\t * @param count - number of siblings to move.\n\t \n\t TODO:\n\t * How should anchors that become invalid, then valid again (ex: into content that was deleted, then undone) work?\n\t * Add an API to resurrect them? Store them in special detached fields? Store them in special non-detached fields?\n\t \n\t TODO:\n\t * How should custom anchors work (ex: ones not just tied to a specific Node)?\n\t * This design assumes they can be expressed in terms of a Node anchor + some extra stuff,\n\t * but we don't have an API for the extra stuff yet.\n\t \n\t TODO: tests\n\t /\n\tprivate moveChildren(sourceStart: UpPath, destination: UpPath, count: number): void {\n\t\tconst nodes = this.decoupleNodes(sourceStart, count);\n\t\tif (nodes.length > 0) {\n\t\t\tthis.coupleNodes(destination, count, {\n\t\t\t\tstartParentIndex: sourceStart.parentIndex,\n\t\t\t\tnodes,\n\t\t\t});\n\t\t} else {\n\t\t\t// If there are no nodes to move, we still need to update the parent indexes of the nodes\n\t\t\t// affected in the move in.\n\t\t\tthis.offsetChildren(destination, count);\n\t\t}\n\t}\n\n\tprivate removeChildren(path: UpPath, count: number): void {\n\t\tconst nodes = this.decoupleNodes(path, count);\n\t\tthis.deepDelete(nodes);\n\t}\n\n\t/\n\t Updates the parent indexes of all the nodes located at right side of the given path by the given offset.\n\t * @param firstSiblingToOffset - the path to offset children of.\n\t * @param offset - the offset to apply to the children.\n\t \n\t /\n\tprivate offsetChildren(firstSiblingToOffset: UpPath, offset: number): void {\n\t\tconst nodePath = this.find(firstSiblingToOffset.parent ?? this.root);\n\t\tconst field = nodePath?.children.get(firstSiblingToOffset.parentField);\n\t\tif (field !== undefined) {\n\t\t\tthis.increaseParentIndexes(field, firstSiblingToOffset.parentIndex, offset);\n\t\t}\n\t}\n\n\t/*\n\t Provides a visitor that can be used to mutate this {@link AnchorSet}.\n\t \n\t @returns A visitor that can be used to mutate this {@link AnchorSet}.\n\t \n\t @remarks\n\t * Mutating the {@link AnchorSet} does NOT update the forest.\n\t * The visitor must be released after use by calling {@link DeltaVisitor.free} on it.\n\t * It is invalid to acquire a visitor without releasing the previous one,\n\t * and this method will throw an error if this is attempted.\n\t /\n\tpublic acquireVisitor(): AnnouncedVisitor & DeltaVisitor {\n\t\tassert(\n\t\t\tthis.activeVisitor === undefined,\n\t\t\t0x767 / Must release existing visitor before acquiring another /,\n\t\t);\n\n\t\tconst referencedPathNodes: PathNode[] = [];\n\t\tconst visitor = {\n\t\t\tanchorSet: this,\n\t\t\t// Run `withNode` on anchorNode for parent if there is such an anchorNode.\n\t\t\t// If at root, run `withRoot` instead.\n\t\t\tmaybeWithNode(withNode: (anchorNode: PathNode) => void, withRoot?: () => void) {\n\t\t\t\tif (this.parent === undefined && withRoot !== undefined) {\n\t\t\t\t\twithRoot();\n\t\t\t\t} else {\n\t\t\t\t\tassert(this.parent !== undefined, 0x5b0 / parent must exist /);\n\t\t\t\t\t// TODO:Perf:\n\t\t\t\t\t// When traversing to a depth D when there are not anchors in that subtree, this goes O(D^2).\n\t\t\t\t\t// Delta traversal should early out in this case because no work is needed (and all move outs are known to not contain anchors).\n\t\t\t\t\tthis.parent = this.anchorSet.internalizePath(this.parent);\n\t\t\t\t\tif (this.parent instanceof PathNode) {\n\t\t\t\t\t\tthis.parent.addRef();\n\t\t\t\t\t\treferencedPathNodes.push(this.parent);\n\t\t\t\t\t\twithNode(this.parent);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t},\n\t\t\t// Lookup table for path visitors collected from {@link AnchorEvents.visitSubtreeChanging} emitted events.\n\t\t\t// The key is the path of the node that the visitor is registered on. The code ensures that the path visitor visits only the appropriate subtrees\n\t\t\t// by maintaining the mapping only during time between the {@link DeltaVisitor.enterNode} and {@link DeltaVisitor.exitNode} calls for a given anchorNode.\n\t\t\tpathVisitors: new Map<PathNode, Set<PathVisitor>>(),\n\t\t\tparentField: undefined as FieldKey \| undefined,\n\t\t\tparent: undefined as UpPath \| undefined,\n\t\t\tbufferedEvents: [] as { node: PathNode; event: keyof AnchorEvents }[],\n\n\t\t\t// 'currentDepth' and 'depthThresholdForSubtreeChanged' serve to keep track of when do we need to emit\n\t\t\t// subtreeChangedAfterBatch events.\n\t\t\t// The algorithm works as follows:\n\t\t\t// - Initialize both to 0.\n\t\t\t// - As we walk the tree from the root towards the leaves, when we enter a node increment currentDepth by 1.\n\t\t\t// - When we edit a node, set depthThresholdForSubtreeChanged = currentDepth.\n\t\t\t// Intuitively, depthThresholdForSubtreeChanged means \"as you walk the tree towards the root, when you exit a\n\t\t\t// node at this depth you should emit a subtreeChangedAfterBatch event\".\n\t\t\t// - When we exit a node, if d === currentDepth then emit a subtreeChangedAfterBatch and decrement d by 1.\n\t\t\t// Then decrement currentDepth unconditionally.\n\t\t\t// Note that the event will be emitted when exiting a node that was edited (depthThresholdForSubtreeChanged will\n\t\t\t// have been set to the current depth when the edit happened), it will be emitted when exiting a node that is the\n\t\t\t// parent of a node that already emitted the event (because both depthThresholdForSubtreeChanged and currentDepth\n\t\t\t// get decremented when exiting a node so they stay in sync), and if we're already emitting the event but start\n\t\t\t// walking the tree back towards the leaves in a path where no edits happen, currentDepth will be increased again\n\t\t\t// as we walk that path, depthThresholdForSubtreeChanged will not, and thus no event will be emitted when walking\n\t\t\t// back up that path, until we get back to the depth where we were already emitting the event, and will continue\n\t\t\t// emitting it on the way to the root.\n\t\t\tcurrentDepth: 0,\n\t\t\tdepthThresholdForSubtreeChanged: 0,\n\n\t\t\tfree() {\n\t\t\t\tassert(\n\t\t\t\t\tthis.anchorSet.activeVisitor !== undefined,\n\t\t\t\t\t0x768 / Multiple free calls for same visitor /,\n\t\t\t\t);\n\t\t\t\tfor (const node of referencedPathNodes) {\n\t\t\t\t\tnode.removeRef();\n\t\t\t\t}\n\t\t\t\tthis.anchorSet.activeVisitor = undefined;\n\t\t\t\tconst alreadyEmitted = new Map<PathNode, string[]>();\n\t\t\t\tfor (const { node, event } of this.bufferedEvents) {\n\t\t\t\t\tif (!alreadyEmitted.has(node)) {\n\t\t\t\t\t\talreadyEmitted.set(node, []);\n\t\t\t\t\t}\n\t\t\t\t\tconst emittedEvents = alreadyEmitted.get(node);\n\t\t\t\t\tif (emittedEvents?.includes(event) ?? false) {\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t\temittedEvents?.push(event);\n\t\t\t\t\tnode.events.emit(event, node);\n\t\t\t\t}\n\t\t\t},\n\t\t\tnotifyChildrenChanging(): void {\n\t\t\t\tthis.maybeWithNode(\n\t\t\t\t\t(p) => p.events.emit(\"childrenChanging\", p),\n\t\t\t\t\t() => this.anchorSet.events.emit(\"childrenChanging\", this.anchorSet),\n\t\t\t\t);\n\t\t\t},\n\t\t\tnotifyChildrenChanged(): void {\n\t\t\t\tthis.maybeWithNode(\n\t\t\t\t\t(p) => {\n\t\t\t\t\t\tp.events.emit(\"childrenChanged\", p);\n\t\t\t\t\t\tthis.bufferedEvents.push({\n\t\t\t\t\t\t\tnode: p,\n\t\t\t\t\t\t\tevent: \"childrenChangedAfterBatch\",\n\t\t\t\t\t\t});\n\t\t\t\t\t},\n\t\t\t\t\t() => {},\n\t\t\t\t);\n\t\t\t},\n\t\t\tbeforeAttach(source: FieldKey, count: number, destination: PlaceIndex): void {\n\t\t\t\tassert(\n\t\t\t\t\tthis.parentField !== undefined,\n\t\t\t\t\t0x7a0 / Must be in a field in order to attach /,\n\t\t\t\t);\n\t\t\t\tconst destinationPath: PlaceUpPath = {\n\t\t\t\t\tparent: this.parent,\n\t\t\t\t\tfield: this.parentField,\n\t\t\t\t\tindex: destination,\n\t\t\t\t};\n\t\t\t\tconst sourcePath: DetachedRangeUpPath = brand({\n\t\t\t\t\tfield: source,\n\t\t\t\t\tstart: 0,\n\t\t\t\t\tend: count,\n\t\t\t\t});\n\t\t\t\tfor (const visitors of this.pathVisitors.values()) {\n\t\t\t\t\tfor (const pathVisitor of visitors) {\n\t\t\t\t\t\tpathVisitor.beforeAttach(sourcePath, destinationPath);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t},\n\t\t\tafterAttach(source: FieldKey, destination: Range): void {\n\t\t\t\tassert(\n\t\t\t\t\tthis.parentField !== undefined,\n\t\t\t\t\t0x7a1 / Must be in a field in order to attach /,\n\t\t\t\t);\n\t\t\t\tconst sourcePath: DetachedPlaceUpPath = brand({\n\t\t\t\t\tfield: source,\n\t\t\t\t\tindex: 0,\n\t\t\t\t});\n\t\t\t\tconst destinationPath: RangeUpPath = {\n\t\t\t\t\tparent: this.parent,\n\t\t\t\t\tfield: this.parentField,\n\t\t\t\t\t...destination,\n\t\t\t\t};\n\t\t\t\tfor (const visitors of this.pathVisitors.values()) {\n\t\t\t\t\tfor (const pathVisitor of visitors) {\n\t\t\t\t\t\tpathVisitor.afterAttach(sourcePath, destinationPath);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t},\n\t\t\tattach(source: FieldKey, count: number, destination: PlaceIndex): void {\n\t\t\t\tthis.notifyChildrenChanging();\n\t\t\t\tthis.attachEdit(source, count, destination);\n\t\t\t\tthis.notifyChildrenChanged();\n\t\t\t},\n\t\t\tattachEdit(source: FieldKey, count: number, destination: PlaceIndex): void {\n\t\t\t\tassert(\n\t\t\t\t\tthis.parentField !== undefined,\n\t\t\t\t\t0x7a2 / Must be in a field in order to attach /,\n\t\t\t\t);\n\t\t\t\tconst sourcePath = {\n\t\t\t\t\tparent: this.anchorSet.root,\n\t\t\t\t\tparentField: source,\n\t\t\t\t\tparentIndex: 0,\n\t\t\t\t};\n\t\t\t\tconst destinationPath = {\n\t\t\t\t\tparent: this.parent,\n\t\t\t\t\tparentField: this.parentField,\n\t\t\t\t\tparentIndex: destination,\n\t\t\t\t};\n\t\t\t\tthis.anchorSet.moveChildren(sourcePath, destinationPath, count);\n\t\t\t\tthis.depthThresholdForSubtreeChanged = this.currentDepth;\n\t\t\t},\n\t\t\tbeforeDetach(source: Range, destination: FieldKey): void {\n\t\t\t\tassert(\n\t\t\t\t\tthis.parentField !== undefined,\n\t\t\t\t\t0x7a3 / Must be in a field in order to attach /,\n\t\t\t\t);\n\t\t\t\tconst sourcePath: RangeUpPath = {\n\t\t\t\t\tparent: this.parent,\n\t\t\t\t\tfield: this.parentField,\n\t\t\t\t\t...source,\n\t\t\t\t};\n\t\t\t\tconst destinationPath: DetachedPlaceUpPath = brand({\n\t\t\t\t\tfield: destination,\n\t\t\t\t\tindex: 0,\n\t\t\t\t});\n\t\t\t\tfor (const visitors of this.pathVisitors.values()) {\n\t\t\t\t\tfor (const pathVisitor of visitors) {\n\t\t\t\t\t\tpathVisitor.beforeDetach(sourcePath, destinationPath);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t},\n\t\t\tafterDetach(source: PlaceIndex, count: number, destination: FieldKey): void {\n\t\t\t\tassert(\n\t\t\t\t\tthis.parentField !== undefined,\n\t\t\t\t\t0x7a4 / Must be in a field in order to attach /,\n\t\t\t\t);\n\t\t\t\tconst sourcePath: PlaceUpPath = {\n\t\t\t\t\tparent: this.parent,\n\t\t\t\t\tfield: this.parentField,\n\t\t\t\t\tindex: source,\n\t\t\t\t};\n\t\t\t\tconst destinationPath: DetachedRangeUpPath = brand({\n\t\t\t\t\tfield: destination,\n\t\t\t\t\tstart: 0,\n\t\t\t\t\tend: count,\n\t\t\t\t});\n\t\t\t\tfor (const visitors of this.pathVisitors.values()) {\n\t\t\t\t\tfor (const pathVisitor of visitors) {\n\t\t\t\t\t\tpathVisitor.afterDetach(sourcePath, destinationPath);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t},\n\t\t\tdetach(source: Range, destination: FieldKey): void {\n\t\t\t\tthis.notifyChildrenChanging();\n\t\t\t\tthis.detachEdit(source, destination);\n\t\t\t\tthis.notifyChildrenChanged();\n\t\t\t},\n\t\t\tdetachEdit(source: Range, destination: FieldKey): void {\n\t\t\t\tassert(\n\t\t\t\t\tthis.parentField !== undefined,\n\t\t\t\t\t0x7a5 / Must be in a field in order to detach /,\n\t\t\t\t);\n\t\t\t\tconst sourcePath = {\n\t\t\t\t\tparent: this.parent,\n\t\t\t\t\tparentField: this.parentField,\n\t\t\t\t\tparentIndex: source.start,\n\t\t\t\t};\n\t\t\t\tconst destinationPath = {\n\t\t\t\t\tparent: this.anchorSet.root,\n\t\t\t\t\tparentField: destination,\n\t\t\t\t\tparentIndex: 0,\n\t\t\t\t};\n\t\t\t\tthis.anchorSet.moveChildren(sourcePath, destinationPath, source.end - source.start);\n\t\t\t\tthis.depthThresholdForSubtreeChanged = this.currentDepth;\n\t\t\t},\n\t\t\tbeforeReplace(newContent: FieldKey, oldContent: Range, destination: FieldKey): void {\n\t\t\t\tassert(\n\t\t\t\t\tthis.parentField !== undefined,\n\t\t\t\t\t0x7a6 / Must be in a field in order to replace /,\n\t\t\t\t);\n\t\t\t\tconst oldContentPath: RangeUpPath = {\n\t\t\t\t\tparent: this.parent,\n\t\t\t\t\tfield: this.parentField,\n\t\t\t\t\t...oldContent,\n\t\t\t\t};\n\t\t\t\tconst newNodesSourcePath: DetachedRangeUpPath = brand({\n\t\t\t\t\tfield: newContent,\n\t\t\t\t\tstart: 0,\n\t\t\t\t\tend: oldContent.end - oldContent.start,\n\t\t\t\t});\n\t\t\t\tconst oldNodesDestinationPath: DetachedPlaceUpPath = brand({\n\t\t\t\t\tfield: destination,\n\t\t\t\t\tindex: 0,\n\t\t\t\t});\n\t\t\t\tfor (const visitors of this.pathVisitors.values()) {\n\t\t\t\t\tfor (const pathVisitor of visitors) {\n\t\t\t\t\t\tpathVisitor.beforeReplace(\n\t\t\t\t\t\t\tnewNodesSourcePath,\n\t\t\t\t\t\t\toldContentPath,\n\t\t\t\t\t\t\toldNodesDestinationPath,\n\t\t\t\t\t\t);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t},\n\t\t\tafterReplace(newContentSource: FieldKey, newContent: Range, oldContent: FieldKey): void {\n\t\t\t\tassert(\n\t\t\t\t\tthis.parentField !== undefined,\n\t\t\t\t\t0x7a7 / Must be in a field in order to replace /,\n\t\t\t\t);\n\t\t\t\tconst newContentPath: RangeUpPath = {\n\t\t\t\t\tparent: this.parent,\n\t\t\t\t\tfield: this.parentField,\n\t\t\t\t\t...newContent,\n\t\t\t\t};\n\t\t\t\tconst newNodesSourcePath: DetachedPlaceUpPath = brand({\n\t\t\t\t\tfield: newContentSource,\n\t\t\t\t\tindex: 0,\n\t\t\t\t});\n\t\t\t\tconst oldNodesDestinationPath: DetachedRangeUpPath = brand({\n\t\t\t\t\tfield: oldContent,\n\t\t\t\t\tstart: 0,\n\t\t\t\t\tend: newContent.end - newContent.start,\n\t\t\t\t});\n\t\t\t\tfor (const visitors of this.pathVisitors.values()) {\n\t\t\t\t\tfor (const pathVisitor of visitors) {\n\t\t\t\t\t\tpathVisitor.afterReplace(\n\t\t\t\t\t\t\tnewNodesSourcePath,\n\t\t\t\t\t\t\tnewContentPath,\n\t\t\t\t\t\t\toldNodesDestinationPath,\n\t\t\t\t\t\t);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t},\n\t\t\treplace(\n\t\t\t\tnewContentSource: FieldKey,\n\t\t\t\trange: Range,\n\t\t\t\toldContentDestination: FieldKey,\n\t\t\t): void {\n\t\t\t\tthis.notifyChildrenChanging();\n\t\t\t\tthis.detachEdit(range, oldContentDestination);\n\t\t\t\tthis.attachEdit(newContentSource, range.end - range.start, range.start);\n\t\t\t\tthis.notifyChildrenChanged();\n\t\t\t},\n\t\t\tdestroy(detachedField: FieldKey, count: number): void {\n\t\t\t\tthis.anchorSet.removeChildren(\n\t\t\t\t\t{\n\t\t\t\t\t\tparent: undefined,\n\t\t\t\t\t\tparentField: detachedField,\n\t\t\t\t\t\tparentIndex: 0,\n\t\t\t\t\t},\n\t\t\t\t\tcount,\n\t\t\t\t);\n\t\t\t},\n\t\t\tbeforeDestroy(detachedField: FieldKey, count: number): void {\n\t\t\t\tconst range: DetachedRangeUpPath = brand({\n\t\t\t\t\tfield: detachedField,\n\t\t\t\t\tstart: 0,\n\t\t\t\t\tend: count,\n\t\t\t\t});\n\t\t\t\tfor (const visitors of this.pathVisitors.values()) {\n\t\t\t\t\tfor (const pathVisitor of visitors) {\n\t\t\t\t\t\tpathVisitor.beforeDestroy(range);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t},\n\t\t\tcreate(content: Delta.ProtoNodes, destination: FieldKey): void {\n\t\t\t\t// Nothing to do since content can only be created in a new detached field,\n\t\t\t\t// which cannot contain any anchors.\n\t\t\t},\n\t\t\tafterCreate(content: Delta.ProtoNodes, destination: FieldKey): void {\n\t\t\t\tfor (const visitors of this.pathVisitors.values()) {\n\t\t\t\t\tfor (const pathVisitor of visitors) {\n\t\t\t\t\t\tconst rangePath: DetachedRangeUpPath = brand({\n\t\t\t\t\t\t\tfield: destination,\n\t\t\t\t\t\t\tstart: 0,\n\t\t\t\t\t\t\tend: content.length,\n\t\t\t\t\t\t});\n\t\t\t\t\t\tpathVisitor.afterCreate(rangePath);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t},\n\t\t\tenterNode(index: number): void {\n\t\t\t\tassert(this.parentField !== undefined, 0x3ab / Must be in a field to enter node /);\n\n\t\t\t\tthis.parent = {\n\t\t\t\t\tparent: this.parent,\n\t\t\t\t\tparentField: this.parentField,\n\t\t\t\t\tparentIndex: index,\n\t\t\t\t};\n\t\t\t\tthis.parentField = undefined;\n\t\t\t\tthis.maybeWithNode((p) => {\n\t\t\t\t\t// avoid multiple pass side-effects\n\t\t\t\t\tif (!this.pathVisitors.has(p)) {\n\t\t\t\t\t\tconst visitors: (PathVisitor \| void)[] = p.events.emitAndCollect(\n\t\t\t\t\t\t\t\"subtreeChanging\",\n\t\t\t\t\t\t\tp,\n\t\t\t\t\t\t);\n\t\t\t\t\t\tif (visitors.length > 0) {\n\t\t\t\t\t\t\tthis.pathVisitors.set(\n\t\t\t\t\t\t\t\tp,\n\t\t\t\t\t\t\t\tnew Set(visitors.filter((v): v is PathVisitor => v !== undefined)),\n\t\t\t\t\t\t\t);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t});\n\t\t\t\tthis.currentDepth++;\n\t\t\t},\n\t\t\texitNode(index: number): void {\n\t\t\t\tassert(this.parent !== undefined, 0x3ac / Must have parent node /);\n\t\t\t\tthis.maybeWithNode((p) => {\n\t\t\t\t\tp.events.emit(\"subtreeChanged\", p);\n\t\t\t\t\tif (this.depthThresholdForSubtreeChanged === this.currentDepth) {\n\t\t\t\t\t\tthis.bufferedEvents.push({\n\t\t\t\t\t\t\tnode: p,\n\t\t\t\t\t\t\tevent: \"subtreeChangedAfterBatch\",\n\t\t\t\t\t\t});\n\t\t\t\t\t\tthis.depthThresholdForSubtreeChanged--;\n\t\t\t\t\t}\n\t\t\t\t\t// Remove subtree path visitors added at this node if there are any\n\t\t\t\t\tthis.pathVisitors.delete(p);\n\t\t\t\t});\n\t\t\t\tconst parent = this.parent;\n\t\t\t\tthis.parentField = parent.parentField;\n\t\t\t\tthis.parent = parent.parent;\n\t\t\t\tthis.currentDepth--;\n\t\t\t},\n\t\t\tenterField(key: FieldKey): void {\n\t\t\t\tthis.parentField = key;\n\t\t\t},\n\t\t\texitField(key: FieldKey): void {\n\t\t\t\tthis.parentField = undefined;\n\t\t\t},\n\t\t};\n\t\tthis.events.emit(\"treeChanging\", this);\n\t\tthis.activeVisitor = visitor;\n\t\treturn visitor;\n\t}\n}\n\n/\n Indicates the status of a `NodePath`.\n /\nenum Status {\n\t/\n\t Indicates the `NodePath` is being maintained and corresponds to a valid\n\t * (i.e., not removed) node in the document.\n\t /\n\tAlive,\n\t/\n\t Indicates the `NodePath` is not being maintained by the `AnchorSet`.\n\t * The `NodePath` may or may not correspond to a valid node in the document.\n\t \n\t Accessing such a node is invalid.\n\t * Nodes in this state are retained to detect use-after-free bugs.\n\t /\n\tDisposed,\n\t/\n\t Indicates the `NodePath` corresponds to a removed node in the document.\n\t * Such `NodePath`s are not maintained by the `AnchorSet` (other than updating\n\t * their status to `Disposed` when appropriate).\n\t \n\t Accessing such a node is invalid.\n\t * Nodes in this state are retained to detect use-after-free bugs.\n\t /\n\tDangling,\n}\n\n/\n Tree of anchors.\n \n Contains both child and parent pointers, which are kept in sync.\n \n Each anchor is equivalent to a path through the tree.\n * This tree structure stores a collection of these paths, but deduplicating the common prefixes of the tree\n * prefix-tree style.\n \n These anchors are used instead of just holding onto the node objects in forests for several reasons:\n \n - Update policy might be more complex than just tracking a node object in the forest.\n \n - Not all forests will have node objects: some may use compressed binary formats with no objects to reference.\n \n - Anchors are needed even when not using forests, and for nodes that are outside the currently loaded part of the\n * forest.\n \n - Forest in general do not need to support up pointers, but they are needed for anchors.\n \n Thus this can be thought of as a sparse copy of the subset of trees which are used as anchors,\n * plus the parent paths for them.\n \n ReferenceCountedBase tracks the number of references to this from external sources (`Anchors` via `AnchorSet`.).\n * Kept alive as if any of the follow are true:\n * 1. there are children.\n * 2. refcount is non-zero.\n * 3. events are registered.\n /\nclass PathNode extends ReferenceCountedBase implements UpPath<PathNode>, AnchorNode {\n\tpublic status: Status = Status.Alive;\n\t/\n\t Event emitter for this anchor.\n\t /\n\tpublic readonly events = createEmitter<AnchorEvents>(() => this.considerDispose());\n\n\t/\n\t PathNode arrays are kept sorted the PathNode's parentIndex for efficient search.\n\t * Users of this field must take care to maintain invariants (correct parent pointers, not empty child arrays etc.)\n\t \n\t Performance Note:\n\t * Large child lists could be updated more efficiently here using a data-structure optimized\n\t * for efficient prefix sum updates, such as a Fenwick tree or Finger tree.\n\t * This would be complicated by the need for parent pointers (including indexes),\n\t * but is possible to do.\n\t /\n\tpublic readonly children: Map<FieldKey, PathNode[]> = new Map();\n\n\t// See note on BrandedKey.\n\t// eslint-disable-next-line @typescript-eslint/no-explicit-any\n\tpublic readonly slots: BrandedMapSubset<AnchorSlot<any>> = new Map();\n\n\t/\n\t Construct a PathNode with refcount 1.\n\t * @param anchorSet - used to determine if this PathNode is already part of a specific anchorSet\n\t * to early out UpPath walking.\n\t /\n\tpublic constructor(\n\t\tpublic readonly anchorSet: AnchorSet,\n\t\tpublic parentField: FieldKey,\n\t\tpublic parentIndex: number,\n\t\t/\n\t\t The parent of this `PathNode` (an up pointer in the `PathNode` tree).\n\t\t * If the status of this node is `Alive`, then there must be a corresponding down pointer from the\n\t\t * `parentPath` node to this node.\n\t\t * When undefined, this node is the {@link AnchorSet.root} for `this.anchorSet` and thus has no parent.\n\t\t \n\t\t When updating the tree, `AnchorSet` may transiently leave the up and down pointers inconsistent\n\t\t * (updating down pointers first), but must ensure they are consistent before the editing operation returns\n\t\t * to non-`AnchorSet` code.\n\t\t * This consistency guarantee only applies to nodes that are `Alive`.\n\t\t /\n\t\tpublic parentPath: PathNode \| undefined,\n\t) {\n\t\tsuper(1);\n\t}\n\n\tpublic on<K extends keyof AnchorEvents>(\n\t\teventName: K,\n\t\tlistener: AnchorEvents[K],\n\t): () => void {\n\t\treturn this.events.on(eventName, listener);\n\t}\n\n\tpublic child(key: FieldKey, index: number): UpPath<AnchorNode> {\n\t\t// Fast path: if child exists, return it.\n\t\treturn (\n\t\t\tthis.tryGetChild(key, index) ?? { parent: this, parentField: key, parentIndex: index }\n\t\t);\n\t}\n\n\tpublic getOrCreateChildRef(key: FieldKey, index: number): [Anchor, AnchorNode] {\n\t\tconst anchor = this.anchorSet.track(this.child(key, index));\n\t\tconst node =\n\t\t\tthis.anchorSet.locate(anchor) ?? fail(\"cannot reference child that does not exist\");\n\t\treturn [anchor, node];\n\t}\n\n\t/\n\t @returns true iff this PathNode is the special root node that sits above all the detached fields.\n\t * In this case, the fields are detached sequences.\n\t * Note that the special root node should never appear in an UpPath\n\t * since UpPaths represent this root as `undefined`.\n\t /\n\tprivate isRoot(): boolean {\n\t\treturn this.parentPath === undefined;\n\t}\n\n\tpublic get parent(): PathNode \| undefined {\n\t\tassert(this.status !== Status.Disposed, 0x409 / PathNode must not be disposed /);\n\t\tassert(\n\t\t\tthis.parentPath !== undefined,\n\t\t\t0x355 / PathNode.parent is an UpPath API and thus should never be called on the root PathNode. /,\n\t\t);\n\t\t// Root PathNode corresponds to the undefined root for UpPath API.\n\t\tif (this.parentPath.isRoot()) {\n\t\t\treturn undefined;\n\t\t}\n\t\treturn this.parentPath;\n\t}\n\n\tpublic addRef(count = 1): void {\n\t\tassert(this.status === Status.Alive, 0x40a / PathNode must be alive /);\n\t\tthis.referenceAdded(count);\n\t}\n\n\tpublic removeRef(count = 1): void {\n\t\tassert(this.status !== Status.Disposed, 0x40b / PathNode must not be disposed /);\n\t\tthis.referenceRemoved(count);\n\t}\n\n\t// Called when refcount is set to 0.\n\t// Node may be kept alive by children or events after this point.\n\tprotected onUnreferenced(): void {\n\t\tthis.considerDispose();\n\t}\n\n\t/\n\t Gets a child, adding a ref to it.\n\t * Creates child (with 1 ref) if needed.\n\t /\n\tpublic getOrCreateChild(key: FieldKey, index: number): PathNode {\n\t\tassert(this.status === Status.Alive, 0x40c / PathNode must be alive /);\n\t\tlet field = this.children.get(key);\n\t\tif (field === undefined) {\n\t\t\tfield = [];\n\t\t\tthis.children.set(key, field);\n\t\t}\n\t\t// TODO: should do more optimized search (ex: binary search).\n\t\tlet child = field.find((c) => c.parentIndex === index);\n\t\tif (child === undefined) {\n\t\t\tchild = new PathNode(this.anchorSet, key, index, this);\n\t\t\tfield.push(child);\n\t\t\t// Keep list sorted by index.\n\t\t\tfield.sort((a, b) => a.parentIndex - b.parentIndex);\n\t\t} else {\n\t\t\tchild.addRef();\n\t\t}\n\t\treturn child;\n\t}\n\n\t/\n\t Gets a child if it exists.\n\t * Does NOT add a ref.\n\t /\n\tpublic tryGetChild(key: FieldKey, index: number): PathNode \| undefined {\n\t\tassert(this.status === Status.Alive, 0x40d / PathNode must be alive /);\n\t\tconst field = this.children.get(key);\n\n\t\t// TODO: should do more optimized search (ex: binary search or better) using index.\n\t\treturn field?.find((c) => c.parentIndex === index);\n\t}\n\n\t/\n\t Removes reference from this to `child`.\n\t * Since PathNodes are doubly linked,\n\t * the caller must ensure that the reference from child to parent is also removed (or the child is no longer used).\n\t /\n\tpublic removeChild(child: PathNode): void {\n\t\tassert(this.status === Status.Alive, 0x40e / PathNode must be alive /);\n\t\tconst key = child.parentField;\n\t\tconst field = this.children.get(key);\n\t\t// TODO: should do more optimized search (ex: binary search or better) using child.parentIndex()\n\t\t// Note that this is the index in the list of child paths, not the index within the field\n\t\tconst childIndex = field?.indexOf(child) ?? -1;\n\t\tassert(childIndex !== -1, 0x35c / child must be parented to be removed /);\n\t\tfield?.splice(childIndex, 1);\n\t\tif (field?.length === 0) {\n\t\t\tthis.afterEmptyField(key);\n\t\t}\n\t}\n\n\t/\n\t Call this after directly editing the child array for a field to be empty.\n\t * Handles cleaning up unneeded data\n\t * (like the field in the map, and possibly this entire PathNode and its parents if they are no longer needed.)\n\t /\n\tpublic afterEmptyField(key: FieldKey): void {\n\t\tassert(this.status === Status.Alive, 0x40f / PathNode must be alive /);\n\t\tthis.children.delete(key);\n\t\tthis.considerDispose();\n\t}\n\n\t/\n\t If node is no longer needed (has no references, no children and no events):\n\t * removes this from parent if alive, and sets this to disposed.\n\t * Must only be called when .\n\t \n\t Allowed when dangling (but not when disposed).\n\t /\n\tprivate considerDispose(): void {\n\t\tassert(this.status !== Status.Disposed, 0x41d / PathNode must not be disposed */);\n\t\tif (this.isUnreferenced() && this.children.size === 0 && !this.events.hasListeners()) {\n\t\t\tif (this.status === Status.Alive) {\n\t\t\t\tthis.parentPath?.removeChild(this);\n\t\t\t}\n\t\t\tthis.status = Status.Disposed;\n\t\t}\n\t}\n}\n"]}

package/dist/core/tree/cursor.d.ts CHANGED Viewed

@@ -9,7 +9,6 @@ import type { TreeType, Value } from "./types.js";
  * A symbol for marking an object as an {@link ITreeCursor}.
  *
  * Useful when APIs want to take in tree data in multiple formats, including cursors.
- * @internal
  */
 export declare const CursorMarker: unique symbol;
 /**
@@ -20,8 +19,7 @@ export declare const CursorMarker: unique symbol;
 export declare function isCursor(data: unknown): data is ITreeCursor;
 /**
  * A stateful low-level interface for reading tree data.
- * @internal
- *
+ * *
  * @remarks Cursor exists so that specialized data formats can be viewed through
  * a common abstraction. This allows performance optimizations to be done based
  * on data.
@@ -242,7 +240,6 @@ export interface ITreeCursor {
  * For example, if a node is being inserted in the 5th position in a field "Foo", you can update a path in that node's subtree to its new path by prefixing it with
  * `{ parent: theNodeAboveTheMovedNode, rootFieldOverride: Foo, indexOffset: 5 }`.
  * See {@link prefixPath} and {@link prefixFieldPath} for how to apply the prefix to the paths.
- * @internal
  */
 export interface PathRootPrefix {
     /**
@@ -264,7 +261,6 @@ export interface PathRootPrefix {
     indexOffset?: number;
 }
 /**
- * @internal
  */
 export declare const enum CursorLocationType {
     /**
@@ -280,7 +276,6 @@ export declare const enum CursorLocationType {
 }
 /**
  * {@link ITreeCursor} that is never pending.
- * @internal
  */
 export interface ITreeCursorSynchronous extends ITreeCursor {
     readonly pending: false;

package/dist/core/tree/cursor.d.ts.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"cursor.d.ts","sourceRoot":"","sources":["../../../src/core/tree/cursor.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAIH,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,2BAA2B,CAAC;AAE1D,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,EAAE,MAAM,eAAe,CAAC;AACzD,OAAO,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AAElD~~;;;;;GAKG~~;AACH,eAAO,MAAM,YAAY,EAAE,OAAO,MAA+B,CAAC;AAElE;;;;GAIG;AACH,wBAAgB,QAAQ,CAAC,IAAI,EAAE,OAAO,GAAG,IAAI,IAAI,WAAW,CAQ3D;AAED~~;;;;;;;;;;;;GAYG~~;AACH,MAAM,WAAW,WAAW;IAC3B;;OAEG;IACH,QAAQ,CAAC,CAAC,YAAY,CAAC,EAAE,IAAI,CAAC;IAE9B;;;;;;;;;;;;;;;;;;;;;;;;;OAyBG;IACH,QAAQ,CAAC,IAAI,EAAE,kBAAkB,CAAC;IAMlC,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;IAI1B;;;;;;;;;;;;;OAaG;IACH,SAAS,IAAI,OAAO,CAAC;IAErB;;;;;;;OAOG;IACH,SAAS,IAAI,IAAI,CAAC;IAElB;;;;;;;;;OASG;IACH,iBAAiB,IAAI,OAAO,CAAC;IAI7B;;;;OAIG;IACH,WAAW,IAAI,QAAQ,CAAC;IAExB;;;;OAIG;IACH,cAAc,IAAI,MAAM,CAAC;IAEzB;;;;;;OAMG;IACH,SAAS,IAAI,OAAO,CAAC;IAErB;;;;;OAKG;IACH,SAAS,CAAC,UAAU,EAAE,MAAM,GAAG,IAAI,CAAC;IAEpC;;;;;;;;;;;;;;;OAeG;IACH,YAAY,CAAC,MAAM,CAAC,EAAE,cAAc,GAAG,WAAW,CAAC;IAInD;;;;;;;;;;;;;;;OAeG;IACH,OAAO,CAAC,MAAM,CAAC,EAAE,cAAc,GAAG,MAAM,GAAG,SAAS,CAAC;IAErD;;;;OAIG;IACH,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAE5B;;;;;OAKG;IACH,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAE5B;;;;;;;;;;OAUG;IACH,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAE7B;;;;;;OAMG;IACH,SAAS,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC;IAEnC;;OAEG;IACH,QAAQ,IAAI,OAAO,CAAC;IAEpB;;;;;;;;OAQG;IACH,QAAQ,IAAI,IAAI,CAAC;IAIjB;;;;;;;OAOG;IACH,UAAU,IAAI,OAAO,CAAC;IAEtB;;;;OAIG;IACH,UAAU,CAAC,GAAG,EAAE,QAAQ,GAAG,IAAI,CAAC;IAEhC;;;;OAIG;IACH,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC;IAExB;;;;OAIG;IACH,QAAQ,CAAC,KAAK,EAAE,KAAK,CAAC;CACtB;AAED~~;;;;;;;;GAQG~~;AACH,MAAM,WAAW,cAAc;IAC9B;;;;;OAKG;IACH,MAAM,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IAE5B;;;;OAIG;IACH,iBAAiB,CAAC,EAAE,QAAQ,CAAC;IAE7B;;OAEG;IACH,WAAW,CAAC,EAAE,MAAM,CAAC;CACrB;AAED~~;;GAEG~~;AACH,0BAAkB,kBAAkB;IACnC;;;OAGG;IACH,KAAK,IAAA;IAEL;;;OAGG;IACH,MAAM,IAAA;CACN;AAED~~;;;GAGG~~;AACH,MAAM,WAAW,sBAAuB,SAAQ,WAAW;IAC1D,QAAQ,CAAC,OAAO,EAAE,KAAK,CAAC;CACxB;AAED;;;;;;;GAOG;AACH,wBAAgB,eAAe,CAAC,CAAC,EAAE,OAAO,SAAS,WAAW,GAAG,WAAW,EAC3E,MAAM,EAAE,OAAO,EACf,CAAC,EAAE,CAAC,MAAM,EAAE,OAAO,KAAK,CAAC,GACvB,CAAC,EAAE,CAML;AAED;;;;GAIG;AACH,wBAAgB,YAAY,CAAC,OAAO,SAAS,WAAW,GAAG,WAAW,EACrE,MAAM,EAAE,OAAO,EACf,CAAC,EAAE,CAAC,MAAM,EAAE,OAAO,KAAK,IAAI,GAC1B,IAAI,CAKN;AAED;;;;;;GAMG;AACH,wBAAgB,cAAc,CAAC,CAAC,EAAE,OAAO,SAAS,WAAW,GAAG,WAAW,EAC1E,MAAM,EAAE,OAAO,EACf,CAAC,EAAE,CAAC,MAAM,EAAE,OAAO,KAAK,CAAC,GACvB,CAAC,EAAE,CAML;AAED;;;;;;GAMG;AACH,wBAAiB,kBAAkB,CAAC,CAAC,EAAE,OAAO,SAAS,WAAW,GAAG,WAAW,EAC/E,MAAM,EAAE,OAAO,EACf,CAAC,EAAE,CAAC,MAAM,EAAE,OAAO,KAAK,CAAC,GACvB,gBAAgB,CAAC,CAAC,CAAC,CAKrB;AAED;;;;GAIG;AACH,wBAAgB,WAAW,CAAC,OAAO,SAAS,WAAW,GAAG,WAAW,EACpE,MAAM,EAAE,OAAO,EACf,CAAC,EAAE,CAAC,MAAM,EAAE,OAAO,KAAK,IAAI,GAC1B,IAAI,CAKN;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,oBAAoB,CAAC,OAAO,SAAS,WAAW,GAAG,WAAW,EAC7E,MAAM,EAAE,OAAO,EACf,CAAC,EAAE,CAAC,MAAM,EAAE,OAAO,KAAK,IAAI,GAC1B,IAAI,CAON;AAED;;;;GAIG;AACH,wBAAgB,uBAAuB,CAAC,MAAM,EAAE,WAAW,GAAG,sBAAsB,CAEnF;AAED;;;;;;GAMG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAAE,OAAO,SAAS,WAAW,GAAG,WAAW,EACzE,MAAM,EAAE,OAAO,EACf,KAAK,EAAE,QAAQ,EACf,CAAC,EAAE,CAAC,MAAM,EAAE,OAAO,KAAK,CAAC,GACvB,CAAC,CAKH;AAED;;;;;;GAMG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAAE,OAAO,SAAS,WAAW,GAAG,WAAW,EACxE,MAAM,EAAE,OAAO,EACf,KAAK,EAAE,MAAM,EACb,CAAC,EAAE,CAAC,MAAM,EAAE,OAAO,KAAK,CAAC,GACvB,CAAC,CAKH"}
1	+ {"version":3,"file":"cursor.d.ts","sourceRoot":"","sources":["../../../src/core/tree/cursor.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAIH,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,2BAA2B,CAAC;AAE1D,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,EAAE,MAAM,eAAe,CAAC;AACzD,OAAO,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AAElD;;;;GAIG;AACH,eAAO,MAAM,YAAY,EAAE,OAAO,MAA+B,CAAC;AAElE;;;;GAIG;AACH,wBAAgB,QAAQ,CAAC,IAAI,EAAE,OAAO,GAAG,IAAI,IAAI,WAAW,CAQ3D;AAED;;;;;;;;;;;GAWG;AACH,MAAM,WAAW,WAAW;IAC3B;;OAEG;IACH,QAAQ,CAAC,CAAC,YAAY,CAAC,EAAE,IAAI,CAAC;IAE9B;;;;;;;;;;;;;;;;;;;;;;;;;OAyBG;IACH,QAAQ,CAAC,IAAI,EAAE,kBAAkB,CAAC;IAMlC,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;IAI1B;;;;;;;;;;;;;OAaG;IACH,SAAS,IAAI,OAAO,CAAC;IAErB;;;;;;;OAOG;IACH,SAAS,IAAI,IAAI,CAAC;IAElB;;;;;;;;;OASG;IACH,iBAAiB,IAAI,OAAO,CAAC;IAI7B;;;;OAIG;IACH,WAAW,IAAI,QAAQ,CAAC;IAExB;;;;OAIG;IACH,cAAc,IAAI,MAAM,CAAC;IAEzB;;;;;;OAMG;IACH,SAAS,IAAI,OAAO,CAAC;IAErB;;;;;OAKG;IACH,SAAS,CAAC,UAAU,EAAE,MAAM,GAAG,IAAI,CAAC;IAEpC;;;;;;;;;;;;;;;OAeG;IACH,YAAY,CAAC,MAAM,CAAC,EAAE,cAAc,GAAG,WAAW,CAAC;IAInD;;;;;;;;;;;;;;;OAeG;IACH,OAAO,CAAC,MAAM,CAAC,EAAE,cAAc,GAAG,MAAM,GAAG,SAAS,CAAC;IAErD;;;;OAIG;IACH,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAE5B;;;;;OAKG;IACH,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAE5B;;;;;;;;;;OAUG;IACH,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAE7B;;;;;;OAMG;IACH,SAAS,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC;IAEnC;;OAEG;IACH,QAAQ,IAAI,OAAO,CAAC;IAEpB;;;;;;;;OAQG;IACH,QAAQ,IAAI,IAAI,CAAC;IAIjB;;;;;;;OAOG;IACH,UAAU,IAAI,OAAO,CAAC;IAEtB;;;;OAIG;IACH,UAAU,CAAC,GAAG,EAAE,QAAQ,GAAG,IAAI,CAAC;IAEhC;;;;OAIG;IACH,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC;IAExB;;;;OAIG;IACH,QAAQ,CAAC,KAAK,EAAE,KAAK,CAAC;CACtB;AAED;;;;;;;GAOG;AACH,MAAM,WAAW,cAAc;IAC9B;;;;;OAKG;IACH,MAAM,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IAE5B;;;;OAIG;IACH,iBAAiB,CAAC,EAAE,QAAQ,CAAC;IAE7B;;OAEG;IACH,WAAW,CAAC,EAAE,MAAM,CAAC;CACrB;AAED;GACG;AACH,0BAAkB,kBAAkB;IACnC;;;OAGG;IACH,KAAK,IAAA;IAEL;;;OAGG;IACH,MAAM,IAAA;CACN;AAED;;GAEG;AACH,MAAM,WAAW,sBAAuB,SAAQ,WAAW;IAC1D,QAAQ,CAAC,OAAO,EAAE,KAAK,CAAC;CACxB;AAED;;;;;;;GAOG;AACH,wBAAgB,eAAe,CAAC,CAAC,EAAE,OAAO,SAAS,WAAW,GAAG,WAAW,EAC3E,MAAM,EAAE,OAAO,EACf,CAAC,EAAE,CAAC,MAAM,EAAE,OAAO,KAAK,CAAC,GACvB,CAAC,EAAE,CAML;AAED;;;;GAIG;AACH,wBAAgB,YAAY,CAAC,OAAO,SAAS,WAAW,GAAG,WAAW,EACrE,MAAM,EAAE,OAAO,EACf,CAAC,EAAE,CAAC,MAAM,EAAE,OAAO,KAAK,IAAI,GAC1B,IAAI,CAKN;AAED;;;;;;GAMG;AACH,wBAAgB,cAAc,CAAC,CAAC,EAAE,OAAO,SAAS,WAAW,GAAG,WAAW,EAC1E,MAAM,EAAE,OAAO,EACf,CAAC,EAAE,CAAC,MAAM,EAAE,OAAO,KAAK,CAAC,GACvB,CAAC,EAAE,CAML;AAED;;;;;;GAMG;AACH,wBAAiB,kBAAkB,CAAC,CAAC,EAAE,OAAO,SAAS,WAAW,GAAG,WAAW,EAC/E,MAAM,EAAE,OAAO,EACf,CAAC,EAAE,CAAC,MAAM,EAAE,OAAO,KAAK,CAAC,GACvB,gBAAgB,CAAC,CAAC,CAAC,CAKrB;AAED;;;;GAIG;AACH,wBAAgB,WAAW,CAAC,OAAO,SAAS,WAAW,GAAG,WAAW,EACpE,MAAM,EAAE,OAAO,EACf,CAAC,EAAE,CAAC,MAAM,EAAE,OAAO,KAAK,IAAI,GAC1B,IAAI,CAKN;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,oBAAoB,CAAC,OAAO,SAAS,WAAW,GAAG,WAAW,EAC7E,MAAM,EAAE,OAAO,EACf,CAAC,EAAE,CAAC,MAAM,EAAE,OAAO,KAAK,IAAI,GAC1B,IAAI,CAON;AAED;;;;GAIG;AACH,wBAAgB,uBAAuB,CAAC,MAAM,EAAE,WAAW,GAAG,sBAAsB,CAEnF;AAED;;;;;;GAMG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAAE,OAAO,SAAS,WAAW,GAAG,WAAW,EACzE,MAAM,EAAE,OAAO,EACf,KAAK,EAAE,QAAQ,EACf,CAAC,EAAE,CAAC,MAAM,EAAE,OAAO,KAAK,CAAC,GACvB,CAAC,CAKH;AAED;;;;;;GAMG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAAE,OAAO,SAAS,WAAW,GAAG,WAAW,EACxE,MAAM,EAAE,OAAO,EACf,KAAK,EAAE,MAAM,EACb,CAAC,EAAE,CAAC,MAAM,EAAE,OAAO,KAAK,CAAC,GACvB,CAAC,CAKH"}

package/dist/core/tree/cursor.js CHANGED Viewed

@@ -10,7 +10,6 @@ const internal_1 = require("@fluidframework/core-utils/internal");
  * A symbol for marking an object as an {@link ITreeCursor}.
  *
  * Useful when APIs want to take in tree data in multiple formats, including cursors.
- * @internal
  */
 exports.CursorMarker = Symbol("CursorMarker");
 /**
@@ -27,7 +26,6 @@ function isCursor(data) {
 }
 exports.isCursor = isCursor;
 /**
- * @internal
  */
 var CursorLocationType;
 (function (CursorLocationType) {

package/dist/core/tree/cursor.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"cursor.js","sourceRoot":"","sources":["../../../src/core/tree/cursor.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,kEAA6D;AAO7D;;;;;GAKG;AACU,QAAA,YAAY,GAAkB,MAAM,CAAC,cAAc,CAAC,CAAC;AAElE;;;;GAIG;AACH,SAAgB,QAAQ,CAAC,IAAa;IACrC,sFAAsF;IACtF,6FAA6F;IAC7F,OAAO,CACN,IAAI,KAAK,IAAI;QACb,OAAO,IAAI,KAAK,QAAQ;QACvB,IAA6B,CAAC,oBAAY,CAAC,KAAK,IAAI,CACrD,CAAC;AACH,CAAC;AARD,4BAQC;AA4RD;;GAEG;AACH,IAAkB,kBAYjB;AAZD,WAAkB,kBAAkB;IACnC;;;OAGG;IACH,6DAAK,CAAA;IAEL;;;OAGG;IACH,+DAAM,CAAA;AACP,CAAC,EAZiB,kBAAkB,kCAAlB,kBAAkB,QAYnC;AAUD;;;;;;;GAOG;AACH,SAAgB,eAAe,CAC9B,MAAe,EACf,CAAyB;IAEzB,MAAM,MAAM,GAAQ,EAAE,CAAC;IACvB,YAAY,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,EAAE;QAC1B,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACnB,CAAC,CAAC,CAAC;IACH,OAAO,MAAM,CAAC;AACf,CAAC;AATD,0CASC;AAED;;;;GAIG;AACH,SAAgB,YAAY,CAC3B,MAAe,EACf,CAA4B;IAE5B,IAAA,iBAAM,EAAC,MAAM,CAAC,IAAI,qCAA6B,EAAE,KAAK,CAAC,wBAAwB,CAAC,CAAC;IACjF,KAAK,IAAI,OAAO,GAAG,MAAM,CAAC,UAAU,EAAE,EAAE,OAAO,EAAE,OAAO,GAAG,MAAM,CAAC,SAAS,EAAE,EAAE,CAAC;QAC/E,CAAC,CAAC,MAAM,CAAC,CAAC;IACX,CAAC;AACF,CAAC;AARD,oCAQC;AAED;;;;;;GAMG;AACH,SAAgB,cAAc,CAC7B,MAAe,EACf,CAAyB;IAEzB,MAAM,MAAM,GAAQ,EAAE,CAAC;IACvB,WAAW,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,EAAE;QACzB,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACnB,CAAC,CAAC,CAAC;IACH,OAAO,MAAM,CAAC;AACf,CAAC;AATD,wCASC;AAED;;;;;;GAMG;AACH,QAAe,CAAC,CAAC,kBAAkB,CAClC,MAAe,EACf,CAAyB;IAEzB,IAAA,iBAAM,EAAC,MAAM,CAAC,IAAI,sCAA8B,EAAE,KAAK,CAAC,yBAAyB,CAAC,CAAC;IACnF,KAAK,IAAI,OAAO,GAAG,MAAM,CAAC,SAAS,EAAE,EAAE,OAAO,EAAE,OAAO,GAAG,MAAM,CAAC,QAAQ,EAAE,EAAE,CAAC;QAC7E,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC;IACjB,CAAC;AACF,CAAC;AARD,gDAQC;AAED;;;;GAIG;AACH,SAAgB,WAAW,CAC1B,MAAe,EACf,CAA4B;IAE5B,IAAA,iBAAM,EAAC,MAAM,CAAC,IAAI,sCAA8B,EAAE,KAAK,CAAC,yBAAyB,CAAC,CAAC;IACnF,KAAK,IAAI,OAAO,GAAG,MAAM,CAAC,SAAS,EAAE,EAAE,OAAO,EAAE,OAAO,GAAG,MAAM,CAAC,QAAQ,EAAE,EAAE,CAAC;QAC7E,CAAC,CAAC,MAAM,CAAC,CAAC;IACX,CAAC;AACF,CAAC;AARD,kCAQC;AAED;;;;;;;;;;GAUG;AACH,SAAgB,oBAAoB,CACnC,MAAe,EACf,CAA4B;IAE5B,IAAI,MAAM,CAAC,IAAI,qCAA6B,EAAE,CAAC;QAC9C,CAAC,CAAC,MAAM,CAAC,CAAC;QACV,YAAY,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,oBAAoB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACzD,CAAC;SAAM,CAAC;QACP,WAAW,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,oBAAoB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACxD,CAAC;AACF,CAAC;AAVD,oDAUC;AAED;;;;GAIG;AACH,SAAgB,uBAAuB,CAAC,MAAmB;IAC1D,OAAO,MAAgC,CAAC;AACzC,CAAC;AAFD,0DAEC;AAED;;;;;;GAMG;AACH,SAAgB,aAAa,CAC5B,MAAe,EACf,KAAe,EACf,CAAyB;IAEzB,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;IACzB,MAAM,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;IACzB,MAAM,CAAC,SAAS,EAAE,CAAC;IACnB,OAAO,MAAM,CAAC;AACf,CAAC;AATD,sCASC;AAED;;;;;;GAMG;AACH,SAAgB,YAAY,CAC3B,MAAe,EACf,KAAa,EACb,CAAyB;IAEzB,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;IACxB,MAAM,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;IACzB,MAAM,CAAC,QAAQ,EAAE,CAAC;IAClB,OAAO,MAAM,CAAC;AACf,CAAC;AATD,oCASC","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 type { FieldKey } from \"../schema-stored/index.js\";\n\nimport type { FieldUpPath, UpPath } from \"./pathTree.js\";\nimport type { TreeType, Value } from \"./types.js\";\n\n/\n A symbol for marking an object as an {@link ITreeCursor}.\n \n Useful when APIs want to take in tree data in multiple formats, including cursors.\n * @internal\n /\nexport const CursorMarker: unique symbol = Symbol(\"CursorMarker\");\n\n/\n Check if something is an {@link ITreeCursor}.\n \n Useful when APIs want to take in tree data in multiple formats, including cursors.\n /\nexport function isCursor(data: unknown): data is ITreeCursor {\n\t// Other than on null and undefined, looking up a missing symbol shouldn't type error.\n\t// typeof check deals with undefined while providing an early out for other non-object types.\n\treturn (\n\t\tdata !== null &&\n\t\ttypeof data === \"object\" &&\n\t\t(data as Partial<ITreeCursor>)[CursorMarker] === true\n\t);\n}\n\n/\n A stateful low-level interface for reading tree data.\n * @internal\n \n @remarks Cursor exists so that specialized data formats can be viewed through\n * a common abstraction. This allows performance optimizations to be done based\n * on data.\n \n A tree cursor is similar to a database cursor in that it allows for the efficient\n * traversal over the contents of a tree. Note that unlike a database cursor,\n * tree cursors may be invalidated after any edit to the tree. For a cursor-like\n * structure that also remains valid across edits, see {@link AnchorNode}.\n /\nexport interface ITreeCursor {\n\t/\n\t Marks this object as a cursor.\n\t /\n\treadonly [CursorMarker]: true;\n\n\t/\n\t What kind of place the cursor is at.\n\t * Determines which operations are allowed.\n\t \n\t @remarks\n\t * Users of cursors frequently need to refer to places in trees, both fields and nodes.\n\t * Approaches other than having the cursor have separate modes for these\n\t * cases had issues even worse than having the two modes.\n\t \n\t For example, modeling fields as parent + key has issues when there is no\n\t * parent, and doesn't provide a great way to do iteration over fields while\n\t * also having a nice API and making it easy for the implementation to track\n\t * state (like its current location inside a sequence tree of fields) while\n\t * traversing without having to allocate some state management for that.\n\t \n\t Another approach, of using arrays of cursors for fields (like we currently\n\t * do for inserting content) is very inefficient and better addressed by a\n\t * dual mode cursor.\n\t \n\t Another approach, of using the first node in a field when referring to\n\t * the field gets confusing since it's unclear if a given cursor means that\n\t * node, or that node, and the ones after it, and in the second case, it's\n\t * hard to restore the cursor back to the right state when returning. It also\n\t * doesn't work for empty fields. Overall there just didn't seem to be a way\n\t * that sucked less than the dual mode API.\n\t /\n\treadonly mode: CursorLocationType;\n\n\t/\n\t * True iff the current field or node (depending on mode) is \"pending\",\n\t * meaning that it has not been downloaded.\n\t /\n\treadonly pending: boolean;\n\n\t// ******* APIs for when mode = Fields ****** //\n\n\t/\n\t * Moves the \"current field\" forward one in an arbitrary field traversal order,\n\t * skipping any empty fields.\n\t \n\t If there is no remaining field to iterate to,\n\t * returns false and navigates up to the parent setting the mode to `Nodes`.\n\t \n\t Order of fields is only guaranteed to be consistent through a single iteration.\n\t \n\t If skipPending, skip past fields which are currently pending.\n\t * This can be used to skip to the end of a large number of consecutive pending fields.\n\t \n\t Allowed when `mode` is `Fields`.\n\t /\n\tnextField(): boolean;\n\n\t/\n\t Navigate up to parent node.\n\t * Sets mode to `Nodes`\n\t \n\t Only valid when `mode` is `Fields`.\n\t \n\t TODO: what to do if at root?\n\t /\n\texitField(): void;\n\n\t/\n\t Moves the \"current field\" forward until `pending` is `false`.\n\t \n\t If there are no remaining field to iterate to,\n\t * returns false and navigates up to the parent setting the mode to `Nodes`.\n\t \n\t Order of fields is only guaranteed to be consistent through a single iteration.\n\t \n\t Allowed when `mode` is `Fields`.\n\t /\n\tskipPendingFields(): boolean;\n\n\t// ******* APIs for when mode = Fields, and not pending ****** //\n\n\t/\n\t * Returns the FieldKey for the current field.\n\t \n\t Allowed when `mode` is `Fields`, and not `pending`.\n\t /\n\tgetFieldKey(): FieldKey;\n\n\t/\n\t @returns the number of immediate children in the current field.\n\t \n\t Allowed when `mode` is `Fields`, and not `pending`.\n\t /\n\tgetFieldLength(): number;\n\n\t/\n\t Moves to the first node of the selected field, setting mode to `Nodes`.\n\t \n\t If field is empty, returns false instead.\n\t \n\t Allowed when `mode` is `Fields`, and not `pending`.\n\t /\n\tfirstNode(): boolean;\n\n\t/\n\t Sets current node to the node at the provided `index` of the current field.\n\t \n\t Allowed when `mode` is `Fields`, and not `pending`.\n\t * Sets mode to `Nodes`.\n\t /\n\tenterNode(childIndex: number): void;\n\n\t/\n\t Returns a path to the current field. See {@link FieldUpPath}.\n\t \n\t Only valid when `mode` is `Fields`.\n\t \n\t If no prefix is provided, assumes this cursor is treated as if it has a root node where its field keys are actually detached sequences.\n\t * If the cursor is not rooted at such a node, the `prefix` should be used to ensure the path has the correct root.\n\t * This requirement exists because {@link FieldUpPath}s are absolute paths\n\t * and thus must be rooted in a detached sequence.\n\t \n\t @param prefix - optional overrides to apply to the root of the returned path.\n\t * See {@link PathRootPrefix}.\n\t * This adjusts the path as if the tree data accessible to this cursor is part of a larger tree.\n\t \n\t @returns a path to the current field.\n\t /\n\tgetFieldPath(prefix?: PathRootPrefix): FieldUpPath;\n\n\t// ******* APIs for when mode = Nodes ****** //\n\n\t/\n\t * Returns a path to the current node. See {@link UpPath}.\n\t \n\t Only valid when `mode` is `Nodes`.\n\t \n\t If no prefix is provided, assumes this cursor is treated as if it has a root node where its field keys are actually detached sequences.\n\t * If the cursor is not rooted at such a node, the `prefix` should be used to ensure the path has the correct root.\n\t * This requirement exists because {@link UpPath}s are absolute paths\n\t * and thus must be rooted in a detached sequence.\n\t \n\t @param prefix - optional overrides to apply to the root of the returned path.\n\t * See {@link PathRootPrefix}.\n\t * This adjusts the path as if the tree data accessible to this cursor is part of a larger tree.\n\t \n\t @returns a path to the current node.\n\t /\n\tgetPath(prefix?: PathRootPrefix): UpPath \| undefined;\n\n\t/\n\t Index (within its parent field) of the current node.\n\t \n\t Only valid when `mode` is `Nodes`.\n\t /\n\treadonly fieldIndex: number;\n\n\t/\n\t Index (within its parent field) of the first node in the current chunk.\n\t * Always less than or equal to `currentIndexInField`.\n\t \n\t Only valid when `mode` is `Nodes`.\n\t /\n\treadonly chunkStart: number;\n\n\t/\n\t Length of current chunk.\n\t * Since an entire chunk always has the same `pending` value,\n\t * can be used to help skip over all of a pending chunk at once.\n\t \n\t TODO:\n\t * Add optional APIs to access underlying chunks so readers can\n\t * accelerate processing of chunk formats they understand.\n\t \n\t Only valid when `mode` is `Nodes`.\n\t /\n\treadonly chunkLength: number;\n\n\t/\n\t Moves `offset` nodes in the field.\n\t * If seeking to exactly past either end,\n\t * returns false and navigates up to the parent field (setting mode to `Fields`).\n\t \n\t Allowed if mode is `Nodes`.\n\t /\n\tseekNodes(offset: number): boolean;\n\n\t/\n\t The same as `seekNodes(1)`, but might be faster.\n\t /\n\tnextNode(): boolean;\n\n\t/\n\t Navigate up to parent field.\n\t * Sets mode to `Fields`\n\t \n\t Same as seek Number.POSITIVE_INFINITY, but only valid when `mode` is `Nodes`.\n\t \n\t TODO: what to do if at root?\n\t * TODO: Maybe merge with upToNode to make a single \"Up\"?\n\t /\n\texitNode(): void;\n\n\t// ******* APIs for when mode = Nodes and not pending ****** //\n\n\t/\n\t * Enters the first non-empty field (setting mode to `Fields`)\n\t * so fields can be iterated with `nextField` and `skipPendingFields`.\n\t \n\t If there are no fields, mode is returned to `Nodes` and false is returned.\n\t \n\t Allowed when `mode` is `Nodes` and not `pending`.\n\t /\n\tfirstField(): boolean;\n\n\t/\n\t Navigate to the field with the specified `key` and set the mode to `Fields`.\n\t \n\t Only valid when `mode` is `Nodes`, and not `pending`.\n\t /\n\tenterField(key: FieldKey): void;\n\n\t/\n\t The type of the currently selected node.\n\t \n\t Only valid when `mode` is `Nodes`, and not `pending`.\n\t /\n\treadonly type: TreeType;\n\n\t/\n\t The value associated with the currently selected node.\n\t \n\t Only valid when `mode` is `Nodes`, and not `pending`.\n\t /\n\treadonly value: Value;\n}\n\n/\n Prefix to apply as the root of a {@link UpPath} or {@link FieldUpPath}.\n \n @remarks This can be used to take a path relative to a subtree, and make it relative to a larger containing tree.\n * For example, if a node is being inserted in the 5th position in a field \"Foo\", you can update a path in that node's subtree to its new path by prefixing it with\n * `{ parent: theNodeAboveTheMovedNode, rootFieldOverride: Foo, indexOffset: 5 }`.\n * See {@link prefixPath} and {@link prefixFieldPath} for how to apply the prefix to the paths.\n * @internal\n /\nexport interface PathRootPrefix {\n\t/\n\t The new parent to place above root of the path which is being prefixed.\n\t * This replaces the `undefined` at the root of the path.\n\t \n\t @remarks specifying `undefined` here results in no change to the path.\n\t /\n\tparent?: UpPath \| undefined;\n\n\t/\n\t The field of `parent` that the original path will be included under.\n\t \n\t If `undefined` the root field key from the original path will be used.\n\t /\n\trootFieldOverride?: FieldKey;\n\n\t/\n\t Offset to add to the uppermost `parentIndex` in the original path.\n\t /\n\tindexOffset?: number;\n}\n\n/\n @internal\n /\nexport const enum CursorLocationType {\n\t/\n\t Can iterate through nodes in a field.\n\t * At a \"current node\".\n\t /\n\tNodes,\n\n\t/\n\t Can iterate through fields of a node.\n\t * At a \"current field\".\n\t /\n\tFields,\n}\n\n/\n {@link ITreeCursor} that is never pending.\n * @internal\n /\nexport interface ITreeCursorSynchronous extends ITreeCursor {\n\treadonly pending: false;\n}\n\n/\n @param cursor - tree whose fields will be visited.\n * @param f - builds output from field, which will be selected in cursor when cursor is provided.\n * If `f` moves cursor, it must put it back to where it was at the beginning of `f` before returning.\n * @returns array resulting from applying `f` to each field of the current node on `cursor`.\n * Returns an empty array if the node is empty or not present (which are considered the same).\n * Note that order is not specified for field iteration.\n /\nexport function mapCursorFields<T, TCursor extends ITreeCursor = ITreeCursor>(\n\tcursor: TCursor,\n\tf: (cursor: TCursor) => T,\n): T[] {\n\tconst output: T[] = [];\n\tforEachField(cursor, (c) => {\n\t\toutput.push(f(c));\n\t});\n\treturn output;\n}\n\n/\n @param cursor - cursor at a node whose fields will be visited.\n * @param f - For on each field.\n * If `f` moves cursor, it must put it back to where it was at the beginning of `f` before returning.\n /\nexport function forEachField<TCursor extends ITreeCursor = ITreeCursor>(\n\tcursor: TCursor,\n\tf: (cursor: TCursor) => void,\n): void {\n\tassert(cursor.mode === CursorLocationType.Nodes, 0x411 / should be in nodes /);\n\tfor (let inField = cursor.firstField(); inField; inField = cursor.nextField()) {\n\t\tf(cursor);\n\t}\n}\n\n/\n @param cursor - tree whose field will be visited.\n * @param f - builds output from field member, which will be selected in cursor when cursor is provided.\n * If `f` moves cursor, it must put it back to where it was at the beginning of `f` before returning.\n * @returns array resulting from applying `f` to each item of the current field on `cursor`.\n * Returns an empty array if the field is empty or not present (which are considered the same).\n /\nexport function mapCursorField<T, TCursor extends ITreeCursor = ITreeCursor>(\n\tcursor: TCursor,\n\tf: (cursor: TCursor) => T,\n): T[] {\n\tconst output: T[] = [];\n\tforEachNode(cursor, (c) => {\n\t\toutput.push(f(c));\n\t});\n\treturn output;\n}\n\n/\n @param cursor - The tree whose field will be visited.\n * @param f - Builds output from field member, which will be selected in cursor when cursor is provided.\n * If `f` moves cursor, it must put it back to where it was at the beginning of `f` before returning.\n * @returns An iterable of `T` resulting from applying `f` to each item of the current field on `cursor`.\n * Yields nothing if an empty array if the field is empty or not present (which are considered the same).\n /\nexport function iterateCursorField<T, TCursor extends ITreeCursor = ITreeCursor>(\n\tcursor: TCursor,\n\tf: (cursor: TCursor) => T,\n): IterableIterator<T> {\n\tassert(cursor.mode === CursorLocationType.Fields, 0x7a8 /* should be in fields /);\n\tfor (let inNodes = cursor.firstNode(); inNodes; inNodes = cursor.nextNode()) {\n\t\tyield f(cursor);\n\t}\n}\n\n/\n @param cursor - cursor at a field whose nodes will be visited.\n * @param f - For on each node.\n * If `f` moves cursor, it must put it back to where it was at the beginning of `f` before returning.\n /\nexport function forEachNode<TCursor extends ITreeCursor = ITreeCursor>(\n\tcursor: TCursor,\n\tf: (cursor: TCursor) => void,\n): void {\n\tassert(cursor.mode === CursorLocationType.Fields, 0x3bd / should be in fields /);\n\tfor (let inNodes = cursor.firstNode(); inNodes; inNodes = cursor.nextNode()) {\n\t\tf(cursor);\n\t}\n}\n\n/\n @param cursor - cursor at a field or node.\n * @param f - Function to invoke for each node.\n * If `f` moves the cursor, it must put it back to where it was at the beginning of `f` before returning.\n \n Invokes `f` on each node in the subtree rooted at the current field or node.\n * Traversal is pre-order.\n * If the cursor is at a node, `f` will be invoked on that node.\n \n Returns the `cursor` to its initial position.\n /\nexport function forEachNodeInSubtree<TCursor extends ITreeCursor = ITreeCursor>(\n\tcursor: TCursor,\n\tf: (cursor: TCursor) => void,\n): void {\n\tif (cursor.mode === CursorLocationType.Nodes) {\n\t\tf(cursor);\n\t\tforEachField(cursor, (c) => forEachNodeInSubtree(c, f));\n\t} else {\n\t\tforEachNode(cursor, (c) => forEachNodeInSubtree(c, f));\n\t}\n}\n\n/\n Casts a cursor to an {@link ITreeCursorSynchronous}.\n \n TODO: #1404: Handle this properly for partial data loading support.\n /\nexport function castCursorToSynchronous(cursor: ITreeCursor): ITreeCursorSynchronous {\n\treturn cursor as ITreeCursorSynchronous;\n}\n\n/\n Runs `f` inside of field `field` on `cursor`.\n * @param cursor - Cursor whose field to enter and exit. Must be in `nodes` mode.\n * @param field - Field to enter.\n * @param f - Callback to run when in field.\n * @returns return value of `f`\n /\nexport function inCursorField<T, TCursor extends ITreeCursor = ITreeCursor>(\n\tcursor: TCursor,\n\tfield: FieldKey,\n\tf: (cursor: TCursor) => T,\n): T {\n\tcursor.enterField(field);\n\tconst result = f(cursor);\n\tcursor.exitField();\n\treturn result;\n}\n\n/\n Runs `f` inside of node `index` on `cursor`.\n * @param cursor - Cursor whoso node to enter and exit. Must be in `fields` mode.\n * @param index - Node to enter.\n * @param f - Callback to run when in node.\n * @returns return value of `f`\n */\nexport function inCursorNode<T, TCursor extends ITreeCursor = ITreeCursor>(\n\tcursor: TCursor,\n\tindex: number,\n\tf: (cursor: TCursor) => T,\n): T {\n\tcursor.enterNode(index);\n\tconst result = f(cursor);\n\tcursor.exitNode();\n\treturn result;\n}\n"]}
1	+ {"version":3,"file":"cursor.js","sourceRoot":"","sources":["../../../src/core/tree/cursor.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,kEAA6D;AAO7D;;;;GAIG;AACU,QAAA,YAAY,GAAkB,MAAM,CAAC,cAAc,CAAC,CAAC;AAElE;;;;GAIG;AACH,SAAgB,QAAQ,CAAC,IAAa;IACrC,sFAAsF;IACtF,6FAA6F;IAC7F,OAAO,CACN,IAAI,KAAK,IAAI;QACb,OAAO,IAAI,KAAK,QAAQ;QACvB,IAA6B,CAAC,oBAAY,CAAC,KAAK,IAAI,CACrD,CAAC;AACH,CAAC;AARD,4BAQC;AA0RD;GACG;AACH,IAAkB,kBAYjB;AAZD,WAAkB,kBAAkB;IACnC;;;OAGG;IACH,6DAAK,CAAA;IAEL;;;OAGG;IACH,+DAAM,CAAA;AACP,CAAC,EAZiB,kBAAkB,kCAAlB,kBAAkB,QAYnC;AASD;;;;;;;GAOG;AACH,SAAgB,eAAe,CAC9B,MAAe,EACf,CAAyB;IAEzB,MAAM,MAAM,GAAQ,EAAE,CAAC;IACvB,YAAY,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,EAAE;QAC1B,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACnB,CAAC,CAAC,CAAC;IACH,OAAO,MAAM,CAAC;AACf,CAAC;AATD,0CASC;AAED;;;;GAIG;AACH,SAAgB,YAAY,CAC3B,MAAe,EACf,CAA4B;IAE5B,IAAA,iBAAM,EAAC,MAAM,CAAC,IAAI,qCAA6B,EAAE,KAAK,CAAC,wBAAwB,CAAC,CAAC;IACjF,KAAK,IAAI,OAAO,GAAG,MAAM,CAAC,UAAU,EAAE,EAAE,OAAO,EAAE,OAAO,GAAG,MAAM,CAAC,SAAS,EAAE,EAAE,CAAC;QAC/E,CAAC,CAAC,MAAM,CAAC,CAAC;IACX,CAAC;AACF,CAAC;AARD,oCAQC;AAED;;;;;;GAMG;AACH,SAAgB,cAAc,CAC7B,MAAe,EACf,CAAyB;IAEzB,MAAM,MAAM,GAAQ,EAAE,CAAC;IACvB,WAAW,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,EAAE;QACzB,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACnB,CAAC,CAAC,CAAC;IACH,OAAO,MAAM,CAAC;AACf,CAAC;AATD,wCASC;AAED;;;;;;GAMG;AACH,QAAe,CAAC,CAAC,kBAAkB,CAClC,MAAe,EACf,CAAyB;IAEzB,IAAA,iBAAM,EAAC,MAAM,CAAC,IAAI,sCAA8B,EAAE,KAAK,CAAC,yBAAyB,CAAC,CAAC;IACnF,KAAK,IAAI,OAAO,GAAG,MAAM,CAAC,SAAS,EAAE,EAAE,OAAO,EAAE,OAAO,GAAG,MAAM,CAAC,QAAQ,EAAE,EAAE,CAAC;QAC7E,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC;IACjB,CAAC;AACF,CAAC;AARD,gDAQC;AAED;;;;GAIG;AACH,SAAgB,WAAW,CAC1B,MAAe,EACf,CAA4B;IAE5B,IAAA,iBAAM,EAAC,MAAM,CAAC,IAAI,sCAA8B,EAAE,KAAK,CAAC,yBAAyB,CAAC,CAAC;IACnF,KAAK,IAAI,OAAO,GAAG,MAAM,CAAC,SAAS,EAAE,EAAE,OAAO,EAAE,OAAO,GAAG,MAAM,CAAC,QAAQ,EAAE,EAAE,CAAC;QAC7E,CAAC,CAAC,MAAM,CAAC,CAAC;IACX,CAAC;AACF,CAAC;AARD,kCAQC;AAED;;;;;;;;;;GAUG;AACH,SAAgB,oBAAoB,CACnC,MAAe,EACf,CAA4B;IAE5B,IAAI,MAAM,CAAC,IAAI,qCAA6B,EAAE,CAAC;QAC9C,CAAC,CAAC,MAAM,CAAC,CAAC;QACV,YAAY,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,oBAAoB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACzD,CAAC;SAAM,CAAC;QACP,WAAW,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,oBAAoB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACxD,CAAC;AACF,CAAC;AAVD,oDAUC;AAED;;;;GAIG;AACH,SAAgB,uBAAuB,CAAC,MAAmB;IAC1D,OAAO,MAAgC,CAAC;AACzC,CAAC;AAFD,0DAEC;AAED;;;;;;GAMG;AACH,SAAgB,aAAa,CAC5B,MAAe,EACf,KAAe,EACf,CAAyB;IAEzB,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;IACzB,MAAM,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;IACzB,MAAM,CAAC,SAAS,EAAE,CAAC;IACnB,OAAO,MAAM,CAAC;AACf,CAAC;AATD,sCASC;AAED;;;;;;GAMG;AACH,SAAgB,YAAY,CAC3B,MAAe,EACf,KAAa,EACb,CAAyB;IAEzB,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;IACxB,MAAM,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;IACzB,MAAM,CAAC,QAAQ,EAAE,CAAC;IAClB,OAAO,MAAM,CAAC;AACf,CAAC;AATD,oCASC","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 type { FieldKey } from \"../schema-stored/index.js\";\n\nimport type { FieldUpPath, UpPath } from \"./pathTree.js\";\nimport type { TreeType, Value } from \"./types.js\";\n\n/\n A symbol for marking an object as an {@link ITreeCursor}.\n \n Useful when APIs want to take in tree data in multiple formats, including cursors.\n /\nexport const CursorMarker: unique symbol = Symbol(\"CursorMarker\");\n\n/\n Check if something is an {@link ITreeCursor}.\n \n Useful when APIs want to take in tree data in multiple formats, including cursors.\n /\nexport function isCursor(data: unknown): data is ITreeCursor {\n\t// Other than on null and undefined, looking up a missing symbol shouldn't type error.\n\t// typeof check deals with undefined while providing an early out for other non-object types.\n\treturn (\n\t\tdata !== null &&\n\t\ttypeof data === \"object\" &&\n\t\t(data as Partial<ITreeCursor>)[CursorMarker] === true\n\t);\n}\n\n/\n A stateful low-level interface for reading tree data.\n * \n @remarks Cursor exists so that specialized data formats can be viewed through\n * a common abstraction. This allows performance optimizations to be done based\n * on data.\n \n A tree cursor is similar to a database cursor in that it allows for the efficient\n * traversal over the contents of a tree. Note that unlike a database cursor,\n * tree cursors may be invalidated after any edit to the tree. For a cursor-like\n * structure that also remains valid across edits, see {@link AnchorNode}.\n /\nexport interface ITreeCursor {\n\t/\n\t Marks this object as a cursor.\n\t /\n\treadonly [CursorMarker]: true;\n\n\t/\n\t What kind of place the cursor is at.\n\t * Determines which operations are allowed.\n\t \n\t @remarks\n\t * Users of cursors frequently need to refer to places in trees, both fields and nodes.\n\t * Approaches other than having the cursor have separate modes for these\n\t * cases had issues even worse than having the two modes.\n\t \n\t For example, modeling fields as parent + key has issues when there is no\n\t * parent, and doesn't provide a great way to do iteration over fields while\n\t * also having a nice API and making it easy for the implementation to track\n\t * state (like its current location inside a sequence tree of fields) while\n\t * traversing without having to allocate some state management for that.\n\t \n\t Another approach, of using arrays of cursors for fields (like we currently\n\t * do for inserting content) is very inefficient and better addressed by a\n\t * dual mode cursor.\n\t \n\t Another approach, of using the first node in a field when referring to\n\t * the field gets confusing since it's unclear if a given cursor means that\n\t * node, or that node, and the ones after it, and in the second case, it's\n\t * hard to restore the cursor back to the right state when returning. It also\n\t * doesn't work for empty fields. Overall there just didn't seem to be a way\n\t * that sucked less than the dual mode API.\n\t /\n\treadonly mode: CursorLocationType;\n\n\t/\n\t * True iff the current field or node (depending on mode) is \"pending\",\n\t * meaning that it has not been downloaded.\n\t /\n\treadonly pending: boolean;\n\n\t// ******* APIs for when mode = Fields ****** //\n\n\t/\n\t * Moves the \"current field\" forward one in an arbitrary field traversal order,\n\t * skipping any empty fields.\n\t \n\t If there is no remaining field to iterate to,\n\t * returns false and navigates up to the parent setting the mode to `Nodes`.\n\t \n\t Order of fields is only guaranteed to be consistent through a single iteration.\n\t \n\t If skipPending, skip past fields which are currently pending.\n\t * This can be used to skip to the end of a large number of consecutive pending fields.\n\t \n\t Allowed when `mode` is `Fields`.\n\t /\n\tnextField(): boolean;\n\n\t/\n\t Navigate up to parent node.\n\t * Sets mode to `Nodes`\n\t \n\t Only valid when `mode` is `Fields`.\n\t \n\t TODO: what to do if at root?\n\t /\n\texitField(): void;\n\n\t/\n\t Moves the \"current field\" forward until `pending` is `false`.\n\t \n\t If there are no remaining field to iterate to,\n\t * returns false and navigates up to the parent setting the mode to `Nodes`.\n\t \n\t Order of fields is only guaranteed to be consistent through a single iteration.\n\t \n\t Allowed when `mode` is `Fields`.\n\t /\n\tskipPendingFields(): boolean;\n\n\t// ******* APIs for when mode = Fields, and not pending ****** //\n\n\t/\n\t * Returns the FieldKey for the current field.\n\t \n\t Allowed when `mode` is `Fields`, and not `pending`.\n\t /\n\tgetFieldKey(): FieldKey;\n\n\t/\n\t @returns the number of immediate children in the current field.\n\t \n\t Allowed when `mode` is `Fields`, and not `pending`.\n\t /\n\tgetFieldLength(): number;\n\n\t/\n\t Moves to the first node of the selected field, setting mode to `Nodes`.\n\t \n\t If field is empty, returns false instead.\n\t \n\t Allowed when `mode` is `Fields`, and not `pending`.\n\t /\n\tfirstNode(): boolean;\n\n\t/\n\t Sets current node to the node at the provided `index` of the current field.\n\t \n\t Allowed when `mode` is `Fields`, and not `pending`.\n\t * Sets mode to `Nodes`.\n\t /\n\tenterNode(childIndex: number): void;\n\n\t/\n\t Returns a path to the current field. See {@link FieldUpPath}.\n\t \n\t Only valid when `mode` is `Fields`.\n\t \n\t If no prefix is provided, assumes this cursor is treated as if it has a root node where its field keys are actually detached sequences.\n\t * If the cursor is not rooted at such a node, the `prefix` should be used to ensure the path has the correct root.\n\t * This requirement exists because {@link FieldUpPath}s are absolute paths\n\t * and thus must be rooted in a detached sequence.\n\t \n\t @param prefix - optional overrides to apply to the root of the returned path.\n\t * See {@link PathRootPrefix}.\n\t * This adjusts the path as if the tree data accessible to this cursor is part of a larger tree.\n\t \n\t @returns a path to the current field.\n\t /\n\tgetFieldPath(prefix?: PathRootPrefix): FieldUpPath;\n\n\t// ******* APIs for when mode = Nodes ****** //\n\n\t/\n\t * Returns a path to the current node. See {@link UpPath}.\n\t \n\t Only valid when `mode` is `Nodes`.\n\t \n\t If no prefix is provided, assumes this cursor is treated as if it has a root node where its field keys are actually detached sequences.\n\t * If the cursor is not rooted at such a node, the `prefix` should be used to ensure the path has the correct root.\n\t * This requirement exists because {@link UpPath}s are absolute paths\n\t * and thus must be rooted in a detached sequence.\n\t \n\t @param prefix - optional overrides to apply to the root of the returned path.\n\t * See {@link PathRootPrefix}.\n\t * This adjusts the path as if the tree data accessible to this cursor is part of a larger tree.\n\t \n\t @returns a path to the current node.\n\t /\n\tgetPath(prefix?: PathRootPrefix): UpPath \| undefined;\n\n\t/\n\t Index (within its parent field) of the current node.\n\t \n\t Only valid when `mode` is `Nodes`.\n\t /\n\treadonly fieldIndex: number;\n\n\t/\n\t Index (within its parent field) of the first node in the current chunk.\n\t * Always less than or equal to `currentIndexInField`.\n\t \n\t Only valid when `mode` is `Nodes`.\n\t /\n\treadonly chunkStart: number;\n\n\t/\n\t Length of current chunk.\n\t * Since an entire chunk always has the same `pending` value,\n\t * can be used to help skip over all of a pending chunk at once.\n\t \n\t TODO:\n\t * Add optional APIs to access underlying chunks so readers can\n\t * accelerate processing of chunk formats they understand.\n\t \n\t Only valid when `mode` is `Nodes`.\n\t /\n\treadonly chunkLength: number;\n\n\t/\n\t Moves `offset` nodes in the field.\n\t * If seeking to exactly past either end,\n\t * returns false and navigates up to the parent field (setting mode to `Fields`).\n\t \n\t Allowed if mode is `Nodes`.\n\t /\n\tseekNodes(offset: number): boolean;\n\n\t/\n\t The same as `seekNodes(1)`, but might be faster.\n\t /\n\tnextNode(): boolean;\n\n\t/\n\t Navigate up to parent field.\n\t * Sets mode to `Fields`\n\t \n\t Same as seek Number.POSITIVE_INFINITY, but only valid when `mode` is `Nodes`.\n\t \n\t TODO: what to do if at root?\n\t * TODO: Maybe merge with upToNode to make a single \"Up\"?\n\t /\n\texitNode(): void;\n\n\t// ******* APIs for when mode = Nodes and not pending ****** //\n\n\t/\n\t * Enters the first non-empty field (setting mode to `Fields`)\n\t * so fields can be iterated with `nextField` and `skipPendingFields`.\n\t \n\t If there are no fields, mode is returned to `Nodes` and false is returned.\n\t \n\t Allowed when `mode` is `Nodes` and not `pending`.\n\t /\n\tfirstField(): boolean;\n\n\t/\n\t Navigate to the field with the specified `key` and set the mode to `Fields`.\n\t \n\t Only valid when `mode` is `Nodes`, and not `pending`.\n\t /\n\tenterField(key: FieldKey): void;\n\n\t/\n\t The type of the currently selected node.\n\t \n\t Only valid when `mode` is `Nodes`, and not `pending`.\n\t /\n\treadonly type: TreeType;\n\n\t/\n\t The value associated with the currently selected node.\n\t \n\t Only valid when `mode` is `Nodes`, and not `pending`.\n\t /\n\treadonly value: Value;\n}\n\n/\n Prefix to apply as the root of a {@link UpPath} or {@link FieldUpPath}.\n \n @remarks This can be used to take a path relative to a subtree, and make it relative to a larger containing tree.\n * For example, if a node is being inserted in the 5th position in a field \"Foo\", you can update a path in that node's subtree to its new path by prefixing it with\n * `{ parent: theNodeAboveTheMovedNode, rootFieldOverride: Foo, indexOffset: 5 }`.\n * See {@link prefixPath} and {@link prefixFieldPath} for how to apply the prefix to the paths.\n /\nexport interface PathRootPrefix {\n\t/\n\t The new parent to place above root of the path which is being prefixed.\n\t * This replaces the `undefined` at the root of the path.\n\t \n\t @remarks specifying `undefined` here results in no change to the path.\n\t /\n\tparent?: UpPath \| undefined;\n\n\t/\n\t The field of `parent` that the original path will be included under.\n\t \n\t If `undefined` the root field key from the original path will be used.\n\t /\n\trootFieldOverride?: FieldKey;\n\n\t/\n\t Offset to add to the uppermost `parentIndex` in the original path.\n\t /\n\tindexOffset?: number;\n}\n\n/\n /\nexport const enum CursorLocationType {\n\t/*\n\t Can iterate through nodes in a field.\n\t * At a \"current node\".\n\t /\n\tNodes,\n\n\t/\n\t Can iterate through fields of a node.\n\t * At a \"current field\".\n\t /\n\tFields,\n}\n\n/\n {@link ITreeCursor} that is never pending.\n /\nexport interface ITreeCursorSynchronous extends ITreeCursor {\n\treadonly pending: false;\n}\n\n/\n @param cursor - tree whose fields will be visited.\n * @param f - builds output from field, which will be selected in cursor when cursor is provided.\n * If `f` moves cursor, it must put it back to where it was at the beginning of `f` before returning.\n * @returns array resulting from applying `f` to each field of the current node on `cursor`.\n * Returns an empty array if the node is empty or not present (which are considered the same).\n * Note that order is not specified for field iteration.\n /\nexport function mapCursorFields<T, TCursor extends ITreeCursor = ITreeCursor>(\n\tcursor: TCursor,\n\tf: (cursor: TCursor) => T,\n): T[] {\n\tconst output: T[] = [];\n\tforEachField(cursor, (c) => {\n\t\toutput.push(f(c));\n\t});\n\treturn output;\n}\n\n/\n @param cursor - cursor at a node whose fields will be visited.\n * @param f - For on each field.\n * If `f` moves cursor, it must put it back to where it was at the beginning of `f` before returning.\n /\nexport function forEachField<TCursor extends ITreeCursor = ITreeCursor>(\n\tcursor: TCursor,\n\tf: (cursor: TCursor) => void,\n): void {\n\tassert(cursor.mode === CursorLocationType.Nodes, 0x411 / should be in nodes /);\n\tfor (let inField = cursor.firstField(); inField; inField = cursor.nextField()) {\n\t\tf(cursor);\n\t}\n}\n\n/\n @param cursor - tree whose field will be visited.\n * @param f - builds output from field member, which will be selected in cursor when cursor is provided.\n * If `f` moves cursor, it must put it back to where it was at the beginning of `f` before returning.\n * @returns array resulting from applying `f` to each item of the current field on `cursor`.\n * Returns an empty array if the field is empty or not present (which are considered the same).\n /\nexport function mapCursorField<T, TCursor extends ITreeCursor = ITreeCursor>(\n\tcursor: TCursor,\n\tf: (cursor: TCursor) => T,\n): T[] {\n\tconst output: T[] = [];\n\tforEachNode(cursor, (c) => {\n\t\toutput.push(f(c));\n\t});\n\treturn output;\n}\n\n/\n @param cursor - The tree whose field will be visited.\n * @param f - Builds output from field member, which will be selected in cursor when cursor is provided.\n * If `f` moves cursor, it must put it back to where it was at the beginning of `f` before returning.\n * @returns An iterable of `T` resulting from applying `f` to each item of the current field on `cursor`.\n * Yields nothing if an empty array if the field is empty or not present (which are considered the same).\n /\nexport function iterateCursorField<T, TCursor extends ITreeCursor = ITreeCursor>(\n\tcursor: TCursor,\n\tf: (cursor: TCursor) => T,\n): IterableIterator<T> {\n\tassert(cursor.mode === CursorLocationType.Fields, 0x7a8 /* should be in fields /);\n\tfor (let inNodes = cursor.firstNode(); inNodes; inNodes = cursor.nextNode()) {\n\t\tyield f(cursor);\n\t}\n}\n\n/\n @param cursor - cursor at a field whose nodes will be visited.\n * @param f - For on each node.\n * If `f` moves cursor, it must put it back to where it was at the beginning of `f` before returning.\n /\nexport function forEachNode<TCursor extends ITreeCursor = ITreeCursor>(\n\tcursor: TCursor,\n\tf: (cursor: TCursor) => void,\n): void {\n\tassert(cursor.mode === CursorLocationType.Fields, 0x3bd / should be in fields /);\n\tfor (let inNodes = cursor.firstNode(); inNodes; inNodes = cursor.nextNode()) {\n\t\tf(cursor);\n\t}\n}\n\n/\n @param cursor - cursor at a field or node.\n * @param f - Function to invoke for each node.\n * If `f` moves the cursor, it must put it back to where it was at the beginning of `f` before returning.\n \n Invokes `f` on each node in the subtree rooted at the current field or node.\n * Traversal is pre-order.\n * If the cursor is at a node, `f` will be invoked on that node.\n \n Returns the `cursor` to its initial position.\n /\nexport function forEachNodeInSubtree<TCursor extends ITreeCursor = ITreeCursor>(\n\tcursor: TCursor,\n\tf: (cursor: TCursor) => void,\n): void {\n\tif (cursor.mode === CursorLocationType.Nodes) {\n\t\tf(cursor);\n\t\tforEachField(cursor, (c) => forEachNodeInSubtree(c, f));\n\t} else {\n\t\tforEachNode(cursor, (c) => forEachNodeInSubtree(c, f));\n\t}\n}\n\n/\n Casts a cursor to an {@link ITreeCursorSynchronous}.\n \n TODO: #1404: Handle this properly for partial data loading support.\n /\nexport function castCursorToSynchronous(cursor: ITreeCursor): ITreeCursorSynchronous {\n\treturn cursor as ITreeCursorSynchronous;\n}\n\n/\n Runs `f` inside of field `field` on `cursor`.\n * @param cursor - Cursor whose field to enter and exit. Must be in `nodes` mode.\n * @param field - Field to enter.\n * @param f - Callback to run when in field.\n * @returns return value of `f`\n /\nexport function inCursorField<T, TCursor extends ITreeCursor = ITreeCursor>(\n\tcursor: TCursor,\n\tfield: FieldKey,\n\tf: (cursor: TCursor) => T,\n): T {\n\tcursor.enterField(field);\n\tconst result = f(cursor);\n\tcursor.exitField();\n\treturn result;\n}\n\n/\n Runs `f` inside of node `index` on `cursor`.\n * @param cursor - Cursor whoso node to enter and exit. Must be in `fields` mode.\n * @param index - Node to enter.\n * @param f - Callback to run when in node.\n * @returns return value of `f`\n */\nexport function inCursorNode<T, TCursor extends ITreeCursor = ITreeCursor>(\n\tcursor: TCursor,\n\tindex: number,\n\tf: (cursor: TCursor) => T,\n): T {\n\tcursor.enterNode(index);\n\tconst result = f(cursor);\n\tcursor.exitNode();\n\treturn result;\n}\n"]}

package/dist/core/tree/delta.d.ts CHANGED Viewed

@@ -65,7 +65,6 @@ import type { ITreeCursorSynchronous } from "./cursor.js";
 /**
  * Represents the change made to a document.
  * Immutable, therefore safe to retain for async processing.
- * @internal
  */
 export interface Root<TTree = ProtoNode> {
     /**
@@ -103,7 +102,6 @@ export interface Root<TTree = ProtoNode> {
  * Ownership and lifetime of data referenced by this cursor is unclear,
  * so it is a poor abstraction for this use-case which needs to hold onto the data in a non-exclusive (readonly) way.
  * Cursors can be one supported way to input data, but aren't a good storage format.
- * @internal
  */
 export type ProtoNode = ITreeCursorSynchronous;
 /**
@@ -114,12 +112,10 @@ export type ProtoNode = ITreeCursorSynchronous;
  * Additionally, Cursors support sequences, so if using cursors, there are better ways to handle this than an array of cursors,
  * like using a cursor over all the content (starting in fields mode).
  * Long term something like TreeChunk should probably be used here.
- * @internal
  */
 export type ProtoNodes = readonly ProtoNode[];
 /**
  * Represents a change being made to a part of the document tree.
- * @internal
  */
 export interface Mark {
     /**
@@ -145,19 +141,16 @@ export interface Mark {
 }
 /**
  * A globally unique ID for a node in a detached field.
- * @internal
  */
 export interface DetachedNodeId {
     readonly major?: RevisionTag;
     readonly minor: number;
 }
 /**
- * @internal
  */
 export type FieldMap = ReadonlyMap<FieldKey, FieldChanges>;
 /**
  * Represents changes made to a detached node
- * @internal
  */
 export interface DetachedNodeChanges {
     readonly id: DetachedNodeId;
@@ -168,7 +161,6 @@ export interface DetachedNodeChanges {
  *
  * Tree creation is idempotent: if a tree with the same ID already exists,
  * then this build is ignored in favor of the existing tree.
- * @internal
  */
 export interface DetachedNodeBuild<TTree = ProtoNode> {
     readonly id: DetachedNodeId;
@@ -176,7 +168,6 @@ export interface DetachedNodeBuild<TTree = ProtoNode> {
 }
 /**
  * Represents the destruction of detached nodes
- * @internal
  */
 export interface DetachedNodeDestruction {
     readonly id: DetachedNodeId;
@@ -184,7 +175,6 @@ export interface DetachedNodeDestruction {
 }
 /**
  * Represents a detached node being assigned a new `DetachedNodeId`.
- * @internal
  */
 export interface DetachedNodeRename {
     readonly count: number;
@@ -193,7 +183,6 @@ export interface DetachedNodeRename {
 }
 /**
  * Represents the changes to perform on a given field.
- * @internal
  */
 export interface FieldChanges {
     /**