@itwin/core-geometry 4.1.0-dev.6 → 4.1.0-dev.63

package/lib/cjs/curve/RegionOps.js.map

@@ -1 +1 @@
-{"version":3,"file":"RegionOps.js","sourceRoot":"","sources":["../../../src/curve/RegionOps.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F;;GAEG;AAEH,0CAAuC;AACvC,qEAAkE;AAClE,6EAA0E;AAC1E,2EAAwE;AACxE,mEAAwD;AACxD,mGAA2F;AAC3F,+CAA8C;AAC9C,mEAAgE;AAChE,uDAAoD;AACpD,yDAAsD;AAEtD,iEAA8D;AAC9D,6CAA0E;AAC1E,yEAAsE;AACtE,6DAA4G;AAC5G,mEAAgE;AAEhE,uDAAwH;AACxH,6CAA0C;AAC1C,qDAAkD;AAClD,+DAA4D;AAC5D,mDAAgD;AAChD,gFAAuE;AACvE,kFAA6I;AAC7I,iDAA8C;AAC9C,iCAA2C;AAC3C,iDAA8C;AAC9C,iCAA8B;AAC9B,uGAAyG;AACzG,iEAA8D;AAC9D,mDAAyD;AACzD,iEAA8D;AAC9D,uDAAoD;AACpD,mFAAqH;AACrH,+CAA4C;AAiB5C;;;GAGG;AACH,IAAY,kBAMX;AAND,WAAY,kBAAkB;IAC5B,6DAAS,CAAA;IACT,+DAAU,CAAA;IACV,2EAAgB,CAAA;IAChB,iEAAW,CAAA;IACX,iEAAW,CAAA;AACb,CAAC,EANW,kBAAkB,GAAlB,0BAAkB,KAAlB,0BAAkB,QAM7B;AAED;;;;;;;;;GASG;AACH,MAAa,SAAS;IACpB;;;;;OAKG;IACI,MAAM,CAAC,oBAAoB,CAAC,IAAe;QAChD,MAAM,OAAO,GAAG,IAAI,iCAAe,EAAE,CAAC;QACtC,MAAM,MAAM,GAAG,IAAI,CAAC,yBAAyB,CAAC,OAAO,CAAC,CAAC;QACvD,IAAI,MAAM,YAAY,uBAAU,EAAE;YAChC,MAAM,CAAC,kCAAkC,EAAE,CAAC;YAC5C,OAAO,MAAM,CAAC;SACf;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;MAGE;IACK,MAAM,CAAC,sBAAsB,CAAC,KAAc,EAAE,oBAA4B,mBAAQ,CAAC,mBAAmB;QAC3G,+GAA+G;QAC/G,MAAM,WAAW,GAAG,GAAG,GAAG,iBAAiB,CAAC;QAC5C,OAAO,WAAW,GAAG,CAAC,KAAK,CAAC,OAAO,EAAE,GAAG,KAAK,CAAC,OAAO,EAAE,GAAG,WAAW,CAAC,CAAC;IACzE,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,aAAa,CAAC,IAAe;QACzC,MAAM,OAAO,GAAG,IAAI,iCAAe,EAAE,CAAC;QACtC,MAAM,MAAM,GAAG,IAAI,CAAC,yBAAyB,CAAC,OAAO,CAAC,CAAC;QACvD,IAAI,MAAM,YAAY,uBAAU,EAAE;YAChC,OAAO,MAAM,CAAC,WAAW,CAAC;SAC3B;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,wBAAwB,CAAC,IAAc;QACnD,MAAM,OAAO,GAAG,IAAI,yCAAmB,EAAE,CAAC;QAC1C,OAAO,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;QAC1B,MAAM,MAAM,GAAG,OAAO,CAAC,UAAU,CAAC;QAClC,MAAM,CAAC,kCAAkC,EAAE,CAAC;QAC5C,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;OAGG;IACI,MAAM,CAAC,eAAe,CAAC,KAAoB,EAAE,IAAgC,EAAE,oBAAoE;QACxJ,IAAI,IAAI,YAAY,WAAI,EAAE;YACxB,MAAM,MAAM,GAAG,IAAI,CAAC,gBAAgB,EAAE,CAAC;YACvC,IAAI,MAAM;gBACR,IAAI,CAAC,eAAe,CAAC,KAAK,EAAE,MAAM,EAAE,oBAAoB,CAAC,CAAC;SAC7D;aAAM,IAAI,IAAI,YAAY,2BAAY,EAAE;YACvC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE;gBACjC,MAAM,MAAM,GAAG,KAAK,CAAC,gBAAgB,EAAE,CAAC;gBACxC,IAAI,MAAM;oBACR,IAAI,CAAC,eAAe,CAAC,KAAK,EAAE,MAAM,EAAE,oBAAoB,CAAC,CAAC;aAC7D;SACF;aAAM,IAAI,IAAI,YAAY,2CAAoB,EAAE;YAC/C,MAAM,QAAQ,GAAG,4BAAY,CAAC,mCAAmC,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;YAC/E,IAAI,QAAQ,KAAK,SAAS;gBACxB,oBAAoB,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;SACzC;aAAM,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;YAC9B,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE;gBACnB,IAAI,yBAAO,CAAC,uBAAuB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE;oBAC5C,MAAM,QAAQ,GAAG,4BAAY,CAAC,mCAAmC,CAAC,KAAK,EAAE,IAA6B,CAAC,CAAC;oBACxG,IAAI,QAAQ,KAAK,SAAS;wBACxB,oBAAoB,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;iBAEzC;qBAAM,IAAI,IAAI,CAAC,CAAC,CAAC,YAAY,2CAAoB,EAAE;oBAClD,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE;wBACvB,MAAM,QAAQ,GAAG,4BAAY,CAAC,mCAAmC,CAAC,KAAK,EAAE,IAA4B,CAAC,CAAC;wBACvG,IAAI,QAAQ,KAAK,SAAS;4BACxB,oBAAoB,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;qBACzC;iBACF;qBAAM;oBACL,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE;wBACxB,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;4BACtB,IAAI,CAAC,eAAe,CAAC,KAAK,EAAE,KAAmC,EAAE,oBAAoB,CAAC,CAAC;qBAC1F;iBACF;aACF;SACF;IACH,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,0BAA0B,CAAC,KAAoB,EAAE,IAAgC,EAAE,IAAkB,EAAE,OAAY;QAC/H,MAAM,SAAS,GAAe,EAAE,CAAC;QACjC,IAAI,CAAC,eAAe,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC,MAAqB,EAAE,IAAc,EAAE,EAAE;YAC1E,IAAI,IAAI,EAAE;gBACR,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACrB,IAAI,CAAC,2BAA2B,CAAC,IAAI,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC;aACvD;QACH,CAAC,CAAC,CAAC;QACH,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC;YACtB,OAAO,SAAS,CAAC;QACnB,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;OAMG;IACK,MAAM,CAAC,qBAAqB,CAAC,KAAgC,EAAE,WAAoB;QACzF,IAAI,KAAK,EAAE;YACT,IAAI,WAAW,EAAE;gBACf,4BAAY,CAAC,+BAA+B,CAAC,KAAK,CAAC,CAAC;gBACpD,4BAAY,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;aACnC;YACD,OAAO,iCAAe,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC;SAC/C;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,qCAAqC,CAAC,MAAkC,EAAE,MAAkC,EAAE,cAAuB,KAAK;QACtJ,MAAM,KAAK,GAAG,yDAAyB,CAAC,gBAAgB,CAAC,MAAM,EAAE,MAAM,EACrE,CAAC,GAAY,EAAE,GAAY,EAAE,EAAE,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,EAC5C,IAAI,CAAC,wBAAwB,CAAC,CAAC;QACjC,OAAO,IAAI,CAAC,qBAAqB,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC;IACxD,CAAC;IAED;;;;;;;;OAQG;IACI,MAAM,CAAC,iCAAiC,CAAC,MAAkC,EAAE,MAAkC,EAAE,cAAuB,KAAK;QAClJ,MAAM,KAAK,GAAG,yDAAyB,CAAC,gBAAgB,CAAC,MAAM,EAAE,MAAM,EACrE,CAAC,GAAY,EAAE,GAAY,EAAE,EAAE,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,EAC5C,IAAI,CAAC,wBAAwB,CAAC,CAAC;QACjC,OAAO,IAAI,CAAC,qBAAqB,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC;IACxD,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,sCAAsC,CAAC,MAAkC,EAAE,MAAkC,EAAE,cAAuB,KAAK;QACvJ,MAAM,KAAK,GAAG,yDAAyB,CAAC,gBAAgB,CAAC,MAAM,EAAE,MAAM,EACrE,CAAC,GAAY,EAAE,GAAY,EAAE,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAC7C,IAAI,CAAC,wBAAwB,CAAC,CAAC;QACjC,OAAO,IAAI,CAAC,qBAAqB,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC;IACxD,CAAC;IAED;;;;;;;;;OASG;IACI,MAAM,CAAC,eAAe,CAAC,MAA2C,EAAE,MAA2C,EAAE,SAA6B,EAAE,iBAAyB,mBAAQ,CAAC,mBAAmB;QAC1M,MAAM,MAAM,GAAG,yBAAW,CAAC,MAAM,EAAE,CAAC;QACpC,MAAM,OAAO,GAAG,oDAAoB,CAAC,MAAM,CAAC,iDAAiB,CAAC,KAAK,EAAE,iDAAiB,CAAC,KAAK,CAAC,CAAC;QAC9F,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QACnC,OAAO,CAAC,6BAA6B,CAAC,cAAc,CAAC,CAAC;QACtD,MAAM,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC;QACnE,MAAM,OAAO,GAAG,IAAI,CAAC,sBAAsB,CAAC,KAAK,EAAE,cAAc,CAAC,CAAC;QACnE,OAAO,CAAC,sBAAsB,CAAC,SAAS,EAAE,CAAC,MAAqB,EAAE,IAAc,EAAE,QAAoB,EAAE,IAAY,EAAE,EAAE;YACtH,kFAAkF;YAClF,IAAI,IAAI,CAAC,oBAAoB,EAAE,GAAG,CAAC;gBACjC,OAAO;YACT,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,OAAO;gBAC1B,OAAO;YACT,IAAI,QAAQ,KAAK,CAAC,EAAE;gBAClB,MAAM,IAAI,GAAG,qCAAiB,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC;gBACtD,IAAI,IAAI;oBACN,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;aAC5B;QACH,CAAC,CAAC,CAAC;QACH,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;;;;;;;OAWG;IACI,MAAM,CAAC,0BAA0B,CAAC,MAAoC,EAAE,SAA6B,EAC1G,MAAoC,EAAE,cAAuB,KAAK;QAClE,MAAM,KAAK,GAAG,yDAAyB,CAAC,qCAAqC,CAC3E,MAAM,EAAE,iDAAiB,CAAC,KAAK,EAC/B,SAAS,EACT,MAAM,EAAE,iDAAiB,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;QACzC,OAAO,IAAI,CAAC,qBAAqB,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC;IACxD,CAAC;IACD;;;;;;;;;;OAUG;IACI,MAAM,CAAC,uBAAuB,CACnC,MAAoC,EACpC,SAA6B,EAC7B,MAAoC;QACpC,MAAM,KAAK,GAAG,yDAAyB,CAAC,qCAAqC,CAC3E,MAAM,EAAE,iDAAiB,CAAC,KAAK,EAC/B,SAAS,EACT,MAAM,EAAE,iDAAiB,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;QACzC,IAAI,CAAC,KAAK;YACR,OAAO,SAAS,CAAC;QACnB,MAAM,SAAS,GAAG,yCAAmB,CAAC,mCAAmC,CAAC,KAAK,EAAE,oBAAY,CAAC,QAAQ,CAAC,CAAC;QACxG,MAAM,QAAQ,GAAW,EAAE,CAAC;QAC5B,KAAK,MAAM,SAAS,IAAI,SAAS,EAAE;YACjC,MAAM,MAAM,GAAG,IAAI,mCAAgB,EAAE,CAAC;YACtC,KAAK,MAAM,IAAI,IAAI,SAAS;gBAC1B,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;YACzC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;YACnB,MAAM,IAAI,GAAG,WAAI,CAAC,MAAM,EAAE,CAAC;YAC3B,IAAI,CAAC,WAAW,CAAC,2BAAY,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC;YACrD,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;SACrB;QACD,OAAO,SAAS,CAAC,uBAAuB,CAAC,QAAQ,CAAC,CAAC;IACrD,CAAC;IAED;;;;;;;OAOG;IACI,MAAM,CAAC,4BAA4B,CAAC,MAAiB,EAAE,IAAa,EAAE,cAAsB;QACjG,MAAM,OAAO,GAAG,IAAI,+CAAwB,EAAE,CAAC;QAC/C,OAAO,OAAO,CAAC,4BAA4B,CAAC,MAAM,EAAE,IAAI,EAAE,cAAc,CAAC,CAAC;IAC5E,CAAC;IACD;;;;;;;;;;;;;KAaC;IACM,MAAM,CAAC,sBAAsB,CAAC,MAAmB,EAAE,uBAA8D;QACtH,OAAO,kDAA2B,CAAC,sBAAsB,CAAC,MAAM,EAAE,uBAAuB,CAAC,CAAC;IAC7F,CAAC;IACD;;;;;;OAMG;IACI,MAAM,CAAC,wBAAwB,CAAC,MAAiB,EAAE,CAAS,EAAE,CAAS;QAC5E,OAAO,gCAAmB,CAAC,wBAAwB,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IACpE,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,2BAA2B,CAAC,MAAwB,EAAE,OAAgB,IAAI,EAAE,gCAAyC,KAAK;QACtI,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;QACxB,IAAI,CAAC,KAAK,CAAC;YACT,OAAO,SAAS,CAAC;QACnB,IAAI,MAAM,GAAG,GAAG,CAAC;QACjB,IAAI,MAAM,GAAG,KAAK,CAAC;QACnB,IAAI,IAAI;YACN,MAAM,GAAG,mBAAQ,CAAC,KAAK,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;QAC7F,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YAC5B,MAAM,GAAG,mBAAQ,CAAC,KAAK,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;QAC7F,IAAI,UAAqC,CAAC;QAC1C,IAAI,mBAAQ,CAAC,qBAAqB,CAAC,MAAM,CAAC,EAAE;YAC1C,UAAU,GAAG,IAAI,CAAC,CAAC,CAAC,WAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,WAAI,CAAC,MAAM,EAAE,CAAC;YAClD,MAAM,GAAG,IAAI,CAAC;SACf;aAAM;YACL,UAAU,GAAG,6BAAW,CAAC,MAAM,EAAE,CAAC;SACnC;QACD,KAAK,MAAM,CAAC,IAAI,MAAM;YACpB,UAAU,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;QAC5B,IAAI,MAAM,IAAI,6BAA6B;YACzC,SAAS,CAAC,6BAA6B,CAAC,UAAU,CAAC,CAAC;QACtD,OAAO,UAAU,CAAC;IACpB,CAAC;IAGD;;;OAGG;IACI,MAAM,CAAC,qBAAqB,CAAC,CAA2B,IAAI,IAAI,CAAC,wBAAwB,GAAG,CAAC,CAAC,CAAC,CAAC;IACvG;;;;;;;;OAQG;IACI,MAAM,CAAC,uBAAuB,CAAC,WAAiC,EAAE,YAA6B;QACpG,OAAO,qCAAiB,CAAC,uBAAuB,CAAC,WAAW,EAAE,YAAY,CAAC,CAAC;IAC9E,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,yBAAyB,CAAC,MAA4B,EAAE,UAAmB;QACvF,IAAI,MAAM,KAAK,SAAS;YACtB,OAAO,SAAS,CAAC;QACnB,IAAI,MAAM,YAAY,+BAAc;YAClC,OAAO,MAAM,CAAC;QAChB,+BAA+B;QAC/B,MAAM,UAAU,GAAG,MAAM,CAAC,sBAAsB,EAAE,CAAC;QACnD,MAAM,cAAc,GAAG,IAAI,6CAAqB,CAAC,UAAU,CAAC,CAAC;QAC7D,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE;YAClC,cAAc,CAAC,sBAAsB,CAAC,SAAS,CAAC,CAAC;SAClD;QACD,OAAO,cAAc,CAAC,UAAU,EAAE,CAAC;IACrC,CAAC;IACD;;;;;;;OAOG;IACI,MAAM,CAAC,8BAA8B,CAAC,SAAqB,EAAE,cAAsB,EAAE,YAAoB;QAC9G,OAAO,mCAAa,CAAC,8BAA8B,CAAC,SAAS,EAAE,cAAc,EAAE,YAAY,CAAC,CAAC;IAC/F,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,aAAa,CAAC,SAAqB,EAAE,eAAuB,mBAAQ,CAAC,mBAAmB;QACpG,OAAO,mCAAa,CAAC,aAAa,CAAC,SAAS,EAAE,YAAY,CAAC,CAAC;IAC9D,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,2BAA2B,CAAC,WAAiC,EAAE,MAAiB;QAC5F,MAAM,MAAM,GAAG,EAAE,WAAW,EAAE,EAAE,EAAE,YAAY,EAAE,EAAE,EAAE,eAAe,EAAE,EAAE,EAAE,CAAC;QAC1E,MAAM,0BAA0B,GAAG,SAAS,CAAC,uBAAuB,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;QAC1F,MAAM,UAAU,GAAG,SAAS,CAAC,yBAAyB,CAAC,0BAA0B,EAAE,IAAI,CAAC,CAAC;QACzF,IAAI,UAAU,YAAY,iCAAe,EAAE;YACzC,KAAK,MAAM,KAAK,IAAI,UAAU,CAAC,QAAQ,EAAE;gBACvC,MAAM,YAAY,GAAG,iCAAe,CAAC,4CAA4C,CAAC,KAAK,CAAC,CAAC;gBACzF,IAAI,YAAY,EAAE;oBAChB,MAAM,OAAO,GAAG,SAAS,CAAC,wBAAwB,CAAC,MAAM,EAAE,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;oBACvG,mBAAmB,CAAC,KAAK,EAAE,OAAO,EAAE,MAAM,CAAC,YAAY,EAAE,MAAM,CAAC,eAAe,EAAE,MAAM,CAAC,WAAW,CAAC,CAAC;iBACtG;aACF;SACF;aAAM,IAAI,UAAU,YAAY,+BAAc,EAAE;YAC/C,MAAM,YAAY,GAAG,iCAAe,CAAC,4CAA4C,CAAC,UAAU,CAAC,CAAC;YAC9F,IAAI,YAAY,EAAE;gBAChB,MAAM,OAAO,GAAG,SAAS,CAAC,wBAAwB,CAAC,MAAM,EAAE,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBACvG,mBAAmB,CAAC,UAAU,EAAE,OAAO,EAAE,MAAM,CAAC,YAAY,EAAE,MAAM,CAAC,eAAe,EAAE,MAAM,CAAC,WAAW,CAAC,CAAC;aAC3G;SACF;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;;;;;;;;OAYG;IACI,MAAM,CAAC,sBAAsB,CAAC,IAAiD,EAAE,sBAA+B,IAAI;QACzH,IAAI,IAAI,YAAY,2BAAY,EAAE;YAChC,OAAO,IAAI,CAAC,sBAAsB,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;SACvD;aAAM,IAAI,IAAI,YAAY,2CAAoB,EAAE;YAC/C,IAAI,SAAS,CAAC;YACd,IAAI,mBAAmB,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE;gBAC5C,IAAI,CAAC,mBAAQ,CAAC,qBAAqB,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAC,EAAE,CAAC,CAAE,CAAC;oBACjE,OAAO,SAAS,CAAC;gBACnB,SAAS,GAAG,IAAI,CAAC;aAClB;iBAAM,IAAI,CAAC,mBAAmB,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE;gBACpD,SAAS,GAAG,IAAI,CAAC;aAClB;iBAAM,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE;gBACtD,OAAO,SAAS,CAAC;aAClB;iBAAM;gBACL,SAAS,GAAG,mCAAgB,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;gBAC1C,4DAA0B,CAAC,gCAAgC,CAAC,SAAS,EAAE,mBAAQ,CAAC,mBAAmB,CAAC,CAAC;gBACrG,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;oBAClD,OAAO,SAAS,CAAC;aACpB;YACD,MAAM,QAAQ,GAAG,SAAS,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAE,CAAC;YACnD,MAAM,QAAQ,GAAG,SAAS,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAE,CAAC;YACnD,MAAM,QAAQ,GAAG,SAAS,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAE,CAAC;YACnD,MAAM,YAAY,GAAG,QAAQ,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC;YACrD,IAAI,YAAY,CAAC,gBAAgB,EAAE;mBAC9B,QAAQ,CAAC,aAAa,CAAC,QAAQ,CAAC;mBAChC,QAAQ,CAAC,iBAAiB,CAAC,QAAQ,CAAC,EAAE;gBACzC,OAAO,qBAAS,CAAC,4BAA4B,CAAC,SAAS,CAAC,+BAA+B,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,QAAQ,EAAE,YAAY,CAAC,CAAC;aAC/H;SACF;aAAM,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;YAC9B,OAAO,IAAI,CAAC,sBAAsB,CAAC,IAAI,yCAAmB,CAAC,IAAI,CAAC,EAAE,mBAAmB,CAAC,CAAC;SACxF;aAAM,IAAI,IAAI,YAAY,WAAI,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,YAAY,2BAAY,EAAE;YACzG,OAAO,IAAI,CAAC,sBAAsB,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;SACzE;aAAM,IAAI,IAAI,YAAY,WAAI,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,YAAY,2BAAY,EAAE;YACzG,OAAO,IAAI,CAAC,sBAAsB,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,YAAY,EAAE,mBAAmB,CAAC,CAAC;SACxF;aAAM,IAAI,IAAI,YAAY,4BAAU,EAAE;YACrC,IAAI,CAAC,IAAI,CAAC,2BAA2B,EAAE,EAAE;gBACvC,4CAA4C;gBAC5C,MAAM,OAAO,GAAG,IAAI,CAAC,gBAAgB,EAAE,CAAC;gBACxC,IAAI,OAAO,EAAE;oBACX,OAAO,IAAI,CAAC,sBAAsB,CAAC,OAAO,CAAC,CAAC;iBAC7C;aACF;SACF;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;;;;;OAUG;IACI,MAAM,CAAC,6BAA6B,CAAC,MAAuB,EAAE,OAAmD;QACtH,MAAM,OAAO,GAAG,IAAI,gFAAyC,CAAC,OAAO,CAAC,CAAC;QACvE,MAAM,CAAC,yBAAyB,CAAC,OAAO,CAAC,CAAC;IAC5C,CAAC;IACD;;;;;;;;;OASG;IACI,MAAM,CAAC,uBAAuB,CAAC,KAAyC;QAC7E,MAAM,WAAW,GAAsB,EAAE,CAAC;QAC1C,KAAK,MAAM,SAAS,IAAI,KAAK,EAAE;YAC7B,IAAI,SAAS,YAAY,WAAI;gBAC3B,iCAAe,CAAC,QAAQ,CAAC,WAAW,EAAE,SAAS,CAAC,CAAC;iBAC9C,IAAI,SAAS,YAAY,2CAAoB,EAAE;gBAClD,MAAM,IAAI,GAAG,WAAI,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC;gBAC3C,iCAAe,CAAC,QAAQ,CAAC,WAAW,EAAE,IAAI,CAAC,CAAC;aAC7C;SACF;QACD,OAAO,iCAAe,CAAC,eAAe,CAAC,WAAW,CAAC,CAAC;IACtD,CAAC;IACD;;;;;;;;;;;;;OAaG;IACI,MAAM,CAAC,yBAAyB,CAAC,gBAAuC,EAAE,YAAoB,mBAAQ,CAAC,mBAAmB;QAC/H,MAAM,UAAU,GAAG,SAAS,CAAC,sBAAsB,CAAC,gBAAgB,EAAE,SAAS,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;QAC7F,MAAM,KAAK,GAAG,IAAI,CAAC,eAAe,CAAC,UAAU,CAAC,CAAC;QAC/C,MAAM,OAAO,GAAG,IAAI,CAAC,sBAAsB,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;QAC9D,MAAM,aAAa,GAAG,uBAAU,CAAC,iCAAiC,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC;QAC1F,MAAM,KAAK,GAAG,qCAAiB,CAAC,qBAAqB,CAAC,UAAU,EAAE,aAAa,EAAE,SAAS,CAAC,CAAC;QAC5F,OAAO,qCAAiB,CAAC,oCAAoC,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;IAChF,CAAC;IAED;;;;;;;;OAQG;IACI,MAAM,CAAC,sBAAsB,CAAC,UAAiC,EAAE,cAAiC,EACvG,6BAAsC,KAAK,EAC3C,qBAA8B,KAAK;QACnC,MAAM,OAAO,GAAqB,cAAc,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,cAAc,CAAC;QACrF,IAAI,UAAU,YAAY,+BAAc,EAAE;YACxC,UAAU,CAAC,sBAAsB,CAAC,OAAO,EAAE,0BAA0B,EAAE,kBAAkB,CAAC,CAAC;SAC5F;aAAM,IAAI,UAAU,YAAY,iCAAe,EAAE;YAChD,UAAU,CAAC,sBAAsB,CAAC,OAAO,EAAE,0BAA0B,EAAE,kBAAkB,CAAC,CAAC;SAC5F;aAAM,IAAI,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,EAAE;YACpC,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE;gBAC1B,IAAI,CAAC,sBAAsB,CAAC,CAAC,EAAE,OAAO,EAAE,0BAA0B,EAAE,kBAAkB,CAAC,CAAC;aACzF;SACF;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,iBAAiB,CAAC,UAA4B;QAC1D,MAAM,MAAM,GAAqB,EAAE,CAAC;QACpC,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE;YAC1B,IAAI,CAAC,YAAY,2BAAY,EAAE;gBAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;oBAClD,MAAM,CAAC,GAAG,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC;oBACjC,IAAI,CAAC,KAAK,SAAS;wBACjB,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;iBAClB;aACF;iBAAM;gBACL,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;aAChB;SACF;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,eAAe,CAAC,IAAS,EAAE,YAAwB;QAC/D,MAAM,KAAK,GAAG,eAAO,CAAC,MAAM,EAAE,CAAC;QAC/B,IAAI,IAAI,YAAY,6BAAa;YAC/B,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC;aACnC,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;YAC5B,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE;gBACpB,IAAI,CAAC,YAAY,6BAAa;oBAC5B,CAAC,CAAC,WAAW,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC;qBAChC,IAAI,CAAC,YAAY,yBAAO;oBAC3B,KAAK,CAAC,WAAW,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC;qBAChC,IAAI,CAAC,YAAY,mCAAgB;oBACpC,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC,CAAC;qBACzC,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;oBACvB,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC;aAC5D;SACF;QACD,OAAO,KAAK,CAAC;IACf,CAAC;CACF;AAxlBD,8BAwlBC;AAED,gBAAgB;AAChB,SAAS,mBAAmB,CAAC,KAAe,EAAE,MAAc,EAAE,aAAyB,EAAE,MAAkB,EAAE,aAAyB;IACpI,IAAI,MAAM,GAAG,CAAC;QACZ,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;SACvB,IAAI,MAAM,GAAG,CAAC;QACjB,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;;QAE1B,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;AACvB,CAAC","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\nimport { Geometry } from \"../Geometry\";\r\nimport { GrowableXYZArray } from \"../geometry3d/GrowableXYZArray\";\r\nimport { IndexedXYZCollection } from \"../geometry3d/IndexedXYZCollection\";\r\nimport { Point3dArrayCarrier } from \"../geometry3d/Point3dArrayCarrier\";\r\nimport { Point3d } from \"../geometry3d/Point3dVector3d\";\r\nimport { PolylineCompressionContext } from \"../geometry3d/PolylineCompressionByEdgeOffset\";\r\nimport { Range3d } from \"../geometry3d/Range\";\r\nimport { SortablePolygon } from \"../geometry3d/SortablePolygon\";\r\nimport { Transform } from \"../geometry3d/Transform\";\r\nimport { MomentData } from \"../geometry4d/MomentData\";\r\nimport { Polyface } from \"../polyface/Polyface\";\r\nimport { PolyfaceBuilder } from \"../polyface/PolyfaceBuilder\";\r\nimport { HalfEdge, HalfEdgeGraph, HalfEdgeMask } from \"../topology/Graph\";\r\nimport { HalfEdgeGraphSearch } from \"../topology/HalfEdgeGraphSearch\";\r\nimport { LineStringDataVariant, MultiLineStringDataVariant, Triangulator } from \"../topology/Triangulation\";\r\nimport { ChainCollectorContext } from \"./ChainCollectorContext\";\r\nimport { AnyCurve, AnyRegion } from \"./CurveChain\";\r\nimport { BagOfCurves, ConsolidateAdjacentCurvePrimitivesOptions, CurveChain, CurveCollection } from \"./CurveCollection\";\r\nimport { CurveCurve } from \"./CurveCurve\";\r\nimport { CurvePrimitive } from \"./CurvePrimitive\";\r\nimport { CurveWireMomentsXYZ } from \"./CurveWireMomentsXYZ\";\r\nimport { GeometryQuery } from \"./GeometryQuery\";\r\nimport { OffsetHelpers } from \"./internalContexts/MultiChainCollector\";\r\nimport { CurveChainWireOffsetContext, JointOptions, OffsetOptions, PolygonWireOffsetContext } from \"./internalContexts/PolygonOffsetContext\";\r\nimport { LineString3d } from \"./LineString3d\";\r\nimport { Loop, SignedLoops } from \"./Loop\";\r\nimport { ParityRegion } from \"./ParityRegion\";\r\nimport { Path } from \"./Path\";\r\nimport { ConsolidateAdjacentCurvePrimitivesContext } from \"./Query/ConsolidateAdjacentPrimitivesContext\";\r\nimport { CurveSplitContext } from \"./Query/CurveSplitContext\";\r\nimport { PointInOnOutContext } from \"./Query/InOutTests\";\r\nimport { PlanarSubdivision } from \"./Query/PlanarSubdivision\";\r\nimport { RegionMomentsXY } from \"./RegionMomentsXY\";\r\nimport { RegionBooleanContext, RegionGroupOpType, RegionOpsFaceToFaceSearch } from \"./RegionOpsClassificationSweeps\";\r\nimport { UnionRegion } from \"./UnionRegion\";\r\n\r\n/**\r\n * Possible return types from [[splitToPathsBetweenBreaks]], [[collectInsideAndOutsideOffsets]] and [[collectChains]].\r\n * @public\r\n */\r\nexport type ChainTypes = CurvePrimitive | Path | BagOfCurves | Loop | undefined;\r\n\r\n/**\r\n * * `properties` is a string with special characters indicating\r\n *   * \"U\" -- contains unmerged stick data\r\n *   * \"M\" -- merged\r\n *   * \"R\" -- regularized\r\n *   * \"X\" -- has exterior markup\r\n * @internal\r\n */\r\nexport type GraphCheckPointFunction = (name: string, graph: HalfEdgeGraph, properties: string, extraData?: any) => any;\r\n/**\r\n * Enumeration of the binary operation types for a booleans among regions\r\n * @public\r\n */\r\nexport enum RegionBinaryOpType {\r\n  Union = 0,\r\n  Parity = 1,\r\n  Intersection = 2,\r\n  AMinusB = 3,\r\n  BMinusA = 4,\r\n}\r\n\r\n/**\r\n * Class `RegionOps` has static members for calculations on regions (areas).\r\n * * Regions are represented by these `CurveCollection` subclasses:\r\n *   * `Loop` -- a single loop\r\n *   * `ParityRegion` -- a collection of loops, interpreted by parity rules.\r\n * The common \"One outer loop and many Inner loops\" is a parity region.\r\n *   * `UnionRegion` -- a collection of `Loop` and `ParityRegion` objects understood as a (probably disjoint) union.\r\n * * Most of the methods in this class ignore z-coordinates, so callers should ensure that input geometry has been rotated parallel to the xy-plane.\r\n * @public\r\n */\r\nexport class RegionOps {\r\n  /**\r\n   * Return moment sums for a loop, parity region, or union region.\r\n   * * If `rawMomentData` is the MomentData returned by computeXYAreaMoments, convert to principal axes and moments with\r\n   *    call `principalMomentData = MomentData.inertiaProductsToPrincipalAxes (rawMomentData.origin, rawMomentData.sums);`\r\n   * @param root any Loop, ParityRegion, or UnionRegion.\r\n   */\r\n  public static computeXYAreaMoments(root: AnyRegion): MomentData | undefined {\r\n    const handler = new RegionMomentsXY();\r\n    const result = root.dispatchToGeometryHandler(handler);\r\n    if (result instanceof MomentData) {\r\n      result.shiftOriginAndSumsToCentroidOfSums();\r\n      return result;\r\n    }\r\n    return undefined;\r\n  }\r\n  /** Return an area tolerance for a given xy-range and optional distance tolerance.\r\n   * @param range range of planar region to tolerance\r\n   * @param distanceTolerance optional absolute distance tolerance\r\n  */\r\n  public static computeXYAreaTolerance(range: Range3d, distanceTolerance: number = Geometry.smallMetricDistance): number {\r\n    // 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).\r\n    const halfDistTol = 0.5 * distanceTolerance;\r\n    return halfDistTol * (range.xLength() + range.yLength() + halfDistTol);\r\n  }\r\n  /**\r\n   * Return an xy area for a loop, parity region, or union region.\r\n   * * If `rawMomentData` is the MomentData returned by computeXYAreaMoments, convert to principal axes and moments with\r\n   *    call `principalMomentData = MomentData.inertiaProductsToPrincipalAxes (rawMomentData.origin, rawMomentData.sums);`\r\n   * @param root any Loop, ParityRegion, or UnionRegion.\r\n   */\r\n  public static computeXYArea(root: AnyRegion): number | undefined {\r\n    const handler = new RegionMomentsXY();\r\n    const result = root.dispatchToGeometryHandler(handler);\r\n    if (result instanceof MomentData) {\r\n      return result.quantitySum;\r\n    }\r\n    return undefined;\r\n  }\r\n  /** Return MomentData with the sums of wire moments.\r\n   * * If `rawMomentData` is the MomentData returned by computeXYAreaMoments, convert to principal axes and moments with\r\n   *    call `principalMomentData = MomentData.inertiaProductsToPrincipalAxes (rawMomentData.origin, rawMomentData.sums);`\r\n   * @param root any CurveCollection or CurvePrimitive.\r\n   */\r\n  public static computeXYZWireMomentSums(root: AnyCurve): MomentData | undefined {\r\n    const handler = new CurveWireMomentsXYZ();\r\n    handler.visitLeaves(root);\r\n    const result = handler.momentData;\r\n    result.shiftOriginAndSumsToCentroidOfSums();\r\n    return result;\r\n  }\r\n\r\n  /**\r\n   * * create loops in the graph.\r\n   * @internal\r\n   */\r\n  public static addLoopsToGraph(graph: HalfEdgeGraph, data: MultiLineStringDataVariant, announceIsolatedLoop: (graph: HalfEdgeGraph, seed: HalfEdge) => void) {\r\n    if (data instanceof Loop) {\r\n      const points = data.getPackedStrokes();\r\n      if (points)\r\n        this.addLoopsToGraph(graph, points, announceIsolatedLoop);\r\n    } else if (data instanceof ParityRegion) {\r\n      for (const child of data.children) {\r\n        const points = child.getPackedStrokes();\r\n        if (points)\r\n          this.addLoopsToGraph(graph, points, announceIsolatedLoop);\r\n      }\r\n    } else if (data instanceof IndexedXYZCollection) {\r\n      const loopSeed = Triangulator.directCreateFaceLoopFromCoordinates(graph, data);\r\n      if (loopSeed !== undefined)\r\n        announceIsolatedLoop(graph, loopSeed);\r\n    } else if (Array.isArray(data)) {\r\n      if (data.length > 0) {\r\n        if (Point3d.isAnyImmediatePointType(data[0])) {\r\n          const loopSeed = Triangulator.directCreateFaceLoopFromCoordinates(graph, data as LineStringDataVariant);\r\n          if (loopSeed !== undefined)\r\n            announceIsolatedLoop(graph, loopSeed);\r\n\r\n        } else if (data[0] instanceof IndexedXYZCollection) {\r\n          for (const loop of data) {\r\n            const loopSeed = Triangulator.directCreateFaceLoopFromCoordinates(graph, loop as IndexedXYZCollection);\r\n            if (loopSeed !== undefined)\r\n              announceIsolatedLoop(graph, loopSeed);\r\n          }\r\n        } else {\r\n          for (const child of data) {\r\n            if (Array.isArray(child))\r\n              this.addLoopsToGraph(graph, child as MultiLineStringDataVariant, announceIsolatedLoop);\r\n          }\r\n        }\r\n      }\r\n    }\r\n  }\r\n  /** Add multiple loops to a graph.\r\n   * * Apply edgeTag and mask to each edge.\r\n   * @internal\r\n   */\r\n  public static addLoopsWithEdgeTagToGraph(graph: HalfEdgeGraph, data: MultiLineStringDataVariant, mask: HalfEdgeMask, edgeTag: any): HalfEdge[] | undefined {\r\n    const loopSeeds: HalfEdge[] = [];\r\n    this.addLoopsToGraph(graph, data, (_graph: HalfEdgeGraph, seed: HalfEdge) => {\r\n      if (seed) {\r\n        loopSeeds.push(seed);\r\n        seed.setMaskAndEdgeTagAroundFace(mask, edgeTag, true);\r\n      }\r\n    });\r\n    if (loopSeeds.length > 0)\r\n      return loopSeeds;\r\n    return undefined;\r\n  }\r\n  /**\r\n   * Given a graph just produced by booleans, convert to a polyface\r\n   * * \"just produced\" implies exterior face markup.\r\n   *\r\n   * @param graph\r\n   * @param triangulate\r\n   */\r\n  private static finishGraphToPolyface(graph: HalfEdgeGraph | undefined, triangulate: boolean): Polyface | undefined {\r\n    if (graph) {\r\n      if (triangulate) {\r\n        Triangulator.triangulateAllPositiveAreaFaces(graph);\r\n        Triangulator.flipTriangles(graph);\r\n      }\r\n      return PolyfaceBuilder.graphToPolyface(graph);\r\n    }\r\n    return undefined;\r\n  }\r\n  /**\r\n   * Return a polyface containing the area intersection of two XY regions.\r\n   * * Within each region, in and out is determined by parity rules.\r\n   *   * Any face that is an odd number of crossings from the far outside is IN\r\n   *   * Any face that is an even number of crossings from the far outside is OUT\r\n   * @param loopsA first set of loops\r\n   * @param loopsB second set of loops\r\n   * @param triangulate whether to triangulate the result\r\n   */\r\n  public static polygonXYAreaIntersectLoopsToPolyface(loopsA: MultiLineStringDataVariant, loopsB: MultiLineStringDataVariant, triangulate: boolean = false): Polyface | undefined {\r\n    const graph = RegionOpsFaceToFaceSearch.doPolygonBoolean(loopsA, loopsB,\r\n      (inA: boolean, inB: boolean) => (inA && inB),\r\n      this._graphCheckPointFunction);\r\n    return this.finishGraphToPolyface(graph, triangulate);\r\n  }\r\n\r\n  /**\r\n   * Return a polyface containing the area union of two XY regions.\r\n   * * Within each region, in and out is determined by parity rules.\r\n   *   * Any face that is an odd number of crossings from the far outside is IN\r\n   *   * Any face that is an even number of crossings from the far outside is OUT\r\n   * @param loopsA first set of loops\r\n   * @param loopsB second set of loops\r\n   * @param triangulate whether to triangulate the result\r\n   */\r\n  public static polygonXYAreaUnionLoopsToPolyface(loopsA: MultiLineStringDataVariant, loopsB: MultiLineStringDataVariant, triangulate: boolean = false): Polyface | undefined {\r\n    const graph = RegionOpsFaceToFaceSearch.doPolygonBoolean(loopsA, loopsB,\r\n      (inA: boolean, inB: boolean) => (inA || inB),\r\n      this._graphCheckPointFunction);\r\n    return this.finishGraphToPolyface(graph, triangulate);\r\n  }\r\n  /**\r\n   * Return a polyface containing the area difference of two XY regions.\r\n   * * Within each region, in and out is determined by parity rules.\r\n   *   * Any face that is an odd number of crossings from the far outside is IN\r\n   *   * Any face that is an even number of crossings from the far outside is OUT\r\n   * @param loopsA first set of loops\r\n   * @param loopsB second set of loops\r\n   * @param triangulate whether to triangulate the result\r\n   */\r\n  public static polygonXYAreaDifferenceLoopsToPolyface(loopsA: MultiLineStringDataVariant, loopsB: MultiLineStringDataVariant, triangulate: boolean = false): Polyface | undefined {\r\n    const graph = RegionOpsFaceToFaceSearch.doPolygonBoolean(loopsA, loopsB,\r\n      (inA: boolean, inB: boolean) => (inA && !inB),\r\n      this._graphCheckPointFunction);\r\n    return this.finishGraphToPolyface(graph, triangulate);\r\n  }\r\n\r\n  /**\r\n   * Return areas defined by a boolean operation.\r\n   * * If there are multiple regions in loopsA, they are treated as a union.\r\n   * * If there are multiple regions in loopsB, they are treated as a union.\r\n   * @param loopsA first set of loops\r\n   * @param loopsB second set of loops\r\n   * @param operation indicates Union, Intersection, Parity, AMinusB, or BMinusA\r\n   * @param mergeTolerance absolute distance tolerance for merging loops\r\n   * @returns a region resulting from merging input loops and the boolean operation. May contain bridge edges added to connect interior loops to exterior loops.\r\n   */\r\n  public static regionBooleanXY(loopsA: AnyRegion | AnyRegion[] | undefined, loopsB: AnyRegion | AnyRegion[] | undefined, operation: RegionBinaryOpType, mergeTolerance: number = Geometry.smallMetricDistance): AnyRegion | undefined {\r\n    const result = UnionRegion.create();\r\n    const context = RegionBooleanContext.create(RegionGroupOpType.Union, RegionGroupOpType.Union);\r\n    context.addMembers(loopsA, loopsB);\r\n    context.annotateAndMergeCurvesInGraph(mergeTolerance);\r\n    const range = context.groupA.range().union(context.groupB.range());\r\n    const areaTol = this.computeXYAreaTolerance(range, mergeTolerance);\r\n    context.runClassificationSweep(operation, (_graph: HalfEdgeGraph, face: HalfEdge, faceType: -1 | 0 | 1, area: number) => {\r\n      // ignore danglers and null faces, but not 2-edge \"banana\" faces with nonzero area\r\n      if (face.countEdgesAroundFace() < 2)\r\n        return;\r\n      if (Math.abs(area) < areaTol)\r\n        return;\r\n      if (faceType === 1) {\r\n        const loop = PlanarSubdivision.createLoopInFace(face);\r\n        if (loop)\r\n          result.tryAddChild(loop);\r\n      }\r\n    });\r\n    return result;\r\n  }\r\n\r\n  /**\r\n   * Return a polyface whose facets are a boolean operation between the input regions.\r\n   * * Each of the two inputs is an array of multiple loops or parity regions.\r\n   *   * Within each of these input arrays, the various entries (loop or set of loops) are interpreted as a union.\r\n   * * In each \"array of loops and parity regions\", each entry inputA[i] or inputB[i] is one of:\r\n   *    * A simple loop, e.g. array of Point3d.\r\n   *    * Several simple loops, each of which is an array of Point3d.\r\n   * @param inputA first set of loops\r\n   * @param operation indicates Union, Intersection, Parity, AMinusB, or BMinusA\r\n   * @param inputB second set of loops\r\n   * @param triangulate whether to triangulate the result\r\n   */\r\n  public static polygonBooleanXYToPolyface(inputA: MultiLineStringDataVariant[], operation: RegionBinaryOpType,\r\n    inputB: MultiLineStringDataVariant[], triangulate: boolean = false): Polyface | undefined {\r\n    const graph = RegionOpsFaceToFaceSearch.doBinaryBooleanBetweenMultiLoopInputs(\r\n      inputA, RegionGroupOpType.Union,\r\n      operation,\r\n      inputB, RegionGroupOpType.Union, true);\r\n    return this.finishGraphToPolyface(graph, triangulate);\r\n  }\r\n  /**\r\n   * Return loops of linestrings around areas of a boolean operation between the input regions.\r\n   * * Each of the two inputs is an array of multiple loops or parity regions.\r\n   *   * Within each of these input arrays, the various entries (loop or set of loops) are interpreted as a union.\r\n   * * In each \"array of loops and parity regions\", each entry inputA[i] or inputB[i] is one of:\r\n   *    * A simple loop, e.g. array of Point3d.\r\n   *    * Several simple loops, each of which is an array of Point3d.\r\n   * @param inputA first set of loops\r\n   * @param operation indicates Union, Intersection, Parity, AMinusB, or BMinusA\r\n   * @param inputB second set of loops\r\n   */\r\n  public static polygonBooleanXYToLoops(\r\n    inputA: MultiLineStringDataVariant[],\r\n    operation: RegionBinaryOpType,\r\n    inputB: MultiLineStringDataVariant[]): AnyRegion | undefined {\r\n    const graph = RegionOpsFaceToFaceSearch.doBinaryBooleanBetweenMultiLoopInputs(\r\n      inputA, RegionGroupOpType.Union,\r\n      operation,\r\n      inputB, RegionGroupOpType.Union, true);\r\n    if (!graph)\r\n      return undefined;\r\n    const loopEdges = HalfEdgeGraphSearch.collectExtendedBoundaryLoopsInGraph(graph, HalfEdgeMask.EXTERIOR);\r\n    const allLoops: Loop[] = [];\r\n    for (const graphLoop of loopEdges) {\r\n      const points = new GrowableXYZArray();\r\n      for (const edge of graphLoop)\r\n        points.pushXYZ(edge.x, edge.y, edge.z);\r\n      points.pushWrap(1);\r\n      const loop = Loop.create();\r\n      loop.tryAddChild(LineString3d.createCapture(points));\r\n      allLoops.push(loop);\r\n    }\r\n    return RegionOps.sortOuterAndHoleLoopsXY(allLoops);\r\n  }\r\n\r\n  /** Construct a wire (not area!!) that is offset from given polyline or polygon.\r\n   * * This is a simple wire offset, not an area.\r\n   * * The construction algorithm attempts to eliminate some self-intersections within the offsets, but does not guarantee a simple area offset.\r\n   * * The construction algorithm is subject to being changed, resulting in different (hopefully better) self-intersection behavior on the future.\r\n   * @param points a single loop or path\r\n   * @param wrap true to include wraparound\r\n   * @param offsetDistance distance of offset from wire.  Positive is left.\r\n   */\r\n  public static constructPolygonWireXYOffset(points: Point3d[], wrap: boolean, offsetDistance: number): CurveCollection | undefined {\r\n    const context = new PolygonWireOffsetContext();\r\n    return context.constructPolygonWireXYOffset(points, wrap, offsetDistance);\r\n  }\r\n  /**\r\n * Construct curves that are offset from a Path or Loop as viewed in xy-plane (ignoring z).\r\n * * The construction will remove \"some\" local effects of features smaller than the offset distance, but will not detect self intersection among widely separated edges.\r\n * * If offsetDistance is given as a number, default OffsetOptions are applied.\r\n * * When the offset needs to do an \"outside\" turn, the first applicable construction is applied:\r\n *   * If the turn is larger than `options.minArcDegrees`, a circular arc is constructed.\r\n *   * If the turn is less than or equal to `options.maxChamferTurnDegrees`, extend curves along tangent to single intersection point.\r\n *   * If the turn is larger than `options.maxChamferDegrees`, the turn is constructed as a sequence of straight lines that are:\r\n *      * outside the arc\r\n *      * have uniform turn angle less than `options.maxChamferDegrees`\r\n *      * each line segment (except first and last) touches the arc at its midpoint.\r\n * @param curves base curves.\r\n * @param offsetDistanceOrOptions offset distance (positive to left of curve, negative to right) or options object.\r\n */\r\n  public static constructCurveXYOffset(curves: Path | Loop, offsetDistanceOrOptions: number | JointOptions | OffsetOptions): CurveCollection | undefined {\r\n    return CurveChainWireOffsetContext.constructCurveXYOffset(curves, offsetDistanceOrOptions);\r\n  }\r\n  /**\r\n   * Test if point (x,y) is IN, OUT or ON a region.\r\n   * @return (1) for in, (-1) for OUT, (0) for ON\r\n   * @param curves input region\r\n   * @param x x coordinate of point to test\r\n   * @param y y coordinate of point to test\r\n   */\r\n  public static testPointInOnOutRegionXY(curves: AnyRegion, x: number, y: number): number {\r\n    return PointInOnOutContext.testPointInOnOutRegionXY(curves, x, y);\r\n  }\r\n  /** Create curve collection of subtype determined by gaps between the input curves.\r\n   * * If (a) wrap is requested and (b) all curves connect head-to-tail (including wraparound), assemble as a `loop`.\r\n   * * If all curves connect head-to-tail except for closure, return a `Path`.\r\n   * * If there are internal gaps, return a `BagOfCurves`\r\n   * * If input array has zero length, return undefined.\r\n   * @param curves input curves\r\n   * @param wrap whether to create a Loop (true) or Path (false) if maximum gap is minimal\r\n   * @param consolidateAdjacentPrimitives whether to simplify the result by calling [[consolidateAdjacentPrimitives]]\r\n   */\r\n  public static createLoopPathOrBagOfCurves(curves: CurvePrimitive[], wrap: boolean = true, consolidateAdjacentPrimitives: boolean = false): CurveCollection | undefined {\r\n    const n = curves.length;\r\n    if (n === 0)\r\n      return undefined;\r\n    let maxGap = 0.0;\r\n    let isPath = false;\r\n    if (wrap)\r\n      maxGap = Geometry.maxXY(maxGap, curves[0].startPoint().distance(curves[n - 1].endPoint()));\r\n    for (let i = 0; i + 1 < n; i++)\r\n      maxGap = Geometry.maxXY(maxGap, curves[i].endPoint().distance(curves[i + 1].startPoint()));\r\n    let collection: Loop | Path | BagOfCurves;\r\n    if (Geometry.isSmallMetricDistance(maxGap)) {\r\n      collection = wrap ? Loop.create() : Path.create();\r\n      isPath = true;\r\n    } else {\r\n      collection = BagOfCurves.create();\r\n    }\r\n    for (const c of curves)\r\n      collection.tryAddChild(c);\r\n    if (isPath && consolidateAdjacentPrimitives)\r\n      RegionOps.consolidateAdjacentPrimitives(collection);\r\n    return collection;\r\n  }\r\n\r\n  private static _graphCheckPointFunction?: GraphCheckPointFunction;\r\n  /**\r\n   * Announce Checkpoint function for use during booleans\r\n   * @internal\r\n   */\r\n  public static setCheckPointFunction(f?: GraphCheckPointFunction) { this._graphCheckPointFunction = f; }\r\n  /**\r\n   * Find all intersections among curves in `curvesToCut` and `cutterCurves` and return fragments of `curvesToCut`.\r\n   * * For a `Loop`, `ParityRegion`, or `UnionRegion` in `curvesToCut`:\r\n   *    * if it is never cut by any `cutter` curve, it will be left unchanged.\r\n   *    * if cut, the input is downgraded to a set of `Path` curves joining at the cut points.\r\n   * * All cutting is \"as viewed in the xy plane\"\r\n   * @param curvesToCut input curves to be fragmented at intersections with `cutterCurves`\r\n   * @param cutterCurves input curves to intersect with `curvesToCut`\r\n   */\r\n  public static cloneCurvesWithXYSplits(curvesToCut: AnyCurve | undefined, cutterCurves: CurveCollection): AnyCurve | undefined {\r\n    return CurveSplitContext.cloneCurvesWithXYSplits(curvesToCut, cutterCurves);\r\n  }\r\n  /**\r\n   * Create paths assembled from many curves.\r\n   * * Assemble paths from consecutive curves NOT separated by either gaps or the split markup set by [[cloneCurvesWithXYSplits]].\r\n   * * Return simplest form -- single primitive, single path, or bag of curves.\r\n   */\r\n  public static splitToPathsBetweenBreaks(source: AnyCurve | undefined, makeClones: boolean): ChainTypes {\r\n    if (source === undefined)\r\n      return undefined;\r\n    if (source instanceof CurvePrimitive)\r\n      return source;\r\n    // source is a collection .  ..\r\n    const primitives = source.collectCurvePrimitives();\r\n    const chainCollector = new ChainCollectorContext(makeClones);\r\n    for (const primitive of primitives) {\r\n      chainCollector.announceCurvePrimitive(primitive);\r\n    }\r\n    return chainCollector.grabResult();\r\n  }\r\n  /**\r\n   * Restructure curve fragments as chains, and construct (left and right) chain offsets in the xy-plane.\r\n   * * BEWARE that if the input is not a loop, the classification of outputs is suspect.\r\n   * @param fragments fragments to be chained, z-coordinates ignored\r\n   * @param offsetDistance offset distance\r\n   * @param gapTolerance absolute endpoint tolerance for computing chains\r\n   * @returns object with named chains, insideOffsets, outsideOffsets\r\n   */\r\n  public static collectInsideAndOutsideOffsets(fragments: AnyCurve[], offsetDistance: number, gapTolerance: number): { insideOffsets: AnyCurve[], outsideOffsets: AnyCurve[], chains: ChainTypes } {\r\n    return OffsetHelpers.collectInsideAndOutsideOffsets(fragments, offsetDistance, gapTolerance);\r\n  }\r\n  /**\r\n   * Restructure curve fragments as chains.\r\n   * @param fragments fragments to be chained\r\n   * @param gapTolerance absolute endpoint tolerance for computing chains\r\n   * @returns chains, possibly wrapped in BagOfCurves if there multiple chains\r\n   */\r\n  public static collectChains(fragments: AnyCurve[], gapTolerance: number = Geometry.smallMetricDistance): ChainTypes {\r\n    return OffsetHelpers.collectChains(fragments, gapTolerance);\r\n  }\r\n\r\n  /**\r\n   * Find all intersections among curves in `curvesToCut` against the boundaries of `region` and return fragments of `curvesToCut`.\r\n   * * Break `curvesToCut` into parts inside, outside, and coincident.\r\n   * @returns output object with all fragments split among `insideParts`, `outsideParts`, and `coincidentParts`\r\n   */\r\n  public static splitPathsByRegionInOnOutXY(curvesToCut: AnyCurve | undefined, region: AnyRegion): { insideParts: AnyCurve[], outsideParts: AnyCurve[], coincidentParts: AnyCurve[] } {\r\n    const result = { insideParts: [], outsideParts: [], coincidentParts: [] };\r\n    const pathWithIntersectionMarkup = RegionOps.cloneCurvesWithXYSplits(curvesToCut, region);\r\n    const splitPaths = RegionOps.splitToPathsBetweenBreaks(pathWithIntersectionMarkup, true);\r\n    if (splitPaths instanceof CurveCollection) {\r\n      for (const child of splitPaths.children) {\r\n        const pointOnChild = CurveCollection.createCurveLocationDetailOnAnyCurvePrimitive(child);\r\n        if (pointOnChild) {\r\n          const inOnOut = RegionOps.testPointInOnOutRegionXY(region, pointOnChild.point.x, pointOnChild.point.y);\r\n          pushToInOnOutArrays(child, inOnOut, result.outsideParts, result.coincidentParts, result.insideParts);\r\n        }\r\n      }\r\n    } else if (splitPaths instanceof CurvePrimitive) {\r\n      const pointOnChild = CurveCollection.createCurveLocationDetailOnAnyCurvePrimitive(splitPaths);\r\n      if (pointOnChild) {\r\n        const inOnOut = RegionOps.testPointInOnOutRegionXY(region, pointOnChild.point.x, pointOnChild.point.y);\r\n        pushToInOnOutArrays(splitPaths, inOnOut, result.outsideParts, result.coincidentParts, result.insideParts);\r\n      }\r\n    }\r\n    return result;\r\n  }\r\n  /** If `data` is one of several forms of a rectangle, return its edge Transform.\r\n   * * Points are considered a rectangle if, within the first 4 points:\r\n   *     * vectors from 0 to 1 and 0 to 3 are perpendicular and have a non-zero cross product\r\n   *     * vectors from 0 to 3 and 1 to 2 are the same\r\n   * @param data points in one of several formats:\r\n   *   * LineString\r\n   *   * Loop containing rectangle content\r\n   *   * Path containing rectangle content\r\n   *   * Array of Point3d[]\r\n   *   * IndexedXYZCollection\r\n   * @param requireClosurePoint whether to require a 5th point equal to the 1st point.\r\n   * @returns Transform with origin at one corner, x and y columns extending along two adjacent sides, and unit normal in z column. If not a rectangle, return undefined.\r\n   */\r\n  public static rectangleEdgeTransform(data: AnyCurve | Point3d[] | IndexedXYZCollection, requireClosurePoint: boolean = true): Transform | undefined {\r\n    if (data instanceof LineString3d) {\r\n      return this.rectangleEdgeTransform(data.packedPoints);\r\n    } else if (data instanceof IndexedXYZCollection) {\r\n      let dataToUse;\r\n      if (requireClosurePoint && data.length === 5) {\r\n        if (!Geometry.isSmallMetricDistance(data.distanceIndexIndex(0, 4)!))\r\n          return undefined;\r\n        dataToUse = data;\r\n      } else if (!requireClosurePoint && data.length === 4) {\r\n        dataToUse = data;\r\n      } else if (data.length < (requireClosurePoint ? 5 : 4)) {\r\n        return undefined;\r\n      } else {\r\n        dataToUse = GrowableXYZArray.create(data);\r\n        PolylineCompressionContext.compressInPlaceByShortEdgeLength(dataToUse, Geometry.smallMetricDistance);\r\n        if (dataToUse.length < (requireClosurePoint ? 5 : 4))\r\n          return undefined;\r\n      }\r\n      const vector01 = dataToUse.vectorIndexIndex(0, 1)!;\r\n      const vector03 = dataToUse.vectorIndexIndex(0, 3)!;\r\n      const vector12 = dataToUse.vectorIndexIndex(1, 2)!;\r\n      const normalVector = vector01.crossProduct(vector03);\r\n      if (normalVector.normalizeInPlace()\r\n        && vector12.isAlmostEqual(vector03)\r\n        && vector01.isPerpendicularTo(vector03)) {\r\n        return Transform.createOriginAndMatrixColumns(dataToUse.getPoint3dAtUncheckedPointIndex(0), vector01, vector03, normalVector);\r\n      }\r\n    } else if (Array.isArray(data)) {\r\n      return this.rectangleEdgeTransform(new Point3dArrayCarrier(data), requireClosurePoint);\r\n    } else if (data instanceof Loop && data.children.length === 1 && data.children[0] instanceof LineString3d) {\r\n      return this.rectangleEdgeTransform(data.children[0].packedPoints, true);\r\n    } else if (data instanceof Path && data.children.length === 1 && data.children[0] instanceof LineString3d) {\r\n      return this.rectangleEdgeTransform(data.children[0].packedPoints, requireClosurePoint);\r\n    } else if (data instanceof CurveChain) {\r\n      if (!data.checkForNonLinearPrimitives()) {\r\n        // const linestring = LineString3d.create();\r\n        const strokes = data.getPackedStrokes();\r\n        if (strokes) {\r\n          return this.rectangleEdgeTransform(strokes);\r\n        }\r\n      }\r\n    }\r\n    return undefined;\r\n  }\r\n  /**\r\n   * Look for and simplify:\r\n   * * Contiguous `LineSegment3d` and `LineString3d` objects.\r\n   *   * collect all points\r\n   *   * eliminate duplicated points\r\n   *   * eliminate points colinear with surrounding points.\r\n   *   * Contiguous concentric circular or elliptic arcs\r\n   *   * combine angular ranges\r\n   * @param curves Path or loop (or larger collection containing paths and loops) to be simplified\r\n   * @param options options for tolerance and selective simplification.\r\n   */\r\n  public static consolidateAdjacentPrimitives(curves: CurveCollection, options?: ConsolidateAdjacentCurvePrimitivesOptions) {\r\n    const context = new ConsolidateAdjacentCurvePrimitivesContext(options);\r\n    curves.dispatchToGeometryHandler(context);\r\n  }\r\n  /**\r\n   * Reverse and reorder loops in the xy-plane for consistency and containment.\r\n   * @param loops multiple loops in any order and orientation, z-coordinates ignored\r\n   * @returns a region that captures the input pointers. This region is a:\r\n   * * `Loop` if there is exactly one input loop. It is oriented counterclockwise.\r\n   * * `ParityRegion` if input consists of exactly one outer loop with at least one hole loop.\r\n   * Its first child is an outer loop oriented counterclockwise; all subsequent children are holes oriented clockwise.\r\n   * * `UnionRegion` if any other input configuration. Its children are individually ordered/oriented as in the above cases.\r\n   * @see [[PolygonOps.sortOuterAndHoleLoopsXY]]\r\n   */\r\n  public static sortOuterAndHoleLoopsXY(loops: Array<Loop | IndexedXYZCollection>): AnyRegion {\r\n    const loopAndArea: SortablePolygon[] = [];\r\n    for (const candidate of loops) {\r\n      if (candidate instanceof Loop)\r\n        SortablePolygon.pushLoop(loopAndArea, candidate);\r\n      else if (candidate instanceof IndexedXYZCollection) {\r\n        const loop = Loop.createPolygon(candidate);\r\n        SortablePolygon.pushLoop(loopAndArea, loop);\r\n      }\r\n    }\r\n    return SortablePolygon.sortAsAnyRegion(loopAndArea);\r\n  }\r\n  /**\r\n   * Find all areas bounded by the unstructured, possibly intersecting curves.\r\n   * * A common use case of this method is to assemble the bounding \"exterior\" loop (or loops) containing the input curves.\r\n   * * This method does not add bridge edges to connect outer loops to inner loops. Each disconnected loop, regardless\r\n   * of its containment, is returned as its own SignedLoops object. Pre-process with [[regionBooleanXY]] to add bridge edges so that\r\n   * [[constructAllXYRegionLoops]] will return outer and inner loops in the same SignedLoops object.\r\n   * @param curvesAndRegions Any collection of curves. Each Loop/ParityRegion/UnionRegion contributes its curve primitives.\r\n   * @param tolerance optional distance tolerance for coincidence\r\n   * @returns array of [[SignedLoops]], each entry of which describes the faces in a single connected component:\r\n   *    * `positiveAreaLoops` contains \"interior\" loops, _including holes in ParityRegion input_. These loops have positive area and counterclockwise orientation.\r\n   *    * `negativeAreaLoops` contains (probably just one) \"exterior\" loop which is ordered clockwise.\r\n   *    * `slivers` contains sliver loops that have zero area, such as appear between coincident curves.\r\n   *    * `edges` contains a [[LoopCurveLoopCurve]] object for each component edge, collecting both loops adjacent to the edge and a constituent curve in each.\r\n   */\r\n  public static constructAllXYRegionLoops(curvesAndRegions: AnyCurve | AnyCurve[], tolerance: number = Geometry.smallMetricDistance): SignedLoops[] {\r\n    const primitives = RegionOps.collectCurvePrimitives(curvesAndRegions, undefined, true, true);\r\n    const range = this.curveArrayRange(primitives);\r\n    const areaTol = this.computeXYAreaTolerance(range, tolerance);\r\n    const intersections = CurveCurve.allIntersectionsAmongPrimitivesXY(primitives, tolerance);\r\n    const graph = PlanarSubdivision.assembleHalfEdgeGraph(primitives, intersections, tolerance);\r\n    return PlanarSubdivision.collectSignedLoopSetsInHalfEdgeGraph(graph, areaTol);\r\n  }\r\n\r\n  /**\r\n   * Collect all `CurvePrimitives` in loosely typed input.\r\n   * * Always recurses into primitives within explicit collections (Path, Loop, ParityRegion, UnionRegion).\r\n   * * Optionally recurses into hidden primitives if `smallestPossiblePrimitives` is true.\r\n   * @param candidates input curves\r\n   * @param collectorArray optional pre-defined output array. If defined, it is NOT cleared: primitives are appended.\r\n   * @param smallestPossiblePrimitives if true, recurse into the children of a [[CurveChainWithDistanceIndex]]. If false, push the [[CurveChainWithDistanceIndex]] instead.\r\n   * @param explodeLinestrings if true, push a [[LineSegment3d]] for each segment of a [[LineString3d]]. If false, push the [[LineString3d]] instead.\r\n   */\r\n  public static collectCurvePrimitives(candidates: AnyCurve | AnyCurve[], collectorArray?: CurvePrimitive[],\r\n    smallestPossiblePrimitives: boolean = false,\r\n    explodeLinestrings: boolean = false): CurvePrimitive[] {\r\n    const results: CurvePrimitive[] = collectorArray === undefined ? [] : collectorArray;\r\n    if (candidates instanceof CurvePrimitive) {\r\n      candidates.collectCurvePrimitives(results, smallestPossiblePrimitives, explodeLinestrings);\r\n    } else if (candidates instanceof CurveCollection) {\r\n      candidates.collectCurvePrimitives(results, smallestPossiblePrimitives, explodeLinestrings);\r\n    } else if (Array.isArray(candidates)) {\r\n      for (const c of candidates) {\r\n        this.collectCurvePrimitives(c, results, smallestPossiblePrimitives, explodeLinestrings);\r\n      }\r\n    }\r\n    return results;\r\n  }\r\n  /**\r\n   * Copy primitive pointers from candidates to result array, replacing each [[LineString3d]] by newly constructed instances of [[LineSegment3d]].\r\n   * @param candidates input curves\r\n   * @return copied (captured) inputs except for the linestrings, which are exploded\r\n   */\r\n  public static expandLineStrings(candidates: CurvePrimitive[]): CurvePrimitive[] {\r\n    const result: CurvePrimitive[] = [];\r\n    for (const c of candidates) {\r\n      if (c instanceof LineString3d) {\r\n        for (let i = 0; i + 1 < c.packedPoints.length; i++) {\r\n          const q = c.getIndexedSegment(i);\r\n          if (q !== undefined)\r\n            result.push(q);\r\n        }\r\n      } else {\r\n        result.push(c);\r\n      }\r\n    }\r\n    return result;\r\n  }\r\n  /**\r\n   * Return the overall range of given curves.\r\n   * @param data candidate curves\r\n   * @param worldToLocal transform to apply to data before computing its range\r\n   */\r\n  public static curveArrayRange(data: any, worldToLocal?: Transform): Range3d {\r\n    const range = Range3d.create();\r\n    if (data instanceof GeometryQuery)\r\n      data.extendRange(range, worldToLocal);\r\n    else if (Array.isArray(data)) {\r\n      for (const c of data) {\r\n        if (c instanceof GeometryQuery)\r\n          c.extendRange(range, worldToLocal);\r\n        else if (c instanceof Point3d)\r\n          range.extendPoint(c, worldToLocal);\r\n        else if (c instanceof GrowableXYZArray)\r\n          range.extendRange(c.getRange(worldToLocal));\r\n        else if (Array.isArray(c))\r\n          range.extendRange(this.curveArrayRange(c, worldToLocal));\r\n      }\r\n    }\r\n    return range;\r\n  }\r\n}\r\n\r\n/** @internal */\r\nfunction pushToInOnOutArrays(curve: AnyCurve, select: number, arrayNegative: AnyCurve[], array0: AnyCurve[], arrayPositive: AnyCurve[]) {\r\n  if (select > 0)\r\n    arrayPositive.push(curve);\r\n  else if (select < 0)\r\n    arrayNegative.push(curve);\r\n  else\r\n    array0.push(curve);\r\n}\r\n"]}
+{"version":3,"file":"RegionOps.js","sourceRoot":"","sources":["../../../src/curve/RegionOps.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F;;GAEG;AAEH,0CAAuC;AACvC,qEAAkE;AAClE,6EAA0E;AAC1E,2EAAwE;AACxE,mEAAwD;AACxD,mGAA2F;AAC3F,+CAA8C;AAC9C,mEAAgE;AAChE,uDAAoD;AACpD,yDAAsD;AAEtD,iEAA8D;AAC9D,6CAA0E;AAC1E,yEAAsE;AACtE,6DAA4G;AAC5G,mEAAgE;AAEhE,uDAAwH;AACxH,6CAA0C;AAC1C,qDAAkD;AAClD,+DAA4D;AAC5D,mDAAgD;AAChD,gFAAuE;AACvE,kFAA6I;AAC7I,iDAA8C;AAC9C,iCAA2C;AAC3C,iDAA8C;AAC9C,iCAA8B;AAC9B,uGAAyG;AACzG,iEAA8D;AAC9D,mDAAyD;AACzD,iEAA8D;AAC9D,uDAAoD;AACpD,mFAAqH;AACrH,+CAA4C;AAmB5C;;;GAGG;AACH,IAAY,kBAMX;AAND,WAAY,kBAAkB;IAC5B,6DAAS,CAAA;IACT,+DAAU,CAAA;IACV,2EAAgB,CAAA;IAChB,iEAAW,CAAA;IACX,iEAAW,CAAA;AACb,CAAC,EANW,kBAAkB,GAAlB,0BAAkB,KAAlB,0BAAkB,QAM7B;AAED;;;;;;;;;;GAUG;AACH,MAAa,SAAS;IACpB;;;;;OAKG;IACI,MAAM,CAAC,oBAAoB,CAAC,IAAe;QAChD,MAAM,OAAO,GAAG,IAAI,iCAAe,EAAE,CAAC;QACtC,MAAM,MAAM,GAAG,IAAI,CAAC,yBAAyB,CAAC,OAAO,CAAC,CAAC;QACvD,IAAI,MAAM,YAAY,uBAAU,EAAE;YAChC,MAAM,CAAC,kCAAkC,EAAE,CAAC;YAC5C,OAAO,MAAM,CAAC;SACf;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;MAIE;IACK,MAAM,CAAC,sBAAsB,CAAC,KAAc,EAAE,oBAA4B,mBAAQ,CAAC,mBAAmB;QAC3G,+GAA+G;QAC/G,MAAM,WAAW,GAAG,GAAG,GAAG,iBAAiB,CAAC;QAC5C,OAAO,WAAW,GAAG,CAAC,KAAK,CAAC,OAAO,EAAE,GAAG,KAAK,CAAC,OAAO,EAAE,GAAG,WAAW,CAAC,CAAC;IACzE,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,aAAa,CAAC,IAAe;QACzC,MAAM,OAAO,GAAG,IAAI,iCAAe,EAAE,CAAC;QACtC,MAAM,MAAM,GAAG,IAAI,CAAC,yBAAyB,CAAC,OAAO,CAAC,CAAC;QACvD,IAAI,MAAM,YAAY,uBAAU,EAAE;YAChC,OAAO,MAAM,CAAC,WAAW,CAAC;SAC3B;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,wBAAwB,CAAC,IAAc;QACnD,MAAM,OAAO,GAAG,IAAI,yCAAmB,EAAE,CAAC;QAC1C,OAAO,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;QAC1B,MAAM,MAAM,GAAG,OAAO,CAAC,UAAU,CAAC;QAClC,MAAM,CAAC,kCAAkC,EAAE,CAAC;QAC5C,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,eAAe,CAC3B,KAAoB,EACpB,IAAgC,EAChC,oBAAoE;QAEpE,IAAI,IAAI,YAAY,WAAI,EAAE;YACxB,MAAM,MAAM,GAAG,IAAI,CAAC,gBAAgB,EAAE,CAAC;YACvC,IAAI,MAAM;gBACR,IAAI,CAAC,eAAe,CAAC,KAAK,EAAE,MAAM,EAAE,oBAAoB,CAAC,CAAC;SAC7D;aAAM,IAAI,IAAI,YAAY,2BAAY,EAAE;YACvC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE;gBACjC,MAAM,MAAM,GAAG,KAAK,CAAC,gBAAgB,EAAE,CAAC;gBACxC,IAAI,MAAM;oBACR,IAAI,CAAC,eAAe,CAAC,KAAK,EAAE,MAAM,EAAE,oBAAoB,CAAC,CAAC;aAC7D;SACF;aAAM,IAAI,IAAI,YAAY,2CAAoB,EAAE;YAC/C,MAAM,QAAQ,GAAG,4BAAY,CAAC,mCAAmC,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;YAC/E,IAAI,QAAQ,KAAK,SAAS;gBACxB,oBAAoB,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;SACzC;aAAM,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;YAC9B,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE;gBACnB,IAAI,yBAAO,CAAC,uBAAuB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE;oBAC5C,MAAM,QAAQ,GAAG,4BAAY,CAAC,mCAAmC,CAAC,KAAK,EAAE,IAA6B,CAAC,CAAC;oBACxG,IAAI,QAAQ,KAAK,SAAS;wBACxB,oBAAoB,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;iBAEzC;qBAAM,IAAI,IAAI,CAAC,CAAC,CAAC,YAAY,2CAAoB,EAAE;oBAClD,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE;wBACvB,MAAM,QAAQ,GAAG,4BAAY,CAAC,mCAAmC,CAAC,KAAK,EAAE,IAA4B,CAAC,CAAC;wBACvG,IAAI,QAAQ,KAAK,SAAS;4BACxB,oBAAoB,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;qBACzC;iBACF;qBAAM;oBACL,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE;wBACxB,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;4BACtB,IAAI,CAAC,eAAe,CAAC,KAAK,EAAE,KAAmC,EAAE,oBAAoB,CAAC,CAAC;qBAC1F;iBACF;aACF;SACF;IACH,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,0BAA0B,CACtC,KAAoB,EAAE,IAAgC,EAAE,IAAkB,EAAE,OAAY;QAExF,MAAM,SAAS,GAAe,EAAE,CAAC;QACjC,IAAI,CAAC,eAAe,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC,MAAqB,EAAE,IAAc,EAAE,EAAE;YAC1E,IAAI,IAAI,EAAE;gBACR,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACrB,IAAI,CAAC,2BAA2B,CAAC,IAAI,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC;aACvD;QACH,CAAC,CAAC,CAAC;QACH,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC;YACtB,OAAO,SAAS,CAAC;QACnB,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;OAKG;IACK,MAAM,CAAC,qBAAqB,CAAC,KAAgC,EAAE,WAAoB;QACzF,IAAI,KAAK,EAAE;YACT,IAAI,WAAW,EAAE;gBACf,4BAAY,CAAC,+BAA+B,CAAC,KAAK,CAAC,CAAC;gBACpD,4BAAY,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;aACnC;YACD,OAAO,iCAAe,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC;SAC/C;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,qCAAqC,CACjD,MAAkC,EAAE,MAAkC,EAAE,cAAuB,KAAK;QAEpG,MAAM,KAAK,GAAG,yDAAyB,CAAC,gBAAgB,CACtD,MAAM,EACN,MAAM,EACN,CAAC,GAAY,EAAE,GAAY,EAAE,EAAE,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,EAC5C,IAAI,CAAC,wBAAwB,CAC9B,CAAC;QACF,OAAO,IAAI,CAAC,qBAAqB,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC;IACxD,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,iCAAiC,CAC7C,MAAkC,EAAE,MAAkC,EAAE,cAAuB,KAAK;QAEpG,MAAM,KAAK,GAAG,yDAAyB,CAAC,gBAAgB,CACtD,MAAM,EACN,MAAM,EACN,CAAC,GAAY,EAAE,GAAY,EAAE,EAAE,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,EAC5C,IAAI,CAAC,wBAAwB,CAC9B,CAAC;QACF,OAAO,IAAI,CAAC,qBAAqB,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC;IACxD,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,sCAAsC,CAClD,MAAkC,EAAE,MAAkC,EAAE,cAAuB,KAAK;QAEpG,MAAM,KAAK,GAAG,yDAAyB,CAAC,gBAAgB,CACtD,MAAM,EACN,MAAM,EACN,CAAC,GAAY,EAAE,GAAY,EAAE,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAC7C,IAAI,CAAC,wBAAwB,CAC9B,CAAC;QACF,OAAO,IAAI,CAAC,qBAAqB,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC;IACxD,CAAC;IACD;;;;;;;;;;OAUG;IACI,MAAM,CAAC,eAAe,CAC3B,MAA2C,EAC3C,MAA2C,EAC3C,SAA6B,EAC7B,iBAAyB,mBAAQ,CAAC,mBAAmB;QAErD,MAAM,MAAM,GAAG,yBAAW,CAAC,MAAM,EAAE,CAAC;QACpC,MAAM,OAAO,GAAG,oDAAoB,CAAC,MAAM,CAAC,iDAAiB,CAAC,KAAK,EAAE,iDAAiB,CAAC,KAAK,CAAC,CAAC;QAC9F,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QACnC,OAAO,CAAC,6BAA6B,CAAC,cAAc,CAAC,CAAC;QACtD,MAAM,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC;QACnE,MAAM,OAAO,GAAG,IAAI,CAAC,sBAAsB,CAAC,KAAK,EAAE,cAAc,CAAC,CAAC;QACnE,OAAO,CAAC,sBAAsB,CAC5B,SAAS,EACT,CAAC,MAAqB,EAAE,IAAc,EAAE,QAAoB,EAAE,IAAY,EAAE,EAAE;YAC5E,kFAAkF;YAClF,IAAI,IAAI,CAAC,oBAAoB,EAAE,GAAG,CAAC;gBACjC,OAAO;YACT,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,OAAO;gBAC1B,OAAO;YACT,IAAI,QAAQ,KAAK,CAAC,EAAE;gBAClB,MAAM,IAAI,GAAG,qCAAiB,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC;gBACtD,IAAI,IAAI;oBACN,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;aAC5B;QACH,CAAC,CACF,CAAC;QACF,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;;;;;;;OAWG;IACI,MAAM,CAAC,0BAA0B,CACtC,MAAoC,EACpC,SAA6B,EAC7B,MAAoC,EACpC,cAAuB,KAAK;QAE5B,MAAM,KAAK,GAAG,yDAAyB,CAAC,qCAAqC,CAC3E,MAAM,EAAE,iDAAiB,CAAC,KAAK,EAC/B,SAAS,EACT,MAAM,EAAE,iDAAiB,CAAC,KAAK,EAC/B,IAAI,CACL,CAAC;QACF,OAAO,IAAI,CAAC,qBAAqB,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC;IACxD,CAAC;IACD;;;;;;;;;;OAUG;IACI,MAAM,CAAC,uBAAuB,CACnC,MAAoC,EACpC,SAA6B,EAC7B,MAAoC;QAEpC,MAAM,KAAK,GAAG,yDAAyB,CAAC,qCAAqC,CAC3E,MAAM,EACN,iDAAiB,CAAC,KAAK,EACvB,SAAS,EACT,MAAM,EACN,iDAAiB,CAAC,KAAK,EACvB,IAAI,CACL,CAAC;QACF,IAAI,CAAC,KAAK;YACR,OAAO,SAAS,CAAC;QACnB,MAAM,SAAS,GAAG,yCAAmB,CAAC,mCAAmC,CAAC,KAAK,EAAE,oBAAY,CAAC,QAAQ,CAAC,CAAC;QACxG,MAAM,QAAQ,GAAW,EAAE,CAAC;QAC5B,KAAK,MAAM,SAAS,IAAI,SAAS,EAAE;YACjC,MAAM,MAAM,GAAG,IAAI,mCAAgB,EAAE,CAAC;YACtC,KAAK,MAAM,IAAI,IAAI,SAAS;gBAC1B,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;YACzC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;YACnB,MAAM,IAAI,GAAG,WAAI,CAAC,MAAM,EAAE,CAAC;YAC3B,IAAI,CAAC,WAAW,CAAC,2BAAY,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC;YACrD,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;SACrB;QACD,OAAO,SAAS,CAAC,uBAAuB,CAAC,QAAQ,CAAC,CAAC;IACrD,CAAC;IACD;;;;;;;;;;;;;OAaG;IACI,MAAM,CAAC,4BAA4B,CACxC,MAAiB,EAAE,IAAa,EAAE,uBAA8C;QAEhF,MAAM,OAAO,GAAG,IAAI,+CAAwB,EAAE,CAAC;QAC/C,OAAO,OAAO,CAAC,4BAA4B,CAAC,MAAM,EAAE,IAAI,EAAE,uBAAuB,CAAC,CAAC;IACrF,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,sBAAsB,CAClC,MAAmB,EAAE,uBAA8D;QAEnF,OAAO,kDAA2B,CAAC,sBAAsB,CAAC,MAAM,EAAE,uBAAuB,CAAC,CAAC;IAC7F,CAAC;IACD;;;;;;OAMG;IACI,MAAM,CAAC,wBAAwB,CAAC,MAAiB,EAAE,CAAS,EAAE,CAAS;QAC5E,OAAO,gCAAmB,CAAC,wBAAwB,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IACpE,CAAC;IACD;;;;;;;;;OASG;IACI,MAAM,CAAC,2BAA2B,CACvC,MAAwB,EAAE,OAAgB,IAAI,EAAE,gCAAyC,KAAK;QAE9F,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;QACxB,IAAI,CAAC,KAAK,CAAC;YACT,OAAO,SAAS,CAAC;QACnB,IAAI,MAAM,GAAG,GAAG,CAAC;QACjB,IAAI,MAAM,GAAG,KAAK,CAAC;QACnB,IAAI,IAAI;YACN,MAAM,GAAG,mBAAQ,CAAC,KAAK,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;QAC7F,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YAC5B,MAAM,GAAG,mBAAQ,CAAC,KAAK,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;QAC7F,IAAI,UAAqC,CAAC;QAC1C,IAAI,mBAAQ,CAAC,qBAAqB,CAAC,MAAM,CAAC,EAAE;YAC1C,UAAU,GAAG,IAAI,CAAC,CAAC,CAAC,WAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,WAAI,CAAC,MAAM,EAAE,CAAC;YAClD,MAAM,GAAG,IAAI,CAAC;SACf;aAAM;YACL,UAAU,GAAG,6BAAW,CAAC,MAAM,EAAE,CAAC;SACnC;QACD,KAAK,MAAM,CAAC,IAAI,MAAM;YACpB,UAAU,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;QAC5B,IAAI,MAAM,IAAI,6BAA6B;YACzC,SAAS,CAAC,6BAA6B,CAAC,UAAU,CAAC,CAAC;QACtD,OAAO,UAAU,CAAC;IACpB,CAAC;IAED;;;OAGG;IACI,MAAM,CAAC,qBAAqB,CAAC,CAA2B;QAC7D,IAAI,CAAC,wBAAwB,GAAG,CAAC,CAAC;IACpC,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,uBAAuB,CACnC,WAAiC,EAAE,YAA6B;QAEhE,OAAO,qCAAiB,CAAC,uBAAuB,CAAC,WAAW,EAAE,YAAY,CAAC,CAAC;IAC9E,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,yBAAyB,CAAC,MAA4B,EAAE,UAAmB;QACvF,IAAI,MAAM,KAAK,SAAS;YACtB,OAAO,SAAS,CAAC;QACnB,IAAI,MAAM,YAAY,+BAAc;YAClC,OAAO,MAAM,CAAC;QAChB,+BAA+B;QAC/B,MAAM,UAAU,GAAG,MAAM,CAAC,sBAAsB,EAAE,CAAC;QACnD,MAAM,cAAc,GAAG,IAAI,6CAAqB,CAAC,UAAU,CAAC,CAAC;QAC7D,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE;YAClC,cAAc,CAAC,sBAAsB,CAAC,SAAS,CAAC,CAAC;SAClD;QACD,OAAO,cAAc,CAAC,UAAU,EAAE,CAAC;IACrC,CAAC;IACD;;;;;;;OAOG;IACI,MAAM,CAAC,8BAA8B,CAC1C,SAAqB,EAAE,cAAsB,EAAE,YAAoB;QAEnE,OAAO,mCAAa,CAAC,8BAA8B,CAAC,SAAS,EAAE,cAAc,EAAE,YAAY,CAAC,CAAC;IAC/F,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,aAAa,CAAC,SAAqB,EAAE,eAAuB,mBAAQ,CAAC,mBAAmB;QACpG,OAAO,mCAAa,CAAC,aAAa,CAAC,SAAS,EAAE,YAAY,CAAC,CAAC;IAC9D,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,2BAA2B,CACvC,WAAiC,EAAE,MAAiB;QAEpD,MAAM,MAAM,GAAG,EAAE,WAAW,EAAE,EAAE,EAAE,YAAY,EAAE,EAAE,EAAE,eAAe,EAAE,EAAE,EAAE,CAAC;QAC1E,MAAM,0BAA0B,GAAG,SAAS,CAAC,uBAAuB,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;QAC1F,MAAM,UAAU,GAAG,SAAS,CAAC,yBAAyB,CAAC,0BAA0B,EAAE,IAAI,CAAC,CAAC;QACzF,IAAI,UAAU,YAAY,iCAAe,EAAE;YACzC,KAAK,MAAM,KAAK,IAAI,UAAU,CAAC,QAAQ,EAAE;gBACvC,MAAM,YAAY,GAAG,iCAAe,CAAC,4CAA4C,CAAC,KAAK,CAAC,CAAC;gBACzF,IAAI,YAAY,EAAE;oBAChB,MAAM,OAAO,GAAG,SAAS,CAAC,wBAAwB,CAAC,MAAM,EAAE,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;oBACvG,mBAAmB,CAAC,KAAK,EAAE,OAAO,EAAE,MAAM,CAAC,YAAY,EAAE,MAAM,CAAC,eAAe,EAAE,MAAM,CAAC,WAAW,CAAC,CAAC;iBACtG;aACF;SACF;aAAM,IAAI,UAAU,YAAY,+BAAc,EAAE;YAC/C,MAAM,YAAY,GAAG,iCAAe,CAAC,4CAA4C,CAAC,UAAU,CAAC,CAAC;YAC9F,IAAI,YAAY,EAAE;gBAChB,MAAM,OAAO,GAAG,SAAS,CAAC,wBAAwB,CAAC,MAAM,EAAE,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBACvG,mBAAmB,CAAC,UAAU,EAAE,OAAO,EAAE,MAAM,CAAC,YAAY,EAAE,MAAM,CAAC,eAAe,EAAE,MAAM,CAAC,WAAW,CAAC,CAAC;aAC3G;SACF;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;;;;;;;;;;OAcG;IACI,MAAM,CAAC,sBAAsB,CAClC,IAAiD,EAAE,sBAA+B,IAAI;QAEtF,IAAI,IAAI,YAAY,2BAAY,EAAE;YAChC,OAAO,IAAI,CAAC,sBAAsB,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;SACvD;aAAM,IAAI,IAAI,YAAY,2CAAoB,EAAE;YAC/C,IAAI,SAAS,CAAC;YACd,IAAI,mBAAmB,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE;gBAC5C,IAAI,CAAC,mBAAQ,CAAC,qBAAqB,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAC,EAAE,CAAC,CAAE,CAAC;oBACjE,OAAO,SAAS,CAAC;gBACnB,SAAS,GAAG,IAAI,CAAC;aAClB;iBAAM,IAAI,CAAC,mBAAmB,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE;gBACpD,SAAS,GAAG,IAAI,CAAC;aAClB;iBAAM,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE;gBACtD,OAAO,SAAS,CAAC;aAClB;iBAAM;gBACL,SAAS,GAAG,mCAAgB,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;gBAC1C,4DAA0B,CAAC,gCAAgC,CAAC,SAAS,EAAE,mBAAQ,CAAC,mBAAmB,CAAC,CAAC;gBACrG,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;oBAClD,OAAO,SAAS,CAAC;aACpB;YACD,MAAM,QAAQ,GAAG,SAAS,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAE,CAAC;YACnD,MAAM,QAAQ,GAAG,SAAS,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAE,CAAC;YACnD,MAAM,QAAQ,GAAG,SAAS,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAE,CAAC;YACnD,MAAM,YAAY,GAAG,QAAQ,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC;YACrD,IAAI,YAAY,CAAC,gBAAgB,EAAE;mBAC9B,QAAQ,CAAC,aAAa,CAAC,QAAQ,CAAC;mBAChC,QAAQ,CAAC,iBAAiB,CAAC,QAAQ,CAAC,EAAE;gBACzC,OAAO,qBAAS,CAAC,4BAA4B,CAC3C,SAAS,CAAC,+BAA+B,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,QAAQ,EAAE,YAAY,CAC/E,CAAC;aACH;SACF;aAAM,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;YAC9B,OAAO,IAAI,CAAC,sBAAsB,CAAC,IAAI,yCAAmB,CAAC,IAAI,CAAC,EAAE,mBAAmB,CAAC,CAAC;SACxF;aAAM,IAAI,IAAI,YAAY,WAAI,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,YAAY,2BAAY,EAAE;YACzG,OAAO,IAAI,CAAC,sBAAsB,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;SACzE;aAAM,IAAI,IAAI,YAAY,WAAI,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,YAAY,2BAAY,EAAE;YACzG,OAAO,IAAI,CAAC,sBAAsB,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,YAAY,EAAE,mBAAmB,CAAC,CAAC;SACxF;aAAM,IAAI,IAAI,YAAY,4BAAU,EAAE;YACrC,IAAI,CAAC,IAAI,CAAC,2BAA2B,EAAE,EAAE;gBACvC,4CAA4C;gBAC5C,MAAM,OAAO,GAAG,IAAI,CAAC,gBAAgB,EAAE,CAAC;gBACxC,IAAI,OAAO,EAAE;oBACX,OAAO,IAAI,CAAC,sBAAsB,CAAC,OAAO,CAAC,CAAC;iBAC7C;aACF;SACF;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;;;;;;OAWG;IACI,MAAM,CAAC,6BAA6B,CACzC,MAAuB,EAAE,OAAmD;QAE5E,MAAM,OAAO,GAAG,IAAI,gFAAyC,CAAC,OAAO,CAAC,CAAC;QACvE,MAAM,CAAC,yBAAyB,CAAC,OAAO,CAAC,CAAC;IAC5C,CAAC;IACD;;;;;;;;;;;OAWG;IACI,MAAM,CAAC,uBAAuB,CAAC,KAAyC;QAC7E,MAAM,WAAW,GAAsB,EAAE,CAAC;QAC1C,KAAK,MAAM,SAAS,IAAI,KAAK,EAAE;YAC7B,IAAI,SAAS,YAAY,WAAI;gBAC3B,iCAAe,CAAC,QAAQ,CAAC,WAAW,EAAE,SAAS,CAAC,CAAC;iBAC9C,IAAI,SAAS,YAAY,2CAAoB,EAAE;gBAClD,MAAM,IAAI,GAAG,WAAI,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC;gBAC3C,iCAAe,CAAC,QAAQ,CAAC,WAAW,EAAE,IAAI,CAAC,CAAC;aAC7C;SACF;QACD,OAAO,iCAAe,CAAC,eAAe,CAAC,WAAW,CAAC,CAAC;IACtD,CAAC;IACD;;;;;;;;;;;;;;;;;;OAkBG;IACI,MAAM,CAAC,yBAAyB,CACrC,gBAAuC,EAAE,YAAoB,mBAAQ,CAAC,mBAAmB;QAEzF,MAAM,UAAU,GAAG,SAAS,CAAC,sBAAsB,CAAC,gBAAgB,EAAE,SAAS,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;QAC7F,MAAM,KAAK,GAAG,IAAI,CAAC,eAAe,CAAC,UAAU,CAAC,CAAC;QAC/C,MAAM,OAAO,GAAG,IAAI,CAAC,sBAAsB,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;QAC9D,MAAM,aAAa,GAAG,uBAAU,CAAC,iCAAiC,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC;QAC1F,MAAM,KAAK,GAAG,qCAAiB,CAAC,qBAAqB,CAAC,UAAU,EAAE,aAAa,EAAE,SAAS,CAAC,CAAC;QAC5F,OAAO,qCAAiB,CAAC,oCAAoC,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;IAChF,CAAC;IACD;;;;;;;;;;OAUG;IACI,MAAM,CAAC,sBAAsB,CAClC,UAAiC,EACjC,cAAiC,EACjC,6BAAsC,KAAK,EAC3C,qBAA8B,KAAK;QAEnC,MAAM,OAAO,GAAqB,cAAc,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,cAAc,CAAC;QACrF,IAAI,UAAU,YAAY,+BAAc,EAAE;YACxC,UAAU,CAAC,sBAAsB,CAAC,OAAO,EAAE,0BAA0B,EAAE,kBAAkB,CAAC,CAAC;SAC5F;aAAM,IAAI,UAAU,YAAY,iCAAe,EAAE;YAChD,UAAU,CAAC,sBAAsB,CAAC,OAAO,EAAE,0BAA0B,EAAE,kBAAkB,CAAC,CAAC;SAC5F;aAAM,IAAI,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,EAAE;YACpC,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE;gBAC1B,IAAI,CAAC,sBAAsB,CAAC,CAAC,EAAE,OAAO,EAAE,0BAA0B,EAAE,kBAAkB,CAAC,CAAC;aACzF;SACF;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,iBAAiB,CAAC,UAA4B;QAC1D,MAAM,MAAM,GAAqB,EAAE,CAAC;QACpC,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE;YAC1B,IAAI,CAAC,YAAY,2BAAY,EAAE;gBAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;oBAClD,MAAM,CAAC,GAAG,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC;oBACjC,IAAI,CAAC,KAAK,SAAS;wBACjB,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;iBAClB;aACF;iBAAM;gBACL,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;aAChB;SACF;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,eAAe,CAAC,IAAS,EAAE,YAAwB;QAC/D,MAAM,KAAK,GAAG,eAAO,CAAC,MAAM,EAAE,CAAC;QAC/B,IAAI,IAAI,YAAY,6BAAa;YAC/B,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC;aACnC,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;YAC5B,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE;gBACpB,IAAI,CAAC,YAAY,6BAAa;oBAC5B,CAAC,CAAC,WAAW,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC;qBAChC,IAAI,CAAC,YAAY,yBAAO;oBAC3B,KAAK,CAAC,WAAW,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC;qBAChC,IAAI,CAAC,YAAY,mCAAgB;oBACpC,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC,CAAC;qBACzC,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;oBACvB,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC;aAC5D;SACF;QACD,OAAO,KAAK,CAAC;IACf,CAAC;CACF;AArqBD,8BAqqBC;AACD,gBAAgB;AAChB,SAAS,mBAAmB,CAC1B,KAAe,EAAE,MAAc,EAAE,aAAyB,EAAE,MAAkB,EAAE,aAAyB;IAEzG,IAAI,MAAM,GAAG,CAAC;QACZ,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;SACvB,IAAI,MAAM,GAAG,CAAC;QACjB,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;;QAE1B,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;AACvB,CAAC","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\nimport { Geometry } from \"../Geometry\";\r\nimport { GrowableXYZArray } from \"../geometry3d/GrowableXYZArray\";\r\nimport { IndexedXYZCollection } from \"../geometry3d/IndexedXYZCollection\";\r\nimport { Point3dArrayCarrier } from \"../geometry3d/Point3dArrayCarrier\";\r\nimport { Point3d } from \"../geometry3d/Point3dVector3d\";\r\nimport { PolylineCompressionContext } from \"../geometry3d/PolylineCompressionByEdgeOffset\";\r\nimport { Range3d } from \"../geometry3d/Range\";\r\nimport { SortablePolygon } from \"../geometry3d/SortablePolygon\";\r\nimport { Transform } from \"../geometry3d/Transform\";\r\nimport { MomentData } from \"../geometry4d/MomentData\";\r\nimport { Polyface } from \"../polyface/Polyface\";\r\nimport { PolyfaceBuilder } from \"../polyface/PolyfaceBuilder\";\r\nimport { HalfEdge, HalfEdgeGraph, HalfEdgeMask } from \"../topology/Graph\";\r\nimport { HalfEdgeGraphSearch } from \"../topology/HalfEdgeGraphSearch\";\r\nimport { LineStringDataVariant, MultiLineStringDataVariant, Triangulator } from \"../topology/Triangulation\";\r\nimport { ChainCollectorContext } from \"./ChainCollectorContext\";\r\nimport { AnyCurve, AnyRegion } from \"./CurveChain\";\r\nimport { BagOfCurves, ConsolidateAdjacentCurvePrimitivesOptions, CurveChain, CurveCollection } from \"./CurveCollection\";\r\nimport { CurveCurve } from \"./CurveCurve\";\r\nimport { CurvePrimitive } from \"./CurvePrimitive\";\r\nimport { CurveWireMomentsXYZ } from \"./CurveWireMomentsXYZ\";\r\nimport { GeometryQuery } from \"./GeometryQuery\";\r\nimport { OffsetHelpers } from \"./internalContexts/MultiChainCollector\";\r\nimport { CurveChainWireOffsetContext, JointOptions, OffsetOptions, PolygonWireOffsetContext } from \"./internalContexts/PolygonOffsetContext\";\r\nimport { LineString3d } from \"./LineString3d\";\r\nimport { Loop, SignedLoops } from \"./Loop\";\r\nimport { ParityRegion } from \"./ParityRegion\";\r\nimport { Path } from \"./Path\";\r\nimport { ConsolidateAdjacentCurvePrimitivesContext } from \"./Query/ConsolidateAdjacentPrimitivesContext\";\r\nimport { CurveSplitContext } from \"./Query/CurveSplitContext\";\r\nimport { PointInOnOutContext } from \"./Query/InOutTests\";\r\nimport { PlanarSubdivision } from \"./Query/PlanarSubdivision\";\r\nimport { RegionMomentsXY } from \"./RegionMomentsXY\";\r\nimport { RegionBooleanContext, RegionGroupOpType, RegionOpsFaceToFaceSearch } from \"./RegionOpsClassificationSweeps\";\r\nimport { UnionRegion } from \"./UnionRegion\";\r\n\r\n/**\r\n * Possible return types from [[splitToPathsBetweenBreaks]], [[collectInsideAndOutsideOffsets]] and\r\n * [[collectChains]].\r\n * @public\r\n */\r\nexport type ChainTypes = CurvePrimitive | Path | BagOfCurves | Loop | undefined;\r\n\r\n/**\r\n * * `properties` is a string with special characters indicating\r\n *   * \"U\" -- contains unmerged stick data\r\n *   * \"M\" -- merged\r\n *   * \"R\" -- regularized\r\n *   * \"X\" -- has exterior markup\r\n * @internal\r\n */\r\nexport type GraphCheckPointFunction = (name: string, graph: HalfEdgeGraph, properties: string, extraData?: any) => any;\r\n\r\n/**\r\n * Enumeration of the binary operation types for a booleans among regions\r\n * @public\r\n */\r\nexport enum RegionBinaryOpType {\r\n  Union = 0,\r\n  Parity = 1,\r\n  Intersection = 2,\r\n  AMinusB = 3,\r\n  BMinusA = 4,\r\n}\r\n\r\n/**\r\n * Class `RegionOps` has static members for calculations on regions (areas).\r\n * * Regions are represented by these `CurveCollection` subclasses:\r\n *   * `Loop` -- a single loop\r\n *   * `ParityRegion` -- a collection of loops, interpreted by parity rules.\r\n * The common \"One outer loop and many Inner loops\" is a parity region.\r\n *   * `UnionRegion` -- a collection of `Loop` and `ParityRegion` objects understood as a (probably disjoint) union.\r\n * * **NOTE:** Most of the methods in this class ignore z-coordinates, so callers should ensure that input geometry has\r\n * been rotated parallel to the xy-plane.\r\n * @public\r\n */\r\nexport class RegionOps {\r\n  /**\r\n   * Return moment sums for a loop, parity region, or union region.\r\n   * * If `rawMomentData` is the MomentData returned by computeXYAreaMoments, convert to principal axes and moments with\r\n   *    call `principalMomentData = MomentData.inertiaProductsToPrincipalAxes (rawMomentData.origin, rawMomentData.sums);`\r\n   * @param root any Loop, ParityRegion, or UnionRegion.\r\n   */\r\n  public static computeXYAreaMoments(root: AnyRegion): MomentData | undefined {\r\n    const handler = new RegionMomentsXY();\r\n    const result = root.dispatchToGeometryHandler(handler);\r\n    if (result instanceof MomentData) {\r\n      result.shiftOriginAndSumsToCentroidOfSums();\r\n      return result;\r\n    }\r\n    return undefined;\r\n  }\r\n  /**\r\n   * Return an area tolerance for a given xy-range and optional distance tolerance.\r\n   * @param range range of planar region to tolerance\r\n   * @param distanceTolerance optional absolute distance tolerance\r\n  */\r\n  public static computeXYAreaTolerance(range: Range3d, distanceTolerance: number = Geometry.smallMetricDistance): number {\r\n    // 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).\r\n    const halfDistTol = 0.5 * distanceTolerance;\r\n    return halfDistTol * (range.xLength() + range.yLength() + halfDistTol);\r\n  }\r\n  /**\r\n   * Return an xy area for a loop, parity region, or union region.\r\n   * * If `rawMomentData` is the MomentData returned by computeXYAreaMoments, convert to principal axes and moments with\r\n   *    call `principalMomentData = MomentData.inertiaProductsToPrincipalAxes (rawMomentData.origin, rawMomentData.sums);`\r\n   * @param root any Loop, ParityRegion, or UnionRegion.\r\n   */\r\n  public static computeXYArea(root: AnyRegion): number | undefined {\r\n    const handler = new RegionMomentsXY();\r\n    const result = root.dispatchToGeometryHandler(handler);\r\n    if (result instanceof MomentData) {\r\n      return result.quantitySum;\r\n    }\r\n    return undefined;\r\n  }\r\n  /**\r\n   * Return MomentData with the sums of wire moments.\r\n   * * If `rawMomentData` is the MomentData returned by computeXYAreaMoments, convert to principal axes and moments with\r\n   *    call `principalMomentData = MomentData.inertiaProductsToPrincipalAxes (rawMomentData.origin, rawMomentData.sums);`\r\n   * @param root any CurveCollection or CurvePrimitive.\r\n   */\r\n  public static computeXYZWireMomentSums(root: AnyCurve): MomentData | undefined {\r\n    const handler = new CurveWireMomentsXYZ();\r\n    handler.visitLeaves(root);\r\n    const result = handler.momentData;\r\n    result.shiftOriginAndSumsToCentroidOfSums();\r\n    return result;\r\n  }\r\n  /**\r\n   * Create loops in the graph.\r\n   * @internal\r\n   */\r\n  public static addLoopsToGraph(\r\n    graph: HalfEdgeGraph,\r\n    data: MultiLineStringDataVariant,\r\n    announceIsolatedLoop: (graph: HalfEdgeGraph, seed: HalfEdge) => void\r\n  ): void {\r\n    if (data instanceof Loop) {\r\n      const points = data.getPackedStrokes();\r\n      if (points)\r\n        this.addLoopsToGraph(graph, points, announceIsolatedLoop);\r\n    } else if (data instanceof ParityRegion) {\r\n      for (const child of data.children) {\r\n        const points = child.getPackedStrokes();\r\n        if (points)\r\n          this.addLoopsToGraph(graph, points, announceIsolatedLoop);\r\n      }\r\n    } else if (data instanceof IndexedXYZCollection) {\r\n      const loopSeed = Triangulator.directCreateFaceLoopFromCoordinates(graph, data);\r\n      if (loopSeed !== undefined)\r\n        announceIsolatedLoop(graph, loopSeed);\r\n    } else if (Array.isArray(data)) {\r\n      if (data.length > 0) {\r\n        if (Point3d.isAnyImmediatePointType(data[0])) {\r\n          const loopSeed = Triangulator.directCreateFaceLoopFromCoordinates(graph, data as LineStringDataVariant);\r\n          if (loopSeed !== undefined)\r\n            announceIsolatedLoop(graph, loopSeed);\r\n\r\n        } else if (data[0] instanceof IndexedXYZCollection) {\r\n          for (const loop of data) {\r\n            const loopSeed = Triangulator.directCreateFaceLoopFromCoordinates(graph, loop as IndexedXYZCollection);\r\n            if (loopSeed !== undefined)\r\n              announceIsolatedLoop(graph, loopSeed);\r\n          }\r\n        } else {\r\n          for (const child of data) {\r\n            if (Array.isArray(child))\r\n              this.addLoopsToGraph(graph, child as MultiLineStringDataVariant, announceIsolatedLoop);\r\n          }\r\n        }\r\n      }\r\n    }\r\n  }\r\n  /**\r\n   * Add multiple loops to a graph.\r\n   * * Apply edgeTag and mask to each edge.\r\n   * @internal\r\n   */\r\n  public static addLoopsWithEdgeTagToGraph(\r\n    graph: HalfEdgeGraph, data: MultiLineStringDataVariant, mask: HalfEdgeMask, edgeTag: any\r\n  ): HalfEdge[] | undefined {\r\n    const loopSeeds: HalfEdge[] = [];\r\n    this.addLoopsToGraph(graph, data, (_graph: HalfEdgeGraph, seed: HalfEdge) => {\r\n      if (seed) {\r\n        loopSeeds.push(seed);\r\n        seed.setMaskAndEdgeTagAroundFace(mask, edgeTag, true);\r\n      }\r\n    });\r\n    if (loopSeeds.length > 0)\r\n      return loopSeeds;\r\n    return undefined;\r\n  }\r\n  /**\r\n   * Given a graph just produced by booleans, convert to a polyface\r\n   * * \"just produced\" implies exterior face markup.\r\n   * @param graph\r\n   * @param triangulate\r\n   */\r\n  private static finishGraphToPolyface(graph: HalfEdgeGraph | undefined, triangulate: boolean): Polyface | undefined {\r\n    if (graph) {\r\n      if (triangulate) {\r\n        Triangulator.triangulateAllPositiveAreaFaces(graph);\r\n        Triangulator.flipTriangles(graph);\r\n      }\r\n      return PolyfaceBuilder.graphToPolyface(graph);\r\n    }\r\n    return undefined;\r\n  }\r\n  /**\r\n   * Return a polyface containing the area intersection of two XY regions.\r\n   * * Within each region, in and out is determined by parity rules.\r\n   *   * Any face that is an odd number of crossings from the far outside is IN\r\n   *   * Any face that is an even number of crossings from the far outside is OUT\r\n   * @param loopsA first set of loops\r\n   * @param loopsB second set of loops\r\n   * @param triangulate whether to triangulate the result\r\n   */\r\n  public static polygonXYAreaIntersectLoopsToPolyface(\r\n    loopsA: MultiLineStringDataVariant, loopsB: MultiLineStringDataVariant, triangulate: boolean = false\r\n  ): Polyface | undefined {\r\n    const graph = RegionOpsFaceToFaceSearch.doPolygonBoolean(\r\n      loopsA,\r\n      loopsB,\r\n      (inA: boolean, inB: boolean) => (inA && inB),\r\n      this._graphCheckPointFunction\r\n    );\r\n    return this.finishGraphToPolyface(graph, triangulate);\r\n  }\r\n  /**\r\n   * Return a polyface containing the area union of two XY regions.\r\n   * * Within each region, in and out is determined by parity rules.\r\n   *   * Any face that is an odd number of crossings from the far outside is IN\r\n   *   * Any face that is an even number of crossings from the far outside is OUT\r\n   * @param loopsA first set of loops\r\n   * @param loopsB second set of loops\r\n   * @param triangulate whether to triangulate the result\r\n   */\r\n  public static polygonXYAreaUnionLoopsToPolyface(\r\n    loopsA: MultiLineStringDataVariant, loopsB: MultiLineStringDataVariant, triangulate: boolean = false\r\n  ): Polyface | undefined {\r\n    const graph = RegionOpsFaceToFaceSearch.doPolygonBoolean(\r\n      loopsA,\r\n      loopsB,\r\n      (inA: boolean, inB: boolean) => (inA || inB),\r\n      this._graphCheckPointFunction\r\n    );\r\n    return this.finishGraphToPolyface(graph, triangulate);\r\n  }\r\n  /**\r\n   * Return a polyface containing the area difference of two XY regions.\r\n   * * Within each region, in and out is determined by parity rules.\r\n   *   * Any face that is an odd number of crossings from the far outside is IN\r\n   *   * Any face that is an even number of crossings from the far outside is OUT\r\n   * @param loopsA first set of loops\r\n   * @param loopsB second set of loops\r\n   * @param triangulate whether to triangulate the result\r\n   */\r\n  public static polygonXYAreaDifferenceLoopsToPolyface(\r\n    loopsA: MultiLineStringDataVariant, loopsB: MultiLineStringDataVariant, triangulate: boolean = false\r\n  ): Polyface | undefined {\r\n    const graph = RegionOpsFaceToFaceSearch.doPolygonBoolean(\r\n      loopsA,\r\n      loopsB,\r\n      (inA: boolean, inB: boolean) => (inA && !inB),\r\n      this._graphCheckPointFunction\r\n    );\r\n    return this.finishGraphToPolyface(graph, triangulate);\r\n  }\r\n  /**\r\n   * Return areas defined by a boolean operation.\r\n   * * If there are multiple regions in loopsA, they are treated as a union.\r\n   * * If there are multiple regions in loopsB, they are treated as a union.\r\n   * @param loopsA first set of loops\r\n   * @param loopsB second set of loops\r\n   * @param operation indicates Union, Intersection, Parity, AMinusB, or BMinusA\r\n   * @param mergeTolerance absolute distance tolerance for merging loops\r\n   * @returns a region resulting from merging input loops and the boolean operation. May contain bridge edges added\r\n   * to connect interior loops to exterior loops.\r\n   */\r\n  public static regionBooleanXY(\r\n    loopsA: AnyRegion | AnyRegion[] | undefined,\r\n    loopsB: AnyRegion | AnyRegion[] | undefined,\r\n    operation: RegionBinaryOpType,\r\n    mergeTolerance: number = Geometry.smallMetricDistance\r\n  ): AnyRegion | undefined {\r\n    const result = UnionRegion.create();\r\n    const context = RegionBooleanContext.create(RegionGroupOpType.Union, RegionGroupOpType.Union);\r\n    context.addMembers(loopsA, loopsB);\r\n    context.annotateAndMergeCurvesInGraph(mergeTolerance);\r\n    const range = context.groupA.range().union(context.groupB.range());\r\n    const areaTol = this.computeXYAreaTolerance(range, mergeTolerance);\r\n    context.runClassificationSweep(\r\n      operation,\r\n      (_graph: HalfEdgeGraph, face: HalfEdge, faceType: -1 | 0 | 1, area: number) => {\r\n        // ignore danglers and null faces, but not 2-edge \"banana\" faces with nonzero area\r\n        if (face.countEdgesAroundFace() < 2)\r\n          return;\r\n        if (Math.abs(area) < areaTol)\r\n          return;\r\n        if (faceType === 1) {\r\n          const loop = PlanarSubdivision.createLoopInFace(face);\r\n          if (loop)\r\n            result.tryAddChild(loop);\r\n        }\r\n      }\r\n    );\r\n    return result;\r\n  }\r\n  /**\r\n   * Return a polyface whose facets are a boolean operation between the input regions.\r\n   * * Each of the two inputs is an array of multiple loops or parity regions.\r\n   *   * Within each of these input arrays, the various entries (loop or set of loops) are interpreted as a union.\r\n   * * In each \"array of loops and parity regions\", each entry inputA[i] or inputB[i] is one of:\r\n   *    * A simple loop, e.g. array of Point3d.\r\n   *    * Several simple loops, each of which is an array of Point3d.\r\n   * @param inputA first set of loops\r\n   * @param operation indicates Union, Intersection, Parity, AMinusB, or BMinusA\r\n   * @param inputB second set of loops\r\n   * @param triangulate whether to triangulate the result\r\n   */\r\n  public static polygonBooleanXYToPolyface(\r\n    inputA: MultiLineStringDataVariant[],\r\n    operation: RegionBinaryOpType,\r\n    inputB: MultiLineStringDataVariant[],\r\n    triangulate: boolean = false\r\n  ): Polyface | undefined {\r\n    const graph = RegionOpsFaceToFaceSearch.doBinaryBooleanBetweenMultiLoopInputs(\r\n      inputA, RegionGroupOpType.Union,\r\n      operation,\r\n      inputB, RegionGroupOpType.Union,\r\n      true\r\n    );\r\n    return this.finishGraphToPolyface(graph, triangulate);\r\n  }\r\n  /**\r\n   * Return loops of linestrings around areas of a boolean operation between the input regions.\r\n   * * Each of the two inputs is an array of multiple loops or parity regions.\r\n   *   * Within each of these input arrays, the various entries (loop or set of loops) are interpreted as a union.\r\n   * * In each \"array of loops and parity regions\", each entry inputA[i] or inputB[i] is one of:\r\n   *    * A simple loop, e.g. array of Point3d.\r\n   *    * Several simple loops, each of which is an array of Point3d.\r\n   * @param inputA first set of loops\r\n   * @param operation indicates Union, Intersection, Parity, AMinusB, or BMinusA\r\n   * @param inputB second set of loops\r\n   */\r\n  public static polygonBooleanXYToLoops(\r\n    inputA: MultiLineStringDataVariant[],\r\n    operation: RegionBinaryOpType,\r\n    inputB: MultiLineStringDataVariant[]\r\n  ): AnyRegion | undefined {\r\n    const graph = RegionOpsFaceToFaceSearch.doBinaryBooleanBetweenMultiLoopInputs(\r\n      inputA,\r\n      RegionGroupOpType.Union,\r\n      operation,\r\n      inputB,\r\n      RegionGroupOpType.Union,\r\n      true\r\n    );\r\n    if (!graph)\r\n      return undefined;\r\n    const loopEdges = HalfEdgeGraphSearch.collectExtendedBoundaryLoopsInGraph(graph, HalfEdgeMask.EXTERIOR);\r\n    const allLoops: Loop[] = [];\r\n    for (const graphLoop of loopEdges) {\r\n      const points = new GrowableXYZArray();\r\n      for (const edge of graphLoop)\r\n        points.pushXYZ(edge.x, edge.y, edge.z);\r\n      points.pushWrap(1);\r\n      const loop = Loop.create();\r\n      loop.tryAddChild(LineString3d.createCapture(points));\r\n      allLoops.push(loop);\r\n    }\r\n    return RegionOps.sortOuterAndHoleLoopsXY(allLoops);\r\n  }\r\n  /**\r\n   * Construct a wire that is offset from the given polyline or polygon.\r\n   * * This is a simple wire offset, not an area offset.\r\n   * * Since z-coordinates are ignored, for best results the input points should lie in (a plane parallel to)\r\n   * the xy-plane.\r\n   * * The construction algorithm attempts to eliminate some self-intersections within the offsets, but does not\r\n   * guarantee a simple area offset.\r\n   * * If offsetDistance is given as a number, default OffsetOptions are applied.\r\n   * * See [[JointOptions]] class doc for offset construction rules.\r\n   * @param points a single loop or path\r\n   * @param wrap true to include wraparound\r\n   * @param offsetDistanceOrOptions offset distance (positive to left of curve, negative to right) or JointOptions\r\n   * object.\r\n   */\r\n  public static constructPolygonWireXYOffset(\r\n    points: Point3d[], wrap: boolean, offsetDistanceOrOptions: number | JointOptions\r\n  ): CurveChain | undefined {\r\n    const context = new PolygonWireOffsetContext();\r\n    return context.constructPolygonWireXYOffset(points, wrap, offsetDistanceOrOptions);\r\n  }\r\n  /**\r\n   * Construct curves that are offset from a Path or Loop as viewed in xy-plane (ignoring z).\r\n   * * The construction will remove \"some\" local effects of features smaller than the offset distance, but will\r\n   * not detect self intersection among widely separated edges.\r\n   * * If offsetDistance is given as a number, default OffsetOptions are applied.\r\n   * * See [[JointOptions]] class doc for offset construction rules.\r\n   * @param curves base curves.\r\n   * @param offsetDistanceOrOptions offset distance (positive to left of curve, negative to right) or options object.\r\n   */\r\n  public static constructCurveXYOffset(\r\n    curves: Path | Loop, offsetDistanceOrOptions: number | JointOptions | OffsetOptions\r\n  ): CurveCollection | undefined {\r\n    return CurveChainWireOffsetContext.constructCurveXYOffset(curves, offsetDistanceOrOptions);\r\n  }\r\n  /**\r\n   * Test if point (x,y) is IN, OUT or ON a region.\r\n   * @return (1) for in, (-1) for OUT, (0) for ON\r\n   * @param curves input region\r\n   * @param x x coordinate of point to test\r\n   * @param y y coordinate of point to test\r\n   */\r\n  public static testPointInOnOutRegionXY(curves: AnyRegion, x: number, y: number): number {\r\n    return PointInOnOutContext.testPointInOnOutRegionXY(curves, x, y);\r\n  }\r\n  /**\r\n   * Create curve collection of subtype determined by gaps between the input curves.\r\n   * * If (a) wrap is requested and (b) all curves connect head-to-tail (including wraparound), assemble as a `loop`.\r\n   * * If all curves connect head-to-tail except for closure, return a `Path`.\r\n   * * If there are internal gaps, return a `BagOfCurves`\r\n   * * If input array has zero length, return undefined.\r\n   * @param curves input curves\r\n   * @param wrap whether to create a Loop (true) or Path (false) if maximum gap is minimal\r\n   * @param consolidateAdjacentPrimitives whether to simplify the result by calling [[consolidateAdjacentPrimitives]]\r\n   */\r\n  public static createLoopPathOrBagOfCurves(\r\n    curves: CurvePrimitive[], wrap: boolean = true, consolidateAdjacentPrimitives: boolean = false\r\n  ): CurveCollection | undefined {\r\n    const n = curves.length;\r\n    if (n === 0)\r\n      return undefined;\r\n    let maxGap = 0.0;\r\n    let isPath = false;\r\n    if (wrap)\r\n      maxGap = Geometry.maxXY(maxGap, curves[0].startPoint().distance(curves[n - 1].endPoint()));\r\n    for (let i = 0; i + 1 < n; i++)\r\n      maxGap = Geometry.maxXY(maxGap, curves[i].endPoint().distance(curves[i + 1].startPoint()));\r\n    let collection: Loop | Path | BagOfCurves;\r\n    if (Geometry.isSmallMetricDistance(maxGap)) {\r\n      collection = wrap ? Loop.create() : Path.create();\r\n      isPath = true;\r\n    } else {\r\n      collection = BagOfCurves.create();\r\n    }\r\n    for (const c of curves)\r\n      collection.tryAddChild(c);\r\n    if (isPath && consolidateAdjacentPrimitives)\r\n      RegionOps.consolidateAdjacentPrimitives(collection);\r\n    return collection;\r\n  }\r\n  private static _graphCheckPointFunction?: GraphCheckPointFunction;\r\n  /**\r\n   * Announce Checkpoint function for use during booleans\r\n   * @internal\r\n   */\r\n  public static setCheckPointFunction(f?: GraphCheckPointFunction) {\r\n    this._graphCheckPointFunction = f;\r\n  }\r\n  /**\r\n   * Find all intersections among curves in `curvesToCut` and `cutterCurves` and return fragments of `curvesToCut`.\r\n   * * For a `Loop`, `ParityRegion`, or `UnionRegion` in `curvesToCut`:\r\n   *    * if it is never cut by any `cutter` curve, it will be left unchanged.\r\n   *    * if cut, the input is downgraded to a set of `Path` curves joining at the cut points.\r\n   * * All cutting is \"as viewed in the xy plane\"\r\n   * @param curvesToCut input curves to be fragmented at intersections with `cutterCurves`\r\n   * @param cutterCurves input curves to intersect with `curvesToCut`\r\n   */\r\n  public static cloneCurvesWithXYSplits(\r\n    curvesToCut: AnyCurve | undefined, cutterCurves: CurveCollection\r\n  ): AnyCurve | undefined {\r\n    return CurveSplitContext.cloneCurvesWithXYSplits(curvesToCut, cutterCurves);\r\n  }\r\n  /**\r\n   * Create paths assembled from many curves.\r\n   * * Assemble paths from consecutive curves NOT separated by either gaps or the split markup set by\r\n   * [[cloneCurvesWithXYSplits]].\r\n   * * Return simplest form -- single primitive, single path, or bag of curves.\r\n   */\r\n  public static splitToPathsBetweenBreaks(source: AnyCurve | undefined, makeClones: boolean): ChainTypes {\r\n    if (source === undefined)\r\n      return undefined;\r\n    if (source instanceof CurvePrimitive)\r\n      return source;\r\n    // source is a collection .  ..\r\n    const primitives = source.collectCurvePrimitives();\r\n    const chainCollector = new ChainCollectorContext(makeClones);\r\n    for (const primitive of primitives) {\r\n      chainCollector.announceCurvePrimitive(primitive);\r\n    }\r\n    return chainCollector.grabResult();\r\n  }\r\n  /**\r\n   * Restructure curve fragments as chains, and construct (left and right) chain offsets in the xy-plane.\r\n   * * BEWARE that if the input is not a loop, the classification of outputs is suspect.\r\n   * @param fragments fragments to be chained, z-coordinates ignored\r\n   * @param offsetDistance offset distance\r\n   * @param gapTolerance absolute endpoint tolerance for computing chains\r\n   * @returns object with named chains, insideOffsets, outsideOffsets\r\n   */\r\n  public static collectInsideAndOutsideOffsets(\r\n    fragments: AnyCurve[], offsetDistance: number, gapTolerance: number\r\n  ): { insideOffsets: AnyCurve[], outsideOffsets: AnyCurve[], chains: ChainTypes } {\r\n    return OffsetHelpers.collectInsideAndOutsideOffsets(fragments, offsetDistance, gapTolerance);\r\n  }\r\n  /**\r\n   * Restructure curve fragments as chains.\r\n   * @param fragments fragments to be chained\r\n   * @param gapTolerance absolute endpoint tolerance for computing chains\r\n   * @returns chains, possibly wrapped in BagOfCurves if there multiple chains\r\n   */\r\n  public static collectChains(fragments: AnyCurve[], gapTolerance: number = Geometry.smallMetricDistance): ChainTypes {\r\n    return OffsetHelpers.collectChains(fragments, gapTolerance);\r\n  }\r\n  /**\r\n   * Find all intersections among curves in `curvesToCut` against the boundaries of `region` and return fragments\r\n   * of `curvesToCut`.\r\n   * * Break `curvesToCut` into parts inside, outside, and coincident.\r\n   * @returns output object with all fragments split among `insideParts`, `outsideParts`, and `coincidentParts`\r\n   */\r\n  public static splitPathsByRegionInOnOutXY(\r\n    curvesToCut: AnyCurve | undefined, region: AnyRegion\r\n  ): { insideParts: AnyCurve[], outsideParts: AnyCurve[], coincidentParts: AnyCurve[] } {\r\n    const result = { insideParts: [], outsideParts: [], coincidentParts: [] };\r\n    const pathWithIntersectionMarkup = RegionOps.cloneCurvesWithXYSplits(curvesToCut, region);\r\n    const splitPaths = RegionOps.splitToPathsBetweenBreaks(pathWithIntersectionMarkup, true);\r\n    if (splitPaths instanceof CurveCollection) {\r\n      for (const child of splitPaths.children) {\r\n        const pointOnChild = CurveCollection.createCurveLocationDetailOnAnyCurvePrimitive(child);\r\n        if (pointOnChild) {\r\n          const inOnOut = RegionOps.testPointInOnOutRegionXY(region, pointOnChild.point.x, pointOnChild.point.y);\r\n          pushToInOnOutArrays(child, inOnOut, result.outsideParts, result.coincidentParts, result.insideParts);\r\n        }\r\n      }\r\n    } else if (splitPaths instanceof CurvePrimitive) {\r\n      const pointOnChild = CurveCollection.createCurveLocationDetailOnAnyCurvePrimitive(splitPaths);\r\n      if (pointOnChild) {\r\n        const inOnOut = RegionOps.testPointInOnOutRegionXY(region, pointOnChild.point.x, pointOnChild.point.y);\r\n        pushToInOnOutArrays(splitPaths, inOnOut, result.outsideParts, result.coincidentParts, result.insideParts);\r\n      }\r\n    }\r\n    return result;\r\n  }\r\n  /**\r\n   * If `data` is one of several forms of a rectangle, return its edge Transform.\r\n   * * Points are considered a rectangle if, within the first 4 points:\r\n   *     * vectors from 0 to 1 and 0 to 3 are perpendicular and have a non-zero cross product\r\n   *     * vectors from 0 to 3 and 1 to 2 are the same\r\n   * @param data points in one of several formats:\r\n   *   * LineString\r\n   *   * Loop containing rectangle content\r\n   *   * Path containing rectangle content\r\n   *   * Array of Point3d[]\r\n   *   * IndexedXYZCollection\r\n   * @param requireClosurePoint whether to require a 5th point equal to the 1st point.\r\n   * @returns Transform with origin at one corner, x and y columns extending along two adjacent sides, and unit\r\n   * normal in z column. If not a rectangle, return undefined.\r\n   */\r\n  public static rectangleEdgeTransform(\r\n    data: AnyCurve | Point3d[] | IndexedXYZCollection, requireClosurePoint: boolean = true\r\n  ): Transform | undefined {\r\n    if (data instanceof LineString3d) {\r\n      return this.rectangleEdgeTransform(data.packedPoints);\r\n    } else if (data instanceof IndexedXYZCollection) {\r\n      let dataToUse;\r\n      if (requireClosurePoint && data.length === 5) {\r\n        if (!Geometry.isSmallMetricDistance(data.distanceIndexIndex(0, 4)!))\r\n          return undefined;\r\n        dataToUse = data;\r\n      } else if (!requireClosurePoint && data.length === 4) {\r\n        dataToUse = data;\r\n      } else if (data.length < (requireClosurePoint ? 5 : 4)) {\r\n        return undefined;\r\n      } else {\r\n        dataToUse = GrowableXYZArray.create(data);\r\n        PolylineCompressionContext.compressInPlaceByShortEdgeLength(dataToUse, Geometry.smallMetricDistance);\r\n        if (dataToUse.length < (requireClosurePoint ? 5 : 4))\r\n          return undefined;\r\n      }\r\n      const vector01 = dataToUse.vectorIndexIndex(0, 1)!;\r\n      const vector03 = dataToUse.vectorIndexIndex(0, 3)!;\r\n      const vector12 = dataToUse.vectorIndexIndex(1, 2)!;\r\n      const normalVector = vector01.crossProduct(vector03);\r\n      if (normalVector.normalizeInPlace()\r\n        && vector12.isAlmostEqual(vector03)\r\n        && vector01.isPerpendicularTo(vector03)) {\r\n        return Transform.createOriginAndMatrixColumns(\r\n          dataToUse.getPoint3dAtUncheckedPointIndex(0), vector01, vector03, normalVector\r\n        );\r\n      }\r\n    } else if (Array.isArray(data)) {\r\n      return this.rectangleEdgeTransform(new Point3dArrayCarrier(data), requireClosurePoint);\r\n    } else if (data instanceof Loop && data.children.length === 1 && data.children[0] instanceof LineString3d) {\r\n      return this.rectangleEdgeTransform(data.children[0].packedPoints, true);\r\n    } else if (data instanceof Path && data.children.length === 1 && data.children[0] instanceof LineString3d) {\r\n      return this.rectangleEdgeTransform(data.children[0].packedPoints, requireClosurePoint);\r\n    } else if (data instanceof CurveChain) {\r\n      if (!data.checkForNonLinearPrimitives()) {\r\n        // const linestring = LineString3d.create();\r\n        const strokes = data.getPackedStrokes();\r\n        if (strokes) {\r\n          return this.rectangleEdgeTransform(strokes);\r\n        }\r\n      }\r\n    }\r\n    return undefined;\r\n  }\r\n  /**\r\n   * Look for and simplify:\r\n   * * Contiguous `LineSegment3d` and `LineString3d` objects.\r\n   *   * collect all points\r\n   *   * eliminate duplicated points\r\n   *   * eliminate points colinear with surrounding points\r\n   *   * contiguous concentric circular or elliptic arcs\r\n   *   * combine angular ranges\r\n   * * This function can be used to compress adjacent LineSegment3ds into a LineString3d\r\n   * @param curves Path or loop (or larger collection containing paths and loops) to be simplified\r\n   * @param options options for tolerance and selective simplification.\r\n   */\r\n  public static consolidateAdjacentPrimitives(\r\n    curves: CurveCollection, options?: ConsolidateAdjacentCurvePrimitivesOptions\r\n  ): void {\r\n    const context = new ConsolidateAdjacentCurvePrimitivesContext(options);\r\n    curves.dispatchToGeometryHandler(context);\r\n  }\r\n  /**\r\n   * Reverse and reorder loops in the xy-plane for consistency and containment.\r\n   * @param loops multiple loops in any order and orientation, z-coordinates ignored\r\n   * @returns a region that captures the input pointers. This region is a:\r\n   * * `Loop` if there is exactly one input loop. It is oriented counterclockwise.\r\n   * * `ParityRegion` if input consists of exactly one outer loop with at least one hole loop.\r\n   * Its first child is an outer loop oriented counterclockwise; all subsequent children are holes oriented\r\n   * clockwise.\r\n   * * `UnionRegion` if any other input configuration. Its children are individually ordered/oriented as in\r\n   * the above cases.\r\n   * @see [[PolygonOps.sortOuterAndHoleLoopsXY]]\r\n   */\r\n  public static sortOuterAndHoleLoopsXY(loops: Array<Loop | IndexedXYZCollection>): AnyRegion {\r\n    const loopAndArea: SortablePolygon[] = [];\r\n    for (const candidate of loops) {\r\n      if (candidate instanceof Loop)\r\n        SortablePolygon.pushLoop(loopAndArea, candidate);\r\n      else if (candidate instanceof IndexedXYZCollection) {\r\n        const loop = Loop.createPolygon(candidate);\r\n        SortablePolygon.pushLoop(loopAndArea, loop);\r\n      }\r\n    }\r\n    return SortablePolygon.sortAsAnyRegion(loopAndArea);\r\n  }\r\n  /**\r\n   * Find all areas bounded by the unstructured, possibly intersecting curves.\r\n   * * A common use case of this method is to assemble the bounding \"exterior\" loop (or loops) containing the\r\n   * input curves.\r\n   * * This method does not add bridge edges to connect outer loops to inner loops. Each disconnected loop,\r\n   * regardless of its containment, is returned as its own SignedLoops object. Pre-process with [[regionBooleanXY]]\r\n   * to add bridge edges so that [[constructAllXYRegionLoops]] will return outer and inner loops in the same\r\n   * SignedLoops object.\r\n   * @param curvesAndRegions Any collection of curves. Each Loop/ParityRegion/UnionRegion contributes its curve\r\n   * primitives.\r\n   * @param tolerance optional distance tolerance for coincidence\r\n   * @returns array of [[SignedLoops]], each entry of which describes the faces in a single connected component:\r\n   *    * `positiveAreaLoops` contains \"interior\" loops, _including holes in ParityRegion input_. These loops have\r\n   * positive area and counterclockwise orientation.\r\n   *    * `negativeAreaLoops` contains (probably just one) \"exterior\" loop which is ordered clockwise.\r\n   *    * `slivers` contains sliver loops that have zero area, such as appear between coincident curves.\r\n   *    * `edges` contains a [[LoopCurveLoopCurve]] object for each component edge, collecting both loops adjacent\r\n   * to the edge and a constituent curve in each.\r\n   */\r\n  public static constructAllXYRegionLoops(\r\n    curvesAndRegions: AnyCurve | AnyCurve[], tolerance: number = Geometry.smallMetricDistance\r\n  ): SignedLoops[] {\r\n    const primitives = RegionOps.collectCurvePrimitives(curvesAndRegions, undefined, true, true);\r\n    const range = this.curveArrayRange(primitives);\r\n    const areaTol = this.computeXYAreaTolerance(range, tolerance);\r\n    const intersections = CurveCurve.allIntersectionsAmongPrimitivesXY(primitives, tolerance);\r\n    const graph = PlanarSubdivision.assembleHalfEdgeGraph(primitives, intersections, tolerance);\r\n    return PlanarSubdivision.collectSignedLoopSetsInHalfEdgeGraph(graph, areaTol);\r\n  }\r\n  /**\r\n   * Collect all `CurvePrimitives` in loosely typed input.\r\n   * * Always recurses into primitives within explicit collections (Path, Loop, ParityRegion, UnionRegion).\r\n   * * Optionally recurses into hidden primitives if `smallestPossiblePrimitives` is true.\r\n   * @param candidates input curves\r\n   * @param collectorArray optional pre-defined output array. If defined, it is NOT cleared: primitives are appended.\r\n   * @param smallestPossiblePrimitives if true, recurse into the children of a [[CurveChainWithDistanceIndex]]. If\r\n   * false, push the [[CurveChainWithDistanceIndex]] instead.\r\n   * @param explodeLinestrings if true, push a [[LineSegment3d]] for each segment of a [[LineString3d]]. If false,\r\n   * push the [[LineString3d]] instead.\r\n   */\r\n  public static collectCurvePrimitives(\r\n    candidates: AnyCurve | AnyCurve[],\r\n    collectorArray?: CurvePrimitive[],\r\n    smallestPossiblePrimitives: boolean = false,\r\n    explodeLinestrings: boolean = false\r\n  ): CurvePrimitive[] {\r\n    const results: CurvePrimitive[] = collectorArray === undefined ? [] : collectorArray;\r\n    if (candidates instanceof CurvePrimitive) {\r\n      candidates.collectCurvePrimitives(results, smallestPossiblePrimitives, explodeLinestrings);\r\n    } else if (candidates instanceof CurveCollection) {\r\n      candidates.collectCurvePrimitives(results, smallestPossiblePrimitives, explodeLinestrings);\r\n    } else if (Array.isArray(candidates)) {\r\n      for (const c of candidates) {\r\n        this.collectCurvePrimitives(c, results, smallestPossiblePrimitives, explodeLinestrings);\r\n      }\r\n    }\r\n    return results;\r\n  }\r\n  /**\r\n   * Copy primitive pointers from candidates to result array, replacing each [[LineString3d]] by newly constructed\r\n   * instances of [[LineSegment3d]].\r\n   * @param candidates input curves\r\n   * @return copied (captured) inputs except for the linestrings, which are exploded\r\n   */\r\n  public static expandLineStrings(candidates: CurvePrimitive[]): CurvePrimitive[] {\r\n    const result: CurvePrimitive[] = [];\r\n    for (const c of candidates) {\r\n      if (c instanceof LineString3d) {\r\n        for (let i = 0; i + 1 < c.packedPoints.length; i++) {\r\n          const q = c.getIndexedSegment(i);\r\n          if (q !== undefined)\r\n            result.push(q);\r\n        }\r\n      } else {\r\n        result.push(c);\r\n      }\r\n    }\r\n    return result;\r\n  }\r\n  /**\r\n   * Return the overall range of given curves.\r\n   * @param data candidate curves\r\n   * @param worldToLocal transform to apply to data before computing its range\r\n   */\r\n  public static curveArrayRange(data: any, worldToLocal?: Transform): Range3d {\r\n    const range = Range3d.create();\r\n    if (data instanceof GeometryQuery)\r\n      data.extendRange(range, worldToLocal);\r\n    else if (Array.isArray(data)) {\r\n      for (const c of data) {\r\n        if (c instanceof GeometryQuery)\r\n          c.extendRange(range, worldToLocal);\r\n        else if (c instanceof Point3d)\r\n          range.extendPoint(c, worldToLocal);\r\n        else if (c instanceof GrowableXYZArray)\r\n          range.extendRange(c.getRange(worldToLocal));\r\n        else if (Array.isArray(c))\r\n          range.extendRange(this.curveArrayRange(c, worldToLocal));\r\n      }\r\n    }\r\n    return range;\r\n  }\r\n}\r\n/** @internal */\r\nfunction pushToInOnOutArrays(\r\n  curve: AnyCurve, select: number, arrayNegative: AnyCurve[], array0: AnyCurve[], arrayPositive: AnyCurve[]\r\n): void {\r\n  if (select > 0)\r\n    arrayPositive.push(curve);\r\n  else if (select < 0)\r\n    arrayNegative.push(curve);\r\n  else\r\n    array0.push(curve);\r\n}\r\n"]}

package/lib/cjs/curve/StrokeOptions.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"StrokeOptions.d.ts","sourceRoot":"","sources":["../../../src/curve/StrokeOptions.ts"],"names":[],"mappings":"AAUA,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAI5C;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,qBAAa,aAAa;IACxB,8CAA8C;IACvC,QAAQ,CAAC,EAAE,MAAM,CAAC;IACzB,qCAAqC;IAC9B,QAAQ,CAAC,EAAE,KAAK,CAAC;IACxB,yCAAyC;IAClC,aAAa,CAAC,EAAE,MAAM,CAAC;IAC9B,qCAAqC;IAC9B,gBAAgB,CAAC,EAAE,OAAO,CAAC;IAClC,qCAAqC;IAC9B,sBAAsB,CAAC,EAAE,MAAM,CAAC;IACvC,qDAAqD;IAC9C,iBAAiB,EAAE,OAAO,CAAS;IAC1C,OAAO,CAAC,YAAY,CAAC,CAAU;IAC/B,OAAO,CAAC,aAAa,CAAC,CAAU;IAChC,OAAO,CAAC,WAAW,CAAC,CAAU;IAC9B,oCAAoC;IACpC,IAAW,UAAU,IAAI,OAAO,CAE/B;IACD,IAAW,UAAU,CAAC,KAAK,EAAE,OAAO,EAEnC;IACD,oCAAoC;IACpC,IAAW,WAAW,IAAI,OAAO,CAEhC;IACD,IAAW,WAAW,CAAC,KAAK,EAAE,OAAO,EAAgC;IACrE,qCAAqC;IACrC,IAAW,YAAY,IAAI,OAAO,CAEjC;IACD,IAAW,YAAY,CAAC,KAAK,EAAE,OAAO,EAAiC;IACvE,kCAAkC;IAC3B,UAAU,CAAC,EAAE,OAAO,CAAC;IAC5B,8CAA8C;IACvC,oBAAoB,SAAM;IACjC,mCAAmC;IACnC,IAAW,WAAW,IAAI,OAAO,CAEhC;IACD,mCAAmC;IACnC,IAAW,WAAW,IAAI,OAAO,CAEhC;IACD,wCAAwC;IACxC,IAAW,gBAAgB,IAAI,OAAO,CAErC;IACD,2BAA2B;IACpB,KAAK,IAAI,aAAa;IAe7B,yGAAyG;IAClG,kBAAkB,CAAC,QAAQ,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,GAAG,MAAM;IAOxE;;;;OAIG;IACI,aAAa,CAAC,QAAQ,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,EAAE,kBAAkB,EAAE,MAAM,GAAG,MAAM;IAGhG;;;OAGG;WACW,aAAa,CACzB,OAAO,EAAE,aAAa,GAAG,SAAS,EAAE,QAAQ,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,EAAE,kBAAkB,CAAC,EAAE,MAAM,GACtG,MAAM;IAST;;;;;OAKG;WACW,kBAAkB,CAC9B,OAAO,EAAE,aAAa,GAAG,SAAS,EAAE,QAAQ,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,GACvE,MAAM;IAUT;;;OAGG;IACI,oBAAoB,CAAC,MAAM,EAAE,MAAM,EAAE,YAAY,GAAE,MAAoB,GAAG,MAAM;IAQvF,4HAA4H;IACrH,aAAa,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,GAAG,MAAM;IAQpF;;;OAGG;IACI,+BAA+B,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,GAAG,MAAM;IAQtG,iGAAiG;IAC1F,2BAA2B,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM;IAM5D;;;;OAIG;WACW,eAAe,IAAI,aAAa;IAK9C;;;;OAIG;WACW,eAAe,IAAI,aAAa;CAK/C"}
+{"version":3,"file":"StrokeOptions.d.ts","sourceRoot":"","sources":["../../../src/curve/StrokeOptions.ts"],"names":[],"mappings":"AAUA,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAI5C;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,qBAAa,aAAa;IACxB,8CAA8C;IACvC,QAAQ,CAAC,EAAE,MAAM,CAAC;IACzB,qCAAqC;IAC9B,QAAQ,CAAC,EAAE,KAAK,CAAC;IACxB,yCAAyC;IAClC,aAAa,CAAC,EAAE,MAAM,CAAC;IAC9B,qCAAqC;IAC9B,gBAAgB,CAAC,EAAE,OAAO,CAAC;IAClC,qCAAqC;IAC9B,sBAAsB,CAAC,EAAE,MAAM,CAAC;IACvC,qDAAqD;IAC9C,iBAAiB,EAAE,OAAO,CAAS;IAC1C,OAAO,CAAC,YAAY,CAAC,CAAU;IAC/B,OAAO,CAAC,aAAa,CAAC,CAAU;IAChC,OAAO,CAAC,WAAW,CAAC,CAAU;IAC9B,oCAAoC;IACpC,IAAW,UAAU,IAAI,OAAO,CAE/B;IACD,IAAW,UAAU,CAAC,KAAK,EAAE,OAAO,EAEnC;IACD,oCAAoC;IACpC,IAAW,WAAW,IAAI,OAAO,CAEhC;IACD,IAAW,WAAW,CAAC,KAAK,EAAE,OAAO,EAEpC;IACD,qCAAqC;IACrC,IAAW,YAAY,IAAI,OAAO,CAEjC;IACD,IAAW,YAAY,CAAC,KAAK,EAAE,OAAO,EAErC;IACD,kCAAkC;IAC3B,UAAU,CAAC,EAAE,OAAO,CAAC;IAC5B,8CAA8C;IACvC,oBAAoB,SAAM;IACjC,mCAAmC;IACnC,IAAW,WAAW,IAAI,OAAO,CAEhC;IACD,mCAAmC;IACnC,IAAW,WAAW,IAAI,OAAO,CAEhC;IACD,wCAAwC;IACxC,IAAW,gBAAgB,IAAI,OAAO,CAErC;IACD,2BAA2B;IACpB,KAAK,IAAI,aAAa;IAe7B,yGAAyG;IAClG,kBAAkB,CAAC,QAAQ,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,GAAG,MAAM;IAOxE;;;;OAIG;IACI,aAAa,CAAC,QAAQ,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,EAAE,kBAAkB,EAAE,MAAM,GAAG,MAAM;IAGhG;;;OAGG;WACW,aAAa,CACzB,OAAO,EAAE,aAAa,GAAG,SAAS,EAAE,QAAQ,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,EAAE,kBAAkB,CAAC,EAAE,MAAM,GACtG,MAAM;IAST;;;;;OAKG;WACW,kBAAkB,CAC9B,OAAO,EAAE,aAAa,GAAG,SAAS,EAAE,QAAQ,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,GACvE,MAAM;IAUT;;;OAGG;IACI,oBAAoB,CAAC,MAAM,EAAE,MAAM,EAAE,YAAY,GAAE,MAAoB,GAAG,MAAM;IAQvF,4HAA4H;IACrH,aAAa,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,GAAG,MAAM;IAQpF;;;OAGG;IACI,+BAA+B,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,GAAG,MAAM;IAQtG,iGAAiG;IAC1F,2BAA2B,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM;IAM5D;;;;OAIG;WACW,eAAe,IAAI,aAAa;IAK9C;;;;OAIG;WACW,eAAe,IAAI,aAAa;CAK/C"}

package/lib/cjs/curve/StrokeOptions.js

@@ -51,12 +51,16 @@ class StrokeOptions {
     get needNormals() {
         return this._needNormals !== undefined ? this._needNormals : false;
     }
-    set needNormals(value) { this._needNormals = value; }
+    set needNormals(value) {
+        this._needNormals = value;
+    }
     /** Whether twoSided is requested. */
     get needTwoSided() {
         return this._needTwoSided !== undefined ? this._needTwoSided : false;
     }
-    set needTwoSided(value) { this._needTwoSided = value; }
+    set needTwoSided(value) {
+        this._needTwoSided = value;
+    }
     /** Ask if angleTol is specified */
     get hasAngleTol() {
         return this.angleTol !== undefined && Math.abs(this.angleTol.radians) > 0.0;

package/lib/cjs/curve/StrokeOptions.js.map

@@ -1 +1 @@
-{"version":3,"file":"StrokeOptions.js","sourceRoot":"","sources":["../../../src/curve/StrokeOptions.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F;;GAEG;AAEH,0CAAuC;AACvC,+CAA4C;AAE5C,mEAAmE;AAEnE;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,MAAa,aAAa;IAA1B;QAWE,qDAAqD;QAC9C,sBAAiB,GAAY,KAAK,CAAC;QAuB1C,8CAA8C;QACvC,yBAAoB,GAAG,EAAE,CAAC;IA0InC,CAAC;IA9JC,oCAAoC;IACpC,IAAW,UAAU;QACnB,OAAO,IAAI,CAAC,WAAW,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,KAAK,CAAC;IACnE,CAAC;IACD,IAAW,UAAU,CAAC,KAAc;QAClC,IAAI,CAAC,WAAW,GAAG,KAAK,CAAC;IAC3B,CAAC;IACD,oCAAoC;IACpC,IAAW,WAAW;QACpB,OAAO,IAAI,CAAC,YAAY,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,KAAK,CAAC;IACrE,CAAC;IACD,IAAW,WAAW,CAAC,KAAc,IAAI,IAAI,CAAC,YAAY,GAAG,KAAK,CAAC,CAAC,CAAC;IACrE,qCAAqC;IACrC,IAAW,YAAY;QACrB,OAAO,IAAI,CAAC,aAAa,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,KAAK,CAAC;IACvE,CAAC;IACD,IAAW,YAAY,CAAC,KAAc,IAAI,IAAI,CAAC,aAAa,GAAG,KAAK,CAAC,CAAC,CAAC;IAKvE,mCAAmC;IACnC,IAAW,WAAW;QACpB,OAAO,IAAI,CAAC,QAAQ,KAAK,SAAS,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,GAAG,GAAG,CAAC;IAC9E,CAAC;IACD,mCAAmC;IACnC,IAAW,WAAW;QACpB,OAAO,IAAI,CAAC,QAAQ,KAAK,SAAS,IAAI,IAAI,CAAC,QAAQ,GAAG,GAAG,CAAC;IAC5D,CAAC;IACD,wCAAwC;IACxC,IAAW,gBAAgB;QACzB,OAAO,IAAI,CAAC,aAAa,KAAK,SAAS,IAAI,IAAI,CAAC,aAAa,GAAG,GAAG,CAAC;IACtE,CAAC;IACD,2BAA2B;IACpB,KAAK;QACV,MAAM,OAAO,GAAG,IAAI,aAAa,EAAE,CAAC;QACpC,OAAO,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;QACjC,OAAO,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,EAAE,KAAK,EAAE,CAAC;QAC1C,OAAO,CAAC,aAAa,GAAG,IAAI,CAAC,aAAa,CAAC;QAC3C,OAAO,CAAC,gBAAgB,GAAG,IAAI,CAAC,gBAAgB,CAAC;QACjD,OAAO,CAAC,sBAAsB,GAAG,IAAI,CAAC,sBAAsB,CAAC;QAC7D,OAAO,CAAC,iBAAiB,GAAG,IAAI,CAAC,iBAAiB,CAAC;QACnD,OAAO,CAAC,YAAY,GAAG,IAAI,CAAC,YAAY,CAAC;QACzC,OAAO,CAAC,aAAa,GAAG,IAAI,CAAC,aAAa,CAAC;QAC3C,OAAO,CAAC,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC;QACvC,OAAO,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC;QACrC,OAAO,CAAC,oBAAoB,GAAG,IAAI,CAAC,oBAAoB,CAAC;QACzD,OAAO,OAAO,CAAC;IACjB,CAAC;IACD,yGAAyG;IAClG,kBAAkB,CAAC,QAAgB,EAAE,WAAmB;QAC7D,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;QACpC,IAAI,IAAI,CAAC,aAAa,IAAI,IAAI,CAAC,aAAa,GAAG,GAAG,IAAI,QAAQ,GAAG,IAAI,CAAC,aAAa,GAAG,WAAW,EAAE;YACjG,QAAQ,GAAG,mBAAQ,CAAC,SAAS,CAAC,IAAI,CAAC,aAAa,EAAE,WAAW,EAAE,QAAQ,CAAC,CAAC;SAC1E;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IACD;;;;OAIG;IACI,aAAa,CAAC,QAAgB,EAAE,YAAoB,EAAE,kBAA0B;QACrF,OAAO,aAAa,CAAC,aAAa,CAAC,IAAI,EAAE,QAAQ,EAAE,YAAY,EAAE,kBAAkB,CAAC,CAAC;IACvF,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,aAAa,CACzB,OAAkC,EAAE,QAAgB,EAAE,YAAoB,EAAE,kBAA2B;QAEvG,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;QACtC,IAAI,WAAW,GAAG,kBAAkB,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,GAAG,GAAG,CAAC;QAC1E,IAAI,OAAO,IAAI,OAAO,CAAC,QAAQ,IAAI,OAAO,CAAC,QAAQ,CAAC,OAAO,GAAG,GAAG;YAC/D,WAAW,GAAG,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAC;QACzC,IAAI,QAAQ,GAAG,WAAW,GAAG,YAAY;YACvC,QAAQ,GAAG,mBAAQ,CAAC,SAAS,CAAC,WAAW,EAAE,YAAY,EAAE,QAAQ,CAAC,CAAC;QACrE,OAAO,QAAQ,CAAC;IAClB,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,kBAAkB,CAC9B,OAAkC,EAAE,QAAgB,EAAE,UAAkB;QAExE,IAAI,UAAU,GAAG,CAAC;YAChB,UAAU,GAAG,CAAE,UAAU,CAAC;QAC5B,IAAI,QAAQ,GAAG,CAAC;YACd,QAAQ,GAAG,CAAC,CAAC;QACf,IAAI,OAAO,IAAI,OAAO,CAAC,aAAa,IAAI,OAAO,CAAC,aAAa,GAAG,QAAQ,GAAG,UAAU,EAAE;YACrF,QAAQ,GAAG,mBAAQ,CAAC,SAAS,CAAC,OAAO,CAAC,aAAa,EAAE,UAAU,EAAE,QAAQ,CAAC,CAAC;SAC5E;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IACD;;;OAGG;IACI,oBAAoB,CAAC,MAAc,EAAE,eAAuB,IAAI,CAAC,EAAE,GAAG,CAAC;QAC5E,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,UAAU,GAAG,IAAI,CAAC,aAAa,CAAC,UAAU,EAAE,YAAY,EAAE,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,CAAC;QAC1E,UAAU,GAAG,IAAI,CAAC,kBAAkB,CAAC,UAAU,EAAE,YAAY,GAAG,MAAM,CAAC,CAAC;QACxE,UAAU,GAAG,IAAI,CAAC,aAAa,CAAC,UAAU,EAAE,MAAM,EAAE,YAAY,CAAC,CAAC;QAClE,UAAU,GAAG,IAAI,CAAC,2BAA2B,CAAC,UAAU,CAAC,CAAC;QAC1D,OAAO,UAAU,CAAC;IACpB,CAAC;IACD,4HAA4H;IACrH,aAAa,CAAC,QAAgB,EAAE,MAAc,EAAE,YAAoB;QACzE,IAAI,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,QAAQ,GAAG,GAAG,IAAI,IAAI,CAAC,QAAQ,GAAG,MAAM,EAAE;YAClE,MAAM,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC;YACxB,MAAM,WAAW,GAAG,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;YACxD,QAAQ,GAAG,mBAAQ,CAAC,SAAS,CAAC,WAAW,EAAE,YAAY,EAAE,QAAQ,CAAC,CAAC;SACpE;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IACD;;;OAGG;IACI,+BAA+B,CAAC,QAAgB,EAAE,MAAc,EAAE,YAAoB;QAC3F,IAAI,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,QAAQ,GAAG,GAAG,EAAE;YACxC,MAAM,MAAM,GAAG,mBAAQ,CAAC,yBAAyB,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;YACxE,IAAI,MAAM,KAAK,SAAS;gBACtB,OAAO,IAAI,CAAC,aAAa,CAAC,QAAQ,EAAE,MAAM,EAAE,YAAY,CAAC,CAAC;SAC7D;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IACD,iGAAiG;IAC1F,2BAA2B,CAAC,QAAgB;QACjD,IAAI,IAAI,CAAC,sBAAsB,KAAK,SAAS,IAAI,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,sBAAsB,CAAC;eACxF,IAAI,CAAC,sBAAsB,GAAG,QAAQ;YACzC,QAAQ,GAAG,IAAI,CAAC,sBAAsB,CAAC;QACzC,OAAO,QAAQ,CAAC;IAClB,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,eAAe;QAC3B,MAAM,OAAO,GAAG,IAAI,aAAa,EAAE,CAAC;QACpC,OAAO,CAAC,QAAQ,GAAG,aAAK,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;QAC7C,OAAO,OAAO,CAAC;IACjB,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,eAAe;QAC3B,MAAM,OAAO,GAAG,IAAI,aAAa,EAAE,CAAC;QACpC,OAAO,CAAC,QAAQ,GAAG,aAAK,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;QAC7C,OAAO,OAAO,CAAC;IACjB,CAAC;CACF;AA9KD,sCA8KC","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\nimport { Geometry } from \"../Geometry\";\r\nimport { Angle } from \"../geometry3d/Angle\";\r\n\r\n/* eslint-disable @typescript-eslint/naming-convention, no-empty */\r\n\r\n/**\r\n * Tolerance blob for various stroking methods.\r\n *\r\n * * Across many applications, the critical concepts are:   chordTol, angleTol, maxEdgeLength\r\n * * Chord error is an distance measured from a curve or facet to its approximating stroke or facet.\r\n * * angle is the angle between two contiguous strokes or across a facet edge.\r\n * * maxEdgeLength is the length of a stroke or a edge of a facet.\r\n *\r\n * It is rare for all three to be active at once:\r\n * * Nearly all stroke and facet use cases will apply an angle tolerance.\r\n * * * For curves, 15 degrees is typical\r\n * * * For facets, 22.5 degrees is typical.\r\n * * * Halving the angle tolerance will (roughly) make curves get twice as many strokes, and surfaces get 4 times as many facets.\r\n * * * The angle tolerance has the useful property that its effect is independent of scale of that data.  If data is suddenly scaled into millimeters rather than meters, the facet counts remain the same.\r\n * * When creating output for devices such as 3D printing will want a chord tolerance.\r\n * * For graphics display, use an angle tolerance of around 15 degrees and an chord tolerance which is the size of several pixels.\r\n * * Analysis meshes (e.g. Finite Elements) commonly need to apply maxEdgeLength.\r\n * * * Using maxEdgeLength for graphics probably produces too many facets.   For example, it causes long cylinders to get many nearly-square facets instead of the small number of long quads usually used for graphics.\r\n * * Facet tolerances are, as the Pirates' Code, guidelines, not absolute rules.   Facet and stroke code may ignore tolerances in awkward situations.\r\n * * If multiple tolerances are in effect, the actual count will usually be based on the one that demands the most strokes or facets, unless it is so high that it violates some upper limit on the number of facets on an arc or a section of a curve.\r\n * @public\r\n */\r\nexport class StrokeOptions {\r\n  /** Distance from stroke to actual geometry */\r\n  public chordTol?: number;\r\n  /** Turning angle between strokes. */\r\n  public angleTol?: Angle;\r\n  /** Maximum length of a single stroke. */\r\n  public maxEdgeLength?: number;\r\n  /** Caller expects convex facets.  */\r\n  public needConvexFacets?: boolean;\r\n  /** Minimum strokes on a primitive */\r\n  public minStrokesPerPrimitive?: number;\r\n  /** Whether or not to triangulate each added facet */\r\n  public shouldTriangulate: boolean = false;\r\n  private _needNormals?: boolean;\r\n  private _needTwoSided?: boolean;\r\n  private _needParams?: boolean;\r\n  /** Whether params are requested. */\r\n  public get needParams(): boolean {\r\n    return this._needParams !== undefined ? this._needParams : false;\r\n  }\r\n  public set needParams(value: boolean) {\r\n    this._needParams = value;\r\n  }\r\n  /** Whether normals are requested */\r\n  public get needNormals(): boolean {\r\n    return this._needNormals !== undefined ? this._needNormals : false;\r\n  }\r\n  public set needNormals(value: boolean) { this._needNormals = value; }\r\n  /** Whether twoSided is requested. */\r\n  public get needTwoSided(): boolean {\r\n    return this._needTwoSided !== undefined ? this._needTwoSided : false;\r\n  }\r\n  public set needTwoSided(value: boolean) { this._needTwoSided = value; }\r\n  /** Optional color request flag */\r\n  public needColors?: boolean;\r\n  /** Default number of strokes for a circle. */\r\n  public defaultCircleStrokes = 16;\r\n  /** Ask if angleTol is specified */\r\n  public get hasAngleTol(): boolean {\r\n    return this.angleTol !== undefined && Math.abs(this.angleTol.radians) > 0.0;\r\n  }\r\n  /** Ask if chordTol is specified */\r\n  public get hasChordTol(): boolean {\r\n    return this.chordTol !== undefined && this.chordTol > 0.0;\r\n  }\r\n  /** Ask if maxEdgeLength is specified */\r\n  public get hasMaxEdgeLength(): boolean {\r\n    return this.maxEdgeLength !== undefined && this.maxEdgeLength > 0.0;\r\n  }\r\n  /** Return a deep clone  */\r\n  public clone(): StrokeOptions {\r\n    const options = new StrokeOptions();\r\n    options.chordTol = this.chordTol;\r\n    options.angleTol = this.angleTol?.clone();\r\n    options.maxEdgeLength = this.maxEdgeLength;\r\n    options.needConvexFacets = this.needConvexFacets;\r\n    options.minStrokesPerPrimitive = this.minStrokesPerPrimitive;\r\n    options.shouldTriangulate = this.shouldTriangulate;\r\n    options._needNormals = this._needNormals;\r\n    options._needTwoSided = this._needTwoSided;\r\n    options._needParams = this._needParams;\r\n    options.needColors = this.needColors;\r\n    options.defaultCircleStrokes = this.defaultCircleStrokes;\r\n    return options;\r\n  }\r\n  /** Return stroke count which is the larger of the minCount or count needed for edge length condition. */\r\n  public applyMaxEdgeLength(minCount: number, totalLength: number): number {\r\n    totalLength = Math.abs(totalLength);\r\n    if (this.maxEdgeLength && this.maxEdgeLength > 0.0 && minCount * this.maxEdgeLength < totalLength) {\r\n      minCount = Geometry.stepCount(this.maxEdgeLength, totalLength, minCount);\r\n    }\r\n    return minCount;\r\n  }\r\n  /**\r\n   * Return stroke count which is the larger of the existing count or count needed for angle condition for given\r\n   * sweepRadians.\r\n   * * defaultStepRadians is assumed to be larger than zero.\r\n   */\r\n  public applyAngleTol(minCount: number, sweepRadians: number, defaultStepRadians: number): number {\r\n    return StrokeOptions.applyAngleTol(this, minCount, sweepRadians, defaultStepRadians);\r\n  }\r\n  /**\r\n   * Return stroke count which is the larger of minCount and the count required to turn sweepRadians, using tolerance\r\n   * from the options.\r\n   */\r\n  public static applyAngleTol(\r\n    options: StrokeOptions | undefined, minCount: number, sweepRadians: number, defaultStepRadians?: number\r\n  ): number {\r\n    sweepRadians = Math.abs(sweepRadians);\r\n    let stepRadians = defaultStepRadians ? defaultStepRadians : Math.PI / 8.0;\r\n    if (options && options.angleTol && options.angleTol.radians > 0.0)\r\n      stepRadians = options.angleTol.radians;\r\n    if (minCount * stepRadians < sweepRadians)\r\n      minCount = Geometry.stepCount(stepRadians, sweepRadians, minCount);\r\n    return minCount;\r\n  }\r\n  /**\r\n   * Return the number of strokes needed for given edgeLength curve.\r\n   * @param options\r\n   * @param minCount smallest allowed count\r\n   * @param edgeLength\r\n   */\r\n  public static applyMaxEdgeLength(\r\n    options: StrokeOptions | undefined, minCount: number, edgeLength: number\r\n  ): number {\r\n    if (edgeLength < 0)\r\n      edgeLength = - edgeLength;\r\n    if (minCount < 1)\r\n      minCount = 1;\r\n    if (options && options.maxEdgeLength && options.maxEdgeLength * minCount < edgeLength) {\r\n      minCount = Geometry.stepCount(options.maxEdgeLength, edgeLength, minCount);\r\n    }\r\n    return minCount;\r\n  }\r\n  /**\r\n   * Determine a stroke count for a (partial) circular arc of given radius. This considers angle, maxEdgeLength,\r\n   * chord, and minimum stroke.\r\n   */\r\n  public applyTolerancesToArc(radius: number, sweepRadians: number = Math.PI * 2): number {\r\n    let numStrokes = 1;\r\n    numStrokes = this.applyAngleTol(numStrokes, sweepRadians, Math.PI * 0.25);\r\n    numStrokes = this.applyMaxEdgeLength(numStrokes, sweepRadians * radius);\r\n    numStrokes = this.applyChordTol(numStrokes, radius, sweepRadians);\r\n    numStrokes = this.applyMinStrokesPerPrimitive(numStrokes);\r\n    return numStrokes;\r\n  }\r\n  /** Return stroke count which is the larger of existing count or count needed for circular arc chord tolerance condition. */\r\n  public applyChordTol(minCount: number, radius: number, sweepRadians: number): number {\r\n    if (this.chordTol && this.chordTol > 0.0 && this.chordTol < radius) {\r\n      const a = this.chordTol;\r\n      const stepRadians = 2.0 * Math.acos((1.0 - a / radius));\r\n      minCount = Geometry.stepCount(stepRadians, sweepRadians, minCount);\r\n    }\r\n    return minCount;\r\n  }\r\n  /**\r\n   * Return stroke count which is the larger of existing count or count needed for circular arc chord tol with given\r\n   * arc length and radians\r\n   */\r\n  public applyChordTolToLengthAndRadians(minCount: number, length: number, sweepRadians: number): number {\r\n    if (this.chordTol && this.chordTol > 0.0) {\r\n      const radius = Geometry.conditionalDivideFraction(length, sweepRadians);\r\n      if (radius !== undefined)\r\n        return this.applyChordTol(minCount, radius, sweepRadians);\r\n    }\r\n    return minCount;\r\n  }\r\n  /** Return stroke count which is the larger of existing count or `this.minStrokesPerPrimitive` */\r\n  public applyMinStrokesPerPrimitive(minCount: number): number {\r\n    if (this.minStrokesPerPrimitive !== undefined && Number.isFinite(this.minStrokesPerPrimitive)\r\n      && this.minStrokesPerPrimitive > minCount)\r\n      minCount = this.minStrokesPerPrimitive;\r\n    return minCount;\r\n  }\r\n  /**\r\n   * Create `StrokeOptions` with defaults appropriate for curves.\r\n   * * angle tolerance of 15 degrees.\r\n   * * all others inactive.\r\n   */\r\n  public static createForCurves(): StrokeOptions {\r\n    const options = new StrokeOptions();\r\n    options.angleTol = Angle.createDegrees(15.0);\r\n    return options;\r\n  }\r\n  /**\r\n   * Create `StrokeOptions` with defaults appropriate for surfaces facets\r\n   * * angle tolerance of 22.5 degrees.\r\n   * * all others inactive.\r\n   */\r\n  public static createForFacets(): StrokeOptions {\r\n    const options = new StrokeOptions();\r\n    options.angleTol = Angle.createDegrees(22.5);\r\n    return options;\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"StrokeOptions.js","sourceRoot":"","sources":["../../../src/curve/StrokeOptions.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F;;GAEG;AAEH,0CAAuC;AACvC,+CAA4C;AAE5C,mEAAmE;AAEnE;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,MAAa,aAAa;IAA1B;QAWE,qDAAqD;QAC9C,sBAAiB,GAAY,KAAK,CAAC;QA2B1C,8CAA8C;QACvC,yBAAoB,GAAG,EAAE,CAAC;IA0InC,CAAC;IAlKC,oCAAoC;IACpC,IAAW,UAAU;QACnB,OAAO,IAAI,CAAC,WAAW,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,KAAK,CAAC;IACnE,CAAC;IACD,IAAW,UAAU,CAAC,KAAc;QAClC,IAAI,CAAC,WAAW,GAAG,KAAK,CAAC;IAC3B,CAAC;IACD,oCAAoC;IACpC,IAAW,WAAW;QACpB,OAAO,IAAI,CAAC,YAAY,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,KAAK,CAAC;IACrE,CAAC;IACD,IAAW,WAAW,CAAC,KAAc;QACnC,IAAI,CAAC,YAAY,GAAG,KAAK,CAAC;IAC5B,CAAC;IACD,qCAAqC;IACrC,IAAW,YAAY;QACrB,OAAO,IAAI,CAAC,aAAa,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,KAAK,CAAC;IACvE,CAAC;IACD,IAAW,YAAY,CAAC,KAAc;QACpC,IAAI,CAAC,aAAa,GAAG,KAAK,CAAC;IAC7B,CAAC;IAKD,mCAAmC;IACnC,IAAW,WAAW;QACpB,OAAO,IAAI,CAAC,QAAQ,KAAK,SAAS,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,GAAG,GAAG,CAAC;IAC9E,CAAC;IACD,mCAAmC;IACnC,IAAW,WAAW;QACpB,OAAO,IAAI,CAAC,QAAQ,KAAK,SAAS,IAAI,IAAI,CAAC,QAAQ,GAAG,GAAG,CAAC;IAC5D,CAAC;IACD,wCAAwC;IACxC,IAAW,gBAAgB;QACzB,OAAO,IAAI,CAAC,aAAa,KAAK,SAAS,IAAI,IAAI,CAAC,aAAa,GAAG,GAAG,CAAC;IACtE,CAAC;IACD,2BAA2B;IACpB,KAAK;QACV,MAAM,OAAO,GAAG,IAAI,aAAa,EAAE,CAAC;QACpC,OAAO,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;QACjC,OAAO,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,EAAE,KAAK,EAAE,CAAC;QAC1C,OAAO,CAAC,aAAa,GAAG,IAAI,CAAC,aAAa,CAAC;QAC3C,OAAO,CAAC,gBAAgB,GAAG,IAAI,CAAC,gBAAgB,CAAC;QACjD,OAAO,CAAC,sBAAsB,GAAG,IAAI,CAAC,sBAAsB,CAAC;QAC7D,OAAO,CAAC,iBAAiB,GAAG,IAAI,CAAC,iBAAiB,CAAC;QACnD,OAAO,CAAC,YAAY,GAAG,IAAI,CAAC,YAAY,CAAC;QACzC,OAAO,CAAC,aAAa,GAAG,IAAI,CAAC,aAAa,CAAC;QAC3C,OAAO,CAAC,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC;QACvC,OAAO,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC;QACrC,OAAO,CAAC,oBAAoB,GAAG,IAAI,CAAC,oBAAoB,CAAC;QACzD,OAAO,OAAO,CAAC;IACjB,CAAC;IACD,yGAAyG;IAClG,kBAAkB,CAAC,QAAgB,EAAE,WAAmB;QAC7D,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;QACpC,IAAI,IAAI,CAAC,aAAa,IAAI,IAAI,CAAC,aAAa,GAAG,GAAG,IAAI,QAAQ,GAAG,IAAI,CAAC,aAAa,GAAG,WAAW,EAAE;YACjG,QAAQ,GAAG,mBAAQ,CAAC,SAAS,CAAC,IAAI,CAAC,aAAa,EAAE,WAAW,EAAE,QAAQ,CAAC,CAAC;SAC1E;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IACD;;;;OAIG;IACI,aAAa,CAAC,QAAgB,EAAE,YAAoB,EAAE,kBAA0B;QACrF,OAAO,aAAa,CAAC,aAAa,CAAC,IAAI,EAAE,QAAQ,EAAE,YAAY,EAAE,kBAAkB,CAAC,CAAC;IACvF,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,aAAa,CACzB,OAAkC,EAAE,QAAgB,EAAE,YAAoB,EAAE,kBAA2B;QAEvG,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;QACtC,IAAI,WAAW,GAAG,kBAAkB,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,GAAG,GAAG,CAAC;QAC1E,IAAI,OAAO,IAAI,OAAO,CAAC,QAAQ,IAAI,OAAO,CAAC,QAAQ,CAAC,OAAO,GAAG,GAAG;YAC/D,WAAW,GAAG,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAC;QACzC,IAAI,QAAQ,GAAG,WAAW,GAAG,YAAY;YACvC,QAAQ,GAAG,mBAAQ,CAAC,SAAS,CAAC,WAAW,EAAE,YAAY,EAAE,QAAQ,CAAC,CAAC;QACrE,OAAO,QAAQ,CAAC;IAClB,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,kBAAkB,CAC9B,OAAkC,EAAE,QAAgB,EAAE,UAAkB;QAExE,IAAI,UAAU,GAAG,CAAC;YAChB,UAAU,GAAG,CAAE,UAAU,CAAC;QAC5B,IAAI,QAAQ,GAAG,CAAC;YACd,QAAQ,GAAG,CAAC,CAAC;QACf,IAAI,OAAO,IAAI,OAAO,CAAC,aAAa,IAAI,OAAO,CAAC,aAAa,GAAG,QAAQ,GAAG,UAAU,EAAE;YACrF,QAAQ,GAAG,mBAAQ,CAAC,SAAS,CAAC,OAAO,CAAC,aAAa,EAAE,UAAU,EAAE,QAAQ,CAAC,CAAC;SAC5E;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IACD;;;OAGG;IACI,oBAAoB,CAAC,MAAc,EAAE,eAAuB,IAAI,CAAC,EAAE,GAAG,CAAC;QAC5E,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,UAAU,GAAG,IAAI,CAAC,aAAa,CAAC,UAAU,EAAE,YAAY,EAAE,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,CAAC;QAC1E,UAAU,GAAG,IAAI,CAAC,kBAAkB,CAAC,UAAU,EAAE,YAAY,GAAG,MAAM,CAAC,CAAC;QACxE,UAAU,GAAG,IAAI,CAAC,aAAa,CAAC,UAAU,EAAE,MAAM,EAAE,YAAY,CAAC,CAAC;QAClE,UAAU,GAAG,IAAI,CAAC,2BAA2B,CAAC,UAAU,CAAC,CAAC;QAC1D,OAAO,UAAU,CAAC;IACpB,CAAC;IACD,4HAA4H;IACrH,aAAa,CAAC,QAAgB,EAAE,MAAc,EAAE,YAAoB;QACzE,IAAI,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,QAAQ,GAAG,GAAG,IAAI,IAAI,CAAC,QAAQ,GAAG,MAAM,EAAE;YAClE,MAAM,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC;YACxB,MAAM,WAAW,GAAG,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;YACxD,QAAQ,GAAG,mBAAQ,CAAC,SAAS,CAAC,WAAW,EAAE,YAAY,EAAE,QAAQ,CAAC,CAAC;SACpE;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IACD;;;OAGG;IACI,+BAA+B,CAAC,QAAgB,EAAE,MAAc,EAAE,YAAoB;QAC3F,IAAI,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,QAAQ,GAAG,GAAG,EAAE;YACxC,MAAM,MAAM,GAAG,mBAAQ,CAAC,yBAAyB,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;YACxE,IAAI,MAAM,KAAK,SAAS;gBACtB,OAAO,IAAI,CAAC,aAAa,CAAC,QAAQ,EAAE,MAAM,EAAE,YAAY,CAAC,CAAC;SAC7D;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IACD,iGAAiG;IAC1F,2BAA2B,CAAC,QAAgB;QACjD,IAAI,IAAI,CAAC,sBAAsB,KAAK,SAAS,IAAI,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,sBAAsB,CAAC;eACxF,IAAI,CAAC,sBAAsB,GAAG,QAAQ;YACzC,QAAQ,GAAG,IAAI,CAAC,sBAAsB,CAAC;QACzC,OAAO,QAAQ,CAAC;IAClB,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,eAAe;QAC3B,MAAM,OAAO,GAAG,IAAI,aAAa,EAAE,CAAC;QACpC,OAAO,CAAC,QAAQ,GAAG,aAAK,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;QAC7C,OAAO,OAAO,CAAC;IACjB,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,eAAe;QAC3B,MAAM,OAAO,GAAG,IAAI,aAAa,EAAE,CAAC;QACpC,OAAO,CAAC,QAAQ,GAAG,aAAK,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;QAC7C,OAAO,OAAO,CAAC;IACjB,CAAC;CACF;AAlLD,sCAkLC","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\nimport { Geometry } from \"../Geometry\";\r\nimport { Angle } from \"../geometry3d/Angle\";\r\n\r\n/* eslint-disable @typescript-eslint/naming-convention, no-empty */\r\n\r\n/**\r\n * Tolerance blob for various stroking methods.\r\n *\r\n * * Across many applications, the critical concepts are:   chordTol, angleTol, maxEdgeLength\r\n * * Chord error is an distance measured from a curve or facet to its approximating stroke or facet.\r\n * * angle is the angle between two contiguous strokes or across a facet edge.\r\n * * maxEdgeLength is the length of a stroke or a edge of a facet.\r\n *\r\n * It is rare for all three to be active at once:\r\n * * Nearly all stroke and facet use cases will apply an angle tolerance.\r\n * * * For curves, 15 degrees is typical\r\n * * * For facets, 22.5 degrees is typical.\r\n * * * Halving the angle tolerance will (roughly) make curves get twice as many strokes, and surfaces get 4 times as many facets.\r\n * * * The angle tolerance has the useful property that its effect is independent of scale of that data.  If data is suddenly scaled into millimeters rather than meters, the facet counts remain the same.\r\n * * When creating output for devices such as 3D printing will want a chord tolerance.\r\n * * For graphics display, use an angle tolerance of around 15 degrees and an chord tolerance which is the size of several pixels.\r\n * * Analysis meshes (e.g. Finite Elements) commonly need to apply maxEdgeLength.\r\n * * * Using maxEdgeLength for graphics probably produces too many facets.   For example, it causes long cylinders to get many nearly-square facets instead of the small number of long quads usually used for graphics.\r\n * * Facet tolerances are, as the Pirates' Code, guidelines, not absolute rules.   Facet and stroke code may ignore tolerances in awkward situations.\r\n * * If multiple tolerances are in effect, the actual count will usually be based on the one that demands the most strokes or facets, unless it is so high that it violates some upper limit on the number of facets on an arc or a section of a curve.\r\n * @public\r\n */\r\nexport class StrokeOptions {\r\n  /** Distance from stroke to actual geometry */\r\n  public chordTol?: number;\r\n  /** Turning angle between strokes. */\r\n  public angleTol?: Angle;\r\n  /** Maximum length of a single stroke. */\r\n  public maxEdgeLength?: number;\r\n  /** Caller expects convex facets.  */\r\n  public needConvexFacets?: boolean;\r\n  /** Minimum strokes on a primitive */\r\n  public minStrokesPerPrimitive?: number;\r\n  /** Whether or not to triangulate each added facet */\r\n  public shouldTriangulate: boolean = false;\r\n  private _needNormals?: boolean;\r\n  private _needTwoSided?: boolean;\r\n  private _needParams?: boolean;\r\n  /** Whether params are requested. */\r\n  public get needParams(): boolean {\r\n    return this._needParams !== undefined ? this._needParams : false;\r\n  }\r\n  public set needParams(value: boolean) {\r\n    this._needParams = value;\r\n  }\r\n  /** Whether normals are requested */\r\n  public get needNormals(): boolean {\r\n    return this._needNormals !== undefined ? this._needNormals : false;\r\n  }\r\n  public set needNormals(value: boolean) {\r\n    this._needNormals = value;\r\n  }\r\n  /** Whether twoSided is requested. */\r\n  public get needTwoSided(): boolean {\r\n    return this._needTwoSided !== undefined ? this._needTwoSided : false;\r\n  }\r\n  public set needTwoSided(value: boolean) {\r\n    this._needTwoSided = value;\r\n  }\r\n  /** Optional color request flag */\r\n  public needColors?: boolean;\r\n  /** Default number of strokes for a circle. */\r\n  public defaultCircleStrokes = 16;\r\n  /** Ask if angleTol is specified */\r\n  public get hasAngleTol(): boolean {\r\n    return this.angleTol !== undefined && Math.abs(this.angleTol.radians) > 0.0;\r\n  }\r\n  /** Ask if chordTol is specified */\r\n  public get hasChordTol(): boolean {\r\n    return this.chordTol !== undefined && this.chordTol > 0.0;\r\n  }\r\n  /** Ask if maxEdgeLength is specified */\r\n  public get hasMaxEdgeLength(): boolean {\r\n    return this.maxEdgeLength !== undefined && this.maxEdgeLength > 0.0;\r\n  }\r\n  /** Return a deep clone  */\r\n  public clone(): StrokeOptions {\r\n    const options = new StrokeOptions();\r\n    options.chordTol = this.chordTol;\r\n    options.angleTol = this.angleTol?.clone();\r\n    options.maxEdgeLength = this.maxEdgeLength;\r\n    options.needConvexFacets = this.needConvexFacets;\r\n    options.minStrokesPerPrimitive = this.minStrokesPerPrimitive;\r\n    options.shouldTriangulate = this.shouldTriangulate;\r\n    options._needNormals = this._needNormals;\r\n    options._needTwoSided = this._needTwoSided;\r\n    options._needParams = this._needParams;\r\n    options.needColors = this.needColors;\r\n    options.defaultCircleStrokes = this.defaultCircleStrokes;\r\n    return options;\r\n  }\r\n  /** Return stroke count which is the larger of the minCount or count needed for edge length condition. */\r\n  public applyMaxEdgeLength(minCount: number, totalLength: number): number {\r\n    totalLength = Math.abs(totalLength);\r\n    if (this.maxEdgeLength && this.maxEdgeLength > 0.0 && minCount * this.maxEdgeLength < totalLength) {\r\n      minCount = Geometry.stepCount(this.maxEdgeLength, totalLength, minCount);\r\n    }\r\n    return minCount;\r\n  }\r\n  /**\r\n   * Return stroke count which is the larger of the existing count or count needed for angle condition for given\r\n   * sweepRadians.\r\n   * * defaultStepRadians is assumed to be larger than zero.\r\n   */\r\n  public applyAngleTol(minCount: number, sweepRadians: number, defaultStepRadians: number): number {\r\n    return StrokeOptions.applyAngleTol(this, minCount, sweepRadians, defaultStepRadians);\r\n  }\r\n  /**\r\n   * Return stroke count which is the larger of minCount and the count required to turn sweepRadians, using tolerance\r\n   * from the options.\r\n   */\r\n  public static applyAngleTol(\r\n    options: StrokeOptions | undefined, minCount: number, sweepRadians: number, defaultStepRadians?: number\r\n  ): number {\r\n    sweepRadians = Math.abs(sweepRadians);\r\n    let stepRadians = defaultStepRadians ? defaultStepRadians : Math.PI / 8.0;\r\n    if (options && options.angleTol && options.angleTol.radians > 0.0)\r\n      stepRadians = options.angleTol.radians;\r\n    if (minCount * stepRadians < sweepRadians)\r\n      minCount = Geometry.stepCount(stepRadians, sweepRadians, minCount);\r\n    return minCount;\r\n  }\r\n  /**\r\n   * Return the number of strokes needed for given edgeLength curve.\r\n   * @param options\r\n   * @param minCount smallest allowed count\r\n   * @param edgeLength\r\n   */\r\n  public static applyMaxEdgeLength(\r\n    options: StrokeOptions | undefined, minCount: number, edgeLength: number\r\n  ): number {\r\n    if (edgeLength < 0)\r\n      edgeLength = - edgeLength;\r\n    if (minCount < 1)\r\n      minCount = 1;\r\n    if (options && options.maxEdgeLength && options.maxEdgeLength * minCount < edgeLength) {\r\n      minCount = Geometry.stepCount(options.maxEdgeLength, edgeLength, minCount);\r\n    }\r\n    return minCount;\r\n  }\r\n  /**\r\n   * Determine a stroke count for a (partial) circular arc of given radius. This considers angle, maxEdgeLength,\r\n   * chord, and minimum stroke.\r\n   */\r\n  public applyTolerancesToArc(radius: number, sweepRadians: number = Math.PI * 2): number {\r\n    let numStrokes = 1;\r\n    numStrokes = this.applyAngleTol(numStrokes, sweepRadians, Math.PI * 0.25);\r\n    numStrokes = this.applyMaxEdgeLength(numStrokes, sweepRadians * radius);\r\n    numStrokes = this.applyChordTol(numStrokes, radius, sweepRadians);\r\n    numStrokes = this.applyMinStrokesPerPrimitive(numStrokes);\r\n    return numStrokes;\r\n  }\r\n  /** Return stroke count which is the larger of existing count or count needed for circular arc chord tolerance condition. */\r\n  public applyChordTol(minCount: number, radius: number, sweepRadians: number): number {\r\n    if (this.chordTol && this.chordTol > 0.0 && this.chordTol < radius) {\r\n      const a = this.chordTol;\r\n      const stepRadians = 2.0 * Math.acos((1.0 - a / radius));\r\n      minCount = Geometry.stepCount(stepRadians, sweepRadians, minCount);\r\n    }\r\n    return minCount;\r\n  }\r\n  /**\r\n   * Return stroke count which is the larger of existing count or count needed for circular arc chord tol with given\r\n   * arc length and radians\r\n   */\r\n  public applyChordTolToLengthAndRadians(minCount: number, length: number, sweepRadians: number): number {\r\n    if (this.chordTol && this.chordTol > 0.0) {\r\n      const radius = Geometry.conditionalDivideFraction(length, sweepRadians);\r\n      if (radius !== undefined)\r\n        return this.applyChordTol(minCount, radius, sweepRadians);\r\n    }\r\n    return minCount;\r\n  }\r\n  /** Return stroke count which is the larger of existing count or `this.minStrokesPerPrimitive` */\r\n  public applyMinStrokesPerPrimitive(minCount: number): number {\r\n    if (this.minStrokesPerPrimitive !== undefined && Number.isFinite(this.minStrokesPerPrimitive)\r\n      && this.minStrokesPerPrimitive > minCount)\r\n      minCount = this.minStrokesPerPrimitive;\r\n    return minCount;\r\n  }\r\n  /**\r\n   * Create `StrokeOptions` with defaults appropriate for curves.\r\n   * * angle tolerance of 15 degrees.\r\n   * * all others inactive.\r\n   */\r\n  public static createForCurves(): StrokeOptions {\r\n    const options = new StrokeOptions();\r\n    options.angleTol = Angle.createDegrees(15.0);\r\n    return options;\r\n  }\r\n  /**\r\n   * Create `StrokeOptions` with defaults appropriate for surfaces facets\r\n   * * angle tolerance of 22.5 degrees.\r\n   * * all others inactive.\r\n   */\r\n  public static createForFacets(): StrokeOptions {\r\n    const options = new StrokeOptions();\r\n    options.angleTol = Angle.createDegrees(22.5);\r\n    return options;\r\n  }\r\n}\r\n"]}

package/lib/cjs/curve/UnionRegion.d.ts

@@ -19,9 +19,9 @@ import { StrokeOptions } from "./StrokeOptions";
 export declare class UnionRegion extends CurveCollection {
     /** String name for schema properties */
     readonly curveCollectionType = "unionRegion";
-    /** test if `other` is a `UnionRegion` */
+    /** Test if `other` is a `UnionRegion` */
     isSameGeometryClass(other: GeometryQuery): boolean;
-    /** collection of Loop and ParityRegion children. */
+    /** Collection of Loop and ParityRegion children. */
     protected _children: Array<ParityRegion | Loop>;
     /** Return the array of regions */
     get children(): Array<ParityRegion | Loop>;
@@ -29,15 +29,16 @@ export declare class UnionRegion extends CurveCollection {
     constructor();
     /** Create a `UnionRegion` with given region children */
     static create(...data: Array<ParityRegion | Loop>): UnionRegion;
-    /** Return the boundary type (5) of a corresponding  MicroStation CurveVector */
+    /** Return the boundary type (5) of a corresponding MicroStation CurveVector */
     dgnBoundaryType(): number;
-    /** dispatch to more strongly typed  `processor.announceUnionRegion(this, indexInParent)` */
+    /** Dispatch to more strongly typed `processor.announceUnionRegion(this, indexInParent)` */
     announceToCurveProcessor(processor: RecursiveCurveProcessor, indexInParent?: number): void;
     /** Return structural clone with stroked primitives. */
     cloneStroked(options?: StrokeOptions): UnionRegion;
     /** Return new empty `UnionRegion` */
     cloneEmptyPeer(): UnionRegion;
-    /** add a child.
+    /**
+     * Try to add a child.
      * * Returns false if the `AnyCurve` child is not a region type.
      */
     tryAddChild(child: AnyCurve): boolean;

package/lib/cjs/curve/UnionRegion.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"UnionRegion.d.ts","sourceRoot":"","sources":["../../../src/curve/UnionRegion.ts"],"names":[],"mappings":"AAKA;;GAEG;AACH,OAAO,EAAE,eAAe,EAAE,MAAM,+BAA+B,CAAC;AAChE,OAAO,EAAE,QAAQ,EAAE,MAAM,cAAc,CAAC;AACxC,OAAO,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AACpD,OAAO,EAAE,uBAAuB,EAAE,MAAM,kBAAkB,CAAC;AAC3D,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAChD,OAAO,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAC9B,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAC9C,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAEhD;;;;;;GAMG;AACH,qBAAa,WAAY,SAAQ,eAAe;IAC9C,wCAAwC;IACxC,SAAgB,mBAAmB,iBAAiB;IAEpD,yCAAyC;IAClC,mBAAmB,CAAC,KAAK,EAAE,aAAa,GAAG,OAAO;IACzD,oDAAoD;IACpD,SAAS,CAAC,SAAS,EAAE,KAAK,CAAC,YAAY,GAAG,IAAI,CAAC,CAAC;IAChD,kCAAkC;IAClC,IAAoB,QAAQ,IAAI,KAAK,CAAC,YAAY,GAAG,IAAI,CAAC,CAA2B;IACrF,iDAAiD;;IAEjD,wDAAwD;WAC1C,MAAM,CAAC,GAAG,IAAI,EAAE,KAAK,CAAC,YAAY,GAAG,IAAI,CAAC,GAAG,WAAW;IAOtE,gFAAgF;IACzE,eAAe,IAAI,MAAM;IAChC,4FAA4F;IACrF,wBAAwB,CAAC,SAAS,EAAE,uBAAuB,EAAE,aAAa,GAAE,MAAW,GAAG,IAAI;IAGrG,uDAAuD;IAChD,YAAY,CAAC,OAAO,CAAC,EAAE,aAAa,GAAG,WAAW;IAUzD,qCAAqC;IAC9B,cAAc,IAAI,WAAW;IACpC;;OAEG;IACI,WAAW,CAAC,KAAK,EAAE,QAAQ,GAAG,OAAO;IAO5C,0CAA0C;IACnC,QAAQ,CAAC,CAAC,EAAE,MAAM,GAAG,IAAI,GAAG,YAAY,GAAG,SAAS;IAK3D,8EAA8E;IACvE,yBAAyB,CAAC,OAAO,EAAE,eAAe,GAAG,GAAG;CAGhE"}
+{"version":3,"file":"UnionRegion.d.ts","sourceRoot":"","sources":["../../../src/curve/UnionRegion.ts"],"names":[],"mappings":"AAKA;;GAEG;AACH,OAAO,EAAE,eAAe,EAAE,MAAM,+BAA+B,CAAC;AAChE,OAAO,EAAE,QAAQ,EAAE,MAAM,cAAc,CAAC;AACxC,OAAO,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AACpD,OAAO,EAAE,uBAAuB,EAAE,MAAM,kBAAkB,CAAC;AAC3D,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAChD,OAAO,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAC9B,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAC9C,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAEhD;;;;;;GAMG;AACH,qBAAa,WAAY,SAAQ,eAAe;IAC9C,wCAAwC;IACxC,SAAgB,mBAAmB,iBAAiB;IACpD,yCAAyC;IAClC,mBAAmB,CAAC,KAAK,EAAE,aAAa,GAAG,OAAO;IAGzD,oDAAoD;IACpD,SAAS,CAAC,SAAS,EAAE,KAAK,CAAC,YAAY,GAAG,IAAI,CAAC,CAAC;IAChD,kCAAkC;IAClC,IAAoB,QAAQ,IAAI,KAAK,CAAC,YAAY,GAAG,IAAI,CAAC,CAEzD;IACD,iDAAiD;;IAKjD,wDAAwD;WAC1C,MAAM,CAAC,GAAG,IAAI,EAAE,KAAK,CAAC,YAAY,GAAG,IAAI,CAAC,GAAG,WAAW;IAOtE,+EAA+E;IACxE,eAAe,IAAI,MAAM;IAGhC,2FAA2F;IACpF,wBAAwB,CAAC,SAAS,EAAE,uBAAuB,EAAE,aAAa,GAAE,MAAW,GAAG,IAAI;IAGrG,uDAAuD;IAChD,YAAY,CAAC,OAAO,CAAC,EAAE,aAAa,GAAG,WAAW;IAUzD,qCAAqC;IAC9B,cAAc,IAAI,WAAW;IAGpC;;;OAGG;IACI,WAAW,CAAC,KAAK,EAAE,QAAQ,GAAG,OAAO;IAO5C,0CAA0C;IACnC,QAAQ,CAAC,CAAC,EAAE,MAAM,GAAG,IAAI,GAAG,YAAY,GAAG,SAAS;IAK3D,8EAA8E;IACvE,yBAAyB,CAAC,OAAO,EAAE,eAAe,GAAG,GAAG;CAGhE"}

package/lib/cjs/curve/UnionRegion.js

@@ -16,10 +16,14 @@ const ParityRegion_1 = require("./ParityRegion");
  * @public
  */
 class UnionRegion extends CurveCollection_1.CurveCollection {
-    /** test if `other` is a `UnionRegion` */
-    isSameGeometryClass(other) { return other instanceof UnionRegion; }
+    /** Test if `other` is a `UnionRegion` */
+    isSameGeometryClass(other) {
+        return other instanceof UnionRegion;
+    }
     /** Return the array of regions */
-    get children() { return this._children; }
+    get children() {
+        return this._children;
+    }
     /** Constructor -- initialize with no children */
     constructor() {
         super();
@@ -35,9 +39,11 @@ class UnionRegion extends CurveCollection_1.CurveCollection {
         }
         return result;
     }
-    /** Return the boundary type (5) of a corresponding  MicroStation CurveVector */
-    dgnBoundaryType() { return 5; }
-    /** dispatch to more strongly typed  `processor.announceUnionRegion(this, indexInParent)` */
+    /** Return the boundary type (5) of a corresponding MicroStation CurveVector */
+    dgnBoundaryType() {
+        return 5;
+    }
+    /** Dispatch to more strongly typed `processor.announceUnionRegion(this, indexInParent)` */
     announceToCurveProcessor(processor, indexInParent = -1) {
         return processor.announceUnionRegion(this, indexInParent);
     }
@@ -53,8 +59,11 @@ class UnionRegion extends CurveCollection_1.CurveCollection {
         return clone;
     }
     /** Return new empty `UnionRegion` */
-    cloneEmptyPeer() { return new UnionRegion(); }
-    /** add a child.
+    cloneEmptyPeer() {
+        return new UnionRegion();
+    }
+    /**
+     * Try to add a child.
      * * Returns false if the `AnyCurve` child is not a region type.
      */
     tryAddChild(child) {

package/lib/cjs/curve/UnionRegion.js.map

@@ -1 +1 @@
-{"version":3,"file":"UnionRegion.js","sourceRoot":"","sources":["../../../src/curve/UnionRegion.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAO/F,uDAAoD;AAGpD,iCAA8B;AAC9B,iDAA8C;AAG9C;;;;;;GAMG;AACH,MAAa,WAAY,SAAQ,iCAAe;IAI9C,yCAAyC;IAClC,mBAAmB,CAAC,KAAoB,IAAa,OAAO,KAAK,YAAY,WAAW,CAAC,CAAC,CAAC;IAGlG,kCAAkC;IAClC,IAAoB,QAAQ,KAAiC,OAAO,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC;IACrF,iDAAiD;IACjD;QAAuB,KAAK,EAAE,CAAC;QAV/B,wCAAwC;QACxB,wBAAmB,GAAG,aAAa,CAAC;QASpB,IAAI,CAAC,SAAS,GAAG,EAAE,CAAC;IAAC,CAAC;IACtD,wDAAwD;IACjD,MAAM,CAAC,MAAM,CAAC,GAAG,IAAgC;QACtD,MAAM,MAAM,GAAG,IAAI,WAAW,EAAE,CAAC;QACjC,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE;YACxB,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;SAC3B;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,gFAAgF;IACzE,eAAe,KAAa,OAAO,CAAC,CAAC,CAAC,CAAC;IAC9C,4FAA4F;IACrF,wBAAwB,CAAC,SAAkC,EAAE,gBAAwB,CAAC,CAAC;QAC5F,OAAO,SAAS,CAAC,mBAAmB,CAAC,IAAI,EAAE,aAAa,CAAC,CAAC;IAC5D,CAAC;IACD,uDAAuD;IAChD,YAAY,CAAC,OAAuB;QACzC,MAAM,KAAK,GAAG,IAAI,WAAW,EAAE,CAAC;QAChC,IAAI,KAAK,CAAC;QACV,KAAK,KAAK,IAAI,IAAI,CAAC,SAAS,EAAE;YAC5B,MAAM,YAAY,GAAG,KAAK,CAAC,YAAY,CAAC,OAAO,CAAwB,CAAC;YACxE,IAAI,YAAY;gBACd,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;SACrC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,qCAAqC;IAC9B,cAAc,KAAkB,OAAO,IAAI,WAAW,EAAE,CAAC,CAAC,CAAC;IAClE;;OAEG;IACI,WAAW,CAAC,KAAe;QAChC,IAAI,KAAK,IAAI,KAAK,YAAY,2BAAY,IAAI,KAAK,YAAY,WAAI,EAAE;YACnE,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC3B,OAAO,IAAI,CAAC;SACb;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,0CAA0C;IACnC,QAAQ,CAAC,CAAS;QACvB,IAAI,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM;YAC3B,OAAO,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QAC3B,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,8EAA8E;IACvE,yBAAyB,CAAC,OAAwB;QACvD,OAAO,OAAO,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC;IACzC,CAAC;CACF;AA3DD,kCA2DC","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\nimport { GeometryHandler } from \"../geometry3d/GeometryHandler\";\r\nimport { AnyCurve } from \"./CurveChain\";\r\nimport { CurveCollection } from \"./CurveCollection\";\r\nimport { RecursiveCurveProcessor } from \"./CurveProcessor\";\r\nimport { GeometryQuery } from \"./GeometryQuery\";\r\nimport { Loop } from \"./Loop\";\r\nimport { ParityRegion } from \"./ParityRegion\";\r\nimport { StrokeOptions } from \"./StrokeOptions\";\r\n\r\n/**\r\n * * A `UnionRegion` is a collection of other planar region types -- `Loop` and `ParityRegion`.\r\n * * The composite is the union of the contained regions.\r\n * * A point is \"in\" the composite if it is \"in\" one or more of the contained regions.\r\n * @see [Curve Collections]($docs/learning/geometry/CurveCollection.md) learning article.\r\n * @public\r\n */\r\nexport class UnionRegion extends CurveCollection {\r\n  /** String name for schema properties */\r\n  public readonly curveCollectionType = \"unionRegion\";\r\n\r\n  /** test if `other` is a `UnionRegion` */\r\n  public isSameGeometryClass(other: GeometryQuery): boolean { return other instanceof UnionRegion; }\r\n  /** collection of Loop and ParityRegion children. */\r\n  protected _children: Array<ParityRegion | Loop>;\r\n  /** Return the array of regions */\r\n  public override get children(): Array<ParityRegion | Loop> { return this._children; }\r\n  /** Constructor -- initialize with no children */\r\n  public constructor() { super(); this._children = []; }\r\n  /** Create a `UnionRegion` with given region children */\r\n  public static create(...data: Array<ParityRegion | Loop>): UnionRegion {\r\n    const result = new UnionRegion();\r\n    for (const child of data) {\r\n      result.tryAddChild(child);\r\n    }\r\n    return result;\r\n  }\r\n  /** Return the boundary type (5) of a corresponding  MicroStation CurveVector */\r\n  public dgnBoundaryType(): number { return 5; }\r\n  /** dispatch to more strongly typed  `processor.announceUnionRegion(this, indexInParent)` */\r\n  public announceToCurveProcessor(processor: RecursiveCurveProcessor, indexInParent: number = -1): void {\r\n    return processor.announceUnionRegion(this, indexInParent);\r\n  }\r\n  /** Return structural clone with stroked primitives. */\r\n  public cloneStroked(options?: StrokeOptions): UnionRegion {\r\n    const clone = new UnionRegion();\r\n    let child;\r\n    for (child of this._children) {\r\n      const childStrokes = child.cloneStroked(options) as ParityRegion | Loop;\r\n      if (childStrokes)\r\n        clone.children.push(childStrokes);\r\n    }\r\n    return clone;\r\n  }\r\n  /** Return new empty `UnionRegion` */\r\n  public cloneEmptyPeer(): UnionRegion { return new UnionRegion(); }\r\n  /** add a child.\r\n   * * Returns false if the `AnyCurve` child is not a region type.\r\n   */\r\n  public tryAddChild(child: AnyCurve): boolean {\r\n    if (child && child instanceof ParityRegion || child instanceof Loop) {\r\n      this._children.push(child);\r\n      return true;\r\n    }\r\n    return false;\r\n  }\r\n  /** Return a child identified by index. */\r\n  public getChild(i: number): Loop | ParityRegion | undefined {\r\n    if (i < this._children.length)\r\n      return this._children[i];\r\n    return undefined;\r\n  }\r\n  /** Second step of double dispatch:  call `handler.handleUnionRegion(this)` */\r\n  public dispatchToGeometryHandler(handler: GeometryHandler): any {\r\n    return handler.handleUnionRegion(this);\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"UnionRegion.js","sourceRoot":"","sources":["../../../src/curve/UnionRegion.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAO/F,uDAAoD;AAGpD,iCAA8B;AAC9B,iDAA8C;AAG9C;;;;;;GAMG;AACH,MAAa,WAAY,SAAQ,iCAAe;IAG9C,yCAAyC;IAClC,mBAAmB,CAAC,KAAoB;QAC7C,OAAO,KAAK,YAAY,WAAW,CAAC;IACtC,CAAC;IAGD,kCAAkC;IAClC,IAAoB,QAAQ;QAC1B,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;IACD,iDAAiD;IACjD;QACE,KAAK,EAAE,CAAC;QAdV,wCAAwC;QACxB,wBAAmB,GAAG,aAAa,CAAC;QAclD,IAAI,CAAC,SAAS,GAAG,EAAE,CAAC;IACtB,CAAC;IACD,wDAAwD;IACjD,MAAM,CAAC,MAAM,CAAC,GAAG,IAAgC;QACtD,MAAM,MAAM,GAAG,IAAI,WAAW,EAAE,CAAC;QACjC,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE;YACxB,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;SAC3B;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,+EAA+E;IACxE,eAAe;QACpB,OAAO,CAAC,CAAC;IACX,CAAC;IACD,2FAA2F;IACpF,wBAAwB,CAAC,SAAkC,EAAE,gBAAwB,CAAC,CAAC;QAC5F,OAAO,SAAS,CAAC,mBAAmB,CAAC,IAAI,EAAE,aAAa,CAAC,CAAC;IAC5D,CAAC;IACD,uDAAuD;IAChD,YAAY,CAAC,OAAuB;QACzC,MAAM,KAAK,GAAG,IAAI,WAAW,EAAE,CAAC;QAChC,IAAI,KAAK,CAAC;QACV,KAAK,KAAK,IAAI,IAAI,CAAC,SAAS,EAAE;YAC5B,MAAM,YAAY,GAAG,KAAK,CAAC,YAAY,CAAC,OAAO,CAAwB,CAAC;YACxE,IAAI,YAAY;gBACd,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;SACrC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,qCAAqC;IAC9B,cAAc;QACnB,OAAO,IAAI,WAAW,EAAE,CAAC;IAC3B,CAAC;IACD;;;OAGG;IACI,WAAW,CAAC,KAAe;QAChC,IAAI,KAAK,IAAI,KAAK,YAAY,2BAAY,IAAI,KAAK,YAAY,WAAI,EAAE;YACnE,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC3B,OAAO,IAAI,CAAC;SACb;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,0CAA0C;IACnC,QAAQ,CAAC,CAAS;QACvB,IAAI,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM;YAC3B,OAAO,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QAC3B,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,8EAA8E;IACvE,yBAAyB,CAAC,OAAwB;QACvD,OAAO,OAAO,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC;IACzC,CAAC;CACF;AAtED,kCAsEC","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\nimport { GeometryHandler } from \"../geometry3d/GeometryHandler\";\r\nimport { AnyCurve } from \"./CurveChain\";\r\nimport { CurveCollection } from \"./CurveCollection\";\r\nimport { RecursiveCurveProcessor } from \"./CurveProcessor\";\r\nimport { GeometryQuery } from \"./GeometryQuery\";\r\nimport { Loop } from \"./Loop\";\r\nimport { ParityRegion } from \"./ParityRegion\";\r\nimport { StrokeOptions } from \"./StrokeOptions\";\r\n\r\n/**\r\n * * A `UnionRegion` is a collection of other planar region types -- `Loop` and `ParityRegion`.\r\n * * The composite is the union of the contained regions.\r\n * * A point is \"in\" the composite if it is \"in\" one or more of the contained regions.\r\n * @see [Curve Collections]($docs/learning/geometry/CurveCollection.md) learning article.\r\n * @public\r\n */\r\nexport class UnionRegion extends CurveCollection {\r\n  /** String name for schema properties */\r\n  public readonly curveCollectionType = \"unionRegion\";\r\n  /** Test if `other` is a `UnionRegion` */\r\n  public isSameGeometryClass(other: GeometryQuery): boolean {\r\n    return other instanceof UnionRegion;\r\n  }\r\n  /** Collection of Loop and ParityRegion children. */\r\n  protected _children: Array<ParityRegion | Loop>;\r\n  /** Return the array of regions */\r\n  public override get children(): Array<ParityRegion | Loop> {\r\n    return this._children;\r\n  }\r\n  /** Constructor -- initialize with no children */\r\n  public constructor() {\r\n    super();\r\n    this._children = [];\r\n  }\r\n  /** Create a `UnionRegion` with given region children */\r\n  public static create(...data: Array<ParityRegion | Loop>): UnionRegion {\r\n    const result = new UnionRegion();\r\n    for (const child of data) {\r\n      result.tryAddChild(child);\r\n    }\r\n    return result;\r\n  }\r\n  /** Return the boundary type (5) of a corresponding MicroStation CurveVector */\r\n  public dgnBoundaryType(): number {\r\n    return 5;\r\n  }\r\n  /** Dispatch to more strongly typed `processor.announceUnionRegion(this, indexInParent)` */\r\n  public announceToCurveProcessor(processor: RecursiveCurveProcessor, indexInParent: number = -1): void {\r\n    return processor.announceUnionRegion(this, indexInParent);\r\n  }\r\n  /** Return structural clone with stroked primitives. */\r\n  public cloneStroked(options?: StrokeOptions): UnionRegion {\r\n    const clone = new UnionRegion();\r\n    let child;\r\n    for (child of this._children) {\r\n      const childStrokes = child.cloneStroked(options) as ParityRegion | Loop;\r\n      if (childStrokes)\r\n        clone.children.push(childStrokes);\r\n    }\r\n    return clone;\r\n  }\r\n  /** Return new empty `UnionRegion` */\r\n  public cloneEmptyPeer(): UnionRegion {\r\n    return new UnionRegion();\r\n  }\r\n  /**\r\n   * Try to add a child.\r\n   * * Returns false if the `AnyCurve` child is not a region type.\r\n   */\r\n  public tryAddChild(child: AnyCurve): boolean {\r\n    if (child && child instanceof ParityRegion || child instanceof Loop) {\r\n      this._children.push(child);\r\n      return true;\r\n    }\r\n    return false;\r\n  }\r\n  /** Return a child identified by index. */\r\n  public getChild(i: number): Loop | ParityRegion | undefined {\r\n    if (i < this._children.length)\r\n      return this._children[i];\r\n    return undefined;\r\n  }\r\n  /** Second step of double dispatch:  call `handler.handleUnionRegion(this)` */\r\n  public dispatchToGeometryHandler(handler: GeometryHandler): any {\r\n    return handler.handleUnionRegion(this);\r\n  }\r\n}\r\n"]}

package/lib/cjs/curve/internalContexts/GapSearchContext.d.ts

@@ -4,7 +4,8 @@
 import { CurveCollection } from "../CurveCollection";
 import { CurvePrimitive } from "../CurvePrimitive";
 import { RecursiveCurveProcessorWithStack } from "../CurveProcessor";
-/** Algorithmic class: Accumulate maximum gap between adjacent primitives of CurveChain.
+/**
+ * Algorithmic class: Accumulate maximum gap between adjacent primitives of CurveChain.
  * @internal
  */
 export declare class GapSearchContext extends RecursiveCurveProcessorWithStack {

package/lib/cjs/curve/internalContexts/GapSearchContext.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"GapSearchContext.d.ts","sourceRoot":"","sources":["../../../../src/curve/internalContexts/GapSearchContext.ts"],"names":[],"mappings":"AAKA;;GAEG;AACH,OAAO,EAAc,eAAe,EAAE,MAAM,oBAAoB,CAAC;AACjE,OAAO,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC;AACnD,OAAO,EAAE,gCAAgC,EAAE,MAAM,mBAAmB,CAAC;AAGrE;;GAEG;AACH,qBAAa,gBAAiB,SAAQ,gCAAgC;IAC7D,MAAM,EAAE,MAAM,CAAC;;WAER,MAAM,CAAC,MAAM,EAAE,eAAe,GAAG,MAAM;IAKrC,sBAAsB,CAAC,KAAK,EAAE,cAAc,EAAE,cAAc,EAAE,MAAM,GAAG,IAAI;CAY5F"}
+{"version":3,"file":"GapSearchContext.d.ts","sourceRoot":"","sources":["../../../../src/curve/internalContexts/GapSearchContext.ts"],"names":[],"mappings":"AAKA;;GAEG;AACH,OAAO,EAAc,eAAe,EAAE,MAAM,oBAAoB,CAAC;AACjE,OAAO,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC;AACnD,OAAO,EAAE,gCAAgC,EAAE,MAAM,mBAAmB,CAAC;AAGrE;;;GAGG;AACH,qBAAa,gBAAiB,SAAQ,gCAAgC;IAC7D,MAAM,EAAE,MAAM,CAAC;;WAKR,MAAM,CAAC,MAAM,EAAE,eAAe,GAAG,MAAM;IAKrC,sBAAsB,CAAC,KAAK,EAAE,cAAc,EAAE,cAAc,EAAE,MAAM,GAAG,IAAI;CAY5F"}

package/lib/cjs/curve/internalContexts/GapSearchContext.js

@@ -11,11 +11,15 @@ exports.GapSearchContext = void 0;
 const CurveCollection_1 = require("../CurveCollection");
 const CurveProcessor_1 = require("../CurveProcessor");
 // import { SumLengthsContext, GapSearchContext, CountLinearPartsSearchContext, CloneCurvesContext, TransformInPlaceContext } from "./CurveSearches";
-/** Algorithmic class: Accumulate maximum gap between adjacent primitives of CurveChain.
+/**
+ * Algorithmic class: Accumulate maximum gap between adjacent primitives of CurveChain.
  * @internal
  */
 class GapSearchContext extends CurveProcessor_1.RecursiveCurveProcessorWithStack {
-    constructor() { super(); this.maxGap = 0.0; }
+    constructor() {
+        super();
+        this.maxGap = 0.0;
+    }
     static maxGap(target) {
         const context = new GapSearchContext();
         target.announceToCurveProcessor(context);

package/lib/cjs/curve/internalContexts/GapSearchContext.js.map

@@ -1 +1 @@
-{"version":3,"file":"GapSearchContext.js","sourceRoot":"","sources":["../../../../src/curve/internalContexts/GapSearchContext.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F;;GAEG;AACH,wDAAiE;AAEjE,sDAAqE;AAErE,qJAAqJ;AACrJ;;GAEG;AACH,MAAa,gBAAiB,SAAQ,iDAAgC;IAEpE,gBAAgB,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC;IACtC,MAAM,CAAC,MAAM,CAAC,MAAuB;QAC1C,MAAM,OAAO,GAAG,IAAI,gBAAgB,EAAE,CAAC;QACvC,MAAM,CAAC,wBAAwB,CAAC,OAAO,CAAC,CAAC;QACzC,OAAO,OAAO,CAAC,MAAM,CAAC;IACxB,CAAC;IACe,sBAAsB,CAAC,KAAqB,EAAE,cAAsB;QAClF,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE;YAC1B,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YACnD,IAAI,MAAM,YAAY,4BAAU,EAAE;gBAChC,MAAM,KAAK,GAAG,MAAM,CAAC;gBACrB,MAAM,SAAS,GAAG,KAAK,CAAC,oBAAoB,CAAC,cAAc,GAAG,CAAC,CAAC,CAAC;gBACjE,IAAI,KAAK,KAAK,SAAS,IAAI,SAAS,KAAK,SAAS,EAAE;oBAClD,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,SAAS,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;iBACxF;aACF;SACF;IACH,CAAC;CACF;AApBD,4CAoBC","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\nimport { CurveChain, CurveCollection } from \"../CurveCollection\";\r\nimport { CurvePrimitive } from \"../CurvePrimitive\";\r\nimport { RecursiveCurveProcessorWithStack } from \"../CurveProcessor\";\r\n\r\n// import { SumLengthsContext, GapSearchContext, CountLinearPartsSearchContext, CloneCurvesContext, TransformInPlaceContext } from \"./CurveSearches\";\r\n/** Algorithmic class: Accumulate maximum gap between adjacent primitives of CurveChain.\r\n * @internal\r\n */\r\nexport class GapSearchContext extends RecursiveCurveProcessorWithStack {\r\n  public maxGap: number;\r\n  constructor() { super(); this.maxGap = 0.0; }\r\n  public static maxGap(target: CurveCollection): number {\r\n    const context = new GapSearchContext();\r\n    target.announceToCurveProcessor(context);\r\n    return context.maxGap;\r\n  }\r\n  public override announceCurvePrimitive(curve: CurvePrimitive, _indexInParent: number): void {\r\n    if (this._stack.length > 0) {\r\n      const parent = this._stack[this._stack.length - 1];\r\n      if (parent instanceof CurveChain) {\r\n        const chain = parent;\r\n        const nextCurve = chain.cyclicCurvePrimitive(_indexInParent + 1);\r\n        if (curve !== undefined && nextCurve !== undefined) {\r\n          this.maxGap = Math.max(this.maxGap, curve.endPoint().distance(nextCurve.startPoint()));\r\n        }\r\n      }\r\n    }\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"GapSearchContext.js","sourceRoot":"","sources":["../../../../src/curve/internalContexts/GapSearchContext.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F;;GAEG;AACH,wDAAiE;AAEjE,sDAAqE;AAErE,qJAAqJ;AACrJ;;;GAGG;AACH,MAAa,gBAAiB,SAAQ,iDAAgC;IAEpE;QACE,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC;IACpB,CAAC;IACM,MAAM,CAAC,MAAM,CAAC,MAAuB;QAC1C,MAAM,OAAO,GAAG,IAAI,gBAAgB,EAAE,CAAC;QACvC,MAAM,CAAC,wBAAwB,CAAC,OAAO,CAAC,CAAC;QACzC,OAAO,OAAO,CAAC,MAAM,CAAC;IACxB,CAAC;IACe,sBAAsB,CAAC,KAAqB,EAAE,cAAsB;QAClF,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE;YAC1B,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YACnD,IAAI,MAAM,YAAY,4BAAU,EAAE;gBAChC,MAAM,KAAK,GAAG,MAAM,CAAC;gBACrB,MAAM,SAAS,GAAG,KAAK,CAAC,oBAAoB,CAAC,cAAc,GAAG,CAAC,CAAC,CAAC;gBACjE,IAAI,KAAK,KAAK,SAAS,IAAI,SAAS,KAAK,SAAS,EAAE;oBAClD,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,SAAS,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;iBACxF;aACF;SACF;IACH,CAAC;CACF;AAvBD,4CAuBC","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\nimport { CurveChain, CurveCollection } from \"../CurveCollection\";\r\nimport { CurvePrimitive } from \"../CurvePrimitive\";\r\nimport { RecursiveCurveProcessorWithStack } from \"../CurveProcessor\";\r\n\r\n// import { SumLengthsContext, GapSearchContext, CountLinearPartsSearchContext, CloneCurvesContext, TransformInPlaceContext } from \"./CurveSearches\";\r\n/**\r\n * Algorithmic class: Accumulate maximum gap between adjacent primitives of CurveChain.\r\n * @internal\r\n */\r\nexport class GapSearchContext extends RecursiveCurveProcessorWithStack {\r\n  public maxGap: number;\r\n  constructor() {\r\n    super();\r\n    this.maxGap = 0.0;\r\n  }\r\n  public static maxGap(target: CurveCollection): number {\r\n    const context = new GapSearchContext();\r\n    target.announceToCurveProcessor(context);\r\n    return context.maxGap;\r\n  }\r\n  public override announceCurvePrimitive(curve: CurvePrimitive, _indexInParent: number): void {\r\n    if (this._stack.length > 0) {\r\n      const parent = this._stack[this._stack.length - 1];\r\n      if (parent instanceof CurveChain) {\r\n        const chain = parent;\r\n        const nextCurve = chain.cyclicCurvePrimitive(_indexInParent + 1);\r\n        if (curve !== undefined && nextCurve !== undefined) {\r\n          this.maxGap = Math.max(this.maxGap, curve.endPoint().distance(nextCurve.startPoint()));\r\n        }\r\n      }\r\n    }\r\n  }\r\n}\r\n"]}

package/lib/cjs/curve/internalContexts/MultiChainCollector.d.ts

@@ -82,6 +82,10 @@ export declare class MultiChainCollector {
     /** Return chains as individual calls to announceChain. */
     announceChainsAsLineString3d(announceChain: (ls: LineString3d) => void): void;
 }
+/**
+ * Static methods to assist offset sequences.
+ * @internal
+ */
 export declare class OffsetHelpers {
     static sumLengths(data: any): number;
     static extendRange(range: Range3d, data: any): Range3d;

package/lib/cjs/curve/internalContexts/MultiChainCollector.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"MultiChainCollector.d.ts","sourceRoot":"","sources":["../../../../src/curve/internalContexts/MultiChainCollector.ts"],"names":[],"mappings":"AASA,OAAO,EAAE,QAAQ,EAAE,MAAM,wBAAwB,CAAC;AAElD,OAAO,EAAE,cAAc,EAAE,MAAM,4BAA4B,CAAC;AAC5D,OAAO,EAAE,aAAa,EAAE,MAAM,2BAA2B,CAAC;AAE1D,OAAO,EAAE,YAAY,EAAE,MAAM,0BAA0B,CAAC;AAGxD,OAAO,EAAE,UAAU,EAAa,MAAM,uBAAuB,CAAC;AAK9D,OAAO,EAAE,OAAO,EAAE,MAAM,wBAAwB,CAAC;AACjD,OAAO,EAAE,MAAM,EAAE,MAAM,2BAA2B,CAAC;AAGnD;;;;;;;;;;;;;GAaG;AACH,qBAAa,mBAAmB;IAC9B,OAAO,CAAC,OAAO,CAAqB;IAEpC,OAAO,CAAC,MAAM,CAAC,aAAa,CAAU;IACtC,OAAO,CAAC,MAAM,CAAC,aAAa,CAAU;IAEtC,sCAAsC;IACtC,OAAO,CAAC,uBAAuB,CAAS;IACxC,sCAAsC;IACtC,OAAO,CAAC,qBAAqB,CAAS;IACtC,uEAAuE;IACvE,OAAO,CAAC,mBAAmB,CAAqB;IAChD;;;OAGG;gBACgB,sBAAsB,SAA+B,EAAE,cAAc,GAAE,MAAM,GAAG,SAAwC;IAO3I,OAAO,CAAC,SAAS,CAAC,CAAU;IAC5B;;;;;OAKG;IACH,OAAO,CAAC,qBAAqB;IAgB7B,OAAO,CAAC,SAAS,CAAC,CAAU;IAC5B;;;;;OAKG;IACI,qBAAqB,CAAC,SAAS,EAAE,cAAc;IAOtD;;;;;OAKG;IACI,YAAY,CAAC,SAAS,EAAE,aAAa;IAU5C;;;OAGG;IACH,OAAO,CAAC,yBAAyB;IA4CjC;;;;;OAKG;IACH,OAAO,CAAC,yBAAyB;IAgBjC,OAAO,CAAC,YAAY;IAOpB,OAAO,CAAC,wBAAwB;IAuBhC;;;OAGG;IACH,OAAO,CAAC,oBAAoB;IAiC5B,OAAO,CAAC,mBAAmB;IAW3B,8EAA8E;IACvE,UAAU,CAAC,gBAAgB,GAAE,OAAe,GAAG,UAAU;IAalE,0DAA0D;IACnD,4BAA4B,CAAC,aAAa,EAAE,CAAC,EAAE,EAAE,YAAY,KAAK,IAAI,GAAG,IAAI;CAcnF;AAED,qBAAa,aAAa;WAEV,UAAU,CAAC,IAAI,EAAE,GAAG,GAAG,MAAM;WAa7B,WAAW,CAAC,KAAK,EAAE,OAAO,EAAE,IAAI,EAAE,GAAG,GAAG,OAAO;WAa/C,aAAa,CAAC,IAAI,EAAE,QAAQ,GAAG,QAAQ,EAAE,GAAG,SAAS,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,GAAG,MAAM;IAwBhH;;;;;;OAMG;WACW,8BAA8B,CAAC,SAAS,EAAE,QAAQ,EAAE,EAAE,cAAc,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,GAAG;QAAE,aAAa,EAAE,QAAQ,EAAE,CAAC;QAAC,cAAc,EAAE,QAAQ,EAAE,CAAC;QAAC,MAAM,EAAE,UAAU,CAAA;KAAE;IAgBhM;;;;;OAKG;WACW,aAAa,CAAC,SAAS,EAAE,QAAQ,EAAE,EAAE,YAAY,EAAE,MAAM,EAAE,eAAe,GAAE,MAAqC,GAAG,UAAU;IAQ5I;;OAEG;WACW,kBAAkB,CAAC,CAAC,EAAE,cAAc,EAAE,KAAK,EAAE,OAAO,EAAE,EAAE,EAAE,MAAM,GAAG,OAAO;WAgB1E,cAAc,CAAC,EAAE,EAAE,cAAc,EAAE,EAAE,EAAE,cAAc,EAAE,QAAQ,EAAE,MAAM,GAAG,OAAO;CA8BhG"}
+{"version":3,"file":"MultiChainCollector.d.ts","sourceRoot":"","sources":["../../../../src/curve/internalContexts/MultiChainCollector.ts"],"names":[],"mappings":"AASA,OAAO,EAAE,QAAQ,EAAE,MAAM,wBAAwB,CAAC;AAElD,OAAO,EAAE,cAAc,EAAE,MAAM,4BAA4B,CAAC;AAC5D,OAAO,EAAE,aAAa,EAAE,MAAM,2BAA2B,CAAC;AAE1D,OAAO,EAAE,YAAY,EAAE,MAAM,0BAA0B,CAAC;AAGxD,OAAO,EAAE,UAAU,EAAa,MAAM,uBAAuB,CAAC;AAK9D,OAAO,EAAE,OAAO,EAAE,MAAM,wBAAwB,CAAC;AACjD,OAAO,EAAE,MAAM,EAAE,MAAM,2BAA2B,CAAC;AAGnD;;;;;;;;;;;;;GAaG;AACH,qBAAa,mBAAmB;IAC9B,OAAO,CAAC,OAAO,CAAqB;IAEpC,OAAO,CAAC,MAAM,CAAC,aAAa,CAAU;IACtC,OAAO,CAAC,MAAM,CAAC,aAAa,CAAU;IAEtC,sCAAsC;IACtC,OAAO,CAAC,uBAAuB,CAAS;IACxC,sCAAsC;IACtC,OAAO,CAAC,qBAAqB,CAAS;IACtC,uEAAuE;IACvE,OAAO,CAAC,mBAAmB,CAAqB;IAChD;;;OAGG;gBACgB,sBAAsB,SAA+B,EAAE,cAAc,GAAE,MAAM,GAAG,SAAwC;IAO3I,OAAO,CAAC,SAAS,CAAC,CAAU;IAC5B;;;;;OAKG;IACH,OAAO,CAAC,qBAAqB;IAgB7B,OAAO,CAAC,SAAS,CAAC,CAAU;IAC5B;;;;;OAKG;IACI,qBAAqB,CAAC,SAAS,EAAE,cAAc;IAOtD;;;;;OAKG;IACI,YAAY,CAAC,SAAS,EAAE,aAAa;IAU5C;;;OAGG;IACH,OAAO,CAAC,yBAAyB;IA4CjC;;;;;OAKG;IACH,OAAO,CAAC,yBAAyB;IAgBjC,OAAO,CAAC,YAAY;IAOpB,OAAO,CAAC,wBAAwB;IAuBhC;;;OAGG;IACH,OAAO,CAAC,oBAAoB;IAiC5B,OAAO,CAAC,mBAAmB;IAW3B,8EAA8E;IACvE,UAAU,CAAC,gBAAgB,GAAE,OAAe,GAAG,UAAU;IAalE,0DAA0D;IACnD,4BAA4B,CAAC,aAAa,EAAE,CAAC,EAAE,EAAE,YAAY,KAAK,IAAI,GAAG,IAAI;CAcnF;AAED;;;GAGG;AACH,qBAAa,aAAa;WAEV,UAAU,CAAC,IAAI,EAAE,GAAG,GAAG,MAAM;WAa7B,WAAW,CAAC,KAAK,EAAE,OAAO,EAAE,IAAI,EAAE,GAAG,GAAG,OAAO;WAa/C,aAAa,CAAC,IAAI,EAAE,QAAQ,GAAG,QAAQ,EAAE,GAAG,SAAS,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,GAAG,MAAM;IAwBhH;;;;;;OAMG;WACW,8BAA8B,CAAC,SAAS,EAAE,QAAQ,EAAE,EAAE,cAAc,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,GAAG;QAAE,aAAa,EAAE,QAAQ,EAAE,CAAC;QAAC,cAAc,EAAE,QAAQ,EAAE,CAAC;QAAC,MAAM,EAAE,UAAU,CAAA;KAAE;IAgBhM;;;;;OAKG;WACW,aAAa,CAAC,SAAS,EAAE,QAAQ,EAAE,EAAE,YAAY,EAAE,MAAM,EAAE,eAAe,GAAE,MAAqC,GAAG,UAAU;IAQ5I;;OAEG;WACW,kBAAkB,CAAC,CAAC,EAAE,cAAc,EAAE,KAAK,EAAE,OAAO,EAAE,EAAE,EAAE,MAAM,GAAG,OAAO;WAgB1E,cAAc,CAAC,EAAE,EAAE,cAAc,EAAE,EAAE,EAAE,cAAc,EAAE,QAAQ,EAAE,MAAM,GAAG,OAAO;CA8BhG"}

package/lib/cjs/curve/internalContexts/MultiChainCollector.js

@@ -278,7 +278,10 @@ class MultiChainCollector {
     }
 }
 exports.MultiChainCollector = MultiChainCollector;
-// static methods to assist offset sequences ....
+/**
+ * Static methods to assist offset sequences.
+ * @internal
+ */
 class OffsetHelpers {
     // recursively sum lengths, allowing CurvePrimitive, CurveCollection, or array of such at any level.
     static sumLengths(data) {
@@ -392,7 +395,7 @@ class OffsetHelpers {
         }
         return false;
     }
-    // Try to move move head (end) of g0 and tail (beginning) of g1 together.
+    // Try to move move tail (end) of g0 and/or head (beginning) of g1 to a common point.
     static moveHeadOrTail(g0, g1, maxShift) {
         const xyz0 = g0.endPoint();
         const xyz1 = g1.startPoint();