@faicad/faijs 0.30.9 → 0.32.2

package/dist/brep/face-evolution.js.map

@@ -1 +1 @@
-{"version":3,"file":"face-evolution.js","sourceRoot":"","sources":["../../src/brep/face-evolution.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;AAIH,OAAO,EAAE,aAAa,EAAoB,MAAM,2BAA2B,CAAA;AAE3E,wDAAwD;AACxD,MAAM,CAAC,MAAM,gBAAgB,GAAG,UAAU,CAAA;AAW1C;;;;;GAKG;AACH,MAAM,UAAU,aAAa,CAAC,MAAqB,EAAE,KAAiB;IACpE,OAAO,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,cAAc,CAAC,KAAK,EAAE,MAAM,EAAE,gBAAgB,CAAC,CAAC,CAAA;AAC3E,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,kBAAkB,CAChC,MAAqB,EACrB,MAAkB,EAClB,MAAkB;IAElB,MAAM,OAAO,GAAG,aAAa,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;IAC7C,MAAM,OAAO,GAAG,aAAa,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;IAC7C,OAAO,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,OAAO,EAAE,GAAG,OAAO,CAAC,CAAC,CAAC,CAAA;AAC/C,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,eAAe,CAC7B,MAAqB,EACrB,GAAsB,EACtB,UAAsB,EACtB,WAAuB;IAEvB,MAAM,WAAW,GAAG,aAAa,CAAC,MAAM,EAAE,UAAU,CAAC,CAAA;IACrD,MAAM,YAAY,GAAG,aAAa,CAAC,MAAM,EAAE,WAAW,CAAC,CAAA;IAEvD,wBAAwB;IACxB,MAAM,mBAAmB,GAAG,IAAI,GAAG,EAAkB,CAAA;IACrD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7C,mBAAmB,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;IAC7C,CAAC;IACD,MAAM,kBAAkB,GAAG,IAAI,GAAG,EAAkB,CAAA;IACpD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5C,kBAAkB,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;IAC3C,CAAC;IAED,iBAAiB;IACjB,MAAM,SAAS,GAAkB,IAAI,GAAG,EAAE,CAAA;IAC1C,MAAM,QAAQ,GAAG,GAAG,CAAC,QAAQ,CAAA;IAC7B,IAAI,GAAG,GAAG,CAAC,CAAA;IACX,OAAO,GAAG,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC;QAC7B,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAA;QAC5B,MAAM,KAAK,GAAG,QAAQ,CAAC,GAAG,GAAG,CAAC,CAAC,CAAA;QAC/B,MAAM,WAAW,GAAa,EAAE,CAAA;QAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/B,MAAM,OAAO,GAAG,QAAQ,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;YACrC,MAAM,UAAU,GAAG,mBAAmB,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;YACnD,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;gBAC7B,WAAW,CAAC,IAAI,CAAC,UAAU,CAAC,CAAA;YAC9B,CAAC;QACH,CAAC;QACD,MAAM,SAAS,GAAG,kBAAkB,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;QAChD,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;YAC5B,SAAS,CAAC,GAAG,CAAC,SAAS,EAAE,WAAW,CAAC,CAAA;QACvC,CAAC;QACD,GAAG,IAAI,CAAC,GAAG,KAAK,CAAA;IAClB,CAAC;IAED,OAAO,SAAS,CAAA;AAClB,CAAC;AAgBD;;;;;;;;;;;;;;;GAeG;AACH,MAAM,UAAU,mBAAmB,CAAC,GAAsB;IACxD,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAoB,CAAA;IAC5C,MAAM,CAAC,GAAG,GAAG,CAAC,QAAQ,CAAA;IACtB,IAAI,GAAG,GAAG,CAAC,CAAA;IACX,OAAO,GAAG,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC;QACtB,MAAM,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,CAAA;QACrB,MAAM,KAAK,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAA;QACxB,MAAM,SAAS,GAAa,EAAE,CAAA;QAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/B,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;QAChC,CAAC;QACD,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE,SAAS,CAAC,CAAA;QAC/B,GAAG,IAAI,CAAC,GAAG,KAAK,CAAA;IAClB,CAAC;IACD,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,IAAI,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAA;AACpD,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,0BAA0B,CACxC,GAAsB,EACtB,OAA0B,EAC1B,OAA0B;IAE1B,MAAM,GAAG,GAAG,mBAAmB,CAAC,GAAG,CAAC,CAAA;IACpC,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,CAAA;IAC7B,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,CAAA;IAE7B,MAAM,SAAS,GAAG,IAAI,GAAG,EAAoB,CAAA;IAC7C,MAAM,SAAS,GAAG,IAAI,GAAG,EAAoB,CAAA;IAC7C,KAAK,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC1C,IAAI,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC;YAAE,SAAS,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,CAAA;aACjD,IAAI,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC;YAAE,SAAS,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,CAAA;IAC7D,CAAC;IAED,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAA;IAClC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAA;IAClC,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,OAAO,EAAE,CAAC;QAC5B,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;aAC3B,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;IACvC,CAAC;IAED,OAAO,EAAE,CAAC,EAAE,EAAE,QAAQ,EAAE,SAAS,EAAE,OAAO,EAAE,QAAQ,EAAE,EAAE,CAAC,EAAE,EAAE,QAAQ,EAAE,SAAS,EAAE,OAAO,EAAE,QAAQ,EAAE,EAAE,CAAA;AACzG,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,MAAM,UAAU,qBAAqB,CACnC,MAAqB,EACrB,UAAsB,EACtB,WAAuB;IAEvB,MAAM,WAAW,GAAG,aAAa,CAAC,MAAM,EAAE,UAAU,CAAC,CAAA;IACrD,MAAM,YAAY,GAAG,aAAa,CAAC,MAAM,EAAE,WAAW,CAAC,CAAA;IACvD,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,MAAM,EAAE,YAAY,CAAC,MAAM,CAAC,CAAA;IAC/D,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAoB,CAAA;IAC5C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;QAC/B,QAAQ,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IACjD,CAAC;IACD,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,IAAI,GAAG,EAAE,EAAE,CAAA;AACzC,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,0BAA0B,CACxC,MAAqB,EACrB,KAAiB,EACjB,CAAoC;IAEpC,MAAM,WAAW,GAAG,aAAa,CAAC,MAAM,EAAE,KAAK,CAAC,CAAA;IAChD,MAAM,GAAG,GAAG,aAAa,EAAE,CAAC,oBAAoB,CAAC,KAA+B,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,gBAAgB,CAAiC,CAAA;IAClK,OAAO,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,SAAS,EAAE,mBAAmB,CAAC,GAAG,CAAC,EAAE,CAAA;AACpE,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,sBAAsB,CACpC,MAAqB,EACrB,KAAiB,EACjB,MAAyC,EACzC,MAAc;IAEd,MAAM,WAAW,GAAG,aAAa,CAAC,MAAM,EAAE,KAAK,CAAC,CAAA;IAChD,MAAM,GAAG,GAAG,aAAa,EAAE,CAAC,gBAAgB,CAC1C,KAA+B,EAC/B,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,EAC5C,MAAM,EACN,WAAW,EACX,gBAAgB,CACe,CAAA;IACjC,OAAO,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,SAAS,EAAE,mBAAmB,CAAC,GAAG,CAAC,EAAE,CAAA;AACpE,CAAC;AAED;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,MAAM,UAAU,oBAAoB,CAClC,MAAqB,EACrB,EAAgC,EAChC,CAAa,EACb,CAAa,EACb,MAAqC,EACrC,MAAqC,EACrC,OAAe;IAEf,MAAM,WAAW,GAAG,kBAAkB,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;IACpD,IAAI,GAAsB,CAAA;IAC1B,IAAI,EAAE,KAAK,MAAM;QAAE,GAAG,GAAG,MAAM,CAAC,eAAe,CAAC,CAAC,EAAE,CAAC,EAAE,WAAW,EAAE,gBAAgB,CAAC,CAAA;SAC/E,IAAI,EAAE,KAAK,KAAK;QAAE,GAAG,GAAG,MAAM,CAAC,cAAc,CAAC,CAAC,EAAE,CAAC,EAAE,WAAW,EAAE,gBAAgB,CAAC,CAAA;;QAClF,GAAG,GAAG,MAAM,CAAC,oBAAoB,CAAC,CAAC,EAAE,CAAC,EAAE,WAAW,EAAE,gBAAgB,CAAC,CAAA;IAE3E,MAAM,aAAa,GAAG,eAAe,CAAC,MAAM,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,CAAA;IAEjE,2BAA2B;IAC3B,MAAM,OAAO,GAAG,aAAa,CAAC,MAAM,EAAE,CAAC,CAAC,CAAA;IACxC,MAAM,OAAO,GAAG,aAAa,CAAC,MAAM,EAAE,CAAC,CAAC,CAAA;IACxC,MAAM,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,GAAG,0BAA0B,CAAC,GAAG,EAAE,OAAO,EAAE,OAAO,CAAC,CAAA;IAC9E,MAAM,MAAM,GAAG,oBAAoB,CAAC,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,OAAO,CAAC,CAAA;IAExE,wDAAwD;IACxD,mDAAmD;IACnD,+DAA+D;IAC/D,0DAA0D;IAC1D,6CAA6C;IAC7C,wBAAwB;IACxB,IAAI,EAAE,KAAK,MAAM,EAAE,CAAC;QAClB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAW,CAAA;QAClC,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC;YACpC,KAAK,MAAM,EAAE,IAAK,KAAgD,CAAC,MAAM,EAAE,EAAE,CAAC;gBAC5E,KAAK,MAAM,CAAC,IAAI,EAAE;oBAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;YACpC,CAAC;QACH,CAAC;QACD,MAAM,UAAU,GAAG,aAAa,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;QACnF,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACzB,MAAgC,CAAC,GAAG,CAAC,OAAO,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,CAAA;QACjF,CAAC;IACH,CAAC;IAED,OAAO,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,aAAa,EAAE,SAAS,EAAE,MAAM,EAAE,CAAA;AACjE,CAAC;AAED,2DAA2D;AAC3D,SAAS,oBAAoB,CAC3B,MAAqC,EACrC,IAAmB,EACnB,MAAqC,EACrC,IAAmB;AACnB,kHAAkH;AAClH,OAAe;IAEf,MAAM,MAAM,GAAG,IAAI,GAAG,EAAoB,CAAA;IAC1C,KAAK,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,IAAI,MAAM,EAAE,CAAC;QACrC,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,oBAAoB,CAAC,KAA+C,EAAE,IAAI,CAAC,CAAC,CAAA;IACjG,CAAC;IACD,KAAK,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,IAAI,MAAM,EAAE,CAAC;QACrC,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,MAAM,CAAuD,CAAA;QACzF,MAAM,QAAQ,GAAG,oBAAoB,CAAC,KAA+C,EAAE,IAAI,CAAC,CAAA;QAC5F,IAAI,QAAQ,EAAE,CAAC;YACb,MAAM,MAAM,GAAG,IAAI,GAAG,EAAoB,CAAA;YAC1C,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,QAAQ;gBAAE,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,CAAA;YAC5D,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,QAAQ,EAAE,CAAC;gBAClC,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;gBAC7B,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAA;YACnE,CAAC;YACD,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;QAC5B,CAAC;aAAM,CAAC;YACN,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAA;QAC9B,CAAC;IACH,CAAC;IACD,kFAAkF;IAClF,4FAA4F;IAC5F,6EAA6E;IAC7E,OAAO,MAAM,CAAA;AACf,CAAC;AAED,6DAA6D;AAC7D,SAAS,oBAAoB,CAC3B,KAA6C,EAC7C,SAAwB;IAExB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAoB,CAAA;IAC3C,KAAK,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACnC,MAAM,UAAU,GAAa,EAAE,CAAA;QAC/B,KAAK,MAAM,IAAI,IAAI,MAAM,EAAE,CAAC;YAC1B,IAAI,SAAS,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC;gBAAE,SAAQ;YACzC,MAAM,QAAQ,GAAG,SAAS,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;YAC7C,MAAM,OAAO,GAAG,QAAQ,KAAK,SAAS,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;YACjF,KAAK,MAAM,CAAC,IAAI,OAAO;gBAAE,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC;oBAAE,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QAC1E,CAAC;QACD,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC;YAAE,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,UAAU,CAAC,CAAA;IAC1D,CAAC;IACD,OAAO,OAAO,CAAA;AAChB,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,aAAa,CAC3B,MAAqB,EACrB,GAAsB,EACtB,UAAsB;IAEtB,MAAM,WAAW,GAAG,aAAa,CAAC,MAAM,EAAE,UAAU,CAAC,CAAA;IACrD,MAAM,kBAAkB,GAAG,IAAI,GAAG,EAAkB,CAAA;IACpD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5C,kBAAkB,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;IAC3C,CAAC;IAED,MAAM,eAAe,GAAa,EAAE,CAAA;IACpC,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,OAAO,EAAE,CAAC;QAC/B,MAAM,OAAO,GAAG,kBAAkB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;QAC5C,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;YAC1B,eAAe,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;QAC/B,CAAC;IACH,CAAC;IACD,OAAO,eAAe,CAAA;AACxB,CAAC;AAED,2BAA2B;AAE3B;;;;;;;GAOG;AACH,MAAM,UAAU,kBAAkB,CAChC,MAAqB,EACrB,CAAa,EACb,CAAa;IAEb,MAAM,WAAW,GAAG,kBAAkB,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;IACpD,MAAM,GAAG,GAAG,MAAM,CAAC,cAAc,CAAC,CAAC,EAAE,CAAC,EAAE,WAAW,EAAE,gBAAgB,CAAC,CAAA;IACtE,MAAM,aAAa,GAAG,eAAe,CAAC,MAAM,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,CAAA;IACjE,OAAO,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,aAAa,EAAE,CAAA;AAC9C,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,mBAAmB,CACjC,MAAqB,EACrB,CAAa,EACb,CAAa;IAEb,MAAM,WAAW,GAAG,kBAAkB,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;IACpD,MAAM,GAAG,GAAG,MAAM,CAAC,eAAe,CAAC,CAAC,EAAE,CAAC,EAAE,WAAW,EAAE,gBAAgB,CAAC,CAAA;IACvE,MAAM,aAAa,GAAG,eAAe,CAAC,MAAM,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,CAAA;IACjE,OAAO,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,aAAa,EAAE,CAAA;AAC9C,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,wBAAwB,CACtC,MAAqB,EACrB,CAAa,EACb,CAAa;IAEb,MAAM,WAAW,GAAG,kBAAkB,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;IACpD,MAAM,GAAG,GAAG,MAAM,CAAC,oBAAoB,CAAC,CAAC,EAAE,CAAC,EAAE,WAAW,EAAE,gBAAgB,CAAC,CAAA;IAC5E,MAAM,aAAa,GAAG,eAAe,CAAC,MAAM,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,CAAA;IACjE,OAAO,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,aAAa,EAAE,CAAA;AAC9C,CAAC;AAED,kBAAkB;AAElB;;;;;;;;;GASG;AACH,MAAM,UAAU,iBAAiB,CAC/B,MAAqB,EACrB,KAAiB;IAEjB,MAAM,SAAS,GAAG,aAAa,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,MAAM,CAAA;IACrD,MAAM,SAAS,GAAkB,IAAI,GAAG,EAAE,CAAA;IAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,SAAS,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAA;IACvB,CAAC;IACD,OAAO,SAAS,CAAA;AAClB,CAAC;AAED,0DAA0D;AAE1D;;;;;;;;;;;;;;;;;GAiBG;AACH,MAAM,UAAU,uBAAuB,CACrC,MAAqB,EACrB,EAAwB,EACxB,KAAiB,EACjB,WAAyB,EACzB,MAAc,EACd,cAA6C,EAC7C,OAAe;IAEf,MAAM,WAAW,GAAG,aAAa,CAAC,MAAM,EAAE,KAAK,CAAC,CAAA;IAChD,IAAI,GAAsB,CAAA;IAC1B,IAAI,EAAE,KAAK,QAAQ,EAAE,CAAC;QACpB,GAAG,GAAG,MAAM,CAAC,iBAAiB,CAAC,KAAK,EAAE,WAAW,EAAE,MAAM,EAAE,WAAW,EAAE,gBAAgB,CAAC,CAAA;IAC3F,CAAC;SAAM,CAAC;QACN,+DAA+D;QAC/D,+DAA+D;QAC/D,YAAY;QACZ,GAAG,GAAG,aAAa,EAAE,CAAC,kBAAkB,CACtC,KAA+B,EAC/B,WAAuC,EACvC,MAAM,EACN,WAAW,EACX,gBAAgB,CACe,CAAA;IACnC,CAAC;IAED,MAAM,aAAa,GAAG,eAAe,CAAC,MAAM,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,CAAC,MAAM,CAAC,CAAA;IACrE,MAAM,OAAO,GAAG,mBAAmB,CAAC,GAAG,CAAC,CAAA;IACxC,MAAM,UAAU,GAAG,wBAAwB,CAAC,cAAc,EAAE,OAAO,CAAC,CAAA;IAEpE,4EAA4E;IAC5E,oDAAoD;IACpD,6EAA6E;IAC7E,+EAA+E;IAC/E,MAAM,YAAY,GAAG,aAAa,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAA;IACtD,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,WAAW,CAAC,CAAA;IACzC,MAAM,oBAAoB,GAAG,IAAI,GAAG,EAAU,CAAA;IAC9C,KAAK,MAAM,IAAI,IAAI,OAAO,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC;QAC7C,KAAK,MAAM,CAAC,IAAI,IAAI;YAAE,oBAAoB,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;IACnD,CAAC;IACD,MAAM,eAAe,GAAG,YAAY,CAAC,MAAM,CACzC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,oBAAoB,CAAC,GAAG,CAAC,CAAC,CAAC,CAC5D,CAAA;IAED,IAAI,eAAe,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC/B,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAoB,CAAA;QAC5C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAChD,QAAQ,CAAC,GAAG,CAAC,OAAO,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC,eAAe,CAAC,CAAC,CAAE,CAAC,CAAC,CAAA;QACvD,CAAC;QACD,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,CAAA;QACrC,SAAS,CAAC,GAAG,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAA;QAChC,OAAO,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,aAAa,EAAE,SAAS,EAAE,CAAA;IACzD,CAAC;IAED,OAAO,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,aAAa,EAAE,SAAS,EAAE,UAAU,EAAE,CAAA;AACrE,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,mBAAmB,CACjC,MAAqB,EACrB,KAAiB,EACjB,WAAyB,EACzB,MAAc,EACd,cAA6C,EAC7C,OAAe;IAEf,OAAO,uBAAuB,CAAC,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,WAAW,EAAE,MAAM,EAAE,cAAc,EAAE,OAAO,CAAC,CAAA;AACvG,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,oBAAoB,CAClC,MAAqB,EACrB,KAAiB,EACjB,WAAyB,EACzB,QAAgB,EAChB,cAA6C,EAC7C,OAAe;IAEf,OAAO,uBAAuB,CAAC,MAAM,EAAE,SAAS,EAAE,KAAK,EAAE,WAAW,EAAE,QAAQ,EAAE,cAAc,EAAE,OAAO,CAAC,CAAA;AAC1G,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,sBAAsB,CACpC,MAAqB,EACrB,KAAiB,EACjB,SAAqB,EACrB,cAA6C,EAC7C,OAAe;IAEf,MAAM,WAAW,GAAG,aAAa,CAAC,MAAM,EAAE,KAAK,CAAC,CAAA;IAChD,MAAM,GAAG,GAAG,MAAM,CAAC,cAAc,CAAC,KAAK,EAAE,SAAS,EAAE,WAAW,EAAE,gBAAgB,CAAC,CAAA;IAClF,MAAM,aAAa,GAAG,eAAe,CAAC,MAAM,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,CAAC,MAAM,CAAC,CAAA;IACrE,MAAM,OAAO,GAAG,mBAAmB,CAAC,GAAG,CAAC,CAAA;IACxC,MAAM,UAAU,GAAG,wBAAwB,CAAC,cAAc,EAAE,OAAO,CAAC,CAAA;IAEpE,qCAAqC;IACrC,MAAM,YAAY,GAAG,aAAa,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAA;IACtD,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,WAAW,CAAC,CAAA;IACzC,MAAM,oBAAoB,GAAG,IAAI,GAAG,EAAU,CAAA;IAC9C,KAAK,MAAM,IAAI,IAAI,OAAO,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC;QAC7C,KAAK,MAAM,CAAC,IAAI,IAAI;YAAE,oBAAoB,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;IACnD,CAAC;IACD,MAAM,eAAe,GAAG,YAAY,CAAC,MAAM,CACzC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,oBAAoB,CAAC,GAAG,CAAC,CAAC,CAAC,CAC5D,CAAA;IAED,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,CAAA;IACrC,IAAI,eAAe,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC/B,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAoB,CAAA;QAC5C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAChD,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,EAAE,CAAC,eAAe,CAAC,CAAC,CAAE,CAAC,CAAC,CAAA;QAClD,CAAC;QACD,SAAS,CAAC,GAAG,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAA;IAClC,CAAC;IACD,OAAO,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,aAAa,EAAE,SAAS,EAAE,CAAA;AACzD,CAAC;AAED,uEAAuE;AACvE,SAAS,wBAAwB,CAC/B,KAAoC,EACpC,SAAwB;IAExB,MAAM,MAAM,GAAG,IAAI,GAAG,EAAoB,CAAA;IAC1C,KAAK,MAAM,CAAC,MAAM,EAAE,WAAW,CAAC,IAAI,KAAK,EAAE,CAAC;QAC1C,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,oBAAoB,CAAC,WAAqD,EAAE,SAAS,CAAC,CAAC,CAAA;IAC5G,CAAC;IACD,OAAO,MAAM,CAAA;AACf,CAAC","sourcesContent":["/**\n * 面演化（face evolution）工具：hash 映射 ↔ ordinal 映射转换\n *\n * @platform occt — 本文件 import occt-kernel（translateWithHashEvolution /\n * scaleWithHashEvolution / directEditWithRoleTable(chamfer 分支) 走 occt-only\n * `*WithHistory` 原生面，D3）。文件级标注满足守卫①（平台 import 自证身份）；\n * 文件内的**中立函数**（getFaceHashes/decodeEvolution/booleanWithRoleTable/\n * identityHashEvolution 等只用 L1 BrepEngineApi）不因标注改变函数级中立性——\n * 调用它们的**中立 op**（rotate_euler/scale3d/fillet/boolean 等）不声明 engines，\n * 运行时不拦截（与 replicate.ts 同口径）。\n *\n * See docs/api-contract.md §11 (topology contract) for face evolution context.\n *\n * occt-wasm 的 *WithHistory API 返回 BrepEvolutionData，其中 modified/generated\n * 用面 hash（内存指针哈希）编码。本模块将其解码为 ordinal 映射（面枚举序号），\n * 可安全持久化进 faijs 文本。\n *\n * 核心原理（分析文档 §4.4）：\n * getSubShapes(shape,'face')[i] ↔ subShapeHashes(shape,'face',B)[i] 一一对应\n * 因此可以把 hash 映射无损转换为 ordinal 映射。\n */\n\nimport type { BrepHandle, BrepEvolutionData } from './engine/types'\nimport type { BrepEngineApi } from './engine/primitives'\nimport { getOcctKernel, type ShapeHandle } from '../occt-kernel/occtKernel'\n\n/** hash 上界（与 occt-wasm kernel.cpp 一致：`% 2147483647`） */\nexport const HASH_UPPER_BOUND = 2147483647\n\n/**\n * 面演化映射：输入面 ordinal → 输出面 ordinal 列表\n *\n * - 1→1：面被修改但未被切割（如面带孔仍是单面）\n * - 1→N：面被切割成多个面\n * - 不在 map 中：面未被修改或被删除\n */\nexport type FaceEvolution = Map<number, number[]>\n\n/**\n * Collect the hash list of all faces of a shape (via subShapeHashes; efficient, no handles allocated).\n * @param kernel - the OCCT kernel.\n * @param shape - the shape whose face hashes to collect.\n * @returns the array of face hashes.\n */\nexport function getFaceHashes(kernel: BrepEngineApi, shape: BrepHandle): number[] {\n  return Array.from(kernel.subShapeHashes(shape, 'face', HASH_UPPER_BOUND))\n}\n\n/**\n * Collect the union of face hashes of two shapes (for WithHistory calls of binary boolean operations).\n *\n * Analysis doc §4.2: fuse/cut/intersect must pass subShapeHashes(A) ∪ subShapeHashes(B)\n * to track both inputs' face evolution.\n * @param kernel - the OCCT kernel.\n * @param shapeA - the first input shape.\n * @param shapeB - the second input shape.\n * @returns the union of the two shapes' face hashes.\n */\nexport function getUnionFaceHashes(\n  kernel: BrepEngineApi,\n  shapeA: BrepHandle,\n  shapeB: BrepHandle,\n): number[] {\n  const hashesA = getFaceHashes(kernel, shapeA)\n  const hashesB = getFaceHashes(kernel, shapeB)\n  return [...new Set([...hashesA, ...hashesB])]\n}\n\n/**\n * 解码 BrepEvolutionData 的 modified 数组为 ordinal 映射。\n *\n * modified 分段编码格式：[inputHash, count, outHash1, outHash2, ...] × N\n *\n * @param kernel      the OCCT kernel.\n * @param evo         the BrepEvolutionData (from a *WithHistory API).\n * @param inputShape  the input shape (for the input face hash → ordinal mapping).\n * @param resultShape the result shape (for the output face hash → ordinal mapping).\n * @returns the FaceEvolution: inOrdinal → outOrdinal[].\n */\nexport function decodeEvolution(\n  kernel: BrepEngineApi,\n  evo: BrepEvolutionData,\n  inputShape: BrepHandle,\n  resultShape: BrepHandle,\n): FaceEvolution {\n  const inputHashes = getFaceHashes(kernel, inputShape)\n  const resultHashes = getFaceHashes(kernel, resultShape)\n\n  // 构建 hash → ordinal 查找表\n  const resultHashToOrdinal = new Map<number, number>()\n  for (let i = 0; i < resultHashes.length; i++) {\n    resultHashToOrdinal.set(resultHashes[i], i)\n  }\n  const inputHashToOrdinal = new Map<number, number>()\n  for (let i = 0; i < inputHashes.length; i++) {\n    inputHashToOrdinal.set(inputHashes[i], i)\n  }\n\n  // 解码 modified 数组\n  const evolution: FaceEvolution = new Map()\n  const modified = evo.modified\n  let idx = 0\n  while (idx < modified.length) {\n    const inHash = modified[idx]\n    const count = modified[idx + 1]\n    const outOrdinals: number[] = []\n    for (let j = 0; j < count; j++) {\n      const outHash = modified[idx + 2 + j]\n      const outOrdinal = resultHashToOrdinal.get(outHash)\n      if (outOrdinal !== undefined) {\n        outOrdinals.push(outOrdinal)\n      }\n    }\n    const inOrdinal = inputHashToOrdinal.get(inHash)\n    if (inOrdinal !== undefined) {\n      evolution.set(inOrdinal, outOrdinals)\n    }\n    idx += 2 + count\n  }\n\n  return evolution\n}\n\n\n/**\n * Hash 键面演化：输入面 hash → 输出面 hash 列表（1→多分裂时多个）。\n *\n * 与序号键 FaceEvolution 并列、同源（同一次 *WithHistory 打包结果解出），\n * 一个供 role 传播（hash 键）、一个供选择器/文本（序号键），零额外 wasm 调用。\n */\nexport interface HashEvolution {\n  /** 输入面 hash → 输出面 hash 列表（1→多分裂时多个）。 */\n  readonly modified: ReadonlyMap<number, readonly number[]>\n  /** 输入面中已不存在的面 hash。 */\n  readonly deleted: ReadonlySet<number>\n}\n\n/**\n * 把 BrepEvolutionData 解码为 hash 键演化（§2.4）。\n *\n * modified 分段编码格式：[inHash, count, outHash1, ...] × N —— 本身就是\n * hash→hash[] 的 1→多映射，直接按同一格式解出 hash 键版本，不需要\n * getSubShapes 逐句柄 hashCode，也不分配任何句柄。\n *\n * generated 刻意不进 role 传播。**实测依据（2026-09-22，`brep/engine/phase0-kernel-probes.test.ts`）**：\n * `generated` 与 `modified` **同构分段、键集相同**，其值是各输入面派生出的**中间形**——\n * `cut` 实测 12 个 hash、结果里 **0 个存活**（`fillet`/`fuse` 里整个桶为空）。\n * ⇒ 新造面**不能**由 `generated` 定位，只能由\"三类命运\"的补集判定\n * （既不在输入 hash 集合、也不在任何 `modified` 输出里），再交 `construct`/派生词汇命名。\n *\n * @param evo - the BrepEvolutionData (from a *WithHistory API).\n * @returns the hash-keyed evolution.\n */\nexport function decodeHashEvolution(evo: BrepEvolutionData): HashEvolution {\n  const modified = new Map<number, number[]>()\n  const m = evo.modified\n  let idx = 0\n  while (idx < m.length) {\n    const inHash = m[idx]\n    const count = m[idx + 1]\n    const outHashes: number[] = []\n    for (let j = 0; j < count; j++) {\n      outHashes.push(m[idx + 2 + j])\n    }\n    modified.set(inHash, outHashes)\n    idx += 2 + count\n  }\n  return { modified, deleted: new Set(evo.deleted) }\n}\n\n/**\n * 把一次双输入布尔（cut/fuse/intersect）的打包演化按「inHash 属于 A 还是 B」\n * 拆成 A、B 两张 hash 演化（§3.4 布尔合流，faijs 对 brepjs 的必要扩展）。\n *\n * 现有 *WithHistoryBrep 包装只用 getUnionFaceHashes 传入 A∪B 两边 hash、且只对\n * 基体 a 解码序号演化。本函数对同一份 evo 零额外内核调用：用 subShapeHashes(a)\n * / subShapeHashes(b) 两个集合判定每个 inHash 的归属，各自传播各自的 role 表。\n *\n * @param evo     - the BrepEvolutionData (from a binary boolean *WithHistory API).\n * @param hashesA - the face hashes of input A (target), via subShapeHashes.\n * @param hashesB - the face hashes of input B (tool), via subShapeHashes.\n * @returns the A/B split hash evolutions (faces from neither input are dropped).\n */\nexport function splitHashEvolutionByOrigin(\n  evo: BrepEvolutionData,\n  hashesA: readonly number[],\n  hashesB: readonly number[],\n): { a: HashEvolution; b: HashEvolution } {\n  const raw = decodeHashEvolution(evo)\n  const setA = new Set(hashesA)\n  const setB = new Set(hashesB)\n\n  const aModified = new Map<number, number[]>()\n  const bModified = new Map<number, number[]>()\n  for (const [inHash, outs] of raw.modified) {\n    if (setA.has(inHash)) aModified.set(inHash, [...outs])\n    else if (setB.has(inHash)) bModified.set(inHash, [...outs])\n  }\n\n  const aDeleted = new Set<number>()\n  const bDeleted = new Set<number>()\n  for (const h of raw.deleted) {\n    if (setA.has(h)) aDeleted.add(h)\n    else if (setB.has(h)) bDeleted.add(h)\n  }\n\n  return { a: { modified: aModified, deleted: aDeleted }, b: { modified: bModified, deleted: bDeleted } }\n}\n\n/**\n * 构造 hash 键恒等演化：输入第 i 面 hash → 输出第 i 面 hash（按枚举序号对齐）。\n *\n * ⚠️ **Phase 0.3 后本函数只用于「内核无 `*WithHistory` 可表达」的 4 个 op**：\n *\n * | op | 为什么不能走权威映射 |\n * |---|---|\n * | `rotate_euler` | 任意欧拉角 + pivot；内核只有**单轴** `rotateWithHistory` |\n * | `scale3d` | 非等比；`generalTransform` 无历史（`scaleWithHistory` 只收均匀 factor） |\n * | `copy` | 深拷贝；内核无 `copyWithHistory` |\n * | `place` | 任意矩阵 `located`；内核无对应历史 API |\n *\n * `translate` / `scale`（均匀）已改走权威映射（`translateWithHashEvolution` /\n * `scaleWithHashEvolution`），不再经过本函数。\n *\n * ⚠️ **本函数的正确性依赖一个曾经未被验证的假设**：刚体变换/深拷贝保持 OCCT 的\n * 面枚举序号。该假设现由 `brep/face-evolution.ordering.test.ts` 实测钉住。\n * 若该测试变红 ⇒ 本函数在这 4 个 op 上会产出**错误的身份映射**，\n * 必须为它们找别的权威来源，**不是**调松测试。\n *\n * @param kernel       - the OCCT kernel.\n * @param inputShape   - the input shape.\n * @param resultShape  - the transformed/copied output shape.\n * @returns the hash identity evolution (modified: in[i] → [out[i]]).\n */\nexport function identityHashEvolution(\n  kernel: BrepEngineApi,\n  inputShape: BrepHandle,\n  resultShape: BrepHandle,\n): HashEvolution {\n  const inputHashes = getFaceHashes(kernel, inputShape)\n  const resultHashes = getFaceHashes(kernel, resultShape)\n  const count = Math.min(inputHashes.length, resultHashes.length)\n  const modified = new Map<number, number[]>()\n  for (let i = 0; i < count; i++) {\n    modified.set(inputHashes[i], [resultHashes[i]])\n  }\n  return { modified, deleted: new Set() }\n}\n\n/**\n * 平移 + **权威**面演化（Phase 0.3）：走内核 `translateWithHistory`。\n *\n * 与 `identityHashEvolution` 的区别：这里的 `inHash → outHash[]` 是 OCCT 自己给的，\n * **不依赖**\"枚举序号在变换后保持\"这个此前从未验证的假设（分析文档 §7 第 6 项）。\n * 实测（`brep/engine/evolution-bindings.test.ts`）：刚体变换的权威映射为\n * 1:1 全覆盖（`coveredInputs === 面数`、`deleted` 空、`generated` 空）。\n *\n * @param kernel - the OCCT kernel.\n * @param shape  - the input shape.\n * @param d      - the translation vector as [dx, dy, dz].\n * @returns the translated handle plus the authority hash evolution.\n */\nexport function translateWithHashEvolution(\n  kernel: BrepEngineApi,\n  shape: BrepHandle,\n  d: readonly [number, number, number],\n): { result: BrepHandle; evolution: HashEvolution } {\n  const inputHashes = getFaceHashes(kernel, shape)\n  const evo = getOcctKernel().translateWithHistory(shape as unknown as ShapeHandle, d[0], d[1], d[2], inputHashes, HASH_UPPER_BOUND) as unknown as BrepEvolutionData\n  return { result: evo.result, evolution: decodeHashEvolution(evo) }\n}\n\n/**\n * 均匀缩放 + **权威**面演化（Phase 0.3）：走内核 `scaleWithHistory`。\n *\n * ⚠️ **仅均匀缩放**。非均匀缩放内核无 `*WithHistory`（`generalTransform` 无历史），\n * 故 `scale3d` 无法走本函数——它退回 `identityHashEvolution`，其\"面序保持\"假设\n * 由 `brep/face-evolution.ordering.test.ts` 钉住。\n *\n * @param kernel - the OCCT kernel.\n * @param shape  - the input shape.\n * @param center - the fixed point of the scaling (not scaled).\n * @param factor - the uniform scale factor.\n * @returns the scaled handle plus the authority hash evolution.\n */\nexport function scaleWithHashEvolution(\n  kernel: BrepEngineApi,\n  shape: BrepHandle,\n  center: readonly [number, number, number],\n  factor: number,\n): { result: BrepHandle; evolution: HashEvolution } {\n  const inputHashes = getFaceHashes(kernel, shape)\n  const evo = getOcctKernel().scaleWithHistory(\n    shape as unknown as ShapeHandle,\n    { x: center[0], y: center[1], z: center[2] },\n    factor,\n    inputHashes,\n    HASH_UPPER_BOUND,\n  ) as unknown as BrepEvolutionData\n  return { result: evo.result, evolution: decodeHashEvolution(evo) }\n}\n\n/**\n * 双输入布尔 + roleTable 合流组合封装（§3.4，api boolean 链式调用用）。\n *\n * 一次 *WithHistory 内核调用同时产出：\n * - result：结果实体\n * - faceEvolution：序号键演化（进 faceEvolutionCache，服务选择器/可视化）\n * - roleTable：A/B 两侧 role 表各自传播后合并（进 roleTableCache，服务命名）\n *\n * 缝面（generated）刻意不进 role 传播（§1.3/R2：generated hash 指向中间形、\n * 实测 0 存活）。新 origin 一律是**本次语句的 StmtId**（Phase 1.6：不再用 LHS\n * 变量名——PartName 会被改名/复用，StmtId 全局唯一）。\n *\n * @param kernel  - the OCCT kernel.\n * @param op      - the boolean operation ('fuse' | 'cut' | 'intersect').\n * @param a       - the target shape.\n * @param b       - the tool shape.\n * @param tableA  - the target's role table.\n * @param tableB  - the tool's role table.\n * @param outStmt - the boolean statement's StmtId (串形；新 origin for seam faces).\n * @returns the result handle, ordinal evolution and merged role table.\n */\nexport function booleanWithRoleTable(\n  kernel: BrepEngineApi,\n  op: 'fuse' | 'cut' | 'intersect',\n  a: BrepHandle,\n  b: BrepHandle,\n  tableA: ReadonlyMap<unknown, unknown>,\n  tableB: ReadonlyMap<unknown, unknown>,\n  outStmt: string,\n): { result: BrepHandle; faceEvolution: FaceEvolution; roleTable: ReadonlyMap<unknown, unknown> } {\n  const inputHashes = getUnionFaceHashes(kernel, a, b)\n  let evo: BrepEvolutionData\n  if (op === 'fuse') evo = kernel.fuseWithHistory(a, b, inputHashes, HASH_UPPER_BOUND)\n  else if (op === 'cut') evo = kernel.cutWithHistory(a, b, inputHashes, HASH_UPPER_BOUND)\n  else evo = kernel.intersectWithHistory(a, b, inputHashes, HASH_UPPER_BOUND)\n\n  const faceEvolution = decodeEvolution(kernel, evo, a, evo.result)\n\n  // A/B 拆流 → 各自传播 → 合表（§3.4）\n  const hashesA = getFaceHashes(kernel, a)\n  const hashesB = getFaceHashes(kernel, b)\n  const { a: evoA, b: evoB } = splitHashEvolutionByOrigin(evo, hashesA, hashesB)\n  const merged = mergeRoleTablesLocal(tableA, evoA, tableB, evoB, outStmt)\n\n  // G 组（2026-10-03，Flapper LHS 语料）：fuse 的接缝面（两半挤出 union 时\n  // 共享平面被 BOP 重建的面）既不属于 A 也不属于 B 的血缘，merge 后无 role —\n  // 下游 edgeRef/fillet 查邻面时报 \"no role lineage\"（face-evolution 注释里\n  // 一直挂着的 \"seam faces are a Phase 4+ concern\" 正是本盲区）。把不属于任何\n  // 已知血缘的结果面登记为新 origin（本次语句）的 `seam` 角色——血缘真实\n  // （该面确实诞生于本次布尔），不是伪造映射。\n  if (op === 'fuse') {\n    const covered = new Set<unknown>()\n    for (const roles of merged.values()) {\n      for (const hs of (roles as ReadonlyMap<string, readonly number[]>).values()) {\n        for (const h of hs) covered.add(h)\n      }\n    }\n    const seamHashes = getFaceHashes(kernel, evo.result).filter((h) => !covered.has(h))\n    if (seamHashes.length > 0) {\n      (merged as Map<unknown, unknown>).set(outStmt, new Map([['seam', seamHashes]]))\n    }\n  }\n\n  return { result: evo.result, faceEvolution, roleTable: merged }\n}\n\n/** 合表（避免 naming/roles 循环依赖：本文件不 import naming，用结构等价实现）。 */\nfunction mergeRoleTablesLocal(\n  tableA: ReadonlyMap<unknown, unknown>,\n  evoA: HashEvolution,\n  tableB: ReadonlyMap<unknown, unknown>,\n  evoB: HashEvolution,\n  // eslint-disable-next-line @typescript-eslint/no-unused-vars -- retained for future boolean generated-face naming\n  outPart: string,\n): ReadonlyMap<unknown, unknown> {\n  const result = new Map<unknown, unknown>()\n  for (const [origin, roles] of tableA) {\n    result.set(origin, propagateOriginRoles(roles as ReadonlyMap<string, readonly number[]>, evoA))\n  }\n  for (const [origin, roles] of tableB) {\n    const existing = result.get(origin) as ReadonlyMap<string, readonly number[]> | undefined\n    const advanced = propagateOriginRoles(roles as ReadonlyMap<string, readonly number[]>, evoB)\n    if (existing) {\n      const merged = new Map<string, number[]>()\n      for (const [role, hs] of existing) merged.set(role, [...hs])\n      for (const [role, hs] of advanced) {\n        const prev = merged.get(role)\n        merged.set(role, prev ? [...new Set([...prev, ...hs])] : [...hs])\n      }\n      result.set(origin, merged)\n    } else {\n      result.set(origin, advanced)\n    }\n  }\n  // 3.6: void outPart removed — boolean seam faces are handled by the \"three fates\"\n  // analysis (§4.4): cut has 0 new faces (§7 item 7), fuse seam faces are a Phase 4+ concern.\n  // outPart retained for future kernel/byAdjacency on boolean generated faces.\n  return result\n}\n\n/** 单 origin 传播（结构等价于 naming/roles.propagateRoles，避免循环依赖）。 */\nfunction propagateOriginRoles(\n  roles: ReadonlyMap<string, readonly number[]>,\n  evolution: HashEvolution,\n): ReadonlyMap<string, readonly number[]> {\n  const updated = new Map<string, number[]>()\n  for (const [role, hashes] of roles) {\n    const successors: number[] = []\n    for (const hash of hashes) {\n      if (evolution.deleted.has(hash)) continue\n      const modified = evolution.modified.get(hash)\n      const targets = modified !== undefined && modified.length > 0 ? modified : [hash]\n      for (const h of targets) if (!successors.includes(h)) successors.push(h)\n    }\n    if (successors.length > 0) updated.set(role, successors)\n  }\n  return updated\n}\n\n/**\n * Decode a BrepEvolutionData deleted array into the ordinal list of deleted faces.\n * @param kernel     - the OCCT kernel.\n * @param evo        - the BrepEvolutionData (from a *WithHistory API).\n * @param inputShape - the input shape (for the hash → ordinal mapping).\n * @returns the array of deleted face ordinals.\n */\nexport function decodeDeleted(\n  kernel: BrepEngineApi,\n  evo: BrepEvolutionData,\n  inputShape: BrepHandle,\n): number[] {\n  const inputHashes = getFaceHashes(kernel, inputShape)\n  const inputHashToOrdinal = new Map<number, number>()\n  for (let i = 0; i < inputHashes.length; i++) {\n    inputHashToOrdinal.set(inputHashes[i], i)\n  }\n\n  const deletedOrdinals: number[] = []\n  for (const hash of evo.deleted) {\n    const ordinal = inputHashToOrdinal.get(hash)\n    if (ordinal !== undefined) {\n      deletedOrdinals.push(ordinal)\n    }\n  }\n  return deletedOrdinals\n}\n\n// ─── WithHistory 封装函数 ───\n\n/**\n * cutWithHistory 封装：执行切割并返回结果 + 面演化映射。\n *\n * @param kernel OCCT 内核\n * @param a 基体\n * @param b 工具（从基体中减去）\n * @returns { result: 结果 BrepHandle, faceEvolution: 面演化映射 }\n */\nexport function cutWithHistoryBrep(\n  kernel: BrepEngineApi,\n  a: BrepHandle,\n  b: BrepHandle,\n): { result: BrepHandle; faceEvolution: FaceEvolution } {\n  const inputHashes = getUnionFaceHashes(kernel, a, b)\n  const evo = kernel.cutWithHistory(a, b, inputHashes, HASH_UPPER_BOUND)\n  const faceEvolution = decodeEvolution(kernel, evo, a, evo.result)\n  return { result: evo.result, faceEvolution }\n}\n\n/**\n * fuseWithHistory wrapper: performs the fuse and returns the result plus the face evolution mapping.\n * @param kernel - the OCCT kernel.\n * @param a - the base shape.\n * @param b - the tool shape to fuse into the base.\n * @returns the result BrepHandle plus the face evolution mapping.\n */\nexport function fuseWithHistoryBrep(\n  kernel: BrepEngineApi,\n  a: BrepHandle,\n  b: BrepHandle,\n): { result: BrepHandle; faceEvolution: FaceEvolution } {\n  const inputHashes = getUnionFaceHashes(kernel, a, b)\n  const evo = kernel.fuseWithHistory(a, b, inputHashes, HASH_UPPER_BOUND)\n  const faceEvolution = decodeEvolution(kernel, evo, a, evo.result)\n  return { result: evo.result, faceEvolution }\n}\n\n/**\n * intersectWithHistory wrapper: performs the intersection and returns the result plus the face evolution mapping.\n * @param kernel - the OCCT kernel.\n * @param a - the first input shape.\n * @param b - the second input shape.\n * @returns the result BrepHandle plus the face evolution mapping.\n */\nexport function intersectWithHistoryBrep(\n  kernel: BrepEngineApi,\n  a: BrepHandle,\n  b: BrepHandle,\n): { result: BrepHandle; faceEvolution: FaceEvolution } {\n  const inputHashes = getUnionFaceHashes(kernel, a, b)\n  const evo = kernel.intersectWithHistory(a, b, inputHashes, HASH_UPPER_BOUND)\n  const faceEvolution = decodeEvolution(kernel, evo, a, evo.result)\n  return { result: evo.result, faceEvolution }\n}\n\n// ─── 变换操作面演化 ───\n\n/**\n * 构造恒等面演化映射（用于 translate/rotate/scale 等不改变拓扑的操作）。\n *\n * 变换操作不改变面的数量和顺序，每个面 ordinal i → [i]。\n * 避免调用 *WithHistory API（rotate/scale 的 WithHistory 签名与现有 Euler/Vec3 参数不兼容）。\n *\n * @param kernel OCCT 内核\n * @param shape 输入形状（用于获取面数量）\n * @returns 恒等 FaceEvolution\n */\nexport function identityEvolution(\n  kernel: BrepEngineApi,\n  shape: BrepHandle,\n): FaceEvolution {\n  const faceCount = getFaceHashes(kernel, shape).length\n  const evolution: FaceEvolution = new Map()\n  for (let i = 0; i < faceCount; i++) {\n    evolution.set(i, [i])\n  }\n  return evolution\n}\n\n// ─── directEdit WithHistory 封装（fillet / chamfer：单输入） ───\n\n/**\n * 单输入 directEdit（fillet/chamfer）+ roleTable 传播封装。\n *\n * 与 `booleanWithRoleTable`（双输入）对应：单输入只有一张输入 role 表，\n * 一次 `*WithHistory` 内核调用产出结果 + 面演化，沿 hash 演化推进所有 origin。\n *\n * generated 刻意不进 role 传播（§1.3 事实：generated hash 指向中间形，\n * 实测 0 存活），过渡面的命名由 DerivedFaceTopoRef 在 M2 处理。\n *\n * @param kernel          - the OCCT kernel.\n * @param op              - the directEdit operation ('fillet' | 'chamfer').\n * @param solid          - the input solid (single input, unlike boolean's a/b).\n * @param edgeHandles     - the resolved Edge handles to fillet/chamfer.\n * @param radius          - the fillet radius or chamfer distance (uniform only).\n * @param inputRoleTable  - the input's role table.\n * @param outPart         - the statement's LHS variable name (for new origin allocation).\n * @returns the result handle, ordinal evolution and propagated role table.\n */\nexport function directEditWithRoleTable(\n  kernel: BrepEngineApi,\n  op: 'fillet' | 'chamfer',\n  solid: BrepHandle,\n  edgeHandles: BrepHandle[],\n  radius: number,\n  inputRoleTable: ReadonlyMap<unknown, unknown>,\n  outPart: string,\n): { result: BrepHandle; faceEvolution: FaceEvolution; roleTable: ReadonlyMap<unknown, unknown> } {\n  const inputHashes = getFaceHashes(kernel, solid)\n  let evo: BrepEvolutionData\n  if (op === 'fillet') {\n    evo = kernel.filletWithHistory(solid, edgeHandles, radius, inputHashes, HASH_UPPER_BOUND)\n  } else {\n    // chamferWithHistory 是 occt-only（L1 无）→ 平台面 getOcctKernel（D3）。\n    // BrepHandle（branded number）与 occt-wasm ShapeHandle 运行时同构，品牌转换\n    // 只发生在平台边界。\n    evo = getOcctKernel().chamferWithHistory(\n      solid as unknown as ShapeHandle,\n      edgeHandles as unknown as ShapeHandle[],\n      radius,\n      inputHashes,\n      HASH_UPPER_BOUND,\n    ) as unknown as BrepEvolutionData\n  }\n\n  const faceEvolution = decodeEvolution(kernel, evo, solid, evo.result)\n  const hashEvo = decodeHashEvolution(evo)\n  const propagated = propagateAllOriginsLocal(inputRoleTable, hashEvo)\n\n  // 3.4: generated face naming — transition faces are neither input faces nor\n  // modified outputs (§4.4 \"三类命运\": 原样幸存 / 改型幸存 / 新造).\n  // Role format: `gen:<op>:<i>` (i = enumeration order among generated faces).\n  // String formatted directly (no import of role-name.ts — avoids circular dep).\n  const resultHashes = getFaceHashes(kernel, evo.result)\n  const inputHashSet = new Set(inputHashes)\n  const modifiedOutputHashes = new Set<number>()\n  for (const outs of hashEvo.modified.values()) {\n    for (const h of outs) modifiedOutputHashes.add(h)\n  }\n  const generatedHashes = resultHashes.filter(\n    (h) => !inputHashSet.has(h) && !modifiedOutputHashes.has(h),\n  )\n\n  if (generatedHashes.length > 0) {\n    const genRoles = new Map<string, number[]>()\n    for (let i = 0; i < generatedHashes.length; i++) {\n      genRoles.set(`gen:${op}:${i}`, [generatedHashes[i]!])\n    }\n    const roleTable = new Map(propagated)\n    roleTable.set(outPart, genRoles)\n    return { result: evo.result, faceEvolution, roleTable }\n  }\n\n  return { result: evo.result, faceEvolution, roleTable: propagated }\n}\n\n/**\n * 单输入 directEdit 的便捷别名：fillet。\n *\n * @param kernel          - the OCCT kernel.\n * @param solid          - the input solid.\n * @param edgeHandles     - the resolved Edge handles.\n * @param radius          - the fillet radius (uniform).\n * @param inputRoleTable  - the input's role table.\n * @param outPart         - the statement's LHS variable name.\n * @returns the result handle, ordinal evolution and propagated role table.\n */\nexport function filletWithRoleTable(\n  kernel: BrepEngineApi,\n  solid: BrepHandle,\n  edgeHandles: BrepHandle[],\n  radius: number,\n  inputRoleTable: ReadonlyMap<unknown, unknown>,\n  outPart: string,\n): { result: BrepHandle; faceEvolution: FaceEvolution; roleTable: ReadonlyMap<unknown, unknown> } {\n  return directEditWithRoleTable(kernel, 'fillet', solid, edgeHandles, radius, inputRoleTable, outPart)\n}\n\n/**\n * 单输入 directEdit 的便捷别名：chamfer。\n *\n * @param kernel          - the OCCT kernel.\n * @param solid          - the input solid.\n * @param edgeHandles     - the resolved Edge handles.\n * @param distance        - the chamfer distance (uniform).\n * @param inputRoleTable  - the input's role table.\n * @param outPart         - the statement's LHS variable name.\n * @returns the result handle, ordinal evolution and propagated role table.\n */\nexport function chamferWithRoleTable(\n  kernel: BrepEngineApi,\n  solid: BrepHandle,\n  edgeHandles: BrepHandle[],\n  distance: number,\n  inputRoleTable: ReadonlyMap<unknown, unknown>,\n  outPart: string,\n): { result: BrepHandle; faceEvolution: FaceEvolution; roleTable: ReadonlyMap<unknown, unknown> } {\n  return directEditWithRoleTable(kernel, 'chamfer', solid, edgeHandles, distance, inputRoleTable, outPart)\n}\n\n/**\n * 钻孔 roleTable 传播：底孔（圆柱 cut）产生的新造面 = 孔壁，挂**消费它的那条语句**\n * 的 origin（§7.1：drill 的工具体是 op 内部临时件，无其他用户可见坐标可继承）。\n * 角色形态 `hole:<j>`（j = 新造面枚举序）。沿用 `directEditWithRoleTable` 的\n * 三类命运判定（原样幸存 / 改型幸存 / 新造），新造面才派生命名。\n *\n * @param kernel         - the OCCT kernel.\n * @param solid          - the input solid (the drilled part).\n * @param toolSolid      - the drill-bit tool solid (caller-built; released by caller).\n * @param inputRoleTable - the input's role table.\n * @param outStmt        - the drilling statement's StmtId (origin for new faces).\n * @returns the result handle, ordinal evolution and role table with `hole:<j>`.\n */\nexport function drillBrepWithRoleTable(\n  kernel: BrepEngineApi,\n  solid: BrepHandle,\n  toolSolid: BrepHandle,\n  inputRoleTable: ReadonlyMap<unknown, unknown>,\n  outStmt: string,\n): { result: BrepHandle; faceEvolution: FaceEvolution; roleTable: ReadonlyMap<unknown, unknown> } {\n  const inputHashes = getFaceHashes(kernel, solid)\n  const evo = kernel.cutWithHistory(solid, toolSolid, inputHashes, HASH_UPPER_BOUND)\n  const faceEvolution = decodeEvolution(kernel, evo, solid, evo.result)\n  const hashEvo = decodeHashEvolution(evo)\n  const propagated = propagateAllOriginsLocal(inputRoleTable, hashEvo)\n\n  // 三类命运判定：新造面 = 结果 − 输入 − 改型后继（§4.4）。\n  const resultHashes = getFaceHashes(kernel, evo.result)\n  const inputHashSet = new Set(inputHashes)\n  const modifiedOutputHashes = new Set<number>()\n  for (const outs of hashEvo.modified.values()) {\n    for (const h of outs) modifiedOutputHashes.add(h)\n  }\n  const generatedHashes = resultHashes.filter(\n    (h) => !inputHashSet.has(h) && !modifiedOutputHashes.has(h),\n  )\n\n  const roleTable = new Map(propagated)\n  if (generatedHashes.length > 0) {\n    const genRoles = new Map<string, number[]>()\n    for (let i = 0; i < generatedHashes.length; i++) {\n      genRoles.set(`hole:${i}`, [generatedHashes[i]!])\n    }\n    roleTable.set(outStmt, genRoles)\n  }\n  return { result: evo.result, faceEvolution, roleTable }\n}\n\n/** 单输入 roleTable 传播（结构等价于 naming/roles.propagateAllOrigins，避免循环依赖）。 */\nfunction propagateAllOriginsLocal(\n  roles: ReadonlyMap<unknown, unknown>,\n  evolution: HashEvolution,\n): ReadonlyMap<unknown, unknown> {\n  const result = new Map<unknown, unknown>()\n  for (const [origin, originRoles] of roles) {\n    result.set(origin, propagateOriginRoles(originRoles as ReadonlyMap<string, readonly number[]>, evolution))\n  }\n  return result\n}\n"]}
+{"version":3,"file":"face-evolution.js","sourceRoot":"","sources":["../../src/brep/face-evolution.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;AAIH,OAAO,EAAE,aAAa,EAAoB,MAAM,2BAA2B,CAAA;AAE3E,wDAAwD;AACxD,MAAM,CAAC,MAAM,gBAAgB,GAAG,UAAU,CAAA;AAW1C;;;;;GAKG;AACH,MAAM,UAAU,aAAa,CAAC,MAAqB,EAAE,KAAiB;IACpE,OAAO,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,cAAc,CAAC,KAAK,EAAE,MAAM,EAAE,gBAAgB,CAAC,CAAC,CAAA;AAC3E,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,kBAAkB,CAChC,MAAqB,EACrB,MAAkB,EAClB,MAAkB;IAElB,MAAM,OAAO,GAAG,aAAa,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;IAC7C,MAAM,OAAO,GAAG,aAAa,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;IAC7C,OAAO,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,OAAO,EAAE,GAAG,OAAO,CAAC,CAAC,CAAC,CAAA;AAC/C,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,eAAe,CAC7B,MAAqB,EACrB,GAAsB,EACtB,UAAsB,EACtB,WAAuB;IAEvB,MAAM,WAAW,GAAG,aAAa,CAAC,MAAM,EAAE,UAAU,CAAC,CAAA;IACrD,MAAM,YAAY,GAAG,aAAa,CAAC,MAAM,EAAE,WAAW,CAAC,CAAA;IAEvD,wBAAwB;IACxB,MAAM,mBAAmB,GAAG,IAAI,GAAG,EAAkB,CAAA;IACrD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7C,mBAAmB,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;IAC7C,CAAC;IACD,MAAM,kBAAkB,GAAG,IAAI,GAAG,EAAkB,CAAA;IACpD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5C,kBAAkB,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;IAC3C,CAAC;IAED,iBAAiB;IACjB,MAAM,SAAS,GAAkB,IAAI,GAAG,EAAE,CAAA;IAC1C,MAAM,QAAQ,GAAG,GAAG,CAAC,QAAQ,CAAA;IAC7B,IAAI,GAAG,GAAG,CAAC,CAAA;IACX,OAAO,GAAG,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC;QAC7B,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAA;QAC5B,MAAM,KAAK,GAAG,QAAQ,CAAC,GAAG,GAAG,CAAC,CAAC,CAAA;QAC/B,MAAM,WAAW,GAAa,EAAE,CAAA;QAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/B,MAAM,OAAO,GAAG,QAAQ,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;YACrC,MAAM,UAAU,GAAG,mBAAmB,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;YACnD,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;gBAC7B,WAAW,CAAC,IAAI,CAAC,UAAU,CAAC,CAAA;YAC9B,CAAC;QACH,CAAC;QACD,MAAM,SAAS,GAAG,kBAAkB,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;QAChD,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;YAC5B,SAAS,CAAC,GAAG,CAAC,SAAS,EAAE,WAAW,CAAC,CAAA;QACvC,CAAC;QACD,GAAG,IAAI,CAAC,GAAG,KAAK,CAAA;IAClB,CAAC;IAED,OAAO,SAAS,CAAA;AAClB,CAAC;AAgBD;;;;;;;;;;;;;;;GAeG;AACH,MAAM,UAAU,mBAAmB,CAAC,GAAsB;IACxD,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAoB,CAAA;IAC5C,MAAM,CAAC,GAAG,GAAG,CAAC,QAAQ,CAAA;IACtB,IAAI,GAAG,GAAG,CAAC,CAAA;IACX,OAAO,GAAG,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC;QACtB,MAAM,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,CAAA;QACrB,MAAM,KAAK,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAA;QACxB,MAAM,SAAS,GAAa,EAAE,CAAA;QAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/B,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;QAChC,CAAC;QACD,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE,SAAS,CAAC,CAAA;QAC/B,GAAG,IAAI,CAAC,GAAG,KAAK,CAAA;IAClB,CAAC;IACD,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,IAAI,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAA;AACpD,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,0BAA0B,CACxC,GAAsB,EACtB,OAA0B,EAC1B,OAA0B;IAE1B,MAAM,GAAG,GAAG,mBAAmB,CAAC,GAAG,CAAC,CAAA;IACpC,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,CAAA;IAC7B,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,CAAA;IAE7B,MAAM,SAAS,GAAG,IAAI,GAAG,EAAoB,CAAA;IAC7C,MAAM,SAAS,GAAG,IAAI,GAAG,EAAoB,CAAA;IAC7C,KAAK,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC1C,IAAI,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC;YAAE,SAAS,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,CAAA;aACjD,IAAI,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC;YAAE,SAAS,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,CAAA;IAC7D,CAAC;IAED,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAA;IAClC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAA;IAClC,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,OAAO,EAAE,CAAC;QAC5B,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;aAC3B,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;IACvC,CAAC;IAED,OAAO,EAAE,CAAC,EAAE,EAAE,QAAQ,EAAE,SAAS,EAAE,OAAO,EAAE,QAAQ,EAAE,EAAE,CAAC,EAAE,EAAE,QAAQ,EAAE,SAAS,EAAE,OAAO,EAAE,QAAQ,EAAE,EAAE,CAAA;AACzG,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,MAAM,UAAU,qBAAqB,CACnC,MAAqB,EACrB,UAAsB,EACtB,WAAuB;IAEvB,MAAM,WAAW,GAAG,aAAa,CAAC,MAAM,EAAE,UAAU,CAAC,CAAA;IACrD,MAAM,YAAY,GAAG,aAAa,CAAC,MAAM,EAAE,WAAW,CAAC,CAAA;IACvD,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,MAAM,EAAE,YAAY,CAAC,MAAM,CAAC,CAAA;IAC/D,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAoB,CAAA;IAC5C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;QAC/B,QAAQ,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IACjD,CAAC;IACD,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,IAAI,GAAG,EAAE,EAAE,CAAA;AACzC,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,0BAA0B,CACxC,MAAqB,EACrB,KAAiB,EACjB,CAAoC;IAEpC,MAAM,WAAW,GAAG,aAAa,CAAC,MAAM,EAAE,KAAK,CAAC,CAAA;IAChD,MAAM,GAAG,GAAG,aAAa,EAAE,CAAC,oBAAoB,CAAC,KAA+B,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,gBAAgB,CAAiC,CAAA;IAClK,OAAO,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,SAAS,EAAE,mBAAmB,CAAC,GAAG,CAAC,EAAE,CAAA;AACpE,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,sBAAsB,CACpC,MAAqB,EACrB,KAAiB,EACjB,MAAyC,EACzC,MAAc;IAEd,MAAM,WAAW,GAAG,aAAa,CAAC,MAAM,EAAE,KAAK,CAAC,CAAA;IAChD,MAAM,GAAG,GAAG,aAAa,EAAE,CAAC,gBAAgB,CAC1C,KAA+B,EAC/B,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,EAC5C,MAAM,EACN,WAAW,EACX,gBAAgB,CACe,CAAA;IACjC,OAAO,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,SAAS,EAAE,mBAAmB,CAAC,GAAG,CAAC,EAAE,CAAA;AACpE,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,uBAAuB,CACrC,MAAqB,EACrB,KAAiB,EACjB,SAA4C,EAC5C,OAA0C,EAC1C,QAAgB;IAEhB,MAAM,WAAW,GAAG,aAAa,CAAC,MAAM,EAAE,KAAK,CAAC,CAAA;IAChD,MAAM,GAAG,GAAG,aAAa,EAAE,CAAC,iBAAiB,CAC3C,KAA+B,EAC/B,EAAE,KAAK,EAAE,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,SAAS,EAAE,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,EAC5H,QAAQ,EACR,WAAW,EACX,gBAAgB,CACe,CAAA;IACjC,OAAO;QACL,MAAM,EAAE,GAAG,CAAC,MAAM;QAClB,SAAS,EAAE,mBAAmB,CAAC,GAAG,CAAC;QACnC,aAAa,EAAE,eAAe,CAAC,MAAM,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,CAAC,MAAM,CAAC;KAC/D,CAAA;AACH,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,uBAAuB,CACrC,MAAqB,EACrB,KAAiB,EACjB,KAAwC,EACxC,MAAyC;IAEzC,MAAM,WAAW,GAAG,aAAa,CAAC,MAAM,EAAE,KAAK,CAAC,CAAA;IAChD,MAAM,GAAG,GAAG,aAAa,EAAE,CAAC,iBAAiB,CAC3C,KAA+B,EAC/B,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,EACzC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,EAC5C,WAAW,EACX,gBAAgB,CACe,CAAA;IACjC,OAAO;QACL,MAAM,EAAE,GAAG,CAAC,MAAM;QAClB,SAAS,EAAE,mBAAmB,CAAC,GAAG,CAAC;QACnC,aAAa,EAAE,eAAe,CAAC,MAAM,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,CAAC,MAAM,CAAC;KAC/D,CAAA;AACH,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,sBAAsB,CACpC,MAAqB,EACrB,KAAiB,EACjB,KAAmB,EACnB,SAAiB,EACjB,SAAiB;IAEjB,MAAM,WAAW,GAAG,aAAa,CAAC,MAAM,EAAE,KAAK,CAAC,CAAA;IAChD,MAAM,GAAG,GAAG,aAAa,EAAE,CAAC,gBAAgB,CAC1C,KAA+B,EAC/B,KAAiC,EACjC,SAAS,EACT,SAAS,EACT,WAAW,EACX,gBAAgB,CACe,CAAA;IACjC,OAAO;QACL,MAAM,EAAE,GAAG,CAAC,MAAM;QAClB,SAAS,EAAE,mBAAmB,CAAC,GAAG,CAAC;QACnC,aAAa,EAAE,eAAe,CAAC,MAAM,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,CAAC,MAAM,CAAC;KAC/D,CAAA;AACH,CAAC;AAED;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,MAAM,UAAU,oBAAoB,CAClC,MAAqB,EACrB,EAAgC,EAChC,CAAa,EACb,CAAa,EACb,MAAqC,EACrC,MAAqC,EACrC,OAAe;IAEf,MAAM,WAAW,GAAG,kBAAkB,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;IACpD,IAAI,GAAsB,CAAA;IAC1B,IAAI,EAAE,KAAK,MAAM;QAAE,GAAG,GAAG,MAAM,CAAC,eAAe,CAAC,CAAC,EAAE,CAAC,EAAE,WAAW,EAAE,gBAAgB,CAAC,CAAA;SAC/E,IAAI,EAAE,KAAK,KAAK;QAAE,GAAG,GAAG,MAAM,CAAC,cAAc,CAAC,CAAC,EAAE,CAAC,EAAE,WAAW,EAAE,gBAAgB,CAAC,CAAA;;QAClF,GAAG,GAAG,MAAM,CAAC,oBAAoB,CAAC,CAAC,EAAE,CAAC,EAAE,WAAW,EAAE,gBAAgB,CAAC,CAAA;IAE3E,MAAM,aAAa,GAAG,eAAe,CAAC,MAAM,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,CAAA;IAEjE,2BAA2B;IAC3B,MAAM,OAAO,GAAG,aAAa,CAAC,MAAM,EAAE,CAAC,CAAC,CAAA;IACxC,MAAM,OAAO,GAAG,aAAa,CAAC,MAAM,EAAE,CAAC,CAAC,CAAA;IACxC,MAAM,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,GAAG,0BAA0B,CAAC,GAAG,EAAE,OAAO,EAAE,OAAO,CAAC,CAAA;IAC9E,MAAM,MAAM,GAAG,oBAAoB,CAAC,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,OAAO,CAAC,CAAA;IAExE,wDAAwD;IACxD,mDAAmD;IACnD,+DAA+D;IAC/D,0DAA0D;IAC1D,6CAA6C;IAC7C,wBAAwB;IACxB,IAAI,EAAE,KAAK,MAAM,EAAE,CAAC;QAClB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAW,CAAA;QAClC,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC;YACpC,KAAK,MAAM,EAAE,IAAK,KAAgD,CAAC,MAAM,EAAE,EAAE,CAAC;gBAC5E,KAAK,MAAM,CAAC,IAAI,EAAE;oBAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;YACpC,CAAC;QACH,CAAC;QACD,MAAM,UAAU,GAAG,aAAa,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;QACnF,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACzB,MAAgC,CAAC,GAAG,CAAC,OAAO,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,CAAA;QACjF,CAAC;IACH,CAAC;IAED,OAAO,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,aAAa,EAAE,SAAS,EAAE,MAAM,EAAE,CAAA;AACjE,CAAC;AAED,2DAA2D;AAC3D,SAAS,oBAAoB,CAC3B,MAAqC,EACrC,IAAmB,EACnB,MAAqC,EACrC,IAAmB;AACnB,kHAAkH;AAClH,OAAe;IAEf,MAAM,MAAM,GAAG,IAAI,GAAG,EAAoB,CAAA;IAC1C,KAAK,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,IAAI,MAAM,EAAE,CAAC;QACrC,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,oBAAoB,CAAC,KAA+C,EAAE,IAAI,CAAC,CAAC,CAAA;IACjG,CAAC;IACD,KAAK,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,IAAI,MAAM,EAAE,CAAC;QACrC,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,MAAM,CAAuD,CAAA;QACzF,MAAM,QAAQ,GAAG,oBAAoB,CAAC,KAA+C,EAAE,IAAI,CAAC,CAAA;QAC5F,IAAI,QAAQ,EAAE,CAAC;YACb,MAAM,MAAM,GAAG,IAAI,GAAG,EAAoB,CAAA;YAC1C,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,QAAQ;gBAAE,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,CAAA;YAC5D,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,QAAQ,EAAE,CAAC;gBAClC,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;gBAC7B,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAA;YACnE,CAAC;YACD,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;QAC5B,CAAC;aAAM,CAAC;YACN,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAA;QAC9B,CAAC;IACH,CAAC;IACD,kFAAkF;IAClF,4FAA4F;IAC5F,6EAA6E;IAC7E,OAAO,MAAM,CAAA;AACf,CAAC;AAED,6DAA6D;AAC7D,SAAS,oBAAoB,CAC3B,KAA6C,EAC7C,SAAwB;IAExB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAoB,CAAA;IAC3C,KAAK,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACnC,MAAM,UAAU,GAAa,EAAE,CAAA;QAC/B,KAAK,MAAM,IAAI,IAAI,MAAM,EAAE,CAAC;YAC1B,IAAI,SAAS,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC;gBAAE,SAAQ;YACzC,MAAM,QAAQ,GAAG,SAAS,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;YAC7C,MAAM,OAAO,GAAG,QAAQ,KAAK,SAAS,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;YACjF,KAAK,MAAM,CAAC,IAAI,OAAO;gBAAE,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC;oBAAE,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QAC1E,CAAC;QACD,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC;YAAE,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,UAAU,CAAC,CAAA;IAC1D,CAAC;IACD,OAAO,OAAO,CAAA;AAChB,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,aAAa,CAC3B,MAAqB,EACrB,GAAsB,EACtB,UAAsB;IAEtB,MAAM,WAAW,GAAG,aAAa,CAAC,MAAM,EAAE,UAAU,CAAC,CAAA;IACrD,MAAM,kBAAkB,GAAG,IAAI,GAAG,EAAkB,CAAA;IACpD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5C,kBAAkB,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;IAC3C,CAAC;IAED,MAAM,eAAe,GAAa,EAAE,CAAA;IACpC,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,OAAO,EAAE,CAAC;QAC/B,MAAM,OAAO,GAAG,kBAAkB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;QAC5C,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;YAC1B,eAAe,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;QAC/B,CAAC;IACH,CAAC;IACD,OAAO,eAAe,CAAA;AACxB,CAAC;AAED,2BAA2B;AAE3B;;;;;;;GAOG;AACH,MAAM,UAAU,kBAAkB,CAChC,MAAqB,EACrB,CAAa,EACb,CAAa;IAEb,MAAM,WAAW,GAAG,kBAAkB,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;IACpD,MAAM,GAAG,GAAG,MAAM,CAAC,cAAc,CAAC,CAAC,EAAE,CAAC,EAAE,WAAW,EAAE,gBAAgB,CAAC,CAAA;IACtE,MAAM,aAAa,GAAG,eAAe,CAAC,MAAM,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,CAAA;IACjE,OAAO,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,aAAa,EAAE,CAAA;AAC9C,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,mBAAmB,CACjC,MAAqB,EACrB,CAAa,EACb,CAAa;IAEb,MAAM,WAAW,GAAG,kBAAkB,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;IACpD,MAAM,GAAG,GAAG,MAAM,CAAC,eAAe,CAAC,CAAC,EAAE,CAAC,EAAE,WAAW,EAAE,gBAAgB,CAAC,CAAA;IACvE,MAAM,aAAa,GAAG,eAAe,CAAC,MAAM,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,CAAA;IACjE,OAAO,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,aAAa,EAAE,CAAA;AAC9C,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,wBAAwB,CACtC,MAAqB,EACrB,CAAa,EACb,CAAa;IAEb,MAAM,WAAW,GAAG,kBAAkB,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;IACpD,MAAM,GAAG,GAAG,MAAM,CAAC,oBAAoB,CAAC,CAAC,EAAE,CAAC,EAAE,WAAW,EAAE,gBAAgB,CAAC,CAAA;IAC5E,MAAM,aAAa,GAAG,eAAe,CAAC,MAAM,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,CAAA;IACjE,OAAO,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,aAAa,EAAE,CAAA;AAC9C,CAAC;AAED,kBAAkB;AAElB;;;;;;;;;GASG;AACH,MAAM,UAAU,iBAAiB,CAC/B,MAAqB,EACrB,KAAiB;IAEjB,MAAM,SAAS,GAAG,aAAa,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,MAAM,CAAA;IACrD,MAAM,SAAS,GAAkB,IAAI,GAAG,EAAE,CAAA;IAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,SAAS,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAA;IACvB,CAAC;IACD,OAAO,SAAS,CAAA;AAClB,CAAC;AAED,0DAA0D;AAE1D;;;;;;;;;;;;;;;;;GAiBG;AACH,MAAM,UAAU,uBAAuB,CACrC,MAAqB,EACrB,EAAwB,EACxB,KAAiB,EACjB,WAAyB,EACzB,MAAc,EACd,cAA6C,EAC7C,OAAe;IAEf,MAAM,WAAW,GAAG,aAAa,CAAC,MAAM,EAAE,KAAK,CAAC,CAAA;IAChD,IAAI,GAAsB,CAAA;IAC1B,IAAI,EAAE,KAAK,QAAQ,EAAE,CAAC;QACpB,GAAG,GAAG,MAAM,CAAC,iBAAiB,CAAC,KAAK,EAAE,WAAW,EAAE,MAAM,EAAE,WAAW,EAAE,gBAAgB,CAAC,CAAA;IAC3F,CAAC;SAAM,CAAC;QACN,+DAA+D;QAC/D,+DAA+D;QAC/D,YAAY;QACZ,GAAG,GAAG,aAAa,EAAE,CAAC,kBAAkB,CACtC,KAA+B,EAC/B,WAAuC,EACvC,MAAM,EACN,WAAW,EACX,gBAAgB,CACe,CAAA;IACnC,CAAC;IAED,MAAM,aAAa,GAAG,eAAe,CAAC,MAAM,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,CAAC,MAAM,CAAC,CAAA;IACrE,MAAM,OAAO,GAAG,mBAAmB,CAAC,GAAG,CAAC,CAAA;IACxC,MAAM,UAAU,GAAG,wBAAwB,CAAC,cAAc,EAAE,OAAO,CAAC,CAAA;IAEpE,4EAA4E;IAC5E,oDAAoD;IACpD,6EAA6E;IAC7E,+EAA+E;IAC/E,MAAM,YAAY,GAAG,aAAa,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAA;IACtD,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,WAAW,CAAC,CAAA;IACzC,MAAM,oBAAoB,GAAG,IAAI,GAAG,EAAU,CAAA;IAC9C,KAAK,MAAM,IAAI,IAAI,OAAO,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC;QAC7C,KAAK,MAAM,CAAC,IAAI,IAAI;YAAE,oBAAoB,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;IACnD,CAAC;IACD,MAAM,eAAe,GAAG,YAAY,CAAC,MAAM,CACzC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,oBAAoB,CAAC,GAAG,CAAC,CAAC,CAAC,CAC5D,CAAA;IAED,IAAI,eAAe,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC/B,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAoB,CAAA;QAC5C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAChD,QAAQ,CAAC,GAAG,CAAC,OAAO,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC,eAAe,CAAC,CAAC,CAAE,CAAC,CAAC,CAAA;QACvD,CAAC;QACD,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,CAAA;QACrC,SAAS,CAAC,GAAG,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAA;QAChC,OAAO,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,aAAa,EAAE,SAAS,EAAE,CAAA;IACzD,CAAC;IAED,OAAO,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,aAAa,EAAE,SAAS,EAAE,UAAU,EAAE,CAAA;AACrE,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,mBAAmB,CACjC,MAAqB,EACrB,KAAiB,EACjB,WAAyB,EACzB,MAAc,EACd,cAA6C,EAC7C,OAAe;IAEf,OAAO,uBAAuB,CAAC,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,WAAW,EAAE,MAAM,EAAE,cAAc,EAAE,OAAO,CAAC,CAAA;AACvG,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,oBAAoB,CAClC,MAAqB,EACrB,KAAiB,EACjB,WAAyB,EACzB,QAAgB,EAChB,cAA6C,EAC7C,OAAe;IAEf,OAAO,uBAAuB,CAAC,MAAM,EAAE,SAAS,EAAE,KAAK,EAAE,WAAW,EAAE,QAAQ,EAAE,cAAc,EAAE,OAAO,CAAC,CAAA;AAC1G,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,sBAAsB,CACpC,MAAqB,EACrB,KAAiB,EACjB,SAAqB,EACrB,cAA6C,EAC7C,OAAe;IAEf,MAAM,WAAW,GAAG,aAAa,CAAC,MAAM,EAAE,KAAK,CAAC,CAAA;IAChD,MAAM,GAAG,GAAG,MAAM,CAAC,cAAc,CAAC,KAAK,EAAE,SAAS,EAAE,WAAW,EAAE,gBAAgB,CAAC,CAAA;IAClF,MAAM,aAAa,GAAG,eAAe,CAAC,MAAM,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,CAAC,MAAM,CAAC,CAAA;IACrE,MAAM,OAAO,GAAG,mBAAmB,CAAC,GAAG,CAAC,CAAA;IACxC,MAAM,UAAU,GAAG,wBAAwB,CAAC,cAAc,EAAE,OAAO,CAAC,CAAA;IAEpE,qCAAqC;IACrC,MAAM,YAAY,GAAG,aAAa,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAA;IACtD,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,WAAW,CAAC,CAAA;IACzC,MAAM,oBAAoB,GAAG,IAAI,GAAG,EAAU,CAAA;IAC9C,KAAK,MAAM,IAAI,IAAI,OAAO,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC;QAC7C,KAAK,MAAM,CAAC,IAAI,IAAI;YAAE,oBAAoB,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;IACnD,CAAC;IACD,MAAM,eAAe,GAAG,YAAY,CAAC,MAAM,CACzC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,oBAAoB,CAAC,GAAG,CAAC,CAAC,CAAC,CAC5D,CAAA;IAED,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,CAAA;IACrC,IAAI,eAAe,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC/B,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAoB,CAAA;QAC5C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAChD,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,EAAE,CAAC,eAAe,CAAC,CAAC,CAAE,CAAC,CAAC,CAAA;QAClD,CAAC;QACD,SAAS,CAAC,GAAG,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAA;IAClC,CAAC;IACD,OAAO,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,aAAa,EAAE,SAAS,EAAE,CAAA;AACzD,CAAC;AAED,uEAAuE;AACvE,SAAS,wBAAwB,CAC/B,KAAoC,EACpC,SAAwB;IAExB,MAAM,MAAM,GAAG,IAAI,GAAG,EAAoB,CAAA;IAC1C,KAAK,MAAM,CAAC,MAAM,EAAE,WAAW,CAAC,IAAI,KAAK,EAAE,CAAC;QAC1C,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,oBAAoB,CAAC,WAAqD,EAAE,SAAS,CAAC,CAAC,CAAA;IAC5G,CAAC;IACD,OAAO,MAAM,CAAA;AACf,CAAC","sourcesContent":["/**\n * 面演化（face evolution）工具：hash 映射 ↔ ordinal 映射转换\n *\n * @platform occt — 本文件 import occt-kernel（translateWithHashEvolution /\n * scaleWithHashEvolution / directEditWithRoleTable(chamfer 分支) 走 occt-only\n * `*WithHistory` 原生面，D3）。文件级标注满足守卫①（平台 import 自证身份）；\n * 文件内的**中立函数**（getFaceHashes/decodeEvolution/booleanWithRoleTable/\n * identityHashEvolution 等只用 L1 BrepEngineApi）不因标注改变函数级中立性——\n * 调用它们的**中立 op**（rotate_euler/scale3d/fillet/boolean 等）不声明 engines，\n * 运行时不拦截（与 replicate.ts 同口径）。\n *\n * See docs/api-contract.md §11 (topology contract) for face evolution context.\n *\n * occt-wasm 的 *WithHistory API 返回 BrepEvolutionData，其中 modified/generated\n * 用面 hash（内存指针哈希）编码。本模块将其解码为 ordinal 映射（面枚举序号），\n * 可安全持久化进 faijs 文本。\n *\n * 核心原理（分析文档 §4.4）：\n * getSubShapes(shape,'face')[i] ↔ subShapeHashes(shape,'face',B)[i] 一一对应\n * 因此可以把 hash 映射无损转换为 ordinal 映射。\n */\n\nimport type { BrepHandle, BrepEvolutionData } from './engine/types'\nimport type { BrepEngineApi } from './engine/primitives'\nimport { getOcctKernel, type ShapeHandle } from '../occt-kernel/occtKernel'\n\n/** hash 上界（与 occt-wasm kernel.cpp 一致：`% 2147483647`） */\nexport const HASH_UPPER_BOUND = 2147483647\n\n/**\n * 面演化映射：输入面 ordinal → 输出面 ordinal 列表\n *\n * - 1→1：面被修改但未被切割（如面带孔仍是单面）\n * - 1→N：面被切割成多个面\n * - 不在 map 中：面未被修改或被删除\n */\nexport type FaceEvolution = Map<number, number[]>\n\n/**\n * Collect the hash list of all faces of a shape (via subShapeHashes; efficient, no handles allocated).\n * @param kernel - the OCCT kernel.\n * @param shape - the shape whose face hashes to collect.\n * @returns the array of face hashes.\n */\nexport function getFaceHashes(kernel: BrepEngineApi, shape: BrepHandle): number[] {\n  return Array.from(kernel.subShapeHashes(shape, 'face', HASH_UPPER_BOUND))\n}\n\n/**\n * Collect the union of face hashes of two shapes (for WithHistory calls of binary boolean operations).\n *\n * Analysis doc §4.2: fuse/cut/intersect must pass subShapeHashes(A) ∪ subShapeHashes(B)\n * to track both inputs' face evolution.\n * @param kernel - the OCCT kernel.\n * @param shapeA - the first input shape.\n * @param shapeB - the second input shape.\n * @returns the union of the two shapes' face hashes.\n */\nexport function getUnionFaceHashes(\n  kernel: BrepEngineApi,\n  shapeA: BrepHandle,\n  shapeB: BrepHandle,\n): number[] {\n  const hashesA = getFaceHashes(kernel, shapeA)\n  const hashesB = getFaceHashes(kernel, shapeB)\n  return [...new Set([...hashesA, ...hashesB])]\n}\n\n/**\n * 解码 BrepEvolutionData 的 modified 数组为 ordinal 映射。\n *\n * modified 分段编码格式：[inputHash, count, outHash1, outHash2, ...] × N\n *\n * @param kernel      the OCCT kernel.\n * @param evo         the BrepEvolutionData (from a *WithHistory API).\n * @param inputShape  the input shape (for the input face hash → ordinal mapping).\n * @param resultShape the result shape (for the output face hash → ordinal mapping).\n * @returns the FaceEvolution: inOrdinal → outOrdinal[].\n */\nexport function decodeEvolution(\n  kernel: BrepEngineApi,\n  evo: BrepEvolutionData,\n  inputShape: BrepHandle,\n  resultShape: BrepHandle,\n): FaceEvolution {\n  const inputHashes = getFaceHashes(kernel, inputShape)\n  const resultHashes = getFaceHashes(kernel, resultShape)\n\n  // 构建 hash → ordinal 查找表\n  const resultHashToOrdinal = new Map<number, number>()\n  for (let i = 0; i < resultHashes.length; i++) {\n    resultHashToOrdinal.set(resultHashes[i], i)\n  }\n  const inputHashToOrdinal = new Map<number, number>()\n  for (let i = 0; i < inputHashes.length; i++) {\n    inputHashToOrdinal.set(inputHashes[i], i)\n  }\n\n  // 解码 modified 数组\n  const evolution: FaceEvolution = new Map()\n  const modified = evo.modified\n  let idx = 0\n  while (idx < modified.length) {\n    const inHash = modified[idx]\n    const count = modified[idx + 1]\n    const outOrdinals: number[] = []\n    for (let j = 0; j < count; j++) {\n      const outHash = modified[idx + 2 + j]\n      const outOrdinal = resultHashToOrdinal.get(outHash)\n      if (outOrdinal !== undefined) {\n        outOrdinals.push(outOrdinal)\n      }\n    }\n    const inOrdinal = inputHashToOrdinal.get(inHash)\n    if (inOrdinal !== undefined) {\n      evolution.set(inOrdinal, outOrdinals)\n    }\n    idx += 2 + count\n  }\n\n  return evolution\n}\n\n\n/**\n * Hash 键面演化：输入面 hash → 输出面 hash 列表（1→多分裂时多个）。\n *\n * 与序号键 FaceEvolution 并列、同源（同一次 *WithHistory 打包结果解出），\n * 一个供 role 传播（hash 键）、一个供选择器/文本（序号键），零额外 wasm 调用。\n */\nexport interface HashEvolution {\n  /** 输入面 hash → 输出面 hash 列表（1→多分裂时多个）。 */\n  readonly modified: ReadonlyMap<number, readonly number[]>\n  /** 输入面中已不存在的面 hash。 */\n  readonly deleted: ReadonlySet<number>\n}\n\n/**\n * 把 BrepEvolutionData 解码为 hash 键演化（§2.4）。\n *\n * modified 分段编码格式：[inHash, count, outHash1, ...] × N —— 本身就是\n * hash→hash[] 的 1→多映射，直接按同一格式解出 hash 键版本，不需要\n * getSubShapes 逐句柄 hashCode，也不分配任何句柄。\n *\n * generated 刻意不进 role 传播。**实测依据（2026-09-22，`brep/engine/phase0-kernel-probes.test.ts`）**：\n * `generated` 与 `modified` **同构分段、键集相同**，其值是各输入面派生出的**中间形**——\n * `cut` 实测 12 个 hash、结果里 **0 个存活**（`fillet`/`fuse` 里整个桶为空）。\n * ⇒ 新造面**不能**由 `generated` 定位，只能由\"三类命运\"的补集判定\n * （既不在输入 hash 集合、也不在任何 `modified` 输出里），再交 `construct`/派生词汇命名。\n *\n * @param evo - the BrepEvolutionData (from a *WithHistory API).\n * @returns the hash-keyed evolution.\n */\nexport function decodeHashEvolution(evo: BrepEvolutionData): HashEvolution {\n  const modified = new Map<number, number[]>()\n  const m = evo.modified\n  let idx = 0\n  while (idx < m.length) {\n    const inHash = m[idx]\n    const count = m[idx + 1]\n    const outHashes: number[] = []\n    for (let j = 0; j < count; j++) {\n      outHashes.push(m[idx + 2 + j])\n    }\n    modified.set(inHash, outHashes)\n    idx += 2 + count\n  }\n  return { modified, deleted: new Set(evo.deleted) }\n}\n\n/**\n * 把一次双输入布尔（cut/fuse/intersect）的打包演化按「inHash 属于 A 还是 B」\n * 拆成 A、B 两张 hash 演化（§3.4 布尔合流，faijs 对 brepjs 的必要扩展）。\n *\n * 现有 *WithHistoryBrep 包装只用 getUnionFaceHashes 传入 A∪B 两边 hash、且只对\n * 基体 a 解码序号演化。本函数对同一份 evo 零额外内核调用：用 subShapeHashes(a)\n * / subShapeHashes(b) 两个集合判定每个 inHash 的归属，各自传播各自的 role 表。\n *\n * @param evo     - the BrepEvolutionData (from a binary boolean *WithHistory API).\n * @param hashesA - the face hashes of input A (target), via subShapeHashes.\n * @param hashesB - the face hashes of input B (tool), via subShapeHashes.\n * @returns the A/B split hash evolutions (faces from neither input are dropped).\n */\nexport function splitHashEvolutionByOrigin(\n  evo: BrepEvolutionData,\n  hashesA: readonly number[],\n  hashesB: readonly number[],\n): { a: HashEvolution; b: HashEvolution } {\n  const raw = decodeHashEvolution(evo)\n  const setA = new Set(hashesA)\n  const setB = new Set(hashesB)\n\n  const aModified = new Map<number, number[]>()\n  const bModified = new Map<number, number[]>()\n  for (const [inHash, outs] of raw.modified) {\n    if (setA.has(inHash)) aModified.set(inHash, [...outs])\n    else if (setB.has(inHash)) bModified.set(inHash, [...outs])\n  }\n\n  const aDeleted = new Set<number>()\n  const bDeleted = new Set<number>()\n  for (const h of raw.deleted) {\n    if (setA.has(h)) aDeleted.add(h)\n    else if (setB.has(h)) bDeleted.add(h)\n  }\n\n  return { a: { modified: aModified, deleted: aDeleted }, b: { modified: bModified, deleted: bDeleted } }\n}\n\n/**\n * 构造 hash 键恒等演化：输入第 i 面 hash → 输出第 i 面 hash（按枚举序号对齐）。\n *\n * ⚠️ **Phase 0.3 后本函数只用于「内核无 `*WithHistory` 可表达」的 4 个 op**：\n *\n * | op | 为什么不能走权威映射 |\n * |---|---|\n * | `rotate_euler` | 任意欧拉角 + pivot；内核只有**单轴** `rotateWithHistory` |\n * | `scale3d` | 非等比；`generalTransform` 无历史（`scaleWithHistory` 只收均匀 factor） |\n * | `copy` | 深拷贝；内核无 `copyWithHistory` |\n * | `place` | 任意矩阵 `located`；内核无对应历史 API |\n *\n * `translate` / `scale`（均匀）已改走权威映射（`translateWithHashEvolution` /\n * `scaleWithHashEvolution`），不再经过本函数。\n *\n * ⚠️ **本函数的正确性依赖一个曾经未被验证的假设**：刚体变换/深拷贝保持 OCCT 的\n * 面枚举序号。该假设现由 `brep/face-evolution.ordering.test.ts` 实测钉住。\n * 若该测试变红 ⇒ 本函数在这 4 个 op 上会产出**错误的身份映射**，\n * 必须为它们找别的权威来源，**不是**调松测试。\n *\n * @param kernel       - the OCCT kernel.\n * @param inputShape   - the input shape.\n * @param resultShape  - the transformed/copied output shape.\n * @returns the hash identity evolution (modified: in[i] → [out[i]]).\n */\nexport function identityHashEvolution(\n  kernel: BrepEngineApi,\n  inputShape: BrepHandle,\n  resultShape: BrepHandle,\n): HashEvolution {\n  const inputHashes = getFaceHashes(kernel, inputShape)\n  const resultHashes = getFaceHashes(kernel, resultShape)\n  const count = Math.min(inputHashes.length, resultHashes.length)\n  const modified = new Map<number, number[]>()\n  for (let i = 0; i < count; i++) {\n    modified.set(inputHashes[i], [resultHashes[i]])\n  }\n  return { modified, deleted: new Set() }\n}\n\n/**\n * 平移 + **权威**面演化（Phase 0.3）：走内核 `translateWithHistory`。\n *\n * 与 `identityHashEvolution` 的区别：这里的 `inHash → outHash[]` 是 OCCT 自己给的，\n * **不依赖**\"枚举序号在变换后保持\"这个此前从未验证的假设（分析文档 §7 第 6 项）。\n * 实测（`brep/engine/evolution-bindings.test.ts`）：刚体变换的权威映射为\n * 1:1 全覆盖（`coveredInputs === 面数`、`deleted` 空、`generated` 空）。\n *\n * @param kernel - the OCCT kernel.\n * @param shape  - the input shape.\n * @param d      - the translation vector as [dx, dy, dz].\n * @returns the translated handle plus the authority hash evolution.\n */\nexport function translateWithHashEvolution(\n  kernel: BrepEngineApi,\n  shape: BrepHandle,\n  d: readonly [number, number, number],\n): { result: BrepHandle; evolution: HashEvolution } {\n  const inputHashes = getFaceHashes(kernel, shape)\n  const evo = getOcctKernel().translateWithHistory(shape as unknown as ShapeHandle, d[0], d[1], d[2], inputHashes, HASH_UPPER_BOUND) as unknown as BrepEvolutionData\n  return { result: evo.result, evolution: decodeHashEvolution(evo) }\n}\n\n/**\n * 均匀缩放 + **权威**面演化（Phase 0.3）：走内核 `scaleWithHistory`。\n *\n * ⚠️ **仅均匀缩放**。非均匀缩放内核无 `*WithHistory`（`generalTransform` 无历史），\n * 故 `scale3d` 无法走本函数——它退回 `identityHashEvolution`，其\"面序保持\"假设\n * 由 `brep/face-evolution.ordering.test.ts` 钉住。\n *\n * @param kernel - the OCCT kernel.\n * @param shape  - the input shape.\n * @param center - the fixed point of the scaling (not scaled).\n * @param factor - the uniform scale factor.\n * @returns the scaled handle plus the authority hash evolution.\n */\nexport function scaleWithHashEvolution(\n  kernel: BrepEngineApi,\n  shape: BrepHandle,\n  center: readonly [number, number, number],\n  factor: number,\n): { result: BrepHandle; evolution: HashEvolution } {\n  const inputHashes = getFaceHashes(kernel, shape)\n  const evo = getOcctKernel().scaleWithHistory(\n    shape as unknown as ShapeHandle,\n    { x: center[0], y: center[1], z: center[2] },\n    factor,\n    inputHashes,\n    HASH_UPPER_BOUND,\n  ) as unknown as BrepEvolutionData\n  return { result: evo.result, evolution: decodeHashEvolution(evo) }\n}\n\n/**\n * 单轴旋转 + **权威**面演化：走内核 `rotateWithHistory`。\n *\n * 仅当旋转可由**单轴**表达时可用（内核只提供单轴 API）。多轴欧拉角\n * `rotate_euler` 仍退回 `identityHashEvolution`（`face-evolution.ordering.test.ts` 钉住）。\n *\n * @param kernel    - the OCCT kernel.\n * @param shape     - the input shape.\n * @param axisPoint - a point on the rotation axis (the pivot).\n * @param axisDir   - the unit rotation-axis direction.\n * @param angleRad  - the rotation angle in radians.\n * @returns the rotated handle plus the hash-keyed and ordinal-keyed evolutions.\n */\nexport function rotateWithHashEvolution(\n  kernel: BrepEngineApi,\n  shape: BrepHandle,\n  axisPoint: readonly [number, number, number],\n  axisDir: readonly [number, number, number],\n  angleRad: number,\n): { result: BrepHandle; evolution: HashEvolution; faceEvolution: FaceEvolution } {\n  const inputHashes = getFaceHashes(kernel, shape)\n  const evo = getOcctKernel().rotateWithHistory(\n    shape as unknown as ShapeHandle,\n    { point: { x: axisPoint[0], y: axisPoint[1], z: axisPoint[2] }, direction: { x: axisDir[0], y: axisDir[1], z: axisDir[2] } },\n    angleRad,\n    inputHashes,\n    HASH_UPPER_BOUND,\n  ) as unknown as BrepEvolutionData\n  return {\n    result: evo.result,\n    evolution: decodeHashEvolution(evo),\n    faceEvolution: decodeEvolution(kernel, evo, shape, evo.result),\n  }\n}\n\n/**\n * 镜像 + **权威**面演化：走内核 `mirrorWithHistory`。\n *\n * 镜像不改变面数/顺序（刚体反射），内核给 1:1 映射；brepkit 侧无此能力时\n * 由调用方显式回退 `identityHashEvolution`（**不报错**）。\n *\n * @param kernel - the OCCT kernel.\n * @param shape  - the input shape.\n * @param point  - a point on the mirror plane.\n * @param normal - the mirror-plane normal.\n * @returns the mirrored handle plus the hash-keyed and ordinal-keyed evolutions.\n */\nexport function mirrorWithHashEvolution(\n  kernel: BrepEngineApi,\n  shape: BrepHandle,\n  point: readonly [number, number, number],\n  normal: readonly [number, number, number],\n): { result: BrepHandle; evolution: HashEvolution; faceEvolution: FaceEvolution } {\n  const inputHashes = getFaceHashes(kernel, shape)\n  const evo = getOcctKernel().mirrorWithHistory(\n    shape as unknown as ShapeHandle,\n    { x: point[0], y: point[1], z: point[2] },\n    { x: normal[0], y: normal[1], z: normal[2] },\n    inputHashes,\n    HASH_UPPER_BOUND,\n  ) as unknown as BrepEvolutionData\n  return {\n    result: evo.result,\n    evolution: decodeHashEvolution(evo),\n    faceEvolution: decodeEvolution(kernel, evo, shape, evo.result),\n  }\n}\n\n/**\n * 抽壳 + **权威**面演化：走内核 `shellWithHistory`。\n *\n * `shell` 是中立 op（L1 两引擎均有裸实现）——occt 走本函数的权威映射，\n * brepkit 无 `shellWithHistory` 时由调用方显式回退裸 `shell`（**不报错**）。\n *\n * @param kernel    - the OCCT kernel.\n * @param solid     - the input solid.\n * @param faces     - the faces to remove (open faces).\n * @param thickness - the wall thickness.\n * @param tolerance - the tolerance.\n * @returns the shelled handle plus both the hash-keyed and ordinal-keyed evolutions.\n */\nexport function shellWithHashEvolution(\n  kernel: BrepEngineApi,\n  solid: BrepHandle,\n  faces: BrepHandle[],\n  thickness: number,\n  tolerance: number,\n): { result: BrepHandle; evolution: HashEvolution; faceEvolution: FaceEvolution } {\n  const inputHashes = getFaceHashes(kernel, solid)\n  const evo = getOcctKernel().shellWithHistory(\n    solid as unknown as ShapeHandle,\n    faces as unknown as ShapeHandle[],\n    thickness,\n    tolerance,\n    inputHashes,\n    HASH_UPPER_BOUND,\n  ) as unknown as BrepEvolutionData\n  return {\n    result: evo.result,\n    evolution: decodeHashEvolution(evo),\n    faceEvolution: decodeEvolution(kernel, evo, solid, evo.result),\n  }\n}\n\n/**\n * 双输入布尔 + roleTable 合流组合封装（§3.4，api boolean 链式调用用）。\n *\n * 一次 *WithHistory 内核调用同时产出：\n * - result：结果实体\n * - faceEvolution：序号键演化（进 faceEvolutionCache，服务选择器/可视化）\n * - roleTable：A/B 两侧 role 表各自传播后合并（进 roleTableCache，服务命名）\n *\n * 缝面（generated）刻意不进 role 传播（§1.3/R2：generated hash 指向中间形、\n * 实测 0 存活）。新 origin 一律是**本次语句的 StmtId**（Phase 1.6：不再用 LHS\n * 变量名——PartName 会被改名/复用，StmtId 全局唯一）。\n *\n * @param kernel  - the OCCT kernel.\n * @param op      - the boolean operation ('fuse' | 'cut' | 'intersect').\n * @param a       - the target shape.\n * @param b       - the tool shape.\n * @param tableA  - the target's role table.\n * @param tableB  - the tool's role table.\n * @param outStmt - the boolean statement's StmtId (串形；新 origin for seam faces).\n * @returns the result handle, ordinal evolution and merged role table.\n */\nexport function booleanWithRoleTable(\n  kernel: BrepEngineApi,\n  op: 'fuse' | 'cut' | 'intersect',\n  a: BrepHandle,\n  b: BrepHandle,\n  tableA: ReadonlyMap<unknown, unknown>,\n  tableB: ReadonlyMap<unknown, unknown>,\n  outStmt: string,\n): { result: BrepHandle; faceEvolution: FaceEvolution; roleTable: ReadonlyMap<unknown, unknown> } {\n  const inputHashes = getUnionFaceHashes(kernel, a, b)\n  let evo: BrepEvolutionData\n  if (op === 'fuse') evo = kernel.fuseWithHistory(a, b, inputHashes, HASH_UPPER_BOUND)\n  else if (op === 'cut') evo = kernel.cutWithHistory(a, b, inputHashes, HASH_UPPER_BOUND)\n  else evo = kernel.intersectWithHistory(a, b, inputHashes, HASH_UPPER_BOUND)\n\n  const faceEvolution = decodeEvolution(kernel, evo, a, evo.result)\n\n  // A/B 拆流 → 各自传播 → 合表（§3.4）\n  const hashesA = getFaceHashes(kernel, a)\n  const hashesB = getFaceHashes(kernel, b)\n  const { a: evoA, b: evoB } = splitHashEvolutionByOrigin(evo, hashesA, hashesB)\n  const merged = mergeRoleTablesLocal(tableA, evoA, tableB, evoB, outStmt)\n\n  // G 组（2026-10-03，Flapper LHS 语料）：fuse 的接缝面（两半挤出 union 时\n  // 共享平面被 BOP 重建的面）既不属于 A 也不属于 B 的血缘，merge 后无 role —\n  // 下游 edgeRef/fillet 查邻面时报 \"no role lineage\"（face-evolution 注释里\n  // 一直挂着的 \"seam faces are a Phase 4+ concern\" 正是本盲区）。把不属于任何\n  // 已知血缘的结果面登记为新 origin（本次语句）的 `seam` 角色——血缘真实\n  // （该面确实诞生于本次布尔），不是伪造映射。\n  if (op === 'fuse') {\n    const covered = new Set<unknown>()\n    for (const roles of merged.values()) {\n      for (const hs of (roles as ReadonlyMap<string, readonly number[]>).values()) {\n        for (const h of hs) covered.add(h)\n      }\n    }\n    const seamHashes = getFaceHashes(kernel, evo.result).filter((h) => !covered.has(h))\n    if (seamHashes.length > 0) {\n      (merged as Map<unknown, unknown>).set(outStmt, new Map([['seam', seamHashes]]))\n    }\n  }\n\n  return { result: evo.result, faceEvolution, roleTable: merged }\n}\n\n/** 合表（避免 naming/roles 循环依赖：本文件不 import naming，用结构等价实现）。 */\nfunction mergeRoleTablesLocal(\n  tableA: ReadonlyMap<unknown, unknown>,\n  evoA: HashEvolution,\n  tableB: ReadonlyMap<unknown, unknown>,\n  evoB: HashEvolution,\n  // eslint-disable-next-line @typescript-eslint/no-unused-vars -- retained for future boolean generated-face naming\n  outPart: string,\n): ReadonlyMap<unknown, unknown> {\n  const result = new Map<unknown, unknown>()\n  for (const [origin, roles] of tableA) {\n    result.set(origin, propagateOriginRoles(roles as ReadonlyMap<string, readonly number[]>, evoA))\n  }\n  for (const [origin, roles] of tableB) {\n    const existing = result.get(origin) as ReadonlyMap<string, readonly number[]> | undefined\n    const advanced = propagateOriginRoles(roles as ReadonlyMap<string, readonly number[]>, evoB)\n    if (existing) {\n      const merged = new Map<string, number[]>()\n      for (const [role, hs] of existing) merged.set(role, [...hs])\n      for (const [role, hs] of advanced) {\n        const prev = merged.get(role)\n        merged.set(role, prev ? [...new Set([...prev, ...hs])] : [...hs])\n      }\n      result.set(origin, merged)\n    } else {\n      result.set(origin, advanced)\n    }\n  }\n  // 3.6: void outPart removed — boolean seam faces are handled by the \"three fates\"\n  // analysis (§4.4): cut has 0 new faces (§7 item 7), fuse seam faces are a Phase 4+ concern.\n  // outPart retained for future kernel/byAdjacency on boolean generated faces.\n  return result\n}\n\n/** 单 origin 传播（结构等价于 naming/roles.propagateRoles，避免循环依赖）。 */\nfunction propagateOriginRoles(\n  roles: ReadonlyMap<string, readonly number[]>,\n  evolution: HashEvolution,\n): ReadonlyMap<string, readonly number[]> {\n  const updated = new Map<string, number[]>()\n  for (const [role, hashes] of roles) {\n    const successors: number[] = []\n    for (const hash of hashes) {\n      if (evolution.deleted.has(hash)) continue\n      const modified = evolution.modified.get(hash)\n      const targets = modified !== undefined && modified.length > 0 ? modified : [hash]\n      for (const h of targets) if (!successors.includes(h)) successors.push(h)\n    }\n    if (successors.length > 0) updated.set(role, successors)\n  }\n  return updated\n}\n\n/**\n * Decode a BrepEvolutionData deleted array into the ordinal list of deleted faces.\n * @param kernel     - the OCCT kernel.\n * @param evo        - the BrepEvolutionData (from a *WithHistory API).\n * @param inputShape - the input shape (for the hash → ordinal mapping).\n * @returns the array of deleted face ordinals.\n */\nexport function decodeDeleted(\n  kernel: BrepEngineApi,\n  evo: BrepEvolutionData,\n  inputShape: BrepHandle,\n): number[] {\n  const inputHashes = getFaceHashes(kernel, inputShape)\n  const inputHashToOrdinal = new Map<number, number>()\n  for (let i = 0; i < inputHashes.length; i++) {\n    inputHashToOrdinal.set(inputHashes[i], i)\n  }\n\n  const deletedOrdinals: number[] = []\n  for (const hash of evo.deleted) {\n    const ordinal = inputHashToOrdinal.get(hash)\n    if (ordinal !== undefined) {\n      deletedOrdinals.push(ordinal)\n    }\n  }\n  return deletedOrdinals\n}\n\n// ─── WithHistory 封装函数 ───\n\n/**\n * cutWithHistory 封装：执行切割并返回结果 + 面演化映射。\n *\n * @param kernel OCCT 内核\n * @param a 基体\n * @param b 工具（从基体中减去）\n * @returns { result: 结果 BrepHandle, faceEvolution: 面演化映射 }\n */\nexport function cutWithHistoryBrep(\n  kernel: BrepEngineApi,\n  a: BrepHandle,\n  b: BrepHandle,\n): { result: BrepHandle; faceEvolution: FaceEvolution } {\n  const inputHashes = getUnionFaceHashes(kernel, a, b)\n  const evo = kernel.cutWithHistory(a, b, inputHashes, HASH_UPPER_BOUND)\n  const faceEvolution = decodeEvolution(kernel, evo, a, evo.result)\n  return { result: evo.result, faceEvolution }\n}\n\n/**\n * fuseWithHistory wrapper: performs the fuse and returns the result plus the face evolution mapping.\n * @param kernel - the OCCT kernel.\n * @param a - the base shape.\n * @param b - the tool shape to fuse into the base.\n * @returns the result BrepHandle plus the face evolution mapping.\n */\nexport function fuseWithHistoryBrep(\n  kernel: BrepEngineApi,\n  a: BrepHandle,\n  b: BrepHandle,\n): { result: BrepHandle; faceEvolution: FaceEvolution } {\n  const inputHashes = getUnionFaceHashes(kernel, a, b)\n  const evo = kernel.fuseWithHistory(a, b, inputHashes, HASH_UPPER_BOUND)\n  const faceEvolution = decodeEvolution(kernel, evo, a, evo.result)\n  return { result: evo.result, faceEvolution }\n}\n\n/**\n * intersectWithHistory wrapper: performs the intersection and returns the result plus the face evolution mapping.\n * @param kernel - the OCCT kernel.\n * @param a - the first input shape.\n * @param b - the second input shape.\n * @returns the result BrepHandle plus the face evolution mapping.\n */\nexport function intersectWithHistoryBrep(\n  kernel: BrepEngineApi,\n  a: BrepHandle,\n  b: BrepHandle,\n): { result: BrepHandle; faceEvolution: FaceEvolution } {\n  const inputHashes = getUnionFaceHashes(kernel, a, b)\n  const evo = kernel.intersectWithHistory(a, b, inputHashes, HASH_UPPER_BOUND)\n  const faceEvolution = decodeEvolution(kernel, evo, a, evo.result)\n  return { result: evo.result, faceEvolution }\n}\n\n// ─── 变换操作面演化 ───\n\n/**\n * 构造恒等面演化映射（用于 translate/rotate/scale 等不改变拓扑的操作）。\n *\n * 变换操作不改变面的数量和顺序，每个面 ordinal i → [i]。\n * 避免调用 *WithHistory API（rotate/scale 的 WithHistory 签名与现有 Euler/Vec3 参数不兼容）。\n *\n * @param kernel OCCT 内核\n * @param shape 输入形状（用于获取面数量）\n * @returns 恒等 FaceEvolution\n */\nexport function identityEvolution(\n  kernel: BrepEngineApi,\n  shape: BrepHandle,\n): FaceEvolution {\n  const faceCount = getFaceHashes(kernel, shape).length\n  const evolution: FaceEvolution = new Map()\n  for (let i = 0; i < faceCount; i++) {\n    evolution.set(i, [i])\n  }\n  return evolution\n}\n\n// ─── directEdit WithHistory 封装（fillet / chamfer：单输入） ───\n\n/**\n * 单输入 directEdit（fillet/chamfer）+ roleTable 传播封装。\n *\n * 与 `booleanWithRoleTable`（双输入）对应：单输入只有一张输入 role 表，\n * 一次 `*WithHistory` 内核调用产出结果 + 面演化，沿 hash 演化推进所有 origin。\n *\n * generated 刻意不进 role 传播（§1.3 事实：generated hash 指向中间形，\n * 实测 0 存活），过渡面的命名由 DerivedFaceTopoRef 在 M2 处理。\n *\n * @param kernel          - the OCCT kernel.\n * @param op              - the directEdit operation ('fillet' | 'chamfer').\n * @param solid          - the input solid (single input, unlike boolean's a/b).\n * @param edgeHandles     - the resolved Edge handles to fillet/chamfer.\n * @param radius          - the fillet radius or chamfer distance (uniform only).\n * @param inputRoleTable  - the input's role table.\n * @param outPart         - the statement's LHS variable name (for new origin allocation).\n * @returns the result handle, ordinal evolution and propagated role table.\n */\nexport function directEditWithRoleTable(\n  kernel: BrepEngineApi,\n  op: 'fillet' | 'chamfer',\n  solid: BrepHandle,\n  edgeHandles: BrepHandle[],\n  radius: number,\n  inputRoleTable: ReadonlyMap<unknown, unknown>,\n  outPart: string,\n): { result: BrepHandle; faceEvolution: FaceEvolution; roleTable: ReadonlyMap<unknown, unknown> } {\n  const inputHashes = getFaceHashes(kernel, solid)\n  let evo: BrepEvolutionData\n  if (op === 'fillet') {\n    evo = kernel.filletWithHistory(solid, edgeHandles, radius, inputHashes, HASH_UPPER_BOUND)\n  } else {\n    // chamferWithHistory 是 occt-only（L1 无）→ 平台面 getOcctKernel（D3）。\n    // BrepHandle（branded number）与 occt-wasm ShapeHandle 运行时同构，品牌转换\n    // 只发生在平台边界。\n    evo = getOcctKernel().chamferWithHistory(\n      solid as unknown as ShapeHandle,\n      edgeHandles as unknown as ShapeHandle[],\n      radius,\n      inputHashes,\n      HASH_UPPER_BOUND,\n    ) as unknown as BrepEvolutionData\n  }\n\n  const faceEvolution = decodeEvolution(kernel, evo, solid, evo.result)\n  const hashEvo = decodeHashEvolution(evo)\n  const propagated = propagateAllOriginsLocal(inputRoleTable, hashEvo)\n\n  // 3.4: generated face naming — transition faces are neither input faces nor\n  // modified outputs (§4.4 \"三类命运\": 原样幸存 / 改型幸存 / 新造).\n  // Role format: `gen:<op>:<i>` (i = enumeration order among generated faces).\n  // String formatted directly (no import of role-name.ts — avoids circular dep).\n  const resultHashes = getFaceHashes(kernel, evo.result)\n  const inputHashSet = new Set(inputHashes)\n  const modifiedOutputHashes = new Set<number>()\n  for (const outs of hashEvo.modified.values()) {\n    for (const h of outs) modifiedOutputHashes.add(h)\n  }\n  const generatedHashes = resultHashes.filter(\n    (h) => !inputHashSet.has(h) && !modifiedOutputHashes.has(h),\n  )\n\n  if (generatedHashes.length > 0) {\n    const genRoles = new Map<string, number[]>()\n    for (let i = 0; i < generatedHashes.length; i++) {\n      genRoles.set(`gen:${op}:${i}`, [generatedHashes[i]!])\n    }\n    const roleTable = new Map(propagated)\n    roleTable.set(outPart, genRoles)\n    return { result: evo.result, faceEvolution, roleTable }\n  }\n\n  return { result: evo.result, faceEvolution, roleTable: propagated }\n}\n\n/**\n * 单输入 directEdit 的便捷别名：fillet。\n *\n * @param kernel          - the OCCT kernel.\n * @param solid          - the input solid.\n * @param edgeHandles     - the resolved Edge handles.\n * @param radius          - the fillet radius (uniform).\n * @param inputRoleTable  - the input's role table.\n * @param outPart         - the statement's LHS variable name.\n * @returns the result handle, ordinal evolution and propagated role table.\n */\nexport function filletWithRoleTable(\n  kernel: BrepEngineApi,\n  solid: BrepHandle,\n  edgeHandles: BrepHandle[],\n  radius: number,\n  inputRoleTable: ReadonlyMap<unknown, unknown>,\n  outPart: string,\n): { result: BrepHandle; faceEvolution: FaceEvolution; roleTable: ReadonlyMap<unknown, unknown> } {\n  return directEditWithRoleTable(kernel, 'fillet', solid, edgeHandles, radius, inputRoleTable, outPart)\n}\n\n/**\n * 单输入 directEdit 的便捷别名：chamfer。\n *\n * @param kernel          - the OCCT kernel.\n * @param solid          - the input solid.\n * @param edgeHandles     - the resolved Edge handles.\n * @param distance        - the chamfer distance (uniform).\n * @param inputRoleTable  - the input's role table.\n * @param outPart         - the statement's LHS variable name.\n * @returns the result handle, ordinal evolution and propagated role table.\n */\nexport function chamferWithRoleTable(\n  kernel: BrepEngineApi,\n  solid: BrepHandle,\n  edgeHandles: BrepHandle[],\n  distance: number,\n  inputRoleTable: ReadonlyMap<unknown, unknown>,\n  outPart: string,\n): { result: BrepHandle; faceEvolution: FaceEvolution; roleTable: ReadonlyMap<unknown, unknown> } {\n  return directEditWithRoleTable(kernel, 'chamfer', solid, edgeHandles, distance, inputRoleTable, outPart)\n}\n\n/**\n * 钻孔 roleTable 传播：底孔（圆柱 cut）产生的新造面 = 孔壁，挂**消费它的那条语句**\n * 的 origin（§7.1：drill 的工具体是 op 内部临时件，无其他用户可见坐标可继承）。\n * 角色形态 `hole:<j>`（j = 新造面枚举序）。沿用 `directEditWithRoleTable` 的\n * 三类命运判定（原样幸存 / 改型幸存 / 新造），新造面才派生命名。\n *\n * @param kernel         - the OCCT kernel.\n * @param solid          - the input solid (the drilled part).\n * @param toolSolid      - the drill-bit tool solid (caller-built; released by caller).\n * @param inputRoleTable - the input's role table.\n * @param outStmt        - the drilling statement's StmtId (origin for new faces).\n * @returns the result handle, ordinal evolution and role table with `hole:<j>`.\n */\nexport function drillBrepWithRoleTable(\n  kernel: BrepEngineApi,\n  solid: BrepHandle,\n  toolSolid: BrepHandle,\n  inputRoleTable: ReadonlyMap<unknown, unknown>,\n  outStmt: string,\n): { result: BrepHandle; faceEvolution: FaceEvolution; roleTable: ReadonlyMap<unknown, unknown> } {\n  const inputHashes = getFaceHashes(kernel, solid)\n  const evo = kernel.cutWithHistory(solid, toolSolid, inputHashes, HASH_UPPER_BOUND)\n  const faceEvolution = decodeEvolution(kernel, evo, solid, evo.result)\n  const hashEvo = decodeHashEvolution(evo)\n  const propagated = propagateAllOriginsLocal(inputRoleTable, hashEvo)\n\n  // 三类命运判定：新造面 = 结果 − 输入 − 改型后继（§4.4）。\n  const resultHashes = getFaceHashes(kernel, evo.result)\n  const inputHashSet = new Set(inputHashes)\n  const modifiedOutputHashes = new Set<number>()\n  for (const outs of hashEvo.modified.values()) {\n    for (const h of outs) modifiedOutputHashes.add(h)\n  }\n  const generatedHashes = resultHashes.filter(\n    (h) => !inputHashSet.has(h) && !modifiedOutputHashes.has(h),\n  )\n\n  const roleTable = new Map(propagated)\n  if (generatedHashes.length > 0) {\n    const genRoles = new Map<string, number[]>()\n    for (let i = 0; i < generatedHashes.length; i++) {\n      genRoles.set(`hole:${i}`, [generatedHashes[i]!])\n    }\n    roleTable.set(outStmt, genRoles)\n  }\n  return { result: evo.result, faceEvolution, roleTable }\n}\n\n/** 单输入 roleTable 传播（结构等价于 naming/roles.propagateAllOrigins，避免循环依赖）。 */\nfunction propagateAllOriginsLocal(\n  roles: ReadonlyMap<unknown, unknown>,\n  evolution: HashEvolution,\n): ReadonlyMap<unknown, unknown> {\n  const result = new Map<unknown, unknown>()\n  for (const [origin, originRoles] of roles) {\n    result.set(origin, propagateOriginRoles(originRoles as ReadonlyMap<string, readonly number[]>, evolution))\n  }\n  return result\n}\n"]}

package/dist/brepkit-kernel/brepkitKernel.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"brepkitKernel.d.ts","sourceRoot":"","sources":["../../src/brepkit-kernel/brepkitKernel.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AAEH,OAAO,EAAqC,KAAK,aAAa,EAAE,MAAM,eAAe,CAAA;AAGrF,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,2BAA2B,CAAA;AAoO9D,6DAA6D;AAC7D,KAAK,mBAAmB,GAAG,aAAa,GAAG;IACzC,oBAAoB,IAAI,MAAM,CAAA;IAC9B;;;;;;;OAOG;IACH,SAAS,EAAE,OAAO,oBAAoB,EAAE,kBAAkB,CAAA;CAC3D,CAAA;AAkDD;;;;;GAKG;AACH,wBAAsB,uBAAuB,IAAI,OAAO,CAAC,mBAAmB,CAAC,CA6mC5E;AAwDD;;;;;;;;GAQG;AACH,wBAAgB,gBAAgB,IAAI,aAAa,CAKhD;AAED;;;;;;;GAOG;AACH,wBAAgB,cAAc,IAAI,IAAI,CAQrC;AAED,2EAA2E;AAC3E,MAAM,MAAM,iBAAiB,GAAG,OAAO,CAAC,UAAU,CAAC,OAAO,uBAAuB,CAAC,CAAC,CAAA"}
+{"version":3,"file":"brepkitKernel.d.ts","sourceRoot":"","sources":["../../src/brepkit-kernel/brepkitKernel.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AAEH,OAAO,EAAqC,KAAK,aAAa,EAAE,MAAM,eAAe,CAAA;AAGrF,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,2BAA2B,CAAA;AAoO9D,6DAA6D;AAC7D,KAAK,mBAAmB,GAAG,aAAa,GAAG;IACzC,oBAAoB,IAAI,MAAM,CAAA;IAC9B;;;;;;;OAOG;IACH,SAAS,EAAE,OAAO,oBAAoB,EAAE,kBAAkB,CAAA;CAC3D,CAAA;AAkDD;;;;;GAKG;AACH,wBAAsB,uBAAuB,IAAI,OAAO,CAAC,mBAAmB,CAAC,CAgwC5E;AAwDD;;;;;;;;GAQG;AACH,wBAAgB,gBAAgB,IAAI,aAAa,CAKhD;AAED;;;;;;;GAOG;AACH,wBAAgB,cAAc,IAAI,IAAI,CAQrC;AAED,2EAA2E;AAC3E,MAAM,MAAM,iBAAiB,GAAG,OAAO,CAAC,UAAU,CAAC,OAAO,uBAAuB,CAAC,CAAC,CAAA"}

package/dist/brepkit-kernel/brepkitKernel.js

@@ -447,6 +447,16 @@ export async function createBrepkitPrimitives() {
     /** solid → BrepMeshResult（tessellateSolidGrouped，原 meshShape 实体路径抽出）。 */
     const solidMesh = (solid, deflection, angular) => {
         const raw = kernel.tessellateSolidGrouped(solid, deflection, angular);
+        // GOTCHA (2026-10-10, real-device iOS): tessellateSolidGrouped once returned
+        // undefined on WeChat's JavaScriptCore worker; the unguarded JSON.parse(undefined)
+        // threw the engine-specific "JSON Parse error: Unexpected identifier \"undefined\"",
+        // which toOpFailure wrapped into an unlocatable E_OP_FAILED. Fail loudly with
+        // handle/param context instead — reporting beats masking, and this also surfaces
+        // null / object / other non-string shapes (JSON.parse's implicit ToString would
+        // otherwise mangle them into unrecognizable messages).
+        if (typeof raw !== 'string') {
+            fail(`tessellateSolidGrouped(${solid}, deflection=${deflection}, angular=${angular}) returned ${typeof raw} (${String(raw)}); expected a JSON string`);
+        }
         const m = JSON.parse(raw);
         // faceOffsets 形如 [start0, start1, ..., totalEnd]：以「索引数组单位」计的每面偏移
         // （2026-09-19 实测）。**L1 契约的 faceGroups 就是索引单位**（与 OCCT 一致，
@@ -556,6 +566,101 @@ export async function createBrepkitPrimitives() {
             kernel.transformSolid(c, m);
         return c;
     };
+    // ── 扫掠 / 放样共用助手（L1 中立名 sweep/loft 的 brepkit 方言消化）──
+    /** 截面句柄（面直用、wire 升面）→ brepkit face 句柄号（升面结果登记 knownFaces）。 */
+    const profileFaceOf = (section, what) => {
+        const n = asNum(section);
+        const kind = resolveKind(section, n);
+        if (kind === KIND_FACE)
+            return n;
+        if (kind === KIND_WIRE) {
+            // GOTCHA（与 makeFace 同因）：makeFaceFromWire 产出的是**新** face 句柄号，
+            // 不登记 knownFaces 的话，后续任何按类型分发的调用（meshShape / 再扫掠）
+            // 会把它当 solid 走 tessellateSolidGrouped 崩溃。
+            const f = kernel.makeFaceFromWire(n);
+            knownFaces.add(f);
+            return f;
+        }
+        return fail(`${what} requires a planar face or a closed wire; got a handle that is neither`);
+    };
+    /** edge 的参数域 `[first, last]`（brepkit `getEdgeCurveParameters` 返回 Float64Array）。 */
+    const curveParamsOf = (edge) => {
+        const d = toNumArray(kernel.getEdgeCurveParameters(edge));
+        return [d[0] ?? 0, d[d.length - 1] ?? 1];
+    };
+    /** 相邻重复点去重（折线链顶点与采样点列共用；容差 1e-9 mm）。 */
+    const pushUnique = (out, p) => {
+        const last = out[out.length - 1];
+        if (last !== undefined &&
+            Math.abs(last.x - p.x) < 1e-9 &&
+            Math.abs(last.y - p.y) < 1e-9 &&
+            Math.abs(last.z - p.z) < 1e-9)
+            return;
+        out.push(p);
+    };
+    /** 折线链顶点：各线的首点 + 末线终点（供 degree=1 插值，拐角不圆化）。 */
+    const lineChainVertices = (edges) => {
+        const out = [];
+        for (const e of edges) {
+            const [t0, t1] = curveParamsOf(e);
+            pushUnique(out, vec3Of(toNumArray(kernel.evaluateEdgeCurve(e, t0))));
+            pushUnique(out, vec3Of(toNumArray(kernel.evaluateEdgeCurve(e, t1))));
+        }
+        return out;
+    };
+    /** 曲线链按参数等分采样（每条边 perEdge 段），供 NURBS 拟合。 */
+    const sampleChainPoints = (edges, perEdge = 8) => {
+        const out = [];
+        for (const e of edges) {
+            const [t0, t1] = curveParamsOf(e);
+            for (let i = 0; i <= perEdge; i++) {
+                pushUnique(out, vec3Of(toNumArray(kernel.evaluateEdgeCurve(e, t0 + (t1 - t0) * (i / perEdge)))));
+            }
+        }
+        return out;
+    };
+    /**
+     * 路径 wire → 一条可作 brepkit 扫掠路径的 NURBS edge（方案 §4.1 三条路线）。
+     *
+     * - 路线 3：单条 NURBS/Bézier 边 → 原样返回，零损失；
+     * - 路线 1：折线 wire（`cad.wire` 默认产物，全 line 边）→ 顶点列 + **degree=1** 插值。
+     *   一次 NURBS 的基就是折线，这不是近似而是精确表示 —— 比一律 degree=3 拟合更忠实；
+     * - 路线 2：含圆弧等曲线边 → 按参数等分采样后 degree=3 拟合（近似，方案 §8 已声明代价）。
+     *
+     * GOTCHA-1：`getNurbsCurveData` 对解析边（line/circle）**抛错**而非返回 null，
+     * 「先拿它探路、失败再拟合」会踩坑 —— 必须**先**判 `getEdgeCurveType` 再选路线。
+     *
+     * GOTCHA-2（2026-10-10 实测）：**不要**走 `kernel.sweep(face, degree, knots, ctrl, weights)`
+     * —— 本仓 `getNurbsCurveData` 给出的 `knots`（去重值 + 平行 multiplicities）展开后
+     * 与 brepkit `sweep` 期望的节点向量长度不一致，实测报
+     * `invalid knot vector: expected 2 knots, got 6`。改用直吃 edge 句柄的
+     * `sweepWithOptions`（本 helper 因此返回 edge 而不是四数组），绕开该约定差异。
+     */
+    const wireToSpineEdge = (spine) => {
+        const w = asNum(spine);
+        if (resolveKind(spine, w) !== KIND_WIRE)
+            fail('sweep: spine must be a wire');
+        const edges = arr(kernel.getWireEdges(w));
+        if (edges.length === 0)
+            fail('sweep: spine wire has no edges');
+        const typeOf = (e) => String(kernel.getEdgeCurveType(e)).toUpperCase();
+        const ANALYTIC = new Set(['LINE', 'CIRCLE', 'ELLIPSE']);
+        // 路线 3：单条非解析边（NURBS/Bézier）原样用，零损失。
+        if (edges.length === 1 && !ANALYTIC.has(typeOf(edges[0])))
+            return edges[0];
+        // 路线 1 / 2：采样点列 → interpolatePoints 拟合成一条 NURBS 边。
+        const allLines = edges.every((e) => typeOf(e) === 'LINE');
+        const pts = allLines ? lineChainVertices(edges) : sampleChainPoints(edges);
+        if (pts.length < 2)
+            fail('sweep: spine wire degenerates to fewer than 2 distinct points');
+        const degree = allLines ? 1 : Math.min(3, pts.length - 1);
+        // GOTCHA：brepkit 内核是 **GC 型**，没有 `release` 方法（HAND_MAP 里 core:'release'
+        // 的 brepkit 侧为 null，适配器 no-op）——这里不能 `kernel.release(fit)`；
+        // 拟合边登记进 knownEdges 后由内核统一管理生命周期。
+        const fit = kernel.interpolatePoints(flattenPoints(pts), degree);
+        knownEdges.add(fit);
+        return fit;
+    };
     const api = {
         // ── 生命周期 ──
         release(_shape) { },
@@ -609,6 +714,39 @@ export async function createBrepkitPrimitives() {
             }
             return asHandle(markSolid(kernel.revolve(s, center.x, center.y, center.z, direction.x, direction.y, direction.z, angleDeg)));
         },
+        sweep(profile, spine) {
+            // L1 中立 sweep：occt 侧走 sweepPipeShell；brepkit 只吃 (face, 路径 edge)
+            // —— 两处方言都在这里消化，op 层只看到「截面 + 路径 → 体」。
+            // ① 截面 wire → face（开口 wire 建面由内核拒绝；不在适配器预判，内核报错更权威）。
+            const faceNum = profileFaceOf(profile, 'sweep');
+            // ② 路径 wire → 一条 NURBS edge（见 wireToSpineEdge 的 GOTCHA-2）。
+            const pathEdge = wireToSpineEdge(spine);
+            // ③ sweepWithOptions：contact_mode 'rmf'（内核默认）、无缩放律、默认分段、光滑转角。
+            return asHandle(markSolid(kernel.sweepWithOptions(faceNum, pathEdge, 'rmf', new Float64Array(0), 0, 'smooth')));
+        },
+        loft(sections, ruled, endPoint) {
+            if (!Array.isArray(sections) || sections.length < 2) {
+                fail('loft requires at least 2 sections');
+            }
+            // ① 各截面 → face。
+            const faces = sections.map((s) => profileFaceOf(s, 'loft'));
+            // ② brepkit loft 要求各截面**顶点数一致**。内核自己也会抛，但报错不含「哪几个
+            //    截面、差多少」——执行前静态判一次，给出可指路的错误；不静默降级、不换引擎
+            //    （方案 §5②，红线：静态可判的输入约束必须在执行前报错）。
+            const counts = faces.map((f) => arr(kernel.getFaceVertices(f)).length);
+            const ref = counts[0];
+            if (counts.some((c) => c !== ref)) {
+                fail('E_LOFT_SECTION_MISMATCH: brepkit loft requires every section to have the same ' +
+                    `vertex count, got [${counts.join(', ')}] — use cad.loftAdvanced (occt) for ` +
+                    'sections with different vertex counts');
+            }
+            const farr = Uint32Array.from(faces);
+            // ③ 选项映射：endPoint → loftWithOptions；ruled=false → loftSmooth。
+            if (endPoint !== undefined) {
+                return asHandle(markSolid(kernel.loftWithOptions(farr, JSON.stringify({ ruled, endPoint: [endPoint.x, endPoint.y, endPoint.z] }))));
+            }
+            return asHandle(markSolid(ruled ? kernel.loft(farr) : kernel.loftSmooth(farr)));
+        },
         sew(shapesList, tolerance) {
             return asHandle(markSolid(kernel.sewFaces(Uint32Array.from(shapesList.map(asNum)), tolerance ?? 1e-6)));
         },