@itwin/core-geometry 5.2.0 → 5.2.2

package/lib/esm/curve/Query/StrokeCountChain.js.map

@@ -1 +1 @@
-{"version":3,"file":"StrokeCountChain.js","sourceRoot":"","sources":["../../../../src/curve/Query/StrokeCountChain.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAC1C,OAAO,EAAE,OAAO,EAAE,MAAM,kCAAkC,CAAC;AAE3D,OAAO,EAAE,UAAU,EAAmB,MAAM,oBAAoB,CAAC;AAEjE,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAC/C,OAAO,EAAE,IAAI,EAAE,MAAM,SAAS,CAAC;AAC/B,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAE/C,OAAO,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC;AAC7C,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAElD,qBAAqB;AACrB;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AACH,MAAM,OAAgB,8BAA8B;IAClD;;;;;;OAMG;IACI,WAAW,CAAC,WAAmB,EAAE,eAAuB,EAAE,eAAwB,IAAa,OAAO,IAAI,CAAC,CAAC,CAAC;IAepH;;;OAGG;IACI,SAAS,CAAC,WAAmB,EAAE,eAAuB,EAAE,eAAwB,IAAa,OAAO,IAAI,CAAC,CAAC,CAAC;CAEnH;AACD;;;;GAIG;AACH,MAAM,OAAO,kCAAmC,SAAQ,8BAA8B;IAC7E,KAAK,CAAiB;IAC7B;QACE,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,KAAK,GAAG,cAAc,CAAC,wBAAwB,EAAE,CAAC;IACzD,CAAC;IACD,oDAAoD;IAC7C,SAAS,CAAC,IAAY;QAC3B,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;YACf,IAAI,CAAC,KAAK,CAAC,SAAS,GAAG,CAAC,CAAC;YACzB,OAAO,IAAI,CAAC;QACd,CAAC;aAAM,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;YACtB,oEAAoE;YACpE,OAAO,IAAI,CAAC;QACd,CAAC;QACD,0CAA0C;QAC1C,OAAO,KAAK,CAAC;IACf,CAAC;IACD,kDAAkD;IAC3C,KAAK,CAAC,IAAY,EAAE,GAAmB;QAC5C,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;YACf,IAAI,GAAG,CAAC,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS;gBACtC,IAAI,CAAC,KAAK,CAAC,SAAS,GAAG,GAAG,CAAC,SAAS,CAAC;YACvC,OAAO,IAAI,CAAC;QACd,CAAC;aAAM,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;YACtB,gCAAgC;YAChC,GAAG,CAAC,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC;YACrC,OAAO,IAAI,CAAC;QACd,CAAC;QACD,+DAA+D;QAC/D,OAAO,KAAK,CAAC;IACf,CAAC;IAEM,OAAO,CAAC,KAAa,IAAa,OAAO,IAAI,CAAC,CAAC,CAAC;CACxD;AACD;;;;GAIG;AACH,MAAM,OAAO,wCAAyC,SAAQ,8BAA8B;IACnF,cAAc,CAAS;IAC9B;QACE,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,cAAc,GAAG,GAAG,CAAC;IAC5B,CAAC;IACD,oDAAoD;IAC7C,SAAS,CAAC,IAAY;QAC3B,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;YACf,IAAI,CAAC,cAAc,GAAG,CAAC,CAAC;YACxB,OAAO,IAAI,CAAC;QACd,CAAC;aAAM,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;YACtB,oEAAoE;YACpE,OAAO,IAAI,CAAC;QACd,CAAC;QACD,0CAA0C;QAC1C,OAAO,KAAK,CAAC;IACf,CAAC;IACD,kDAAkD;IAC3C,KAAK,CAAC,IAAY,EAAE,GAAmB;QAC5C,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;YACf,IAAI,CAAC,cAAc,GAAG,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,WAAW,EAAE,IAAI,CAAC,cAAc,CAAC,CAAC;YAC3E,OAAO,IAAI,CAAC;QACd,CAAC;aAAM,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;YACtB,gCAAgC;YAChC,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC;YACb,GAAG,CAAC,EAAE,GAAG,IAAI,CAAC,cAAc,CAAC;YAC7B,OAAO,IAAI,CAAC;QACd,CAAC;QACD,+DAA+D;QAC/D,OAAO,KAAK,CAAC;IACf,CAAC;IAEM,OAAO,CAAC,KAAa,IAAa,OAAO,IAAI,CAAC,CAAC,CAAC;CACxD;AACD;;;;;;;GAOG;AACH,MAAM,OAAO,gBAAgB;IACpB,IAAI,CAAmB;IACvB,MAAM,CAAmB;IAChC;;;;OAIG;IACI,OAAO,CAAiB;IAE/B,YAAoB,MAAwB,EAAE,OAAuB;QACnE,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,IAAI,GAAG,EAAE,CAAC;QACf,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;IACzB,CAAC;IACM,MAAM,CAAC,MAAM,CAAC,KAAiB,EAAE,OAAuB;QAC7D,MAAM,MAAM,GAAG,IAAI,gBAAgB,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;QACpD,MAAM,CAAC,MAAM,GAAG,KAAK,CAAC;QACtB,2CAA2C;QAC3C,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;YAC/B,CAAC,CAAC,qCAAqC,CAAC,OAAO,CAAC,CAAC;YACjD,IAAI,CAAC,CAAC,UAAU;gBACd,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;QACnC,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACM,UAAU;QACf,MAAM,EAAE,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC;QACjC,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjB,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,IAAI,CAAC,OAAO,CAAC,UAAU,EAAE,CAAC;gBACxD,EAAE,CAAC,oBAAoB,EAAE,CAAC;gBAC1B,EAAE,CAAC,sBAAsB,EAAE,CAAC;gBAC5B,EAAE,CAAC,mBAAmB,EAAE,CAAC;YAC3B,CAAC;QACH,CAAC;QACD,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;YAC1B,IAAI,CAAC,CAAC,SAAS;gBACb,CAAC,CAAC,SAAS,CAAC,8BAA8B,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QACtD,CAAC;QACD,OAAO,EAAE,CAAC;IAEZ,CAAC;IACD,wBAAwB;IAChB,MAAM,CAAC,8BAA8B,CAAC,IAAsB,EAAE,WAAmB;QACvF,IAAI,SAAS,GAAG,WAAW,CAAC;QAC5B,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;YACrB,CAAC,CAAC,EAAE,IAAI,SAAS,CAAC;YAClB,IAAI,CAAC,CAAC,aAAa,EAAE,CAAC;gBACpB,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC,8BAA8B,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;YACpE,CAAC;iBAAM,CAAC;gBACN,CAAC,CAAC,EAAE,IAAI,SAAS,CAAC;YACpB,CAAC;YACD,SAAS,GAAG,CAAC,CAAC,EAAE,CAAC;QACnB,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;;;;;;OAWG;IACI,mBAAmB,CAAC,WAAmB;QAC5C,OAAO,gBAAgB,CAAC,8BAA8B,CAAC,IAAI,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC;IACjF,CAAC;CACF;AAED;;;;;GAKG;AACH,MAAM,OAAO,kBAAkB;IACtB,MAAM,CAAqB;IAC3B,MAAM,CAAmB;IAChC,YAAoB,MAAwB,IAAI,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC,CAAC,IAAI,CAAC,MAAM,GAAG,EAAE,CAAC,CAAC,CAAC;IACzF;;;OAGG;IACI,MAAM,CAAC,MAAM,CAAC,MAAuB,EAAE,OAAuB;QACnE,MAAM,MAAM,GAAG,IAAI,kBAAkB,CAAC,MAAM,CAAC,CAAC;QAC9C,MAAM,gBAAgB,GAAG,CAAC,KAAiB,EAAE,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC;QAC5G,MAAM,kBAAkB,GAAG,CAAC,MAAoB,EAAE,EAAE,GAAG,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,QAAQ;YAAE,gBAAgB,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAA;QACtH,IAAI,MAAM,YAAY,WAAW,EAAE,CAAC;YAClC,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC;gBACpC,IAAI,KAAK,YAAY,YAAY;oBAC/B,kBAAkB,CAAC,KAAK,CAAC,CAAC;;oBAE1B,gBAAgB,CAAC,KAAK,CAAC,CAAC;YAC5B,CAAC;QACH,CAAC;aAAM,IAAI,MAAM,YAAY,YAAY,EAAE,CAAC;YAC1C,kBAAkB,CAAC,MAAM,CAAC,CAAC;QAC7B,CAAC;aAAM,IAAI,MAAM,YAAY,UAAU,EAAE,CAAC;YACxC,gBAAgB,CAAC,MAAM,CAAC,CAAC;QAC3B,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,oDAAoD;IAC7C,MAAM,CAAC,qBAAqB,CAAC,QAA8B,EAAE,aAAsB;QACxF,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC;YACrB,OAAO,IAAI,CAAC,CAAE,gEAAgE;QAChF,MAAM,SAAS,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC;QAC5C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,mDAAmD;YACnD,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,KAAK,SAAS;gBACzC,OAAO,KAAK,CAAC;YACf,yEAAyE;YACzE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACnD,MAAM,YAAY,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;gBACvD,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,KAAK,YAAY;oBACpD,OAAO,KAAK,CAAC;gBACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,EAAE,CAAC,EAAE,EAAE,CAAC;oBACtC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,8BAA8B,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,aAAa,CAAC;wBAC7G,OAAO,KAAK,CAAC;gBACjB,CAAC;YACH,CAAC;QAEH,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACI,MAAM,CAAC,wBAAwB,CAAC,QAA8B;QACnE,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;YAC/B,KAAK,MAAM,KAAK,IAAI,OAAO,CAAC,MAAM,EAAE,CAAC;gBACnC,KAAK,CAAC,mBAAmB,CAAC,GAAG,CAAC,CAAC;YACjC,CAAC;QACH,CAAC;IACH,CAAC;IAEO,MAAM,CAAC,yCAAyC,CAAC,QAA8B,EAAE,UAAkB,EAAE,cAAsB,EACjI,cAAkC,EAAE,QAAwC;QAC5E,MAAM,UAAU,GAAG,QAAQ,CAAC,MAAM,CAAC;QACnC,IAAI,CAAC,QAAQ,CAAC,WAAW,CAAC,UAAU,EAAE,cAAc,EAAE,cAAc,CAAC;YAAE,OAAO,KAAK,CAAC;QACpF,IAAI,cAAc,KAAK,SAAS,EAAE,CAAC;YACjC,sFAAsF;YACtF,KAAK,IAAI,IAAI,GAAG,CAAC,GAAI,IAAI,EAAE,EAAE,CAAC;gBAC5B,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,IAAI,CAAC;oBAC3B,MAAM;gBACR,KAAK,IAAI,YAAY,GAAG,CAAC,EAAE,YAAY,GAAG,UAAU,EAAE,YAAY,EAAE;oBAClE,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,EAAE,QAAQ,CAAC,YAAY,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;wBACvF,OAAO,KAAK,CAAC;gBACjB,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC;oBACzB,OAAO,KAAK,CAAC;YACjB,CAAC;QACH,CAAC;aAAM,CAAC;YACN,qFAAqF;YACrF,sFAAsF;YACtF,KAAK,IAAI,IAAI,GAAG,CAAC,GAAI,IAAI,EAAE,EAAE,CAAC;gBAC5B,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,IAAI,CAAC;oBAC3B,MAAM;gBACR,KAAK,IAAI,YAAY,GAAG,CAAC,EAAE,YAAY,GAAG,UAAU,EAAE,YAAY,EAAE;oBAClE,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,EAAE,QAAQ,CAAC,YAAY,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,aAAc,CAAC,cAAc,CAAC,CAAC;wBACtH,OAAO,KAAK,CAAC;gBACjB,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC;oBACzB,OAAO,KAAK,CAAC;YACjB,CAAC;QAEH,CAAC;QACD,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,UAAU,EAAE,cAAc,EAAE,cAAc,CAAC;YAAE,OAAO,KAAK,CAAC;QAClF,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,4CAA4C,CAAC,QAA8B,EAAE,QAAwC;QACjI,MAAM,kBAAkB,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC;QACrD,KAAK,IAAI,UAAU,GAAG,CAAC,EAAE,UAAU,GAAG,kBAAkB,EAAE,UAAU,EAAE,EAAE,CAAC;YACvE,MAAM,YAAY,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;YAChE,KAAK,IAAI,cAAc,GAAG,CAAC,EAAE,cAAc,GAAG,YAAY,EAAE,cAAc,EAAE,EAAE,CAAC;gBAC7E,MAAM,YAAY,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,aAAa,EAAE,MAAM,IAAI,CAAC,CAAC;gBACpG,IAAI,YAAY,GAAG,CAAC,EAAE,CAAC;oBACrB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,EAAE,CAAC,EAAE,EAAE,CAAC;wBACtC,IAAI,CAAC,IAAI,CAAC,yCAAyC,CAAC,QAAQ,EAAE,UAAU,EAAE,cAAc,EAAE,CAAC,EAAE,QAAQ,CAAC;4BACpG,OAAO,KAAK,CAAC;oBACjB,CAAC;gBACH,CAAC;qBAAM,CAAC;oBACN,IAAI,CAAC,IAAI,CAAC,yCAAyC,CAAC,QAAQ,EAAE,UAAU,EAAE,cAAc,EAAE,SAAS,EAAE,QAAQ,CAAC;wBAC5G,OAAO,KAAK,CAAC;gBACjB,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,+BAA+B,CAAC,QAA8B;QAE1E,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC;YACrB,OAAO,IAAI,CAAC;QACd,IAAI,CAAC,kBAAkB,CAAC,qBAAqB,CAAC,QAAQ,EAAE,KAAK,CAAC;YAC5D,OAAO,KAAK,CAAC;QACf,MAAM,OAAO,GAAG,IAAI,kCAAkC,EAAE,CAAC;QACzD,IAAI,CAAC,4CAA4C,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;QACrE,OAAO,IAAI,CAAC;IAEd,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,6BAA6B,CAAC,QAA8B;QAExE,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC;YACrB,OAAO,IAAI,CAAC;QACd,IAAI,CAAC,kBAAkB,CAAC,qBAAqB,CAAC,QAAQ,EAAE,KAAK,CAAC;YAC5D,OAAO,KAAK,CAAC;QACf,MAAM,OAAO,GAAG,IAAI,wCAAwC,EAAE,CAAC;QAC/D,IAAI,CAAC,4CAA4C,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;QACrE,IAAI,CAAC,wBAAwB,CAAC,QAAQ,CAAC,CAAC;QACxC,OAAO,IAAI,CAAC;IAEd,CAAC;IAED;;OAEG;IACI,UAAU;QACf,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC7B,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC;QACrC,CAAC;aAAM,CAAC;YACN,MAAM,MAAM,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC;YACrC,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;gBAC5B,MAAM,OAAO,GAAG,CAAC,CAAC,UAAU,EAAE,CAAC;gBAC/B,IAAI,OAAO,YAAY,YAAY;oBACjC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC;YAC7C,CAAC;YACD,OAAO,MAAM,CAAC;QAChB,CAAC;IACH,CAAC;IACD;;;;;;;;;;;OAWG;IACI,MAAM,CAAC,iCAAiC,CAAC,OAAiB,EAAE,OAAiB,EAAE,aAAsB;QAC1G,IAAI,OAAO,YAAY,YAAY,EAAE,CAAC;YACpC,IAAI,OAAO,YAAY,YAAY,EAAE,CAAC;gBACpC,IAAI,OAAO,CAAC,SAAS,EAAE,KAAK,OAAO,CAAC,SAAS,EAAE,EAAE,CAAC;oBAChD,MAAM,CAAC,GAAG,OAAO,CAAC,SAAS,EAAE,CAAC;oBAC9B,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;oBAChC,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;oBAChC,MAAM,SAAS,GAAG,OAAO,CAAC,YAAY,CAAC;oBACvC,MAAM,SAAS,GAAG,OAAO,CAAC,YAAY,CAAC;oBAEvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;wBAC3B,SAAS,CAAC,6BAA6B,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;wBACnD,SAAS,CAAC,6BAA6B,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;wBACnD,aAAa,CAAC,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC;oBACjD,CAAC;oBACD,OAAO,IAAI,CAAC;gBACd,CAAC;YACH,CAAC;QACH,CAAC;aAAM,IAAI,OAAO,YAAY,YAAY,EAAE,CAAC;YAC3C,IAAI,OAAO,YAAY,YAAY,EAAE,CAAC;gBACpC,MAAM,SAAS,GAAG,OAAO,CAAC,QAAQ,CAAC;gBACnC,MAAM,SAAS,GAAG,OAAO,CAAC,QAAQ,CAAC;gBACnC,MAAM,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC;gBAC3B,IAAI,CAAC,KAAK,SAAS,CAAC,MAAM,EAAE,CAAC;oBAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;wBAC3B,IAAI,CAAC,IAAI,CAAC,iCAAiC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,aAAa,CAAC;4BACpF,OAAO,KAAK,CAAC;oBACjB,CAAC;oBACD,OAAO,IAAI,CAAC;gBACd,CAAC;YACH,CAAC;QACH,CAAC;aAAM,IAAI,OAAO,YAAY,UAAU,EAAE,CAAC;YACzC,IAAI,OAAO,YAAY,UAAU,EAAE,CAAC;gBAClC,MAAM,SAAS,GAAG,OAAO,CAAC,QAAQ,CAAC;gBACnC,MAAM,SAAS,GAAG,OAAO,CAAC,QAAQ,CAAC;gBACnC,MAAM,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC;gBAC3B,IAAI,CAAC,KAAK,SAAS,CAAC,MAAM,EAAE,CAAC;oBAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;wBAC3B,IAAI,CAAC,IAAI,CAAC,iCAAiC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,aAAa,CAAC;4BACpF,OAAO,KAAK,CAAC;oBACjB,CAAC;oBACD,OAAO,IAAI,CAAC;gBACd,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;CACF","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n/** @packageDocumentation\r\n * @module Curve\r\n */\r\n\r\nimport { Geometry } from \"../../Geometry\";\r\nimport { Point3d } from \"../../geometry3d/Point3dVector3d\";\r\nimport { Range1d } from \"../../geometry3d/Range\";\r\nimport { CurveChain, CurveCollection } from \"../CurveCollection\";\r\nimport { AnyCurve } from \"../CurveTypes\";\r\nimport { LineString3d } from \"../LineString3d\";\r\nimport { Loop } from \"../Loop\";\r\nimport { ParityRegion } from \"../ParityRegion\";\r\nimport { StrokeOptions } from \"../StrokeOptions\";\r\nimport { UnionRegion } from \"../UnionRegion\";\r\nimport { StrokeCountMap } from \"./StrokeCountMap\";\r\n\r\n// cspell:word remapa\r\n/**\r\n * abstract methods for callbacks during sweeps of collections of StrokeCount Structures.\r\n * * A set of StrokeCountMaps are to be visited multiple times.\r\n * * The logic that controls the sweep is as below.\r\n * * The callback object controls the number of sweeps and can adapt its action to the respective sweeps.\r\n * * Note that a \"false\" from cb.startPass() terminates passes for this chainIndex and primitiveIndex, but all others exit the whole sequence.\r\n * * This logic occurs 2 or three levels deep\r\n *   * outer level is \"chains\".   Simple swept path or loops have only one outer; parity regions have one outer per loop of the parity region\r\n *   * second level is primitive within chain.\r\n *     * If the primitives in a set are \"single component\", second level is lowest.\r\n *        * startSweep() and endSweep() calls are two parameters, with undefined componentIndex\r\n *     * If the primitives in a set are multi-component, there is a third level looping through corresponding components.\r\n * `\r\n *    if (!cb.startSweeps (chainIndex, primitiveIndex, componentIndex))\r\n *      return false;\r\n *    for (let pass = 0;cb.startPass (pass); pass++){\r\n *      for (each map in working set)\r\n *            if (!cb.visit (pass, map)) return false;\r\n *       if (!cb.endPass ()) return false;\r\n *        }\r\n *      }\r\n * if (!cb.endSweeps (chainIndex, primitiveIndex, componentIndex)) return false;\r\n * return true;\r\n * `\r\n * @internal\r\n */\r\nexport abstract class StrokeCountMapMultipassVisitor {\r\n  /**\r\n   * called to announce the beginning of one or more sweeps through related StrokeCountMap's\r\n   * @param chainIndex index of loop or path within the various contours.\r\n   * @param primitiveIndex index of primitive within the loop or path.\r\n   * @param componentIndex optional component index.\r\n   * @returns the number of sweeps to perform.\r\n   */\r\n  public startSweeps(_chainIndex: number, _primitiveIndex: number, _componentIndex?: number): boolean { return true; }\r\n  /**\r\n   * announce the beginning of a sweep pass.\r\n   * @param pass the index (0,1...) for this sweep pass.\r\n   * @return true to execute this pass.  false to break from the pass loop (next method called is endSweeps)\r\n   */\r\n  public abstract startPass(pass: number): boolean;\r\n  public abstract visit(pass: number, map: StrokeCountMap): boolean;\r\n  /**\r\n   * announce the end of a pass\r\n   * @param pass the index (0,1...) for this sweep pass.\r\n   * @return true to continue the sweeps.\r\n   */\r\n\r\n  public abstract endPass(pass: number): boolean;\r\n  /**\r\n   * announce the end of handling for particular chainIndex and primitiveIndex;\r\n   * @return true to continue outer loops.\r\n   */\r\n  public endSweeps(_chainIndex: number, _primitiveIndex: number, _componentIndex?: number): boolean { return true; }\r\n\r\n}\r\n/**\r\n * * pass 1: determine max numStroke\r\n * * pass 2: impose max numStroke\r\n * @internal\r\n */\r\nexport class StrokeCountMapVisitorApplyMaxCount extends StrokeCountMapMultipassVisitor {\r\n  public myMap: StrokeCountMap;\r\n  public constructor() {\r\n    super();\r\n    this.myMap = StrokeCountMap.createWithComponentIndex();\r\n  }\r\n  /** set up for a pass through corresponding maps. */\r\n  public startPass(pass: number): boolean {\r\n    if (pass === 0) {\r\n      this.myMap.numStroke = 0;\r\n      return true;\r\n    } else if (pass === 1) {\r\n      // nothing to change == numStroke will be applied to each primitive.\r\n      return true;\r\n    }\r\n    // all other pass numbers are rejected ...\r\n    return false;\r\n  }\r\n  /** visit one of the set of corresponding maps. */\r\n  public visit(pass: number, map: StrokeCountMap): boolean {\r\n    if (pass === 0) {\r\n      if (map.numStroke > this.myMap.numStroke)\r\n        this.myMap.numStroke = map.numStroke;\r\n      return true;\r\n    } else if (pass === 1) {\r\n      // apply the max from prior pass\r\n      map.numStroke = this.myMap.numStroke;\r\n      return true;\r\n    }\r\n    // no other pass values should happen -- canceled by startPass.\r\n    return false;\r\n  }\r\n\r\n  public endPass(_pass: number): boolean { return true; }\r\n}\r\n/**\r\n * * pass 1: determine max curveLength among maps presented.\r\n * * pass 2: set the a0 and a1 values to 0 and that max distance\r\n * @internal\r\n */\r\nexport class StrokeCountMapVisitorApplyMaxCurveLength extends StrokeCountMapMultipassVisitor {\r\n  public maxCurveLength: number;\r\n  public constructor() {\r\n    super();\r\n    this.maxCurveLength = 0.0;\r\n  }\r\n  /** set up for a pass through corresponding maps. */\r\n  public startPass(pass: number): boolean {\r\n    if (pass === 0) {\r\n      this.maxCurveLength = 0;\r\n      return true;\r\n    } else if (pass === 1) {\r\n      // nothing to change == numStroke will be applied to each primitive.\r\n      return true;\r\n    }\r\n    // all other pass numbers are rejected ...\r\n    return false;\r\n  }\r\n  /** visit one of the set of corresponding maps. */\r\n  public visit(pass: number, map: StrokeCountMap): boolean {\r\n    if (pass === 0) {\r\n      this.maxCurveLength = Geometry.maxXY(map.curveLength, this.maxCurveLength);\r\n      return true;\r\n    } else if (pass === 1) {\r\n      // apply the max from prior pass\r\n      map.a0 = 0.0;\r\n      map.a1 = this.maxCurveLength;\r\n      return true;\r\n    }\r\n    // no other pass values should happen -- canceled by startPass.\r\n    return false;\r\n  }\r\n\r\n  public endPass(_pass: number): boolean { return true; }\r\n}\r\n/**\r\n * class `StrokeCountChain` contains:\r\n * * `maps` = an array of `StrokeCountMap`\r\n * * `parent` = parent CurveCollection.\r\n *\r\n * An instance is normally created with either a `Path` or `Loop` as the parent.\r\n * @internal\r\n */\r\nexport class StrokeCountChain {\r\n  public maps: StrokeCountMap[];\r\n  public parent?: CurveCollection;\r\n  /**\r\n   * options are used (with different purposes) at two times:\r\n   * * When the StrokeCountChain is created, the options affect the stroke counts.  This is just creating markup, not actual strokes.\r\n   * * When actual stroking happens, the options control creation of parameters and tangents.\r\n   */\r\n  public options?: StrokeOptions;\r\n\r\n  private constructor(parent?: CurveCollection, options?: StrokeOptions) {\r\n    this.parent = parent;\r\n    this.maps = [];\r\n    this.options = options;\r\n  }\r\n  public static create(chain: CurveChain, options?: StrokeOptions): StrokeCountChain {\r\n    const result = new StrokeCountChain(chain, options);\r\n    result.parent = chain;\r\n    // A chain can only contain primitives !!!!\r\n    for (const p of chain.children) {\r\n      p.computeAndAttachRecursiveStrokeCounts(options);\r\n      if (p.strokeData)\r\n        result.maps.push(p.strokeData);\r\n    }\r\n    return result;\r\n  }\r\n  public getStrokes(): LineString3d {\r\n    const ls = LineString3d.create();\r\n    if (this.options) {\r\n      if (this.options.needNormals || this.options.needParams) {\r\n        ls.ensureEmptyFractions();\r\n        ls.ensureEmptyDerivatives();\r\n        ls.ensureEmptyUVParams();\r\n      }\r\n    }\r\n    for (const m of this.maps) {\r\n      if (m.primitive)\r\n        m.primitive.addMappedStrokesToLineString3D(m, ls);\r\n    }\r\n    return ls;\r\n\r\n  }\r\n  /** internal form of  */\r\n  private static applySummed01LimitsWithinArray(maps: StrokeCountMap[], incomingSum: number): number {\r\n    let movingSum = incomingSum;\r\n    for (const m of maps) {\r\n      m.a0 += movingSum;\r\n      if (m.componentData) {\r\n        m.a1 = this.applySummed01LimitsWithinArray(m.componentData, m.a0);\r\n      } else {\r\n        m.a1 += movingSum;\r\n      }\r\n      movingSum = m.a1;\r\n    }\r\n    return movingSum;\r\n  }\r\n  /**\r\n   * walk the maps in the array.\r\n   * * in maps with no component data\r\n   *   * increment map.a0 and map.a1 by the incoming distance a0\r\n   * * in maps with component data:\r\n   *   * recurse through the component array.\r\n   *   * increment map.a0 by the incoming a0.\r\n   *   * returned a1 from the componentData array becomes a1\r\n   * @returns upper value of a1 in final map.\r\n   * @param maps\r\n   * @param incomingSum lower value to add to a0 for first map.\r\n   */\r\n  public applySummed01Limits(incomingSum: number): number {\r\n    return StrokeCountChain.applySummed01LimitsWithinArray(this.maps, incomingSum);\r\n  }\r\n}\r\n\r\n/**\r\n * class `StrokeCountSection`\\\r\n * * contains an array of `StrokeCountChain`.\r\n * * Hence it is the internal node level of a (1-level-deep) tree of `StrokeCountChain`\r\n * @internal\r\n */\r\nexport class StrokeCountSection {\r\n  public chains: StrokeCountChain[];\r\n  public parent?: CurveCollection;\r\n  private constructor(parent?: CurveCollection) { this.parent = parent; this.chains = []; }\r\n  /**\r\n   * construct array of arrays of `StrokeCountMap`s\r\n   * @param parent\r\n   */\r\n  public static create(parent: CurveCollection, options?: StrokeOptions): StrokeCountSection {\r\n    const result = new StrokeCountSection(parent);\r\n    const appendCurveChain = (chain: CurveChain) => result.chains.push(StrokeCountChain.create(chain, options));\r\n    const appendParityRegion = (region: ParityRegion) => { for (const child of region.children) appendCurveChain(child); }\r\n    if (parent instanceof UnionRegion) {\r\n      for (const child of parent.children) {\r\n        if (child instanceof ParityRegion)\r\n          appendParityRegion(child);\r\n        else\r\n          appendCurveChain(child);\r\n      }\r\n    } else if (parent instanceof ParityRegion) {\r\n      appendParityRegion(parent);\r\n    } else if (parent instanceof CurveChain) {\r\n      appendCurveChain(parent);\r\n    }\r\n    return result;\r\n  }\r\n  /** test if all sections have the same structure. */\r\n  public static areSectionsCompatible(sections: StrokeCountSection[], enforceCounts: boolean): boolean {\r\n    if (sections.length < 2)\r\n      return true;  // hm.. don't know if that is useful, but nothing to check here.\r\n    const numChains = sections[0].chains.length;\r\n    for (let i = 1; i < sections.length; i++) {\r\n      // first level: must match number of paths or loops\r\n      if (sections[i].chains.length !== numChains)\r\n        return false;\r\n      // second level: must have same number of primitives in each path or loop\r\n      for (let j = 0; j < sections[0].chains.length; j++) {\r\n        const numPrimitive = sections[0].chains[j].maps.length;\r\n        if (sections[i].chains[j].maps.length !== numPrimitive)\r\n          return false;\r\n        for (let k = 0; k < numPrimitive; k++) {\r\n          if (!sections[0].chains[j].maps[k].isCompatibleComponentStructure(sections[i].chains[j].maps[k], enforceCounts))\r\n            return false;\r\n        }\r\n      }\r\n\r\n    }\r\n    return true;\r\n  }\r\n\r\n  /** Within each section, sweep accumulate curveLength field, recording entry and exit sum in each map.\r\n   * * In expected use, (a0,a1) are (0,a) where a is the (previously computed) max length among corresponding maps up and down the section arrays.\r\n   */\r\n  public static remapa0a1WithinEachChain(sections: StrokeCountSection[]) {\r\n    for (const section of sections) {\r\n      for (const chain of section.chains) {\r\n        chain.applySummed01Limits(0.0);\r\n      }\r\n    }\r\n  }\r\n\r\n  private static applyMultipassVisitorCallbackNoComponents(sections: StrokeCountSection[], chainIndex: number, primitiveIndex: number,\r\n    componentIndex: number | undefined, callback: StrokeCountMapMultipassVisitor) {\r\n    const numSection = sections.length;\r\n    if (!callback.startSweeps(chainIndex, primitiveIndex, componentIndex)) return false;\r\n    if (componentIndex === undefined) {\r\n      // there are corresponding primitives directly at the section, chain, primitive index:\r\n      for (let pass = 0; ; pass++) {\r\n        if (!callback.startPass(pass))\r\n          break;\r\n        for (let sectionIndex = 0; sectionIndex < numSection; sectionIndex++)\r\n          if (!callback.visit(pass, sections[sectionIndex].chains[chainIndex].maps[primitiveIndex]))\r\n            return false;\r\n        if (!callback.endPass(pass))\r\n          return false;\r\n      }\r\n    } else {\r\n      // there are corresponding primitives at the section, chain, primitive,componentIndex\r\n      // there are corresponding primitives directly at the section, chain, primitive index:\r\n      for (let pass = 0; ; pass++) {\r\n        if (!callback.startPass(pass))\r\n          break;\r\n        for (let sectionIndex = 0; sectionIndex < numSection; sectionIndex++)\r\n          if (!callback.visit(pass, sections[sectionIndex].chains[chainIndex].maps[primitiveIndex].componentData![componentIndex]))\r\n            return false;\r\n        if (!callback.endPass(pass))\r\n          return false;\r\n      }\r\n\r\n    }\r\n    if (!callback.endSweeps(chainIndex, primitiveIndex, componentIndex)) return false;\r\n    return true;\r\n  }\r\n\r\n  /**\r\n   * Walk through the sections, emitting callbacks delimiting groups of corresponding primitives.\r\n   * @param sections array of sections (possibly a single path or loop at each section, or possibly a set of parity loops.)\r\n   * @param callback object to be notified during the traversal\r\n   */\r\n  public static runMultiPassVisitorAtCorrespondingPrimitives(sections: StrokeCountSection[], callback: StrokeCountMapMultipassVisitor): boolean {\r\n    const numChainPerSection = sections[0].chains.length;\r\n    for (let chainIndex = 0; chainIndex < numChainPerSection; chainIndex++) {\r\n      const numPrimitive = sections[0].chains[chainIndex].maps.length;\r\n      for (let primitiveIndex = 0; primitiveIndex < numPrimitive; primitiveIndex++) {\r\n        const numComponent = sections[0].chains[chainIndex].maps[primitiveIndex].componentData?.length ?? 0;\r\n        if (numComponent > 0) {\r\n          for (let i = 0; i < numComponent; i++) {\r\n            if (!this.applyMultipassVisitorCallbackNoComponents(sections, chainIndex, primitiveIndex, i, callback))\r\n              return false;\r\n          }\r\n        } else {\r\n          if (!this.applyMultipassVisitorCallbackNoComponents(sections, chainIndex, primitiveIndex, undefined, callback))\r\n            return false;\r\n        }\r\n      }\r\n    }\r\n    return true;\r\n  }\r\n\r\n  /**\r\n   * * Confirm that all sections in the array have the same structure.\r\n   * * Within each corresponding set of entries, apply the max count to all.\r\n   * @param sections array of per-section stroke count entries\r\n   */\r\n  public static enforceStrokeCountCompatibility(sections: StrokeCountSection[]): boolean {\r\n\r\n    if (sections.length < 2)\r\n      return true;\r\n    if (!StrokeCountSection.areSectionsCompatible(sections, false))\r\n      return false;\r\n    const visitor = new StrokeCountMapVisitorApplyMaxCount();\r\n    this.runMultiPassVisitorAtCorrespondingPrimitives(sections, visitor);\r\n    return true;\r\n\r\n  }\r\n  /**\r\n   * * Confirm that all sections in the array have the same structure.\r\n   * * Within each corresponding set of entries up and down the sections, set curveLength as the maximum of the respective curve lengths.\r\n   * * Along each section, sum curveLengths (which were just reset) to get consistent along-chain parameters\r\n   * @param sections array of per-section stroke count entries\r\n   */\r\n  public static enforceCompatibleDistanceSums(sections: StrokeCountSection[]): boolean {\r\n\r\n    if (sections.length < 2)\r\n      return true;\r\n    if (!StrokeCountSection.areSectionsCompatible(sections, false))\r\n      return false;\r\n    const visitor = new StrokeCountMapVisitorApplyMaxCurveLength();\r\n    this.runMultiPassVisitorAtCorrespondingPrimitives(sections, visitor);\r\n    this.remapa0a1WithinEachChain(sections);\r\n    return true;\r\n\r\n  }\r\n\r\n  /**\r\n   * Return stroked form of the section.\r\n   */\r\n  public getStrokes(): AnyCurve {\r\n    if (this.chains.length === 1) {\r\n      return this.chains[0].getStrokes();\r\n    } else {\r\n      const region = ParityRegion.create();\r\n      for (const c of this.chains) {\r\n        const strokes = c.getStrokes();\r\n        if (strokes instanceof LineString3d)\r\n          region.tryAddChild(Loop.create(strokes));\r\n      }\r\n      return region;\r\n    }\r\n  }\r\n  /**\r\n   * Given two compatible stroke sets (as returned by getStrokes) extend a range\r\n   * with the distances between corresponding points.\r\n   * * Each set of strokes may be:\r\n   *   * linestring\r\n   *   * ParityRegion\r\n   *   * CurveChain (Loop or Path)\r\n   * @param strokeA first set of strokes\r\n   * @param strokeB second set of strokes\r\n   * @param rangeToExtend caller-allocated range to be extended.\r\n   * @returns true if structures are compatible.\r\n   */\r\n  public static extendDistanceRangeBetweenStrokes(strokeA: AnyCurve, strokeB: AnyCurve, rangeToExtend: Range1d): boolean {\r\n    if (strokeA instanceof LineString3d) {\r\n      if (strokeB instanceof LineString3d) {\r\n        if (strokeA.numPoints() === strokeB.numPoints()) {\r\n          const n = strokeA.numPoints();\r\n          const pointA = Point3d.create();\r\n          const pointB = Point3d.create();\r\n          const allPointA = strokeA.packedPoints;\r\n          const allPointB = strokeB.packedPoints;\r\n\r\n          for (let i = 0; i < n; i++) {\r\n            allPointA.getPoint3dAtCheckedPointIndex(i, pointA);\r\n            allPointB.getPoint3dAtCheckedPointIndex(i, pointB);\r\n            rangeToExtend.extendX(pointA.distance(pointB));\r\n          }\r\n          return true;\r\n        }\r\n      }\r\n    } else if (strokeA instanceof ParityRegion) {\r\n      if (strokeB instanceof ParityRegion) {\r\n        const childrenA = strokeA.children;\r\n        const childrenB = strokeB.children;\r\n        const n = childrenA.length;\r\n        if (n === childrenB.length) {\r\n          for (let i = 0; i < n; i++) {\r\n            if (!this.extendDistanceRangeBetweenStrokes(childrenA[i], childrenB[i], rangeToExtend))\r\n              return false;\r\n          }\r\n          return true;\r\n        }\r\n      }\r\n    } else if (strokeA instanceof CurveChain) {\r\n      if (strokeB instanceof CurveChain) {\r\n        const childrenA = strokeA.children;\r\n        const childrenB = strokeB.children;\r\n        const n = childrenA.length;\r\n        if (n === childrenB.length) {\r\n          for (let i = 0; i < n; i++) {\r\n            if (!this.extendDistanceRangeBetweenStrokes(childrenA[i], childrenB[i], rangeToExtend))\r\n              return false;\r\n          }\r\n          return true;\r\n        }\r\n      }\r\n    }\r\n    return false;\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"StrokeCountChain.js","sourceRoot":"","sources":["../../../../src/curve/Query/StrokeCountChain.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAC1C,OAAO,EAAE,OAAO,EAAE,MAAM,kCAAkC,CAAC;AAE3D,OAAO,EAAE,UAAU,EAAmB,MAAM,oBAAoB,CAAC;AAEjE,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAC/C,OAAO,EAAE,IAAI,EAAE,MAAM,SAAS,CAAC;AAC/B,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAE/C,OAAO,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC;AAC7C,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAElD,qBAAqB;AACrB;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AACH,MAAM,OAAgB,8BAA8B;IAClD;;;;;;OAMG;IACI,WAAW,CAAC,WAAmB,EAAE,eAAuB,EAAE,eAAwB,IAAa,OAAO,IAAI,CAAC,CAAC,CAAC;IAepH;;;OAGG;IACI,SAAS,CAAC,WAAmB,EAAE,eAAuB,EAAE,eAAwB,IAAa,OAAO,IAAI,CAAC,CAAC,CAAC;CAEnH;AACD;;;;GAIG;AACH,MAAM,OAAO,kCAAmC,SAAQ,8BAA8B;IAC7E,KAAK,CAAiB;IAC7B;QACE,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,KAAK,GAAG,cAAc,CAAC,wBAAwB,EAAE,CAAC;IACzD,CAAC;IACD,oDAAoD;IAC7C,SAAS,CAAC,IAAY;QAC3B,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;YACf,IAAI,CAAC,KAAK,CAAC,SAAS,GAAG,CAAC,CAAC;YACzB,OAAO,IAAI,CAAC;QACd,CAAC;aAAM,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;YACtB,oEAAoE;YACpE,OAAO,IAAI,CAAC;QACd,CAAC;QACD,0CAA0C;QAC1C,OAAO,KAAK,CAAC;IACf,CAAC;IACD,kDAAkD;IAC3C,KAAK,CAAC,IAAY,EAAE,GAAmB;QAC5C,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;YACf,IAAI,GAAG,CAAC,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS;gBACtC,IAAI,CAAC,KAAK,CAAC,SAAS,GAAG,GAAG,CAAC,SAAS,CAAC;YACvC,OAAO,IAAI,CAAC;QACd,CAAC;aAAM,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;YACtB,gCAAgC;YAChC,GAAG,CAAC,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC;YACrC,OAAO,IAAI,CAAC;QACd,CAAC;QACD,+DAA+D;QAC/D,OAAO,KAAK,CAAC;IACf,CAAC;IAEM,OAAO,CAAC,KAAa,IAAa,OAAO,IAAI,CAAC,CAAC,CAAC;CACxD;AACD;;;;GAIG;AACH,MAAM,OAAO,wCAAyC,SAAQ,8BAA8B;IACnF,cAAc,CAAS;IAC9B;QACE,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,cAAc,GAAG,GAAG,CAAC;IAC5B,CAAC;IACD,oDAAoD;IAC7C,SAAS,CAAC,IAAY;QAC3B,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;YACf,IAAI,CAAC,cAAc,GAAG,CAAC,CAAC;YACxB,OAAO,IAAI,CAAC;QACd,CAAC;aAAM,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;YACtB,oEAAoE;YACpE,OAAO,IAAI,CAAC;QACd,CAAC;QACD,0CAA0C;QAC1C,OAAO,KAAK,CAAC;IACf,CAAC;IACD,kDAAkD;IAC3C,KAAK,CAAC,IAAY,EAAE,GAAmB;QAC5C,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;YACf,IAAI,CAAC,cAAc,GAAG,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,WAAW,EAAE,IAAI,CAAC,cAAc,CAAC,CAAC;YAC3E,OAAO,IAAI,CAAC;QACd,CAAC;aAAM,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;YACtB,gCAAgC;YAChC,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC;YACb,GAAG,CAAC,EAAE,GAAG,IAAI,CAAC,cAAc,CAAC;YAC7B,OAAO,IAAI,CAAC;QACd,CAAC;QACD,+DAA+D;QAC/D,OAAO,KAAK,CAAC;IACf,CAAC;IAEM,OAAO,CAAC,KAAa,IAAa,OAAO,IAAI,CAAC,CAAC,CAAC;CACxD;AACD;;;;;;;GAOG;AACH,MAAM,OAAO,gBAAgB;IACpB,IAAI,CAAmB;IACvB,MAAM,CAAmB;IAChC;;;;OAIG;IACI,OAAO,CAAiB;IAE/B,YAAoB,MAAwB,EAAE,OAAuB;QACnE,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,IAAI,GAAG,EAAE,CAAC;QACf,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;IACzB,CAAC;IACM,MAAM,CAAC,MAAM,CAAC,KAAiB,EAAE,OAAuB;QAC7D,MAAM,MAAM,GAAG,IAAI,gBAAgB,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;QACpD,MAAM,CAAC,MAAM,GAAG,KAAK,CAAC;QACtB,2CAA2C;QAC3C,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;YAC/B,CAAC,CAAC,qCAAqC,CAAC,OAAO,CAAC,CAAC;YACjD,IAAI,CAAC,CAAC,UAAU;gBACd,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;QACnC,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACM,UAAU;QACf,MAAM,EAAE,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC;QACjC,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjB,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,IAAI,CAAC,OAAO,CAAC,UAAU,EAAE,CAAC;gBACxD,EAAE,CAAC,oBAAoB,EAAE,CAAC;gBAC1B,EAAE,CAAC,sBAAsB,EAAE,CAAC;gBAC5B,EAAE,CAAC,mBAAmB,EAAE,CAAC;YAC3B,CAAC;QACH,CAAC;QACD,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;YAC1B,IAAI,CAAC,CAAC,SAAS;gBACb,CAAC,CAAC,SAAS,CAAC,8BAA8B,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QACtD,CAAC;QACD,OAAO,EAAE,CAAC;IAEZ,CAAC;IACD,wBAAwB;IAChB,MAAM,CAAC,8BAA8B,CAAC,IAAsB,EAAE,WAAmB;QACvF,IAAI,SAAS,GAAG,WAAW,CAAC;QAC5B,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;YACrB,CAAC,CAAC,EAAE,IAAI,SAAS,CAAC;YAClB,IAAI,CAAC,CAAC,aAAa,EAAE,CAAC;gBACpB,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC,8BAA8B,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;YACpE,CAAC;iBAAM,CAAC;gBACN,CAAC,CAAC,EAAE,IAAI,SAAS,CAAC;YACpB,CAAC;YACD,SAAS,GAAG,CAAC,CAAC,EAAE,CAAC;QACnB,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;;;;;;OAWG;IACI,mBAAmB,CAAC,WAAmB;QAC5C,OAAO,gBAAgB,CAAC,8BAA8B,CAAC,IAAI,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC;IACjF,CAAC;CACF;AAED;;;;;GAKG;AACH,MAAM,OAAO,kBAAkB;IACtB,MAAM,CAAqB;IAC3B,MAAM,CAAmB;IAChC,YAAoB,MAAwB,IAAI,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC,CAAC,IAAI,CAAC,MAAM,GAAG,EAAE,CAAC,CAAC,CAAC;IACzF;;;OAGG;IACI,MAAM,CAAC,MAAM,CAAC,MAAuB,EAAE,OAAuB;QACnE,MAAM,MAAM,GAAG,IAAI,kBAAkB,CAAC,MAAM,CAAC,CAAC;QAC9C,MAAM,gBAAgB,GAAG,CAAC,KAAiB,EAAE,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC;QAC5G,MAAM,kBAAkB,GAAG,CAAC,MAAoB,EAAE,EAAE,GAAG,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,QAAQ;YAAE,gBAAgB,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAA;QACtH,IAAI,MAAM,YAAY,WAAW,EAAE,CAAC;YAClC,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC;gBACpC,IAAI,KAAK,YAAY,YAAY;oBAC/B,kBAAkB,CAAC,KAAK,CAAC,CAAC;;oBAE1B,gBAAgB,CAAC,KAAK,CAAC,CAAC;YAC5B,CAAC;QACH,CAAC;aAAM,IAAI,MAAM,YAAY,YAAY,EAAE,CAAC;YAC1C,kBAAkB,CAAC,MAAM,CAAC,CAAC;QAC7B,CAAC;aAAM,IAAI,MAAM,YAAY,UAAU,EAAE,CAAC;YACxC,gBAAgB,CAAC,MAAM,CAAC,CAAC;QAC3B,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,oDAAoD;IAC7C,MAAM,CAAC,qBAAqB,CAAC,QAA8B,EAAE,aAAsB;QACxF,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC;YACrB,OAAO,IAAI,CAAC,CAAE,gEAAgE;QAChF,MAAM,SAAS,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC;QAC5C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,mDAAmD;YACnD,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,KAAK,SAAS;gBACzC,OAAO,KAAK,CAAC;YACf,yEAAyE;YACzE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACnD,MAAM,YAAY,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;gBACvD,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,KAAK,YAAY;oBACpD,OAAO,KAAK,CAAC;gBACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,EAAE,CAAC,EAAE,EAAE,CAAC;oBACtC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,8BAA8B,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,aAAa,CAAC;wBAC7G,OAAO,KAAK,CAAC;gBACjB,CAAC;YACH,CAAC;QAEH,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACI,MAAM,CAAC,wBAAwB,CAAC,QAA8B;QACnE,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;YAC/B,KAAK,MAAM,KAAK,IAAI,OAAO,CAAC,MAAM,EAAE,CAAC;gBACnC,KAAK,CAAC,mBAAmB,CAAC,GAAG,CAAC,CAAC;YACjC,CAAC;QACH,CAAC;IACH,CAAC;IAEO,MAAM,CAAC,yCAAyC,CAAC,QAA8B,EAAE,UAAkB,EAAE,cAAsB,EACjI,cAAkC,EAAE,QAAwC;QAC5E,MAAM,UAAU,GAAG,QAAQ,CAAC,MAAM,CAAC;QACnC,IAAI,CAAC,QAAQ,CAAC,WAAW,CAAC,UAAU,EAAE,cAAc,EAAE,cAAc,CAAC;YAAE,OAAO,KAAK,CAAC;QACpF,IAAI,cAAc,KAAK,SAAS,EAAE,CAAC;YACjC,sFAAsF;YACtF,KAAK,IAAI,IAAI,GAAG,CAAC,GAAI,IAAI,EAAE,EAAE,CAAC;gBAC5B,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,IAAI,CAAC;oBAC3B,MAAM;gBACR,KAAK,IAAI,YAAY,GAAG,CAAC,EAAE,YAAY,GAAG,UAAU,EAAE,YAAY,EAAE;oBAClE,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,EAAE,QAAQ,CAAC,YAAY,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;wBACvF,OAAO,KAAK,CAAC;gBACjB,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC;oBACzB,OAAO,KAAK,CAAC;YACjB,CAAC;QACH,CAAC;aAAM,CAAC;YACN,qFAAqF;YACrF,sFAAsF;YACtF,KAAK,IAAI,IAAI,GAAG,CAAC,GAAI,IAAI,EAAE,EAAE,CAAC;gBAC5B,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,IAAI,CAAC;oBAC3B,MAAM;gBACR,KAAK,IAAI,YAAY,GAAG,CAAC,EAAE,YAAY,GAAG,UAAU,EAAE,YAAY,EAAE;oBAClE,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,EAAE,QAAQ,CAAC,YAAY,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,aAAc,CAAC,cAAc,CAAC,CAAC;wBACtH,OAAO,KAAK,CAAC;gBACjB,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC;oBACzB,OAAO,KAAK,CAAC;YACjB,CAAC;QAEH,CAAC;QACD,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,UAAU,EAAE,cAAc,EAAE,cAAc,CAAC;YAAE,OAAO,KAAK,CAAC;QAClF,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,4CAA4C,CAAC,QAA8B,EAAE,QAAwC;QACjI,MAAM,kBAAkB,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC;QACrD,KAAK,IAAI,UAAU,GAAG,CAAC,EAAE,UAAU,GAAG,kBAAkB,EAAE,UAAU,EAAE,EAAE,CAAC;YACvE,MAAM,YAAY,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;YAChE,KAAK,IAAI,cAAc,GAAG,CAAC,EAAE,cAAc,GAAG,YAAY,EAAE,cAAc,EAAE,EAAE,CAAC;gBAC7E,MAAM,YAAY,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,aAAa,EAAE,MAAM,IAAI,CAAC,CAAC;gBACpG,IAAI,YAAY,GAAG,CAAC,EAAE,CAAC;oBACrB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,EAAE,CAAC,EAAE,EAAE,CAAC;wBACtC,IAAI,CAAC,IAAI,CAAC,yCAAyC,CAAC,QAAQ,EAAE,UAAU,EAAE,cAAc,EAAE,CAAC,EAAE,QAAQ,CAAC;4BACpG,OAAO,KAAK,CAAC;oBACjB,CAAC;gBACH,CAAC;qBAAM,CAAC;oBACN,IAAI,CAAC,IAAI,CAAC,yCAAyC,CAAC,QAAQ,EAAE,UAAU,EAAE,cAAc,EAAE,SAAS,EAAE,QAAQ,CAAC;wBAC5G,OAAO,KAAK,CAAC;gBACjB,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,+BAA+B,CAAC,QAA8B;QAE1E,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC;YACrB,OAAO,IAAI,CAAC;QACd,IAAI,CAAC,kBAAkB,CAAC,qBAAqB,CAAC,QAAQ,EAAE,KAAK,CAAC;YAC5D,OAAO,KAAK,CAAC;QACf,MAAM,OAAO,GAAG,IAAI,kCAAkC,EAAE,CAAC;QACzD,IAAI,CAAC,4CAA4C,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;QACrE,OAAO,IAAI,CAAC;IAEd,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,6BAA6B,CAAC,QAA8B;QAExE,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC;YACrB,OAAO,IAAI,CAAC;QACd,IAAI,CAAC,kBAAkB,CAAC,qBAAqB,CAAC,QAAQ,EAAE,KAAK,CAAC;YAC5D,OAAO,KAAK,CAAC;QACf,MAAM,OAAO,GAAG,IAAI,wCAAwC,EAAE,CAAC;QAC/D,IAAI,CAAC,4CAA4C,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;QACrE,IAAI,CAAC,wBAAwB,CAAC,QAAQ,CAAC,CAAC;QACxC,OAAO,IAAI,CAAC;IAEd,CAAC;IAED;;OAEG;IACI,UAAU;QACf,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC7B,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC;QACrC,CAAC;aAAM,CAAC;YACN,MAAM,MAAM,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC;YACrC,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;gBAC5B,MAAM,OAAO,GAAG,CAAC,CAAC,UAAU,EAAE,CAAC;gBAC/B,IAAI,OAAO,YAAY,YAAY;oBACjC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC;YAC7C,CAAC;YACD,OAAO,MAAM,CAAC;QAChB,CAAC;IACH,CAAC;IACD;;;;;;;;;;;OAWG;IACI,MAAM,CAAC,iCAAiC,CAAC,OAAiB,EAAE,OAAiB,EAAE,aAAsB;QAC1G,IAAI,OAAO,YAAY,YAAY,EAAE,CAAC;YACpC,IAAI,OAAO,YAAY,YAAY,EAAE,CAAC;gBACpC,IAAI,OAAO,CAAC,SAAS,EAAE,KAAK,OAAO,CAAC,SAAS,EAAE,EAAE,CAAC;oBAChD,MAAM,CAAC,GAAG,OAAO,CAAC,SAAS,EAAE,CAAC;oBAC9B,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;oBAChC,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;oBAChC,MAAM,SAAS,GAAG,OAAO,CAAC,YAAY,CAAC;oBACvC,MAAM,SAAS,GAAG,OAAO,CAAC,YAAY,CAAC;oBAEvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;wBAC3B,SAAS,CAAC,6BAA6B,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;wBACnD,SAAS,CAAC,6BAA6B,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;wBACnD,aAAa,CAAC,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC;oBACjD,CAAC;oBACD,OAAO,IAAI,CAAC;gBACd,CAAC;YACH,CAAC;QACH,CAAC;aAAM,IAAI,OAAO,YAAY,YAAY,EAAE,CAAC;YAC3C,IAAI,OAAO,YAAY,YAAY,EAAE,CAAC;gBACpC,MAAM,SAAS,GAAG,OAAO,CAAC,QAAQ,CAAC;gBACnC,MAAM,SAAS,GAAG,OAAO,CAAC,QAAQ,CAAC;gBACnC,MAAM,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC;gBAC3B,IAAI,CAAC,KAAK,SAAS,CAAC,MAAM,EAAE,CAAC;oBAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;wBAC3B,IAAI,CAAC,IAAI,CAAC,iCAAiC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,aAAa,CAAC;4BACpF,OAAO,KAAK,CAAC;oBACjB,CAAC;oBACD,OAAO,IAAI,CAAC;gBACd,CAAC;YACH,CAAC;QACH,CAAC;aAAM,IAAI,OAAO,YAAY,UAAU,EAAE,CAAC;YACzC,IAAI,OAAO,YAAY,UAAU,EAAE,CAAC;gBAClC,MAAM,SAAS,GAAG,OAAO,CAAC,QAAQ,CAAC;gBACnC,MAAM,SAAS,GAAG,OAAO,CAAC,QAAQ,CAAC;gBACnC,MAAM,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC;gBAC3B,IAAI,CAAC,KAAK,SAAS,CAAC,MAAM,EAAE,CAAC;oBAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;wBAC3B,IAAI,CAAC,IAAI,CAAC,iCAAiC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,aAAa,CAAC;4BACpF,OAAO,KAAK,CAAC;oBACjB,CAAC;oBACD,OAAO,IAAI,CAAC;gBACd,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;CACF","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n/** @packageDocumentation\n * @module Curve\n */\n\nimport { Geometry } from \"../../Geometry\";\nimport { Point3d } from \"../../geometry3d/Point3dVector3d\";\nimport { Range1d } from \"../../geometry3d/Range\";\nimport { CurveChain, CurveCollection } from \"../CurveCollection\";\nimport { AnyCurve } from \"../CurveTypes\";\nimport { LineString3d } from \"../LineString3d\";\nimport { Loop } from \"../Loop\";\nimport { ParityRegion } from \"../ParityRegion\";\nimport { StrokeOptions } from \"../StrokeOptions\";\nimport { UnionRegion } from \"../UnionRegion\";\nimport { StrokeCountMap } from \"./StrokeCountMap\";\n\n// cspell:word remapa\n/**\n * abstract methods for callbacks during sweeps of collections of StrokeCount Structures.\n * * A set of StrokeCountMaps are to be visited multiple times.\n * * The logic that controls the sweep is as below.\n * * The callback object controls the number of sweeps and can adapt its action to the respective sweeps.\n * * Note that a \"false\" from cb.startPass() terminates passes for this chainIndex and primitiveIndex, but all others exit the whole sequence.\n * * This logic occurs 2 or three levels deep\n *   * outer level is \"chains\".   Simple swept path or loops have only one outer; parity regions have one outer per loop of the parity region\n *   * second level is primitive within chain.\n *     * If the primitives in a set are \"single component\", second level is lowest.\n *        * startSweep() and endSweep() calls are two parameters, with undefined componentIndex\n *     * If the primitives in a set are multi-component, there is a third level looping through corresponding components.\n * `\n *    if (!cb.startSweeps (chainIndex, primitiveIndex, componentIndex))\n *      return false;\n *    for (let pass = 0;cb.startPass (pass); pass++){\n *      for (each map in working set)\n *            if (!cb.visit (pass, map)) return false;\n *       if (!cb.endPass ()) return false;\n *        }\n *      }\n * if (!cb.endSweeps (chainIndex, primitiveIndex, componentIndex)) return false;\n * return true;\n * `\n * @internal\n */\nexport abstract class StrokeCountMapMultipassVisitor {\n  /**\n   * called to announce the beginning of one or more sweeps through related StrokeCountMap's\n   * @param chainIndex index of loop or path within the various contours.\n   * @param primitiveIndex index of primitive within the loop or path.\n   * @param componentIndex optional component index.\n   * @returns the number of sweeps to perform.\n   */\n  public startSweeps(_chainIndex: number, _primitiveIndex: number, _componentIndex?: number): boolean { return true; }\n  /**\n   * announce the beginning of a sweep pass.\n   * @param pass the index (0,1...) for this sweep pass.\n   * @return true to execute this pass.  false to break from the pass loop (next method called is endSweeps)\n   */\n  public abstract startPass(pass: number): boolean;\n  public abstract visit(pass: number, map: StrokeCountMap): boolean;\n  /**\n   * announce the end of a pass\n   * @param pass the index (0,1...) for this sweep pass.\n   * @return true to continue the sweeps.\n   */\n\n  public abstract endPass(pass: number): boolean;\n  /**\n   * announce the end of handling for particular chainIndex and primitiveIndex;\n   * @return true to continue outer loops.\n   */\n  public endSweeps(_chainIndex: number, _primitiveIndex: number, _componentIndex?: number): boolean { return true; }\n\n}\n/**\n * * pass 1: determine max numStroke\n * * pass 2: impose max numStroke\n * @internal\n */\nexport class StrokeCountMapVisitorApplyMaxCount extends StrokeCountMapMultipassVisitor {\n  public myMap: StrokeCountMap;\n  public constructor() {\n    super();\n    this.myMap = StrokeCountMap.createWithComponentIndex();\n  }\n  /** set up for a pass through corresponding maps. */\n  public startPass(pass: number): boolean {\n    if (pass === 0) {\n      this.myMap.numStroke = 0;\n      return true;\n    } else if (pass === 1) {\n      // nothing to change == numStroke will be applied to each primitive.\n      return true;\n    }\n    // all other pass numbers are rejected ...\n    return false;\n  }\n  /** visit one of the set of corresponding maps. */\n  public visit(pass: number, map: StrokeCountMap): boolean {\n    if (pass === 0) {\n      if (map.numStroke > this.myMap.numStroke)\n        this.myMap.numStroke = map.numStroke;\n      return true;\n    } else if (pass === 1) {\n      // apply the max from prior pass\n      map.numStroke = this.myMap.numStroke;\n      return true;\n    }\n    // no other pass values should happen -- canceled by startPass.\n    return false;\n  }\n\n  public endPass(_pass: number): boolean { return true; }\n}\n/**\n * * pass 1: determine max curveLength among maps presented.\n * * pass 2: set the a0 and a1 values to 0 and that max distance\n * @internal\n */\nexport class StrokeCountMapVisitorApplyMaxCurveLength extends StrokeCountMapMultipassVisitor {\n  public maxCurveLength: number;\n  public constructor() {\n    super();\n    this.maxCurveLength = 0.0;\n  }\n  /** set up for a pass through corresponding maps. */\n  public startPass(pass: number): boolean {\n    if (pass === 0) {\n      this.maxCurveLength = 0;\n      return true;\n    } else if (pass === 1) {\n      // nothing to change == numStroke will be applied to each primitive.\n      return true;\n    }\n    // all other pass numbers are rejected ...\n    return false;\n  }\n  /** visit one of the set of corresponding maps. */\n  public visit(pass: number, map: StrokeCountMap): boolean {\n    if (pass === 0) {\n      this.maxCurveLength = Geometry.maxXY(map.curveLength, this.maxCurveLength);\n      return true;\n    } else if (pass === 1) {\n      // apply the max from prior pass\n      map.a0 = 0.0;\n      map.a1 = this.maxCurveLength;\n      return true;\n    }\n    // no other pass values should happen -- canceled by startPass.\n    return false;\n  }\n\n  public endPass(_pass: number): boolean { return true; }\n}\n/**\n * class `StrokeCountChain` contains:\n * * `maps` = an array of `StrokeCountMap`\n * * `parent` = parent CurveCollection.\n *\n * An instance is normally created with either a `Path` or `Loop` as the parent.\n * @internal\n */\nexport class StrokeCountChain {\n  public maps: StrokeCountMap[];\n  public parent?: CurveCollection;\n  /**\n   * options are used (with different purposes) at two times:\n   * * When the StrokeCountChain is created, the options affect the stroke counts.  This is just creating markup, not actual strokes.\n   * * When actual stroking happens, the options control creation of parameters and tangents.\n   */\n  public options?: StrokeOptions;\n\n  private constructor(parent?: CurveCollection, options?: StrokeOptions) {\n    this.parent = parent;\n    this.maps = [];\n    this.options = options;\n  }\n  public static create(chain: CurveChain, options?: StrokeOptions): StrokeCountChain {\n    const result = new StrokeCountChain(chain, options);\n    result.parent = chain;\n    // A chain can only contain primitives !!!!\n    for (const p of chain.children) {\n      p.computeAndAttachRecursiveStrokeCounts(options);\n      if (p.strokeData)\n        result.maps.push(p.strokeData);\n    }\n    return result;\n  }\n  public getStrokes(): LineString3d {\n    const ls = LineString3d.create();\n    if (this.options) {\n      if (this.options.needNormals || this.options.needParams) {\n        ls.ensureEmptyFractions();\n        ls.ensureEmptyDerivatives();\n        ls.ensureEmptyUVParams();\n      }\n    }\n    for (const m of this.maps) {\n      if (m.primitive)\n        m.primitive.addMappedStrokesToLineString3D(m, ls);\n    }\n    return ls;\n\n  }\n  /** internal form of  */\n  private static applySummed01LimitsWithinArray(maps: StrokeCountMap[], incomingSum: number): number {\n    let movingSum = incomingSum;\n    for (const m of maps) {\n      m.a0 += movingSum;\n      if (m.componentData) {\n        m.a1 = this.applySummed01LimitsWithinArray(m.componentData, m.a0);\n      } else {\n        m.a1 += movingSum;\n      }\n      movingSum = m.a1;\n    }\n    return movingSum;\n  }\n  /**\n   * walk the maps in the array.\n   * * in maps with no component data\n   *   * increment map.a0 and map.a1 by the incoming distance a0\n   * * in maps with component data:\n   *   * recurse through the component array.\n   *   * increment map.a0 by the incoming a0.\n   *   * returned a1 from the componentData array becomes a1\n   * @returns upper value of a1 in final map.\n   * @param maps\n   * @param incomingSum lower value to add to a0 for first map.\n   */\n  public applySummed01Limits(incomingSum: number): number {\n    return StrokeCountChain.applySummed01LimitsWithinArray(this.maps, incomingSum);\n  }\n}\n\n/**\n * class `StrokeCountSection`\\\n * * contains an array of `StrokeCountChain`.\n * * Hence it is the internal node level of a (1-level-deep) tree of `StrokeCountChain`\n * @internal\n */\nexport class StrokeCountSection {\n  public chains: StrokeCountChain[];\n  public parent?: CurveCollection;\n  private constructor(parent?: CurveCollection) { this.parent = parent; this.chains = []; }\n  /**\n   * construct array of arrays of `StrokeCountMap`s\n   * @param parent\n   */\n  public static create(parent: CurveCollection, options?: StrokeOptions): StrokeCountSection {\n    const result = new StrokeCountSection(parent);\n    const appendCurveChain = (chain: CurveChain) => result.chains.push(StrokeCountChain.create(chain, options));\n    const appendParityRegion = (region: ParityRegion) => { for (const child of region.children) appendCurveChain(child); }\n    if (parent instanceof UnionRegion) {\n      for (const child of parent.children) {\n        if (child instanceof ParityRegion)\n          appendParityRegion(child);\n        else\n          appendCurveChain(child);\n      }\n    } else if (parent instanceof ParityRegion) {\n      appendParityRegion(parent);\n    } else if (parent instanceof CurveChain) {\n      appendCurveChain(parent);\n    }\n    return result;\n  }\n  /** test if all sections have the same structure. */\n  public static areSectionsCompatible(sections: StrokeCountSection[], enforceCounts: boolean): boolean {\n    if (sections.length < 2)\n      return true;  // hm.. don't know if that is useful, but nothing to check here.\n    const numChains = sections[0].chains.length;\n    for (let i = 1; i < sections.length; i++) {\n      // first level: must match number of paths or loops\n      if (sections[i].chains.length !== numChains)\n        return false;\n      // second level: must have same number of primitives in each path or loop\n      for (let j = 0; j < sections[0].chains.length; j++) {\n        const numPrimitive = sections[0].chains[j].maps.length;\n        if (sections[i].chains[j].maps.length !== numPrimitive)\n          return false;\n        for (let k = 0; k < numPrimitive; k++) {\n          if (!sections[0].chains[j].maps[k].isCompatibleComponentStructure(sections[i].chains[j].maps[k], enforceCounts))\n            return false;\n        }\n      }\n\n    }\n    return true;\n  }\n\n  /** Within each section, sweep accumulate curveLength field, recording entry and exit sum in each map.\n   * * In expected use, (a0,a1) are (0,a) where a is the (previously computed) max length among corresponding maps up and down the section arrays.\n   */\n  public static remapa0a1WithinEachChain(sections: StrokeCountSection[]) {\n    for (const section of sections) {\n      for (const chain of section.chains) {\n        chain.applySummed01Limits(0.0);\n      }\n    }\n  }\n\n  private static applyMultipassVisitorCallbackNoComponents(sections: StrokeCountSection[], chainIndex: number, primitiveIndex: number,\n    componentIndex: number | undefined, callback: StrokeCountMapMultipassVisitor) {\n    const numSection = sections.length;\n    if (!callback.startSweeps(chainIndex, primitiveIndex, componentIndex)) return false;\n    if (componentIndex === undefined) {\n      // there are corresponding primitives directly at the section, chain, primitive index:\n      for (let pass = 0; ; pass++) {\n        if (!callback.startPass(pass))\n          break;\n        for (let sectionIndex = 0; sectionIndex < numSection; sectionIndex++)\n          if (!callback.visit(pass, sections[sectionIndex].chains[chainIndex].maps[primitiveIndex]))\n            return false;\n        if (!callback.endPass(pass))\n          return false;\n      }\n    } else {\n      // there are corresponding primitives at the section, chain, primitive,componentIndex\n      // there are corresponding primitives directly at the section, chain, primitive index:\n      for (let pass = 0; ; pass++) {\n        if (!callback.startPass(pass))\n          break;\n        for (let sectionIndex = 0; sectionIndex < numSection; sectionIndex++)\n          if (!callback.visit(pass, sections[sectionIndex].chains[chainIndex].maps[primitiveIndex].componentData![componentIndex]))\n            return false;\n        if (!callback.endPass(pass))\n          return false;\n      }\n\n    }\n    if (!callback.endSweeps(chainIndex, primitiveIndex, componentIndex)) return false;\n    return true;\n  }\n\n  /**\n   * Walk through the sections, emitting callbacks delimiting groups of corresponding primitives.\n   * @param sections array of sections (possibly a single path or loop at each section, or possibly a set of parity loops.)\n   * @param callback object to be notified during the traversal\n   */\n  public static runMultiPassVisitorAtCorrespondingPrimitives(sections: StrokeCountSection[], callback: StrokeCountMapMultipassVisitor): boolean {\n    const numChainPerSection = sections[0].chains.length;\n    for (let chainIndex = 0; chainIndex < numChainPerSection; chainIndex++) {\n      const numPrimitive = sections[0].chains[chainIndex].maps.length;\n      for (let primitiveIndex = 0; primitiveIndex < numPrimitive; primitiveIndex++) {\n        const numComponent = sections[0].chains[chainIndex].maps[primitiveIndex].componentData?.length ?? 0;\n        if (numComponent > 0) {\n          for (let i = 0; i < numComponent; i++) {\n            if (!this.applyMultipassVisitorCallbackNoComponents(sections, chainIndex, primitiveIndex, i, callback))\n              return false;\n          }\n        } else {\n          if (!this.applyMultipassVisitorCallbackNoComponents(sections, chainIndex, primitiveIndex, undefined, callback))\n            return false;\n        }\n      }\n    }\n    return true;\n  }\n\n  /**\n   * * Confirm that all sections in the array have the same structure.\n   * * Within each corresponding set of entries, apply the max count to all.\n   * @param sections array of per-section stroke count entries\n   */\n  public static enforceStrokeCountCompatibility(sections: StrokeCountSection[]): boolean {\n\n    if (sections.length < 2)\n      return true;\n    if (!StrokeCountSection.areSectionsCompatible(sections, false))\n      return false;\n    const visitor = new StrokeCountMapVisitorApplyMaxCount();\n    this.runMultiPassVisitorAtCorrespondingPrimitives(sections, visitor);\n    return true;\n\n  }\n  /**\n   * * Confirm that all sections in the array have the same structure.\n   * * Within each corresponding set of entries up and down the sections, set curveLength as the maximum of the respective curve lengths.\n   * * Along each section, sum curveLengths (which were just reset) to get consistent along-chain parameters\n   * @param sections array of per-section stroke count entries\n   */\n  public static enforceCompatibleDistanceSums(sections: StrokeCountSection[]): boolean {\n\n    if (sections.length < 2)\n      return true;\n    if (!StrokeCountSection.areSectionsCompatible(sections, false))\n      return false;\n    const visitor = new StrokeCountMapVisitorApplyMaxCurveLength();\n    this.runMultiPassVisitorAtCorrespondingPrimitives(sections, visitor);\n    this.remapa0a1WithinEachChain(sections);\n    return true;\n\n  }\n\n  /**\n   * Return stroked form of the section.\n   */\n  public getStrokes(): AnyCurve {\n    if (this.chains.length === 1) {\n      return this.chains[0].getStrokes();\n    } else {\n      const region = ParityRegion.create();\n      for (const c of this.chains) {\n        const strokes = c.getStrokes();\n        if (strokes instanceof LineString3d)\n          region.tryAddChild(Loop.create(strokes));\n      }\n      return region;\n    }\n  }\n  /**\n   * Given two compatible stroke sets (as returned by getStrokes) extend a range\n   * with the distances between corresponding points.\n   * * Each set of strokes may be:\n   *   * linestring\n   *   * ParityRegion\n   *   * CurveChain (Loop or Path)\n   * @param strokeA first set of strokes\n   * @param strokeB second set of strokes\n   * @param rangeToExtend caller-allocated range to be extended.\n   * @returns true if structures are compatible.\n   */\n  public static extendDistanceRangeBetweenStrokes(strokeA: AnyCurve, strokeB: AnyCurve, rangeToExtend: Range1d): boolean {\n    if (strokeA instanceof LineString3d) {\n      if (strokeB instanceof LineString3d) {\n        if (strokeA.numPoints() === strokeB.numPoints()) {\n          const n = strokeA.numPoints();\n          const pointA = Point3d.create();\n          const pointB = Point3d.create();\n          const allPointA = strokeA.packedPoints;\n          const allPointB = strokeB.packedPoints;\n\n          for (let i = 0; i < n; i++) {\n            allPointA.getPoint3dAtCheckedPointIndex(i, pointA);\n            allPointB.getPoint3dAtCheckedPointIndex(i, pointB);\n            rangeToExtend.extendX(pointA.distance(pointB));\n          }\n          return true;\n        }\n      }\n    } else if (strokeA instanceof ParityRegion) {\n      if (strokeB instanceof ParityRegion) {\n        const childrenA = strokeA.children;\n        const childrenB = strokeB.children;\n        const n = childrenA.length;\n        if (n === childrenB.length) {\n          for (let i = 0; i < n; i++) {\n            if (!this.extendDistanceRangeBetweenStrokes(childrenA[i], childrenB[i], rangeToExtend))\n              return false;\n          }\n          return true;\n        }\n      }\n    } else if (strokeA instanceof CurveChain) {\n      if (strokeB instanceof CurveChain) {\n        const childrenA = strokeA.children;\n        const childrenB = strokeB.children;\n        const n = childrenA.length;\n        if (n === childrenB.length) {\n          for (let i = 0; i < n; i++) {\n            if (!this.extendDistanceRangeBetweenStrokes(childrenA[i], childrenB[i], rangeToExtend))\n              return false;\n          }\n          return true;\n        }\n      }\n    }\n    return false;\n  }\n}\n"]}

package/lib/esm/curve/Query/StrokeCountMap.js.map

@@ -1 +1 @@
-{"version":3,"file":"StrokeCountMap.js","sourceRoot":"","sources":["../../../../src/curve/Query/StrokeCountMap.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAG1C;;;;;;;;;;;;GAYG;AACH,MAAM,OAAO,cAAc;IACzB,mDAAmD;IAC5C,SAAS,CAAS;IACzB,oCAAoC;IAC7B,WAAW,CAAS;IAC3B,6FAA6F;IACtF,EAAE,CAAS;IAClB,2FAA2F;IACpF,EAAE,CAAS;IAClB,oGAAoG;IAC7F,aAAa,CAAoB;IACxC,yCAAyC;IAClC,SAAS,CAAkB;IAClC,4CAA4C;IACrC,cAAc,CAAU;IAC/B;;;;;;;;;OASG;IACH,YAAoB,SAAiB,EAAE,WAAmB,EAAE,EAAU,EAAE,EAAU,EAAE,aAAgC;QAClH,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC3B,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC;QAC/B,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC;QACb,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC;QACb,IAAI,CAAC,aAAa,GAAG,aAAa,CAAC;IACrC,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,wBAAwB,CACpC,SAAyB,EAAE,SAAiB,EAAE,WAAmB,EAAE,EAAU,EAAE,EAAU,EAAE,aAAgC;QAE3H,MAAM,MAAM,GAAG,IAAI,cAAc,CAAC,SAAS,EAAE,WAAW,EAAE,EAAE,EAAE,EAAE,EAAE,aAAa,CAAC,CAAC;QACjF,MAAM,CAAC,SAAS,GAAG,SAAS,CAAC;QAC7B,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;;;OAOG;IACI,MAAM,CAAC,wBAAwB,CACpC,iBAAyB,CAAC,EAAE,YAAoB,CAAC,EAAE,cAAsB,CAAC,EAAE,KAAa,CAAC,EAAE,KAAa,CAAC;QAE1G,MAAM,MAAM,GAAG,IAAI,cAAc,CAAC,SAAS,EAAE,WAAW,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QAClE,MAAM,CAAC,cAAc,GAAG,cAAc,CAAC;QACvC,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;;OAMG;IACI,MAAM,CAAC,yCAAyC,CACrD,cAA8B,EAAE,SAA0B,EAAE,aAAgC;QAE5F,MAAM,EAAE,GAAG,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC;QAC1C,MAAM,MAAM,GAAG,IAAI,cAAc,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,aAAa,CAAC,CAAC;QAC/D,MAAM,CAAC,SAAS,GAAG,cAAc,CAAC;QAClC,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;;OAMG;IACI,mBAAmB,CAAC,SAAiB,EAAE,WAAmB;QAC/D,MAAM,EAAE,GAAG,IAAI,CAAC,EAAE,GAAG,WAAW,CAAC;QACjC,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;YACvB,IAAI,CAAC,aAAa,CAAC,IAAI,CACrB,IAAI,cAAc,CAAC,SAAS,EAAE,WAAW,EAAE,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;QAC7D,CAAC;QACD,IAAI,CAAC,SAAS,IAAI,SAAS,CAAC;QAC5B,IAAI,CAAC,WAAW,IAAI,WAAW,CAAC;QAChC,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC;IACf,CAAC;IACD;;;OAGG;IACI,8BAA8B,CAAC,KAAqB,EAAE,aAAsB;QACjF,IAAI,aAAa,IAAI,IAAI,CAAC,SAAS,KAAK,KAAK,CAAC,SAAS;YACrD,OAAO,KAAK,CAAC;QACf,IAAI,IAAI,CAAC,aAAa,KAAK,SAAS,IAAI,KAAK,CAAC,aAAa,KAAK,SAAS;YACvE,OAAO,IAAI,CAAC;QACd,IAAI,IAAI,CAAC,aAAa,IAAI,KAAK,CAAC,aAAa,EAAE,CAAC;YAC9C,uCAAuC;YACvC,IAAI,IAAI,CAAC,aAAa,CAAC,MAAM,KAAK,KAAK,CAAC,aAAa,CAAC,MAAM;gBAC1D,OAAO,KAAK,CAAC;YACf,MAAM,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC;YACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;gBACxB,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,8BAA8B,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,aAAa,CAAC;oBAC9F,OAAO,KAAK,CAAC;YACjB,OAAO,IAAI,CAAC;QACd,CAAC;QACD,wCAAwC;QACxC,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;OAGG;IACI,KAAK;QACV,MAAM,CAAC,GAAG,IAAI,cAAc,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,WAAW,EAAE,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC;QACjF,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;YACvB,CAAC,CAAC,aAAa,GAAG,EAAE,CAAC;YACrB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,aAAa;gBACpC,CAAC,CAAC,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC;QACxC,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC;IACD;;;OAGG;IACI,WAAW,CAAC,QAAgB;QACjC,OAAO,QAAQ,CAAC,WAAW,CAAC,IAAI,CAAC,EAAE,EAAE,QAAQ,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC;IAC1D,CAAC;CACF","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n/** @packageDocumentation\r\n * @module Curve\r\n */\r\n\r\nimport { Geometry } from \"../../Geometry\";\r\nimport { CurvePrimitive } from \"../CurvePrimitive\";\r\n\r\n/**\r\n * Data carrier interface for per-primitive stroke counts and distances used by PolyfaceBuilder.\r\n * * For a simple primitive (line segment or arc) that is stroked with uniform fraction, the members are:\r\n *   * `numStroke` = total number of strokes\r\n *   * `curveLength` = length of this curve\r\n *   * `a0` = external mapped coordinate for fraction 0 on this primitive or component\r\n *   * `a1` = external mapped coordinate for fraction 1 on this primitive or component\r\n *\r\n * * For linestring and bspline curve, those numbers are totals for the overall curve, and breakdown within\r\n * the components (line segments or bezier spans) is recorded on the optional array `componentData[]`\r\n *   * Members of the array are annotated with componentIndex within the linestring or bspline curve\r\n * @public\r\n */\r\nexport class StrokeCountMap {\r\n  /** Number of strokes expected in this interval. */\r\n  public numStroke: number;\r\n  /** Length of the curve interval. */\r\n  public curveLength: number;\r\n  /** Start coordinate (in user-defined space) for fraction 0 on this primitive or component */\r\n  public a0: number;\r\n  /** End coordinate (in user-defined space) for fraction 0 on this primitive or component */\r\n  public a1: number;\r\n  /** Further StrokeCountMap's within this interval (e.g. for individual segments of a linestring.) */\r\n  public componentData?: StrokeCountMap[];\r\n  /** The curve that this map represents */\r\n  public primitive?: CurvePrimitive;\r\n  /** This curve's index within its parent. */\r\n  public componentIndex?: number;\r\n  /**\r\n   * Constructor.  Initialize all fields from arguments.\r\n   * * Callers that expect to announce numStroke and curveLength for multiple components send an empty componentData array.\r\n   * * Callers that do not have multiple components send undefined component data.\r\n   * @param numStroke\r\n   * @param curveLength\r\n   * @param a0\r\n   * @param a1\r\n   * @param componentData\r\n   */\r\n  private constructor(numStroke: number, curveLength: number, a0: number, a1: number, componentData?: StrokeCountMap[]) {\r\n    this.numStroke = numStroke;\r\n    this.curveLength = curveLength;\r\n    this.a0 = a0;\r\n    this.a1 = a1;\r\n    this.componentData = componentData;\r\n  }\r\n  /**\r\n   * Create a `StrokeCountMap` with curve primitive and optional componentData array.\r\n   * @param primitive\r\n   * @param numStroke\r\n   * @param curveLength\r\n   * @param a0\r\n   * @param a1\r\n   * @param componentData\r\n   */\r\n  public static createWithCurvePrimitive(\r\n    primitive: CurvePrimitive, numStroke: number, curveLength: number, a0: number, a1: number, componentData?: StrokeCountMap[],\r\n  ): StrokeCountMap {\r\n    const result = new StrokeCountMap(numStroke, curveLength, a0, a1, componentData);\r\n    result.primitive = primitive;\r\n    return result;\r\n  }\r\n  /**\r\n   * Create a `StrokeCountMap` with `componentIndex` (but no primitive or componentData array)\r\n   * @param index\r\n   * @param numStroke\r\n   * @param curveLength\r\n   * @param a0\r\n   * @param a1\r\n   */\r\n  public static createWithComponentIndex(\r\n    componentIndex: number = 0, numStroke: number = 0, curveLength: number = 0, a0: number = 0, a1: number = 0,\r\n  ): StrokeCountMap {\r\n    const result = new StrokeCountMap(numStroke, curveLength, a0, a1);\r\n    result.componentIndex = componentIndex;\r\n    return result;\r\n  }\r\n  /**\r\n   * Create a StrokeCountMap, optionally\r\n   * * (a) use parent a1 as new a0\r\n   * * (b) attach a (usually empty) array for component counts.\r\n   * @param parentMap optional map whose a1 becomes a0 in the new map.\r\n   * @param componentData optional array of component StrokeCountMaps.\r\n   */\r\n  public static createWithCurvePrimitiveAndOptionalParent(\r\n    curvePrimitive: CurvePrimitive, parentMap?: StrokeCountMap, componentData?: StrokeCountMap[],\r\n  ): StrokeCountMap {\r\n    const a0 = parentMap ? parentMap.a1 : 0.0;\r\n    const result = new StrokeCountMap(0, 0, a0, a0, componentData);\r\n    result.primitive = curvePrimitive;\r\n    return result;\r\n  }\r\n  /**\r\n   * Apply stroke count and curve length from a component to a parent map.\r\n   * If componentData is present, install the new count and length with distance limits\r\n   * @param parentMap map to be updated.\r\n   * @param numStroke number of strokes on new child curve\r\n   * @param curveLength curve length for new child curve.\r\n   */\r\n  public addToCountAndLength(numStroke: number, curveLength: number): void {\r\n    const a2 = this.a1 + curveLength;\r\n    if (this.componentData) {\r\n      this.componentData.push(\r\n        new StrokeCountMap(numStroke, curveLength, this.a1, a2));\r\n    }\r\n    this.numStroke += numStroke;\r\n    this.curveLength += curveLength;\r\n    this.a1 = a2;\r\n  }\r\n  /**\r\n   * Return true if `other` has the same component structure as `this`\r\n   * * Testing recurses through corresponding members of componentData arrays.\r\n   */\r\n  public isCompatibleComponentStructure(other: StrokeCountMap, enforceCounts: boolean): boolean {\r\n    if (enforceCounts && this.numStroke !== other.numStroke)\r\n      return false;\r\n    if (this.componentData === undefined && other.componentData === undefined)\r\n      return true;\r\n    if (this.componentData && other.componentData) {\r\n      // both have components. Recurse . . ..\r\n      if (this.componentData.length !== other.componentData.length)\r\n        return false;\r\n      const n = this.componentData.length;\r\n      for (let i = 0; i < n; i++)\r\n        if (!this.componentData[i].isCompatibleComponentStructure(other.componentData[i], enforceCounts))\r\n          return false;\r\n      return true;\r\n    }\r\n    // one has componentData, the other not.\r\n    return false;\r\n  }\r\n  /**\r\n   * Clone all data from root.\r\n   * * clone componentData arrays recursively.\r\n   */\r\n  public clone(): StrokeCountMap {\r\n    const a = new StrokeCountMap(this.numStroke, this.curveLength, this.a0, this.a1);\r\n    if (this.componentData) {\r\n      a.componentData = [];\r\n      for (const child of this.componentData)\r\n        a.componentData.push(child.clone());\r\n    }\r\n    return a;\r\n  }\r\n  /**\r\n   * Interpolate in the a0,a1 mapping.\r\n   * @param fraction fractional position between a0 and a1\r\n   */\r\n  public fractionToA(fraction: number) {\r\n    return Geometry.interpolate(this.a0, fraction, this.a1);\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"StrokeCountMap.js","sourceRoot":"","sources":["../../../../src/curve/Query/StrokeCountMap.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAG1C;;;;;;;;;;;;GAYG;AACH,MAAM,OAAO,cAAc;IACzB,mDAAmD;IAC5C,SAAS,CAAS;IACzB,oCAAoC;IAC7B,WAAW,CAAS;IAC3B,6FAA6F;IACtF,EAAE,CAAS;IAClB,2FAA2F;IACpF,EAAE,CAAS;IAClB,oGAAoG;IAC7F,aAAa,CAAoB;IACxC,yCAAyC;IAClC,SAAS,CAAkB;IAClC,4CAA4C;IACrC,cAAc,CAAU;IAC/B;;;;;;;;;OASG;IACH,YAAoB,SAAiB,EAAE,WAAmB,EAAE,EAAU,EAAE,EAAU,EAAE,aAAgC;QAClH,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC3B,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC;QAC/B,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC;QACb,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC;QACb,IAAI,CAAC,aAAa,GAAG,aAAa,CAAC;IACrC,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,wBAAwB,CACpC,SAAyB,EAAE,SAAiB,EAAE,WAAmB,EAAE,EAAU,EAAE,EAAU,EAAE,aAAgC;QAE3H,MAAM,MAAM,GAAG,IAAI,cAAc,CAAC,SAAS,EAAE,WAAW,EAAE,EAAE,EAAE,EAAE,EAAE,aAAa,CAAC,CAAC;QACjF,MAAM,CAAC,SAAS,GAAG,SAAS,CAAC;QAC7B,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;;;OAOG;IACI,MAAM,CAAC,wBAAwB,CACpC,iBAAyB,CAAC,EAAE,YAAoB,CAAC,EAAE,cAAsB,CAAC,EAAE,KAAa,CAAC,EAAE,KAAa,CAAC;QAE1G,MAAM,MAAM,GAAG,IAAI,cAAc,CAAC,SAAS,EAAE,WAAW,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QAClE,MAAM,CAAC,cAAc,GAAG,cAAc,CAAC;QACvC,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;;OAMG;IACI,MAAM,CAAC,yCAAyC,CACrD,cAA8B,EAAE,SAA0B,EAAE,aAAgC;QAE5F,MAAM,EAAE,GAAG,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC;QAC1C,MAAM,MAAM,GAAG,IAAI,cAAc,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,aAAa,CAAC,CAAC;QAC/D,MAAM,CAAC,SAAS,GAAG,cAAc,CAAC;QAClC,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;;OAMG;IACI,mBAAmB,CAAC,SAAiB,EAAE,WAAmB;QAC/D,MAAM,EAAE,GAAG,IAAI,CAAC,EAAE,GAAG,WAAW,CAAC;QACjC,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;YACvB,IAAI,CAAC,aAAa,CAAC,IAAI,CACrB,IAAI,cAAc,CAAC,SAAS,EAAE,WAAW,EAAE,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;QAC7D,CAAC;QACD,IAAI,CAAC,SAAS,IAAI,SAAS,CAAC;QAC5B,IAAI,CAAC,WAAW,IAAI,WAAW,CAAC;QAChC,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC;IACf,CAAC;IACD;;;OAGG;IACI,8BAA8B,CAAC,KAAqB,EAAE,aAAsB;QACjF,IAAI,aAAa,IAAI,IAAI,CAAC,SAAS,KAAK,KAAK,CAAC,SAAS;YACrD,OAAO,KAAK,CAAC;QACf,IAAI,IAAI,CAAC,aAAa,KAAK,SAAS,IAAI,KAAK,CAAC,aAAa,KAAK,SAAS;YACvE,OAAO,IAAI,CAAC;QACd,IAAI,IAAI,CAAC,aAAa,IAAI,KAAK,CAAC,aAAa,EAAE,CAAC;YAC9C,uCAAuC;YACvC,IAAI,IAAI,CAAC,aAAa,CAAC,MAAM,KAAK,KAAK,CAAC,aAAa,CAAC,MAAM;gBAC1D,OAAO,KAAK,CAAC;YACf,MAAM,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC;YACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;gBACxB,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,8BAA8B,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,aAAa,CAAC;oBAC9F,OAAO,KAAK,CAAC;YACjB,OAAO,IAAI,CAAC;QACd,CAAC;QACD,wCAAwC;QACxC,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;OAGG;IACI,KAAK;QACV,MAAM,CAAC,GAAG,IAAI,cAAc,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,WAAW,EAAE,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC;QACjF,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;YACvB,CAAC,CAAC,aAAa,GAAG,EAAE,CAAC;YACrB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,aAAa;gBACpC,CAAC,CAAC,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC;QACxC,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC;IACD;;;OAGG;IACI,WAAW,CAAC,QAAgB;QACjC,OAAO,QAAQ,CAAC,WAAW,CAAC,IAAI,CAAC,EAAE,EAAE,QAAQ,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC;IAC1D,CAAC;CACF","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n/** @packageDocumentation\n * @module Curve\n */\n\nimport { Geometry } from \"../../Geometry\";\nimport { CurvePrimitive } from \"../CurvePrimitive\";\n\n/**\n * Data carrier interface for per-primitive stroke counts and distances used by PolyfaceBuilder.\n * * For a simple primitive (line segment or arc) that is stroked with uniform fraction, the members are:\n *   * `numStroke` = total number of strokes\n *   * `curveLength` = length of this curve\n *   * `a0` = external mapped coordinate for fraction 0 on this primitive or component\n *   * `a1` = external mapped coordinate for fraction 1 on this primitive or component\n *\n * * For linestring and bspline curve, those numbers are totals for the overall curve, and breakdown within\n * the components (line segments or bezier spans) is recorded on the optional array `componentData[]`\n *   * Members of the array are annotated with componentIndex within the linestring or bspline curve\n * @public\n */\nexport class StrokeCountMap {\n  /** Number of strokes expected in this interval. */\n  public numStroke: number;\n  /** Length of the curve interval. */\n  public curveLength: number;\n  /** Start coordinate (in user-defined space) for fraction 0 on this primitive or component */\n  public a0: number;\n  /** End coordinate (in user-defined space) for fraction 0 on this primitive or component */\n  public a1: number;\n  /** Further StrokeCountMap's within this interval (e.g. for individual segments of a linestring.) */\n  public componentData?: StrokeCountMap[];\n  /** The curve that this map represents */\n  public primitive?: CurvePrimitive;\n  /** This curve's index within its parent. */\n  public componentIndex?: number;\n  /**\n   * Constructor.  Initialize all fields from arguments.\n   * * Callers that expect to announce numStroke and curveLength for multiple components send an empty componentData array.\n   * * Callers that do not have multiple components send undefined component data.\n   * @param numStroke\n   * @param curveLength\n   * @param a0\n   * @param a1\n   * @param componentData\n   */\n  private constructor(numStroke: number, curveLength: number, a0: number, a1: number, componentData?: StrokeCountMap[]) {\n    this.numStroke = numStroke;\n    this.curveLength = curveLength;\n    this.a0 = a0;\n    this.a1 = a1;\n    this.componentData = componentData;\n  }\n  /**\n   * Create a `StrokeCountMap` with curve primitive and optional componentData array.\n   * @param primitive\n   * @param numStroke\n   * @param curveLength\n   * @param a0\n   * @param a1\n   * @param componentData\n   */\n  public static createWithCurvePrimitive(\n    primitive: CurvePrimitive, numStroke: number, curveLength: number, a0: number, a1: number, componentData?: StrokeCountMap[],\n  ): StrokeCountMap {\n    const result = new StrokeCountMap(numStroke, curveLength, a0, a1, componentData);\n    result.primitive = primitive;\n    return result;\n  }\n  /**\n   * Create a `StrokeCountMap` with `componentIndex` (but no primitive or componentData array)\n   * @param index\n   * @param numStroke\n   * @param curveLength\n   * @param a0\n   * @param a1\n   */\n  public static createWithComponentIndex(\n    componentIndex: number = 0, numStroke: number = 0, curveLength: number = 0, a0: number = 0, a1: number = 0,\n  ): StrokeCountMap {\n    const result = new StrokeCountMap(numStroke, curveLength, a0, a1);\n    result.componentIndex = componentIndex;\n    return result;\n  }\n  /**\n   * Create a StrokeCountMap, optionally\n   * * (a) use parent a1 as new a0\n   * * (b) attach a (usually empty) array for component counts.\n   * @param parentMap optional map whose a1 becomes a0 in the new map.\n   * @param componentData optional array of component StrokeCountMaps.\n   */\n  public static createWithCurvePrimitiveAndOptionalParent(\n    curvePrimitive: CurvePrimitive, parentMap?: StrokeCountMap, componentData?: StrokeCountMap[],\n  ): StrokeCountMap {\n    const a0 = parentMap ? parentMap.a1 : 0.0;\n    const result = new StrokeCountMap(0, 0, a0, a0, componentData);\n    result.primitive = curvePrimitive;\n    return result;\n  }\n  /**\n   * Apply stroke count and curve length from a component to a parent map.\n   * If componentData is present, install the new count and length with distance limits\n   * @param parentMap map to be updated.\n   * @param numStroke number of strokes on new child curve\n   * @param curveLength curve length for new child curve.\n   */\n  public addToCountAndLength(numStroke: number, curveLength: number): void {\n    const a2 = this.a1 + curveLength;\n    if (this.componentData) {\n      this.componentData.push(\n        new StrokeCountMap(numStroke, curveLength, this.a1, a2));\n    }\n    this.numStroke += numStroke;\n    this.curveLength += curveLength;\n    this.a1 = a2;\n  }\n  /**\n   * Return true if `other` has the same component structure as `this`\n   * * Testing recurses through corresponding members of componentData arrays.\n   */\n  public isCompatibleComponentStructure(other: StrokeCountMap, enforceCounts: boolean): boolean {\n    if (enforceCounts && this.numStroke !== other.numStroke)\n      return false;\n    if (this.componentData === undefined && other.componentData === undefined)\n      return true;\n    if (this.componentData && other.componentData) {\n      // both have components. Recurse . . ..\n      if (this.componentData.length !== other.componentData.length)\n        return false;\n      const n = this.componentData.length;\n      for (let i = 0; i < n; i++)\n        if (!this.componentData[i].isCompatibleComponentStructure(other.componentData[i], enforceCounts))\n          return false;\n      return true;\n    }\n    // one has componentData, the other not.\n    return false;\n  }\n  /**\n   * Clone all data from root.\n   * * clone componentData arrays recursively.\n   */\n  public clone(): StrokeCountMap {\n    const a = new StrokeCountMap(this.numStroke, this.curveLength, this.a0, this.a1);\n    if (this.componentData) {\n      a.componentData = [];\n      for (const child of this.componentData)\n        a.componentData.push(child.clone());\n    }\n    return a;\n  }\n  /**\n   * Interpolate in the a0,a1 mapping.\n   * @param fraction fractional position between a0 and a1\n   */\n  public fractionToA(fraction: number) {\n    return Geometry.interpolate(this.a0, fraction, this.a1);\n  }\n}\n"]}

package/lib/esm/curve/RegionMomentsXY.js.map

@@ -1 +1 @@
-{"version":3,"file":"RegionMomentsXY.js","sourceRoot":"","sources":["../../../src/curve/RegionMomentsXY.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAU/F,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAC5C,OAAO,EAAE,mBAAmB,EAAE,MAAM,+BAA+B,CAAC;AACpE,OAAO,EAAE,OAAO,EAAE,MAAM,+BAA+B,CAAC;AACxD,OAAO,EAAE,UAAU,EAAE,MAAM,0BAA0B,CAAC;AAKtD,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAC9C,OAAO,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAC9B,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAC9C,OAAO,EAAE,kBAAkB,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AAE5D,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAGhD;;;GAGG;AACH,MAAM,OAAO,eAAgB,SAAQ,mBAAmB;IAC9C,iBAAiB,CAAc;IAC/B,OAAO,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;IAC3B,OAAO,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;IACnC;;;;OAIG;IACa,WAAW,CAAC,GAAU;QACpC,MAAM,UAAU,GAAG,IAAI,CAAC,iBAAkB,CAAC;QAC3C,MAAM,YAAY,GAAG,GAAG,CAAC,KAAK,CAAC,YAAY,CAAC;QAC5C,MAAM,YAAY,GAAG,YAAY,GAAG,GAAG,CAAC;QACxC,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;QAC/B,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;QAC/B,IAAI,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;QAChC,IAAI,KAAK,CAAC,mBAAmB,CAAC,YAAY,CAAC,EAAE,CAAC;YAC5C,CAAC,GAAG,GAAG,CAAC;YACR,CAAC,GAAG,CAAC,GAAG,CAAC;YACT,EAAE,GAAG,GAAG,CAAC;QACX,CAAC;QACD,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,YAAY,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QACrD,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACrB,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;QACnB,MAAM,IAAI,GAAG,GAAG,GAAG,CAAC,YAAY,GAAG,EAAE,CAAC,CAAC;QACvC,MAAM,SAAS,GAAG,IAAI,GAAG,IAAI,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC;QAChD,MAAM,UAAU,GAAG,IAAI,GAAG,IAAI,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;QAC3C,MAAM,SAAS,GAAG,UAAU,GAAG,GAAG,GAAG,EAAE,GAAG,CAAC,GAAG,GAAG,IAAI,CAAC,CAAC;QACvD,MAAM,SAAS,GAAG,SAAS,CAAC;QAC5B,MAAM,SAAS,GAAG,SAAS,CAAC;QAC5B,MAAM,gBAAgB,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,YAAY,GAAG,EAAE,CAAC,CAAC,CAAC;QACvE,MAAM,UAAU,GAAG,GAAG,CAAC,KAAK,CAAC,iBAAiB,CAAC,GAAG,CAAC,CAAC;QACpD,MAAM,YAAY,GAAG,GAAG,CAAC,qBAAqB,CAAC,UAAU,CAAC,CAAC;QAC3D,MAAM,QAAQ,GAAG,YAAY,CAAC,MAAM,CAAC,UAAU,CAAC,YAAY,CAAC,OAAO,EAAE,gBAAgB,CAAC,CAAC;QACxF,UAAU,CAAC,qCAAqC,CAC9C,SAAS,EAAE,GAAG,EAAE,SAAS,EAAE,IAAI,EAAE,QAAQ,EAAE,YAAY,CAAC,OAAO,EAAE,YAAY,CAAC,OAAO,CACtF,CAAC;QACF,MAAM,MAAM,GAAG,GAAG,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC;QACxC,MAAM,MAAM,GAAG,GAAG,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC;QACxC,UAAU,CAAC,2BAA2B,CAAC,SAAS,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;IACpE,CAAC;IACD,6FAA6F;IAC7E,kBAAkB,CAAC,EAAgB;QACjD,MAAM,UAAU,GAAG,IAAI,CAAC,iBAAkB,CAAC;QAC3C,UAAU,CAAC,uCAAuC,CAAC,SAAS,EAAE,EAAE,CAAC,YAAY,CAAC,CAAC;IACjF,CAAC;IACD,4FAA4F;IAC5E,mBAAmB,CAAC,OAAsB;QACxD,MAAM,UAAU,GAAG,IAAI,CAAC,iBAAkB,CAAC;QAC3C,OAAO,CAAC,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACjC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC/B,UAAU,CAAC,2BAA2B,CAAC,SAAS,EAAE,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;IAChF,CAAC;IACD,sEAAsE;IACtD,UAAU,CAAC,IAAU;QACnC,MAAM,UAAU,GAAG,IAAI,CAAC,iBAAiB,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC;QAChE,UAAU,CAAC,UAAU,GAAG,KAAK,CAAC;QAC9B,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ;YAC/B,KAAK,CAAC,yBAAyB,CAAC,IAAI,CAAC,CAAC;QACxC,IAAI,CAAC,iBAAiB,GAAG,SAAS,CAAC;QACnC,OAAO,UAAU,CAAC;IACpB,CAAC;IACO,eAAe,CAAC,MAAiB;QACvC,2FAA2F;QAC3F,MAAM,MAAM,GAAG,SAAS,CAAC,eAAe,CAAC,MAAM,EAAE,SAAS,EAAE,kBAAkB,CAAC,KAAK,CAAC,CAAC;QACtF,IAAI,CAAC,MAAM;YACT,OAAO,SAAS,CAAC;QACnB,IAAI,MAAM,YAAY,IAAI;YACxB,OAAO,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;QACjC,MAAM,aAAa,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC;QAC1C,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC;YACpC,MAAM,YAAY,GAAG,KAAK,CAAC,yBAAyB,CAAC,IAAI,CAA2B,CAAC;YACrF,IAAI,YAAY,EAAE,CAAC;gBACjB,0DAA0D;gBAC1D,MAAM,KAAK,GAAG,CAAC,MAAM,YAAY,YAAY,IAAI,YAAY,CAAC,WAAW,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;gBAC5F,MAAM,KAAK,GAAG,YAAY,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;gBAC7C,aAAa,CAAC,kBAAkB,CAAC,YAAY,EAAE,KAAK,CAAC,CAAC;YACxD,CAAC;QACH,CAAC;QACD,OAAO,aAAa,CAAC;IACvB,CAAC;IACD,+EAA+E;IAC/D,kBAAkB,CAAC,MAAoB;QACrD,OAAO,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC;IACtC,CAAC;IACD,8EAA8E;IAC9D,iBAAiB,CAAC,MAAmB;QACnD,OAAO,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC;IACtC,CAAC;IAEO,cAAc,CAAiB,CAAC,uCAAuC;IACvE,gBAAgB;QACtB,IAAI,IAAI,CAAC,cAAc;YACrB,OAAO,IAAI,CAAC,cAAc,CAAC;QAC7B,MAAM,OAAO,GAAG,aAAa,CAAC,eAAe,EAAE,CAAC;QAChD,gEAAgE;QAChE,OAAO,CAAC,QAAQ,GAAG,KAAK,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC;QAC5C,IAAI,CAAC,cAAc,GAAG,OAAO,CAAC;QAC9B,OAAO,OAAO,CAAC;IACjB,CAAC;IACD;;;OAGG;IACI,oBAAoB,CAAC,EAAkB;QAC5C,MAAM,OAAO,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC;QACtC,MAAM,OAAO,GAAG,IAAI,CAAC,gBAAgB,EAAE,CAAC;QACxC,EAAE,CAAC,WAAW,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;QACjC,IAAI,CAAC,kBAAkB,CAAC,OAAO,CAAC,CAAC;IACnC,CAAC;IACD,yEAAyE;IACzD,oBAAoB,CAAC,CAAiB;QACpD,IAAI,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC;IAC/B,CAAC;IACD,0EAA0E;IAC1D,qBAAqB,CAAC,CAAkB;QACtD,IAAI,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC;IAC/B,CAAC;IACD,0EAA0E;IAC1D,sBAAsB,CAAC,CAAqB;QAC1D,IAAI,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC;IAC/B,CAAC;CACF","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n\r\n/** @packageDocumentation\r\n * @module Curve\r\n */\r\n\r\n// import { Geometry, Angle, AngleSweep } from \"../Geometry\";\r\n\r\nimport { BSplineCurve3d } from \"../bspline/BSplineCurve\";\r\nimport { BSplineCurve3dH } from \"../bspline/BSplineCurve3dH\";\r\nimport { Angle } from \"../geometry3d/Angle\";\r\nimport { NullGeometryHandler } from \"../geometry3d/GeometryHandler\";\r\nimport { Point3d } from \"../geometry3d/Point3dVector3d\";\r\nimport { MomentData } from \"../geometry4d/MomentData\";\r\nimport { Arc3d } from \"./Arc3d\";\r\nimport { CurvePrimitive } from \"./CurvePrimitive\";\r\nimport { AnyRegion } from \"./CurveTypes\";\r\nimport { LineSegment3d } from \"./LineSegment3d\";\r\nimport { LineString3d } from \"./LineString3d\";\r\nimport { Loop } from \"./Loop\";\r\nimport { ParityRegion } from \"./ParityRegion\";\r\nimport { RegionBinaryOpType, RegionOps } from \"./RegionOps\";\r\nimport { TransitionSpiral3d } from \"./spiral/TransitionSpiral3d\";\r\nimport { StrokeOptions } from \"./StrokeOptions\";\r\nimport { UnionRegion } from \"./UnionRegion\";\r\n\r\n/**\r\n * Implementation class for computing XY area moments.\r\n * @internal\r\n */\r\nexport class RegionMomentsXY extends NullGeometryHandler {\r\n  private _activeMomentData?: MomentData;\r\n  private _point0 = Point3d.create();\r\n  private _point1 = Point3d.create();\r\n  /**\r\n   * Accumulate (independent) integrations over:\r\n   * * The area between the arc and the chord connecting its endpoints.\r\n   * * The triangle with vertices: origin, arc start, arc end.\r\n   */\r\n  public override handleArc3d(arc: Arc3d): void {\r\n    const momentData = this._activeMomentData!;\r\n    const sweepRadians = arc.sweep.sweepRadians;\r\n    const alphaRadians = sweepRadians * 0.5;\r\n    let s = Math.sin(alphaRadians);\r\n    let c = Math.cos(alphaRadians);\r\n    let s1 = Math.sin(sweepRadians);\r\n    if (Angle.isFullCircleRadians(sweepRadians)) {\r\n      s = 0.0;\r\n      c = -1.0;\r\n      s1 = 0.0;\r\n    }\r\n    const q = 2 * s * s * s * c / (alphaRadians - s * c);\r\n    const s3 = s * s * s;\r\n    const s6 = s3 * s3;\r\n    const area = 0.5 * (sweepRadians - s1);\r\n    const inertiaXX = 0.25 * area * (1.0 - q / 3.0);\r\n    const inertiaYY1 = 0.25 * area * (1.0 + q);\r\n    const inertiaYY = inertiaYY1 - 4.0 * s6 / (9.0 * area);\r\n    const productXX = inertiaYY;\r\n    const productYY = inertiaXX;\r\n    const centerToCentroid = 4.0 * s * s * s / (3.0 * (sweepRadians - s1));\r\n    const midRadians = arc.sweep.fractionToRadians(0.5);\r\n    const centralPlane = arc.radiansToRotatedBasis(midRadians);\r\n    const centroid = centralPlane.origin.plusScaled(centralPlane.vectorU, centerToCentroid);\r\n    momentData.accumulateXYProductsInCentroidalFrame(\r\n      productXX, 0.0, productYY, area, centroid, centralPlane.vectorU, centralPlane.vectorV,\r\n    );\r\n    const pointB = arc.fractionToPoint(0.0);\r\n    const pointC = arc.fractionToPoint(1.0);\r\n    momentData.accumulateTriangleMomentsXY(undefined, pointB, pointC);\r\n  }\r\n  /** Accumulate integrals over the (triangular) areas from the origin to each line segment. */\r\n  public override handleLineString3d(ls: LineString3d): void {\r\n    const momentData = this._activeMomentData!;\r\n    momentData.accumulateTriangleToLineStringMomentsXY(undefined, ls.packedPoints);\r\n  }\r\n  /** Accumulate integrals over the (triangular) area from the origin to this line segment. */\r\n  public override handleLineSegment3d(segment: LineSegment3d): void {\r\n    const momentData = this._activeMomentData!;\r\n    segment.startPoint(this._point0);\r\n    segment.endPoint(this._point1);\r\n    momentData.accumulateTriangleMomentsXY(undefined, this._point0, this._point1);\r\n  }\r\n  /** Accumulate integrals from origin to all primitives in the loop. */\r\n  public override handleLoop(loop: Loop): MomentData | undefined {\r\n    const momentData = this._activeMomentData = MomentData.create();\r\n    momentData.needOrigin = false;\r\n    for (const child of loop.children)\r\n      child.dispatchToGeometryHandler(this);\r\n    this._activeMomentData = undefined;\r\n    return momentData;\r\n  }\r\n  private handleAnyRegion(region: AnyRegion): MomentData | undefined {\r\n    // guarantee there are no overlapping children and parity loops have been properly oriented\r\n    const merged = RegionOps.regionBooleanXY(region, undefined, RegionBinaryOpType.Union);\r\n    if (!merged)\r\n      return undefined;\r\n    if (merged instanceof Loop)\r\n      return this.handleLoop(merged);\r\n    const summedMoments = MomentData.create();\r\n    for (const child of merged.children) {\r\n      const childMoments = child.dispatchToGeometryHandler(this) as MomentData | undefined;\r\n      if (childMoments) {\r\n        // parity region hole sums subtract; all other regions add\r\n        const scale = (merged instanceof ParityRegion && childMoments.quantitySum < 0) ? -1.0 : 1.0;\r\n        const sign0 = childMoments.signFactor(scale);\r\n        summedMoments.accumulateProducts(childMoments, sign0);\r\n      }\r\n    }\r\n    return summedMoments;\r\n  }\r\n  /** Accumulate integrals from origin to the components of the parity region. */\r\n  public override handleParityRegion(region: ParityRegion): MomentData | undefined {\r\n    return this.handleAnyRegion(region);\r\n  }\r\n  /** Accumulate integrals from origin to the components of the union region. */\r\n  public override handleUnionRegion(region: UnionRegion): MomentData | undefined {\r\n    return this.handleAnyRegion(region);\r\n  }\r\n\r\n  private _strokeOptions?: StrokeOptions; // TODO: expose to callers in RegionOps\r\n  private getStrokeOptions(): StrokeOptions {\r\n    if (this._strokeOptions)\r\n      return this._strokeOptions;\r\n    const options = StrokeOptions.createForCurves();\r\n    // this is unusually fine for stroking, but appropriate for sum.\r\n    options.angleTol = Angle.createDegrees(5.0);\r\n    this._strokeOptions = options;\r\n    return options;\r\n  }\r\n  /**\r\n   * Handle a single curve primitive (not loop).\r\n   * * Stroke the curve and accumulate stroke array.\r\n   */\r\n  public handleCurvePrimitive(cp: CurvePrimitive): void {\r\n    const strokes = LineString3d.create();\r\n    const options = this.getStrokeOptions();\r\n    cp.emitStrokes(strokes, options);\r\n    this.handleLineString3d(strokes);\r\n  }\r\n  /** Handle strongly typed  BSplineCurve3d  as generic curve primitive. */\r\n  public override handleBSplineCurve3d(g: BSplineCurve3d): void {\r\n    this.handleCurvePrimitive(g);\r\n  }\r\n  /** Handle strongly typed  BSplineCurve3dH  as generic curve primitive. */\r\n  public override handleBSplineCurve3dH(g: BSplineCurve3dH): void {\r\n    this.handleCurvePrimitive(g);\r\n  }\r\n  /** Handle strongly typed  TransitionSpiral as generic curve primitive. */\r\n  public override handleTransitionSpiral(g: TransitionSpiral3d): void {\r\n    this.handleCurvePrimitive(g);\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"RegionMomentsXY.js","sourceRoot":"","sources":["../../../src/curve/RegionMomentsXY.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAU/F,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAC5C,OAAO,EAAE,mBAAmB,EAAE,MAAM,+BAA+B,CAAC;AACpE,OAAO,EAAE,OAAO,EAAE,MAAM,+BAA+B,CAAC;AACxD,OAAO,EAAE,UAAU,EAAE,MAAM,0BAA0B,CAAC;AAKtD,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAC9C,OAAO,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAC9B,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAC9C,OAAO,EAAE,kBAAkB,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AAE5D,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAGhD;;;GAGG;AACH,MAAM,OAAO,eAAgB,SAAQ,mBAAmB;IAC9C,iBAAiB,CAAc;IAC/B,OAAO,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;IAC3B,OAAO,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;IACnC;;;;OAIG;IACa,WAAW,CAAC,GAAU;QACpC,MAAM,UAAU,GAAG,IAAI,CAAC,iBAAkB,CAAC;QAC3C,MAAM,YAAY,GAAG,GAAG,CAAC,KAAK,CAAC,YAAY,CAAC;QAC5C,MAAM,YAAY,GAAG,YAAY,GAAG,GAAG,CAAC;QACxC,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;QAC/B,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;QAC/B,IAAI,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;QAChC,IAAI,KAAK,CAAC,mBAAmB,CAAC,YAAY,CAAC,EAAE,CAAC;YAC5C,CAAC,GAAG,GAAG,CAAC;YACR,CAAC,GAAG,CAAC,GAAG,CAAC;YACT,EAAE,GAAG,GAAG,CAAC;QACX,CAAC;QACD,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,YAAY,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QACrD,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACrB,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;QACnB,MAAM,IAAI,GAAG,GAAG,GAAG,CAAC,YAAY,GAAG,EAAE,CAAC,CAAC;QACvC,MAAM,SAAS,GAAG,IAAI,GAAG,IAAI,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC;QAChD,MAAM,UAAU,GAAG,IAAI,GAAG,IAAI,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;QAC3C,MAAM,SAAS,GAAG,UAAU,GAAG,GAAG,GAAG,EAAE,GAAG,CAAC,GAAG,GAAG,IAAI,CAAC,CAAC;QACvD,MAAM,SAAS,GAAG,SAAS,CAAC;QAC5B,MAAM,SAAS,GAAG,SAAS,CAAC;QAC5B,MAAM,gBAAgB,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,YAAY,GAAG,EAAE,CAAC,CAAC,CAAC;QACvE,MAAM,UAAU,GAAG,GAAG,CAAC,KAAK,CAAC,iBAAiB,CAAC,GAAG,CAAC,CAAC;QACpD,MAAM,YAAY,GAAG,GAAG,CAAC,qBAAqB,CAAC,UAAU,CAAC,CAAC;QAC3D,MAAM,QAAQ,GAAG,YAAY,CAAC,MAAM,CAAC,UAAU,CAAC,YAAY,CAAC,OAAO,EAAE,gBAAgB,CAAC,CAAC;QACxF,UAAU,CAAC,qCAAqC,CAC9C,SAAS,EAAE,GAAG,EAAE,SAAS,EAAE,IAAI,EAAE,QAAQ,EAAE,YAAY,CAAC,OAAO,EAAE,YAAY,CAAC,OAAO,CACtF,CAAC;QACF,MAAM,MAAM,GAAG,GAAG,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC;QACxC,MAAM,MAAM,GAAG,GAAG,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC;QACxC,UAAU,CAAC,2BAA2B,CAAC,SAAS,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;IACpE,CAAC;IACD,6FAA6F;IAC7E,kBAAkB,CAAC,EAAgB;QACjD,MAAM,UAAU,GAAG,IAAI,CAAC,iBAAkB,CAAC;QAC3C,UAAU,CAAC,uCAAuC,CAAC,SAAS,EAAE,EAAE,CAAC,YAAY,CAAC,CAAC;IACjF,CAAC;IACD,4FAA4F;IAC5E,mBAAmB,CAAC,OAAsB;QACxD,MAAM,UAAU,GAAG,IAAI,CAAC,iBAAkB,CAAC;QAC3C,OAAO,CAAC,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACjC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC/B,UAAU,CAAC,2BAA2B,CAAC,SAAS,EAAE,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;IAChF,CAAC;IACD,sEAAsE;IACtD,UAAU,CAAC,IAAU;QACnC,MAAM,UAAU,GAAG,IAAI,CAAC,iBAAiB,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC;QAChE,UAAU,CAAC,UAAU,GAAG,KAAK,CAAC;QAC9B,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ;YAC/B,KAAK,CAAC,yBAAyB,CAAC,IAAI,CAAC,CAAC;QACxC,IAAI,CAAC,iBAAiB,GAAG,SAAS,CAAC;QACnC,OAAO,UAAU,CAAC;IACpB,CAAC;IACO,eAAe,CAAC,MAAiB;QACvC,2FAA2F;QAC3F,MAAM,MAAM,GAAG,SAAS,CAAC,eAAe,CAAC,MAAM,EAAE,SAAS,EAAE,kBAAkB,CAAC,KAAK,CAAC,CAAC;QACtF,IAAI,CAAC,MAAM;YACT,OAAO,SAAS,CAAC;QACnB,IAAI,MAAM,YAAY,IAAI;YACxB,OAAO,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;QACjC,MAAM,aAAa,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC;QAC1C,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC;YACpC,MAAM,YAAY,GAAG,KAAK,CAAC,yBAAyB,CAAC,IAAI,CAA2B,CAAC;YACrF,IAAI,YAAY,EAAE,CAAC;gBACjB,0DAA0D;gBAC1D,MAAM,KAAK,GAAG,CAAC,MAAM,YAAY,YAAY,IAAI,YAAY,CAAC,WAAW,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;gBAC5F,MAAM,KAAK,GAAG,YAAY,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;gBAC7C,aAAa,CAAC,kBAAkB,CAAC,YAAY,EAAE,KAAK,CAAC,CAAC;YACxD,CAAC;QACH,CAAC;QACD,OAAO,aAAa,CAAC;IACvB,CAAC;IACD,+EAA+E;IAC/D,kBAAkB,CAAC,MAAoB;QACrD,OAAO,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC;IACtC,CAAC;IACD,8EAA8E;IAC9D,iBAAiB,CAAC,MAAmB;QACnD,OAAO,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC;IACtC,CAAC;IAEO,cAAc,CAAiB,CAAC,uCAAuC;IACvE,gBAAgB;QACtB,IAAI,IAAI,CAAC,cAAc;YACrB,OAAO,IAAI,CAAC,cAAc,CAAC;QAC7B,MAAM,OAAO,GAAG,aAAa,CAAC,eAAe,EAAE,CAAC;QAChD,gEAAgE;QAChE,OAAO,CAAC,QAAQ,GAAG,KAAK,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC;QAC5C,IAAI,CAAC,cAAc,GAAG,OAAO,CAAC;QAC9B,OAAO,OAAO,CAAC;IACjB,CAAC;IACD;;;OAGG;IACI,oBAAoB,CAAC,EAAkB;QAC5C,MAAM,OAAO,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC;QACtC,MAAM,OAAO,GAAG,IAAI,CAAC,gBAAgB,EAAE,CAAC;QACxC,EAAE,CAAC,WAAW,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;QACjC,IAAI,CAAC,kBAAkB,CAAC,OAAO,CAAC,CAAC;IACnC,CAAC;IACD,yEAAyE;IACzD,oBAAoB,CAAC,CAAiB;QACpD,IAAI,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC;IAC/B,CAAC;IACD,0EAA0E;IAC1D,qBAAqB,CAAC,CAAkB;QACtD,IAAI,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC;IAC/B,CAAC;IACD,0EAA0E;IAC1D,sBAAsB,CAAC,CAAqB;QAC1D,IAAI,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC;IAC/B,CAAC;CACF","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n\n/** @packageDocumentation\n * @module Curve\n */\n\n// import { Geometry, Angle, AngleSweep } from \"../Geometry\";\n\nimport { BSplineCurve3d } from \"../bspline/BSplineCurve\";\nimport { BSplineCurve3dH } from \"../bspline/BSplineCurve3dH\";\nimport { Angle } from \"../geometry3d/Angle\";\nimport { NullGeometryHandler } from \"../geometry3d/GeometryHandler\";\nimport { Point3d } from \"../geometry3d/Point3dVector3d\";\nimport { MomentData } from \"../geometry4d/MomentData\";\nimport { Arc3d } from \"./Arc3d\";\nimport { CurvePrimitive } from \"./CurvePrimitive\";\nimport { AnyRegion } from \"./CurveTypes\";\nimport { LineSegment3d } from \"./LineSegment3d\";\nimport { LineString3d } from \"./LineString3d\";\nimport { Loop } from \"./Loop\";\nimport { ParityRegion } from \"./ParityRegion\";\nimport { RegionBinaryOpType, RegionOps } from \"./RegionOps\";\nimport { TransitionSpiral3d } from \"./spiral/TransitionSpiral3d\";\nimport { StrokeOptions } from \"./StrokeOptions\";\nimport { UnionRegion } from \"./UnionRegion\";\n\n/**\n * Implementation class for computing XY area moments.\n * @internal\n */\nexport class RegionMomentsXY extends NullGeometryHandler {\n  private _activeMomentData?: MomentData;\n  private _point0 = Point3d.create();\n  private _point1 = Point3d.create();\n  /**\n   * Accumulate (independent) integrations over:\n   * * The area between the arc and the chord connecting its endpoints.\n   * * The triangle with vertices: origin, arc start, arc end.\n   */\n  public override handleArc3d(arc: Arc3d): void {\n    const momentData = this._activeMomentData!;\n    const sweepRadians = arc.sweep.sweepRadians;\n    const alphaRadians = sweepRadians * 0.5;\n    let s = Math.sin(alphaRadians);\n    let c = Math.cos(alphaRadians);\n    let s1 = Math.sin(sweepRadians);\n    if (Angle.isFullCircleRadians(sweepRadians)) {\n      s = 0.0;\n      c = -1.0;\n      s1 = 0.0;\n    }\n    const q = 2 * s * s * s * c / (alphaRadians - s * c);\n    const s3 = s * s * s;\n    const s6 = s3 * s3;\n    const area = 0.5 * (sweepRadians - s1);\n    const inertiaXX = 0.25 * area * (1.0 - q / 3.0);\n    const inertiaYY1 = 0.25 * area * (1.0 + q);\n    const inertiaYY = inertiaYY1 - 4.0 * s6 / (9.0 * area);\n    const productXX = inertiaYY;\n    const productYY = inertiaXX;\n    const centerToCentroid = 4.0 * s * s * s / (3.0 * (sweepRadians - s1));\n    const midRadians = arc.sweep.fractionToRadians(0.5);\n    const centralPlane = arc.radiansToRotatedBasis(midRadians);\n    const centroid = centralPlane.origin.plusScaled(centralPlane.vectorU, centerToCentroid);\n    momentData.accumulateXYProductsInCentroidalFrame(\n      productXX, 0.0, productYY, area, centroid, centralPlane.vectorU, centralPlane.vectorV,\n    );\n    const pointB = arc.fractionToPoint(0.0);\n    const pointC = arc.fractionToPoint(1.0);\n    momentData.accumulateTriangleMomentsXY(undefined, pointB, pointC);\n  }\n  /** Accumulate integrals over the (triangular) areas from the origin to each line segment. */\n  public override handleLineString3d(ls: LineString3d): void {\n    const momentData = this._activeMomentData!;\n    momentData.accumulateTriangleToLineStringMomentsXY(undefined, ls.packedPoints);\n  }\n  /** Accumulate integrals over the (triangular) area from the origin to this line segment. */\n  public override handleLineSegment3d(segment: LineSegment3d): void {\n    const momentData = this._activeMomentData!;\n    segment.startPoint(this._point0);\n    segment.endPoint(this._point1);\n    momentData.accumulateTriangleMomentsXY(undefined, this._point0, this._point1);\n  }\n  /** Accumulate integrals from origin to all primitives in the loop. */\n  public override handleLoop(loop: Loop): MomentData | undefined {\n    const momentData = this._activeMomentData = MomentData.create();\n    momentData.needOrigin = false;\n    for (const child of loop.children)\n      child.dispatchToGeometryHandler(this);\n    this._activeMomentData = undefined;\n    return momentData;\n  }\n  private handleAnyRegion(region: AnyRegion): MomentData | undefined {\n    // guarantee there are no overlapping children and parity loops have been properly oriented\n    const merged = RegionOps.regionBooleanXY(region, undefined, RegionBinaryOpType.Union);\n    if (!merged)\n      return undefined;\n    if (merged instanceof Loop)\n      return this.handleLoop(merged);\n    const summedMoments = MomentData.create();\n    for (const child of merged.children) {\n      const childMoments = child.dispatchToGeometryHandler(this) as MomentData | undefined;\n      if (childMoments) {\n        // parity region hole sums subtract; all other regions add\n        const scale = (merged instanceof ParityRegion && childMoments.quantitySum < 0) ? -1.0 : 1.0;\n        const sign0 = childMoments.signFactor(scale);\n        summedMoments.accumulateProducts(childMoments, sign0);\n      }\n    }\n    return summedMoments;\n  }\n  /** Accumulate integrals from origin to the components of the parity region. */\n  public override handleParityRegion(region: ParityRegion): MomentData | undefined {\n    return this.handleAnyRegion(region);\n  }\n  /** Accumulate integrals from origin to the components of the union region. */\n  public override handleUnionRegion(region: UnionRegion): MomentData | undefined {\n    return this.handleAnyRegion(region);\n  }\n\n  private _strokeOptions?: StrokeOptions; // TODO: expose to callers in RegionOps\n  private getStrokeOptions(): StrokeOptions {\n    if (this._strokeOptions)\n      return this._strokeOptions;\n    const options = StrokeOptions.createForCurves();\n    // this is unusually fine for stroking, but appropriate for sum.\n    options.angleTol = Angle.createDegrees(5.0);\n    this._strokeOptions = options;\n    return options;\n  }\n  /**\n   * Handle a single curve primitive (not loop).\n   * * Stroke the curve and accumulate stroke array.\n   */\n  public handleCurvePrimitive(cp: CurvePrimitive): void {\n    const strokes = LineString3d.create();\n    const options = this.getStrokeOptions();\n    cp.emitStrokes(strokes, options);\n    this.handleLineString3d(strokes);\n  }\n  /** Handle strongly typed  BSplineCurve3d  as generic curve primitive. */\n  public override handleBSplineCurve3d(g: BSplineCurve3d): void {\n    this.handleCurvePrimitive(g);\n  }\n  /** Handle strongly typed  BSplineCurve3dH  as generic curve primitive. */\n  public override handleBSplineCurve3dH(g: BSplineCurve3dH): void {\n    this.handleCurvePrimitive(g);\n  }\n  /** Handle strongly typed  TransitionSpiral as generic curve primitive. */\n  public override handleTransitionSpiral(g: TransitionSpiral3d): void {\n    this.handleCurvePrimitive(g);\n  }\n}\n"]}

package/lib/esm/curve/RegionOps.d.ts

@@ -24,7 +24,29 @@ import { StrokeOptions } from "./StrokeOptions";
  */
 export type GraphCheckPointFunction = (name: string, graph: HalfEdgeGraph, properties: string, extraData?: any) => any;
 /**
- * Enumeration of the binary operation types for a booleans among regions
+ * * Options to control method [[RegionOps.consolidateAdjacentPrimitives]].
+ * @public
+ */
+export declare class ConsolidateAdjacentCurvePrimitivesOptions {
+    /** True to consolidate adjacent linear geometry into a single LineString3d. */
+    consolidateLinearGeometry: boolean;
+    /** True to consolidate contiguous compatible arcs into a single Arc3d. */
+    consolidateCompatibleArcs: boolean;
+    /**
+     * True to attempt consolidation of the first and last primitives of a [[Loop]] or physically closed linestring data,
+     * allowing location of the seam to change.
+     */
+    consolidateLoopSeam?: boolean;
+    /** Disable LineSegment3d and LineString3d point compression. */
+    disableLinearCompression?: boolean;
+    /** Tolerance for detecting identical points. */
+    duplicatePointTolerance: number;
+    /** Tolerance for removing interior colinear points (if `!disableLinearCompression`). */
+    colinearPointTolerance: number;
+}
+/**
+ * Enumeration of the binary operation types for Boolean operations.
+ * @see [[RegionOps.regionBooleanXY]], [[RegionOps.polygonBooleanXYToLoops]], [[RegionOps.polygonBooleanXYToPolyface]].
  * @public
  */
 export declare enum RegionBinaryOpType {
@@ -34,6 +56,19 @@ export declare enum RegionBinaryOpType {
     AMinusB = 3,
     BMinusA = 4
 }
+/**
+ * Options bundle for use in [[RegionOps.regionBooleanXY]].
+ * @public
+ */
+export interface RegionBooleanXYOptions {
+    /** Absolute distance tolerance for merging loops. Default is [[Geometry.smallMetricDistance]]. */
+    mergeTolerance?: number;
+    /**
+     * Whether to post-process a Boolean Union result to return only the outer [[Loop]]s.
+     * Default value is `false`, to return the raw [[UnionRegion]] of disjoint constituent [[Loop]]s.
+     */
+    simplifyUnion?: boolean;
+}
 /**
  * Class `RegionOps` has static members for calculations on regions (areas).
  * * Regions are represented by these [[CurveCollection]] subclasses:
@@ -156,10 +191,15 @@ export declare class RegionOps {
      * * Regions without children are removed.
      * * No Boolean operations are performed.
      * @param region region to simplify in place
-     * @returns reference to the updated input region
+     * @returns reference to the updated input region, or `undefined` if no children.
      * @see [[simplifyRegionType]]
      */
     static simplifyRegion(region: AnyRegion): AnyRegion | undefined;
+    /**
+     * Helper method to sample a z-coordinate from the input region(s).
+     * * The assumption is that the input is horizontal.
+     */
+    private static getZCoordinate;
     /**
      * Return areas defined by a boolean operation.
      * @note For best results, input regions should have correctly oriented loops. See [[sortOuterAndHoleLoopsXY]].
@@ -170,10 +210,10 @@ export declare class RegionOps {
      * @param loopsA first set of loops (treated as a union)
      * @param loopsB second set of loops (treated as a union)
      * @param operation indicates Union, Intersection, Parity, AMinusB, or BMinusA
-     * @param mergeTolerance absolute distance tolerance for merging loops
+     * @param mergeToleranceOrOptions absolute distance tolerance for merging loops, or multiple options settings. Default value is [[Geometry.smallMetricDistance]].
      * @returns a region resulting from merging input loops and the boolean operation.
      */
-    static regionBooleanXY(loopsA: AnyRegion | AnyRegion[] | undefined, loopsB: AnyRegion | AnyRegion[] | undefined, operation: RegionBinaryOpType, mergeTolerance?: number): AnyRegion | undefined;
+    static regionBooleanXY(loopsA: AnyRegion | AnyRegion[] | undefined, loopsB: AnyRegion | AnyRegion[] | undefined, operation: RegionBinaryOpType, mergeToleranceOrOptions?: number | RegionBooleanXYOptions): AnyRegion | undefined;
     /**
      * Return a polyface whose facets are a boolean operation between the input regions.
      * * Each of the two inputs is an array of multiple loops or parity regions.
@@ -426,25 +466,4 @@ export declare class RegionOps {
     */
     static convexDecomposePolygonXY(polygon: MultiLineStringDataVariant, maximize?: boolean): GrowableXYZArray[] | undefined;
 }
-/**
- * * Options to control method `RegionOps.consolidateAdjacentPrimitives`.
- * @public
- */
-export declare class ConsolidateAdjacentCurvePrimitivesOptions {
-    /** True to consolidate adjacent linear geometry into a single LineString3d. */
-    consolidateLinearGeometry: boolean;
-    /** True to consolidate contiguous compatible arcs into a single Arc3d. */
-    consolidateCompatibleArcs: boolean;
-    /**
-     * True to attempt consolidation of the first and last primitives of a [[Loop]] or physically closed linestring data,
-     * allowing location of the seam to change.
-     */
-    consolidateLoopSeam?: boolean;
-    /** Disable LineSegment3d and LineString3d point compression. */
-    disableLinearCompression?: boolean;
-    /** Tolerance for detecting identical points. */
-    duplicatePointTolerance: number;
-    /** Tolerance for removing interior colinear points (if `!disableLinearCompression`). */
-    colinearPointTolerance: number;
-}
 //# sourceMappingURL=RegionOps.d.ts.map

package/lib/esm/curve/RegionOps.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"RegionOps.d.ts","sourceRoot":"","sources":["../../../src/curve/RegionOps.ts"],"names":[],"mappings":"AAYA,OAAO,EAAE,gBAAgB,EAAE,MAAM,gCAAgC,CAAC;AAClE,OAAO,EAC0B,oBAAoB,EAAyB,0BAA0B,EACvG,MAAM,oCAAoC,CAAC;AAE5C,OAAO,EAAE,OAAO,EAAY,MAAM,+BAA+B,CAAC;AAGlE,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AAC9C,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAE5C,OAAO,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AAEpD,OAAO,EAAE,UAAU,EAAE,MAAM,0BAA0B,CAAC;AACtD,OAAO,EAAE,eAAe,EAAE,QAAQ,EAAE,MAAM,sBAAsB,CAAC;AAEjE,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AAI1E,OAAO,EAAe,UAAU,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AAG7E,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAClD,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,SAAS,EAAE,MAAM,cAAc,CAAC;AAQ7D,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,MAAM,QAAQ,CAAC;AAC3C,OAAO,EAAE,YAAY,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAE9D,OAAO,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAO9B,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAGhD;;;;;;;GAOG;AACH,MAAM,MAAM,uBAAuB,GAAG,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,aAAa,EAAE,UAAU,EAAE,MAAM,EAAE,SAAS,CAAC,EAAE,GAAG,KAAK,GAAG,CAAC;AAEvH;;;GAGG;AACH,oBAAY,kBAAkB;IAC5B,KAAK,IAAI;IACT,MAAM,IAAI;IACV,YAAY,IAAI;IAChB,OAAO,IAAI;IACX,OAAO,IAAI;CACZ;AAED;;;;;;;;;;;GAWG;AACH,qBAAa,SAAS;IACpB;;;;;;;;OAQG;WACW,oBAAoB,CAAC,MAAM,EAAE,SAAS,GAAG,UAAU,GAAG,SAAS;IAS7E;;;;MAIE;WACY,sBAAsB,CAAC,KAAK,EAAE,OAAO,EAAE,iBAAiB,GAAE,MAAqC,GAAG,MAAM;IAKtH;;;;;;OAMG;WACW,aAAa,CAAC,MAAM,EAAE,SAAS,GAAG,MAAM,GAAG,SAAS;IAQlE;;;;;;;;OAQG;WACW,wBAAwB,CAAC,KAAK,EAAE,QAAQ,GAAG,UAAU,GAAG,SAAS;IAO/E;;;;;;;OAOG;WACW,kBAAkB,CAAC,MAAM,EAAE,SAAS,EAAE,MAAM,CAAC,EAAE,KAAK,GAAG,KAAK,GAAG,SAAS;IA6BtF;;;OAGG;WACW,eAAe,CAC3B,KAAK,EAAE,aAAa,EACpB,IAAI,EAAE,0BAA0B,EAChC,oBAAoB,EAAE,CAAC,KAAK,EAAE,aAAa,EAAE,IAAI,EAAE,QAAQ,KAAK,IAAI,GACnE,IAAI;IAqCP;;;;OAIG;WACW,0BAA0B,CACtC,KAAK,EAAE,aAAa,EAAE,IAAI,EAAE,0BAA0B,EAAE,IAAI,EAAE,YAAY,EAAE,OAAO,EAAE,GAAG,GACvF,QAAQ,EAAE,GAAG,SAAS;IAYzB;;;;;OAKG;IACH,OAAO,CAAC,MAAM,CAAC,qBAAqB;IAUpC;;;;;;;;OAQG;WACW,qCAAqC,CACjD,MAAM,EAAE,0BAA0B,EAAE,MAAM,EAAE,0BAA0B,EAAE,WAAW,GAAE,OAAe,GACnG,QAAQ,GAAG,SAAS;IASvB;;;;;;;;OAQG;WACW,iCAAiC,CAC7C,MAAM,EAAE,0BAA0B,EAAE,MAAM,EAAE,0BAA0B,EAAE,WAAW,GAAE,OAAe,GACnG,QAAQ,GAAG,SAAS;IASvB;;;;;;;;OAQG;WACW,sCAAsC,CAClD,MAAM,EAAE,0BAA0B,EAAE,MAAM,EAAE,0BAA0B,EAAE,WAAW,GAAE,OAAe,GACnG,QAAQ,GAAG,SAAS;IASvB;;;;;;;;;;OAUG;WACW,kBAAkB,CAAC,MAAM,EAAE,SAAS,GAAG,SAAS;IAU9D;;;;;;;;OAQG;WACW,cAAc,CAAC,MAAM,EAAE,SAAS,GAAG,SAAS,GAAG,SAAS;IAqBtE;;;;;;;;;;;;OAYG;WACW,eAAe,CAC3B,MAAM,EAAE,SAAS,GAAG,SAAS,EAAE,GAAG,SAAS,EAC3C,MAAM,EAAE,SAAS,GAAG,SAAS,EAAE,GAAG,SAAS,EAC3C,SAAS,EAAE,kBAAkB,EAC7B,cAAc,GAAE,MAAqC,GACpD,SAAS,GAAG,SAAS;IA2BxB;;;;;;;;;;;OAWG;WACW,0BAA0B,CACtC,MAAM,EAAE,0BAA0B,EAAE,EACpC,SAAS,EAAE,kBAAkB,EAC7B,MAAM,EAAE,0BAA0B,EAAE,EACpC,WAAW,GAAE,OAAe,GAC3B,QAAQ,GAAG,SAAS;IASvB;;;;;;;;;;OAUG;WACW,uBAAuB,CACnC,MAAM,EAAE,0BAA0B,EAAE,EACpC,SAAS,EAAE,kBAAkB,EAC7B,MAAM,EAAE,0BAA0B,EAAE,GACnC,SAAS,GAAG,SAAS;IAwBxB;;;;;;;;;;;OAWG;WACW,4BAA4B,CACxC,MAAM,EAAE,OAAO,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,uBAAuB,EAAE,MAAM,GAAG,YAAY,GAC/E,UAAU,GAAG,SAAS;IAIzB;;;;;;;OAOG;WACW,sBAAsB,CAClC,MAAM,EAAE,IAAI,GAAG,IAAI,EAAE,uBAAuB,EAAE,MAAM,GAAG,YAAY,GAAG,aAAa,GAClF,eAAe,GAAG,SAAS;IAI9B;;;;;;OAMG;WACW,wBAAwB,CAAC,MAAM,EAAE,SAAS,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM;IAGvF;;;;;;;;;OASG;WACW,2BAA2B,CACvC,MAAM,EAAE,cAAc,EAAE,EAAE,IAAI,GAAE,OAAc,EAAE,6BAA6B,GAAE,OAAe,GAC7F,eAAe,GAAG,SAAS;IAuB9B,OAAO,CAAC,MAAM,CAAC,wBAAwB,CAAC,CAA0B;IAClE;;;OAGG;WACW,qBAAqB,CAAC,CAAC,CAAC,EAAE,uBAAuB;IAG/D;;;;;;;;OAQG;WACW,uBAAuB,CACnC,WAAW,EAAE,QAAQ,GAAG,SAAS,EAAE,YAAY,EAAE,eAAe,GAC/D,QAAQ,GAAG,SAAS;IAGvB;;;;;OAKG;WACW,yBAAyB,CAAC,MAAM,EAAE,QAAQ,GAAG,SAAS,EAAE,UAAU,EAAE,OAAO,GAAG,QAAQ,GAAG,SAAS;IAahH;;;;;;;;OAQG;WACW,8BAA8B,CAC1C,SAAS,EAAE,QAAQ,EAAE,EAAE,cAAc,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,GAClE;QAAE,aAAa,EAAE,QAAQ,EAAE,CAAC;QAAC,cAAc,EAAE,QAAQ,EAAE,CAAC;QAAC,MAAM,CAAC,EAAE,QAAQ,CAAA;KAAE;IAG/E;;;;;OAKG;WACW,aAAa,CAAC,SAAS,EAAE,QAAQ,EAAE,EAAE,YAAY,GAAE,MAAqC,GAAG,QAAQ,GAAG,SAAS;IAG7H;;;;;OAKG;WACW,2BAA2B,CACvC,WAAW,EAAE,QAAQ,GAAG,SAAS,EAAE,MAAM,EAAE,SAAS,GACnD;QAAE,WAAW,EAAE,QAAQ,EAAE,CAAC;QAAC,YAAY,EAAE,QAAQ,EAAE,CAAC;QAAC,eAAe,EAAE,QAAQ,EAAE,CAAA;KAAE;IAqBrF;;;;;;;;;;;;;;OAcG;WACW,sBAAsB,CAClC,IAAI,EAAE,QAAQ,GAAG,OAAO,EAAE,GAAG,oBAAoB,EAAE,mBAAmB,GAAE,OAAc,GACrF,SAAS,GAAG,SAAS;IA+CxB;;;;;;;;;;;OAWG;WACW,6BAA6B,CAAC,MAAM,EAAE,eAAe,EAAE,OAAO,CAAC,EAAE,yCAAyC,GAAG,IAAI;IAI/H;;;;;;;;;;;;OAYG;WACW,uBAAuB,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,GAAG,oBAAoB,CAAC,GAAG,SAAS;IAY3F;;;;MAIE;IACF,OAAO,CAAC,MAAM,CAAC,iCAAiC;IAiBhD;;;;;;;;;;;;;;;;;;;;;OAqBG;WACW,yBAAyB,CACrC,gBAAgB,EAAE,QAAQ,GAAG,QAAQ,EAAE,EACvC,SAAS,GAAE,MAAqC,EAChD,UAAU,GAAE,OAAc,GACzB,WAAW,EAAE;IAoBhB;;;;;;;;;;OAUG;WACW,sBAAsB,CAClC,UAAU,EAAE,QAAQ,GAAG,QAAQ,EAAE,EACjC,cAAc,CAAC,EAAE,cAAc,EAAE,EACjC,0BAA0B,GAAE,OAAe,EAC3C,kBAAkB,GAAE,OAAe,GAClC,cAAc,EAAE;IAanB;;;;;OAKG;WACW,iBAAiB,CAAC,UAAU,EAAE,cAAc,EAAE,GAAG,cAAc,EAAE;IAe/E;;;;OAIG;WACW,eAAe,CAAC,IAAI,EAAE,GAAG,EAAE,YAAY,CAAC,EAAE,SAAS,GAAG,OAAO;IAkB3E;;;;OAIG;IACH,OAAO,CAAC,MAAM,CAAC,iCAAiC;IAqChD,oCAAoC;IACpC,OAAO,CAAC,MAAM,CAAC,qBAAqB;IAepC;;;;;OAKG;IACH,OAAO,CAAC,MAAM,CAAC,0BAA0B;IAIzC;;;;;;;;;OASG;WACW,aAAa,CAAC,MAAM,EAAE,SAAS,EAAE,OAAO,CAAC,EAAE,aAAa,GAAG,eAAe,GAAG,SAAS;IAyBpG;;;;;MAKE;WACY,wBAAwB,CAAC,OAAO,EAAE,0BAA0B,EAAE,QAAQ,GAAE,OAAc,GAAG,gBAAgB,EAAE,GAAG,SAAS;CActI;AAaD;;;GAGG;AACH,qBAAa,yCAAyC;IACpD,+EAA+E;IACxE,yBAAyB,EAAE,OAAO,CAAQ;IACjD,0EAA0E;IACnE,yBAAyB,EAAE,OAAO,CAAQ;IACjD;;;OAGG;IACI,mBAAmB,CAAC,EAAE,OAAO,CAAS;IAC7C,gEAAgE;IACzD,wBAAwB,CAAC,EAAE,OAAO,CAAS;IAClD,gDAAgD;IACzC,uBAAuB,EAAE,MAAM,CAAgC;IACtE,wFAAwF;IACjF,sBAAsB,EAAE,MAAM,CAAgC;CACtE"}
+{"version":3,"file":"RegionOps.d.ts","sourceRoot":"","sources":["../../../src/curve/RegionOps.ts"],"names":[],"mappings":"AAYA,OAAO,EAAE,gBAAgB,EAAE,MAAM,gCAAgC,CAAC;AAClE,OAAO,EAC0B,oBAAoB,EAAyB,0BAA0B,EACvG,MAAM,oCAAoC,CAAC;AAE5C,OAAO,EAAE,OAAO,EAAY,MAAM,+BAA+B,CAAC;AAGlE,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AAC9C,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAE5C,OAAO,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AAEpD,OAAO,EAAE,UAAU,EAAE,MAAM,0BAA0B,CAAC;AACtD,OAAO,EAAE,eAAe,EAAE,QAAQ,EAAE,MAAM,sBAAsB,CAAC;AAEjE,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AAI1E,OAAO,EAAe,UAAU,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AAG7E,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAClD,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,SAAS,EAAE,MAAM,cAAc,CAAC;AAQ7D,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,MAAM,QAAQ,CAAC;AAC3C,OAAO,EAAE,YAAY,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAE9D,OAAO,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAO9B,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAGhD;;;;;;;GAOG;AACH,MAAM,MAAM,uBAAuB,GAAG,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,aAAa,EAAE,UAAU,EAAE,MAAM,EAAE,SAAS,CAAC,EAAE,GAAG,KAAK,GAAG,CAAC;AAEvH;;;GAGG;AACH,qBAAa,yCAAyC;IACpD,+EAA+E;IACxE,yBAAyB,EAAE,OAAO,CAAQ;IACjD,0EAA0E;IACnE,yBAAyB,EAAE,OAAO,CAAQ;IACjD;;;OAGG;IACI,mBAAmB,CAAC,EAAE,OAAO,CAAS;IAC7C,gEAAgE;IACzD,wBAAwB,CAAC,EAAE,OAAO,CAAS;IAClD,gDAAgD;IACzC,uBAAuB,EAAE,MAAM,CAAgC;IACtE,wFAAwF;IACjF,sBAAsB,EAAE,MAAM,CAAgC;CACtE;AAED;;;;GAIG;AACH,oBAAY,kBAAkB;IAC5B,KAAK,IAAI;IACT,MAAM,IAAI;IACV,YAAY,IAAI;IAChB,OAAO,IAAI;IACX,OAAO,IAAI;CACZ;AAED;;;GAGG;AACH,MAAM,WAAW,sBAAsB;IACrC,kGAAkG;IAClG,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB;;;OAGG;IACH,aAAa,CAAC,EAAE,OAAO,CAAC;CACzB;AAED;;;;;;;;;;;GAWG;AACH,qBAAa,SAAS;IACpB;;;;;;;;OAQG;WACW,oBAAoB,CAAC,MAAM,EAAE,SAAS,GAAG,UAAU,GAAG,SAAS;IAS7E;;;;MAIE;WACY,sBAAsB,CAAC,KAAK,EAAE,OAAO,EAAE,iBAAiB,GAAE,MAAqC,GAAG,MAAM;IAStH;;;;;;OAMG;WACW,aAAa,CAAC,MAAM,EAAE,SAAS,GAAG,MAAM,GAAG,SAAS;IAQlE;;;;;;;;OAQG;WACW,wBAAwB,CAAC,KAAK,EAAE,QAAQ,GAAG,UAAU,GAAG,SAAS;IAO/E;;;;;;;OAOG;WACW,kBAAkB,CAAC,MAAM,EAAE,SAAS,EAAE,MAAM,CAAC,EAAE,KAAK,GAAG,KAAK,GAAG,SAAS;IA6BtF;;;OAGG;WACW,eAAe,CAC3B,KAAK,EAAE,aAAa,EACpB,IAAI,EAAE,0BAA0B,EAChC,oBAAoB,EAAE,CAAC,KAAK,EAAE,aAAa,EAAE,IAAI,EAAE,QAAQ,KAAK,IAAI,GACnE,IAAI;IAqCP;;;;OAIG;WACW,0BAA0B,CACtC,KAAK,EAAE,aAAa,EAAE,IAAI,EAAE,0BAA0B,EAAE,IAAI,EAAE,YAAY,EAAE,OAAO,EAAE,GAAG,GACvF,QAAQ,EAAE,GAAG,SAAS;IAYzB;;;;;OAKG;IACH,OAAO,CAAC,MAAM,CAAC,qBAAqB;IAUpC;;;;;;;;OAQG;WACW,qCAAqC,CACjD,MAAM,EAAE,0BAA0B,EAAE,MAAM,EAAE,0BAA0B,EAAE,WAAW,GAAE,OAAe,GACnG,QAAQ,GAAG,SAAS;IASvB;;;;;;;;OAQG;WACW,iCAAiC,CAC7C,MAAM,EAAE,0BAA0B,EAAE,MAAM,EAAE,0BAA0B,EAAE,WAAW,GAAE,OAAe,GACnG,QAAQ,GAAG,SAAS;IASvB;;;;;;;;OAQG;WACW,sCAAsC,CAClD,MAAM,EAAE,0BAA0B,EAAE,MAAM,EAAE,0BAA0B,EAAE,WAAW,GAAE,OAAe,GACnG,QAAQ,GAAG,SAAS;IASvB;;;;;;;;;;OAUG;WACW,kBAAkB,CAAC,MAAM,EAAE,SAAS,GAAG,SAAS;IAU9D;;;;;;;;OAQG;WACW,cAAc,CAAC,MAAM,EAAE,SAAS,GAAG,SAAS,GAAG,SAAS;IAqBtE;;;OAGG;IACH,OAAO,CAAC,MAAM,CAAC,cAAc;IAI7B;;;;;;;;;;;;OAYG;WACW,eAAe,CAC3B,MAAM,EAAE,SAAS,GAAG,SAAS,EAAE,GAAG,SAAS,EAC3C,MAAM,EAAE,SAAS,GAAG,SAAS,EAAE,GAAG,SAAS,EAC3C,SAAS,EAAE,kBAAkB,EAC7B,uBAAuB,GAAE,MAAM,GAAG,sBAAqD,GACtF,SAAS,GAAG,SAAS;IA8CxB;;;;;;;;;;;OAWG;WACW,0BAA0B,CACtC,MAAM,EAAE,0BAA0B,EAAE,EACpC,SAAS,EAAE,kBAAkB,EAC7B,MAAM,EAAE,0BAA0B,EAAE,EACpC,WAAW,GAAE,OAAe,GAC3B,QAAQ,GAAG,SAAS;IASvB;;;;;;;;;;OAUG;WACW,uBAAuB,CACnC,MAAM,EAAE,0BAA0B,EAAE,EACpC,SAAS,EAAE,kBAAkB,EAC7B,MAAM,EAAE,0BAA0B,EAAE,GACnC,SAAS,GAAG,SAAS;IAwBxB;;;;;;;;;;;OAWG;WACW,4BAA4B,CACxC,MAAM,EAAE,OAAO,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,uBAAuB,EAAE,MAAM,GAAG,YAAY,GAC/E,UAAU,GAAG,SAAS;IAIzB;;;;;;;OAOG;WACW,sBAAsB,CAClC,MAAM,EAAE,IAAI,GAAG,IAAI,EAAE,uBAAuB,EAAE,MAAM,GAAG,YAAY,GAAG,aAAa,GAClF,eAAe,GAAG,SAAS;IAI9B;;;;;;OAMG;WACW,wBAAwB,CAAC,MAAM,EAAE,SAAS,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM;IAGvF;;;;;;;;;OASG;WACW,2BAA2B,CACvC,MAAM,EAAE,cAAc,EAAE,EAAE,IAAI,GAAE,OAAc,EAAE,6BAA6B,GAAE,OAAe,GAC7F,eAAe,GAAG,SAAS;IAuB9B,OAAO,CAAC,MAAM,CAAC,wBAAwB,CAAC,CAA0B;IAClE;;;OAGG;WACW,qBAAqB,CAAC,CAAC,CAAC,EAAE,uBAAuB;IAG/D;;;;;;;;OAQG;WACW,uBAAuB,CACnC,WAAW,EAAE,QAAQ,GAAG,SAAS,EAAE,YAAY,EAAE,eAAe,GAC/D,QAAQ,GAAG,SAAS;IAGvB;;;;;OAKG;WACW,yBAAyB,CAAC,MAAM,EAAE,QAAQ,GAAG,SAAS,EAAE,UAAU,EAAE,OAAO,GAAG,QAAQ,GAAG,SAAS;IAahH;;;;;;;;OAQG;WACW,8BAA8B,CAC1C,SAAS,EAAE,QAAQ,EAAE,EAAE,cAAc,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,GAClE;QAAE,aAAa,EAAE,QAAQ,EAAE,CAAC;QAAC,cAAc,EAAE,QAAQ,EAAE,CAAC;QAAC,MAAM,CAAC,EAAE,QAAQ,CAAA;KAAE;IAG/E;;;;;OAKG;WACW,aAAa,CAAC,SAAS,EAAE,QAAQ,EAAE,EAAE,YAAY,GAAE,MAAqC,GAAG,QAAQ,GAAG,SAAS;IAG7H;;;;;OAKG;WACW,2BAA2B,CACvC,WAAW,EAAE,QAAQ,GAAG,SAAS,EAAE,MAAM,EAAE,SAAS,GACnD;QAAE,WAAW,EAAE,QAAQ,EAAE,CAAC;QAAC,YAAY,EAAE,QAAQ,EAAE,CAAC;QAAC,eAAe,EAAE,QAAQ,EAAE,CAAA;KAAE;IAqBrF;;;;;;;;;;;;;;OAcG;WACW,sBAAsB,CAClC,IAAI,EAAE,QAAQ,GAAG,OAAO,EAAE,GAAG,oBAAoB,EAAE,mBAAmB,GAAE,OAAc,GACrF,SAAS,GAAG,SAAS;IA+CxB;;;;;;;;;;;OAWG;WACW,6BAA6B,CAAC,MAAM,EAAE,eAAe,EAAE,OAAO,CAAC,EAAE,yCAAyC,GAAG,IAAI;IAI/H;;;;;;;;;;;;OAYG;WACW,uBAAuB,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,GAAG,oBAAoB,CAAC,GAAG,SAAS;IAY3F;;;;MAIE;IACF,OAAO,CAAC,MAAM,CAAC,iCAAiC;IAiBhD;;;;;;;;;;;;;;;;;;;;;OAqBG;WACW,yBAAyB,CACrC,gBAAgB,EAAE,QAAQ,GAAG,QAAQ,EAAE,EACvC,SAAS,GAAE,MAAqC,EAChD,UAAU,GAAE,OAAc,GACzB,WAAW,EAAE;IAsBhB;;;;;;;;;;OAUG;WACW,sBAAsB,CAClC,UAAU,EAAE,QAAQ,GAAG,QAAQ,EAAE,EACjC,cAAc,CAAC,EAAE,cAAc,EAAE,EACjC,0BAA0B,GAAE,OAAe,EAC3C,kBAAkB,GAAE,OAAe,GAClC,cAAc,EAAE;IAanB;;;;;OAKG;WACW,iBAAiB,CAAC,UAAU,EAAE,cAAc,EAAE,GAAG,cAAc,EAAE;IAe/E;;;;OAIG;WACW,eAAe,CAAC,IAAI,EAAE,GAAG,EAAE,YAAY,CAAC,EAAE,SAAS,GAAG,OAAO;IAkB3E;;;;OAIG;IACH,OAAO,CAAC,MAAM,CAAC,iCAAiC;IAqChD,oCAAoC;IACpC,OAAO,CAAC,MAAM,CAAC,qBAAqB;IAepC;;;;;OAKG;IACH,OAAO,CAAC,MAAM,CAAC,0BAA0B;IAIzC;;;;;;;;;OASG;WACW,aAAa,CAAC,MAAM,EAAE,SAAS,EAAE,OAAO,CAAC,EAAE,aAAa,GAAG,eAAe,GAAG,SAAS;IAyBpG;;;;;MAKE;WACY,wBAAwB,CAAC,OAAO,EAAE,0BAA0B,EAAE,QAAQ,GAAE,OAAc,GAAG,gBAAgB,EAAE,GAAG,SAAS;CActI"}

package/lib/esm/curve/RegionOps.js

@@ -47,7 +47,29 @@ import { RegionMomentsXY } from "./RegionMomentsXY";
 import { RegionBooleanContext, RegionGroupOpType, RegionOpsFaceToFaceSearch } from "./RegionOpsClassificationSweeps";
 import { UnionRegion } from "./UnionRegion";
 /**
- * Enumeration of the binary operation types for a booleans among regions
+ * * Options to control method [[RegionOps.consolidateAdjacentPrimitives]].
+ * @public
+ */
+export class ConsolidateAdjacentCurvePrimitivesOptions {
+    /** True to consolidate adjacent linear geometry into a single LineString3d. */
+    consolidateLinearGeometry = true;
+    /** True to consolidate contiguous compatible arcs into a single Arc3d. */
+    consolidateCompatibleArcs = true;
+    /**
+     * True to attempt consolidation of the first and last primitives of a [[Loop]] or physically closed linestring data,
+     * allowing location of the seam to change.
+     */
+    consolidateLoopSeam = false;
+    /** Disable LineSegment3d and LineString3d point compression. */
+    disableLinearCompression = false;
+    /** Tolerance for detecting identical points. */
+    duplicatePointTolerance = Geometry.smallMetricDistance;
+    /** Tolerance for removing interior colinear points (if `!disableLinearCompression`). */
+    colinearPointTolerance = Geometry.smallMetricDistance;
+}
+/**
+ * Enumeration of the binary operation types for Boolean operations.
+ * @see [[RegionOps.regionBooleanXY]], [[RegionOps.polygonBooleanXYToLoops]], [[RegionOps.polygonBooleanXYToPolyface]].
  * @public
  */
 export var RegionBinaryOpType;
@@ -95,8 +117,12 @@ export class RegionOps {
      * @param distanceTolerance optional absolute distance tolerance.
     */
     static computeXYAreaTolerance(range, distanceTolerance = Geometry.smallMetricDistance) {
-        // if A = bh and e is distance tolerance, then A' := (b+e/2)(h+e/2) = A + e/2(b+h+e/2), so A'-A = e/2(b+h+e/2).
-        const halfDistTol = 0.5 * distanceTolerance;
+        // ensure the result is nonzero: we never want to report a zero-area loop as a signed-area loop
+        if (distanceTolerance === 0)
+            return Geometry.smallFloatingPoint * 10; // observed area 2e-15 computed for a zero-area loop
+        // If A = bh and e is distance tolerance, let A' be the region with b and h extended by half the tolerance.
+        // Then A' := (b+e/2)(h+e/2) = A + e/2(b+h+e/2), which motivates our area tol = A'-A = e/2(b+h+e/2).
+        const halfDistTol = 0.5 * Math.abs(distanceTolerance);
         return halfDistTol * (range.xLength() + range.yLength() + halfDistTol);
     }
     /**
@@ -311,7 +337,7 @@ export class RegionOps {
      * * Regions without children are removed.
      * * No Boolean operations are performed.
      * @param region region to simplify in place
-     * @returns reference to the updated input region
+     * @returns reference to the updated input region, or `undefined` if no children.
      * @see [[simplifyRegionType]]
      */
     static simplifyRegion(region) {
@@ -336,6 +362,14 @@ export class RegionOps {
             return region.children.splice(0, 1)[0];
         return region;
     }
+    /**
+     * Helper method to sample a z-coordinate from the input region(s).
+     * * The assumption is that the input is horizontal.
+     */
+    static getZCoordinate(xyRegion) {
+        const localToWorld = FrameBuilder.createRightHandedFrame(undefined, xyRegion);
+        return localToWorld ? localToWorld.origin.z : 0;
+    }
     /**
      * Return areas defined by a boolean operation.
      * @note For best results, input regions should have correctly oriented loops. See [[sortOuterAndHoleLoopsXY]].
@@ -346,18 +380,30 @@ export class RegionOps {
      * @param loopsA first set of loops (treated as a union)
      * @param loopsB second set of loops (treated as a union)
      * @param operation indicates Union, Intersection, Parity, AMinusB, or BMinusA
-     * @param mergeTolerance absolute distance tolerance for merging loops
+     * @param mergeToleranceOrOptions absolute distance tolerance for merging loops, or multiple options settings. Default value is [[Geometry.smallMetricDistance]].
      * @returns a region resulting from merging input loops and the boolean operation.
      */
-    static regionBooleanXY(loopsA, loopsB, operation, mergeTolerance = Geometry.smallMetricDistance) {
-        const result = UnionRegion.create();
+    static regionBooleanXY(loopsA, loopsB, operation, mergeToleranceOrOptions = Geometry.smallMetricDistance) {
+        let mergeTolerance;
+        let simplifyUnion;
+        if (typeof mergeToleranceOrOptions === "number") {
+            mergeTolerance = mergeToleranceOrOptions;
+            simplifyUnion = false;
+        }
+        else {
+            mergeTolerance = mergeToleranceOrOptions.mergeTolerance ?? Geometry.smallMetricDistance;
+            simplifyUnion = mergeToleranceOrOptions.simplifyUnion ?? false;
+        }
+        let result = UnionRegion.create();
         const context = RegionBooleanContext.create(RegionGroupOpType.Union, RegionGroupOpType.Union);
         context.addMembers(loopsA, loopsB);
         context.annotateAndMergeCurvesInGraph(mergeTolerance);
+        const bridgeMask = HalfEdgeMask.BRIDGE_EDGE;
         const visitMask = context.graph.grabMask(false);
         const range = context.groupA.range().union(context.groupB.range());
         const areaTol = this.computeXYAreaTolerance(range, mergeTolerance);
-        const bridgeMask = HalfEdgeMask.BRIDGE_EDGE;
+        const z = RegionOps.getZCoordinate(operation === RegionBinaryOpType.BMinusA ? loopsB : loopsA);
+        const options = { compress: true, closureTol: mergeTolerance, bridgeMask, visitMask, z };
         context.runClassificationSweep(operation, (_graph, face, faceType, area) => {
             // ignore danglers and null faces, but not 2-edge "banana" faces with nonzero area
             if (face.countEdgesAroundFace() < 2)
@@ -365,12 +411,20 @@ export class RegionOps {
             if (Math.abs(area) < areaTol)
                 return;
             if (faceType === 1) {
-                const loopOrParityRegion = PlanarSubdivision.createLoopOrParityRegionInFace(face, bridgeMask, visitMask, mergeTolerance);
+                const loopOrParityRegion = PlanarSubdivision.createLoopOrParityRegionInFace(face, options);
                 if (loopOrParityRegion)
                     result.tryAddChild(loopOrParityRegion);
             }
         });
         context.graph.dropMask(visitMask);
+        if (simplifyUnion && operation === RegionBinaryOpType.Union) {
+            const signedLoops = RegionOps.constructAllXYRegionLoops(result);
+            if (signedLoops) {
+                const outerLoops = signedLoops.map((component) => component.negativeAreaLoops).flat();
+                if (outerLoops.length > 0)
+                    result = UnionRegion.create(...outerLoops);
+            }
+        }
         return this.simplifyRegion(result);
     }
     /**
@@ -740,13 +794,15 @@ export class RegionOps {
         if (addBridges) { // generate a temp graph to extract its bridge edges
             const context = RegionBooleanContext.create(RegionGroupOpType.Union, RegionGroupOpType.Union);
             const regions = this.collectRegionsAndClosedPrimitives(curvesAndRegions, tolerance);
-            context.addMembers(regions, undefined);
-            context.annotateAndMergeCurvesInGraph(tolerance);
-            context.graph.announceEdges((_graph, edge) => {
-                if (edge.isMaskSet(HalfEdgeMask.BRIDGE_EDGE))
-                    primitives.push(LineSegment3d.create(edge.getPoint3d(), edge.faceSuccessor.getPoint3d()));
-                return true;
-            });
+            if (regions.length > 0) {
+                context.addMembers(regions, undefined);
+                context.annotateAndMergeCurvesInGraph(tolerance);
+                context.graph.announceEdges((_graph, edge) => {
+                    if (edge.isMaskSet(HalfEdgeMask.BRIDGE_EDGE))
+                        primitives.push(LineSegment3d.create(edge.getPoint3d(), edge.faceSuccessor.getPoint3d()));
+                    return true;
+                });
+            }
         }
         const intersections = CurveCurve.allIntersectionsAmongPrimitivesXY(primitives, tolerance);
         const graph = PlanarSubdivision.assembleHalfEdgeGraph(primitives, intersections, tolerance);
@@ -963,25 +1019,4 @@ function pushToInOnOutArrays(curve, select, arrayNegative, array0, arrayPositive
     else
         array0.push(curve);
 }
-/**
- * * Options to control method `RegionOps.consolidateAdjacentPrimitives`.
- * @public
- */
-export class ConsolidateAdjacentCurvePrimitivesOptions {
-    /** True to consolidate adjacent linear geometry into a single LineString3d. */
-    consolidateLinearGeometry = true;
-    /** True to consolidate contiguous compatible arcs into a single Arc3d. */
-    consolidateCompatibleArcs = true;
-    /**
-     * True to attempt consolidation of the first and last primitives of a [[Loop]] or physically closed linestring data,
-     * allowing location of the seam to change.
-     */
-    consolidateLoopSeam = false;
-    /** Disable LineSegment3d and LineString3d point compression. */
-    disableLinearCompression = false;
-    /** Tolerance for detecting identical points. */
-    duplicatePointTolerance = Geometry.smallMetricDistance;
-    /** Tolerance for removing interior colinear points (if `!disableLinearCompression`). */
-    colinearPointTolerance = Geometry.smallMetricDistance;
-}
 //# sourceMappingURL=RegionOps.js.map