docxmlater 11.0.9 → 12.0.1

package/dist/processors/InMemoryRevisionAcceptor.js.map

@@ -1 +1 @@
-{"version":3,"file":"InMemoryRevisionAcceptor.js","sourceRoot":"","sources":["../../src/processors/InMemoryRevisionAcceptor.ts"],"names":[],"mappings":";;AAmGA,sDAkEC;AAaD,0DA2UC;AA8LD,sDAWC;AAKD,8DAGC;AAKD,oDAaC;AA/sBD,2DAAqD;AAErD,yDAAiE;AACjE,uEAIwC;AACxC,mDAAoD;AACpD,mDAA6C;AAC7C,kDAAkF;AAKlF,SAAS,SAAS;IAChB,OAAO,IAAA,8BAAkB,EAAC,IAAA,2BAAe,GAAE,EAAE,0BAA0B,CAAC,CAAC;AAC3E,CAAC;AAuCD,MAAM,uBAAuB,GAAmB;IAC9C,qBAAqB;IACrB,2BAA2B;IAC3B,uBAAuB;IACvB,gCAAgC;IAChC,0BAA0B;IAC1B,2BAA2B;IAC3B,yBAAyB;IACzB,iBAAiB;CAClB,CAAC;AAiBF,SAAgB,qBAAqB,CAAC,GAAW;IAC/C,IAAI,MAAM,GAAG,GAAG,CAAC;IAGjB,MAAM,aAAa,GAAG;QACpB,kEAAkE;QAClE,8DAA8D;QAC9D,8DAA8D;QAC9D,0DAA0D;QAC1D,0EAA0E;QAC1E,sEAAsE;QACtE,0EAA0E;QAC1E,sEAAsE;KACvE,CAAC;IACF,KAAK,MAAM,OAAO,IAAI,aAAa,EAAE,CAAC;QACpC,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;IACvC,CAAC;IAGD,MAAM,kBAAkB,GAAG;QACzB,4CAA4C;QAC5C,4CAA4C;QAC5C,gDAAgD;QAChD,oDAAoD;QACpD,8CAA8C;QAC9C,8CAA8C;QAC9C,kDAAkD;QAClD,oDAAoD;QACpD,wDAAwD;KACzD,CAAC;IACF,KAAK,MAAM,OAAO,IAAI,kBAAkB,EAAE,CAAC;QACzC,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;IACvC,CAAC;IAID,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,OAAO,MAAM,CAAC,MAAM,KAAK,OAAO,EAAE,CAAC;QACjC,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC;QACxB,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,kCAAkC,EAAE,EAAE,CAAC,CAAC;IAClE,CAAC;IACD,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,mBAAmB,EAAE,EAAE,CAAC,CAAC;IAGjD,OAAO,GAAG,CAAC,CAAC;IACZ,OAAO,MAAM,CAAC,MAAM,KAAK,OAAO,EAAE,CAAC;QACjC,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC;QACxB,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,4CAA4C,EAAE,EAAE,CAAC,CAAC;IAC5E,CAAC;IACD,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,wBAAwB,EAAE,EAAE,CAAC,CAAC;IAGtD,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,eAAe,EAAE,EAAE,CAAC,CAAC;IAC7C,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,oBAAoB,EAAE,EAAE,CAAC,CAAC;IAGlD,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,YAAY,EAAE,EAAE,CAAC,CAAC;IAC1C,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,iBAAiB,EAAE,EAAE,CAAC,CAAC;IAG/C,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,mBAAmB,EAAE,EAAE,CAAC,CAAC;IACjD,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,mBAAmB,EAAE,EAAE,CAAC,CAAC;IACjD,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,wBAAwB,EAAE,EAAE,CAAC,CAAC;IACtD,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,sBAAsB,EAAE,EAAE,CAAC,CAAC;IAEpD,OAAO,MAAM,CAAC;AAChB,CAAC;AAaD,SAAgB,uBAAuB,CACrC,GAAa,EACb,UAAkC,EAAE;IAEpC,MAAM,MAAM,GAAG,SAAS,EAAE,CAAC;IAC3B,MAAM,IAAI,GAAqC;QAC7C,gBAAgB,EAAE,OAAO,CAAC,gBAAgB,IAAI,IAAI;QAClD,eAAe,EAAE,OAAO,CAAC,eAAe,IAAI,IAAI;QAChD,WAAW,EAAE,OAAO,CAAC,WAAW,IAAI,IAAI;QACxC,qBAAqB,EAAE,OAAO,CAAC,qBAAqB,IAAI,IAAI;QAC5D,kBAAkB,EAAE,OAAO,CAAC,kBAAkB,IAAI,IAAI;KACvD,CAAC;IAEF,MAAM,MAAM,GAA0B;QACpC,kBAAkB,EAAE,CAAC;QACrB,iBAAiB,EAAE,CAAC;QACpB,aAAa,EAAE,CAAC;QAChB,uBAAuB,EAAE,CAAC;QAC1B,aAAa,EAAE,CAAC;QAChB,kBAAkB,EAAE,CAAC;KACtB,CAAC;IAEF,MAAM,CAAC,IAAI,CAAC,+BAA+B,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC;IAIhE,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;QACrB,MAAM,eAAe,GAAG,GAAG,CAAC,kBAAkB,EAAE,CAAC;QACjD,IAAI,eAAe,EAAE,CAAC;YACpB,MAAM,kBAAkB,GAAG,eAAe,CAAC,iBAAiB,EAAE,CAAC;YAC/D,IAAI,CAAC,kBAAkB,CAAC,KAAK,EAAE,CAAC;gBAC9B,IAAI,kBAAkB,CAAC,gBAAgB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBACnD,MAAM,CAAC,IAAI,CACT,yFAAyF;wBACvF,gEAAgE,EAClE,EAAE,eAAe,EAAE,kBAAkB,CAAC,gBAAgB,EAAE,CACzD,CAAC;gBACJ,CAAC;gBACD,IAAI,kBAAkB,CAAC,cAAc,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBACjD,MAAM,CAAC,IAAI,CACT,iEAAiE;wBAC/D,uDAAuD,EACzD,EAAE,eAAe,EAAE,kBAAkB,CAAC,cAAc,EAAE,CACvD,CAAC;gBACJ,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAGD,MAAM,UAAU,GAAG,GAAG,CAAC,gBAAgB,EAAE,CAAC;IAC1C,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;QACnC,MAAM,eAAe,GAAG,0BAA0B,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;QACpE,MAAM,CAAC,kBAAkB,IAAI,eAAe,CAAC,kBAAkB,CAAC;QAChE,MAAM,CAAC,iBAAiB,IAAI,eAAe,CAAC,iBAAiB,CAAC;QAC9D,MAAM,CAAC,aAAa,IAAI,eAAe,CAAC,aAAa,CAAC;QACtD,MAAM,CAAC,uBAAuB,IAAI,eAAe,CAAC,uBAAuB,CAAC;IAC5E,CAAC;IAGD,MAAM,MAAM,GAAG,GAAG,CAAC,SAAS,EAAE,CAAC;IAC/B,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAE3B,IAAI,IAAI,CAAC,qBAAqB,IAAI,KAAK,CAAC,cAAc,EAAE,EAAE,CAAC;YACzD,KAAK,CAAC,gBAAgB,EAAE,CAAC;YACzB,MAAM,CAAC,uBAAuB,EAAE,CAAC;QACnC,CAAC;QASD,MAAM,YAAY,GAAa,EAAE,CAAC;QAClC,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,EAAE,CAAC;QAChC,KAAK,IAAI,MAAM,GAAG,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE,CAAC;YACvD,MAAM,GAAG,GAAG,OAAO,CAAC,MAAM,CAAE,CAAC;YAC7B,MAAM,GAAG,GAAG,GAAG,CAAC,aAAa,EAAE,CAAC;YAChC,IAAI,GAAG,CAAC,YAAY,IAAI,IAAI,CAAC,gBAAgB,EAAE,CAAC;gBAC9C,GAAG,CAAC,eAAe,CAAC,SAAS,CAAC,CAAC;gBAC/B,MAAM,CAAC,kBAAkB,EAAE,CAAC;YAC9B,CAAC;YACD,IAAI,GAAG,CAAC,WAAW,IAAI,IAAI,CAAC,eAAe,EAAE,CAAC;gBAC5C,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBAC1B,MAAM,CAAC,iBAAiB,EAAE,CAAC;YAC7B,CAAC;QACH,CAAC;QACD,KAAK,IAAI,CAAC,GAAG,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAClD,KAAK,CAAC,iBAAiB,CAAC,YAAY,CAAC,CAAC,CAAE,CAAC,CAAC;QAC5C,CAAC;QAED,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;YAElC,IAAI,IAAI,CAAC,qBAAqB,IAAI,GAAG,CAAC,aAAa,EAAE,EAAE,CAAC;gBACtD,GAAG,CAAC,eAAe,EAAE,CAAC;gBACtB,MAAM,CAAC,uBAAuB,EAAE,CAAC;YACnC,CAAC;YAED,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,QAAQ,EAAE,EAAE,CAAC;gBAElC,IAAI,IAAI,CAAC,qBAAqB,IAAI,IAAI,CAAC,aAAa,EAAE,EAAE,CAAC;oBACvD,IAAI,CAAC,eAAe,EAAE,CAAC;oBACvB,MAAM,CAAC,uBAAuB,EAAE,CAAC;gBACnC,CAAC;gBAWD,MAAM,OAAO,GAAG,IAAI,CAAC,eAAe,EAAE,CAAC;gBACvC,IAAI,OAAO,EAAE,CAAC;oBACZ,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO,EAAE,CAAC;oBAClC,IAAI,OAAO,KAAK,iBAAiB,IAAI,IAAI,CAAC,gBAAgB,EAAE,CAAC;wBAC3D,IAAI,CAAC,iBAAiB,EAAE,CAAC;wBACzB,MAAM,CAAC,kBAAkB,EAAE,CAAC;oBAC9B,CAAC;yBAAM,IAAI,OAAO,KAAK,iBAAiB,IAAI,IAAI,CAAC,eAAe,EAAE,CAAC;wBACjE,IAAI,CAAC,iBAAiB,EAAE,CAAC;wBACzB,MAAM,CAAC,iBAAiB,EAAE,CAAC;oBAC7B,CAAC;yBAAM,IAAI,OAAO,KAAK,gBAAgB,IAAI,IAAI,CAAC,qBAAqB,EAAE,CAAC;wBACtE,IAAI,CAAC,iBAAiB,EAAE,CAAC;wBACzB,MAAM,CAAC,uBAAuB,EAAE,CAAC;oBACnC,CAAC;gBACH,CAAC;gBAGD,KAAK,MAAM,SAAS,IAAI,IAAI,CAAC,aAAa,EAAE,EAAE,CAAC;oBAC7C,MAAM,eAAe,GAAG,0BAA0B,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;oBACpE,MAAM,CAAC,kBAAkB,IAAI,eAAe,CAAC,kBAAkB,CAAC;oBAChE,MAAM,CAAC,iBAAiB,IAAI,eAAe,CAAC,iBAAiB,CAAC;oBAC9D,MAAM,CAAC,aAAa,IAAI,eAAe,CAAC,aAAa,CAAC;oBACtD,MAAM,CAAC,uBAAuB,IAAI,eAAe,CAAC,uBAAuB,CAAC;gBAC5E,CAAC;gBAID,IAAI,IAAI,CAAC,mBAAmB,EAAE,EAAE,CAAC;oBAC/B,MAAM,UAAU,GAAG,IAAI,CAAC,mBAAmB,EAAE,CAAC;oBAC9C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;wBAC3C,MAAM,IAAI,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;wBAC3B,IAAI,IAAI,EAAE,CAAC;4BACT,MAAM,UAAU,GAAG,qBAAqB,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;4BACnD,IAAI,UAAU,KAAK,IAAI,CAAC,GAAG,EAAE,CAAC;gCAC5B,IAAI,CAAC,sBAAsB,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;gCAG3C,MAAM,CAAC,uBAAuB,EAAE,CAAC;gCACjC,MAAM,CAAC,KAAK,CAAC,wCAAwC,EAAE;oCACrD,IAAI,EAAE,IAAI,CAAC,IAAI;oCACf,QAAQ,EAAE,IAAI,CAAC,QAAQ;oCACvB,cAAc,EAAE,IAAI,CAAC,GAAG,CAAC,MAAM;oCAC/B,aAAa,EAAE,UAAU,CAAC,MAAM;iCACjC,CAAC,CAAC;4BACL,CAAC;wBACH,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAGD,MAAM,mBAAmB,GAAG,GAAG,CAAC,sBAAsB,EAAE,CAAC;IACzD,IAAI,mBAAmB,EAAE,CAAC;QACxB,MAAM,OAAO,GAAG,mBAAmB,CAAC,aAAa,EAAE,CAAC;QACpD,KAAK,MAAM,WAAW,IAAI,OAAO,EAAE,CAAC;YAClC,MAAM,QAAQ,GAAG,WAAW,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC;YAClD,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;gBAE/B,IAAI,OAAO,YAAY,wBAAS,EAAE,CAAC;oBACjC,MAAM,eAAe,GAAG,0BAA0B,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;oBAClE,MAAM,CAAC,kBAAkB,IAAI,eAAe,CAAC,kBAAkB,CAAC;oBAChE,MAAM,CAAC,iBAAiB,IAAI,eAAe,CAAC,iBAAiB,CAAC;oBAC9D,MAAM,CAAC,aAAa,IAAI,eAAe,CAAC,aAAa,CAAC;oBACtD,MAAM,CAAC,uBAAuB,IAAI,eAAe,CAAC,uBAAuB,CAAC;gBAC5E,CAAC;qBAAM,IAAI,OAAO,YAAY,gBAAK,EAAE,CAAC;oBAEpC,KAAK,MAAM,GAAG,IAAI,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC;wBACpC,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,QAAQ,EAAE,EAAE,CAAC;4BAClC,KAAK,MAAM,SAAS,IAAI,IAAI,CAAC,aAAa,EAAE,EAAE,CAAC;gCAC7C,MAAM,eAAe,GAAG,0BAA0B,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;gCACpE,MAAM,CAAC,kBAAkB,IAAI,eAAe,CAAC,kBAAkB,CAAC;gCAChE,MAAM,CAAC,iBAAiB,IAAI,eAAe,CAAC,iBAAiB,CAAC;gCAC9D,MAAM,CAAC,aAAa,IAAI,eAAe,CAAC,aAAa,CAAC;gCACtD,MAAM,CAAC,uBAAuB,IAAI,eAAe,CAAC,uBAAuB,CAAC;4BAC5E,CAAC;4BAED,IAAI,IAAI,CAAC,mBAAmB,EAAE,EAAE,CAAC;gCAC/B,MAAM,UAAU,GAAG,IAAI,CAAC,mBAAmB,EAAE,CAAC;gCAC9C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oCAC3C,MAAM,IAAI,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;oCAC3B,IAAI,IAAI,EAAE,CAAC;wCACT,MAAM,UAAU,GAAG,qBAAqB,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;wCACnD,IAAI,UAAU,KAAK,IAAI,CAAC,GAAG,EAAE,CAAC;4CAC5B,IAAI,CAAC,sBAAsB,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;4CAC3C,MAAM,CAAC,uBAAuB,EAAE,CAAC;wCACnC,CAAC;oCACH,CAAC;gCACH,CAAC;4BACH,CAAC;wBACH,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAGD,MAAM,OAAO,GAAG,mBAAmB,CAAC,aAAa,EAAE,CAAC;QACpD,KAAK,MAAM,WAAW,IAAI,OAAO,EAAE,CAAC;YAClC,MAAM,QAAQ,GAAG,WAAW,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC;YAClD,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;gBAE/B,IAAI,OAAO,YAAY,wBAAS,EAAE,CAAC;oBACjC,MAAM,eAAe,GAAG,0BAA0B,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;oBAClE,MAAM,CAAC,kBAAkB,IAAI,eAAe,CAAC,kBAAkB,CAAC;oBAChE,MAAM,CAAC,iBAAiB,IAAI,eAAe,CAAC,iBAAiB,CAAC;oBAC9D,MAAM,CAAC,aAAa,IAAI,eAAe,CAAC,aAAa,CAAC;oBACtD,MAAM,CAAC,uBAAuB,IAAI,eAAe,CAAC,uBAAuB,CAAC;gBAC5E,CAAC;qBAAM,IAAI,OAAO,YAAY,gBAAK,EAAE,CAAC;oBAEpC,KAAK,MAAM,GAAG,IAAI,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC;wBACpC,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,QAAQ,EAAE,EAAE,CAAC;4BAClC,KAAK,MAAM,SAAS,IAAI,IAAI,CAAC,aAAa,EAAE,EAAE,CAAC;gCAC7C,MAAM,eAAe,GAAG,0BAA0B,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;gCACpE,MAAM,CAAC,kBAAkB,IAAI,eAAe,CAAC,kBAAkB,CAAC;gCAChE,MAAM,CAAC,iBAAiB,IAAI,eAAe,CAAC,iBAAiB,CAAC;gCAC9D,MAAM,CAAC,aAAa,IAAI,eAAe,CAAC,aAAa,CAAC;gCACtD,MAAM,CAAC,uBAAuB,IAAI,eAAe,CAAC,uBAAuB,CAAC;4BAC5E,CAAC;4BAED,IAAI,IAAI,CAAC,mBAAmB,EAAE,EAAE,CAAC;gCAC/B,MAAM,UAAU,GAAG,IAAI,CAAC,mBAAmB,EAAE,CAAC;gCAC9C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oCAC3C,MAAM,IAAI,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;oCAC3B,IAAI,IAAI,EAAE,CAAC;wCACT,MAAM,UAAU,GAAG,qBAAqB,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;wCACnD,IAAI,UAAU,KAAK,IAAI,CAAC,GAAG,EAAE,CAAC;4CAC5B,IAAI,CAAC,sBAAsB,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;4CAC3C,MAAM,CAAC,uBAAuB,EAAE,CAAC;wCACnC,CAAC;oCACH,CAAC;gCACH,CAAC;4BACH,CAAC;wBACH,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAWD,MAAM,eAAe,GAAG,GAAG,CAAC,kBAAkB,EAAE,EAAE,CAAC;IACnD,IAAI,eAAe,EAAE,CAAC;QACpB,KAAK,MAAM,EAAE,IAAI,eAAe,CAAC,eAAe,EAAE,EAAE,CAAC;YACnD,KAAK,MAAM,SAAS,IAAI,EAAE,CAAC,aAAa,EAAE,EAAE,CAAC;gBAC3C,MAAM,eAAe,GAAG,0BAA0B,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;gBACpE,MAAM,CAAC,kBAAkB,IAAI,eAAe,CAAC,kBAAkB,CAAC;gBAChE,MAAM,CAAC,iBAAiB,IAAI,eAAe,CAAC,iBAAiB,CAAC;gBAC9D,MAAM,CAAC,aAAa,IAAI,eAAe,CAAC,aAAa,CAAC;gBACtD,MAAM,CAAC,uBAAuB,IAAI,eAAe,CAAC,uBAAuB,CAAC;YAC5E,CAAC;QACH,CAAC;IACH,CAAC;IACD,MAAM,cAAc,GAAG,GAAG,CAAC,iBAAiB,EAAE,EAAE,CAAC;IACjD,IAAI,cAAc,EAAE,CAAC;QACnB,KAAK,MAAM,EAAE,IAAI,cAAc,CAAC,cAAc,EAAE,EAAE,CAAC;YACjD,KAAK,MAAM,SAAS,IAAI,EAAE,CAAC,aAAa,EAAE,EAAE,CAAC;gBAC3C,MAAM,eAAe,GAAG,0BAA0B,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;gBACpE,MAAM,CAAC,kBAAkB,IAAI,eAAe,CAAC,kBAAkB,CAAC;gBAChE,MAAM,CAAC,iBAAiB,IAAI,eAAe,CAAC,iBAAiB,CAAC;gBAC9D,MAAM,CAAC,aAAa,IAAI,eAAe,CAAC,aAAa,CAAC;gBACtD,MAAM,CAAC,uBAAuB,IAAI,eAAe,CAAC,uBAAuB,CAAC;YAC5E,CAAC;QACH,CAAC;IACH,CAAC;IAGD,IAAI,IAAI,CAAC,qBAAqB,EAAE,CAAC;QAC/B,MAAM,OAAO,GAAG,GAAG,CAAC,UAAU,EAAE,CAAC;QACjC,IAAI,OAAO,EAAE,eAAe,EAAE,EAAE,CAAC;YAC/B,OAAO,CAAC,iBAAiB,EAAE,CAAC;YAC5B,MAAM,CAAC,uBAAuB,EAAE,CAAC;QACnC,CAAC;IACH,CAAC;IAGD,MAAM,eAAe,GAAG,GAAG,CAAC,kBAAkB,EAAE,CAAC;IACjD,IAAI,eAAe,EAAE,CAAC;QACpB,eAAe,CAAC,KAAK,EAAE,CAAC;IAC1B,CAAC;IAGD,GAAG,CAAC,mBAAmB,EAAE,CAAC;IAK1B,IAAI,IAAI,CAAC,kBAAkB,EAAE,CAAC;QAC5B,MAAM,CAAC,kBAAkB,GAAG,kBAAkB,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;IAC9D,CAAC;IAED,MAAM,CAAC,aAAa;QAClB,MAAM,CAAC,kBAAkB;YACzB,MAAM,CAAC,iBAAiB;YACxB,MAAM,CAAC,aAAa;YACpB,MAAM,CAAC,uBAAuB,CAAC;IAEjC,MAAM,CAAC,IAAI,CAAC,8BAA8B,EAAE;QAC1C,UAAU,EAAE,MAAM,CAAC,kBAAkB;QACrC,SAAS,EAAE,MAAM,CAAC,iBAAiB;QACnC,KAAK,EAAE,MAAM,CAAC,aAAa;QAC3B,eAAe,EAAE,MAAM,CAAC,uBAAuB;QAC/C,KAAK,EAAE,MAAM,CAAC,aAAa;QAC3B,kBAAkB,EAAE,MAAM,CAAC,kBAAkB;KAC9C,CAAC,CAAC;IAEH,OAAO,MAAM,CAAC;AAChB,CAAC;AAgBD,SAAS,0BAA0B,CACjC,SAAoB,EACpB,OAAyC;IAEzC,MAAM,MAAM,GAA0B;QACpC,kBAAkB,EAAE,CAAC;QACrB,iBAAiB,EAAE,CAAC;QACpB,aAAa,EAAE,CAAC;QAChB,uBAAuB,EAAE,CAAC;QAC1B,aAAa,EAAE,CAAC;QAChB,kBAAkB,EAAE,CAAC;KACtB,CAAC;IAEF,MAAM,OAAO,GAAG,SAAS,CAAC,UAAU,EAAE,CAAC;IACvC,MAAM,UAAU,GAAuB,EAAE,CAAC;IAE1C,KAAK,MAAM,IAAI,IAAI,OAAO,EAAE,CAAC;QAC3B,IAAI,IAAI,YAAY,sBAAQ,EAAE,CAAC;YAC7B,MAAM,YAAY,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC;YAGpC,IAAI,YAAY,KAAK,QAAQ,IAAI,OAAO,CAAC,gBAAgB,EAAE,CAAC;gBAE1D,MAAM,YAAY,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC;gBACvC,KAAK,MAAM,KAAK,IAAI,YAAY,EAAE,CAAC;oBAEjC,IAAI,IAAA,sCAAiB,EAAC,KAAK,CAAC,EAAE,CAAC;wBAC7B,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;oBACzB,CAAC;yBAAM,IAAI,IAAA,iCAAY,EAAC,KAAK,CAAC,EAAE,CAAC;wBAC/B,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;oBACzB,CAAC;yBAAM,IAAI,IAAA,uCAAkB,EAAC,KAAK,CAAC,EAAE,CAAC;wBACrC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;oBACzB,CAAC;gBACH,CAAC;gBACD,MAAM,CAAC,kBAAkB,EAAE,CAAC;gBAC5B,SAAS;YACX,CAAC;YAGD,IAAI,YAAY,KAAK,QAAQ,IAAI,OAAO,CAAC,eAAe,EAAE,CAAC;gBAEzD,MAAM,CAAC,iBAAiB,EAAE,CAAC;gBAC3B,SAAS;YACX,CAAC;YAGD,IAAI,YAAY,KAAK,UAAU,IAAI,OAAO,CAAC,WAAW,EAAE,CAAC;gBAEvD,MAAM,CAAC,aAAa,EAAE,CAAC;gBACvB,SAAS;YACX,CAAC;YAGD,IAAI,YAAY,KAAK,QAAQ,IAAI,OAAO,CAAC,WAAW,EAAE,CAAC;gBAErD,MAAM,YAAY,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC;gBACvC,KAAK,MAAM,KAAK,IAAI,YAAY,EAAE,CAAC;oBAEjC,IAAI,IAAA,sCAAiB,EAAC,KAAK,CAAC,EAAE,CAAC;wBAC7B,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;oBACzB,CAAC;yBAAM,IAAI,IAAA,iCAAY,EAAC,KAAK,CAAC,EAAE,CAAC;wBAC/B,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;oBACzB,CAAC;yBAAM,IAAI,IAAA,uCAAkB,EAAC,KAAK,CAAC,EAAE,CAAC;wBACrC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;oBACzB,CAAC;gBACH,CAAC;gBACD,MAAM,CAAC,aAAa,EAAE,CAAC;gBACvB,SAAS;YACX,CAAC;YAGD,IAAI,uBAAuB,CAAC,QAAQ,CAAC,YAAY,CAAC,IAAI,OAAO,CAAC,qBAAqB,EAAE,CAAC;gBAKpF,MAAM,YAAY,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC;gBACvC,KAAK,MAAM,KAAK,IAAI,YAAY,EAAE,CAAC;oBAEjC,IAAI,IAAA,sCAAiB,EAAC,KAAK,CAAC,EAAE,CAAC;wBAC7B,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;oBACzB,CAAC;yBAAM,IAAI,IAAA,iCAAY,EAAC,KAAK,CAAC,EAAE,CAAC;wBAC/B,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;oBACzB,CAAC;yBAAM,IAAI,IAAA,uCAAkB,EAAC,KAAK,CAAC,EAAE,CAAC;wBACrC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;oBACzB,CAAC;gBACH,CAAC;gBACD,MAAM,CAAC,uBAAuB,EAAE,CAAC;gBACjC,SAAS;YACX,CAAC;YAID,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACxB,CAAC;aAAM,IAAI,IAAI,YAAY,uBAAY,IAAI,IAAI,CAAC,kBAAkB,EAAE,EAAE,CAAC;YAErE,MAAM,cAAc,GAAG,IAAI,CAAC,kBAAkB,EAAE,CAAC;YACjD,MAAM,eAAe,GAAe,EAAE,CAAC;YAEvC,KAAK,MAAM,GAAG,IAAI,cAAc,EAAE,CAAC;gBACjC,MAAM,OAAO,GAAG,GAAG,CAAC,OAAO,EAAE,CAAC;gBAC9B,IAAI,OAAO,KAAK,QAAQ,IAAI,OAAO,CAAC,gBAAgB,EAAE,CAAC;oBACrD,MAAM,CAAC,kBAAkB,EAAE,CAAC;gBAC9B,CAAC;qBAAM,IAAI,OAAO,KAAK,QAAQ,IAAI,OAAO,CAAC,eAAe,EAAE,CAAC;oBAC3D,MAAM,CAAC,iBAAiB,EAAE,CAAC;gBAC7B,CAAC;qBAAM,IAAI,OAAO,KAAK,QAAQ,IAAI,OAAO,CAAC,WAAW,EAAE,CAAC;oBACvD,MAAM,CAAC,aAAa,EAAE,CAAC;gBACzB,CAAC;qBAAM,IAAI,OAAO,KAAK,UAAU,IAAI,OAAO,CAAC,WAAW,EAAE,CAAC;oBACzD,MAAM,CAAC,aAAa,EAAE,CAAC;gBACzB,CAAC;qBAAM,CAAC;oBACN,eAAe,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBAC5B,CAAC;YACH,CAAC;YAED,IAAI,eAAe,CAAC,MAAM,GAAG,cAAc,CAAC,MAAM,EAAE,CAAC;gBAEnD,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,qBAAqB,EAAE,CAAC,CAAC;gBAC7C,IAAI,eAAe,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBAC/B,IAAI,CAAC,kBAAkB,CAAC,eAAe,CAAC,CAAC;gBAC3C,CAAC;YACH,CAAC;YACD,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACxB,CAAC;aAAM,CAAC;YAEN,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACxB,CAAC;IACH,CAAC;IAGD,SAAS,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC;IAIjC,IAAI,OAAO,CAAC,qBAAqB,EAAE,CAAC;QAClC,MAAM,UAAU,GAAG,SAAS,CAAC,aAAa,EAAE,CAAC;QAC7C,IAAI,UAAU,CAAC,SAAS,EAAE,CAAC;YACzB,SAAS,CAAC,8BAA8B,EAAE,CAAC;YAC3C,MAAM,CAAC,uBAAuB,EAAE,CAAC;QACnC,CAAC;QAID,IAAI,UAAU,CAAC,gCAAgC,EAAE,CAAC;YAChD,SAAS,CAAC,UAAU,CAAC,gCAAgC,GAAG,SAAS,CAAC;YAClE,MAAM,CAAC,uBAAuB,EAAE,CAAC;QACnC,CAAC;IACH,CAAC;IAID,IAAI,OAAO,CAAC,eAAe,EAAE,CAAC;QAC5B,MAAM,UAAU,GAAG,SAAS,CAAC,aAAa,EAAE,CAAC;QAC7C,IAAI,UAAU,CAAC,qBAAqB,EAAE,CAAC;YACrC,SAAS,CAAC,0BAA0B,EAAE,CAAC;YACvC,MAAM,CAAC,iBAAiB,EAAE,CAAC;QAC7B,CAAC;IACH,CAAC;IAID,IAAI,OAAO,CAAC,gBAAgB,EAAE,CAAC;QAC7B,MAAM,UAAU,GAAG,SAAS,CAAC,aAAa,EAAE,CAAC;QAC7C,IAAI,UAAU,CAAC,sBAAsB,EAAE,CAAC;YACtC,SAAS,CAAC,2BAA2B,EAAE,CAAC;YACxC,MAAM,CAAC,kBAAkB,EAAE,CAAC;QAC9B,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAKD,SAAgB,qBAAqB,CAAC,SAAoB;IACxD,MAAM,OAAO,GAAG,SAAS,CAAC,UAAU,EAAE,CAAC;IACvC,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,YAAY,sBAAQ,CAAC,EAAE,CAAC;QACrD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,MAAM,UAAU,GAAG,SAAS,CAAC,aAAa,EAAE,CAAC;IAC7C,IAAI,UAAU,CAAC,qBAAqB,IAAI,UAAU,CAAC,sBAAsB,EAAE,CAAC;QAC1E,OAAO,IAAI,CAAC;IACd,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAKD,SAAgB,yBAAyB,CAAC,SAAoB;IAC5D,MAAM,OAAO,GAAG,SAAS,CAAC,UAAU,EAAE,CAAC;IACvC,OAAO,OAAO,CAAC,MAAM,CAAC,CAAC,IAAI,EAAoB,EAAE,CAAC,IAAI,YAAY,sBAAQ,CAAC,CAAC;AAC9E,CAAC;AAKD,SAAgB,oBAAoB,CAAC,GAAa;IAChD,MAAM,MAAM,GAAG,IAAI,GAAG,EAAwB,CAAC;IAE/C,MAAM,UAAU,GAAG,GAAG,CAAC,gBAAgB,EAAE,CAAC;IAC1C,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;QACnC,MAAM,SAAS,GAAG,yBAAyB,CAAC,SAAS,CAAC,CAAC;QACvD,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;YACjC,MAAM,IAAI,GAAG,QAAQ,CAAC,OAAO,EAAE,CAAC;YAChC,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAChD,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAaD,SAAS,kBAAkB,CAAC,GAAa,EAAE,MAAe;IACxD,MAAM,MAAM,GAAG,GAAG,CAAC,SAAS,EAAE,CAAC;IAC/B,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,MAAM,cAAc,GAAa,EAAE,CAAC;IAEpC,KAAK,IAAI,UAAU,GAAG,CAAC,EAAE,UAAU,GAAG,MAAM,CAAC,MAAM,EAAE,UAAU,EAAE,EAAE,CAAC;QAClE,MAAM,KAAK,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC;QACjC,IAAI,CAAC,KAAK;YAAE,SAAS;QAErB,IAAI,UAAU,GAAG,KAAK,CAAC;QACvB,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,EAAE,CAAC;QAE7B,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,MAAM,KAAK,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAC;YAC7B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,MAAM,UAAU,GAAG,IAAI,CAAC,aAAa,EAAE,CAAC;gBACxC,KAAK,MAAM,IAAI,IAAI,UAAU,EAAE,CAAC;oBAC9B,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC,IAAI,EAAE,CAAC;oBACnC,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;wBACpB,UAAU,GAAG,IAAI,CAAC;wBAClB,MAAM;oBACR,CAAC;gBACH,CAAC;gBACD,IAAI,UAAU;oBAAE,MAAM;YACxB,CAAC;YACD,IAAI,UAAU;gBAAE,MAAM;QACxB,CAAC;QAED,IAAI,CAAC,UAAU,EAAE,CAAC;YAEhB,cAAc,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YAChC,MAAM,CAAC,KAAK,CAAC,+BAA+B,EAAE,EAAE,UAAU,EAAE,CAAC,CAAC;QAChE,CAAC;IACH,CAAC;IAGD,KAAK,IAAI,CAAC,GAAG,cAAc,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACpD,MAAM,UAAU,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;QACrC,IAAI,UAAU,KAAK,SAAS,IAAI,GAAG,CAAC,WAAW,CAAC,UAAU,CAAC,EAAE,CAAC;YAC5D,YAAY,EAAE,CAAC;YACf,MAAM,CAAC,KAAK,CAAC,qBAAqB,EAAE,EAAE,UAAU,EAAE,CAAC,CAAC;QACtD,CAAC;IACH,CAAC;IAED,IAAI,YAAY,GAAG,CAAC,EAAE,CAAC;QACrB,MAAM,CAAC,IAAI,CAAC,8BAA8B,EAAE,EAAE,aAAa,EAAE,YAAY,EAAE,CAAC,CAAC;IAC/E,CAAC;IAED,OAAO,YAAY,CAAC;AACtB,CAAC","sourcesContent":["/**\n * InMemoryRevisionAcceptor - Accept revisions by transforming the in-memory object model\n *\n * This approach follows the industry standard (OpenXML PowerTools, Aspose.Words):\n * - Transforms Revision objects in paragraph.content[] to their \"accepted\" state\n * - For insertions: Unwrap - extract child Runs/Hyperlinks into parent paragraph\n * - For deletions: Remove - delete the revision and its content from the model\n * - For property changes: Remove the change metadata, keep the current formatting\n *\n * Unlike the raw XML approach (acceptRevisions.ts), this allows subsequent modifications\n * to the in-memory model to be correctly serialized on save().\n *\n * @see https://github.com/OfficeDev/Open-Xml-PowerTools - RevisionAccepter.cs\n * @see https://learn.microsoft.com/en-us/previous-versions/office/developer/office-2007/ee836138(v=office.12)\n */\n\nimport type { Document } from '../core/Document.js';\nimport { Paragraph } from '../elements/Paragraph.js';\nimport type { ParagraphContent } from '../elements/Paragraph.js';\nimport { Revision, RevisionType } from '../elements/Revision.js';\nimport {\n  isRunContent,\n  isHyperlinkContent,\n  isImageRunContent,\n} from '../elements/RevisionContent.js';\nimport { ComplexField } from '../elements/Field.js';\nimport { Table } from '../elements/Table.js';\nimport { getGlobalLogger, createScopedLogger, ILogger } from '../utils/logger.js';\n\n/**\n * Get scoped logger for this module\n */\nfunction getLogger(): ILogger {\n  return createScopedLogger(getGlobalLogger(), 'InMemoryRevisionAcceptor');\n}\n\n/**\n * Options for accepting revisions\n */\nexport interface AcceptRevisionsOptions {\n  /** Accept insertion revisions (w:ins) - default: true */\n  acceptInsertions?: boolean;\n  /** Accept deletion revisions (w:del) - default: true */\n  acceptDeletions?: boolean;\n  /** Accept move operations (w:moveFrom, w:moveTo) - default: true */\n  acceptMoves?: boolean;\n  /** Accept property change revisions (rPrChange, pPrChange, etc.) - default: true */\n  acceptPropertyChanges?: boolean;\n  /** Remove empty tables after revision acceptance - default: true */\n  cleanupEmptyTables?: boolean;\n}\n\n/**\n * Result of accepting revisions\n */\nexport interface AcceptRevisionsResult {\n  /** Number of insertions accepted */\n  insertionsAccepted: number;\n  /** Number of deletions accepted */\n  deletionsAccepted: number;\n  /** Number of move operations accepted */\n  movesAccepted: number;\n  /** Number of property changes accepted */\n  propertyChangesAccepted: number;\n  /** Total revisions processed */\n  totalAccepted: number;\n  /** Number of empty tables removed during cleanup */\n  emptyTablesRemoved: number;\n}\n\n/**\n * Revision types that represent property/formatting changes\n */\nconst PROPERTY_REVISION_TYPES: RevisionType[] = [\n  'runPropertiesChange',\n  'paragraphPropertiesChange',\n  'tablePropertiesChange',\n  'tableExceptionPropertiesChange',\n  'tableRowPropertiesChange',\n  'tableCellPropertiesChange',\n  'sectionPropertiesChange',\n  'numberingChange',\n];\n\n/**\n * Strip revision markup from raw XML string.\n * Used for nested tables stored as raw XML that cannot be processed via the in-memory model.\n *\n * Follows the same rules as the main revision acceptor:\n * - Insertions: Keep content, remove wrapper tags\n * - Deletions: Remove entirely (content and tags)\n * - MoveFrom: Remove entirely (source of move)\n * - MoveTo: Keep content, remove wrapper\n * - Property changes: Remove change tracking elements\n * - Range markers: Remove boundary markers\n *\n * @param xml - Raw XML string containing revision markup\n * @returns Cleaned XML with revisions accepted\n */\nexport function stripRevisionsFromXml(xml: string): string {\n  let result = xml;\n\n  // Step 1: Remove range markers (must be done first)\n  const rangePatterns = [\n    /<w:moveFromRangeStart[^>]*(?:\\/>|>.*?<\\/w:moveFromRangeStart>)/gs,\n    /<w:moveFromRangeEnd[^>]*(?:\\/>|>.*?<\\/w:moveFromRangeEnd>)/gs,\n    /<w:moveToRangeStart[^>]*(?:\\/>|>.*?<\\/w:moveToRangeStart>)/gs,\n    /<w:moveToRangeEnd[^>]*(?:\\/>|>.*?<\\/w:moveToRangeEnd>)/gs,\n    /<w:customXmlInsRangeStart[^>]*(?:\\/>|>.*?<\\/w:customXmlInsRangeStart>)/gs,\n    /<w:customXmlInsRangeEnd[^>]*(?:\\/>|>.*?<\\/w:customXmlInsRangeEnd>)/gs,\n    /<w:customXmlDelRangeStart[^>]*(?:\\/>|>.*?<\\/w:customXmlDelRangeStart>)/gs,\n    /<w:customXmlDelRangeEnd[^>]*(?:\\/>|>.*?<\\/w:customXmlDelRangeEnd>)/gs,\n  ];\n  for (const pattern of rangePatterns) {\n    result = result.replace(pattern, '');\n  }\n\n  // Step 2: Remove property change elements\n  const propChangePatterns = [\n    /<w:rPrChange[^>]*>[\\s\\S]*?<\\/w:rPrChange>/g,\n    /<w:pPrChange[^>]*>[\\s\\S]*?<\\/w:pPrChange>/g,\n    /<w:tblPrChange[^>]*>[\\s\\S]*?<\\/w:tblPrChange>/g,\n    /<w:tblPrExChange[^>]*>[\\s\\S]*?<\\/w:tblPrExChange>/g,\n    /<w:tcPrChange[^>]*>[\\s\\S]*?<\\/w:tcPrChange>/g,\n    /<w:trPrChange[^>]*>[\\s\\S]*?<\\/w:trPrChange>/g,\n    /<w:sectPrChange[^>]*>[\\s\\S]*?<\\/w:sectPrChange>/g,\n    /<w:tblGridChange[^>]*>[\\s\\S]*?<\\/w:tblGridChange>/g,\n    /<w:numberingChange[^>]*>[\\s\\S]*?<\\/w:numberingChange>/g,\n  ];\n  for (const pattern of propChangePatterns) {\n    result = result.replace(pattern, '');\n  }\n\n  // Step 3: Remove deletions entirely (including content)\n  // Iterate until no more deletions (handles nested cases)\n  let prevLen = 0;\n  while (result.length !== prevLen) {\n    prevLen = result.length;\n    result = result.replace(/<w:del\\b[^>]*>[\\s\\S]*?<\\/w:del>/g, '');\n  }\n  result = result.replace(/<w:del\\b[^>]*\\/>/g, '');\n\n  // Step 4: Remove moveFrom entirely (source of moved content)\n  prevLen = 0;\n  while (result.length !== prevLen) {\n    prevLen = result.length;\n    result = result.replace(/<w:moveFrom\\b[^>]*>[\\s\\S]*?<\\/w:moveFrom>/g, '');\n  }\n  result = result.replace(/<w:moveFrom\\b[^>]*\\/>/g, '');\n\n  // Step 5: Unwrap moveTo (keep content, remove wrapper)\n  result = result.replace(/<\\/w:moveTo>/g, '');\n  result = result.replace(/<w:moveTo\\b[^>]*>/g, '');\n\n  // Step 6: Unwrap insertions (keep content, remove wrapper)\n  result = result.replace(/<\\/w:ins>/g, '');\n  result = result.replace(/<w:ins\\b[^>]*>/g, '');\n\n  // Step 7: Clean up orphaned tags\n  result = result.replace(/<w:ins\\b[^>]*\\/>/g, '');\n  result = result.replace(/<w:del\\b[^>]*\\/>/g, '');\n  result = result.replace(/<w:moveFrom\\b[^>]*\\/>/g, '');\n  result = result.replace(/<w:moveTo\\b[^>]*\\/>/g, '');\n\n  return result;\n}\n\n/**\n * Accept all revisions in the document by transforming the in-memory model.\n *\n * This is the industry-standard approach used by OpenXML PowerTools, Aspose.Words,\n * and other production DOCX libraries. It allows subsequent modifications to the\n * document to work correctly.\n *\n * @param doc - Document to process\n * @param options - Options for which revision types to accept\n * @returns Result with counts of accepted revisions\n */\nexport function acceptRevisionsInMemory(\n  doc: Document,\n  options: AcceptRevisionsOptions = {}\n): AcceptRevisionsResult {\n  const logger = getLogger();\n  const opts: Required<AcceptRevisionsOptions> = {\n    acceptInsertions: options.acceptInsertions ?? true,\n    acceptDeletions: options.acceptDeletions ?? true,\n    acceptMoves: options.acceptMoves ?? true,\n    acceptPropertyChanges: options.acceptPropertyChanges ?? true,\n    cleanupEmptyTables: options.cleanupEmptyTables ?? true,\n  };\n\n  const result: AcceptRevisionsResult = {\n    insertionsAccepted: 0,\n    deletionsAccepted: 0,\n    movesAccepted: 0,\n    propertyChangesAccepted: 0,\n    totalAccepted: 0,\n    emptyTablesRemoved: 0,\n  };\n\n  logger.info('Accepting revisions in-memory', { options: opts });\n\n  // Validate move pairs before accepting if moves are being accepted\n  // Orphaned moves could result in content loss (moveFrom without moveTo = content deleted)\n  if (opts.acceptMoves) {\n    const revisionManager = doc.getRevisionManager();\n    if (revisionManager) {\n      const movePairValidation = revisionManager.validateMovePairs();\n      if (!movePairValidation.valid) {\n        if (movePairValidation.orphanedMoveFrom.length > 0) {\n          logger.warn(\n            'Orphaned moveFrom revisions detected - accepting these will DELETE content permanently ' +\n              '(content was moved from here but no moveTo destination exists)',\n            { orphanedMoveIds: movePairValidation.orphanedMoveFrom }\n          );\n        }\n        if (movePairValidation.orphanedMoveTo.length > 0) {\n          logger.warn(\n            'Orphaned moveTo revisions detected - content may be duplicated ' +\n              '(content moved to here but no moveFrom source exists)',\n            { orphanedMoveIds: movePairValidation.orphanedMoveTo }\n          );\n        }\n      }\n    }\n  }\n\n  // Process all paragraphs in the document body\n  const paragraphs = doc.getAllParagraphs();\n  for (const paragraph of paragraphs) {\n    const paragraphResult = acceptRevisionsInParagraph(paragraph, opts);\n    result.insertionsAccepted += paragraphResult.insertionsAccepted;\n    result.deletionsAccepted += paragraphResult.deletionsAccepted;\n    result.movesAccepted += paragraphResult.movesAccepted;\n    result.propertyChangesAccepted += paragraphResult.propertyChangesAccepted;\n  }\n\n  // Process paragraphs in tables and clear table/row/cell property changes\n  const tables = doc.getTables();\n  for (const table of tables) {\n    // Clear tblPrChange on table\n    if (opts.acceptPropertyChanges && table.getTblPrChange()) {\n      table.clearTblPrChange();\n      result.propertyChangesAccepted++;\n    }\n\n    // Row-level tracked ins / del (CT_TrPr: w:ins / w:del per ECMA-376\n    // §17.13.5.19 / §17.13.5.14) — these mark the ENTIRE row as a tracked\n    // insertion or deletion. Previously the acceptor only cleared the\n    // tcPrChange / trPrChange / cellRevision metadata and silently ignored\n    // row-level markers, so deleted rows persisted and inserted rows kept\n    // their pending state. Collect deletion indices up front so we can\n    // splice them out after iteration (reverse order to keep indices stable).\n    const rowsToRemove: number[] = [];\n    const allRows = table.getRows();\n    for (let rowIdx = 0; rowIdx < allRows.length; rowIdx++) {\n      const row = allRows[rowIdx]!;\n      const fmt = row.getFormatting();\n      if (fmt.rowInsertion && opts.acceptInsertions) {\n        row.setRowInsertion(undefined);\n        result.insertionsAccepted++;\n      }\n      if (fmt.rowDeletion && opts.acceptDeletions) {\n        rowsToRemove.push(rowIdx);\n        result.deletionsAccepted++;\n      }\n    }\n    for (let i = rowsToRemove.length - 1; i >= 0; i--) {\n      table._removeRowAtIndex(rowsToRemove[i]!);\n    }\n\n    for (const row of table.getRows()) {\n      // Clear trPrChange on row\n      if (opts.acceptPropertyChanges && row.getTrPrChange()) {\n        row.clearTrPrChange();\n        result.propertyChangesAccepted++;\n      }\n\n      for (const cell of row.getCells()) {\n        // Clear tcPrChange on cell\n        if (opts.acceptPropertyChanges && cell.getTcPrChange()) {\n          cell.clearTcPrChange();\n          result.propertyChangesAccepted++;\n        }\n\n        // Route cellIns / cellDel / cellMerge by their semantic revision type\n        // (per ECMA-376 §17.13.5.4-6). Previously all three were lumped under\n        // `acceptPropertyChanges`, which meant `{ acceptInsertions: true }`\n        // alone never cleared a cellIns marker, and `{ acceptPropertyChanges:\n        // true }` alone cleared everything including insertions. Correct\n        // mapping:\n        //   - tableCellInsert (w:cellIns)   → acceptInsertions\n        //   - tableCellDelete (w:cellDel)   → acceptDeletions\n        //   - tableCellMerge  (w:cellMerge) → acceptPropertyChanges\n        const cellRev = cell.getCellRevision();\n        if (cellRev) {\n          const revType = cellRev.getType();\n          if (revType === 'tableCellInsert' && opts.acceptInsertions) {\n            cell.clearCellRevision();\n            result.insertionsAccepted++;\n          } else if (revType === 'tableCellDelete' && opts.acceptDeletions) {\n            cell.clearCellRevision();\n            result.deletionsAccepted++;\n          } else if (revType === 'tableCellMerge' && opts.acceptPropertyChanges) {\n            cell.clearCellRevision();\n            result.propertyChangesAccepted++;\n          }\n        }\n\n        // Process paragraphs in the cell\n        for (const paragraph of cell.getParagraphs()) {\n          const paragraphResult = acceptRevisionsInParagraph(paragraph, opts);\n          result.insertionsAccepted += paragraphResult.insertionsAccepted;\n          result.deletionsAccepted += paragraphResult.deletionsAccepted;\n          result.movesAccepted += paragraphResult.movesAccepted;\n          result.propertyChangesAccepted += paragraphResult.propertyChangesAccepted;\n        }\n\n        // Process raw nested content (nested tables stored as XML)\n        // These cannot be processed via the in-memory model, so we use XML-based stripping\n        if (cell.hasRawNestedContent()) {\n          const rawContent = cell.getRawNestedContent();\n          for (let i = 0; i < rawContent.length; i++) {\n            const item = rawContent[i];\n            if (item) {\n              const cleanedXml = stripRevisionsFromXml(item.xml);\n              if (cleanedXml !== item.xml) {\n                cell.updateRawNestedContent(i, cleanedXml);\n                // Count revisions stripped from nested content\n                // We can't distinguish types in raw XML, so count as property changes\n                result.propertyChangesAccepted++;\n                logger.debug('Stripped revisions from nested content', {\n                  type: item.type,\n                  position: item.position,\n                  originalLength: item.xml.length,\n                  cleanedLength: cleanedXml.length,\n                });\n              }\n            }\n          }\n        }\n      }\n    }\n  }\n\n  // Process paragraphs in headers\n  const headerFooterManager = doc.getHeaderFooterManager();\n  if (headerFooterManager) {\n    const headers = headerFooterManager.getAllHeaders();\n    for (const headerEntry of headers) {\n      const elements = headerEntry.header.getElements();\n      for (const element of elements) {\n        // Element can be Paragraph or Table - use instanceof for type safety\n        if (element instanceof Paragraph) {\n          const paragraphResult = acceptRevisionsInParagraph(element, opts);\n          result.insertionsAccepted += paragraphResult.insertionsAccepted;\n          result.deletionsAccepted += paragraphResult.deletionsAccepted;\n          result.movesAccepted += paragraphResult.movesAccepted;\n          result.propertyChangesAccepted += paragraphResult.propertyChangesAccepted;\n        } else if (element instanceof Table) {\n          // It's a Table - process its cells\n          for (const row of element.getRows()) {\n            for (const cell of row.getCells()) {\n              for (const paragraph of cell.getParagraphs()) {\n                const paragraphResult = acceptRevisionsInParagraph(paragraph, opts);\n                result.insertionsAccepted += paragraphResult.insertionsAccepted;\n                result.deletionsAccepted += paragraphResult.deletionsAccepted;\n                result.movesAccepted += paragraphResult.movesAccepted;\n                result.propertyChangesAccepted += paragraphResult.propertyChangesAccepted;\n              }\n              // Process raw nested content in header tables\n              if (cell.hasRawNestedContent()) {\n                const rawContent = cell.getRawNestedContent();\n                for (let i = 0; i < rawContent.length; i++) {\n                  const item = rawContent[i];\n                  if (item) {\n                    const cleanedXml = stripRevisionsFromXml(item.xml);\n                    if (cleanedXml !== item.xml) {\n                      cell.updateRawNestedContent(i, cleanedXml);\n                      result.propertyChangesAccepted++;\n                    }\n                  }\n                }\n              }\n            }\n          }\n        }\n      }\n    }\n\n    // Process paragraphs in footers\n    const footers = headerFooterManager.getAllFooters();\n    for (const footerEntry of footers) {\n      const elements = footerEntry.footer.getElements();\n      for (const element of elements) {\n        // Element can be Paragraph or Table - use instanceof for type safety\n        if (element instanceof Paragraph) {\n          const paragraphResult = acceptRevisionsInParagraph(element, opts);\n          result.insertionsAccepted += paragraphResult.insertionsAccepted;\n          result.deletionsAccepted += paragraphResult.deletionsAccepted;\n          result.movesAccepted += paragraphResult.movesAccepted;\n          result.propertyChangesAccepted += paragraphResult.propertyChangesAccepted;\n        } else if (element instanceof Table) {\n          // It's a Table - process its cells\n          for (const row of element.getRows()) {\n            for (const cell of row.getCells()) {\n              for (const paragraph of cell.getParagraphs()) {\n                const paragraphResult = acceptRevisionsInParagraph(paragraph, opts);\n                result.insertionsAccepted += paragraphResult.insertionsAccepted;\n                result.deletionsAccepted += paragraphResult.deletionsAccepted;\n                result.movesAccepted += paragraphResult.movesAccepted;\n                result.propertyChangesAccepted += paragraphResult.propertyChangesAccepted;\n              }\n              // Process raw nested content in footer tables\n              if (cell.hasRawNestedContent()) {\n                const rawContent = cell.getRawNestedContent();\n                for (let i = 0; i < rawContent.length; i++) {\n                  const item = rawContent[i];\n                  if (item) {\n                    const cleanedXml = stripRevisionsFromXml(item.xml);\n                    if (cleanedXml !== item.xml) {\n                      cell.updateRawNestedContent(i, cleanedXml);\n                      result.propertyChangesAccepted++;\n                    }\n                  }\n                }\n              }\n            }\n          }\n        }\n      }\n    }\n  }\n\n  // Walk footnote and endnote paragraphs. Per ECMA-376 §17.11.4 /\n  // §17.11.15, notes can hold any block-level content including\n  // tracked changes; programmatically-added Revision objects on note\n  // paragraphs (e.g.\n  // `footnote.getParagraphs()[0].addContent(new Revision(...))`)\n  // were never visited by the in-memory acceptor and stayed in the\n  // model after `acceptAllRevisions()`. The raw-XML acceptor\n  // (iter 135) already handles existing-document note revisions on\n  // load, so this loop's job is the programmatic-API path.\n  const footnoteManager = doc.getFootnoteManager?.();\n  if (footnoteManager) {\n    for (const fn of footnoteManager.getAllFootnotes()) {\n      for (const paragraph of fn.getParagraphs()) {\n        const paragraphResult = acceptRevisionsInParagraph(paragraph, opts);\n        result.insertionsAccepted += paragraphResult.insertionsAccepted;\n        result.deletionsAccepted += paragraphResult.deletionsAccepted;\n        result.movesAccepted += paragraphResult.movesAccepted;\n        result.propertyChangesAccepted += paragraphResult.propertyChangesAccepted;\n      }\n    }\n  }\n  const endnoteManager = doc.getEndnoteManager?.();\n  if (endnoteManager) {\n    for (const en of endnoteManager.getAllEndnotes()) {\n      for (const paragraph of en.getParagraphs()) {\n        const paragraphResult = acceptRevisionsInParagraph(paragraph, opts);\n        result.insertionsAccepted += paragraphResult.insertionsAccepted;\n        result.deletionsAccepted += paragraphResult.deletionsAccepted;\n        result.movesAccepted += paragraphResult.movesAccepted;\n        result.propertyChangesAccepted += paragraphResult.propertyChangesAccepted;\n      }\n    }\n  }\n\n  // Clear sectPrChange on document section\n  if (opts.acceptPropertyChanges) {\n    const section = doc.getSection();\n    if (section?.getSectPrChange()) {\n      section.clearSectPrChange();\n      result.propertyChangesAccepted++;\n    }\n  }\n\n  // Clear revision manager\n  const revisionManager = doc.getRevisionManager();\n  if (revisionManager) {\n    revisionManager.clear();\n  }\n\n  // Disable track changes setting\n  doc.disableTrackChanges();\n\n  // Cleanup empty tables if enabled\n  // This removes tables that have no visible content after revision acceptance\n  // (e.g., tables where all content was deleted via tracked changes)\n  if (opts.cleanupEmptyTables) {\n    result.emptyTablesRemoved = cleanupEmptyTables(doc, logger);\n  }\n\n  result.totalAccepted =\n    result.insertionsAccepted +\n    result.deletionsAccepted +\n    result.movesAccepted +\n    result.propertyChangesAccepted;\n\n  logger.info('Revisions accepted in-memory', {\n    insertions: result.insertionsAccepted,\n    deletions: result.deletionsAccepted,\n    moves: result.movesAccepted,\n    propertyChanges: result.propertyChangesAccepted,\n    total: result.totalAccepted,\n    emptyTablesRemoved: result.emptyTablesRemoved,\n  });\n\n  return result;\n}\n\n/**\n * Accept revisions in a single paragraph by transforming its content array.\n *\n * The transformation follows these rules:\n * - Insertions (w:ins): Unwrap - extract child content into parent position\n * - Deletions (w:del): Remove - delete revision and its content\n * - MoveFrom (w:moveFrom): Remove - content exists at moveTo destination\n * - MoveTo (w:moveTo): Unwrap - keep content, remove wrapper\n * - Property changes: Remove from model (current formatting is kept)\n *\n * @param paragraph - Paragraph to process\n * @param options - Options for which revision types to accept\n * @returns Result with counts of accepted revisions\n */\nfunction acceptRevisionsInParagraph(\n  paragraph: Paragraph,\n  options: Required<AcceptRevisionsOptions>\n): AcceptRevisionsResult {\n  const result: AcceptRevisionsResult = {\n    insertionsAccepted: 0,\n    deletionsAccepted: 0,\n    movesAccepted: 0,\n    propertyChangesAccepted: 0,\n    totalAccepted: 0,\n    emptyTablesRemoved: 0,\n  };\n\n  const content = paragraph.getContent();\n  const newContent: ParagraphContent[] = [];\n\n  for (const item of content) {\n    if (item instanceof Revision) {\n      const revisionType = item.getType();\n\n      // Handle insertion revisions (w:ins)\n      if (revisionType === 'insert' && options.acceptInsertions) {\n        // Unwrap: Extract child content into parent position\n        const childContent = item.getContent();\n        for (const child of childContent) {\n          // Check ImageRun FIRST since ImageRun extends Run\n          if (isImageRunContent(child)) {\n            newContent.push(child);\n          } else if (isRunContent(child)) {\n            newContent.push(child);\n          } else if (isHyperlinkContent(child)) {\n            newContent.push(child);\n          }\n        }\n        result.insertionsAccepted++;\n        continue;\n      }\n\n      // Handle deletion revisions (w:del)\n      if (revisionType === 'delete' && options.acceptDeletions) {\n        // Remove: Don't add to newContent - content is deleted\n        result.deletionsAccepted++;\n        continue;\n      }\n\n      // Handle moveFrom revisions (source of moved content)\n      if (revisionType === 'moveFrom' && options.acceptMoves) {\n        // Remove: Content exists at moveTo destination\n        result.movesAccepted++;\n        continue;\n      }\n\n      // Handle moveTo revisions (destination of moved content)\n      if (revisionType === 'moveTo' && options.acceptMoves) {\n        // Unwrap: Keep content, remove wrapper\n        const childContent = item.getContent();\n        for (const child of childContent) {\n          // Check ImageRun FIRST since ImageRun extends Run\n          if (isImageRunContent(child)) {\n            newContent.push(child);\n          } else if (isRunContent(child)) {\n            newContent.push(child);\n          } else if (isHyperlinkContent(child)) {\n            newContent.push(child);\n          }\n        }\n        result.movesAccepted++;\n        continue;\n      }\n\n      // Handle property change revisions\n      if (PROPERTY_REVISION_TYPES.includes(revisionType) && options.acceptPropertyChanges) {\n        // For property changes, the revision is metadata attached to runs\n        // The current formatting (newProperties) is already applied to the run\n        // We just need to remove the change tracking metadata\n        // The content inside should be preserved\n        const childContent = item.getContent();\n        for (const child of childContent) {\n          // Check ImageRun FIRST since ImageRun extends Run\n          if (isImageRunContent(child)) {\n            newContent.push(child);\n          } else if (isRunContent(child)) {\n            newContent.push(child);\n          } else if (isHyperlinkContent(child)) {\n            newContent.push(child);\n          }\n        }\n        result.propertyChangesAccepted++;\n        continue;\n      }\n\n      // If we reach here, this revision type is not being accepted\n      // Keep it in the content\n      newContent.push(item);\n    } else if (item instanceof ComplexField && item.hasResultRevisions()) {\n      // Accept revisions nested inside ComplexField result sections\n      const fieldRevisions = item.getResultRevisions();\n      const revisionsToKeep: Revision[] = [];\n\n      for (const rev of fieldRevisions) {\n        const revType = rev.getType();\n        if (revType === 'insert' && options.acceptInsertions) {\n          result.insertionsAccepted++;\n        } else if (revType === 'delete' && options.acceptDeletions) {\n          result.deletionsAccepted++;\n        } else if (revType === 'moveTo' && options.acceptMoves) {\n          result.movesAccepted++;\n        } else if (revType === 'moveFrom' && options.acceptMoves) {\n          result.movesAccepted++;\n        } else {\n          revisionsToKeep.push(rev);\n        }\n      }\n\n      if (revisionsToKeep.length < fieldRevisions.length) {\n        // Some revisions were accepted — use getAcceptedResultText() for correct interleaved ordering\n        item.setResult(item.getAcceptedResultText());\n        if (revisionsToKeep.length > 0) {\n          item.setResultRevisions(revisionsToKeep);\n        }\n      }\n      newContent.push(item);\n    } else {\n      // Non-revision content - keep as-is\n      newContent.push(item);\n    }\n  }\n\n  // Replace paragraph content with the transformed content\n  paragraph.setContent(newContent);\n\n  // Clear paragraph property change tracking (pPrChange) if accepting property changes\n  // This removes the w:pPrChange element from the paragraph's formatting\n  if (options.acceptPropertyChanges) {\n    const formatting = paragraph.getFormatting();\n    if (formatting.pPrChange) {\n      paragraph.clearParagraphPropertiesChange();\n      result.propertyChangesAccepted++;\n    }\n    // Paragraph-mark rPrChange (CT_ParaRPrChange, §17.3.1.30) — same\n    // rationale as pPrChange: acceptance clears the \"previous\" snapshot,\n    // current formatting (paragraphMarkRunProperties) stays intact.\n    if (formatting.paragraphMarkRunPropertiesChange) {\n      paragraph.formatting.paragraphMarkRunPropertiesChange = undefined;\n      result.propertyChangesAccepted++;\n    }\n  }\n\n  // Clear paragraph mark deletion tracking if accepting deletions\n  // This removes the w:del element from w:pPr/w:rPr\n  if (options.acceptDeletions) {\n    const formatting = paragraph.getFormatting();\n    if (formatting.paragraphMarkDeletion) {\n      paragraph.clearParagraphMarkDeletion();\n      result.deletionsAccepted++;\n    }\n  }\n\n  // Clear paragraph mark insertion tracking if accepting insertions\n  // This removes the w:ins element from w:pPr/w:rPr\n  if (options.acceptInsertions) {\n    const formatting = paragraph.getFormatting();\n    if (formatting.paragraphMarkInsertion) {\n      paragraph.clearParagraphMarkInsertion();\n      result.insertionsAccepted++;\n    }\n  }\n\n  return result;\n}\n\n/**\n * Check if a paragraph has any revisions\n */\nexport function paragraphHasRevisions(paragraph: Paragraph): boolean {\n  const content = paragraph.getContent();\n  if (content.some((item) => item instanceof Revision)) {\n    return true;\n  }\n  // Also check paragraph mark revision markers in w:pPr/w:rPr\n  const formatting = paragraph.getFormatting();\n  if (formatting.paragraphMarkDeletion || formatting.paragraphMarkInsertion) {\n    return true;\n  }\n  return false;\n}\n\n/**\n * Get all revisions from a paragraph\n */\nexport function getRevisionsFromParagraph(paragraph: Paragraph): Revision[] {\n  const content = paragraph.getContent();\n  return content.filter((item): item is Revision => item instanceof Revision);\n}\n\n/**\n * Count revisions by type in a document\n */\nexport function countRevisionsByType(doc: Document): Map<RevisionType, number> {\n  const counts = new Map<RevisionType, number>();\n\n  const paragraphs = doc.getAllParagraphs();\n  for (const paragraph of paragraphs) {\n    const revisions = getRevisionsFromParagraph(paragraph);\n    for (const revision of revisions) {\n      const type = revision.getType();\n      counts.set(type, (counts.get(type) || 0) + 1);\n    }\n  }\n\n  return counts;\n}\n\n/**\n * Remove tables that have no visible content after revision acceptance.\n *\n * A table is considered empty if ALL cells in ALL rows have no text content.\n * This handles cases where all table content was deleted via tracked changes -\n * the deletion markers are stripped but the empty table structure remains.\n *\n * @param doc - Document to clean up\n * @param logger - Logger instance for debug output\n * @returns Number of empty tables removed\n */\nfunction cleanupEmptyTables(doc: Document, logger: ILogger): number {\n  const tables = doc.getTables();\n  let removedCount = 0;\n  const tablesToRemove: number[] = [];\n\n  for (let tableIndex = 0; tableIndex < tables.length; tableIndex++) {\n    const table = tables[tableIndex];\n    if (!table) continue;\n\n    let hasContent = false;\n    const rows = table.getRows();\n\n    for (const row of rows) {\n      const cells = row.getCells();\n      for (const cell of cells) {\n        const paragraphs = cell.getParagraphs();\n        for (const para of paragraphs) {\n          const text = para.getText().trim();\n          if (text.length > 0) {\n            hasContent = true;\n            break;\n          }\n        }\n        if (hasContent) break;\n      }\n      if (hasContent) break;\n    }\n\n    if (!hasContent) {\n      // Mark this table for removal (store index)\n      tablesToRemove.push(tableIndex);\n      logger.debug('Found empty table for removal', { tableIndex });\n    }\n  }\n\n  // Remove tables in reverse order to preserve indices\n  for (let i = tablesToRemove.length - 1; i >= 0; i--) {\n    const tableIndex = tablesToRemove[i];\n    if (tableIndex !== undefined && doc.removeTable(tableIndex)) {\n      removedCount++;\n      logger.debug('Removed empty table', { tableIndex });\n    }\n  }\n\n  if (removedCount > 0) {\n    logger.info('Empty table cleanup complete', { tablesRemoved: removedCount });\n  }\n\n  return removedCount;\n}\n"]}
+{"version":3,"file":"InMemoryRevisionAcceptor.js","sourceRoot":"","sources":["../../src/processors/InMemoryRevisionAcceptor.ts"],"names":[],"mappings":";;AAiIA,sDAwEC;AAaD,0DAmWC;AA+ND,0EAkCC;AA0DD,sDAWC;AAKD,8DAGC;AAKD,oDAaC;AAx4BD,2DAAqD;AAErD,yDAAiE;AACjE,uEAIwC;AACxC,mDAAoD;AACpD,+DAA0E;AAC1E,yEAAmE;AACnE,mDAA6C;AAC7C,kDAAkF;AAKlF,SAAS,SAAS;IAChB,OAAO,IAAA,8BAAkB,EAAC,IAAA,2BAAe,GAAE,EAAE,0BAA0B,CAAC,CAAC;AAC3E,CAAC;AAuCD,MAAM,uBAAuB,GAAmB;IAC9C,qBAAqB;IACrB,2BAA2B;IAC3B,uBAAuB;IACvB,gCAAgC;IAChC,0BAA0B;IAC1B,2BAA2B;IAC3B,yBAAyB;IACzB,iBAAiB;CAClB,CAAC;AAWF,MAAM,uBAAuB,GAAG,IAAI,GAAG,CAAkB;IACvD,oBAAoB;IACpB,kBAAkB;IAClB,kBAAkB;IAClB,gBAAgB;IAChB,6BAA6B;IAC7B,2BAA2B;IAC3B,2BAA2B;IAC3B,yBAAyB;CAC1B,CAAC,CAAC;AACH,MAAM,sBAAsB,GAAG,IAAI,GAAG,CAAkB;IACtD,wBAAwB;IACxB,sBAAsB;CACvB,CAAC,CAAC;AACH,MAAM,sBAAsB,GAAG,IAAI,GAAG,CAAkB;IACtD,wBAAwB;IACxB,sBAAsB;CACvB,CAAC,CAAC;AAiBH,SAAgB,qBAAqB,CAAC,GAAW;IAC/C,IAAI,MAAM,GAAG,GAAG,CAAC;IAGjB,MAAM,aAAa,GAAG;QACpB,kEAAkE;QAClE,8DAA8D;QAC9D,8DAA8D;QAC9D,0DAA0D;QAC1D,0EAA0E;QAC1E,sEAAsE;QACtE,0EAA0E;QAC1E,sEAAsE;KACvE,CAAC;IACF,KAAK,MAAM,OAAO,IAAI,aAAa,EAAE,CAAC;QACpC,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;IACvC,CAAC;IAGD,MAAM,kBAAkB,GAAG;QACzB,4CAA4C;QAC5C,4CAA4C;QAC5C,gDAAgD;QAChD,oDAAoD;QACpD,8CAA8C;QAC9C,8CAA8C;QAC9C,kDAAkD;QAClD,oDAAoD;QACpD,wDAAwD;KACzD,CAAC;IACF,KAAK,MAAM,OAAO,IAAI,kBAAkB,EAAE,CAAC;QACzC,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;IACvC,CAAC;IAQD,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,mBAAmB,EAAE,EAAE,CAAC,CAAC;IAEjD,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,OAAO,MAAM,CAAC,MAAM,KAAK,OAAO,EAAE,CAAC;QACjC,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC;QACxB,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,kCAAkC,EAAE,EAAE,CAAC,CAAC;IAClE,CAAC;IAID,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,wBAAwB,EAAE,EAAE,CAAC,CAAC;IACtD,OAAO,GAAG,CAAC,CAAC;IACZ,OAAO,MAAM,CAAC,MAAM,KAAK,OAAO,EAAE,CAAC;QACjC,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC;QACxB,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,4CAA4C,EAAE,EAAE,CAAC,CAAC;IAC5E,CAAC;IAGD,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,eAAe,EAAE,EAAE,CAAC,CAAC;IAC7C,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,oBAAoB,EAAE,EAAE,CAAC,CAAC;IAGlD,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,YAAY,EAAE,EAAE,CAAC,CAAC;IAC1C,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,iBAAiB,EAAE,EAAE,CAAC,CAAC;IAG/C,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,mBAAmB,EAAE,EAAE,CAAC,CAAC;IACjD,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,mBAAmB,EAAE,EAAE,CAAC,CAAC;IACjD,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,wBAAwB,EAAE,EAAE,CAAC,CAAC;IACtD,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,sBAAsB,EAAE,EAAE,CAAC,CAAC;IAEpD,OAAO,MAAM,CAAC;AAChB,CAAC;AAaD,SAAgB,uBAAuB,CACrC,GAAa,EACb,UAAkC,EAAE;IAEpC,MAAM,MAAM,GAAG,SAAS,EAAE,CAAC;IAC3B,MAAM,IAAI,GAAqC;QAC7C,gBAAgB,EAAE,OAAO,CAAC,gBAAgB,IAAI,IAAI;QAClD,eAAe,EAAE,OAAO,CAAC,eAAe,IAAI,IAAI;QAChD,WAAW,EAAE,OAAO,CAAC,WAAW,IAAI,IAAI;QACxC,qBAAqB,EAAE,OAAO,CAAC,qBAAqB,IAAI,IAAI;QAC5D,kBAAkB,EAAE,OAAO,CAAC,kBAAkB,IAAI,IAAI;KACvD,CAAC;IAEF,MAAM,MAAM,GAA0B;QACpC,kBAAkB,EAAE,CAAC;QACrB,iBAAiB,EAAE,CAAC;QACpB,aAAa,EAAE,CAAC;QAChB,uBAAuB,EAAE,CAAC;QAC1B,aAAa,EAAE,CAAC;QAChB,kBAAkB,EAAE,CAAC;KACtB,CAAC;IAEF,MAAM,CAAC,IAAI,CAAC,+BAA+B,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC;IAKhE,MAAM,qBAAqB,GAAgB,EAAE,CAAC;IAI9C,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;QACrB,MAAM,eAAe,GAAG,GAAG,CAAC,kBAAkB,EAAE,CAAC;QACjD,IAAI,eAAe,EAAE,CAAC;YACpB,MAAM,kBAAkB,GAAG,eAAe,CAAC,iBAAiB,EAAE,CAAC;YAC/D,IAAI,CAAC,kBAAkB,CAAC,KAAK,EAAE,CAAC;gBAC9B,IAAI,kBAAkB,CAAC,gBAAgB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBACnD,MAAM,CAAC,IAAI,CACT,yFAAyF;wBACvF,gEAAgE,EAClE,EAAE,eAAe,EAAE,kBAAkB,CAAC,gBAAgB,EAAE,CACzD,CAAC;gBACJ,CAAC;gBACD,IAAI,kBAAkB,CAAC,cAAc,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBACjD,MAAM,CAAC,IAAI,CACT,iEAAiE;wBAC/D,uDAAuD,EACzD,EAAE,eAAe,EAAE,kBAAkB,CAAC,cAAc,EAAE,CACvD,CAAC;gBACJ,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAGD,MAAM,UAAU,GAAG,GAAG,CAAC,gBAAgB,EAAE,CAAC;IAC1C,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;QACnC,MAAM,eAAe,GAAG,0BAA0B,CAAC,SAAS,EAAE,IAAI,EAAE,qBAAqB,CAAC,CAAC;QAC3F,MAAM,CAAC,kBAAkB,IAAI,eAAe,CAAC,kBAAkB,CAAC;QAChE,MAAM,CAAC,iBAAiB,IAAI,eAAe,CAAC,iBAAiB,CAAC;QAC9D,MAAM,CAAC,aAAa,IAAI,eAAe,CAAC,aAAa,CAAC;QACtD,MAAM,CAAC,uBAAuB,IAAI,eAAe,CAAC,uBAAuB,CAAC;IAC5E,CAAC;IAGD,MAAM,MAAM,GAAG,GAAG,CAAC,SAAS,EAAE,CAAC;IAC/B,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAE3B,IAAI,IAAI,CAAC,qBAAqB,IAAI,KAAK,CAAC,cAAc,EAAE,EAAE,CAAC;YACzD,KAAK,CAAC,gBAAgB,EAAE,CAAC;YACzB,MAAM,CAAC,uBAAuB,EAAE,CAAC;QACnC,CAAC;QASD,MAAM,YAAY,GAAa,EAAE,CAAC;QAClC,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,EAAE,CAAC;QAChC,KAAK,IAAI,MAAM,GAAG,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE,CAAC;YACvD,MAAM,GAAG,GAAG,OAAO,CAAC,MAAM,CAAE,CAAC;YAC7B,MAAM,GAAG,GAAG,GAAG,CAAC,aAAa,EAAE,CAAC;YAChC,IAAI,GAAG,CAAC,YAAY,IAAI,IAAI,CAAC,gBAAgB,EAAE,CAAC;gBAC9C,GAAG,CAAC,eAAe,CAAC,SAAS,CAAC,CAAC;gBAC/B,MAAM,CAAC,kBAAkB,EAAE,CAAC;YAC9B,CAAC;YACD,IAAI,GAAG,CAAC,WAAW,IAAI,IAAI,CAAC,eAAe,EAAE,CAAC;gBAC5C,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBAC1B,MAAM,CAAC,iBAAiB,EAAE,CAAC;YAC7B,CAAC;QACH,CAAC;QACD,KAAK,IAAI,CAAC,GAAG,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAClD,KAAK,CAAC,iBAAiB,CAAC,YAAY,CAAC,CAAC,CAAE,CAAC,CAAC;QAC5C,CAAC;QAED,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;YAElC,IAAI,IAAI,CAAC,qBAAqB,IAAI,GAAG,CAAC,aAAa,EAAE,EAAE,CAAC;gBACtD,GAAG,CAAC,eAAe,EAAE,CAAC;gBACtB,MAAM,CAAC,uBAAuB,EAAE,CAAC;YACnC,CAAC;YAED,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,QAAQ,EAAE,EAAE,CAAC;gBAElC,IAAI,IAAI,CAAC,qBAAqB,IAAI,IAAI,CAAC,aAAa,EAAE,EAAE,CAAC;oBACvD,IAAI,CAAC,eAAe,EAAE,CAAC;oBACvB,MAAM,CAAC,uBAAuB,EAAE,CAAC;gBACnC,CAAC;gBAWD,MAAM,OAAO,GAAG,IAAI,CAAC,eAAe,EAAE,CAAC;gBACvC,IAAI,OAAO,EAAE,CAAC;oBACZ,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO,EAAE,CAAC;oBAClC,IAAI,OAAO,KAAK,iBAAiB,IAAI,IAAI,CAAC,gBAAgB,EAAE,CAAC;wBAC3D,IAAI,CAAC,iBAAiB,EAAE,CAAC;wBACzB,MAAM,CAAC,kBAAkB,EAAE,CAAC;oBAC9B,CAAC;yBAAM,IAAI,OAAO,KAAK,iBAAiB,IAAI,IAAI,CAAC,eAAe,EAAE,CAAC;wBACjE,IAAI,CAAC,iBAAiB,EAAE,CAAC;wBACzB,MAAM,CAAC,iBAAiB,EAAE,CAAC;oBAC7B,CAAC;yBAAM,IAAI,OAAO,KAAK,gBAAgB,IAAI,IAAI,CAAC,qBAAqB,EAAE,CAAC;wBACtE,IAAI,CAAC,iBAAiB,EAAE,CAAC;wBACzB,MAAM,CAAC,uBAAuB,EAAE,CAAC;oBACnC,CAAC;gBACH,CAAC;gBAGD,KAAK,MAAM,SAAS,IAAI,IAAI,CAAC,aAAa,EAAE,EAAE,CAAC;oBAC7C,MAAM,eAAe,GAAG,0BAA0B,CAChD,SAAS,EACT,IAAI,EACJ,qBAAqB,CACtB,CAAC;oBACF,MAAM,CAAC,kBAAkB,IAAI,eAAe,CAAC,kBAAkB,CAAC;oBAChE,MAAM,CAAC,iBAAiB,IAAI,eAAe,CAAC,iBAAiB,CAAC;oBAC9D,MAAM,CAAC,aAAa,IAAI,eAAe,CAAC,aAAa,CAAC;oBACtD,MAAM,CAAC,uBAAuB,IAAI,eAAe,CAAC,uBAAuB,CAAC;gBAC5E,CAAC;gBAID,IAAI,IAAI,CAAC,mBAAmB,EAAE,EAAE,CAAC;oBAC/B,MAAM,UAAU,GAAG,IAAI,CAAC,mBAAmB,EAAE,CAAC;oBAC9C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;wBAC3C,MAAM,IAAI,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;wBAC3B,IAAI,IAAI,EAAE,CAAC;4BACT,MAAM,UAAU,GAAG,qBAAqB,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;4BACnD,IAAI,UAAU,KAAK,IAAI,CAAC,GAAG,EAAE,CAAC;gCAC5B,IAAI,CAAC,sBAAsB,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;gCAG3C,MAAM,CAAC,uBAAuB,EAAE,CAAC;gCACjC,MAAM,CAAC,KAAK,CAAC,wCAAwC,EAAE;oCACrD,IAAI,EAAE,IAAI,CAAC,IAAI;oCACf,QAAQ,EAAE,IAAI,CAAC,QAAQ;oCACvB,cAAc,EAAE,IAAI,CAAC,GAAG,CAAC,MAAM;oCAC/B,aAAa,EAAE,UAAU,CAAC,MAAM;iCACjC,CAAC,CAAC;4BACL,CAAC;wBACH,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAGD,MAAM,mBAAmB,GAAG,GAAG,CAAC,sBAAsB,EAAE,CAAC;IACzD,IAAI,mBAAmB,EAAE,CAAC;QACxB,MAAM,OAAO,GAAG,mBAAmB,CAAC,aAAa,EAAE,CAAC;QACpD,KAAK,MAAM,WAAW,IAAI,OAAO,EAAE,CAAC;YAClC,MAAM,QAAQ,GAAG,WAAW,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC;YAClD,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;gBAE/B,IAAI,OAAO,YAAY,wBAAS,EAAE,CAAC;oBACjC,MAAM,eAAe,GAAG,0BAA0B,CAAC,OAAO,EAAE,IAAI,EAAE,qBAAqB,CAAC,CAAC;oBACzF,MAAM,CAAC,kBAAkB,IAAI,eAAe,CAAC,kBAAkB,CAAC;oBAChE,MAAM,CAAC,iBAAiB,IAAI,eAAe,CAAC,iBAAiB,CAAC;oBAC9D,MAAM,CAAC,aAAa,IAAI,eAAe,CAAC,aAAa,CAAC;oBACtD,MAAM,CAAC,uBAAuB,IAAI,eAAe,CAAC,uBAAuB,CAAC;gBAC5E,CAAC;qBAAM,IAAI,OAAO,YAAY,gBAAK,EAAE,CAAC;oBAEpC,KAAK,MAAM,GAAG,IAAI,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC;wBACpC,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,QAAQ,EAAE,EAAE,CAAC;4BAClC,KAAK,MAAM,SAAS,IAAI,IAAI,CAAC,aAAa,EAAE,EAAE,CAAC;gCAC7C,MAAM,eAAe,GAAG,0BAA0B,CAChD,SAAS,EACT,IAAI,EACJ,qBAAqB,CACtB,CAAC;gCACF,MAAM,CAAC,kBAAkB,IAAI,eAAe,CAAC,kBAAkB,CAAC;gCAChE,MAAM,CAAC,iBAAiB,IAAI,eAAe,CAAC,iBAAiB,CAAC;gCAC9D,MAAM,CAAC,aAAa,IAAI,eAAe,CAAC,aAAa,CAAC;gCACtD,MAAM,CAAC,uBAAuB,IAAI,eAAe,CAAC,uBAAuB,CAAC;4BAC5E,CAAC;4BAED,IAAI,IAAI,CAAC,mBAAmB,EAAE,EAAE,CAAC;gCAC/B,MAAM,UAAU,GAAG,IAAI,CAAC,mBAAmB,EAAE,CAAC;gCAC9C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oCAC3C,MAAM,IAAI,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;oCAC3B,IAAI,IAAI,EAAE,CAAC;wCACT,MAAM,UAAU,GAAG,qBAAqB,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;wCACnD,IAAI,UAAU,KAAK,IAAI,CAAC,GAAG,EAAE,CAAC;4CAC5B,IAAI,CAAC,sBAAsB,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;4CAC3C,MAAM,CAAC,uBAAuB,EAAE,CAAC;wCACnC,CAAC;oCACH,CAAC;gCACH,CAAC;4BACH,CAAC;wBACH,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAGD,MAAM,OAAO,GAAG,mBAAmB,CAAC,aAAa,EAAE,CAAC;QACpD,KAAK,MAAM,WAAW,IAAI,OAAO,EAAE,CAAC;YAClC,MAAM,QAAQ,GAAG,WAAW,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC;YAClD,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;gBAE/B,IAAI,OAAO,YAAY,wBAAS,EAAE,CAAC;oBACjC,MAAM,eAAe,GAAG,0BAA0B,CAAC,OAAO,EAAE,IAAI,EAAE,qBAAqB,CAAC,CAAC;oBACzF,MAAM,CAAC,kBAAkB,IAAI,eAAe,CAAC,kBAAkB,CAAC;oBAChE,MAAM,CAAC,iBAAiB,IAAI,eAAe,CAAC,iBAAiB,CAAC;oBAC9D,MAAM,CAAC,aAAa,IAAI,eAAe,CAAC,aAAa,CAAC;oBACtD,MAAM,CAAC,uBAAuB,IAAI,eAAe,CAAC,uBAAuB,CAAC;gBAC5E,CAAC;qBAAM,IAAI,OAAO,YAAY,gBAAK,EAAE,CAAC;oBAEpC,KAAK,MAAM,GAAG,IAAI,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC;wBACpC,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,QAAQ,EAAE,EAAE,CAAC;4BAClC,KAAK,MAAM,SAAS,IAAI,IAAI,CAAC,aAAa,EAAE,EAAE,CAAC;gCAC7C,MAAM,eAAe,GAAG,0BAA0B,CAChD,SAAS,EACT,IAAI,EACJ,qBAAqB,CACtB,CAAC;gCACF,MAAM,CAAC,kBAAkB,IAAI,eAAe,CAAC,kBAAkB,CAAC;gCAChE,MAAM,CAAC,iBAAiB,IAAI,eAAe,CAAC,iBAAiB,CAAC;gCAC9D,MAAM,CAAC,aAAa,IAAI,eAAe,CAAC,aAAa,CAAC;gCACtD,MAAM,CAAC,uBAAuB,IAAI,eAAe,CAAC,uBAAuB,CAAC;4BAC5E,CAAC;4BAED,IAAI,IAAI,CAAC,mBAAmB,EAAE,EAAE,CAAC;gCAC/B,MAAM,UAAU,GAAG,IAAI,CAAC,mBAAmB,EAAE,CAAC;gCAC9C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oCAC3C,MAAM,IAAI,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;oCAC3B,IAAI,IAAI,EAAE,CAAC;wCACT,MAAM,UAAU,GAAG,qBAAqB,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;wCACnD,IAAI,UAAU,KAAK,IAAI,CAAC,GAAG,EAAE,CAAC;4CAC5B,IAAI,CAAC,sBAAsB,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;4CAC3C,MAAM,CAAC,uBAAuB,EAAE,CAAC;wCACnC,CAAC;oCACH,CAAC;gCACH,CAAC;4BACH,CAAC;wBACH,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAWD,MAAM,eAAe,GAAG,GAAG,CAAC,kBAAkB,EAAE,EAAE,CAAC;IACnD,IAAI,eAAe,EAAE,CAAC;QACpB,KAAK,MAAM,EAAE,IAAI,eAAe,CAAC,eAAe,EAAE,EAAE,CAAC;YACnD,KAAK,MAAM,SAAS,IAAI,EAAE,CAAC,aAAa,EAAE,EAAE,CAAC;gBAC3C,MAAM,eAAe,GAAG,0BAA0B,CAAC,SAAS,EAAE,IAAI,EAAE,qBAAqB,CAAC,CAAC;gBAC3F,MAAM,CAAC,kBAAkB,IAAI,eAAe,CAAC,kBAAkB,CAAC;gBAChE,MAAM,CAAC,iBAAiB,IAAI,eAAe,CAAC,iBAAiB,CAAC;gBAC9D,MAAM,CAAC,aAAa,IAAI,eAAe,CAAC,aAAa,CAAC;gBACtD,MAAM,CAAC,uBAAuB,IAAI,eAAe,CAAC,uBAAuB,CAAC;YAC5E,CAAC;QACH,CAAC;IACH,CAAC;IACD,MAAM,cAAc,GAAG,GAAG,CAAC,iBAAiB,EAAE,EAAE,CAAC;IACjD,IAAI,cAAc,EAAE,CAAC;QACnB,KAAK,MAAM,EAAE,IAAI,cAAc,CAAC,cAAc,EAAE,EAAE,CAAC;YACjD,KAAK,MAAM,SAAS,IAAI,EAAE,CAAC,aAAa,EAAE,EAAE,CAAC;gBAC3C,MAAM,eAAe,GAAG,0BAA0B,CAAC,SAAS,EAAE,IAAI,EAAE,qBAAqB,CAAC,CAAC;gBAC3F,MAAM,CAAC,kBAAkB,IAAI,eAAe,CAAC,kBAAkB,CAAC;gBAChE,MAAM,CAAC,iBAAiB,IAAI,eAAe,CAAC,iBAAiB,CAAC;gBAC9D,MAAM,CAAC,aAAa,IAAI,eAAe,CAAC,aAAa,CAAC;gBACtD,MAAM,CAAC,uBAAuB,IAAI,eAAe,CAAC,uBAAuB,CAAC;YAC5E,CAAC;QACH,CAAC;IACH,CAAC;IAGD,IAAI,IAAI,CAAC,qBAAqB,EAAE,CAAC;QAC/B,MAAM,OAAO,GAAG,GAAG,CAAC,UAAU,EAAE,CAAC;QACjC,IAAI,OAAO,EAAE,eAAe,EAAE,EAAE,CAAC;YAC/B,OAAO,CAAC,iBAAiB,EAAE,CAAC;YAC5B,MAAM,CAAC,uBAAuB,EAAE,CAAC;QACnC,CAAC;IACH,CAAC;IAGD,MAAM,eAAe,GAAG,GAAG,CAAC,kBAAkB,EAAE,CAAC;IACjD,IAAI,eAAe,EAAE,CAAC;QACpB,eAAe,CAAC,KAAK,EAAE,CAAC;IAC1B,CAAC;IAGD,GAAG,CAAC,mBAAmB,EAAE,CAAC;IAK1B,IAAI,qBAAqB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACrC,+BAA+B,CAAC,GAAG,EAAE,IAAI,GAAG,CAAC,qBAAqB,CAAC,CAAC,CAAC;IACvE,CAAC;IAKD,IAAI,IAAI,CAAC,kBAAkB,EAAE,CAAC;QAC5B,MAAM,CAAC,kBAAkB,GAAG,kBAAkB,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;IAC9D,CAAC;IAED,MAAM,CAAC,aAAa;QAClB,MAAM,CAAC,kBAAkB;YACzB,MAAM,CAAC,iBAAiB;YACxB,MAAM,CAAC,aAAa;YACpB,MAAM,CAAC,uBAAuB,CAAC;IAEjC,MAAM,CAAC,IAAI,CAAC,8BAA8B,EAAE;QAC1C,UAAU,EAAE,MAAM,CAAC,kBAAkB;QACrC,SAAS,EAAE,MAAM,CAAC,iBAAiB;QACnC,KAAK,EAAE,MAAM,CAAC,aAAa;QAC3B,eAAe,EAAE,MAAM,CAAC,uBAAuB;QAC/C,KAAK,EAAE,MAAM,CAAC,aAAa;QAC3B,kBAAkB,EAAE,MAAM,CAAC,kBAAkB;KAC9C,CAAC,CAAC;IAEH,OAAO,MAAM,CAAC;AAChB,CAAC;AAgBD,SAAS,0BAA0B,CACjC,SAAoB,EACpB,OAAyC,EACzC,qBAAmC;IAEnC,MAAM,MAAM,GAA0B;QACpC,kBAAkB,EAAE,CAAC;QACrB,iBAAiB,EAAE,CAAC;QACpB,aAAa,EAAE,CAAC;QAChB,uBAAuB,EAAE,CAAC;QAC1B,aAAa,EAAE,CAAC;QAChB,kBAAkB,EAAE,CAAC;KACtB,CAAC;IAEF,MAAM,OAAO,GAAG,SAAS,CAAC,UAAU,EAAE,CAAC;IACvC,MAAM,UAAU,GAAuB,EAAE,CAAC;IAE1C,KAAK,MAAM,IAAI,IAAI,OAAO,EAAE,CAAC;QAC3B,IAAI,IAAI,YAAY,sBAAQ,EAAE,CAAC;YAC7B,MAAM,YAAY,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC;YAGpC,IAAI,YAAY,KAAK,QAAQ,IAAI,OAAO,CAAC,gBAAgB,EAAE,CAAC;gBAE1D,MAAM,YAAY,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC;gBACvC,KAAK,MAAM,KAAK,IAAI,YAAY,EAAE,CAAC;oBAEjC,IAAI,IAAA,sCAAiB,EAAC,KAAK,CAAC,EAAE,CAAC;wBAC7B,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;oBACzB,CAAC;yBAAM,IAAI,IAAA,iCAAY,EAAC,KAAK,CAAC,EAAE,CAAC;wBAC/B,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;oBACzB,CAAC;yBAAM,IAAI,IAAA,uCAAkB,EAAC,KAAK,CAAC,EAAE,CAAC;wBACrC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;oBACzB,CAAC;gBACH,CAAC;gBACD,MAAM,CAAC,kBAAkB,EAAE,CAAC;gBAC5B,SAAS;YACX,CAAC;YAGD,IAAI,YAAY,KAAK,QAAQ,IAAI,OAAO,CAAC,eAAe,EAAE,CAAC;gBAEzD,MAAM,CAAC,iBAAiB,EAAE,CAAC;gBAC3B,SAAS;YACX,CAAC;YAGD,IAAI,YAAY,KAAK,UAAU,IAAI,OAAO,CAAC,WAAW,EAAE,CAAC;gBAEvD,MAAM,CAAC,aAAa,EAAE,CAAC;gBACvB,SAAS;YACX,CAAC;YAGD,IAAI,YAAY,KAAK,QAAQ,IAAI,OAAO,CAAC,WAAW,EAAE,CAAC;gBAErD,MAAM,YAAY,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC;gBACvC,KAAK,MAAM,KAAK,IAAI,YAAY,EAAE,CAAC;oBAEjC,IAAI,IAAA,sCAAiB,EAAC,KAAK,CAAC,EAAE,CAAC;wBAC7B,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;oBACzB,CAAC;yBAAM,IAAI,IAAA,iCAAY,EAAC,KAAK,CAAC,EAAE,CAAC;wBAC/B,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;oBACzB,CAAC;yBAAM,IAAI,IAAA,uCAAkB,EAAC,KAAK,CAAC,EAAE,CAAC;wBACrC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;oBACzB,CAAC;gBACH,CAAC;gBACD,MAAM,CAAC,aAAa,EAAE,CAAC;gBACvB,SAAS;YACX,CAAC;YAGD,IAAI,uBAAuB,CAAC,QAAQ,CAAC,YAAY,CAAC,IAAI,OAAO,CAAC,qBAAqB,EAAE,CAAC;gBAKpF,MAAM,YAAY,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC;gBACvC,KAAK,MAAM,KAAK,IAAI,YAAY,EAAE,CAAC;oBAEjC,IAAI,IAAA,sCAAiB,EAAC,KAAK,CAAC,EAAE,CAAC;wBAC7B,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;oBACzB,CAAC;yBAAM,IAAI,IAAA,iCAAY,EAAC,KAAK,CAAC,EAAE,CAAC;wBAC/B,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;oBACzB,CAAC;yBAAM,IAAI,IAAA,uCAAkB,EAAC,KAAK,CAAC,EAAE,CAAC;wBACrC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;oBACzB,CAAC;gBACH,CAAC;gBACD,MAAM,CAAC,uBAAuB,EAAE,CAAC;gBACjC,SAAS;YACX,CAAC;YAID,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACxB,CAAC;aAAM,IAAI,IAAI,YAAY,uBAAY,IAAI,IAAI,CAAC,kBAAkB,EAAE,EAAE,CAAC;YAErE,MAAM,cAAc,GAAG,IAAI,CAAC,kBAAkB,EAAE,CAAC;YACjD,MAAM,eAAe,GAAe,EAAE,CAAC;YAEvC,KAAK,MAAM,GAAG,IAAI,cAAc,EAAE,CAAC;gBACjC,MAAM,OAAO,GAAG,GAAG,CAAC,OAAO,EAAE,CAAC;gBAC9B,IAAI,OAAO,KAAK,QAAQ,IAAI,OAAO,CAAC,gBAAgB,EAAE,CAAC;oBACrD,MAAM,CAAC,kBAAkB,EAAE,CAAC;gBAC9B,CAAC;qBAAM,IAAI,OAAO,KAAK,QAAQ,IAAI,OAAO,CAAC,eAAe,EAAE,CAAC;oBAC3D,MAAM,CAAC,iBAAiB,EAAE,CAAC;gBAC7B,CAAC;qBAAM,IAAI,OAAO,KAAK,QAAQ,IAAI,OAAO,CAAC,WAAW,EAAE,CAAC;oBACvD,MAAM,CAAC,aAAa,EAAE,CAAC;gBACzB,CAAC;qBAAM,IAAI,OAAO,KAAK,UAAU,IAAI,OAAO,CAAC,WAAW,EAAE,CAAC;oBACzD,MAAM,CAAC,aAAa,EAAE,CAAC;gBACzB,CAAC;qBAAM,CAAC;oBACN,eAAe,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBAC5B,CAAC;YACH,CAAC;YAED,IAAI,eAAe,CAAC,MAAM,GAAG,cAAc,CAAC,MAAM,EAAE,CAAC;gBAEnD,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,qBAAqB,EAAE,CAAC,CAAC;gBAC7C,IAAI,eAAe,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBAC/B,IAAI,CAAC,kBAAkB,CAAC,eAAe,CAAC,CAAC;gBAC3C,CAAC;YACH,CAAC;YACD,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACxB,CAAC;aAAM,IAAI,IAAI,YAAY,4BAAW,EAAE,CAAC;YAKvC,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC;YAClC,IACE,CAAC,OAAO,CAAC,WAAW,IAAI,uBAAuB,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;gBAChE,CAAC,OAAO,CAAC,gBAAgB,IAAI,sBAAsB,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;gBACpE,CAAC,OAAO,CAAC,eAAe,IAAI,sBAAsB,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,EACnE,CAAC;gBACD,SAAS;YACX,CAAC;YACD,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACxB,CAAC;aAAM,CAAC;YAEN,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACxB,CAAC;IACH,CAAC;IAGD,SAAS,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC;IAIjC,IAAI,OAAO,CAAC,qBAAqB,EAAE,CAAC;QAClC,MAAM,UAAU,GAAG,SAAS,CAAC,aAAa,EAAE,CAAC;QAC7C,IAAI,UAAU,CAAC,SAAS,EAAE,CAAC;YACzB,SAAS,CAAC,8BAA8B,EAAE,CAAC;YAC3C,MAAM,CAAC,uBAAuB,EAAE,CAAC;QACnC,CAAC;QAID,IAAI,UAAU,CAAC,gCAAgC,EAAE,CAAC;YAChD,SAAS,CAAC,UAAU,CAAC,gCAAgC,GAAG,SAAS,CAAC;YAClE,MAAM,CAAC,uBAAuB,EAAE,CAAC;QACnC,CAAC;IACH,CAAC;IAQD,IAAI,OAAO,CAAC,eAAe,EAAE,CAAC;QAC5B,MAAM,UAAU,GAAG,SAAS,CAAC,aAAa,EAAE,CAAC;QAC7C,IAAI,UAAU,CAAC,qBAAqB,EAAE,CAAC;YACrC,SAAS,CAAC,0BAA0B,EAAE,CAAC;YACvC,MAAM,CAAC,iBAAiB,EAAE,CAAC;YAC3B,qBAAqB,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;QACzC,CAAC;IACH,CAAC;IAID,IAAI,OAAO,CAAC,gBAAgB,EAAE,CAAC;QAC7B,MAAM,UAAU,GAAG,SAAS,CAAC,aAAa,EAAE,CAAC;QAC7C,IAAI,UAAU,CAAC,sBAAsB,EAAE,CAAC;YACtC,SAAS,CAAC,2BAA2B,EAAE,CAAC;YACxC,MAAM,CAAC,kBAAkB,EAAE,CAAC;QAC9B,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAkBD,SAAgB,+BAA+B,CAAC,GAAa,EAAE,MAAsB;IACnF,IAAI,MAAM,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;QACtB,OAAO;IACT,CAAC;IAGD,mBAAmB,CAAC,GAAG,CAAC,eAAe,EAAE,EAAE,MAAM,EAAE,CAAC,IAAI,EAAE,EAAE;QAC1D,GAAG,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;IAC1B,CAAC,CAAC,CAAC;IAGH,KAAK,MAAM,KAAK,IAAI,GAAG,CAAC,SAAS,EAAE,EAAE,CAAC;QACpC,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;YAClC,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,QAAQ,EAAE,EAAE,CAAC;gBAMlC,MAAM,iBAAiB,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,mBAAmB,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;gBAC3F,mBAAmB,CACjB,IAAI,CAAC,aAAa,EAAE,EACpB,MAAM,EACN,CAAC,IAAI,EAAE,EAAE;oBACP,MAAM,KAAK,GAAG,IAAI,CAAC,aAAa,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;oBACjD,IAAI,KAAK,KAAK,CAAC,CAAC,EAAE,CAAC;wBACjB,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC;oBAC9B,CAAC;gBACH,CAAC,EACD,CAAC,KAAK,EAAE,EAAE,CAAC,iBAAiB,CAAC,GAAG,CAAC,KAAK,CAAC,CACxC,CAAC;YACJ,CAAC;QACH,CAAC;IACH,CAAC;AACH,CAAC;AAUD,SAAS,mBAAmB,CAC1B,QAA4B,EAC5B,MAAsB,EACtB,eAA+C,EAC/C,aAA0C;IAE1C,IAAI,KAAK,GAAgB,EAAE,CAAC;IAE5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,MAAM,OAAO,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;QAE5B,IAAI,CAAC,CAAC,OAAO,YAAY,wBAAS,CAAC,EAAE,CAAC;YAEpC,KAAK,GAAG,EAAE,CAAC;YACX,SAAS;QACX,CAAC;QAED,IAAI,aAAa,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACvB,KAAK,GAAG,EAAE,CAAC;QACb,CAAC;QAED,IAAI,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;YACxB,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACpB,SAAS;QACX,CAAC;QAED,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACrB,MAAM,SAAS,GAAuB,EAAE,CAAC;YACzC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,SAAS,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC;YACvC,CAAC;YACD,OAAO,CAAC,UAAU,CAAC,CAAC,GAAG,SAAS,EAAE,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;YAC5D,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBAGzB,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;gBACpB,eAAe,CAAC,IAAI,CAAC,CAAC;YACxB,CAAC;YACD,KAAK,GAAG,EAAE,CAAC;QACb,CAAC;IACH,CAAC;AAGH,CAAC;AAKD,SAAgB,qBAAqB,CAAC,SAAoB;IACxD,MAAM,OAAO,GAAG,SAAS,CAAC,UAAU,EAAE,CAAC;IACvC,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,YAAY,sBAAQ,CAAC,EAAE,CAAC;QACrD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,MAAM,UAAU,GAAG,SAAS,CAAC,aAAa,EAAE,CAAC;IAC7C,IAAI,UAAU,CAAC,qBAAqB,IAAI,UAAU,CAAC,sBAAsB,EAAE,CAAC;QAC1E,OAAO,IAAI,CAAC;IACd,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAKD,SAAgB,yBAAyB,CAAC,SAAoB;IAC5D,MAAM,OAAO,GAAG,SAAS,CAAC,UAAU,EAAE,CAAC;IACvC,OAAO,OAAO,CAAC,MAAM,CAAC,CAAC,IAAI,EAAoB,EAAE,CAAC,IAAI,YAAY,sBAAQ,CAAC,CAAC;AAC9E,CAAC;AAKD,SAAgB,oBAAoB,CAAC,GAAa;IAChD,MAAM,MAAM,GAAG,IAAI,GAAG,EAAwB,CAAC;IAE/C,MAAM,UAAU,GAAG,GAAG,CAAC,gBAAgB,EAAE,CAAC;IAC1C,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;QACnC,MAAM,SAAS,GAAG,yBAAyB,CAAC,SAAS,CAAC,CAAC;QACvD,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;YACjC,MAAM,IAAI,GAAG,QAAQ,CAAC,OAAO,EAAE,CAAC;YAChC,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAChD,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAQD,MAAM,8BAA8B,GAAG,IAAI,GAAG,CAAC;IAC7C,YAAY;IACZ,aAAa;IACb,WAAW;IACX,qBAAqB;IACrB,mBAAmB;CACpB,CAAC,CAAC;AAWH,SAAS,0BAA0B,CAAC,IAAe;IACjD,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACrC,OAAO,IAAI,CAAC;IACd,CAAC;IAED,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,UAAU,EAAE,EAAE,CAAC;QACrC,IAAI,CAAC,IAAI;YAAE,SAAS;QAKpB,IAAI,IAAI,YAAY,sBAAQ,EAAE,CAAC;YAC7B,OAAO,IAAI,CAAC;QACd,CAAC;QAKD,IAAI,IAAI,YAAY,sCAAgB,EAAE,CAAC;YACrC,IAAI,CAAC,8BAA8B,CAAC,GAAG,CAAC,IAAI,CAAC,cAAc,EAAE,CAAC,EAAE,CAAC;gBAC/D,OAAO,IAAI,CAAC;YACd,CAAC;YACD,SAAS;QACX,CAAC;QAKD,MAAM,SAAS,GAAG,IAA0C,CAAC;QAC7D,IACE,OAAO,SAAS,CAAC,eAAe,KAAK,UAAU;YAC/C,OAAO,SAAS,CAAC,YAAY,KAAK,UAAU;YAC5C,OAAO,SAAS,CAAC,cAAc,KAAK,UAAU;YAC9C,OAAO,SAAS,CAAC,MAAM,KAAK,UAAU;YACtC,OAAO,SAAS,CAAC,cAAc,KAAK,UAAU,EAC9C,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAeD,SAAS,kBAAkB,CAAC,GAAa,EAAE,MAAe;IACxD,MAAM,MAAM,GAAG,GAAG,CAAC,SAAS,EAAE,CAAC;IAC/B,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,MAAM,cAAc,GAAa,EAAE,CAAC;IAEpC,KAAK,IAAI,UAAU,GAAG,CAAC,EAAE,UAAU,GAAG,MAAM,CAAC,MAAM,EAAE,UAAU,EAAE,EAAE,CAAC;QAClE,MAAM,KAAK,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC;QACjC,IAAI,CAAC,KAAK;YAAE,SAAS;QAErB,IAAI,UAAU,GAAG,KAAK,CAAC;QACvB,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,EAAE,CAAC;QAE7B,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,MAAM,KAAK,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAC;YAC7B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBAIzB,IAAI,IAAI,CAAC,mBAAmB,EAAE,EAAE,CAAC;oBAC/B,UAAU,GAAG,IAAI,CAAC;oBAClB,MAAM;gBACR,CAAC;gBACD,MAAM,UAAU,GAAG,IAAI,CAAC,aAAa,EAAE,CAAC;gBACxC,KAAK,MAAM,IAAI,IAAI,UAAU,EAAE,CAAC;oBAC9B,IAAI,0BAA0B,CAAC,IAAI,CAAC,EAAE,CAAC;wBACrC,UAAU,GAAG,IAAI,CAAC;wBAClB,MAAM;oBACR,CAAC;gBACH,CAAC;gBACD,IAAI,UAAU;oBAAE,MAAM;YACxB,CAAC;YACD,IAAI,UAAU;gBAAE,MAAM;QACxB,CAAC;QAED,IAAI,CAAC,UAAU,EAAE,CAAC;YAEhB,cAAc,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YAChC,MAAM,CAAC,KAAK,CAAC,+BAA+B,EAAE,EAAE,UAAU,EAAE,CAAC,CAAC;QAChE,CAAC;IACH,CAAC;IAGD,KAAK,IAAI,CAAC,GAAG,cAAc,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACpD,MAAM,UAAU,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;QACrC,IAAI,UAAU,KAAK,SAAS,IAAI,GAAG,CAAC,WAAW,CAAC,UAAU,CAAC,EAAE,CAAC;YAC5D,YAAY,EAAE,CAAC;YACf,MAAM,CAAC,KAAK,CAAC,qBAAqB,EAAE,EAAE,UAAU,EAAE,CAAC,CAAC;QACtD,CAAC;IACH,CAAC;IAED,IAAI,YAAY,GAAG,CAAC,EAAE,CAAC;QACrB,MAAM,CAAC,IAAI,CAAC,8BAA8B,EAAE,EAAE,aAAa,EAAE,YAAY,EAAE,CAAC,CAAC;IAC/E,CAAC;IAED,OAAO,YAAY,CAAC;AACtB,CAAC","sourcesContent":["/**\n * InMemoryRevisionAcceptor - Accept revisions by transforming the in-memory object model\n *\n * This approach follows the industry standard (OpenXML PowerTools, Aspose.Words):\n * - Transforms Revision objects in paragraph.content[] to their \"accepted\" state\n * - For insertions: Unwrap - extract child Runs/Hyperlinks into parent paragraph\n * - For deletions: Remove - delete the revision and its content from the model\n * - For property changes: Remove the change metadata, keep the current formatting\n *\n * Unlike the raw XML approach (acceptRevisions.ts), this allows subsequent modifications\n * to the in-memory model to be correctly serialized on save().\n *\n * @see https://github.com/OfficeDev/Open-Xml-PowerTools - RevisionAccepter.cs\n * @see https://learn.microsoft.com/en-us/previous-versions/office/developer/office-2007/ee836138(v=office.12)\n */\n\nimport type { Document } from '../core/Document.js';\nimport { Paragraph } from '../elements/Paragraph.js';\nimport type { ParagraphContent } from '../elements/Paragraph.js';\nimport { Revision, RevisionType } from '../elements/Revision.js';\nimport {\n  isRunContent,\n  isHyperlinkContent,\n  isImageRunContent,\n} from '../elements/RevisionContent.js';\nimport { ComplexField } from '../elements/Field.js';\nimport { RangeMarker, RangeMarkerType } from '../elements/RangeMarker.js';\nimport { PreservedElement } from '../elements/PreservedElement.js';\nimport { Table } from '../elements/Table.js';\nimport { getGlobalLogger, createScopedLogger, ILogger } from '../utils/logger.js';\n\n/**\n * Get scoped logger for this module\n */\nfunction getLogger(): ILogger {\n  return createScopedLogger(getGlobalLogger(), 'InMemoryRevisionAcceptor');\n}\n\n/**\n * Options for accepting revisions\n */\nexport interface AcceptRevisionsOptions {\n  /** Accept insertion revisions (w:ins) - default: true */\n  acceptInsertions?: boolean;\n  /** Accept deletion revisions (w:del) - default: true */\n  acceptDeletions?: boolean;\n  /** Accept move operations (w:moveFrom, w:moveTo) - default: true */\n  acceptMoves?: boolean;\n  /** Accept property change revisions (rPrChange, pPrChange, etc.) - default: true */\n  acceptPropertyChanges?: boolean;\n  /** Remove empty tables after revision acceptance - default: true */\n  cleanupEmptyTables?: boolean;\n}\n\n/**\n * Result of accepting revisions\n */\nexport interface AcceptRevisionsResult {\n  /** Number of insertions accepted */\n  insertionsAccepted: number;\n  /** Number of deletions accepted */\n  deletionsAccepted: number;\n  /** Number of move operations accepted */\n  movesAccepted: number;\n  /** Number of property changes accepted */\n  propertyChangesAccepted: number;\n  /** Total revisions processed */\n  totalAccepted: number;\n  /** Number of empty tables removed during cleanup */\n  emptyTablesRemoved: number;\n}\n\n/**\n * Revision types that represent property/formatting changes\n */\nconst PROPERTY_REVISION_TYPES: RevisionType[] = [\n  'runPropertiesChange',\n  'paragraphPropertiesChange',\n  'tablePropertiesChange',\n  'tableExceptionPropertiesChange',\n  'tableRowPropertiesChange',\n  'tableCellPropertiesChange',\n  'sectionPropertiesChange',\n  'numberingChange',\n];\n\n/**\n * Range-marker boundary types dropped when the matching accept option is set.\n * These are paired boundaries for the move / ins / del revisions handled\n * elsewhere in the loop; once the revision they delimit is accepted, the\n * markers reference a change that no longer exists (ECMA-376 §17.13.5.21-28)\n * and Word still reports the document as containing tracked changes. The\n * raw-XML acceptor (acceptRevisions.ts) and stripRevisionsFromXml remove the\n * same set; this keeps the in-memory paragraph path in parity.\n */\nconst MOVE_RANGE_MARKER_TYPES = new Set<RangeMarkerType>([\n  'moveFromRangeStart',\n  'moveFromRangeEnd',\n  'moveToRangeStart',\n  'moveToRangeEnd',\n  'customXmlMoveFromRangeStart',\n  'customXmlMoveFromRangeEnd',\n  'customXmlMoveToRangeStart',\n  'customXmlMoveToRangeEnd',\n]);\nconst INS_RANGE_MARKER_TYPES = new Set<RangeMarkerType>([\n  'customXmlInsRangeStart',\n  'customXmlInsRangeEnd',\n]);\nconst DEL_RANGE_MARKER_TYPES = new Set<RangeMarkerType>([\n  'customXmlDelRangeStart',\n  'customXmlDelRangeEnd',\n]);\n\n/**\n * Strip revision markup from raw XML string.\n * Used for nested tables stored as raw XML that cannot be processed via the in-memory model.\n *\n * Follows the same rules as the main revision acceptor:\n * - Insertions: Keep content, remove wrapper tags\n * - Deletions: Remove entirely (content and tags)\n * - MoveFrom: Remove entirely (source of move)\n * - MoveTo: Keep content, remove wrapper\n * - Property changes: Remove change tracking elements\n * - Range markers: Remove boundary markers\n *\n * @param xml - Raw XML string containing revision markup\n * @returns Cleaned XML with revisions accepted\n */\nexport function stripRevisionsFromXml(xml: string): string {\n  let result = xml;\n\n  // Step 1: Remove range markers (must be done first)\n  const rangePatterns = [\n    /<w:moveFromRangeStart[^>]*(?:\\/>|>.*?<\\/w:moveFromRangeStart>)/gs,\n    /<w:moveFromRangeEnd[^>]*(?:\\/>|>.*?<\\/w:moveFromRangeEnd>)/gs,\n    /<w:moveToRangeStart[^>]*(?:\\/>|>.*?<\\/w:moveToRangeStart>)/gs,\n    /<w:moveToRangeEnd[^>]*(?:\\/>|>.*?<\\/w:moveToRangeEnd>)/gs,\n    /<w:customXmlInsRangeStart[^>]*(?:\\/>|>.*?<\\/w:customXmlInsRangeStart>)/gs,\n    /<w:customXmlInsRangeEnd[^>]*(?:\\/>|>.*?<\\/w:customXmlInsRangeEnd>)/gs,\n    /<w:customXmlDelRangeStart[^>]*(?:\\/>|>.*?<\\/w:customXmlDelRangeStart>)/gs,\n    /<w:customXmlDelRangeEnd[^>]*(?:\\/>|>.*?<\\/w:customXmlDelRangeEnd>)/gs,\n  ];\n  for (const pattern of rangePatterns) {\n    result = result.replace(pattern, '');\n  }\n\n  // Step 2: Remove property change elements\n  const propChangePatterns = [\n    /<w:rPrChange[^>]*>[\\s\\S]*?<\\/w:rPrChange>/g,\n    /<w:pPrChange[^>]*>[\\s\\S]*?<\\/w:pPrChange>/g,\n    /<w:tblPrChange[^>]*>[\\s\\S]*?<\\/w:tblPrChange>/g,\n    /<w:tblPrExChange[^>]*>[\\s\\S]*?<\\/w:tblPrExChange>/g,\n    /<w:tcPrChange[^>]*>[\\s\\S]*?<\\/w:tcPrChange>/g,\n    /<w:trPrChange[^>]*>[\\s\\S]*?<\\/w:trPrChange>/g,\n    /<w:sectPrChange[^>]*>[\\s\\S]*?<\\/w:sectPrChange>/g,\n    /<w:tblGridChange[^>]*>[\\s\\S]*?<\\/w:tblGridChange>/g,\n    /<w:numberingChange[^>]*>[\\s\\S]*?<\\/w:numberingChange>/g,\n  ];\n  for (const pattern of propChangePatterns) {\n    result = result.replace(pattern, '');\n  }\n\n  // Step 3: Remove deletions entirely (including content)\n  // Self-closing markers (paragraph-mark deletions in w:pPr/w:rPr per\n  // ECMA-376 §17.13.5.15) must be stripped BEFORE the block pattern runs:\n  // its [^>]* also matches the trailing '/' of `<w:del .../>`, which would\n  // turn the marker into an opening tag and swallow everything up to the\n  // next </w:del>, leaving unbalanced XML.\n  result = result.replace(/<w:del\\b[^>]*\\/>/g, '');\n  // Iterate until no more deletions (handles nested cases)\n  let prevLen = 0;\n  while (result.length !== prevLen) {\n    prevLen = result.length;\n    result = result.replace(/<w:del\\b[^>]*>[\\s\\S]*?<\\/w:del>/g, '');\n  }\n\n  // Step 4: Remove moveFrom entirely (source of moved content)\n  // Same self-closing-first ordering as Step 3.\n  result = result.replace(/<w:moveFrom\\b[^>]*\\/>/g, '');\n  prevLen = 0;\n  while (result.length !== prevLen) {\n    prevLen = result.length;\n    result = result.replace(/<w:moveFrom\\b[^>]*>[\\s\\S]*?<\\/w:moveFrom>/g, '');\n  }\n\n  // Step 5: Unwrap moveTo (keep content, remove wrapper)\n  result = result.replace(/<\\/w:moveTo>/g, '');\n  result = result.replace(/<w:moveTo\\b[^>]*>/g, '');\n\n  // Step 6: Unwrap insertions (keep content, remove wrapper)\n  result = result.replace(/<\\/w:ins>/g, '');\n  result = result.replace(/<w:ins\\b[^>]*>/g, '');\n\n  // Step 7: Clean up orphaned tags\n  result = result.replace(/<w:ins\\b[^>]*\\/>/g, '');\n  result = result.replace(/<w:del\\b[^>]*\\/>/g, '');\n  result = result.replace(/<w:moveFrom\\b[^>]*\\/>/g, '');\n  result = result.replace(/<w:moveTo\\b[^>]*\\/>/g, '');\n\n  return result;\n}\n\n/**\n * Accept all revisions in the document by transforming the in-memory model.\n *\n * This is the industry-standard approach used by OpenXML PowerTools, Aspose.Words,\n * and other production DOCX libraries. It allows subsequent modifications to the\n * document to work correctly.\n *\n * @param doc - Document to process\n * @param options - Options for which revision types to accept\n * @returns Result with counts of accepted revisions\n */\nexport function acceptRevisionsInMemory(\n  doc: Document,\n  options: AcceptRevisionsOptions = {}\n): AcceptRevisionsResult {\n  const logger = getLogger();\n  const opts: Required<AcceptRevisionsOptions> = {\n    acceptInsertions: options.acceptInsertions ?? true,\n    acceptDeletions: options.acceptDeletions ?? true,\n    acceptMoves: options.acceptMoves ?? true,\n    acceptPropertyChanges: options.acceptPropertyChanges ?? true,\n    cleanupEmptyTables: options.cleanupEmptyTables ?? true,\n  };\n\n  const result: AcceptRevisionsResult = {\n    insertionsAccepted: 0,\n    deletionsAccepted: 0,\n    movesAccepted: 0,\n    propertyChangesAccepted: 0,\n    totalAccepted: 0,\n    emptyTablesRemoved: 0,\n  };\n\n  logger.info('Accepting revisions in-memory', { options: opts });\n\n  // Paragraphs whose tracked paragraph-mark deletion (w:del in w:pPr/w:rPr)\n  // is accepted — they must be merged into their following sibling after the\n  // walk completes (ECMA-376 §17.13.5.15).\n  const acceptedMarkDeletions: Paragraph[] = [];\n\n  // Validate move pairs before accepting if moves are being accepted\n  // Orphaned moves could result in content loss (moveFrom without moveTo = content deleted)\n  if (opts.acceptMoves) {\n    const revisionManager = doc.getRevisionManager();\n    if (revisionManager) {\n      const movePairValidation = revisionManager.validateMovePairs();\n      if (!movePairValidation.valid) {\n        if (movePairValidation.orphanedMoveFrom.length > 0) {\n          logger.warn(\n            'Orphaned moveFrom revisions detected - accepting these will DELETE content permanently ' +\n              '(content was moved from here but no moveTo destination exists)',\n            { orphanedMoveIds: movePairValidation.orphanedMoveFrom }\n          );\n        }\n        if (movePairValidation.orphanedMoveTo.length > 0) {\n          logger.warn(\n            'Orphaned moveTo revisions detected - content may be duplicated ' +\n              '(content moved to here but no moveFrom source exists)',\n            { orphanedMoveIds: movePairValidation.orphanedMoveTo }\n          );\n        }\n      }\n    }\n  }\n\n  // Process all paragraphs in the document body\n  const paragraphs = doc.getAllParagraphs();\n  for (const paragraph of paragraphs) {\n    const paragraphResult = acceptRevisionsInParagraph(paragraph, opts, acceptedMarkDeletions);\n    result.insertionsAccepted += paragraphResult.insertionsAccepted;\n    result.deletionsAccepted += paragraphResult.deletionsAccepted;\n    result.movesAccepted += paragraphResult.movesAccepted;\n    result.propertyChangesAccepted += paragraphResult.propertyChangesAccepted;\n  }\n\n  // Process paragraphs in tables and clear table/row/cell property changes\n  const tables = doc.getTables();\n  for (const table of tables) {\n    // Clear tblPrChange on table\n    if (opts.acceptPropertyChanges && table.getTblPrChange()) {\n      table.clearTblPrChange();\n      result.propertyChangesAccepted++;\n    }\n\n    // Row-level tracked ins / del (CT_TrPr: w:ins / w:del per ECMA-376\n    // §17.13.5.19 / §17.13.5.14) — these mark the ENTIRE row as a tracked\n    // insertion or deletion. Previously the acceptor only cleared the\n    // tcPrChange / trPrChange / cellRevision metadata and silently ignored\n    // row-level markers, so deleted rows persisted and inserted rows kept\n    // their pending state. Collect deletion indices up front so we can\n    // splice them out after iteration (reverse order to keep indices stable).\n    const rowsToRemove: number[] = [];\n    const allRows = table.getRows();\n    for (let rowIdx = 0; rowIdx < allRows.length; rowIdx++) {\n      const row = allRows[rowIdx]!;\n      const fmt = row.getFormatting();\n      if (fmt.rowInsertion && opts.acceptInsertions) {\n        row.setRowInsertion(undefined);\n        result.insertionsAccepted++;\n      }\n      if (fmt.rowDeletion && opts.acceptDeletions) {\n        rowsToRemove.push(rowIdx);\n        result.deletionsAccepted++;\n      }\n    }\n    for (let i = rowsToRemove.length - 1; i >= 0; i--) {\n      table._removeRowAtIndex(rowsToRemove[i]!);\n    }\n\n    for (const row of table.getRows()) {\n      // Clear trPrChange on row\n      if (opts.acceptPropertyChanges && row.getTrPrChange()) {\n        row.clearTrPrChange();\n        result.propertyChangesAccepted++;\n      }\n\n      for (const cell of row.getCells()) {\n        // Clear tcPrChange on cell\n        if (opts.acceptPropertyChanges && cell.getTcPrChange()) {\n          cell.clearTcPrChange();\n          result.propertyChangesAccepted++;\n        }\n\n        // Route cellIns / cellDel / cellMerge by their semantic revision type\n        // (per ECMA-376 §17.13.5.4-6). Previously all three were lumped under\n        // `acceptPropertyChanges`, which meant `{ acceptInsertions: true }`\n        // alone never cleared a cellIns marker, and `{ acceptPropertyChanges:\n        // true }` alone cleared everything including insertions. Correct\n        // mapping:\n        //   - tableCellInsert (w:cellIns)   → acceptInsertions\n        //   - tableCellDelete (w:cellDel)   → acceptDeletions\n        //   - tableCellMerge  (w:cellMerge) → acceptPropertyChanges\n        const cellRev = cell.getCellRevision();\n        if (cellRev) {\n          const revType = cellRev.getType();\n          if (revType === 'tableCellInsert' && opts.acceptInsertions) {\n            cell.clearCellRevision();\n            result.insertionsAccepted++;\n          } else if (revType === 'tableCellDelete' && opts.acceptDeletions) {\n            cell.clearCellRevision();\n            result.deletionsAccepted++;\n          } else if (revType === 'tableCellMerge' && opts.acceptPropertyChanges) {\n            cell.clearCellRevision();\n            result.propertyChangesAccepted++;\n          }\n        }\n\n        // Process paragraphs in the cell\n        for (const paragraph of cell.getParagraphs()) {\n          const paragraphResult = acceptRevisionsInParagraph(\n            paragraph,\n            opts,\n            acceptedMarkDeletions\n          );\n          result.insertionsAccepted += paragraphResult.insertionsAccepted;\n          result.deletionsAccepted += paragraphResult.deletionsAccepted;\n          result.movesAccepted += paragraphResult.movesAccepted;\n          result.propertyChangesAccepted += paragraphResult.propertyChangesAccepted;\n        }\n\n        // Process raw nested content (nested tables stored as XML)\n        // These cannot be processed via the in-memory model, so we use XML-based stripping\n        if (cell.hasRawNestedContent()) {\n          const rawContent = cell.getRawNestedContent();\n          for (let i = 0; i < rawContent.length; i++) {\n            const item = rawContent[i];\n            if (item) {\n              const cleanedXml = stripRevisionsFromXml(item.xml);\n              if (cleanedXml !== item.xml) {\n                cell.updateRawNestedContent(i, cleanedXml);\n                // Count revisions stripped from nested content\n                // We can't distinguish types in raw XML, so count as property changes\n                result.propertyChangesAccepted++;\n                logger.debug('Stripped revisions from nested content', {\n                  type: item.type,\n                  position: item.position,\n                  originalLength: item.xml.length,\n                  cleanedLength: cleanedXml.length,\n                });\n              }\n            }\n          }\n        }\n      }\n    }\n  }\n\n  // Process paragraphs in headers\n  const headerFooterManager = doc.getHeaderFooterManager();\n  if (headerFooterManager) {\n    const headers = headerFooterManager.getAllHeaders();\n    for (const headerEntry of headers) {\n      const elements = headerEntry.header.getElements();\n      for (const element of elements) {\n        // Element can be Paragraph or Table - use instanceof for type safety\n        if (element instanceof Paragraph) {\n          const paragraphResult = acceptRevisionsInParagraph(element, opts, acceptedMarkDeletions);\n          result.insertionsAccepted += paragraphResult.insertionsAccepted;\n          result.deletionsAccepted += paragraphResult.deletionsAccepted;\n          result.movesAccepted += paragraphResult.movesAccepted;\n          result.propertyChangesAccepted += paragraphResult.propertyChangesAccepted;\n        } else if (element instanceof Table) {\n          // It's a Table - process its cells\n          for (const row of element.getRows()) {\n            for (const cell of row.getCells()) {\n              for (const paragraph of cell.getParagraphs()) {\n                const paragraphResult = acceptRevisionsInParagraph(\n                  paragraph,\n                  opts,\n                  acceptedMarkDeletions\n                );\n                result.insertionsAccepted += paragraphResult.insertionsAccepted;\n                result.deletionsAccepted += paragraphResult.deletionsAccepted;\n                result.movesAccepted += paragraphResult.movesAccepted;\n                result.propertyChangesAccepted += paragraphResult.propertyChangesAccepted;\n              }\n              // Process raw nested content in header tables\n              if (cell.hasRawNestedContent()) {\n                const rawContent = cell.getRawNestedContent();\n                for (let i = 0; i < rawContent.length; i++) {\n                  const item = rawContent[i];\n                  if (item) {\n                    const cleanedXml = stripRevisionsFromXml(item.xml);\n                    if (cleanedXml !== item.xml) {\n                      cell.updateRawNestedContent(i, cleanedXml);\n                      result.propertyChangesAccepted++;\n                    }\n                  }\n                }\n              }\n            }\n          }\n        }\n      }\n    }\n\n    // Process paragraphs in footers\n    const footers = headerFooterManager.getAllFooters();\n    for (const footerEntry of footers) {\n      const elements = footerEntry.footer.getElements();\n      for (const element of elements) {\n        // Element can be Paragraph or Table - use instanceof for type safety\n        if (element instanceof Paragraph) {\n          const paragraphResult = acceptRevisionsInParagraph(element, opts, acceptedMarkDeletions);\n          result.insertionsAccepted += paragraphResult.insertionsAccepted;\n          result.deletionsAccepted += paragraphResult.deletionsAccepted;\n          result.movesAccepted += paragraphResult.movesAccepted;\n          result.propertyChangesAccepted += paragraphResult.propertyChangesAccepted;\n        } else if (element instanceof Table) {\n          // It's a Table - process its cells\n          for (const row of element.getRows()) {\n            for (const cell of row.getCells()) {\n              for (const paragraph of cell.getParagraphs()) {\n                const paragraphResult = acceptRevisionsInParagraph(\n                  paragraph,\n                  opts,\n                  acceptedMarkDeletions\n                );\n                result.insertionsAccepted += paragraphResult.insertionsAccepted;\n                result.deletionsAccepted += paragraphResult.deletionsAccepted;\n                result.movesAccepted += paragraphResult.movesAccepted;\n                result.propertyChangesAccepted += paragraphResult.propertyChangesAccepted;\n              }\n              // Process raw nested content in footer tables\n              if (cell.hasRawNestedContent()) {\n                const rawContent = cell.getRawNestedContent();\n                for (let i = 0; i < rawContent.length; i++) {\n                  const item = rawContent[i];\n                  if (item) {\n                    const cleanedXml = stripRevisionsFromXml(item.xml);\n                    if (cleanedXml !== item.xml) {\n                      cell.updateRawNestedContent(i, cleanedXml);\n                      result.propertyChangesAccepted++;\n                    }\n                  }\n                }\n              }\n            }\n          }\n        }\n      }\n    }\n  }\n\n  // Walk footnote and endnote paragraphs. Per ECMA-376 §17.11.4 /\n  // §17.11.15, notes can hold any block-level content including\n  // tracked changes; programmatically-added Revision objects on note\n  // paragraphs (e.g.\n  // `footnote.getParagraphs()[0].addContent(new Revision(...))`)\n  // were never visited by the in-memory acceptor and stayed in the\n  // model after `acceptAllRevisions()`. The raw-XML acceptor\n  // (iter 135) already handles existing-document note revisions on\n  // load, so this loop's job is the programmatic-API path.\n  const footnoteManager = doc.getFootnoteManager?.();\n  if (footnoteManager) {\n    for (const fn of footnoteManager.getAllFootnotes()) {\n      for (const paragraph of fn.getParagraphs()) {\n        const paragraphResult = acceptRevisionsInParagraph(paragraph, opts, acceptedMarkDeletions);\n        result.insertionsAccepted += paragraphResult.insertionsAccepted;\n        result.deletionsAccepted += paragraphResult.deletionsAccepted;\n        result.movesAccepted += paragraphResult.movesAccepted;\n        result.propertyChangesAccepted += paragraphResult.propertyChangesAccepted;\n      }\n    }\n  }\n  const endnoteManager = doc.getEndnoteManager?.();\n  if (endnoteManager) {\n    for (const en of endnoteManager.getAllEndnotes()) {\n      for (const paragraph of en.getParagraphs()) {\n        const paragraphResult = acceptRevisionsInParagraph(paragraph, opts, acceptedMarkDeletions);\n        result.insertionsAccepted += paragraphResult.insertionsAccepted;\n        result.deletionsAccepted += paragraphResult.deletionsAccepted;\n        result.movesAccepted += paragraphResult.movesAccepted;\n        result.propertyChangesAccepted += paragraphResult.propertyChangesAccepted;\n      }\n    }\n  }\n\n  // Clear sectPrChange on document section\n  if (opts.acceptPropertyChanges) {\n    const section = doc.getSection();\n    if (section?.getSectPrChange()) {\n      section.clearSectPrChange();\n      result.propertyChangesAccepted++;\n    }\n  }\n\n  // Clear revision manager\n  const revisionManager = doc.getRevisionManager();\n  if (revisionManager) {\n    revisionManager.clear();\n  }\n\n  // Disable track changes setting\n  doc.disableTrackChanges();\n\n  // Combine paragraphs whose paragraph-mark deletion was accepted with their\n  // following sibling (ECMA-376 §17.13.5.15). Runs after tracking is disabled\n  // so the removals are plain splices rather than new tracked deletions.\n  if (acceptedMarkDeletions.length > 0) {\n    mergeParagraphsWithDeletedMarks(doc, new Set(acceptedMarkDeletions));\n  }\n\n  // Cleanup empty tables if enabled\n  // This removes tables that have no visible content after revision acceptance\n  // (e.g., tables where all content was deleted via tracked changes)\n  if (opts.cleanupEmptyTables) {\n    result.emptyTablesRemoved = cleanupEmptyTables(doc, logger);\n  }\n\n  result.totalAccepted =\n    result.insertionsAccepted +\n    result.deletionsAccepted +\n    result.movesAccepted +\n    result.propertyChangesAccepted;\n\n  logger.info('Revisions accepted in-memory', {\n    insertions: result.insertionsAccepted,\n    deletions: result.deletionsAccepted,\n    moves: result.movesAccepted,\n    propertyChanges: result.propertyChangesAccepted,\n    total: result.totalAccepted,\n    emptyTablesRemoved: result.emptyTablesRemoved,\n  });\n\n  return result;\n}\n\n/**\n * Accept revisions in a single paragraph by transforming its content array.\n *\n * The transformation follows these rules:\n * - Insertions (w:ins): Unwrap - extract child content into parent position\n * - Deletions (w:del): Remove - delete revision and its content\n * - MoveFrom (w:moveFrom): Remove - content exists at moveTo destination\n * - MoveTo (w:moveTo): Unwrap - keep content, remove wrapper\n * - Property changes: Remove from model (current formatting is kept)\n *\n * @param paragraph - Paragraph to process\n * @param options - Options for which revision types to accept\n * @returns Result with counts of accepted revisions\n */\nfunction acceptRevisionsInParagraph(\n  paragraph: Paragraph,\n  options: Required<AcceptRevisionsOptions>,\n  acceptedMarkDeletions?: Paragraph[]\n): AcceptRevisionsResult {\n  const result: AcceptRevisionsResult = {\n    insertionsAccepted: 0,\n    deletionsAccepted: 0,\n    movesAccepted: 0,\n    propertyChangesAccepted: 0,\n    totalAccepted: 0,\n    emptyTablesRemoved: 0,\n  };\n\n  const content = paragraph.getContent();\n  const newContent: ParagraphContent[] = [];\n\n  for (const item of content) {\n    if (item instanceof Revision) {\n      const revisionType = item.getType();\n\n      // Handle insertion revisions (w:ins)\n      if (revisionType === 'insert' && options.acceptInsertions) {\n        // Unwrap: Extract child content into parent position\n        const childContent = item.getContent();\n        for (const child of childContent) {\n          // Check ImageRun FIRST since ImageRun extends Run\n          if (isImageRunContent(child)) {\n            newContent.push(child);\n          } else if (isRunContent(child)) {\n            newContent.push(child);\n          } else if (isHyperlinkContent(child)) {\n            newContent.push(child);\n          }\n        }\n        result.insertionsAccepted++;\n        continue;\n      }\n\n      // Handle deletion revisions (w:del)\n      if (revisionType === 'delete' && options.acceptDeletions) {\n        // Remove: Don't add to newContent - content is deleted\n        result.deletionsAccepted++;\n        continue;\n      }\n\n      // Handle moveFrom revisions (source of moved content)\n      if (revisionType === 'moveFrom' && options.acceptMoves) {\n        // Remove: Content exists at moveTo destination\n        result.movesAccepted++;\n        continue;\n      }\n\n      // Handle moveTo revisions (destination of moved content)\n      if (revisionType === 'moveTo' && options.acceptMoves) {\n        // Unwrap: Keep content, remove wrapper\n        const childContent = item.getContent();\n        for (const child of childContent) {\n          // Check ImageRun FIRST since ImageRun extends Run\n          if (isImageRunContent(child)) {\n            newContent.push(child);\n          } else if (isRunContent(child)) {\n            newContent.push(child);\n          } else if (isHyperlinkContent(child)) {\n            newContent.push(child);\n          }\n        }\n        result.movesAccepted++;\n        continue;\n      }\n\n      // Handle property change revisions\n      if (PROPERTY_REVISION_TYPES.includes(revisionType) && options.acceptPropertyChanges) {\n        // For property changes, the revision is metadata attached to runs\n        // The current formatting (newProperties) is already applied to the run\n        // We just need to remove the change tracking metadata\n        // The content inside should be preserved\n        const childContent = item.getContent();\n        for (const child of childContent) {\n          // Check ImageRun FIRST since ImageRun extends Run\n          if (isImageRunContent(child)) {\n            newContent.push(child);\n          } else if (isRunContent(child)) {\n            newContent.push(child);\n          } else if (isHyperlinkContent(child)) {\n            newContent.push(child);\n          }\n        }\n        result.propertyChangesAccepted++;\n        continue;\n      }\n\n      // If we reach here, this revision type is not being accepted\n      // Keep it in the content\n      newContent.push(item);\n    } else if (item instanceof ComplexField && item.hasResultRevisions()) {\n      // Accept revisions nested inside ComplexField result sections\n      const fieldRevisions = item.getResultRevisions();\n      const revisionsToKeep: Revision[] = [];\n\n      for (const rev of fieldRevisions) {\n        const revType = rev.getType();\n        if (revType === 'insert' && options.acceptInsertions) {\n          result.insertionsAccepted++;\n        } else if (revType === 'delete' && options.acceptDeletions) {\n          result.deletionsAccepted++;\n        } else if (revType === 'moveTo' && options.acceptMoves) {\n          result.movesAccepted++;\n        } else if (revType === 'moveFrom' && options.acceptMoves) {\n          result.movesAccepted++;\n        } else {\n          revisionsToKeep.push(rev);\n        }\n      }\n\n      if (revisionsToKeep.length < fieldRevisions.length) {\n        // Some revisions were accepted — use getAcceptedResultText() for correct interleaved ordering\n        item.setResult(item.getAcceptedResultText());\n        if (revisionsToKeep.length > 0) {\n          item.setResultRevisions(revisionsToKeep);\n        }\n      }\n      newContent.push(item);\n    } else if (item instanceof RangeMarker) {\n      // Boundary markers for a move / ins / del span. Drop them when the\n      // revision they delimit is being accepted so no orphaned range markers\n      // remain (the move/ins/del revisions themselves are counted above; the\n      // markers carry no content, so they are not counted again).\n      const markerType = item.getType();\n      if (\n        (options.acceptMoves && MOVE_RANGE_MARKER_TYPES.has(markerType)) ||\n        (options.acceptInsertions && INS_RANGE_MARKER_TYPES.has(markerType)) ||\n        (options.acceptDeletions && DEL_RANGE_MARKER_TYPES.has(markerType))\n      ) {\n        continue;\n      }\n      newContent.push(item);\n    } else {\n      // Non-revision content - keep as-is\n      newContent.push(item);\n    }\n  }\n\n  // Replace paragraph content with the transformed content\n  paragraph.setContent(newContent);\n\n  // Clear paragraph property change tracking (pPrChange) if accepting property changes\n  // This removes the w:pPrChange element from the paragraph's formatting\n  if (options.acceptPropertyChanges) {\n    const formatting = paragraph.getFormatting();\n    if (formatting.pPrChange) {\n      paragraph.clearParagraphPropertiesChange();\n      result.propertyChangesAccepted++;\n    }\n    // Paragraph-mark rPrChange (CT_ParaRPrChange, §17.3.1.30) — same\n    // rationale as pPrChange: acceptance clears the \"previous\" snapshot,\n    // current formatting (paragraphMarkRunProperties) stays intact.\n    if (formatting.paragraphMarkRunPropertiesChange) {\n      paragraph.formatting.paragraphMarkRunPropertiesChange = undefined;\n      result.propertyChangesAccepted++;\n    }\n  }\n\n  // Clear paragraph mark deletion tracking if accepting deletions\n  // This removes the w:del element from w:pPr/w:rPr. The paragraph is also\n  // recorded for the post-walk merge pass: per ECMA-376 §17.13.5.15 a deleted\n  // paragraph mark means this paragraph's contents combine with the FOLLOWING\n  // paragraph, so clearing the marker alone would leave a leftover paragraph\n  // Word's own Accept All removes.\n  if (options.acceptDeletions) {\n    const formatting = paragraph.getFormatting();\n    if (formatting.paragraphMarkDeletion) {\n      paragraph.clearParagraphMarkDeletion();\n      result.deletionsAccepted++;\n      acceptedMarkDeletions?.push(paragraph);\n    }\n  }\n\n  // Clear paragraph mark insertion tracking if accepting insertions\n  // This removes the w:ins element from w:pPr/w:rPr\n  if (options.acceptInsertions) {\n    const formatting = paragraph.getFormatting();\n    if (formatting.paragraphMarkInsertion) {\n      paragraph.clearParagraphMarkInsertion();\n      result.insertionsAccepted++;\n    }\n  }\n\n  return result;\n}\n\n/**\n * Merge paragraphs whose tracked paragraph-mark deletion was accepted into\n * their immediately following sibling paragraph.\n *\n * Per ECMA-376 §17.13.5.15, a w:del inside w:pPr/w:rPr marks the paragraph\n * mark (¶) itself as deleted: accepting it means the paragraph's contents are\n * no longer delimited by that mark and combine with the FOLLOWING paragraph.\n * Clearing the marker alone leaves a leftover paragraph (blank line) that\n * Word's own Accept All removes.\n *\n * Merging only happens between siblings of the same container (document body\n * or table cell). A paragraph with no following sibling paragraph — last in\n * its container, or followed by a table/SDT/raw nested content — keeps its\n * content in place, matching Word, which cannot delete a container's final\n * paragraph mark.\n */\nexport function mergeParagraphsWithDeletedMarks(doc: Document, marked: Set<Paragraph>): void {\n  if (marked.size === 0) {\n    return;\n  }\n\n  // Body-level siblings\n  mergeMarkedSequence(doc.getBodyElements(), marked, (para) => {\n    doc.removeElement(para);\n  });\n\n  // Table-cell siblings (same tables the acceptance walk visits)\n  for (const table of doc.getTables()) {\n    for (const row of table.getRows()) {\n      for (const cell of row.getCells()) {\n        // Raw nested content (nested tables/SDTs) at position p renders\n        // between paragraph p-1 and paragraph p, so it interrupts sibling\n        // adjacency the same way a body-level table does. Capture the\n        // boundaries before any removal: removeParagraph keeps positions in\n        // sync with live indices, which match this snapshot only up front.\n        const blockedBoundaries = new Set(cell.getRawNestedContent().map((item) => item.position));\n        mergeMarkedSequence(\n          cell.getParagraphs(),\n          marked,\n          (para) => {\n            const index = cell.getParagraphs().indexOf(para);\n            if (index !== -1) {\n              cell.removeParagraph(index);\n            }\n          },\n          (index) => blockedBoundaries.has(index)\n        );\n      }\n    }\n  }\n}\n\n/**\n * Walk one sibling sequence (body elements or cell paragraphs) and fold each\n * run of marked paragraphs into the first unmarked paragraph that follows it.\n * Consecutive marked paragraphs chain: their contents concatenate, in\n * document order, ahead of the surviving paragraph's own content. The\n * surviving paragraph keeps its own pPr — the deleted marks took their\n * properties with them.\n */\nfunction mergeMarkedSequence(\n  sequence: readonly unknown[],\n  marked: Set<Paragraph>,\n  removeParagraph: (paragraph: Paragraph) => void,\n  blockedBefore?: (index: number) => boolean\n): void {\n  let chain: Paragraph[] = [];\n\n  for (let i = 0; i < sequence.length; i++) {\n    const element = sequence[i];\n\n    if (!(element instanceof Paragraph)) {\n      // A non-paragraph block (table, SDT, TOC) is not a valid merge target\n      chain = [];\n      continue;\n    }\n\n    if (blockedBefore?.(i)) {\n      chain = [];\n    }\n\n    if (marked.has(element)) {\n      chain.push(element);\n      continue;\n    }\n\n    if (chain.length > 0) {\n      const inherited: ParagraphContent[] = [];\n      for (const para of chain) {\n        inherited.push(...para.getContent());\n      }\n      element.setContent([...inherited, ...element.getContent()]);\n      for (const para of chain) {\n        // Empty before removal so a tracking-bound removal path can never\n        // duplicate content that now lives in the surviving paragraph\n        para.setContent([]);\n        removeParagraph(para);\n      }\n      chain = [];\n    }\n  }\n  // A trailing chain has no following sibling: the final paragraph mark of a\n  // container cannot be deleted, so those paragraphs stay as-is.\n}\n\n/**\n * Check if a paragraph has any revisions\n */\nexport function paragraphHasRevisions(paragraph: Paragraph): boolean {\n  const content = paragraph.getContent();\n  if (content.some((item) => item instanceof Revision)) {\n    return true;\n  }\n  // Also check paragraph mark revision markers in w:pPr/w:rPr\n  const formatting = paragraph.getFormatting();\n  if (formatting.paragraphMarkDeletion || formatting.paragraphMarkInsertion) {\n    return true;\n  }\n  return false;\n}\n\n/**\n * Get all revisions from a paragraph\n */\nexport function getRevisionsFromParagraph(paragraph: Paragraph): Revision[] {\n  const content = paragraph.getContent();\n  return content.filter((item): item is Revision => item instanceof Revision);\n}\n\n/**\n * Count revisions by type in a document\n */\nexport function countRevisionsByType(doc: Document): Map<RevisionType, number> {\n  const counts = new Map<RevisionType, number>();\n\n  const paragraphs = doc.getAllParagraphs();\n  for (const paragraph of paragraphs) {\n    const revisions = getRevisionsFromParagraph(paragraph);\n    for (const revision of revisions) {\n      const type = revision.getType();\n      counts.set(type, (counts.get(type) || 0) + 1);\n    }\n  }\n\n  return counts;\n}\n\n/**\n * Inline preserved-element types that are pure range/proofing markers.\n * They carry no displayable content, so a table whose cells hold only these\n * (e.g. leftover proofErr markers after all text was deleted via tracked\n * changes) must still be eligible for cleanup.\n */\nconst MARKER_PRESERVED_ELEMENT_TYPES = new Set([\n  'w:proofErr',\n  'w:permStart',\n  'w:permEnd',\n  'w:commentRangeStart',\n  'w:commentRangeEnd',\n]);\n\n/**\n * Check whether a paragraph carries visible content for empty-table cleanup.\n *\n * Paragraph.getText() only surfaces Run/Hyperlink text, so images, shapes,\n * text boxes, fields, pending revisions, and preserved raw XML (loaded-doc\n * hyperlinks, inline SDTs, math) would read as \"empty\" and the table holding\n * them would be silently deleted. Mirrors TableCell.isParaBlank's duck-typed\n * element detection.\n */\nfunction paragraphHasVisibleContent(para: Paragraph): boolean {\n  if (para.getText().trim().length > 0) {\n    return true;\n  }\n\n  for (const item of para.getContent()) {\n    if (!item) continue;\n\n    // Revisions left behind by selective acceptance still render their\n    // content (e.g. strikethrough deletions) — removing the table would\n    // discard tracked changes the caller chose to keep.\n    if (item instanceof Revision) {\n      return true;\n    }\n\n    // Marker-only preserved elements are not content; everything else\n    // preserved as raw XML (w:r, w:hyperlink, m:oMath, w:ruby, nested\n    // revision wrappers) is.\n    if (item instanceof PreservedElement) {\n      if (!MARKER_PRESERVED_ELEMENT_TYPES.has(item.getElementType())) {\n        return true;\n      }\n      continue;\n    }\n\n    // Duck-typed checks matching TableCell.isParaBlank: ImageRun\n    // (getImageElement), Shape (getShapeType), TextBox (getTextContent),\n    // Hyperlink (getUrl), Field/ComplexField (getInstruction).\n    const candidate = item as unknown as Record<string, unknown>;\n    if (\n      typeof candidate.getImageElement === 'function' ||\n      typeof candidate.getShapeType === 'function' ||\n      typeof candidate.getTextContent === 'function' ||\n      typeof candidate.getUrl === 'function' ||\n      typeof candidate.getInstruction === 'function'\n    ) {\n      return true;\n    }\n  }\n\n  return false;\n}\n\n/**\n * Remove tables that have no visible content after revision acceptance.\n *\n * A table is considered empty only if ALL cells in ALL rows have no visible\n * content: no text, images, shapes, text boxes, fields, hyperlinks, preserved\n * raw XML, or raw nested content (nested tables/SDTs). This handles cases\n * where all table content was deleted via tracked changes - the deletion\n * markers are stripped but the empty table structure remains.\n *\n * @param doc - Document to clean up\n * @param logger - Logger instance for debug output\n * @returns Number of empty tables removed\n */\nfunction cleanupEmptyTables(doc: Document, logger: ILogger): number {\n  const tables = doc.getTables();\n  let removedCount = 0;\n  const tablesToRemove: number[] = [];\n\n  for (let tableIndex = 0; tableIndex < tables.length; tableIndex++) {\n    const table = tables[tableIndex];\n    if (!table) continue;\n\n    let hasContent = false;\n    const rows = table.getRows();\n\n    for (const row of rows) {\n      const cells = row.getCells();\n      for (const cell of cells) {\n        // Nested tables/SDTs live in raw XML passthrough, never in\n        // paragraphs — a cell whose real content is a nested table would\n        // otherwise read as empty and be deleted.\n        if (cell.hasRawNestedContent()) {\n          hasContent = true;\n          break;\n        }\n        const paragraphs = cell.getParagraphs();\n        for (const para of paragraphs) {\n          if (paragraphHasVisibleContent(para)) {\n            hasContent = true;\n            break;\n          }\n        }\n        if (hasContent) break;\n      }\n      if (hasContent) break;\n    }\n\n    if (!hasContent) {\n      // Mark this table for removal (store index)\n      tablesToRemove.push(tableIndex);\n      logger.debug('Found empty table for removal', { tableIndex });\n    }\n  }\n\n  // Remove tables in reverse order to preserve indices\n  for (let i = tablesToRemove.length - 1; i >= 0; i--) {\n    const tableIndex = tablesToRemove[i];\n    if (tableIndex !== undefined && doc.removeTable(tableIndex)) {\n      removedCount++;\n      logger.debug('Removed empty table', { tableIndex });\n    }\n  }\n\n  if (removedCount > 0) {\n    logger.info('Empty table cleanup complete', { tablesRemoved: removedCount });\n  }\n\n  return removedCount;\n}\n"]}

package/dist/processors/RevisionWalker.d.ts

@@ -16,6 +16,8 @@ export declare class RevisionWalker {
     private static deepClone;
     private static walkAndTransform;
     private static filterDeletedRows;
+    private static removeFullyDeletedTables;
+    private static dropOrderedChildEntries;
     private static processRevisions;
     private static shouldUnwrap;
     private static shouldRemove;

package/dist/processors/RevisionWalker.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"RevisionWalker.d.ts","sourceRoot":"","sources":["../../src/processors/RevisionWalker.ts"],"names":[],"mappings":"AAUA,OAAO,EAAE,eAAe,EAAE,MAAM,qBAAqB,CAAC;AAKtD,MAAM,WAAW,qBAAqB;IAEpC,gBAAgB,CAAC,EAAE,OAAO,CAAC;IAE3B,eAAe,CAAC,EAAE,OAAO,CAAC;IAE1B,WAAW,CAAC,EAAE,OAAO,CAAC;IAEtB,qBAAqB,CAAC,EAAE,OAAO,CAAC;CACjC;AAaD,QAAA,MAAM,iBAAiB;;;;;CAmCtB,CAAC;AAcF,qBAAa,cAAc;IAczB,MAAM,CAAC,WAAW,CAAC,GAAG,EAAE,eAAe,EAAE,OAAO,CAAC,EAAE,qBAAqB,GAAG,eAAe;IAoB1F,OAAO,CAAC,MAAM,CAAC,SAAS;IAoBxB,OAAO,CAAC,MAAM,CAAC,gBAAgB;IA0C/B,OAAO,CAAC,MAAM,CAAC,iBAAiB;IA6BhC,OAAO,CAAC,MAAM,CAAC,gBAAgB;IAsB/B,OAAO,CAAC,MAAM,CAAC,YAAY;IAY3B,OAAO,CAAC,MAAM,CAAC,YAAY;IA4B3B,OAAO,CAAC,MAAM,CAAC,iBAAiB;IA+HhC,OAAO,CAAC,MAAM,CAAC,iBAAiB;IAmBhC,OAAO,CAAC,MAAM,CAAC,eAAe;IAoB9B,OAAO,CAAC,MAAM,CAAC,sBAAsB;IAarC,MAAM,CAAC,iBAAiB,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO;IAY9C,MAAM,CAAC,4BAA4B,IAAI,OAAO,iBAAiB;CAGhE"}
+{"version":3,"file":"RevisionWalker.d.ts","sourceRoot":"","sources":["../../src/processors/RevisionWalker.ts"],"names":[],"mappings":"AAUA,OAAO,EAAE,eAAe,EAAE,MAAM,qBAAqB,CAAC;AAKtD,MAAM,WAAW,qBAAqB;IAEpC,gBAAgB,CAAC,EAAE,OAAO,CAAC;IAE3B,eAAe,CAAC,EAAE,OAAO,CAAC;IAE1B,WAAW,CAAC,EAAE,OAAO,CAAC;IAEtB,qBAAqB,CAAC,EAAE,OAAO,CAAC;CACjC;AAaD,QAAA,MAAM,iBAAiB;;;;;CAmCtB,CAAC;AAcF,qBAAa,cAAc;IAczB,MAAM,CAAC,WAAW,CAAC,GAAG,EAAE,eAAe,EAAE,OAAO,CAAC,EAAE,qBAAqB,GAAG,eAAe;IAoB1F,OAAO,CAAC,MAAM,CAAC,SAAS;IAoBxB,OAAO,CAAC,MAAM,CAAC,gBAAgB;IAiD/B,OAAO,CAAC,MAAM,CAAC,iBAAiB;IAyChC,OAAO,CAAC,MAAM,CAAC,wBAAwB;IA0CvC,OAAO,CAAC,MAAM,CAAC,uBAAuB;IAetC,OAAO,CAAC,MAAM,CAAC,gBAAgB;IAsB/B,OAAO,CAAC,MAAM,CAAC,YAAY;IAY3B,OAAO,CAAC,MAAM,CAAC,YAAY;IA4B3B,OAAO,CAAC,MAAM,CAAC,iBAAiB;IA+HhC,OAAO,CAAC,MAAM,CAAC,iBAAiB;IAmBhC,OAAO,CAAC,MAAM,CAAC,eAAe;IAoB9B,OAAO,CAAC,MAAM,CAAC,sBAAsB;IAarC,MAAM,CAAC,iBAAiB,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO;IAY9C,MAAM,CAAC,4BAA4B,IAAI,OAAO,iBAAiB;CAGhE"}

package/dist/processors/RevisionWalker.js

@@ -59,6 +59,9 @@ class RevisionWalker {
         if (obj === null || typeof obj !== 'object') {
             return;
         }
+        if (options.acceptDeletions && obj['w:tbl']) {
+            RevisionWalker.removeFullyDeletedTables(obj);
+        }
         if (options.acceptDeletions && obj['w:tr']) {
             RevisionWalker.filterDeletedRows(obj);
         }
@@ -87,20 +90,67 @@ class RevisionWalker {
             return !!trPr['w:del'];
         };
         if (Array.isArray(rows)) {
-            const kept = rows.filter((r) => !isRowDeleted(r));
-            if (kept.length !== rows.length) {
-                if (kept.length === 0) {
-                    delete tbl['w:tr'];
-                }
-                else {
-                    tbl['w:tr'] = kept;
-                }
+            const removedIndices = new Set();
+            for (let i = 0; i < rows.length; i++) {
+                if (isRowDeleted(rows[i]))
+                    removedIndices.add(i);
+            }
+            if (removedIndices.size === 0)
+                return;
+            const kept = rows.filter((_, i) => !removedIndices.has(i));
+            if (kept.length === 0) {
+                delete tbl['w:tr'];
             }
+            else {
+                tbl['w:tr'] = kept;
+            }
+            RevisionWalker.dropOrderedChildEntries(tbl, 'w:tr', removedIndices);
         }
         else if (isRowDeleted(rows)) {
             delete tbl['w:tr'];
+            RevisionWalker.dropOrderedChildEntries(tbl, 'w:tr', new Set([0]));
+        }
+    }
+    static removeFullyDeletedTables(parent) {
+        const tables = parent['w:tbl'];
+        const becomesRowless = (tbl) => {
+            if (!tbl || typeof tbl !== 'object' || tbl['w:tr'] === undefined)
+                return false;
+            RevisionWalker.filterDeletedRows(tbl);
+            return (tbl['w:tr'] === undefined &&
+                !tbl['w:ins'] &&
+                !tbl['w:moveTo'] &&
+                !tbl['w:sdt'] &&
+                !tbl['w:customXml']);
+        };
+        if (Array.isArray(tables)) {
+            const removedIndices = new Set();
+            for (let i = 0; i < tables.length; i++) {
+                if (becomesRowless(tables[i]))
+                    removedIndices.add(i);
+            }
+            if (removedIndices.size === 0)
+                return;
+            const kept = tables.filter((_, i) => !removedIndices.has(i));
+            if (kept.length === 0) {
+                delete parent['w:tbl'];
+            }
+            else {
+                parent['w:tbl'] = kept;
+            }
+            RevisionWalker.dropOrderedChildEntries(parent, 'w:tbl', removedIndices);
+        }
+        else if (becomesRowless(tables)) {
+            delete parent['w:tbl'];
+            RevisionWalker.dropOrderedChildEntries(parent, 'w:tbl', new Set([0]));
         }
     }
+    static dropOrderedChildEntries(parent, type, removedIndices) {
+        if (!parent._orderedChildren)
+            return;
+        parent._orderedChildren = parent._orderedChildren.filter((c) => c.type !== type || !removedIndices.has(c.index));
+        RevisionWalker.reindexOrderedChildren(parent._orderedChildren);
+    }
     static processRevisions(parent, options) {
         if (!parent || typeof parent !== 'object') {
             return;

package/dist/processors/RevisionWalker.js.map

@@ -1 +1 @@
-{"version":3,"file":"RevisionWalker.js","sourceRoot":"","sources":["../../src/processors/RevisionWalker.ts"],"names":[],"mappings":";;;AAqCA,MAAM,iBAAiB,GAAG;IAExB,MAAM,EAAE,CAAC,OAAO,EAAE,UAAU,CAAC;IAG7B,MAAM,EAAE,CAAC,OAAO,EAAE,YAAY,CAAC;IAG/B,gBAAgB,EAAE;QAChB,aAAa;QACb,aAAa;QACb,eAAe;QACf,cAAc;QACd,cAAc;QACd,gBAAgB;QAChB,iBAAiB;QACjB,mBAAmB;QACnB,iBAAiB;KAClB;IAGD,aAAa,EAAE;QACb,sBAAsB;QACtB,oBAAoB;QACpB,oBAAoB;QACpB,kBAAkB;QAClB,0BAA0B;QAC1B,wBAAwB;QACxB,0BAA0B;QAC1B,wBAAwB;QACxB,+BAA+B;QAC/B,6BAA6B;QAC7B,6BAA6B;QAC7B,2BAA2B;KAC5B;CACF,CAAC;AAcF,MAAa,cAAc;IAczB,MAAM,CAAC,WAAW,CAAC,GAAoB,EAAE,OAA+B;QACtE,MAAM,IAAI,GAAoC;YAC5C,gBAAgB,EAAE,OAAO,EAAE,gBAAgB,IAAI,IAAI;YACnD,eAAe,EAAE,OAAO,EAAE,eAAe,IAAI,IAAI;YACjD,WAAW,EAAE,OAAO,EAAE,WAAW,IAAI,IAAI;YACzC,qBAAqB,EAAE,OAAO,EAAE,qBAAqB,IAAI,IAAI;SAC9D,CAAC;QAGF,MAAM,KAAK,GAAG,cAAc,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;QAG5C,cAAc,CAAC,gBAAgB,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;QAE7C,OAAO,KAAK,CAAC;IACf,CAAC;IAKO,MAAM,CAAC,SAAS,CAAC,GAAQ;QAC/B,IAAI,GAAG,KAAK,IAAI,IAAI,OAAO,GAAG,KAAK,QAAQ,EAAE,CAAC;YAC5C,OAAO,GAAG,CAAC;QACb,CAAC;QAED,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;YACvB,OAAO,GAAG,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,cAAc,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC;QAC3D,CAAC;QAED,MAAM,KAAK,GAAQ,EAAE,CAAC;QACtB,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YACnC,KAAK,CAAC,GAAG,CAAC,GAAG,cAAc,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QAClD,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAMO,MAAM,CAAC,gBAAgB,CAAC,GAAQ,EAAE,OAAwC;QAChF,IAAI,GAAG,KAAK,IAAI,IAAI,OAAO,GAAG,KAAK,QAAQ,EAAE,CAAC;YAC5C,OAAO;QACT,CAAC;QAQD,IAAI,OAAO,CAAC,eAAe,IAAI,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YAC3C,cAAc,CAAC,iBAAiB,CAAC,GAAG,CAAC,CAAC;QACxC,CAAC;QAGD,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,CAClC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,OAAO,IAAI,CAAC,KAAK,kBAAkB,CACxE,CAAC;QAGF,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,MAAM,KAAK,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;YACvB,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;gBACzB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;oBACzB,cAAc,CAAC,gBAAgB,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;gBACjD,CAAC;YACH,CAAC;iBAAM,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;gBACvD,cAAc,CAAC,gBAAgB,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;YAClD,CAAC;QACH,CAAC;QAID,cAAc,CAAC,gBAAgB,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;IAChD,CAAC;IAOO,MAAM,CAAC,iBAAiB,CAAC,GAAQ;QACvC,MAAM,IAAI,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC;QACzB,MAAM,YAAY,GAAG,CAAC,GAAQ,EAAW,EAAE;YACzC,IAAI,CAAC,GAAG,IAAI,OAAO,GAAG,KAAK,QAAQ;gBAAE,OAAO,KAAK,CAAC;YAClD,MAAM,IAAI,GAAG,GAAG,CAAC,QAAQ,CAAC,CAAC;YAC3B,IAAI,CAAC,IAAI,IAAI,OAAO,IAAI,KAAK,QAAQ;gBAAE,OAAO,KAAK,CAAC;YAIpD,OAAO,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACzB,CAAC,CAAC;QAEF,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;YACxB,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;YAClD,IAAI,IAAI,CAAC,MAAM,KAAK,IAAI,CAAC,MAAM,EAAE,CAAC;gBAChC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;oBACtB,OAAO,GAAG,CAAC,MAAM,CAAC,CAAC;gBACrB,CAAC;qBAAM,CAAC;oBACN,GAAG,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC;gBACrB,CAAC;YACH,CAAC;QACH,CAAC;aAAM,IAAI,YAAY,CAAC,IAAI,CAAC,EAAE,CAAC;YAC9B,OAAO,GAAG,CAAC,MAAM,CAAC,CAAC;QACrB,CAAC;IACH,CAAC;IAKO,MAAM,CAAC,gBAAgB,CAAC,MAAW,EAAE,OAAwC;QACnF,IAAI,CAAC,MAAM,IAAI,OAAO,MAAM,KAAK,QAAQ,EAAE,CAAC;YAC1C,OAAO;QACT,CAAC;QAED,MAAM,aAAa,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,MAAM,CAC9C,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,OAAO,IAAI,CAAC,KAAK,kBAAkB,CACxE,CAAC;QAEF,KAAK,MAAM,GAAG,IAAI,aAAa,EAAE,CAAC;YAEhC,IAAI,cAAc,CAAC,YAAY,CAAC,GAAG,EAAE,OAAO,CAAC,EAAE,CAAC;gBAC9C,cAAc,CAAC,iBAAiB,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;YAChD,CAAC;iBAAM,IAAI,cAAc,CAAC,YAAY,CAAC,GAAG,EAAE,OAAO,CAAC,EAAE,CAAC;gBACrD,cAAc,CAAC,iBAAiB,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;YAChD,CAAC;QACH,CAAC;IACH,CAAC;IAKO,MAAM,CAAC,YAAY,CAAC,GAAW,EAAE,OAAwC;QAC/E,IAAI,iBAAiB,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;YAC3C,IAAI,GAAG,KAAK,OAAO,IAAI,CAAC,OAAO,CAAC,gBAAgB;gBAAE,OAAO,KAAK,CAAC;YAC/D,IAAI,GAAG,KAAK,UAAU,IAAI,CAAC,OAAO,CAAC,WAAW;gBAAE,OAAO,KAAK,CAAC;YAC7D,OAAO,IAAI,CAAC;QACd,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAKO,MAAM,CAAC,YAAY,CAAC,GAAW,EAAE,OAAwC;QAC/E,IAAI,iBAAiB,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;YAC3C,IAAI,GAAG,KAAK,OAAO,IAAI,CAAC,OAAO,CAAC,eAAe;gBAAE,OAAO,KAAK,CAAC;YAC9D,IAAI,GAAG,KAAK,YAAY,IAAI,CAAC,OAAO,CAAC,WAAW;gBAAE,OAAO,KAAK,CAAC;YAC/D,OAAO,IAAI,CAAC;QACd,CAAC;QACD,IAAI,iBAAiB,CAAC,gBAAgB,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;YACrD,OAAO,OAAO,CAAC,qBAAqB,CAAC;QACvC,CAAC;QACD,IAAI,iBAAiB,CAAC,aAAa,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;YAClD,OAAO,IAAI,CAAC;QACd,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAeO,MAAM,CAAC,iBAAiB,CAAC,MAAW,EAAE,GAAW;QACvD,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;QAC7B,IAAI,CAAC,QAAQ;YAAE,OAAO;QAEtB,MAAM,YAAY,GAAG,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;QAIrE,MAAM,eAAe,GAAqC,EAAE,CAAC;QAE7D,IAAI,MAAM,CAAC,gBAAgB,EAAE,CAAC;YAE5B,MAAM,YAAY,GAAG,IAAI,GAAG,EAAkB,CAAC;YAC/C,IAAI,cAAc,GAAG,CAAC,CAAC;YAEvB,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,gBAAgB,EAAE,CAAC;gBAC5C,MAAM,EAAE,IAAI,EAAE,GAAG,KAAK,CAAC;gBAEvB,IAAI,IAAI,KAAK,GAAG,EAAE,CAAC;oBAEjB,MAAM,UAAU,GAAG,YAAY,CAAC,cAAc,CAAC,CAAC;oBAChD,cAAc,EAAE,CAAC;oBAEjB,IAAI,UAAU,IAAI,OAAO,UAAU,KAAK,QAAQ,EAAE,CAAC;wBACjD,IAAI,UAAU,CAAC,gBAAgB,EAAE,CAAC;4BAEhC,MAAM,aAAa,GAAG,IAAI,GAAG,EAAkB,CAAC;4BAChD,KAAK,MAAM,UAAU,IAAI,UAAU,CAAC,gBAAgB,EAAE,CAAC;gCACrD,MAAM,SAAS,GAAG,UAAU,CAAC,IAAI,CAAC;gCAClC,MAAM,QAAQ,GAAG,aAAa,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;gCACnD,aAAa,CAAC,GAAG,CAAC,SAAS,EAAE,QAAQ,GAAG,CAAC,CAAC,CAAC;gCAE3C,MAAM,aAAa,GAAG,UAAU,CAAC,SAAS,CAAC,CAAC;gCAC5C,IAAI,aAAa,EAAE,CAAC;oCAClB,MAAM,UAAU,GAAG,KAAK,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC;oCAClF,IAAI,QAAQ,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC;wCACjC,eAAe,CAAC,IAAI,CAAC;4CACnB,IAAI,EAAE,SAAS;4CACf,OAAO,EAAE,UAAU,CAAC,QAAQ,CAAC;yCAC9B,CAAC,CAAC;oCACL,CAAC;gCACH,CAAC;4BACH,CAAC;wBACH,CAAC;6BAAM,CAAC;4BAEN,MAAM,SAAS,GAAG,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,MAAM,CAC9C,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,OAAO,IAAI,CAAC,KAAK,kBAAkB,CACxE,CAAC;4BACF,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;gCACjC,MAAM,UAAU,GAAG,UAAU,CAAC,QAAQ,CAAC,CAAC;gCACxC,MAAM,UAAU,GAAG,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;gCACzE,KAAK,MAAM,KAAK,IAAI,UAAU,EAAE,CAAC;oCAC/B,eAAe,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC;gCAC3D,CAAC;4BACH,CAAC;wBACH,CAAC;oBACH,CAAC;gBACH,CAAC;qBAAM,CAAC;oBAEN,MAAM,GAAG,GAAG,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBACxC,YAAY,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC;oBAEhC,MAAM,cAAc,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;oBACpC,IAAI,cAAc,EAAE,CAAC;wBACnB,MAAM,WAAW,GAAG,KAAK,CAAC,OAAO,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC;wBACtF,IAAI,GAAG,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC;4BAC7B,eAAe,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;wBAC5D,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAGD,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC;QAGnB,IAAI,eAAe,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAE/B,MAAM,aAAa,GAAG,IAAI,GAAG,EAAiB,CAAC;YAE/C,KAAK,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,eAAe,EAAE,CAAC;gBAChD,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;oBAC7B,aAAa,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;gBAC9B,CAAC;gBACD,aAAa,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACzC,CAAC;YAGD,KAAK,MAAM,CAAC,IAAI,EAAE,QAAQ,CAAC,IAAI,aAAa,EAAE,CAAC;gBAC7C,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;oBAC1B,MAAM,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;gBAC7B,CAAC;qBAAM,CAAC;oBACN,MAAM,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC;gBAC1B,CAAC;YACH,CAAC;YAGD,MAAM,kBAAkB,GAAuB,EAAE,CAAC;YAClD,MAAM,YAAY,GAAG,IAAI,GAAG,EAAkB,CAAC;YAE/C,KAAK,MAAM,EAAE,IAAI,EAAE,IAAI,eAAe,EAAE,CAAC;gBACvC,MAAM,GAAG,GAAG,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACxC,YAAY,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC;gBAChC,kBAAkB,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC;YAChD,CAAC;YAED,MAAM,CAAC,gBAAgB,GAAG,kBAAkB,CAAC;QAC/C,CAAC;aAAM,CAAC;YAEN,KAAK,MAAM,OAAO,IAAI,YAAY,EAAE,CAAC;gBACnC,IAAI,CAAC,OAAO,IAAI,OAAO,OAAO,KAAK,QAAQ;oBAAE,SAAS;gBAEtD,MAAM,WAAW,GAAG,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,MAAM,CAC7C,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,OAAO,IAAI,CAAC,KAAK,kBAAkB,CACxE,CAAC;gBAEF,KAAK,MAAM,QAAQ,IAAI,WAAW,EAAE,CAAC;oBACnC,cAAc,CAAC,eAAe,CAAC,MAAM,EAAE,QAAQ,EAAE,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC;gBACtE,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAKO,MAAM,CAAC,iBAAiB,CAAC,MAAW,EAAE,GAAW;QACvD,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC;YAAE,OAAO;QAGzB,IAAI,MAAM,CAAC,gBAAgB,EAAE,CAAC;YAC5B,MAAM,CAAC,gBAAgB,GAAG,MAAM,CAAC,gBAAgB,CAAC,MAAM,CACtD,CAAC,CAAmB,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,GAAG,CACxC,CAAC;YAEF,cAAc,CAAC,sBAAsB,CAAC,MAAM,CAAC,gBAAgB,CAAC,CAAC;QACjE,CAAC;QAGD,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC;IACrB,CAAC;IAKO,MAAM,CAAC,eAAe,CAAC,MAAW,EAAE,QAAgB,EAAE,UAAe;QAC3E,IAAI,MAAM,CAAC,QAAQ,CAAC,KAAK,SAAS,EAAE,CAAC;YAEnC,MAAM,CAAC,QAAQ,CAAC,GAAG,UAAU,CAAC;QAChC,CAAC;aAAM,CAAC;YAEN,MAAM,QAAQ,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC;YAClC,MAAM,QAAQ,GAAG,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;YAEvE,IAAI,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAC5B,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,QAAQ,EAAE,GAAG,QAAQ,CAAC,CAAC;YAChD,CAAC;iBAAM,CAAC;gBACN,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,QAAQ,EAAE,GAAG,QAAQ,CAAC,CAAC;YAC7C,CAAC;QACH,CAAC;IACH,CAAC;IAKO,MAAM,CAAC,sBAAsB,CAAC,eAAmC;QACvE,MAAM,YAAY,GAAG,IAAI,GAAG,EAAkB,CAAC;QAE/C,KAAK,MAAM,KAAK,IAAI,eAAe,EAAE,CAAC;YACpC,MAAM,YAAY,GAAG,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACvD,KAAK,CAAC,KAAK,GAAG,YAAY,CAAC;YAC3B,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,YAAY,GAAG,CAAC,CAAC,CAAC;QACjD,CAAC;IACH,CAAC;IAKD,MAAM,CAAC,iBAAiB,CAAC,GAAW;QAClC,OAAO,CACL,iBAAiB,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC;YACtC,iBAAiB,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC;YACtC,iBAAiB,CAAC,gBAAgB,CAAC,QAAQ,CAAC,GAAG,CAAC;YAChD,iBAAiB,CAAC,aAAa,CAAC,QAAQ,CAAC,GAAG,CAAC,CAC9C,CAAC;IACJ,CAAC;IAKD,MAAM,CAAC,4BAA4B;QACjC,OAAO,EAAE,GAAG,iBAAiB,EAAE,CAAC;IAClC,CAAC;CACF;AA7XD,wCA6XC","sourcesContent":["/**\n * RevisionWalker - DOM-based tree walker for accepting tracked changes\n *\n * Replaces the fragile RegEx-based revision acceptance with a robust\n * DOM-based approach that properly handles nested elements and preserves\n * element ordering.\n *\n * @module RevisionWalker\n */\n\nimport { ParsedXMLObject } from '../xml/XMLParser.js';\n\n/**\n * Options for controlling which revision types to accept\n */\nexport interface RevisionWalkerOptions {\n  /** Keep content, remove w:ins wrapper (default: true) */\n  acceptInsertions?: boolean;\n  /** Remove w:del and content entirely (default: true) */\n  acceptDeletions?: boolean;\n  /** Handle w:moveFrom/w:moveTo (default: true) */\n  acceptMoves?: boolean;\n  /** Remove *Change elements (default: true) */\n  acceptPropertyChanges?: boolean;\n}\n\n/**\n * Structure for tracking element order\n */\ninterface OrderedChildInfo {\n  type: string;\n  index: number;\n}\n\n/**\n * Revision element categories\n */\nconst REVISION_ELEMENTS = {\n  /** Elements to unwrap (keep content, remove wrapper) */\n  UNWRAP: ['w:ins', 'w:moveTo'],\n\n  /** Elements to remove entirely (with content) */\n  REMOVE: ['w:del', 'w:moveFrom'],\n\n  /** Property change tracking elements */\n  PROPERTY_CHANGES: [\n    'w:rPrChange',\n    'w:pPrChange',\n    'w:tblPrChange',\n    'w:tcPrChange',\n    'w:trPrChange',\n    'w:sectPrChange',\n    'w:tblGridChange',\n    'w:numberingChange',\n    'w:tblPrExChange',\n  ],\n\n  /** Range marker elements */\n  RANGE_MARKERS: [\n    'w:moveFromRangeStart',\n    'w:moveFromRangeEnd',\n    'w:moveToRangeStart',\n    'w:moveToRangeEnd',\n    'w:customXmlInsRangeStart',\n    'w:customXmlInsRangeEnd',\n    'w:customXmlDelRangeStart',\n    'w:customXmlDelRangeEnd',\n    'w:customXmlMoveFromRangeStart',\n    'w:customXmlMoveFromRangeEnd',\n    'w:customXmlMoveToRangeStart',\n    'w:customXmlMoveToRangeEnd',\n  ],\n};\n\n/**\n * DOM-based tree walker for accepting Word document revisions\n *\n * This class processes a parsed XML object tree (from XMLParser.parseToObject())\n * and accepts all tracked changes by:\n * - Unwrapping insertions (w:ins, w:moveTo) - keeping content\n * - Removing deletions (w:del, w:moveFrom) - discarding content\n * - Removing property changes (*Change elements)\n * - Removing range markers\n *\n * Element order is preserved using the _orderedChildren metadata.\n */\nexport class RevisionWalker {\n  /**\n   * Process a parsed XML object tree and accept all revisions\n   *\n   * @param obj - Parsed XML object from XMLParser.parseToObject()\n   * @param options - Options controlling which revisions to accept\n   * @returns New object tree with revisions accepted\n   *\n   * @example\n   * ```typescript\n   * const parsed = XMLParser.parseToObject(documentXml);\n   * const clean = RevisionWalker.processTree(parsed);\n   * ```\n   */\n  static processTree(obj: ParsedXMLObject, options?: RevisionWalkerOptions): ParsedXMLObject {\n    const opts: Required<RevisionWalkerOptions> = {\n      acceptInsertions: options?.acceptInsertions ?? true,\n      acceptDeletions: options?.acceptDeletions ?? true,\n      acceptMoves: options?.acceptMoves ?? true,\n      acceptPropertyChanges: options?.acceptPropertyChanges ?? true,\n    };\n\n    // Deep clone the object to avoid mutating the original\n    const clone = RevisionWalker.deepClone(obj);\n\n    // Walk and transform the tree\n    RevisionWalker.walkAndTransform(clone, opts);\n\n    return clone;\n  }\n\n  /**\n   * Deep clone an object\n   */\n  private static deepClone(obj: any): any {\n    if (obj === null || typeof obj !== 'object') {\n      return obj;\n    }\n\n    if (Array.isArray(obj)) {\n      return obj.map((item) => RevisionWalker.deepClone(item));\n    }\n\n    const clone: any = {};\n    for (const key of Object.keys(obj)) {\n      clone[key] = RevisionWalker.deepClone(obj[key]);\n    }\n    return clone;\n  }\n\n  /**\n   * Recursively walk and transform the object tree\n   * Processes children first (depth-first) to handle nested revisions\n   */\n  private static walkAndTransform(obj: any, options: Required<RevisionWalkerOptions>): void {\n    if (obj === null || typeof obj !== 'object') {\n      return;\n    }\n\n    // Pre-recursion: row-level tracked deletions (CT_TrPr > w:del per\n    // §17.13.5.14). Must run BEFORE the depth-first recursion — otherwise\n    // processRevisions in trPr would strip the w:del marker before we can\n    // detect it at the table level. The default `w:del` removal in\n    // processRevisions only strips the marker itself, leaving a zombie\n    // empty row; per spec, accepting the deletion removes the entire row.\n    if (options.acceptDeletions && obj['w:tr']) {\n      RevisionWalker.filterDeletedRows(obj);\n    }\n\n    // Get keys to process (excluding metadata keys)\n    const keys = Object.keys(obj).filter(\n      (k) => !k.startsWith('@_') && k !== '#text' && k !== '_orderedChildren'\n    );\n\n    // First pass: recurse into children (depth-first)\n    for (const key of keys) {\n      const value = obj[key];\n      if (Array.isArray(value)) {\n        for (const item of value) {\n          RevisionWalker.walkAndTransform(item, options);\n        }\n      } else if (typeof value === 'object' && value !== null) {\n        RevisionWalker.walkAndTransform(value, options);\n      }\n    }\n\n    // Second pass: process revision elements at this level\n    // We need to iterate carefully because we're modifying the object\n    RevisionWalker.processRevisions(obj, options);\n  }\n\n  /**\n   * Remove `<w:tr>` entries whose `<w:trPr>` contains a self-closing\n   * `<w:del/>` row-level deletion marker. Operates on the parsed-object\n   * representation (arrays when multiple, single object otherwise).\n   */\n  private static filterDeletedRows(tbl: any): void {\n    const rows = tbl['w:tr'];\n    const isRowDeleted = (row: any): boolean => {\n      if (!row || typeof row !== 'object') return false;\n      const trPr = row['w:trPr'];\n      if (!trPr || typeof trPr !== 'object') return false;\n      // w:del at row level is a CT_TrackChange (no children). When absent\n      // the parser leaves no key; when present it's a self-closing tag\n      // parsed as an object with only @_w:id/@_w:author/@_w:date keys.\n      return !!trPr['w:del'];\n    };\n\n    if (Array.isArray(rows)) {\n      const kept = rows.filter((r) => !isRowDeleted(r));\n      if (kept.length !== rows.length) {\n        if (kept.length === 0) {\n          delete tbl['w:tr'];\n        } else {\n          tbl['w:tr'] = kept;\n        }\n      }\n    } else if (isRowDeleted(rows)) {\n      delete tbl['w:tr'];\n    }\n  }\n\n  /**\n   * Process revision elements at the current level\n   */\n  private static processRevisions(parent: any, options: Required<RevisionWalkerOptions>): void {\n    if (!parent || typeof parent !== 'object') {\n      return;\n    }\n\n    const keysToProcess = Object.keys(parent).filter(\n      (k) => !k.startsWith('@_') && k !== '#text' && k !== '_orderedChildren'\n    );\n\n    for (const key of keysToProcess) {\n      // Check if this is a revision element\n      if (RevisionWalker.shouldUnwrap(key, options)) {\n        RevisionWalker.unwrapAllElements(parent, key);\n      } else if (RevisionWalker.shouldRemove(key, options)) {\n        RevisionWalker.removeAllElements(parent, key);\n      }\n    }\n  }\n\n  /**\n   * Check if an element should be unwrapped (content kept)\n   */\n  private static shouldUnwrap(key: string, options: Required<RevisionWalkerOptions>): boolean {\n    if (REVISION_ELEMENTS.UNWRAP.includes(key)) {\n      if (key === 'w:ins' && !options.acceptInsertions) return false;\n      if (key === 'w:moveTo' && !options.acceptMoves) return false;\n      return true;\n    }\n    return false;\n  }\n\n  /**\n   * Check if an element should be removed (content discarded)\n   */\n  private static shouldRemove(key: string, options: Required<RevisionWalkerOptions>): boolean {\n    if (REVISION_ELEMENTS.REMOVE.includes(key)) {\n      if (key === 'w:del' && !options.acceptDeletions) return false;\n      if (key === 'w:moveFrom' && !options.acceptMoves) return false;\n      return true;\n    }\n    if (REVISION_ELEMENTS.PROPERTY_CHANGES.includes(key)) {\n      return options.acceptPropertyChanges;\n    }\n    if (REVISION_ELEMENTS.RANGE_MARKERS.includes(key)) {\n      return true; // Always remove range markers\n    }\n    return false;\n  }\n\n  /**\n   * Unwrap all elements of a given type, promoting their children to parent\n   *\n   * This is the most complex operation in RevisionWalker. When we unwrap a\n   * revision element like w:ins, we need to:\n   * 1. Extract the children from inside w:ins\n   * 2. Insert them at the correct position in the parent's element arrays\n   * 3. Update _orderedChildren to reflect the new structure\n   *\n   * The key challenge is maintaining correct element order. For example:\n   *   Before: <w:tbl><w:tr>Row1</w:tr><w:ins><w:tr>Row2</w:tr></w:ins><w:tr>Row3</w:tr></w:tbl>\n   *   After:  <w:tbl><w:tr>Row1</w:tr><w:tr>Row2</w:tr><w:tr>Row3</w:tr></w:tbl>\n   */\n  private static unwrapAllElements(parent: any, key: string): void {\n    const elements = parent[key];\n    if (!elements) return;\n\n    const elementArray = Array.isArray(elements) ? elements : [elements];\n\n    // Build a complete ordered list of child elements by walking _orderedChildren\n    // This captures the intended order before we modify anything\n    const orderedElements: { type: string; element: any }[] = [];\n\n    if (parent._orderedChildren) {\n      // Track how many of each type we've seen to get correct array index\n      const typeCounters = new Map<string, number>();\n      let unwrappedIndex = 0;\n\n      for (const entry of parent._orderedChildren) {\n        const { type } = entry;\n\n        if (type === key) {\n          // This is a revision element - extract its children in order\n          const revElement = elementArray[unwrappedIndex];\n          unwrappedIndex++;\n\n          if (revElement && typeof revElement === 'object') {\n            if (revElement._orderedChildren) {\n              // Use the revision element's _orderedChildren for correct order\n              const childCounters = new Map<string, number>();\n              for (const childEntry of revElement._orderedChildren) {\n                const childType = childEntry.type;\n                const childIdx = childCounters.get(childType) || 0;\n                childCounters.set(childType, childIdx + 1);\n\n                const childElements = revElement[childType];\n                if (childElements) {\n                  const childArray = Array.isArray(childElements) ? childElements : [childElements];\n                  if (childIdx < childArray.length) {\n                    orderedElements.push({\n                      type: childType,\n                      element: childArray[childIdx],\n                    });\n                  }\n                }\n              }\n            } else {\n              // No _orderedChildren, extract children in object key order\n              const childKeys = Object.keys(revElement).filter(\n                (k) => !k.startsWith('@_') && k !== '#text' && k !== '_orderedChildren'\n              );\n              for (const childKey of childKeys) {\n                const childValue = revElement[childKey];\n                const childArray = Array.isArray(childValue) ? childValue : [childValue];\n                for (const child of childArray) {\n                  orderedElements.push({ type: childKey, element: child });\n                }\n              }\n            }\n          }\n        } else {\n          // Regular element - get it from the parent\n          const idx = typeCounters.get(type) || 0;\n          typeCounters.set(type, idx + 1);\n\n          const parentElements = parent[type];\n          if (parentElements) {\n            const parentArray = Array.isArray(parentElements) ? parentElements : [parentElements];\n            if (idx < parentArray.length) {\n              orderedElements.push({ type, element: parentArray[idx] });\n            }\n          }\n        }\n      }\n    }\n\n    // Remove the revision wrapper\n    delete parent[key];\n\n    // If we have ordered elements, rebuild the arrays in correct order\n    if (orderedElements.length > 0) {\n      // Group elements by type\n      const rebuiltArrays = new Map<string, any[]>();\n\n      for (const { type, element } of orderedElements) {\n        if (!rebuiltArrays.has(type)) {\n          rebuiltArrays.set(type, []);\n        }\n        rebuiltArrays.get(type)!.push(element);\n      }\n\n      // Update parent with rebuilt arrays\n      for (const [type, elements] of rebuiltArrays) {\n        if (elements.length === 1) {\n          parent[type] = elements[0];\n        } else {\n          parent[type] = elements;\n        }\n      }\n\n      // Rebuild _orderedChildren\n      const newOrderedChildren: OrderedChildInfo[] = [];\n      const typeCounters = new Map<string, number>();\n\n      for (const { type } of orderedElements) {\n        const idx = typeCounters.get(type) || 0;\n        typeCounters.set(type, idx + 1);\n        newOrderedChildren.push({ type, index: idx });\n      }\n\n      parent._orderedChildren = newOrderedChildren;\n    } else {\n      // Fallback for when there's no _orderedChildren - just merge\n      for (const element of elementArray) {\n        if (!element || typeof element !== 'object') continue;\n\n        const elementKeys = Object.keys(element).filter(\n          (k) => !k.startsWith('@_') && k !== '#text' && k !== '_orderedChildren'\n        );\n\n        for (const childKey of elementKeys) {\n          RevisionWalker.mergeIntoParent(parent, childKey, element[childKey]);\n        }\n      }\n    }\n  }\n\n  /**\n   * Remove all elements of a given type (including their content)\n   */\n  private static removeAllElements(parent: any, key: string): void {\n    if (!parent[key]) return;\n\n    // Update _orderedChildren before removing\n    if (parent._orderedChildren) {\n      parent._orderedChildren = parent._orderedChildren.filter(\n        (c: OrderedChildInfo) => c.type !== key\n      );\n      // Re-index remaining elements of same types\n      RevisionWalker.reindexOrderedChildren(parent._orderedChildren);\n    }\n\n    // Remove the element\n    delete parent[key];\n  }\n\n  /**\n   * Merge a child value into the parent, handling arrays properly\n   */\n  private static mergeIntoParent(parent: any, childKey: string, childValue: any): void {\n    if (parent[childKey] === undefined) {\n      // No existing value, just assign\n      parent[childKey] = childValue;\n    } else {\n      // Existing value, need to merge\n      const existing = parent[childKey];\n      const incoming = Array.isArray(childValue) ? childValue : [childValue];\n\n      if (Array.isArray(existing)) {\n        parent[childKey] = [...existing, ...incoming];\n      } else {\n        parent[childKey] = [existing, ...incoming];\n      }\n    }\n  }\n\n  /**\n   * Re-index _orderedChildren to ensure indices are sequential per type\n   */\n  private static reindexOrderedChildren(orderedChildren: OrderedChildInfo[]): void {\n    const typeCounters = new Map<string, number>();\n\n    for (const entry of orderedChildren) {\n      const currentIndex = typeCounters.get(entry.type) || 0;\n      entry.index = currentIndex;\n      typeCounters.set(entry.type, currentIndex + 1);\n    }\n  }\n\n  /**\n   * Check if an element is a revision-related element (any type)\n   */\n  static isRevisionElement(key: string): boolean {\n    return (\n      REVISION_ELEMENTS.UNWRAP.includes(key) ||\n      REVISION_ELEMENTS.REMOVE.includes(key) ||\n      REVISION_ELEMENTS.PROPERTY_CHANGES.includes(key) ||\n      REVISION_ELEMENTS.RANGE_MARKERS.includes(key)\n    );\n  }\n\n  /**\n   * Get revision element categories (for external use/testing)\n   */\n  static getRevisionElementCategories(): typeof REVISION_ELEMENTS {\n    return { ...REVISION_ELEMENTS };\n  }\n}\n"]}
+{"version":3,"file":"RevisionWalker.js","sourceRoot":"","sources":["../../src/processors/RevisionWalker.ts"],"names":[],"mappings":";;;AAqCA,MAAM,iBAAiB,GAAG;IAExB,MAAM,EAAE,CAAC,OAAO,EAAE,UAAU,CAAC;IAG7B,MAAM,EAAE,CAAC,OAAO,EAAE,YAAY,CAAC;IAG/B,gBAAgB,EAAE;QAChB,aAAa;QACb,aAAa;QACb,eAAe;QACf,cAAc;QACd,cAAc;QACd,gBAAgB;QAChB,iBAAiB;QACjB,mBAAmB;QACnB,iBAAiB;KAClB;IAGD,aAAa,EAAE;QACb,sBAAsB;QACtB,oBAAoB;QACpB,oBAAoB;QACpB,kBAAkB;QAClB,0BAA0B;QAC1B,wBAAwB;QACxB,0BAA0B;QAC1B,wBAAwB;QACxB,+BAA+B;QAC/B,6BAA6B;QAC7B,6BAA6B;QAC7B,2BAA2B;KAC5B;CACF,CAAC;AAcF,MAAa,cAAc;IAczB,MAAM,CAAC,WAAW,CAAC,GAAoB,EAAE,OAA+B;QACtE,MAAM,IAAI,GAAoC;YAC5C,gBAAgB,EAAE,OAAO,EAAE,gBAAgB,IAAI,IAAI;YACnD,eAAe,EAAE,OAAO,EAAE,eAAe,IAAI,IAAI;YACjD,WAAW,EAAE,OAAO,EAAE,WAAW,IAAI,IAAI;YACzC,qBAAqB,EAAE,OAAO,EAAE,qBAAqB,IAAI,IAAI;SAC9D,CAAC;QAGF,MAAM,KAAK,GAAG,cAAc,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;QAG5C,cAAc,CAAC,gBAAgB,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;QAE7C,OAAO,KAAK,CAAC;IACf,CAAC;IAKO,MAAM,CAAC,SAAS,CAAC,GAAQ;QAC/B,IAAI,GAAG,KAAK,IAAI,IAAI,OAAO,GAAG,KAAK,QAAQ,EAAE,CAAC;YAC5C,OAAO,GAAG,CAAC;QACb,CAAC;QAED,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;YACvB,OAAO,GAAG,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,cAAc,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC;QAC3D,CAAC;QAED,MAAM,KAAK,GAAQ,EAAE,CAAC;QACtB,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YACnC,KAAK,CAAC,GAAG,CAAC,GAAG,cAAc,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QAClD,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAMO,MAAM,CAAC,gBAAgB,CAAC,GAAQ,EAAE,OAAwC;QAChF,IAAI,GAAG,KAAK,IAAI,IAAI,OAAO,GAAG,KAAK,QAAQ,EAAE,CAAC;YAC5C,OAAO;QACT,CAAC;QAYD,IAAI,OAAO,CAAC,eAAe,IAAI,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;YAC5C,cAAc,CAAC,wBAAwB,CAAC,GAAG,CAAC,CAAC;QAC/C,CAAC;QACD,IAAI,OAAO,CAAC,eAAe,IAAI,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YAC3C,cAAc,CAAC,iBAAiB,CAAC,GAAG,CAAC,CAAC;QACxC,CAAC;QAGD,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,CAClC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,OAAO,IAAI,CAAC,KAAK,kBAAkB,CACxE,CAAC;QAGF,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,MAAM,KAAK,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;YACvB,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;gBACzB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;oBACzB,cAAc,CAAC,gBAAgB,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;gBACjD,CAAC;YACH,CAAC;iBAAM,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;gBACvD,cAAc,CAAC,gBAAgB,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;YAClD,CAAC;QACH,CAAC;QAID,cAAc,CAAC,gBAAgB,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;IAChD,CAAC;IAOO,MAAM,CAAC,iBAAiB,CAAC,GAAQ;QACvC,MAAM,IAAI,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC;QACzB,MAAM,YAAY,GAAG,CAAC,GAAQ,EAAW,EAAE;YACzC,IAAI,CAAC,GAAG,IAAI,OAAO,GAAG,KAAK,QAAQ;gBAAE,OAAO,KAAK,CAAC;YAClD,MAAM,IAAI,GAAG,GAAG,CAAC,QAAQ,CAAC,CAAC;YAC3B,IAAI,CAAC,IAAI,IAAI,OAAO,IAAI,KAAK,QAAQ;gBAAE,OAAO,KAAK,CAAC;YAIpD,OAAO,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACzB,CAAC,CAAC;QAEF,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;YACxB,MAAM,cAAc,GAAG,IAAI,GAAG,EAAU,CAAC;YACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACrC,IAAI,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;oBAAE,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACnD,CAAC;YACD,IAAI,cAAc,CAAC,IAAI,KAAK,CAAC;gBAAE,OAAO;YACtC,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAC3D,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACtB,OAAO,GAAG,CAAC,MAAM,CAAC,CAAC;YACrB,CAAC;iBAAM,CAAC;gBACN,GAAG,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC;YACrB,CAAC;YACD,cAAc,CAAC,uBAAuB,CAAC,GAAG,EAAE,MAAM,EAAE,cAAc,CAAC,CAAC;QACtE,CAAC;aAAM,IAAI,YAAY,CAAC,IAAI,CAAC,EAAE,CAAC;YAC9B,OAAO,GAAG,CAAC,MAAM,CAAC,CAAC;YACnB,cAAc,CAAC,uBAAuB,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACpE,CAAC;IACH,CAAC;IAYO,MAAM,CAAC,wBAAwB,CAAC,MAAW;QACjD,MAAM,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC;QAC/B,MAAM,cAAc,GAAG,CAAC,GAAQ,EAAW,EAAE;YAG3C,IAAI,CAAC,GAAG,IAAI,OAAO,GAAG,KAAK,QAAQ,IAAI,GAAG,CAAC,MAAM,CAAC,KAAK,SAAS;gBAAE,OAAO,KAAK,CAAC;YAC/E,cAAc,CAAC,iBAAiB,CAAC,GAAG,CAAC,CAAC;YACtC,OAAO,CACL,GAAG,CAAC,MAAM,CAAC,KAAK,SAAS;gBACzB,CAAC,GAAG,CAAC,OAAO,CAAC;gBACb,CAAC,GAAG,CAAC,UAAU,CAAC;gBAChB,CAAC,GAAG,CAAC,OAAO,CAAC;gBACb,CAAC,GAAG,CAAC,aAAa,CAAC,CACpB,CAAC;QACJ,CAAC,CAAC;QAEF,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;YAC1B,MAAM,cAAc,GAAG,IAAI,GAAG,EAAU,CAAC;YACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACvC,IAAI,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;oBAAE,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACvD,CAAC;YACD,IAAI,cAAc,CAAC,IAAI,KAAK,CAAC;gBAAE,OAAO;YACtC,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAM,EAAE,CAAS,EAAE,EAAE,CAAC,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAC1E,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACtB,OAAO,MAAM,CAAC,OAAO,CAAC,CAAC;YACzB,CAAC;iBAAM,CAAC;gBACN,MAAM,CAAC,OAAO,CAAC,GAAG,IAAI,CAAC;YACzB,CAAC;YACD,cAAc,CAAC,uBAAuB,CAAC,MAAM,EAAE,OAAO,EAAE,cAAc,CAAC,CAAC;QAC1E,CAAC;aAAM,IAAI,cAAc,CAAC,MAAM,CAAC,EAAE,CAAC;YAClC,OAAO,MAAM,CAAC,OAAO,CAAC,CAAC;YACvB,cAAc,CAAC,uBAAuB,CAAC,MAAM,EAAE,OAAO,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACxE,CAAC;IACH,CAAC;IASO,MAAM,CAAC,uBAAuB,CACpC,MAAW,EACX,IAAY,EACZ,cAA2B;QAE3B,IAAI,CAAC,MAAM,CAAC,gBAAgB;YAAE,OAAO;QACrC,MAAM,CAAC,gBAAgB,GAAG,MAAM,CAAC,gBAAgB,CAAC,MAAM,CACtD,CAAC,CAAmB,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CACzE,CAAC;QACF,cAAc,CAAC,sBAAsB,CAAC,MAAM,CAAC,gBAAgB,CAAC,CAAC;IACjE,CAAC;IAKO,MAAM,CAAC,gBAAgB,CAAC,MAAW,EAAE,OAAwC;QACnF,IAAI,CAAC,MAAM,IAAI,OAAO,MAAM,KAAK,QAAQ,EAAE,CAAC;YAC1C,OAAO;QACT,CAAC;QAED,MAAM,aAAa,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,MAAM,CAC9C,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,OAAO,IAAI,CAAC,KAAK,kBAAkB,CACxE,CAAC;QAEF,KAAK,MAAM,GAAG,IAAI,aAAa,EAAE,CAAC;YAEhC,IAAI,cAAc,CAAC,YAAY,CAAC,GAAG,EAAE,OAAO,CAAC,EAAE,CAAC;gBAC9C,cAAc,CAAC,iBAAiB,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;YAChD,CAAC;iBAAM,IAAI,cAAc,CAAC,YAAY,CAAC,GAAG,EAAE,OAAO,CAAC,EAAE,CAAC;gBACrD,cAAc,CAAC,iBAAiB,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;YAChD,CAAC;QACH,CAAC;IACH,CAAC;IAKO,MAAM,CAAC,YAAY,CAAC,GAAW,EAAE,OAAwC;QAC/E,IAAI,iBAAiB,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;YAC3C,IAAI,GAAG,KAAK,OAAO,IAAI,CAAC,OAAO,CAAC,gBAAgB;gBAAE,OAAO,KAAK,CAAC;YAC/D,IAAI,GAAG,KAAK,UAAU,IAAI,CAAC,OAAO,CAAC,WAAW;gBAAE,OAAO,KAAK,CAAC;YAC7D,OAAO,IAAI,CAAC;QACd,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAKO,MAAM,CAAC,YAAY,CAAC,GAAW,EAAE,OAAwC;QAC/E,IAAI,iBAAiB,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;YAC3C,IAAI,GAAG,KAAK,OAAO,IAAI,CAAC,OAAO,CAAC,eAAe;gBAAE,OAAO,KAAK,CAAC;YAC9D,IAAI,GAAG,KAAK,YAAY,IAAI,CAAC,OAAO,CAAC,WAAW;gBAAE,OAAO,KAAK,CAAC;YAC/D,OAAO,IAAI,CAAC;QACd,CAAC;QACD,IAAI,iBAAiB,CAAC,gBAAgB,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;YACrD,OAAO,OAAO,CAAC,qBAAqB,CAAC;QACvC,CAAC;QACD,IAAI,iBAAiB,CAAC,aAAa,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;YAClD,OAAO,IAAI,CAAC;QACd,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAeO,MAAM,CAAC,iBAAiB,CAAC,MAAW,EAAE,GAAW;QACvD,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;QAC7B,IAAI,CAAC,QAAQ;YAAE,OAAO;QAEtB,MAAM,YAAY,GAAG,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;QAIrE,MAAM,eAAe,GAAqC,EAAE,CAAC;QAE7D,IAAI,MAAM,CAAC,gBAAgB,EAAE,CAAC;YAE5B,MAAM,YAAY,GAAG,IAAI,GAAG,EAAkB,CAAC;YAC/C,IAAI,cAAc,GAAG,CAAC,CAAC;YAEvB,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,gBAAgB,EAAE,CAAC;gBAC5C,MAAM,EAAE,IAAI,EAAE,GAAG,KAAK,CAAC;gBAEvB,IAAI,IAAI,KAAK,GAAG,EAAE,CAAC;oBAEjB,MAAM,UAAU,GAAG,YAAY,CAAC,cAAc,CAAC,CAAC;oBAChD,cAAc,EAAE,CAAC;oBAEjB,IAAI,UAAU,IAAI,OAAO,UAAU,KAAK,QAAQ,EAAE,CAAC;wBACjD,IAAI,UAAU,CAAC,gBAAgB,EAAE,CAAC;4BAEhC,MAAM,aAAa,GAAG,IAAI,GAAG,EAAkB,CAAC;4BAChD,KAAK,MAAM,UAAU,IAAI,UAAU,CAAC,gBAAgB,EAAE,CAAC;gCACrD,MAAM,SAAS,GAAG,UAAU,CAAC,IAAI,CAAC;gCAClC,MAAM,QAAQ,GAAG,aAAa,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;gCACnD,aAAa,CAAC,GAAG,CAAC,SAAS,EAAE,QAAQ,GAAG,CAAC,CAAC,CAAC;gCAE3C,MAAM,aAAa,GAAG,UAAU,CAAC,SAAS,CAAC,CAAC;gCAC5C,IAAI,aAAa,EAAE,CAAC;oCAClB,MAAM,UAAU,GAAG,KAAK,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC;oCAClF,IAAI,QAAQ,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC;wCACjC,eAAe,CAAC,IAAI,CAAC;4CACnB,IAAI,EAAE,SAAS;4CACf,OAAO,EAAE,UAAU,CAAC,QAAQ,CAAC;yCAC9B,CAAC,CAAC;oCACL,CAAC;gCACH,CAAC;4BACH,CAAC;wBACH,CAAC;6BAAM,CAAC;4BAEN,MAAM,SAAS,GAAG,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,MAAM,CAC9C,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,OAAO,IAAI,CAAC,KAAK,kBAAkB,CACxE,CAAC;4BACF,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;gCACjC,MAAM,UAAU,GAAG,UAAU,CAAC,QAAQ,CAAC,CAAC;gCACxC,MAAM,UAAU,GAAG,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;gCACzE,KAAK,MAAM,KAAK,IAAI,UAAU,EAAE,CAAC;oCAC/B,eAAe,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC;gCAC3D,CAAC;4BACH,CAAC;wBACH,CAAC;oBACH,CAAC;gBACH,CAAC;qBAAM,CAAC;oBAEN,MAAM,GAAG,GAAG,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBACxC,YAAY,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC;oBAEhC,MAAM,cAAc,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;oBACpC,IAAI,cAAc,EAAE,CAAC;wBACnB,MAAM,WAAW,GAAG,KAAK,CAAC,OAAO,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC;wBACtF,IAAI,GAAG,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC;4BAC7B,eAAe,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;wBAC5D,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAGD,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC;QAGnB,IAAI,eAAe,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAE/B,MAAM,aAAa,GAAG,IAAI,GAAG,EAAiB,CAAC;YAE/C,KAAK,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,eAAe,EAAE,CAAC;gBAChD,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;oBAC7B,aAAa,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;gBAC9B,CAAC;gBACD,aAAa,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACzC,CAAC;YAGD,KAAK,MAAM,CAAC,IAAI,EAAE,QAAQ,CAAC,IAAI,aAAa,EAAE,CAAC;gBAC7C,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;oBAC1B,MAAM,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;gBAC7B,CAAC;qBAAM,CAAC;oBACN,MAAM,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC;gBAC1B,CAAC;YACH,CAAC;YAGD,MAAM,kBAAkB,GAAuB,EAAE,CAAC;YAClD,MAAM,YAAY,GAAG,IAAI,GAAG,EAAkB,CAAC;YAE/C,KAAK,MAAM,EAAE,IAAI,EAAE,IAAI,eAAe,EAAE,CAAC;gBACvC,MAAM,GAAG,GAAG,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACxC,YAAY,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC;gBAChC,kBAAkB,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC;YAChD,CAAC;YAED,MAAM,CAAC,gBAAgB,GAAG,kBAAkB,CAAC;QAC/C,CAAC;aAAM,CAAC;YAEN,KAAK,MAAM,OAAO,IAAI,YAAY,EAAE,CAAC;gBACnC,IAAI,CAAC,OAAO,IAAI,OAAO,OAAO,KAAK,QAAQ;oBAAE,SAAS;gBAEtD,MAAM,WAAW,GAAG,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,MAAM,CAC7C,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,OAAO,IAAI,CAAC,KAAK,kBAAkB,CACxE,CAAC;gBAEF,KAAK,MAAM,QAAQ,IAAI,WAAW,EAAE,CAAC;oBACnC,cAAc,CAAC,eAAe,CAAC,MAAM,EAAE,QAAQ,EAAE,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC;gBACtE,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAKO,MAAM,CAAC,iBAAiB,CAAC,MAAW,EAAE,GAAW;QACvD,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC;YAAE,OAAO;QAGzB,IAAI,MAAM,CAAC,gBAAgB,EAAE,CAAC;YAC5B,MAAM,CAAC,gBAAgB,GAAG,MAAM,CAAC,gBAAgB,CAAC,MAAM,CACtD,CAAC,CAAmB,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,GAAG,CACxC,CAAC;YAEF,cAAc,CAAC,sBAAsB,CAAC,MAAM,CAAC,gBAAgB,CAAC,CAAC;QACjE,CAAC;QAGD,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC;IACrB,CAAC;IAKO,MAAM,CAAC,eAAe,CAAC,MAAW,EAAE,QAAgB,EAAE,UAAe;QAC3E,IAAI,MAAM,CAAC,QAAQ,CAAC,KAAK,SAAS,EAAE,CAAC;YAEnC,MAAM,CAAC,QAAQ,CAAC,GAAG,UAAU,CAAC;QAChC,CAAC;aAAM,CAAC;YAEN,MAAM,QAAQ,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC;YAClC,MAAM,QAAQ,GAAG,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;YAEvE,IAAI,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAC5B,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,QAAQ,EAAE,GAAG,QAAQ,CAAC,CAAC;YAChD,CAAC;iBAAM,CAAC;gBACN,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,QAAQ,EAAE,GAAG,QAAQ,CAAC,CAAC;YAC7C,CAAC;QACH,CAAC;IACH,CAAC;IAKO,MAAM,CAAC,sBAAsB,CAAC,eAAmC;QACvE,MAAM,YAAY,GAAG,IAAI,GAAG,EAAkB,CAAC;QAE/C,KAAK,MAAM,KAAK,IAAI,eAAe,EAAE,CAAC;YACpC,MAAM,YAAY,GAAG,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACvD,KAAK,CAAC,KAAK,GAAG,YAAY,CAAC;YAC3B,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,YAAY,GAAG,CAAC,CAAC,CAAC;QACjD,CAAC;IACH,CAAC;IAKD,MAAM,CAAC,iBAAiB,CAAC,GAAW;QAClC,OAAO,CACL,iBAAiB,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC;YACtC,iBAAiB,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC;YACtC,iBAAiB,CAAC,gBAAgB,CAAC,QAAQ,CAAC,GAAG,CAAC;YAChD,iBAAiB,CAAC,aAAa,CAAC,QAAQ,CAAC,GAAG,CAAC,CAC9C,CAAC;IACJ,CAAC;IAKD,MAAM,CAAC,4BAA4B;QACjC,OAAO,EAAE,GAAG,iBAAiB,EAAE,CAAC;IAClC,CAAC;CACF;AAzcD,wCAycC","sourcesContent":["/**\n * RevisionWalker - DOM-based tree walker for accepting tracked changes\n *\n * Replaces the fragile RegEx-based revision acceptance with a robust\n * DOM-based approach that properly handles nested elements and preserves\n * element ordering.\n *\n * @module RevisionWalker\n */\n\nimport { ParsedXMLObject } from '../xml/XMLParser.js';\n\n/**\n * Options for controlling which revision types to accept\n */\nexport interface RevisionWalkerOptions {\n  /** Keep content, remove w:ins wrapper (default: true) */\n  acceptInsertions?: boolean;\n  /** Remove w:del and content entirely (default: true) */\n  acceptDeletions?: boolean;\n  /** Handle w:moveFrom/w:moveTo (default: true) */\n  acceptMoves?: boolean;\n  /** Remove *Change elements (default: true) */\n  acceptPropertyChanges?: boolean;\n}\n\n/**\n * Structure for tracking element order\n */\ninterface OrderedChildInfo {\n  type: string;\n  index: number;\n}\n\n/**\n * Revision element categories\n */\nconst REVISION_ELEMENTS = {\n  /** Elements to unwrap (keep content, remove wrapper) */\n  UNWRAP: ['w:ins', 'w:moveTo'],\n\n  /** Elements to remove entirely (with content) */\n  REMOVE: ['w:del', 'w:moveFrom'],\n\n  /** Property change tracking elements */\n  PROPERTY_CHANGES: [\n    'w:rPrChange',\n    'w:pPrChange',\n    'w:tblPrChange',\n    'w:tcPrChange',\n    'w:trPrChange',\n    'w:sectPrChange',\n    'w:tblGridChange',\n    'w:numberingChange',\n    'w:tblPrExChange',\n  ],\n\n  /** Range marker elements */\n  RANGE_MARKERS: [\n    'w:moveFromRangeStart',\n    'w:moveFromRangeEnd',\n    'w:moveToRangeStart',\n    'w:moveToRangeEnd',\n    'w:customXmlInsRangeStart',\n    'w:customXmlInsRangeEnd',\n    'w:customXmlDelRangeStart',\n    'w:customXmlDelRangeEnd',\n    'w:customXmlMoveFromRangeStart',\n    'w:customXmlMoveFromRangeEnd',\n    'w:customXmlMoveToRangeStart',\n    'w:customXmlMoveToRangeEnd',\n  ],\n};\n\n/**\n * DOM-based tree walker for accepting Word document revisions\n *\n * This class processes a parsed XML object tree (from XMLParser.parseToObject())\n * and accepts all tracked changes by:\n * - Unwrapping insertions (w:ins, w:moveTo) - keeping content\n * - Removing deletions (w:del, w:moveFrom) - discarding content\n * - Removing property changes (*Change elements)\n * - Removing range markers\n *\n * Element order is preserved using the _orderedChildren metadata.\n */\nexport class RevisionWalker {\n  /**\n   * Process a parsed XML object tree and accept all revisions\n   *\n   * @param obj - Parsed XML object from XMLParser.parseToObject()\n   * @param options - Options controlling which revisions to accept\n   * @returns New object tree with revisions accepted\n   *\n   * @example\n   * ```typescript\n   * const parsed = XMLParser.parseToObject(documentXml);\n   * const clean = RevisionWalker.processTree(parsed);\n   * ```\n   */\n  static processTree(obj: ParsedXMLObject, options?: RevisionWalkerOptions): ParsedXMLObject {\n    const opts: Required<RevisionWalkerOptions> = {\n      acceptInsertions: options?.acceptInsertions ?? true,\n      acceptDeletions: options?.acceptDeletions ?? true,\n      acceptMoves: options?.acceptMoves ?? true,\n      acceptPropertyChanges: options?.acceptPropertyChanges ?? true,\n    };\n\n    // Deep clone the object to avoid mutating the original\n    const clone = RevisionWalker.deepClone(obj);\n\n    // Walk and transform the tree\n    RevisionWalker.walkAndTransform(clone, opts);\n\n    return clone;\n  }\n\n  /**\n   * Deep clone an object\n   */\n  private static deepClone(obj: any): any {\n    if (obj === null || typeof obj !== 'object') {\n      return obj;\n    }\n\n    if (Array.isArray(obj)) {\n      return obj.map((item) => RevisionWalker.deepClone(item));\n    }\n\n    const clone: any = {};\n    for (const key of Object.keys(obj)) {\n      clone[key] = RevisionWalker.deepClone(obj[key]);\n    }\n    return clone;\n  }\n\n  /**\n   * Recursively walk and transform the object tree\n   * Processes children first (depth-first) to handle nested revisions\n   */\n  private static walkAndTransform(obj: any, options: Required<RevisionWalkerOptions>): void {\n    if (obj === null || typeof obj !== 'object') {\n      return;\n    }\n\n    // Pre-recursion: row-level tracked deletions (CT_TrPr > w:del per\n    // §17.13.5.14). Must run BEFORE the depth-first recursion — otherwise\n    // processRevisions in trPr would strip the w:del marker before we can\n    // detect it at the table level. The default `w:del` removal in\n    // processRevisions only strips the marker itself, leaving a zombie\n    // empty row; per spec, accepting the deletion removes the entire row.\n    // Tables are checked from the parent first: a table whose rows are ALL\n    // tracked-deleted must be removed entirely (a row-less w:tbl violates\n    // §17.4.38's at-least-one-row requirement and Word's Accept All drops\n    // the whole table), and only the parent can remove the w:tbl itself.\n    if (options.acceptDeletions && obj['w:tbl']) {\n      RevisionWalker.removeFullyDeletedTables(obj);\n    }\n    if (options.acceptDeletions && obj['w:tr']) {\n      RevisionWalker.filterDeletedRows(obj);\n    }\n\n    // Get keys to process (excluding metadata keys)\n    const keys = Object.keys(obj).filter(\n      (k) => !k.startsWith('@_') && k !== '#text' && k !== '_orderedChildren'\n    );\n\n    // First pass: recurse into children (depth-first)\n    for (const key of keys) {\n      const value = obj[key];\n      if (Array.isArray(value)) {\n        for (const item of value) {\n          RevisionWalker.walkAndTransform(item, options);\n        }\n      } else if (typeof value === 'object' && value !== null) {\n        RevisionWalker.walkAndTransform(value, options);\n      }\n    }\n\n    // Second pass: process revision elements at this level\n    // We need to iterate carefully because we're modifying the object\n    RevisionWalker.processRevisions(obj, options);\n  }\n\n  /**\n   * Remove `<w:tr>` entries whose `<w:trPr>` contains a self-closing\n   * `<w:del/>` row-level deletion marker. Operates on the parsed-object\n   * representation (arrays when multiple, single object otherwise).\n   */\n  private static filterDeletedRows(tbl: any): void {\n    const rows = tbl['w:tr'];\n    const isRowDeleted = (row: any): boolean => {\n      if (!row || typeof row !== 'object') return false;\n      const trPr = row['w:trPr'];\n      if (!trPr || typeof trPr !== 'object') return false;\n      // w:del at row level is a CT_TrackChange (no children). When absent\n      // the parser leaves no key; when present it's a self-closing tag\n      // parsed as an object with only @_w:id/@_w:author/@_w:date keys.\n      return !!trPr['w:del'];\n    };\n\n    if (Array.isArray(rows)) {\n      const removedIndices = new Set<number>();\n      for (let i = 0; i < rows.length; i++) {\n        if (isRowDeleted(rows[i])) removedIndices.add(i);\n      }\n      if (removedIndices.size === 0) return;\n      const kept = rows.filter((_, i) => !removedIndices.has(i));\n      if (kept.length === 0) {\n        delete tbl['w:tr'];\n      } else {\n        tbl['w:tr'] = kept;\n      }\n      RevisionWalker.dropOrderedChildEntries(tbl, 'w:tr', removedIndices);\n    } else if (isRowDeleted(rows)) {\n      delete tbl['w:tr'];\n      RevisionWalker.dropOrderedChildEntries(tbl, 'w:tr', new Set([0]));\n    }\n  }\n\n  /**\n   * Remove `<w:tbl>` children whose rows are ALL tracked-deleted.\n   *\n   * Runs at the table's parent because filterDeletedRows (invoked on the\n   * table itself) has no reference back to the container holding the\n   * `w:tbl` key. Skips tables that still carry potential row containers\n   * (w:ins / w:moveTo wrappers, w:sdt, w:customXml) — their surviving rows\n   * are only materialized as direct `w:tr` children later, when the\n   * wrappers are unwrapped during recursion.\n   */\n  private static removeFullyDeletedTables(parent: any): void {\n    const tables = parent['w:tbl'];\n    const becomesRowless = (tbl: any): boolean => {\n      // Tables with no rows at all are pre-existing structures, not the\n      // result of accepting a deletion — leave them untouched.\n      if (!tbl || typeof tbl !== 'object' || tbl['w:tr'] === undefined) return false;\n      RevisionWalker.filterDeletedRows(tbl);\n      return (\n        tbl['w:tr'] === undefined &&\n        !tbl['w:ins'] &&\n        !tbl['w:moveTo'] &&\n        !tbl['w:sdt'] &&\n        !tbl['w:customXml']\n      );\n    };\n\n    if (Array.isArray(tables)) {\n      const removedIndices = new Set<number>();\n      for (let i = 0; i < tables.length; i++) {\n        if (becomesRowless(tables[i])) removedIndices.add(i);\n      }\n      if (removedIndices.size === 0) return;\n      const kept = tables.filter((_: any, i: number) => !removedIndices.has(i));\n      if (kept.length === 0) {\n        delete parent['w:tbl'];\n      } else {\n        parent['w:tbl'] = kept;\n      }\n      RevisionWalker.dropOrderedChildEntries(parent, 'w:tbl', removedIndices);\n    } else if (becomesRowless(tables)) {\n      delete parent['w:tbl'];\n      RevisionWalker.dropOrderedChildEntries(parent, 'w:tbl', new Set([0]));\n    }\n  }\n\n  /**\n   * Drop specific {type, index} entries from `_orderedChildren` and\n   * re-index the survivors. The serializer maps each entry onto the\n   * element array by index, so stale entries left after filtering would\n   * shift surviving elements relative to inter-element siblings (e.g. a\n   * w:bookmarkEnd between table rows) or silently drop the tail.\n   */\n  private static dropOrderedChildEntries(\n    parent: any,\n    type: string,\n    removedIndices: Set<number>\n  ): void {\n    if (!parent._orderedChildren) return;\n    parent._orderedChildren = parent._orderedChildren.filter(\n      (c: OrderedChildInfo) => c.type !== type || !removedIndices.has(c.index)\n    );\n    RevisionWalker.reindexOrderedChildren(parent._orderedChildren);\n  }\n\n  /**\n   * Process revision elements at the current level\n   */\n  private static processRevisions(parent: any, options: Required<RevisionWalkerOptions>): void {\n    if (!parent || typeof parent !== 'object') {\n      return;\n    }\n\n    const keysToProcess = Object.keys(parent).filter(\n      (k) => !k.startsWith('@_') && k !== '#text' && k !== '_orderedChildren'\n    );\n\n    for (const key of keysToProcess) {\n      // Check if this is a revision element\n      if (RevisionWalker.shouldUnwrap(key, options)) {\n        RevisionWalker.unwrapAllElements(parent, key);\n      } else if (RevisionWalker.shouldRemove(key, options)) {\n        RevisionWalker.removeAllElements(parent, key);\n      }\n    }\n  }\n\n  /**\n   * Check if an element should be unwrapped (content kept)\n   */\n  private static shouldUnwrap(key: string, options: Required<RevisionWalkerOptions>): boolean {\n    if (REVISION_ELEMENTS.UNWRAP.includes(key)) {\n      if (key === 'w:ins' && !options.acceptInsertions) return false;\n      if (key === 'w:moveTo' && !options.acceptMoves) return false;\n      return true;\n    }\n    return false;\n  }\n\n  /**\n   * Check if an element should be removed (content discarded)\n   */\n  private static shouldRemove(key: string, options: Required<RevisionWalkerOptions>): boolean {\n    if (REVISION_ELEMENTS.REMOVE.includes(key)) {\n      if (key === 'w:del' && !options.acceptDeletions) return false;\n      if (key === 'w:moveFrom' && !options.acceptMoves) return false;\n      return true;\n    }\n    if (REVISION_ELEMENTS.PROPERTY_CHANGES.includes(key)) {\n      return options.acceptPropertyChanges;\n    }\n    if (REVISION_ELEMENTS.RANGE_MARKERS.includes(key)) {\n      return true; // Always remove range markers\n    }\n    return false;\n  }\n\n  /**\n   * Unwrap all elements of a given type, promoting their children to parent\n   *\n   * This is the most complex operation in RevisionWalker. When we unwrap a\n   * revision element like w:ins, we need to:\n   * 1. Extract the children from inside w:ins\n   * 2. Insert them at the correct position in the parent's element arrays\n   * 3. Update _orderedChildren to reflect the new structure\n   *\n   * The key challenge is maintaining correct element order. For example:\n   *   Before: <w:tbl><w:tr>Row1</w:tr><w:ins><w:tr>Row2</w:tr></w:ins><w:tr>Row3</w:tr></w:tbl>\n   *   After:  <w:tbl><w:tr>Row1</w:tr><w:tr>Row2</w:tr><w:tr>Row3</w:tr></w:tbl>\n   */\n  private static unwrapAllElements(parent: any, key: string): void {\n    const elements = parent[key];\n    if (!elements) return;\n\n    const elementArray = Array.isArray(elements) ? elements : [elements];\n\n    // Build a complete ordered list of child elements by walking _orderedChildren\n    // This captures the intended order before we modify anything\n    const orderedElements: { type: string; element: any }[] = [];\n\n    if (parent._orderedChildren) {\n      // Track how many of each type we've seen to get correct array index\n      const typeCounters = new Map<string, number>();\n      let unwrappedIndex = 0;\n\n      for (const entry of parent._orderedChildren) {\n        const { type } = entry;\n\n        if (type === key) {\n          // This is a revision element - extract its children in order\n          const revElement = elementArray[unwrappedIndex];\n          unwrappedIndex++;\n\n          if (revElement && typeof revElement === 'object') {\n            if (revElement._orderedChildren) {\n              // Use the revision element's _orderedChildren for correct order\n              const childCounters = new Map<string, number>();\n              for (const childEntry of revElement._orderedChildren) {\n                const childType = childEntry.type;\n                const childIdx = childCounters.get(childType) || 0;\n                childCounters.set(childType, childIdx + 1);\n\n                const childElements = revElement[childType];\n                if (childElements) {\n                  const childArray = Array.isArray(childElements) ? childElements : [childElements];\n                  if (childIdx < childArray.length) {\n                    orderedElements.push({\n                      type: childType,\n                      element: childArray[childIdx],\n                    });\n                  }\n                }\n              }\n            } else {\n              // No _orderedChildren, extract children in object key order\n              const childKeys = Object.keys(revElement).filter(\n                (k) => !k.startsWith('@_') && k !== '#text' && k !== '_orderedChildren'\n              );\n              for (const childKey of childKeys) {\n                const childValue = revElement[childKey];\n                const childArray = Array.isArray(childValue) ? childValue : [childValue];\n                for (const child of childArray) {\n                  orderedElements.push({ type: childKey, element: child });\n                }\n              }\n            }\n          }\n        } else {\n          // Regular element - get it from the parent\n          const idx = typeCounters.get(type) || 0;\n          typeCounters.set(type, idx + 1);\n\n          const parentElements = parent[type];\n          if (parentElements) {\n            const parentArray = Array.isArray(parentElements) ? parentElements : [parentElements];\n            if (idx < parentArray.length) {\n              orderedElements.push({ type, element: parentArray[idx] });\n            }\n          }\n        }\n      }\n    }\n\n    // Remove the revision wrapper\n    delete parent[key];\n\n    // If we have ordered elements, rebuild the arrays in correct order\n    if (orderedElements.length > 0) {\n      // Group elements by type\n      const rebuiltArrays = new Map<string, any[]>();\n\n      for (const { type, element } of orderedElements) {\n        if (!rebuiltArrays.has(type)) {\n          rebuiltArrays.set(type, []);\n        }\n        rebuiltArrays.get(type)!.push(element);\n      }\n\n      // Update parent with rebuilt arrays\n      for (const [type, elements] of rebuiltArrays) {\n        if (elements.length === 1) {\n          parent[type] = elements[0];\n        } else {\n          parent[type] = elements;\n        }\n      }\n\n      // Rebuild _orderedChildren\n      const newOrderedChildren: OrderedChildInfo[] = [];\n      const typeCounters = new Map<string, number>();\n\n      for (const { type } of orderedElements) {\n        const idx = typeCounters.get(type) || 0;\n        typeCounters.set(type, idx + 1);\n        newOrderedChildren.push({ type, index: idx });\n      }\n\n      parent._orderedChildren = newOrderedChildren;\n    } else {\n      // Fallback for when there's no _orderedChildren - just merge\n      for (const element of elementArray) {\n        if (!element || typeof element !== 'object') continue;\n\n        const elementKeys = Object.keys(element).filter(\n          (k) => !k.startsWith('@_') && k !== '#text' && k !== '_orderedChildren'\n        );\n\n        for (const childKey of elementKeys) {\n          RevisionWalker.mergeIntoParent(parent, childKey, element[childKey]);\n        }\n      }\n    }\n  }\n\n  /**\n   * Remove all elements of a given type (including their content)\n   */\n  private static removeAllElements(parent: any, key: string): void {\n    if (!parent[key]) return;\n\n    // Update _orderedChildren before removing\n    if (parent._orderedChildren) {\n      parent._orderedChildren = parent._orderedChildren.filter(\n        (c: OrderedChildInfo) => c.type !== key\n      );\n      // Re-index remaining elements of same types\n      RevisionWalker.reindexOrderedChildren(parent._orderedChildren);\n    }\n\n    // Remove the element\n    delete parent[key];\n  }\n\n  /**\n   * Merge a child value into the parent, handling arrays properly\n   */\n  private static mergeIntoParent(parent: any, childKey: string, childValue: any): void {\n    if (parent[childKey] === undefined) {\n      // No existing value, just assign\n      parent[childKey] = childValue;\n    } else {\n      // Existing value, need to merge\n      const existing = parent[childKey];\n      const incoming = Array.isArray(childValue) ? childValue : [childValue];\n\n      if (Array.isArray(existing)) {\n        parent[childKey] = [...existing, ...incoming];\n      } else {\n        parent[childKey] = [existing, ...incoming];\n      }\n    }\n  }\n\n  /**\n   * Re-index _orderedChildren to ensure indices are sequential per type\n   */\n  private static reindexOrderedChildren(orderedChildren: OrderedChildInfo[]): void {\n    const typeCounters = new Map<string, number>();\n\n    for (const entry of orderedChildren) {\n      const currentIndex = typeCounters.get(entry.type) || 0;\n      entry.index = currentIndex;\n      typeCounters.set(entry.type, currentIndex + 1);\n    }\n  }\n\n  /**\n   * Check if an element is a revision-related element (any type)\n   */\n  static isRevisionElement(key: string): boolean {\n    return (\n      REVISION_ELEMENTS.UNWRAP.includes(key) ||\n      REVISION_ELEMENTS.REMOVE.includes(key) ||\n      REVISION_ELEMENTS.PROPERTY_CHANGES.includes(key) ||\n      REVISION_ELEMENTS.RANGE_MARKERS.includes(key)\n    );\n  }\n\n  /**\n   * Get revision element categories (for external use/testing)\n   */\n  static getRevisionElementCategories(): typeof REVISION_ELEMENTS {\n    return { ...REVISION_ELEMENTS };\n  }\n}\n"]}

package/dist/processors/SelectiveRevisionAcceptor.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"SelectiveRevisionAcceptor.d.ts","sourceRoot":"","sources":["../../src/processors/SelectiveRevisionAcceptor.ts"],"names":[],"mappings":"AAcA,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,qBAAqB,CAAC;AAEpD,OAAO,EAAY,YAAY,EAAE,MAAM,yBAAyB,CAAC;AAIjE,OAAO,EAAE,iBAAiB,EAAE,MAAM,6BAA6B,CAAC;AAKhE,MAAM,WAAW,qBAAqB;IAEpC,QAAQ,EAAE,MAAM,EAAE,CAAC;IAEnB,QAAQ,EAAE,MAAM,EAAE,CAAC;IAEnB,SAAS,EAAE,MAAM,EAAE,CAAC;IAEpB,OAAO,EAAE;QACP,cAAc,EAAE,MAAM,CAAC;QACvB,aAAa,EAAE,MAAM,CAAC;QACtB,aAAa,EAAE,MAAM,CAAC;QACtB,cAAc,EAAE,MAAM,CAAC;KACxB,CAAC;CACH;AAMD,qBAAa,yBAAyB;IAUpC,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,QAAQ,EAAE,QAAQ,EAAE,iBAAiB,GAAG,qBAAqB;IA4DhF,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,QAAQ,EAAE,QAAQ,EAAE,iBAAiB,GAAG,qBAAqB;IA0DhF,OAAO,CAAC,MAAM,CAAC,iBAAiB;IAiFhC,OAAO,CAAC,MAAM,CAAC,yBAAyB;IAmExC,OAAO,CAAC,MAAM,CAAC,qBAAqB;IA8CpC,OAAO,CAAC,MAAM,CAAC,kBAAkB;IAmDjC,OAAO,CAAC,MAAM,CAAC,kBAAkB;IAwDjC,MAAM,CAAC,OAAO,CACZ,GAAG,EAAE,QAAQ,EACb,QAAQ,EAAE,iBAAiB,EAC3B,MAAM,EAAE,QAAQ,GAAG,QAAQ,GAC1B,qBAAqB;IAYxB,MAAM,CAAC,cAAc,CAAC,GAAG,EAAE,QAAQ,EAAE,MAAM,EAAE,MAAM,GAAG,qBAAqB;IAW3E,MAAM,CAAC,cAAc,CAAC,GAAG,EAAE,QAAQ,EAAE,MAAM,EAAE,MAAM,GAAG,qBAAqB;IAW3E,MAAM,CAAC,YAAY,CAAC,GAAG,EAAE,QAAQ,EAAE,KAAK,EAAE,YAAY,EAAE,GAAG,qBAAqB;IAWhF,MAAM,CAAC,YAAY,CAAC,GAAG,EAAE,QAAQ,EAAE,KAAK,EAAE,YAAY,EAAE,GAAG,qBAAqB;IAWhF,MAAM,CAAC,gBAAgB,CAAC,GAAG,EAAE,QAAQ,EAAE,IAAI,EAAE,IAAI,GAAG,qBAAqB;IAazE,MAAM,CAAC,eAAe,CAAC,GAAG,EAAE,QAAQ,EAAE,IAAI,EAAE,IAAI,GAAG,qBAAqB;IAYxE,MAAM,CAAC,oBAAoB,CAAC,GAAG,EAAE,QAAQ,GAAG,qBAAqB;IAUjE,MAAM,CAAC,mBAAmB,CAAC,GAAG,EAAE,QAAQ,GAAG,qBAAqB;IAUhE,MAAM,CAAC,uBAAuB,CAAC,GAAG,EAAE,QAAQ,GAAG,qBAAqB;IAUpE,MAAM,CAAC,wBAAwB,CAAC,GAAG,EAAE,QAAQ,GAAG,qBAAqB;IAOrE,OAAO,CAAC,MAAM,CAAC,eAAe;IAuD9B,OAAO,CAAC,MAAM,CAAC,mBAAmB;CA8BnC"}
+{"version":3,"file":"SelectiveRevisionAcceptor.d.ts","sourceRoot":"","sources":["../../src/processors/SelectiveRevisionAcceptor.ts"],"names":[],"mappings":"AAcA,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,qBAAqB,CAAC;AAEpD,OAAO,EAAY,YAAY,EAAE,MAAM,yBAAyB,CAAC;AAIjE,OAAO,EAAE,iBAAiB,EAAE,MAAM,6BAA6B,CAAC;AAMhE,MAAM,WAAW,qBAAqB;IAEpC,QAAQ,EAAE,MAAM,EAAE,CAAC;IAEnB,QAAQ,EAAE,MAAM,EAAE,CAAC;IAEnB,SAAS,EAAE,MAAM,EAAE,CAAC;IAEpB,OAAO,EAAE;QACP,cAAc,EAAE,MAAM,CAAC;QACvB,aAAa,EAAE,MAAM,CAAC;QACtB,aAAa,EAAE,MAAM,CAAC;QACtB,cAAc,EAAE,MAAM,CAAC;KACxB,CAAC;CACH;AAMD,qBAAa,yBAAyB;IAUpC,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,QAAQ,EAAE,QAAQ,EAAE,iBAAiB,GAAG,qBAAqB;IA0EhF,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,QAAQ,EAAE,QAAQ,EAAE,iBAAiB,GAAG,qBAAqB;IA0DhF,OAAO,CAAC,MAAM,CAAC,iBAAiB;IAiFhC,OAAO,CAAC,MAAM,CAAC,yBAAyB;IA4ExC,OAAO,CAAC,MAAM,CAAC,qBAAqB;IA8CpC,OAAO,CAAC,MAAM,CAAC,kBAAkB;IAwDjC,OAAO,CAAC,MAAM,CAAC,kBAAkB;IAsGjC,MAAM,CAAC,OAAO,CACZ,GAAG,EAAE,QAAQ,EACb,QAAQ,EAAE,iBAAiB,EAC3B,MAAM,EAAE,QAAQ,GAAG,QAAQ,GAC1B,qBAAqB;IAyExB,MAAM,CAAC,cAAc,CAAC,GAAG,EAAE,QAAQ,EAAE,MAAM,EAAE,MAAM,GAAG,qBAAqB;IAW3E,MAAM,CAAC,cAAc,CAAC,GAAG,EAAE,QAAQ,EAAE,MAAM,EAAE,MAAM,GAAG,qBAAqB;IAW3E,MAAM,CAAC,YAAY,CAAC,GAAG,EAAE,QAAQ,EAAE,KAAK,EAAE,YAAY,EAAE,GAAG,qBAAqB;IAWhF,MAAM,CAAC,YAAY,CAAC,GAAG,EAAE,QAAQ,EAAE,KAAK,EAAE,YAAY,EAAE,GAAG,qBAAqB;IAWhF,MAAM,CAAC,gBAAgB,CAAC,GAAG,EAAE,QAAQ,EAAE,IAAI,EAAE,IAAI,GAAG,qBAAqB;IAazE,MAAM,CAAC,eAAe,CAAC,GAAG,EAAE,QAAQ,EAAE,IAAI,EAAE,IAAI,GAAG,qBAAqB;IAYxE,MAAM,CAAC,oBAAoB,CAAC,GAAG,EAAE,QAAQ,GAAG,qBAAqB;IAUjE,MAAM,CAAC,mBAAmB,CAAC,GAAG,EAAE,QAAQ,GAAG,qBAAqB;IAUhE,MAAM,CAAC,uBAAuB,CAAC,GAAG,EAAE,QAAQ,GAAG,qBAAqB;IAUpE,MAAM,CAAC,wBAAwB,CAAC,GAAG,EAAE,QAAQ,GAAG,qBAAqB;IAOrE,OAAO,CAAC,MAAM,CAAC,eAAe;IAuD9B,OAAO,CAAC,MAAM,CAAC,mBAAmB;CA8BnC"}