docxmlater 10.4.0 → 11.0.4

package/dist/esm/processors/RevisionWalker.js.map

@@ -0,0 +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,MAAM,OAAO,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","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"]}

package/dist/{utils → esm/processors}/SelectiveRevisionAcceptor.js

@@ -1,28 +1,14 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.SelectiveRevisionAcceptor = void 0;
-const Revision_1 = require("../elements/Revision");
-const RevisionContent_1 = require("../elements/RevisionContent");
-class SelectiveRevisionAcceptor {
+import { Revision } from '../elements/Revision.js';
+import { isRunContent, isHyperlinkContent } from '../elements/RevisionContent.js';
+export class SelectiveRevisionAcceptor {
     static accept(doc, criteria) {
         const accepted = [];
         const remaining = [];
         const hasFullApi = typeof doc.getAllParagraphs === 'function';
         if (hasFullApi) {
-            const paragraphs = doc.getAllParagraphs();
-            for (const paragraph of paragraphs) {
+            this.walkAllParagraphs(doc, (paragraph) => {
                 this.processSelectiveParagraph(paragraph, criteria, 'accept', accepted, remaining);
-            }
-            const tables = doc.getTables();
-            for (const table of tables) {
-                for (const row of table.getRows()) {
-                    for (const cell of row.getCells()) {
-                        for (const paragraph of cell.getParagraphs()) {
-                            this.processSelectiveParagraph(paragraph, criteria, 'accept', accepted, remaining);
-                        }
-                    }
-                }
-            }
+            });
         }
         else {
             const revisionManager = doc.getRevisionManager();
@@ -61,20 +47,9 @@ class SelectiveRevisionAcceptor {
         const remaining = [];
         const hasFullApi = typeof doc.getAllParagraphs === 'function';
         if (hasFullApi) {
-            const paragraphs = doc.getAllParagraphs();
-            for (const paragraph of paragraphs) {
+            this.walkAllParagraphs(doc, (paragraph) => {
                 this.processSelectiveParagraph(paragraph, criteria, 'reject', rejected, remaining);
-            }
-            const tables = doc.getTables();
-            for (const table of tables) {
-                for (const row of table.getRows()) {
-                    for (const cell of row.getCells()) {
-                        for (const paragraph of cell.getParagraphs()) {
-                            this.processSelectiveParagraph(paragraph, criteria, 'reject', rejected, remaining);
-                        }
-                    }
-                }
-            }
+            });
         }
         else {
             const revisionManager = doc.getRevisionManager();
@@ -108,11 +83,76 @@ class SelectiveRevisionAcceptor {
             },
         };
     }
+    static walkAllParagraphs(doc, visit) {
+        for (const paragraph of doc.getAllParagraphs()) {
+            visit(paragraph);
+        }
+        for (const table of doc.getTables()) {
+            for (const row of table.getRows()) {
+                for (const cell of row.getCells()) {
+                    for (const paragraph of cell.getParagraphs()) {
+                        visit(paragraph);
+                    }
+                }
+            }
+        }
+        const hfManager = doc.getHeaderFooterManager?.();
+        if (hfManager) {
+            for (const headerEntry of hfManager.getAllHeaders()) {
+                for (const element of headerEntry.header.getElements()) {
+                    if (typeof element.getContent === 'function' && typeof element.getRuns === 'function') {
+                        visit(element);
+                    }
+                    else if (typeof element.getRows === 'function') {
+                        for (const row of element.getRows()) {
+                            for (const cell of row.getCells()) {
+                                for (const paragraph of cell.getParagraphs()) {
+                                    visit(paragraph);
+                                }
+                            }
+                        }
+                    }
+                }
+            }
+            for (const footerEntry of hfManager.getAllFooters()) {
+                for (const element of footerEntry.footer.getElements()) {
+                    if (typeof element.getContent === 'function' && typeof element.getRuns === 'function') {
+                        visit(element);
+                    }
+                    else if (typeof element.getRows === 'function') {
+                        for (const row of element.getRows()) {
+                            for (const cell of row.getCells()) {
+                                for (const paragraph of cell.getParagraphs()) {
+                                    visit(paragraph);
+                                }
+                            }
+                        }
+                    }
+                }
+            }
+        }
+        const footnoteManager = doc.getFootnoteManager?.();
+        if (footnoteManager) {
+            for (const fn of footnoteManager.getAllFootnotes()) {
+                for (const paragraph of fn.getParagraphs()) {
+                    visit(paragraph);
+                }
+            }
+        }
+        const endnoteManager = doc.getEndnoteManager?.();
+        if (endnoteManager) {
+            for (const en of endnoteManager.getAllEndnotes()) {
+                for (const paragraph of en.getParagraphs()) {
+                    visit(paragraph);
+                }
+            }
+        }
+    }
     static processSelectiveParagraph(paragraph, criteria, action, processedIds, remainingIds) {
         const content = paragraph.getContent();
         const newContent = [];
         for (const item of content) {
-            if (item instanceof Revision_1.Revision) {
+            if (item instanceof Revision) {
                 const revisionId = item.getId().toString();
                 if (this.matchesCriteria(item, criteria)) {
                     processedIds.push(revisionId);
@@ -187,10 +227,10 @@ class SelectiveRevisionAcceptor {
             case 'insert':
             case 'moveTo':
                 for (const child of childContent) {
-                    if ((0, RevisionContent_1.isRunContent)(child)) {
+                    if (isRunContent(child)) {
                         newContent.push(child);
                     }
-                    else if ((0, RevisionContent_1.isHyperlinkContent)(child)) {
+                    else if (isHyperlinkContent(child)) {
                         newContent.push(child);
                     }
                 }
@@ -207,10 +247,10 @@ class SelectiveRevisionAcceptor {
             case 'sectionPropertiesChange':
             case 'numberingChange':
                 for (const child of childContent) {
-                    if ((0, RevisionContent_1.isRunContent)(child)) {
+                    if (isRunContent(child)) {
                         newContent.push(child);
                     }
-                    else if ((0, RevisionContent_1.isHyperlinkContent)(child)) {
+                    else if (isHyperlinkContent(child)) {
                         newContent.push(child);
                     }
                 }
@@ -229,10 +269,10 @@ class SelectiveRevisionAcceptor {
             case 'delete':
             case 'moveFrom':
                 for (const child of childContent) {
-                    if ((0, RevisionContent_1.isRunContent)(child)) {
+                    if (isRunContent(child)) {
                         newContent.push(child);
                     }
-                    else if ((0, RevisionContent_1.isHyperlinkContent)(child)) {
+                    else if (isHyperlinkContent(child)) {
                         newContent.push(child);
                     }
                 }
@@ -246,10 +286,10 @@ class SelectiveRevisionAcceptor {
             case 'sectionPropertiesChange':
             case 'numberingChange':
                 for (const child of childContent) {
-                    if ((0, RevisionContent_1.isRunContent)(child)) {
+                    if (isRunContent(child)) {
                         newContent.push(child);
                     }
-                    else if ((0, RevisionContent_1.isHyperlinkContent)(child)) {
+                    else if (isHyperlinkContent(child)) {
                         newContent.push(child);
                     }
                 }
@@ -355,5 +395,4 @@ class SelectiveRevisionAcceptor {
         return 'content';
     }
 }
-exports.SelectiveRevisionAcceptor = SelectiveRevisionAcceptor;
 //# sourceMappingURL=SelectiveRevisionAcceptor.js.map

package/dist/esm/processors/SelectiveRevisionAcceptor.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"SelectiveRevisionAcceptor.js","sourceRoot":"","sources":["../../../src/processors/SelectiveRevisionAcceptor.ts"],"names":[],"mappings":"AAgBA,OAAO,EAAE,QAAQ,EAAgB,MAAM,yBAAyB,CAAC;AAEjE,OAAO,EAAE,YAAY,EAAE,kBAAkB,EAAE,MAAM,gCAAgC,CAAC;AA2BlF,MAAM,OAAO,yBAAyB;IAUpC,MAAM,CAAC,MAAM,CAAC,GAAa,EAAE,QAA2B;QACtD,MAAM,QAAQ,GAAa,EAAE,CAAC;QAC9B,MAAM,SAAS,GAAa,EAAE,CAAC;QAI/B,MAAM,UAAU,GAAG,OAAQ,GAAW,CAAC,gBAAgB,KAAK,UAAU,CAAC;QAEvE,IAAI,UAAU,EAAE,CAAC;YACf,IAAI,CAAC,iBAAiB,CAAC,GAAG,EAAE,CAAC,SAAS,EAAE,EAAE;gBACxC,IAAI,CAAC,yBAAyB,CAAC,SAAS,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,SAAS,CAAC,CAAC;YACrF,CAAC,CAAC,CAAC;QACL,CAAC;aAAM,CAAC;YAEN,MAAM,eAAe,GAAG,GAAG,CAAC,kBAAkB,EAAE,CAAC;YACjD,IAAI,eAAe,EAAE,CAAC;gBACpB,MAAM,YAAY,GAAG,eAAe,CAAC,eAAe,EAAE,CAAC;gBACvD,KAAK,MAAM,GAAG,IAAI,YAAY,EAAE,CAAC;oBAC/B,IAAI,IAAI,CAAC,eAAe,CAAC,GAAG,EAAE,QAAQ,CAAC,EAAE,CAAC;wBACxC,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,QAAQ,EAAE,CAAC,CAAC;oBACxC,CAAC;yBAAM,CAAC;wBACN,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,QAAQ,EAAE,CAAC,CAAC;oBACzC,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAGD,MAAM,eAAe,GAAG,GAAG,CAAC,kBAAkB,EAAE,CAAC;QACjD,IAAI,eAAe,EAAE,CAAC;YACpB,KAAK,MAAM,EAAE,IAAI,QAAQ,EAAE,CAAC;gBAC1B,eAAe,CAAC,UAAU,CAAC,QAAQ,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;YAC/C,CAAC;QACH,CAAC;QAED,OAAO;YACL,QAAQ;YACR,QAAQ,EAAE,EAAE;YACZ,SAAS;YACT,OAAO,EAAE;gBACP,cAAc,EAAE,QAAQ,CAAC,MAAM,GAAG,SAAS,CAAC,MAAM;gBAClD,aAAa,EAAE,QAAQ,CAAC,MAAM;gBAC9B,aAAa,EAAE,CAAC;gBAChB,cAAc,EAAE,SAAS,CAAC,MAAM;aACjC;SACF,CAAC;IACJ,CAAC;IAcD,MAAM,CAAC,MAAM,CAAC,GAAa,EAAE,QAA2B;QACtD,MAAM,QAAQ,GAAa,EAAE,CAAC;QAC9B,MAAM,SAAS,GAAa,EAAE,CAAC;QAI/B,MAAM,UAAU,GAAG,OAAQ,GAAW,CAAC,gBAAgB,KAAK,UAAU,CAAC;QAEvE,IAAI,UAAU,EAAE,CAAC;YACf,IAAI,CAAC,iBAAiB,CAAC,GAAG,EAAE,CAAC,SAAS,EAAE,EAAE;gBACxC,IAAI,CAAC,yBAAyB,CAAC,SAAS,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,SAAS,CAAC,CAAC;YACrF,CAAC,CAAC,CAAC;QACL,CAAC;aAAM,CAAC;YAEN,MAAM,eAAe,GAAG,GAAG,CAAC,kBAAkB,EAAE,CAAC;YACjD,IAAI,eAAe,EAAE,CAAC;gBACpB,MAAM,YAAY,GAAG,eAAe,CAAC,eAAe,EAAE,CAAC;gBACvD,KAAK,MAAM,GAAG,IAAI,YAAY,EAAE,CAAC;oBAC/B,IAAI,IAAI,CAAC,eAAe,CAAC,GAAG,EAAE,QAAQ,CAAC,EAAE,CAAC;wBACxC,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,QAAQ,EAAE,CAAC,CAAC;oBACxC,CAAC;yBAAM,CAAC;wBACN,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,QAAQ,EAAE,CAAC,CAAC;oBACzC,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAGD,MAAM,eAAe,GAAG,GAAG,CAAC,kBAAkB,EAAE,CAAC;QACjD,IAAI,eAAe,EAAE,CAAC;YACpB,KAAK,MAAM,EAAE,IAAI,QAAQ,EAAE,CAAC;gBAC1B,eAAe,CAAC,UAAU,CAAC,QAAQ,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;YAC/C,CAAC;QACH,CAAC;QAED,OAAO;YACL,QAAQ,EAAE,EAAE;YACZ,QAAQ;YACR,SAAS;YACT,OAAO,EAAE;gBACP,cAAc,EAAE,QAAQ,CAAC,MAAM,GAAG,SAAS,CAAC,MAAM;gBAClD,aAAa,EAAE,CAAC;gBAChB,aAAa,EAAE,QAAQ,CAAC,MAAM;gBAC9B,cAAc,EAAE,SAAS,CAAC,MAAM;aACjC;SACF,CAAC;IACJ,CAAC;IAYO,MAAM,CAAC,iBAAiB,CAE9B,GAAQ,EACR,KAAqC;QAGrC,KAAK,MAAM,SAAS,IAAI,GAAG,CAAC,gBAAgB,EAAE,EAAE,CAAC;YAC/C,KAAK,CAAC,SAAS,CAAC,CAAC;QACnB,CAAC;QAGD,KAAK,MAAM,KAAK,IAAI,GAAG,CAAC,SAAS,EAAE,EAAE,CAAC;YACpC,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;gBAClC,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,QAAQ,EAAE,EAAE,CAAC;oBAClC,KAAK,MAAM,SAAS,IAAI,IAAI,CAAC,aAAa,EAAE,EAAE,CAAC;wBAC7C,KAAK,CAAC,SAAS,CAAC,CAAC;oBACnB,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAGD,MAAM,SAAS,GAAG,GAAG,CAAC,sBAAsB,EAAE,EAAE,CAAC;QACjD,IAAI,SAAS,EAAE,CAAC;YACd,KAAK,MAAM,WAAW,IAAI,SAAS,CAAC,aAAa,EAAE,EAAE,CAAC;gBACpD,KAAK,MAAM,OAAO,IAAI,WAAW,CAAC,MAAM,CAAC,WAAW,EAAE,EAAE,CAAC;oBACvD,IAAI,OAAO,OAAO,CAAC,UAAU,KAAK,UAAU,IAAI,OAAO,OAAO,CAAC,OAAO,KAAK,UAAU,EAAE,CAAC;wBAEtF,KAAK,CAAC,OAAO,CAAC,CAAC;oBACjB,CAAC;yBAAM,IAAI,OAAO,OAAO,CAAC,OAAO,KAAK,UAAU,EAAE,CAAC;wBAEjD,KAAK,MAAM,GAAG,IAAI,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC;4BACpC,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,QAAQ,EAAE,EAAE,CAAC;gCAClC,KAAK,MAAM,SAAS,IAAI,IAAI,CAAC,aAAa,EAAE,EAAE,CAAC;oCAC7C,KAAK,CAAC,SAAS,CAAC,CAAC;gCACnB,CAAC;4BACH,CAAC;wBACH,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;YACD,KAAK,MAAM,WAAW,IAAI,SAAS,CAAC,aAAa,EAAE,EAAE,CAAC;gBACpD,KAAK,MAAM,OAAO,IAAI,WAAW,CAAC,MAAM,CAAC,WAAW,EAAE,EAAE,CAAC;oBACvD,IAAI,OAAO,OAAO,CAAC,UAAU,KAAK,UAAU,IAAI,OAAO,OAAO,CAAC,OAAO,KAAK,UAAU,EAAE,CAAC;wBACtF,KAAK,CAAC,OAAO,CAAC,CAAC;oBACjB,CAAC;yBAAM,IAAI,OAAO,OAAO,CAAC,OAAO,KAAK,UAAU,EAAE,CAAC;wBACjD,KAAK,MAAM,GAAG,IAAI,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC;4BACpC,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,QAAQ,EAAE,EAAE,CAAC;gCAClC,KAAK,MAAM,SAAS,IAAI,IAAI,CAAC,aAAa,EAAE,EAAE,CAAC;oCAC7C,KAAK,CAAC,SAAS,CAAC,CAAC;gCACnB,CAAC;4BACH,CAAC;wBACH,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAGD,MAAM,eAAe,GAAG,GAAG,CAAC,kBAAkB,EAAE,EAAE,CAAC;QACnD,IAAI,eAAe,EAAE,CAAC;YACpB,KAAK,MAAM,EAAE,IAAI,eAAe,CAAC,eAAe,EAAE,EAAE,CAAC;gBACnD,KAAK,MAAM,SAAS,IAAI,EAAE,CAAC,aAAa,EAAE,EAAE,CAAC;oBAC3C,KAAK,CAAC,SAAS,CAAC,CAAC;gBACnB,CAAC;YACH,CAAC;QACH,CAAC;QACD,MAAM,cAAc,GAAG,GAAG,CAAC,iBAAiB,EAAE,EAAE,CAAC;QACjD,IAAI,cAAc,EAAE,CAAC;YACnB,KAAK,MAAM,EAAE,IAAI,cAAc,CAAC,cAAc,EAAE,EAAE,CAAC;gBACjD,KAAK,MAAM,SAAS,IAAI,EAAE,CAAC,aAAa,EAAE,EAAE,CAAC;oBAC3C,KAAK,CAAC,SAAS,CAAC,CAAC;gBACnB,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAMO,MAAM,CAAC,yBAAyB,CACtC,SAAoB,EACpB,QAA2B,EAC3B,MAA2B,EAC3B,YAAsB,EACtB,YAAsB;QAEtB,MAAM,OAAO,GAAG,SAAS,CAAC,UAAU,EAAE,CAAC;QACvC,MAAM,UAAU,GAAuB,EAAE,CAAC;QAE1C,KAAK,MAAM,IAAI,IAAI,OAAO,EAAE,CAAC;YAC3B,IAAI,IAAI,YAAY,QAAQ,EAAE,CAAC;gBAC7B,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC,QAAQ,EAAE,CAAC;gBAE3C,IAAI,IAAI,CAAC,eAAe,CAAC,IAAI,EAAE,QAAQ,CAAC,EAAE,CAAC;oBAEzC,YAAY,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;oBAE9B,IAAI,MAAM,KAAK,QAAQ,EAAE,CAAC;wBAExB,IAAI,CAAC,kBAAkB,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;oBAC5C,CAAC;yBAAM,CAAC;wBAEN,IAAI,CAAC,kBAAkB,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;oBAC5C,CAAC;gBACH,CAAC;qBAAM,CAAC;oBAEN,YAAY,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;oBAC9B,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACxB,CAAC;YACH,CAAC;iBAAM,CAAC;gBAEN,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACxB,CAAC;QACH,CAAC;QAGD,SAAS,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC;QAKjC,MAAM,UAAU,GAAG,SAAS,CAAC,aAAa,EAAE,CAAC;QAC7C,IAAI,UAAU,CAAC,qBAAqB,EAAE,CAAC;YACrC,MAAM,GAAG,GAAG,UAAU,CAAC,qBAAqB,CAAC;YAC7C,IAAI,IAAI,CAAC,qBAAqB,CAAC,GAAG,EAAE,QAAQ,CAAC,EAAE,CAAC;gBAC9C,SAAS,CAAC,0BAA0B,EAAE,CAAC;gBACvC,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,QAAQ,EAAE,CAAC,CAAC;YACvC,CAAC;iBAAM,CAAC;gBACN,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,QAAQ,EAAE,CAAC,CAAC;YACvC,CAAC;QACH,CAAC;QACD,IAAI,UAAU,CAAC,sBAAsB,EAAE,CAAC;YACtC,MAAM,GAAG,GAAG,UAAU,CAAC,sBAAsB,CAAC;YAC9C,IAAI,IAAI,CAAC,qBAAqB,CAAC,GAAG,EAAE,QAAQ,CAAC,EAAE,CAAC;gBAC9C,SAAS,CAAC,2BAA2B,EAAE,CAAC;gBACxC,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,QAAQ,EAAE,CAAC,CAAC;YACvC,CAAC;iBAAM,CAAC;gBACN,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,QAAQ,EAAE,CAAC,CAAC;YACvC,CAAC;QACH,CAAC;IACH,CAAC;IAMO,MAAM,CAAC,qBAAqB,CAClC,MAAkD,EAClD,QAA2B;QAG3B,IACE,CAAC,QAAQ,CAAC,GAAG;YACb,CAAC,QAAQ,CAAC,KAAK;YACf,CAAC,QAAQ,CAAC,OAAO;YACjB,CAAC,QAAQ,CAAC,SAAS;YACnB,CAAC,QAAQ,CAAC,UAAU;YACpB,CAAC,QAAQ,CAAC,MAAM,EAChB,CAAC;YACD,OAAO,KAAK,CAAC;QACf,CAAC;QAGD,IAAI,QAAQ,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC;YACtD,OAAO,KAAK,CAAC;QACf,CAAC;QAGD,IAAI,QAAQ,CAAC,OAAO,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC;YAClE,OAAO,KAAK,CAAC;QACf,CAAC;QAGD,IAAI,QAAQ,CAAC,SAAS,EAAE,CAAC;YACvB,IAAI,MAAM,CAAC,IAAI,GAAG,QAAQ,CAAC,SAAS,CAAC,KAAK,IAAI,MAAM,CAAC,IAAI,GAAG,QAAQ,CAAC,SAAS,CAAC,GAAG,EAAE,CAAC;gBACnF,OAAO,KAAK,CAAC;YACf,CAAC;QACH,CAAC;QAKD,IAAI,QAAQ,CAAC,KAAK,IAAI,QAAQ,CAAC,UAAU,IAAI,QAAQ,CAAC,MAAM,EAAE,CAAC;YAC7D,OAAO,KAAK,CAAC;QACf,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAKO,MAAM,CAAC,kBAAkB,CAAC,QAAkB,EAAE,UAA8B;QAClF,MAAM,YAAY,GAAG,QAAQ,CAAC,OAAO,EAAE,CAAC;QACxC,MAAM,YAAY,GAAG,QAAQ,CAAC,UAAU,EAAE,CAAC;QAE3C,QAAQ,YAAY,EAAE,CAAC;YACrB,KAAK,QAAQ,CAAC;YACd,KAAK,QAAQ;gBAEX,KAAK,MAAM,KAAK,IAAI,YAAY,EAAE,CAAC;oBACjC,IAAI,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC;wBACxB,UAAU,CAAC,IAAI,CAAC,KAAY,CAAC,CAAC;oBAChC,CAAC;yBAAM,IAAI,kBAAkB,CAAC,KAAK,CAAC,EAAE,CAAC;wBACrC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;oBACzB,CAAC;gBACH,CAAC;gBACD,MAAM;YAER,KAAK,QAAQ,CAAC;YACd,KAAK,UAAU;gBAEb,MAAM;YAER,KAAK,qBAAqB,CAAC;YAC3B,KAAK,2BAA2B,CAAC;YACjC,KAAK,uBAAuB,CAAC;YAC7B,KAAK,gCAAgC,CAAC;YACtC,KAAK,0BAA0B,CAAC;YAChC,KAAK,2BAA2B,CAAC;YACjC,KAAK,yBAAyB,CAAC;YAC/B,KAAK,iBAAiB;gBAEpB,KAAK,MAAM,KAAK,IAAI,YAAY,EAAE,CAAC;oBACjC,IAAI,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC;wBACxB,UAAU,CAAC,IAAI,CAAC,KAAY,CAAC,CAAC;oBAChC,CAAC;yBAAM,IAAI,kBAAkB,CAAC,KAAK,CAAC,EAAE,CAAC;wBACrC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;oBACzB,CAAC;gBACH,CAAC;gBACD,MAAM;YAER;gBAEE,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC9B,CAAC;IACH,CAAC;IAOO,MAAM,CAAC,kBAAkB,CAAC,QAAkB,EAAE,UAA8B;QAClF,MAAM,YAAY,GAAG,QAAQ,CAAC,OAAO,EAAE,CAAC;QACxC,MAAM,YAAY,GAAG,QAAQ,CAAC,UAAU,EAAE,CAAC;QAE3C,QAAQ,YAAY,EAAE,CAAC;YACrB,KAAK,QAAQ,CAAC;YACd,KAAK,QAAQ;gBAEX,MAAM;YAER,KAAK,QAAQ,CAAC;YACd,KAAK,UAAU;gBAEb,KAAK,MAAM,KAAK,IAAI,YAAY,EAAE,CAAC;oBACjC,IAAI,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC;wBACxB,UAAU,CAAC,IAAI,CAAC,KAAY,CAAC,CAAC;oBAChC,CAAC;yBAAM,IAAI,kBAAkB,CAAC,KAAK,CAAC,EAAE,CAAC;wBACrC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;oBACzB,CAAC;gBACH,CAAC;gBACD,MAAM;YAER,KAAK,qBAAqB,CAAC;YAC3B,KAAK,2BAA2B,CAAC;YACjC,KAAK,uBAAuB,CAAC;YAC7B,KAAK,gCAAgC,CAAC;YACtC,KAAK,0BAA0B,CAAC;YAChC,KAAK,2BAA2B,CAAC;YACjC,KAAK,yBAAyB,CAAC;YAC/B,KAAK,iBAAiB;gBAIpB,KAAK,MAAM,KAAK,IAAI,YAAY,EAAE,CAAC;oBACjC,IAAI,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC;wBACxB,UAAU,CAAC,IAAI,CAAC,KAAY,CAAC,CAAC;oBAChC,CAAC;yBAAM,IAAI,kBAAkB,CAAC,KAAK,CAAC,EAAE,CAAC;wBACrC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;oBACzB,CAAC;gBACH,CAAC;gBACD,MAAM;YAER;gBAEE,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC9B,CAAC;IACH,CAAC;IAUD,MAAM,CAAC,OAAO,CACZ,GAAa,EACb,QAA2B,EAC3B,MAA2B;QAG3B,OAAO,MAAM,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;IACvF,CAAC;IASD,MAAM,CAAC,cAAc,CAAC,GAAa,EAAE,MAAc;QACjD,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,EAAE,OAAO,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;IACjD,CAAC;IASD,MAAM,CAAC,cAAc,CAAC,GAAa,EAAE,MAAc;QACjD,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,EAAE,OAAO,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;IACjD,CAAC;IASD,MAAM,CAAC,YAAY,CAAC,GAAa,EAAE,KAAqB;QACtD,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC;IACrC,CAAC;IASD,MAAM,CAAC,YAAY,CAAC,GAAa,EAAE,KAAqB;QACtD,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC;IACrC,CAAC;IASD,MAAM,CAAC,gBAAgB,CAAC,GAAa,EAAE,IAAU;QAC/C,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE;YACtB,SAAS,EAAE,EAAE,KAAK,EAAE,IAAI,IAAI,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,IAAI,EAAE;SAC7C,CAAC,CAAC;IACL,CAAC;IASD,MAAM,CAAC,eAAe,CAAC,GAAa,EAAE,IAAU;QAC9C,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE;YACtB,SAAS,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,IAAI,EAAE,EAAE;SAC5C,CAAC,CAAC;IACL,CAAC;IAQD,MAAM,CAAC,oBAAoB,CAAC,GAAa;QACvC,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,EAAE,KAAK,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;IACjD,CAAC;IAQD,MAAM,CAAC,mBAAmB,CAAC,GAAa;QACtC,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,EAAE,KAAK,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;IACjD,CAAC;IAQD,MAAM,CAAC,uBAAuB,CAAC,GAAa;QAC1C,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,EAAE,UAAU,EAAE,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC;IAC1D,CAAC;IAQD,MAAM,CAAC,wBAAwB,CAAC,GAAa;QAC3C,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,EAAE,UAAU,EAAE,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;IACvD,CAAC;IAKO,MAAM,CAAC,eAAe,CAAC,QAAkB,EAAE,QAA2B;QAE5E,IACE,CAAC,QAAQ,CAAC,GAAG;YACb,CAAC,QAAQ,CAAC,KAAK;YACf,CAAC,QAAQ,CAAC,OAAO;YACjB,CAAC,QAAQ,CAAC,SAAS;YACnB,CAAC,QAAQ,CAAC,UAAU;YACpB,CAAC,QAAQ,CAAC,MAAM,EAChB,CAAC;YACD,OAAO,KAAK,CAAC;QACf,CAAC;QAGD,IAAI,QAAQ,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC;YAC7D,OAAO,KAAK,CAAC;QACf,CAAC;QAGD,IAAI,QAAQ,CAAC,KAAK,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,QAAQ,CAAC,QAAQ,CAAC,OAAO,EAAE,CAAC,EAAE,CAAC;YACnE,OAAO,KAAK,CAAC;QACf,CAAC;QAGD,IAAI,QAAQ,CAAC,OAAO,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAC,EAAE,CAAC;YACzE,OAAO,KAAK,CAAC;QACf,CAAC;QAGD,IAAI,QAAQ,CAAC,SAAS,EAAE,CAAC;YACvB,MAAM,IAAI,GAAG,QAAQ,CAAC,OAAO,EAAE,CAAC;YAChC,IAAI,IAAI,GAAG,QAAQ,CAAC,SAAS,CAAC,KAAK,IAAI,IAAI,GAAG,QAAQ,CAAC,SAAS,CAAC,GAAG,EAAE,CAAC;gBACrE,OAAO,KAAK,CAAC;YACf,CAAC;QACH,CAAC;QAGD,IAAI,QAAQ,CAAC,UAAU,EAAE,CAAC;YACxB,MAAM,QAAQ,GAAG,IAAI,CAAC,mBAAmB,CAAC,QAAQ,CAAC,CAAC;YACpD,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAC5C,OAAO,KAAK,CAAC;YACf,CAAC;QACH,CAAC;QAGD,IAAI,QAAQ,CAAC,MAAM,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC;YAClD,OAAO,KAAK,CAAC;QACf,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAKO,MAAM,CAAC,mBAAmB,CAAC,QAAkB;QACnD,MAAM,IAAI,GAAG,QAAQ,CAAC,OAAO,EAAE,CAAC;QAEhC,IAAI,IAAI,KAAK,QAAQ,IAAI,IAAI,KAAK,QAAQ,EAAE,CAAC;YAC3C,OAAO,SAAS,CAAC;QACnB,CAAC;QACD,IACE,IAAI,KAAK,qBAAqB;YAC9B,IAAI,KAAK,2BAA2B;YACpC,IAAI,KAAK,iBAAiB,EAC1B,CAAC;YACD,OAAO,YAAY,CAAC;QACtB,CAAC;QACD,IAAI,IAAI,KAAK,UAAU,IAAI,IAAI,KAAK,QAAQ,IAAI,IAAI,KAAK,yBAAyB,EAAE,CAAC;YACnF,OAAO,YAAY,CAAC;QACtB,CAAC;QACD,IACE,IAAI,KAAK,uBAAuB;YAChC,IAAI,KAAK,gCAAgC;YACzC,IAAI,KAAK,0BAA0B;YACnC,IAAI,KAAK,2BAA2B;YACpC,IAAI,KAAK,iBAAiB;YAC1B,IAAI,KAAK,iBAAiB;YAC1B,IAAI,KAAK,gBAAgB,EACzB,CAAC;YACD,OAAO,OAAO,CAAC;QACjB,CAAC;QAED,OAAO,SAAS,CAAC;IACnB,CAAC;CACF","sourcesContent":["/**\n * SelectiveRevisionAcceptor - Accept or reject specific revisions based on criteria\n *\n * Provides granular control over revision acceptance using in-memory DOM transformation.\n * Extends the all-or-nothing approach with selective acceptance by author, type, date,\n * and custom criteria.\n *\n * Uses the industry-standard in-memory transformation approach (like OpenXML PowerTools),\n * allowing subsequent modifications to be saved correctly.\n *\n * @module SelectiveRevisionAcceptor\n * @see https://github.com/OfficeDev/Open-Xml-PowerTools - RevisionAccepter.cs\n */\n\nimport type { Document } from '../core/Document.js';\nimport type { Paragraph, ParagraphContent } from '../elements/Paragraph.js';\nimport { Revision, RevisionType } from '../elements/Revision.js';\nimport type { Run } from '../elements/Run.js';\nimport { isRunContent, isHyperlinkContent } from '../elements/RevisionContent.js';\nimport { ChangeCategory } from './ChangelogGenerator.js';\nimport { SelectionCriteria } from './RevisionAwareProcessor.js';\n\n/**\n * Result of selective revision acceptance.\n */\nexport interface SelectiveAcceptResult {\n  /** IDs of accepted revisions */\n  accepted: string[];\n  /** IDs of rejected/removed revisions */\n  rejected: string[];\n  /** IDs of revisions that remain */\n  remaining: string[];\n  /** Summary of actions taken */\n  summary: {\n    totalProcessed: number;\n    acceptedCount: number;\n    rejectedCount: number;\n    remainingCount: number;\n  };\n}\n\n/**\n * Provides granular control over revision acceptance using in-memory DOM transformation.\n * Allows subsequent modifications to be saved correctly.\n */\nexport class SelectiveRevisionAcceptor {\n  /**\n   * Accept revisions matching criteria using in-memory DOM transformation.\n   * Matching revisions: content kept, revision wrapper removed.\n   * Non-matching revisions: preserved in the document.\n   *\n   * @param doc - Document to process\n   * @param criteria - Selection criteria\n   * @returns Result with accepted, rejected, and remaining revision IDs\n   */\n  static accept(doc: Document, criteria: SelectionCriteria): SelectiveAcceptResult {\n    const accepted: string[] = [];\n    const remaining: string[] = [];\n\n    // Check if doc has full Document API (getAllParagraphs, getTables)\n    // or if it's a minimal mock (only getRevisionManager)\n    const hasFullApi = typeof (doc as any).getAllParagraphs === 'function';\n\n    if (hasFullApi) {\n      this.walkAllParagraphs(doc, (paragraph) => {\n        this.processSelectiveParagraph(paragraph, criteria, 'accept', accepted, remaining);\n      });\n    } else {\n      // Fallback: Filter revisions from RevisionManager only (for backward compatibility)\n      const revisionManager = doc.getRevisionManager();\n      if (revisionManager) {\n        const allRevisions = revisionManager.getAllRevisions();\n        for (const rev of allRevisions) {\n          if (this.matchesCriteria(rev, criteria)) {\n            accepted.push(rev.getId().toString());\n          } else {\n            remaining.push(rev.getId().toString());\n          }\n        }\n      }\n    }\n\n    // Clear accepted revisions from RevisionManager\n    const revisionManager = doc.getRevisionManager();\n    if (revisionManager) {\n      for (const id of accepted) {\n        revisionManager.removeById(parseInt(id, 10));\n      }\n    }\n\n    return {\n      accepted,\n      rejected: [],\n      remaining,\n      summary: {\n        totalProcessed: accepted.length + remaining.length,\n        acceptedCount: accepted.length,\n        rejectedCount: 0,\n        remainingCount: remaining.length,\n      },\n    };\n  }\n\n  /**\n   * Reject revisions matching criteria using in-memory DOM transformation.\n   * Matching revisions: content AND wrapper removed (opposite of accept).\n   * Non-matching revisions: preserved in the document.\n   *\n   * For insertions: Rejecting removes the inserted content entirely.\n   * For deletions: Rejecting keeps the deleted content (opposite of accepting).\n   *\n   * @param doc - Document to process\n   * @param criteria - Selection criteria\n   * @returns Result with accepted, rejected, and remaining revision IDs\n   */\n  static reject(doc: Document, criteria: SelectionCriteria): SelectiveAcceptResult {\n    const rejected: string[] = [];\n    const remaining: string[] = [];\n\n    // Check if doc has full Document API (getAllParagraphs, getTables)\n    // or if it's a minimal mock (only getRevisionManager)\n    const hasFullApi = typeof (doc as any).getAllParagraphs === 'function';\n\n    if (hasFullApi) {\n      this.walkAllParagraphs(doc, (paragraph) => {\n        this.processSelectiveParagraph(paragraph, criteria, 'reject', rejected, remaining);\n      });\n    } else {\n      // Fallback: Filter revisions from RevisionManager only (for backward compatibility)\n      const revisionManager = doc.getRevisionManager();\n      if (revisionManager) {\n        const allRevisions = revisionManager.getAllRevisions();\n        for (const rev of allRevisions) {\n          if (this.matchesCriteria(rev, criteria)) {\n            rejected.push(rev.getId().toString());\n          } else {\n            remaining.push(rev.getId().toString());\n          }\n        }\n      }\n    }\n\n    // Clear rejected revisions from RevisionManager\n    const revisionManager = doc.getRevisionManager();\n    if (revisionManager) {\n      for (const id of rejected) {\n        revisionManager.removeById(parseInt(id, 10));\n      }\n    }\n\n    return {\n      accepted: [],\n      rejected,\n      remaining,\n      summary: {\n        totalProcessed: rejected.length + remaining.length,\n        acceptedCount: 0,\n        rejectedCount: rejected.length,\n        remainingCount: remaining.length,\n      },\n    };\n  }\n\n  /**\n   * Walk every paragraph that can carry tracked-change content per\n   * ECMA-376: body, tables (recursively), headers, footers, footnotes,\n   * and endnotes. Mirrors the in-memory acceptor traversal so\n   * selective accept / reject covers the same surface as\n   * `acceptRevisionsInMemory`. Comments are deliberately excluded —\n   * `Comment` stores `Run[]` rather than `Paragraph[]`, so revisions\n   * are never represented in the in-memory model and must be cleaned\n   * via the raw-XML path on load.\n   */\n  private static walkAllParagraphs(\n    // eslint-disable-next-line @typescript-eslint/no-explicit-any\n    doc: any,\n    visit: (paragraph: Paragraph) => void\n  ): void {\n    // Body paragraphs\n    for (const paragraph of doc.getAllParagraphs()) {\n      visit(paragraph);\n    }\n\n    // Tables (body-level)\n    for (const table of doc.getTables()) {\n      for (const row of table.getRows()) {\n        for (const cell of row.getCells()) {\n          for (const paragraph of cell.getParagraphs()) {\n            visit(paragraph);\n          }\n        }\n      }\n    }\n\n    // Headers and footers\n    const hfManager = doc.getHeaderFooterManager?.();\n    if (hfManager) {\n      for (const headerEntry of hfManager.getAllHeaders()) {\n        for (const element of headerEntry.header.getElements()) {\n          if (typeof element.getContent === 'function' && typeof element.getRuns === 'function') {\n            // Paragraph\n            visit(element);\n          } else if (typeof element.getRows === 'function') {\n            // Table\n            for (const row of element.getRows()) {\n              for (const cell of row.getCells()) {\n                for (const paragraph of cell.getParagraphs()) {\n                  visit(paragraph);\n                }\n              }\n            }\n          }\n        }\n      }\n      for (const footerEntry of hfManager.getAllFooters()) {\n        for (const element of footerEntry.footer.getElements()) {\n          if (typeof element.getContent === 'function' && typeof element.getRuns === 'function') {\n            visit(element);\n          } else if (typeof element.getRows === 'function') {\n            for (const row of element.getRows()) {\n              for (const cell of row.getCells()) {\n                for (const paragraph of cell.getParagraphs()) {\n                  visit(paragraph);\n                }\n              }\n            }\n          }\n        }\n      }\n    }\n\n    // Footnotes and endnotes\n    const footnoteManager = doc.getFootnoteManager?.();\n    if (footnoteManager) {\n      for (const fn of footnoteManager.getAllFootnotes()) {\n        for (const paragraph of fn.getParagraphs()) {\n          visit(paragraph);\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          visit(paragraph);\n        }\n      }\n    }\n  }\n\n  /**\n   * Process a paragraph for selective revision acceptance/rejection.\n   * Transforms matching revisions in-place using DOM transformation.\n   */\n  private static processSelectiveParagraph(\n    paragraph: Paragraph,\n    criteria: SelectionCriteria,\n    action: 'accept' | 'reject',\n    processedIds: string[],\n    remainingIds: string[]\n  ): void {\n    const content = paragraph.getContent();\n    const newContent: ParagraphContent[] = [];\n\n    for (const item of content) {\n      if (item instanceof Revision) {\n        const revisionId = item.getId().toString();\n\n        if (this.matchesCriteria(item, criteria)) {\n          // This revision matches the criteria - process it\n          processedIds.push(revisionId);\n\n          if (action === 'accept') {\n            // Accept: Transform based on revision type\n            this.acceptRevisionItem(item, newContent);\n          } else {\n            // Reject: Transform opposite of accept\n            this.rejectRevisionItem(item, newContent);\n          }\n        } else {\n          // This revision doesn't match - keep it\n          remainingIds.push(revisionId);\n          newContent.push(item);\n        }\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    // Handle paragraph mark revision markers (w:del/w:ins in w:pPr/w:rPr)\n    // Both accept and reject clear the marker — these are metadata-only markers (no content),\n    // so there is no content to add or remove, only the marker itself to clear.\n    const formatting = paragraph.getFormatting();\n    if (formatting.paragraphMarkDeletion) {\n      const del = formatting.paragraphMarkDeletion;\n      if (this.matchesMarkerCriteria(del, criteria)) {\n        paragraph.clearParagraphMarkDeletion();\n        processedIds.push(del.id.toString());\n      } else {\n        remainingIds.push(del.id.toString());\n      }\n    }\n    if (formatting.paragraphMarkInsertion) {\n      const ins = formatting.paragraphMarkInsertion;\n      if (this.matchesMarkerCriteria(ins, criteria)) {\n        paragraph.clearParagraphMarkInsertion();\n        processedIds.push(ins.id.toString());\n      } else {\n        remainingIds.push(ins.id.toString());\n      }\n    }\n  }\n\n  /**\n   * Check if a paragraph mark revision marker matches the given criteria.\n   * Simplified version of matchesCriteria for non-Revision marker objects.\n   */\n  private static matchesMarkerCriteria(\n    marker: { id: number; author: string; date: Date },\n    criteria: SelectionCriteria\n  ): boolean {\n    // If no criteria specified, match nothing\n    if (\n      !criteria.ids &&\n      !criteria.types &&\n      !criteria.authors &&\n      !criteria.dateRange &&\n      !criteria.categories &&\n      !criteria.custom\n    ) {\n      return false;\n    }\n\n    // Filter by IDs\n    if (criteria.ids && !criteria.ids.includes(marker.id)) {\n      return false;\n    }\n\n    // Filter by authors\n    if (criteria.authors && !criteria.authors.includes(marker.author)) {\n      return false;\n    }\n\n    // Filter by date range\n    if (criteria.dateRange) {\n      if (marker.date < criteria.dateRange.start || marker.date > criteria.dateRange.end) {\n        return false;\n      }\n    }\n\n    // types, categories, and custom filters don't apply to paragraph mark markers\n    // (they are not Revision objects with a type/category)\n    // If criteria only specifies types/categories/custom, markers won't match\n    if (criteria.types || criteria.categories || criteria.custom) {\n      return false;\n    }\n\n    return true;\n  }\n\n  /**\n   * Accept a single revision item (unwrap insertions, remove deletions).\n   */\n  private static acceptRevisionItem(revision: Revision, newContent: ParagraphContent[]): void {\n    const revisionType = revision.getType();\n    const childContent = revision.getContent();\n\n    switch (revisionType) {\n      case 'insert':\n      case 'moveTo':\n        // Unwrap: Extract child content into parent position\n        for (const child of childContent) {\n          if (isRunContent(child)) {\n            newContent.push(child as Run);\n          } else if (isHyperlinkContent(child)) {\n            newContent.push(child);\n          }\n        }\n        break;\n\n      case 'delete':\n      case 'moveFrom':\n        // Remove: Don't add to newContent - content is deleted\n        break;\n\n      case 'runPropertiesChange':\n      case 'paragraphPropertiesChange':\n      case 'tablePropertiesChange':\n      case 'tableExceptionPropertiesChange':\n      case 'tableRowPropertiesChange':\n      case 'tableCellPropertiesChange':\n      case 'sectionPropertiesChange':\n      case 'numberingChange':\n        // Property changes: Keep content, remove change metadata\n        for (const child of childContent) {\n          if (isRunContent(child)) {\n            newContent.push(child as Run);\n          } else if (isHyperlinkContent(child)) {\n            newContent.push(child);\n          }\n        }\n        break;\n\n      default:\n        // Unknown type - keep the revision as-is for safety\n        newContent.push(revision);\n    }\n  }\n\n  /**\n   * Reject a single revision item (opposite of accept).\n   * - Rejecting an insertion removes the content\n   * - Rejecting a deletion keeps the content (unwraps it)\n   */\n  private static rejectRevisionItem(revision: Revision, newContent: ParagraphContent[]): void {\n    const revisionType = revision.getType();\n    const childContent = revision.getContent();\n\n    switch (revisionType) {\n      case 'insert':\n      case 'moveTo':\n        // Reject insertion: Remove the inserted content entirely\n        break;\n\n      case 'delete':\n      case 'moveFrom':\n        // Reject deletion: Keep the deleted content (unwrap)\n        for (const child of childContent) {\n          if (isRunContent(child)) {\n            newContent.push(child as Run);\n          } else if (isHyperlinkContent(child)) {\n            newContent.push(child);\n          }\n        }\n        break;\n\n      case 'runPropertiesChange':\n      case 'paragraphPropertiesChange':\n      case 'tablePropertiesChange':\n      case 'tableExceptionPropertiesChange':\n      case 'tableRowPropertiesChange':\n      case 'tableCellPropertiesChange':\n      case 'sectionPropertiesChange':\n      case 'numberingChange':\n        // Rejecting property changes: Would need to restore old properties\n        // For now, just keep content without the change metadata\n        // (Full implementation would restore previousProperties)\n        for (const child of childContent) {\n          if (isRunContent(child)) {\n            newContent.push(child as Run);\n          } else if (isHyperlinkContent(child)) {\n            newContent.push(child);\n          }\n        }\n        break;\n\n      default:\n        // Unknown type - keep the revision as-is for safety\n        newContent.push(revision);\n    }\n  }\n\n  /**\n   * Preview what would happen without making changes.\n   *\n   * @param doc - Document to analyze\n   * @param criteria - Selection criteria\n   * @param action - Action to preview\n   * @returns Preview of what would happen\n   */\n  static preview(\n    doc: Document,\n    criteria: SelectionCriteria,\n    action: 'accept' | 'reject'\n  ): SelectiveAcceptResult {\n    // Preview is the same as the actual operation but without side effects\n    return action === 'accept' ? this.accept(doc, criteria) : this.reject(doc, criteria);\n  }\n\n  /**\n   * Accept all revisions by a specific author.\n   *\n   * @param doc - Document to process\n   * @param author - Author name to accept\n   * @returns Result with accepted, rejected, and remaining revision IDs\n   */\n  static acceptByAuthor(doc: Document, author: string): SelectiveAcceptResult {\n    return this.accept(doc, { authors: [author] });\n  }\n\n  /**\n   * Reject all revisions by a specific author.\n   *\n   * @param doc - Document to process\n   * @param author - Author name to reject\n   * @returns Result with accepted, rejected, and remaining revision IDs\n   */\n  static rejectByAuthor(doc: Document, author: string): SelectiveAcceptResult {\n    return this.reject(doc, { authors: [author] });\n  }\n\n  /**\n   * Accept all revisions of specific types.\n   *\n   * @param doc - Document to process\n   * @param types - Revision types to accept\n   * @returns Result with accepted, rejected, and remaining revision IDs\n   */\n  static acceptByType(doc: Document, types: RevisionType[]): SelectiveAcceptResult {\n    return this.accept(doc, { types });\n  }\n\n  /**\n   * Reject all revisions of specific types.\n   *\n   * @param doc - Document to process\n   * @param types - Revision types to reject\n   * @returns Result with accepted, rejected, and remaining revision IDs\n   */\n  static rejectByType(doc: Document, types: RevisionType[]): SelectiveAcceptResult {\n    return this.reject(doc, { types });\n  }\n\n  /**\n   * Accept all revisions before a specific date.\n   *\n   * @param doc - Document to process\n   * @param date - Cutoff date (exclusive)\n   * @returns Result with accepted, rejected, and remaining revision IDs\n   */\n  static acceptBeforeDate(doc: Document, date: Date): SelectiveAcceptResult {\n    return this.accept(doc, {\n      dateRange: { start: new Date(0), end: date },\n    });\n  }\n\n  /**\n   * Accept all revisions after a specific date.\n   *\n   * @param doc - Document to process\n   * @param date - Start date (exclusive)\n   * @returns Result with accepted, rejected, and remaining revision IDs\n   */\n  static acceptAfterDate(doc: Document, date: Date): SelectiveAcceptResult {\n    return this.accept(doc, {\n      dateRange: { start: date, end: new Date() },\n    });\n  }\n\n  /**\n   * Accept all insertions only.\n   *\n   * @param doc - Document to process\n   * @returns Result with accepted, rejected, and remaining revision IDs\n   */\n  static acceptInsertionsOnly(doc: Document): SelectiveAcceptResult {\n    return this.accept(doc, { types: ['insert'] });\n  }\n\n  /**\n   * Accept all deletions only.\n   *\n   * @param doc - Document to process\n   * @returns Result with accepted, rejected, and remaining revision IDs\n   */\n  static acceptDeletionsOnly(doc: Document): SelectiveAcceptResult {\n    return this.accept(doc, { types: ['delete'] });\n  }\n\n  /**\n   * Reject all formatting changes (keep content changes).\n   *\n   * @param doc - Document to process\n   * @returns Result with accepted, rejected, and remaining revision IDs\n   */\n  static rejectFormattingChanges(doc: Document): SelectiveAcceptResult {\n    return this.reject(doc, { categories: ['formatting'] });\n  }\n\n  /**\n   * Accept content changes only (reject formatting).\n   *\n   * @param doc - Document to process\n   * @returns Result with accepted, rejected, and remaining revision IDs\n   */\n  static acceptContentChangesOnly(doc: Document): SelectiveAcceptResult {\n    return this.accept(doc, { categories: ['content'] });\n  }\n\n  /**\n   * Check if a revision matches the given criteria.\n   */\n  private static matchesCriteria(revision: Revision, criteria: SelectionCriteria): boolean {\n    // If no criteria specified, match nothing\n    if (\n      !criteria.ids &&\n      !criteria.types &&\n      !criteria.authors &&\n      !criteria.dateRange &&\n      !criteria.categories &&\n      !criteria.custom\n    ) {\n      return false;\n    }\n\n    // Filter by IDs\n    if (criteria.ids && !criteria.ids.includes(revision.getId())) {\n      return false;\n    }\n\n    // Filter by types\n    if (criteria.types && !criteria.types.includes(revision.getType())) {\n      return false;\n    }\n\n    // Filter by authors\n    if (criteria.authors && !criteria.authors.includes(revision.getAuthor())) {\n      return false;\n    }\n\n    // Filter by date range\n    if (criteria.dateRange) {\n      const date = revision.getDate();\n      if (date < criteria.dateRange.start || date > criteria.dateRange.end) {\n        return false;\n      }\n    }\n\n    // Filter by categories\n    if (criteria.categories) {\n      const category = this.getRevisionCategory(revision);\n      if (!criteria.categories.includes(category)) {\n        return false;\n      }\n    }\n\n    // Custom filter\n    if (criteria.custom && !criteria.custom(revision)) {\n      return false;\n    }\n\n    return true;\n  }\n\n  /**\n   * Get the semantic category of a revision.\n   */\n  private static getRevisionCategory(revision: Revision): ChangeCategory {\n    const type = revision.getType();\n\n    if (type === 'insert' || type === 'delete') {\n      return 'content';\n    }\n    if (\n      type === 'runPropertiesChange' ||\n      type === 'paragraphPropertiesChange' ||\n      type === 'numberingChange'\n    ) {\n      return 'formatting';\n    }\n    if (type === 'moveFrom' || type === 'moveTo' || type === 'sectionPropertiesChange') {\n      return 'structural';\n    }\n    if (\n      type === 'tablePropertiesChange' ||\n      type === 'tableExceptionPropertiesChange' ||\n      type === 'tableRowPropertiesChange' ||\n      type === 'tableCellPropertiesChange' ||\n      type === 'tableCellInsert' ||\n      type === 'tableCellDelete' ||\n      type === 'tableCellMerge'\n    ) {\n      return 'table';\n    }\n\n    return 'content';\n  }\n}\n"]}

package/dist/esm/processors/ShadingResolver.js

@@ -0,0 +1,66 @@
+import { getActiveConditionalsInPriorityOrder } from './cnfStyleDecoder.js';
+export function resolveCellShading(cell, table, stylesManager) {
+    const directShading = cell.getShading();
+    if (directShading) {
+        if (directShading.pattern === 'nil')
+            return undefined;
+        if (directShading.fill && directShading.fill !== 'auto')
+            return directShading;
+    }
+    const row = findRowForCell(cell, table);
+    if (row) {
+        const exceptions = row.getTablePropertyExceptions();
+        if (exceptions?.shading) {
+            if (exceptions.shading.pattern === 'nil')
+                return undefined;
+            if (exceptions.shading.fill && exceptions.shading.fill !== 'auto')
+                return exceptions.shading;
+        }
+    }
+    const tableStyleId = table.getStyle();
+    if (tableStyleId) {
+        const style = stylesManager.getStyle(tableStyleId);
+        if (style) {
+            const styleProps = style.getProperties();
+            const conditionals = styleProps.tableStyle?.conditionalFormatting;
+            if (conditionals) {
+                const cnfStyle = cell.getCnfStyle();
+                if (cnfStyle) {
+                    const activeConditionals = getActiveConditionalsInPriorityOrder(cnfStyle);
+                    for (const condType of activeConditionals) {
+                        const match = conditionals.find((c) => c.type === condType);
+                        if (match?.cellFormatting?.shading) {
+                            const condShading = match.cellFormatting.shading;
+                            if (condShading.pattern === 'nil')
+                                return undefined;
+                            return condShading;
+                        }
+                    }
+                }
+            }
+            if (styleProps.tableStyle?.cell?.shading) {
+                const defaultCellShading = styleProps.tableStyle.cell.shading;
+                if (defaultCellShading.pattern === 'nil')
+                    return undefined;
+                return defaultCellShading;
+            }
+        }
+    }
+    const tableShading = table.getShading();
+    if (tableShading) {
+        if (tableShading.pattern === 'nil')
+            return undefined;
+        return tableShading;
+    }
+    return undefined;
+}
+function findRowForCell(cell, table) {
+    for (const row of table.getRows()) {
+        const cells = row.getCells();
+        if (cells.includes(cell)) {
+            return row;
+        }
+    }
+    return undefined;
+}
+//# sourceMappingURL=ShadingResolver.js.map

package/dist/esm/processors/ShadingResolver.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ShadingResolver.js","sourceRoot":"","sources":["../../../src/processors/ShadingResolver.ts"],"names":[],"mappings":"AAmBA,OAAO,EAAE,oCAAoC,EAAE,MAAM,sBAAsB,CAAC;AAU5E,MAAM,UAAU,kBAAkB,CAChC,IAAe,EACf,KAAY,EACZ,aAA4B;IAG5B,MAAM,aAAa,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC;IACxC,IAAI,aAAa,EAAE,CAAC;QAClB,IAAI,aAAa,CAAC,OAAO,KAAK,KAAK;YAAE,OAAO,SAAS,CAAC;QACtD,IAAI,aAAa,CAAC,IAAI,IAAI,aAAa,CAAC,IAAI,KAAK,MAAM;YAAE,OAAO,aAAa,CAAC;IAChF,CAAC;IAGD,MAAM,GAAG,GAAG,cAAc,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IACxC,IAAI,GAAG,EAAE,CAAC;QACR,MAAM,UAAU,GAAG,GAAG,CAAC,0BAA0B,EAAE,CAAC;QACpD,IAAI,UAAU,EAAE,OAAO,EAAE,CAAC;YACxB,IAAI,UAAU,CAAC,OAAO,CAAC,OAAO,KAAK,KAAK;gBAAE,OAAO,SAAS,CAAC;YAC3D,IAAI,UAAU,CAAC,OAAO,CAAC,IAAI,IAAI,UAAU,CAAC,OAAO,CAAC,IAAI,KAAK,MAAM;gBAAE,OAAO,UAAU,CAAC,OAAO,CAAC;QAC/F,CAAC;IACH,CAAC;IAGD,MAAM,YAAY,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAC;IACtC,IAAI,YAAY,EAAE,CAAC;QACjB,MAAM,KAAK,GAAG,aAAa,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC;QACnD,IAAI,KAAK,EAAE,CAAC;YACV,MAAM,UAAU,GAAG,KAAK,CAAC,aAAa,EAAE,CAAC;YACzC,MAAM,YAAY,GAAG,UAAU,CAAC,UAAU,EAAE,qBAAqB,CAAC;YAClE,IAAI,YAAY,EAAE,CAAC;gBACjB,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;gBACpC,IAAI,QAAQ,EAAE,CAAC;oBACb,MAAM,kBAAkB,GAAG,oCAAoC,CAAC,QAAQ,CAAC,CAAC;oBAC1E,KAAK,MAAM,QAAQ,IAAI,kBAAkB,EAAE,CAAC;wBAC1C,MAAM,KAAK,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC;wBAC5D,IAAI,KAAK,EAAE,cAAc,EAAE,OAAO,EAAE,CAAC;4BACnC,MAAM,WAAW,GAAG,KAAK,CAAC,cAAc,CAAC,OAAO,CAAC;4BACjD,IAAI,WAAW,CAAC,OAAO,KAAK,KAAK;gCAAE,OAAO,SAAS,CAAC;4BACpD,OAAO,WAAW,CAAC;wBACrB,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;YAGD,IAAI,UAAU,CAAC,UAAU,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC;gBACzC,MAAM,kBAAkB,GAAG,UAAU,CAAC,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC;gBAC9D,IAAI,kBAAkB,CAAC,OAAO,KAAK,KAAK;oBAAE,OAAO,SAAS,CAAC;gBAC3D,OAAO,kBAAkB,CAAC;YAC5B,CAAC;QACH,CAAC;IACH,CAAC;IAGD,MAAM,YAAY,GAAG,KAAK,CAAC,UAAU,EAAE,CAAC;IACxC,IAAI,YAAY,EAAE,CAAC;QACjB,IAAI,YAAY,CAAC,OAAO,KAAK,KAAK;YAAE,OAAO,SAAS,CAAC;QACrD,OAAO,YAAY,CAAC;IACtB,CAAC;IAED,OAAO,SAAS,CAAC;AACnB,CAAC;AAKD,SAAS,cAAc,CAAC,IAAe,EAAE,KAAY;IACnD,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;QAClC,MAAM,KAAK,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC7B,IAAI,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;YACzB,OAAO,GAAG,CAAC;QACb,CAAC;IACH,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC","sourcesContent":["/**\n * ShadingResolver - Resolves effective cell shading through the ECMA-376 style hierarchy\n *\n * Per ECMA-376 §17.7.6, cell shading is resolved in priority order:\n * 1. Direct cell shading\n * 2. Row table property exceptions (tblPrEx)\n * 3. Conditional table style (tblStylePr) based on cnfStyle bitmask\n * 4. Table style default cell shading\n * 5. Direct table shading\n *\n * Special values:\n * - pattern: \"nil\" = explicitly clear (stop resolution)\n * - fill: \"auto\" = inherit (continue resolution)\n */\n\nimport type { ShadingConfig } from '../elements/CommonTypes.js';\nimport type { Table } from '../elements/Table.js';\nimport type { TableCell } from '../elements/TableCell.js';\nimport type { StylesManager } from '../formatting/StylesManager.js';\nimport { getActiveConditionalsInPriorityOrder } from './cnfStyleDecoder.js';\n\n/**\n * Resolves the effective shading for a table cell through the style hierarchy.\n *\n * @param cell - The table cell to resolve shading for\n * @param table - The parent table\n * @param stylesManager - The document's styles manager for style lookup\n * @returns The resolved ShadingConfig, or undefined if no shading applies\n */\nexport function resolveCellShading(\n  cell: TableCell,\n  table: Table,\n  stylesManager: StylesManager\n): ShadingConfig | undefined {\n  // 1. Direct cell shading\n  const directShading = cell.getShading();\n  if (directShading) {\n    if (directShading.pattern === 'nil') return undefined;\n    if (directShading.fill && directShading.fill !== 'auto') return directShading;\n  }\n\n  // 2. Row table property exceptions\n  const row = findRowForCell(cell, table);\n  if (row) {\n    const exceptions = row.getTablePropertyExceptions();\n    if (exceptions?.shading) {\n      if (exceptions.shading.pattern === 'nil') return undefined;\n      if (exceptions.shading.fill && exceptions.shading.fill !== 'auto') return exceptions.shading;\n    }\n  }\n\n  // 3. Conditional table style shading\n  const tableStyleId = table.getStyle();\n  if (tableStyleId) {\n    const style = stylesManager.getStyle(tableStyleId);\n    if (style) {\n      const styleProps = style.getProperties();\n      const conditionals = styleProps.tableStyle?.conditionalFormatting;\n      if (conditionals) {\n        const cnfStyle = cell.getCnfStyle();\n        if (cnfStyle) {\n          const activeConditionals = getActiveConditionalsInPriorityOrder(cnfStyle);\n          for (const condType of activeConditionals) {\n            const match = conditionals.find((c) => c.type === condType);\n            if (match?.cellFormatting?.shading) {\n              const condShading = match.cellFormatting.shading;\n              if (condShading.pattern === 'nil') return undefined;\n              return condShading;\n            }\n          }\n        }\n      }\n\n      // 4. Table style default cell shading\n      if (styleProps.tableStyle?.cell?.shading) {\n        const defaultCellShading = styleProps.tableStyle.cell.shading;\n        if (defaultCellShading.pattern === 'nil') return undefined;\n        return defaultCellShading;\n      }\n    }\n  }\n\n  // 5. Direct table shading\n  const tableShading = table.getShading();\n  if (tableShading) {\n    if (tableShading.pattern === 'nil') return undefined;\n    return tableShading;\n  }\n\n  return undefined;\n}\n\n/**\n * Finds the row that contains a given cell.\n */\nfunction findRowForCell(cell: TableCell, table: Table) {\n  for (const row of table.getRows()) {\n    const cells = row.getCells();\n    if (cells.includes(cell)) {\n      return row;\n    }\n  }\n  return undefined;\n}\n"]}