@fluidframework/tree 2.0.0-dev-rc.1.0.0.224419

package/lib/feature-libraries/modular-schema/modularChangeFamily.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"modularChangeFamily.js","sourceRoot":"","sources":["../../../src/feature-libraries/modular-schema/modularChangeFamily.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,4BAA4B,CAAC;AACpD,OAAO,EAA2C,eAAe,EAAE,MAAM,aAAa,CAAC;AACvF,OAAO,EAEN,WAAW,EAOX,SAAS,EACT,cAAc,EAId,mBAAmB,EAGnB,8BAA8B,EAE9B,kBAAkB,EAElB,UAAU,GAQV,MAAM,YAAY,CAAC;AACpB,OAAO,EACN,KAAK,EACL,kBAAkB,EAClB,kBAAkB,EAClB,aAAa,EAGb,oBAAoB,EACpB,oBAAoB,EACpB,eAAe,GAEf,MAAM,YAAY,CAAC;AACpB,OAAO,EAAE,wBAAwB,EAAE,MAAM,6BAA6B,CAAC;AACvE,OAAO,EAAa,SAAS,EAAE,kBAAkB,EAAE,mBAAmB,EAAE,MAAM,mBAAmB,CAAC;AAClG,OAAO,EAIN,gBAAgB,EAChB,kBAAkB,EAClB,yBAAyB,EACzB,kBAAkB,GAClB,MAAM,qBAAqB,CAAC;AAC7B,OAAO,EAEN,kBAAkB,GAElB,MAAM,sBAAsB,CAAC;AAC9B,OAAO,EAAkC,UAAU,EAAE,MAAM,aAAa,CAAC;AACzE,OAAO,EAAE,oBAAoB,EAAE,gBAAgB,EAAE,mBAAmB,EAAE,MAAM,oBAAoB,CAAC;AAUjG,OAAO,EAAE,WAAW,EAAE,MAAM,uBAAuB,CAAC;AAGpD;;;GAGG;AACH,MAAM,OAAO,mBAAmB;IAS/B,YACiB,UAAiE,EACjF,gBAA6D,EAC7D,YAA2B;QAFX,eAAU,GAAV,UAAU,CAAuD;QAIjF,IAAI,CAAC,WAAW,GAAG,WAAW,CAC7B,UAAU,EACV,gBAAgB,EAChB,mBAAmB,CAAC,YAAY,CAAC,EACjC,YAAY,CACZ,CAAC;QACF,IAAI,CAAC,MAAM,GAAG,eAAe,CAAC,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,OAA+B,EAC/B,KAAkB,EAClB,gBAAwC;QAKxC,mEAAmE;QACnE,MAAM,gBAAgB,GAAG,OAAO,CAAC,IAAI,CACpC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,SAAS,KAAK,gBAAgB,CAAC,UAAU,CAC5D,CAAC;QACF,IAAI,gBAAgB,KAAK,SAAS,EAAE;YACnC,8BAA8B;YAC9B,OAAO,EAAE,SAAS,EAAE,gBAAgB,EAAE,UAAU,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC;SACjF;QACD,MAAM,IAAI,GAAG,gBAAgB,CAAC,SAAS,CAAC;QACxC,MAAM,SAAS,GAAG,YAAY,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;QACtD,MAAM,OAAO,GAAG,SAAS,CAAC,aAAa,CAAC;QACxC,MAAM,iBAAiB,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE;YAChD,IAAI,MAAM,CAAC,SAAS,KAAK,gBAAgB,CAAC,UAAU,EAAE;gBACrD,mDAAmD;gBACnD,MAAM,aAAa,GAAG,MAAM,CAAC,MAAqC,CAAC;gBACnE,OAAO,oBAAoB,CAC1B,aAAa,EACb,OAAO,EACP,CAAC,QAAQ,EAAE,EAAE,CACZ,IAAI,CAAC,kBAAkB,CACtB,QAAQ,EACR,KAAK,EACL,kBAAkB,EAAE,EACpB,gBAAgB,CAChB,EACF,KAAK,EACL,gBAAgB,CACE,CAAC;aACpB;YACD,OAAO,MAAM,CAAC,MAAM,CAAC;QACtB,CAAC,CAAC,CAAC;QACH,OAAO,EAAE,SAAS,EAAE,UAAU,EAAE,iBAAiB,EAAE,CAAC;IACrD,CAAC;IAEM,OAAO,CAAC,OAAyC;QACvD,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,GAAG,2BAA2B,CAAC,OAAO,CAAC,CAAC;QACjE,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE;YACzB,MAAM,EAAE,YAAY,EAAE,MAAM,EAAE,wBAAwB,EAAE,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;YAC7E,OAAO,oBAAoB,CAC1B,YAAY,EACZ,KAAK,EACL,QAAQ,EACR,wBAAwB,EACxB,MAAM,CACN,CAAC;SACF;QACD,MAAM,gBAAgB,GAA2B,8BAA8B,CAAC,QAAQ,CAAC,CAAC;QAC1F,MAAM,OAAO,GAAsB,EAAE,KAAK,EAAE,CAAC;QAC7C,MAAM,KAAK,GAAgB,oBAAoB,CAAC,OAAO,CAAC,CAAC;QACzD,MAAM,eAAe,GAAG,kBAAkB,EAAe,CAAC;QAE1D,MAAM,kCAAkC,GAAG,OAAO,CAAC,MAAM,CACxD,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,wBAAwB,IAAI,CAAC,CAAC,KAAK,CAAC,CAC/D,CAAC;QAEF,MAAM,cAAc,GAAG,IAAI,CAAC,gBAAgB,CAC3C,kCAAkC,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CACjD,SAAS,CAAC,MAAM,CAAC,MAAM,CAAC,YAAY,EAAE,wBAAwB,CAAC,MAAM,CAAC,CAAC,CACvE,EACD,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,KAAK,IAAI,cAAc,EAAE;gBACnC,MAAM,aAAa,GAAG,gBAAgB,CACrC,IAAI,CAAC,UAAU,EACf,KAAK,CAAC,SAAS,CACf,CAAC,OAAO,CAAC,YAAY,CACrB,KAAK,CAAC,MAAM,EACZ,CAAC,QAAQ,EAAE,EAAE,CACZ,IAAI,CAAC,kBAAkB,CAAC,QAAQ,EAAE,KAAK,EAAE,eAAe,EAAE,gBAAgB,CAAC,EAC5E,KAAK,EACL,oBAAoB,CAAC,eAAe,CAAC,EACrC,gBAAgB,CAChB,CAAC;gBACF,KAAK,CAAC,MAAM,GAAG,KAAK,CAAC,aAAa,CAAC,CAAC;aACpC;SACD;QAED,MAAM,CACL,eAAe,CAAC,iBAAiB,CAAC,IAAI,KAAK,CAAC,EAC5C,KAAK,CAAC,+CAA+C,CACrD,CAAC;QACF,MAAM,SAAS,GAA+B,IAAI,GAAG,EAAE,CAAC;QACxD,KAAK,MAAM,YAAY,IAAI,OAAO,EAAE;YACnC,MAAM,QAAQ,GAAG,wBAAwB,CAAC,YAAY,CAAC,CAAC;YACxD,MAAM,MAAM,GAAG,YAAY,CAAC,MAAM,CAAC;YACnC,IAAI,MAAM,CAAC,MAAM,EAAE;gBAClB,KAAK,MAAM,CAAC,WAAW,EAAE,QAAQ,CAAC,IAAI,MAAM,CAAC,MAAM,EAAE;oBACpD,MAAM,cAAc,GAAG,WAAW,IAAI,QAAQ,CAAC;oBAC/C,MAAM,WAAW,GAAG,aAAa,CAAC,SAAS,EAAE,cAAc,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;oBACxE,KAAK,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,QAAQ,EAAE;wBAClC,sDAAsD;wBACtD,+DAA+D;wBAC/D,0CAA0C;wBAC1C,iFAAiF;wBACjF,4FAA4F;wBAC5F,+FAA+F;wBAC/F,yFAAyF;wBACzF,wFAAwF;wBACxF,0FAA0F;wBAC1F,6FAA6F;wBAC7F,4EAA4E;wBAC5E,4FAA4F;wBAC5F,0FAA0F;wBAC1F,gCAAgC;wBAChC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;4BACzB,WAAW,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;yBAC1B;qBACD;iBACD;aACD;SACD;QACD,OAAO,oBAAoB,CAC1B,IAAI,CAAC,aAAa,CAAC,cAAc,CAAC,EAClC,OAAO,CAAC,KAAK,EACb,QAAQ,EACR,SAAS,EACT,SAAS,CACT,CAAC;IACH,CAAC;IAEO,gBAAgB,CACvB,OAAuC,EACvC,KAAkB,EAClB,eAA6C,EAC7C,gBAAwC;QAExC,MAAM,YAAY,GAAG,IAAI,GAAG,EAA2B,CAAC;QACxD,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE;YAC7B,KAAK,MAAM,CAAC,GAAG,EAAE,WAAW,CAAC,IAAI,MAAM,CAAC,MAAM,EAAE;gBAC/C,MAAM,oBAAoB,GACzB,WAAW,CAAC,QAAQ,KAAK,SAAS,IAAI,MAAM,CAAC,QAAQ,KAAK,SAAS;oBAClE,CAAC,CAAC,WAAW;oBACb,CAAC,CAAC;wBACA,GAAG,WAAW;wBACd,QAAQ,EAAE,MAAM,CAAC,QAAQ;qBACxB,CAAC;gBAEN,kBAAkB,CAAC,YAAY,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC,oBAAoB,CAAC,CAAC;aACjE;SACD;QAED,MAAM,cAAc,GAAmB,IAAI,GAAG,EAAE,CAAC;QACjD,KAAK,MAAM,CAAC,KAAK,EAAE,eAAe,CAAC,IAAI,YAAY,EAAE;YACpD,MAAM,EAAE,SAAS,EAAE,UAAU,EAAE,GAAG,IAAI,CAAC,qBAAqB,CAC3D,eAAe,EACf,KAAK,EACL,gBAAgB,CAChB,CAAC;YACF,MAAM,CACL,UAAU,CAAC,MAAM,KAAK,eAAe,CAAC,MAAM,EAC5C,KAAK,CAAC,2DAA2D,CACjE,CAAC;YAEF,MAAM,OAAO,GAAG,oBAAoB,CAAC,eAAe,CAAC,CAAC;YACtD,MAAM,gBAAgB,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CACrD,SAAS,CAAC,MAAM,EAAE,eAAe,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAC9C,CAAC;YACF,MAAM,cAAc,GAAG,SAAS,CAAC,aAAa,CAAC,OAAO,CAAC,OAAO,CAC7D,gBAAgB,EAChB,CAAC,QAAQ,EAAE,EAAE,CACZ,IAAI,CAAC,kBAAkB,CAAC,QAAQ,EAAE,KAAK,EAAE,eAAe,EAAE,gBAAgB,CAAC,EAC5E,KAAK,EACL,OAAO,EACP,gBAAgB,CAChB,CAAC;YAEF,MAAM,aAAa,GAAgB;gBAClC,SAAS,EAAE,SAAS,CAAC,UAAU;gBAC/B,MAAM,EAAE,KAAK,CAAC,cAAc,CAAC;aAC7B,CAAC;YAEF,YAAY,CAAC,OAAO,EAAE,aAAa,CAAC,CAAC;YAErC,mEAAmE;YACnE,cAAc,CAAC,GAAG,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC;SACzC;QACD,OAAO,cAAc,CAAC;IACvB,CAAC;IAEO,kBAAkB,CACzB,OAAsC,EACtC,KAAkB,EAClB,eAA6C,EAC7C,gBAAwC;QAExC,MAAM,YAAY,GAAmC,EAAE,CAAC;QACxD,IAAI,oBAAsD,CAAC;QAC3D,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE;YAC7B,wCAAwC;YACxC,wDAAwD;YACxD,kEAAkE;YAClE,iCAAiC;YACjC,sEAAsE;YACtE,4EAA4E;YAC5E,sFAAsF;YACtF,iFAAiF;YACjF,IAAI,MAAM,CAAC,MAAM,CAAC,oBAAoB,KAAK,SAAS,EAAE;gBACrD,oBAAoB,GAAG,EAAE,GAAG,MAAM,CAAC,MAAM,CAAC,oBAAoB,EAAE,CAAC;aACjE;YAED,IAAI,MAAM,CAAC,MAAM,CAAC,YAAY,KAAK,SAAS,EAAE;gBAC7C,YAAY,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,MAAM,CAAC,YAAY,EAAE,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;aAC1E;SACD;QAED,MAAM,oBAAoB,GAAG,IAAI,CAAC,gBAAgB,CACjD,YAAY,EACZ,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,oBAAoB,CAAC,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,8BAA8B,CAAC,QAAQ,CAAC,CAAC;QAElE,MAAM,cAAc,GAAG,IAAI,CAAC,cAAc,CACzC,SAAS,CAAC,MAAM,CAAC,MAAM,CAAC,YAAY,EAAE,wBAAwB,CAAC,MAAM,CAAC,CAAC,EACvE,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,MAAM,CACL,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,SAAS,CAAC,mBAAmB,EAAE,QAAQ,CAAC,EACxC,CAAC,aAAa,EAAE,EAAE,CAAC,aAAa,EAChC,KAAK,EACL,oBAAoB,CAAC,eAAe,CAAC,EACrC,gBAAgB,CAChB,CAAC;gBACF,aAAa,CAAC,MAAM,GAAG,KAAK,CAAC,aAAa,CAAC,CAAC;aAC5C;YAED,0DAA0D;YAC1D,uDAAuD;SACvD;QAED,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,CACtC,CAAC;IACH,CAAC;IAEO,cAAc,CACrB,OAAqC,EACrC,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,CAAC,CAAC;YACtD,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,KAAK,EACL,eAAe,EACf,gBAAgB,CAChB,EACF,KAAK,EACL,OAAO,EACP,gBAAgB,CAChB,CAAC;YAEF,MAAM,mBAAmB,GAAgB;gBACxC,GAAG,WAAW;gBACd,MAAM,EAAE,KAAK,CAAC,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;YAEH,YAAY,CAAC,OAAO,EAAE,WAAW,CAAC,CAAC;SACnC;QAED,OAAO,cAAc,CAAC;IACvB,CAAC;IAEO,gBAAgB,CACvB,MAAmC,EACnC,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,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,oBAAoB,CAAC,OAAO,CAAC,CAAC;QACzD,MAAM,eAAe,GAAgB;YACpC,GAAG,kBAAkB,EAAe;YACpC,qBAAqB,EAAE,IAAI,GAAG,EAAE;SAChC,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,SAAS,CAAC,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,qBAAqB,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;gBACjE,MAAM,CAAC,OAAO,KAAK,SAAS,EAAE,KAAK,CAAC,uCAAuC,CAAC,CAAC;gBAC7E,MAAM,EACL,SAAS,EACT,UAAU,EAAE,CAAC,cAAc,EAAE,aAAa,CAAC,GAC3C,GAAG,IAAI,CAAC,qBAAqB,CAC7B,CAAC,OAAO,CAAC,SAAS,EAAE,OAAO,CAAC,UAAU,CAAC,EACvC,KAAK,EACL,gBAAgB,CAChB,CAAC;gBAEF,KAAK,CAAC,MAAM,GAAG,SAAS,CAAC,aAAa,CAAC,OAAO,CAAC,MAAM,CACpD,cAAc,EACd,SAAS,CAAC,aAAa,EAAE,OAAO,CAAC,YAAY,CAAC,EAC9C,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,EACd,KAAK,EACL,oBAAoB,CAAC,eAAe,CAAC,EACrC,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,CACb,CAAC;IACH,CAAC;IAEO,cAAc,CACrB,MAAsB,EACtB,IAAkC,EAClC,KAAkB,EAClB,eAA4B,EAC5B,WAAqF,EACrF,gBAAwC,EACxC,eAAgC,EAChC,iBAAqC,kBAAkB,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,gBAAgB,CAAC,UAAU;gBACtC,MAAM,EAAE,KAAK,CAAC,mBAAmB,EAAE,CAAC;aACpC,CAAC;YACF,MAAM,EACL,SAAS,EACT,UAAU,EAAE,CAAC,cAAc,EAAE,aAAa,CAAC,GAC3C,GAAG,IAAI,CAAC,qBAAqB,CAAC,CAAC,WAAW,EAAE,WAAW,CAAC,EAAE,KAAK,EAAE,gBAAgB,CAAC,CAAC;YAEpF,MAAM,EAAE,QAAQ,EAAE,GAAG,IAAI,CAAC;YAC1B,MAAM,gBAAgB,GAAG,EAAE,QAAQ,EAAE,MAAM,EAAE,aAAa,EAAE,CAAC;YAC7D,MAAM,OAAO,GAAG,oBAAoB,CAAC,eAAe,CAAC,CAAC;YAEtD,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,KAAK,CAAC,YAAY,CAAC;aAC3B,CAAC;YAEF,aAAa,CAAC,GAAG,CAAC,KAAK,EAAE,kBAAkB,CAAC,CAAC;YAE7C,YAAY,CAAC,OAAO,EAAE,kBAAkB,CAAC,CAAC;YAC1C,eAAe,CAAC,qBAAqB,CAAC,GAAG,CAAC,kBAAkB,EAAE;gBAC7D,UAAU,EAAE,WAAW;gBACvB,YAAY,EAAE,QAAQ;gBACtB,SAAS,EAAE,WAAW;aACtB,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,gBAAgB,CAAC,UAAU;oBACtC,MAAM,EAAE,KAAK,CAAC,mBAAmB,EAAE,CAAC;iBACpC,CAAC;gBAEF,MAAM,EACL,SAAS,EACT,UAAU,EAAE,CAAC,cAAc,EAAE,aAAa,CAAC,GAC3C,GAAG,IAAI,CAAC,qBAAqB,CAAC,CAAC,WAAW,EAAE,WAAW,CAAC,EAAE,KAAK,EAAE,gBAAgB,CAAC,CAAC;gBAEpF,MAAM,OAAO,GAAG,oBAAoB,CAAC,eAAe,CAAC,CAAC;gBACtD,MAAM,gBAAgB,GAAG,SAAS,CAAC,aAAa,CAAC,OAAO,CAAC,MAAM,CAC9D,cAAc,EACd,SAAS,CAAC,aAAa,EAAE,IAAI,CAAC,QAAQ,CAAC,EACvC,CAAC,KAAK,EAAE,SAAS,EAAE,EAAE;oBACpB,MAAM,CACL,SAAS,KAAK,SAAS,EACvB,KAAK,CAAC,iDAAiD,CACvD,CAAC;oBACF,OAAO,IAAI,CAAC,gBAAgB,CAC3B,KAAK,EACL,SAAS,CAAC,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,KAAK,CAAC,gBAAgB,CAAC;iBAC/B,CAAC;gBACF,aAAa,CAAC,GAAG,CAAC,KAAK,EAAE,kBAAkB,CAAC,CAAC;gBAC7C,YAAY,CAAC,OAAO,EAAE,kBAAkB,CAAC,CAAC;aAC1C;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,kBAAkB,CAAC,KAAK;QAE7D,IAAI,MAAM,KAAK,SAAS,IAAI,IAAI,CAAC,MAAM,EAAE,YAAY,KAAK,SAAS,EAAE;YACpE,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,SAAS,CAAC,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,kBAAkB,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,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,KAAK,CAAC,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;;AArrBsB,+BAAW,GAAqB,oBAAoB,EAAE,CAAC;AAwrB/E;;;;;;;;;;;;;;GAcG;AACH,MAAM,SAAS,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;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,SAAS,CAAC,WAAW,CAAC,MAAM,EAAE,aAAa,CAAC,EAAE,QAAQ,CAAC,CAAC;KAC5F;AACF,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,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,UAAU,CAAC;KAClB;IAED,MAAM,QAAQ,GAAG,wBAAwB,CAAC,YAAY,CAAC,CAAC;IACxD,MAAM,WAAW,GAAG,wBAAwB,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,MAAM,MAAM,GAA6B,EAAE,CAAC;QAC5C,kBAAkB,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,EAAE;YACxD,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;YAC7B,MAAM,CACL,MAAM,CAAC,cAAc,EAAE,KAAK,CAAC,EAC7B,KAAK,CAAC,oDAAoD,CAC1D,CAAC;YACF,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;YACpB,MAAM,CAAC,IAAI,CAAC;gBACX,EAAE,EAAE,kBAAkB,CAAC,KAAK,IAAI,QAAQ,EAAE,KAAK,CAAC;gBAChD,KAAK,EAAE,CAAC,MAAM,CAAC;aACf,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QACH,SAAS,CAAC,KAAK,GAAG,MAAM,CAAC;KACzB;IACD,OAAO,SAAS,CAAC;AAClB,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,SAAS,CAAC,WAAW,CAAC,MAAM,EAAE,aAAa,CAAC,EAC5C,CAAC,WAAW,EAAiB,EAAE,CAC9B,mBAAmB,CAAC,SAAS,CAAC,WAAW,EAAE,aAAa,CAAC,EAAE,WAAW,EAAE,UAAU,CAAC,EACpF,WAAW,CACX,CAAC;QACF,IAAI,CAAC,mBAAmB,CAAC,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,MAAM,UAAU,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,8BAA8B,CAAC,QAAQ,CAAC;QAC3C,gBAAgB;KAChB,CAAC;AACH,CAAC;AAED,SAAS,oBAAoB,CAAC,MAAqB;IAClD,OAAO,MAAM,CAAC,YAAY,KAAK,SAAS,IAAI,MAAM,CAAC,oBAAoB,KAAK,SAAS,CAAC;AACvF,CAAC;AAED,MAAM,UAAU,YAAY,CAC3B,UAAuD,EACvD,IAAyB;IAEzB,IAAI,IAAI,KAAK,gBAAgB,CAAC,UAAU,EAAE;QACzC,OAAO,gBAAgB,CAAC;KACxB;IACD,MAAM,SAAS,GAAG,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACvC,MAAM,CAAC,SAAS,KAAK,SAAS,EAAE,KAAK,CAAC,wBAAwB,CAAC,CAAC;IAChE,OAAO,UAAU,CAAC,SAAS,CAAC,CAAC;AAC9B,CAAC;AAED,MAAM,UAAU,gBAAgB,CAC/B,UAAuD,EACvD,IAAyB;IAEzB,OAAO,YAAY,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC,aAAa,CAAC;AACrD,CAAC;AA6BD,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;AAWD,SAAS,oBAAoB,CAAI,eAAmC;IACnE,MAAM,UAAU,GAAuB,IAAI,GAAG,EAAE,CAAC;IACjD,MAAM,UAAU,GAAuB,IAAI,GAAG,EAAE,CAAC;IACjD,MAAM,MAAM,GAAG,CAAC,MAAwB,EAAE,EAAE,CAC3C,MAAM,KAAK,gBAAgB,CAAC,MAAM,CAAC,CAAC,CAAC,eAAe,CAAC,QAAQ,CAAC,CAAC,CAAC,eAAe,CAAC,QAAQ,CAAC;IAE1F,MAAM,UAAU,GAAG,CAAC,MAAwB,EAAE,EAAE,CAC/C,MAAM,KAAK,gBAAgB,CAAC,MAAM,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,UAAU,CAAC;IAE9D,MAAM,OAAO,GAAG;QACf,KAAK,EAAE,eAAe;QACtB,UAAU;QACV,UAAU;QACV,gBAAgB,EAAE,KAAK;QACvB,GAAG,EAAE,CACJ,MAAwB,EACxB,QAAiC,EACjC,EAAoB,EACpB,KAAa,EACb,QAAiB,EACjB,oBAA6B,EAC5B,EAAE;YACH,IAAI,oBAAoB,EAAE;gBACzB,MAAM,aAAa,GAClB,MAAM,KAAK,gBAAgB,CAAC,MAAM;oBACjC,CAAC,CAAC,eAAe,CAAC,aAAa;oBAC/B,CAAC,CAAC,eAAe,CAAC,aAAa,CAAC;gBAElC,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,yBAAyB,CAC/C,aAAa,EACb,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,KAAK,CAAC,OAAO,GAAG,cAAc,CAAC,MAAM,CAAC,CAAC;iBACjD;gBAED,IACC,yBAAyB,CAAC,UAAU,CAAC,MAAM,CAAC,EAAE,QAAQ,EAAE,EAAE,EAAE,KAAK,CAAC,KAAK,SAAS,EAC/E;oBACD,OAAO,CAAC,gBAAgB,GAAG,IAAI,CAAC;iBAChC;aACD;YACD,kBAAkB,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,QAAQ,EAAE,EAAE,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC;QACnE,CAAC;QACD,GAAG,EAAE,CACJ,MAAwB,EACxB,QAAiC,EACjC,EAAoB,EACpB,KAAa,EACb,aAAsB,EACrB,EAAE;YACH,IAAI,aAAa,EAAE;gBAClB,kBAAkB,CAAC,UAAU,CAAC,MAAM,CAAC,EAAE,QAAQ,EAAE,EAAE,EAAE,KAAK,CAAC,CAAC;aAC5D;YACD,OAAO,yBAAyB,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,QAAQ,EAAE,EAAE,EAAE,KAAK,CAAC,CAAC;QACvE,CAAC;KACD,CAAC;IAEF,OAAO,OAAO,CAAC;AAChB,CAAC;AAED,SAAS,YAAY,CAAI,OAA8B,EAAE,SAAY;IACpE,KAAK,MAAM,CAAC,QAAQ,EAAE,QAAQ,CAAC,IAAI,OAAO,CAAC,UAAU,EAAE;QACtD,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE;YAC7B,wEAAwE;YACxE,sEAAsE;YACtE,yFAAyF;YACzF,kBAAkB,CACjB,OAAO,CAAC,KAAK,CAAC,aAAa,EAC3B,QAAQ,EACR,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,EAClB,KAAK,CAAC,MAAM,EACZ,SAAS,CACT,CAAC;SACF;KACD;IAED,KAAK,MAAM,CAAC,QAAQ,EAAE,QAAQ,CAAC,IAAI,OAAO,CAAC,UAAU,EAAE;QACtD,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE;YAC7B,oBAAoB;YACpB,kBAAkB,CACjB,OAAO,CAAC,KAAK,CAAC,aAAa,EAC3B,QAAQ,EACR,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,EAClB,KAAK,CAAC,MAAM,EACZ,SAAS,CACT,CAAC;SACF;KACD;IAED,IAAI,OAAO,CAAC,gBAAgB,EAAE;QAC7B,OAAO,CAAC,KAAK,CAAC,iBAAiB,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;KAC/C;AACF,CAAC;AAED,SAAS,oBAAoB,CAC5B,UAAsC,SAAS,EAC/C,QAAgB,CAAC,CAAC,EAClB,YAAiD,SAAS,EAC1D,2BAA+C,SAAS,EACxD,MAAmC;IAEnC,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,KAAK,CAAC,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,OAAO,SAAS,CAAC;AAClB,CAAC;AAED,MAAM,OAAO,kBAAmB,SAAQ,WAA6B;IAIpE,YACC,MAA0D,EAC1D,cAAkD;QAElD,KAAK,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC;QAPvB,qBAAgB,GAAW,CAAC,CAAC;QAQpC,IAAI,CAAC,WAAW,GAAG,oBAAoB,EAAE,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,oBAAoB,EAAE,CAAC;SAC1C;IACF,CAAC;IAEe,eAAe;QAC9B,MAAM,CAAC,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,oBAAoB,EAAE,CAAC;SAC1C;IACF,CAAC;IAEM,UAAU,CAChB,OAAyB,EACzB,UAAgD;QAEhD,MAAM,OAAO,GAAG,eAAe,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;QACxE,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;QAC9B,IAAI,MAAM,KAAK,CAAC,EAAE;YACjB,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,IAAI,EAAE,GAAG,OAAO,CAAC;QAEjB,0FAA0F;QAC1F,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE;YAC7B,MAAM,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,mCAAmC,CAAC,CAAC;YACrE,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,SAAS,CAAC,MAAgC,EAAE,kBAAkB,CAAC,CAAC,CAAC;YAClF,EAAE,GAAG,KAAK,CAAE,EAAa,GAAG,CAAC,CAAC,CAAC;SAC/B;QACD,OAAO;YACN,IAAI,EAAE,QAAQ;YACd,MAAM;SACN,CAAC;IACH,CAAC;IAED;;;;;;OAMG;IACI,YAAY,CAClB,KAAkB,EAClB,SAA8B,EAC9B,MAAsB,EACtB,QAA0B,KAAK,CAAC,CAAC,CAAC,CAAC;QAEnC,MAAM,SAAS,GAAG,IAAI,CAAC,cAAc,CAAC,KAAK,EAAE,SAAS,EAAE,MAAM,CAAC,CAAC;QAChE,IAAI,CAAC,WAAW,CAAC,oBAAoB,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC,CAAC;IAC1D,CAAC;IAEM,aAAa,CAAC,OAA0B,EAAE,QAA0B,KAAK,CAAC,CAAC,CAAC,CAAC;QACnF,MAAM,UAAU,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CACzC,cAAc,CACb,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,IAAI,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC;IAClC,CAAC;IAEM,UAAU,CAAC,KAAc;QAC/B,OAAO,KAAK,CAAC,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,gBAAgB,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,gBAAgB,CAAC,UAAU,EAAE,MAAM,EAAE,KAAK,CAAC,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,gBAAgB,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,gBAAgB,CAAC,UAAU,EAC3B,KAAK,CAAC,WAAW,CAAC,CAClB,CAAC;IACH,CAAC;CACD;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,KAAK,CAAC,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, IJsonCodec, makeCodecFamily } from \"../../codec\";\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\tITreeCursor,\n\temptyDelta,\n\tDeltaFieldMap,\n\tDeltaFieldChanges,\n\tDeltaDetachedNodeBuild,\n\tDeltaRoot,\n\tITreeCursorSynchronous,\n\tDeltaDetachedNodeId,\n\tEncodedRevisionTag,\n} from \"../../core\";\nimport {\n\tbrand,\n\tforEachInNestedMap,\n\tgetOrAddEmptyToMap,\n\tgetOrAddInMap,\n\tIdAllocationState,\n\tIdAllocator,\n\tidAllocatorFromMaxId,\n\tidAllocatorFromState,\n\tisReadonlyArray,\n\tMutable,\n} from \"../../util\";\nimport { MemoizedIdRangeAllocator } from \"../memoizedIdRangeAllocator\";\nimport { TreeChunk, chunkTree, defaultChunkPolicy, makeFieldBatchCodec } from \"../chunked-forest\";\nimport {\n\tCrossFieldManager,\n\tCrossFieldMap,\n\tCrossFieldQuerySet,\n\tCrossFieldTarget,\n\taddCrossFieldQuery,\n\tgetFirstFromCrossFieldMap,\n\tsetInCrossFieldMap,\n} from \"./crossFieldQueries\";\nimport {\n\tFieldChangeHandler,\n\tNodeExistenceState,\n\tRebaseRevisionMetadata,\n} from \"./fieldChangeHandler\";\nimport { FieldKind, FieldKindWithEditor, withEditor } from \"./fieldKind\";\nimport { convertGenericChange, genericFieldKind, newGenericChangeset } from \"./genericFieldKind\";\nimport { GenericChangeset } from \"./genericFieldKindTypes\";\nimport {\n\tFieldChange,\n\tFieldChangeMap,\n\tFieldChangeset,\n\tModularChangeset,\n\tNodeChangeset,\n\tNodeExistsConstraint,\n} from \"./modularChangeTypes\";\nimport { makeV0Codec } from \"./modularChangeCodecs\";\nimport { EncodedModularChangeset } from \"./modularChangeFormat\";\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: IJsonCodec<ModularChangeset, EncodedModularChangeset>;\n\n\tpublic readonly codecs: ICodecFamily<ModularChangeset>;\n\n\tpublic constructor(\n\t\tpublic readonly fieldKinds: ReadonlyMap<FieldKindIdentifier, FieldKindWithEditor>,\n\t\trevisionTagCodec: IJsonCodec<RevisionTag, EncodedRevisionTag>,\n\t\tcodecOptions: ICodecOptions,\n\t) {\n\t\tthis.latestCodec = makeV0Codec(\n\t\t\tfieldKinds,\n\t\t\trevisionTagCodec,\n\t\t\tmakeFieldBatchCodec(codecOptions),\n\t\t\tcodecOptions,\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 FieldKind}.\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 FieldKind}, 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\tchanges: readonly FieldChange[],\n\t\tgenId: IdAllocator,\n\t\trevisionMetadata: RevisionMetadataSource,\n\t): {\n\t\tfieldKind: FieldKindWithEditor;\n\t\tchangesets: FieldChangeset[];\n\t} {\n\t\t// TODO: Handle the case where changes have conflicting field kinds\n\t\tconst nonGenericChange = changes.find(\n\t\t\t(change) => change.fieldKind !== genericFieldKind.identifier,\n\t\t);\n\t\tif (nonGenericChange === undefined) {\n\t\t\t// All the changes are generic\n\t\t\treturn { fieldKind: genericFieldKind, changesets: changes.map((c) => c.change) };\n\t\t}\n\t\tconst kind = nonGenericChange.fieldKind;\n\t\tconst fieldKind = getFieldKind(this.fieldKinds, kind);\n\t\tconst handler = fieldKind.changeHandler;\n\t\tconst normalizedChanges = changes.map((change) => {\n\t\t\tif (change.fieldKind === genericFieldKind.identifier) {\n\t\t\t\t// The cast is based on the `fieldKind` check above\n\t\t\t\tconst genericChange = change.change as unknown as GenericChangeset;\n\t\t\t\treturn convertGenericChange(\n\t\t\t\t\tgenericChange,\n\t\t\t\t\thandler,\n\t\t\t\t\t(children) =>\n\t\t\t\t\t\tthis.composeNodeChanges(\n\t\t\t\t\t\t\tchildren,\n\t\t\t\t\t\t\tgenId,\n\t\t\t\t\t\t\tnewCrossFieldTable(),\n\t\t\t\t\t\t\trevisionMetadata,\n\t\t\t\t\t\t),\n\t\t\t\t\tgenId,\n\t\t\t\t\trevisionMetadata,\n\t\t\t\t) as FieldChangeset;\n\t\t\t}\n\t\t\treturn change.change;\n\t\t});\n\t\treturn { fieldKind, changesets: normalizedChanges };\n\t}\n\n\tpublic compose(changes: TaggedChange<ModularChangeset>[]): ModularChangeset {\n\t\tconst { revInfos, maxId } = getRevInfoFromTaggedChanges(changes);\n\t\tif (changes.length === 1) {\n\t\t\tconst { fieldChanges, builds, constraintViolationCount } = changes[0].change;\n\t\t\treturn makeModularChangeset(\n\t\t\t\tfieldChanges,\n\t\t\t\tmaxId,\n\t\t\t\trevInfos,\n\t\t\t\tconstraintViolationCount,\n\t\t\t\tbuilds,\n\t\t\t);\n\t\t}\n\t\tconst revisionMetadata: RevisionMetadataSource = revisionMetadataSourceFromInfo(revInfos);\n\t\tconst idState: IdAllocationState = { maxId };\n\t\tconst genId: IdAllocator = idAllocatorFromState(idState);\n\t\tconst crossFieldTable = newCrossFieldTable<ComposeData>();\n\n\t\tconst changesWithoutConstraintViolations = changes.filter(\n\t\t\t(change) => (change.change.constraintViolationCount ?? 0) === 0,\n\t\t);\n\n\t\tconst composedFields = this.composeFieldMaps(\n\t\t\tchangesWithoutConstraintViolations.map((change) =>\n\t\t\t\ttagChange(change.change.fieldChanges, revisionFromTaggedChange(change)),\n\t\t\t),\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 field of fieldsToUpdate) {\n\t\t\t\tconst amendedChange = getChangeHandler(\n\t\t\t\t\tthis.fieldKinds,\n\t\t\t\t\tfield.fieldKind,\n\t\t\t\t).rebaser.amendCompose(\n\t\t\t\t\tfield.change,\n\t\t\t\t\t(children) =>\n\t\t\t\t\t\tthis.composeNodeChanges(children, genId, crossFieldTable, revisionMetadata),\n\t\t\t\t\tgenId,\n\t\t\t\t\tnewCrossFieldManager(crossFieldTable),\n\t\t\t\t\trevisionMetadata,\n\t\t\t\t);\n\t\t\t\tfield.change = brand(amendedChange);\n\t\t\t}\n\t\t}\n\n\t\tassert(\n\t\t\tcrossFieldTable.invalidatedFields.size === 0,\n\t\t\t0x59b /* Should not need more than one amend pass. */,\n\t\t);\n\t\tconst allBuilds: ChangeAtomIdMap<TreeChunk> = new Map();\n\t\tfor (const taggedChange of changes) {\n\t\t\tconst revision = revisionFromTaggedChange(taggedChange);\n\t\t\tconst change = taggedChange.change;\n\t\t\tif (change.builds) {\n\t\t\t\tfor (const [revisionKey, innerMap] of change.builds) {\n\t\t\t\t\tconst setRevisionKey = revisionKey ?? revision;\n\t\t\t\t\tconst innerDstMap = getOrAddInMap(allBuilds, setRevisionKey, new Map());\n\t\t\t\t\tfor (const [id, tree] of innerMap) {\n\t\t\t\t\t\t// Check for duplicate builds and prefer earlier ones.\n\t\t\t\t\t\t// There are two scenarios where we might get duplicate builds:\n\t\t\t\t\t\t// - In compositions of rebase sandwiches:\n\t\t\t\t\t\t// In that case, the trees are identical and it doesn't matter which one we pick.\n\t\t\t\t\t\t// - In compositions of commits that needed to include repair data refreshers (e.g., undos):\n\t\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\t// refresher may already reflect the changes made by the commit that includes the earlier\n\t\t\t\t\t\t// refresher. This composition includes the changes made by the commit that includes the\n\t\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\t// the produced changeset will build a tree one which those changes have already been applied\n\t\t\t\t\t\t// and also try to apply the changes again, effectively applying them twice.\n\t\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\t// composition all the changes already reflected on the tree, but that is not something we\n\t\t\t\t\t\t// care to support at this time.\n\t\t\t\t\t\tif (!innerDstMap.has(id)) {\n\t\t\t\t\t\t\tinnerDstMap.set(id, tree);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\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);\n\t}\n\n\tprivate composeFieldMaps(\n\t\tchanges: TaggedChange<FieldChangeMap>[],\n\t\tgenId: IdAllocator,\n\t\tcrossFieldTable: CrossFieldTable<ComposeData>,\n\t\trevisionMetadata: RevisionMetadataSource,\n\t): FieldChangeMap {\n\t\tconst fieldChanges = new Map<FieldKey, FieldChange[]>();\n\t\tfor (const change of changes) {\n\t\t\tfor (const [key, fieldChange] of change.change) {\n\t\t\t\tconst fieldChangeToCompose =\n\t\t\t\t\tfieldChange.revision !== undefined || change.revision === undefined\n\t\t\t\t\t\t? fieldChange\n\t\t\t\t\t\t: {\n\t\t\t\t\t\t\t\t...fieldChange,\n\t\t\t\t\t\t\t\trevision: change.revision,\n\t\t\t\t\t\t  };\n\n\t\t\t\tgetOrAddEmptyToMap(fieldChanges, key).push(fieldChangeToCompose);\n\t\t\t}\n\t\t}\n\n\t\tconst composedFields: FieldChangeMap = new Map();\n\t\tfor (const [field, changesForField] of fieldChanges) {\n\t\t\tconst { fieldKind, changesets } = this.normalizeFieldChanges(\n\t\t\t\tchangesForField,\n\t\t\t\tgenId,\n\t\t\t\trevisionMetadata,\n\t\t\t);\n\t\t\tassert(\n\t\t\t\tchangesets.length === changesForField.length,\n\t\t\t\t0x4a8 /* Number of changes should be constant when normalizing */,\n\t\t\t);\n\n\t\t\tconst manager = newCrossFieldManager(crossFieldTable);\n\t\t\tconst taggedChangesets = changesets.map((change, i) =>\n\t\t\t\ttagChange(change, changesForField[i].revision),\n\t\t\t);\n\t\t\tconst composedChange = fieldKind.changeHandler.rebaser.compose(\n\t\t\t\ttaggedChangesets,\n\t\t\t\t(children) =>\n\t\t\t\t\tthis.composeNodeChanges(children, genId, crossFieldTable, revisionMetadata),\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\taddFieldData(manager, composedField);\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\t\treturn composedFields;\n\t}\n\n\tprivate composeNodeChanges(\n\t\tchanges: TaggedChange<NodeChangeset>[],\n\t\tgenId: IdAllocator,\n\t\tcrossFieldTable: CrossFieldTable<ComposeData>,\n\t\trevisionMetadata: RevisionMetadataSource,\n\t): NodeChangeset {\n\t\tconst fieldChanges: TaggedChange<FieldChangeMap>[] = [];\n\t\tlet nodeExistsConstraint: NodeExistsConstraint | undefined;\n\t\tfor (const change of changes) {\n\t\t\t// Composition is part of two codepaths:\n\t\t\t//   1. Combining multiple changesets into a transaction\n\t\t\t//   2. Generating a state update after rebasing a branch that has\n\t\t\t//        more than one changeset\n\t\t\t// In the first codepath, none of the constraints will be violated and\n\t\t\t// we need the constraint to be stored on the given node in the transaction.\n\t\t\t// In the second path, the constraint may have been violated, but the state is tracked\n\t\t\t// as part of `constraintViolationCount` and the change won't be rebased further.\n\t\t\tif (change.change.nodeExistsConstraint !== undefined) {\n\t\t\t\tnodeExistsConstraint = { ...change.change.nodeExistsConstraint };\n\t\t\t}\n\n\t\t\tif (change.change.fieldChanges !== undefined) {\n\t\t\t\tfieldChanges.push(tagChange(change.change.fieldChanges, change.revision));\n\t\t\t}\n\t\t}\n\n\t\tconst composedFieldChanges = this.composeFieldMaps(\n\t\t\tfieldChanges,\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\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\tgenId,\n\t\t\t\t\tnewCrossFieldManager(crossFieldTable),\n\t\t\t\t\trevisionMetadata,\n\t\t\t\t);\n\t\t\t\tinvertedField.change = brand(amendedChange);\n\t\t\t}\n\n\t\t\t// TODO: See if we there's a reasonable way to assert that\n\t\t\t// running a third pass would produce the same results.\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);\n\t}\n\n\tprivate invertFieldMap(\n\t\tchanges: TaggedChange<FieldChangeMap>,\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);\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\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 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\n\t\t\taddFieldData(manager, fieldChange);\n\t\t}\n\n\t\treturn invertedFields;\n\t}\n\n\tprivate invertNodeChange(\n\t\tchange: TaggedChange<NodeChangeset>,\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\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\trebasedFieldToContext: 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.rebasedFieldToContext.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\tchangesets: [fieldChangeset, baseChangeset],\n\t\t\t\t} = this.normalizeFieldChanges(\n\t\t\t\t\t[context.newChange, context.baseChange],\n\t\t\t\t\tgenId,\n\t\t\t\t\trevisionMetadata,\n\t\t\t\t);\n\n\t\t\t\tfield.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(node) => node,\n\t\t\t\t\tgenId,\n\t\t\t\t\tnewCrossFieldManager(crossFieldTable),\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);\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\tchangesets: [fieldChangeset, 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\t\t\tconst manager = newCrossFieldManager(crossFieldTable);\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\taddFieldData(manager, rebasedFieldChange);\n\t\t\tcrossFieldTable.rebasedFieldToContext.set(rebasedFieldChange, {\n\t\t\t\tbaseChange: baseChanges,\n\t\t\t\tbaseRevision: revision,\n\t\t\t\tnewChange: fieldChange,\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\tchangesets: [fieldChangeset, baseChangeset],\n\t\t\t\t} = this.normalizeFieldChanges([fieldChange, baseChanges], genId, revisionMetadata);\n\n\t\t\t\tconst manager = newCrossFieldManager(crossFieldTable);\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\taddFieldData(manager, 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\tif (change === undefined && over.change?.fieldChanges === 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 deleted 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\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\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 * @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\tconst builds: DeltaDetachedNodeBuild[] = [];\n\t\tforEachInNestedMap(change.builds, (tree, major, minor) => {\n\t\t\tconst cursor = tree.cursor();\n\t\t\tassert(\n\t\t\t\tcursor.getFieldLength() === 1,\n\t\t\t\t0x853 /* each encoded chunk should only contain 1 node. */,\n\t\t\t);\n\t\t\tcursor.enterNode(0);\n\t\t\tbuilds.push({\n\t\t\t\tid: makeDetachedNodeId(major ?? revision, minor),\n\t\t\t\ttrees: [cursor],\n\t\t\t});\n\t\t});\n\t\trootDelta.build = builds;\n\t}\n\treturn rootDelta;\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, FieldKind>,\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, FieldKind>,\n\tkind: FieldKindIdentifier,\n): FieldChangeHandler<unknown> {\n\treturn getFieldKind(fieldKinds, kind).changeHandler;\n}\n\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\trebasedFieldToContext: Map<FieldChange, FieldChangeContext>;\n}\n\ninterface FieldChangeContext {\n\tbaseChange: FieldChange;\n\tnewChange: FieldChange;\n\tbaseRevision: RevisionTag | undefined;\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\ntype ComposeData = FieldChange;\n\ninterface CrossFieldManagerI<T> extends CrossFieldManager {\n\ttable: CrossFieldTable<T>;\n\tsrcQueries: CrossFieldQuerySet;\n\tdstQueries: CrossFieldQuerySet;\n\tfieldInvalidated: boolean;\n}\n\nfunction newCrossFieldManager<T>(crossFieldTable: CrossFieldTable<T>): CrossFieldManagerI<T> {\n\tconst srcQueries: CrossFieldQuerySet = new Map();\n\tconst dstQueries: CrossFieldQuerySet = new Map();\n\tconst getMap = (target: CrossFieldTarget) =>\n\t\ttarget === CrossFieldTarget.Source ? crossFieldTable.srcTable : crossFieldTable.dstTable;\n\n\tconst getQueries = (target: CrossFieldTarget) =>\n\t\ttarget === CrossFieldTarget.Source ? srcQueries : dstQueries;\n\n\tconst manager = {\n\t\ttable: crossFieldTable,\n\t\tsrcQueries,\n\t\tdstQueries,\n\t\tfieldInvalidated: false,\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) {\n\t\t\t\tconst dependentsMap =\n\t\t\t\t\ttarget === CrossFieldTarget.Source\n\t\t\t\t\t\t? crossFieldTable.srcDependents\n\t\t\t\t\t\t: crossFieldTable.dstDependents;\n\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\tdependentsMap,\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\n\t\t\t\tif (\n\t\t\t\t\tgetFirstFromCrossFieldMap(getQueries(target), revision, id, count) !== undefined\n\t\t\t\t) {\n\t\t\t\t\tmanager.fieldInvalidated = true;\n\t\t\t\t}\n\t\t\t}\n\t\t\tsetInCrossFieldMap(getMap(target), revision, id, count, newValue);\n\t\t},\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\taddCrossFieldQuery(getQueries(target), revision, id, count);\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 addFieldData<T>(manager: CrossFieldManagerI<T>, fieldData: T) {\n\tfor (const [revision, rangeMap] of manager.srcQueries) {\n\t\tfor (const range of rangeMap) {\n\t\t\t// We assume that if there is already an entry for this ID it is because\n\t\t\t// a field handler has called compose on the same node multiple times.\n\t\t\t// In this case we only want to amend the latest version, so we overwrite the dependency.\n\t\t\tsetInCrossFieldMap(\n\t\t\t\tmanager.table.srcDependents,\n\t\t\t\trevision,\n\t\t\t\tbrand(range.start),\n\t\t\t\trange.length,\n\t\t\t\tfieldData,\n\t\t\t);\n\t\t}\n\t}\n\n\tfor (const [revision, rangeMap] of manager.dstQueries) {\n\t\tfor (const range of rangeMap) {\n\t\t\t// See above comment\n\t\t\tsetInCrossFieldMap(\n\t\t\t\tmanager.table.dstDependents,\n\t\t\t\trevision,\n\t\t\t\tbrand(range.start),\n\t\t\t\trange.length,\n\t\t\t\tfieldData,\n\t\t\t);\n\t\t}\n\t}\n\n\tif (manager.fieldInvalidated) {\n\t\tmanager.table.invalidatedFields.add(fieldData);\n\t}\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): 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\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\tpublic buildTrees(\n\t\tfirstId: ChangesetLocalId,\n\t\tnewContent: ITreeCursor | readonly ITreeCursor[],\n\t): GlobalEditDescription {\n\t\tconst content = isReadonlyArray(newContent) ? newContent : [newContent];\n\t\tconst length = content.length;\n\t\tif (length === 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\tlet id = firstId;\n\n\t\t// TODO:YA6307 adopt more efficient representation, likely based on contiguous runs of IDs\n\t\tfor (const cursor of content) {\n\t\t\tassert(!innerMap.has(id), 0x854 /* Unexpected duplicate build ID */);\n\t\t\tinnerMap.set(id, chunkTree(cursor as ITreeCursorSynchronous, defaultChunkPolicy));\n\t\t\tid = brand((id as number) + 1);\n\t\t}\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 changeMap = this.buildChangeMap(field, fieldKind, change);\n\t\tthis.applyChange(makeModularChangeset(changeMap, maxId));\n\t}\n\n\tpublic submitChanges(changes: EditDescription[], maxId: ChangesetLocalId = brand(-1)) {\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\tthis.applyChange(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"]}

package/lib/feature-libraries/modular-schema/modularChangeFormat.d.ts

@@ -0,0 +1,149 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { Static } from "@sinclair/typebox";
+import { schemaFormat, ChangesetLocalId } from "../../core";
+import { JsonCompatibleReadOnly } from "../../util";
+export declare const ChangesetLocalIdSchema: import("@sinclair/typebox").TUnsafe<ChangesetLocalId>;
+export declare const EncodedChangeAtomId: import("@sinclair/typebox").TObject<{
+    /**
+     * Uniquely identifies the changeset within which the change was made.
+     */
+    revision: import("@sinclair/typebox").TOptional<import("@sinclair/typebox").TUnsafe<import("../../core").EncodedRevisionTag>>;
+    /**
+     * Uniquely identifies, in the scope of the changeset, the change made to the field.
+     */
+    localId: import("@sinclair/typebox").TUnsafe<ChangesetLocalId>;
+}>;
+declare const EncodedFieldChange: import("@sinclair/typebox").TObject<{
+    fieldKey: import("@sinclair/typebox").TUnsafe<schemaFormat.FieldKey>;
+    fieldKind: import("@sinclair/typebox").TUnsafe<schemaFormat.FieldKindIdentifier>;
+    change: import("@sinclair/typebox").TAny;
+}>;
+export interface EncodedFieldChange extends Static<typeof EncodedFieldChange> {
+    /**
+     * Encoded in format selected by `fieldKind`
+     */
+    change: JsonCompatibleReadOnly;
+}
+declare const EncodedFieldChangeMap: 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;
+}>>;
+/**
+ * Format for encoding as json.
+ *
+ * This chooses to use lists of named objects instead of maps:
+ * this choice is somewhat arbitrary, but avoids user data being used as object keys,
+ * which can sometimes be an issue (for example handling that for "__proto__" can require care).
+ */
+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").TUnsafe<import("../../core").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;
+    }>>;
+}>;
+/**
+ * Format for encoding as json.
+ */
+export type EncodedNodeChangeset = Static<typeof EncodedNodeChangeset>;
+export declare const EncodedRevisionInfo: import("@sinclair/typebox").TObject<{
+    revision: import("@sinclair/typebox").TReadonly<import("@sinclair/typebox").TUnsafe<import("../../core").EncodedRevisionTag>>;
+    rollbackOf: import("@sinclair/typebox").TReadonlyOptional<import("@sinclair/typebox").TUnsafe<import("../../core").EncodedRevisionTag>>;
+}>;
+export type EncodedRevisionInfo = Static<typeof EncodedRevisionInfo>;
+/**
+ * Index of field in an EncodedFieldBatch.
+ */
+export declare const EncodedTreeIndex: import("@sinclair/typebox").TNumber;
+export declare const EncodedBuildsArray: import("@sinclair/typebox").TArray<import("@sinclair/typebox").TUnion<[import("@sinclair/typebox").TTuple<[import("@sinclair/typebox").TUnsafe<ChangesetLocalId>, import("@sinclair/typebox").TNumber]>, import("@sinclair/typebox").TTuple<[import("@sinclair/typebox").TUnsafe<import("../../core").EncodedRevisionTag>, import("@sinclair/typebox").TUnsafe<ChangesetLocalId>, import("@sinclair/typebox").TNumber]>]>>;
+export type EncodedBuildsArray = Static<typeof EncodedBuildsArray>;
+export declare const EncodedBuilds: import("@sinclair/typebox").TObject<{
+    builds: import("@sinclair/typebox").TArray<import("@sinclair/typebox").TUnion<[import("@sinclair/typebox").TTuple<[import("@sinclair/typebox").TUnsafe<ChangesetLocalId>, import("@sinclair/typebox").TNumber]>, import("@sinclair/typebox").TTuple<[import("@sinclair/typebox").TUnsafe<import("../../core").EncodedRevisionTag>, import("@sinclair/typebox").TUnsafe<ChangesetLocalId>, import("@sinclair/typebox").TNumber]>]>>;
+    /**
+     * Fields indexed by the EncodedTreeIndexes above.
+     * TODO: Strongly typing this here may result in redundant schema validation of this data.
+     */
+    trees: import("@sinclair/typebox").TObject<{
+        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>;
+            b: import("@sinclair/typebox").TOptional<import("@sinclair/typebox").TObject<{
+                length: import("@sinclair/typebox").TNumber;
+                shape: import("@sinclair/typebox").TNumber;
+            }>>;
+            c: import("@sinclair/typebox").TOptional<import("@sinclair/typebox").TObject<{
+                type: import("@sinclair/typebox").TOptional<import("@sinclair/typebox").TUnion<[import("@sinclair/typebox").TString, import("@sinclair/typebox").TNumber]>>;
+                value: import("@sinclair/typebox").TOptional<import("@sinclair/typebox").TUnion<[import("@sinclair/typebox").TBoolean, import("@sinclair/typebox").TArray<import("@sinclair/typebox").TAny>]>>;
+                fields: import("@sinclair/typebox").TArray<import("@sinclair/typebox").TObject<{
+                    key: import("@sinclair/typebox").TUnion<[import("@sinclair/typebox").TString, import("@sinclair/typebox").TNumber]>;
+                    shape: import("@sinclair/typebox").TNumber;
+                }>>;
+                extraFields: import("@sinclair/typebox").TOptional<import("@sinclair/typebox").TNumber>;
+            }>>;
+            d: import("@sinclair/typebox").TOptional<import("@sinclair/typebox").TLiteral<0>>;
+        }>>;
+    }>;
+}>;
+export type EncodedBuilds = Static<typeof EncodedBuilds>;
+export declare const EncodedModularChangeset: import("@sinclair/typebox").TObject<{
+    maxId: import("@sinclair/typebox").TOptional<import("@sinclair/typebox").TUnsafe<ChangesetLocalId>>;
+    changes: 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;
+    }>>;
+    revisions: import("@sinclair/typebox").TReadonlyOptional<import("@sinclair/typebox").TArray<import("@sinclair/typebox").TObject<{
+        revision: import("@sinclair/typebox").TReadonly<import("@sinclair/typebox").TUnsafe<import("../../core").EncodedRevisionTag>>;
+        rollbackOf: import("@sinclair/typebox").TReadonlyOptional<import("@sinclair/typebox").TUnsafe<import("../../core").EncodedRevisionTag>>;
+    }>>>;
+    builds: import("@sinclair/typebox").TOptional<import("@sinclair/typebox").TObject<{
+        builds: import("@sinclair/typebox").TArray<import("@sinclair/typebox").TUnion<[import("@sinclair/typebox").TTuple<[import("@sinclair/typebox").TUnsafe<ChangesetLocalId>, import("@sinclair/typebox").TNumber]>, import("@sinclair/typebox").TTuple<[import("@sinclair/typebox").TUnsafe<import("../../core").EncodedRevisionTag>, import("@sinclair/typebox").TUnsafe<ChangesetLocalId>, import("@sinclair/typebox").TNumber]>]>>;
+        /**
+         * Fields indexed by the EncodedTreeIndexes above.
+         * TODO: Strongly typing this here may result in redundant schema validation of this data.
+         */
+        trees: import("@sinclair/typebox").TObject<{
+            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>;
+                b: import("@sinclair/typebox").TOptional<import("@sinclair/typebox").TObject<{
+                    length: import("@sinclair/typebox").TNumber;
+                    shape: import("@sinclair/typebox").TNumber;
+                }>>;
+                c: import("@sinclair/typebox").TOptional<import("@sinclair/typebox").TObject<{
+                    type: import("@sinclair/typebox").TOptional<import("@sinclair/typebox").TUnion<[import("@sinclair/typebox").TString, import("@sinclair/typebox").TNumber]>>;
+                    value: import("@sinclair/typebox").TOptional<import("@sinclair/typebox").TUnion<[import("@sinclair/typebox").TBoolean, import("@sinclair/typebox").TArray<import("@sinclair/typebox").TAny>]>>;
+                    fields: import("@sinclair/typebox").TArray<import("@sinclair/typebox").TObject<{
+                        key: import("@sinclair/typebox").TUnion<[import("@sinclair/typebox").TString, import("@sinclair/typebox").TNumber]>;
+                        shape: import("@sinclair/typebox").TNumber;
+                    }>>;
+                    extraFields: import("@sinclair/typebox").TOptional<import("@sinclair/typebox").TNumber>;
+                }>>;
+                d: import("@sinclair/typebox").TOptional<import("@sinclair/typebox").TLiteral<0>>;
+            }>>;
+        }>;
+    }>>;
+}>;
+export type EncodedModularChangeset = Static<typeof EncodedModularChangeset>;
+export {};
+//# sourceMappingURL=modularChangeFormat.d.ts.map

package/lib/feature-libraries/modular-schema/modularChangeFormat.d.ts.map

@@ -0,0 +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,YAAY,CAAC;AAC/E,OAAO,EAEN,sBAAsB,EAEtB,MAAM,YAAY,CAAC;AAKpB,eAAO,MAAM,sBAAsB,uDAAwC,CAAC;AAE5E,eAAO,MAAM,mBAAmB;IAE9B;;OAEG;;IAEH;;OAEG;;EAIJ,CAAC;AAoBF,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;AAOzE,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;AAG3E,eAAO,MAAM,kBAAkB,4ZAK9B,CAAC;AAEF,MAAM,MAAM,kBAAkB,GAAG,MAAM,CAAC,OAAO,kBAAkB,CAAC,CAAC;AAEnE,eAAO,MAAM,aAAa;;IAEzB;;;OAGG;;;;;;;;;;;;;;;;;;;;;;;EAEF,CAAC;AAEH,MAAM,MAAM,aAAa,GAAG,MAAM,CAAC,OAAO,aAAa,CAAC,CAAC;AAEzD,eAAO,MAAM,uBAAuB;;;;;;;;;;;;;QATnC;;;WAGG;;;;;;;;;;;;;;;;;;;;;;;;EAcH,CAAC;AAEF,MAAM,MAAM,uBAAuB,GAAG,MAAM,CAAC,OAAO,uBAAuB,CAAC,CAAC"}

package/lib/feature-libraries/modular-schema/modularChangeFormat.js

@@ -0,0 +1,74 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { Type } from "@sinclair/typebox";
+import { schemaFormat, RevisionTagSchema } from "../../core";
+import { brandedNumberType, JsonCompatibleReadOnlySchema, } from "../../util";
+import { EncodedFieldBatch } from "../chunked-forest";
+const noAdditionalProps = { additionalProperties: false };
+export const ChangesetLocalIdSchema = brandedNumberType();
+export const EncodedChangeAtomId = Type.Object({
+    /**
+     * Uniquely identifies the changeset within which the change was made.
+     */
+    revision: Type.Optional(RevisionTagSchema),
+    /**
+     * Uniquely identifies, in the scope of the changeset, the change made to the field.
+     */
+    localId: ChangesetLocalIdSchema,
+}, noAdditionalProps);
+const EncodedValueChange = Type.Object({
+    revision: Type.Optional(RevisionTagSchema),
+    value: Type.Optional(JsonCompatibleReadOnlySchema),
+}, noAdditionalProps);
+const EncodedValueConstraint = Type.Object({
+    value: Type.Optional(JsonCompatibleReadOnlySchema),
+    violated: Type.Boolean(),
+}, noAdditionalProps);
+const EncodedFieldChange = Type.Object({
+    fieldKey: schemaFormat.FieldKeySchema,
+    fieldKind: schemaFormat.FieldKindIdentifierSchema,
+    // Implementation note: node and field change encoding is mutually recursive.
+    // This field marks a boundary in that recursion to avoid constructing excessively complex
+    // recursive types. Encoded changes are validated at this boundary at runtime--see modularChangeCodecs.ts.
+    change: JsonCompatibleReadOnlySchema,
+}, noAdditionalProps);
+const EncodedFieldChangeMap = Type.Array(EncodedFieldChange);
+const EncodedNodeExistsConstraint = Type.Object({
+    violated: Type.Boolean(),
+});
+export const EncodedNodeChangeset = Type.Object({
+    valueChange: Type.Optional(EncodedValueChange),
+    fieldChanges: Type.Optional(EncodedFieldChangeMap),
+    valueConstraint: Type.Optional(EncodedValueConstraint),
+    nodeExistsConstraint: Type.Optional(EncodedNodeExistsConstraint),
+}, noAdditionalProps);
+export const EncodedRevisionInfo = Type.Object({
+    revision: Type.Readonly(RevisionTagSchema),
+    rollbackOf: Type.ReadonlyOptional(RevisionTagSchema),
+}, noAdditionalProps);
+/**
+ * Index of field in an EncodedFieldBatch.
+ */
+export const EncodedTreeIndex = Type.Number({ multipleOf: 1, minimum: 0 });
+// TODO:YA6307 adopt more efficient encoding, likely based on contiguous runs of IDs
+export const EncodedBuildsArray = Type.Array(Type.Union([
+    Type.Tuple([ChangesetLocalIdSchema, EncodedTreeIndex]),
+    Type.Tuple([RevisionTagSchema, ChangesetLocalIdSchema, EncodedTreeIndex]),
+]));
+export const EncodedBuilds = Type.Object({
+    builds: EncodedBuildsArray,
+    /**
+     * Fields indexed by the EncodedTreeIndexes above.
+     * TODO: Strongly typing this here may result in redundant schema validation of this data.
+     */
+    trees: EncodedFieldBatch,
+});
+export const EncodedModularChangeset = Type.Object({
+    maxId: Type.Optional(ChangesetLocalIdSchema),
+    changes: EncodedFieldChangeMap,
+    revisions: Type.ReadonlyOptional(Type.Array(EncodedRevisionInfo)),
+    builds: Type.Optional(EncodedBuilds),
+}, noAdditionalProps);
+//# sourceMappingURL=modularChangeFormat.js.map

package/lib/feature-libraries/modular-schema/modularChangeFormat.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"modularChangeFormat.js","sourceRoot":"","sources":["../../../src/feature-libraries/modular-schema/modularChangeFormat.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAyB,IAAI,EAAE,MAAM,mBAAmB,CAAC;AAChE,OAAO,EAAE,YAAY,EAAE,iBAAiB,EAAoB,MAAM,YAAY,CAAC;AAC/E,OAAO,EACN,iBAAiB,EAEjB,4BAA4B,GAC5B,MAAM,YAAY,CAAC;AACpB,OAAO,EAAE,iBAAiB,EAAE,MAAM,mBAAmB,CAAC;AAEtD,MAAM,iBAAiB,GAAkB,EAAE,oBAAoB,EAAE,KAAK,EAAE,CAAC;AAEzE,MAAM,CAAC,MAAM,sBAAsB,GAAG,iBAAiB,EAAoB,CAAC;AAE5E,MAAM,CAAC,MAAM,mBAAmB,GAAG,IAAI,CAAC,MAAM,CAC7C;IACC;;OAEG;IACH,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,iBAAiB,CAAC;IAC1C;;OAEG;IACH,OAAO,EAAE,sBAAsB;CAC/B,EACD,iBAAiB,CACjB,CAAC;AAEF,MAAM,kBAAkB,GAAG,IAAI,CAAC,MAAM,CACrC;IACC,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,iBAAiB,CAAC;IAC1C,KAAK,EAAE,IAAI,CAAC,QAAQ,CAAC,4BAA4B,CAAC;CAClD,EACD,iBAAiB,CACjB,CAAC;AAGF,MAAM,sBAAsB,GAAG,IAAI,CAAC,MAAM,CACzC;IACC,KAAK,EAAE,IAAI,CAAC,QAAQ,CAAC,4BAA4B,CAAC;IAClD,QAAQ,EAAE,IAAI,CAAC,OAAO,EAAE;CACxB,EACD,iBAAiB,CACjB,CAAC;AAGF,MAAM,kBAAkB,GAAG,IAAI,CAAC,MAAM,CACrC;IACC,QAAQ,EAAE,YAAY,CAAC,cAAc;IACrC,SAAS,EAAE,YAAY,CAAC,yBAAyB;IACjD,6EAA6E;IAC7E,0FAA0F;IAC1F,0GAA0G;IAC1G,MAAM,EAAE,4BAA4B;CACpC,EACD,iBAAiB,CACjB,CAAC;AASF,MAAM,qBAAqB,GAAG,IAAI,CAAC,KAAK,CAAC,kBAAkB,CAAC,CAAC;AAW7D,MAAM,2BAA2B,GAAG,IAAI,CAAC,MAAM,CAAC;IAC/C,QAAQ,EAAE,IAAI,CAAC,OAAO,EAAE;CACxB,CAAC,CAAC;AAGH,MAAM,CAAC,MAAM,oBAAoB,GAAG,IAAI,CAAC,MAAM,CAC9C;IACC,WAAW,EAAE,IAAI,CAAC,QAAQ,CAAC,kBAAkB,CAAC;IAC9C,YAAY,EAAE,IAAI,CAAC,QAAQ,CAAC,qBAAqB,CAAC;IAClD,eAAe,EAAE,IAAI,CAAC,QAAQ,CAAC,sBAAsB,CAAC;IACtD,oBAAoB,EAAE,IAAI,CAAC,QAAQ,CAAC,2BAA2B,CAAC;CAChE,EACD,iBAAiB,CACjB,CAAC;AAOF,MAAM,CAAC,MAAM,mBAAmB,GAAG,IAAI,CAAC,MAAM,CAC7C;IACC,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,iBAAiB,CAAC;IAC1C,UAAU,EAAE,IAAI,CAAC,gBAAgB,CAAC,iBAAiB,CAAC;CACpD,EACD,iBAAiB,CACjB,CAAC;AAIF;;GAEG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAAG,IAAI,CAAC,MAAM,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC,CAAC;AAE3E,oFAAoF;AACpF,MAAM,CAAC,MAAM,kBAAkB,GAAG,IAAI,CAAC,KAAK,CAC3C,IAAI,CAAC,KAAK,CAAC;IACV,IAAI,CAAC,KAAK,CAAC,CAAC,sBAAsB,EAAE,gBAAgB,CAAC,CAAC;IACtD,IAAI,CAAC,KAAK,CAAC,CAAC,iBAAiB,EAAE,sBAAsB,EAAE,gBAAgB,CAAC,CAAC;CACzE,CAAC,CACF,CAAC;AAIF,MAAM,CAAC,MAAM,aAAa,GAAG,IAAI,CAAC,MAAM,CAAC;IACxC,MAAM,EAAE,kBAAkB;IAC1B;;;OAGG;IACH,KAAK,EAAE,iBAAiB;CACxB,CAAC,CAAC;AAIH,MAAM,CAAC,MAAM,uBAAuB,GAAG,IAAI,CAAC,MAAM,CACjD;IACC,KAAK,EAAE,IAAI,CAAC,QAAQ,CAAC,sBAAsB,CAAC;IAC5C,OAAO,EAAE,qBAAqB;IAC9B,SAAS,EAAE,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,KAAK,CAAC,mBAAmB,CAAC,CAAC;IACjE,MAAM,EAAE,IAAI,CAAC,QAAQ,CAAC,aAAa,CAAC;CACpC,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\";\nimport {\n\tbrandedNumberType,\n\tJsonCompatibleReadOnly,\n\tJsonCompatibleReadOnlySchema,\n} from \"../../util\";\nimport { EncodedFieldBatch } from \"../chunked-forest\";\n\nconst noAdditionalProps: ObjectOptions = { additionalProperties: false };\n\nexport const ChangesetLocalIdSchema = brandedNumberType<ChangesetLocalId>();\n\nexport const EncodedChangeAtomId = Type.Object(\n\t{\n\t\t/**\n\t\t * Uniquely identifies the changeset within which the change was made.\n\t\t */\n\t\trevision: Type.Optional(RevisionTagSchema),\n\t\t/**\n\t\t * Uniquely identifies, in the scope of the changeset, the change made to the field.\n\t\t */\n\t\tlocalId: ChangesetLocalIdSchema,\n\t},\n\tnoAdditionalProps,\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\tviolated: Type.Boolean(),\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\n// TODO:YA6307 adopt more efficient encoding, likely based on contiguous runs of IDs\nexport const EncodedBuildsArray = Type.Array(\n\tType.Union([\n\t\tType.Tuple([ChangesetLocalIdSchema, EncodedTreeIndex]),\n\t\tType.Tuple([RevisionTagSchema, ChangesetLocalIdSchema, EncodedTreeIndex]),\n\t]),\n);\n\nexport type EncodedBuildsArray = Static<typeof EncodedBuildsArray>;\n\nexport const EncodedBuilds = Type.Object({\n\tbuilds: EncodedBuildsArray,\n\t/**\n\t * Fields indexed by the EncodedTreeIndexes above.\n\t * TODO: Strongly typing this here may result in redundant schema validation of this data.\n\t */\n\ttrees: EncodedFieldBatch,\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},\n\tnoAdditionalProps,\n);\n\nexport type EncodedModularChangeset = Static<typeof EncodedModularChangeset>;\n"]}

package/lib/feature-libraries/modular-schema/modularChangeTypes.d.ts

@@ -0,0 +1,69 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { ChangeAtomIdMap, ChangesetLocalId, FieldKey, FieldKindIdentifier, RevisionInfo, RevisionTag } from "../../core";
+import { Brand } from "../../util";
+import { TreeChunk } from "../chunked-forest";
+/**
+ * @internal
+ */
+export interface ModularChangeset extends HasFieldChanges {
+    /**
+     * The numerically highest `ChangesetLocalId` used in this changeset.
+     * If undefined then this changeset contains no IDs.
+     */
+    maxId?: ChangesetLocalId;
+    /**
+     * The revisions included in this changeset, ordered temporally (oldest to newest).
+     * Undefined for anonymous changesets.
+     * Should never be empty.
+     */
+    readonly revisions?: readonly RevisionInfo[];
+    fieldChanges: FieldChangeMap;
+    constraintViolationCount?: number;
+    readonly builds?: ChangeAtomIdMap<TreeChunk>;
+}
+/**
+ * @internal
+ */
+export interface NodeExistsConstraint {
+    violated: boolean;
+}
+/**
+ * Changeset for a subtree rooted at a specific node.
+ * @internal
+ */
+export interface NodeChangeset extends HasFieldChanges {
+    nodeExistsConstraint?: NodeExistsConstraint;
+}
+/**
+ * @internal
+ */
+export interface HasFieldChanges {
+    fieldChanges?: FieldChangeMap;
+}
+/**
+ * @internal
+ */
+export type FieldChangeMap = Map<FieldKey, FieldChange>;
+/**
+ * @internal
+ */
+export interface FieldChange {
+    fieldKind: FieldKindIdentifier;
+    /**
+     * If defined, `change` is part of the specified revision.
+     * Undefined in the following cases:
+     * A) A revision is specified on an ancestor of this `FieldChange`, in which case `change` is part of that revision.
+     * B) `change` is composed of multiple revisions.
+     * C) `change` is part of an anonymous revision.
+     */
+    revision?: RevisionTag;
+    change: FieldChangeset;
+}
+/**
+ * @internal
+ */
+export type FieldChangeset = Brand<unknown, "FieldChangeset">;
+//# sourceMappingURL=modularChangeTypes.d.ts.map

package/lib/feature-libraries/modular-schema/modularChangeTypes.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"modularChangeTypes.d.ts","sourceRoot":"","sources":["../../../src/feature-libraries/modular-schema/modularChangeTypes.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EACN,eAAe,EACf,gBAAgB,EAChB,QAAQ,EACR,mBAAmB,EACnB,YAAY,EACZ,WAAW,EACX,MAAM,YAAY,CAAC;AACpB,OAAO,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AACnC,OAAO,EAAE,SAAS,EAAE,MAAM,mBAAmB,CAAC;AAE9C;;GAEG;AACH,MAAM,WAAW,gBAAiB,SAAQ,eAAe;IACxD;;;OAGG;IACH,KAAK,CAAC,EAAE,gBAAgB,CAAC;IACzB;;;;OAIG;IACH,QAAQ,CAAC,SAAS,CAAC,EAAE,SAAS,YAAY,EAAE,CAAC;IAC7C,YAAY,EAAE,cAAc,CAAC;IAC7B,wBAAwB,CAAC,EAAE,MAAM,CAAC;IAElC,QAAQ,CAAC,MAAM,CAAC,EAAE,eAAe,CAAC,SAAS,CAAC,CAAC;CAC7C;AAED;;GAEG;AACH,MAAM,WAAW,oBAAoB;IACpC,QAAQ,EAAE,OAAO,CAAC;CAClB;AAED;;;GAGG;AACH,MAAM,WAAW,aAAc,SAAQ,eAAe;IACrD,oBAAoB,CAAC,EAAE,oBAAoB,CAAC;CAC5C;AAED;;GAEG;AACH,MAAM,WAAW,eAAe;IAC/B,YAAY,CAAC,EAAE,cAAc,CAAC;CAC9B;AAED;;GAEG;AACH,MAAM,MAAM,cAAc,GAAG,GAAG,CAAC,QAAQ,EAAE,WAAW,CAAC,CAAC;AAExD;;GAEG;AACH,MAAM,WAAW,WAAW;IAC3B,SAAS,EAAE,mBAAmB,CAAC;IAE/B;;;;;;OAMG;IACH,QAAQ,CAAC,EAAE,WAAW,CAAC;IACvB,MAAM,EAAE,cAAc,CAAC;CACvB;AAED;;GAEG;AACH,MAAM,MAAM,cAAc,GAAG,KAAK,CAAC,OAAO,EAAE,gBAAgB,CAAC,CAAC"}

package/lib/feature-libraries/modular-schema/modularChangeTypes.js

@@ -0,0 +1,6 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+export {};
+//# sourceMappingURL=modularChangeTypes.js.map

package/lib/feature-libraries/modular-schema/modularChangeTypes.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"modularChangeTypes.js","sourceRoot":"","sources":["../../../src/feature-libraries/modular-schema/modularChangeTypes.ts"],"names":[],"mappings":"AAAA;;;GAGG","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport {\n\tChangeAtomIdMap,\n\tChangesetLocalId,\n\tFieldKey,\n\tFieldKindIdentifier,\n\tRevisionInfo,\n\tRevisionTag,\n} from \"../../core\";\nimport { Brand } from \"../../util\";\nimport { TreeChunk } from \"../chunked-forest\";\n\n/**\n * @internal\n */\nexport interface ModularChangeset extends HasFieldChanges {\n\t/**\n\t * The numerically highest `ChangesetLocalId` used in this changeset.\n\t * If undefined then this changeset contains no IDs.\n\t */\n\tmaxId?: ChangesetLocalId;\n\t/**\n\t * The revisions included in this changeset, ordered temporally (oldest to newest).\n\t * Undefined for anonymous changesets.\n\t * Should never be empty.\n\t */\n\treadonly revisions?: readonly RevisionInfo[];\n\tfieldChanges: FieldChangeMap;\n\tconstraintViolationCount?: number;\n\t// TODO:YA6307 adopt more efficient representation, likely based on contiguous runs of IDs\n\treadonly builds?: ChangeAtomIdMap<TreeChunk>;\n}\n\n/**\n * @internal\n */\nexport interface NodeExistsConstraint {\n\tviolated: boolean;\n}\n\n/**\n * Changeset for a subtree rooted at a specific node.\n * @internal\n */\nexport interface NodeChangeset extends HasFieldChanges {\n\tnodeExistsConstraint?: NodeExistsConstraint;\n}\n\n/**\n * @internal\n */\nexport interface HasFieldChanges {\n\tfieldChanges?: FieldChangeMap;\n}\n\n/**\n * @internal\n */\nexport type FieldChangeMap = Map<FieldKey, FieldChange>;\n\n/**\n * @internal\n */\nexport interface FieldChange {\n\tfieldKind: FieldKindIdentifier;\n\n\t/**\n\t * If defined, `change` is part of the specified revision.\n\t * Undefined in the following cases:\n\t * A) A revision is specified on an ancestor of this `FieldChange`, in which case `change` is part of that revision.\n\t * B) `change` is composed of multiple revisions.\n\t * C) `change` is part of an anonymous revision.\n\t */\n\trevision?: RevisionTag;\n\tchange: FieldChangeset;\n}\n\n/**\n * @internal\n */\nexport type FieldChangeset = Brand<unknown, \"FieldChangeset\">;\n"]}

package/lib/feature-libraries/multiplicity.d.ts

@@ -0,0 +1,55 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+/**
+ * Describes how a particular field functions.
+ *
+ * This determine its reading and editing APIs, multiplicity, and what merge resolution policies it will use.
+ * @internal
+ */
+export declare enum Multiplicity {
+    /**
+     * Exactly one item.
+     */
+    Single = 0,
+    /**
+     * 0 or 1 items.
+     */
+    Optional = 1,
+    /**
+     * 0 or more items.
+     */
+    Sequence = 2,
+    /**
+     * Exactly 0 items.
+     *
+     * Using Forbidden makes what types are listed for allowed in a field irrelevant
+     * since the field will never have values in it.
+     *
+     * Using Forbidden is equivalent to picking a kind that permits empty (like sequence or optional)
+     * and having no allowed types (or only never types).
+     * Because of this, its possible to express everything constraint wise without Forbidden,
+     * but using Forbidden can be more semantically clear than optional with no allowed types.
+     *
+     * For view schema, this can be useful if you need to:
+     * - run a specific out of schema handler when a field is present,
+     * but otherwise are ignoring or tolerating (ex: via extra fields) unmentioned fields.
+     * - prevent a specific field from being used as an extra field
+     * (perhaps for some past of future compatibility reason)
+     * - keep a field in a schema for metadata purposes
+     * (ex: for improved error messaging, error handling or documentation)
+     * that is not used in this specific version of the schema (ex: to document what it was or will be used for).
+     *
+     * For stored schema, this can be useful if you need to:
+     * - have a field which can have its schema updated to Optional or Sequence of any type.
+     * - to exclude a field from extra fields
+     * - for the schema system to use as a default for fields which aren't declared
+     * (ex: when updating a field that did not exist into one that does)
+     *
+     * @privateRemarks
+     * See storedEmptyFieldSchema for a constant, reusable field using Forbidden.
+     */
+    Forbidden = 3
+}
+//# sourceMappingURL=multiplicity.d.ts.map

package/lib/feature-libraries/multiplicity.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"multiplicity.d.ts","sourceRoot":"","sources":["../../src/feature-libraries/multiplicity.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH;;;;;GAKG;AACH,oBAAY,YAAY;IACvB;;OAEG;IACH,MAAM,IAAA;IACN;;OAEG;IACH,QAAQ,IAAA;IACR;;OAEG;IACH,QAAQ,IAAA;IACR;;;;;;;;;;;;;;;;;;;;;;;;;;;;OA4BG;IACH,SAAS,IAAA;CACT"}