npm - @fluidframework/tree - Versions diffs - 2.0.0-rc.2.0.2 → 2.0.0-rc.3.0.0 - Mend

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

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

Files changed (2507) hide show

package/dist/feature-libraries/modular-schema/modularChangeFamily.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"modularChangeFamily.js","sourceRoot":"","sources":["../../../src/feature-libraries/modular-schema/modularChangeFamily.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,2DAAoD;AACpD,mDAAoF;AACpF,kDAgC6B;AAC7B,kDAc6B;AAC7B,gFAA0E;AAC1E,yDAMoC;AACpC,0DAA8E;AAE9E,iEAMgC;AAChC,mEAIiC;AAEjC,qEAA2E;AAC3E,+DAAoG;AASpG,qEAAuD;AAEvD;;;GAGG;AACH,MAAa,mBAAmB;IAS/B,YACiB,UAAiE,EACjF,gBAAkC,EAClC,eAAgC,EAChC,YAA2B,EAC3B,wBAAkD;QAJlC,eAAU,GAAV,UAAU,CAAuD;QAMjF,IAAI,CAAC,WAAW,GAAG,IAAA,oCAAW,EAC7B,UAAU,EACV,gBAAgB,EAChB,eAAe,EACf,YAAY,EACZ,wBAAwB,CACxB,CAAC;QACF,IAAI,CAAC,MAAM,GAAG,IAAA,0BAAe,EAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;IACxD,CAAC;IAED,IAAW,OAAO;QACjB,OAAO,IAAI,CAAC;IACb,CAAC;IAED;;;;;;OAMG;IACK,qBAAqB,CAC5B,OAAgC,EAChC,OAAgC,EAChC,KAAkB,EAClB,gBAAwC;QAMxC,mEAAmE;QACnE,MAAM,IAAI,GACT,OAAO,KAAK,SAAS,IAAI,OAAO,CAAC,SAAS,KAAK,sCAAgB,CAAC,UAAU;YACzE,CAAC,CAAC,OAAO,CAAC,SAAS;YACnB,CAAC,CAAC,OAAO,EAAE,SAAS,IAAI,sCAAgB,CAAC,UAAU,CAAC;QAEtD,IAAI,IAAI,KAAK,sCAAgB,CAAC,UAAU,EAAE;YACzC,8BAA8B;YAC9B,OAAO;gBACN,SAAS,EAAE,sCAAgB;gBAC3B,OAAO,EAAE,OAAO,EAAE,MAAM;gBACxB,OAAO,EAAE,OAAO,EAAE,MAAM;aACxB,CAAC;SACF;QACD,MAAM,SAAS,GAAG,YAAY,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;QACtD,MAAM,OAAO,GAAG,SAAS,CAAC,aAAa,CAAC;QACxC,MAAM,iBAAiB,GAAG,IAAI,CAAC,oBAAoB,CAClD,OAAO,EACP,OAAO,EACP,KAAK,EACL,gBAAgB,CAChB,CAAC;QACF,MAAM,iBAAiB,GAAG,IAAI,CAAC,oBAAoB,CAClD,OAAO,EACP,OAAO,EACP,KAAK,EACL,gBAAgB,CAChB,CAAC;QACF,OAAO,EAAE,SAAS,EAAE,OAAO,EAAE,iBAAiB,EAAE,OAAO,EAAE,iBAAiB,EAAE,CAAC;IAC9E,CAAC;IAEO,oBAAoB,CAC3B,WAAoC,EACpC,OAA8B,EAC9B,KAAkB,EAClB,gBAAwC;QAExC,IAAI,WAAW,KAAK,SAAS,EAAE;YAC9B,OAAO,SAAS,CAAC;SACjB;QAED,IAAI,WAAW,CAAC,SAAS,KAAK,sCAAgB,CAAC,UAAU,EAAE;YAC1D,OAAO,WAAW,CAAC,MAAM,CAAC;SAC1B;QAED,mDAAmD;QACnD,MAAM,aAAa,GAAG,WAAW,CAAC,MAAqC,CAAC;QACxE,MAAM,eAAe,GAAG,IAAA,0CAAoB,EAC3C,aAAa,EACb,OAAO,EACP,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE,CAClB,IAAI,CAAC,kBAAkB,CACtB,MAAM,EACN,SAAS,EACT,MAAM,EACN,SAAS,EACT,KAAK,EACL,eAAe,EAAE,EACjB,gBAAgB,CAChB,EACF,KAAK,EACL,gBAAgB,CACE,CAAC;QAEpB,OAAO,eAAe,CAAC;IACxB,CAAC;IAEM,OAAO,CAAC,OAAyC;QACvD,MAAM,aAAa,GAAG,OAAO,CAAC,MAAM,CACnC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,wBAAwB,IAAI,CAAC,CAAC,KAAK,CAAC,CAC/D,CAAC;QAEF,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,GAAG,2BAA2B,CAAC,OAAO,CAAC,CAAC;QACjE,MAAM,OAAO,GAAsB,EAAE,KAAK,EAAE,CAAC;QAE7C,OAAO,aAAa,CAAC,MAAM,CAC1B,CAAC,OAAO,EAAE,OAAO,EAAE,EAAE,CACpB,IAAA,yBAAc,EAAC,IAAI,CAAC,WAAW,CAAC,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC,EACtE,IAAA,yBAAc,EAAC,EAAE,YAAY,EAAE,IAAI,GAAG,EAAE,EAAE,CAAC,CAC3C,CAAC,MAAM,CAAC;IACV,CAAC;IAEO,WAAW,CAClB,OAAuC,EACvC,OAAuC,EACvC,QAAwB,EACxB,OAA0B;QAE1B,MAAM,KAAK,GAAgB,IAAA,+BAAoB,EAAC,OAAO,CAAC,CAAC;QACzD,MAAM,gBAAgB,GAA2B,IAAA,yCAA8B,EAAC,QAAQ,CAAC,CAAC;QAE1F,MAAM,eAAe,GAAG,eAAe,EAAE,CAAC;QAE1C,MAAM,cAAc,GAAG,IAAI,CAAC,gBAAgB,CAC3C,OAAO,CAAC,MAAM,CAAC,YAAY,EAC3B,OAAO,CAAC,QAAQ,EAChB,OAAO,CAAC,MAAM,CAAC,YAAY,EAC3B,OAAO,CAAC,QAAQ,EAChB,KAAK,EACL,eAAe,EACf,gBAAgB,CAChB,CAAC;QAEF,OAAO,eAAe,CAAC,iBAAiB,CAAC,IAAI,GAAG,CAAC,EAAE;YAClD,MAAM,cAAc,GAAG,eAAe,CAAC,iBAAiB,CAAC;YACzD,eAAe,CAAC,iBAAiB,GAAG,IAAI,GAAG,EAAE,CAAC;YAC9C,KAAK,MAAM,WAAW,IAAI,cAAc,EAAE;gBACzC,MAAM,OAAO,GAAG,eAAe,CAAC,cAAc,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;gBAChE,IAAA,mBAAM,EACL,OAAO,KAAK,SAAS,EACrB,KAAK,CAAC,qDAAqD,CAC3D,CAAC;gBACF,MAAM,EAAE,OAAO,EAAE,YAAY,EAAE,OAAO,EAAE,YAAY,EAAE,cAAc,EAAE,GAAG,OAAO,CAAC;gBAEjF,MAAM,OAAO,GAAG,gBAAgB,CAAC,IAAI,CAAC,UAAU,EAAE,WAAW,CAAC,SAAS,CAAC,CAAC,OAAO,CAAC;gBACjF,MAAM,YAAY,GAAG,CACpB,KAAgC,EAChC,KAAgC,EAChB,EAAE;oBAClB,MAAM,GAAG,GAAG,iCAAiC,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;oBAC5D,MAAM,YAAY,GAAG,eAAe,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;oBACxD,IAAI,YAAY,KAAK,SAAS,EAAE;wBAC/B,OAAO,YAAY,CAAC;qBACpB;oBAED,OAAO,IAAI,CAAC,kBAAkB,CAC7B,KAAK,EACL,YAAY,CAAC,QAAQ,EACrB,KAAK,EACL,YAAY,CAAC,QAAQ,EACrB,KAAK,EACL,eAAe,EACf,gBAAgB,CAChB,CAAC;gBACH,CAAC,CAAC;gBAEF,MAAM,aAAa,GAAG,OAAO,CAAC,OAAO,CACpC,YAAY,EACZ,YAAY,EACZ,YAAY,EACZ,KAAK,EACL,oBAAoB,CAAC,eAAe,EAAE,WAAW,EAAE,KAAK,CAAC,EACzD,gBAAgB,CAChB,CAAC;gBACF,cAAc,CAAC,MAAM,GAAG,IAAA,gBAAK,EAAC,aAAa,CAAC,CAAC;aAC7C;SACD;QAED,MAAM,EAAE,SAAS,EAAE,WAAW,EAAE,aAAa,EAAE,GAAG,kCAAkC,CAAC;YACpF,OAAO;YACP,OAAO;SACP,CAAC,CAAC;QAEH,OAAO,oBAAoB,CAC1B,IAAI,CAAC,aAAa,CAAC,cAAc,CAAC,EAClC,OAAO,CAAC,KAAK,EACb,QAAQ,EACR,SAAS,EACT,SAAS,EACT,WAAW,EACX,aAAa,CACb,CAAC;IACH,CAAC;IAEO,gBAAgB,CACvB,OAAmC,EACnC,SAAkC,EAClC,OAAmC,EACnC,SAAkC,EAClC,KAAkB,EAClB,eAA6B,EAC7B,gBAAwC;QAExC,MAAM,cAAc,GAAmB,IAAI,GAAG,EAAE,CAAC;QACjD,MAAM,MAAM,GAAG,IAAI,GAAG,EAAY,CAAC;QACnC,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE;YAC1C,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;SAClB;QAED,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE;YAC1C,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;SAClB;QAED,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE;YAC3B,MAAM,YAAY,GAAG,OAAO,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC;YACzC,MAAM,YAAY,GAAG,OAAO,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC;YAEzC,MAAM,EACL,SAAS,EACT,OAAO,EAAE,sBAAsB,EAC/B,OAAO,EAAE,sBAAsB,GAC/B,GAAG,IAAI,CAAC,qBAAqB,CAAC,YAAY,EAAE,YAAY,EAAE,KAAK,EAAE,gBAAgB,CAAC,CAAC;YAEpF,MAAM,OAAO,GAAG,oBAAoB,CAAC,eAAe,EAAE,YAAY,IAAI,YAAY,CAAC,CAAC;YACpF,MAAM,aAAa,GAAG,IAAA,oBAAS,EAC9B,sBAAsB,IAAI,SAAS,CAAC,aAAa,CAAC,WAAW,EAAE,EAC/D,YAAY,EAAE,QAAQ,IAAI,SAAS,CACnC,CAAC;YACF,MAAM,aAAa,GAAG,IAAA,oBAAS,EAC9B,sBAAsB,IAAI,SAAS,CAAC,aAAa,CAAC,WAAW,EAAE,EAC/D,YAAY,EAAE,QAAQ,IAAI,SAAS,CACnC,CAAC;YAEF,MAAM,cAAc,GAAG,SAAS,CAAC,aAAa,CAAC,OAAO,CAAC,OAAO,CAC7D,aAAa,EACb,aAAa,EACb,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE,CAClB,IAAI,CAAC,kBAAkB,CACtB,MAAM,EACN,SAAS,EACT,MAAM,EACN,SAAS,EACT,KAAK,EACL,eAAe,EACf,gBAAgB,CAChB,EACF,KAAK,EACL,OAAO,EACP,gBAAgB,CAChB,CAAC;YAEF,MAAM,aAAa,GAAgB;gBAClC,SAAS,EAAE,SAAS,CAAC,UAAU;gBAC/B,MAAM,EAAE,IAAA,gBAAK,EAAC,cAAc,CAAC;aAC7B,CAAC;YAEF,MAAM,QAAQ,GACb,YAAY,IAAI,YAAY,IAAI,IAAA,eAAI,EAAC,wCAAwC,CAAC,CAAC;YAEhF,eAAe,CAAC,cAAc,CAAC,GAAG,CAAC,QAAQ,EAAE;gBAC5C,OAAO,EAAE,aAAa;gBACtB,OAAO,EAAE,aAAa;gBACtB,cAAc,EAAE,aAAa;aAC7B,CAAC,CAAC;YAEH,mEAAmE;YACnE,cAAc,CAAC,GAAG,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC;SACzC;QAED,OAAO,cAAc,CAAC;IACvB,CAAC;IAEO,kBAAkB,CACzB,OAAkC,EAClC,SAAkC,EAClC,OAAkC,EAClC,SAAkC,EAClC,KAAkB,EAClB,eAA6B,EAC7B,gBAAwC;QAExC,MAAM,oBAAoB,GAAG,OAAO,EAAE,oBAAoB,IAAI,OAAO,EAAE,oBAAoB,CAAC;QAE5F,MAAM,oBAAoB,GAAG,IAAI,CAAC,gBAAgB,CACjD,OAAO,EAAE,YAAY,EACrB,SAAS,EACT,OAAO,EAAE,YAAY,EACrB,SAAS,EACT,KAAK,EACL,eAAe,EACf,gBAAgB,CAChB,CAAC;QACF,MAAM,kBAAkB,GAAkB,EAAE,CAAC;QAE7C,IAAI,oBAAoB,CAAC,IAAI,GAAG,CAAC,EAAE;YAClC,kBAAkB,CAAC,YAAY,GAAG,oBAAoB,CAAC;SACvD;QAED,IAAI,oBAAoB,KAAK,SAAS,EAAE;YACvC,kBAAkB,CAAC,oBAAoB,GAAG,oBAAoB,CAAC;SAC/D;QAED,MAAM,GAAG,GAAG,iCAAiC,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;QAChE,eAAe,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,EAAE,kBAAkB,CAAC,CAAC;QACvD,OAAO,kBAAkB,CAAC;IAC3B,CAAC;IAED;;;;;OAKG;IACI,MAAM,CAAC,MAAsC,EAAE,UAAmB;QACxE,iEAAiE;QACjE,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,wBAAwB,IAAI,CAAC,CAAC,GAAG,CAAC,EAAE;YACtD,OAAO,oBAAoB,EAAE,CAAC;SAC9B;QAED,MAAM,OAAO,GAAsB,EAAE,KAAK,EAAE,MAAM,CAAC,MAAM,CAAC,KAAK,IAAI,CAAC,CAAC,EAAE,CAAC;QACxE,iFAAiF;QACjF,gFAAgF;QAChF,6EAA6E;QAC7E,MAAM,KAAK,GAAgB,IAAA,+BAAoB,EAAC,OAAO,CAAC,CAAC;QACzD,MAAM,eAAe,GAAgB;YACpC,GAAG,kBAAkB,EAAe;YACpC,sBAAsB,EAAE,IAAI,GAAG,EAAE;SACjC,CAAC;QAEF,MAAM,EAAE,QAAQ,EAAE,GAAG,2BAA2B,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;QAC3D,MAAM,gBAAgB,GAAG,IAAA,yCAA8B,EAAC,QAAQ,CAAC,CAAC;QAElE,MAAM,cAAc,GAAG,IAAI,CAAC,cAAc,CACzC,IAAA,oBAAS,EAAC,MAAM,CAAC,MAAM,CAAC,YAAY,EAAE,wBAAwB,CAAC,MAAM,CAAC,CAAC,EACvE,UAAU,EACV,KAAK,EACL,eAAe,EACf,gBAAgB,CAChB,CAAC;QAEF,IAAI,eAAe,CAAC,iBAAiB,CAAC,IAAI,GAAG,CAAC,EAAE;YAC/C,MAAM,cAAc,GAAG,eAAe,CAAC,iBAAiB,CAAC;YACzD,eAAe,CAAC,iBAAiB,GAAG,IAAI,GAAG,EAAE,CAAC;YAC9C,KAAK,MAAM,WAAW,IAAI,cAAc,EAAE;gBACzC,MAAM,mBAAmB,GAAG,WAAW,CAAC,MAAM,CAAC;gBAC/C,MAAM,OAAO,GAAG,eAAe,CAAC,sBAAsB,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;gBACxE,IAAA,mBAAM,EACL,OAAO,KAAK,SAAS,EACrB,KAAK,CAAC,qDAAqD,CAC3D,CAAC;gBACF,MAAM,EAAE,aAAa,EAAE,QAAQ,EAAE,GAAG,OAAO,CAAC;gBAE5C,MAAM,aAAa,GAAG,gBAAgB,CACrC,IAAI,CAAC,UAAU,EACf,WAAW,CAAC,SAAS,CACrB,CAAC,OAAO,CAAC,MAAM,CACf,IAAA,oBAAS,EAAC,mBAAmB,EAAE,QAAQ,CAAC,EACxC,CAAC,aAAa,EAAE,EAAE,CAAC,aAAa,EAChC,UAAU,EACV,KAAK,EACL,oBAAoB,CAAC,eAAe,EAAE,WAAW,CAAC,EAClD,gBAAgB,CAChB,CAAC;gBACF,aAAa,CAAC,MAAM,GAAG,IAAA,gBAAK,EAAC,aAAa,CAAC,CAAC;aAC5C;SACD;QAED,iFAAiF;QACjF,MAAM,QAAQ,GAAG,UAAU;YAC1B,CAAC,CAAC,YAAY,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,QAAQ,CAAC;YACrD,CAAC,CAAC,SAAS,CAAC;QAEb,wEAAwE;QACxE,IAAA,mBAAM,EACL,MAAM,CAAC,MAAM,CAAC,QAAQ,KAAK,SAAS,EACpC,KAAK,CAAC,6CAA6C,CACnD,CAAC;QAEF,MAAM,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC;QACxC,OAAO,oBAAoB,CAC1B,cAAc,EACd,OAAO,CAAC,KAAK,EACb,OAAO,KAAK,SAAS;YACpB,CAAC,CAAC,SAAS;YACX,CAAC,CAAC,CAAC,UAAU;gBACX,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,UAAU,EAAE,QAAQ,EAAE,CAAC,CAAC;gBACrE,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CACpB,CAAC,OAAO,EAAE,EACd,MAAM,CAAC,MAAM,CAAC,wBAAwB,EACtC,SAAS,EACT,QAAQ,CACR,CAAC;IACH,CAAC;IAEO,cAAc,CACrB,OAAqC,EACrC,UAAmB,EACnB,KAAkB,EAClB,eAA4B,EAC5B,gBAAwC;QAExC,MAAM,cAAc,GAAmB,IAAI,GAAG,EAAE,CAAC;QAEjD,KAAK,MAAM,CAAC,KAAK,EAAE,WAAW,CAAC,IAAI,OAAO,CAAC,MAAM,EAAE;YAClD,MAAM,EAAE,QAAQ,EAAE,GAAG,WAAW,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,OAAO,CAAC;YAEhF,MAAM,OAAO,GAAG,oBAAoB,CAAC,eAAe,EAAE,WAAW,CAAC,CAAC;YACnE,MAAM,cAAc,GAAG,gBAAgB,CACtC,IAAI,CAAC,UAAU,EACf,WAAW,CAAC,SAAS,CACrB,CAAC,OAAO,CAAC,MAAM,CACf,EAAE,QAAQ,EAAE,MAAM,EAAE,WAAW,CAAC,MAAM,EAAE,EACxC,CAAC,YAAY,EAAE,EAAE,CAChB,IAAI,CAAC,gBAAgB,CACpB,EAAE,QAAQ,EAAE,MAAM,EAAE,YAAY,EAAE,EAClC,UAAU,EACV,KAAK,EACL,eAAe,EACf,gBAAgB,CAChB,EACF,UAAU,EACV,KAAK,EACL,OAAO,EACP,gBAAgB,CAChB,CAAC;YAEF,MAAM,mBAAmB,GAAgB;gBACxC,GAAG,WAAW;gBACd,MAAM,EAAE,IAAA,gBAAK,EAAC,cAAc,CAAC;aAC7B,CAAC;YACF,cAAc,CAAC,GAAG,CAAC,KAAK,EAAE,mBAAmB,CAAC,CAAC;YAE/C,eAAe,CAAC,sBAAsB,CAAC,GAAG,CAAC,WAAW,EAAE;gBACvD,aAAa,EAAE,mBAAmB;gBAClC,QAAQ;aACR,CAAC,CAAC;SACH;QAED,OAAO,cAAc,CAAC;IACvB,CAAC;IAEO,gBAAgB,CACvB,MAAmC,EACnC,UAAmB,EACnB,KAAkB,EAClB,eAA4B,EAC5B,gBAAwC;QAExC,MAAM,OAAO,GAAkB,EAAE,CAAC;QAElC,IAAI,MAAM,CAAC,MAAM,CAAC,YAAY,KAAK,SAAS,EAAE;YAC7C,OAAO,CAAC,YAAY,GAAG,IAAI,CAAC,cAAc,CACzC,EAAE,GAAG,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,YAAY,EAAE,EACjD,UAAU,EACV,KAAK,EACL,eAAe,EACf,gBAAgB,CAChB,CAAC;SACF;QAED,OAAO,OAAO,CAAC;IAChB,CAAC;IAEM,MAAM,CACZ,MAAwB,EACxB,IAAoC,EACpC,gBAAwC;QAExC,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC;QACpE,MAAM,OAAO,GAAsB,EAAE,KAAK,EAAE,CAAC;QAC7C,MAAM,KAAK,GAAgB,IAAA,+BAAoB,EAAC,OAAO,CAAC,CAAC;QACzD,MAAM,eAAe,GAAgB;YACpC,GAAG,kBAAkB,EAAe;YACpC,cAAc,EAAE,IAAI,GAAG,EAAE;YACzB,gBAAgB,EAAE,IAAI,GAAG,EAAE;SAC3B,CAAC;QAEF,IAAI,eAAe,GAAG,kBAAkB,CAAC,MAAM,CAAC,wBAAwB,IAAI,CAAC,CAAC,CAAC;QAE/E,MAAM,gBAAgB,GAAG,GAAG,EAAE,CAC7B,4BAA4B,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAEjE,MAAM,cAAc,GAAG;YACtB,GAAG,gBAAgB;YACnB,gBAAgB;SAChB,CAAC;QAEF,MAAM,aAAa,GAAG,IAAI,CAAC,cAAc,CACxC,MAAM,CAAC,YAAY,EACnB,IAAA,oBAAS,EAAC,IAAI,CAAC,MAAM,CAAC,YAAY,EAAE,wBAAwB,CAAC,IAAI,CAAC,CAAC,EACnE,KAAK,EACL,eAAe,EACf,GAAG,EAAE,CAAC,IAAI,EACV,cAAc,EACd,eAAe,CACf,CAAC;QAEF,IAAI,eAAe,CAAC,iBAAiB,CAAC,IAAI,GAAG,CAAC,EAAE;YAC/C,MAAM,cAAc,GAAG,eAAe,CAAC,iBAAiB,CAAC;YACzD,eAAe,CAAC,iBAAiB,GAAG,IAAI,GAAG,EAAE,CAAC;YAC9C,eAAe,GAAG,kBAAkB,CAAC,MAAM,CAAC,wBAAwB,IAAI,CAAC,CAAC,CAAC;YAC3E,KAAK,MAAM,KAAK,IAAI,cAAc,EAAE;gBACnC,+DAA+D;gBAC/D,MAAM,OAAO,GAAG,eAAe,CAAC,cAAc,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;gBAC1D,IAAA,mBAAM,EAAC,OAAO,KAAK,SAAS,EAAE,KAAK,CAAC,uCAAuC,CAAC,CAAC;gBAC7E,MAAM,EACL,SAAS,EACT,OAAO,EAAE,cAAc,EACvB,OAAO,EAAE,aAAa,GACtB,GAAG,IAAI,CAAC,qBAAqB,CAC7B,OAAO,CAAC,SAAS,EACjB,OAAO,CAAC,UAAU,EAClB,KAAK,EACL,gBAAgB,CAChB,CAAC;gBAEF,OAAO,CAAC,aAAa,CAAC,MAAM,GAAG,SAAS,CAAC,aAAa,CAAC,OAAO,CAAC,MAAM,CACpE,cAAc,EACd,IAAA,oBAAS,EAAC,aAAa,EAAE,OAAO,CAAC,YAAY,CAAC,EAC9C,CAAC,IAAI,EAAE,IAAI,EAAE,cAAc,EAAE,EAAE;oBAC9B,MAAM,GAAG,GAAG,IAAI,IAAI,IAAI,CAAC;oBACzB,IAAI,GAAG,KAAK,SAAS,EAAE;wBACtB,OAAO,SAAS,CAAC;qBACjB;oBAED,MAAM,KAAK,GAAG,eAAe,CAAC,gBAAgB,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;oBACxD,IAAI,KAAK,KAAK,SAAS,EAAE;wBACxB,OAAO,KAAK,CAAC;qBACb;oBAED,qFAAqF;oBACrF,iDAAiD;oBACjD,OAAO,IAAI,CAAC,gBAAgB,CAC3B,IAAI,EACJ,IAAA,oBAAS,EAAC,IAAI,EAAE,OAAO,CAAC,YAAY,CAAC,EACrC,KAAK,EACL,eAAe,EACf,GAAG,EAAE,CAAC,IAAI,EACV,cAAc,EACd,eAAe,EACf,cAAc,CACd,CAAC;gBACH,CAAC,EACD,KAAK,EACL,oBAAoB,CAAC,eAAe,EAAE,KAAK,CAAC,EAC5C,cAAc,CACd,CAAC;aACF;SACD;QAED,OAAO,oBAAoB,CAC1B,IAAI,CAAC,aAAa,CAAC,aAAa,CAAC,EACjC,OAAO,CAAC,KAAK,EACb,MAAM,CAAC,SAAS,EAChB,eAAe,CAAC,cAAc,EAC9B,MAAM,CAAC,MAAM,EACb,MAAM,CAAC,QAAQ,EACf,MAAM,CAAC,UAAU,CACjB,CAAC;IACH,CAAC;IAEO,cAAc,CACrB,MAAsB,EACtB,IAAkC,EAClC,KAAkB,EAClB,eAA4B,EAC5B,WAAqF,EACrF,gBAAwC,EACxC,eAAgC,EAChC,iBAAqC,0CAAkB,CAAC,KAAK;QAE7D,MAAM,aAAa,GAAmB,IAAI,GAAG,EAAE,CAAC;QAEhD,gDAAgD;QAChD,KAAK,MAAM,CAAC,KAAK,EAAE,WAAW,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE;YAC/C,IAAI,CAAC,WAAW,CAAC,WAAW,EAAE,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE;gBACjD,SAAS;aACT;YAED,MAAM,WAAW,GAAgB,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI;gBACrD,SAAS,EAAE,sCAAgB,CAAC,UAAU;gBACtC,MAAM,EAAE,IAAA,gBAAK,EAAC,IAAA,yCAAmB,GAAE,CAAC;aACpC,CAAC;YACF,MAAM,EACL,SAAS,EACT,OAAO,EAAE,cAAc,EACvB,OAAO,EAAE,aAAa,GACtB,GAAG,IAAI,CAAC,qBAAqB,CAAC,WAAW,EAAE,WAAW,EAAE,KAAK,EAAE,gBAAgB,CAAC,CAAC;YAElF,MAAM,EAAE,QAAQ,EAAE,GAAG,IAAI,CAAC;YAC1B,MAAM,gBAAgB,GAAG,EAAE,QAAQ,EAAE,MAAM,EAAE,aAAa,EAAE,CAAC;YAE7D,MAAM,OAAO,GAAG,oBAAoB,CAAC,eAAe,EAAE,WAAW,CAAC,CAAC;YAEnE,MAAM,WAAW,GAAG,CACnB,KAAgC,EAChC,SAAoC,EACpC,WAA2C,EAC1C,EAAE,CACH,IAAI,CAAC,gBAAgB,CACpB,KAAK,EACL,EAAE,QAAQ,EAAE,MAAM,EAAE,SAAS,EAAE,EAC/B,KAAK,EACL,eAAe,EACf,WAAW,EACX,gBAAgB,EAChB,eAAe,EACf,WAAW,CACX,CAAC;YAEH,MAAM,YAAY,GAAG,SAAS,CAAC,aAAa,CAAC,OAAO,CAAC,MAAM,CAC1D,cAAc,EACd,gBAAgB,EAChB,WAAW,EACX,KAAK,EACL,OAAO,EACP,gBAAgB,CAChB,CAAC;YAEF,MAAM,kBAAkB,GAAgB;gBACvC,SAAS,EAAE,SAAS,CAAC,UAAU;gBAC/B,MAAM,EAAE,IAAA,gBAAK,EAAC,YAAY,CAAC;aAC3B,CAAC;YAEF,aAAa,CAAC,GAAG,CAAC,KAAK,EAAE,kBAAkB,CAAC,CAAC;YAE7C,eAAe,CAAC,cAAc,CAAC,GAAG,CAAC,WAAW,EAAE;gBAC/C,UAAU,EAAE,WAAW;gBACvB,YAAY,EAAE,QAAQ;gBACtB,SAAS,EAAE,WAAW;gBACtB,aAAa,EAAE,kBAAkB;aACjC,CAAC,CAAC;SACH;QAED,sFAAsF;QACtF,KAAK,MAAM,CAAC,KAAK,EAAE,WAAW,CAAC,IAAI,MAAM,EAAE;YAC1C,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,KAAK,CAAC,EAAE;gBAC7B,MAAM,WAAW,GAAgB;oBAChC,SAAS,EAAE,sCAAgB,CAAC,UAAU;oBACtC,MAAM,EAAE,IAAA,gBAAK,EAAC,IAAA,yCAAmB,GAAE,CAAC;iBACpC,CAAC;gBAEF,MAAM,EACL,SAAS,EACT,OAAO,EAAE,cAAc,EACvB,OAAO,EAAE,aAAa,GACtB,GAAG,IAAI,CAAC,qBAAqB,CAAC,WAAW,EAAE,WAAW,EAAE,KAAK,EAAE,gBAAgB,CAAC,CAAC;gBAElF,4DAA4D;gBAC5D,MAAM,OAAO,GAAG,oBAAoB,CAAC,eAAe,EAAE,WAAW,CAAC,CAAC;gBACnE,MAAM,gBAAgB,GAAG,SAAS,CAAC,aAAa,CAAC,OAAO,CAAC,MAAM,CAC9D,cAAc,EACd,IAAA,oBAAS,EAAC,aAAa,EAAE,IAAI,CAAC,QAAQ,CAAC,EACvC,CAAC,KAAK,EAAE,SAAS,EAAE,EAAE;oBACpB,IAAA,mBAAM,EACL,SAAS,KAAK,SAAS,EACvB,KAAK,CAAC,iDAAiD,CACvD,CAAC;oBACF,OAAO,IAAI,CAAC,gBAAgB,CAC3B,KAAK,EACL,IAAA,oBAAS,EAAC,SAAS,EAAE,IAAI,CAAC,QAAQ,CAAC,EACnC,KAAK,EACL,eAAe,EACf,WAAW,EACX,gBAAgB,EAChB,eAAe,EACf,cAAc,CACd,CAAC;gBACH,CAAC,EACD,KAAK,EACL,OAAO,EACP,gBAAgB,EAChB,cAAc,CACd,CAAC;gBACF,MAAM,kBAAkB,GAAgB;oBACvC,SAAS,EAAE,SAAS,CAAC,UAAU;oBAC/B,MAAM,EAAE,IAAA,gBAAK,EAAC,gBAAgB,CAAC;iBAC/B,CAAC;gBACF,aAAa,CAAC,GAAG,CAAC,KAAK,EAAE,kBAAkB,CAAC,CAAC;aAC7C;SACD;QAED,OAAO,aAAa,CAAC;IACtB,CAAC;IAEO,gBAAgB,CACvB,MAAiC,EACjC,IAA6C,EAC7C,KAAkB,EAClB,eAA4B,EAC5B,WAAqF,EACrF,gBAAwC,EACxC,eAAgC,EAChC,iBAAqC,0CAAkB,CAAC,KAAK;QAE7D,MAAM,GAAG,GAAG,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC;QAClC,IAAI,GAAG,KAAK,SAAS,EAAE;YACtB,OAAO,SAAS,CAAC;SACjB;QAED,MAAM,OAAO,GACZ,IAAI,CAAC,MAAM,EAAE,YAAY,KAAK,SAAS;YACtC,CAAC,CAAC;gBACA,GAAG,IAAI;gBACP,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,YAAY;aAC/B;YACH,CAAC,CAAC,IAAA,oBAAS,EAAC,IAAI,GAAG,EAAE,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;QAExC,MAAM,YAAY,GAAG,IAAI,CAAC,cAAc,CACvC,MAAM,EAAE,YAAY,IAAI,IAAI,GAAG,EAAE,EACjC,OAAO,EACP,KAAK,EACL,eAAe,EACf,WAAW,EACX,gBAAgB,EAChB,eAAe,EACf,cAAc,CACd,CAAC;QAEF,MAAM,aAAa,GAAkB,EAAE,CAAC;QAExC,IAAI,YAAY,CAAC,IAAI,GAAG,CAAC,EAAE;YAC1B,aAAa,CAAC,YAAY,GAAG,YAAY,CAAC;SAC1C;QAED,IAAI,MAAM,EAAE,oBAAoB,KAAK,SAAS,EAAE;YAC/C,aAAa,CAAC,oBAAoB,GAAG,MAAM,CAAC,oBAAoB,CAAC;SACjE;QAED,kGAAkG;QAClG,IAAI,aAAa,CAAC,oBAAoB,KAAK,SAAS,EAAE;YACrD,MAAM,aAAa,GAAG,cAAc,KAAK,0CAAkB,CAAC,IAAI,CAAC;YAEjE,IAAI,aAAa,CAAC,oBAAoB,CAAC,QAAQ,KAAK,aAAa,EAAE;gBAClE,aAAa,CAAC,oBAAoB,GAAG;oBACpC,GAAG,aAAa,CAAC,oBAAoB;oBACrC,QAAQ,EAAE,aAAa;iBACvB,CAAC;gBACF,eAAe,CAAC,cAAc,IAAI,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;aACzD;SACD;QAED,eAAe,CAAC,gBAAgB,CAAC,GAAG,CAAC,GAAG,EAAE,aAAa,CAAC,CAAC;QACzD,OAAO,aAAa,CAAC;IACtB,CAAC;IAEO,aAAa,CAAC,SAAyB;QAC9C,MAAM,eAAe,GAAmB,IAAI,GAAG,EAAE,CAAC;QAClD,KAAK,MAAM,CAAC,KAAK,EAAE,WAAW,CAAC,IAAI,SAAS,EAAE;YAC7C,MAAM,OAAO,GAAG,gBAAgB,CAAC,IAAI,CAAC,UAAU,EAAE,WAAW,CAAC,SAAS,CAAC,CAAC;YAEzE,MAAM,oBAAoB,GAAG,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,WAAW,CAAC,MAAM,EAAE,CAAC,IAAI,EAAE,EAAE,CAC/E,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,CAC1B,CAAC;YAEF,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,oBAAoB,CAAC,EAAE;gBAC3C,eAAe,CAAC,GAAG,CAAC,KAAK,EAAE,EAAE,GAAG,WAAW,EAAE,MAAM,EAAE,IAAA,gBAAK,EAAC,oBAAoB,CAAC,EAAE,CAAC,CAAC;aACpF;SACD;QAED,OAAO,eAAe,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,SAAS,CAAC;IAC/D,CAAC;IAEO,eAAe,CAAC,SAAwB;QAC/C,MAAM,YAAY,GACjB,SAAS,CAAC,YAAY,KAAK,SAAS;YACnC,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,SAAS,CAAC,YAAY,CAAC;YAC5C,CAAC,CAAC,SAAS,CAAC;QAEd,MAAM,YAAY,GAAG,EAAE,GAAG,SAAS,EAAE,YAAY,EAAE,YAAY,EAAE,CAAC;QAClE,IAAI,YAAY,CAAC,YAAY,KAAK,SAAS,EAAE;YAC5C,OAAO,YAAY,CAAC,YAAY,CAAC;SACjC;QAED,OAAO,oBAAoB,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,YAAY,CAAC;IACtE,CAAC;IAEM,WAAW,CAAC,cAAkD;QACpE,OAAO,IAAI,kBAAkB,CAAC,IAAI,EAAE,cAAc,CAAC,CAAC;IACrD,CAAC;;AA5xBF,kDA6xBC;AA1xBuB,+BAAW,GAAqB,oBAAoB,EAAE,CAAC;AA4xB/E,SAAS,kCAAkC,CAAC,OAAyC;IACpF,MAAM,SAAS,GAA+B,IAAI,GAAG,EAAE,CAAC;IACxD,MAAM,WAAW,GAA4B,IAAI,GAAG,EAAE,CAAC;IACvD,MAAM,aAAa,GAA+B,IAAI,GAAG,EAAE,CAAC;IAC5D,KAAK,MAAM,YAAY,IAAI,OAAO,EAAE;QACnC,MAAM,QAAQ,GAAG,wBAAwB,CAAC,YAAY,CAAC,CAAC;QACxD,MAAM,MAAM,GAAG,YAAY,CAAC,MAAM,CAAC;QACnC,IAAI,MAAM,CAAC,MAAM,EAAE;YAClB,KAAK,MAAM,CAAC,WAAW,EAAE,QAAQ,CAAC,IAAI,MAAM,CAAC,MAAM,EAAE;gBACpD,MAAM,cAAc,GAAG,WAAW,IAAI,QAAQ,CAAC;gBAC/C,MAAM,WAAW,GAAG,IAAA,wBAAa,EAChC,SAAS,EACT,cAAc,EACd,IAAI,GAAG,EAA+B,CACtC,CAAC;gBACF,KAAK,MAAM,CAAC,EAAE,EAAE,KAAK,CAAC,IAAI,QAAQ,EAAE;oBACnC,sDAAsD;oBACtD,0GAA0G;oBAC1G,+FAA+F;oBAC/F,yFAAyF;oBACzF,wFAAwF;oBACxF,0FAA0F;oBAC1F,6FAA6F;oBAC7F,4EAA4E;oBAC5E,4FAA4F;oBAC5F,0FAA0F;oBAC1F,gCAAgC;oBAChC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;wBACzB,oEAAoE;wBACpE,MAAM,YAAY,GAAG,IAAA,8BAAmB,EAAC,WAAW,EAAE,cAAc,EAAE,EAAE,CAAC,CAAC;wBAC1E,IAAI,YAAY,KAAK,SAAS,EAAE;4BAC/B,WAAW,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;yBAC3B;6BAAM;4BACN,IAAA,mBAAM,EACL,YAAY,KAAK,KAAK,CAAC,cAAc,EACrC,KAAK,CAAC,wDAAwD,CAC9D,CAAC;4BACF,IAAA,8BAAmB,EAAC,WAAW,EAAE,cAAc,EAAE,EAAE,CAAC,CAAC;yBACrD;qBACD;iBACD;gBACD,IAAI,WAAW,CAAC,IAAI,KAAK,CAAC,EAAE;oBAC3B,SAAS,CAAC,MAAM,CAAC,cAAc,CAAC,CAAC;iBACjC;aACD;SACD;QACD,IAAI,MAAM,CAAC,QAAQ,KAAK,SAAS,EAAE;YAClC,KAAK,MAAM,CAAC,WAAW,EAAE,QAAQ,CAAC,IAAI,MAAM,CAAC,QAAQ,EAAE;gBACtD,MAAM,cAAc,GAAG,WAAW,IAAI,QAAQ,CAAC;gBAC/C,MAAM,WAAW,GAAG,IAAA,wBAAa,EAChC,WAAW,EACX,cAAc,EACd,IAAI,GAAG,EAA4B,CACnC,CAAC;gBACF,KAAK,MAAM,CAAC,EAAE,EAAE,KAAK,CAAC,IAAI,QAAQ,EAAE;oBACnC,oEAAoE;oBACpE,MAAM,KAAK,GAAG,IAAA,8BAAmB,EAAC,SAAS,EAAE,cAAc,EAAE,EAAE,CAAC,CAAC;oBACjE,IAAI,KAAK,KAAK,SAAS,EAAE;wBACxB,WAAW,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;qBAC3B;yBAAM;wBACN,IAAA,mBAAM,EACL,KAAK,KAAK,KAAK,CAAC,cAAc,EAC9B,KAAK,CAAC,wDAAwD,CAC9D,CAAC;wBACF,IAAA,8BAAmB,EAAC,SAAS,EAAE,cAAc,EAAE,EAAE,CAAC,CAAC;qBACnD;iBACD;gBACD,IAAI,WAAW,CAAC,IAAI,KAAK,CAAC,EAAE;oBAC3B,WAAW,CAAC,MAAM,CAAC,cAAc,CAAC,CAAC;iBACnC;aACD;SACD;QACD,mDAAmD;QACnD,IAAI,MAAM,CAAC,UAAU,EAAE;YACtB,IAAA,4BAAiB,EAAC,MAAM,CAAC,UAAU,EAAE,aAAa,EAAE,KAAK,CAAC,CAAC;SAC3D;KACD;IACD,OAAO,EAAE,SAAS,EAAE,WAAW,EAAE,aAAa,EAAE,CAAC;AAClD,CAAC;AAED,SAAS,YAAY,CACpB,MAA8C,EAC9C,gBAAyC;IAEzC,IAAI,MAAM,KAAK,SAAS,EAAE;QACzB,MAAM,QAAQ,GAA4B,IAAI,GAAG,EAAE,CAAC;QACpD,KAAK,MAAM,CAAC,QAAQ,EAAE,aAAa,CAAC,IAAI,MAAM,EAAE;YAC/C,MAAM,mBAAmB,GAAG,QAAQ,IAAI,gBAAgB,CAAC;YACzD,MAAM,eAAe,GAAkC,IAAI,GAAG,EAAE,CAAC;YACjE,KAAK,MAAM,CAAC,EAAE,EAAE,KAAK,CAAC,IAAI,aAAa,EAAE;gBACxC,eAAe,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,cAAc,CAAC,CAAC;aAC9C;YACD,QAAQ,CAAC,GAAG,CAAC,mBAAmB,EAAE,eAAe,CAAC,CAAC;SACnD;QACD,OAAO,QAAQ,CAAC;KAChB;IACD,OAAO,SAAS,CAAC;AAClB,CAAC;AAED;;;;;;;;;;;;;;GAcG;AACH,QAAe,CAAC,CAAC,oBAAoB,CACpC,EAAE,MAAM,EAAE,QAAQ,EAAkC,EACpD,UAAiE;IAEjE,KAAK,CAAC,CAAC,8BAA8B,CAAC,MAAM,CAAC,YAAY,EAAE,QAAQ,EAAE,UAAU,CAAC,CAAC;AAClF,CAAC;AALD,oDAKC;AAED,QAAQ,CAAC,CAAC,8BAA8B,CACvC,MAAsB,EACtB,QAAiC,EACjC,UAAiE;IAEjE,KAAK,MAAM,CAAC,CAAC,EAAE,WAAW,CAAC,IAAI,MAAM,EAAE;QACtC,MAAM,aAAa,GAAG,WAAW,CAAC,QAAQ,IAAI,QAAQ,CAAC;QACvD,MAAM,OAAO,GAAG,gBAAgB,CAAC,UAAU,EAAE,WAAW,CAAC,SAAS,CAAC,CAAC;QACpE,MAAM,QAAQ,GAAG,QAAQ,CAAC,EAAE,IAAmB;YAC9C,IAAI,IAAI,CAAC,YAAY,KAAK,SAAS,EAAE;gBACpC,KAAK,CAAC,CAAC,8BAA8B,CAAC,IAAI,CAAC,YAAY,EAAE,aAAa,EAAE,UAAU,CAAC,CAAC;aACpF;QACF,CAAC,CAAC;QACF,KAAK,CAAC,CAAC,OAAO,CAAC,oBAAoB,CAAC,IAAA,oBAAS,EAAC,WAAW,CAAC,MAAM,EAAE,aAAa,CAAC,EAAE,QAAQ,CAAC,CAAC;KAC5F;AACF,CAAC;AAED;;;;;;;;;GASG;AACH,SAAgB,gBAAgB,CAC/B,MAAsC,EACtC,eAAmE,EACnE,YAA2C;IAE3C,MAAM,UAAU,GAA+B,IAAI,GAAG,EAAE,CAAC;IAEzD,KAAK,MAAM,IAAI,IAAI,YAAY,EAAE;QAChC,IAAI,MAAM,CAAC,MAAM,CAAC,MAAM,KAAK,SAAS,EAAE;YACvC,6FAA6F;YAC7F,MAAM,QAAQ,GAAG,IAAA,8BAAmB,EAAC,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;YACnF,IAAI,QAAQ,KAAK,SAAS,EAAE;gBAC3B,SAAS;aACT;SACD;QAED,MAAM,IAAI,GAAG,eAAe,CAAC,IAAI,CAAC,CAAC;QACnC,IAAA,mBAAM,EAAC,IAAI,KAAK,SAAS,EAAE,KAAK,CAAC,gCAAgC,CAAC,CAAC;QACnE,IAAA,yBAAc,EAAC,UAAU,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;KACzD;IAED,MAAM,EAAE,YAAY,EAAE,KAAK,EAAE,SAAS,EAAE,wBAAwB,EAAE,MAAM,EAAE,QAAQ,EAAE,GACnF,MAAM,CAAC,MAAM,CAAC;IACf,OAAO,oBAAoB,CAC1B,YAAY,EACZ,KAAK,EACL,SAAS,EACT,wBAAwB,EACxB,MAAM,EACN,QAAQ,EACR,UAAU,CACV,CAAC;AACH,CAAC;AAhCD,4CAgCC;AAED;;;GAGG;AACH,SAAgB,SAAS,CACxB,YAA4C,EAC5C,UAAiE;IAEjE,MAAM,MAAM,GAAG,YAAY,CAAC,MAAM,CAAC;IACnC,+DAA+D;IAC/D,IAAI,CAAC,MAAM,CAAC,wBAAwB,IAAI,CAAC,CAAC,GAAG,CAAC,EAAE;QAC/C,OAAO,qBAAU,CAAC;KAClB;IAED,MAAM,QAAQ,GAAG,wBAAwB,CAAC,YAAY,CAAC,CAAC;IACxD,MAAM,WAAW,GAAG,sDAAwB,CAAC,UAAU,EAAE,CAAC;IAC1D,MAAM,SAAS,GAAuB,EAAE,CAAC;IACzC,MAAM,WAAW,GAAG,aAAa,CAAC,MAAM,CAAC,YAAY,EAAE,QAAQ,EAAE,WAAW,EAAE,UAAU,CAAC,CAAC;IAC1F,IAAI,WAAW,CAAC,IAAI,GAAG,CAAC,EAAE;QACzB,SAAS,CAAC,MAAM,GAAG,WAAW,CAAC;KAC/B;IACD,IAAI,MAAM,CAAC,MAAM,IAAI,MAAM,CAAC,MAAM,CAAC,IAAI,GAAG,CAAC,EAAE;QAC5C,SAAS,CAAC,KAAK,GAAG,iBAAiB,CAAC,MAAM,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;KAC7D;IACD,IAAI,MAAM,CAAC,QAAQ,KAAK,SAAS,IAAI,MAAM,CAAC,QAAQ,CAAC,IAAI,GAAG,CAAC,EAAE;QAC9D,MAAM,QAAQ,GAAmC,EAAE,CAAC;QACpD,IAAA,6BAAkB,EAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,EAAE;YAC3D,QAAQ,CAAC,IAAI,CAAC;gBACb,EAAE,EAAE,IAAA,6BAAkB,EAAC,KAAK,IAAI,QAAQ,EAAE,KAAK,CAAC;gBAChD,KAAK;aACL,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QACH,SAAS,CAAC,OAAO,GAAG,QAAQ,CAAC;KAC7B;IACD,IAAI,MAAM,CAAC,UAAU,IAAI,MAAM,CAAC,UAAU,CAAC,IAAI,GAAG,CAAC,EAAE;QACpD,SAAS,CAAC,UAAU,GAAG,iBAAiB,CAAC,MAAM,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC;KACtE;IACD,OAAO,SAAS,CAAC;AAClB,CAAC;AAlCD,8BAkCC;AAED,SAAS,iBAAiB,CAAC,aAAyC,EAAE,QAAsB;IAC3F,MAAM,mBAAmB,GAA6B,EAAE,CAAC;IACzD,IAAA,6BAAkB,EAAC,aAAa,EAAE,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,EAAE;QACzD,IAAI,KAAK,CAAC,cAAc,GAAG,CAAC,EAAE;YAC7B,MAAM,KAAK,GAAG,IAAA,yBAAc,EAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAClD,IAAA,uCAAoB,EAAC,IAAA,oCAAiB,EAAC,CAAC,CAAC,CAAC,CAC1C,CAAC;YACF,mBAAmB,CAAC,IAAI,CAAC;gBACxB,EAAE,EAAE,IAAA,6BAAkB,EAAC,KAAK,IAAI,QAAQ,EAAE,KAAK,CAAC;gBAChD,KAAK;aACL,CAAC,CAAC;SACH;IACF,CAAC,CAAC,CAAC;IACH,OAAO,mBAAmB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,CAAC,SAAS,CAAC;AACzE,CAAC;AAED;;;;;GAKG;AACH,SAAS,aAAa,CACrB,MAAsB,EACtB,QAAiC,EACjC,WAAqC,EACrC,UAAiE;IAEjE,MAAM,KAAK,GAAqC,IAAI,GAAG,EAAE,CAAC;IAC1D,KAAK,MAAM,CAAC,KAAK,EAAE,WAAW,CAAC,IAAI,MAAM,EAAE;QAC1C,MAAM,aAAa,GAAG,WAAW,CAAC,QAAQ,IAAI,QAAQ,CAAC;QACvD,MAAM,UAAU,GAAG,gBAAgB,CAAC,UAAU,EAAE,WAAW,CAAC,SAAS,CAAC,CAAC,SAAS,CAC/E,IAAA,oBAAS,EAAC,WAAW,CAAC,MAAM,EAAE,aAAa,CAAC,EAC5C,CAAC,WAAW,EAAiB,EAAE,CAC9B,mBAAmB,CAAC,IAAA,oBAAS,EAAC,WAAW,EAAE,aAAa,CAAC,EAAE,WAAW,EAAE,UAAU,CAAC,EACpF,WAAW,CACX,CAAC;QACF,IAAI,CAAC,IAAA,8BAAmB,EAAC,UAAU,CAAC,EAAE;YACrC,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC;SAC7B;KACD;IACD,OAAO,KAAK,CAAC;AACd,CAAC;AAED,SAAS,mBAAmB,CAC3B,EAAE,MAAM,EAAE,QAAQ,EAA+B,EACjD,WAAqC,EACrC,UAAiE;IAEjE,IAAI,MAAM,CAAC,YAAY,KAAK,SAAS,EAAE;QACtC,OAAO,aAAa,CAAC,MAAM,CAAC,YAAY,EAAE,QAAQ,EAAE,WAAW,EAAE,UAAU,CAAC,CAAC;KAC7E;IACD,8DAA8D;IAC9D,OAAO,IAAI,GAAG,EAAE,CAAC;AAClB,CAAC;AAED;;;;;;;;;;GAUG;AACH,SAAgB,8BAA8B,CAC7C,QAAiC,EACjC,aAA0C;IAE1C,MAAM,iBAAiB,GAAkB,EAAE,CAAC;IAC5C,KAAK,MAAM,QAAQ,IAAI,aAAa,EAAE;QACrC,IAAI,QAAQ,KAAK,SAAS,EAAE;YAC3B,iBAAiB,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;SACjC;KACD;IAED,MAAM,gBAAgB,GAAG,GAAG,EAAE,CAAC,iBAAiB,CAAC;IACjD,OAAO;QACN,GAAG,IAAA,yCAA8B,EAAC,QAAQ,CAAC;QAC3C,gBAAgB;KAChB,CAAC;AACH,CAAC;AAhBD,wEAgBC;AAED,SAAS,oBAAoB,CAAC,MAAqB;IAClD,OAAO,MAAM,CAAC,YAAY,KAAK,SAAS,IAAI,MAAM,CAAC,oBAAoB,KAAK,SAAS,CAAC;AACvF,CAAC;AAED,SAAgB,YAAY,CAC3B,UAA2D,EAC3D,IAAyB;IAEzB,IAAI,IAAI,KAAK,sCAAgB,CAAC,UAAU,EAAE;QACzC,OAAO,sCAAgB,CAAC;KACxB;IACD,MAAM,SAAS,GAAG,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACvC,IAAA,mBAAM,EAAC,SAAS,KAAK,SAAS,EAAE,KAAK,CAAC,wBAAwB,CAAC,CAAC;IAChE,OAAO,IAAA,mCAAU,EAAC,SAAS,CAAC,CAAC;AAC9B,CAAC;AAVD,oCAUC;AAED,SAAgB,gBAAgB,CAC/B,UAA2D,EAC3D,IAAyB;IAEzB,OAAO,YAAY,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC,aAAa,CAAC;AACrD,CAAC;AALD,4CAKC;AAoDD,SAAS,eAAe;IACvB,OAAO;QACN,GAAG,kBAAkB,EAAe;QACpC,cAAc,EAAE,IAAI,GAAG,EAAE;QACzB,SAAS,EAAE,IAAI,GAAG,EAAE;KACpB,CAAC;AACH,CAAC;AAoBD,SAAS,kBAAkB;IAC1B,OAAO;QACN,QAAQ,EAAE,IAAI,GAAG,EAAE;QACnB,QAAQ,EAAE,IAAI,GAAG,EAAE;QACnB,aAAa,EAAE,IAAI,GAAG,EAAE;QACxB,aAAa,EAAE,IAAI,GAAG,EAAE;QACxB,iBAAiB,EAAE,IAAI,GAAG,EAAE;KAC5B,CAAC;AACH,CAAC;AAED,SAAS,iCAAiC,CACzC,OAAkC,EAClC,OAAkC;IAElC,+FAA+F;IAC/F,sGAAsG;IACtG,2CAA2C;IAC3C,6GAA6G;IAC7G,wFAAwF;IACxF,OAAO,OAAO,IAAI,OAAO,IAAI,IAAA,eAAI,EAAC,6CAA6C,CAAC,CAAC;AAClF,CAAC;AASD,SAAS,kBAAkB,CAAC,cAAsB;IACjD,OAAO;QACN,cAAc;KACd,CAAC;AACH,CAAC;AAMD,SAAS,oBAAoB,CAC5B,eAAmC,EACnC,eAAkB,EAClB,UAAU,GAAG,IAAI;IAEjB,MAAM,MAAM,GAAG,CAAC,MAAwB,EAAE,EAAE,CAC3C,MAAM,KAAK,uCAAgB,CAAC,MAAM,CAAC,CAAC,CAAC,eAAe,CAAC,QAAQ,CAAC,CAAC,CAAC,eAAe,CAAC,QAAQ,CAAC;IAE1F,MAAM,aAAa,GAAG,CAAC,MAAwB,EAAE,EAAE,CAClD,MAAM,KAAK,uCAAgB,CAAC,MAAM;QACjC,CAAC,CAAC,eAAe,CAAC,aAAa;QAC/B,CAAC,CAAC,eAAe,CAAC,aAAa,CAAC;IAElC,MAAM,OAAO,GAAG;QACf,KAAK,EAAE,eAAe;QAEtB,GAAG,EAAE,CACJ,MAAwB,EACxB,QAAiC,EACjC,EAAoB,EACpB,KAAa,EACb,QAAiB,EACjB,oBAA6B,EAC5B,EAAE;YACH,IAAI,oBAAoB,IAAI,UAAU,EAAE;gBACvC,MAAM,aAAa,GAAI,EAAa,GAAG,KAAK,GAAG,CAAC,CAAC;gBACjD,IAAI,OAAO,GAAG,EAAE,CAAC;gBACjB,OAAO,OAAO,IAAI,aAAa,EAAE;oBAChC,MAAM,cAAc,GAAG,IAAA,gDAAyB,EAC/C,aAAa,CAAC,MAAM,CAAC,EACrB,QAAQ,EACR,OAAO,EACP,aAAa,GAAG,OAAO,GAAG,CAAC,CAC3B,CAAC;oBACF,IAAI,cAAc,CAAC,KAAK,KAAK,SAAS,EAAE;wBACvC,eAAe,CAAC,iBAAiB,CAAC,GAAG,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC;qBAC5D;oBAED,OAAO,GAAG,IAAA,gBAAK,EAAC,OAAO,GAAG,cAAc,CAAC,MAAM,CAAC,CAAC;iBACjD;aACD;YACD,IAAA,yCAAkB,EAAC,MAAM,CAAC,MAAM,CAAC,EAAE,QAAQ,EAAE,EAAE,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC;QACnE,CAAC;QAED,GAAG,EAAE,CACJ,MAAwB,EACxB,QAAiC,EACjC,EAAoB,EACpB,KAAa,EACb,aAAsB,EACrB,EAAE;YACH,IAAI,aAAa,EAAE;gBAClB,wEAAwE;gBACxE,sEAAsE;gBACtE,0FAA0F;gBAC1F,IAAA,yCAAkB,EAAC,aAAa,CAAC,MAAM,CAAC,EAAE,QAAQ,EAAE,EAAE,EAAE,KAAK,EAAE,eAAe,CAAC,CAAC;aAChF;YACD,OAAO,IAAA,gDAAyB,EAAC,MAAM,CAAC,MAAM,CAAC,EAAE,QAAQ,EAAE,EAAE,EAAE,KAAK,CAAC,CAAC;QACvE,CAAC;KACD,CAAC;IAEF,OAAO,OAAO,CAAC;AAChB,CAAC;AAED,SAAS,oBAAoB,CAC5B,UAAsC,SAAS,EAC/C,QAAgB,CAAC,CAAC,EAClB,YAAiD,SAAS,EAC1D,2BAA+C,SAAS,EACxD,MAAmC,EACnC,QAAkC,EAClC,UAAuC;IAEvC,MAAM,SAAS,GAA8B,EAAE,YAAY,EAAE,OAAO,IAAI,IAAI,GAAG,EAAE,EAAE,CAAC;IACpF,IAAI,SAAS,KAAK,SAAS,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE;QACpD,SAAS,CAAC,SAAS,GAAG,SAAS,CAAC;KAChC;IACD,IAAI,KAAK,IAAI,CAAC,EAAE;QACf,SAAS,CAAC,KAAK,GAAG,IAAA,gBAAK,EAAC,KAAK,CAAC,CAAC;KAC/B;IACD,IAAI,wBAAwB,KAAK,SAAS,IAAI,wBAAwB,GAAG,CAAC,EAAE;QAC3E,SAAS,CAAC,wBAAwB,GAAG,wBAAwB,CAAC;KAC9D;IACD,IAAI,MAAM,KAAK,SAAS,IAAI,MAAM,CAAC,IAAI,GAAG,CAAC,EAAE;QAC5C,SAAS,CAAC,MAAM,GAAG,MAAM,CAAC;KAC1B;IACD,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ,CAAC,IAAI,GAAG,CAAC,EAAE;QAChD,SAAS,CAAC,QAAQ,GAAG,QAAQ,CAAC;KAC9B;IACD,IAAI,UAAU,KAAK,SAAS,IAAI,UAAU,CAAC,IAAI,GAAG,CAAC,EAAE;QACpD,SAAS,CAAC,UAAU,GAAG,UAAU,CAAC;KAClC;IACD,OAAO,SAAS,CAAC;AAClB,CAAC;AAED,MAAa,kBAAmB,SAAQ,sBAA6B;IAIpE,YACC,MAA0D,EAC1D,cAAkD;QAElD,KAAK,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC;QAPvB,qBAAgB,GAAW,CAAC,CAAC;QAQpC,IAAI,CAAC,WAAW,GAAG,IAAA,+BAAoB,GAAE,CAAC;IAC3C,CAAC;IAEe,gBAAgB;QAC/B,IAAI,CAAC,gBAAgB,IAAI,CAAC,CAAC;QAC3B,IAAI,IAAI,CAAC,gBAAgB,KAAK,CAAC,EAAE;YAChC,IAAI,CAAC,WAAW,GAAG,IAAA,+BAAoB,GAAE,CAAC;SAC1C;IACF,CAAC;IAEe,eAAe;QAC9B,IAAA,mBAAM,EAAC,IAAI,CAAC,gBAAgB,GAAG,CAAC,EAAE,KAAK,CAAC,wCAAwC,CAAC,CAAC;QAClF,IAAI,CAAC,gBAAgB,IAAI,CAAC,CAAC;QAC3B,IAAI,IAAI,CAAC,gBAAgB,KAAK,CAAC,EAAE;YAChC,IAAI,CAAC,WAAW,GAAG,IAAA,+BAAoB,GAAE,CAAC;SAC1C;IACF,CAAC;IAED;;;;OAIG;IACI,UAAU,CAChB,OAAyB,EACzB,OAA+B;QAE/B,IAAI,OAAO,CAAC,IAAI,sCAA8B,IAAI,OAAO,CAAC,cAAc,EAAE,KAAK,CAAC,EAAE;YACjF,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC;SAC1B;QACD,MAAM,MAAM,GAA+B,IAAI,GAAG,EAAE,CAAC;QACrD,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAE,CAAC;QAC3B,MAAM,CAAC,GAAG,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;QAChC,MAAM,KAAK,GACV,OAAO,CAAC,IAAI,sCAA8B;YACzC,CAAC,CAAC,IAAA,2BAAgB,EAAC,OAAO,EAAE,6BAAkB,CAAC;YAC/C,CAAC,CAAC,IAAA,oBAAS,EAAC,OAAO,EAAE,6BAAkB,CAAC,CAAC;QAC3C,QAAQ,CAAC,GAAG,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;QAE7B,OAAO;YACN,IAAI,EAAE,QAAQ;YACd,MAAM;SACN,CAAC;IACH,CAAC;IAED;;;;;;OAMG;IACI,YAAY,CAClB,KAAkB,EAClB,SAA8B,EAC9B,MAAsB,EACtB,QAA0B,IAAA,gBAAK,EAAC,CAAC,CAAC,CAAC;QAEnC,MAAM,aAAa,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,SAAS,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;QACxE,IAAI,CAAC,WAAW,CAAC,aAAa,CAAC,CAAC;IACjC,CAAC;IAED;;;;;;OAMG;IACI,WAAW,CACjB,KAAkB,EAClB,SAA8B,EAC9B,MAAsB,EACtB,QAA0B,IAAA,gBAAK,EAAC,CAAC,CAAC,CAAC;QAEnC,MAAM,SAAS,GAAG,IAAI,CAAC,cAAc,CAAC,KAAK,EAAE,SAAS,EAAE,MAAM,CAAC,CAAC;QAChE,OAAO,oBAAoB,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;IAC/C,CAAC;IAEM,aAAa,CAAC,OAA0B,EAAE,QAA0B,IAAA,gBAAK,EAAC,CAAC,CAAC,CAAC;QACnF,MAAM,aAAa,GAAG,IAAI,CAAC,YAAY,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;QACxD,IAAI,CAAC,WAAW,CAAC,aAAa,CAAC,CAAC;IACjC,CAAC;IAEM,YAAY,CAClB,OAA0B,EAC1B,QAA0B,IAAA,gBAAK,EAAC,CAAC,CAAC,CAAC;QAEnC,MAAM,UAAU,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CACzC,IAAA,yBAAc,EACb,MAAM,CAAC,IAAI,KAAK,QAAQ;YACvB,CAAC,CAAC,oBAAoB,CACpB,SAAS,EACT,SAAS,EACT,SAAS,EACT,SAAS,EACT,MAAM,CAAC,MAAM,CACZ;YACH,CAAC,CAAC,oBAAoB,CACpB,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,SAAS,EAAE,MAAM,CAAC,MAAM,CAAC,CACjE,CACJ,CACD,CAAC;QACF,MAAM,cAAc,GAAG,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;QACrE,IAAI,KAAK,IAAI,CAAC,EAAE;YACf,cAAc,CAAC,KAAK,GAAG,KAAK,CAAC;SAC7B;QACD,OAAO,cAAc,CAAC;IACvB,CAAC;IAEM,UAAU,CAAC,KAAc;QAC/B,OAAO,IAAA,gBAAK,EAAC,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC;IAChD,CAAC;IAEO,cAAc,CACrB,KAAkB,EAClB,SAA8B,EAC9B,MAAsB;QAEtB,IAAI,cAAc,GAAmB,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,EAAE,EAAE,SAAS,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC;QAErF,IAAI,aAAa,GAAG,KAAK,CAAC,MAAM,CAAC;QACjC,OAAO,aAAa,KAAK,SAAS,EAAE;YACnC,MAAM,UAAU,GAAkB,EAAE,YAAY,EAAE,cAAc,EAAE,CAAC;YACnE,MAAM,WAAW,GAAG,sCAAgB,CAAC,aAAa,CAAC,MAAM,CAAC,gBAAgB,CACzE,aAAa,CAAC,WAAW,EACzB,UAAU,CACV,CAAC;YACF,cAAc,GAAG,IAAI,GAAG,CAAC;gBACxB;oBACC,aAAa,CAAC,WAAW;oBACzB,EAAE,SAAS,EAAE,sCAAgB,CAAC,UAAU,EAAE,MAAM,EAAE,IAAA,gBAAK,EAAC,WAAW,CAAC,EAAE;iBACtE;aACD,CAAC,CAAC;YACH,aAAa,GAAG,aAAa,CAAC,MAAM,CAAC;SACrC;QAED,OAAO,cAAc,CAAC;IACvB,CAAC;IAEM,uBAAuB,CAAC,IAAY;QAC1C,MAAM,UAAU,GAAkB;YACjC,oBAAoB,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE;SACzC,CAAC;QACF,MAAM,WAAW,GAAG,sCAAgB,CAAC,aAAa,CAAC,MAAM,CAAC,gBAAgB,CACzE,IAAI,CAAC,WAAW,EAChB,UAAU,CACV,CAAC;QACF,IAAI,CAAC,YAAY,CAChB,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,KAAK,EAAE,IAAI,CAAC,WAAW,EAAE,EAChD,sCAAgB,CAAC,UAAU,EAC3B,IAAA,gBAAK,EAAC,WAAW,CAAC,CAClB,CAAC;IACH,CAAC;CACD;AAnKD,gDAmKC;AAyBD,SAAS,2BAA2B,CAAC,OAAyC;IAI7E,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC;IACf,MAAM,QAAQ,GAAmB,EAAE,CAAC;IACpC,KAAK,MAAM,YAAY,IAAI,OAAO,EAAE;QACnC,MAAM,MAAM,GAAG,YAAY,CAAC,MAAM,CAAC;QACnC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,IAAI,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;QAC5C,QAAQ,CAAC,IAAI,CAAC,GAAG,4BAA4B,CAAC,YAAY,CAAC,CAAC,CAAC;KAC7D;IAED,MAAM,SAAS,GAAG,IAAI,GAAG,EAAe,CAAC;IACzC,MAAM,mBAAmB,GAAkB,EAAE,CAAC;IAC9C,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE;QAC5B,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC7B,IAAI,IAAI,CAAC,UAAU,KAAK,SAAS,EAAE;YAClC,mBAAmB,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;SAC1C;KACD;IAED,mBAAmB,CAAC,OAAO,EAAE,CAAC;IAC9B,KAAK,MAAM,QAAQ,IAAI,mBAAmB,EAAE;QAC3C,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE;YAC7B,QAAQ,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC;SAC5B;KACD;IAED,OAAO,EAAE,KAAK,EAAE,IAAA,gBAAK,EAAC,KAAK,CAAC,EAAE,QAAQ,EAAE,CAAC;AAC1C,CAAC;AAED,SAAS,4BAA4B,CACpC,YAA4C;IAE5C,MAAM,QAAQ,GAAmB,EAAE,CAAC;IACpC,IAAI,YAAY,CAAC,MAAM,CAAC,SAAS,KAAK,SAAS,EAAE;QAChD,QAAQ,CAAC,IAAI,CAAC,GAAG,YAAY,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;KAChD;SAAM,IAAI,YAAY,CAAC,QAAQ,KAAK,SAAS,EAAE;QAC/C,MAAM,IAAI,GAA0B,EAAE,QAAQ,EAAE,YAAY,CAAC,QAAQ,EAAE,CAAC;QACxE,IAAI,YAAY,CAAC,UAAU,KAAK,SAAS,EAAE;YAC1C,IAAI,CAAC,UAAU,GAAG,YAAY,CAAC,UAAU,CAAC;SAC1C;QACD,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;KACpB;IACD,OAAO,QAAQ,CAAC;AACjB,CAAC;AAED,SAAS,wBAAwB,CAAC,MAAsC;IACvE,OAAO,MAAM,CAAC,QAAQ,IAAI,oBAAoB,CAAC,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;AACzE,CAAC;AAED,SAAS,oBAAoB,CAC5B,QAA6C;IAE7C,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE;QACpD,OAAO,SAAS,CAAC;KACjB;IACD,OAAO,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC;AAC7B,CAAC","sourcesContent":["/!\n Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n /\n\nimport { assert } from \"@fluidframework/core-utils\";\nimport { ICodecFamily, ICodecOptions, makeCodecFamily } from \"../../codec/index.js\";\nimport {\n\tChangeFamily,\n\tEditBuilder,\n\tChangeRebaser,\n\tFieldKindIdentifier,\n\tFieldKey,\n\tUpPath,\n\tTaggedChange,\n\tRevisionTag,\n\ttagChange,\n\tmakeAnonChange,\n\tChangeFamilyEditor,\n\tFieldUpPath,\n\tChangesetLocalId,\n\tisEmptyFieldChanges,\n\tRevisionMetadataSource,\n\tRevisionInfo,\n\trevisionMetadataSourceFromInfo,\n\tChangeAtomIdMap,\n\tmakeDetachedNodeId,\n\temptyDelta,\n\tDeltaFieldMap,\n\tDeltaFieldChanges,\n\tDeltaDetachedNodeBuild,\n\tDeltaDetachedNodeDestruction,\n\tDeltaRoot,\n\tDeltaDetachedNodeId,\n\tChangeEncodingContext,\n\tRevisionTagCodec,\n\tmapCursorField,\n\tITreeCursorSynchronous,\n\tCursorLocationType,\n} from \"../../core/index.js\";\nimport {\n\tbrand,\n\tdeleteFromNestedMap,\n\tfail,\n\tforEachInNestedMap,\n\tgetOrAddInMap,\n\tIdAllocationState,\n\tIdAllocator,\n\tidAllocatorFromMaxId,\n\tidAllocatorFromState,\n\tMutable,\n\tpopulateNestedMap,\n\tsetInNestedMap,\n\ttryGetFromNestedMap,\n} from \"../../util/index.js\";\nimport { MemoizedIdRangeAllocator } from \"../memoizedIdRangeAllocator.js\";\nimport {\n\tTreeChunk,\n\tchunkFieldSingle,\n\tdefaultChunkPolicy,\n\tFieldBatchCodec,\n\tchunkTree,\n} from \"../chunked-forest/index.js\";\nimport { cursorForMapTreeNode, mapTreeFromCursor } from \"../mapTreeCursor.js\";\nimport { TreeCompressionStrategy } from \"../treeCompressionUtils.js\";\nimport {\n\tCrossFieldManager,\n\tCrossFieldMap,\n\tCrossFieldTarget,\n\tgetFirstFromCrossFieldMap,\n\tsetInCrossFieldMap,\n} from \"./crossFieldQueries.js\";\nimport {\n\tFieldChangeHandler,\n\tNodeExistenceState,\n\tRebaseRevisionMetadata,\n} from \"./fieldChangeHandler.js\";\nimport { FlexFieldKind } from \"./fieldKind.js\";\nimport { FieldKindWithEditor, withEditor } from \"./fieldKindWithEditor.js\";\nimport { convertGenericChange, genericFieldKind, newGenericChangeset } from \"./genericFieldKind.js\";\nimport { GenericChangeset } from \"./genericFieldKindTypes.js\";\nimport {\n\tFieldChange,\n\tFieldChangeMap,\n\tFieldChangeset,\n\tModularChangeset,\n\tNodeChangeset,\n} from \"./modularChangeTypes.js\";\nimport { makeV0Codec } from \"./modularChangeCodecs.js\";\n\n/\n Implementation of ChangeFamily which delegates work in a given field to the appropriate FieldKind\n * as determined by the schema.\n /\nexport class ModularChangeFamily\n\timplements ChangeFamily<ModularEditBuilder, ModularChangeset>, ChangeRebaser<ModularChangeset>\n{\n\tpublic static readonly emptyChange: ModularChangeset = makeModularChangeset();\n\n\tpublic readonly latestCodec: ReturnType<typeof makeV0Codec>;\n\n\tpublic readonly codecs: ICodecFamily<ModularChangeset, ChangeEncodingContext>;\n\n\tpublic constructor(\n\t\tpublic readonly fieldKinds: ReadonlyMap<FieldKindIdentifier, FieldKindWithEditor>,\n\t\trevisionTagCodec: RevisionTagCodec,\n\t\tfieldBatchCodec: FieldBatchCodec,\n\t\tcodecOptions: ICodecOptions,\n\t\tchunkCompressionStrategy?: TreeCompressionStrategy,\n\t) {\n\t\tthis.latestCodec = makeV0Codec(\n\t\t\tfieldKinds,\n\t\t\trevisionTagCodec,\n\t\t\tfieldBatchCodec,\n\t\t\tcodecOptions,\n\t\t\tchunkCompressionStrategy,\n\t\t);\n\t\tthis.codecs = makeCodecFamily([[0, this.latestCodec]]);\n\t}\n\n\tpublic get rebaser(): ChangeRebaser<ModularChangeset> {\n\t\treturn this;\n\t}\n\n\t/\n\t Produces an equivalent list of `FieldChangeset`s that all target the same {@link FlexFieldKind}.\n\t * @param changes - The list of `FieldChange`s whose `FieldChangeset`s needs to be normalized.\n\t * @returns An object that contains both the equivalent list of `FieldChangeset`s that all\n\t * target the same {@link FlexFieldKind}, and the `FieldKind` that they target.\n\t * The returned `FieldChangeset`s may be a shallow copy of the input `FieldChange`s.\n\t /\n\tprivate normalizeFieldChanges(\n\t\tchange1: FieldChange \| undefined,\n\t\tchange2: FieldChange \| undefined,\n\t\tgenId: IdAllocator,\n\t\trevisionMetadata: RevisionMetadataSource,\n\t): {\n\t\tfieldKind: FieldKindWithEditor;\n\t\tchange1: FieldChangeset \| undefined;\n\t\tchange2: FieldChangeset \| undefined;\n\t} {\n\t\t// TODO: Handle the case where changes have conflicting field kinds\n\t\tconst kind =\n\t\t\tchange1 !== undefined && change1.fieldKind !== genericFieldKind.identifier\n\t\t\t\t? change1.fieldKind\n\t\t\t\t: change2?.fieldKind ?? genericFieldKind.identifier;\n\n\t\tif (kind === genericFieldKind.identifier) {\n\t\t\t// All the changes are generic\n\t\t\treturn {\n\t\t\t\tfieldKind: genericFieldKind,\n\t\t\t\tchange1: change1?.change,\n\t\t\t\tchange2: change2?.change,\n\t\t\t};\n\t\t}\n\t\tconst fieldKind = getFieldKind(this.fieldKinds, kind);\n\t\tconst handler = fieldKind.changeHandler;\n\t\tconst normalizedChange1 = this.normalizeFieldChange(\n\t\t\tchange1,\n\t\t\thandler,\n\t\t\tgenId,\n\t\t\trevisionMetadata,\n\t\t);\n\t\tconst normalizedChange2 = this.normalizeFieldChange(\n\t\t\tchange2,\n\t\t\thandler,\n\t\t\tgenId,\n\t\t\trevisionMetadata,\n\t\t);\n\t\treturn { fieldKind, change1: normalizedChange1, change2: normalizedChange2 };\n\t}\n\n\tprivate normalizeFieldChange<T>(\n\t\tfieldChange: FieldChange \| undefined,\n\t\thandler: FieldChangeHandler<T>,\n\t\tgenId: IdAllocator,\n\t\trevisionMetadata: RevisionMetadataSource,\n\t): FieldChangeset \| undefined {\n\t\tif (fieldChange === undefined) {\n\t\t\treturn undefined;\n\t\t}\n\n\t\tif (fieldChange.fieldKind !== genericFieldKind.identifier) {\n\t\t\treturn fieldChange.change;\n\t\t}\n\n\t\t// The cast is based on the `fieldKind` check above\n\t\tconst genericChange = fieldChange.change as unknown as GenericChangeset;\n\t\tconst convertedChange = convertGenericChange(\n\t\t\tgenericChange,\n\t\t\thandler,\n\t\t\t(child1, child2) =>\n\t\t\t\tthis.composeNodeChanges(\n\t\t\t\t\tchild1,\n\t\t\t\t\tundefined,\n\t\t\t\t\tchild2,\n\t\t\t\t\tundefined,\n\t\t\t\t\tgenId,\n\t\t\t\t\tnewComposeTable(),\n\t\t\t\t\trevisionMetadata,\n\t\t\t\t),\n\t\t\tgenId,\n\t\t\trevisionMetadata,\n\t\t) as FieldChangeset;\n\n\t\treturn convertedChange;\n\t}\n\n\tpublic compose(changes: TaggedChange<ModularChangeset>[]): ModularChangeset {\n\t\tconst activeChanges = changes.filter(\n\t\t\t(change) => (change.change.constraintViolationCount ?? 0) === 0,\n\t\t);\n\n\t\tconst { revInfos, maxId } = getRevInfoFromTaggedChanges(changes);\n\t\tconst idState: IdAllocationState = { maxId };\n\n\t\treturn activeChanges.reduce(\n\t\t\t(change1, change2) =>\n\t\t\t\tmakeAnonChange(this.composePair(change1, change2, revInfos, idState)),\n\t\t\tmakeAnonChange({ fieldChanges: new Map() }),\n\t\t).change;\n\t}\n\n\tprivate composePair(\n\t\tchange1: TaggedChange<ModularChangeset>,\n\t\tchange2: TaggedChange<ModularChangeset>,\n\t\trevInfos: RevisionInfo[],\n\t\tidState: IdAllocationState,\n\t) {\n\t\tconst genId: IdAllocator = idAllocatorFromState(idState);\n\t\tconst revisionMetadata: RevisionMetadataSource = revisionMetadataSourceFromInfo(revInfos);\n\n\t\tconst crossFieldTable = newComposeTable();\n\n\t\tconst composedFields = this.composeFieldMaps(\n\t\t\tchange1.change.fieldChanges,\n\t\t\tchange1.revision,\n\t\t\tchange2.change.fieldChanges,\n\t\t\tchange2.revision,\n\t\t\tgenId,\n\t\t\tcrossFieldTable,\n\t\t\trevisionMetadata,\n\t\t);\n\n\t\twhile (crossFieldTable.invalidatedFields.size > 0) {\n\t\t\tconst fieldsToUpdate = crossFieldTable.invalidatedFields;\n\t\t\tcrossFieldTable.invalidatedFields = new Set();\n\t\t\tfor (const fieldChange of fieldsToUpdate) {\n\t\t\t\tconst context = crossFieldTable.fieldToContext.get(fieldChange);\n\t\t\t\tassert(\n\t\t\t\t\tcontext !== undefined,\n\t\t\t\t\t0x8cc / Should have context for every invalidated field /,\n\t\t\t\t);\n\t\t\t\tconst { change1: fieldChange1, change2: fieldChange2, composedChange } = context;\n\n\t\t\t\tconst rebaser = getChangeHandler(this.fieldKinds, fieldChange.fieldKind).rebaser;\n\t\t\t\tconst composeNodes = (\n\t\t\t\t\tnode1: NodeChangeset \| undefined,\n\t\t\t\t\tnode2: NodeChangeset \| undefined,\n\t\t\t\t): NodeChangeset => {\n\t\t\t\t\tconst key = composeCacheKeyFromNodeChangesets(node1, node2);\n\t\t\t\t\tconst cachedResult = crossFieldTable.nodeCache.get(key);\n\t\t\t\t\tif (cachedResult !== undefined) {\n\t\t\t\t\t\treturn cachedResult;\n\t\t\t\t\t}\n\n\t\t\t\t\treturn this.composeNodeChanges(\n\t\t\t\t\t\tnode1,\n\t\t\t\t\t\tfieldChange1.revision,\n\t\t\t\t\t\tnode2,\n\t\t\t\t\t\tfieldChange2.revision,\n\t\t\t\t\t\tgenId,\n\t\t\t\t\t\tcrossFieldTable,\n\t\t\t\t\t\trevisionMetadata,\n\t\t\t\t\t);\n\t\t\t\t};\n\n\t\t\t\tconst amendedChange = rebaser.compose(\n\t\t\t\t\tfieldChange1,\n\t\t\t\t\tfieldChange2,\n\t\t\t\t\tcomposeNodes,\n\t\t\t\t\tgenId,\n\t\t\t\t\tnewCrossFieldManager(crossFieldTable, fieldChange, false),\n\t\t\t\t\trevisionMetadata,\n\t\t\t\t);\n\t\t\t\tcomposedChange.change = brand(amendedChange);\n\t\t\t}\n\t\t}\n\n\t\tconst { allBuilds, allDestroys, allRefreshers } = composeBuildsDestroysAndRefreshers([\n\t\t\tchange1,\n\t\t\tchange2,\n\t\t]);\n\n\t\treturn makeModularChangeset(\n\t\t\tthis.pruneFieldMap(composedFields),\n\t\t\tidState.maxId,\n\t\t\trevInfos,\n\t\t\tundefined,\n\t\t\tallBuilds,\n\t\t\tallDestroys,\n\t\t\tallRefreshers,\n\t\t);\n\t}\n\n\tprivate composeFieldMaps(\n\t\tchange1: FieldChangeMap \| undefined,\n\t\trevision1: RevisionTag \| undefined,\n\t\tchange2: FieldChangeMap \| undefined,\n\t\trevision2: RevisionTag \| undefined,\n\t\tgenId: IdAllocator,\n\t\tcrossFieldTable: ComposeTable,\n\t\trevisionMetadata: RevisionMetadataSource,\n\t): FieldChangeMap {\n\t\tconst composedFields: FieldChangeMap = new Map();\n\t\tconst fields = new Set<FieldKey>();\n\t\tfor (const field of change1?.keys() ?? []) {\n\t\t\tfields.add(field);\n\t\t}\n\n\t\tfor (const field of change2?.keys() ?? []) {\n\t\t\tfields.add(field);\n\t\t}\n\n\t\tfor (const field of fields) {\n\t\t\tconst fieldChange1 = change1?.get(field);\n\t\t\tconst fieldChange2 = change2?.get(field);\n\n\t\t\tconst {\n\t\t\t\tfieldKind,\n\t\t\t\tchange1: normalizedFieldChange1,\n\t\t\t\tchange2: normalizedFieldChange2,\n\t\t\t} = this.normalizeFieldChanges(fieldChange1, fieldChange2, genId, revisionMetadata);\n\n\t\t\tconst manager = newCrossFieldManager(crossFieldTable, fieldChange1 ?? fieldChange2);\n\t\t\tconst taggedChange1 = tagChange(\n\t\t\t\tnormalizedFieldChange1 ?? fieldKind.changeHandler.createEmpty(),\n\t\t\t\tfieldChange1?.revision ?? revision1,\n\t\t\t);\n\t\t\tconst taggedChange2 = tagChange(\n\t\t\t\tnormalizedFieldChange2 ?? fieldKind.changeHandler.createEmpty(),\n\t\t\t\tfieldChange2?.revision ?? revision2,\n\t\t\t);\n\n\t\t\tconst composedChange = fieldKind.changeHandler.rebaser.compose(\n\t\t\t\ttaggedChange1,\n\t\t\t\ttaggedChange2,\n\t\t\t\t(child1, child2) =>\n\t\t\t\t\tthis.composeNodeChanges(\n\t\t\t\t\t\tchild1,\n\t\t\t\t\t\trevision1,\n\t\t\t\t\t\tchild2,\n\t\t\t\t\t\trevision2,\n\t\t\t\t\t\tgenId,\n\t\t\t\t\t\tcrossFieldTable,\n\t\t\t\t\t\trevisionMetadata,\n\t\t\t\t\t),\n\t\t\t\tgenId,\n\t\t\t\tmanager,\n\t\t\t\trevisionMetadata,\n\t\t\t);\n\n\t\t\tconst composedField: FieldChange = {\n\t\t\t\tfieldKind: fieldKind.identifier,\n\t\t\t\tchange: brand(composedChange),\n\t\t\t};\n\n\t\t\tconst fieldKey =\n\t\t\t\tfieldChange1 ?? fieldChange2 ?? fail(\"At least one field should have changes\");\n\n\t\t\tcrossFieldTable.fieldToContext.set(fieldKey, {\n\t\t\t\tchange1: taggedChange1,\n\t\t\t\tchange2: taggedChange2,\n\t\t\t\tcomposedChange: composedField,\n\t\t\t});\n\n\t\t\t// TODO: Could optimize by checking that composedField is non-empty\n\t\t\tcomposedFields.set(field, composedField);\n\t\t}\n\n\t\treturn composedFields;\n\t}\n\n\tprivate composeNodeChanges(\n\t\tchange1: NodeChangeset \| undefined,\n\t\trevision1: RevisionTag \| undefined,\n\t\tchange2: NodeChangeset \| undefined,\n\t\trevision2: RevisionTag \| undefined,\n\t\tgenId: IdAllocator,\n\t\tcrossFieldTable: ComposeTable,\n\t\trevisionMetadata: RevisionMetadataSource,\n\t): NodeChangeset {\n\t\tconst nodeExistsConstraint = change1?.nodeExistsConstraint ?? change2?.nodeExistsConstraint;\n\n\t\tconst composedFieldChanges = this.composeFieldMaps(\n\t\t\tchange1?.fieldChanges,\n\t\t\trevision1,\n\t\t\tchange2?.fieldChanges,\n\t\t\trevision2,\n\t\t\tgenId,\n\t\t\tcrossFieldTable,\n\t\t\trevisionMetadata,\n\t\t);\n\t\tconst composedNodeChange: NodeChangeset = {};\n\n\t\tif (composedFieldChanges.size > 0) {\n\t\t\tcomposedNodeChange.fieldChanges = composedFieldChanges;\n\t\t}\n\n\t\tif (nodeExistsConstraint !== undefined) {\n\t\t\tcomposedNodeChange.nodeExistsConstraint = nodeExistsConstraint;\n\t\t}\n\n\t\tconst key = composeCacheKeyFromNodeChangesets(change1, change2);\n\t\tcrossFieldTable.nodeCache.set(key, composedNodeChange);\n\t\treturn composedNodeChange;\n\t}\n\n\t/\n\t @param change - The change to invert.\n\t * @param isRollback - Whether the inverted change is meant to rollback a change on a branch as is the case when\n\t * performing a sandwich rebase.\n\t * @param repairStore - The store to query for repair data.\n\t /\n\tpublic invert(change: TaggedChange<ModularChangeset>, isRollback: boolean): ModularChangeset {\n\t\t// Return an empty inverse for changes with constraint violations\n\t\tif ((change.change.constraintViolationCount ?? 0) > 0) {\n\t\t\treturn makeModularChangeset();\n\t\t}\n\n\t\tconst idState: IdAllocationState = { maxId: change.change.maxId ?? -1 };\n\t\t// This idState is used for the whole of the IdAllocator's lifetime, which allows\n\t\t// this function to read the updated idState.maxId after more IDs are allocated.\n\t\t// TODO: add a getMax function to IdAllocator to make for a clearer contract.\n\t\tconst genId: IdAllocator = idAllocatorFromState(idState);\n\t\tconst crossFieldTable: InvertTable = {\n\t\t\t...newCrossFieldTable<FieldChange>(),\n\t\t\toriginalFieldToContext: new Map(),\n\t\t};\n\n\t\tconst { revInfos } = getRevInfoFromTaggedChanges([change]);\n\t\tconst revisionMetadata = revisionMetadataSourceFromInfo(revInfos);\n\n\t\tconst invertedFields = this.invertFieldMap(\n\t\t\ttagChange(change.change.fieldChanges, revisionFromTaggedChange(change)),\n\t\t\tisRollback,\n\t\t\tgenId,\n\t\t\tcrossFieldTable,\n\t\t\trevisionMetadata,\n\t\t);\n\n\t\tif (crossFieldTable.invalidatedFields.size > 0) {\n\t\t\tconst fieldsToUpdate = crossFieldTable.invalidatedFields;\n\t\t\tcrossFieldTable.invalidatedFields = new Set();\n\t\t\tfor (const fieldChange of fieldsToUpdate) {\n\t\t\t\tconst originalFieldChange = fieldChange.change;\n\t\t\t\tconst context = crossFieldTable.originalFieldToContext.get(fieldChange);\n\t\t\t\tassert(\n\t\t\t\t\tcontext !== undefined,\n\t\t\t\t\t0x851 / Should have context for every invalidated field /,\n\t\t\t\t);\n\t\t\t\tconst { invertedField, revision } = context;\n\n\t\t\t\tconst amendedChange = getChangeHandler(\n\t\t\t\t\tthis.fieldKinds,\n\t\t\t\t\tfieldChange.fieldKind,\n\t\t\t\t).rebaser.invert(\n\t\t\t\t\ttagChange(originalFieldChange, revision),\n\t\t\t\t\t(nodeChangeset) => nodeChangeset,\n\t\t\t\t\tisRollback,\n\t\t\t\t\tgenId,\n\t\t\t\t\tnewCrossFieldManager(crossFieldTable, fieldChange),\n\t\t\t\t\trevisionMetadata,\n\t\t\t\t);\n\t\t\t\tinvertedField.change = brand(amendedChange);\n\t\t\t}\n\t\t}\n\n\t\t// Rollback changesets destroy the nodes created by the change being rolled back.\n\t\tconst destroys = isRollback\n\t\t\t? invertBuilds(change.change.builds, change.revision)\n\t\t\t: undefined;\n\n\t\t// Destroys only occur in rollback changesets, which are never inverted.\n\t\tassert(\n\t\t\tchange.change.destroys === undefined,\n\t\t\t0x89a / Unexpected destroys in change to invert /,\n\t\t);\n\n\t\tconst revInfo = change.change.revisions;\n\t\treturn makeModularChangeset(\n\t\t\tinvertedFields,\n\t\t\tidState.maxId,\n\t\t\trevInfo === undefined\n\t\t\t\t? undefined\n\t\t\t\t: (isRollback\n\t\t\t\t\t\t? revInfo.map(({ revision }) => ({ revision, rollbackOf: revision }))\n\t\t\t\t\t\t: Array.from(revInfo)\n\t\t\t\t ).reverse(),\n\t\t\tchange.change.constraintViolationCount,\n\t\t\tundefined,\n\t\t\tdestroys,\n\t\t);\n\t}\n\n\tprivate invertFieldMap(\n\t\tchanges: TaggedChange<FieldChangeMap>,\n\t\tisRollback: boolean,\n\t\tgenId: IdAllocator,\n\t\tcrossFieldTable: InvertTable,\n\t\trevisionMetadata: RevisionMetadataSource,\n\t): FieldChangeMap {\n\t\tconst invertedFields: FieldChangeMap = new Map();\n\n\t\tfor (const [field, fieldChange] of changes.change) {\n\t\t\tconst { revision } = fieldChange.revision !== undefined ? fieldChange : changes;\n\n\t\t\tconst manager = newCrossFieldManager(crossFieldTable, fieldChange);\n\t\t\tconst invertedChange = getChangeHandler(\n\t\t\t\tthis.fieldKinds,\n\t\t\t\tfieldChange.fieldKind,\n\t\t\t).rebaser.invert(\n\t\t\t\t{ revision, change: fieldChange.change },\n\t\t\t\t(childChanges) =>\n\t\t\t\t\tthis.invertNodeChange(\n\t\t\t\t\t\t{ revision, change: childChanges },\n\t\t\t\t\t\tisRollback,\n\t\t\t\t\t\tgenId,\n\t\t\t\t\t\tcrossFieldTable,\n\t\t\t\t\t\trevisionMetadata,\n\t\t\t\t\t),\n\t\t\t\tisRollback,\n\t\t\t\tgenId,\n\t\t\t\tmanager,\n\t\t\t\trevisionMetadata,\n\t\t\t);\n\n\t\t\tconst invertedFieldChange: FieldChange = {\n\t\t\t\t...fieldChange,\n\t\t\t\tchange: brand(invertedChange),\n\t\t\t};\n\t\t\tinvertedFields.set(field, invertedFieldChange);\n\n\t\t\tcrossFieldTable.originalFieldToContext.set(fieldChange, {\n\t\t\t\tinvertedField: invertedFieldChange,\n\t\t\t\trevision,\n\t\t\t});\n\t\t}\n\n\t\treturn invertedFields;\n\t}\n\n\tprivate invertNodeChange(\n\t\tchange: TaggedChange<NodeChangeset>,\n\t\tisRollback: boolean,\n\t\tgenId: IdAllocator,\n\t\tcrossFieldTable: InvertTable,\n\t\trevisionMetadata: RevisionMetadataSource,\n\t): NodeChangeset {\n\t\tconst inverse: NodeChangeset = {};\n\n\t\tif (change.change.fieldChanges !== undefined) {\n\t\t\tinverse.fieldChanges = this.invertFieldMap(\n\t\t\t\t{ ...change, change: change.change.fieldChanges },\n\t\t\t\tisRollback,\n\t\t\t\tgenId,\n\t\t\t\tcrossFieldTable,\n\t\t\t\trevisionMetadata,\n\t\t\t);\n\t\t}\n\n\t\treturn inverse;\n\t}\n\n\tpublic rebase(\n\t\tchange: ModularChangeset,\n\t\tover: TaggedChange<ModularChangeset>,\n\t\trevisionMetadata: RevisionMetadataSource,\n\t): ModularChangeset {\n\t\tconst maxId = Math.max(change.maxId ?? -1, over.change.maxId ?? -1);\n\t\tconst idState: IdAllocationState = { maxId };\n\t\tconst genId: IdAllocator = idAllocatorFromState(idState);\n\t\tconst crossFieldTable: RebaseTable = {\n\t\t\t...newCrossFieldTable<FieldChange>(),\n\t\t\tfieldToContext: new Map(),\n\t\t\trebasedNodeCache: new Map(),\n\t\t};\n\n\t\tlet constraintState = newConstraintState(change.constraintViolationCount ?? 0);\n\n\t\tconst getBaseRevisions = () =>\n\t\t\trevisionInfoFromTaggedChange(over).map((info) => info.revision);\n\n\t\tconst rebaseMetadata = {\n\t\t\t...revisionMetadata,\n\t\t\tgetBaseRevisions,\n\t\t};\n\n\t\tconst rebasedFields = this.rebaseFieldMap(\n\t\t\tchange.fieldChanges,\n\t\t\ttagChange(over.change.fieldChanges, revisionFromTaggedChange(over)),\n\t\t\tgenId,\n\t\t\tcrossFieldTable,\n\t\t\t() => true,\n\t\t\trebaseMetadata,\n\t\t\tconstraintState,\n\t\t);\n\n\t\tif (crossFieldTable.invalidatedFields.size > 0) {\n\t\t\tconst fieldsToUpdate = crossFieldTable.invalidatedFields;\n\t\t\tcrossFieldTable.invalidatedFields = new Set();\n\t\t\tconstraintState = newConstraintState(change.constraintViolationCount ?? 0);\n\t\t\tfor (const field of fieldsToUpdate) {\n\t\t\t\t// TODO: Should we copy the context table out before this loop?\n\t\t\t\tconst context = crossFieldTable.fieldToContext.get(field);\n\t\t\t\tassert(context !== undefined, 0x852 / Every field should have a context /);\n\t\t\t\tconst {\n\t\t\t\t\tfieldKind,\n\t\t\t\t\tchange1: fieldChangeset,\n\t\t\t\t\tchange2: baseChangeset,\n\t\t\t\t} = this.normalizeFieldChanges(\n\t\t\t\t\tcontext.newChange,\n\t\t\t\t\tcontext.baseChange,\n\t\t\t\t\tgenId,\n\t\t\t\t\trevisionMetadata,\n\t\t\t\t);\n\n\t\t\t\tcontext.rebasedChange.change = fieldKind.changeHandler.rebaser.rebase(\n\t\t\t\t\tfieldChangeset,\n\t\t\t\t\ttagChange(baseChangeset, context.baseRevision),\n\t\t\t\t\t(curr, base, existenceState) => {\n\t\t\t\t\t\tconst key = curr ?? base;\n\t\t\t\t\t\tif (key === undefined) {\n\t\t\t\t\t\t\treturn undefined;\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tconst prior = crossFieldTable.rebasedNodeCache.get(key);\n\t\t\t\t\t\tif (prior !== undefined) {\n\t\t\t\t\t\t\treturn prior;\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t// This is needed when the first rebase pass results in node changes from the rebased\n\t\t\t\t\t\t// changeset being moved to a different location.\n\t\t\t\t\t\treturn this.rebaseNodeChange(\n\t\t\t\t\t\t\tcurr,\n\t\t\t\t\t\t\ttagChange(base, context.baseRevision),\n\t\t\t\t\t\t\tgenId,\n\t\t\t\t\t\t\tcrossFieldTable,\n\t\t\t\t\t\t\t() => true,\n\t\t\t\t\t\t\trebaseMetadata,\n\t\t\t\t\t\t\tconstraintState,\n\t\t\t\t\t\t\texistenceState,\n\t\t\t\t\t\t);\n\t\t\t\t\t},\n\t\t\t\t\tgenId,\n\t\t\t\t\tnewCrossFieldManager(crossFieldTable, field),\n\t\t\t\t\trebaseMetadata,\n\t\t\t\t);\n\t\t\t}\n\t\t}\n\n\t\treturn makeModularChangeset(\n\t\t\tthis.pruneFieldMap(rebasedFields),\n\t\t\tidState.maxId,\n\t\t\tchange.revisions,\n\t\t\tconstraintState.violationCount,\n\t\t\tchange.builds,\n\t\t\tchange.destroys,\n\t\t\tchange.refreshers,\n\t\t);\n\t}\n\n\tprivate rebaseFieldMap(\n\t\tchange: FieldChangeMap,\n\t\tover: TaggedChange<FieldChangeMap>,\n\t\tgenId: IdAllocator,\n\t\tcrossFieldTable: RebaseTable,\n\t\tfieldFilter: (baseChange: FieldChange, newChange: FieldChange \| undefined) => boolean,\n\t\trevisionMetadata: RebaseRevisionMetadata,\n\t\tconstraintState: ConstraintState,\n\t\texistenceState: NodeExistenceState = NodeExistenceState.Alive,\n\t): FieldChangeMap {\n\t\tconst rebasedFields: FieldChangeMap = new Map();\n\n\t\t// Rebase fields contained in the base changeset\n\t\tfor (const [field, baseChanges] of over.change) {\n\t\t\tif (!fieldFilter(baseChanges, change.get(field))) {\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tconst fieldChange: FieldChange = change.get(field) ?? {\n\t\t\t\tfieldKind: genericFieldKind.identifier,\n\t\t\t\tchange: brand(newGenericChangeset()),\n\t\t\t};\n\t\t\tconst {\n\t\t\t\tfieldKind,\n\t\t\t\tchange1: fieldChangeset,\n\t\t\t\tchange2: baseChangeset,\n\t\t\t} = this.normalizeFieldChanges(fieldChange, baseChanges, genId, revisionMetadata);\n\n\t\t\tconst { revision } = over;\n\t\t\tconst taggedBaseChange = { revision, change: baseChangeset };\n\n\t\t\tconst manager = newCrossFieldManager(crossFieldTable, fieldChange);\n\n\t\t\tconst rebaseChild = (\n\t\t\t\tchild: NodeChangeset \| undefined,\n\t\t\t\tbaseChild: NodeChangeset \| undefined,\n\t\t\t\tstateChange: NodeExistenceState \| undefined,\n\t\t\t) =>\n\t\t\t\tthis.rebaseNodeChange(\n\t\t\t\t\tchild,\n\t\t\t\t\t{ revision, change: baseChild },\n\t\t\t\t\tgenId,\n\t\t\t\t\tcrossFieldTable,\n\t\t\t\t\tfieldFilter,\n\t\t\t\t\trevisionMetadata,\n\t\t\t\t\tconstraintState,\n\t\t\t\t\tstateChange,\n\t\t\t\t);\n\n\t\t\tconst rebasedField = fieldKind.changeHandler.rebaser.rebase(\n\t\t\t\tfieldChangeset,\n\t\t\t\ttaggedBaseChange,\n\t\t\t\trebaseChild,\n\t\t\t\tgenId,\n\t\t\t\tmanager,\n\t\t\t\trevisionMetadata,\n\t\t\t);\n\n\t\t\tconst rebasedFieldChange: FieldChange = {\n\t\t\t\tfieldKind: fieldKind.identifier,\n\t\t\t\tchange: brand(rebasedField),\n\t\t\t};\n\n\t\t\trebasedFields.set(field, rebasedFieldChange);\n\n\t\t\tcrossFieldTable.fieldToContext.set(fieldChange, {\n\t\t\t\tbaseChange: baseChanges,\n\t\t\t\tbaseRevision: revision,\n\t\t\t\tnewChange: fieldChange,\n\t\t\t\trebasedChange: rebasedFieldChange,\n\t\t\t});\n\t\t}\n\n\t\t// Rebase the fields of the new changeset which don't have a corresponding base field.\n\t\tfor (const [field, fieldChange] of change) {\n\t\t\tif (!over.change?.has(field)) {\n\t\t\t\tconst baseChanges: FieldChange = {\n\t\t\t\t\tfieldKind: genericFieldKind.identifier,\n\t\t\t\t\tchange: brand(newGenericChangeset()),\n\t\t\t\t};\n\n\t\t\t\tconst {\n\t\t\t\t\tfieldKind,\n\t\t\t\t\tchange1: fieldChangeset,\n\t\t\t\t\tchange2: baseChangeset,\n\t\t\t\t} = this.normalizeFieldChanges(fieldChange, baseChanges, genId, revisionMetadata);\n\n\t\t\t\t// TODO: Don't we need to add an entry in the context table?\n\t\t\t\tconst manager = newCrossFieldManager(crossFieldTable, fieldChange);\n\t\t\t\tconst rebasedChangeset = fieldKind.changeHandler.rebaser.rebase(\n\t\t\t\t\tfieldChangeset,\n\t\t\t\t\ttagChange(baseChangeset, over.revision),\n\t\t\t\t\t(child, baseChild) => {\n\t\t\t\t\t\tassert(\n\t\t\t\t\t\t\tbaseChild === undefined,\n\t\t\t\t\t\t\t0x5b6 / This field should not have any base changes /,\n\t\t\t\t\t\t);\n\t\t\t\t\t\treturn this.rebaseNodeChange(\n\t\t\t\t\t\t\tchild,\n\t\t\t\t\t\t\ttagChange(undefined, over.revision),\n\t\t\t\t\t\t\tgenId,\n\t\t\t\t\t\t\tcrossFieldTable,\n\t\t\t\t\t\t\tfieldFilter,\n\t\t\t\t\t\t\trevisionMetadata,\n\t\t\t\t\t\t\tconstraintState,\n\t\t\t\t\t\t\texistenceState,\n\t\t\t\t\t\t);\n\t\t\t\t\t},\n\t\t\t\t\tgenId,\n\t\t\t\t\tmanager,\n\t\t\t\t\trevisionMetadata,\n\t\t\t\t\texistenceState,\n\t\t\t\t);\n\t\t\t\tconst rebasedFieldChange: FieldChange = {\n\t\t\t\t\tfieldKind: fieldKind.identifier,\n\t\t\t\t\tchange: brand(rebasedChangeset),\n\t\t\t\t};\n\t\t\t\trebasedFields.set(field, rebasedFieldChange);\n\t\t\t}\n\t\t}\n\n\t\treturn rebasedFields;\n\t}\n\n\tprivate rebaseNodeChange(\n\t\tchange: NodeChangeset \| undefined,\n\t\tover: TaggedChange<NodeChangeset \| undefined>,\n\t\tgenId: IdAllocator,\n\t\tcrossFieldTable: RebaseTable,\n\t\tfieldFilter: (baseChange: FieldChange, newChange: FieldChange \| undefined) => boolean,\n\t\trevisionMetadata: RebaseRevisionMetadata,\n\t\tconstraintState: ConstraintState,\n\t\texistenceState: NodeExistenceState = NodeExistenceState.Alive,\n\t): NodeChangeset \| undefined {\n\t\tconst key = change ?? over.change;\n\t\tif (key === undefined) {\n\t\t\treturn undefined;\n\t\t}\n\n\t\tconst baseMap: TaggedChange<FieldChangeMap> =\n\t\t\tover.change?.fieldChanges !== undefined\n\t\t\t\t? {\n\t\t\t\t\t\t...over,\n\t\t\t\t\t\tchange: over.change.fieldChanges,\n\t\t\t\t }\n\t\t\t\t: tagChange(new Map(), over.revision);\n\n\t\tconst fieldChanges = this.rebaseFieldMap(\n\t\t\tchange?.fieldChanges ?? new Map(),\n\t\t\tbaseMap,\n\t\t\tgenId,\n\t\t\tcrossFieldTable,\n\t\t\tfieldFilter,\n\t\t\trevisionMetadata,\n\t\t\tconstraintState,\n\t\t\texistenceState,\n\t\t);\n\n\t\tconst rebasedChange: NodeChangeset = {};\n\n\t\tif (fieldChanges.size > 0) {\n\t\t\trebasedChange.fieldChanges = fieldChanges;\n\t\t}\n\n\t\tif (change?.nodeExistsConstraint !== undefined) {\n\t\t\trebasedChange.nodeExistsConstraint = change.nodeExistsConstraint;\n\t\t}\n\n\t\t// If there's a node exists constraint and we removed or revived the node, update constraint state\n\t\tif (rebasedChange.nodeExistsConstraint !== undefined) {\n\t\t\tconst violatedAfter = existenceState === NodeExistenceState.Dead;\n\n\t\t\tif (rebasedChange.nodeExistsConstraint.violated !== violatedAfter) {\n\t\t\t\trebasedChange.nodeExistsConstraint = {\n\t\t\t\t\t...rebasedChange.nodeExistsConstraint,\n\t\t\t\t\tviolated: violatedAfter,\n\t\t\t\t};\n\t\t\t\tconstraintState.violationCount += violatedAfter ? 1 : -1;\n\t\t\t}\n\t\t}\n\n\t\tcrossFieldTable.rebasedNodeCache.set(key, rebasedChange);\n\t\treturn rebasedChange;\n\t}\n\n\tprivate pruneFieldMap(changeset: FieldChangeMap): FieldChangeMap \| undefined {\n\t\tconst prunedChangeset: FieldChangeMap = new Map();\n\t\tfor (const [field, fieldChange] of changeset) {\n\t\t\tconst handler = getChangeHandler(this.fieldKinds, fieldChange.fieldKind);\n\n\t\t\tconst prunedFieldChangeset = handler.rebaser.prune(fieldChange.change, (node) =>\n\t\t\t\tthis.pruneNodeChange(node),\n\t\t\t);\n\n\t\t\tif (!handler.isEmpty(prunedFieldChangeset)) {\n\t\t\t\tprunedChangeset.set(field, { ...fieldChange, change: brand(prunedFieldChangeset) });\n\t\t\t}\n\t\t}\n\n\t\treturn prunedChangeset.size > 0 ? prunedChangeset : undefined;\n\t}\n\n\tprivate pruneNodeChange(changeset: NodeChangeset): NodeChangeset \| undefined {\n\t\tconst prunedFields =\n\t\t\tchangeset.fieldChanges !== undefined\n\t\t\t\t? this.pruneFieldMap(changeset.fieldChanges)\n\t\t\t\t: undefined;\n\n\t\tconst prunedChange = { ...changeset, fieldChanges: prunedFields };\n\t\tif (prunedChange.fieldChanges === undefined) {\n\t\t\tdelete prunedChange.fieldChanges;\n\t\t}\n\n\t\treturn isEmptyNodeChangeset(prunedChange) ? undefined : prunedChange;\n\t}\n\n\tpublic buildEditor(changeReceiver: (change: ModularChangeset) => void): ModularEditBuilder {\n\t\treturn new ModularEditBuilder(this, changeReceiver);\n\t}\n}\n\nfunction composeBuildsDestroysAndRefreshers(changes: TaggedChange<ModularChangeset>[]) {\n\tconst allBuilds: ChangeAtomIdMap<TreeChunk> = new Map();\n\tconst allDestroys: ChangeAtomIdMap<number> = new Map();\n\tconst allRefreshers: ChangeAtomIdMap<TreeChunk> = new Map();\n\tfor (const taggedChange of changes) {\n\t\tconst revision = revisionFromTaggedChange(taggedChange);\n\t\tconst change = taggedChange.change;\n\t\tif (change.builds) {\n\t\t\tfor (const [revisionKey, innerMap] of change.builds) {\n\t\t\t\tconst setRevisionKey = revisionKey ?? revision;\n\t\t\t\tconst innerDstMap = getOrAddInMap(\n\t\t\t\t\tallBuilds,\n\t\t\t\t\tsetRevisionKey,\n\t\t\t\t\tnew Map<ChangesetLocalId, TreeChunk>(),\n\t\t\t\t);\n\t\t\t\tfor (const [id, chunk] of innerMap) {\n\t\t\t\t\t// Check for duplicate builds and prefer earlier ones.\n\t\t\t\t\t// This can happen in compositions of commits that needed to include repair data refreshers (e.g., undos):\n\t\t\t\t\t// In that case, it's possible for the refreshers to contain different trees because the latter\n\t\t\t\t\t// refresher may already reflect the changes made by the commit that includes the earlier\n\t\t\t\t\t// refresher. This composition includes the changes made by the commit that includes the\n\t\t\t\t\t// earlier refresher, so we need to include the build for the earlier refresher, otherwise\n\t\t\t\t\t// the produced changeset will build a tree one which those changes have already been applied\n\t\t\t\t\t// and also try to apply the changes again, effectively applying them twice.\n\t\t\t\t\t// Note that it would in principle be possible to adopt the later build and exclude from the\n\t\t\t\t\t// composition all the changes already reflected on the tree, but that is not something we\n\t\t\t\t\t// care to support at this time.\n\t\t\t\t\tif (!innerDstMap.has(id)) {\n\t\t\t\t\t\t// Check for earlier destroys that this build might cancel-out with.\n\t\t\t\t\t\tconst destroyCount = tryGetFromNestedMap(allDestroys, setRevisionKey, id);\n\t\t\t\t\t\tif (destroyCount === undefined) {\n\t\t\t\t\t\t\tinnerDstMap.set(id, chunk);\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tassert(\n\t\t\t\t\t\t\t\tdestroyCount === chunk.topLevelLength,\n\t\t\t\t\t\t\t\t0x89b / Expected build and destroy to have the same length /,\n\t\t\t\t\t\t\t);\n\t\t\t\t\t\t\tdeleteFromNestedMap(allDestroys, setRevisionKey, id);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (innerDstMap.size === 0) {\n\t\t\t\t\tallBuilds.delete(setRevisionKey);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (change.destroys !== undefined) {\n\t\t\tfor (const [revisionKey, innerMap] of change.destroys) {\n\t\t\t\tconst setRevisionKey = revisionKey ?? revision;\n\t\t\t\tconst innerDstMap = getOrAddInMap(\n\t\t\t\t\tallDestroys,\n\t\t\t\t\tsetRevisionKey,\n\t\t\t\t\tnew Map<ChangesetLocalId, number>(),\n\t\t\t\t);\n\t\t\t\tfor (const [id, count] of innerMap) {\n\t\t\t\t\t// Check for earlier builds that this destroy might cancel-out with.\n\t\t\t\t\tconst chunk = tryGetFromNestedMap(allBuilds, setRevisionKey, id);\n\t\t\t\t\tif (chunk === undefined) {\n\t\t\t\t\t\tinnerDstMap.set(id, count);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tassert(\n\t\t\t\t\t\t\tcount === chunk.topLevelLength,\n\t\t\t\t\t\t\t0x89c / Expected build and destroy to have the same length /,\n\t\t\t\t\t\t);\n\t\t\t\t\t\tdeleteFromNestedMap(allBuilds, setRevisionKey, id);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (innerDstMap.size === 0) {\n\t\t\t\t\tallDestroys.delete(setRevisionKey);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t// add all refreshers while preferring earlier ones\n\t\tif (change.refreshers) {\n\t\t\tpopulateNestedMap(change.refreshers, allRefreshers, false);\n\t\t}\n\t}\n\treturn { allBuilds, allDestroys, allRefreshers };\n}\n\nfunction invertBuilds(\n\tbuilds: ChangeAtomIdMap<TreeChunk> \| undefined,\n\tfallbackRevision: RevisionTag \| undefined,\n): ChangeAtomIdMap<number> \| undefined {\n\tif (builds !== undefined) {\n\t\tconst destroys: ChangeAtomIdMap<number> = new Map();\n\t\tfor (const [revision, innerBuildMap] of builds) {\n\t\t\tconst initializedRevision = revision ?? fallbackRevision;\n\t\t\tconst innerDestroyMap: Map<ChangesetLocalId, number> = new Map();\n\t\t\tfor (const [id, chunk] of innerBuildMap) {\n\t\t\t\tinnerDestroyMap.set(id, chunk.topLevelLength);\n\t\t\t}\n\t\t\tdestroys.set(initializedRevision, innerDestroyMap);\n\t\t}\n\t\treturn destroys;\n\t}\n\treturn undefined;\n}\n\n/\n Returns the set of removed roots that should be in memory for the given change to be applied.\n * A removed root is relevant if any of the following is true:\n * - It is being inserted\n * - It is being restored\n * - It is being edited\n * - The ID it is associated with is being changed\n \n May be conservative by returning more removed roots than strictly necessary.\n \n Will never return IDs for non-root trees, even if they are removed.\n \n @param change - The change to be applied.\n * @param fieldKinds - The field kinds to delegate to.\n /\nexport function relevantRemovedRoots(\n\t{ change, revision }: TaggedChange<ModularChangeset>,\n\tfieldKinds: ReadonlyMap<FieldKindIdentifier, FieldKindWithEditor>,\n): Iterable<DeltaDetachedNodeId> {\n\tyield* relevantRemovedRootsFromFields(change.fieldChanges, revision, fieldKinds);\n}\n\nfunction* relevantRemovedRootsFromFields(\n\tchange: FieldChangeMap,\n\trevision: RevisionTag \| undefined,\n\tfieldKinds: ReadonlyMap<FieldKindIdentifier, FieldKindWithEditor>,\n): Iterable<DeltaDetachedNodeId> {\n\tfor (const [_, fieldChange] of change) {\n\t\tconst fieldRevision = fieldChange.revision ?? revision;\n\t\tconst handler = getChangeHandler(fieldKinds, fieldChange.fieldKind);\n\t\tconst delegate = function* (node: NodeChangeset): Iterable<DeltaDetachedNodeId> {\n\t\t\tif (node.fieldChanges !== undefined) {\n\t\t\t\tyield* relevantRemovedRootsFromFields(node.fieldChanges, fieldRevision, fieldKinds);\n\t\t\t}\n\t\t};\n\t\tyield* handler.relevantRemovedRoots(tagChange(fieldChange.change, fieldRevision), delegate);\n\t}\n}\n\n/*\n Adds any refreshers missing from the provided change that are relevant to the change and\n * removes any refreshers from the provided change that are not relevant to the change.\n * This function enforces that all relevant removed roots have a corresponding build or refresher.\n \n @param change - The change that possibly has missing or superfluous refreshers. Not mutated by this function.\n * @param getDetachedNode - The function to retrieve a tree chunk from the corresponding detached node id.\n * @param removedRoots - The set of removed roots that should be in memory for the given change to be applied.\n * Can be retrieved by calling {@link relevantRemovedRoots}.\n /\nexport function updateRefreshers(\n\tchange: TaggedChange<ModularChangeset>,\n\tgetDetachedNode: (id: DeltaDetachedNodeId) => TreeChunk \| undefined,\n\tremovedRoots: Iterable<DeltaDetachedNodeId>,\n): ModularChangeset {\n\tconst refreshers: ChangeAtomIdMap<TreeChunk> = new Map();\n\n\tfor (const root of removedRoots) {\n\t\tif (change.change.builds !== undefined) {\n\t\t\t// if the root exists in the original builds map, it does not need to be added as a refresher\n\t\t\tconst original = tryGetFromNestedMap(change.change.builds, root.major, root.minor);\n\t\t\tif (original !== undefined) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t}\n\n\t\tconst node = getDetachedNode(root);\n\t\tassert(node !== undefined, 0x8cd / detached node should exist /);\n\t\tsetInNestedMap(refreshers, root.major, root.minor, node);\n\t}\n\n\tconst { fieldChanges, maxId, revisions, constraintViolationCount, builds, destroys } =\n\t\tchange.change;\n\treturn makeModularChangeset(\n\t\tfieldChanges,\n\t\tmaxId,\n\t\trevisions,\n\t\tconstraintViolationCount,\n\t\tbuilds,\n\t\tdestroys,\n\t\trefreshers,\n\t);\n}\n\n/\n @param change - The change to convert into a delta.\n * @param fieldKinds - The field kinds to delegate to.\n /\nexport function intoDelta(\n\ttaggedChange: TaggedChange<ModularChangeset>,\n\tfieldKinds: ReadonlyMap<FieldKindIdentifier, FieldKindWithEditor>,\n): DeltaRoot {\n\tconst change = taggedChange.change;\n\t// Return an empty delta for changes with constraint violations\n\tif ((change.constraintViolationCount ?? 0) > 0) {\n\t\treturn emptyDelta;\n\t}\n\n\tconst revision = revisionFromTaggedChange(taggedChange);\n\tconst idAllocator = MemoizedIdRangeAllocator.fromNextId();\n\tconst rootDelta: Mutable<DeltaRoot> = {};\n\tconst fieldDeltas = intoDeltaImpl(change.fieldChanges, revision, idAllocator, fieldKinds);\n\tif (fieldDeltas.size > 0) {\n\t\trootDelta.fields = fieldDeltas;\n\t}\n\tif (change.builds && change.builds.size > 0) {\n\t\trootDelta.build = copyDetachedNodes(change.builds, revision);\n\t}\n\tif (change.destroys !== undefined && change.destroys.size > 0) {\n\t\tconst destroys: DeltaDetachedNodeDestruction[] = [];\n\t\tforEachInNestedMap(change.destroys, (count, major, minor) => {\n\t\t\tdestroys.push({\n\t\t\t\tid: makeDetachedNodeId(major ?? revision, minor),\n\t\t\t\tcount,\n\t\t\t});\n\t\t});\n\t\trootDelta.destroy = destroys;\n\t}\n\tif (change.refreshers && change.refreshers.size > 0) {\n\t\trootDelta.refreshers = copyDetachedNodes(change.refreshers, revision);\n\t}\n\treturn rootDelta;\n}\n\nfunction copyDetachedNodes(detachedNodes: ChangeAtomIdMap<TreeChunk>, revision?: RevisionTag) {\n\tconst copiedDetachedNodes: DeltaDetachedNodeBuild[] = [];\n\tforEachInNestedMap(detachedNodes, (chunk, major, minor) => {\n\t\tif (chunk.topLevelLength > 0) {\n\t\t\tconst trees = mapCursorField(chunk.cursor(), (c) =>\n\t\t\t\tcursorForMapTreeNode(mapTreeFromCursor(c)),\n\t\t\t);\n\t\t\tcopiedDetachedNodes.push({\n\t\t\t\tid: makeDetachedNodeId(major ?? revision, minor),\n\t\t\t\ttrees,\n\t\t\t});\n\t\t}\n\t});\n\treturn copiedDetachedNodes.length > 0 ? copiedDetachedNodes : undefined;\n}\n\n/\n @param change - The change to convert into a delta.\n * @param repairStore - The store to query for repair data.\n * @param path - The path of the node being altered by the change as defined by the input context.\n * Undefined for the root and for nodes that do not exist in the input context.\n /\nfunction intoDeltaImpl(\n\tchange: FieldChangeMap,\n\trevision: RevisionTag \| undefined,\n\tidAllocator: MemoizedIdRangeAllocator,\n\tfieldKinds: ReadonlyMap<FieldKindIdentifier, FieldKindWithEditor>,\n): Map<FieldKey, DeltaFieldChanges> {\n\tconst delta: Map<FieldKey, DeltaFieldChanges> = new Map();\n\tfor (const [field, fieldChange] of change) {\n\t\tconst fieldRevision = fieldChange.revision ?? revision;\n\t\tconst deltaField = getChangeHandler(fieldKinds, fieldChange.fieldKind).intoDelta(\n\t\t\ttagChange(fieldChange.change, fieldRevision),\n\t\t\t(childChange): DeltaFieldMap =>\n\t\t\t\tdeltaFromNodeChange(tagChange(childChange, fieldRevision), idAllocator, fieldKinds),\n\t\t\tidAllocator,\n\t\t);\n\t\tif (!isEmptyFieldChanges(deltaField)) {\n\t\t\tdelta.set(field, deltaField);\n\t\t}\n\t}\n\treturn delta;\n}\n\nfunction deltaFromNodeChange(\n\t{ change, revision }: TaggedChange<NodeChangeset>,\n\tidAllocator: MemoizedIdRangeAllocator,\n\tfieldKinds: ReadonlyMap<FieldKindIdentifier, FieldKindWithEditor>,\n): DeltaFieldMap {\n\tif (change.fieldChanges !== undefined) {\n\t\treturn intoDeltaImpl(change.fieldChanges, revision, idAllocator, fieldKinds);\n\t}\n\t// TODO: update the API to allow undefined to be returned here\n\treturn new Map();\n}\n\n/\n @internal\n * @param revInfos - This should describe all revisions in the rebase path, even if not part of the current base changeset.\n * For example, when rebasing change B from a local branch [A, B, C] over a branch [X, Y], the `revInfos` must include\n * the changes [A⁻¹ X, Y, A'] for each rebase step of B.\n * @param baseRevisions - The set of revisions in the changeset being rebased over.\n * For example, when rebasing change B from a local branch [A, B, C] over a branch [X, Y], the `baseRevisions` must include\n * revisions [A⁻¹ X, Y, A'] if rebasing over the composition of all those changes, or\n * revision [A⁻¹] for the first rebase, then [X], etc. if rebasing over edits individually.\n * @returns - RebaseRevisionMetadata to be passed to `FieldChangeRebaser.rebase`\n /\nexport function rebaseRevisionMetadataFromInfo(\n\trevInfos: readonly RevisionInfo[],\n\tbaseRevisions: (RevisionTag \| undefined)[],\n): RebaseRevisionMetadata {\n\tconst filteredRevisions: RevisionTag[] = [];\n\tfor (const revision of baseRevisions) {\n\t\tif (revision !== undefined) {\n\t\t\tfilteredRevisions.push(revision);\n\t\t}\n\t}\n\n\tconst getBaseRevisions = () => filteredRevisions;\n\treturn {\n\t\t...revisionMetadataSourceFromInfo(revInfos),\n\t\tgetBaseRevisions,\n\t};\n}\n\nfunction isEmptyNodeChangeset(change: NodeChangeset): boolean {\n\treturn change.fieldChanges === undefined && change.nodeExistsConstraint === undefined;\n}\n\nexport function getFieldKind(\n\tfieldKinds: ReadonlyMap<FieldKindIdentifier, FlexFieldKind>,\n\tkind: FieldKindIdentifier,\n): FieldKindWithEditor {\n\tif (kind === genericFieldKind.identifier) {\n\t\treturn genericFieldKind;\n\t}\n\tconst fieldKind = fieldKinds.get(kind);\n\tassert(fieldKind !== undefined, 0x3ad /* Unknown field kind /);\n\treturn withEditor(fieldKind);\n}\n\nexport function getChangeHandler(\n\tfieldKinds: ReadonlyMap<FieldKindIdentifier, FlexFieldKind>,\n\tkind: FieldKindIdentifier,\n): FieldChangeHandler<unknown> {\n\treturn getFieldKind(fieldKinds, kind).changeHandler;\n}\n\n// TODO: TFieldData could instead just be a numeric ID generated by the CrossFieldTable\n// The CrossFieldTable could have a generic field ID to context table\ninterface CrossFieldTable<TFieldData> {\n\tsrcTable: CrossFieldMap<unknown>;\n\tdstTable: CrossFieldMap<unknown>;\n\tsrcDependents: CrossFieldMap<TFieldData>;\n\tdstDependents: CrossFieldMap<TFieldData>;\n\tinvalidatedFields: Set<TFieldData>;\n}\n\ninterface InvertTable extends CrossFieldTable<FieldChange> {\n\toriginalFieldToContext: Map<FieldChange, InvertContext>;\n}\n\ninterface InvertContext {\n\tinvertedField: FieldChange;\n\trevision: RevisionTag \| undefined;\n}\n\ninterface RebaseTable extends CrossFieldTable<FieldChange> {\n\t/\n\t Maps from the FieldChange key used for the CrossFieldTable (which is the FieldChange being rebased)\n\t * to context for the field.\n\t /\n\tfieldToContext: Map<FieldChange, RebaseFieldContext>;\n\t/\n\t This map caches the output of a prior rebasing computation for a node, keyed on that computation's input.\n\t * The input for such a computation is characterized by a pair of node changesets:\n\t * - The node changeset from the input changeset being rebased\n\t * - The corresponding node changeset from the changeset being rebased over.\n\t \n\t Either of these may be undefined so we adopt the following convention:\n\t * - If the node changeset from the changeset being rebased is defined, then we use that as the key\n\t * - Otherwise, if the node changeset from the changeset being rebased over is defined, then we use that as the key\n\t * - Otherwise, we don't cache the output (which will be undefined anyway).\n\t \n\t This map is needed once we switch from the initial pass (which generates a new changeset) to the second pass which\n\t * performs surgery on the changeset generated in the first pass: we don't want to re-run the rebasing of nested\n\t * changes. Instead we want to keep using the objects generated in the first pass and mutate them where needed.\n\t /\n\trebasedNodeCache: Map<NodeChangeset, NodeChangeset>;\n}\n\ninterface RebaseFieldContext {\n\tbaseChange: FieldChange;\n\tbaseRevision: RevisionTag \| undefined;\n\tnewChange: FieldChange;\n\trebasedChange: FieldChange;\n}\n\nfunction newComposeTable(): ComposeTable {\n\treturn {\n\t\t...newCrossFieldTable<FieldChange>(),\n\t\tfieldToContext: new Map(),\n\t\tnodeCache: new Map(),\n\t};\n}\n\ninterface ComposeTable extends CrossFieldTable<FieldChange> {\n\t/\n\t Maps from an input changeset for a field (from change1 if it has one, from change2 otherwise) to the context for that field.\n\t /\n\tfieldToContext: Map<FieldChange, ComposeFieldContext>;\n\n\t/\n\t Maps from an input changeset for a node (from change2 if it has one) to the cached composition of the changesets for that node.\n\t /\n\tnodeCache: Map<NodeChangeset, NodeChangeset>;\n}\n\ninterface ComposeFieldContext {\n\tchange1: TaggedChange<FieldChangeset>;\n\tchange2: TaggedChange<FieldChangeset>;\n\tcomposedChange: FieldChange;\n}\n\nfunction newCrossFieldTable<T>(): CrossFieldTable<T> {\n\treturn {\n\t\tsrcTable: new Map(),\n\t\tdstTable: new Map(),\n\t\tsrcDependents: new Map(),\n\t\tdstDependents: new Map(),\n\t\tinvalidatedFields: new Set(),\n\t};\n}\n\nfunction composeCacheKeyFromNodeChangesets(\n\tchange1: NodeChangeset \| undefined,\n\tchange2: NodeChangeset \| undefined,\n): NodeChangeset {\n\t// Note that it is important that the key is `change2 ?? change1` and not `change1 ?? change2`.\n\t// If the first changeset moves this node, the change handler may not have seen the second changeset's\n\t// changes for this node on its first pass.\n\t// In that case we will have cached an entry the call to `compose(change1, undefined)`, and we must make sure\n\t// not to reuse the cached entry if a subsequent pass calls `compose(change1, change2)`.\n\treturn change2 ?? change1 ?? fail(\"Should not compose two undefined changesets\");\n}\n\n/\n @internal\n /\ninterface ConstraintState {\n\tviolationCount: number;\n}\n\nfunction newConstraintState(violationCount: number): ConstraintState {\n\treturn {\n\t\tviolationCount,\n\t};\n}\n\ninterface CrossFieldManagerI<T> extends CrossFieldManager {\n\ttable: CrossFieldTable<T>;\n}\n\nfunction newCrossFieldManager<T>(\n\tcrossFieldTable: CrossFieldTable<T>,\n\tcurrentFieldKey: T,\n\tallowInval = true,\n): CrossFieldManagerI<T> {\n\tconst getMap = (target: CrossFieldTarget) =>\n\t\ttarget === CrossFieldTarget.Source ? crossFieldTable.srcTable : crossFieldTable.dstTable;\n\n\tconst getDependents = (target: CrossFieldTarget) =>\n\t\ttarget === CrossFieldTarget.Source\n\t\t\t? crossFieldTable.srcDependents\n\t\t\t: crossFieldTable.dstDependents;\n\n\tconst manager = {\n\t\ttable: crossFieldTable,\n\n\t\tset: (\n\t\t\ttarget: CrossFieldTarget,\n\t\t\trevision: RevisionTag \| undefined,\n\t\t\tid: ChangesetLocalId,\n\t\t\tcount: number,\n\t\t\tnewValue: unknown,\n\t\t\tinvalidateDependents: boolean,\n\t\t) => {\n\t\t\tif (invalidateDependents && allowInval) {\n\t\t\t\tconst lastChangedId = (id as number) + count - 1;\n\t\t\t\tlet firstId = id;\n\t\t\t\twhile (firstId <= lastChangedId) {\n\t\t\t\t\tconst dependentEntry = getFirstFromCrossFieldMap(\n\t\t\t\t\t\tgetDependents(target),\n\t\t\t\t\t\trevision,\n\t\t\t\t\t\tfirstId,\n\t\t\t\t\t\tlastChangedId - firstId + 1,\n\t\t\t\t\t);\n\t\t\t\t\tif (dependentEntry.value !== undefined) {\n\t\t\t\t\t\tcrossFieldTable.invalidatedFields.add(dependentEntry.value);\n\t\t\t\t\t}\n\n\t\t\t\t\tfirstId = brand(firstId + dependentEntry.length);\n\t\t\t\t}\n\t\t\t}\n\t\t\tsetInCrossFieldMap(getMap(target), revision, id, count, newValue);\n\t\t},\n\n\t\tget: (\n\t\t\ttarget: CrossFieldTarget,\n\t\t\trevision: RevisionTag \| undefined,\n\t\t\tid: ChangesetLocalId,\n\t\t\tcount: number,\n\t\t\taddDependency: boolean,\n\t\t) => {\n\t\t\tif (addDependency) {\n\t\t\t\t// We assume that if there is already an entry for this ID it is because\n\t\t\t\t// a field handler has called compose on the same node multiple times.\n\t\t\t\t// In this case we only want to update the latest version, so we overwrite the dependency.\n\t\t\t\tsetInCrossFieldMap(getDependents(target), revision, id, count, currentFieldKey);\n\t\t\t}\n\t\t\treturn getFirstFromCrossFieldMap(getMap(target), revision, id, count);\n\t\t},\n\t};\n\n\treturn manager;\n}\n\nfunction makeModularChangeset(\n\tchanges: FieldChangeMap \| undefined = undefined,\n\tmaxId: number = -1,\n\trevisions: readonly RevisionInfo[] \| undefined = undefined,\n\tconstraintViolationCount: number \| undefined = undefined,\n\tbuilds?: ChangeAtomIdMap<TreeChunk>,\n\tdestroys?: ChangeAtomIdMap<number>,\n\trefreshers?: ChangeAtomIdMap<TreeChunk>,\n): ModularChangeset {\n\tconst changeset: Mutable<ModularChangeset> = { fieldChanges: changes ?? new Map() };\n\tif (revisions !== undefined && revisions.length > 0) {\n\t\tchangeset.revisions = revisions;\n\t}\n\tif (maxId >= 0) {\n\t\tchangeset.maxId = brand(maxId);\n\t}\n\tif (constraintViolationCount !== undefined && constraintViolationCount > 0) {\n\t\tchangeset.constraintViolationCount = constraintViolationCount;\n\t}\n\tif (builds !== undefined && builds.size > 0) {\n\t\tchangeset.builds = builds;\n\t}\n\tif (destroys !== undefined && destroys.size > 0) {\n\t\tchangeset.destroys = destroys;\n\t}\n\tif (refreshers !== undefined && refreshers.size > 0) {\n\t\tchangeset.refreshers = refreshers;\n\t}\n\treturn changeset;\n}\n\nexport class ModularEditBuilder extends EditBuilder<ModularChangeset> {\n\tprivate transactionDepth: number = 0;\n\tprivate idAllocator: IdAllocator;\n\n\tpublic constructor(\n\t\tfamily: ChangeFamily<ChangeFamilyEditor, ModularChangeset>,\n\t\tchangeReceiver: (change: ModularChangeset) => void,\n\t) {\n\t\tsuper(family, changeReceiver);\n\t\tthis.idAllocator = idAllocatorFromMaxId();\n\t}\n\n\tpublic override enterTransaction(): void {\n\t\tthis.transactionDepth += 1;\n\t\tif (this.transactionDepth === 1) {\n\t\t\tthis.idAllocator = idAllocatorFromMaxId();\n\t\t}\n\t}\n\n\tpublic override exitTransaction(): void {\n\t\tassert(this.transactionDepth > 0, 0x5b9 / Cannot exit inexistent transaction /);\n\t\tthis.transactionDepth -= 1;\n\t\tif (this.transactionDepth === 0) {\n\t\t\tthis.idAllocator = idAllocatorFromMaxId();\n\t\t}\n\t}\n\n\t/\n\t @param firstId - The ID to associate with the first node\n\t * @param content - The node(s) to build. Can be in either Field or Node mode.\n\t * @returns A description of the edit that can be passed to `submitChanges`.\n\t /\n\tpublic buildTrees(\n\t\tfirstId: ChangesetLocalId,\n\t\tcontent: ITreeCursorSynchronous,\n\t): GlobalEditDescription {\n\t\tif (content.mode === CursorLocationType.Fields && content.getFieldLength() === 0) {\n\t\t\treturn { type: \"global\" };\n\t\t}\n\t\tconst builds: ChangeAtomIdMap<TreeChunk> = new Map();\n\t\tconst innerMap = new Map();\n\t\tbuilds.set(undefined, innerMap);\n\t\tconst chunk =\n\t\t\tcontent.mode === CursorLocationType.Fields\n\t\t\t\t? chunkFieldSingle(content, defaultChunkPolicy)\n\t\t\t\t: chunkTree(content, defaultChunkPolicy);\n\t\tinnerMap.set(firstId, chunk);\n\n\t\treturn {\n\t\t\ttype: \"global\",\n\t\t\tbuilds,\n\t\t};\n\t}\n\n\t/\n\t Adds a change to the edit builder\n\t * @param field - the field which is being edited\n\t * @param fieldKind - the kind of the field\n\t * @param change - the change to the field\n\t * @param maxId - the highest `ChangesetLocalId` used in this change\n\t /\n\tpublic submitChange(\n\t\tfield: FieldUpPath,\n\t\tfieldKind: FieldKindIdentifier,\n\t\tchange: FieldChangeset,\n\t\tmaxId: ChangesetLocalId = brand(-1),\n\t): void {\n\t\tconst modularChange = this.buildChange(field, fieldKind, change, maxId);\n\t\tthis.applyChange(modularChange);\n\t}\n\n\t/\n\t Adds a change to the edit builder\n\t * @param field - the field which is being edited\n\t * @param fieldKind - the kind of the field\n\t * @param change - the change to the field\n\t * @param maxId - the highest `ChangesetLocalId` used in this change\n\t /\n\tpublic buildChange(\n\t\tfield: FieldUpPath,\n\t\tfieldKind: FieldKindIdentifier,\n\t\tchange: FieldChangeset,\n\t\tmaxId: ChangesetLocalId = brand(-1),\n\t): ModularChangeset {\n\t\tconst changeMap = this.buildChangeMap(field, fieldKind, change);\n\t\treturn makeModularChangeset(changeMap, maxId);\n\t}\n\n\tpublic submitChanges(changes: EditDescription[], maxId: ChangesetLocalId = brand(-1)) {\n\t\tconst modularChange = this.buildChanges(changes, maxId);\n\t\tthis.applyChange(modularChange);\n\t}\n\n\tpublic buildChanges(\n\t\tchanges: EditDescription[],\n\t\tmaxId: ChangesetLocalId = brand(-1),\n\t): ModularChangeset {\n\t\tconst changeMaps = changes.map((change) =>\n\t\t\tmakeAnonChange(\n\t\t\t\tchange.type === \"global\"\n\t\t\t\t\t? makeModularChangeset(\n\t\t\t\t\t\t\tundefined,\n\t\t\t\t\t\t\tundefined,\n\t\t\t\t\t\t\tundefined,\n\t\t\t\t\t\t\tundefined,\n\t\t\t\t\t\t\tchange.builds,\n\t\t\t\t\t )\n\t\t\t\t\t: makeModularChangeset(\n\t\t\t\t\t\t\tthis.buildChangeMap(change.field, change.fieldKind, change.change),\n\t\t\t\t\t ),\n\t\t\t),\n\t\t);\n\t\tconst composedChange = this.changeFamily.rebaser.compose(changeMaps);\n\t\tif (maxId >= 0) {\n\t\t\tcomposedChange.maxId = maxId;\n\t\t}\n\t\treturn composedChange;\n\t}\n\n\tpublic generateId(count?: number): ChangesetLocalId {\n\t\treturn brand(this.idAllocator.allocate(count));\n\t}\n\n\tprivate buildChangeMap(\n\t\tfield: FieldUpPath,\n\t\tfieldKind: FieldKindIdentifier,\n\t\tchange: FieldChangeset,\n\t): FieldChangeMap {\n\t\tlet fieldChangeMap: FieldChangeMap = new Map([[field.field, { fieldKind, change }]]);\n\n\t\tlet remainingPath = field.parent;\n\t\twhile (remainingPath !== undefined) {\n\t\t\tconst nodeChange: NodeChangeset = { fieldChanges: fieldChangeMap };\n\t\t\tconst fieldChange = genericFieldKind.changeHandler.editor.buildChildChange(\n\t\t\t\tremainingPath.parentIndex,\n\t\t\t\tnodeChange,\n\t\t\t);\n\t\t\tfieldChangeMap = new Map([\n\t\t\t\t[\n\t\t\t\t\tremainingPath.parentField,\n\t\t\t\t\t{ fieldKind: genericFieldKind.identifier, change: brand(fieldChange) },\n\t\t\t\t],\n\t\t\t]);\n\t\t\tremainingPath = remainingPath.parent;\n\t\t}\n\n\t\treturn fieldChangeMap;\n\t}\n\n\tpublic addNodeExistsConstraint(path: UpPath): void {\n\t\tconst nodeChange: NodeChangeset = {\n\t\t\tnodeExistsConstraint: { violated: false },\n\t\t};\n\t\tconst fieldChange = genericFieldKind.changeHandler.editor.buildChildChange(\n\t\t\tpath.parentIndex,\n\t\t\tnodeChange,\n\t\t);\n\t\tthis.submitChange(\n\t\t\t{ parent: path.parent, field: path.parentField },\n\t\t\tgenericFieldKind.identifier,\n\t\t\tbrand(fieldChange),\n\t\t);\n\t}\n}\n\n/\n @internal\n /\nexport interface FieldEditDescription {\n\ttype: \"field\";\n\tfield: FieldUpPath;\n\tfieldKind: FieldKindIdentifier;\n\tchange: FieldChangeset;\n}\n\n/\n @internal\n /\nexport interface GlobalEditDescription {\n\ttype: \"global\";\n\tbuilds?: ChangeAtomIdMap<TreeChunk>;\n}\n\n/\n @internal\n */\nexport type EditDescription = FieldEditDescription \| GlobalEditDescription;\n\nfunction getRevInfoFromTaggedChanges(changes: TaggedChange<ModularChangeset>[]): {\n\trevInfos: RevisionInfo[];\n\tmaxId: ChangesetLocalId;\n} {\n\tlet maxId = -1;\n\tconst revInfos: RevisionInfo[] = [];\n\tfor (const taggedChange of changes) {\n\t\tconst change = taggedChange.change;\n\t\tmaxId = Math.max(change.maxId ?? -1, maxId);\n\t\trevInfos.push(...revisionInfoFromTaggedChange(taggedChange));\n\t}\n\n\tconst revisions = new Set<RevisionTag>();\n\tconst rolledBackRevisions: RevisionTag[] = [];\n\tfor (const info of revInfos) {\n\t\trevisions.add(info.revision);\n\t\tif (info.rollbackOf !== undefined) {\n\t\t\trolledBackRevisions.push(info.rollbackOf);\n\t\t}\n\t}\n\n\trolledBackRevisions.reverse();\n\tfor (const revision of rolledBackRevisions) {\n\t\tif (!revisions.has(revision)) {\n\t\t\trevInfos.push({ revision });\n\t\t}\n\t}\n\n\treturn { maxId: brand(maxId), revInfos };\n}\n\nfunction revisionInfoFromTaggedChange(\n\ttaggedChange: TaggedChange<ModularChangeset>,\n): RevisionInfo[] {\n\tconst revInfos: RevisionInfo[] = [];\n\tif (taggedChange.change.revisions !== undefined) {\n\t\trevInfos.push(...taggedChange.change.revisions);\n\t} else if (taggedChange.revision !== undefined) {\n\t\tconst info: Mutable<RevisionInfo> = { revision: taggedChange.revision };\n\t\tif (taggedChange.rollbackOf !== undefined) {\n\t\t\tinfo.rollbackOf = taggedChange.rollbackOf;\n\t\t}\n\t\trevInfos.push(info);\n\t}\n\treturn revInfos;\n}\n\nfunction revisionFromTaggedChange(change: TaggedChange<ModularChangeset>): RevisionTag \| undefined {\n\treturn change.revision ?? revisionFromRevInfos(change.change.revisions);\n}\n\nfunction revisionFromRevInfos(\n\trevInfos: undefined \| readonly RevisionInfo[],\n): RevisionTag \| undefined {\n\tif (revInfos === undefined \|\| revInfos.length !== 1) {\n\t\treturn undefined;\n\t}\n\treturn revInfos[0].revision;\n}\n"]}
1	+ {"version":3,"file":"modularChangeFamily.js","sourceRoot":"","sources":["../../../src/feature-libraries/modular-schema/modularChangeFamily.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,kEAA6D;AAC7D,gEAAkD;AAGlD,kDAiC6B;AAC7B,kDAiB6B;AAC7B,yDAKoC;AACpC,0DAA8E;AAC9E,gFAA0E;AAE1E,iEAMgC;AAChC,mEAIiC;AACjC,qEAA2E;AAC3E,+DAAoG;AAWpG;;;GAGG;AACH,MAAa,mBAAmB;IAO/B,YACC,UAAiE,EACjD,MAA6D;QAA7D,WAAM,GAAN,MAAM,CAAuD;QAE7E,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;IAC9B,CAAC;IAED,IAAW,OAAO;QACjB,OAAO,IAAI,CAAC;IACb,CAAC;IAED;;;;;;OAMG;IACK,qBAAqB,CAC5B,OAAgC,EAChC,OAAgC,EAChC,KAAkB,EAClB,gBAAwC;QAMxC,mEAAmE;QACnE,MAAM,IAAI,GACT,OAAO,KAAK,SAAS,IAAI,OAAO,CAAC,SAAS,KAAK,sCAAgB,CAAC,UAAU;YACzE,CAAC,CAAC,OAAO,CAAC,SAAS;YACnB,CAAC,CAAC,OAAO,EAAE,SAAS,IAAI,sCAAgB,CAAC,UAAU,CAAC;QAEtD,IAAI,IAAI,KAAK,sCAAgB,CAAC,UAAU,EAAE;YACzC,8BAA8B;YAC9B,OAAO;gBACN,SAAS,EAAE,sCAAgB;gBAC3B,OAAO,EAAE,OAAO,EAAE,MAAM;gBACxB,OAAO,EAAE,OAAO,EAAE,MAAM;aACxB,CAAC;SACF;QACD,MAAM,SAAS,GAAG,YAAY,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;QACtD,MAAM,OAAO,GAAG,SAAS,CAAC,aAAa,CAAC;QACxC,MAAM,iBAAiB,GAAG,IAAI,CAAC,oBAAoB,CAClD,OAAO,EACP,OAAO,EACP,KAAK,EACL,gBAAgB,CAChB,CAAC;QACF,MAAM,iBAAiB,GAAG,IAAI,CAAC,oBAAoB,CAClD,OAAO,EACP,OAAO,EACP,KAAK,EACL,gBAAgB,CAChB,CAAC;QACF,OAAO,EAAE,SAAS,EAAE,OAAO,EAAE,iBAAiB,EAAE,OAAO,EAAE,iBAAiB,EAAE,CAAC;IAC9E,CAAC;IAEO,oBAAoB,CAC3B,WAAoC,EACpC,OAA8B,EAC9B,KAAkB,EAClB,gBAAwC;QAExC,IAAI,WAAW,KAAK,SAAS,EAAE;YAC9B,OAAO,SAAS,CAAC;SACjB;QAED,IAAI,WAAW,CAAC,SAAS,KAAK,sCAAgB,CAAC,UAAU,EAAE;YAC1D,OAAO,WAAW,CAAC,MAAM,CAAC;SAC1B;QAED,mDAAmD;QACnD,MAAM,aAAa,GAAG,WAAW,CAAC,MAAqC,CAAC;QACxE,MAAM,eAAe,GAAG,IAAA,0CAAoB,EAC3C,aAAa,EACb,OAAO,EACP,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE;YAClB,IAAA,iBAAM,EACL,MAAM,KAAK,SAAS,IAAI,MAAM,KAAK,SAAS,EAC5C,KAAK,CAAC,+CAA+C,CACrD,CAAC;YAEF,OAAO,MAAM,IAAI,MAAM,IAAI,IAAA,eAAI,EAAC,2CAA2C,CAAC,CAAC;QAC9E,CAAC,EACD,KAAK,EACL,gBAAgB,CACE,CAAC;QAEpB,OAAO,eAAe,CAAC;IACxB,CAAC;IAEM,OAAO,CAAC,OAAyC;QACvD,MAAM,aAAa,GAAG,OAAO,CAAC,MAAM,CACnC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,wBAAwB,IAAI,CAAC,CAAC,KAAK,CAAC,CAC/D,CAAC;QAEF,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,GAAG,2BAA2B,CAAC,OAAO,CAAC,CAAC;QACjE,MAAM,OAAO,GAAsB,EAAE,KAAK,EAAE,CAAC;QAE7C,OAAO,aAAa,CAAC,MAAM,CAC1B,CAAC,OAAO,EAAE,OAAO,EAAE,EAAE,CACpB,IAAA,yBAAc,EAAC,IAAI,CAAC,WAAW,CAAC,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC,EACtE,IAAA,yBAAc,EAAC,EAAE,YAAY,EAAE,IAAI,GAAG,EAAE,EAAE,WAAW,EAAE,IAAI,GAAG,EAAE,EAAE,CAAC,CACnE,CAAC,MAAM,CAAC;IACV,CAAC;IAEO,WAAW,CAClB,OAAuC,EACvC,OAAuC,EACvC,QAAwB,EACxB,OAA0B;QAE1B,MAAM,KAAK,GAAgB,IAAA,+BAAoB,EAAC,OAAO,CAAC,CAAC;QACzD,MAAM,gBAAgB,GAA2B,IAAA,yCAA8B,EAAC,QAAQ,CAAC,CAAC;QAE1F,MAAM,eAAe,GAAG,eAAe,EAAE,CAAC;QAE1C,MAAM,cAAc,GAAG,IAAI,CAAC,gBAAgB,CAC3C,OAAO,CAAC,MAAM,CAAC,YAAY,EAC3B,OAAO,CAAC,QAAQ,EAChB,OAAO,CAAC,MAAM,CAAC,YAAY,EAC3B,OAAO,CAAC,QAAQ,EAChB,KAAK,EACL,eAAe,EACf,gBAAgB,CAChB,CAAC;QAEF,MAAM,mBAAmB,GAAmC,IAAI,GAAG,EAAE,CAAC;QACtE,KAAK,MAAM,CAAC,SAAS,EAAE,SAAS,CAAC,IAAI,eAAe,CAAC,WAAW,EAAE;YACjE,IAAI,CAAC,gBAAgB,CACpB,OAAO,CAAC,MAAM,CAAC,WAAW,EAC1B,OAAO,CAAC,MAAM,CAAC,WAAW,EAC1B,mBAAmB,EACnB,SAAS,EAAE,MAAM,EACjB,SAAS,EAAE,QAAQ,EACnB,SAAS,EAAE,MAAM,EACjB,SAAS,EAAE,QAAQ,EACnB,KAAK,EACL,eAAe,EACf,gBAAgB,CAChB,CAAC;SACF;QAED,eAAe,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;QAEvC,OAAO,eAAe,CAAC,iBAAiB,CAAC,IAAI,GAAG,CAAC,EAAE;YAClD,MAAM,cAAc,GAAG,eAAe,CAAC,iBAAiB,CAAC;YACzD,eAAe,CAAC,iBAAiB,GAAG,IAAI,GAAG,EAAE,CAAC;YAC9C,KAAK,MAAM,WAAW,IAAI,cAAc,EAAE;gBACzC,MAAM,OAAO,GAAG,eAAe,CAAC,cAAc,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;gBAChE,IAAA,iBAAM,EACL,OAAO,KAAK,SAAS,EACrB,KAAK,CAAC,qDAAqD,CAC3D,CAAC;gBACF,MAAM,EAAE,OAAO,EAAE,YAAY,EAAE,OAAO,EAAE,YAAY,EAAE,cAAc,EAAE,GAAG,OAAO,CAAC;gBAEjF,MAAM,OAAO,GAAG,gBAAgB,CAAC,IAAI,CAAC,UAAU,EAAE,WAAW,CAAC,SAAS,CAAC,CAAC,OAAO,CAAC;gBACjF,MAAM,YAAY,GAAG,CACpB,MAA0B,EAC1B,MAA0B,EACjB,EAAE;oBACX,IACC,MAAM,KAAK,SAAS;wBACpB,CAAC,IAAA,4BAAiB,EAAC,eAAe,CAAC,OAAO,EAAE,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,OAAO,CAAC,EAC3E;wBACD,MAAM,SAAS,GACd,MAAM,KAAK,SAAS;4BACnB,CAAC,CAAC,IAAA,oBAAS,EAAC,MAAM,EAAE,YAAY,CAAC,QAAQ,CAAC;4BAC1C,CAAC,CAAC,SAAS,CAAC;wBAEd,MAAM,SAAS,GACd,MAAM,KAAK,SAAS;4BACnB,CAAC,CAAC,IAAA,oBAAS,EAAC,MAAM,EAAE,YAAY,CAAC,QAAQ,CAAC;4BAC1C,CAAC,CAAC,SAAS,CAAC;wBAEd,eAAe,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC,CAAC;wBACzD,IAAI,MAAM,KAAK,SAAS,IAAI,MAAM,KAAK,SAAS,EAAE;4BACjD,IAAA,yBAAc,EACb,eAAe,CAAC,OAAO,EACvB,MAAM,CAAC,QAAQ,EACf,MAAM,CAAC,OAAO,CACd,CAAC;yBACF;qBACD;oBACD,OAAO,CACN,IAAA,0BAAe,EAAC,MAAM,EAAE,YAAY,CAAC,QAAQ,CAAC;wBAC9C,IAAA,0BAAe,EAAC,MAAM,EAAE,YAAY,CAAC,QAAQ,CAAC;wBAC9C,IAAA,eAAI,EAAC,wCAAwC,CAAC,CAC9C,CAAC;gBACH,CAAC,CAAC;gBAEF,MAAM,aAAa,GAAG,OAAO,CAAC,OAAO,CACpC,YAAY,EACZ,YAAY,EACZ,YAAY,EACZ,KAAK,EACL,oBAAoB,CAAC,eAAe,EAAE,WAAW,EAAE,KAAK,CAAC,EACzD,gBAAgB,CAChB,CAAC;gBACF,cAAc,CAAC,MAAM,GAAG,IAAA,gBAAK,EAAC,aAAa,CAAC,CAAC;gBAE7C,sCAAsC;gBACtC,KAAK,MAAM,CAAC,SAAS,EAAE,SAAS,CAAC,IAAI,eAAe,CAAC,WAAW,EAAE;oBACjE,IAAI,CAAC,gBAAgB,CACpB,OAAO,CAAC,MAAM,CAAC,WAAW,EAC1B,OAAO,CAAC,MAAM,CAAC,WAAW,EAC1B,mBAAmB,EACnB,SAAS,EAAE,MAAM,EACjB,SAAS,EAAE,QAAQ,EACnB,SAAS,EAAE,MAAM,EACjB,SAAS,EAAE,QAAQ,EACnB,KAAK,EACL,eAAe,EACf,gBAAgB,CAChB,CAAC;iBACF;gBAED,eAAe,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;aACvC;SACD;QAED,MAAM,EAAE,SAAS,EAAE,WAAW,EAAE,aAAa,EAAE,GAAG,kCAAkC,CAAC;YACpF,OAAO;YACP,OAAO;SACP,CAAC,CAAC;QAEH,OAAO,oBAAoB,CAC1B,IAAI,CAAC,aAAa,CAAC,cAAc,EAAE,mBAAmB,CAAC,EACvD,mBAAmB,EACnB,OAAO,CAAC,KAAK,EACb,QAAQ,EACR,SAAS,EACT,SAAS,EACT,WAAW,EACX,aAAa,CACb,CAAC;IACH,CAAC;IAEO,gBAAgB,CACvB,OAAmC,EACnC,SAAkC,EAClC,OAAmC,EACnC,SAAkC,EAClC,KAAkB,EAClB,eAA6B,EAC7B,gBAAwC;QAExC,MAAM,cAAc,GAAmB,IAAI,GAAG,EAAE,CAAC;QACjD,MAAM,MAAM,GAAG,IAAI,GAAG,EAAY,CAAC;QACnC,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE;YAC1C,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;SAClB;QAED,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE;YAC1C,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;SAClB;QAED,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE;YAC3B,MAAM,YAAY,GAAG,OAAO,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC;YACzC,MAAM,YAAY,GAAG,OAAO,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC;YAEzC,MAAM,EACL,SAAS,EACT,OAAO,EAAE,sBAAsB,EAC/B,OAAO,EAAE,sBAAsB,GAC/B,GAAG,IAAI,CAAC,qBAAqB,CAAC,YAAY,EAAE,YAAY,EAAE,KAAK,EAAE,gBAAgB,CAAC,CAAC;YAEpF,MAAM,OAAO,GAAG,oBAAoB,CAAC,eAAe,EAAE,YAAY,IAAI,YAAY,CAAC,CAAC;YACpF,MAAM,aAAa,GAAG,IAAA,oBAAS,EAC9B,sBAAsB,IAAI,SAAS,CAAC,aAAa,CAAC,WAAW,EAAE,EAC/D,YAAY,EAAE,QAAQ,IAAI,SAAS,CACnC,CAAC;YACF,MAAM,aAAa,GAAG,IAAA,oBAAS,EAC9B,sBAAsB,IAAI,SAAS,CAAC,aAAa,CAAC,WAAW,EAAE,EAC/D,YAAY,EAAE,QAAQ,IAAI,SAAS,CACnC,CAAC;YAEF,MAAM,cAAc,GAAG,SAAS,CAAC,aAAa,CAAC,OAAO,CAAC,OAAO,CAC7D,aAAa,EACb,aAAa,EACb,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE;gBAClB,MAAM,SAAS,GACd,MAAM,KAAK,SAAS;oBACnB,CAAC,CAAC,IAAA,oBAAS,EAAC,MAAM,EAAE,aAAa,CAAC,QAAQ,CAAC;oBAC3C,CAAC,CAAC,SAAS,CAAC;gBAEd,MAAM,SAAS,GACd,MAAM,KAAK,SAAS;oBACnB,CAAC,CAAC,IAAA,oBAAS,EAAC,MAAM,EAAE,aAAa,CAAC,QAAQ,CAAC;oBAC3C,CAAC,CAAC,SAAS,CAAC;gBAEd,eAAe,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC,CAAC;gBACzD,IAAI,MAAM,KAAK,SAAS,EAAE;oBACzB,IAAA,yBAAc,EAAC,eAAe,CAAC,OAAO,EAAE,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,OAAO,CAAC,CAAC;iBACzE;gBACD,OAAO,CACN,IAAA,0BAAe,EAAC,MAAM,EAAE,SAAS,CAAC;oBAClC,IAAA,0BAAe,EAAC,MAAM,EAAE,SAAS,CAAC;oBAClC,IAAA,eAAI,EAAC,wCAAwC,CAAC,CAC9C,CAAC;YACH,CAAC,EACD,KAAK,EACL,OAAO,EACP,gBAAgB,CAChB,CAAC;YAEF,MAAM,aAAa,GAAgB;gBAClC,SAAS,EAAE,SAAS,CAAC,UAAU;gBAC/B,MAAM,EAAE,IAAA,gBAAK,EAAC,cAAc,CAAC;aAC7B,CAAC;YAEF,MAAM,QAAQ,GACb,YAAY,IAAI,YAAY,IAAI,IAAA,eAAI,EAAC,wCAAwC,CAAC,CAAC;YAEhF,eAAe,CAAC,cAAc,CAAC,GAAG,CAAC,QAAQ,EAAE;gBAC5C,OAAO,EAAE,aAAa;gBACtB,OAAO,EAAE,aAAa;gBACtB,cAAc,EAAE,aAAa;aAC7B,CAAC,CAAC;YAEH,mEAAmE;YACnE,cAAc,CAAC,GAAG,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC;SACzC;QAED,OAAO,cAAc,CAAC;IACvB,CAAC;IAEO,gBAAgB,CACvB,YAA4C,EAC5C,YAA4C,EAC5C,mBAAmD,EACnD,GAAuB,EACvB,SAAkC,EAClC,GAAuB,EACvB,SAAkC,EAClC,WAAwB,EACxB,eAA6B,EAC7B,gBAAwC;QAExC,MAAM,cAAc,GACnB,GAAG,KAAK,SAAS;YAChB,CAAC,CAAC,IAAA,8BAAmB,EAAC,YAAY,EAAE,GAAG,CAAC,QAAQ,EAAE,GAAG,CAAC,OAAO,CAAC;gBAC5D,IAAA,eAAI,EAAC,iBAAiB,CAAC;YACzB,CAAC,CAAC,EAAE,CAAC;QAEP,MAAM,cAAc,GACnB,GAAG,KAAK,SAAS;YAChB,CAAC,CAAC,IAAA,8BAAmB,EAAC,YAAY,EAAE,GAAG,CAAC,QAAQ,EAAE,GAAG,CAAC,OAAO,CAAC;gBAC5D,IAAA,eAAI,EAAC,iBAAiB,CAAC;YACzB,CAAC,CAAC,EAAE,CAAC;QAEP,MAAM,qBAAqB,GAAG,IAAI,CAAC,kBAAkB,CACpD,cAAc,EACd,SAAS,EACT,cAAc,EACd,SAAS,EACT,WAAW,EACX,eAAe,EACf,gBAAgB,CAChB,CAAC;QAEF,MAAM,MAAM,GACX,IAAA,0BAAe,EAAC,GAAG,EAAE,SAAS,CAAC;YAC/B,IAAA,0BAAe,EAAC,GAAG,EAAE,SAAS,CAAC;YAC/B,IAAA,eAAI,EAAC,2CAA2C,CAAC,CAAC;QACnD,IAAA,yBAAc,EAAC,mBAAmB,EAAE,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,OAAO,EAAE,qBAAqB,CAAC,CAAC;IAC7F,CAAC;IAEO,kBAAkB,CACzB,OAAkC,EAClC,SAAkC,EAClC,OAAkC,EAClC,SAAkC,EAClC,KAAkB,EAClB,eAA6B,EAC7B,gBAAwC;QAExC,MAAM,oBAAoB,GAAG,OAAO,EAAE,oBAAoB,IAAI,OAAO,EAAE,oBAAoB,CAAC;QAE5F,MAAM,oBAAoB,GAAG,IAAI,CAAC,gBAAgB,CACjD,OAAO,EAAE,YAAY,EACrB,SAAS,EACT,OAAO,EAAE,YAAY,EACrB,SAAS,EACT,KAAK,EACL,eAAe,EACf,gBAAgB,CAChB,CAAC;QACF,MAAM,kBAAkB,GAAkB,EAAE,CAAC;QAE7C,IAAI,oBAAoB,CAAC,IAAI,GAAG,CAAC,EAAE;YAClC,kBAAkB,CAAC,YAAY,GAAG,oBAAoB,CAAC;SACvD;QAED,IAAI,oBAAoB,KAAK,SAAS,EAAE;YACvC,kBAAkB,CAAC,oBAAoB,GAAG,oBAAoB,CAAC;SAC/D;QAED,OAAO,kBAAkB,CAAC;IAC3B,CAAC;IAED;;;;;OAKG;IACI,MAAM,CAAC,MAAsC,EAAE,UAAmB;QACxE,iEAAiE;QACjE,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,wBAAwB,IAAI,CAAC,CAAC,GAAG,CAAC,EAAE;YACtD,OAAO,oBAAoB,EAAE,CAAC;SAC9B;QAED,MAAM,OAAO,GAAsB,EAAE,KAAK,EAAE,MAAM,CAAC,MAAM,CAAC,KAAK,IAAI,CAAC,CAAC,EAAE,CAAC;QACxE,iFAAiF;QACjF,gFAAgF;QAChF,6EAA6E;QAC7E,MAAM,KAAK,GAAgB,IAAA,+BAAoB,EAAC,OAAO,CAAC,CAAC;QACzD,MAAM,eAAe,GAAgB;YACpC,GAAG,kBAAkB,EAAe;YACpC,sBAAsB,EAAE,IAAI,GAAG,EAAE;SACjC,CAAC;QAEF,MAAM,EAAE,QAAQ,EAAE,GAAG,2BAA2B,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;QAC3D,MAAM,gBAAgB,GAAG,IAAA,yCAA8B,EAAC,QAAQ,CAAC,CAAC;QAElE,MAAM,cAAc,GAAG,IAAI,CAAC,cAAc,CACzC,IAAA,oBAAS,EAAC,MAAM,CAAC,MAAM,CAAC,YAAY,EAAE,wBAAwB,CAAC,MAAM,CAAC,CAAC,EACvE,UAAU,EACV,KAAK,EACL,eAAe,EACf,gBAAgB,CAChB,CAAC;QAEF,MAAM,aAAa,GAAmC,IAAI,GAAG,EAAE,CAAC;QAChE,IAAA,6BAAkB,EAAC,MAAM,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC,aAAa,EAAE,QAAQ,EAAE,OAAO,EAAE,EAAE;YAClF,IAAA,yBAAc,EACb,aAAa,EACb,QAAQ,EACR,OAAO,EACP,IAAI,CAAC,gBAAgB;YACpB,4DAA4D;YAC5D,IAAA,oBAAS,EAAC,aAAa,EAAE,MAAM,CAAC,QAAQ,CAAC,EACzC,UAAU,EACV,KAAK,EACL,eAAe,EACf,gBAAgB,CAChB,CACD,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,IAAI,eAAe,CAAC,iBAAiB,CAAC,IAAI,GAAG,CAAC,EAAE;YAC/C,MAAM,cAAc,GAAG,eAAe,CAAC,iBAAiB,CAAC;YACzD,eAAe,CAAC,iBAAiB,GAAG,IAAI,GAAG,EAAE,CAAC;YAC9C,KAAK,MAAM,WAAW,IAAI,cAAc,EAAE;gBACzC,MAAM,mBAAmB,GAAG,WAAW,CAAC,MAAM,CAAC;gBAC/C,MAAM,OAAO,GAAG,eAAe,CAAC,sBAAsB,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;gBACxE,IAAA,iBAAM,EACL,OAAO,KAAK,SAAS,EACrB,KAAK,CAAC,qDAAqD,CAC3D,CAAC;gBACF,MAAM,EAAE,aAAa,EAAE,QAAQ,EAAE,GAAG,OAAO,CAAC;gBAE5C,MAAM,aAAa,GAAG,gBAAgB,CACrC,IAAI,CAAC,UAAU,EACf,WAAW,CAAC,SAAS,CACrB,CAAC,OAAO,CAAC,MAAM,CACf,IAAA,oBAAS,EAAC,mBAAmB,EAAE,QAAQ,CAAC,EACxC,UAAU,EACV,KAAK,EACL,oBAAoB,CAAC,eAAe,EAAE,WAAW,CAAC,EAClD,gBAAgB,CAChB,CAAC;gBACF,aAAa,CAAC,MAAM,GAAG,IAAA,gBAAK,EAAC,aAAa,CAAC,CAAC;aAC5C;SACD;QAED,iFAAiF;QACjF,MAAM,QAAQ,GAAG,UAAU;YAC1B,CAAC,CAAC,YAAY,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,QAAQ,CAAC;YACrD,CAAC,CAAC,SAAS,CAAC;QAEb,wEAAwE;QACxE,IAAA,iBAAM,EACL,MAAM,CAAC,MAAM,CAAC,QAAQ,KAAK,SAAS,EACpC,KAAK,CAAC,6CAA6C,CACnD,CAAC;QAEF,MAAM,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC;QACxC,OAAO,oBAAoB,CAC1B,cAAc,EACd,aAAa,EACb,OAAO,CAAC,KAAK,EACb,OAAO,KAAK,SAAS;YACpB,CAAC,CAAC,SAAS;YACX,CAAC,CAAC,CAAC,UAAU;gBACX,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,UAAU,EAAE,QAAQ,EAAE,CAAC,CAAC;gBACrE,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CACpB,CAAC,OAAO,EAAE,EACd,MAAM,CAAC,MAAM,CAAC,wBAAwB,EACtC,SAAS,EACT,QAAQ,CACR,CAAC;IACH,CAAC;IAEO,cAAc,CACrB,OAAqC,EACrC,UAAmB,EACnB,KAAkB,EAClB,eAA4B,EAC5B,gBAAwC;QAExC,MAAM,cAAc,GAAmB,IAAI,GAAG,EAAE,CAAC;QAEjD,KAAK,MAAM,CAAC,KAAK,EAAE,WAAW,CAAC,IAAI,OAAO,CAAC,MAAM,EAAE;YAClD,MAAM,EAAE,QAAQ,EAAE,GAAG,WAAW,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,OAAO,CAAC;YAEhF,MAAM,OAAO,GAAG,oBAAoB,CAAC,eAAe,EAAE,WAAW,CAAC,CAAC;YACnE,MAAM,cAAc,GAAG,gBAAgB,CACtC,IAAI,CAAC,UAAU,EACf,WAAW,CAAC,SAAS,CACrB,CAAC,OAAO,CAAC,MAAM,CACf,EAAE,QAAQ,EAAE,MAAM,EAAE,WAAW,CAAC,MAAM,EAAE,EACxC,UAAU,EACV,KAAK,EACL,OAAO,EACP,gBAAgB,CAChB,CAAC;YAEF,MAAM,mBAAmB,GAAgB;gBACxC,GAAG,WAAW;gBACd,MAAM,EAAE,IAAA,gBAAK,EAAC,cAAc,CAAC;aAC7B,CAAC;YACF,cAAc,CAAC,GAAG,CAAC,KAAK,EAAE,mBAAmB,CAAC,CAAC;YAE/C,eAAe,CAAC,sBAAsB,CAAC,GAAG,CAAC,WAAW,EAAE;gBACvD,aAAa,EAAE,mBAAmB;gBAClC,QAAQ;aACR,CAAC,CAAC;SACH;QAED,OAAO,cAAc,CAAC;IACvB,CAAC;IAEO,gBAAgB,CACvB,MAAmC,EACnC,UAAmB,EACnB,KAAkB,EAClB,eAA4B,EAC5B,gBAAwC;QAExC,MAAM,OAAO,GAAkB,EAAE,CAAC;QAElC,IAAI,MAAM,CAAC,MAAM,CAAC,YAAY,KAAK,SAAS,EAAE;YAC7C,OAAO,CAAC,YAAY,GAAG,IAAI,CAAC,cAAc,CACzC,EAAE,GAAG,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,YAAY,EAAE,EACjD,UAAU,EACV,KAAK,EACL,eAAe,EACf,gBAAgB,CAChB,CAAC;SACF;QAED,OAAO,OAAO,CAAC;IAChB,CAAC;IAEM,MAAM,CACZ,MAAwB,EACxB,IAAoC,EACpC,gBAAwC;QAExC,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC;QACpE,MAAM,OAAO,GAAsB,EAAE,KAAK,EAAE,CAAC;QAC7C,MAAM,KAAK,GAAgB,IAAA,+BAAoB,EAAC,OAAO,CAAC,CAAC;QACzD,MAAM,eAAe,GAAgB;YACpC,GAAG,kBAAkB,EAAe;YACpC,cAAc,EAAE,IAAI,GAAG,EAAE;YACzB,gBAAgB,EAAE,IAAI,GAAG,EAAE;YAC3B,WAAW,EAAE,EAAE;SACf,CAAC;QAEF,IAAI,eAAe,GAAG,kBAAkB,CAAC,MAAM,CAAC,wBAAwB,IAAI,CAAC,CAAC,CAAC;QAE/E,MAAM,gBAAgB,GAAG,GAAG,EAAE,CAC7B,4BAA4B,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAEjE,MAAM,cAAc,GAAG;YACtB,GAAG,gBAAgB;YACnB,gBAAgB;SAChB,CAAC;QAEF,MAAM,aAAa,GAAG,IAAI,CAAC,cAAc,CACxC,MAAM,CAAC,YAAY,EACnB,IAAA,oBAAS,EAAC,IAAI,CAAC,MAAM,CAAC,YAAY,EAAE,wBAAwB,CAAC,IAAI,CAAC,CAAC,EACnE,KAAK,EACL,eAAe,EACf,GAAG,EAAE,CAAC,IAAI,EACV,cAAc,EACd,eAAe,CACf,CAAC;QAEF,MAAM,YAAY,GAAmC,IAAI,GAAG,EAAE,CAAC;QAC/D,KAAK,MAAM,CAAC,KAAK,EAAE,YAAY,EAAE,cAAc,CAAC,IAAI,eAAe,CAAC,WAAW,EAAE;YAChF,MAAM,aAAa,GAClB,KAAK,KAAK,SAAS;gBAClB,CAAC,CAAC,IAAA,8BAAmB,EAAC,MAAM,CAAC,WAAW,EAAE,KAAK,CAAC,QAAQ,EAAE,KAAK,CAAC,OAAO,CAAC;gBACxE,CAAC,CAAC,SAAS,CAAC;YAEd,MAAM,oBAAoB,GACzB,YAAY,KAAK,SAAS;gBACzB,CAAC,CAAC,IAAA,oBAAS,EACT,IAAA,8BAAmB,EAClB,IAAI,CAAC,MAAM,CAAC,WAAW,EACvB,YAAY,CAAC,MAAM,CAAC,QAAQ,EAC5B,YAAY,CAAC,MAAM,CAAC,OAAO,CAC3B,IAAI,IAAA,eAAI,EAAC,iBAAiB,CAAC,EAC5B,YAAY,CAAC,QAAQ,CACpB;gBACH,CAAC,CAAC,IAAA,yBAAc,EAAC,EAAE,CAAC,CAAC;YAEvB,MAAM,WAAW,GAAG,IAAI,CAAC,gBAAgB,CACxC,aAAa,EACb,oBAAoB,EACpB,KAAK,EACL,eAAe,EACf,GAAG,EAAE,CAAC,IAAI,EACV,cAAc,EACd,eAAe,EACf,cAAc,CACd,CAAC;YAEF,IAAI,WAAW,KAAK,SAAS,EAAE;gBAC9B,MAAM,MAAM,GACX,KAAK;oBACL,IAAA,uBAAY,EACX,YAAY,EAAE,MAAM,IAAI,IAAA,eAAI,EAAC,mCAAmC,CAAC,EACjE,YAAY,EAAE,QAAQ,CACtB,CAAC;gBAEH,IAAA,yBAAc,EAAC,YAAY,EAAE,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,OAAO,EAAE,WAAW,CAAC,CAAC;aAC3E;SACD;QAED,IAAI,eAAe,CAAC,iBAAiB,CAAC,IAAI,GAAG,CAAC,EAAE;YAC/C,MAAM,cAAc,GAAG,eAAe,CAAC,iBAAiB,CAAC;YACzD,eAAe,CAAC,iBAAiB,GAAG,IAAI,GAAG,EAAE,CAAC;YAC9C,eAAe,GAAG,kBAAkB,CAAC,MAAM,CAAC,wBAAwB,IAAI,CAAC,CAAC,CAAC;YAC3E,KAAK,MAAM,KAAK,IAAI,cAAc,EAAE;gBACnC,+DAA+D;gBAC/D,MAAM,OAAO,GAAG,eAAe,CAAC,cAAc,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;gBAC1D,IAAA,iBAAM,EAAC,OAAO,KAAK,SAAS,EAAE,KAAK,CAAC,uCAAuC,CAAC,CAAC;gBAC7E,MAAM,EACL,SAAS,EACT,OAAO,EAAE,cAAc,EACvB,OAAO,EAAE,aAAa,GACtB,GAAG,IAAI,CAAC,qBAAqB,CAC7B,OAAO,CAAC,SAAS,EACjB,OAAO,CAAC,UAAU,EAClB,KAAK,EACL,gBAAgB,CAChB,CAAC;gBAEF,OAAO,CAAC,aAAa,CAAC,MAAM,GAAG,SAAS,CAAC,aAAa,CAAC,OAAO,CAAC,MAAM,CACpE,cAAc,EACd,IAAA,oBAAS,EAAC,aAAa,EAAE,OAAO,CAAC,YAAY,CAAC,EAC9C,CAAC,IAAI,EAAE,IAAI,EAAE,cAAc,EAAE,EAAE,CAAC,IAAI,EACpC,KAAK,EACL,oBAAoB,CAAC,eAAe,EAAE,KAAK,CAAC,EAC5C,cAAc,CACd,CAAC;aACF;SACD;QAED,OAAO,oBAAoB,CAC1B,IAAI,CAAC,aAAa,CAAC,aAAa,EAAE,YAAY,CAAC,EAC/C,YAAY,EACZ,OAAO,CAAC,KAAK,EACb,MAAM,CAAC,SAAS,EAChB,eAAe,CAAC,cAAc,EAC9B,MAAM,CAAC,MAAM,EACb,MAAM,CAAC,QAAQ,EACf,MAAM,CAAC,UAAU,CACjB,CAAC;IACH,CAAC;IAEO,cAAc,CACrB,MAAsB,EACtB,IAAkC,EAClC,KAAkB,EAClB,eAA4B,EAC5B,WAAqF,EACrF,gBAAwC,EACxC,eAAgC,EAChC,iBAAqC,0CAAkB,CAAC,KAAK;QAE7D,MAAM,aAAa,GAAmB,IAAI,GAAG,EAAE,CAAC;QAEhD,gDAAgD;QAChD,KAAK,MAAM,CAAC,KAAK,EAAE,WAAW,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE;YAC/C,IAAI,CAAC,WAAW,CAAC,WAAW,EAAE,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE;gBACjD,SAAS;aACT;YAED,MAAM,WAAW,GAAgB,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI;gBACrD,SAAS,EAAE,sCAAgB,CAAC,UAAU;gBACtC,MAAM,EAAE,IAAA,gBAAK,EAAC,IAAA,yCAAmB,GAAE,CAAC;aACpC,CAAC;YACF,MAAM,EACL,SAAS,EACT,OAAO,EAAE,cAAc,EACvB,OAAO,EAAE,aAAa,GACtB,GAAG,IAAI,CAAC,qBAAqB,CAAC,WAAW,EAAE,WAAW,EAAE,KAAK,EAAE,gBAAgB,CAAC,CAAC;YAElF,MAAM,EAAE,QAAQ,EAAE,GAAG,IAAI,CAAC;YAC1B,MAAM,gBAAgB,GAAG,EAAE,QAAQ,EAAE,MAAM,EAAE,aAAa,EAAE,CAAC;YAE7D,MAAM,OAAO,GAAG,oBAAoB,CAAC,eAAe,EAAE,WAAW,CAAC,CAAC;YAEnE,MAAM,WAAW,GAAG,CACnB,KAAyB,EACzB,SAA6B,EAC7B,WAA2C,EAC1C,EAAE;gBACH,MAAM,UAAU,GACf,SAAS,KAAK,SAAS,CAAC,CAAC,CAAC,IAAA,oBAAS,EAAC,SAAS,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;gBAE3E,eAAe,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,UAAU,EAAE,WAAW,CAAC,CAAC,CAAC;gBACnE,OAAO,CACN,KAAK;oBACL,gGAAgG;oBAChG,oFAAoF;oBACpF,iGAAiG;oBACjG,yCAAyC;oBACzC,IAAA,uBAAY,EACX,SAAS,IAAI,IAAA,eAAI,EAAC,wCAAwC,CAAC,EAC3D,IAAI,CAAC,QAAQ,CACb,CACD,CAAC;YACH,CAAC,CAAC;YAEF,MAAM,YAAY,GAAG,SAAS,CAAC,aAAa,CAAC,OAAO,CAAC,MAAM,CAC1D,cAAc,EACd,gBAAgB,EAChB,WAAW,EACX,KAAK,EACL,OAAO,EACP,gBAAgB,CAChB,CAAC;YAEF,MAAM,kBAAkB,GAAgB;gBACvC,SAAS,EAAE,SAAS,CAAC,UAAU;gBAC/B,MAAM,EAAE,IAAA,gBAAK,EAAC,YAAY,CAAC;aAC3B,CAAC;YAEF,aAAa,CAAC,GAAG,CAAC,KAAK,EAAE,kBAAkB,CAAC,CAAC;YAE7C,eAAe,CAAC,cAAc,CAAC,GAAG,CAAC,WAAW,EAAE;gBAC/C,UAAU,EAAE,WAAW;gBACvB,YAAY,EAAE,QAAQ;gBACtB,SAAS,EAAE,WAAW;gBACtB,aAAa,EAAE,kBAAkB;aACjC,CAAC,CAAC;SACH;QAED,sFAAsF;QACtF,KAAK,MAAM,CAAC,KAAK,EAAE,WAAW,CAAC,IAAI,MAAM,EAAE;YAC1C,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,KAAK,CAAC,EAAE;gBAC7B,MAAM,WAAW,GAAgB;oBAChC,SAAS,EAAE,sCAAgB,CAAC,UAAU;oBACtC,MAAM,EAAE,IAAA,gBAAK,EAAC,IAAA,yCAAmB,GAAE,CAAC;iBACpC,CAAC;gBAEF,MAAM,EACL,SAAS,EACT,OAAO,EAAE,cAAc,EACvB,OAAO,EAAE,aAAa,GACtB,GAAG,IAAI,CAAC,qBAAqB,CAAC,WAAW,EAAE,WAAW,EAAE,KAAK,EAAE,gBAAgB,CAAC,CAAC;gBAElF,4DAA4D;gBAC5D,MAAM,OAAO,GAAG,oBAAoB,CAAC,eAAe,EAAE,WAAW,CAAC,CAAC;gBACnE,MAAM,gBAAgB,GAAG,SAAS,CAAC,aAAa,CAAC,OAAO,CAAC,MAAM,CAC9D,cAAc,EACd,IAAA,oBAAS,EAAC,aAAa,EAAE,IAAI,CAAC,QAAQ,CAAC,EACvC,CAAC,KAAK,EAAE,SAAS,EAAE,EAAE;oBACpB,IAAA,iBAAM,EACL,SAAS,KAAK,SAAS,EACvB,KAAK,CAAC,iDAAiD,CACvD,CAAC;oBAEF,eAAe,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,SAAS,EAAE,cAAc,CAAC,CAAC,CAAC;oBACrE,OAAO,KAAK,CAAC;gBACd,CAAC,EACD,KAAK,EACL,OAAO,EACP,gBAAgB,EAChB,cAAc,CACd,CAAC;gBACF,MAAM,kBAAkB,GAAgB;oBACvC,SAAS,EAAE,SAAS,CAAC,UAAU;oBAC/B,MAAM,EAAE,IAAA,gBAAK,EAAC,gBAAgB,CAAC;iBAC/B,CAAC;gBACF,aAAa,CAAC,GAAG,CAAC,KAAK,EAAE,kBAAkB,CAAC,CAAC;aAC7C;SACD;QAED,OAAO,aAAa,CAAC;IACtB,CAAC;IAEO,gBAAgB,CACvB,MAAiC,EACjC,IAA6C,EAC7C,KAAkB,EAClB,eAA4B,EAC5B,WAAqF,EACrF,gBAAwC,EACxC,eAAgC,EAChC,iBAAqC,0CAAkB,CAAC,KAAK;QAE7D,MAAM,GAAG,GAAG,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC;QAClC,IAAI,GAAG,KAAK,SAAS,EAAE;YACtB,OAAO,SAAS,CAAC;SACjB;QAED,MAAM,OAAO,GACZ,IAAI,CAAC,MAAM,EAAE,YAAY,KAAK,SAAS;YACtC,CAAC,CAAC;gBACA,GAAG,IAAI;gBACP,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,YAAY;aAC/B;YACH,CAAC,CAAC,IAAA,oBAAS,EAAC,IAAI,GAAG,EAAE,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;QAExC,MAAM,YAAY,GAAG,IAAI,CAAC,cAAc,CACvC,MAAM,EAAE,YAAY,IAAI,IAAI,GAAG,EAAE,EACjC,OAAO,EACP,KAAK,EACL,eAAe,EACf,WAAW,EACX,gBAAgB,EAChB,eAAe,EACf,cAAc,CACd,CAAC;QAEF,MAAM,aAAa,GAAkB,EAAE,CAAC;QAExC,IAAI,YAAY,CAAC,IAAI,GAAG,CAAC,EAAE;YAC1B,aAAa,CAAC,YAAY,GAAG,YAAY,CAAC;SAC1C;QAED,IAAI,MAAM,EAAE,oBAAoB,KAAK,SAAS,EAAE;YAC/C,aAAa,CAAC,oBAAoB,GAAG,MAAM,CAAC,oBAAoB,CAAC;SACjE;QAED,kGAAkG;QAClG,IAAI,aAAa,CAAC,oBAAoB,KAAK,SAAS,EAAE;YACrD,MAAM,aAAa,GAAG,cAAc,KAAK,0CAAkB,CAAC,IAAI,CAAC;YAEjE,IAAI,aAAa,CAAC,oBAAoB,CAAC,QAAQ,KAAK,aAAa,EAAE;gBAClE,aAAa,CAAC,oBAAoB,GAAG;oBACpC,GAAG,aAAa,CAAC,oBAAoB;oBACrC,QAAQ,EAAE,aAAa;iBACvB,CAAC;gBACF,eAAe,CAAC,cAAc,IAAI,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;aACzD;SACD;QAED,eAAe,CAAC,gBAAgB,CAAC,GAAG,CAAC,GAAG,EAAE,aAAa,CAAC,CAAC;QACzD,OAAO,aAAa,CAAC;IACtB,CAAC;IAEO,aAAa,CACpB,SAAyB,EACzB,OAAuC;QAEvC,MAAM,eAAe,GAAmB,IAAI,GAAG,EAAE,CAAC;QAClD,KAAK,MAAM,CAAC,KAAK,EAAE,WAAW,CAAC,IAAI,SAAS,EAAE;YAC7C,MAAM,OAAO,GAAG,gBAAgB,CAAC,IAAI,CAAC,UAAU,EAAE,WAAW,CAAC,SAAS,CAAC,CAAC;YAEzE,MAAM,oBAAoB,GAAG,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,WAAW,CAAC,MAAM,EAAE,CAAC,MAAM,EAAE,EAAE,CACjF,IAAI,CAAC,eAAe,CAAC,MAAM,EAAE,OAAO,CAAC,CACrC,CAAC;YAEF,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,oBAAoB,CAAC,EAAE;gBAC3C,eAAe,CAAC,GAAG,CAAC,KAAK,EAAE,EAAE,GAAG,WAAW,EAAE,MAAM,EAAE,IAAA,gBAAK,EAAC,oBAAoB,CAAC,EAAE,CAAC,CAAC;aACpF;SACD;QAED,OAAO,eAAe,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,SAAS,CAAC;IAC/D,CAAC;IAEO,eAAe,CACtB,MAAc,EACd,OAAuC;QAEvC,MAAM,SAAS,GAAG,IAAA,8BAAmB,EAAC,OAAO,EAAE,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,OAAO,CAAC,CAAC;QAChF,IAAA,iBAAM,EAAC,SAAS,KAAK,SAAS,EAAE,KAAK,CAAC,qBAAqB,CAAC,CAAC;QAE7D,MAAM,YAAY,GACjB,SAAS,CAAC,YAAY,KAAK,SAAS;YACnC,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,SAAS,CAAC,YAAY,EAAE,OAAO,CAAC;YACrD,CAAC,CAAC,SAAS,CAAC;QAEd,MAAM,YAAY,GAAG,EAAE,GAAG,SAAS,EAAE,YAAY,EAAE,YAAY,EAAE,CAAC;QAClE,IAAI,YAAY,CAAC,YAAY,KAAK,SAAS,EAAE;YAC5C,OAAO,YAAY,CAAC,YAAY,CAAC;SACjC;QAED,IAAI,oBAAoB,CAAC,YAAY,CAAC,EAAE;YACvC,IAAA,8BAAmB,EAAC,OAAO,EAAE,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,OAAO,CAAC,CAAC;YAC9D,OAAO,SAAS,CAAC;SACjB;aAAM;YACN,IAAA,yBAAc,EAAC,OAAO,EAAE,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,OAAO,EAAE,YAAY,CAAC,CAAC;YACvE,OAAO,MAAM,CAAC;SACd;IACF,CAAC;IAEM,WAAW,CAAC,cAAkD;QACpE,OAAO,IAAI,kBAAkB,CAAC,IAAI,EAAE,cAAc,CAAC,CAAC;IACrD,CAAC;;AA95BF,kDA+5BC;AA55BuB,+BAAW,GAAqB,oBAAoB,EAAE,CAAC;AA85B/E,SAAS,kCAAkC,CAAC,OAAyC;IACpF,MAAM,SAAS,GAA+B,IAAI,GAAG,EAAE,CAAC;IACxD,MAAM,WAAW,GAA4B,IAAI,GAAG,EAAE,CAAC;IACvD,MAAM,aAAa,GAA+B,IAAI,GAAG,EAAE,CAAC;IAC5D,KAAK,MAAM,YAAY,IAAI,OAAO,EAAE;QACnC,MAAM,QAAQ,GAAG,wBAAwB,CAAC,YAAY,CAAC,CAAC;QACxD,MAAM,MAAM,GAAG,YAAY,CAAC,MAAM,CAAC;QACnC,IAAI,MAAM,CAAC,MAAM,EAAE;YAClB,KAAK,MAAM,CAAC,WAAW,EAAE,QAAQ,CAAC,IAAI,MAAM,CAAC,MAAM,EAAE;gBACpD,MAAM,cAAc,GAAG,WAAW,IAAI,QAAQ,CAAC;gBAC/C,MAAM,WAAW,GAAG,IAAA,wBAAa,EAChC,SAAS,EACT,cAAc,EACd,IAAI,GAAG,EAA+B,CACtC,CAAC;gBACF,KAAK,MAAM,CAAC,EAAE,EAAE,KAAK,CAAC,IAAI,QAAQ,EAAE;oBACnC,sDAAsD;oBACtD,0GAA0G;oBAC1G,+FAA+F;oBAC/F,yFAAyF;oBACzF,wFAAwF;oBACxF,0FAA0F;oBAC1F,6FAA6F;oBAC7F,4EAA4E;oBAC5E,4FAA4F;oBAC5F,0FAA0F;oBAC1F,gCAAgC;oBAChC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;wBACzB,oEAAoE;wBACpE,MAAM,YAAY,GAAG,IAAA,8BAAmB,EAAC,WAAW,EAAE,cAAc,EAAE,EAAE,CAAC,CAAC;wBAC1E,IAAI,YAAY,KAAK,SAAS,EAAE;4BAC/B,WAAW,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;yBAC3B;6BAAM;4BACN,IAAA,iBAAM,EACL,YAAY,KAAK,KAAK,CAAC,cAAc,EACrC,KAAK,CAAC,wDAAwD,CAC9D,CAAC;4BACF,IAAA,8BAAmB,EAAC,WAAW,EAAE,cAAc,EAAE,EAAE,CAAC,CAAC;yBACrD;qBACD;iBACD;gBACD,IAAI,WAAW,CAAC,IAAI,KAAK,CAAC,EAAE;oBAC3B,SAAS,CAAC,MAAM,CAAC,cAAc,CAAC,CAAC;iBACjC;aACD;SACD;QACD,IAAI,MAAM,CAAC,QAAQ,KAAK,SAAS,EAAE;YAClC,KAAK,MAAM,CAAC,WAAW,EAAE,QAAQ,CAAC,IAAI,MAAM,CAAC,QAAQ,EAAE;gBACtD,MAAM,cAAc,GAAG,WAAW,IAAI,QAAQ,CAAC;gBAC/C,MAAM,WAAW,GAAG,IAAA,wBAAa,EAChC,WAAW,EACX,cAAc,EACd,IAAI,GAAG,EAA4B,CACnC,CAAC;gBACF,KAAK,MAAM,CAAC,EAAE,EAAE,KAAK,CAAC,IAAI,QAAQ,EAAE;oBACnC,oEAAoE;oBACpE,MAAM,KAAK,GAAG,IAAA,8BAAmB,EAAC,SAAS,EAAE,cAAc,EAAE,EAAE,CAAC,CAAC;oBACjE,IAAI,KAAK,KAAK,SAAS,EAAE;wBACxB,WAAW,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;qBAC3B;yBAAM;wBACN,IAAA,iBAAM,EACL,KAAK,KAAK,KAAK,CAAC,cAAc,EAC9B,KAAK,CAAC,wDAAwD,CAC9D,CAAC;wBACF,IAAA,8BAAmB,EAAC,SAAS,EAAE,cAAc,EAAE,EAAE,CAAC,CAAC;qBACnD;iBACD;gBACD,IAAI,WAAW,CAAC,IAAI,KAAK,CAAC,EAAE;oBAC3B,WAAW,CAAC,MAAM,CAAC,cAAc,CAAC,CAAC;iBACnC;aACD;SACD;QACD,mDAAmD;QACnD,IAAI,MAAM,CAAC,UAAU,EAAE;YACtB,IAAA,4BAAiB,EAAC,MAAM,CAAC,UAAU,EAAE,aAAa,EAAE,KAAK,CAAC,CAAC;SAC3D;KACD;IACD,OAAO,EAAE,SAAS,EAAE,WAAW,EAAE,aAAa,EAAE,CAAC;AAClD,CAAC;AAED,SAAS,YAAY,CACpB,MAA8C,EAC9C,gBAAyC;IAEzC,IAAI,MAAM,KAAK,SAAS,EAAE;QACzB,MAAM,QAAQ,GAA4B,IAAI,GAAG,EAAE,CAAC;QACpD,KAAK,MAAM,CAAC,QAAQ,EAAE,aAAa,CAAC,IAAI,MAAM,EAAE;YAC/C,MAAM,mBAAmB,GAAG,QAAQ,IAAI,gBAAgB,CAAC;YACzD,MAAM,eAAe,GAAkC,IAAI,GAAG,EAAE,CAAC;YACjE,KAAK,MAAM,CAAC,EAAE,EAAE,KAAK,CAAC,IAAI,aAAa,EAAE;gBACxC,eAAe,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,cAAc,CAAC,CAAC;aAC9C;YACD,QAAQ,CAAC,GAAG,CAAC,mBAAmB,EAAE,eAAe,CAAC,CAAC;SACnD;QACD,OAAO,QAAQ,CAAC;KAChB;IACD,OAAO,SAAS,CAAC;AAClB,CAAC;AAED;;;;;;;;;;;;;;GAcG;AACH,QAAe,CAAC,CAAC,oBAAoB,CACpC,EAAE,MAAM,EAAE,QAAQ,EAAkC,EACpD,UAAiE;IAEjE,KAAK,CAAC,CAAC,8BAA8B,CACpC,MAAM,CAAC,YAAY,EACnB,QAAQ,EACR,MAAM,CAAC,WAAW,EAClB,UAAU,CACV,CAAC;AACH,CAAC;AAVD,oDAUC;AAED,QAAQ,CAAC,CAAC,8BAA8B,CACvC,MAAsB,EACtB,QAAiC,EACjC,WAA2C,EAC3C,UAAiE;IAEjE,KAAK,MAAM,CAAC,CAAC,EAAE,WAAW,CAAC,IAAI,MAAM,EAAE;QACtC,MAAM,aAAa,GAAG,WAAW,CAAC,QAAQ,IAAI,QAAQ,CAAC;QACvD,MAAM,OAAO,GAAG,gBAAgB,CAAC,UAAU,EAAE,WAAW,CAAC,SAAS,CAAC,CAAC;QACpE,MAAM,QAAQ,GAAG,QAAQ,CAAC,EAAE,IAAY;YACvC,MAAM,aAAa,GAAG,IAAA,8BAAmB,EAAC,WAAW,EAAE,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;YACpF,IAAA,iBAAM,EAAC,aAAa,KAAK,SAAS,EAAE,KAAK,CAAC,qBAAqB,CAAC,CAAC;YACjE,IAAI,aAAa,CAAC,YAAY,KAAK,SAAS,EAAE;gBAC7C,KAAK,CAAC,CAAC,8BAA8B,CACpC,aAAa,CAAC,YAAY,EAC1B,aAAa,EACb,WAAW,EACX,UAAU,CACV,CAAC;aACF;QACF,CAAC,CAAC;QACF,KAAK,CAAC,CAAC,OAAO,CAAC,oBAAoB,CAAC,IAAA,oBAAS,EAAC,WAAW,CAAC,MAAM,EAAE,aAAa,CAAC,EAAE,QAAQ,CAAC,CAAC;KAC5F;AACF,CAAC;AAED;;;;;;;;;GASG;AACH,SAAgB,gBAAgB,CAC/B,EAAE,MAAM,EAAE,QAAQ,EAAkC,EACpD,eAAmE,EACnE,YAA2C;IAE3C,MAAM,UAAU,GAA+B,IAAI,GAAG,EAAE,CAAC;IACzD,MAAM,YAAY,GAAwD,IAAI,GAAG,EAAE,CAAC;IAEpF,IAAI,MAAM,CAAC,MAAM,KAAK,SAAS,EAAE;QAChC,KAAK,MAAM,CAAC,KAAK,EAAE,SAAS,CAAC,IAAI,MAAM,CAAC,MAAM,EAAE;YAC/C,MAAM,UAAU,GAAG,IAAA,wBAAa,EAAC,YAAY,EAAE,KAAK,EAAE,IAAI,wBAAK,EAAE,CAAC,CAAC;YACnE,KAAK,MAAM,CAAC,EAAE,EAAE,KAAK,CAAC,IAAI,SAAS,EAAE;gBACpC,UAAU,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,cAAc,CAAC,CAAC;aACzC;SACD;KACD;IAED,KAAK,MAAM,IAAI,IAAI,YAAY,EAAE;QAChC,IAAI,MAAM,CAAC,MAAM,KAAK,SAAS,EAAE;YAChC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC;YAC/D,MAAM,UAAU,GAAG,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YAE3C,IAAI,UAAU,KAAK,SAAS,EAAE;gBAC7B,MAAM,UAAU,GAAG,UAAU,CAAC,kBAAkB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBAC7D,IAAI,UAAU,KAAK,SAAS,EAAE;oBAC7B,MAAM,CAAC,UAAU,EAAE,MAAM,CAAC,GAAG,UAAU,CAAC;oBAExC,4EAA4E;oBAC5E,sDAAsD;oBACtD,IAAI,IAAI,CAAC,KAAK,GAAG,UAAU,GAAG,MAAM,EAAE;wBACrC,SAAS;qBACT;iBACD;aACD;SACD;QAED,MAAM,IAAI,GAAG,eAAe,CAAC,IAAI,CAAC,CAAC;QACnC,IAAA,iBAAM,EAAC,IAAI,KAAK,SAAS,EAAE,KAAK,CAAC,gCAAgC,CAAC,CAAC;QACnE,IAAA,yBAAc,EAAC,UAAU,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;KACzD;IAED,MAAM,EACL,YAAY,EACZ,WAAW,EACX,KAAK,EACL,SAAS,EACT,wBAAwB,EACxB,MAAM,EACN,QAAQ,GACR,GAAG,MAAM,CAAC;IAEX,OAAO,oBAAoB,CAC1B,YAAY,EACZ,WAAW,EACX,KAAK,EACL,SAAS,EACT,wBAAwB,EACxB,MAAM,EACN,QAAQ,EACR,UAAU,CACV,CAAC;AACH,CAAC;AA7DD,4CA6DC;AAED;;;GAGG;AACH,SAAgB,SAAS,CACxB,YAA4C,EAC5C,UAAiE;IAEjE,MAAM,MAAM,GAAG,YAAY,CAAC,MAAM,CAAC;IACnC,+DAA+D;IAC/D,IAAI,CAAC,MAAM,CAAC,wBAAwB,IAAI,CAAC,CAAC,GAAG,CAAC,EAAE;QAC/C,OAAO,qBAAU,CAAC;KAClB;IAED,MAAM,QAAQ,GAAG,wBAAwB,CAAC,YAAY,CAAC,CAAC;IACxD,MAAM,WAAW,GAAG,sDAAwB,CAAC,UAAU,EAAE,CAAC;IAC1D,MAAM,SAAS,GAAuB,EAAE,CAAC;IACzC,MAAM,WAAW,GAAG,aAAa,CAChC,MAAM,CAAC,YAAY,EACnB,QAAQ,EACR,MAAM,CAAC,WAAW,EAClB,WAAW,EACX,UAAU,CACV,CAAC;IACF,IAAI,WAAW,CAAC,IAAI,GAAG,CAAC,EAAE;QACzB,SAAS,CAAC,MAAM,GAAG,WAAW,CAAC;KAC/B;IACD,IAAI,MAAM,CAAC,MAAM,IAAI,MAAM,CAAC,MAAM,CAAC,IAAI,GAAG,CAAC,EAAE;QAC5C,SAAS,CAAC,KAAK,GAAG,iBAAiB,CAAC,MAAM,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;KAC7D;IACD,IAAI,MAAM,CAAC,QAAQ,KAAK,SAAS,IAAI,MAAM,CAAC,QAAQ,CAAC,IAAI,GAAG,CAAC,EAAE;QAC9D,MAAM,QAAQ,GAAmC,EAAE,CAAC;QACpD,IAAA,6BAAkB,EAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,EAAE;YAC3D,QAAQ,CAAC,IAAI,CAAC;gBACb,EAAE,EAAE,IAAA,6BAAkB,EAAC,KAAK,IAAI,QAAQ,EAAE,KAAK,CAAC;gBAChD,KAAK;aACL,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QACH,SAAS,CAAC,OAAO,GAAG,QAAQ,CAAC;KAC7B;IACD,IAAI,MAAM,CAAC,UAAU,IAAI,MAAM,CAAC,UAAU,CAAC,IAAI,GAAG,CAAC,EAAE;QACpD,SAAS,CAAC,UAAU,GAAG,iBAAiB,CAAC,MAAM,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC;KACtE;IACD,OAAO,SAAS,CAAC;AAClB,CAAC;AAxCD,8BAwCC;AAED,SAAS,iBAAiB,CAAC,aAAyC,EAAE,QAAsB;IAC3F,MAAM,mBAAmB,GAA6B,EAAE,CAAC;IACzD,IAAA,6BAAkB,EAAC,aAAa,EAAE,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,EAAE;QACzD,IAAI,KAAK,CAAC,cAAc,GAAG,CAAC,EAAE;YAC7B,MAAM,KAAK,GAAG,IAAA,yBAAc,EAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAClD,IAAA,uCAAoB,EAAC,IAAA,oCAAiB,EAAC,CAAC,CAAC,CAAC,CAC1C,CAAC;YACF,mBAAmB,CAAC,IAAI,CAAC;gBACxB,EAAE,EAAE,IAAA,6BAAkB,EAAC,KAAK,IAAI,QAAQ,EAAE,KAAK,CAAC;gBAChD,KAAK;aACL,CAAC,CAAC;SACH;IACF,CAAC,CAAC,CAAC;IACH,OAAO,mBAAmB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,CAAC,SAAS,CAAC;AACzE,CAAC;AAED;;;;;GAKG;AACH,SAAS,aAAa,CACrB,MAAsB,EACtB,QAAiC,EACjC,WAA2C,EAC3C,WAAqC,EACrC,UAAiE;IAEjE,MAAM,KAAK,GAAqC,IAAI,GAAG,EAAE,CAAC;IAC1D,KAAK,MAAM,CAAC,KAAK,EAAE,WAAW,CAAC,IAAI,MAAM,EAAE;QAC1C,MAAM,aAAa,GAAG,WAAW,CAAC,QAAQ,IAAI,QAAQ,CAAC;QACvD,MAAM,UAAU,GAAG,gBAAgB,CAAC,UAAU,EAAE,WAAW,CAAC,SAAS,CAAC,CAAC,SAAS,CAC/E,IAAA,oBAAS,EAAC,WAAW,CAAC,MAAM,EAAE,aAAa,CAAC,EAC5C,CAAC,WAAW,EAAiB,EAAE;YAC9B,MAAM,UAAU,GAAG,IAAA,8BAAmB,EACrC,WAAW,EACX,WAAW,CAAC,QAAQ,EACpB,WAAW,CAAC,OAAO,CACnB,CAAC;YAEF,IAAA,iBAAM,EAAC,UAAU,KAAK,SAAS,EAAE,KAAK,CAAC,qBAAqB,CAAC,CAAC;YAC9D,OAAO,mBAAmB,CACzB,IAAA,oBAAS,EAAC,UAAU,EAAE,aAAa,CAAC,EACpC,WAAW,EACX,WAAW,EACX,UAAU,CACV,CAAC;QACH,CAAC,EACD,WAAW,CACX,CAAC;QACF,IAAI,CAAC,IAAA,8BAAmB,EAAC,UAAU,CAAC,EAAE;YACrC,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC;SAC7B;KACD;IACD,OAAO,KAAK,CAAC;AACd,CAAC;AAED,SAAS,mBAAmB,CAC3B,EAAE,MAAM,EAAE,QAAQ,EAA+B,EACjD,WAA2C,EAC3C,WAAqC,EACrC,UAAiE;IAEjE,IAAI,MAAM,CAAC,YAAY,KAAK,SAAS,EAAE;QACtC,OAAO,aAAa,CAAC,MAAM,CAAC,YAAY,EAAE,QAAQ,EAAE,WAAW,EAAE,WAAW,EAAE,UAAU,CAAC,CAAC;KAC1F;IACD,8DAA8D;IAC9D,OAAO,IAAI,GAAG,EAAE,CAAC;AAClB,CAAC;AAED;;;;;;;;;;GAUG;AACH,SAAgB,8BAA8B,CAC7C,QAAiC,EACjC,aAA0C;IAE1C,MAAM,iBAAiB,GAAkB,EAAE,CAAC;IAC5C,KAAK,MAAM,QAAQ,IAAI,aAAa,EAAE;QACrC,IAAI,QAAQ,KAAK,SAAS,EAAE;YAC3B,iBAAiB,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;SACjC;KACD;IAED,MAAM,gBAAgB,GAAG,GAAG,EAAE,CAAC,iBAAiB,CAAC;IACjD,OAAO;QACN,GAAG,IAAA,yCAA8B,EAAC,QAAQ,CAAC;QAC3C,gBAAgB;KAChB,CAAC;AACH,CAAC;AAhBD,wEAgBC;AAED,SAAS,oBAAoB,CAAC,MAAqB;IAClD,OAAO,MAAM,CAAC,YAAY,KAAK,SAAS,IAAI,MAAM,CAAC,oBAAoB,KAAK,SAAS,CAAC;AACvF,CAAC;AAED,SAAgB,YAAY,CAC3B,UAAiE,EACjE,IAAyB;IAEzB,IAAI,IAAI,KAAK,sCAAgB,CAAC,UAAU,EAAE;QACzC,OAAO,sCAAgB,CAAC;KACxB;IACD,MAAM,SAAS,GAAG,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACvC,IAAA,iBAAM,EAAC,SAAS,KAAK,SAAS,EAAE,KAAK,CAAC,wBAAwB,CAAC,CAAC;IAChE,OAAO,IAAA,mCAAU,EAAC,SAAS,CAAC,CAAC;AAC9B,CAAC;AAVD,oCAUC;AAED,SAAgB,gBAAgB,CAC/B,UAAiE,EACjE,IAAyB;IAEzB,OAAO,YAAY,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC,aAAa,CAAC;AACrD,CAAC;AALD,4CAKC;AA6DD,SAAS,eAAe;IACvB,OAAO;QACN,GAAG,kBAAkB,EAAe;QACpC,cAAc,EAAE,IAAI,GAAG,EAAE;QACzB,OAAO,EAAE,IAAI,GAAG,EAAE;QAClB,WAAW,EAAE,EAAE;KACf,CAAC;AACH,CAAC;AAsBD,SAAS,kBAAkB;IAC1B,OAAO;QACN,QAAQ,EAAE,IAAI,GAAG,EAAE;QACnB,QAAQ,EAAE,IAAI,GAAG,EAAE;QACnB,aAAa,EAAE,IAAI,GAAG,EAAE;QACxB,aAAa,EAAE,IAAI,GAAG,EAAE;QACxB,iBAAiB,EAAE,IAAI,GAAG,EAAE;KAC5B,CAAC;AACH,CAAC;AASD,SAAS,kBAAkB,CAAC,cAAsB;IACjD,OAAO;QACN,cAAc;KACd,CAAC;AACH,CAAC;AAMD,SAAS,oBAAoB,CAC5B,eAAmC,EACnC,eAAkB,EAClB,UAAU,GAAG,IAAI;IAEjB,MAAM,MAAM,GAAG,CAAC,MAAwB,EAAE,EAAE,CAC3C,MAAM,KAAK,uCAAgB,CAAC,MAAM,CAAC,CAAC,CAAC,eAAe,CAAC,QAAQ,CAAC,CAAC,CAAC,eAAe,CAAC,QAAQ,CAAC;IAE1F,MAAM,aAAa,GAAG,CAAC,MAAwB,EAAE,EAAE,CAClD,MAAM,KAAK,uCAAgB,CAAC,MAAM;QACjC,CAAC,CAAC,eAAe,CAAC,aAAa;QAC/B,CAAC,CAAC,eAAe,CAAC,aAAa,CAAC;IAElC,MAAM,OAAO,GAAG;QACf,KAAK,EAAE,eAAe;QAEtB,GAAG,EAAE,CACJ,MAAwB,EACxB,QAAiC,EACjC,EAAoB,EACpB,KAAa,EACb,QAAiB,EACjB,oBAA6B,EAC5B,EAAE;YACH,IAAI,oBAAoB,IAAI,UAAU,EAAE;gBACvC,MAAM,aAAa,GAAI,EAAa,GAAG,KAAK,GAAG,CAAC,CAAC;gBACjD,IAAI,OAAO,GAAG,EAAE,CAAC;gBACjB,OAAO,OAAO,IAAI,aAAa,EAAE;oBAChC,MAAM,cAAc,GAAG,IAAA,gDAAyB,EAC/C,aAAa,CAAC,MAAM,CAAC,EACrB,QAAQ,EACR,OAAO,EACP,aAAa,GAAG,OAAO,GAAG,CAAC,CAC3B,CAAC;oBACF,IAAI,cAAc,CAAC,KAAK,KAAK,SAAS,EAAE;wBACvC,eAAe,CAAC,iBAAiB,CAAC,GAAG,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC;qBAC5D;oBAED,OAAO,GAAG,IAAA,gBAAK,EAAC,OAAO,GAAG,cAAc,CAAC,MAAM,CAAC,CAAC;iBACjD;aACD;YACD,IAAA,yCAAkB,EAAC,MAAM,CAAC,MAAM,CAAC,EAAE,QAAQ,EAAE,EAAE,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC;QACnE,CAAC;QAED,GAAG,EAAE,CACJ,MAAwB,EACxB,QAAiC,EACjC,EAAoB,EACpB,KAAa,EACb,aAAsB,EACrB,EAAE;YACH,IAAI,aAAa,EAAE;gBAClB,wEAAwE;gBACxE,sEAAsE;gBACtE,0FAA0F;gBAC1F,IAAA,yCAAkB,EAAC,aAAa,CAAC,MAAM,CAAC,EAAE,QAAQ,EAAE,EAAE,EAAE,KAAK,EAAE,eAAe,CAAC,CAAC;aAChF;YACD,OAAO,IAAA,gDAAyB,EAAC,MAAM,CAAC,MAAM,CAAC,EAAE,QAAQ,EAAE,EAAE,EAAE,KAAK,CAAC,CAAC;QACvE,CAAC;KACD,CAAC;IAEF,OAAO,OAAO,CAAC;AAChB,CAAC;AAED,SAAS,oBAAoB,CAC5B,eAA2C,SAAS,EACpD,cAA0D,SAAS,EACnE,QAAgB,CAAC,CAAC,EAClB,YAAiD,SAAS,EAC1D,2BAA+C,SAAS,EACxD,MAAmC,EACnC,QAAkC,EAClC,UAAuC;IAEvC,MAAM,SAAS,GAA8B;QAC5C,YAAY,EAAE,YAAY,IAAI,IAAI,GAAG,EAAE;QACvC,WAAW,EAAE,WAAW,IAAI,IAAI,GAAG,EAAE;KACrC,CAAC;IACF,IAAI,SAAS,KAAK,SAAS,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE;QACpD,SAAS,CAAC,SAAS,GAAG,SAAS,CAAC;KAChC;IACD,IAAI,KAAK,IAAI,CAAC,EAAE;QACf,SAAS,CAAC,KAAK,GAAG,IAAA,gBAAK,EAAC,KAAK,CAAC,CAAC;KAC/B;IACD,IAAI,wBAAwB,KAAK,SAAS,IAAI,wBAAwB,GAAG,CAAC,EAAE;QAC3E,SAAS,CAAC,wBAAwB,GAAG,wBAAwB,CAAC;KAC9D;IACD,IAAI,MAAM,KAAK,SAAS,IAAI,MAAM,CAAC,IAAI,GAAG,CAAC,EAAE;QAC5C,SAAS,CAAC,MAAM,GAAG,MAAM,CAAC;KAC1B;IACD,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ,CAAC,IAAI,GAAG,CAAC,EAAE;QAChD,SAAS,CAAC,QAAQ,GAAG,QAAQ,CAAC;KAC9B;IACD,IAAI,UAAU,KAAK,SAAS,IAAI,UAAU,CAAC,IAAI,GAAG,CAAC,EAAE;QACpD,SAAS,CAAC,UAAU,GAAG,UAAU,CAAC;KAClC;IACD,OAAO,SAAS,CAAC;AAClB,CAAC;AAED,MAAa,kBAAmB,SAAQ,sBAA6B;IAIpE,YACC,MAA0D,EAC1D,cAAkD;QAElD,KAAK,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC;QAPvB,qBAAgB,GAAW,CAAC,CAAC;QAQpC,IAAI,CAAC,WAAW,GAAG,IAAA,+BAAoB,GAAE,CAAC;IAC3C,CAAC;IAEe,gBAAgB;QAC/B,IAAI,CAAC,gBAAgB,IAAI,CAAC,CAAC;QAC3B,IAAI,IAAI,CAAC,gBAAgB,KAAK,CAAC,EAAE;YAChC,IAAI,CAAC,WAAW,GAAG,IAAA,+BAAoB,GAAE,CAAC;SAC1C;IACF,CAAC;IAEe,eAAe;QAC9B,IAAA,iBAAM,EAAC,IAAI,CAAC,gBAAgB,GAAG,CAAC,EAAE,KAAK,CAAC,wCAAwC,CAAC,CAAC;QAClF,IAAI,CAAC,gBAAgB,IAAI,CAAC,CAAC;QAC3B,IAAI,IAAI,CAAC,gBAAgB,KAAK,CAAC,EAAE;YAChC,IAAI,CAAC,WAAW,GAAG,IAAA,+BAAoB,GAAE,CAAC;SAC1C;IACF,CAAC;IAED;;;;OAIG;IACI,UAAU,CAChB,OAAyB,EACzB,OAA+B;QAE/B,IAAI,OAAO,CAAC,IAAI,sCAA8B,IAAI,OAAO,CAAC,cAAc,EAAE,KAAK,CAAC,EAAE;YACjF,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC;SAC1B;QACD,MAAM,MAAM,GAA+B,IAAI,GAAG,EAAE,CAAC;QACrD,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAE,CAAC;QAC3B,MAAM,CAAC,GAAG,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;QAChC,MAAM,KAAK,GACV,OAAO,CAAC,IAAI,sCAA8B;YACzC,CAAC,CAAC,IAAA,2BAAgB,EAAC,OAAO,EAAE,6BAAkB,CAAC;YAC/C,CAAC,CAAC,IAAA,oBAAS,EAAC,OAAO,EAAE,6BAAkB,CAAC,CAAC;QAC3C,QAAQ,CAAC,GAAG,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;QAE7B,OAAO;YACN,IAAI,EAAE,QAAQ;YACd,MAAM;SACN,CAAC;IACH,CAAC;IAED;;;;;;OAMG;IACI,YAAY,CAClB,KAAkB,EAClB,SAA8B,EAC9B,MAAsB;QAEtB,MAAM,aAAa,GAAG,8BAA8B,CACnD,KAAK,EACL,EAAE,SAAS,EAAE,MAAM,EAAE,EACrB,IAAI,GAAG,EAAE,EACT,IAAI,CAAC,WAAW,CAChB,CAAC;QACF,IAAI,CAAC,WAAW,CAAC,aAAa,CAAC,CAAC;IACjC,CAAC;IAEM,aAAa,CAAC,OAA0B;QAC9C,MAAM,aAAa,GAAG,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC;QACjD,IAAI,CAAC,WAAW,CAAC,aAAa,CAAC,CAAC;IACjC,CAAC;IAEM,YAAY,CAAC,OAA0B;QAC7C,MAAM,UAAU,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CACzC,IAAA,yBAAc,EACb,MAAM,CAAC,IAAI,KAAK,QAAQ;YACvB,CAAC,CAAC,oBAAoB,CACpB,SAAS,EACT,SAAS,EACT,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,EAC3B,SAAS,EACT,SAAS,EACT,MAAM,CAAC,MAAM,CACZ;YACH,CAAC,CAAC,8BAA8B,CAC9B,MAAM,CAAC,KAAK,EACZ;gBACC,SAAS,EAAE,MAAM,CAAC,SAAS;gBAC3B,MAAM,EAAE,MAAM,CAAC,MAAM;aACrB,EACD,IAAI,GAAG,EAAE,EACT,IAAI,CAAC,WAAW,CACf,CACJ,CACD,CAAC;QACF,MAAM,cAAc,GACnB,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;QAE/C,MAAM,KAAK,GAAqB,IAAA,gBAAK,EAAC,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,CAAC,CAAC;QACnE,IAAI,KAAK,IAAI,CAAC,EAAE;YACf,cAAc,CAAC,KAAK,GAAG,KAAK,CAAC;SAC7B;QACD,OAAO,cAAc,CAAC;IACvB,CAAC;IAEM,UAAU,CAAC,KAAc;QAC/B,OAAO,IAAA,gBAAK,EAAC,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC;IAChD,CAAC;IAEM,uBAAuB,CAAC,IAAY;QAC1C,MAAM,UAAU,GAAkB;YACjC,oBAAoB,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE;SACzC,CAAC;QAEF,IAAI,CAAC,WAAW,CACf,6BAA6B,CAAC,IAAI,EAAE,UAAU,EAAE,IAAI,GAAG,EAAE,EAAE,IAAI,CAAC,WAAW,CAAC,CAC5E,CAAC;IACH,CAAC;CACD;AA9HD,gDA8HC;AAED,SAAS,8BAA8B,CACtC,IAAiB,EACjB,WAAwB,EACxB,WAA2C,EAC3C,cAA2B,IAAA,+BAAoB,GAAE;IAEjD,MAAM,YAAY,GAAmB,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC,CAAC,CAAC;IAE1E,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS,EAAE;QAC9B,OAAO,oBAAoB,CAAC,YAAY,EAAE,WAAW,EAAE,WAAW,CAAC,QAAQ,EAAE,CAAC,CAAC;KAC/E;IAED,MAAM,aAAa,GAAkB;QACpC,YAAY;KACZ,CAAC;IAEF,OAAO,6BAA6B,CAAC,IAAI,CAAC,MAAM,EAAE,aAAa,EAAE,WAAW,EAAE,WAAW,CAAC,CAAC;AAC5F,CAAC;AAED,SAAS,6BAA6B,CACrC,IAAY,EACZ,UAAyB,EACzB,WAA2C,EAC3C,WAAwB;IAExB,MAAM,MAAM,GAAW,EAAE,OAAO,EAAE,IAAA,gBAAK,EAAC,WAAW,CAAC,QAAQ,EAAE,CAAC,EAAE,CAAC;IAClE,IAAA,yBAAc,EAAC,WAAW,EAAE,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC;IACzE,MAAM,cAAc,GAAG,sCAAgB,CAAC,aAAa,CAAC,MAAM,CAAC,gBAAgB,CAC5E,IAAI,CAAC,WAAW,EAChB,MAAM,CACN,CAAC;IAEF,MAAM,WAAW,GAAgB;QAChC,SAAS,EAAE,sCAAgB,CAAC,UAAU;QACtC,MAAM,EAAE,cAAc;KACtB,CAAC;IAEF,OAAO,8BAA8B,CACpC,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,KAAK,EAAE,IAAI,CAAC,WAAW,EAAE,EAChD,WAAW,EACX,WAAW,EACX,WAAW,CACX,CAAC;AACH,CAAC;AAyBD,SAAS,2BAA2B,CAAC,OAAyC;IAI7E,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC;IACf,MAAM,QAAQ,GAAmB,EAAE,CAAC;IACpC,KAAK,MAAM,YAAY,IAAI,OAAO,EAAE;QACnC,MAAM,MAAM,GAAG,YAAY,CAAC,MAAM,CAAC;QACnC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,IAAI,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;QAC5C,QAAQ,CAAC,IAAI,CAAC,GAAG,4BAA4B,CAAC,YAAY,CAAC,CAAC,CAAC;KAC7D;IAED,MAAM,SAAS,GAAG,IAAI,GAAG,EAAe,CAAC;IACzC,MAAM,mBAAmB,GAAkB,EAAE,CAAC;IAC9C,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE;QAC5B,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC7B,IAAI,IAAI,CAAC,UAAU,KAAK,SAAS,EAAE;YAClC,mBAAmB,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;SAC1C;KACD;IAED,mBAAmB,CAAC,OAAO,EAAE,CAAC;IAC9B,KAAK,MAAM,QAAQ,IAAI,mBAAmB,EAAE;QAC3C,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE;YAC7B,QAAQ,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC;SAC5B;KACD;IAED,OAAO,EAAE,KAAK,EAAE,IAAA,gBAAK,EAAC,KAAK,CAAC,EAAE,QAAQ,EAAE,CAAC;AAC1C,CAAC;AAED,SAAS,4BAA4B,CACpC,YAA4C;IAE5C,MAAM,QAAQ,GAAmB,EAAE,CAAC;IACpC,IAAI,YAAY,CAAC,MAAM,CAAC,SAAS,KAAK,SAAS,EAAE;QAChD,QAAQ,CAAC,IAAI,CAAC,GAAG,YAAY,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;KAChD;SAAM,IAAI,YAAY,CAAC,QAAQ,KAAK,SAAS,EAAE;QAC/C,MAAM,IAAI,GAA0B,EAAE,QAAQ,EAAE,YAAY,CAAC,QAAQ,EAAE,CAAC;QACxE,IAAI,YAAY,CAAC,UAAU,KAAK,SAAS,EAAE;YAC1C,IAAI,CAAC,UAAU,GAAG,YAAY,CAAC,UAAU,CAAC;SAC1C;QACD,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;KACpB;IACD,OAAO,QAAQ,CAAC;AACjB,CAAC;AAED,SAAS,wBAAwB,CAAC,MAAsC;IACvE,OAAO,MAAM,CAAC,QAAQ,IAAI,oBAAoB,CAAC,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;AACzE,CAAC;AAED,SAAS,oBAAoB,CAC5B,QAA6C;IAE7C,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE;QACpD,OAAO,SAAS,CAAC;KACjB;IACD,OAAO,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC;AAC7B,CAAC","sourcesContent":["/!\n Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n /\n\nimport { assert } from \"@fluidframework/core-utils/internal\";\nimport { BTree } from \"@tylerbu/sorted-btree-es6\";\n\nimport { ICodecFamily } from \"../../codec/index.js\";\nimport {\n\tChangeAtomIdMap,\n\tChangeEncodingContext,\n\tChangeFamily,\n\tChangeFamilyEditor,\n\tChangeRebaser,\n\tChangesetLocalId,\n\tCursorLocationType,\n\tDeltaDetachedNodeBuild,\n\tDeltaDetachedNodeDestruction,\n\tDeltaDetachedNodeId,\n\tDeltaFieldChanges,\n\tDeltaFieldMap,\n\tDeltaRoot,\n\tEditBuilder,\n\tFieldKey,\n\tFieldKindIdentifier,\n\tFieldUpPath,\n\tITreeCursorSynchronous,\n\tRevisionInfo,\n\tRevisionMetadataSource,\n\tRevisionTag,\n\tTaggedChange,\n\tUpPath,\n\temptyDelta,\n\tisEmptyFieldChanges,\n\tmakeAnonChange,\n\tmakeDetachedNodeId,\n\tmapCursorField,\n\trevisionMetadataSourceFromInfo,\n\ttagChange,\n\ttaggedAtomId,\n\ttaggedOptAtomId,\n} from \"../../core/index.js\";\nimport {\n\tIdAllocationState,\n\tIdAllocator,\n\tMutable,\n\tNestedSet,\n\taddToNestedSet,\n\tbrand,\n\tdeleteFromNestedMap,\n\tfail,\n\tforEachInNestedMap,\n\tgetOrAddInMap,\n\tidAllocatorFromMaxId,\n\tidAllocatorFromState,\n\tnestedSetContains,\n\tpopulateNestedMap,\n\tsetInNestedMap,\n\ttryGetFromNestedMap,\n} from \"../../util/index.js\";\nimport {\n\tTreeChunk,\n\tchunkFieldSingle,\n\tchunkTree,\n\tdefaultChunkPolicy,\n} from \"../chunked-forest/index.js\";\nimport { cursorForMapTreeNode, mapTreeFromCursor } from \"../mapTreeCursor.js\";\nimport { MemoizedIdRangeAllocator } from \"../memoizedIdRangeAllocator.js\";\n\nimport {\n\tCrossFieldManager,\n\tCrossFieldMap,\n\tCrossFieldTarget,\n\tgetFirstFromCrossFieldMap,\n\tsetInCrossFieldMap,\n} from \"./crossFieldQueries.js\";\nimport {\n\tFieldChangeHandler,\n\tNodeExistenceState,\n\tRebaseRevisionMetadata,\n} from \"./fieldChangeHandler.js\";\nimport { FieldKindWithEditor, withEditor } from \"./fieldKindWithEditor.js\";\nimport { convertGenericChange, genericFieldKind, newGenericChangeset } from \"./genericFieldKind.js\";\nimport { GenericChangeset } from \"./genericFieldKindTypes.js\";\nimport {\n\tFieldChange,\n\tFieldChangeMap,\n\tFieldChangeset,\n\tModularChangeset,\n\tNodeChangeset,\n\tNodeId,\n} from \"./modularChangeTypes.js\";\n\n/\n Implementation of ChangeFamily which delegates work in a given field to the appropriate FieldKind\n * as determined by the schema.\n /\nexport class ModularChangeFamily\n\timplements ChangeFamily<ModularEditBuilder, ModularChangeset>, ChangeRebaser<ModularChangeset>\n{\n\tpublic static readonly emptyChange: ModularChangeset = makeModularChangeset();\n\n\tpublic readonly fieldKinds: ReadonlyMap<FieldKindIdentifier, FieldKindWithEditor>;\n\n\tpublic constructor(\n\t\tfieldKinds: ReadonlyMap<FieldKindIdentifier, FieldKindWithEditor>,\n\t\tpublic readonly codecs: ICodecFamily<ModularChangeset, ChangeEncodingContext>,\n\t) {\n\t\tthis.fieldKinds = fieldKinds;\n\t}\n\n\tpublic get rebaser(): ChangeRebaser<ModularChangeset> {\n\t\treturn this;\n\t}\n\n\t/\n\t Produces an equivalent list of `FieldChangeset`s that all target the same {@link FlexFieldKind}.\n\t * @param changes - The list of `FieldChange`s whose `FieldChangeset`s needs to be normalized.\n\t * @returns An object that contains both the equivalent list of `FieldChangeset`s that all\n\t * target the same {@link FlexFieldKind}, and the `FieldKind` that they target.\n\t * The returned `FieldChangeset`s may be a shallow copy of the input `FieldChange`s.\n\t /\n\tprivate normalizeFieldChanges(\n\t\tchange1: FieldChange \| undefined,\n\t\tchange2: FieldChange \| undefined,\n\t\tgenId: IdAllocator,\n\t\trevisionMetadata: RevisionMetadataSource,\n\t): {\n\t\tfieldKind: FieldKindWithEditor;\n\t\tchange1: FieldChangeset \| undefined;\n\t\tchange2: FieldChangeset \| undefined;\n\t} {\n\t\t// TODO: Handle the case where changes have conflicting field kinds\n\t\tconst kind =\n\t\t\tchange1 !== undefined && change1.fieldKind !== genericFieldKind.identifier\n\t\t\t\t? change1.fieldKind\n\t\t\t\t: change2?.fieldKind ?? genericFieldKind.identifier;\n\n\t\tif (kind === genericFieldKind.identifier) {\n\t\t\t// All the changes are generic\n\t\t\treturn {\n\t\t\t\tfieldKind: genericFieldKind,\n\t\t\t\tchange1: change1?.change,\n\t\t\t\tchange2: change2?.change,\n\t\t\t};\n\t\t}\n\t\tconst fieldKind = getFieldKind(this.fieldKinds, kind);\n\t\tconst handler = fieldKind.changeHandler;\n\t\tconst normalizedChange1 = this.normalizeFieldChange(\n\t\t\tchange1,\n\t\t\thandler,\n\t\t\tgenId,\n\t\t\trevisionMetadata,\n\t\t);\n\t\tconst normalizedChange2 = this.normalizeFieldChange(\n\t\t\tchange2,\n\t\t\thandler,\n\t\t\tgenId,\n\t\t\trevisionMetadata,\n\t\t);\n\t\treturn { fieldKind, change1: normalizedChange1, change2: normalizedChange2 };\n\t}\n\n\tprivate normalizeFieldChange<T>(\n\t\tfieldChange: FieldChange \| undefined,\n\t\thandler: FieldChangeHandler<T>,\n\t\tgenId: IdAllocator,\n\t\trevisionMetadata: RevisionMetadataSource,\n\t): FieldChangeset \| undefined {\n\t\tif (fieldChange === undefined) {\n\t\t\treturn undefined;\n\t\t}\n\n\t\tif (fieldChange.fieldKind !== genericFieldKind.identifier) {\n\t\t\treturn fieldChange.change;\n\t\t}\n\n\t\t// The cast is based on the `fieldKind` check above\n\t\tconst genericChange = fieldChange.change as unknown as GenericChangeset;\n\t\tconst convertedChange = convertGenericChange(\n\t\t\tgenericChange,\n\t\t\thandler,\n\t\t\t(child1, child2) => {\n\t\t\t\tassert(\n\t\t\t\t\tchild1 === undefined \|\| child2 === undefined,\n\t\t\t\t\t0x92f / Should not have two changesets to compose /,\n\t\t\t\t);\n\n\t\t\t\treturn child1 ?? child2 ?? fail(\"Should not compose two undefined node IDs\");\n\t\t\t},\n\t\t\tgenId,\n\t\t\trevisionMetadata,\n\t\t) as FieldChangeset;\n\n\t\treturn convertedChange;\n\t}\n\n\tpublic compose(changes: TaggedChange<ModularChangeset>[]): ModularChangeset {\n\t\tconst activeChanges = changes.filter(\n\t\t\t(change) => (change.change.constraintViolationCount ?? 0) === 0,\n\t\t);\n\n\t\tconst { revInfos, maxId } = getRevInfoFromTaggedChanges(changes);\n\t\tconst idState: IdAllocationState = { maxId };\n\n\t\treturn activeChanges.reduce(\n\t\t\t(change1, change2) =>\n\t\t\t\tmakeAnonChange(this.composePair(change1, change2, revInfos, idState)),\n\t\t\tmakeAnonChange({ fieldChanges: new Map(), nodeChanges: new Map() }),\n\t\t).change;\n\t}\n\n\tprivate composePair(\n\t\tchange1: TaggedChange<ModularChangeset>,\n\t\tchange2: TaggedChange<ModularChangeset>,\n\t\trevInfos: RevisionInfo[],\n\t\tidState: IdAllocationState,\n\t): ModularChangeset {\n\t\tconst genId: IdAllocator = idAllocatorFromState(idState);\n\t\tconst revisionMetadata: RevisionMetadataSource = revisionMetadataSourceFromInfo(revInfos);\n\n\t\tconst crossFieldTable = newComposeTable();\n\n\t\tconst composedFields = this.composeFieldMaps(\n\t\t\tchange1.change.fieldChanges,\n\t\t\tchange1.revision,\n\t\t\tchange2.change.fieldChanges,\n\t\t\tchange2.revision,\n\t\t\tgenId,\n\t\t\tcrossFieldTable,\n\t\t\trevisionMetadata,\n\t\t);\n\n\t\tconst composedNodeChanges: ChangeAtomIdMap<NodeChangeset> = new Map();\n\t\tfor (const [taggedId1, taggedId2] of crossFieldTable.nodeIdPairs) {\n\t\t\tthis.composeNodesById(\n\t\t\t\tchange1.change.nodeChanges,\n\t\t\t\tchange2.change.nodeChanges,\n\t\t\t\tcomposedNodeChanges,\n\t\t\t\ttaggedId1?.change,\n\t\t\t\ttaggedId1?.revision,\n\t\t\t\ttaggedId2?.change,\n\t\t\t\ttaggedId2?.revision,\n\t\t\t\tgenId,\n\t\t\t\tcrossFieldTable,\n\t\t\t\trevisionMetadata,\n\t\t\t);\n\t\t}\n\n\t\tcrossFieldTable.nodeIdPairs.length = 0;\n\n\t\twhile (crossFieldTable.invalidatedFields.size > 0) {\n\t\t\tconst fieldsToUpdate = crossFieldTable.invalidatedFields;\n\t\t\tcrossFieldTable.invalidatedFields = new Set();\n\t\t\tfor (const fieldChange of fieldsToUpdate) {\n\t\t\t\tconst context = crossFieldTable.fieldToContext.get(fieldChange);\n\t\t\t\tassert(\n\t\t\t\t\tcontext !== undefined,\n\t\t\t\t\t0x8cc / Should have context for every invalidated field /,\n\t\t\t\t);\n\t\t\t\tconst { change1: fieldChange1, change2: fieldChange2, composedChange } = context;\n\n\t\t\t\tconst rebaser = getChangeHandler(this.fieldKinds, fieldChange.fieldKind).rebaser;\n\t\t\t\tconst composeNodes = (\n\t\t\t\t\tchild1: NodeId \| undefined,\n\t\t\t\t\tchild2: NodeId \| undefined,\n\t\t\t\t): NodeId => {\n\t\t\t\t\tif (\n\t\t\t\t\t\tchild2 !== undefined &&\n\t\t\t\t\t\t!nestedSetContains(crossFieldTable.nodeIds, child2.revision, child2.localId)\n\t\t\t\t\t) {\n\t\t\t\t\t\tconst taggedId1 =\n\t\t\t\t\t\t\tchild1 !== undefined\n\t\t\t\t\t\t\t\t? tagChange(child1, fieldChange1.revision)\n\t\t\t\t\t\t\t\t: undefined;\n\n\t\t\t\t\t\tconst taggedId2 =\n\t\t\t\t\t\t\tchild2 !== undefined\n\t\t\t\t\t\t\t\t? tagChange(child2, fieldChange2.revision)\n\t\t\t\t\t\t\t\t: undefined;\n\n\t\t\t\t\t\tcrossFieldTable.nodeIdPairs.push([taggedId1, taggedId2]);\n\t\t\t\t\t\tif (child1 !== undefined && child2 !== undefined) {\n\t\t\t\t\t\t\taddToNestedSet(\n\t\t\t\t\t\t\t\tcrossFieldTable.nodeIds,\n\t\t\t\t\t\t\t\tchild2.revision,\n\t\t\t\t\t\t\t\tchild2.localId,\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\treturn (\n\t\t\t\t\t\ttaggedOptAtomId(child1, fieldChange1.revision) ??\n\t\t\t\t\t\ttaggedOptAtomId(child2, fieldChange2.revision) ??\n\t\t\t\t\t\tfail(\"Should not compose two undefined nodes\")\n\t\t\t\t\t);\n\t\t\t\t};\n\n\t\t\t\tconst amendedChange = rebaser.compose(\n\t\t\t\t\tfieldChange1,\n\t\t\t\t\tfieldChange2,\n\t\t\t\t\tcomposeNodes,\n\t\t\t\t\tgenId,\n\t\t\t\t\tnewCrossFieldManager(crossFieldTable, fieldChange, false),\n\t\t\t\t\trevisionMetadata,\n\t\t\t\t);\n\t\t\t\tcomposedChange.change = brand(amendedChange);\n\n\t\t\t\t// Process any newly discovered nodes.\n\t\t\t\tfor (const [taggedId1, taggedId2] of crossFieldTable.nodeIdPairs) {\n\t\t\t\t\tthis.composeNodesById(\n\t\t\t\t\t\tchange1.change.nodeChanges,\n\t\t\t\t\t\tchange2.change.nodeChanges,\n\t\t\t\t\t\tcomposedNodeChanges,\n\t\t\t\t\t\ttaggedId1?.change,\n\t\t\t\t\t\ttaggedId1?.revision,\n\t\t\t\t\t\ttaggedId2?.change,\n\t\t\t\t\t\ttaggedId2?.revision,\n\t\t\t\t\t\tgenId,\n\t\t\t\t\t\tcrossFieldTable,\n\t\t\t\t\t\trevisionMetadata,\n\t\t\t\t\t);\n\t\t\t\t}\n\n\t\t\t\tcrossFieldTable.nodeIdPairs.length = 0;\n\t\t\t}\n\t\t}\n\n\t\tconst { allBuilds, allDestroys, allRefreshers } = composeBuildsDestroysAndRefreshers([\n\t\t\tchange1,\n\t\t\tchange2,\n\t\t]);\n\n\t\treturn makeModularChangeset(\n\t\t\tthis.pruneFieldMap(composedFields, composedNodeChanges),\n\t\t\tcomposedNodeChanges,\n\t\t\tidState.maxId,\n\t\t\trevInfos,\n\t\t\tundefined,\n\t\t\tallBuilds,\n\t\t\tallDestroys,\n\t\t\tallRefreshers,\n\t\t);\n\t}\n\n\tprivate composeFieldMaps(\n\t\tchange1: FieldChangeMap \| undefined,\n\t\trevision1: RevisionTag \| undefined,\n\t\tchange2: FieldChangeMap \| undefined,\n\t\trevision2: RevisionTag \| undefined,\n\t\tgenId: IdAllocator,\n\t\tcrossFieldTable: ComposeTable,\n\t\trevisionMetadata: RevisionMetadataSource,\n\t): FieldChangeMap {\n\t\tconst composedFields: FieldChangeMap = new Map();\n\t\tconst fields = new Set<FieldKey>();\n\t\tfor (const field of change1?.keys() ?? []) {\n\t\t\tfields.add(field);\n\t\t}\n\n\t\tfor (const field of change2?.keys() ?? []) {\n\t\t\tfields.add(field);\n\t\t}\n\n\t\tfor (const field of fields) {\n\t\t\tconst fieldChange1 = change1?.get(field);\n\t\t\tconst fieldChange2 = change2?.get(field);\n\n\t\t\tconst {\n\t\t\t\tfieldKind,\n\t\t\t\tchange1: normalizedFieldChange1,\n\t\t\t\tchange2: normalizedFieldChange2,\n\t\t\t} = this.normalizeFieldChanges(fieldChange1, fieldChange2, genId, revisionMetadata);\n\n\t\t\tconst manager = newCrossFieldManager(crossFieldTable, fieldChange1 ?? fieldChange2);\n\t\t\tconst taggedChange1 = tagChange(\n\t\t\t\tnormalizedFieldChange1 ?? fieldKind.changeHandler.createEmpty(),\n\t\t\t\tfieldChange1?.revision ?? revision1,\n\t\t\t);\n\t\t\tconst taggedChange2 = tagChange(\n\t\t\t\tnormalizedFieldChange2 ?? fieldKind.changeHandler.createEmpty(),\n\t\t\t\tfieldChange2?.revision ?? revision2,\n\t\t\t);\n\n\t\t\tconst composedChange = fieldKind.changeHandler.rebaser.compose(\n\t\t\t\ttaggedChange1,\n\t\t\t\ttaggedChange2,\n\t\t\t\t(child1, child2) => {\n\t\t\t\t\tconst taggedId1 =\n\t\t\t\t\t\tchild1 !== undefined\n\t\t\t\t\t\t\t? tagChange(child1, taggedChange1.revision)\n\t\t\t\t\t\t\t: undefined;\n\n\t\t\t\t\tconst taggedId2 =\n\t\t\t\t\t\tchild2 !== undefined\n\t\t\t\t\t\t\t? tagChange(child2, taggedChange2.revision)\n\t\t\t\t\t\t\t: undefined;\n\n\t\t\t\t\tcrossFieldTable.nodeIdPairs.push([taggedId1, taggedId2]);\n\t\t\t\t\tif (child2 !== undefined) {\n\t\t\t\t\t\taddToNestedSet(crossFieldTable.nodeIds, child2.revision, child2.localId);\n\t\t\t\t\t}\n\t\t\t\t\treturn (\n\t\t\t\t\t\ttaggedOptAtomId(child1, revision1) ??\n\t\t\t\t\t\ttaggedOptAtomId(child2, revision2) ??\n\t\t\t\t\t\tfail(\"Should not compose two undefined nodes\")\n\t\t\t\t\t);\n\t\t\t\t},\n\t\t\t\tgenId,\n\t\t\t\tmanager,\n\t\t\t\trevisionMetadata,\n\t\t\t);\n\n\t\t\tconst composedField: FieldChange = {\n\t\t\t\tfieldKind: fieldKind.identifier,\n\t\t\t\tchange: brand(composedChange),\n\t\t\t};\n\n\t\t\tconst fieldKey =\n\t\t\t\tfieldChange1 ?? fieldChange2 ?? fail(\"At least one field should have changes\");\n\n\t\t\tcrossFieldTable.fieldToContext.set(fieldKey, {\n\t\t\t\tchange1: taggedChange1,\n\t\t\t\tchange2: taggedChange2,\n\t\t\t\tcomposedChange: composedField,\n\t\t\t});\n\n\t\t\t// TODO: Could optimize by checking that composedField is non-empty\n\t\t\tcomposedFields.set(field, composedField);\n\t\t}\n\n\t\treturn composedFields;\n\t}\n\n\tprivate composeNodesById(\n\t\tnodeChanges1: ChangeAtomIdMap<NodeChangeset>,\n\t\tnodeChanges2: ChangeAtomIdMap<NodeChangeset>,\n\t\tcomposedNodeChanges: ChangeAtomIdMap<NodeChangeset>,\n\t\tid1: NodeId \| undefined,\n\t\trevision1: RevisionTag \| undefined,\n\t\tid2: NodeId \| undefined,\n\t\trevision2: RevisionTag \| undefined,\n\t\tidAllocator: IdAllocator,\n\t\tcrossFieldTable: ComposeTable,\n\t\trevisionMetadata: RevisionMetadataSource,\n\t): void {\n\t\tconst nodeChangeset1 =\n\t\t\tid1 !== undefined\n\t\t\t\t? tryGetFromNestedMap(nodeChanges1, id1.revision, id1.localId) ??\n\t\t\t\t fail(\"Unknown node ID\")\n\t\t\t\t: {};\n\n\t\tconst nodeChangeset2 =\n\t\t\tid2 !== undefined\n\t\t\t\t? tryGetFromNestedMap(nodeChanges2, id2.revision, id2.localId) ??\n\t\t\t\t fail(\"Unknown node ID\")\n\t\t\t\t: {};\n\n\t\tconst composedNodeChangeset = this.composeNodeChanges(\n\t\t\tnodeChangeset1,\n\t\t\trevision1,\n\t\t\tnodeChangeset2,\n\t\t\trevision2,\n\t\t\tidAllocator,\n\t\t\tcrossFieldTable,\n\t\t\trevisionMetadata,\n\t\t);\n\n\t\tconst nodeId =\n\t\t\ttaggedOptAtomId(id1, revision1) ??\n\t\t\ttaggedOptAtomId(id2, revision2) ??\n\t\t\tfail(\"Should not compose two undefined node IDs\");\n\t\tsetInNestedMap(composedNodeChanges, nodeId.revision, nodeId.localId, composedNodeChangeset);\n\t}\n\n\tprivate composeNodeChanges(\n\t\tchange1: NodeChangeset \| undefined,\n\t\trevision1: RevisionTag \| undefined,\n\t\tchange2: NodeChangeset \| undefined,\n\t\trevision2: RevisionTag \| undefined,\n\t\tgenId: IdAllocator,\n\t\tcrossFieldTable: ComposeTable,\n\t\trevisionMetadata: RevisionMetadataSource,\n\t): NodeChangeset {\n\t\tconst nodeExistsConstraint = change1?.nodeExistsConstraint ?? change2?.nodeExistsConstraint;\n\n\t\tconst composedFieldChanges = this.composeFieldMaps(\n\t\t\tchange1?.fieldChanges,\n\t\t\trevision1,\n\t\t\tchange2?.fieldChanges,\n\t\t\trevision2,\n\t\t\tgenId,\n\t\t\tcrossFieldTable,\n\t\t\trevisionMetadata,\n\t\t);\n\t\tconst composedNodeChange: NodeChangeset = {};\n\n\t\tif (composedFieldChanges.size > 0) {\n\t\t\tcomposedNodeChange.fieldChanges = composedFieldChanges;\n\t\t}\n\n\t\tif (nodeExistsConstraint !== undefined) {\n\t\t\tcomposedNodeChange.nodeExistsConstraint = nodeExistsConstraint;\n\t\t}\n\n\t\treturn composedNodeChange;\n\t}\n\n\t/\n\t @param change - The change to invert.\n\t * @param isRollback - Whether the inverted change is meant to rollback a change on a branch as is the case when\n\t * performing a sandwich rebase.\n\t * @param repairStore - The store to query for repair data.\n\t /\n\tpublic invert(change: TaggedChange<ModularChangeset>, isRollback: boolean): ModularChangeset {\n\t\t// Return an empty inverse for changes with constraint violations\n\t\tif ((change.change.constraintViolationCount ?? 0) > 0) {\n\t\t\treturn makeModularChangeset();\n\t\t}\n\n\t\tconst idState: IdAllocationState = { maxId: change.change.maxId ?? -1 };\n\t\t// This idState is used for the whole of the IdAllocator's lifetime, which allows\n\t\t// this function to read the updated idState.maxId after more IDs are allocated.\n\t\t// TODO: add a getMax function to IdAllocator to make for a clearer contract.\n\t\tconst genId: IdAllocator = idAllocatorFromState(idState);\n\t\tconst crossFieldTable: InvertTable = {\n\t\t\t...newCrossFieldTable<FieldChange>(),\n\t\t\toriginalFieldToContext: new Map(),\n\t\t};\n\n\t\tconst { revInfos } = getRevInfoFromTaggedChanges([change]);\n\t\tconst revisionMetadata = revisionMetadataSourceFromInfo(revInfos);\n\n\t\tconst invertedFields = this.invertFieldMap(\n\t\t\ttagChange(change.change.fieldChanges, revisionFromTaggedChange(change)),\n\t\t\tisRollback,\n\t\t\tgenId,\n\t\t\tcrossFieldTable,\n\t\t\trevisionMetadata,\n\t\t);\n\n\t\tconst invertedNodes: ChangeAtomIdMap<NodeChangeset> = new Map();\n\t\tforEachInNestedMap(change.change.nodeChanges, (nodeChangeset, revision, localId) => {\n\t\t\tsetInNestedMap(\n\t\t\t\tinvertedNodes,\n\t\t\t\trevision,\n\t\t\t\tlocalId,\n\t\t\t\tthis.invertNodeChange(\n\t\t\t\t\t// TODO: This does not allow inheriting revision from parent\n\t\t\t\t\ttagChange(nodeChangeset, change.revision),\n\t\t\t\t\tisRollback,\n\t\t\t\t\tgenId,\n\t\t\t\t\tcrossFieldTable,\n\t\t\t\t\trevisionMetadata,\n\t\t\t\t),\n\t\t\t);\n\t\t});\n\n\t\tif (crossFieldTable.invalidatedFields.size > 0) {\n\t\t\tconst fieldsToUpdate = crossFieldTable.invalidatedFields;\n\t\t\tcrossFieldTable.invalidatedFields = new Set();\n\t\t\tfor (const fieldChange of fieldsToUpdate) {\n\t\t\t\tconst originalFieldChange = fieldChange.change;\n\t\t\t\tconst context = crossFieldTable.originalFieldToContext.get(fieldChange);\n\t\t\t\tassert(\n\t\t\t\t\tcontext !== undefined,\n\t\t\t\t\t0x851 / Should have context for every invalidated field /,\n\t\t\t\t);\n\t\t\t\tconst { invertedField, revision } = context;\n\n\t\t\t\tconst amendedChange = getChangeHandler(\n\t\t\t\t\tthis.fieldKinds,\n\t\t\t\t\tfieldChange.fieldKind,\n\t\t\t\t).rebaser.invert(\n\t\t\t\t\ttagChange(originalFieldChange, revision),\n\t\t\t\t\tisRollback,\n\t\t\t\t\tgenId,\n\t\t\t\t\tnewCrossFieldManager(crossFieldTable, fieldChange),\n\t\t\t\t\trevisionMetadata,\n\t\t\t\t);\n\t\t\t\tinvertedField.change = brand(amendedChange);\n\t\t\t}\n\t\t}\n\n\t\t// Rollback changesets destroy the nodes created by the change being rolled back.\n\t\tconst destroys = isRollback\n\t\t\t? invertBuilds(change.change.builds, change.revision)\n\t\t\t: undefined;\n\n\t\t// Destroys only occur in rollback changesets, which are never inverted.\n\t\tassert(\n\t\t\tchange.change.destroys === undefined,\n\t\t\t0x89a / Unexpected destroys in change to invert /,\n\t\t);\n\n\t\tconst revInfo = change.change.revisions;\n\t\treturn makeModularChangeset(\n\t\t\tinvertedFields,\n\t\t\tinvertedNodes,\n\t\t\tidState.maxId,\n\t\t\trevInfo === undefined\n\t\t\t\t? undefined\n\t\t\t\t: (isRollback\n\t\t\t\t\t\t? revInfo.map(({ revision }) => ({ revision, rollbackOf: revision }))\n\t\t\t\t\t\t: Array.from(revInfo)\n\t\t\t\t ).reverse(),\n\t\t\tchange.change.constraintViolationCount,\n\t\t\tundefined,\n\t\t\tdestroys,\n\t\t);\n\t}\n\n\tprivate invertFieldMap(\n\t\tchanges: TaggedChange<FieldChangeMap>,\n\t\tisRollback: boolean,\n\t\tgenId: IdAllocator,\n\t\tcrossFieldTable: InvertTable,\n\t\trevisionMetadata: RevisionMetadataSource,\n\t): FieldChangeMap {\n\t\tconst invertedFields: FieldChangeMap = new Map();\n\n\t\tfor (const [field, fieldChange] of changes.change) {\n\t\t\tconst { revision } = fieldChange.revision !== undefined ? fieldChange : changes;\n\n\t\t\tconst manager = newCrossFieldManager(crossFieldTable, fieldChange);\n\t\t\tconst invertedChange = getChangeHandler(\n\t\t\t\tthis.fieldKinds,\n\t\t\t\tfieldChange.fieldKind,\n\t\t\t).rebaser.invert(\n\t\t\t\t{ revision, change: fieldChange.change },\n\t\t\t\tisRollback,\n\t\t\t\tgenId,\n\t\t\t\tmanager,\n\t\t\t\trevisionMetadata,\n\t\t\t);\n\n\t\t\tconst invertedFieldChange: FieldChange = {\n\t\t\t\t...fieldChange,\n\t\t\t\tchange: brand(invertedChange),\n\t\t\t};\n\t\t\tinvertedFields.set(field, invertedFieldChange);\n\n\t\t\tcrossFieldTable.originalFieldToContext.set(fieldChange, {\n\t\t\t\tinvertedField: invertedFieldChange,\n\t\t\t\trevision,\n\t\t\t});\n\t\t}\n\n\t\treturn invertedFields;\n\t}\n\n\tprivate invertNodeChange(\n\t\tchange: TaggedChange<NodeChangeset>,\n\t\tisRollback: boolean,\n\t\tgenId: IdAllocator,\n\t\tcrossFieldTable: InvertTable,\n\t\trevisionMetadata: RevisionMetadataSource,\n\t): NodeChangeset {\n\t\tconst inverse: NodeChangeset = {};\n\n\t\tif (change.change.fieldChanges !== undefined) {\n\t\t\tinverse.fieldChanges = this.invertFieldMap(\n\t\t\t\t{ ...change, change: change.change.fieldChanges },\n\t\t\t\tisRollback,\n\t\t\t\tgenId,\n\t\t\t\tcrossFieldTable,\n\t\t\t\trevisionMetadata,\n\t\t\t);\n\t\t}\n\n\t\treturn inverse;\n\t}\n\n\tpublic rebase(\n\t\tchange: ModularChangeset,\n\t\tover: TaggedChange<ModularChangeset>,\n\t\trevisionMetadata: RevisionMetadataSource,\n\t): ModularChangeset {\n\t\tconst maxId = Math.max(change.maxId ?? -1, over.change.maxId ?? -1);\n\t\tconst idState: IdAllocationState = { maxId };\n\t\tconst genId: IdAllocator = idAllocatorFromState(idState);\n\t\tconst crossFieldTable: RebaseTable = {\n\t\t\t...newCrossFieldTable<FieldChange>(),\n\t\t\tfieldToContext: new Map(),\n\t\t\trebasedNodeCache: new Map(),\n\t\t\tnodeIdPairs: [],\n\t\t};\n\n\t\tlet constraintState = newConstraintState(change.constraintViolationCount ?? 0);\n\n\t\tconst getBaseRevisions = () =>\n\t\t\trevisionInfoFromTaggedChange(over).map((info) => info.revision);\n\n\t\tconst rebaseMetadata = {\n\t\t\t...revisionMetadata,\n\t\t\tgetBaseRevisions,\n\t\t};\n\n\t\tconst rebasedFields = this.rebaseFieldMap(\n\t\t\tchange.fieldChanges,\n\t\t\ttagChange(over.change.fieldChanges, revisionFromTaggedChange(over)),\n\t\t\tgenId,\n\t\t\tcrossFieldTable,\n\t\t\t() => true,\n\t\t\trebaseMetadata,\n\t\t\tconstraintState,\n\t\t);\n\n\t\tconst rebasedNodes: ChangeAtomIdMap<NodeChangeset> = new Map();\n\t\tfor (const [newId, taggedBaseId, existenceState] of crossFieldTable.nodeIdPairs) {\n\t\t\tconst newNodeChange =\n\t\t\t\tnewId !== undefined\n\t\t\t\t\t? tryGetFromNestedMap(change.nodeChanges, newId.revision, newId.localId)\n\t\t\t\t\t: undefined;\n\n\t\t\tconst taggedBaseNodeChange =\n\t\t\t\ttaggedBaseId !== undefined\n\t\t\t\t\t? tagChange(\n\t\t\t\t\t\t\ttryGetFromNestedMap(\n\t\t\t\t\t\t\t\tover.change.nodeChanges,\n\t\t\t\t\t\t\t\ttaggedBaseId.change.revision,\n\t\t\t\t\t\t\t\ttaggedBaseId.change.localId,\n\t\t\t\t\t\t\t) ?? fail(\"Unknown node ID\"),\n\t\t\t\t\t\t\ttaggedBaseId.revision,\n\t\t\t\t\t )\n\t\t\t\t\t: makeAnonChange({});\n\n\t\t\tconst rebasedNode = this.rebaseNodeChange(\n\t\t\t\tnewNodeChange,\n\t\t\t\ttaggedBaseNodeChange,\n\t\t\t\tgenId,\n\t\t\t\tcrossFieldTable,\n\t\t\t\t() => true,\n\t\t\t\trebaseMetadata,\n\t\t\t\tconstraintState,\n\t\t\t\texistenceState,\n\t\t\t);\n\n\t\t\tif (rebasedNode !== undefined) {\n\t\t\t\tconst nodeId =\n\t\t\t\t\tnewId ??\n\t\t\t\t\ttaggedAtomId(\n\t\t\t\t\t\ttaggedBaseId?.change ?? fail(\"Should not have two undefined IDs\"),\n\t\t\t\t\t\ttaggedBaseId?.revision,\n\t\t\t\t\t);\n\n\t\t\t\tsetInNestedMap(rebasedNodes, nodeId.revision, nodeId.localId, rebasedNode);\n\t\t\t}\n\t\t}\n\n\t\tif (crossFieldTable.invalidatedFields.size > 0) {\n\t\t\tconst fieldsToUpdate = crossFieldTable.invalidatedFields;\n\t\t\tcrossFieldTable.invalidatedFields = new Set();\n\t\t\tconstraintState = newConstraintState(change.constraintViolationCount ?? 0);\n\t\t\tfor (const field of fieldsToUpdate) {\n\t\t\t\t// TODO: Should we copy the context table out before this loop?\n\t\t\t\tconst context = crossFieldTable.fieldToContext.get(field);\n\t\t\t\tassert(context !== undefined, 0x852 / Every field should have a context /);\n\t\t\t\tconst {\n\t\t\t\t\tfieldKind,\n\t\t\t\t\tchange1: fieldChangeset,\n\t\t\t\t\tchange2: baseChangeset,\n\t\t\t\t} = this.normalizeFieldChanges(\n\t\t\t\t\tcontext.newChange,\n\t\t\t\t\tcontext.baseChange,\n\t\t\t\t\tgenId,\n\t\t\t\t\trevisionMetadata,\n\t\t\t\t);\n\n\t\t\t\tcontext.rebasedChange.change = fieldKind.changeHandler.rebaser.rebase(\n\t\t\t\t\tfieldChangeset,\n\t\t\t\t\ttagChange(baseChangeset, context.baseRevision),\n\t\t\t\t\t(curr, base, existenceState) => curr,\n\t\t\t\t\tgenId,\n\t\t\t\t\tnewCrossFieldManager(crossFieldTable, field),\n\t\t\t\t\trebaseMetadata,\n\t\t\t\t);\n\t\t\t}\n\t\t}\n\n\t\treturn makeModularChangeset(\n\t\t\tthis.pruneFieldMap(rebasedFields, rebasedNodes),\n\t\t\trebasedNodes,\n\t\t\tidState.maxId,\n\t\t\tchange.revisions,\n\t\t\tconstraintState.violationCount,\n\t\t\tchange.builds,\n\t\t\tchange.destroys,\n\t\t\tchange.refreshers,\n\t\t);\n\t}\n\n\tprivate rebaseFieldMap(\n\t\tchange: FieldChangeMap,\n\t\tover: TaggedChange<FieldChangeMap>,\n\t\tgenId: IdAllocator,\n\t\tcrossFieldTable: RebaseTable,\n\t\tfieldFilter: (baseChange: FieldChange, newChange: FieldChange \| undefined) => boolean,\n\t\trevisionMetadata: RebaseRevisionMetadata,\n\t\tconstraintState: ConstraintState,\n\t\texistenceState: NodeExistenceState = NodeExistenceState.Alive,\n\t): FieldChangeMap {\n\t\tconst rebasedFields: FieldChangeMap = new Map();\n\n\t\t// Rebase fields contained in the base changeset\n\t\tfor (const [field, baseChanges] of over.change) {\n\t\t\tif (!fieldFilter(baseChanges, change.get(field))) {\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tconst fieldChange: FieldChange = change.get(field) ?? {\n\t\t\t\tfieldKind: genericFieldKind.identifier,\n\t\t\t\tchange: brand(newGenericChangeset()),\n\t\t\t};\n\t\t\tconst {\n\t\t\t\tfieldKind,\n\t\t\t\tchange1: fieldChangeset,\n\t\t\t\tchange2: baseChangeset,\n\t\t\t} = this.normalizeFieldChanges(fieldChange, baseChanges, genId, revisionMetadata);\n\n\t\t\tconst { revision } = over;\n\t\t\tconst taggedBaseChange = { revision, change: baseChangeset };\n\n\t\t\tconst manager = newCrossFieldManager(crossFieldTable, fieldChange);\n\n\t\t\tconst rebaseChild = (\n\t\t\t\tchild: NodeId \| undefined,\n\t\t\t\tbaseChild: NodeId \| undefined,\n\t\t\t\tstateChange: NodeExistenceState \| undefined,\n\t\t\t) => {\n\t\t\t\tconst taggedBase =\n\t\t\t\t\tbaseChild !== undefined ? tagChange(baseChild, over.revision) : undefined;\n\n\t\t\t\tcrossFieldTable.nodeIdPairs.push([child, taggedBase, stateChange]);\n\t\t\t\treturn (\n\t\t\t\t\tchild ??\n\t\t\t\t\t// The fact `child` is undefined means that the changeset to rebase does not include changes for\n\t\t\t\t\t// this node or its descendants. However, it's possible that it will after rebasing.\n\t\t\t\t\t// In that case, we will need a NodeId to represent these changes under in the rebased changeset.\n\t\t\t\t\t// We adopt `baseChild` for this purpose.\n\t\t\t\t\ttaggedAtomId(\n\t\t\t\t\t\tbaseChild ?? fail(\"Should not have two undefined node IDs\"),\n\t\t\t\t\t\tover.revision,\n\t\t\t\t\t)\n\t\t\t\t);\n\t\t\t};\n\n\t\t\tconst rebasedField = fieldKind.changeHandler.rebaser.rebase(\n\t\t\t\tfieldChangeset,\n\t\t\t\ttaggedBaseChange,\n\t\t\t\trebaseChild,\n\t\t\t\tgenId,\n\t\t\t\tmanager,\n\t\t\t\trevisionMetadata,\n\t\t\t);\n\n\t\t\tconst rebasedFieldChange: FieldChange = {\n\t\t\t\tfieldKind: fieldKind.identifier,\n\t\t\t\tchange: brand(rebasedField),\n\t\t\t};\n\n\t\t\trebasedFields.set(field, rebasedFieldChange);\n\n\t\t\tcrossFieldTable.fieldToContext.set(fieldChange, {\n\t\t\t\tbaseChange: baseChanges,\n\t\t\t\tbaseRevision: revision,\n\t\t\t\tnewChange: fieldChange,\n\t\t\t\trebasedChange: rebasedFieldChange,\n\t\t\t});\n\t\t}\n\n\t\t// Rebase the fields of the new changeset which don't have a corresponding base field.\n\t\tfor (const [field, fieldChange] of change) {\n\t\t\tif (!over.change?.has(field)) {\n\t\t\t\tconst baseChanges: FieldChange = {\n\t\t\t\t\tfieldKind: genericFieldKind.identifier,\n\t\t\t\t\tchange: brand(newGenericChangeset()),\n\t\t\t\t};\n\n\t\t\t\tconst {\n\t\t\t\t\tfieldKind,\n\t\t\t\t\tchange1: fieldChangeset,\n\t\t\t\t\tchange2: baseChangeset,\n\t\t\t\t} = this.normalizeFieldChanges(fieldChange, baseChanges, genId, revisionMetadata);\n\n\t\t\t\t// TODO: Don't we need to add an entry in the context table?\n\t\t\t\tconst manager = newCrossFieldManager(crossFieldTable, fieldChange);\n\t\t\t\tconst rebasedChangeset = fieldKind.changeHandler.rebaser.rebase(\n\t\t\t\t\tfieldChangeset,\n\t\t\t\t\ttagChange(baseChangeset, over.revision),\n\t\t\t\t\t(child, baseChild) => {\n\t\t\t\t\t\tassert(\n\t\t\t\t\t\t\tbaseChild === undefined,\n\t\t\t\t\t\t\t0x5b6 / This field should not have any base changes /,\n\t\t\t\t\t\t);\n\n\t\t\t\t\t\tcrossFieldTable.nodeIdPairs.push([child, undefined, existenceState]);\n\t\t\t\t\t\treturn child;\n\t\t\t\t\t},\n\t\t\t\t\tgenId,\n\t\t\t\t\tmanager,\n\t\t\t\t\trevisionMetadata,\n\t\t\t\t\texistenceState,\n\t\t\t\t);\n\t\t\t\tconst rebasedFieldChange: FieldChange = {\n\t\t\t\t\tfieldKind: fieldKind.identifier,\n\t\t\t\t\tchange: brand(rebasedChangeset),\n\t\t\t\t};\n\t\t\t\trebasedFields.set(field, rebasedFieldChange);\n\t\t\t}\n\t\t}\n\n\t\treturn rebasedFields;\n\t}\n\n\tprivate rebaseNodeChange(\n\t\tchange: NodeChangeset \| undefined,\n\t\tover: TaggedChange<NodeChangeset \| undefined>,\n\t\tgenId: IdAllocator,\n\t\tcrossFieldTable: RebaseTable,\n\t\tfieldFilter: (baseChange: FieldChange, newChange: FieldChange \| undefined) => boolean,\n\t\trevisionMetadata: RebaseRevisionMetadata,\n\t\tconstraintState: ConstraintState,\n\t\texistenceState: NodeExistenceState = NodeExistenceState.Alive,\n\t): NodeChangeset \| undefined {\n\t\tconst key = change ?? over.change;\n\t\tif (key === undefined) {\n\t\t\treturn undefined;\n\t\t}\n\n\t\tconst baseMap: TaggedChange<FieldChangeMap> =\n\t\t\tover.change?.fieldChanges !== undefined\n\t\t\t\t? {\n\t\t\t\t\t\t...over,\n\t\t\t\t\t\tchange: over.change.fieldChanges,\n\t\t\t\t }\n\t\t\t\t: tagChange(new Map(), over.revision);\n\n\t\tconst fieldChanges = this.rebaseFieldMap(\n\t\t\tchange?.fieldChanges ?? new Map(),\n\t\t\tbaseMap,\n\t\t\tgenId,\n\t\t\tcrossFieldTable,\n\t\t\tfieldFilter,\n\t\t\trevisionMetadata,\n\t\t\tconstraintState,\n\t\t\texistenceState,\n\t\t);\n\n\t\tconst rebasedChange: NodeChangeset = {};\n\n\t\tif (fieldChanges.size > 0) {\n\t\t\trebasedChange.fieldChanges = fieldChanges;\n\t\t}\n\n\t\tif (change?.nodeExistsConstraint !== undefined) {\n\t\t\trebasedChange.nodeExistsConstraint = change.nodeExistsConstraint;\n\t\t}\n\n\t\t// If there's a node exists constraint and we removed or revived the node, update constraint state\n\t\tif (rebasedChange.nodeExistsConstraint !== undefined) {\n\t\t\tconst violatedAfter = existenceState === NodeExistenceState.Dead;\n\n\t\t\tif (rebasedChange.nodeExistsConstraint.violated !== violatedAfter) {\n\t\t\t\trebasedChange.nodeExistsConstraint = {\n\t\t\t\t\t...rebasedChange.nodeExistsConstraint,\n\t\t\t\t\tviolated: violatedAfter,\n\t\t\t\t};\n\t\t\t\tconstraintState.violationCount += violatedAfter ? 1 : -1;\n\t\t\t}\n\t\t}\n\n\t\tcrossFieldTable.rebasedNodeCache.set(key, rebasedChange);\n\t\treturn rebasedChange;\n\t}\n\n\tprivate pruneFieldMap(\n\t\tchangeset: FieldChangeMap,\n\t\tnodeMap: ChangeAtomIdMap<NodeChangeset>,\n\t): FieldChangeMap \| undefined {\n\t\tconst prunedChangeset: FieldChangeMap = new Map();\n\t\tfor (const [field, fieldChange] of changeset) {\n\t\t\tconst handler = getChangeHandler(this.fieldKinds, fieldChange.fieldKind);\n\n\t\t\tconst prunedFieldChangeset = handler.rebaser.prune(fieldChange.change, (nodeId) =>\n\t\t\t\tthis.pruneNodeChange(nodeId, nodeMap),\n\t\t\t);\n\n\t\t\tif (!handler.isEmpty(prunedFieldChangeset)) {\n\t\t\t\tprunedChangeset.set(field, { ...fieldChange, change: brand(prunedFieldChangeset) });\n\t\t\t}\n\t\t}\n\n\t\treturn prunedChangeset.size > 0 ? prunedChangeset : undefined;\n\t}\n\n\tprivate pruneNodeChange(\n\t\tnodeId: NodeId,\n\t\tnodeMap: ChangeAtomIdMap<NodeChangeset>,\n\t): NodeId \| undefined {\n\t\tconst changeset = tryGetFromNestedMap(nodeMap, nodeId.revision, nodeId.localId);\n\t\tassert(changeset !== undefined, 0x930 / Unknown node ID /);\n\n\t\tconst prunedFields =\n\t\t\tchangeset.fieldChanges !== undefined\n\t\t\t\t? this.pruneFieldMap(changeset.fieldChanges, nodeMap)\n\t\t\t\t: undefined;\n\n\t\tconst prunedChange = { ...changeset, fieldChanges: prunedFields };\n\t\tif (prunedChange.fieldChanges === undefined) {\n\t\t\tdelete prunedChange.fieldChanges;\n\t\t}\n\n\t\tif (isEmptyNodeChangeset(prunedChange)) {\n\t\t\tdeleteFromNestedMap(nodeMap, nodeId.revision, nodeId.localId);\n\t\t\treturn undefined;\n\t\t} else {\n\t\t\tsetInNestedMap(nodeMap, nodeId.revision, nodeId.localId, prunedChange);\n\t\t\treturn nodeId;\n\t\t}\n\t}\n\n\tpublic buildEditor(changeReceiver: (change: ModularChangeset) => void): ModularEditBuilder {\n\t\treturn new ModularEditBuilder(this, changeReceiver);\n\t}\n}\n\nfunction composeBuildsDestroysAndRefreshers(changes: TaggedChange<ModularChangeset>[]) {\n\tconst allBuilds: ChangeAtomIdMap<TreeChunk> = new Map();\n\tconst allDestroys: ChangeAtomIdMap<number> = new Map();\n\tconst allRefreshers: ChangeAtomIdMap<TreeChunk> = new Map();\n\tfor (const taggedChange of changes) {\n\t\tconst revision = revisionFromTaggedChange(taggedChange);\n\t\tconst change = taggedChange.change;\n\t\tif (change.builds) {\n\t\t\tfor (const [revisionKey, innerMap] of change.builds) {\n\t\t\t\tconst setRevisionKey = revisionKey ?? revision;\n\t\t\t\tconst innerDstMap = getOrAddInMap(\n\t\t\t\t\tallBuilds,\n\t\t\t\t\tsetRevisionKey,\n\t\t\t\t\tnew Map<ChangesetLocalId, TreeChunk>(),\n\t\t\t\t);\n\t\t\t\tfor (const [id, chunk] of innerMap) {\n\t\t\t\t\t// Check for duplicate builds and prefer earlier ones.\n\t\t\t\t\t// This can happen in compositions of commits that needed to include repair data refreshers (e.g., undos):\n\t\t\t\t\t// In that case, it's possible for the refreshers to contain different trees because the latter\n\t\t\t\t\t// refresher may already reflect the changes made by the commit that includes the earlier\n\t\t\t\t\t// refresher. This composition includes the changes made by the commit that includes the\n\t\t\t\t\t// earlier refresher, so we need to include the build for the earlier refresher, otherwise\n\t\t\t\t\t// the produced changeset will build a tree one which those changes have already been applied\n\t\t\t\t\t// and also try to apply the changes again, effectively applying them twice.\n\t\t\t\t\t// Note that it would in principle be possible to adopt the later build and exclude from the\n\t\t\t\t\t// composition all the changes already reflected on the tree, but that is not something we\n\t\t\t\t\t// care to support at this time.\n\t\t\t\t\tif (!innerDstMap.has(id)) {\n\t\t\t\t\t\t// Check for earlier destroys that this build might cancel-out with.\n\t\t\t\t\t\tconst destroyCount = tryGetFromNestedMap(allDestroys, setRevisionKey, id);\n\t\t\t\t\t\tif (destroyCount === undefined) {\n\t\t\t\t\t\t\tinnerDstMap.set(id, chunk);\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tassert(\n\t\t\t\t\t\t\t\tdestroyCount === chunk.topLevelLength,\n\t\t\t\t\t\t\t\t0x89b / Expected build and destroy to have the same length /,\n\t\t\t\t\t\t\t);\n\t\t\t\t\t\t\tdeleteFromNestedMap(allDestroys, setRevisionKey, id);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (innerDstMap.size === 0) {\n\t\t\t\t\tallBuilds.delete(setRevisionKey);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (change.destroys !== undefined) {\n\t\t\tfor (const [revisionKey, innerMap] of change.destroys) {\n\t\t\t\tconst setRevisionKey = revisionKey ?? revision;\n\t\t\t\tconst innerDstMap = getOrAddInMap(\n\t\t\t\t\tallDestroys,\n\t\t\t\t\tsetRevisionKey,\n\t\t\t\t\tnew Map<ChangesetLocalId, number>(),\n\t\t\t\t);\n\t\t\t\tfor (const [id, count] of innerMap) {\n\t\t\t\t\t// Check for earlier builds that this destroy might cancel-out with.\n\t\t\t\t\tconst chunk = tryGetFromNestedMap(allBuilds, setRevisionKey, id);\n\t\t\t\t\tif (chunk === undefined) {\n\t\t\t\t\t\tinnerDstMap.set(id, count);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tassert(\n\t\t\t\t\t\t\tcount === chunk.topLevelLength,\n\t\t\t\t\t\t\t0x89c / Expected build and destroy to have the same length /,\n\t\t\t\t\t\t);\n\t\t\t\t\t\tdeleteFromNestedMap(allBuilds, setRevisionKey, id);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (innerDstMap.size === 0) {\n\t\t\t\t\tallDestroys.delete(setRevisionKey);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t// add all refreshers while preferring earlier ones\n\t\tif (change.refreshers) {\n\t\t\tpopulateNestedMap(change.refreshers, allRefreshers, false);\n\t\t}\n\t}\n\treturn { allBuilds, allDestroys, allRefreshers };\n}\n\nfunction invertBuilds(\n\tbuilds: ChangeAtomIdMap<TreeChunk> \| undefined,\n\tfallbackRevision: RevisionTag \| undefined,\n): ChangeAtomIdMap<number> \| undefined {\n\tif (builds !== undefined) {\n\t\tconst destroys: ChangeAtomIdMap<number> = new Map();\n\t\tfor (const [revision, innerBuildMap] of builds) {\n\t\t\tconst initializedRevision = revision ?? fallbackRevision;\n\t\t\tconst innerDestroyMap: Map<ChangesetLocalId, number> = new Map();\n\t\t\tfor (const [id, chunk] of innerBuildMap) {\n\t\t\t\tinnerDestroyMap.set(id, chunk.topLevelLength);\n\t\t\t}\n\t\t\tdestroys.set(initializedRevision, innerDestroyMap);\n\t\t}\n\t\treturn destroys;\n\t}\n\treturn undefined;\n}\n\n/\n Returns the set of removed roots that should be in memory for the given change to be applied.\n * A removed root is relevant if any of the following is true:\n * - It is being inserted\n * - It is being restored\n * - It is being edited\n * - The ID it is associated with is being changed\n \n May be conservative by returning more removed roots than strictly necessary.\n \n Will never return IDs for non-root trees, even if they are removed.\n \n @param change - The change to be applied.\n * @param fieldKinds - The field kinds to delegate to.\n /\nexport function relevantRemovedRoots(\n\t{ change, revision }: TaggedChange<ModularChangeset>,\n\tfieldKinds: ReadonlyMap<FieldKindIdentifier, FieldKindWithEditor>,\n): Iterable<DeltaDetachedNodeId> {\n\tyield* relevantRemovedRootsFromFields(\n\t\tchange.fieldChanges,\n\t\trevision,\n\t\tchange.nodeChanges,\n\t\tfieldKinds,\n\t);\n}\n\nfunction* relevantRemovedRootsFromFields(\n\tchange: FieldChangeMap,\n\trevision: RevisionTag \| undefined,\n\tnodeChanges: ChangeAtomIdMap<NodeChangeset>,\n\tfieldKinds: ReadonlyMap<FieldKindIdentifier, FieldKindWithEditor>,\n): Iterable<DeltaDetachedNodeId> {\n\tfor (const [_, fieldChange] of change) {\n\t\tconst fieldRevision = fieldChange.revision ?? revision;\n\t\tconst handler = getChangeHandler(fieldKinds, fieldChange.fieldKind);\n\t\tconst delegate = function* (node: NodeId): Iterable<DeltaDetachedNodeId> {\n\t\t\tconst nodeChangeset = tryGetFromNestedMap(nodeChanges, node.revision, node.localId);\n\t\t\tassert(nodeChangeset !== undefined, 0x931 /* Unknown node ID /);\n\t\t\tif (nodeChangeset.fieldChanges !== undefined) {\n\t\t\t\tyield relevantRemovedRootsFromFields(\n\t\t\t\t\tnodeChangeset.fieldChanges,\n\t\t\t\t\tfieldRevision,\n\t\t\t\t\tnodeChanges,\n\t\t\t\t\tfieldKinds,\n\t\t\t\t);\n\t\t\t}\n\t\t};\n\t\tyield* handler.relevantRemovedRoots(tagChange(fieldChange.change, fieldRevision), delegate);\n\t}\n}\n\n/*\n Adds any refreshers missing from the provided change that are relevant to the change and\n * removes any refreshers from the provided change that are not relevant to the change.\n * This function enforces that all relevant removed roots have a corresponding build or refresher.\n \n @param change - The change that possibly has missing or superfluous refreshers. Not mutated by this function.\n * @param getDetachedNode - The function to retrieve a tree chunk from the corresponding detached node id.\n * @param removedRoots - The set of removed roots that should be in memory for the given change to be applied.\n * Can be retrieved by calling {@link relevantRemovedRoots}.\n /\nexport function updateRefreshers(\n\t{ change, revision }: TaggedChange<ModularChangeset>,\n\tgetDetachedNode: (id: DeltaDetachedNodeId) => TreeChunk \| undefined,\n\tremovedRoots: Iterable<DeltaDetachedNodeId>,\n): ModularChangeset {\n\tconst refreshers: ChangeAtomIdMap<TreeChunk> = new Map();\n\tconst chunkLengths: Map<RevisionTag \| undefined, BTree<number, number>> = new Map();\n\n\tif (change.builds !== undefined) {\n\t\tfor (const [major, buildsMap] of change.builds) {\n\t\t\tconst lengthTree = getOrAddInMap(chunkLengths, major, new BTree());\n\t\t\tfor (const [id, chunk] of buildsMap) {\n\t\t\t\tlengthTree.set(id, chunk.topLevelLength);\n\t\t\t}\n\t\t}\n\t}\n\n\tfor (const root of removedRoots) {\n\t\tif (change.builds !== undefined) {\n\t\t\tconst major = root.major === revision ? undefined : root.major;\n\t\t\tconst lengthTree = chunkLengths.get(major);\n\n\t\t\tif (lengthTree !== undefined) {\n\t\t\t\tconst lengthPair = lengthTree.getPairOrNextLower(root.minor);\n\t\t\t\tif (lengthPair !== undefined) {\n\t\t\t\t\tconst [firstMinor, length] = lengthPair;\n\n\t\t\t\t\t// if the root minor is within the length of the minor of the retrieved pair\n\t\t\t\t\t// then there's no need to check for the detached node\n\t\t\t\t\tif (root.minor < firstMinor + length) {\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tconst node = getDetachedNode(root);\n\t\tassert(node !== undefined, 0x8cd / detached node should exist /);\n\t\tsetInNestedMap(refreshers, root.major, root.minor, node);\n\t}\n\n\tconst {\n\t\tfieldChanges,\n\t\tnodeChanges,\n\t\tmaxId,\n\t\trevisions,\n\t\tconstraintViolationCount,\n\t\tbuilds,\n\t\tdestroys,\n\t} = change;\n\n\treturn makeModularChangeset(\n\t\tfieldChanges,\n\t\tnodeChanges,\n\t\tmaxId,\n\t\trevisions,\n\t\tconstraintViolationCount,\n\t\tbuilds,\n\t\tdestroys,\n\t\trefreshers,\n\t);\n}\n\n/\n @param change - The change to convert into a delta.\n * @param fieldKinds - The field kinds to delegate to.\n /\nexport function intoDelta(\n\ttaggedChange: TaggedChange<ModularChangeset>,\n\tfieldKinds: ReadonlyMap<FieldKindIdentifier, FieldKindWithEditor>,\n): DeltaRoot {\n\tconst change = taggedChange.change;\n\t// Return an empty delta for changes with constraint violations\n\tif ((change.constraintViolationCount ?? 0) > 0) {\n\t\treturn emptyDelta;\n\t}\n\n\tconst revision = revisionFromTaggedChange(taggedChange);\n\tconst idAllocator = MemoizedIdRangeAllocator.fromNextId();\n\tconst rootDelta: Mutable<DeltaRoot> = {};\n\tconst fieldDeltas = intoDeltaImpl(\n\t\tchange.fieldChanges,\n\t\trevision,\n\t\tchange.nodeChanges,\n\t\tidAllocator,\n\t\tfieldKinds,\n\t);\n\tif (fieldDeltas.size > 0) {\n\t\trootDelta.fields = fieldDeltas;\n\t}\n\tif (change.builds && change.builds.size > 0) {\n\t\trootDelta.build = copyDetachedNodes(change.builds, revision);\n\t}\n\tif (change.destroys !== undefined && change.destroys.size > 0) {\n\t\tconst destroys: DeltaDetachedNodeDestruction[] = [];\n\t\tforEachInNestedMap(change.destroys, (count, major, minor) => {\n\t\t\tdestroys.push({\n\t\t\t\tid: makeDetachedNodeId(major ?? revision, minor),\n\t\t\t\tcount,\n\t\t\t});\n\t\t});\n\t\trootDelta.destroy = destroys;\n\t}\n\tif (change.refreshers && change.refreshers.size > 0) {\n\t\trootDelta.refreshers = copyDetachedNodes(change.refreshers, revision);\n\t}\n\treturn rootDelta;\n}\n\nfunction copyDetachedNodes(detachedNodes: ChangeAtomIdMap<TreeChunk>, revision?: RevisionTag) {\n\tconst copiedDetachedNodes: DeltaDetachedNodeBuild[] = [];\n\tforEachInNestedMap(detachedNodes, (chunk, major, minor) => {\n\t\tif (chunk.topLevelLength > 0) {\n\t\t\tconst trees = mapCursorField(chunk.cursor(), (c) =>\n\t\t\t\tcursorForMapTreeNode(mapTreeFromCursor(c)),\n\t\t\t);\n\t\t\tcopiedDetachedNodes.push({\n\t\t\t\tid: makeDetachedNodeId(major ?? revision, minor),\n\t\t\t\ttrees,\n\t\t\t});\n\t\t}\n\t});\n\treturn copiedDetachedNodes.length > 0 ? copiedDetachedNodes : undefined;\n}\n\n/\n @param change - The change to convert into a delta.\n * @param repairStore - The store to query for repair data.\n * @param path - The path of the node being altered by the change as defined by the input context.\n * Undefined for the root and for nodes that do not exist in the input context.\n /\nfunction intoDeltaImpl(\n\tchange: FieldChangeMap,\n\trevision: RevisionTag \| undefined,\n\tnodeChanges: ChangeAtomIdMap<NodeChangeset>,\n\tidAllocator: MemoizedIdRangeAllocator,\n\tfieldKinds: ReadonlyMap<FieldKindIdentifier, FieldKindWithEditor>,\n): Map<FieldKey, DeltaFieldChanges> {\n\tconst delta: Map<FieldKey, DeltaFieldChanges> = new Map();\n\tfor (const [field, fieldChange] of change) {\n\t\tconst fieldRevision = fieldChange.revision ?? revision;\n\t\tconst deltaField = getChangeHandler(fieldKinds, fieldChange.fieldKind).intoDelta(\n\t\t\ttagChange(fieldChange.change, fieldRevision),\n\t\t\t(childChange): DeltaFieldMap => {\n\t\t\t\tconst nodeChange = tryGetFromNestedMap(\n\t\t\t\t\tnodeChanges,\n\t\t\t\t\tchildChange.revision,\n\t\t\t\t\tchildChange.localId,\n\t\t\t\t);\n\n\t\t\t\tassert(nodeChange !== undefined, 0x932 / Unknown node ID /);\n\t\t\t\treturn deltaFromNodeChange(\n\t\t\t\t\ttagChange(nodeChange, fieldRevision),\n\t\t\t\t\tnodeChanges,\n\t\t\t\t\tidAllocator,\n\t\t\t\t\tfieldKinds,\n\t\t\t\t);\n\t\t\t},\n\t\t\tidAllocator,\n\t\t);\n\t\tif (!isEmptyFieldChanges(deltaField)) {\n\t\t\tdelta.set(field, deltaField);\n\t\t}\n\t}\n\treturn delta;\n}\n\nfunction deltaFromNodeChange(\n\t{ change, revision }: TaggedChange<NodeChangeset>,\n\tnodeChanges: ChangeAtomIdMap<NodeChangeset>,\n\tidAllocator: MemoizedIdRangeAllocator,\n\tfieldKinds: ReadonlyMap<FieldKindIdentifier, FieldKindWithEditor>,\n): DeltaFieldMap {\n\tif (change.fieldChanges !== undefined) {\n\t\treturn intoDeltaImpl(change.fieldChanges, revision, nodeChanges, idAllocator, fieldKinds);\n\t}\n\t// TODO: update the API to allow undefined to be returned here\n\treturn new Map();\n}\n\n/\n @internal\n * @param revInfos - This should describe all revisions in the rebase path, even if not part of the current base changeset.\n * For example, when rebasing change B from a local branch [A, B, C] over a branch [X, Y], the `revInfos` must include\n * the changes [A⁻¹ X, Y, A'] for each rebase step of B.\n * @param baseRevisions - The set of revisions in the changeset being rebased over.\n * For example, when rebasing change B from a local branch [A, B, C] over a branch [X, Y], the `baseRevisions` must include\n * revisions [A⁻¹ X, Y, A'] if rebasing over the composition of all those changes, or\n * revision [A⁻¹] for the first rebase, then [X], etc. if rebasing over edits individually.\n * @returns - RebaseRevisionMetadata to be passed to `FieldChangeRebaser.rebase`\n /\nexport function rebaseRevisionMetadataFromInfo(\n\trevInfos: readonly RevisionInfo[],\n\tbaseRevisions: (RevisionTag \| undefined)[],\n): RebaseRevisionMetadata {\n\tconst filteredRevisions: RevisionTag[] = [];\n\tfor (const revision of baseRevisions) {\n\t\tif (revision !== undefined) {\n\t\t\tfilteredRevisions.push(revision);\n\t\t}\n\t}\n\n\tconst getBaseRevisions = () => filteredRevisions;\n\treturn {\n\t\t...revisionMetadataSourceFromInfo(revInfos),\n\t\tgetBaseRevisions,\n\t};\n}\n\nfunction isEmptyNodeChangeset(change: NodeChangeset): boolean {\n\treturn change.fieldChanges === undefined && change.nodeExistsConstraint === undefined;\n}\n\nexport function getFieldKind(\n\tfieldKinds: ReadonlyMap<FieldKindIdentifier, FieldKindWithEditor>,\n\tkind: FieldKindIdentifier,\n): FieldKindWithEditor {\n\tif (kind === genericFieldKind.identifier) {\n\t\treturn genericFieldKind;\n\t}\n\tconst fieldKind = fieldKinds.get(kind);\n\tassert(fieldKind !== undefined, 0x3ad /* Unknown field kind /);\n\treturn withEditor(fieldKind);\n}\n\nexport function getChangeHandler(\n\tfieldKinds: ReadonlyMap<FieldKindIdentifier, FieldKindWithEditor>,\n\tkind: FieldKindIdentifier,\n): FieldChangeHandler<unknown> {\n\treturn getFieldKind(fieldKinds, kind).changeHandler;\n}\n\n// TODO: TFieldData could instead just be a numeric ID generated by the CrossFieldTable\n// The CrossFieldTable could have a generic field ID to context table\ninterface CrossFieldTable<TFieldData> {\n\tsrcTable: CrossFieldMap<unknown>;\n\tdstTable: CrossFieldMap<unknown>;\n\tsrcDependents: CrossFieldMap<TFieldData>;\n\tdstDependents: CrossFieldMap<TFieldData>;\n\tinvalidatedFields: Set<TFieldData>;\n}\n\ninterface InvertTable extends CrossFieldTable<FieldChange> {\n\toriginalFieldToContext: Map<FieldChange, InvertContext>;\n}\n\ninterface InvertContext {\n\tinvertedField: FieldChange;\n\trevision: RevisionTag \| undefined;\n}\n\ninterface RebaseTable extends CrossFieldTable<FieldChange> {\n\t/\n\t Maps from the FieldChange key used for the CrossFieldTable (which is the FieldChange being rebased)\n\t * to context for the field.\n\t /\n\tfieldToContext: Map<FieldChange, RebaseFieldContext>;\n\t/\n\t This map caches the output of a prior rebasing computation for a node, keyed on that computation's input.\n\t * The input for such a computation is characterized by a pair of node changesets:\n\t * - The node changeset from the input changeset being rebased\n\t * - The corresponding node changeset from the changeset being rebased over.\n\t \n\t Either of these may be undefined so we adopt the following convention:\n\t * - If the node changeset from the changeset being rebased is defined, then we use that as the key\n\t * - Otherwise, if the node changeset from the changeset being rebased over is defined, then we use that as the key\n\t * - Otherwise, we don't cache the output (which will be undefined anyway).\n\t \n\t This map is needed once we switch from the initial pass (which generates a new changeset) to the second pass which\n\t * performs surgery on the changeset generated in the first pass: we don't want to re-run the rebasing of nested\n\t * changes. Instead we want to keep using the objects generated in the first pass and mutate them where needed.\n\t /\n\trebasedNodeCache: Map<NodeChangeset, NodeChangeset>;\n\n\t/\n\t List of (newId, baseId) pairs encountered so far.\n\t /\n\tnodeIdPairs: [\n\t\tNodeId \| undefined,\n\t\tTaggedChange<NodeId> \| undefined,\n\t\tNodeExistenceState \| undefined,\n\t][];\n}\n\ninterface RebaseFieldContext {\n\tbaseChange: FieldChange;\n\tbaseRevision: RevisionTag \| undefined;\n\tnewChange: FieldChange;\n\trebasedChange: FieldChange;\n}\n\nfunction newComposeTable(): ComposeTable {\n\treturn {\n\t\t...newCrossFieldTable<FieldChange>(),\n\t\tfieldToContext: new Map(),\n\t\tnodeIds: new Map(),\n\t\tnodeIdPairs: [],\n\t};\n}\n\ninterface ComposeTable extends CrossFieldTable<FieldChange> {\n\t/\n\t Maps from an input changeset for a field (from change1 if it has one, from change2 otherwise) to the context for that field.\n\t /\n\tfieldToContext: Map<FieldChange, ComposeFieldContext>;\n\n\t/\n\t The set of node IDs from the second changeset which have been encountered.\n\t /\n\tnodeIds: NestedSet<RevisionTag, ChangesetLocalId>;\n\n\tnodeIdPairs: [TaggedChange<NodeId> \| undefined, TaggedChange<NodeId> \| undefined][];\n}\n\ninterface ComposeFieldContext {\n\tchange1: TaggedChange<FieldChangeset>;\n\tchange2: TaggedChange<FieldChangeset>;\n\tcomposedChange: FieldChange;\n}\n\nfunction newCrossFieldTable<T>(): CrossFieldTable<T> {\n\treturn {\n\t\tsrcTable: new Map(),\n\t\tdstTable: new Map(),\n\t\tsrcDependents: new Map(),\n\t\tdstDependents: new Map(),\n\t\tinvalidatedFields: new Set(),\n\t};\n}\n\n/\n @internal\n /\ninterface ConstraintState {\n\tviolationCount: number;\n}\n\nfunction newConstraintState(violationCount: number): ConstraintState {\n\treturn {\n\t\tviolationCount,\n\t};\n}\n\ninterface CrossFieldManagerI<T> extends CrossFieldManager {\n\ttable: CrossFieldTable<T>;\n}\n\nfunction newCrossFieldManager<T>(\n\tcrossFieldTable: CrossFieldTable<T>,\n\tcurrentFieldKey: T,\n\tallowInval = true,\n): CrossFieldManagerI<T> {\n\tconst getMap = (target: CrossFieldTarget) =>\n\t\ttarget === CrossFieldTarget.Source ? crossFieldTable.srcTable : crossFieldTable.dstTable;\n\n\tconst getDependents = (target: CrossFieldTarget) =>\n\t\ttarget === CrossFieldTarget.Source\n\t\t\t? crossFieldTable.srcDependents\n\t\t\t: crossFieldTable.dstDependents;\n\n\tconst manager = {\n\t\ttable: crossFieldTable,\n\n\t\tset: (\n\t\t\ttarget: CrossFieldTarget,\n\t\t\trevision: RevisionTag \| undefined,\n\t\t\tid: ChangesetLocalId,\n\t\t\tcount: number,\n\t\t\tnewValue: unknown,\n\t\t\tinvalidateDependents: boolean,\n\t\t) => {\n\t\t\tif (invalidateDependents && allowInval) {\n\t\t\t\tconst lastChangedId = (id as number) + count - 1;\n\t\t\t\tlet firstId = id;\n\t\t\t\twhile (firstId <= lastChangedId) {\n\t\t\t\t\tconst dependentEntry = getFirstFromCrossFieldMap(\n\t\t\t\t\t\tgetDependents(target),\n\t\t\t\t\t\trevision,\n\t\t\t\t\t\tfirstId,\n\t\t\t\t\t\tlastChangedId - firstId + 1,\n\t\t\t\t\t);\n\t\t\t\t\tif (dependentEntry.value !== undefined) {\n\t\t\t\t\t\tcrossFieldTable.invalidatedFields.add(dependentEntry.value);\n\t\t\t\t\t}\n\n\t\t\t\t\tfirstId = brand(firstId + dependentEntry.length);\n\t\t\t\t}\n\t\t\t}\n\t\t\tsetInCrossFieldMap(getMap(target), revision, id, count, newValue);\n\t\t},\n\n\t\tget: (\n\t\t\ttarget: CrossFieldTarget,\n\t\t\trevision: RevisionTag \| undefined,\n\t\t\tid: ChangesetLocalId,\n\t\t\tcount: number,\n\t\t\taddDependency: boolean,\n\t\t) => {\n\t\t\tif (addDependency) {\n\t\t\t\t// We assume that if there is already an entry for this ID it is because\n\t\t\t\t// a field handler has called compose on the same node multiple times.\n\t\t\t\t// In this case we only want to update the latest version, so we overwrite the dependency.\n\t\t\t\tsetInCrossFieldMap(getDependents(target), revision, id, count, currentFieldKey);\n\t\t\t}\n\t\t\treturn getFirstFromCrossFieldMap(getMap(target), revision, id, count);\n\t\t},\n\t};\n\n\treturn manager;\n}\n\nfunction makeModularChangeset(\n\tfieldChanges: FieldChangeMap \| undefined = undefined,\n\tnodeChanges: ChangeAtomIdMap<NodeChangeset> \| undefined = undefined,\n\tmaxId: number = -1,\n\trevisions: readonly RevisionInfo[] \| undefined = undefined,\n\tconstraintViolationCount: number \| undefined = undefined,\n\tbuilds?: ChangeAtomIdMap<TreeChunk>,\n\tdestroys?: ChangeAtomIdMap<number>,\n\trefreshers?: ChangeAtomIdMap<TreeChunk>,\n): ModularChangeset {\n\tconst changeset: Mutable<ModularChangeset> = {\n\t\tfieldChanges: fieldChanges ?? new Map(),\n\t\tnodeChanges: nodeChanges ?? new Map(),\n\t};\n\tif (revisions !== undefined && revisions.length > 0) {\n\t\tchangeset.revisions = revisions;\n\t}\n\tif (maxId >= 0) {\n\t\tchangeset.maxId = brand(maxId);\n\t}\n\tif (constraintViolationCount !== undefined && constraintViolationCount > 0) {\n\t\tchangeset.constraintViolationCount = constraintViolationCount;\n\t}\n\tif (builds !== undefined && builds.size > 0) {\n\t\tchangeset.builds = builds;\n\t}\n\tif (destroys !== undefined && destroys.size > 0) {\n\t\tchangeset.destroys = destroys;\n\t}\n\tif (refreshers !== undefined && refreshers.size > 0) {\n\t\tchangeset.refreshers = refreshers;\n\t}\n\treturn changeset;\n}\n\nexport class ModularEditBuilder extends EditBuilder<ModularChangeset> {\n\tprivate transactionDepth: number = 0;\n\tprivate idAllocator: IdAllocator;\n\n\tpublic constructor(\n\t\tfamily: ChangeFamily<ChangeFamilyEditor, ModularChangeset>,\n\t\tchangeReceiver: (change: ModularChangeset) => void,\n\t) {\n\t\tsuper(family, changeReceiver);\n\t\tthis.idAllocator = idAllocatorFromMaxId();\n\t}\n\n\tpublic override enterTransaction(): void {\n\t\tthis.transactionDepth += 1;\n\t\tif (this.transactionDepth === 1) {\n\t\t\tthis.idAllocator = idAllocatorFromMaxId();\n\t\t}\n\t}\n\n\tpublic override exitTransaction(): void {\n\t\tassert(this.transactionDepth > 0, 0x5b9 / Cannot exit inexistent transaction /);\n\t\tthis.transactionDepth -= 1;\n\t\tif (this.transactionDepth === 0) {\n\t\t\tthis.idAllocator = idAllocatorFromMaxId();\n\t\t}\n\t}\n\n\t/\n\t @param firstId - The ID to associate with the first node\n\t * @param content - The node(s) to build. Can be in either Field or Node mode.\n\t * @returns A description of the edit that can be passed to `submitChanges`.\n\t /\n\tpublic buildTrees(\n\t\tfirstId: ChangesetLocalId,\n\t\tcontent: ITreeCursorSynchronous,\n\t): GlobalEditDescription {\n\t\tif (content.mode === CursorLocationType.Fields && content.getFieldLength() === 0) {\n\t\t\treturn { type: \"global\" };\n\t\t}\n\t\tconst builds: ChangeAtomIdMap<TreeChunk> = new Map();\n\t\tconst innerMap = new Map();\n\t\tbuilds.set(undefined, innerMap);\n\t\tconst chunk =\n\t\t\tcontent.mode === CursorLocationType.Fields\n\t\t\t\t? chunkFieldSingle(content, defaultChunkPolicy)\n\t\t\t\t: chunkTree(content, defaultChunkPolicy);\n\t\tinnerMap.set(firstId, chunk);\n\n\t\treturn {\n\t\t\ttype: \"global\",\n\t\t\tbuilds,\n\t\t};\n\t}\n\n\t/\n\t Adds a change to the edit builder\n\t * @param field - the field which is being edited\n\t * @param fieldKind - the kind of the field\n\t * @param change - the change to the field\n\t * @param maxId - the highest `ChangesetLocalId` used in this change\n\t /\n\tpublic submitChange(\n\t\tfield: FieldUpPath,\n\t\tfieldKind: FieldKindIdentifier,\n\t\tchange: FieldChangeset,\n\t): void {\n\t\tconst modularChange = buildModularChangesetFromField(\n\t\t\tfield,\n\t\t\t{ fieldKind, change },\n\t\t\tnew Map(),\n\t\t\tthis.idAllocator,\n\t\t);\n\t\tthis.applyChange(modularChange);\n\t}\n\n\tpublic submitChanges(changes: EditDescription[]) {\n\t\tconst modularChange = this.buildChanges(changes);\n\t\tthis.applyChange(modularChange);\n\t}\n\n\tpublic buildChanges(changes: EditDescription[]): ModularChangeset {\n\t\tconst changeMaps = changes.map((change) =>\n\t\t\tmakeAnonChange(\n\t\t\t\tchange.type === \"global\"\n\t\t\t\t\t? makeModularChangeset(\n\t\t\t\t\t\t\tundefined,\n\t\t\t\t\t\t\tundefined,\n\t\t\t\t\t\t\tthis.idAllocator.getMaxId(),\n\t\t\t\t\t\t\tundefined,\n\t\t\t\t\t\t\tundefined,\n\t\t\t\t\t\t\tchange.builds,\n\t\t\t\t\t )\n\t\t\t\t\t: buildModularChangesetFromField(\n\t\t\t\t\t\t\tchange.field,\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tfieldKind: change.fieldKind,\n\t\t\t\t\t\t\t\tchange: change.change,\n\t\t\t\t\t\t\t},\n\t\t\t\t\t\t\tnew Map(),\n\t\t\t\t\t\t\tthis.idAllocator,\n\t\t\t\t\t ),\n\t\t\t),\n\t\t);\n\t\tconst composedChange: Mutable<ModularChangeset> =\n\t\t\tthis.changeFamily.rebaser.compose(changeMaps);\n\n\t\tconst maxId: ChangesetLocalId = brand(this.idAllocator.getMaxId());\n\t\tif (maxId >= 0) {\n\t\t\tcomposedChange.maxId = maxId;\n\t\t}\n\t\treturn composedChange;\n\t}\n\n\tpublic generateId(count?: number): ChangesetLocalId {\n\t\treturn brand(this.idAllocator.allocate(count));\n\t}\n\n\tpublic addNodeExistsConstraint(path: UpPath): void {\n\t\tconst nodeChange: NodeChangeset = {\n\t\t\tnodeExistsConstraint: { violated: false },\n\t\t};\n\n\t\tthis.applyChange(\n\t\t\tbuildModularChangesetFromNode(path, nodeChange, new Map(), this.idAllocator),\n\t\t);\n\t}\n}\n\nfunction buildModularChangesetFromField(\n\tpath: FieldUpPath,\n\tfieldChange: FieldChange,\n\tnodeChanges: ChangeAtomIdMap<NodeChangeset>,\n\tidAllocator: IdAllocator = idAllocatorFromMaxId(),\n): ModularChangeset {\n\tconst fieldChanges: FieldChangeMap = new Map([[path.field, fieldChange]]);\n\n\tif (path.parent === undefined) {\n\t\treturn makeModularChangeset(fieldChanges, nodeChanges, idAllocator.getMaxId());\n\t}\n\n\tconst nodeChangeset: NodeChangeset = {\n\t\tfieldChanges,\n\t};\n\n\treturn buildModularChangesetFromNode(path.parent, nodeChangeset, nodeChanges, idAllocator);\n}\n\nfunction buildModularChangesetFromNode(\n\tpath: UpPath,\n\tnodeChange: NodeChangeset,\n\tnodeChanges: ChangeAtomIdMap<NodeChangeset>,\n\tidAllocator: IdAllocator,\n): ModularChangeset {\n\tconst nodeId: NodeId = { localId: brand(idAllocator.allocate()) };\n\tsetInNestedMap(nodeChanges, nodeId.revision, nodeId.localId, nodeChange);\n\tconst fieldChangeset = genericFieldKind.changeHandler.editor.buildChildChange(\n\t\tpath.parentIndex,\n\t\tnodeId,\n\t);\n\n\tconst fieldChange: FieldChange = {\n\t\tfieldKind: genericFieldKind.identifier,\n\t\tchange: fieldChangeset,\n\t};\n\n\treturn buildModularChangesetFromField(\n\t\t{ parent: path.parent, field: path.parentField },\n\t\tfieldChange,\n\t\tnodeChanges,\n\t\tidAllocator,\n\t);\n}\n\n/\n @internal\n /\nexport interface FieldEditDescription {\n\ttype: \"field\";\n\tfield: FieldUpPath;\n\tfieldKind: FieldKindIdentifier;\n\tchange: FieldChangeset;\n}\n\n/\n @internal\n /\nexport interface GlobalEditDescription {\n\ttype: \"global\";\n\tbuilds?: ChangeAtomIdMap<TreeChunk>;\n}\n\n/\n @internal\n */\nexport type EditDescription = FieldEditDescription \| GlobalEditDescription;\n\nfunction getRevInfoFromTaggedChanges(changes: TaggedChange<ModularChangeset>[]): {\n\trevInfos: RevisionInfo[];\n\tmaxId: ChangesetLocalId;\n} {\n\tlet maxId = -1;\n\tconst revInfos: RevisionInfo[] = [];\n\tfor (const taggedChange of changes) {\n\t\tconst change = taggedChange.change;\n\t\tmaxId = Math.max(change.maxId ?? -1, maxId);\n\t\trevInfos.push(...revisionInfoFromTaggedChange(taggedChange));\n\t}\n\n\tconst revisions = new Set<RevisionTag>();\n\tconst rolledBackRevisions: RevisionTag[] = [];\n\tfor (const info of revInfos) {\n\t\trevisions.add(info.revision);\n\t\tif (info.rollbackOf !== undefined) {\n\t\t\trolledBackRevisions.push(info.rollbackOf);\n\t\t}\n\t}\n\n\trolledBackRevisions.reverse();\n\tfor (const revision of rolledBackRevisions) {\n\t\tif (!revisions.has(revision)) {\n\t\t\trevInfos.push({ revision });\n\t\t}\n\t}\n\n\treturn { maxId: brand(maxId), revInfos };\n}\n\nfunction revisionInfoFromTaggedChange(\n\ttaggedChange: TaggedChange<ModularChangeset>,\n): RevisionInfo[] {\n\tconst revInfos: RevisionInfo[] = [];\n\tif (taggedChange.change.revisions !== undefined) {\n\t\trevInfos.push(...taggedChange.change.revisions);\n\t} else if (taggedChange.revision !== undefined) {\n\t\tconst info: Mutable<RevisionInfo> = { revision: taggedChange.revision };\n\t\tif (taggedChange.rollbackOf !== undefined) {\n\t\t\tinfo.rollbackOf = taggedChange.rollbackOf;\n\t\t}\n\t\trevInfos.push(info);\n\t}\n\treturn revInfos;\n}\n\nfunction revisionFromTaggedChange(change: TaggedChange<ModularChangeset>): RevisionTag \| undefined {\n\treturn change.revision ?? revisionFromRevInfos(change.change.revisions);\n}\n\nfunction revisionFromRevInfos(\n\trevInfos: undefined \| readonly RevisionInfo[],\n): RevisionTag \| undefined {\n\tif (revInfos === undefined \|\| revInfos.length !== 1) {\n\t\treturn undefined;\n\t}\n\treturn revInfos[0].revision;\n}\n"]}

package/dist/feature-libraries/modular-schema/modularChangeFormat.d.ts CHANGED Viewed

@@ -3,10 +3,11 @@
  * Licensed under the MIT License.
  */
 import { Static } from "@sinclair/typebox";
-import { schemaFormat, ChangesetLocalId } from "../../core/index.js";
+import { ChangesetLocalId, schemaFormat } from "../../core/index.js";
 import { JsonCompatibleReadOnly } from "../../util/index.js";
 export declare const ChangesetLocalIdSchema: import("@sinclair/typebox").TUnsafe<ChangesetLocalId>;
 export declare const EncodedChangeAtomId: import("@sinclair/typebox").TUnion<[import("@sinclair/typebox").TTuple<[import("@sinclair/typebox").TUnsafe<ChangesetLocalId>, import("@sinclair/typebox").TUnion<[import("@sinclair/typebox").TLiteral<"root">, import("@sinclair/typebox").TUnsafe<import("../../util/brand.js").Brand<import("@fluidframework/id-compressor").OpSpaceCompressedId, "EncodedRevisionTag">>]>]>, import("@sinclair/typebox").TUnsafe<ChangesetLocalId>]>;
+export type EncodedChangeAtomId = Static<typeof EncodedChangeAtomId>;
 declare const EncodedFieldChange: import("@sinclair/typebox").TObject<{
     fieldKey: import("@sinclair/typebox").TUnsafe<schemaFormat.FieldKey>;
     fieldKind: import("@sinclair/typebox").TUnsafe<schemaFormat.FieldKindIdentifier>;
@@ -32,19 +33,11 @@ declare const EncodedFieldChangeMap: import("@sinclair/typebox").TArray<import("
  */
 export type EncodedFieldChangeMap = Static<typeof EncodedFieldChangeMap>;
 export declare const EncodedNodeChangeset: import("@sinclair/typebox").TObject<{
-    valueChange: import("@sinclair/typebox").TOptional<import("@sinclair/typebox").TObject<{
-        revision: import("@sinclair/typebox").TOptional<import("@sinclair/typebox").TUnion<[import("@sinclair/typebox").TLiteral<"root">, import("@sinclair/typebox").TUnsafe<import("../../util/brand.js").Brand<import("@fluidframework/id-compressor").OpSpaceCompressedId, "EncodedRevisionTag">>]>>;
-        value: import("@sinclair/typebox").TOptional<import("@sinclair/typebox").TAny>;
-    }>>;
     fieldChanges: import("@sinclair/typebox").TOptional<import("@sinclair/typebox").TArray<import("@sinclair/typebox").TObject<{
         fieldKey: import("@sinclair/typebox").TUnsafe<schemaFormat.FieldKey>;
         fieldKind: import("@sinclair/typebox").TUnsafe<schemaFormat.FieldKindIdentifier>;
         change: import("@sinclair/typebox").TAny;
     }>>>;
-    valueConstraint: import("@sinclair/typebox").TOptional<import("@sinclair/typebox").TObject<{
-        value: import("@sinclair/typebox").TOptional<import("@sinclair/typebox").TAny>;
-        violated: import("@sinclair/typebox").TBoolean;
-    }>>;
     nodeExistsConstraint: import("@sinclair/typebox").TOptional<import("@sinclair/typebox").TObject<{
         violated: import("@sinclair/typebox").TBoolean;
     }>>;
@@ -73,8 +66,8 @@ export declare const EncodedBuilds: import("@sinclair/typebox").TObject<{
      * TODO: Strongly typing this here may result in redundant schema validation of this data.
      */
     trees: import("@sinclair/typebox").TObject<{
-        version: import("@sinclair/typebox").TIntersect<[import("@sinclair/typebox").TNumber, import("@sinclair/typebox").TLiteral<number>]>;
         data: import("@sinclair/typebox").TArray<import("@sinclair/typebox").TArray<import("@sinclair/typebox").TAny>>;
+        version: import("@sinclair/typebox").TIntersect<[import("@sinclair/typebox").TNumber, import("@sinclair/typebox").TLiteral<number>]>;
         identifiers: import("@sinclair/typebox").TArray<import("@sinclair/typebox").TString>;
         shapes: import("@sinclair/typebox").TArray<import("@sinclair/typebox").TObject<{
             a: import("@sinclair/typebox").TOptional<import("@sinclair/typebox").TNumber>;
@@ -111,8 +104,8 @@ export declare const EncodedModularChangeset: import("@sinclair/typebox").TObjec
          * TODO: Strongly typing this here may result in redundant schema validation of this data.
          */
         trees: import("@sinclair/typebox").TObject<{
-            version: import("@sinclair/typebox").TIntersect<[import("@sinclair/typebox").TNumber, import("@sinclair/typebox").TLiteral<number>]>;
             data: import("@sinclair/typebox").TArray<import("@sinclair/typebox").TArray<import("@sinclair/typebox").TAny>>;
+            version: import("@sinclair/typebox").TIntersect<[import("@sinclair/typebox").TNumber, import("@sinclair/typebox").TLiteral<number>]>;
             identifiers: import("@sinclair/typebox").TArray<import("@sinclair/typebox").TString>;
             shapes: import("@sinclair/typebox").TArray<import("@sinclair/typebox").TObject<{
                 a: import("@sinclair/typebox").TOptional<import("@sinclair/typebox").TNumber>;
@@ -137,8 +130,8 @@ export declare const EncodedModularChangeset: import("@sinclair/typebox").TObjec
          * TODO: Strongly typing this here may result in redundant schema validation of this data.
          */
         trees: import("@sinclair/typebox").TObject<{
-            version: import("@sinclair/typebox").TIntersect<[import("@sinclair/typebox").TNumber, import("@sinclair/typebox").TLiteral<number>]>;
             data: import("@sinclair/typebox").TArray<import("@sinclair/typebox").TArray<import("@sinclair/typebox").TAny>>;
+            version: import("@sinclair/typebox").TIntersect<[import("@sinclair/typebox").TNumber, import("@sinclair/typebox").TLiteral<number>]>;
             identifiers: import("@sinclair/typebox").TArray<import("@sinclair/typebox").TString>;
             shapes: import("@sinclair/typebox").TArray<import("@sinclair/typebox").TObject<{
                 a: import("@sinclair/typebox").TOptional<import("@sinclair/typebox").TNumber>;

package/dist/feature-libraries/modular-schema/modularChangeFormat.d.ts.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"modularChangeFormat.d.ts","sourceRoot":"","sources":["../../../src/feature-libraries/modular-schema/modularChangeFormat.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAiB,MAAM,EAAQ,MAAM,mBAAmB,CAAC;~~AAChE~~,OAAO,EAAE,~~YAAY~~,EAAqB,~~gBAAgB~~,EAAE,MAAM,qBAAqB,CAAC;AACxF,OAAO,~~EAEN~~,sBAAsB,~~EAEtB~~,MAAM,qBAAqB,CAAC;AAK7B,eAAO,MAAM,sBAAsB,uDAEjC,CAAC;AAEH,eAAO,MAAM,mBAAmB,2aAG9B,CAAC;~~AAoBH~~,QAAA,MAAM,kBAAkB;;;;EAUvB,CAAC;AAEF,MAAM,WAAW,kBAAmB,SAAQ,MAAM,CAAC,OAAO,kBAAkB,CAAC;IAC5E;;OAEG;IACH,MAAM,EAAE,sBAAsB,CAAC;CAC/B;AAED,QAAA,MAAM,qBAAqB;;;;GAAiC,CAAC;AAE7D;;;;;;GAMG;AACH,MAAM,MAAM,qBAAqB,GAAG,MAAM,CAAC,OAAO,qBAAqB,CAAC,CAAC;AAUzE,eAAO,MAAM,oBAAoB~~;;;;;;;;;;;;;;;;;EAQhC~~,CAAC;AAEF;;GAEG;AACH,MAAM,MAAM,oBAAoB,GAAG,MAAM,CAAC,OAAO,oBAAoB,CAAC,CAAC;AAEvE,eAAO,MAAM,mBAAmB;;;EAM/B,CAAC;AAEF,MAAM,MAAM,mBAAmB,GAAG,MAAM,CAAC,OAAO,mBAAmB,CAAC,CAAC;AAErE;;GAEG;AACH,eAAO,MAAM,gBAAgB,qCAA6C,CAAC;AAE3E,eAAO,MAAM,YAAY,sKAOxB,CAAC;AACF,MAAM,MAAM,YAAY,GAAG,MAAM,CAAC,OAAO,YAAY,CAAC,CAAC;AAEvD,eAAO,MAAM,kBAAkB,mtBAM9B,CAAC;AAEF,MAAM,MAAM,kBAAkB,GAAG,MAAM,CAAC,OAAO,kBAAkB,CAAC,CAAC;AAEnE,eAAO,MAAM,aAAa;;IAGxB;;;OAGG;;;;;;;;;;;;;;;;;;;;EAIJ,CAAC;AAEF,MAAM,MAAM,aAAa,GAAG,MAAM,CAAC,OAAO,aAAa,CAAC,CAAC;AAEzD,eAAO,MAAM,uBAAuB;;;;;;;;;;;;;QAXlC;;;WAGG;;;;;;;;;;;;;;;;;;;;;;;QAHH;;;WAGG;;;;;;;;;;;;;;;;;;;;;EAiBJ,CAAC;AAEF,MAAM,MAAM,uBAAuB,GAAG,MAAM,CAAC,OAAO,uBAAuB,CAAC,CAAC"}
1	+ {"version":3,"file":"modularChangeFormat.d.ts","sourceRoot":"","sources":["../../../src/feature-libraries/modular-schema/modularChangeFormat.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAiB,MAAM,EAAQ,MAAM,mBAAmB,CAAC;AAEhE,OAAO,EAAE,gBAAgB,EAAqB,YAAY,EAAE,MAAM,qBAAqB,CAAC;AACxF,OAAO,EACN,sBAAsB,EAGtB,MAAM,qBAAqB,CAAC;AAK7B,eAAO,MAAM,sBAAsB,uDAEjC,CAAC;AAEH,eAAO,MAAM,mBAAmB,2aAG9B,CAAC;AACH,MAAM,MAAM,mBAAmB,GAAG,MAAM,CAAC,OAAO,mBAAmB,CAAC,CAAC;AAErE,QAAA,MAAM,kBAAkB;;;;EAUvB,CAAC;AAEF,MAAM,WAAW,kBAAmB,SAAQ,MAAM,CAAC,OAAO,kBAAkB,CAAC;IAC5E;;OAEG;IACH,MAAM,EAAE,sBAAsB,CAAC;CAC/B;AAED,QAAA,MAAM,qBAAqB;;;;GAAiC,CAAC;AAE7D;;;;;;GAMG;AACH,MAAM,MAAM,qBAAqB,GAAG,MAAM,CAAC,OAAO,qBAAqB,CAAC,CAAC;AAUzE,eAAO,MAAM,oBAAoB;;;;;;;;;EAMhC,CAAC;AAEF;;GAEG;AACH,MAAM,MAAM,oBAAoB,GAAG,MAAM,CAAC,OAAO,oBAAoB,CAAC,CAAC;AAEvE,eAAO,MAAM,mBAAmB;;;EAM/B,CAAC;AAEF,MAAM,MAAM,mBAAmB,GAAG,MAAM,CAAC,OAAO,mBAAmB,CAAC,CAAC;AAErE;;GAEG;AACH,eAAO,MAAM,gBAAgB,qCAA6C,CAAC;AAE3E,eAAO,MAAM,YAAY,sKAOxB,CAAC;AACF,MAAM,MAAM,YAAY,GAAG,MAAM,CAAC,OAAO,YAAY,CAAC,CAAC;AAEvD,eAAO,MAAM,kBAAkB,mtBAM9B,CAAC;AAEF,MAAM,MAAM,kBAAkB,GAAG,MAAM,CAAC,OAAO,kBAAkB,CAAC,CAAC;AAEnE,eAAO,MAAM,aAAa;;IAGxB;;;OAGG;;;;;;;;;;;;;;;;;;;;EAIJ,CAAC;AAEF,MAAM,MAAM,aAAa,GAAG,MAAM,CAAC,OAAO,aAAa,CAAC,CAAC;AAEzD,eAAO,MAAM,uBAAuB;;;;;;;;;;;;;QAXlC;;;WAGG;;;;;;;;;;;;;;;;;;;;;;;QAHH;;;WAGG;;;;;;;;;;;;;;;;;;;;;EAiBJ,CAAC;AAEF,MAAM,MAAM,uBAAuB,GAAG,MAAM,CAAC,OAAO,uBAAuB,CAAC,CAAC"}

package/dist/feature-libraries/modular-schema/modularChangeFormat.js CHANGED Viewed

@@ -17,14 +17,6 @@ exports.EncodedChangeAtomId = typebox_1.Type.Union([
     typebox_1.Type.Tuple([exports.ChangesetLocalIdSchema, index_js_1.RevisionTagSchema]),
     exports.ChangesetLocalIdSchema,
 ]);
-const EncodedValueChange = typebox_1.Type.Object({
-    revision: typebox_1.Type.Optional(index_js_1.RevisionTagSchema),
-    value: typebox_1.Type.Optional(index_js_2.JsonCompatibleReadOnlySchema),
-}, noAdditionalProps);
-const EncodedValueConstraint = typebox_1.Type.Object({
-    value: typebox_1.Type.Optional(index_js_2.JsonCompatibleReadOnlySchema),
-    violated: typebox_1.Type.Boolean(),
-}, noAdditionalProps);
 const EncodedFieldChange = typebox_1.Type.Object({
     fieldKey: index_js_1.schemaFormat.FieldKeySchema,
     fieldKind: index_js_1.schemaFormat.FieldKindIdentifierSchema,
@@ -38,9 +30,7 @@ const EncodedNodeExistsConstraint = typebox_1.Type.Object({
     violated: typebox_1.Type.Boolean(),
 }, noAdditionalProps);
 exports.EncodedNodeChangeset = typebox_1.Type.Object({
-    valueChange: typebox_1.Type.Optional(EncodedValueChange),
     fieldChanges: typebox_1.Type.Optional(EncodedFieldChangeMap),
-    valueConstraint: typebox_1.Type.Optional(EncodedValueConstraint),
     nodeExistsConstraint: typebox_1.Type.Optional(EncodedNodeExistsConstraint),
 }, noAdditionalProps);
 exports.EncodedRevisionInfo = typebox_1.Type.Object({

package/dist/feature-libraries/modular-schema/modularChangeFormat.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"modularChangeFormat.js","sourceRoot":"","sources":["../../../src/feature-libraries/modular-schema/modularChangeFormat.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,+CAAgE;~~AAChE~~,kDAAwF;AACxF,kDAI6B;AAC7B,yDAA+D;AAE/D,MAAM,iBAAiB,GAAkB,EAAE,oBAAoB,EAAE,KAAK,EAAE,CAAC;AAE5D,QAAA,sBAAsB,GAAG,IAAA,4BAAiB,EAAmB;IACzE,UAAU,EAAE,CAAC;CACb,CAAC,CAAC;AAEU,QAAA,mBAAmB,GAAG,cAAI,CAAC,KAAK,CAAC;IAC7C,cAAI,CAAC,KAAK,CAAC,CAAC,8BAAsB,EAAE,4BAAiB,CAAC,CAAC;IACvD,8BAAsB;CACtB,CAAC,CAAC;~~AAEH~~,MAAM,kBAAkB,GAAG,cAAI,CAAC,MAAM,CACrC;IACC,QAAQ,EAAE,cAAI,CAAC,QAAQ,CAAC,4BAAiB,CAAC;IAC1C,KAAK,EAAE,cAAI,CAAC,QAAQ,CAAC,uCAA4B,CAAC;CAClD,EACD,iBAAiB,CACjB,CAAC;AAGF,MAAM,sBAAsB,GAAG,cAAI,CAAC,MAAM,CACzC;IACC,KAAK,EAAE,cAAI,CAAC,QAAQ,CAAC,uCAA4B,CAAC;IAClD,QAAQ,EAAE,cAAI,CAAC,OAAO,EAAE;CACxB,EACD,iBAAiB,CACjB,CAAC;AAGF,MAAM,kBAAkB,GAAG,cAAI,CAAC,MAAM,CACrC;IACC,QAAQ,EAAE,uBAAY,CAAC,cAAc;IACrC,SAAS,EAAE,uBAAY,CAAC,yBAAyB;IACjD,6EAA6E;IAC7E,0FAA0F;IAC1F,0GAA0G;IAC1G,MAAM,EAAE,uCAA4B;CACpC,EACD,iBAAiB,CACjB,CAAC;AASF,MAAM,qBAAqB,GAAG,cAAI,CAAC,KAAK,CAAC,kBAAkB,CAAC,CAAC;AAW7D,MAAM,2BAA2B,GAAG,cAAI,CAAC,MAAM,CAC9C;IACC,QAAQ,EAAE,cAAI,CAAC,OAAO,EAAE;CACxB,EACD,iBAAiB,CACjB,CAAC;AAGW,QAAA,oBAAoB,GAAG,cAAI,CAAC,MAAM,CAC9C;IACC,~~WAAW,EAAE,cAAI,CAAC,QAAQ,CAAC,kBAAkB,CAAC;IAC9C,~~YAAY,EAAE,cAAI,CAAC,QAAQ,CAAC,qBAAqB,CAAC;IAClD,~~eAAe,EAAE,cAAI,CAAC,QAAQ,CAAC,sBAAsB,CAAC;IACtD,~~oBAAoB,EAAE,cAAI,CAAC,QAAQ,CAAC,2BAA2B,CAAC;CAChE,EACD,iBAAiB,CACjB,CAAC;AAOW,QAAA,mBAAmB,GAAG,cAAI,CAAC,MAAM,CAC7C;IACC,QAAQ,EAAE,cAAI,CAAC,QAAQ,CAAC,4BAAiB,CAAC;IAC1C,UAAU,EAAE,cAAI,CAAC,gBAAgB,CAAC,4BAAiB,CAAC;CACpD,EACD,iBAAiB,CACjB,CAAC;AAIF;;GAEG;AACU,QAAA,gBAAgB,GAAG,cAAI,CAAC,MAAM,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC,CAAC;AAE9D,QAAA,YAAY,GAAG,cAAI,CAAC,KAAK,CACrC,cAAI,CAAC,KAAK,CAAC;IACV,oBAAoB;IACpB,8BAAsB;IACtB,sDAAsD;IACtD,wBAAgB;CAChB,CAAC,CACF,CAAC;AAGW,QAAA,kBAAkB,GAAG,cAAI,CAAC,KAAK,CAC3C,cAAI,CAAC,KAAK,CAAC;IACV,cAAI,CAAC,KAAK,CAAC,CAAC,oBAAY,EAAE,4BAAiB,CAAC,CAAC;IAC7C,qCAAqC;IACrC,cAAI,CAAC,KAAK,CAAC,CAAC,oBAAY,CAAC,CAAC;CAC1B,CAAC,CACF,CAAC;AAIW,QAAA,aAAa,GAAG,cAAI,CAAC,MAAM,CACvC;IACC,MAAM,EAAE,0BAAkB;IAC1B;;;OAGG;IACH,KAAK,EAAE,4BAAiB;CACxB,EACD,iBAAiB,CACjB,CAAC;AAIW,QAAA,uBAAuB,GAAG,cAAI,CAAC,MAAM,CACjD;IACC,KAAK,EAAE,cAAI,CAAC,QAAQ,CAAC,8BAAsB,CAAC;IAC5C,OAAO,EAAE,qBAAqB;IAC9B,SAAS,EAAE,cAAI,CAAC,gBAAgB,CAAC,cAAI,CAAC,KAAK,CAAC,2BAAmB,CAAC,CAAC;IACjE,MAAM,EAAE,cAAI,CAAC,QAAQ,CAAC,qBAAa,CAAC;IACpC,UAAU,EAAE,cAAI,CAAC,QAAQ,CAAC,qBAAa,CAAC;CACxC,EACD,iBAAiB,CACjB,CAAC","sourcesContent":["/!\n Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n /\n\nimport { ObjectOptions, Static, Type } from \"@sinclair/typebox\";\nimport { ~~schemaFormat~~, RevisionTagSchema, ~~ChangesetLocalId~~ } from \"../../core/index.js\";\nimport {\n\~~tbrandedNumberType~~,\n\~~tJsonCompatibleReadOnly~~,\n\~~tJsonCompatibleReadOnlySchema~~,\n} from \"../../util/index.js\";\nimport { EncodedFieldBatch } from \"../chunked-forest/index.js\";\n\nconst noAdditionalProps: ObjectOptions = { additionalProperties: false };\n\nexport const ChangesetLocalIdSchema = brandedNumberType<ChangesetLocalId>({\n\tmultipleOf: 1,\n});\n\nexport const EncodedChangeAtomId = Type.Union([\n\tType.Tuple([ChangesetLocalIdSchema, RevisionTagSchema]),\n\tChangesetLocalIdSchema,\n]);\~~n\nconst~~ ~~EncodedValueChange~~ = ~~Type.Object(\n\t{\n\t\trevision: Type.Optional(RevisionTagSchema),\n\t\tvalue: Type.Optional(JsonCompatibleReadOnlySchema),\n\t},\n\tnoAdditionalProps,\n);\ntype EncodedValueChange~~ = Static<typeof ~~EncodedValueChange~~>;\n\nconst EncodedValueConstraint = Type.Object(\n\t{\n\t\tvalue: Type.Optional(JsonCompatibleReadOnlySchema),\n\t\tviolated: Type.Boolean(),\n\t},\n\tnoAdditionalProps,\n);\ntype EncodedValueConstraint = Static<typeof EncodedValueConstraint>;\n\nconst EncodedFieldChange = Type.Object(\n\t{\n\t\tfieldKey: schemaFormat.FieldKeySchema,\n\t\tfieldKind: schemaFormat.FieldKindIdentifierSchema,\n\t\t// Implementation note: node and field change encoding is mutually recursive.\n\t\t// This field marks a boundary in that recursion to avoid constructing excessively complex\n\t\t// recursive types. Encoded changes are validated at this boundary at runtime--see modularChangeCodecs.ts.\n\t\tchange: JsonCompatibleReadOnlySchema,\n\t},\n\tnoAdditionalProps,\n);\n\nexport interface EncodedFieldChange extends Static<typeof EncodedFieldChange> {\n\t/\n\t Encoded in format selected by `fieldKind`\n\t /\n\tchange: JsonCompatibleReadOnly;\n}\n\nconst EncodedFieldChangeMap = Type.Array(EncodedFieldChange);\n\n/\n Format for encoding as json.\n \n This chooses to use lists of named objects instead of maps:\n * this choice is somewhat arbitrary, but avoids user data being used as object keys,\n * which can sometimes be an issue (for example handling that for \"__proto__\" can require care).\n /\nexport type EncodedFieldChangeMap = Static<typeof EncodedFieldChangeMap>;\n\nconst EncodedNodeExistsConstraint = Type.Object(\n\t{\n\t\tviolated: Type.Boolean(),\n\t},\n\tnoAdditionalProps,\n);\ntype EncodedNodeExistsConstraint = Static<typeof EncodedNodeExistsConstraint>;\n\nexport const EncodedNodeChangeset = Type.Object(\n\t{\n\t\~~tvalueChange: Type.Optional(EncodedValueChange),\n\t\~~tfieldChanges: Type.Optional(EncodedFieldChangeMap),\n\t\~~tvalueConstraint: Type.Optional(EncodedValueConstraint),\n\t\~~tnodeExistsConstraint: Type.Optional(EncodedNodeExistsConstraint),\n\t},\n\tnoAdditionalProps,\n);\n\n/\n Format for encoding as json.\n /\nexport type EncodedNodeChangeset = Static<typeof EncodedNodeChangeset>;\n\nexport const EncodedRevisionInfo = Type.Object(\n\t{\n\t\trevision: Type.Readonly(RevisionTagSchema),\n\t\trollbackOf: Type.ReadonlyOptional(RevisionTagSchema),\n\t},\n\tnoAdditionalProps,\n);\n\nexport type EncodedRevisionInfo = Static<typeof EncodedRevisionInfo>;\n\n/\n Index of field in an EncodedFieldBatch.\n /\nexport const EncodedTreeIndex = Type.Number({ multipleOf: 1, minimum: 0 });\n\nexport const CommitBuilds = Type.Array(\n\tType.Tuple([\n\t\t// ID for first node\n\t\tChangesetLocalIdSchema,\n\t\t// Index for a TreeChunk that represents all the nodes\n\t\tEncodedTreeIndex,\n\t]),\n);\nexport type CommitBuilds = Static<typeof CommitBuilds>;\n\nexport const EncodedBuildsArray = Type.Array(\n\tType.Union([\n\t\tType.Tuple([CommitBuilds, RevisionTagSchema]),\n\t\t// Revision is omitted when undefined\n\t\tType.Tuple([CommitBuilds]),\n\t]),\n);\n\nexport type EncodedBuildsArray = Static<typeof EncodedBuildsArray>;\n\nexport const EncodedBuilds = Type.Object(\n\t{\n\t\tbuilds: EncodedBuildsArray,\n\t\t/\n\t\t Fields indexed by the EncodedTreeIndexes above.\n\t\t * TODO: Strongly typing this here may result in redundant schema validation of this data.\n\t\t */\n\t\ttrees: EncodedFieldBatch,\n\t},\n\tnoAdditionalProps,\n);\n\nexport type EncodedBuilds = Static<typeof EncodedBuilds>;\n\nexport const EncodedModularChangeset = Type.Object(\n\t{\n\t\tmaxId: Type.Optional(ChangesetLocalIdSchema),\n\t\tchanges: EncodedFieldChangeMap,\n\t\trevisions: Type.ReadonlyOptional(Type.Array(EncodedRevisionInfo)),\n\t\tbuilds: Type.Optional(EncodedBuilds),\n\t\trefreshers: Type.Optional(EncodedBuilds),\n\t},\n\tnoAdditionalProps,\n);\n\nexport type EncodedModularChangeset = Static<typeof EncodedModularChangeset>;\n"]}
1	+ {"version":3,"file":"modularChangeFormat.js","sourceRoot":"","sources":["../../../src/feature-libraries/modular-schema/modularChangeFormat.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,+CAAgE;AAEhE,kDAAwF;AACxF,kDAI6B;AAC7B,yDAA+D;AAE/D,MAAM,iBAAiB,GAAkB,EAAE,oBAAoB,EAAE,KAAK,EAAE,CAAC;AAE5D,QAAA,sBAAsB,GAAG,IAAA,4BAAiB,EAAmB;IACzE,UAAU,EAAE,CAAC;CACb,CAAC,CAAC;AAEU,QAAA,mBAAmB,GAAG,cAAI,CAAC,KAAK,CAAC;IAC7C,cAAI,CAAC,KAAK,CAAC,CAAC,8BAAsB,EAAE,4BAAiB,CAAC,CAAC;IACvD,8BAAsB;CACtB,CAAC,CAAC;AAGH,MAAM,kBAAkB,GAAG,cAAI,CAAC,MAAM,CACrC;IACC,QAAQ,EAAE,uBAAY,CAAC,cAAc;IACrC,SAAS,EAAE,uBAAY,CAAC,yBAAyB;IACjD,6EAA6E;IAC7E,0FAA0F;IAC1F,0GAA0G;IAC1G,MAAM,EAAE,uCAA4B;CACpC,EACD,iBAAiB,CACjB,CAAC;AASF,MAAM,qBAAqB,GAAG,cAAI,CAAC,KAAK,CAAC,kBAAkB,CAAC,CAAC;AAW7D,MAAM,2BAA2B,GAAG,cAAI,CAAC,MAAM,CAC9C;IACC,QAAQ,EAAE,cAAI,CAAC,OAAO,EAAE;CACxB,EACD,iBAAiB,CACjB,CAAC;AAGW,QAAA,oBAAoB,GAAG,cAAI,CAAC,MAAM,CAC9C;IACC,YAAY,EAAE,cAAI,CAAC,QAAQ,CAAC,qBAAqB,CAAC;IAClD,oBAAoB,EAAE,cAAI,CAAC,QAAQ,CAAC,2BAA2B,CAAC;CAChE,EACD,iBAAiB,CACjB,CAAC;AAOW,QAAA,mBAAmB,GAAG,cAAI,CAAC,MAAM,CAC7C;IACC,QAAQ,EAAE,cAAI,CAAC,QAAQ,CAAC,4BAAiB,CAAC;IAC1C,UAAU,EAAE,cAAI,CAAC,gBAAgB,CAAC,4BAAiB,CAAC;CACpD,EACD,iBAAiB,CACjB,CAAC;AAIF;;GAEG;AACU,QAAA,gBAAgB,GAAG,cAAI,CAAC,MAAM,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC,CAAC;AAE9D,QAAA,YAAY,GAAG,cAAI,CAAC,KAAK,CACrC,cAAI,CAAC,KAAK,CAAC;IACV,oBAAoB;IACpB,8BAAsB;IACtB,sDAAsD;IACtD,wBAAgB;CAChB,CAAC,CACF,CAAC;AAGW,QAAA,kBAAkB,GAAG,cAAI,CAAC,KAAK,CAC3C,cAAI,CAAC,KAAK,CAAC;IACV,cAAI,CAAC,KAAK,CAAC,CAAC,oBAAY,EAAE,4BAAiB,CAAC,CAAC;IAC7C,qCAAqC;IACrC,cAAI,CAAC,KAAK,CAAC,CAAC,oBAAY,CAAC,CAAC;CAC1B,CAAC,CACF,CAAC;AAIW,QAAA,aAAa,GAAG,cAAI,CAAC,MAAM,CACvC;IACC,MAAM,EAAE,0BAAkB;IAC1B;;;OAGG;IACH,KAAK,EAAE,4BAAiB;CACxB,EACD,iBAAiB,CACjB,CAAC;AAIW,QAAA,uBAAuB,GAAG,cAAI,CAAC,MAAM,CACjD;IACC,KAAK,EAAE,cAAI,CAAC,QAAQ,CAAC,8BAAsB,CAAC;IAC5C,OAAO,EAAE,qBAAqB;IAC9B,SAAS,EAAE,cAAI,CAAC,gBAAgB,CAAC,cAAI,CAAC,KAAK,CAAC,2BAAmB,CAAC,CAAC;IACjE,MAAM,EAAE,cAAI,CAAC,QAAQ,CAAC,qBAAa,CAAC;IACpC,UAAU,EAAE,cAAI,CAAC,QAAQ,CAAC,qBAAa,CAAC;CACxC,EACD,iBAAiB,CACjB,CAAC","sourcesContent":["/!\n Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n /\n\nimport { ObjectOptions, Static, Type } from \"@sinclair/typebox\";\n\nimport { ChangesetLocalId, RevisionTagSchema, schemaFormat } from \"../../core/index.js\";\nimport {\n\tJsonCompatibleReadOnly,\n\tJsonCompatibleReadOnlySchema,\n\tbrandedNumberType,\n} from \"../../util/index.js\";\nimport { EncodedFieldBatch } from \"../chunked-forest/index.js\";\n\nconst noAdditionalProps: ObjectOptions = { additionalProperties: false };\n\nexport const ChangesetLocalIdSchema = brandedNumberType<ChangesetLocalId>({\n\tmultipleOf: 1,\n});\n\nexport const EncodedChangeAtomId = Type.Union([\n\tType.Tuple([ChangesetLocalIdSchema, RevisionTagSchema]),\n\tChangesetLocalIdSchema,\n]);\nexport type EncodedChangeAtomId = Static<typeof EncodedChangeAtomId>;\n\nconst EncodedFieldChange = Type.Object(\n\t{\n\t\tfieldKey: schemaFormat.FieldKeySchema,\n\t\tfieldKind: schemaFormat.FieldKindIdentifierSchema,\n\t\t// Implementation note: node and field change encoding is mutually recursive.\n\t\t// This field marks a boundary in that recursion to avoid constructing excessively complex\n\t\t// recursive types. Encoded changes are validated at this boundary at runtime--see modularChangeCodecs.ts.\n\t\tchange: JsonCompatibleReadOnlySchema,\n\t},\n\tnoAdditionalProps,\n);\n\nexport interface EncodedFieldChange extends Static<typeof EncodedFieldChange> {\n\t/\n\t Encoded in format selected by `fieldKind`\n\t /\n\tchange: JsonCompatibleReadOnly;\n}\n\nconst EncodedFieldChangeMap = Type.Array(EncodedFieldChange);\n\n/\n Format for encoding as json.\n \n This chooses to use lists of named objects instead of maps:\n * this choice is somewhat arbitrary, but avoids user data being used as object keys,\n * which can sometimes be an issue (for example handling that for \"__proto__\" can require care).\n /\nexport type EncodedFieldChangeMap = Static<typeof EncodedFieldChangeMap>;\n\nconst EncodedNodeExistsConstraint = Type.Object(\n\t{\n\t\tviolated: Type.Boolean(),\n\t},\n\tnoAdditionalProps,\n);\ntype EncodedNodeExistsConstraint = Static<typeof EncodedNodeExistsConstraint>;\n\nexport const EncodedNodeChangeset = Type.Object(\n\t{\n\t\tfieldChanges: Type.Optional(EncodedFieldChangeMap),\n\t\tnodeExistsConstraint: Type.Optional(EncodedNodeExistsConstraint),\n\t},\n\tnoAdditionalProps,\n);\n\n/\n Format for encoding as json.\n /\nexport type EncodedNodeChangeset = Static<typeof EncodedNodeChangeset>;\n\nexport const EncodedRevisionInfo = Type.Object(\n\t{\n\t\trevision: Type.Readonly(RevisionTagSchema),\n\t\trollbackOf: Type.ReadonlyOptional(RevisionTagSchema),\n\t},\n\tnoAdditionalProps,\n);\n\nexport type EncodedRevisionInfo = Static<typeof EncodedRevisionInfo>;\n\n/\n Index of field in an EncodedFieldBatch.\n /\nexport const EncodedTreeIndex = Type.Number({ multipleOf: 1, minimum: 0 });\n\nexport const CommitBuilds = Type.Array(\n\tType.Tuple([\n\t\t// ID for first node\n\t\tChangesetLocalIdSchema,\n\t\t// Index for a TreeChunk that represents all the nodes\n\t\tEncodedTreeIndex,\n\t]),\n);\nexport type CommitBuilds = Static<typeof CommitBuilds>;\n\nexport const EncodedBuildsArray = Type.Array(\n\tType.Union([\n\t\tType.Tuple([CommitBuilds, RevisionTagSchema]),\n\t\t// Revision is omitted when undefined\n\t\tType.Tuple([CommitBuilds]),\n\t]),\n);\n\nexport type EncodedBuildsArray = Static<typeof EncodedBuildsArray>;\n\nexport const EncodedBuilds = Type.Object(\n\t{\n\t\tbuilds: EncodedBuildsArray,\n\t\t/\n\t\t Fields indexed by the EncodedTreeIndexes above.\n\t\t * TODO: Strongly typing this here may result in redundant schema validation of this data.\n\t\t */\n\t\ttrees: EncodedFieldBatch,\n\t},\n\tnoAdditionalProps,\n);\n\nexport type EncodedBuilds = Static<typeof EncodedBuilds>;\n\nexport const EncodedModularChangeset = Type.Object(\n\t{\n\t\tmaxId: Type.Optional(ChangesetLocalIdSchema),\n\t\tchanges: EncodedFieldChangeMap,\n\t\trevisions: Type.ReadonlyOptional(Type.Array(EncodedRevisionInfo)),\n\t\tbuilds: Type.Optional(EncodedBuilds),\n\t\trefreshers: Type.Optional(EncodedBuilds),\n\t},\n\tnoAdditionalProps,\n);\n\nexport type EncodedModularChangeset = Static<typeof EncodedModularChangeset>;\n"]}