@itwin/core-geometry 5.2.0-dev.30 → 5.2.0-dev.32

package/lib/cjs/clipping/ClipUtils.js.map

@@ -1 +1 @@
-{"version":3,"file":"ClipUtils.js","sourceRoot":"","sources":["../../../src/clipping/ClipUtils.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH,sDAA6C;AAE7C,8DAAmE;AACnE,wDAAqD;AACrD,4DAAmH;AAGnH,0DAAuD;AACvD,wDAAqD;AACrD,wCAAqC;AACrC,wCAAqC;AACrC,kDAAmE;AAEnE,sDAAmD;AACnD,0CAAuC;AACvC,6DAA0D;AAE1D,qEAAkE;AAGlE,2EAAwE;AACxE,mEAAkE;AAClE,+CAAuD;AACvD,2EAA0E;AAC1E,uDAAoD;AAEpD,iEAA8D;AAC9D,iDAA8C;AAC9C,2CAAwC;AACxC,mDAAgD;AAChD,6CAA0C;AAC1C,6DAA0D;AAC1D,sGAAmG;AACnG,6EAA0E;AAE1E;;;GAGG;AACH,IAAY,oBAOX;AAPD,WAAY,oBAAoB;IAC9B,yBAAyB;IACzB,mFAAkB,CAAA;IAClB,oCAAoC;IACpC,yEAAa,CAAA;IACb,0BAA0B;IAC1B,qFAAmB,CAAA;AACrB,CAAC,EAPW,oBAAoB,oCAApB,oBAAoB,QAO/B;AACD;;;GAGG;AACH,IAAY,cAOX;AAPD,WAAY,cAAc;IACxB,4DAA4D;IAC5D,2DAAY,CAAA;IACZ,6DAA6D;IAC7D,8DAAc,CAAA;IACd,6CAA6C;IAC7C,uEAAkB,CAAA;AACpB,CAAC,EAPW,cAAc,8BAAd,cAAc,QAOzB;AAED;;;GAGG;AACH,IAAY,UAOX;AAPD,WAAY,UAAU;IACpB,kDAAkD;IAClD,2DAAY,CAAA;IACZ,kCAAkC;IAClC,6DAAa,CAAA;IACb,iCAAiC;IACjC,6DAAa,CAAA;AACf,CAAC,EAPW,UAAU,0BAAV,UAAU,QAOrB;AAmED;;;GAGG;AACH,MAAa,aAAa;IACxB,wHAAwH;IAChH,MAAM,CAAC,cAAc,CAAa;IAClC,MAAM,CAAC,UAAU,CAAW;IAC5B,MAAM,CAAC,YAAY,CAAsB;IAEzC,MAAM,CAAC,2BAA2B,GAAG,yBAAO,CAAC,MAAM,EAAE,CAAC;IAC9D;;;;;OAKG;IACI,MAAM,CAAC,iBAAiB,CAC7B,KAAqB,EACrB,iBAAuC,EACvC,OAAgB,EAChB,QAA6C;QAE7C,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1B,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1B,iBAAiB,CAAC,IAAI,EAAE,CAAC;QACzB,IAAI,EAAE,GAAG,iBAAiB,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC;QAC/C,IAAI,EAAE,CAAC;QACP,IAAI,IAAI,CAAC;QACT,MAAM,SAAS,GAAG,aAAa,CAAC,2BAA2B,CAAC;QAC5D,MAAM,CAAC,GAAG,iBAAiB,CAAC,MAAM,CAAC;QACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,EAAE,GAAG,iBAAiB,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC;YAC3C,IAAI,EAAE,GAAG,EAAE,GAAG,mBAAQ,CAAC,aAAa,EAAE,CAAC;gBACrC,IAAI,GAAG,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;gBACvB,IAAI,IAAI,IAAI,GAAG,IAAI,IAAI,IAAI,GAAG,EAAE,CAAC;oBAC/B,KAAK,CAAC,eAAe,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;oBACvC,IAAI,OAAO,CAAC,iBAAiB,CAAC,SAAS,CAAC,EAAE,CAAC;wBACzC,IAAI,QAAQ;4BACV,QAAQ,CAAC,EAAE,EAAE,EAAE,EAAE,KAAK,CAAC,CAAC;;4BAExB,OAAO,IAAI,CAAC;oBAChB,CAAC;gBACH,CAAC;gBACD,EAAE,GAAG,EAAE,CAAC;YACV,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,WAAW,CACvB,SAAoB,EAAE,EAAkB,EAAE,QAA6C;QAEvF,IAAI,QAAQ,EAAE,CAAC;YACb,KAAK,MAAM,EAAE,IAAI,SAAS,EAAE,CAAC;gBAC3B,QAAQ,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;YAChC,CAAC;QACH,CAAC;QACD,OAAO,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC;IAC9B,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,oBAAoB,CAAC,KAAqB,EAAE,OAAgB;QACxE,MAAM,MAAM,GAAqB,EAAE,CAAC;QACpC,KAAK,CAAC,qBAAqB,CACzB,OAAO,EACP,CAAC,SAAiB,EAAE,SAAiB,EAAE,MAAsB,EAAE,EAAE;YAC/D,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;gBAC5B,MAAM,YAAY,GAAG,MAAM,CAAC,iBAAiB,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;gBACpE,IAAI,YAAY;oBACd,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;YAC9B,CAAC;QACH,CAAC,CACF,CAAC;QACF,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,aAAa,CAAC,MAAiB,EAAE,OAAgB;QAC7D,IAAI,MAA+B,CAAC;QACpC,MAAM,YAAY,GAAG,aAAa,CAAC,cAAc,GAAG,2BAAY,CAAC,sBAAsB,CAAC,SAAS,EAAE,MAAM,EAAE,aAAa,CAAC,cAAc,CAAC,CAAC;QACzI,IAAI,CAAC,YAAY;YACf,OAAO,MAAM,CAAC;QAChB,MAAM,YAAY,GAAG,YAAY,EAAE,OAAO,EAAE,CAAC;QAC7C,IAAI,CAAC,YAAY;YACf,OAAO,MAAM,CAAC;QAChB,MAAM,WAAW,GAAG,MAAM,CAAC,gBAAgB,CAAC,YAAY,CAAc,CAAC,CAAC,0CAA0C;QAClH,IAAI,CAAC,WAAW;YACd,OAAO,MAAM,CAAC;QAChB,uGAAuG;QACvG,qGAAqG;QACrG,6GAA6G;QAC7G,gHAAgH;QAChH,iFAAiF;QACjF,MAAM,gBAAgB,GAAG,aAAa,CAAC,UAAU,GAAG,WAAW,CAAC,KAAK,EAAE,CAAC;QACxE,MAAM,OAAO,GAAG,gBAAgB,CAAC,OAAO,EAAE,CAAC;QAC3C,MAAM,OAAO,GAAG,gBAAgB,CAAC,OAAO,EAAE,CAAC;QAC3C,MAAM,SAAS,GAAG,2BAAY,CAAC,iBAAiB,CAAC,gBAAgB,CAAC,GAAG,EAAE,OAAO,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC;QAC/F,SAAS,CAAC,mBAAmB,CAAC,YAAY,CAAC,CAAC;QAC5C,kGAAkG;QAClG,MAAM,eAAe,GAAuB,EAAE,CAAC;QAC/C,MAAM,gBAAgB,GAAuB,EAAE,CAAC;QAChD,MAAM,KAAK,GAAG,IAAI,2CAAqB,EAAE,CAAC;QAC1C,OAAO,CAAC,iBAAiB,EAAE,CAAC,SAAS,CAAC,YAAY,EAAE,eAAe,EAAE,gBAAgB,EAAE,KAAK,CAAC,CAAC;QAC9F,IAAI,eAAe,CAAC,MAAM,KAAK,CAAC;YAC9B,OAAO,MAAM,CAAC;QAChB,+BAA+B;QAC/B,KAAK,MAAM,QAAQ,IAAI,eAAe,EAAE,CAAC;YACvC,MAAM,IAAI,GAAG,WAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC;YAC1C,IAAI,CAAC,mBAAmB,CAAC,YAAY,CAAC,CAAC;YACvC,MAAM,kBAAkB,GAAG,qBAAS,CAAC,eAAe,CAAC,WAAW,EAAE,IAAI,EAAE,8BAAkB,CAAC,YAAY,CAAC,CAAC;YACzG,IAAI,kBAAkB,EAAE,CAAC;gBACvB,kBAAkB,CAAC,mBAAmB,CAAC,YAAY,CAAC,CAAC;gBACrD,IAAI,CAAC,MAAM;oBACT,MAAM,GAAG,CAAC,kBAAkB,YAAY,yBAAW,CAAC,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC,CAAC,yBAAW,CAAC,MAAM,CAAC,kBAAkB,CAAC,CAAC;gBACrH,IAAI,kBAAkB,YAAY,yBAAW;oBAC3C,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,kBAAkB,CAAC,QAAQ,CAAC,CAAC,CAAC,4BAA4B;;oBAElF,MAAM,CAAC,WAAW,CAAC,kBAAkB,CAAC,CAAC;YAC3C,CAAC;QACH,CAAC;QACD,OAAO,MAAM,CAAC,CAAC,CAAC,qBAAS,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAC/D,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,YAAY,CAAC,KAAe,EAAE,OAAgB;QAC1D,IAAI,KAAK,YAAY,+BAAc;YACjC,OAAO,aAAa,CAAC,oBAAoB,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;QAC5D,IAAI,KAAK,CAAC,WAAW,EAAE,EAAE,CAAC;YACxB,MAAM,GAAG,GAAG,aAAa,CAAC,aAAa,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;YACxD,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QAC1B,CAAC;QACD,MAAM,MAAM,GAAe,EAAE,CAAC;QAC9B,IAAI,KAAK,YAAY,WAAI,IAAI,KAAK,YAAY,6BAAW,EAAE,CAAC;YAC1D,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;gBACnC,MAAM,WAAW,GAAG,aAAa,CAAC,YAAY,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;gBAC/D,MAAM,CAAC,IAAI,CAAC,GAAG,WAAW,CAAC,CAAC;YAC9B,CAAC;QACH,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,sBAAsB,CAAC,OAAkB,EAAE,SAAwB;QAC/E,MAAM,OAAO,GAAG,IAAI,CAAC,6CAA6C,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;QACvF,MAAM,MAAM,GAAG,EAAE,CAAC;QAClB,KAAK,MAAM,CAAC,IAAI,OAAO;YACrB,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,eAAe,EAAE,CAAC,CAAC;QACnC,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,6CAA6C,CACzD,OAAkB,EAAE,SAAwB;QAE5C,MAAM,MAAM,GAAuB,EAAE,CAAC;QACtC,MAAM,OAAO,GAAG,SAAS,CAAC,kBAAkB,EAAE,CAAC;QAC/C,0CAA0C;QAC1C,IAAI,OAAO,EAAE,CAAC;YACZ,OAAO,CAAC,WAAW,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;QACvC,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,wBAAwB,CACpC,MAAwB,EAAE,QAAoC,EAAE,SAAiB;QAEjF,IAAI,QAAQ,CAAC,UAAU,CAAC,MAAM,KAAK,CAAC;YAClC,OAAO,UAAU,CAAC,aAAa,CAAC;QAElC,KAAK,MAAM,SAAS,IAAI,QAAQ,CAAC,UAAU,EAAE,CAAC;YAC5C,IAAI,qBAAqB,GAAG,KAAK,EAAE,UAAU,GAAG,KAAK,CAAC;YAEtD,KAAK,MAAM,KAAK,IAAI,SAAS,CAAC,MAAM,EAAE,CAAC;gBACrC,IAAI,SAAS,GAAG,CAAC,EAAE,UAAU,GAAG,CAAC,CAAC;gBAClC,MAAM,aAAa,GAAG,KAAK,CAAC,QAAQ,GAAG,SAAS,CAAC;gBAEjD,MAAM,MAAM,GAAG,yBAAO,CAAC,MAAM,EAAE,CAAC;gBAChC,MAAM,OAAO,GAAG,0BAAQ,CAAC,MAAM,EAAE,CAAC;gBAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBACvC,MAAM,CAAC,+BAA+B,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;oBAClD,OAAO,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;oBACxB,OAAO,CAAC,UAAU,CAAC,KAAK,CAAC,eAAe,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC;gBACzF,CAAC;gBAED,UAAU,GAAG,CAAC,UAAU,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC;gBACpD,IAAI,SAAS,KAAK,CAAC,EAAE,CAAC;oBACpB,qBAAqB,GAAG,IAAI,CAAC;oBAC7B,MAAM;gBACR,CAAC;YACH,CAAC;YAED,IAAI,CAAC,UAAU,EAAG,6CAA6C;gBAC7D,OAAO,UAAU,CAAC,aAAa,CAAC;YAClC,IAAI,CAAC,qBAAqB;gBACxB,OAAO,UAAU,CAAC,YAAY,CAAC;QACnC,CAAC;QACD,OAAO,UAAU,CAAC,aAAa,CAAC;IAClC,CAAC;IACD;;;;;;;OAOG;IACI,MAAM,CAAC,+CAA+C,CAC3D,SAAyC,EACzC,KAAc,EACd,YAAoD,EACpD,wBAAiC,IAAI,EACrC,oBAA6B,IAAI,EACjC,qBAAqB,GAAG,KAAK;QAE7B,MAAM,IAAI,GAAG,IAAI,mCAAgB,EAAE,CAAC;QACpC,IAAI,qBAAqB,EAAE,CAAC;YAC1B,0EAA0E;YAC1E,IAAI,SAAS,YAAY,uCAAkB,EAAE,CAAC;gBAC5C,KAAK,MAAM,KAAK,IAAI,SAAS,CAAC,MAAM,EAAE,CAAC;oBACrC,IAAI,qBAAqB,IAAI,KAAK,CAAC,SAAS;wBAC1C,SAAS;oBACX,MAAM,oBAAoB,GAAG,KAAK,CAAC,cAAc,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;oBAC/D,MAAM,WAAW,GAAG,IAAI,mCAAgB,EAAE,CAAC;oBAC3C,IAAI,oBAAoB,EAAE,CAAC;wBACzB,SAAS,CAAC,WAAW,CAAC,oBAAoB,EAAE,WAAW,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;wBACtE,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC;4BACxB,YAAY,CAAC,WAAW,CAAC,CAAC;oBAC9B,CAAC;gBACH,CAAC;YACH,CAAC;iBAAM,CAAC,CAAE,oCAAoC;gBAC5C,IAAI,qBAAqB,IAAI,SAAS,CAAC,SAAS,EAAE,CAAC;oBACjD,YAAY;gBACd,CAAC;qBAAM,CAAC;oBACN,MAAM,oBAAoB,GAAG,SAAS,CAAC,cAAc,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;oBACnE,IAAI,oBAAoB;wBACtB,YAAY,CAAC,oBAAoB,CAAC,CAAC;gBACvC,CAAC;YACH,CAAC;QACH,CAAC;QAED,IAAI,iBAAiB,EAAE,CAAC;YACtB,2CAA2C;YAC3C,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,EAAE,CAAC;YAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,MAAM,OAAO,GAAG,eAAO,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC;gBAC7C,MAAM,WAAW,GAAG,IAAI,mCAAgB,EAAE,CAAC;gBAC3C,MAAM,UAAU,GAAG,2BAAY,CAAC,mBAAmB,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;gBACtE,IAAI,SAAS,YAAY,uCAAkB,EAAE,CAAC;oBAC5C,SAAS,CAAC,WAAW,CAAC,UAAU,CAAC,YAAY,EAAE,WAAW,EAAE,IAAI,CAAC,CAAC;oBAClE,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC;wBACxB,YAAY,CAAC,WAAW,CAAC,CAAC;gBAC9B,CAAC;qBAAM,CAAC;oBACN,SAAS,CAAC,wBAAwB,CAAC,UAAU,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;oBAClE,IAAI,UAAU,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC;wBACpC,YAAY,CAAC,UAAU,CAAC,YAAY,CAAC,CAAC;gBAC1C,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IACD;;;;;;;;;OASG;IACI,MAAM,CAAC,2CAA2C,CACvD,WAAwE,EACxE,KAAc,EACd,wBAAiC,IAAI,EACrC,oBAA6B,IAAI,EACjC,qBAAqB,GAAG,KAAK;QAE7B,MAAM,MAAM,GAAoB,EAAE,CAAC;QACnC,IAAI,WAAW,YAAY,uDAA0B,EAAE,CAAC;YACtD,KAAK,MAAM,OAAO,IAAI,WAAW,CAAC,UAAU,EAAE,CAAC;gBAC7C,IAAI,CAAC,+CAA+C,CAAC,OAAO,EAAE,KAAK,EACjE,CAAC,MAAwB,EAAE,EAAE;oBAC3B,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC;wBAAE,MAAM,CAAC,IAAI,CAAC,WAAI,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC;gBACjE,CAAC,EACD,qBAAqB,EAAE,iBAAiB,EAAE,qBAAqB,CAAC,CAAC;YACrE,CAAC;QACH,CAAC;aAAM,IAAI,WAAW,YAAY,uCAAkB,IAAI,WAAW,YAAY,qBAAS,EAAE,CAAC;YACzF,IAAI,CAAC,+CAA+C,CAAC,WAAW,EAAE,KAAK,EACrE,CAAC,MAAwB,EAAE,EAAE;gBAC3B,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC;oBAAE,MAAM,CAAC,IAAI,CAAC,WAAI,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC;YACjE,CAAC,EACD,qBAAqB,EAAE,iBAAiB,EAAE,qBAAqB,CAAC,CAAC;QACrE,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,8CAA8C,CAAC,SAA6B,EAAE,KAAc;QACxG,MAAM,MAAM,GAAG,eAAO,CAAC,UAAU,EAAE,CAAC;QACpC,IAAI,CAAC,+CAA+C,CAAC,SAAS,EAAE,KAAK,EACnE,CAAC,MAAwB,EAAE,EAAE;YAC3B,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC;gBAAE,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;QACpD,CAAC,EACD,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;QACrB,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;;;;;;;;OAYG;IACI,MAAM,CAAC,mCAAmC,CAC/C,OAAiG,EACjG,KAAc,EACd,uBAAgC,IAAI;QAEpC,IAAI,OAAO,KAAK,SAAS;YACvB,OAAO,KAAK,CAAC,KAAK,EAAE,CAAC;QACvB,IAAI,OAAO,YAAY,uCAAkB;YACvC,OAAO,IAAI,CAAC,8CAA8C,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;QAC7E,IAAI,OAAO,YAAY,uDAA0B,EAAE,CAAC;YAClD,MAAM,UAAU,GAAG,eAAO,CAAC,UAAU,EAAE,CAAC;YACxC,KAAK,MAAM,CAAC,IAAI,OAAO,CAAC,UAAU,EAAE,CAAC;gBACnC,MAAM,MAAM,GAAG,IAAI,CAAC,8CAA8C,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;gBAC7E,UAAU,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;YACjC,CAAC;YACD,OAAO,UAAU,CAAC;QACpB,CAAC;QACD,IAAI,OAAO,YAAY,6BAAa,EAAE,CAAC;YACrC,IAAI,oBAAoB,IAAI,OAAO,CAAC,SAAS;gBAC3C,OAAO,KAAK,CAAC,KAAK,EAAE,CAAC;YACvB,OAAO,IAAI,CAAC,mCAAmC,CAAC,OAAO,CAAC,kBAAkB,EAAE,EAAE,KAAK,CAAC,CAAC;QACvF,CAAC;QACD,IAAI,OAAO,YAAY,uBAAU,EAAE,CAAC;YAClC,MAAM,iBAAiB,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;YACxC,KAAK,MAAM,CAAC,IAAI,OAAO,CAAC,KAAK,EAAE,CAAC;gBAC9B,IAAI,oBAAoB,IAAI,CAAC,CAAC,SAAS,EAAE,CAAC;oBACxC,sFAAsF;gBACxF,CAAC;qBAAM,CAAC;oBACN,MAAM,MAAM,GAAG,IAAI,CAAC,mCAAmC,CAAC,CAAC,EAAE,KAAK,EAAE,oBAAoB,CAAC,CAAC;oBACxF,iBAAiB,CAAC,SAAS,CAAC,MAAM,EAAE,iBAAiB,CAAC,CAAC;gBACzD,CAAC;YACH,CAAC;YACD,OAAO,iBAAiB,CAAC;QAE3B,CAAC;QACD,OAAO,KAAK,CAAC,KAAK,EAAE,CAAC;IACvB,CAAC;IACD;;;;;;;;;;;;;OAaG;IACI,MAAM,CAAC,yBAAyB,CACrC,OAAiG,EACjG,KAAc,EACd,uBAAgC,IAAI;QAEpC,IAAI,OAAO,KAAK,SAAS;YACvB,OAAO,IAAI,CAAC;QAEd,IAAI,OAAO,YAAY,uCAAkB;YACvC,OAAO,IAAI,CAAC,oCAAoC,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;QAEnE,IAAI,OAAO,YAAY,uDAA0B,EAAE,CAAC;YAClD,KAAK,MAAM,CAAC,IAAI,OAAO,CAAC,UAAU,EAAE,CAAC;gBACnC,IAAI,IAAI,CAAC,oCAAoC,CAAC,CAAC,EAAE,KAAK,CAAC;oBACrD,OAAO,IAAI,CAAC;YAChB,CAAC;YACD,OAAO,KAAK,CAAC;QACf,CAAC;QAED,IAAI,OAAO,YAAY,6BAAa,EAAE,CAAC;YACrC,IAAI,oBAAoB,IAAI,OAAO,CAAC,SAAS,EAAK,6DAA6D;gBAC7G,OAAO,IAAI,CAAC;YACd,OAAO,IAAI,CAAC,yBAAyB,CAAC,OAAO,CAAC,kBAAkB,EAAE,EAAE,KAAK,CAAC,CAAC;QAC7E,CAAC;QAED,IAAI,OAAO,YAAY,uBAAU,EAAE,CAAC;YAClC,MAAM,iBAAiB,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;YACxC,KAAK,MAAM,CAAC,IAAI,OAAO,CAAC,KAAK,EAAE,CAAC;gBAC9B,IAAI,oBAAoB,IAAI,CAAC,CAAC,SAAS,EAAE,CAAC;oBACxC,sFAAsF;gBACxF,CAAC;qBAAM,CAAC;oBACN,MAAM,MAAM,GAAG,IAAI,CAAC,mCAAmC,CAAC,CAAC,EAAE,KAAK,EAAE,oBAAoB,CAAC,CAAC;oBACxF,iBAAiB,CAAC,SAAS,CAAC,MAAM,EAAE,iBAAiB,CAAC,CAAC;gBACzD,CAAC;YACH,CAAC;YACD,OAAO,CAAC,iBAAiB,CAAC,MAAM,CAAC;QACnC,CAAC;QACD,6FAA6F;QAC7F,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;;;OAOG;IACI,MAAM,CAAC,oCAAoC,CAChD,SAA6B,EAC7B,KAAc,EACd,wBAAiC,IAAI,EACrC,oBAA6B,IAAI,EACjC,qBAAqB,GAAG,KAAK;QAE7B,MAAM,IAAI,GAAG,IAAI,mCAAgB,EAAE,CAAC;QACpC,IAAI,qBAAqB,EAAE,CAAC;YAC1B,0EAA0E;YAC1E,KAAK,MAAM,KAAK,IAAI,SAAS,CAAC,MAAM,EAAE,CAAC;gBACrC,IAAI,qBAAqB,IAAI,KAAK,CAAC,SAAS;oBAC1C,SAAS;gBACX,MAAM,oBAAoB,GAAG,KAAK,CAAC,cAAc,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;gBAC/D,IAAI,oBAAoB,EAAE,CAAC;oBACzB,MAAM,WAAW,GAAG,IAAI,mCAAgB,EAAE,CAAC;oBAC3C,SAAS,CAAC,WAAW,CAAC,oBAAoB,EAAE,WAAW,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;oBACtE,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC;wBACxB,OAAO,IAAI,CAAC;gBAChB,CAAC;YACH,CAAC;QACH,CAAC;QAED,IAAI,iBAAiB,EAAE,CAAC;YACtB,2CAA2C;YAC3C,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,EAAE,CAAC;YAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,MAAM,OAAO,GAAG,eAAO,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC;gBAC7C,MAAM,WAAW,GAAG,IAAI,mCAAgB,EAAE,CAAC;gBAC3C,MAAM,UAAU,GAAG,2BAAY,CAAC,mBAAmB,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;gBACtE,SAAS,CAAC,WAAW,CAAC,UAAU,CAAC,YAAY,EAAE,WAAW,EAAE,IAAI,CAAC,CAAC;gBAClE,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC;oBACxB,OAAO,IAAI,CAAC;YAChB,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;;MAME;IACM,MAAM,CAAC,mCAAmC,CAAC,KAAc,EAAE,SAAoB,EAAE,gBAA4B;QACnH,IAAI,CAAC,SAAS;YACZ,SAAS,GAAG,qBAAS,CAAC,cAAc,EAAE,CAAC;QACzC,MAAM,OAAO,GAAG,iCAAe,CAAC,MAAM,EAAE,CAAC;QACzC,OAAO,CAAC,uBAAuB,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;QAClD,MAAM,IAAI,GAAG,OAAO,CAAC,aAAa,EAAE,CAAC;QACrC,MAAM,OAAO,GAAG,IAAI,CAAC,YAAY,GAAG,uCAAkB,CAAC,oBAAoB,CAAC,IAAI,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC,OAAO,CAAC;QAC7G,IAAI,OAAO,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC;YAC3B,OAAO,OAAO,CAAC;QACjB,wCAAwC;QACxC,IAAI,gBAAgB,EAAE,CAAC;YACrB,IAAA,qBAAM,EAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC;YACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC;gBAC3B,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,6BAA6B,CAAC,CAAC,CAAC,CAAC;gBAC/D,IAAI,KAAK;oBACP,gBAAgB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACjC,CAAC;QACH,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;;OAOG;IACK,MAAM,CAAC,4BAA4B,CAAC,KAAc,EAAE,MAAiB,EAAE,YAAwB,EAAE,YAAsB;QAC7H,MAAM,gBAAgB,GAAmD,YAAY,CAAC,CAAC;YACrF,CAAC,EAAU,EAAE,EAAU,EAAE,EAAkB,EAAE,EAAE;gBAC7C,YAAY,CAAC,WAAW,CAAC,EAAE,CAAC,eAAe,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC;gBAC/D,YAAY,CAAC,WAAW,CAAC,EAAE,CAAC,eAAe,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC;YACjE,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QAChB,IAAI,eAAe,GAAG,KAAK,CAAC;QAC5B,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACtB,MAAM,OAAO,GAAG,6BAAa,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YAClE,MAAM,OAAO,GAAG,uCAAkB,CAAC,mBAAmB,CAAC,KAAK,CAAC,CAAC;YAC9D,eAAe,GAAG,OAAO,CAAC,qBAAqB,CAAC,OAAO,EAAE,gBAAgB,CAAC,CAAC;QAC7E,CAAC;aAAM,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC7B,eAAe,GAAG,KAAK,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YACjD,IAAI,eAAe,IAAI,YAAY;gBACjC,YAAY,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC;QACtD,CAAC;QACD,OAAO,eAAe,CAAC;IACzB,CAAC;IACD;;;;;;;;;OASG;IACI,MAAM,CAAC,sBAAsB,CAClC,MAAe,EAAE,aAAwB,EAAE,MAAe,EAAE,aAAwB,EAAE,YAAqB;QAE3G,MAAM,aAAa,GAAG,IAAI,CAAC,cAAc,GAAG,aAAa,CAAC,OAAO,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;QACvF,IAAI,CAAC,aAAa;YAChB,OAAO,KAAK,CAAC;QACf,IAAI,QAAQ,GAAG,MAAM,CAAC;QACtB,IAAI,YAAY,EAAE,CAAC;YACjB,QAAQ,GAAG,IAAI,CAAC,UAAU,GAAG,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YAC3D,QAAQ,CAAC,aAAa,CAAC,YAAY,CAAC,CAAC;QACvC,CAAC;QACD,MAAM,gBAAgB,GAAc,EAAE,CAAC;QACvC,MAAM,cAAc,GAAG,aAAa,CAAC,0BAA0B,CAAC,aAAa,EAAE,aAAa,CAAC,CAAC;QAC9F,kFAAkF;QAClF,MAAM,OAAO,GAAG,IAAI,CAAC,mCAAmC,CAAC,MAAM,EAAE,cAAc,EAAE,gBAAgB,CAAC,CAAC;QACnG,IAAI,OAAO;YACT,OAAO,IAAI,CAAC,yBAAyB,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;QAC3D,OAAO,IAAI,CAAC,4BAA4B,CAAC,QAAQ,EAAE,gBAAgB,EAAE,aAAa,CAAC,CAAC;IACtF,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,gCAAgC,CAAC,MAAe,EAAE,aAAwB,EAAE,MAAe,EAAE,aAAwB,EAAE,MAAgB;QACnJ,MAAM,QAAQ,GAAG,eAAO,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;QAC5C,MAAM,aAAa,GAAG,IAAI,CAAC,cAAc,GAAG,aAAa,CAAC,OAAO,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;QACvF,IAAI,CAAC,aAAa;YAChB,OAAO,QAAQ,CAAC;QAClB,MAAM,gBAAgB,GAAc,EAAE,CAAC;QACvC,MAAM,cAAc,GAAG,aAAa,CAAC,0BAA0B,CAAC,aAAa,EAAE,aAAa,CAAC,CAAC;QAC9F,kFAAkF;QAClF,MAAM,OAAO,GAAG,IAAI,CAAC,mCAAmC,CAAC,MAAM,EAAE,cAAc,EAAE,gBAAgB,CAAC,CAAC;QACnG,IAAI,OAAO;YACT,IAAI,CAAC,+CAA+C,CAAC,OAAO,EAAE,MAAM,EAAE,CAAC,UAA4B,EAAE,EAAE,GAAG,UAAU,CAAC,WAAW,CAAC,QAAQ,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;;YAE9J,IAAI,CAAC,4BAA4B,CAAC,MAAM,EAAE,gBAAgB,EAAE,aAAa,EAAE,QAAQ,CAAC,CAAC;QACvF,OAAO,QAAQ,CAAC;IAClB,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,SAAS,CAAC,GAAQ;QAC9B,IAAI,GAAG,EAAE,CAAC;YACR,IAAI,GAAG,CAAC,iBAAiB;mBACpB,GAAG,CAAC,+BAA+B;mBACnC,GAAG,CAAC,2BAA2B;gBAClC,OAAO,IAAI,CAAC;QAChB,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;;;;;;;;;;;OAeG;IACI,MAAM,CAAC,uCAAuC,CACnD,SAAyC,EAAE,SAAiB,EAAE,SAA+B,EAAE,UAAiC;QAEhI,IAAI,SAAS,IAAI,SAAS,CAAC,MAAM,GAAG,SAAS,GAAG,CAAC,EAAE,CAAC;YAClD,OAAO,SAAS,CAAC,MAAM,GAAG,SAAS,EAAE,CAAC;gBACpC,MAAM,CAAC,GAAG,SAAS,CAAC,GAAG,EAAE,CAAC;gBAC1B,UAAU,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;YAC5B,CAAC;YACD,SAAS,CAAC,IAAI,CAAC,UAAU,CAAC,WAAW,CAAC,SAAS,CAAC,CAAC,CAAC;QACpD,CAAC;IACH,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,gCAAgC,CAC5C,MAAwC,EAAE,UAAkB,EAAE,WAAmB,EAAE,EAAU,EAAE,EAAU;QAEzG,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;YAC1B,OAAO,+DAA8B,CAAC,wBAAwB,CAC5D,IAAI,yCAAmB,CAAC,MAAM,CAAC,EAAE,UAAU,EAAE,WAAW,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QACtE,CAAC;QACD,OAAO,+DAA8B,CAAC,wBAAwB,CAAC,MAAM,EAAE,UAAU,EAAE,WAAW,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;IAC1G,CAAC;IACD,2GAA2G;IACpG,MAAM,CAAC,aAAa,CACzB,IAAsB,EAAE,SAAiB,EAAE,WAA+B,EAAE,KAA4B;QAExG,IAAI,IAAI,CAAC,MAAM,IAAI,SAAS;YAC1B,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;;YAEvB,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;IAC5B,CAAC;IACD;;;;;;;;;;;;;OAaG;IACI,MAAM,CAAC,0BAA0B,CACtC,UAAiB,EAAE,UAAiB,EAAE,aAAoB,EAAE,aAAoB,EAAE,QAAiB,EAAE,oBAA4B,OAAO;QAExI,MAAM,EAAE,GAAG,UAAU,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC;QACvC,MAAM,EAAE,GAAG,UAAU,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC;QACvC,qCAAqC;QACrC,MAAM,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,aAAa,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,aAAa,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5F,MAAM,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,aAAa,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,aAAa,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5F,IAAI,EAAE,GAAG,iBAAiB,IAAI,EAAE,GAAG,iBAAiB,EAAE,CAAC;YACrD,iCAAiC;YACjC,OAAO;QACT,CAAC;QACD,IAAI,EAAE,GAAG,EAAE,GAAG,GAAG,EAAE,CAAC;YAClB,IAAI,EAAE,GAAG,GAAG;gBACV,QAAQ,CAAC,OAAO,EAAE,CAAC;QACvB,CAAC;aAAM,IAAI,EAAE,GAAG,EAAE,GAAG,GAAG,EAAE,CAAC;YACzB,2CAA2C;YAC3C,MAAM,QAAQ,GAAG,CAAC,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;YACjC,IAAI,EAAE,GAAG,GAAG,EAAE,CAAC;gBACb,OAAO,QAAQ,CAAC,uBAAuB,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;YACzD,CAAC;iBAAM,CAAC;gBACN,OAAO,QAAQ,CAAC,uBAAuB,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;YACzD,CAAC;QACH,CAAC;aAAM,CAAC;YACN,2HAA2H;YAC3H,qFAAqF;YACrF,IAAI,EAAE,GAAG,GAAG,EAAE,CAAC;gBACb,QAAQ,CAAC,uBAAuB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAC7C,CAAC;iBAAM,IAAI,EAAE,GAAG,GAAG,EAAE,CAAC;gBACpB,QAAQ,CAAC,uBAAuB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAC7C,CAAC;QACH,CAAC;IACH,CAAC;IACD;;;;;;;;;;OAUG;IACI,MAAM,CAAC,0BAA0B,CACtC,MAAa,EAAE,MAAa,EAAE,MAAa,EAAE,QAAe,EAAE,QAAe,EAAE,QAAiB,EAAE,oBAA4B,OAAO;QAErI,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC;YACrB,IAAI,CAAC,0BAA0B,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,iBAAiB,CAAC,CAAC;YACjG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC;gBACrB,IAAI,CAAC,0BAA0B,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,iBAAiB,CAAC,CAAC;gBACjG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC;oBACrB,IAAI,CAAC,0BAA0B,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,iBAAiB,CAAC,CAAC;gBACnG,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IACD;;;;;;;;;;;;;OAaG;IACI,MAAM,CAAC,uBAAuB,CACnC,KAAmC,EAAE,aAAoB,EAAE,aAAoB,EAAE,QAAiB,EAAE,oBAA4B,OAAO;QAEvI,qCAAqC;QACrC,MAAM,EAAE,GAAG,KAAK,CAAC,UAAU,CAAC,aAAa,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC;QAC9D,MAAM,EAAE,GAAG,KAAK,CAAC,UAAU,CAAC,aAAa,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC;QAC9D,IAAI,EAAE,GAAG,iBAAiB,IAAI,EAAE,GAAG,iBAAiB,EAAE,CAAC;YACrD,6DAA6D;YAC7D,OAAO;QACT,CAAC;QACD,IAAI,EAAE,GAAG,EAAE,GAAG,GAAG,EAAE,CAAC;YAClB,IAAI,EAAE,GAAG,GAAG;gBACV,QAAQ,CAAC,OAAO,EAAE,CAAC;QACvB,CAAC;aAAM,IAAI,EAAE,GAAG,EAAE,GAAG,GAAG,EAAE,CAAC;YACzB,2CAA2C;YAC3C,MAAM,QAAQ,GAAG,CAAC,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;YACjC,IAAI,EAAE,GAAG,GAAG,EAAE,CAAC;gBACb,OAAO,QAAQ,CAAC,uBAAuB,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;YACzD,CAAC;iBAAM,CAAC;gBACN,OAAO,QAAQ,CAAC,uBAAuB,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;YACzD,CAAC;QACH,CAAC;aAAM,CAAC;YACN,2HAA2H;YAC3H,qFAAqF;YACrF,IAAI,EAAE,GAAG,GAAG,EAAE,CAAC;gBACb,QAAQ,CAAC,uBAAuB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAC7C,CAAC;iBAAM,IAAI,EAAE,GAAG,GAAG,EAAE,CAAC;gBACpB,QAAQ,CAAC,uBAAuB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAC7C,CAAC;QACH,CAAC;IACH,CAAC;IACD;;;;;;;;;;OAUG;IACI,MAAM,CAAC,wBAAwB,CACpC,MAAsC,EAAE,QAAe,EAAE,QAAe,EAAE,QAAiB,EAAE,iBAAyB,OAAO;QAE7H,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC;QAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;YACzD,IAAI,CAAC,uBAAuB,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,cAAc,CAAC,CAAC;QACxF,CAAC;IACH,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,oBAAoB,CAChC,OAAgB,EAAE,MAAiB,EAAE,QAAoD;QAEzF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,OAAO,CAAC,+BAA+B,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EACpE,CAAC,EAAU,EAAE,EAAU,EAAE,EAAE;gBACzB,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAC/F,CAAC,CAAC,CAAC;QACP,CAAC;IACH,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,qBAAqB,CAAC,OAAgB,EAAE,MAAiB;QACrE,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC5C,OAAO,CAAC,+BAA+B,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EACpE,CAAC,EAAU,EAAE,EAAU,EAAE,EAAE,GAAG,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACjE,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC;IACD;;;;;;;;;;;;;;;;;OAiBG;IACI,MAAM,CAAC,qBAAqB,CACjC,GAAyB,EACzB,QAAmB,EACnB,UAA0C,EAC1C,WAA2C,EAC3C,eAA+C,EAC/C,QAAwB,EACxB,SAAyB,EACzB,mBAAmC,EACnC,UAA6C;QAE7C,IAAI,UAAU,KAAK,SAAS;YAC1B,UAAU,GAAG,IAAI,2CAAqB,EAAE,CAAC;QAC3C,IAAI,UAAU,GAAG,CAAC,UAAU,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC;QAC/C,IAAI,cAAc,GAAuB,EAAE,CAAC;QAC5C,MAAM,cAAc,GAAuB,EAAE,CAAC;QAC9C,MAAM,eAAe,GAAuB,EAAE,CAAC;QAC/C,MAAM,cAAc,GAAG,UAAU,CAAC,CAAC,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1D,MAAM,eAAe,GAAG,WAAW,CAAC,CAAC,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7D,IAAI,KAAK,CAAC;QACV,0GAA0G;QAC1G,4GAA4G;QAC5G,oEAAoE;QACpE,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;YACzB,IAAI,CAAC,CAAC,iBAAiB,EAAE,CAAC;gBACxB,OAAO,SAAS,KAAK,CAAC,KAAK,GAAG,UAAU,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC;oBAChD,CAAC,CAAC,iBAAiB,CAAC,KAAK,EAAE,cAAc,EAAE,eAAe,EAAE,UAAU,CAAC,CAAC;oBACxE,mBAAmB,CAAC,QAAQ,EAAE,cAAc,EAAE,UAAU,EAAE,WAAW,EAAE,cAAc,EAAE,UAAU,CAAC,CAAC;oBACnG,mBAAmB,CAAC,SAAS,EAAE,eAAe,EAAE,UAAU,EAAE,WAAW,EAAE,cAAc,EAAE,UAAU,CAAC,CAAC;oBACrG,UAAU,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;gBAChC,CAAC;gBACD,yBAAyB;gBACzB,MAAM,IAAI,GAAG,UAAU,CAAC;gBAAC,UAAU,GAAG,cAAc,CAAC;gBAAC,cAAc,GAAG,IAAI,CAAC;YAC9E,CAAC;QACH,CAAC;QACD,mBAAmB,CAAC,mBAAmB,EAAE,UAAU,EAAE,UAAU,EAAE,WAAW,EAAE,eAAe,EAAE,UAAU,CAAC,CAAC;QAC3G,yGAAyG;QACzG,4EAA4E;QAC5E,IAAI,WAAW,EAAE,MAAM,KAAK,eAAe;YACzC,aAAa,CAAC,uCAAuC,CAAC,UAAU,EAAE,cAAc,EAAE,GAAG,EAAE,UAAU,CAAC,CAAC;QACrG,4EAA4E;QAC5E,IAAI,UAAU,EAAE,MAAM,KAAK,cAAc;YACvC,aAAa,CAAC,uCAAuC,CAAC,WAAW,EAAE,eAAe,EAAE,GAAG,EAAE,UAAU,CAAC,CAAC;IACzG,CAAC;IACD,qFAAqF;IAC9E,MAAM,CAAC,2BAA2B,CACvC,GAAyB,EACzB,QAAmB,EACnB,UAA0C,EAC1C,WAA2C,EAC3C,UAA6C;QAE7C,IAAI,UAAU,KAAK,SAAS;YAC1B,UAAU,GAAG,IAAI,2CAAqB,EAAE,CAAC;QAC3C,IAAI,aAAa,GAAG,CAAC,UAAU,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC;QAClD,IAAI,YAAY,GAAuB,EAAE,CAAC;QAC1C,IAAI,gBAAgB,GAAuB,EAAE,CAAC;QAC9C,IAAI,iBAAiB,GAAuB,EAAE,CAAC;QAC/C,MAAM,cAAc,GAAuB,EAAE,CAAC;QAC9C,MAAM,eAAe,GAAuB,EAAE,CAAC;QAC/C,IAAI,KAAK,CAAC;QACV,kBAAkB;QAClB,wDAAwD;QACxD,mDAAmD;QACnD,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;YACzB,IAAI,CAAC,CAAC,iBAAiB,EAAE,CAAC;gBACxB,oDAAoD;gBACpD,OAAO,SAAS,KAAK,CAAC,KAAK,GAAG,YAAY,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC;oBAClD,CAAC,CAAC,iBAAiB,CAAC,KAAK,EAAE,cAAc,EAAE,eAAe,EAAE,UAAU,CAAC,CAAC;oBACxE,mBAAmB,CAAC,cAAc,CAAC,SAAS,EAAE,cAAc,EAAE,gBAAgB,EAAE,iBAAiB,EAAE,SAAS,EAAE,UAAU,CAAC,CAAC;oBAC1H,mBAAmB,CAAC,cAAc,CAAC,QAAQ,EAAE,eAAe,EAAE,gBAAgB,EAAE,iBAAiB,EAAE,SAAS,EAAE,UAAU,CAAC,CAAC;oBAC1H,UAAU,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;gBAChC,CAAC;gBACD,oDAAoD;gBACpD,OAAO,SAAS,KAAK,CAAC,KAAK,GAAG,aAAa,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC;oBACnD,CAAC,CAAC,iBAAiB,CAAC,KAAK,EAAE,cAAc,EAAE,eAAe,EAAE,UAAU,CAAC,CAAC;oBACxE,mBAAmB,CAAC,cAAc,CAAC,QAAQ,EAAE,cAAc,EAAE,gBAAgB,EAAE,iBAAiB,EAAE,SAAS,EAAE,UAAU,CAAC,CAAC;oBACzH,mBAAmB,CAAC,cAAc,CAAC,SAAS,EAAE,eAAe,EAAE,gBAAgB,EAAE,iBAAiB,EAAE,SAAS,EAAE,UAAU,CAAC,CAAC;oBAC3H,UAAU,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;gBAChC,CAAC;gBACD,6BAA6B;gBAC7B,MAAM,KAAK,GAAG,YAAY,CAAC;gBAAC,YAAY,GAAG,gBAAgB,CAAC;gBAAC,gBAAgB,GAAG,KAAK,CAAC;gBACtF,MAAM,KAAK,GAAG,aAAa,CAAC;gBAAC,aAAa,GAAG,iBAAiB,CAAC;gBAAC,iBAAiB,GAAG,KAAK,CAAC;YAC5F,CAAC;QACH,CAAC;QACD,gDAAgD;QAChD,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC;YAC5B,UAAU,EAAE,IAAI,CAAC,UAAU,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC;aAC3C,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC;YACjC,WAAW,EAAE,IAAI,CAAC,UAAU,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC;aAC5C,CAAC;YACJ,aAAa,CAAC,YAAY,EAAE,UAAU,EAAE,UAAU,CAAC,CAAC;YACpD,aAAa,CAAC,aAAa,EAAE,WAAW,EAAE,UAAU,CAAC,CAAC;QACxD,CAAC;IACH,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,wBAAwB,CAAC,OAA2B;QAChE,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;QAC9B,MAAM,QAAQ,GAAG,eAAO,CAAC,UAAU,EAAE,CAAC;QACtC,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;QACxB,MAAM,WAAW,GAAyB,EAAE,CAAC;QAC7C,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;YACvB,MAAM,QAAQ,GAAG,uCAAkB,CAAC,WAAW,EAAE,CAAC;YAClD,QAAQ,CAAC,mBAAmB,CAAC,CAAC,CAAC,YAAY,EAAE,CAAC,CAAC;YAC/C,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC7B,CAAC;QACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC/B,MAAM,GAAG,GAAG,2BAAY,CAAC,yBAAyB,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;gBACzE,IAAI,GAAG,EAAE,CAAC;oBACR,IAAI,OAAO,CAAC,sBAAsB,CAAC,GAAG,EAAE,QAAQ,CAAC,EAAE,CAAC;wBAClD,kEAAkE;wBAClE,MAAM,SAAS,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC;wBAC7E,MAAM,MAAM,GAAG,qBAAS,CAAC,oBAAoB,CAAC,SAAS,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;wBACrE,IAAI,MAAM,EAAE,CAAC;4BACX,MAAM,MAAM,GAAG,MAAM,CAAC,YAAY,EAAE,CAAC;4BACrC,WAAW,CAAC,CAAC,CAAC,CAAC,mBAAmB,CAAC,MAAM,CAAC,CAAC;4BAC3C,WAAW,CAAC,CAAC,CAAC,CAAC,mBAAmB,CAAC,MAAM,CAAC,CAAC;wBAC7C,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,uDAA0B,CAAC,gBAAgB,CAAC,WAAW,CAAC,CAAC;IAClE,CAAC;IACD;;;;;;;;;OASG;IACI,MAAM,CAAC,kDAAkD,CAC9D,UAAsB,EAAE,aAA6B,EAAE,cAAsB,mBAAQ,CAAC,mBAAmB,EAAE,WAA0B;QAErI,MAAM,OAAO,GAAG,iBAAO,CAAC,oBAAoB,CAAC,UAAU,EAAE,aAAa,EAAE,WAAW,EAAE,WAAW,CAAC,CAAC;QAClG,IAAI,CAAC,OAAO;YACV,OAAO,SAAS,CAAC;QACnB,MAAM,UAAU,GAAG,OAAO,CAAC,wBAAwB,CAAC,UAAU,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QAChF,IAAI,UAAU,KAAK,SAAS,IAAI,UAAU,CAAC,MAAM,KAAK,UAAU,CAAC,QAAQ,CAAC,MAAM;YAC9E,OAAO,SAAS,CAAC;QACnB,OAAO,OAAO,CAAC,qCAAqC,CAAC,UAAU,CAAC,CAAC;IACnE,CAAC;;AAz9BH,sCA09BC;AACD,SAAS,aAAa,CACpB,SAA6B,EAC7B,WAA2C,EAC3C,UAAiC;IAEjC,IAAI,WAAW,KAAK,SAAS;QAC3B,UAAU,CAAC,cAAc,CAAC,SAAS,CAAC,CAAC;SAClC,CAAC;QACJ,KAAK,MAAM,CAAC,IAAI,SAAS;YACvB,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACxB,CAAC;IACD,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC;AACvB,CAAC;AACD;;;;;;;;;GASG;AACH,SAAS,mBAAmB,CAC1B,MAAsB,EACtB,SAA6B,EAC7B,UAA0C,EAC1C,WAA2C,EAC3C,cAA8C,EAC9C,UAAiC;IAEjC,IAAI,WAAW,CAAC;IAChB,IAAI,MAAM,KAAK,cAAc,CAAC,QAAQ;QACpC,WAAW,GAAG,UAAU,CAAC;SACtB,IAAI,MAAM,KAAK,cAAc,CAAC,SAAS;QAC1C,WAAW,GAAG,WAAW,CAAC;SACvB,IAAI,MAAM,KAAK,cAAc,CAAC,cAAc;QAC/C,WAAW,GAAG,cAAc,CAAC;IAC/B,4EAA4E;IAC5E,IAAI,WAAW,KAAK,SAAS;QAC3B,UAAU,CAAC,cAAc,CAAC,SAAS,CAAC,CAAC;SAClC,CAAC;QACJ,KAAK,MAAM,CAAC,IAAI,SAAS;YACvB,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACxB,CAAC;IACD,SAAS,CAAC,MAAM,GAAG,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/** @packageDocumentation\r\n * @module CartesianGeometry\r\n */\r\n\r\nimport { assert } from \"@itwin/core-bentley\";\r\nimport { Arc3d } from \"../curve/Arc3d\";\r\nimport { BagOfCurves, CurveChain } from \"../curve/CurveCollection\";\r\nimport { CurveFactory } from \"../curve/CurveFactory\";\r\nimport { AnnounceNumberNumber, AnnounceNumberNumberCurvePrimitive, CurvePrimitive } from \"../curve/CurvePrimitive\";\r\nimport { AnyCurve, AnyRegion } from \"../curve/CurveTypes\";\r\nimport { GeometryQuery } from \"../curve/GeometryQuery\";\r\nimport { LineSegment3d } from \"../curve/LineSegment3d\";\r\nimport { LineString3d } from \"../curve/LineString3d\";\r\nimport { Loop } from \"../curve/Loop\";\r\nimport { Path } from \"../curve/Path\";\r\nimport { RegionBinaryOpType, RegionOps } from \"../curve/RegionOps\";\r\nimport { StrokeOptions } from \"../curve/StrokeOptions\";\r\nimport { UnionRegion } from \"../curve/UnionRegion\";\r\nimport { Geometry } from \"../Geometry\";\r\nimport { FrameBuilder } from \"../geometry3d/FrameBuilder\";\r\nimport { GrowableFloat64Array } from \"../geometry3d/GrowableFloat64Array\";\r\nimport { GrowableXYZArray } from \"../geometry3d/GrowableXYZArray\";\r\nimport { IndexedXYZCollection } from \"../geometry3d/IndexedXYZCollection\";\r\nimport { Plane3dByOriginAndUnitNormal } from \"../geometry3d/Plane3dByOriginAndUnitNormal\";\r\nimport { Point3dArrayCarrier } from \"../geometry3d/Point3dArrayCarrier\";\r\nimport { Point3d, Vector3d } from \"../geometry3d/Point3dVector3d\";\r\nimport { Range1d, Range3d } from \"../geometry3d/Range\";\r\nimport { GrowableXYZArrayCache } from \"../geometry3d/ReusableObjectCache\";\r\nimport { Transform } from \"../geometry3d/Transform\";\r\nimport { LowAndHighXY, XAndY } from \"../geometry3d/XYZProps\";\r\nimport { PolyfaceBuilder } from \"../polyface/PolyfaceBuilder\";\r\nimport { Voronoi } from \"../topology/Voronoi\";\r\nimport { ClipPlane } from \"./ClipPlane\";\r\nimport { ClipPrimitive } from \"./ClipPrimitive\";\r\nimport { ClipVector } from \"./ClipVector\";\r\nimport { ConvexClipPlaneSet } from \"./ConvexClipPlaneSet\";\r\nimport { LineStringOffsetClipperContext } from \"./internalContexts/LineStringOffsetClipperContext\";\r\nimport { UnionOfConvexClipPlaneSets } from \"./UnionOfConvexClipPlaneSets\";\r\n\r\n/**\r\n * Enumerated type for describing where geometry lies with respect to clipping planes.\r\n * @public\r\n */\r\nexport enum ClipPlaneContainment {\r\n  /** All points inside. */\r\n  StronglyInside = 1,\r\n  /** Inside/outside state unknown. */\r\n  Ambiguous = 2,\r\n  /** All points outside. */\r\n  StronglyOutside = 3,\r\n}\r\n/**\r\n * Enumeration of ways to handle an intermediate fragment from a clipping step.\r\n * @public\r\n */\r\nexport enum ClipStepAction {\r\n  /** Pass fragments directly to final accepted \"in\" state. */\r\n  acceptIn = 1,\r\n  /** Pass fragments directly to final accepted \"out\" state. */\r\n  acceptOut = -1,\r\n  /** Forward fragments to subsequent steps. */\r\n  passToNextStep = 0,\r\n}\r\n\r\n/**\r\n * Enumerated type for describing what must yet be done to clip a piece of geometry.\r\n * @public\r\n */\r\nexport enum ClipStatus {\r\n  /** Some geometry may cross the clip boundaries */\r\n  ClipRequired,\r\n  /** Geometry is clearly outside */\r\n  TrivialReject,\r\n  /** Geometry is clearly inside */\r\n  TrivialAccept,\r\n}\r\n\r\n/**\r\n * An object containing clipping planes that can be used to clip geometry.\r\n * @public\r\n */\r\nexport interface Clipper {\r\n  /** Test if `point` is on or inside the Clipper's volume. */\r\n  isPointOnOrInside(point: Point3d, tolerance?: number): boolean;\r\n  /**\r\n   * Find the parts of the line segment (if any) that is within the convex clip volume.\r\n   * * The line segment is defined by `pointA` and `pointB`.\r\n   * * The input fractional interval from `fraction0` to `fraction1` (increasing) is the active part to consider.\r\n   * * To clip to the usual bounded line segment, start with fractions (0,1).\r\n   * If the clip volume is unbounded, the line interval may also be unbounded.\r\n   * * An unbounded line portion will have fraction coordinates positive or negative `Number.MAX_VALUE`.\r\n   * @param f0 fraction that is the initial lower fraction of the active interval (e.g., 0.0 for bounded segment).\r\n   * @param f1 fraction that is the initial upper fraction of the active interval (e.g., 1.0 for bounded segment).\r\n   * @param pointA segment start (fraction 0)\r\n   * @param pointB segment end (fraction 1)\r\n   * @param announce function to be called to announce a fraction interval that is within the convex clip volume.\r\n   * @returns true if a segment was announced, false if entirely outside.\r\n   */\r\n  announceClippedSegmentIntervals(\r\n    f0: number, f1: number, pointA: Point3d, pointB: Point3d, announce?: AnnounceNumberNumber\r\n  ): boolean;\r\n  /**\r\n   * Find the portion (or portions) of the arc (if any) that are within the convex clip volume.\r\n   * @param arc the arc to be clipped.\r\n   * @param announce function to be called to announce a fraction intervals that are within the convex clip volume.\r\n   * @returns true if one or more arcs portions were announced, false if entirely outside.\r\n   */\r\n  announceClippedArcIntervals(arc: Arc3d, announce?: AnnounceNumberNumberCurvePrimitive): boolean;\r\n  /**\r\n   * Optional polygon clip method.\r\n   * * This is expected to be implemented by planar clip structures.\r\n   * * This is unimplemented for curve clippers (e.g. sphere) for which polygon clip result has curved edges.\r\n   * * The input polygon must be convex.\r\n   */\r\n  appendPolygonClip?: AppendPolygonClipFunction;\r\n}\r\n/**\r\n * Signature of method to execute polygon clip, distributing fragments of xyz among insideFragments and outsideFragments\r\n * @param xyz convex polygon. This is not changed.\r\n * @param insideFragments Array to receive \"inside\" fragments. Each fragment is a GrowableXYZArray grabbed from\r\n * the cache. This is NOT cleared.\r\n * @param outsideFragments Array to receive \"outside\" fragments. Each fragment is a GrowableXYZArray grabbed from\r\n * the cache. This is NOT cleared.\r\n * @param arrayCache cache for reusable GrowableXYZArray.\r\n */\r\ntype AppendPolygonClipFunction = (\r\n  xyz: IndexedXYZCollection,\r\n  insideFragments: GrowableXYZArray[],\r\n  outsideFragments: GrowableXYZArray[],\r\n  arrayCache: GrowableXYZArrayCache\r\n) => void;\r\n\r\n/**\r\n * Interface for clipping convex polygons.\r\n * Supported by:\r\n * * AlternatingCCTreeNode\r\n * * ConvexClipPlaneSet\r\n * @public\r\n */\r\nexport interface PolygonClipper {\r\n  appendPolygonClip: AppendPolygonClipFunction;\r\n}\r\n/**\r\n * Class whose various static methods are functions for clipping geometry\r\n * @public\r\n */\r\nexport class ClipUtilities {\r\n  // on-demand scratch objects for method implementations. If you use one, make sure it isn't already being used in scope.\r\n  private static _workTransform?: Transform;\r\n  private static _workRange?: Range3d;\r\n  private static _workClipper?: ConvexClipPlaneSet;\r\n\r\n  private static _selectIntervals01TestPoint = Point3d.create();\r\n  /**\r\n   * Augment the unsortedFractionsArray with 0 and 1\r\n   * * sort\r\n   * * test the midpoint of each interval with `clipper.isPointOnOrInside`\r\n   * * pass accepted intervals to `announce(f0,f1,curve)`\r\n   */\r\n  public static selectIntervals01(\r\n    curve: CurvePrimitive,\r\n    unsortedFractions: GrowableFloat64Array,\r\n    clipper: Clipper,\r\n    announce?: AnnounceNumberNumberCurvePrimitive,\r\n  ): boolean {\r\n    unsortedFractions.push(0);\r\n    unsortedFractions.push(1);\r\n    unsortedFractions.sort();\r\n    let f0 = unsortedFractions.atUncheckedIndex(0);\r\n    let f1;\r\n    let fMid;\r\n    const testPoint = ClipUtilities._selectIntervals01TestPoint;\r\n    const n = unsortedFractions.length;\r\n    for (let i = 1; i < n; i++) {\r\n      f1 = unsortedFractions.atUncheckedIndex(i);\r\n      if (f1 > f0 + Geometry.smallFraction) {\r\n        fMid = 0.5 * (f0 + f1);\r\n        if (fMid >= 0.0 && fMid <= 1.0) {\r\n          curve.fractionToPoint(fMid, testPoint);\r\n          if (clipper.isPointOnOrInside(testPoint)) {\r\n            if (announce)\r\n              announce(f0, f1, curve);\r\n            else\r\n              return true;\r\n          }\r\n        }\r\n        f0 = f1;\r\n      }\r\n    }\r\n    return false;\r\n  }\r\n  /**\r\n   * Announce triples of (low, high, cp) for each entry in intervals.\r\n   * @param intervals source array\r\n   * @param cp CurvePrimitive for announcement\r\n   * @param announce function to receive data\r\n   */\r\n  public static announceNNC(\r\n    intervals: Range1d[], cp: CurvePrimitive, announce?: AnnounceNumberNumberCurvePrimitive,\r\n  ): boolean {\r\n    if (announce) {\r\n      for (const ab of intervals) {\r\n        announce(ab.low, ab.high, cp);\r\n      }\r\n    }\r\n    return intervals.length > 0;\r\n  }\r\n  /**\r\n   * Compute and return portions of the input curve that are within the clipper.\r\n   * @param curve input curve, unmodified\r\n   * @param clipper used to compute the clipped components\r\n   * @return array of clipped curves\r\n   */\r\n  public static collectClippedCurves(curve: CurvePrimitive, clipper: Clipper): CurvePrimitive[] {\r\n    const result: CurvePrimitive[] = [];\r\n    curve.announceClipIntervals(\r\n      clipper,\r\n      (fraction0: number, fraction1: number, curveA: CurvePrimitive) => {\r\n        if (fraction1 !== fraction0) {\r\n          const partialCurve = curveA.clonePartialCurve(fraction0, fraction1);\r\n          if (partialCurve)\r\n            result.push(partialCurve);\r\n        }\r\n      },\r\n    );\r\n    return result;\r\n  }\r\n  /**\r\n   * Compute and return the portions of the input region that are within the clipper.\r\n   * @param region input region, unmodified\r\n   * @param clipper used to compute the clipped components\r\n   * @return clipped subregion, as a single `AnyRegion`\r\n   */\r\n  public static clipAnyRegion(region: AnyRegion, clipper: Clipper): AnyRegion | undefined {\r\n    let result: UnionRegion | undefined;\r\n    const localToWorld = ClipUtilities._workTransform = FrameBuilder.createRightHandedFrame(undefined, region, ClipUtilities._workTransform);\r\n    if (!localToWorld)\r\n      return result;\r\n    const worldToLocal = localToWorld?.inverse();\r\n    if (!worldToLocal)\r\n      return result;\r\n    const localRegion = region.cloneTransformed(worldToLocal) as AnyRegion; // parallel to xy-plane so we can ignore z\r\n    if (!localRegion)\r\n      return result;\r\n    // We can only clip convex polygons with our clipper machinery, but the input region doesn't have to be\r\n    // convex or even a polygon. We get around this limitation by using a Boolean operation, which admits\r\n    // *any* planar regions, albeit in local coordinates. First, we clip a rectangle that covers the input region\r\n    // (in world coordinates), then we intersect the resulting fragments with the input region in local coordinates.\r\n    // Finally, we assemble the results into a UnionRegion back in world coordinates.\r\n    const localRegionRange = ClipUtilities._workRange = localRegion.range();\r\n    const xLength = localRegionRange.xLength();\r\n    const yLength = localRegionRange.yLength();\r\n    const rectangle = LineString3d.createRectangleXY(localRegionRange.low, xLength, yLength, true);\r\n    rectangle.tryTransformInPlace(localToWorld);\r\n    // Clip the rectangle to produce fragment(s) which we can Boolean intersect with the input region.\r\n    const insideFragments: GrowableXYZArray[] = [];\r\n    const outsideFragments: GrowableXYZArray[] = [];\r\n    const cache = new GrowableXYZArrayCache();\r\n    clipper.appendPolygonClip?.(rectangle.packedPoints, insideFragments, outsideFragments, cache);\r\n    if (insideFragments.length === 0)\r\n      return result;\r\n    // Create the \"clipped region\".\r\n    for (const fragment of insideFragments) {\r\n      const loop = Loop.createPolygon(fragment);\r\n      loop.tryTransformInPlace(worldToLocal);\r\n      const clippedLocalRegion = RegionOps.regionBooleanXY(localRegion, loop, RegionBinaryOpType.Intersection);\r\n      if (clippedLocalRegion) {\r\n        clippedLocalRegion.tryTransformInPlace(localToWorld);\r\n        if (!result)\r\n          result = (clippedLocalRegion instanceof UnionRegion) ? clippedLocalRegion : UnionRegion.create(clippedLocalRegion);\r\n        if (clippedLocalRegion instanceof UnionRegion)\r\n          result.children.push(...clippedLocalRegion.children); // avoid nested UnionRegions\r\n        else\r\n          result.tryAddChild(clippedLocalRegion);\r\n      }\r\n    }\r\n    return result ? RegionOps.simplifyRegion(result) : undefined;\r\n  }\r\n  /**\r\n   * Compute and return portions of the input curve or region that are within the clipper.\r\n   * @param curve input curve or region, unmodified\r\n   * @param clipper used to compute the clipped components\r\n   * @return array of clipped components of the input curve or region that lie inside the clipper\r\n   */\r\n  public static clipAnyCurve(curve: AnyCurve, clipper: Clipper): AnyCurve[] {\r\n    if (curve instanceof CurvePrimitive)\r\n      return ClipUtilities.collectClippedCurves(curve, clipper);\r\n    if (curve.isAnyRegion()) {\r\n      const ret = ClipUtilities.clipAnyRegion(curve, clipper);\r\n      return ret ? [ret] : [];\r\n    }\r\n    const result: AnyCurve[] = [];\r\n    if (curve instanceof Path || curve instanceof BagOfCurves) {\r\n      for (const child of curve.children) {\r\n        const partialClip = ClipUtilities.clipAnyCurve(child, clipper);\r\n        result.push(...partialClip);\r\n      }\r\n    }\r\n    return result;\r\n  }\r\n  /**\r\n   * Clip a polygon down to regions defined by each shape of a ClipShape.\r\n   * @return An multidimensional array of points, where each array is the boundary of part of the remaining polygon.\r\n   */\r\n  public static clipPolygonToClipShape(polygon: Point3d[], clipShape: ClipPrimitive): Point3d[][] {\r\n    const outputA = this.clipPolygonToClipShapeReturnGrowableXYZArrays(polygon, clipShape);\r\n    const output = [];\r\n    for (const g of outputA)\r\n      output.push(g.getPoint3dArray());\r\n    return output;\r\n  }\r\n  /**\r\n   * Clip a polygon down to regions defined by each shape of a ClipShape.\r\n   * @return An multidimensional array of points, where each array is the boundary of part of the remaining polygon.\r\n   */\r\n  public static clipPolygonToClipShapeReturnGrowableXYZArrays(\r\n    polygon: Point3d[], clipShape: ClipPrimitive,\r\n  ): GrowableXYZArray[] {\r\n    const output: GrowableXYZArray[] = [];\r\n    const clipper = clipShape.fetchClipPlanesRef();\r\n    // NEEDS WORK -- what if it is a mask !!!!\r\n    if (clipper) {\r\n      clipper.polygonClip(polygon, output);\r\n    }\r\n    return output;\r\n  }\r\n  /**\r\n   * Given an array of points, test for trivial containment conditions.\r\n   * * ClipStatus.TrivialAccept if all points are in any one of the convexSet's.\r\n   * * ClipStatus.ClipRequired if (in any single convexSet) there were points on both sides of any single plane.\r\n   * * ClipStatus.TrivialReject if neither of those occurred.\r\n   */\r\n  public static pointSetSingleClipStatus(\r\n    points: GrowableXYZArray, planeSet: UnionOfConvexClipPlaneSets, tolerance: number,\r\n  ): ClipStatus {\r\n    if (planeSet.convexSets.length === 0)\r\n      return ClipStatus.TrivialAccept;\r\n\r\n    for (const convexSet of planeSet.convexSets) {\r\n      let allOutsideSinglePlane = false, anyOutside = false;\r\n\r\n      for (const plane of convexSet.planes) {\r\n        let numInside = 0, numOutside = 0;\r\n        const planeDistance = plane.distance - tolerance;\r\n\r\n        const currPt = Point3d.create();\r\n        const currVec = Vector3d.create();\r\n        for (let i = 0; i < points.length; i++) {\r\n          points.getPoint3dAtUncheckedPointIndex(i, currPt);\r\n          currVec.setFrom(currPt);\r\n          currVec.dotProduct(plane.inwardNormalRef) > planeDistance ? numInside++ : numOutside++;\r\n        }\r\n\r\n        anyOutside = (numOutside !== 0) ? true : anyOutside;\r\n        if (numInside === 0) {\r\n          allOutsideSinglePlane = true;\r\n          break;\r\n        }\r\n      }\r\n\r\n      if (!anyOutside)  // totally inside this set - no clip required\r\n        return ClipStatus.TrivialAccept;\r\n      if (!allOutsideSinglePlane)\r\n        return ClipStatus.ClipRequired;\r\n    }\r\n    return ClipStatus.TrivialReject;\r\n  }\r\n  /**\r\n   * Emit point loops for intersection of a convex set with a range.\r\n   * * return zero length array for (a) null range or (b) no intersections\r\n   * @param range range to intersect\r\n   * @param includeConvexSetFaces if false, do not compute facets originating as convex set planes.\r\n   * @param includeRangeFaces if false, do not compute facets originating as range faces\r\n   * @param ignoreInvisiblePlanes if true, do NOT compute a facet for convex set faces marked invisible.\r\n   */\r\n  public static announceLoopsOfConvexClipPlaneSetIntersectRange(\r\n    convexSet: ConvexClipPlaneSet | ClipPlane,\r\n    range: Range3d,\r\n    loopFunction: (loopPoints: GrowableXYZArray) => void,\r\n    includeConvexSetFaces: boolean = true,\r\n    includeRangeFaces: boolean = true,\r\n    ignoreInvisiblePlanes = false,\r\n  ): void {\r\n    const work = new GrowableXYZArray();\r\n    if (includeConvexSetFaces) {\r\n      // Clip convexSet planes to the range and to the rest of the convexSet . .\r\n      if (convexSet instanceof ConvexClipPlaneSet) {\r\n        for (const plane of convexSet.planes) {\r\n          if (ignoreInvisiblePlanes && plane.invisible)\r\n            continue;\r\n          const pointsClippedToRange = plane.intersectRange(range, true);\r\n          const finalPoints = new GrowableXYZArray();\r\n          if (pointsClippedToRange) {\r\n            convexSet.polygonClip(pointsClippedToRange, finalPoints, work, plane);\r\n            if (finalPoints.length > 0)\r\n              loopFunction(finalPoints);\r\n          }\r\n        }\r\n      } else {  // `convexSet` is just one plane ...\r\n        if (ignoreInvisiblePlanes && convexSet.invisible) {\r\n          // skip it !\r\n        } else {\r\n          const pointsClippedToRange = convexSet.intersectRange(range, true);\r\n          if (pointsClippedToRange)\r\n            loopFunction(pointsClippedToRange);\r\n        }\r\n      }\r\n    }\r\n\r\n    if (includeRangeFaces) {\r\n      // clip range faces to the convex set . . .\r\n      const corners = range.corners();\r\n      for (let i = 0; i < 6; i++) {\r\n        const indices = Range3d.faceCornerIndices(i);\r\n        const finalPoints = new GrowableXYZArray();\r\n        const lineString = LineString3d.createIndexedPoints(corners, indices);\r\n        if (convexSet instanceof ConvexClipPlaneSet) {\r\n          convexSet.polygonClip(lineString.packedPoints, finalPoints, work);\r\n          if (finalPoints.length > 0)\r\n            loopFunction(finalPoints);\r\n        } else {\r\n          convexSet.clipConvexPolygonInPlace(lineString.packedPoints, work);\r\n          if (lineString.packedPoints.length > 0)\r\n            loopFunction(lineString.packedPoints);\r\n        }\r\n      }\r\n    }\r\n  }\r\n  /**\r\n   * Return a (possibly empty) array of geometry (Loops !!) which are facets of the intersection of the convex set\r\n   * intersecting a range.\r\n   * * Return zero length array for (a) null range or (b) no intersections\r\n   * @param allClippers convex or union clipper\r\n   * @param range range to intersect\r\n   * @param includeConvexSetFaces if false, do not compute facets originating as convex set planes.\r\n   * @param includeRangeFaces if false, do not compute facets originating as range faces\r\n   * @param ignoreInvisiblePlanes if true, do NOT compute a facet for convex set faces marked invisible.\r\n   */\r\n  public static loopsOfConvexClipPlaneIntersectionWithRange(\r\n    allClippers: ConvexClipPlaneSet | UnionOfConvexClipPlaneSets | ClipPlane,\r\n    range: Range3d,\r\n    includeConvexSetFaces: boolean = true,\r\n    includeRangeFaces: boolean = true,\r\n    ignoreInvisiblePlanes = false,\r\n  ): GeometryQuery[] {\r\n    const result: GeometryQuery[] = [];\r\n    if (allClippers instanceof UnionOfConvexClipPlaneSets) {\r\n      for (const clipper of allClippers.convexSets) {\r\n        this.announceLoopsOfConvexClipPlaneSetIntersectRange(clipper, range,\r\n          (points: GrowableXYZArray) => {\r\n            if (points.length > 0) result.push(Loop.createPolygon(points));\r\n          },\r\n          includeConvexSetFaces, includeRangeFaces, ignoreInvisiblePlanes);\r\n      }\r\n    } else if (allClippers instanceof ConvexClipPlaneSet || allClippers instanceof ClipPlane) {\r\n      this.announceLoopsOfConvexClipPlaneSetIntersectRange(allClippers, range,\r\n        (points: GrowableXYZArray) => {\r\n          if (points.length > 0) result.push(Loop.createPolygon(points));\r\n        },\r\n        includeConvexSetFaces, includeRangeFaces, ignoreInvisiblePlanes);\r\n    }\r\n    return result;\r\n  }\r\n  /**\r\n   * Return the (possibly null) range of the intersection of the convex set with a range.\r\n   * * The convex set is permitted to be unbounded (e.g. a single plane).  The range parameter provides bounds.\r\n   * @param convexSet convex set for intersection.\r\n   * @param range range to intersect\r\n   */\r\n  public static rangeOfConvexClipPlaneSetIntersectionWithRange(convexSet: ConvexClipPlaneSet, range: Range3d): Range3d {\r\n    const result = Range3d.createNull();\r\n    this.announceLoopsOfConvexClipPlaneSetIntersectRange(convexSet, range,\r\n      (points: GrowableXYZArray) => {\r\n        if (points.length > 0) result.extendArray(points);\r\n      },\r\n      true, true, false);\r\n    return result;\r\n  }\r\n  /**\r\n   * Return the range of various types of clippers\r\n   * * `ConvexClipPlaneSet` -- dispatch to `rangeOfConvexClipPlaneSetIntersectionWithRange`\r\n   * * `UnionOfConvexClipPlaneSet` -- union of ranges of member `ConvexClipPlaneSet`\r\n   * * `ClipPrimitive` -- access its `UnionOfConvexClipPlaneSet`.\r\n   * * `ClipVector` -- intersection of the ranges of its `ClipPrimitive`.\r\n   * * `undefined` -- entire input range.\r\n   * * If `observeInvisibleFlag` is false, the \"invisible\" properties are ignored, and this effectively returns the range of the edge work of the members\r\n   * * If `observeInvisibleFlag` is true, the \"invisible\" properties are observed, and \"invisible\" parts do not restrict the range.\r\n   * @param clipper\r\n   * @param range non-null range.\r\n   * @param observeInvisibleFlag indicates how \"invisible\" bit is applied for ClipPrimitive.\r\n   */\r\n  public static rangeOfClipperIntersectionWithRange(\r\n    clipper: ConvexClipPlaneSet | UnionOfConvexClipPlaneSets | ClipPrimitive | ClipVector | undefined,\r\n    range: Range3d,\r\n    observeInvisibleFlag: boolean = true,\r\n  ): Range3d {\r\n    if (clipper === undefined)\r\n      return range.clone();\r\n    if (clipper instanceof ConvexClipPlaneSet)\r\n      return this.rangeOfConvexClipPlaneSetIntersectionWithRange(clipper, range);\r\n    if (clipper instanceof UnionOfConvexClipPlaneSets) {\r\n      const rangeUnion = Range3d.createNull();\r\n      for (const c of clipper.convexSets) {\r\n        const rangeC = this.rangeOfConvexClipPlaneSetIntersectionWithRange(c, range);\r\n        rangeUnion.extendRange(rangeC);\r\n      }\r\n      return rangeUnion;\r\n    }\r\n    if (clipper instanceof ClipPrimitive) {\r\n      if (observeInvisibleFlag && clipper.invisible)\r\n        return range.clone();\r\n      return this.rangeOfClipperIntersectionWithRange(clipper.fetchClipPlanesRef(), range);\r\n    }\r\n    if (clipper instanceof ClipVector) {\r\n      const rangeIntersection = range.clone();\r\n      for (const c of clipper.clips) {\r\n        if (observeInvisibleFlag && c.invisible) {\r\n          // trivial range tests do not expose the effects.   Assume the hole allows everything.\r\n        } else {\r\n          const rangeC = this.rangeOfClipperIntersectionWithRange(c, range, observeInvisibleFlag);\r\n          rangeIntersection.intersect(rangeC, rangeIntersection);\r\n        }\r\n      }\r\n      return rangeIntersection;\r\n\r\n    }\r\n    return range.clone();\r\n  }\r\n  /**\r\n   * Test if various types of clippers have any intersection with a range.\r\n   * * This follows the same logic as `rangeOfClipperIntersectionWithRange` but attempts to exit at earliest point of confirmed intersection\r\n   * * `ConvexClipPlaneSet` -- dispatch to `doesConvexClipPlaneSetIntersectRange`\r\n   * * `UnionOfConvexClipPlaneSet` -- union of ranges of member `ConvexClipPlaneSet`\r\n   * * `ClipPrimitive` -- access its `UnionOfConvexClipPlaneSet`.\r\n   * * `ClipVector` -- intersection of the ranges of its `ClipPrimitive`.\r\n   * * `undefined` -- entire input range.\r\n   * * If `observeInvisibleFlag` is false, the \"invisible\" properties are ignored, and holes do not affect the result.\r\n   * * If `observeInvisibleFlag` is true, the \"invisible\" properties are observed, and may affect the result.\r\n   * @param clipper\r\n   * @param range non-null range.\r\n   * @param observeInvisibleFlag indicates how \"invisible\" bit is applied for ClipPrimitive.\r\n   */\r\n  public static doesClipperIntersectRange(\r\n    clipper: ConvexClipPlaneSet | UnionOfConvexClipPlaneSets | ClipPrimitive | ClipVector | undefined,\r\n    range: Range3d,\r\n    observeInvisibleFlag: boolean = true,\r\n  ): boolean {\r\n    if (clipper === undefined)\r\n      return true;\r\n\r\n    if (clipper instanceof ConvexClipPlaneSet)\r\n      return this.doesConvexClipPlaneSetIntersectRange(clipper, range);\r\n\r\n    if (clipper instanceof UnionOfConvexClipPlaneSets) {\r\n      for (const c of clipper.convexSets) {\r\n        if (this.doesConvexClipPlaneSetIntersectRange(c, range))\r\n          return true;\r\n      }\r\n      return false;\r\n    }\r\n\r\n    if (clipper instanceof ClipPrimitive) {\r\n      if (observeInvisibleFlag && clipper.invisible)    // um is there an easy way to detect range-completely-inside?\r\n        return true;\r\n      return this.doesClipperIntersectRange(clipper.fetchClipPlanesRef(), range);\r\n    }\r\n\r\n    if (clipper instanceof ClipVector) {\r\n      const rangeIntersection = range.clone();\r\n      for (const c of clipper.clips) {\r\n        if (observeInvisibleFlag && c.invisible) {\r\n          // trivial range tests do not expose the effects.   Assume the hole allows everything.\r\n        } else {\r\n          const rangeC = this.rangeOfClipperIntersectionWithRange(c, range, observeInvisibleFlag);\r\n          rangeIntersection.intersect(rangeC, rangeIntersection);\r\n        }\r\n      }\r\n      return !rangeIntersection.isNull;\r\n    }\r\n    /** If the case statement above is complete for the variant inputs, this is unreachable .. */\r\n    return false;\r\n  }\r\n  /**\r\n   * Emit point loops for intersection of a convex set with a range.\r\n   * * return zero length array for (a) null range or (b) no intersections\r\n   * @param range range to intersect\r\n   * @param includeConvexSetFaces if false, do not compute facets originating as convex set planes.\r\n   * @param includeRangeFaces if false, do not compute facets originating as range faces\r\n   * @param ignoreInvisiblePlanes if true, do NOT compute a facet for convex set faces marked invisible.\r\n   */\r\n  public static doesConvexClipPlaneSetIntersectRange(\r\n    convexSet: ConvexClipPlaneSet,\r\n    range: Range3d,\r\n    includeConvexSetFaces: boolean = true,\r\n    includeRangeFaces: boolean = true,\r\n    ignoreInvisiblePlanes = false,\r\n  ): boolean {\r\n    const work = new GrowableXYZArray();\r\n    if (includeConvexSetFaces) {\r\n      // Clip convexSet planes to the range and to the rest of the convexSet . .\r\n      for (const plane of convexSet.planes) {\r\n        if (ignoreInvisiblePlanes && plane.invisible)\r\n          continue;\r\n        const pointsClippedToRange = plane.intersectRange(range, true);\r\n        if (pointsClippedToRange) {\r\n          const finalPoints = new GrowableXYZArray();\r\n          convexSet.polygonClip(pointsClippedToRange, finalPoints, work, plane);\r\n          if (finalPoints.length > 0)\r\n            return true;\r\n        }\r\n      }\r\n    }\r\n\r\n    if (includeRangeFaces) {\r\n      // clip range faces to the convex set . . .\r\n      const corners = range.corners();\r\n      for (let i = 0; i < 6; i++) {\r\n        const indices = Range3d.faceCornerIndices(i);\r\n        const finalPoints = new GrowableXYZArray();\r\n        const lineString = LineString3d.createIndexedPoints(corners, indices);\r\n        convexSet.polygonClip(lineString.packedPoints, finalPoints, work);\r\n        if (finalPoints.length > 0)\r\n          return true;\r\n      }\r\n    }\r\n    return false;\r\n  }\r\n  /**\r\n   * Create a clipper from the transformed range.\r\n   * @param range input range to create clipper from\r\n   * @param transform how to transform the range (NOTE: applied to the range faces without swelling the range volume)\r\n   * @param degeneratePoints optionally populated with the 1 or 2 points defining the transformed range if it is degenerate (all points colinear/coincident); otherwise untouched\r\n   * @returns newly constructed clipper. If no clip planes could be computed, fill `degeneratePoints` and return undefined.\r\n  */\r\n  private static createClipperFromTransformedRange3d(range: Range3d, transform: Transform, degeneratePoints?: Point3d[]): ConvexClipPlaneSet | undefined {\r\n    if (!transform)\r\n      transform = Transform.createIdentity();\r\n    const builder = PolyfaceBuilder.create();\r\n    builder.addTransformedRangeMesh(transform, range);\r\n    const mesh = builder.claimPolyface();\r\n    const clipper = this._workClipper = ConvexClipPlaneSet.createConvexPolyface(mesh, this._workClipper).clipper;\r\n    if (clipper.planes.length > 0)\r\n      return clipper;\r\n    // no faces found in the compressed mesh\r\n    if (degeneratePoints) {\r\n      assert(mesh.data.point.length <= 2);\r\n      for (let i = 0; i < 2; ++i) {\r\n        const point = mesh.data.point.getPoint3dAtCheckedPointIndex(i);\r\n        if (point)\r\n          degeneratePoints.push(point);\r\n      }\r\n    }\r\n    return undefined;\r\n  }\r\n  /**\r\n   * Handle pathological cases of range-range intersection, where one of the ranges defines no area or volume (is a line segment or single point).\r\n   * @param range local range to intersect with the point/segment\r\n   * @param points isolated local point, or local segment's start and end\r\n   * @param localToWorld optional transform for output range\r\n   * @param intersection optional range of the intersection, in world coordinates, or null range if no intersection.\r\n   * @returns whether the point/segment intersects the range\r\n   */\r\n  private static rangeIntersectPointOrSegment(range: Range3d, points: Point3d[], localToWorld?: Transform, intersection?: Range3d): boolean {\r\n    const announceInterval: AnnounceNumberNumberCurvePrimitive | undefined = intersection ?\r\n      (f0: number, f1: number, cp: CurvePrimitive) => {\r\n        intersection.extendPoint(cp.fractionToPoint(f0), localToWorld);\r\n        intersection.extendPoint(cp.fractionToPoint(f1), localToWorld);\r\n      } : undefined;\r\n    let hasIntersection = false;\r\n    if (points.length > 1) {\r\n      const segment = LineSegment3d.createCapture(points[0], points[1]);\r\n      const clipper = ConvexClipPlaneSet.createRange3dPlanes(range);\r\n      hasIntersection = segment.announceClipIntervals(clipper, announceInterval);\r\n    } else if (points.length > 0) {\r\n      hasIntersection = range.containsPoint(points[0]);\r\n      if (hasIntersection && intersection)\r\n        intersection.extendPoint(points[0], localToWorld);\r\n    }\r\n    return hasIntersection;\r\n  }\r\n  /**\r\n   * Test for intersection of two ranges in different local coordinates.\r\n   * * Useful for clash detection of elements in iModels, using their stored (tight) local ranges and placement transforms.\r\n   * @param range0 first range in local coordinates\r\n   * @param local0ToWorld placement transform for first range\r\n   * @param range1 second range in local coordinates\r\n   * @param local1ToWorld placement transform for second range. Assumed to be invertible.\r\n   * @param range1Margin optional signed local distance to expand/contract the second range before intersection. Positive expands.\r\n   * @return whether the local ranges are adjacent or intersect. Also returns false if local1ToWorld is singular.\r\n   */\r\n  public static doLocalRangesIntersect(\r\n    range0: Range3d, local0ToWorld: Transform, range1: Range3d, local1ToWorld: Transform, range1Margin?: number,\r\n  ): boolean {\r\n    const worldToLocal1 = this._workTransform = local1ToWorld.inverse(this._workTransform);\r\n    if (!worldToLocal1)\r\n      return false;\r\n    let myRange1 = range1;\r\n    if (range1Margin) {\r\n      myRange1 = this._workRange = range1.clone(this._workRange);\r\n      myRange1.expandInPlace(range1Margin);\r\n    }\r\n    const degeneratePoints: Point3d[] = [];\r\n    const local0ToLocal1 = worldToLocal1.multiplyTransformTransform(local0ToWorld, worldToLocal1);\r\n    // convert range0 into a clipper in local1 coordinates, then intersect with range1\r\n    const clipper = this.createClipperFromTransformedRange3d(range0, local0ToLocal1, degeneratePoints);\r\n    if (clipper)\r\n      return this.doesClipperIntersectRange(clipper, myRange1);\r\n    return this.rangeIntersectPointOrSegment(myRange1, degeneratePoints, local1ToWorld);\r\n  }\r\n  /**\r\n   * Compute the range of the intersection between two local (e.g., element-aligned) ranges.\r\n   * @param range0 first range in local coordinates\r\n   * @param local0ToWorld placement transform for first range\r\n   * @param range1 second range in local coordinates\r\n   * @param local1ToWorld placement transform for second range. Assumed to be invertible.\r\n   * @param result optional pre-allocated range to fill and return\r\n   * @return range of the intersection (aligned to world axes). Returns null range if local1ToWorld is singular.\r\n   */\r\n  public static rangeOfIntersectionOfLocalRanges(range0: Range3d, local0ToWorld: Transform, range1: Range3d, local1ToWorld: Transform, result?: Range3d): Range3d {\r\n    const myResult = Range3d.createNull(result);\r\n    const worldToLocal1 = this._workTransform = local1ToWorld.inverse(this._workTransform);\r\n    if (!worldToLocal1)\r\n      return myResult;\r\n    const degeneratePoints: Point3d[] = [];\r\n    const local0ToLocal1 = worldToLocal1.multiplyTransformTransform(local0ToWorld, worldToLocal1);\r\n    // convert range0 into a clipper in local1 coordinates, then intersect with range1\r\n    const clipper = this.createClipperFromTransformedRange3d(range0, local0ToLocal1, degeneratePoints);\r\n    if (clipper)\r\n      this.announceLoopsOfConvexClipPlaneSetIntersectRange(clipper, range1, (loopPoints: GrowableXYZArray) => { loopPoints.extendRange(myResult, local1ToWorld); });\r\n    else\r\n      this.rangeIntersectPointOrSegment(range1, degeneratePoints, local1ToWorld, myResult);\r\n    return myResult;\r\n  }\r\n  /**\r\n   * Test if `obj` is a `Clipper` object.\r\n   * * This is implemented by testing for each of the methods in the `Clipper` interface.\r\n   */\r\n  public static isClipper(obj: any): boolean {\r\n    if (obj) {\r\n      if (obj.isPointOnOrInside\r\n        && obj.announceClippedSegmentIntervals\r\n        && obj.announceClippedArcIntervals)\r\n        return true;\r\n    }\r\n    return false;\r\n  }\r\n  /**\r\n   * Specialized logic for replacing clip fragments by an equivalent singleton.\r\n   * * If there are baseCount + 1 or fewer fragments, do nothing.\r\n   * * If there are more than baseCount+1 fragments:\r\n   *   * drop them all to the cache\r\n   *   * push a copy of the singleton.\r\n   * * The use case for this is that a multi-step clipper (e.g. UnionOfConvexClipPlaneSets) may produce many fragments,\r\n   * and then be able to determine that they really are the original pre-clip polygon unchanged.\r\n   * * The baseCount+1 case is the case where the entire original singleton is still a singleton and can be left alone.\r\n   * * Calling this replacer shuffles the original back into the fragment array, and drops the fragments.\r\n   * * This determination is solely within the logic of the caller.\r\n   * @param shards array of fragments\r\n   * @param baseCount original count\r\n   * @param singleton single array which may be a replacement for multiple fragments\r\n   * @param cache cache for array management\r\n   */\r\n  public static restoreSingletonInPlaceOfMultipleShards(\r\n    fragments: GrowableXYZArray[] | undefined, baseCount: number, singleton: IndexedXYZCollection, arrayCache: GrowableXYZArrayCache,\r\n  ): void {\r\n    if (fragments && fragments.length > baseCount + 1) {\r\n      while (fragments.length > baseCount) {\r\n        const f = fragments.pop();\r\n        arrayCache.dropToCache(f);\r\n      }\r\n      fragments.push(arrayCache.grabAndFill(singleton));\r\n    }\r\n  }\r\n  /**\r\n   * Create a UnionOfConvexClipPlaneSets for a volume defined by a path and offsets.\r\n   * @param points points along the path.\r\n   * @param positiveOffsetLeft offset to left.  0 is clip on the path.\r\n   * @param positiveOffsetRight offset to the right.  0 is clip on the path.\r\n   * @param z0 z for lower clipping plane.  If undefined, unbounded in positive z\r\n   * @param z1 z for upper clipping plane.  If undefined, unbounded in negative z.\r\n   * @alpha\r\n   */\r\n  public static createXYOffsetClipFromLineString(\r\n    points: Point3d[] | IndexedXYZCollection, leftOffset: number, rightOffset: number, z0: number, z1: number,\r\n  ): UnionOfConvexClipPlaneSets {\r\n    if (Array.isArray(points)) {\r\n      return LineStringOffsetClipperContext.createClipBetweenOffsets(\r\n        new Point3dArrayCarrier(points), leftOffset, rightOffset, z0, z1);\r\n    }\r\n    return LineStringOffsetClipperContext.createClipBetweenOffsets(points, leftOffset, rightOffset, z0, z1);\r\n  }\r\n  /** If data.length >= minLength threshold, push it to destination; if smaller drop it back to the cache. */\r\n  public static captureOrDrop(\r\n    data: GrowableXYZArray, minLength: number, destination: GrowableXYZArray[], cache: GrowableXYZArrayCache,\r\n  ): void {\r\n    if (data.length >= minLength)\r\n      destination.push(data);\r\n    else\r\n      cache.dropToCache(data);\r\n  }\r\n  /**\r\n   * Find the portion of a line within a half-plane clip.\r\n   * * The half-plane clip is to the left of the line from clipA to clipB.\r\n   * * The original clipped segment has fractions 0 and 1 at respective segment points.\r\n   * * Caller initializes the interval\r\n   * * This method reduces the interval size.\r\n   * * See clipSegmentToCCWTriangleXY for typical use.\r\n   * @param linePointA First point of clip line\r\n   * @param linePointB Second point of clip line\r\n   * @param segmentPoint0 First point of clipped segment\r\n   * @param segmentPoint1 Second point of clipped segment\r\n   * @param interval Live interval.\r\n     * @param absoluteTolerance absolute tolerance for both cross product values to indicate \"on\" the line\r\n   */\r\n  public static clipSegmentToLLeftOfLineXY(\r\n    linePointA: XAndY, linePointB: XAndY, segmentPoint0: XAndY, segmentPoint1: XAndY, interval: Range1d, absoluteTolerance: number = 1.0e-14,\r\n  ): void {\r\n    const ux = linePointB.x - linePointA.x;\r\n    const uy = linePointB.y - linePointA.y;\r\n    // negative is in positive is out ...\r\n    const h0 = -(ux * (segmentPoint0.y - linePointA.y) - uy * (segmentPoint0.x - linePointA.x));\r\n    const h1 = -(ux * (segmentPoint1.y - linePointA.y) - uy * (segmentPoint1.x - linePointA.x));\r\n    if (h0 < absoluteTolerance && h1 < absoluteTolerance) {\r\n      // The entire segment is in .....\r\n      return;\r\n    }\r\n    if (h0 * h1 > 0.0) {\r\n      if (h0 > 0.0)\r\n        interval.setNull();\r\n    } else if (h0 * h1 < 0.0) {\r\n      // strict crossing with safe fraction . . .\r\n      const fraction = -h0 / (h1 - h0);\r\n      if (h0 < 0.0) {\r\n        return interval.intersectRangeXXInPlace(0.0, fraction);\r\n      } else {\r\n        return interval.intersectRangeXXInPlace(fraction, 1.0);\r\n      }\r\n    } else {\r\n      // There is an exact hit at one end, possibly non-zero at the other ... the sign of either determines which side is in play\r\n      // A zero and a zero or negative is entirely in, which does not alter the prior clip.\r\n      if (h0 > 0.0) {\r\n        interval.intersectRangeXXInPlace(1.0, 1.0);\r\n      } else if (h1 > 0.0) {\r\n        interval.intersectRangeXXInPlace(0.0, 0.0);\r\n      }\r\n    }\r\n  }\r\n  /**\r\n   * Clip an interval of a line segment to a triangle.\r\n   * * Triangle is assumed CCW\r\n   * @param pointA point of triangle.\r\n   * @param pointB point of triangle.\r\n   * @param pointC point of triangle.\r\n   * @param segment0 start of segment\r\n   * @param segment1 end of segment\r\n   * @param interval Pre-initialized interval of live part of segment\r\n   * @param absoluteTolerance absolute tolerance for begin \"on a line\"\r\n   */\r\n  public static clipSegmentToCCWTriangleXY(\r\n    pointA: XAndY, pointB: XAndY, pointC: XAndY, segment0: XAndY, segment1: XAndY, interval: Range1d, absoluteTolerance: number = 1.0e-14,\r\n  ): void {\r\n    if (!interval.isNull) {\r\n      this.clipSegmentToLLeftOfLineXY(pointA, pointB, segment0, segment1, interval, absoluteTolerance);\r\n      if (!interval.isNull) {\r\n        this.clipSegmentToLLeftOfLineXY(pointB, pointC, segment0, segment1, interval, absoluteTolerance);\r\n        if (!interval.isNull) {\r\n          this.clipSegmentToLLeftOfLineXY(pointC, pointA, segment0, segment1, interval, absoluteTolerance);\r\n        }\r\n      }\r\n    }\r\n  }\r\n  /**\r\n   * Find the portion of a line within a half-plane clip.\r\n   * * The half-plane clip is to the left of the line from clipA to clipB.\r\n   * * The original clipped segment has fractions 0 and 1 at respective segment points.\r\n   * * Caller initializes the interval\r\n   * * This method reduces the interval size.\r\n   * * See clipSegmentToCCWTriangleXY for typical use.\r\n   * @param linePointA First point of clip line\r\n   * @param linePointB Second point of clip line\r\n   * @param segmentPoint0 First point of clipped segment\r\n   * @param segmentPoint1 Second point of clipped segment\r\n   * @param interval Live interval.\r\n     * @param absoluteTolerance absolute tolerance for both cross product values to indicate \"on\" the line\r\n   */\r\n  public static clipSegmentBelowPlaneXY(\r\n    plane: Plane3dByOriginAndUnitNormal, segmentPoint0: XAndY, segmentPoint1: XAndY, interval: Range1d, absoluteTolerance: number = 1.0e-14,\r\n  ): void {\r\n    // negative is in positive is out ...\r\n    const h0 = plane.altitudeXY(segmentPoint0.x, segmentPoint0.y);\r\n    const h1 = plane.altitudeXY(segmentPoint1.x, segmentPoint1.y);\r\n    if (h0 < absoluteTolerance && h1 < absoluteTolerance) {\r\n      // The entire segment is in ..... the interval is unaffected.\r\n      return;\r\n    }\r\n    if (h0 * h1 > 0.0) {\r\n      if (h0 > 0.0)\r\n        interval.setNull();\r\n    } else if (h0 * h1 < 0.0) {\r\n      // strict crossing with safe fraction . . .\r\n      const fraction = -h0 / (h1 - h0);\r\n      if (h0 < 0.0) {\r\n        return interval.intersectRangeXXInPlace(0.0, fraction);\r\n      } else {\r\n        return interval.intersectRangeXXInPlace(fraction, 1.0);\r\n      }\r\n    } else {\r\n      // There is an exact hit at one end, possibly non-zero at the other ... the sign of either determines which side is in play\r\n      // A zero and a zero or negative is entirely in, which does not alter the prior clip.\r\n      if (h0 > 0.0) {\r\n        interval.intersectRangeXXInPlace(1.0, 1.0);\r\n      } else if (h1 > 0.0) {\r\n        interval.intersectRangeXXInPlace(0.0, 0.0);\r\n      }\r\n    }\r\n  }\r\n  /**\r\n   * Clip an interval of a line segment to an array of planes\r\n   * * plane normals assumed OUTWARD\r\n   * * planeAltitude is typically a tolerance a tolerance distance.\r\n   *   * positive altitude makes tha plane move in the direction of the unit normal.\r\n   * @param planes array of planes\r\n   * @param segment0 start of segment\r\n   * @param segment1 end of segment\r\n   * @param interval Pre-initialized interval of live part of segment\r\n   * @param absoluteTolerance absolute tolerance for begin \"on a line\"\r\n   */\r\n  public static clipSegmentBelowPlanesXY(\r\n    planes: Plane3dByOriginAndUnitNormal[], segment0: XAndY, segment1: XAndY, interval: Range1d, signedAltitude: number = 1.0e-14,\r\n  ): void {\r\n    const numPlanes = planes.length;\r\n    for (let i = 0; (!interval.isNull) && i < numPlanes; i++) {\r\n      this.clipSegmentBelowPlaneXY(planes[i], segment0, segment1, interval, signedAltitude);\r\n    }\r\n  }\r\n  /**\r\n   * Pass line segments from a polyline to the clipper.  Resolve the fractional clips to simple points for announcement.\r\n   * @param clipper clipper to call\r\n   * @param points polyline whose segments are passed to the clipper\r\n   * @param announce caller's handler for simple point pairs.\r\n   */\r\n  public static announcePolylineClip(\r\n    clipper: Clipper, points: Point3d[], announce: (point0: Point3d, point1: Point3d) => void,\r\n  ): void {\r\n    for (let i = 0; i + 1 < points.length; i++) {\r\n      clipper.announceClippedSegmentIntervals(0, 1, points[i], points[i + 1],\r\n        (f0: number, f1: number) => {\r\n          announce(points[i].interpolate(f0, points[i + 1]), points[i].interpolate(f1, points[i + 1]));\r\n        });\r\n    }\r\n  }\r\n  /**\r\n   * Pass line segments from a polyline to the clipper.  Sum the lengths of the clipped pieces.  Return the sum.\r\n   * @param clipper clipper to call\r\n   * @param points polyline whose segments are passed to the clipper\r\n   */\r\n  public static sumPolylineClipLength(clipper: Clipper, points: Point3d[]): number {\r\n    let s = 0;\r\n    for (let i = 0; i + 1 < points.length; i++) {\r\n      const a = points[i].distance(points[i + 1]);\r\n      clipper.announceClippedSegmentIntervals(0, 1, points[i], points[i + 1],\r\n        (f0: number, f1: number) => { s += Math.abs(f1 - f0) * a; });\r\n    }\r\n    return s;\r\n  }\r\n  /**\r\n   * Pass polygon `xyz` through a sequence of PolygonClip steps.\r\n   * * At the outset, `xyz` is the (only) entry in a set of candidates.\r\n   * * For each clipper, each candidate is presented for appendPolygon to inside and outside parts.\r\n   * * Each (in,out) result is distributed among (acceptedIn, acceptedOut, candidates) according to\r\n   *      (inAction, outAction)\r\n   * * At the end, all remaining candidates are distributed among (acceptedIn, acceptedOut, finalUnknown)\r\n   *     according to finalAction\r\n   * * Any clipper that does not have an appendPolygonClip method is skipped.\r\n   * @param xyz\r\n   * @param clippers\r\n   * @param acceptedIn\r\n   * @param acceptedOut\r\n   * @param finalCandidates\r\n   * @param inAction\r\n   * @param outAction\r\n   * @param finalCandidateAction\r\n   */\r\n  public static doPolygonClipSequence(\r\n    xyz: IndexedXYZCollection,\r\n    clippers: Clipper[],\r\n    acceptedIn: GrowableXYZArray[] | undefined,\r\n    acceptedOut: GrowableXYZArray[] | undefined,\r\n    finalCandidates: GrowableXYZArray[] | undefined,\r\n    inAction: ClipStepAction,\r\n    outAction: ClipStepAction,\r\n    finalFragmentAction: ClipStepAction,\r\n    arrayCache: GrowableXYZArrayCache | undefined,\r\n  ) {\r\n    if (arrayCache === undefined)\r\n      arrayCache = new GrowableXYZArrayCache();\r\n    let candidates = [arrayCache.grabAndFill(xyz)];\r\n    let nextCandidates: GrowableXYZArray[] = [];\r\n    const intermediateIn: GrowableXYZArray[] = [];\r\n    const intermediateOut: GrowableXYZArray[] = [];\r\n    const oldInsideCount = acceptedIn ? acceptedIn.length : 0;\r\n    const oldOutsideCount = acceptedOut ? acceptedOut.length : 0;\r\n    let shard;\r\n    // At each convex set, carryForwardA is all the fragments that have been outside all previous convex sets.\r\n    // Clip each such fragment to the current set, sending the outside parts to carryForwardB, which will got to\r\n    // the next clipper. The final surviving carryForward really is out.\r\n    for (const c of clippers) {\r\n      if (c.appendPolygonClip) {\r\n        while (undefined !== (shard = candidates.pop())) {\r\n          c.appendPolygonClip(shard, intermediateIn, intermediateOut, arrayCache);\r\n          distributeFragments(inAction, intermediateIn, acceptedIn, acceptedOut, nextCandidates, arrayCache);\r\n          distributeFragments(outAction, intermediateOut, acceptedIn, acceptedOut, nextCandidates, arrayCache);\r\n          arrayCache.dropToCache(shard);\r\n        }\r\n        // candidates is empty !!\r\n        const temp = candidates; candidates = nextCandidates; nextCandidates = temp;\r\n      }\r\n    }\r\n    distributeFragments(finalFragmentAction, candidates, acceptedIn, acceptedOut, finalCandidates, arrayCache);\r\n    // Note: The following assumes that there were no residual candidates ... need to track if that happened?\r\n    // If nothing was out, the inside fragments can be replaced by the original.\r\n    if (acceptedOut?.length === oldOutsideCount)\r\n      ClipUtilities.restoreSingletonInPlaceOfMultipleShards(acceptedIn, oldInsideCount, xyz, arrayCache);\r\n    // If nothing was in, the outside fragments can be replaced by the original.\r\n    if (acceptedIn?.length === oldInsideCount)\r\n      ClipUtilities.restoreSingletonInPlaceOfMultipleShards(acceptedOut, oldOutsideCount, xyz, arrayCache);\r\n  }\r\n  /** Pass polygon `xyz` through a sequence of PolygonClip steps with \"parity\" rules */\r\n  public static doPolygonClipParitySequence(\r\n    xyz: IndexedXYZCollection,\r\n    clippers: Clipper[],\r\n    acceptedIn: GrowableXYZArray[] | undefined,\r\n    acceptedOut: GrowableXYZArray[] | undefined,\r\n    arrayCache: GrowableXYZArrayCache | undefined,\r\n  ) {\r\n    if (arrayCache === undefined)\r\n      arrayCache = new GrowableXYZArrayCache();\r\n    let candidatesOut = [arrayCache.grabAndFill(xyz)];\r\n    let candidatesIn: GrowableXYZArray[] = [];\r\n    let nextCandidatesIn: GrowableXYZArray[] = [];\r\n    let nextCandidatesOut: GrowableXYZArray[] = [];\r\n    const intermediateIn: GrowableXYZArray[] = [];\r\n    const intermediateOut: GrowableXYZArray[] = [];\r\n    let shard;\r\n    // at each step ..\r\n    // candidatesIn and candidatesOut are evolved in and out\r\n    // nextCandidatesIn and nextCandidatesOut are EMPTY\r\n    for (const c of clippers) {\r\n      if (c.appendPolygonClip) {\r\n        // (IN,OUT) parts of IN parts distribute to (OUT,IN)\r\n        while (undefined !== (shard = candidatesIn.pop())) {\r\n          c.appendPolygonClip(shard, intermediateIn, intermediateOut, arrayCache);\r\n          distributeFragments(ClipStepAction.acceptOut, intermediateIn, nextCandidatesIn, nextCandidatesOut, undefined, arrayCache);\r\n          distributeFragments(ClipStepAction.acceptIn, intermediateOut, nextCandidatesIn, nextCandidatesOut, undefined, arrayCache);\r\n          arrayCache.dropToCache(shard);\r\n        }\r\n        // (IN,OUT) parts of IN parts distribute to (OUT,IN)\r\n        while (undefined !== (shard = candidatesOut.pop())) {\r\n          c.appendPolygonClip(shard, intermediateIn, intermediateOut, arrayCache);\r\n          distributeFragments(ClipStepAction.acceptIn, intermediateIn, nextCandidatesIn, nextCandidatesOut, undefined, arrayCache);\r\n          distributeFragments(ClipStepAction.acceptOut, intermediateOut, nextCandidatesIn, nextCandidatesOut, undefined, arrayCache);\r\n          arrayCache.dropToCache(shard);\r\n        }\r\n        // reload each candidate step\r\n        const tempA = candidatesIn; candidatesIn = nextCandidatesIn; nextCandidatesIn = tempA;\r\n        const tempB = candidatesOut; candidatesOut = nextCandidatesOut; nextCandidatesOut = tempB;\r\n      }\r\n    }\r\n    // candidatesIn and candidatesOut are final ....\r\n    if (candidatesOut.length === 0)\r\n      acceptedIn?.push(arrayCache.grabAndFill(xyz));\r\n    else if (candidatesOut.length === 0)\r\n      acceptedOut?.push(arrayCache.grabAndFill(xyz));\r\n    else {\r\n      moveFragments(candidatesIn, acceptedIn, arrayCache);\r\n      moveFragments(candidatesOut, acceptedOut, arrayCache);\r\n    }\r\n  }\r\n  /**\r\n   * For each plane of clipper, construct a UnionOfConvexClipPlaneSets for an outer (infinite) convex volume that\r\n   * abuts the outer volume of the neighbor faces.\r\n   */\r\n  public static createComplementaryClips(clipper: ConvexClipPlaneSet): UnionOfConvexClipPlaneSets {\r\n    const planes = clipper.planes;\r\n    const interval = Range1d.createNull();\r\n    const n = planes.length;\r\n    const newClippers: ConvexClipPlaneSet[] = [];\r\n    for (const p of planes) {\r\n      const outerSet = ConvexClipPlaneSet.createEmpty();\r\n      outerSet.addPlaneToConvexSet(p.cloneNegated());\r\n      newClippers.push(outerSet);\r\n    }\r\n    for (let i = 0; i < n; i++) {\r\n      for (let j = i + 1; j < n; j++) {\r\n        const ray = CurveFactory.planePlaneIntersectionRay(planes[i], planes[j]);\r\n        if (ray) {\r\n          if (clipper.hasIntersectionWithRay(ray, interval)) {\r\n            // the normal-to-normal vector is bisector (or close to bisector?)\r\n            const newNormal = planes[j].inwardNormalRef.minus(planes[i].inwardNormalRef);\r\n            const plane1 = ClipPlane.createNormalAndPoint(newNormal, ray.origin);\r\n            if (plane1) {\r\n              const plane2 = plane1.cloneNegated();\r\n              newClippers[i].addPlaneToConvexSet(plane1);\r\n              newClippers[j].addPlaneToConvexSet(plane2);\r\n            }\r\n          }\r\n        }\r\n      }\r\n    }\r\n    return UnionOfConvexClipPlaneSets.createConvexSets(newClippers);\r\n  }\r\n  /**\r\n   * Creates clippers for regions closest to the children of a curve chain.\r\n   * * For best results, each child should have length larger than `distanceTol`.\r\n   * @param curveChain A curve chain; xy-only (z-coordinate is ignored). Must have at least 2 children.\r\n   * @param strokeOptions Optional stroke options to control the sampling of the curve chain.\r\n   * @param distanceTol Optional distance tolerance to use when comparing points; default is [[Geometry.smallMetricDistance]].\r\n   * @param boundingBox Optional nominal xy-bounding box for the clipper regions; default is maximal clipper regions.\r\n   * @returns An ordered array of clippers, each of which represents the region closest to the corresponding primitive in the\r\n   * input chain, or undefined if the input is invalid.\r\n   */\r\n  public static createClippersForRegionsClosestToCurvePrimitivesXY(\r\n    curveChain: CurveChain, strokeOptions?: StrokeOptions, distanceTol: number = Geometry.smallMetricDistance, boundingBox?: LowAndHighXY\r\n  ): UnionOfConvexClipPlaneSets[] | undefined {\r\n    const voronoi = Voronoi.createFromCurveChain(curveChain, strokeOptions, distanceTol, boundingBox);\r\n    if (!voronoi)\r\n      return undefined;\r\n    const superFaces = voronoi.computeVoronoiSuperFaces(curveChain.children.length);\r\n    if (superFaces === undefined || superFaces.length !== curveChain.children.length)\r\n      return undefined;\r\n    return voronoi.generateClippersFromVoronoiSuperFaces(superFaces);\r\n  }\r\n}\r\nfunction moveFragments(\r\n  fragments: GrowableXYZArray[],\r\n  destination: GrowableXYZArray[] | undefined,\r\n  arrayCache: GrowableXYZArrayCache,\r\n) {\r\n  if (destination === undefined)\r\n    arrayCache.dropAllToCache(fragments);\r\n  else {\r\n    for (const f of fragments)\r\n      destination.push(f);\r\n  }\r\n  fragments.length = 0;\r\n}\r\n/**\r\n * Distribute fragments among acceptedIn, acceptedOut, and passToNextStep as directed by action.\r\n * * If the indicated destination is unknown, drop the fragments to the arrayCache.\r\n * @param action destination selector\r\n * @param fragments fragments to be distributed\r\n * @param acceptedIn destination for \"in\"\r\n * @param acceptedOut destination for \"out\"\r\n * @param passToNextStep destination for fragments to be passed to a later step\r\n * @param arrayCache destination for un-distributed fragments.\r\n */\r\nfunction distributeFragments(\r\n  action: ClipStepAction,\r\n  fragments: GrowableXYZArray[],\r\n  acceptedIn: GrowableXYZArray[] | undefined,\r\n  acceptedOut: GrowableXYZArray[] | undefined,\r\n  passToNextStep: GrowableXYZArray[] | undefined,\r\n  arrayCache: GrowableXYZArrayCache,\r\n) {\r\n  let destination;\r\n  if (action === ClipStepAction.acceptIn)\r\n    destination = acceptedIn;\r\n  else if (action === ClipStepAction.acceptOut)\r\n    destination = acceptedOut;\r\n  else if (action === ClipStepAction.passToNextStep)\r\n    destination = passToNextStep;\r\n  // remark: if action is other than the enum values, destination is undefined\r\n  if (destination === undefined)\r\n    arrayCache.dropAllToCache(fragments);\r\n  else {\r\n    for (const f of fragments)\r\n      destination.push(f);\r\n  }\r\n  fragments.length = 0;\r\n}\r\n"]}
+{"version":3,"file":"ClipUtils.js","sourceRoot":"","sources":["../../../src/clipping/ClipUtils.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH,sDAA6C;AAE7C,8DAAmE;AACnE,wDAAqD;AACrD,4DAAmH;AAGnH,0DAAuD;AACvD,wDAAqD;AACrD,wCAAqC;AACrC,wCAAqC;AACrC,kDAAmE;AAEnE,sDAAmD;AACnD,0CAAuC;AACvC,6DAA0D;AAE1D,qEAAkE;AAGlE,2EAAwE;AACxE,mEAAkE;AAClE,+CAAuD;AACvD,2EAA0E;AAC1E,uDAAoD;AAEpD,iEAA8D;AAC9D,iDAA8C;AAC9C,2CAAwC;AACxC,mDAAgD;AAChD,6CAA0C;AAC1C,6DAA0D;AAC1D,sGAAmG;AACnG,6EAA0E;AAE1E;;;GAGG;AACH,IAAY,oBAOX;AAPD,WAAY,oBAAoB;IAC9B,yBAAyB;IACzB,mFAAkB,CAAA;IAClB,oCAAoC;IACpC,yEAAa,CAAA;IACb,0BAA0B;IAC1B,qFAAmB,CAAA;AACrB,CAAC,EAPW,oBAAoB,oCAApB,oBAAoB,QAO/B;AACD;;;GAGG;AACH,IAAY,cAOX;AAPD,WAAY,cAAc;IACxB,4DAA4D;IAC5D,2DAAY,CAAA;IACZ,6DAA6D;IAC7D,8DAAc,CAAA;IACd,6CAA6C;IAC7C,uEAAkB,CAAA;AACpB,CAAC,EAPW,cAAc,8BAAd,cAAc,QAOzB;AAED;;;GAGG;AACH,IAAY,UAOX;AAPD,WAAY,UAAU;IACpB,kDAAkD;IAClD,2DAAY,CAAA;IACZ,kCAAkC;IAClC,6DAAa,CAAA;IACb,iCAAiC;IACjC,6DAAa,CAAA;AACf,CAAC,EAPW,UAAU,0BAAV,UAAU,QAOrB;AAmED;;;GAGG;AACH,MAAa,aAAa;IACxB,wHAAwH;IAChH,MAAM,CAAC,cAAc,CAAa;IAClC,MAAM,CAAC,UAAU,CAAW;IAC5B,MAAM,CAAC,YAAY,CAAsB;IAEzC,MAAM,CAAC,2BAA2B,GAAG,yBAAO,CAAC,MAAM,EAAE,CAAC;IAC9D;;;;;OAKG;IACI,MAAM,CAAC,iBAAiB,CAC7B,KAAqB,EACrB,iBAAuC,EACvC,OAAgB,EAChB,QAA6C;QAE7C,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1B,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1B,iBAAiB,CAAC,IAAI,EAAE,CAAC;QACzB,IAAI,EAAE,GAAG,iBAAiB,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC;QAC/C,IAAI,EAAE,CAAC;QACP,IAAI,IAAI,CAAC;QACT,MAAM,SAAS,GAAG,aAAa,CAAC,2BAA2B,CAAC;QAC5D,MAAM,CAAC,GAAG,iBAAiB,CAAC,MAAM,CAAC;QACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,EAAE,GAAG,iBAAiB,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC;YAC3C,IAAI,EAAE,GAAG,EAAE,GAAG,mBAAQ,CAAC,aAAa,EAAE,CAAC;gBACrC,IAAI,GAAG,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;gBACvB,IAAI,IAAI,IAAI,GAAG,IAAI,IAAI,IAAI,GAAG,EAAE,CAAC;oBAC/B,KAAK,CAAC,eAAe,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;oBACvC,IAAI,OAAO,CAAC,iBAAiB,CAAC,SAAS,CAAC,EAAE,CAAC;wBACzC,IAAI,QAAQ;4BACV,QAAQ,CAAC,EAAE,EAAE,EAAE,EAAE,KAAK,CAAC,CAAC;;4BAExB,OAAO,IAAI,CAAC;oBAChB,CAAC;gBACH,CAAC;gBACD,EAAE,GAAG,EAAE,CAAC;YACV,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,WAAW,CACvB,SAAoB,EAAE,EAAkB,EAAE,QAA6C;QAEvF,IAAI,QAAQ,EAAE,CAAC;YACb,KAAK,MAAM,EAAE,IAAI,SAAS,EAAE,CAAC;gBAC3B,QAAQ,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;YAChC,CAAC;QACH,CAAC;QACD,OAAO,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC;IAC9B,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,oBAAoB,CAAC,KAAqB,EAAE,OAAgB;QACxE,MAAM,MAAM,GAAqB,EAAE,CAAC;QACpC,KAAK,CAAC,qBAAqB,CACzB,OAAO,EACP,CAAC,SAAiB,EAAE,SAAiB,EAAE,MAAsB,EAAE,EAAE;YAC/D,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;gBAC5B,MAAM,YAAY,GAAG,MAAM,CAAC,iBAAiB,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;gBACpE,IAAI,YAAY;oBACd,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;YAC9B,CAAC;QACH,CAAC,CACF,CAAC;QACF,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,aAAa,CAAC,MAAiB,EAAE,OAAgB;QAC7D,IAAI,MAA+B,CAAC;QACpC,MAAM,YAAY,GAAG,aAAa,CAAC,cAAc,GAAG,2BAAY,CAAC,sBAAsB,CAAC,SAAS,EAAE,MAAM,EAAE,aAAa,CAAC,cAAc,CAAC,CAAC;QACzI,IAAI,CAAC,YAAY;YACf,OAAO,MAAM,CAAC;QAChB,MAAM,YAAY,GAAG,YAAY,EAAE,OAAO,EAAE,CAAC;QAC7C,IAAI,CAAC,YAAY;YACf,OAAO,MAAM,CAAC;QAChB,MAAM,WAAW,GAAG,MAAM,CAAC,gBAAgB,CAAC,YAAY,CAAc,CAAC,CAAC,0CAA0C;QAClH,IAAI,CAAC,WAAW;YACd,OAAO,MAAM,CAAC;QAChB,uGAAuG;QACvG,qGAAqG;QACrG,6GAA6G;QAC7G,gHAAgH;QAChH,iFAAiF;QACjF,MAAM,gBAAgB,GAAG,aAAa,CAAC,UAAU,GAAG,WAAW,CAAC,KAAK,EAAE,CAAC;QACxE,MAAM,OAAO,GAAG,gBAAgB,CAAC,OAAO,EAAE,CAAC;QAC3C,MAAM,OAAO,GAAG,gBAAgB,CAAC,OAAO,EAAE,CAAC;QAC3C,MAAM,SAAS,GAAG,2BAAY,CAAC,iBAAiB,CAAC,gBAAgB,CAAC,GAAG,EAAE,OAAO,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC;QAC/F,SAAS,CAAC,mBAAmB,CAAC,YAAY,CAAC,CAAC;QAC5C,kGAAkG;QAClG,MAAM,eAAe,GAAuB,EAAE,CAAC;QAC/C,MAAM,gBAAgB,GAAuB,EAAE,CAAC;QAChD,MAAM,KAAK,GAAG,IAAI,2CAAqB,EAAE,CAAC;QAC1C,OAAO,CAAC,iBAAiB,EAAE,CAAC,SAAS,CAAC,YAAY,EAAE,eAAe,EAAE,gBAAgB,EAAE,KAAK,CAAC,CAAC;QAC9F,IAAI,eAAe,CAAC,MAAM,KAAK,CAAC;YAC9B,OAAO,MAAM,CAAC;QAChB,+BAA+B;QAC/B,KAAK,MAAM,QAAQ,IAAI,eAAe,EAAE,CAAC;YACvC,MAAM,IAAI,GAAG,WAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC;YAC1C,IAAI,CAAC,mBAAmB,CAAC,YAAY,CAAC,CAAC;YACvC,MAAM,kBAAkB,GAAG,qBAAS,CAAC,eAAe,CAAC,WAAW,EAAE,IAAI,EAAE,8BAAkB,CAAC,YAAY,CAAC,CAAC;YACzG,IAAI,kBAAkB,EAAE,CAAC;gBACvB,kBAAkB,CAAC,mBAAmB,CAAC,YAAY,CAAC,CAAC;gBACrD,IAAI,CAAC,MAAM;oBACT,MAAM,GAAG,CAAC,kBAAkB,YAAY,yBAAW,CAAC,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC,CAAC,yBAAW,CAAC,MAAM,CAAC,kBAAkB,CAAC,CAAC;gBACrH,IAAI,kBAAkB,YAAY,yBAAW;oBAC3C,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,kBAAkB,CAAC,QAAQ,CAAC,CAAC,CAAC,4BAA4B;;oBAElF,MAAM,CAAC,WAAW,CAAC,kBAAkB,CAAC,CAAC;YAC3C,CAAC;QACH,CAAC;QACD,OAAO,MAAM,CAAC,CAAC,CAAC,qBAAS,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAC/D,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,YAAY,CAAC,KAAe,EAAE,OAAgB;QAC1D,IAAI,KAAK,YAAY,+BAAc;YACjC,OAAO,aAAa,CAAC,oBAAoB,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;QAC5D,IAAI,KAAK,CAAC,WAAW,EAAE,EAAE,CAAC;YACxB,MAAM,GAAG,GAAG,aAAa,CAAC,aAAa,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;YACxD,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QAC1B,CAAC;QACD,MAAM,MAAM,GAAe,EAAE,CAAC;QAC9B,IAAI,KAAK,YAAY,WAAI,IAAI,KAAK,YAAY,6BAAW,EAAE,CAAC;YAC1D,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;gBACnC,MAAM,WAAW,GAAG,aAAa,CAAC,YAAY,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;gBAC/D,MAAM,CAAC,IAAI,CAAC,GAAG,WAAW,CAAC,CAAC;YAC9B,CAAC;QACH,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,sBAAsB,CAAC,OAAkB,EAAE,SAAwB;QAC/E,MAAM,OAAO,GAAG,IAAI,CAAC,6CAA6C,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;QACvF,MAAM,MAAM,GAAG,EAAE,CAAC;QAClB,KAAK,MAAM,CAAC,IAAI,OAAO;YACrB,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,eAAe,EAAE,CAAC,CAAC;QACnC,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,6CAA6C,CACzD,OAAkB,EAAE,SAAwB;QAE5C,MAAM,MAAM,GAAuB,EAAE,CAAC;QACtC,MAAM,OAAO,GAAG,SAAS,CAAC,kBAAkB,EAAE,CAAC;QAC/C,0CAA0C;QAC1C,IAAI,OAAO,EAAE,CAAC;YACZ,OAAO,CAAC,WAAW,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;QACvC,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,wBAAwB,CACpC,MAAwB,EAAE,QAAoC,EAAE,SAAiB;QAEjF,IAAI,QAAQ,CAAC,UAAU,CAAC,MAAM,KAAK,CAAC;YAClC,OAAO,UAAU,CAAC,aAAa,CAAC;QAElC,KAAK,MAAM,SAAS,IAAI,QAAQ,CAAC,UAAU,EAAE,CAAC;YAC5C,IAAI,qBAAqB,GAAG,KAAK,EAAE,UAAU,GAAG,KAAK,CAAC;YAEtD,KAAK,MAAM,KAAK,IAAI,SAAS,CAAC,MAAM,EAAE,CAAC;gBACrC,IAAI,SAAS,GAAG,CAAC,EAAE,UAAU,GAAG,CAAC,CAAC;gBAClC,MAAM,aAAa,GAAG,KAAK,CAAC,QAAQ,GAAG,SAAS,CAAC;gBAEjD,MAAM,MAAM,GAAG,yBAAO,CAAC,MAAM,EAAE,CAAC;gBAChC,MAAM,OAAO,GAAG,0BAAQ,CAAC,MAAM,EAAE,CAAC;gBAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBACvC,MAAM,CAAC,+BAA+B,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;oBAClD,OAAO,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;oBACxB,OAAO,CAAC,UAAU,CAAC,KAAK,CAAC,eAAe,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC;gBACzF,CAAC;gBAED,UAAU,GAAG,CAAC,UAAU,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC;gBACpD,IAAI,SAAS,KAAK,CAAC,EAAE,CAAC;oBACpB,qBAAqB,GAAG,IAAI,CAAC;oBAC7B,MAAM;gBACR,CAAC;YACH,CAAC;YAED,IAAI,CAAC,UAAU,EAAG,6CAA6C;gBAC7D,OAAO,UAAU,CAAC,aAAa,CAAC;YAClC,IAAI,CAAC,qBAAqB;gBACxB,OAAO,UAAU,CAAC,YAAY,CAAC;QACnC,CAAC;QACD,OAAO,UAAU,CAAC,aAAa,CAAC;IAClC,CAAC;IACD;;;;;;;OAOG;IACI,MAAM,CAAC,+CAA+C,CAC3D,SAAyC,EACzC,KAAc,EACd,YAAoD,EACpD,wBAAiC,IAAI,EACrC,oBAA6B,IAAI,EACjC,qBAAqB,GAAG,KAAK;QAE7B,MAAM,IAAI,GAAG,IAAI,mCAAgB,EAAE,CAAC;QACpC,IAAI,qBAAqB,EAAE,CAAC;YAC1B,0EAA0E;YAC1E,IAAI,SAAS,YAAY,uCAAkB,EAAE,CAAC;gBAC5C,KAAK,MAAM,KAAK,IAAI,SAAS,CAAC,MAAM,EAAE,CAAC;oBACrC,IAAI,qBAAqB,IAAI,KAAK,CAAC,SAAS;wBAC1C,SAAS;oBACX,MAAM,oBAAoB,GAAG,KAAK,CAAC,cAAc,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;oBAC/D,MAAM,WAAW,GAAG,IAAI,mCAAgB,EAAE,CAAC;oBAC3C,IAAI,oBAAoB,EAAE,CAAC;wBACzB,SAAS,CAAC,WAAW,CAAC,oBAAoB,EAAE,WAAW,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;wBACtE,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC;4BACxB,YAAY,CAAC,WAAW,CAAC,CAAC;oBAC9B,CAAC;gBACH,CAAC;YACH,CAAC;iBAAM,CAAC,CAAE,oCAAoC;gBAC5C,IAAI,qBAAqB,IAAI,SAAS,CAAC,SAAS,EAAE,CAAC;oBACjD,YAAY;gBACd,CAAC;qBAAM,CAAC;oBACN,MAAM,oBAAoB,GAAG,SAAS,CAAC,cAAc,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;oBACnE,IAAI,oBAAoB;wBACtB,YAAY,CAAC,oBAAoB,CAAC,CAAC;gBACvC,CAAC;YACH,CAAC;QACH,CAAC;QAED,IAAI,iBAAiB,EAAE,CAAC;YACtB,2CAA2C;YAC3C,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,EAAE,CAAC;YAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,MAAM,OAAO,GAAG,eAAO,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC;gBAC7C,MAAM,WAAW,GAAG,IAAI,mCAAgB,EAAE,CAAC;gBAC3C,MAAM,UAAU,GAAG,2BAAY,CAAC,mBAAmB,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;gBACtE,IAAI,SAAS,YAAY,uCAAkB,EAAE,CAAC;oBAC5C,SAAS,CAAC,WAAW,CAAC,UAAU,CAAC,YAAY,EAAE,WAAW,EAAE,IAAI,CAAC,CAAC;oBAClE,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC;wBACxB,YAAY,CAAC,WAAW,CAAC,CAAC;gBAC9B,CAAC;qBAAM,CAAC;oBACN,SAAS,CAAC,wBAAwB,CAAC,UAAU,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;oBAClE,IAAI,UAAU,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC;wBACpC,YAAY,CAAC,UAAU,CAAC,YAAY,CAAC,CAAC;gBAC1C,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IACD;;;;;;;;;OASG;IACI,MAAM,CAAC,2CAA2C,CACvD,WAAwE,EACxE,KAAc,EACd,wBAAiC,IAAI,EACrC,oBAA6B,IAAI,EACjC,qBAAqB,GAAG,KAAK;QAE7B,MAAM,MAAM,GAAoB,EAAE,CAAC;QACnC,IAAI,WAAW,YAAY,uDAA0B,EAAE,CAAC;YACtD,KAAK,MAAM,OAAO,IAAI,WAAW,CAAC,UAAU,EAAE,CAAC;gBAC7C,IAAI,CAAC,+CAA+C,CAAC,OAAO,EAAE,KAAK,EACjE,CAAC,MAAwB,EAAE,EAAE;oBAC3B,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC;wBAAE,MAAM,CAAC,IAAI,CAAC,WAAI,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC;gBACjE,CAAC,EACD,qBAAqB,EAAE,iBAAiB,EAAE,qBAAqB,CAAC,CAAC;YACrE,CAAC;QACH,CAAC;aAAM,IAAI,WAAW,YAAY,uCAAkB,IAAI,WAAW,YAAY,qBAAS,EAAE,CAAC;YACzF,IAAI,CAAC,+CAA+C,CAAC,WAAW,EAAE,KAAK,EACrE,CAAC,MAAwB,EAAE,EAAE;gBAC3B,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC;oBAAE,MAAM,CAAC,IAAI,CAAC,WAAI,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC;YACjE,CAAC,EACD,qBAAqB,EAAE,iBAAiB,EAAE,qBAAqB,CAAC,CAAC;QACrE,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,8CAA8C,CAAC,SAA6B,EAAE,KAAc;QACxG,MAAM,MAAM,GAAG,eAAO,CAAC,UAAU,EAAE,CAAC;QACpC,IAAI,CAAC,+CAA+C,CAAC,SAAS,EAAE,KAAK,EACnE,CAAC,MAAwB,EAAE,EAAE;YAC3B,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC;gBAAE,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;QACpD,CAAC,EACD,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;QACrB,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;;;;;;;;OAYG;IACI,MAAM,CAAC,mCAAmC,CAC/C,OAAiG,EACjG,KAAc,EACd,uBAAgC,IAAI;QAEpC,IAAI,OAAO,KAAK,SAAS;YACvB,OAAO,KAAK,CAAC,KAAK,EAAE,CAAC;QACvB,IAAI,OAAO,YAAY,uCAAkB;YACvC,OAAO,IAAI,CAAC,8CAA8C,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;QAC7E,IAAI,OAAO,YAAY,uDAA0B,EAAE,CAAC;YAClD,MAAM,UAAU,GAAG,eAAO,CAAC,UAAU,EAAE,CAAC;YACxC,KAAK,MAAM,CAAC,IAAI,OAAO,CAAC,UAAU,EAAE,CAAC;gBACnC,MAAM,MAAM,GAAG,IAAI,CAAC,8CAA8C,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;gBAC7E,UAAU,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;YACjC,CAAC;YACD,OAAO,UAAU,CAAC;QACpB,CAAC;QACD,IAAI,OAAO,YAAY,6BAAa,EAAE,CAAC;YACrC,IAAI,oBAAoB,IAAI,OAAO,CAAC,SAAS;gBAC3C,OAAO,KAAK,CAAC,KAAK,EAAE,CAAC;YACvB,OAAO,IAAI,CAAC,mCAAmC,CAAC,OAAO,CAAC,kBAAkB,EAAE,EAAE,KAAK,CAAC,CAAC;QACvF,CAAC;QACD,IAAI,OAAO,YAAY,uBAAU,EAAE,CAAC;YAClC,MAAM,iBAAiB,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;YACxC,KAAK,MAAM,CAAC,IAAI,OAAO,CAAC,KAAK,EAAE,CAAC;gBAC9B,IAAI,oBAAoB,IAAI,CAAC,CAAC,SAAS,EAAE,CAAC;oBACxC,sFAAsF;gBACxF,CAAC;qBAAM,CAAC;oBACN,MAAM,MAAM,GAAG,IAAI,CAAC,mCAAmC,CAAC,CAAC,EAAE,KAAK,EAAE,oBAAoB,CAAC,CAAC;oBACxF,iBAAiB,CAAC,SAAS,CAAC,MAAM,EAAE,iBAAiB,CAAC,CAAC;gBACzD,CAAC;YACH,CAAC;YACD,OAAO,iBAAiB,CAAC;QAE3B,CAAC;QACD,OAAO,KAAK,CAAC,KAAK,EAAE,CAAC;IACvB,CAAC;IACD;;;;;;;;;;;;;OAaG;IACI,MAAM,CAAC,yBAAyB,CACrC,OAAiG,EACjG,KAAc,EACd,uBAAgC,IAAI;QAEpC,IAAI,OAAO,KAAK,SAAS;YACvB,OAAO,IAAI,CAAC;QAEd,IAAI,OAAO,YAAY,uCAAkB;YACvC,OAAO,IAAI,CAAC,oCAAoC,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;QAEnE,IAAI,OAAO,YAAY,uDAA0B,EAAE,CAAC;YAClD,KAAK,MAAM,CAAC,IAAI,OAAO,CAAC,UAAU,EAAE,CAAC;gBACnC,IAAI,IAAI,CAAC,oCAAoC,CAAC,CAAC,EAAE,KAAK,CAAC;oBACrD,OAAO,IAAI,CAAC;YAChB,CAAC;YACD,OAAO,KAAK,CAAC;QACf,CAAC;QAED,IAAI,OAAO,YAAY,6BAAa,EAAE,CAAC;YACrC,IAAI,oBAAoB,IAAI,OAAO,CAAC,SAAS,EAAK,6DAA6D;gBAC7G,OAAO,IAAI,CAAC;YACd,OAAO,IAAI,CAAC,yBAAyB,CAAC,OAAO,CAAC,kBAAkB,EAAE,EAAE,KAAK,CAAC,CAAC;QAC7E,CAAC;QAED,IAAI,OAAO,YAAY,uBAAU,EAAE,CAAC;YAClC,MAAM,iBAAiB,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;YACxC,KAAK,MAAM,CAAC,IAAI,OAAO,CAAC,KAAK,EAAE,CAAC;gBAC9B,IAAI,oBAAoB,IAAI,CAAC,CAAC,SAAS,EAAE,CAAC;oBACxC,sFAAsF;gBACxF,CAAC;qBAAM,CAAC;oBACN,MAAM,MAAM,GAAG,IAAI,CAAC,mCAAmC,CAAC,CAAC,EAAE,KAAK,EAAE,oBAAoB,CAAC,CAAC;oBACxF,iBAAiB,CAAC,SAAS,CAAC,MAAM,EAAE,iBAAiB,CAAC,CAAC;gBACzD,CAAC;YACH,CAAC;YACD,OAAO,CAAC,iBAAiB,CAAC,MAAM,CAAC;QACnC,CAAC;QACD,6FAA6F;QAC7F,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;;;OAOG;IACI,MAAM,CAAC,oCAAoC,CAChD,SAA6B,EAC7B,KAAc,EACd,wBAAiC,IAAI,EACrC,oBAA6B,IAAI,EACjC,qBAAqB,GAAG,KAAK;QAE7B,MAAM,IAAI,GAAG,IAAI,mCAAgB,EAAE,CAAC;QACpC,IAAI,qBAAqB,EAAE,CAAC;YAC1B,0EAA0E;YAC1E,KAAK,MAAM,KAAK,IAAI,SAAS,CAAC,MAAM,EAAE,CAAC;gBACrC,IAAI,qBAAqB,IAAI,KAAK,CAAC,SAAS;oBAC1C,SAAS;gBACX,MAAM,oBAAoB,GAAG,KAAK,CAAC,cAAc,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;gBAC/D,IAAI,oBAAoB,EAAE,CAAC;oBACzB,MAAM,WAAW,GAAG,IAAI,mCAAgB,EAAE,CAAC;oBAC3C,SAAS,CAAC,WAAW,CAAC,oBAAoB,EAAE,WAAW,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;oBACtE,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC;wBACxB,OAAO,IAAI,CAAC;gBAChB,CAAC;YACH,CAAC;QACH,CAAC;QAED,IAAI,iBAAiB,EAAE,CAAC;YACtB,2CAA2C;YAC3C,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,EAAE,CAAC;YAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,MAAM,OAAO,GAAG,eAAO,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC;gBAC7C,MAAM,WAAW,GAAG,IAAI,mCAAgB,EAAE,CAAC;gBAC3C,MAAM,UAAU,GAAG,2BAAY,CAAC,mBAAmB,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;gBACtE,SAAS,CAAC,WAAW,CAAC,UAAU,CAAC,YAAY,EAAE,WAAW,EAAE,IAAI,CAAC,CAAC;gBAClE,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC;oBACxB,OAAO,IAAI,CAAC;YAChB,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;;MAME;IACM,MAAM,CAAC,mCAAmC,CAAC,KAAc,EAAE,SAAoB,EAAE,gBAA4B;QACnH,IAAI,CAAC,SAAS;YACZ,SAAS,GAAG,qBAAS,CAAC,cAAc,EAAE,CAAC;QACzC,MAAM,OAAO,GAAG,iCAAe,CAAC,MAAM,EAAE,CAAC;QACzC,OAAO,CAAC,uBAAuB,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;QAClD,MAAM,IAAI,GAAG,OAAO,CAAC,aAAa,EAAE,CAAC;QACrC,MAAM,OAAO,GAAG,IAAI,CAAC,YAAY,GAAG,uCAAkB,CAAC,oBAAoB,CAAC,IAAI,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC,OAAO,CAAC;QAC7G,IAAI,OAAO,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC;YAC3B,OAAO,OAAO,CAAC;QACjB,wCAAwC;QACxC,IAAI,gBAAgB,EAAE,CAAC;YACrB,IAAA,qBAAM,EAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC;YACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC;gBAC3B,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,6BAA6B,CAAC,CAAC,CAAC,CAAC;gBAC/D,IAAI,KAAK;oBACP,gBAAgB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACjC,CAAC;QACH,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;;OAOG;IACK,MAAM,CAAC,4BAA4B,CAAC,KAAc,EAAE,MAAiB,EAAE,YAAwB,EAAE,YAAsB;QAC7H,MAAM,gBAAgB,GAAmD,YAAY,CAAC,CAAC;YACrF,CAAC,EAAU,EAAE,EAAU,EAAE,EAAkB,EAAE,EAAE;gBAC7C,YAAY,CAAC,WAAW,CAAC,EAAE,CAAC,eAAe,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC;gBAC/D,YAAY,CAAC,WAAW,CAAC,EAAE,CAAC,eAAe,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC;YACjE,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QAChB,IAAI,eAAe,GAAG,KAAK,CAAC;QAC5B,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACtB,MAAM,OAAO,GAAG,6BAAa,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YAClE,MAAM,OAAO,GAAG,uCAAkB,CAAC,mBAAmB,CAAC,KAAK,CAAC,CAAC;YAC9D,eAAe,GAAG,OAAO,CAAC,qBAAqB,CAAC,OAAO,EAAE,gBAAgB,CAAC,CAAC;QAC7E,CAAC;aAAM,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC7B,eAAe,GAAG,KAAK,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YACjD,IAAI,eAAe,IAAI,YAAY;gBACjC,YAAY,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC;QACtD,CAAC;QACD,OAAO,eAAe,CAAC;IACzB,CAAC;IACD;;;;;;;;;OASG;IACI,MAAM,CAAC,sBAAsB,CAClC,MAAe,EAAE,aAAwB,EAAE,MAAe,EAAE,aAAwB,EAAE,YAAqB;QAE3G,MAAM,aAAa,GAAG,IAAI,CAAC,cAAc,GAAG,aAAa,CAAC,OAAO,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;QACvF,IAAI,CAAC,aAAa;YAChB,OAAO,KAAK,CAAC;QACf,IAAI,QAAQ,GAAG,MAAM,CAAC;QACtB,IAAI,YAAY,EAAE,CAAC;YACjB,QAAQ,GAAG,IAAI,CAAC,UAAU,GAAG,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YAC3D,QAAQ,CAAC,aAAa,CAAC,YAAY,CAAC,CAAC;QACvC,CAAC;QACD,MAAM,gBAAgB,GAAc,EAAE,CAAC;QACvC,MAAM,cAAc,GAAG,aAAa,CAAC,0BAA0B,CAAC,aAAa,EAAE,aAAa,CAAC,CAAC;QAC9F,kFAAkF;QAClF,MAAM,OAAO,GAAG,IAAI,CAAC,mCAAmC,CAAC,MAAM,EAAE,cAAc,EAAE,gBAAgB,CAAC,CAAC;QACnG,IAAI,OAAO;YACT,OAAO,IAAI,CAAC,yBAAyB,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;QAC3D,OAAO,IAAI,CAAC,4BAA4B,CAAC,QAAQ,EAAE,gBAAgB,EAAE,aAAa,CAAC,CAAC;IACtF,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,gCAAgC,CAAC,MAAe,EAAE,aAAwB,EAAE,MAAe,EAAE,aAAwB,EAAE,MAAgB;QACnJ,MAAM,QAAQ,GAAG,eAAO,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;QAC5C,MAAM,aAAa,GAAG,IAAI,CAAC,cAAc,GAAG,aAAa,CAAC,OAAO,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;QACvF,IAAI,CAAC,aAAa;YAChB,OAAO,QAAQ,CAAC;QAClB,MAAM,gBAAgB,GAAc,EAAE,CAAC;QACvC,MAAM,cAAc,GAAG,aAAa,CAAC,0BAA0B,CAAC,aAAa,EAAE,aAAa,CAAC,CAAC;QAC9F,kFAAkF;QAClF,MAAM,OAAO,GAAG,IAAI,CAAC,mCAAmC,CAAC,MAAM,EAAE,cAAc,EAAE,gBAAgB,CAAC,CAAC;QACnG,IAAI,OAAO;YACT,IAAI,CAAC,+CAA+C,CAAC,OAAO,EAAE,MAAM,EAAE,CAAC,UAA4B,EAAE,EAAE,GAAG,UAAU,CAAC,WAAW,CAAC,QAAQ,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;;YAE9J,IAAI,CAAC,4BAA4B,CAAC,MAAM,EAAE,gBAAgB,EAAE,aAAa,EAAE,QAAQ,CAAC,CAAC;QACvF,OAAO,QAAQ,CAAC;IAClB,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,SAAS,CAAC,GAAQ;QAC9B,IAAI,GAAG,EAAE,CAAC;YACR,IAAI,GAAG,CAAC,iBAAiB;mBACpB,GAAG,CAAC,+BAA+B;mBACnC,GAAG,CAAC,2BAA2B;gBAClC,OAAO,IAAI,CAAC;QAChB,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;;;;;;;;;;;OAeG;IACI,MAAM,CAAC,uCAAuC,CACnD,SAAyC,EAAE,SAAiB,EAAE,SAA+B,EAAE,UAAiC;QAEhI,IAAI,SAAS,IAAI,SAAS,CAAC,MAAM,GAAG,SAAS,GAAG,CAAC,EAAE,CAAC;YAClD,OAAO,SAAS,CAAC,MAAM,GAAG,SAAS,EAAE,CAAC;gBACpC,MAAM,CAAC,GAAG,SAAS,CAAC,GAAG,EAAE,CAAC;gBAC1B,UAAU,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;YAC5B,CAAC;YACD,SAAS,CAAC,IAAI,CAAC,UAAU,CAAC,WAAW,CAAC,SAAS,CAAC,CAAC,CAAC;QACpD,CAAC;IACH,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,gCAAgC,CAC5C,MAAwC,EAAE,UAAkB,EAAE,WAAmB,EAAE,EAAU,EAAE,EAAU;QAEzG,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;YAC1B,OAAO,+DAA8B,CAAC,wBAAwB,CAC5D,IAAI,yCAAmB,CAAC,MAAM,CAAC,EAAE,UAAU,EAAE,WAAW,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QACtE,CAAC;QACD,OAAO,+DAA8B,CAAC,wBAAwB,CAAC,MAAM,EAAE,UAAU,EAAE,WAAW,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;IAC1G,CAAC;IACD,2GAA2G;IACpG,MAAM,CAAC,aAAa,CACzB,IAAsB,EAAE,SAAiB,EAAE,WAA+B,EAAE,KAA4B;QAExG,IAAI,IAAI,CAAC,MAAM,IAAI,SAAS;YAC1B,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;;YAEvB,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;IAC5B,CAAC;IACD;;;;;;;;;;;;;OAaG;IACI,MAAM,CAAC,0BAA0B,CACtC,UAAiB,EAAE,UAAiB,EAAE,aAAoB,EAAE,aAAoB,EAAE,QAAiB,EAAE,oBAA4B,OAAO;QAExI,MAAM,EAAE,GAAG,UAAU,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC;QACvC,MAAM,EAAE,GAAG,UAAU,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC;QACvC,qCAAqC;QACrC,MAAM,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,aAAa,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,aAAa,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5F,MAAM,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,aAAa,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,aAAa,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5F,IAAI,EAAE,GAAG,iBAAiB,IAAI,EAAE,GAAG,iBAAiB,EAAE,CAAC;YACrD,iCAAiC;YACjC,OAAO;QACT,CAAC;QACD,IAAI,EAAE,GAAG,EAAE,GAAG,GAAG,EAAE,CAAC;YAClB,IAAI,EAAE,GAAG,GAAG;gBACV,QAAQ,CAAC,OAAO,EAAE,CAAC;QACvB,CAAC;aAAM,IAAI,EAAE,GAAG,EAAE,GAAG,GAAG,EAAE,CAAC;YACzB,2CAA2C;YAC3C,MAAM,QAAQ,GAAG,CAAC,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;YACjC,IAAI,EAAE,GAAG,GAAG,EAAE,CAAC;gBACb,OAAO,QAAQ,CAAC,uBAAuB,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;YACzD,CAAC;iBAAM,CAAC;gBACN,OAAO,QAAQ,CAAC,uBAAuB,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;YACzD,CAAC;QACH,CAAC;aAAM,CAAC;YACN,2HAA2H;YAC3H,qFAAqF;YACrF,IAAI,EAAE,GAAG,GAAG,EAAE,CAAC;gBACb,QAAQ,CAAC,uBAAuB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAC7C,CAAC;iBAAM,IAAI,EAAE,GAAG,GAAG,EAAE,CAAC;gBACpB,QAAQ,CAAC,uBAAuB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAC7C,CAAC;QACH,CAAC;IACH,CAAC;IACD;;;;;;;;;;OAUG;IACI,MAAM,CAAC,0BAA0B,CACtC,MAAa,EAAE,MAAa,EAAE,MAAa,EAAE,QAAe,EAAE,QAAe,EAAE,QAAiB,EAAE,oBAA4B,OAAO;QAErI,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC;YACrB,IAAI,CAAC,0BAA0B,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,iBAAiB,CAAC,CAAC;YACjG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC;gBACrB,IAAI,CAAC,0BAA0B,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,iBAAiB,CAAC,CAAC;gBACjG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC;oBACrB,IAAI,CAAC,0BAA0B,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,iBAAiB,CAAC,CAAC;gBACnG,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IACD;;;;;;;;;;;;;OAaG;IACI,MAAM,CAAC,uBAAuB,CACnC,KAAmC,EAAE,aAAoB,EAAE,aAAoB,EAAE,QAAiB,EAAE,oBAA4B,OAAO;QAEvI,qCAAqC;QACrC,MAAM,EAAE,GAAG,KAAK,CAAC,UAAU,CAAC,aAAa,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC;QAC9D,MAAM,EAAE,GAAG,KAAK,CAAC,UAAU,CAAC,aAAa,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC;QAC9D,IAAI,EAAE,GAAG,iBAAiB,IAAI,EAAE,GAAG,iBAAiB,EAAE,CAAC;YACrD,6DAA6D;YAC7D,OAAO;QACT,CAAC;QACD,IAAI,EAAE,GAAG,EAAE,GAAG,GAAG,EAAE,CAAC;YAClB,IAAI,EAAE,GAAG,GAAG;gBACV,QAAQ,CAAC,OAAO,EAAE,CAAC;QACvB,CAAC;aAAM,IAAI,EAAE,GAAG,EAAE,GAAG,GAAG,EAAE,CAAC;YACzB,2CAA2C;YAC3C,MAAM,QAAQ,GAAG,CAAC,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;YACjC,IAAI,EAAE,GAAG,GAAG,EAAE,CAAC;gBACb,OAAO,QAAQ,CAAC,uBAAuB,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;YACzD,CAAC;iBAAM,CAAC;gBACN,OAAO,QAAQ,CAAC,uBAAuB,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;YACzD,CAAC;QACH,CAAC;aAAM,CAAC;YACN,2HAA2H;YAC3H,qFAAqF;YACrF,IAAI,EAAE,GAAG,GAAG,EAAE,CAAC;gBACb,QAAQ,CAAC,uBAAuB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAC7C,CAAC;iBAAM,IAAI,EAAE,GAAG,GAAG,EAAE,CAAC;gBACpB,QAAQ,CAAC,uBAAuB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAC7C,CAAC;QACH,CAAC;IACH,CAAC;IACD;;;;;;;;;;OAUG;IACI,MAAM,CAAC,wBAAwB,CACpC,MAAsC,EAAE,QAAe,EAAE,QAAe,EAAE,QAAiB,EAAE,iBAAyB,OAAO;QAE7H,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC;QAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;YACzD,IAAI,CAAC,uBAAuB,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,cAAc,CAAC,CAAC;QACxF,CAAC;IACH,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,oBAAoB,CAChC,OAAgB,EAAE,MAAiB,EAAE,QAAoD;QAEzF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,OAAO,CAAC,+BAA+B,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EACpE,CAAC,EAAU,EAAE,EAAU,EAAE,EAAE;gBACzB,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAC/F,CAAC,CAAC,CAAC;QACP,CAAC;IACH,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,qBAAqB,CAAC,OAAgB,EAAE,MAAiB;QACrE,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC5C,OAAO,CAAC,+BAA+B,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EACpE,CAAC,EAAU,EAAE,EAAU,EAAE,EAAE,GAAG,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACjE,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC;IACD;;;;;;;;;;;;;;;;;OAiBG;IACI,MAAM,CAAC,qBAAqB,CACjC,GAAyB,EACzB,QAAmB,EACnB,UAA0C,EAC1C,WAA2C,EAC3C,eAA+C,EAC/C,QAAwB,EACxB,SAAyB,EACzB,mBAAmC,EACnC,UAA6C;QAE7C,IAAI,UAAU,KAAK,SAAS;YAC1B,UAAU,GAAG,IAAI,2CAAqB,EAAE,CAAC;QAC3C,IAAI,UAAU,GAAG,CAAC,UAAU,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC;QAC/C,IAAI,cAAc,GAAuB,EAAE,CAAC;QAC5C,MAAM,cAAc,GAAuB,EAAE,CAAC;QAC9C,MAAM,eAAe,GAAuB,EAAE,CAAC;QAC/C,MAAM,cAAc,GAAG,UAAU,CAAC,CAAC,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1D,MAAM,eAAe,GAAG,WAAW,CAAC,CAAC,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7D,IAAI,KAAK,CAAC;QACV,0GAA0G;QAC1G,4GAA4G;QAC5G,oEAAoE;QACpE,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;YACzB,IAAI,CAAC,CAAC,iBAAiB,EAAE,CAAC;gBACxB,OAAO,SAAS,KAAK,CAAC,KAAK,GAAG,UAAU,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC;oBAChD,CAAC,CAAC,iBAAiB,CAAC,KAAK,EAAE,cAAc,EAAE,eAAe,EAAE,UAAU,CAAC,CAAC;oBACxE,mBAAmB,CAAC,QAAQ,EAAE,cAAc,EAAE,UAAU,EAAE,WAAW,EAAE,cAAc,EAAE,UAAU,CAAC,CAAC;oBACnG,mBAAmB,CAAC,SAAS,EAAE,eAAe,EAAE,UAAU,EAAE,WAAW,EAAE,cAAc,EAAE,UAAU,CAAC,CAAC;oBACrG,UAAU,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;gBAChC,CAAC;gBACD,yBAAyB;gBACzB,MAAM,IAAI,GAAG,UAAU,CAAC;gBAAC,UAAU,GAAG,cAAc,CAAC;gBAAC,cAAc,GAAG,IAAI,CAAC;YAC9E,CAAC;QACH,CAAC;QACD,mBAAmB,CAAC,mBAAmB,EAAE,UAAU,EAAE,UAAU,EAAE,WAAW,EAAE,eAAe,EAAE,UAAU,CAAC,CAAC;QAC3G,yGAAyG;QACzG,4EAA4E;QAC5E,IAAI,WAAW,EAAE,MAAM,KAAK,eAAe;YACzC,aAAa,CAAC,uCAAuC,CAAC,UAAU,EAAE,cAAc,EAAE,GAAG,EAAE,UAAU,CAAC,CAAC;QACrG,4EAA4E;QAC5E,IAAI,UAAU,EAAE,MAAM,KAAK,cAAc;YACvC,aAAa,CAAC,uCAAuC,CAAC,WAAW,EAAE,eAAe,EAAE,GAAG,EAAE,UAAU,CAAC,CAAC;IACzG,CAAC;IACD,qFAAqF;IAC9E,MAAM,CAAC,2BAA2B,CACvC,GAAyB,EACzB,QAAmB,EACnB,UAA0C,EAC1C,WAA2C,EAC3C,UAA6C;QAE7C,IAAI,UAAU,KAAK,SAAS;YAC1B,UAAU,GAAG,IAAI,2CAAqB,EAAE,CAAC;QAC3C,IAAI,aAAa,GAAG,CAAC,UAAU,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC;QAClD,IAAI,YAAY,GAAuB,EAAE,CAAC;QAC1C,IAAI,gBAAgB,GAAuB,EAAE,CAAC;QAC9C,IAAI,iBAAiB,GAAuB,EAAE,CAAC;QAC/C,MAAM,cAAc,GAAuB,EAAE,CAAC;QAC9C,MAAM,eAAe,GAAuB,EAAE,CAAC;QAC/C,IAAI,KAAK,CAAC;QACV,kBAAkB;QAClB,wDAAwD;QACxD,mDAAmD;QACnD,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;YACzB,IAAI,CAAC,CAAC,iBAAiB,EAAE,CAAC;gBACxB,oDAAoD;gBACpD,OAAO,SAAS,KAAK,CAAC,KAAK,GAAG,YAAY,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC;oBAClD,CAAC,CAAC,iBAAiB,CAAC,KAAK,EAAE,cAAc,EAAE,eAAe,EAAE,UAAU,CAAC,CAAC;oBACxE,mBAAmB,CAAC,cAAc,CAAC,SAAS,EAAE,cAAc,EAAE,gBAAgB,EAAE,iBAAiB,EAAE,SAAS,EAAE,UAAU,CAAC,CAAC;oBAC1H,mBAAmB,CAAC,cAAc,CAAC,QAAQ,EAAE,eAAe,EAAE,gBAAgB,EAAE,iBAAiB,EAAE,SAAS,EAAE,UAAU,CAAC,CAAC;oBAC1H,UAAU,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;gBAChC,CAAC;gBACD,oDAAoD;gBACpD,OAAO,SAAS,KAAK,CAAC,KAAK,GAAG,aAAa,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC;oBACnD,CAAC,CAAC,iBAAiB,CAAC,KAAK,EAAE,cAAc,EAAE,eAAe,EAAE,UAAU,CAAC,CAAC;oBACxE,mBAAmB,CAAC,cAAc,CAAC,QAAQ,EAAE,cAAc,EAAE,gBAAgB,EAAE,iBAAiB,EAAE,SAAS,EAAE,UAAU,CAAC,CAAC;oBACzH,mBAAmB,CAAC,cAAc,CAAC,SAAS,EAAE,eAAe,EAAE,gBAAgB,EAAE,iBAAiB,EAAE,SAAS,EAAE,UAAU,CAAC,CAAC;oBAC3H,UAAU,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;gBAChC,CAAC;gBACD,6BAA6B;gBAC7B,MAAM,KAAK,GAAG,YAAY,CAAC;gBAAC,YAAY,GAAG,gBAAgB,CAAC;gBAAC,gBAAgB,GAAG,KAAK,CAAC;gBACtF,MAAM,KAAK,GAAG,aAAa,CAAC;gBAAC,aAAa,GAAG,iBAAiB,CAAC;gBAAC,iBAAiB,GAAG,KAAK,CAAC;YAC5F,CAAC;QACH,CAAC;QACD,gDAAgD;QAChD,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC;YAC5B,UAAU,EAAE,IAAI,CAAC,UAAU,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC;aAC3C,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC;YACjC,WAAW,EAAE,IAAI,CAAC,UAAU,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC;aAC5C,CAAC;YACJ,aAAa,CAAC,YAAY,EAAE,UAAU,EAAE,UAAU,CAAC,CAAC;YACpD,aAAa,CAAC,aAAa,EAAE,WAAW,EAAE,UAAU,CAAC,CAAC;QACxD,CAAC;IACH,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,wBAAwB,CAAC,OAA2B;QAChE,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;QAC9B,MAAM,QAAQ,GAAG,eAAO,CAAC,UAAU,EAAE,CAAC;QACtC,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;QACxB,MAAM,WAAW,GAAyB,EAAE,CAAC;QAC7C,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;YACvB,MAAM,QAAQ,GAAG,uCAAkB,CAAC,WAAW,EAAE,CAAC;YAClD,QAAQ,CAAC,mBAAmB,CAAC,CAAC,CAAC,YAAY,EAAE,CAAC,CAAC;YAC/C,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC7B,CAAC;QACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC/B,MAAM,GAAG,GAAG,2BAAY,CAAC,yBAAyB,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;gBACzE,IAAI,GAAG,EAAE,CAAC;oBACR,IAAI,OAAO,CAAC,sBAAsB,CAAC,GAAG,EAAE,QAAQ,CAAC,EAAE,CAAC;wBAClD,kEAAkE;wBAClE,MAAM,SAAS,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC;wBAC7E,MAAM,MAAM,GAAG,qBAAS,CAAC,oBAAoB,CAAC,SAAS,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;wBACrE,IAAI,MAAM,EAAE,CAAC;4BACX,MAAM,MAAM,GAAG,MAAM,CAAC,YAAY,EAAE,CAAC;4BACrC,WAAW,CAAC,CAAC,CAAC,CAAC,mBAAmB,CAAC,MAAM,CAAC,CAAC;4BAC3C,WAAW,CAAC,CAAC,CAAC,CAAC,mBAAmB,CAAC,MAAM,CAAC,CAAC;wBAC7C,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,uDAA0B,CAAC,gBAAgB,CAAC,WAAW,CAAC,CAAC;IAClE,CAAC;IACD;;;;;;;;;OASG;IACI,MAAM,CAAC,kDAAkD,CAC9D,UAAsB,EAAE,aAA6B,EAAE,cAAsB,mBAAQ,CAAC,mBAAmB,EAAE,WAA0B;QAErI,MAAM,OAAO,GAAG,iBAAO,CAAC,oBAAoB,CAAC,UAAU,EAAE,aAAa,EAAE,WAAW,EAAE,WAAW,CAAC,CAAC;QAClG,IAAI,CAAC,OAAO;YACV,OAAO,SAAS,CAAC;QACnB,MAAM,UAAU,GAAG,OAAO,CAAC,wBAAwB,CAAC,UAAU,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QAChF,IAAI,UAAU,KAAK,SAAS,IAAI,UAAU,CAAC,MAAM,KAAK,UAAU,CAAC,QAAQ,CAAC,MAAM;YAC9E,OAAO,SAAS,CAAC;QACnB,OAAO,OAAO,CAAC,qCAAqC,CAAC,UAAU,CAAC,CAAC;IACnE,CAAC;;AAz9BH,sCA09BC;AACD,SAAS,aAAa,CACpB,SAA6B,EAC7B,WAA2C,EAC3C,UAAiC;IAEjC,IAAI,WAAW,KAAK,SAAS;QAC3B,UAAU,CAAC,cAAc,CAAC,SAAS,CAAC,CAAC;SAClC,CAAC;QACJ,KAAK,MAAM,CAAC,IAAI,SAAS;YACvB,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACxB,CAAC;IACD,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC;AACvB,CAAC;AACD;;;;;;;;;GASG;AACH,SAAS,mBAAmB,CAC1B,MAAsB,EACtB,SAA6B,EAC7B,UAA0C,EAC1C,WAA2C,EAC3C,cAA8C,EAC9C,UAAiC;IAEjC,IAAI,WAAW,CAAC;IAChB,IAAI,MAAM,KAAK,cAAc,CAAC,QAAQ;QACpC,WAAW,GAAG,UAAU,CAAC;SACtB,IAAI,MAAM,KAAK,cAAc,CAAC,SAAS;QAC1C,WAAW,GAAG,WAAW,CAAC;SACvB,IAAI,MAAM,KAAK,cAAc,CAAC,cAAc;QAC/C,WAAW,GAAG,cAAc,CAAC;IAC/B,4EAA4E;IAC5E,IAAI,WAAW,KAAK,SAAS;QAC3B,UAAU,CAAC,cAAc,CAAC,SAAS,CAAC,CAAC;SAClC,CAAC;QACJ,KAAK,MAAM,CAAC,IAAI,SAAS;YACvB,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACxB,CAAC;IACD,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC;AACvB,CAAC","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n/** @packageDocumentation\n * @module CartesianGeometry\n */\n\nimport { assert } from \"@itwin/core-bentley\";\nimport { Arc3d } from \"../curve/Arc3d\";\nimport { BagOfCurves, CurveChain } from \"../curve/CurveCollection\";\nimport { CurveFactory } from \"../curve/CurveFactory\";\nimport { AnnounceNumberNumber, AnnounceNumberNumberCurvePrimitive, CurvePrimitive } from \"../curve/CurvePrimitive\";\nimport { AnyCurve, AnyRegion } from \"../curve/CurveTypes\";\nimport { GeometryQuery } from \"../curve/GeometryQuery\";\nimport { LineSegment3d } from \"../curve/LineSegment3d\";\nimport { LineString3d } from \"../curve/LineString3d\";\nimport { Loop } from \"../curve/Loop\";\nimport { Path } from \"../curve/Path\";\nimport { RegionBinaryOpType, RegionOps } from \"../curve/RegionOps\";\nimport { StrokeOptions } from \"../curve/StrokeOptions\";\nimport { UnionRegion } from \"../curve/UnionRegion\";\nimport { Geometry } from \"../Geometry\";\nimport { FrameBuilder } from \"../geometry3d/FrameBuilder\";\nimport { GrowableFloat64Array } from \"../geometry3d/GrowableFloat64Array\";\nimport { GrowableXYZArray } from \"../geometry3d/GrowableXYZArray\";\nimport { IndexedXYZCollection } from \"../geometry3d/IndexedXYZCollection\";\nimport { Plane3dByOriginAndUnitNormal } from \"../geometry3d/Plane3dByOriginAndUnitNormal\";\nimport { Point3dArrayCarrier } from \"../geometry3d/Point3dArrayCarrier\";\nimport { Point3d, Vector3d } from \"../geometry3d/Point3dVector3d\";\nimport { Range1d, Range3d } from \"../geometry3d/Range\";\nimport { GrowableXYZArrayCache } from \"../geometry3d/ReusableObjectCache\";\nimport { Transform } from \"../geometry3d/Transform\";\nimport { LowAndHighXY, XAndY } from \"../geometry3d/XYZProps\";\nimport { PolyfaceBuilder } from \"../polyface/PolyfaceBuilder\";\nimport { Voronoi } from \"../topology/Voronoi\";\nimport { ClipPlane } from \"./ClipPlane\";\nimport { ClipPrimitive } from \"./ClipPrimitive\";\nimport { ClipVector } from \"./ClipVector\";\nimport { ConvexClipPlaneSet } from \"./ConvexClipPlaneSet\";\nimport { LineStringOffsetClipperContext } from \"./internalContexts/LineStringOffsetClipperContext\";\nimport { UnionOfConvexClipPlaneSets } from \"./UnionOfConvexClipPlaneSets\";\n\n/**\n * Enumerated type for describing where geometry lies with respect to clipping planes.\n * @public\n */\nexport enum ClipPlaneContainment {\n  /** All points inside. */\n  StronglyInside = 1,\n  /** Inside/outside state unknown. */\n  Ambiguous = 2,\n  /** All points outside. */\n  StronglyOutside = 3,\n}\n/**\n * Enumeration of ways to handle an intermediate fragment from a clipping step.\n * @public\n */\nexport enum ClipStepAction {\n  /** Pass fragments directly to final accepted \"in\" state. */\n  acceptIn = 1,\n  /** Pass fragments directly to final accepted \"out\" state. */\n  acceptOut = -1,\n  /** Forward fragments to subsequent steps. */\n  passToNextStep = 0,\n}\n\n/**\n * Enumerated type for describing what must yet be done to clip a piece of geometry.\n * @public\n */\nexport enum ClipStatus {\n  /** Some geometry may cross the clip boundaries */\n  ClipRequired,\n  /** Geometry is clearly outside */\n  TrivialReject,\n  /** Geometry is clearly inside */\n  TrivialAccept,\n}\n\n/**\n * An object containing clipping planes that can be used to clip geometry.\n * @public\n */\nexport interface Clipper {\n  /** Test if `point` is on or inside the Clipper's volume. */\n  isPointOnOrInside(point: Point3d, tolerance?: number): boolean;\n  /**\n   * Find the parts of the line segment (if any) that is within the convex clip volume.\n   * * The line segment is defined by `pointA` and `pointB`.\n   * * The input fractional interval from `fraction0` to `fraction1` (increasing) is the active part to consider.\n   * * To clip to the usual bounded line segment, start with fractions (0,1).\n   * If the clip volume is unbounded, the line interval may also be unbounded.\n   * * An unbounded line portion will have fraction coordinates positive or negative `Number.MAX_VALUE`.\n   * @param f0 fraction that is the initial lower fraction of the active interval (e.g., 0.0 for bounded segment).\n   * @param f1 fraction that is the initial upper fraction of the active interval (e.g., 1.0 for bounded segment).\n   * @param pointA segment start (fraction 0)\n   * @param pointB segment end (fraction 1)\n   * @param announce function to be called to announce a fraction interval that is within the convex clip volume.\n   * @returns true if a segment was announced, false if entirely outside.\n   */\n  announceClippedSegmentIntervals(\n    f0: number, f1: number, pointA: Point3d, pointB: Point3d, announce?: AnnounceNumberNumber\n  ): boolean;\n  /**\n   * Find the portion (or portions) of the arc (if any) that are within the convex clip volume.\n   * @param arc the arc to be clipped.\n   * @param announce function to be called to announce a fraction intervals that are within the convex clip volume.\n   * @returns true if one or more arcs portions were announced, false if entirely outside.\n   */\n  announceClippedArcIntervals(arc: Arc3d, announce?: AnnounceNumberNumberCurvePrimitive): boolean;\n  /**\n   * Optional polygon clip method.\n   * * This is expected to be implemented by planar clip structures.\n   * * This is unimplemented for curve clippers (e.g. sphere) for which polygon clip result has curved edges.\n   * * The input polygon must be convex.\n   */\n  appendPolygonClip?: AppendPolygonClipFunction;\n}\n/**\n * Signature of method to execute polygon clip, distributing fragments of xyz among insideFragments and outsideFragments\n * @param xyz convex polygon. This is not changed.\n * @param insideFragments Array to receive \"inside\" fragments. Each fragment is a GrowableXYZArray grabbed from\n * the cache. This is NOT cleared.\n * @param outsideFragments Array to receive \"outside\" fragments. Each fragment is a GrowableXYZArray grabbed from\n * the cache. This is NOT cleared.\n * @param arrayCache cache for reusable GrowableXYZArray.\n */\ntype AppendPolygonClipFunction = (\n  xyz: IndexedXYZCollection,\n  insideFragments: GrowableXYZArray[],\n  outsideFragments: GrowableXYZArray[],\n  arrayCache: GrowableXYZArrayCache\n) => void;\n\n/**\n * Interface for clipping convex polygons.\n * Supported by:\n * * AlternatingCCTreeNode\n * * ConvexClipPlaneSet\n * @public\n */\nexport interface PolygonClipper {\n  appendPolygonClip: AppendPolygonClipFunction;\n}\n/**\n * Class whose various static methods are functions for clipping geometry\n * @public\n */\nexport class ClipUtilities {\n  // on-demand scratch objects for method implementations. If you use one, make sure it isn't already being used in scope.\n  private static _workTransform?: Transform;\n  private static _workRange?: Range3d;\n  private static _workClipper?: ConvexClipPlaneSet;\n\n  private static _selectIntervals01TestPoint = Point3d.create();\n  /**\n   * Augment the unsortedFractionsArray with 0 and 1\n   * * sort\n   * * test the midpoint of each interval with `clipper.isPointOnOrInside`\n   * * pass accepted intervals to `announce(f0,f1,curve)`\n   */\n  public static selectIntervals01(\n    curve: CurvePrimitive,\n    unsortedFractions: GrowableFloat64Array,\n    clipper: Clipper,\n    announce?: AnnounceNumberNumberCurvePrimitive,\n  ): boolean {\n    unsortedFractions.push(0);\n    unsortedFractions.push(1);\n    unsortedFractions.sort();\n    let f0 = unsortedFractions.atUncheckedIndex(0);\n    let f1;\n    let fMid;\n    const testPoint = ClipUtilities._selectIntervals01TestPoint;\n    const n = unsortedFractions.length;\n    for (let i = 1; i < n; i++) {\n      f1 = unsortedFractions.atUncheckedIndex(i);\n      if (f1 > f0 + Geometry.smallFraction) {\n        fMid = 0.5 * (f0 + f1);\n        if (fMid >= 0.0 && fMid <= 1.0) {\n          curve.fractionToPoint(fMid, testPoint);\n          if (clipper.isPointOnOrInside(testPoint)) {\n            if (announce)\n              announce(f0, f1, curve);\n            else\n              return true;\n          }\n        }\n        f0 = f1;\n      }\n    }\n    return false;\n  }\n  /**\n   * Announce triples of (low, high, cp) for each entry in intervals.\n   * @param intervals source array\n   * @param cp CurvePrimitive for announcement\n   * @param announce function to receive data\n   */\n  public static announceNNC(\n    intervals: Range1d[], cp: CurvePrimitive, announce?: AnnounceNumberNumberCurvePrimitive,\n  ): boolean {\n    if (announce) {\n      for (const ab of intervals) {\n        announce(ab.low, ab.high, cp);\n      }\n    }\n    return intervals.length > 0;\n  }\n  /**\n   * Compute and return portions of the input curve that are within the clipper.\n   * @param curve input curve, unmodified\n   * @param clipper used to compute the clipped components\n   * @return array of clipped curves\n   */\n  public static collectClippedCurves(curve: CurvePrimitive, clipper: Clipper): CurvePrimitive[] {\n    const result: CurvePrimitive[] = [];\n    curve.announceClipIntervals(\n      clipper,\n      (fraction0: number, fraction1: number, curveA: CurvePrimitive) => {\n        if (fraction1 !== fraction0) {\n          const partialCurve = curveA.clonePartialCurve(fraction0, fraction1);\n          if (partialCurve)\n            result.push(partialCurve);\n        }\n      },\n    );\n    return result;\n  }\n  /**\n   * Compute and return the portions of the input region that are within the clipper.\n   * @param region input region, unmodified\n   * @param clipper used to compute the clipped components\n   * @return clipped subregion, as a single `AnyRegion`\n   */\n  public static clipAnyRegion(region: AnyRegion, clipper: Clipper): AnyRegion | undefined {\n    let result: UnionRegion | undefined;\n    const localToWorld = ClipUtilities._workTransform = FrameBuilder.createRightHandedFrame(undefined, region, ClipUtilities._workTransform);\n    if (!localToWorld)\n      return result;\n    const worldToLocal = localToWorld?.inverse();\n    if (!worldToLocal)\n      return result;\n    const localRegion = region.cloneTransformed(worldToLocal) as AnyRegion; // parallel to xy-plane so we can ignore z\n    if (!localRegion)\n      return result;\n    // We can only clip convex polygons with our clipper machinery, but the input region doesn't have to be\n    // convex or even a polygon. We get around this limitation by using a Boolean operation, which admits\n    // *any* planar regions, albeit in local coordinates. First, we clip a rectangle that covers the input region\n    // (in world coordinates), then we intersect the resulting fragments with the input region in local coordinates.\n    // Finally, we assemble the results into a UnionRegion back in world coordinates.\n    const localRegionRange = ClipUtilities._workRange = localRegion.range();\n    const xLength = localRegionRange.xLength();\n    const yLength = localRegionRange.yLength();\n    const rectangle = LineString3d.createRectangleXY(localRegionRange.low, xLength, yLength, true);\n    rectangle.tryTransformInPlace(localToWorld);\n    // Clip the rectangle to produce fragment(s) which we can Boolean intersect with the input region.\n    const insideFragments: GrowableXYZArray[] = [];\n    const outsideFragments: GrowableXYZArray[] = [];\n    const cache = new GrowableXYZArrayCache();\n    clipper.appendPolygonClip?.(rectangle.packedPoints, insideFragments, outsideFragments, cache);\n    if (insideFragments.length === 0)\n      return result;\n    // Create the \"clipped region\".\n    for (const fragment of insideFragments) {\n      const loop = Loop.createPolygon(fragment);\n      loop.tryTransformInPlace(worldToLocal);\n      const clippedLocalRegion = RegionOps.regionBooleanXY(localRegion, loop, RegionBinaryOpType.Intersection);\n      if (clippedLocalRegion) {\n        clippedLocalRegion.tryTransformInPlace(localToWorld);\n        if (!result)\n          result = (clippedLocalRegion instanceof UnionRegion) ? clippedLocalRegion : UnionRegion.create(clippedLocalRegion);\n        if (clippedLocalRegion instanceof UnionRegion)\n          result.children.push(...clippedLocalRegion.children); // avoid nested UnionRegions\n        else\n          result.tryAddChild(clippedLocalRegion);\n      }\n    }\n    return result ? RegionOps.simplifyRegion(result) : undefined;\n  }\n  /**\n   * Compute and return portions of the input curve or region that are within the clipper.\n   * @param curve input curve or region, unmodified\n   * @param clipper used to compute the clipped components\n   * @return array of clipped components of the input curve or region that lie inside the clipper\n   */\n  public static clipAnyCurve(curve: AnyCurve, clipper: Clipper): AnyCurve[] {\n    if (curve instanceof CurvePrimitive)\n      return ClipUtilities.collectClippedCurves(curve, clipper);\n    if (curve.isAnyRegion()) {\n      const ret = ClipUtilities.clipAnyRegion(curve, clipper);\n      return ret ? [ret] : [];\n    }\n    const result: AnyCurve[] = [];\n    if (curve instanceof Path || curve instanceof BagOfCurves) {\n      for (const child of curve.children) {\n        const partialClip = ClipUtilities.clipAnyCurve(child, clipper);\n        result.push(...partialClip);\n      }\n    }\n    return result;\n  }\n  /**\n   * Clip a polygon down to regions defined by each shape of a ClipShape.\n   * @return An multidimensional array of points, where each array is the boundary of part of the remaining polygon.\n   */\n  public static clipPolygonToClipShape(polygon: Point3d[], clipShape: ClipPrimitive): Point3d[][] {\n    const outputA = this.clipPolygonToClipShapeReturnGrowableXYZArrays(polygon, clipShape);\n    const output = [];\n    for (const g of outputA)\n      output.push(g.getPoint3dArray());\n    return output;\n  }\n  /**\n   * Clip a polygon down to regions defined by each shape of a ClipShape.\n   * @return An multidimensional array of points, where each array is the boundary of part of the remaining polygon.\n   */\n  public static clipPolygonToClipShapeReturnGrowableXYZArrays(\n    polygon: Point3d[], clipShape: ClipPrimitive,\n  ): GrowableXYZArray[] {\n    const output: GrowableXYZArray[] = [];\n    const clipper = clipShape.fetchClipPlanesRef();\n    // NEEDS WORK -- what if it is a mask !!!!\n    if (clipper) {\n      clipper.polygonClip(polygon, output);\n    }\n    return output;\n  }\n  /**\n   * Given an array of points, test for trivial containment conditions.\n   * * ClipStatus.TrivialAccept if all points are in any one of the convexSet's.\n   * * ClipStatus.ClipRequired if (in any single convexSet) there were points on both sides of any single plane.\n   * * ClipStatus.TrivialReject if neither of those occurred.\n   */\n  public static pointSetSingleClipStatus(\n    points: GrowableXYZArray, planeSet: UnionOfConvexClipPlaneSets, tolerance: number,\n  ): ClipStatus {\n    if (planeSet.convexSets.length === 0)\n      return ClipStatus.TrivialAccept;\n\n    for (const convexSet of planeSet.convexSets) {\n      let allOutsideSinglePlane = false, anyOutside = false;\n\n      for (const plane of convexSet.planes) {\n        let numInside = 0, numOutside = 0;\n        const planeDistance = plane.distance - tolerance;\n\n        const currPt = Point3d.create();\n        const currVec = Vector3d.create();\n        for (let i = 0; i < points.length; i++) {\n          points.getPoint3dAtUncheckedPointIndex(i, currPt);\n          currVec.setFrom(currPt);\n          currVec.dotProduct(plane.inwardNormalRef) > planeDistance ? numInside++ : numOutside++;\n        }\n\n        anyOutside = (numOutside !== 0) ? true : anyOutside;\n        if (numInside === 0) {\n          allOutsideSinglePlane = true;\n          break;\n        }\n      }\n\n      if (!anyOutside)  // totally inside this set - no clip required\n        return ClipStatus.TrivialAccept;\n      if (!allOutsideSinglePlane)\n        return ClipStatus.ClipRequired;\n    }\n    return ClipStatus.TrivialReject;\n  }\n  /**\n   * Emit point loops for intersection of a convex set with a range.\n   * * return zero length array for (a) null range or (b) no intersections\n   * @param range range to intersect\n   * @param includeConvexSetFaces if false, do not compute facets originating as convex set planes.\n   * @param includeRangeFaces if false, do not compute facets originating as range faces\n   * @param ignoreInvisiblePlanes if true, do NOT compute a facet for convex set faces marked invisible.\n   */\n  public static announceLoopsOfConvexClipPlaneSetIntersectRange(\n    convexSet: ConvexClipPlaneSet | ClipPlane,\n    range: Range3d,\n    loopFunction: (loopPoints: GrowableXYZArray) => void,\n    includeConvexSetFaces: boolean = true,\n    includeRangeFaces: boolean = true,\n    ignoreInvisiblePlanes = false,\n  ): void {\n    const work = new GrowableXYZArray();\n    if (includeConvexSetFaces) {\n      // Clip convexSet planes to the range and to the rest of the convexSet . .\n      if (convexSet instanceof ConvexClipPlaneSet) {\n        for (const plane of convexSet.planes) {\n          if (ignoreInvisiblePlanes && plane.invisible)\n            continue;\n          const pointsClippedToRange = plane.intersectRange(range, true);\n          const finalPoints = new GrowableXYZArray();\n          if (pointsClippedToRange) {\n            convexSet.polygonClip(pointsClippedToRange, finalPoints, work, plane);\n            if (finalPoints.length > 0)\n              loopFunction(finalPoints);\n          }\n        }\n      } else {  // `convexSet` is just one plane ...\n        if (ignoreInvisiblePlanes && convexSet.invisible) {\n          // skip it !\n        } else {\n          const pointsClippedToRange = convexSet.intersectRange(range, true);\n          if (pointsClippedToRange)\n            loopFunction(pointsClippedToRange);\n        }\n      }\n    }\n\n    if (includeRangeFaces) {\n      // clip range faces to the convex set . . .\n      const corners = range.corners();\n      for (let i = 0; i < 6; i++) {\n        const indices = Range3d.faceCornerIndices(i);\n        const finalPoints = new GrowableXYZArray();\n        const lineString = LineString3d.createIndexedPoints(corners, indices);\n        if (convexSet instanceof ConvexClipPlaneSet) {\n          convexSet.polygonClip(lineString.packedPoints, finalPoints, work);\n          if (finalPoints.length > 0)\n            loopFunction(finalPoints);\n        } else {\n          convexSet.clipConvexPolygonInPlace(lineString.packedPoints, work);\n          if (lineString.packedPoints.length > 0)\n            loopFunction(lineString.packedPoints);\n        }\n      }\n    }\n  }\n  /**\n   * Return a (possibly empty) array of geometry (Loops !!) which are facets of the intersection of the convex set\n   * intersecting a range.\n   * * Return zero length array for (a) null range or (b) no intersections\n   * @param allClippers convex or union clipper\n   * @param range range to intersect\n   * @param includeConvexSetFaces if false, do not compute facets originating as convex set planes.\n   * @param includeRangeFaces if false, do not compute facets originating as range faces\n   * @param ignoreInvisiblePlanes if true, do NOT compute a facet for convex set faces marked invisible.\n   */\n  public static loopsOfConvexClipPlaneIntersectionWithRange(\n    allClippers: ConvexClipPlaneSet | UnionOfConvexClipPlaneSets | ClipPlane,\n    range: Range3d,\n    includeConvexSetFaces: boolean = true,\n    includeRangeFaces: boolean = true,\n    ignoreInvisiblePlanes = false,\n  ): GeometryQuery[] {\n    const result: GeometryQuery[] = [];\n    if (allClippers instanceof UnionOfConvexClipPlaneSets) {\n      for (const clipper of allClippers.convexSets) {\n        this.announceLoopsOfConvexClipPlaneSetIntersectRange(clipper, range,\n          (points: GrowableXYZArray) => {\n            if (points.length > 0) result.push(Loop.createPolygon(points));\n          },\n          includeConvexSetFaces, includeRangeFaces, ignoreInvisiblePlanes);\n      }\n    } else if (allClippers instanceof ConvexClipPlaneSet || allClippers instanceof ClipPlane) {\n      this.announceLoopsOfConvexClipPlaneSetIntersectRange(allClippers, range,\n        (points: GrowableXYZArray) => {\n          if (points.length > 0) result.push(Loop.createPolygon(points));\n        },\n        includeConvexSetFaces, includeRangeFaces, ignoreInvisiblePlanes);\n    }\n    return result;\n  }\n  /**\n   * Return the (possibly null) range of the intersection of the convex set with a range.\n   * * The convex set is permitted to be unbounded (e.g. a single plane).  The range parameter provides bounds.\n   * @param convexSet convex set for intersection.\n   * @param range range to intersect\n   */\n  public static rangeOfConvexClipPlaneSetIntersectionWithRange(convexSet: ConvexClipPlaneSet, range: Range3d): Range3d {\n    const result = Range3d.createNull();\n    this.announceLoopsOfConvexClipPlaneSetIntersectRange(convexSet, range,\n      (points: GrowableXYZArray) => {\n        if (points.length > 0) result.extendArray(points);\n      },\n      true, true, false);\n    return result;\n  }\n  /**\n   * Return the range of various types of clippers\n   * * `ConvexClipPlaneSet` -- dispatch to `rangeOfConvexClipPlaneSetIntersectionWithRange`\n   * * `UnionOfConvexClipPlaneSet` -- union of ranges of member `ConvexClipPlaneSet`\n   * * `ClipPrimitive` -- access its `UnionOfConvexClipPlaneSet`.\n   * * `ClipVector` -- intersection of the ranges of its `ClipPrimitive`.\n   * * `undefined` -- entire input range.\n   * * If `observeInvisibleFlag` is false, the \"invisible\" properties are ignored, and this effectively returns the range of the edge work of the members\n   * * If `observeInvisibleFlag` is true, the \"invisible\" properties are observed, and \"invisible\" parts do not restrict the range.\n   * @param clipper\n   * @param range non-null range.\n   * @param observeInvisibleFlag indicates how \"invisible\" bit is applied for ClipPrimitive.\n   */\n  public static rangeOfClipperIntersectionWithRange(\n    clipper: ConvexClipPlaneSet | UnionOfConvexClipPlaneSets | ClipPrimitive | ClipVector | undefined,\n    range: Range3d,\n    observeInvisibleFlag: boolean = true,\n  ): Range3d {\n    if (clipper === undefined)\n      return range.clone();\n    if (clipper instanceof ConvexClipPlaneSet)\n      return this.rangeOfConvexClipPlaneSetIntersectionWithRange(clipper, range);\n    if (clipper instanceof UnionOfConvexClipPlaneSets) {\n      const rangeUnion = Range3d.createNull();\n      for (const c of clipper.convexSets) {\n        const rangeC = this.rangeOfConvexClipPlaneSetIntersectionWithRange(c, range);\n        rangeUnion.extendRange(rangeC);\n      }\n      return rangeUnion;\n    }\n    if (clipper instanceof ClipPrimitive) {\n      if (observeInvisibleFlag && clipper.invisible)\n        return range.clone();\n      return this.rangeOfClipperIntersectionWithRange(clipper.fetchClipPlanesRef(), range);\n    }\n    if (clipper instanceof ClipVector) {\n      const rangeIntersection = range.clone();\n      for (const c of clipper.clips) {\n        if (observeInvisibleFlag && c.invisible) {\n          // trivial range tests do not expose the effects.   Assume the hole allows everything.\n        } else {\n          const rangeC = this.rangeOfClipperIntersectionWithRange(c, range, observeInvisibleFlag);\n          rangeIntersection.intersect(rangeC, rangeIntersection);\n        }\n      }\n      return rangeIntersection;\n\n    }\n    return range.clone();\n  }\n  /**\n   * Test if various types of clippers have any intersection with a range.\n   * * This follows the same logic as `rangeOfClipperIntersectionWithRange` but attempts to exit at earliest point of confirmed intersection\n   * * `ConvexClipPlaneSet` -- dispatch to `doesConvexClipPlaneSetIntersectRange`\n   * * `UnionOfConvexClipPlaneSet` -- union of ranges of member `ConvexClipPlaneSet`\n   * * `ClipPrimitive` -- access its `UnionOfConvexClipPlaneSet`.\n   * * `ClipVector` -- intersection of the ranges of its `ClipPrimitive`.\n   * * `undefined` -- entire input range.\n   * * If `observeInvisibleFlag` is false, the \"invisible\" properties are ignored, and holes do not affect the result.\n   * * If `observeInvisibleFlag` is true, the \"invisible\" properties are observed, and may affect the result.\n   * @param clipper\n   * @param range non-null range.\n   * @param observeInvisibleFlag indicates how \"invisible\" bit is applied for ClipPrimitive.\n   */\n  public static doesClipperIntersectRange(\n    clipper: ConvexClipPlaneSet | UnionOfConvexClipPlaneSets | ClipPrimitive | ClipVector | undefined,\n    range: Range3d,\n    observeInvisibleFlag: boolean = true,\n  ): boolean {\n    if (clipper === undefined)\n      return true;\n\n    if (clipper instanceof ConvexClipPlaneSet)\n      return this.doesConvexClipPlaneSetIntersectRange(clipper, range);\n\n    if (clipper instanceof UnionOfConvexClipPlaneSets) {\n      for (const c of clipper.convexSets) {\n        if (this.doesConvexClipPlaneSetIntersectRange(c, range))\n          return true;\n      }\n      return false;\n    }\n\n    if (clipper instanceof ClipPrimitive) {\n      if (observeInvisibleFlag && clipper.invisible)    // um is there an easy way to detect range-completely-inside?\n        return true;\n      return this.doesClipperIntersectRange(clipper.fetchClipPlanesRef(), range);\n    }\n\n    if (clipper instanceof ClipVector) {\n      const rangeIntersection = range.clone();\n      for (const c of clipper.clips) {\n        if (observeInvisibleFlag && c.invisible) {\n          // trivial range tests do not expose the effects.   Assume the hole allows everything.\n        } else {\n          const rangeC = this.rangeOfClipperIntersectionWithRange(c, range, observeInvisibleFlag);\n          rangeIntersection.intersect(rangeC, rangeIntersection);\n        }\n      }\n      return !rangeIntersection.isNull;\n    }\n    /** If the case statement above is complete for the variant inputs, this is unreachable .. */\n    return false;\n  }\n  /**\n   * Emit point loops for intersection of a convex set with a range.\n   * * return zero length array for (a) null range or (b) no intersections\n   * @param range range to intersect\n   * @param includeConvexSetFaces if false, do not compute facets originating as convex set planes.\n   * @param includeRangeFaces if false, do not compute facets originating as range faces\n   * @param ignoreInvisiblePlanes if true, do NOT compute a facet for convex set faces marked invisible.\n   */\n  public static doesConvexClipPlaneSetIntersectRange(\n    convexSet: ConvexClipPlaneSet,\n    range: Range3d,\n    includeConvexSetFaces: boolean = true,\n    includeRangeFaces: boolean = true,\n    ignoreInvisiblePlanes = false,\n  ): boolean {\n    const work = new GrowableXYZArray();\n    if (includeConvexSetFaces) {\n      // Clip convexSet planes to the range and to the rest of the convexSet . .\n      for (const plane of convexSet.planes) {\n        if (ignoreInvisiblePlanes && plane.invisible)\n          continue;\n        const pointsClippedToRange = plane.intersectRange(range, true);\n        if (pointsClippedToRange) {\n          const finalPoints = new GrowableXYZArray();\n          convexSet.polygonClip(pointsClippedToRange, finalPoints, work, plane);\n          if (finalPoints.length > 0)\n            return true;\n        }\n      }\n    }\n\n    if (includeRangeFaces) {\n      // clip range faces to the convex set . . .\n      const corners = range.corners();\n      for (let i = 0; i < 6; i++) {\n        const indices = Range3d.faceCornerIndices(i);\n        const finalPoints = new GrowableXYZArray();\n        const lineString = LineString3d.createIndexedPoints(corners, indices);\n        convexSet.polygonClip(lineString.packedPoints, finalPoints, work);\n        if (finalPoints.length > 0)\n          return true;\n      }\n    }\n    return false;\n  }\n  /**\n   * Create a clipper from the transformed range.\n   * @param range input range to create clipper from\n   * @param transform how to transform the range (NOTE: applied to the range faces without swelling the range volume)\n   * @param degeneratePoints optionally populated with the 1 or 2 points defining the transformed range if it is degenerate (all points colinear/coincident); otherwise untouched\n   * @returns newly constructed clipper. If no clip planes could be computed, fill `degeneratePoints` and return undefined.\n  */\n  private static createClipperFromTransformedRange3d(range: Range3d, transform: Transform, degeneratePoints?: Point3d[]): ConvexClipPlaneSet | undefined {\n    if (!transform)\n      transform = Transform.createIdentity();\n    const builder = PolyfaceBuilder.create();\n    builder.addTransformedRangeMesh(transform, range);\n    const mesh = builder.claimPolyface();\n    const clipper = this._workClipper = ConvexClipPlaneSet.createConvexPolyface(mesh, this._workClipper).clipper;\n    if (clipper.planes.length > 0)\n      return clipper;\n    // no faces found in the compressed mesh\n    if (degeneratePoints) {\n      assert(mesh.data.point.length <= 2);\n      for (let i = 0; i < 2; ++i) {\n        const point = mesh.data.point.getPoint3dAtCheckedPointIndex(i);\n        if (point)\n          degeneratePoints.push(point);\n      }\n    }\n    return undefined;\n  }\n  /**\n   * Handle pathological cases of range-range intersection, where one of the ranges defines no area or volume (is a line segment or single point).\n   * @param range local range to intersect with the point/segment\n   * @param points isolated local point, or local segment's start and end\n   * @param localToWorld optional transform for output range\n   * @param intersection optional range of the intersection, in world coordinates, or null range if no intersection.\n   * @returns whether the point/segment intersects the range\n   */\n  private static rangeIntersectPointOrSegment(range: Range3d, points: Point3d[], localToWorld?: Transform, intersection?: Range3d): boolean {\n    const announceInterval: AnnounceNumberNumberCurvePrimitive | undefined = intersection ?\n      (f0: number, f1: number, cp: CurvePrimitive) => {\n        intersection.extendPoint(cp.fractionToPoint(f0), localToWorld);\n        intersection.extendPoint(cp.fractionToPoint(f1), localToWorld);\n      } : undefined;\n    let hasIntersection = false;\n    if (points.length > 1) {\n      const segment = LineSegment3d.createCapture(points[0], points[1]);\n      const clipper = ConvexClipPlaneSet.createRange3dPlanes(range);\n      hasIntersection = segment.announceClipIntervals(clipper, announceInterval);\n    } else if (points.length > 0) {\n      hasIntersection = range.containsPoint(points[0]);\n      if (hasIntersection && intersection)\n        intersection.extendPoint(points[0], localToWorld);\n    }\n    return hasIntersection;\n  }\n  /**\n   * Test for intersection of two ranges in different local coordinates.\n   * * Useful for clash detection of elements in iModels, using their stored (tight) local ranges and placement transforms.\n   * @param range0 first range in local coordinates\n   * @param local0ToWorld placement transform for first range\n   * @param range1 second range in local coordinates\n   * @param local1ToWorld placement transform for second range. Assumed to be invertible.\n   * @param range1Margin optional signed local distance to expand/contract the second range before intersection. Positive expands.\n   * @return whether the local ranges are adjacent or intersect. Also returns false if local1ToWorld is singular.\n   */\n  public static doLocalRangesIntersect(\n    range0: Range3d, local0ToWorld: Transform, range1: Range3d, local1ToWorld: Transform, range1Margin?: number,\n  ): boolean {\n    const worldToLocal1 = this._workTransform = local1ToWorld.inverse(this._workTransform);\n    if (!worldToLocal1)\n      return false;\n    let myRange1 = range1;\n    if (range1Margin) {\n      myRange1 = this._workRange = range1.clone(this._workRange);\n      myRange1.expandInPlace(range1Margin);\n    }\n    const degeneratePoints: Point3d[] = [];\n    const local0ToLocal1 = worldToLocal1.multiplyTransformTransform(local0ToWorld, worldToLocal1);\n    // convert range0 into a clipper in local1 coordinates, then intersect with range1\n    const clipper = this.createClipperFromTransformedRange3d(range0, local0ToLocal1, degeneratePoints);\n    if (clipper)\n      return this.doesClipperIntersectRange(clipper, myRange1);\n    return this.rangeIntersectPointOrSegment(myRange1, degeneratePoints, local1ToWorld);\n  }\n  /**\n   * Compute the range of the intersection between two local (e.g., element-aligned) ranges.\n   * @param range0 first range in local coordinates\n   * @param local0ToWorld placement transform for first range\n   * @param range1 second range in local coordinates\n   * @param local1ToWorld placement transform for second range. Assumed to be invertible.\n   * @param result optional pre-allocated range to fill and return\n   * @return range of the intersection (aligned to world axes). Returns null range if local1ToWorld is singular.\n   */\n  public static rangeOfIntersectionOfLocalRanges(range0: Range3d, local0ToWorld: Transform, range1: Range3d, local1ToWorld: Transform, result?: Range3d): Range3d {\n    const myResult = Range3d.createNull(result);\n    const worldToLocal1 = this._workTransform = local1ToWorld.inverse(this._workTransform);\n    if (!worldToLocal1)\n      return myResult;\n    const degeneratePoints: Point3d[] = [];\n    const local0ToLocal1 = worldToLocal1.multiplyTransformTransform(local0ToWorld, worldToLocal1);\n    // convert range0 into a clipper in local1 coordinates, then intersect with range1\n    const clipper = this.createClipperFromTransformedRange3d(range0, local0ToLocal1, degeneratePoints);\n    if (clipper)\n      this.announceLoopsOfConvexClipPlaneSetIntersectRange(clipper, range1, (loopPoints: GrowableXYZArray) => { loopPoints.extendRange(myResult, local1ToWorld); });\n    else\n      this.rangeIntersectPointOrSegment(range1, degeneratePoints, local1ToWorld, myResult);\n    return myResult;\n  }\n  /**\n   * Test if `obj` is a `Clipper` object.\n   * * This is implemented by testing for each of the methods in the `Clipper` interface.\n   */\n  public static isClipper(obj: any): boolean {\n    if (obj) {\n      if (obj.isPointOnOrInside\n        && obj.announceClippedSegmentIntervals\n        && obj.announceClippedArcIntervals)\n        return true;\n    }\n    return false;\n  }\n  /**\n   * Specialized logic for replacing clip fragments by an equivalent singleton.\n   * * If there are baseCount + 1 or fewer fragments, do nothing.\n   * * If there are more than baseCount+1 fragments:\n   *   * drop them all to the cache\n   *   * push a copy of the singleton.\n   * * The use case for this is that a multi-step clipper (e.g. UnionOfConvexClipPlaneSets) may produce many fragments,\n   * and then be able to determine that they really are the original pre-clip polygon unchanged.\n   * * The baseCount+1 case is the case where the entire original singleton is still a singleton and can be left alone.\n   * * Calling this replacer shuffles the original back into the fragment array, and drops the fragments.\n   * * This determination is solely within the logic of the caller.\n   * @param shards array of fragments\n   * @param baseCount original count\n   * @param singleton single array which may be a replacement for multiple fragments\n   * @param cache cache for array management\n   */\n  public static restoreSingletonInPlaceOfMultipleShards(\n    fragments: GrowableXYZArray[] | undefined, baseCount: number, singleton: IndexedXYZCollection, arrayCache: GrowableXYZArrayCache,\n  ): void {\n    if (fragments && fragments.length > baseCount + 1) {\n      while (fragments.length > baseCount) {\n        const f = fragments.pop();\n        arrayCache.dropToCache(f);\n      }\n      fragments.push(arrayCache.grabAndFill(singleton));\n    }\n  }\n  /**\n   * Create a UnionOfConvexClipPlaneSets for a volume defined by a path and offsets.\n   * @param points points along the path.\n   * @param positiveOffsetLeft offset to left.  0 is clip on the path.\n   * @param positiveOffsetRight offset to the right.  0 is clip on the path.\n   * @param z0 z for lower clipping plane.  If undefined, unbounded in positive z\n   * @param z1 z for upper clipping plane.  If undefined, unbounded in negative z.\n   * @alpha\n   */\n  public static createXYOffsetClipFromLineString(\n    points: Point3d[] | IndexedXYZCollection, leftOffset: number, rightOffset: number, z0: number, z1: number,\n  ): UnionOfConvexClipPlaneSets {\n    if (Array.isArray(points)) {\n      return LineStringOffsetClipperContext.createClipBetweenOffsets(\n        new Point3dArrayCarrier(points), leftOffset, rightOffset, z0, z1);\n    }\n    return LineStringOffsetClipperContext.createClipBetweenOffsets(points, leftOffset, rightOffset, z0, z1);\n  }\n  /** If data.length >= minLength threshold, push it to destination; if smaller drop it back to the cache. */\n  public static captureOrDrop(\n    data: GrowableXYZArray, minLength: number, destination: GrowableXYZArray[], cache: GrowableXYZArrayCache,\n  ): void {\n    if (data.length >= minLength)\n      destination.push(data);\n    else\n      cache.dropToCache(data);\n  }\n  /**\n   * Find the portion of a line within a half-plane clip.\n   * * The half-plane clip is to the left of the line from clipA to clipB.\n   * * The original clipped segment has fractions 0 and 1 at respective segment points.\n   * * Caller initializes the interval\n   * * This method reduces the interval size.\n   * * See clipSegmentToCCWTriangleXY for typical use.\n   * @param linePointA First point of clip line\n   * @param linePointB Second point of clip line\n   * @param segmentPoint0 First point of clipped segment\n   * @param segmentPoint1 Second point of clipped segment\n   * @param interval Live interval.\n     * @param absoluteTolerance absolute tolerance for both cross product values to indicate \"on\" the line\n   */\n  public static clipSegmentToLLeftOfLineXY(\n    linePointA: XAndY, linePointB: XAndY, segmentPoint0: XAndY, segmentPoint1: XAndY, interval: Range1d, absoluteTolerance: number = 1.0e-14,\n  ): void {\n    const ux = linePointB.x - linePointA.x;\n    const uy = linePointB.y - linePointA.y;\n    // negative is in positive is out ...\n    const h0 = -(ux * (segmentPoint0.y - linePointA.y) - uy * (segmentPoint0.x - linePointA.x));\n    const h1 = -(ux * (segmentPoint1.y - linePointA.y) - uy * (segmentPoint1.x - linePointA.x));\n    if (h0 < absoluteTolerance && h1 < absoluteTolerance) {\n      // The entire segment is in .....\n      return;\n    }\n    if (h0 * h1 > 0.0) {\n      if (h0 > 0.0)\n        interval.setNull();\n    } else if (h0 * h1 < 0.0) {\n      // strict crossing with safe fraction . . .\n      const fraction = -h0 / (h1 - h0);\n      if (h0 < 0.0) {\n        return interval.intersectRangeXXInPlace(0.0, fraction);\n      } else {\n        return interval.intersectRangeXXInPlace(fraction, 1.0);\n      }\n    } else {\n      // There is an exact hit at one end, possibly non-zero at the other ... the sign of either determines which side is in play\n      // A zero and a zero or negative is entirely in, which does not alter the prior clip.\n      if (h0 > 0.0) {\n        interval.intersectRangeXXInPlace(1.0, 1.0);\n      } else if (h1 > 0.0) {\n        interval.intersectRangeXXInPlace(0.0, 0.0);\n      }\n    }\n  }\n  /**\n   * Clip an interval of a line segment to a triangle.\n   * * Triangle is assumed CCW\n   * @param pointA point of triangle.\n   * @param pointB point of triangle.\n   * @param pointC point of triangle.\n   * @param segment0 start of segment\n   * @param segment1 end of segment\n   * @param interval Pre-initialized interval of live part of segment\n   * @param absoluteTolerance absolute tolerance for begin \"on a line\"\n   */\n  public static clipSegmentToCCWTriangleXY(\n    pointA: XAndY, pointB: XAndY, pointC: XAndY, segment0: XAndY, segment1: XAndY, interval: Range1d, absoluteTolerance: number = 1.0e-14,\n  ): void {\n    if (!interval.isNull) {\n      this.clipSegmentToLLeftOfLineXY(pointA, pointB, segment0, segment1, interval, absoluteTolerance);\n      if (!interval.isNull) {\n        this.clipSegmentToLLeftOfLineXY(pointB, pointC, segment0, segment1, interval, absoluteTolerance);\n        if (!interval.isNull) {\n          this.clipSegmentToLLeftOfLineXY(pointC, pointA, segment0, segment1, interval, absoluteTolerance);\n        }\n      }\n    }\n  }\n  /**\n   * Find the portion of a line within a half-plane clip.\n   * * The half-plane clip is to the left of the line from clipA to clipB.\n   * * The original clipped segment has fractions 0 and 1 at respective segment points.\n   * * Caller initializes the interval\n   * * This method reduces the interval size.\n   * * See clipSegmentToCCWTriangleXY for typical use.\n   * @param linePointA First point of clip line\n   * @param linePointB Second point of clip line\n   * @param segmentPoint0 First point of clipped segment\n   * @param segmentPoint1 Second point of clipped segment\n   * @param interval Live interval.\n     * @param absoluteTolerance absolute tolerance for both cross product values to indicate \"on\" the line\n   */\n  public static clipSegmentBelowPlaneXY(\n    plane: Plane3dByOriginAndUnitNormal, segmentPoint0: XAndY, segmentPoint1: XAndY, interval: Range1d, absoluteTolerance: number = 1.0e-14,\n  ): void {\n    // negative is in positive is out ...\n    const h0 = plane.altitudeXY(segmentPoint0.x, segmentPoint0.y);\n    const h1 = plane.altitudeXY(segmentPoint1.x, segmentPoint1.y);\n    if (h0 < absoluteTolerance && h1 < absoluteTolerance) {\n      // The entire segment is in ..... the interval is unaffected.\n      return;\n    }\n    if (h0 * h1 > 0.0) {\n      if (h0 > 0.0)\n        interval.setNull();\n    } else if (h0 * h1 < 0.0) {\n      // strict crossing with safe fraction . . .\n      const fraction = -h0 / (h1 - h0);\n      if (h0 < 0.0) {\n        return interval.intersectRangeXXInPlace(0.0, fraction);\n      } else {\n        return interval.intersectRangeXXInPlace(fraction, 1.0);\n      }\n    } else {\n      // There is an exact hit at one end, possibly non-zero at the other ... the sign of either determines which side is in play\n      // A zero and a zero or negative is entirely in, which does not alter the prior clip.\n      if (h0 > 0.0) {\n        interval.intersectRangeXXInPlace(1.0, 1.0);\n      } else if (h1 > 0.0) {\n        interval.intersectRangeXXInPlace(0.0, 0.0);\n      }\n    }\n  }\n  /**\n   * Clip an interval of a line segment to an array of planes\n   * * plane normals assumed OUTWARD\n   * * planeAltitude is typically a tolerance a tolerance distance.\n   *   * positive altitude makes tha plane move in the direction of the unit normal.\n   * @param planes array of planes\n   * @param segment0 start of segment\n   * @param segment1 end of segment\n   * @param interval Pre-initialized interval of live part of segment\n   * @param absoluteTolerance absolute tolerance for begin \"on a line\"\n   */\n  public static clipSegmentBelowPlanesXY(\n    planes: Plane3dByOriginAndUnitNormal[], segment0: XAndY, segment1: XAndY, interval: Range1d, signedAltitude: number = 1.0e-14,\n  ): void {\n    const numPlanes = planes.length;\n    for (let i = 0; (!interval.isNull) && i < numPlanes; i++) {\n      this.clipSegmentBelowPlaneXY(planes[i], segment0, segment1, interval, signedAltitude);\n    }\n  }\n  /**\n   * Pass line segments from a polyline to the clipper.  Resolve the fractional clips to simple points for announcement.\n   * @param clipper clipper to call\n   * @param points polyline whose segments are passed to the clipper\n   * @param announce caller's handler for simple point pairs.\n   */\n  public static announcePolylineClip(\n    clipper: Clipper, points: Point3d[], announce: (point0: Point3d, point1: Point3d) => void,\n  ): void {\n    for (let i = 0; i + 1 < points.length; i++) {\n      clipper.announceClippedSegmentIntervals(0, 1, points[i], points[i + 1],\n        (f0: number, f1: number) => {\n          announce(points[i].interpolate(f0, points[i + 1]), points[i].interpolate(f1, points[i + 1]));\n        });\n    }\n  }\n  /**\n   * Pass line segments from a polyline to the clipper.  Sum the lengths of the clipped pieces.  Return the sum.\n   * @param clipper clipper to call\n   * @param points polyline whose segments are passed to the clipper\n   */\n  public static sumPolylineClipLength(clipper: Clipper, points: Point3d[]): number {\n    let s = 0;\n    for (let i = 0; i + 1 < points.length; i++) {\n      const a = points[i].distance(points[i + 1]);\n      clipper.announceClippedSegmentIntervals(0, 1, points[i], points[i + 1],\n        (f0: number, f1: number) => { s += Math.abs(f1 - f0) * a; });\n    }\n    return s;\n  }\n  /**\n   * Pass polygon `xyz` through a sequence of PolygonClip steps.\n   * * At the outset, `xyz` is the (only) entry in a set of candidates.\n   * * For each clipper, each candidate is presented for appendPolygon to inside and outside parts.\n   * * Each (in,out) result is distributed among (acceptedIn, acceptedOut, candidates) according to\n   *      (inAction, outAction)\n   * * At the end, all remaining candidates are distributed among (acceptedIn, acceptedOut, finalUnknown)\n   *     according to finalAction\n   * * Any clipper that does not have an appendPolygonClip method is skipped.\n   * @param xyz\n   * @param clippers\n   * @param acceptedIn\n   * @param acceptedOut\n   * @param finalCandidates\n   * @param inAction\n   * @param outAction\n   * @param finalCandidateAction\n   */\n  public static doPolygonClipSequence(\n    xyz: IndexedXYZCollection,\n    clippers: Clipper[],\n    acceptedIn: GrowableXYZArray[] | undefined,\n    acceptedOut: GrowableXYZArray[] | undefined,\n    finalCandidates: GrowableXYZArray[] | undefined,\n    inAction: ClipStepAction,\n    outAction: ClipStepAction,\n    finalFragmentAction: ClipStepAction,\n    arrayCache: GrowableXYZArrayCache | undefined,\n  ) {\n    if (arrayCache === undefined)\n      arrayCache = new GrowableXYZArrayCache();\n    let candidates = [arrayCache.grabAndFill(xyz)];\n    let nextCandidates: GrowableXYZArray[] = [];\n    const intermediateIn: GrowableXYZArray[] = [];\n    const intermediateOut: GrowableXYZArray[] = [];\n    const oldInsideCount = acceptedIn ? acceptedIn.length : 0;\n    const oldOutsideCount = acceptedOut ? acceptedOut.length : 0;\n    let shard;\n    // At each convex set, carryForwardA is all the fragments that have been outside all previous convex sets.\n    // Clip each such fragment to the current set, sending the outside parts to carryForwardB, which will got to\n    // the next clipper. The final surviving carryForward really is out.\n    for (const c of clippers) {\n      if (c.appendPolygonClip) {\n        while (undefined !== (shard = candidates.pop())) {\n          c.appendPolygonClip(shard, intermediateIn, intermediateOut, arrayCache);\n          distributeFragments(inAction, intermediateIn, acceptedIn, acceptedOut, nextCandidates, arrayCache);\n          distributeFragments(outAction, intermediateOut, acceptedIn, acceptedOut, nextCandidates, arrayCache);\n          arrayCache.dropToCache(shard);\n        }\n        // candidates is empty !!\n        const temp = candidates; candidates = nextCandidates; nextCandidates = temp;\n      }\n    }\n    distributeFragments(finalFragmentAction, candidates, acceptedIn, acceptedOut, finalCandidates, arrayCache);\n    // Note: The following assumes that there were no residual candidates ... need to track if that happened?\n    // If nothing was out, the inside fragments can be replaced by the original.\n    if (acceptedOut?.length === oldOutsideCount)\n      ClipUtilities.restoreSingletonInPlaceOfMultipleShards(acceptedIn, oldInsideCount, xyz, arrayCache);\n    // If nothing was in, the outside fragments can be replaced by the original.\n    if (acceptedIn?.length === oldInsideCount)\n      ClipUtilities.restoreSingletonInPlaceOfMultipleShards(acceptedOut, oldOutsideCount, xyz, arrayCache);\n  }\n  /** Pass polygon `xyz` through a sequence of PolygonClip steps with \"parity\" rules */\n  public static doPolygonClipParitySequence(\n    xyz: IndexedXYZCollection,\n    clippers: Clipper[],\n    acceptedIn: GrowableXYZArray[] | undefined,\n    acceptedOut: GrowableXYZArray[] | undefined,\n    arrayCache: GrowableXYZArrayCache | undefined,\n  ) {\n    if (arrayCache === undefined)\n      arrayCache = new GrowableXYZArrayCache();\n    let candidatesOut = [arrayCache.grabAndFill(xyz)];\n    let candidatesIn: GrowableXYZArray[] = [];\n    let nextCandidatesIn: GrowableXYZArray[] = [];\n    let nextCandidatesOut: GrowableXYZArray[] = [];\n    const intermediateIn: GrowableXYZArray[] = [];\n    const intermediateOut: GrowableXYZArray[] = [];\n    let shard;\n    // at each step ..\n    // candidatesIn and candidatesOut are evolved in and out\n    // nextCandidatesIn and nextCandidatesOut are EMPTY\n    for (const c of clippers) {\n      if (c.appendPolygonClip) {\n        // (IN,OUT) parts of IN parts distribute to (OUT,IN)\n        while (undefined !== (shard = candidatesIn.pop())) {\n          c.appendPolygonClip(shard, intermediateIn, intermediateOut, arrayCache);\n          distributeFragments(ClipStepAction.acceptOut, intermediateIn, nextCandidatesIn, nextCandidatesOut, undefined, arrayCache);\n          distributeFragments(ClipStepAction.acceptIn, intermediateOut, nextCandidatesIn, nextCandidatesOut, undefined, arrayCache);\n          arrayCache.dropToCache(shard);\n        }\n        // (IN,OUT) parts of IN parts distribute to (OUT,IN)\n        while (undefined !== (shard = candidatesOut.pop())) {\n          c.appendPolygonClip(shard, intermediateIn, intermediateOut, arrayCache);\n          distributeFragments(ClipStepAction.acceptIn, intermediateIn, nextCandidatesIn, nextCandidatesOut, undefined, arrayCache);\n          distributeFragments(ClipStepAction.acceptOut, intermediateOut, nextCandidatesIn, nextCandidatesOut, undefined, arrayCache);\n          arrayCache.dropToCache(shard);\n        }\n        // reload each candidate step\n        const tempA = candidatesIn; candidatesIn = nextCandidatesIn; nextCandidatesIn = tempA;\n        const tempB = candidatesOut; candidatesOut = nextCandidatesOut; nextCandidatesOut = tempB;\n      }\n    }\n    // candidatesIn and candidatesOut are final ....\n    if (candidatesOut.length === 0)\n      acceptedIn?.push(arrayCache.grabAndFill(xyz));\n    else if (candidatesOut.length === 0)\n      acceptedOut?.push(arrayCache.grabAndFill(xyz));\n    else {\n      moveFragments(candidatesIn, acceptedIn, arrayCache);\n      moveFragments(candidatesOut, acceptedOut, arrayCache);\n    }\n  }\n  /**\n   * For each plane of clipper, construct a UnionOfConvexClipPlaneSets for an outer (infinite) convex volume that\n   * abuts the outer volume of the neighbor faces.\n   */\n  public static createComplementaryClips(clipper: ConvexClipPlaneSet): UnionOfConvexClipPlaneSets {\n    const planes = clipper.planes;\n    const interval = Range1d.createNull();\n    const n = planes.length;\n    const newClippers: ConvexClipPlaneSet[] = [];\n    for (const p of planes) {\n      const outerSet = ConvexClipPlaneSet.createEmpty();\n      outerSet.addPlaneToConvexSet(p.cloneNegated());\n      newClippers.push(outerSet);\n    }\n    for (let i = 0; i < n; i++) {\n      for (let j = i + 1; j < n; j++) {\n        const ray = CurveFactory.planePlaneIntersectionRay(planes[i], planes[j]);\n        if (ray) {\n          if (clipper.hasIntersectionWithRay(ray, interval)) {\n            // the normal-to-normal vector is bisector (or close to bisector?)\n            const newNormal = planes[j].inwardNormalRef.minus(planes[i].inwardNormalRef);\n            const plane1 = ClipPlane.createNormalAndPoint(newNormal, ray.origin);\n            if (plane1) {\n              const plane2 = plane1.cloneNegated();\n              newClippers[i].addPlaneToConvexSet(plane1);\n              newClippers[j].addPlaneToConvexSet(plane2);\n            }\n          }\n        }\n      }\n    }\n    return UnionOfConvexClipPlaneSets.createConvexSets(newClippers);\n  }\n  /**\n   * Creates clippers for regions closest to the children of a curve chain.\n   * * For best results, each child should have length larger than `distanceTol`.\n   * @param curveChain A curve chain; xy-only (z-coordinate is ignored). Must have at least 2 children.\n   * @param strokeOptions Optional stroke options to control the sampling of the curve chain.\n   * @param distanceTol Optional distance tolerance to use when comparing points; default is [[Geometry.smallMetricDistance]].\n   * @param boundingBox Optional nominal xy-bounding box for the clipper regions; default is maximal clipper regions.\n   * @returns An ordered array of clippers, each of which represents the region closest to the corresponding primitive in the\n   * input chain, or undefined if the input is invalid.\n   */\n  public static createClippersForRegionsClosestToCurvePrimitivesXY(\n    curveChain: CurveChain, strokeOptions?: StrokeOptions, distanceTol: number = Geometry.smallMetricDistance, boundingBox?: LowAndHighXY\n  ): UnionOfConvexClipPlaneSets[] | undefined {\n    const voronoi = Voronoi.createFromCurveChain(curveChain, strokeOptions, distanceTol, boundingBox);\n    if (!voronoi)\n      return undefined;\n    const superFaces = voronoi.computeVoronoiSuperFaces(curveChain.children.length);\n    if (superFaces === undefined || superFaces.length !== curveChain.children.length)\n      return undefined;\n    return voronoi.generateClippersFromVoronoiSuperFaces(superFaces);\n  }\n}\nfunction moveFragments(\n  fragments: GrowableXYZArray[],\n  destination: GrowableXYZArray[] | undefined,\n  arrayCache: GrowableXYZArrayCache,\n) {\n  if (destination === undefined)\n    arrayCache.dropAllToCache(fragments);\n  else {\n    for (const f of fragments)\n      destination.push(f);\n  }\n  fragments.length = 0;\n}\n/**\n * Distribute fragments among acceptedIn, acceptedOut, and passToNextStep as directed by action.\n * * If the indicated destination is unknown, drop the fragments to the arrayCache.\n * @param action destination selector\n * @param fragments fragments to be distributed\n * @param acceptedIn destination for \"in\"\n * @param acceptedOut destination for \"out\"\n * @param passToNextStep destination for fragments to be passed to a later step\n * @param arrayCache destination for un-distributed fragments.\n */\nfunction distributeFragments(\n  action: ClipStepAction,\n  fragments: GrowableXYZArray[],\n  acceptedIn: GrowableXYZArray[] | undefined,\n  acceptedOut: GrowableXYZArray[] | undefined,\n  passToNextStep: GrowableXYZArray[] | undefined,\n  arrayCache: GrowableXYZArrayCache,\n) {\n  let destination;\n  if (action === ClipStepAction.acceptIn)\n    destination = acceptedIn;\n  else if (action === ClipStepAction.acceptOut)\n    destination = acceptedOut;\n  else if (action === ClipStepAction.passToNextStep)\n    destination = passToNextStep;\n  // remark: if action is other than the enum values, destination is undefined\n  if (destination === undefined)\n    arrayCache.dropAllToCache(fragments);\n  else {\n    for (const f of fragments)\n      destination.push(f);\n  }\n  fragments.length = 0;\n}\n"]}

package/lib/cjs/clipping/ClipVector.js.map

@@ -1 +1 @@
-{"version":3,"file":"ClipVector.js","sourceRoot":"","sources":["../../../src/clipping/ClipVector.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F;;GAEG;AAEH,sDAA6C;AAG7C,0DAAuD;AACvD,0CAAuC;AAIvC,+CAA8C;AAG9C,uDAAoD;AAEpD,uDAAgE;AAEhE,mDAAuG;AACvG,2CAA4D;AAS5D;;;;;;GAMG;AACH,MAAa,UAAU;IACb,MAAM,CAAkB;IAChC;;;;;OAKG;IACI,aAAa,GAAY,eAAO,CAAC,UAAU,EAAE,CAAC;IACrD,sDAAsD;IACtD,IAAW,KAAK,KAAK,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IAC1C,YAAoB,KAAuB;QACzC,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;IACnC,CAAC;IACD,gEAAgE;IAChE,IAAW,OAAO,KAAc,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;IAChE,2DAA2D;IACpD,MAAM,CAAC,WAAW,CAAC,MAAmB;QAC3C,IAAI,MAAM,EAAE,CAAC;YACX,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;YACzB,OAAO,MAAM,CAAC;QAChB,CAAC;QACD,OAAO,IAAI,UAAU,EAAE,CAAC;IAC1B,CAAC;IACD,sGAAsG;IAC/F,MAAM,CAAC,aAAa,CAAC,KAAsB,EAAE,MAAmB;QACrE,IAAI,MAAM,EAAE,CAAC;YACX,MAAM,CAAC,MAAM,GAAG,KAAK,CAAC;YACtB,OAAO,MAAM,CAAC;QAChB,CAAC;QACD,OAAO,IAAI,UAAU,CAAC,KAAK,CAAC,CAAC;IAC/B,CAAC;IACD,sEAAsE;IAC/D,MAAM,CAAC,MAAM,CAAC,KAAsB,EAAE,MAAmB;QAC9D,MAAM,UAAU,GAAoB,EAAE,CAAC;QACvC,KAAK,MAAM,IAAI,IAAI,KAAK;YACtB,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC;QAChC,OAAO,UAAU,CAAC,aAAa,CAAC,UAAU,EAAE,MAAM,CAAC,CAAC;IACtD,CAAC;IACD,+CAA+C;IACxC,KAAK,CAAC,MAAmB;QAC9B,MAAM,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,UAAU,EAAE,CAAC;QAClD,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;QACzB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAC/B,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC;QACnC,CAAC;QACD,MAAM,CAAC,aAAa,CAAC,OAAO,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;QACjD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,gDAAgD;IACzC,MAAM;QACX,IAAI,CAAC,IAAI,CAAC,OAAO;YACf,OAAO,EAAE,CAAC;QAEZ,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;IACjD,CAAC;IACD,iDAAiD;IAC1C,MAAM,CAAC,QAAQ,CAAC,IAAiC,EAAE,MAAmB;QAC3E,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,UAAU,EAAE,CAAC;QAC5C,MAAM,CAAC,KAAK,EAAE,CAAC;QACf,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC;YACtB,OAAO,MAAM,CAAC;QAChB,IAAI,CAAC;YACH,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;gBACxB,MAAM,QAAQ,GAAG,6BAAa,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;gBAC9C,IAAI,QAAQ;oBACV,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACjC,CAAC;QACH,CAAC;QAAC,MAAM,CAAC;YACP,MAAM,CAAC,KAAK,EAAE,CAAC;QACjB,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,2CAA2C;IACpC,KAAK;QACV,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;IACzB,CAAC;IACD,wEAAwE;IACjE,WAAW,CAAC,IAAmB;QACpC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC;IACjC,CAAC;IACD,wEAAwE;IACjE,eAAe,CAAC,IAAmB;QACxC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACzB,CAAC;IACD,0HAA0H;IACnH,WAAW,CAAC,KAAgB,EAAE,IAAa,EAAE,KAAc,EAChE,SAAqB,EAAE,SAAkB,KAAK,EAAE,YAAqB,KAAK;QAC1E,MAAM,IAAI,GAAG,yBAAS,CAAC,WAAW,CAAC,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,CAAC,CAAC;QACrF,IAAI,CAAC,IAAI;YACP,OAAO,KAAK,CAAC;QACf,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACvB,OAAO,IAAI,CAAC;IACd,CAAC;IACD,gHAAgH;IACzG,WAAW,CAAC,KAAc,EAAE,cAAsB,mBAAQ,CAAC,0BAA0B;QAC1F,OAAO,IAAI,CAAC,iBAAiB,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC;IACpD,CAAC;IACD;;;OAGG;IACI,iBAAiB,CAAC,KAAc,EAAE,cAAsB,mBAAQ,CAAC,0BAA0B;QAChG,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,aAAa,CAAC,KAAK,CAAC;YACxE,OAAO,KAAK,CAAC;QAEf,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAC/B,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,WAAW,CAAC;gBACvC,OAAO,KAAK,CAAC;QACjB,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IACD,+CAA+C;IACvC,cAAc,CAA+B;IAC7C,mBAAmB;QACzB,IAAI,IAAI,CAAC,cAAc;YACrB,OAAO,IAAI,CAAC;QACd,IAAI,CAAC,cAAc,GAAG,IAAI,6CAA2B,CAAC,IAAI,CAAC,CAAC;QAC5D,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAChC,MAAM,CAAC,GAAG,KAAK,CAAC,kBAAkB,EAAE,CAAC;YACrC,IAAI,CAAC,EAAE,CAAC;gBACN,WAAW,EAAE,CAAC;gBACd,IAAI,CAAC,cAAc,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YACtC,CAAC;QACH,CAAC;QACD,OAAO,WAAW,GAAG,CAAC,CAAC;IACzB,CAAC;IACD;;;OAGG;IACI,+BAA+B,CACpC,EAAU,EAAE,EAAU,EAAE,MAAe,EAAE,MAAe,EAAE,QAA+B;QAEzF,IAAI,CAAC,mBAAmB,EAAE,CAAC;QAC3B,IAAI,IAAI,CAAC,cAAc;YACrB,OAAO,IAAI,CAAC,cAAc,CAAC,+BAA+B,CAAC,EAAE,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC;QAC/F,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;OAEG;IACI,2BAA2B,CAAC,GAAU,EAAE,QAA6C;QAC1F,IAAI,CAAC,mBAAmB,EAAE,CAAC;QAC3B,IAAI,IAAI,CAAC,cAAc;YACrB,OAAO,IAAI,CAAC,cAAc,CAAC,2BAA2B,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;QACxE,OAAO,KAAK,CAAC;IACf,CAAC;IACD,oEAAoE;IAC7D,iBAAiB,CACtB,GAAyB,EACzB,eAAmC,EACnC,gBAAoC,EACpC,UAAiC;QACjC,IAAI,CAAC,mBAAmB,EAAE,CAAC;QAC3B,IAAI,IAAI,CAAC,cAAc;YACrB,IAAI,CAAC,cAAc,CAAC,iBAAiB,CAAC,GAAG,EAAE,eAAe,EAAE,gBAAgB,EAAE,UAAU,CAAC,CAAC;IAC9F,CAAC;IACD;;;;OAIG;IACI,gBAAgB,CAAC,SAAoB;QAC1C,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,MAAM;YAC5B,IAAI,IAAI,CAAC,gBAAgB,CAAC,SAAS,CAAC,KAAK,KAAK;gBAC5C,OAAO,KAAK,CAAC;QAEjB,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,MAAM;YAC5B,SAAS,CAAC,aAAa,CAAC,IAAI,CAAC,aAAa,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC;QAElE,OAAO,IAAI,CAAC;IACd,CAAC;IACD;;;;;;;;;;OAUG;IACI,oBAAoB,CAAC,UAAuB,EAAE,SAAqB;QACxE,IAAI,KAAK,GAAG,sCAAsB,CAAC,IAAI,CAAC;QACxC,IAAI,KAAK,GAAG,CAAC,MAAM,CAAC,SAAS,CAAC;QAC9B,IAAI,MAAM,GAAG,MAAM,CAAC,SAAS,CAAC;QAC9B,MAAM,MAAM,GAAa,EAAE,CAAC;QAC5B,IAAI,MAAM,GAAG,CAAC,CAAC;QAEf,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC;YAC1B,OAAO,MAAM,CAAC;QAChB,IAAI,cAAqC,CAAC;QAC1C,MAAM,UAAU,GAAG,qBAAS,CAAC,cAAc,EAAE,CAAC;QAE9C,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAC/B,IAAI,IAAI,YAAY,yBAAS,EAAE,CAAC;gBAC9B,IAAI,cAAc,KAAK,SAAS,IAAI,IAAI,KAAK,cAAc,EAAE,CAAC,CAAM,6BAA6B;oBAC/F,IAAI,QAAQ,GAAG,qBAAS,CAAC,cAAc,EAAE,CAAC;oBAC1C,IAAI,QAAQ,GAAG,qBAAS,CAAC,cAAc,EAAE,CAAC;oBAE1C,IAAI,cAAc,CAAC,cAAc,IAAI,IAAI,CAAC,cAAc,EAAE,CAAC;wBACzD,QAAQ,GAAG,IAAI,CAAC,iBAAkB,CAAC,KAAK,EAAE,CAAC;wBAC3C,QAAQ,GAAG,cAAc,CAAC,eAAgB,CAAC,KAAK,EAAE,CAAC;oBACrD,CAAC;oBACD,UAAU,CAAC,OAAO,CAAC,QAAQ,CAAC,0BAA0B,CAAC,QAAQ,CAAC,CAAC,CAAC;gBACpE,CAAC;gBACD,IAAI,CAAC,cAAc;oBACjB,cAAc,GAAG,IAAI,CAAC;gBACxB,UAAU,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC;gBAExB,IAAI,IAAI,CAAC,OAAO,KAAK,SAAS,EAAE,CAAC;oBAC/B,KAAK,GAAG,sCAAsB,CAAC,KAAK,CAAC;oBAErC,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;wBACpB,KAAK,GAAG,KAAK,GAAG,sCAAsB,CAAC,KAAK,CAAC;wBAC7C,MAAM,GAAG,IAAI,CAAC,KAAM,CAAC;oBACvB,CAAC;oBACD,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;wBACnB,KAAK,GAAG,KAAK,GAAG,sCAAsB,CAAC,IAAI,CAAC;wBAC5C,KAAK,GAAG,IAAI,CAAC,IAAK,CAAC;oBACrB,CAAC;oBAED,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO;wBAC9B,UAAU,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC;oBACzC,UAAU,CAAC,oBAAoB,CAAC,UAAU,CAAC,MAAM,CAAC,EAAE,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC;oBACxE,MAAM,EAAE,CAAC;gBACX,CAAC;YACH,CAAC;QACH,CAAC;QACD,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACnB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACnB,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACpB,IAAI,SAAS,IAAI,cAAc;YAC7B,SAAS,CAAC,OAAO,CAAC,cAAc,CAAC,iBAAkB,CAAC,CAAC;QACvD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,+EAA+E;IACxE,YAAY,CAAC,SAAkB;QACpC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,MAAM;YAC5B,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC;IACjC,CAAC;IACD;;;OAGG;IACI,eAAe;QACpB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,MAAM;YAC5B,IAAI,CAAC,kBAAkB,EAAE,CAAC;IAC9B,CAAC;IACD;;;;;;;;;;OAUG;IACI,wBAAwB,CAAC,MAAgB,EAAE,SAAkB,IAAI,EAAE,YAAqB,IAAI;QACjG,IAAI,MAAM,EAAE,CAAC,CAAE,+CAA+C;YAC5D,MAAM,OAAO,GAAG,MAAM,CAAC,aAAa,EAAE,CAAC;YACvC,IAAI,CAAC,OAAO;gBACV,OAAO,KAAK,CAAC;YACf,OAAO,IAAI,CAAC,wBAAwB,CAAC,OAAO,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;QAClE,CAAC;QACD,mDAAmD;QACnD,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,MAAM;YAC5B,IAAI,CAAC,wBAAwB,CAAC,MAAM,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;QAC1D,OAAO,IAAI,CAAC;IACd,CAAC;IACD;;;;OAIG;IACI,wBAAwB,CAAC,MAAiB,EAAE,cAAuB,KAAK;QAC7E,IAAI,kBAAkB,GAAG,gCAAoB,CAAC,SAAS,CAAC;QAExD,KAAK,MAAM,SAAS,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YACpC,MAAM,eAAe,GAAG,SAAS,CAAC,wBAAwB,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;YAEhF,IAAI,gCAAoB,CAAC,SAAS,KAAK,eAAe;gBACpD,OAAO,gCAAoB,CAAC,SAAS,CAAC;YAExC,IAAI,gCAAoB,CAAC,SAAS,KAAK,kBAAkB;gBACvD,kBAAkB,GAAG,eAAe,CAAC;iBAClC,IAAI,kBAAkB,KAAK,eAAe;gBAC7C,OAAO,gCAAoB,CAAC,SAAS,CAAC;QAC1C,CAAC;QACD,OAAO,kBAAkB,CAAC;IAC5B,CAAC;IACD;;;OAGG;IACI,wBAAwB,CAAC,KAAc,EAAE,WAAoB;QAClE,MAAM,OAAO,GAAc,KAAK,CAAC,OAAO,EAAE,CAAC;QAC3C,OAAO,IAAI,CAAC,wBAAwB,CAAC,OAAO,EAAE,WAAW,CAAC,CAAC;IAC7D,CAAC;IACD;;;;OAIG;IACI,0BAA0B,CAAC,MAAiB;QACjD,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAC/B,MAAM,YAAY,GAAG,IAAI,CAAC,kBAAkB,EAAE,CAAC;YAC/C,IAAI,YAAY,KAAK,SAAS,EAAE,CAAC;gBAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC3C,MAAM,OAAO,GAAG,6BAAa,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oBAC/D,IAAI,YAAY,CAAC,2BAA2B,CAAC,OAAO,CAAC;wBACnD,OAAO,IAAI,CAAC;gBAChB,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,oGAAoG;IAC7F,QAAQ,CAAC,SAAsB,EAAE,KAAa,EAAE,GAAW;QAChE,IAAI,CAAC,GAAG,GAAG,CAAC;QACZ,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE;YAC9B,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAC3C,OAAO,CAAC,CAAC;IACX,CAAC;IACO,MAAM,CAAU,oBAAoB,GAAG,UAAU,CAAC;IAC1D;;;OAGG;IACI,+BAA+B,CAAC,MAAiB;QACtD,MAAM,aAAa,GAAgB,EAAE,CAAC;QAEtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,MAAM,OAAO,GAAG,6BAAa,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC/D,IAAI,WAAW,GAAG,GAAG,CAAC;YACtB,IAAI,MAAM,GAAG,CAAC,CAAC;YAEf,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;gBAC/B,MAAM,YAAY,GAAG,IAAI,CAAC,kBAAkB,EAAE,CAAC;gBAC/C,IAAI,YAAY,KAAK,SAAS,EAAE,CAAC;oBAC/B,YAAY,CAAC,0BAA0B,CAAC,OAAO,EAAE,aAAa,CAAC,CAAC;oBAChE,MAAM,MAAM,GAAG,aAAa,CAAC,MAAM,CAAC;oBACpC,WAAW,IAAI,IAAI,CAAC,QAAQ,CAAC,aAAa,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;oBAC5D,MAAM,GAAG,MAAM,CAAC;oBAChB,2CAA2C;oBAC3C,IAAI,WAAW,IAAI,UAAU,CAAC,oBAAoB;wBAChD,MAAM;gBACV,CAAC;YACH,CAAC;YACD,IAAI,WAAW,GAAG,UAAU,CAAC,oBAAoB;gBAC/C,OAAO,KAAK,CAAC;QACjB,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IACD;;;;;;;;;;;;;;;;;;;;;OAqBG;IACI,eAAe;QACpB,SAAS,YAAY,CAAC,GAAW;YAC/B,OAAO,GAAG,GAAG,CAAC,QAAQ,EAAE,GAAG,CAAC;QAC9B,CAAC;QACD,SAAS,cAAc,CAAC,GAAa;YACnC,OAAO,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;QAC9E,CAAC;QACD,SAAS,WAAW,CAAC,KAAa;YAChC,MAAM,CAAC,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAC;YAC3B,IAAA,qBAAM,EAAC,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC;YACvB,OAAO,CAAC,CAAC;QACX,CAAC;QACD,SAAS,WAAW,CAAC,KAAgB;YACnC,IAAI,KAAK,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACpC,KAAK,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAClC,OAAO,GAAG,WAAW,CAAC,KAAK,CAAC,GAAG,cAAc,CAAC,KAAK,CAAC,eAAe,CAAC,GAAG,YAAY,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC;QACxG,CAAC;QACD,SAAS,cAAc,CAAC,GAAuB;YAC7C,IAAI,MAAM,GAAG,EAAE,CAAC;YAChB,KAAK,MAAM,KAAK,IAAI,GAAG,CAAC,MAAM;gBAC5B,MAAM,GAAG,GAAG,MAAM,GAAG,WAAW,CAAC,KAAK,CAAC,EAAE,CAAC;YAE5C,OAAO,GAAG,MAAM,GAAG,CAAC;QACtB,CAAC;QACD,SAAS,eAAe,CAAC,IAAmB;YAC1C,MAAM,KAAK,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACrC,IAAI,GAAG,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAC;YAC3B,IAAA,qBAAM,EAAC,CAAC,KAAK,GAAG,CAAC,MAAM,CAAC,CAAC;YAEzB,MAAM,KAAK,GAAG,IAAI,CAAC,kBAAkB,EAAE,CAAC;YACxC,IAAI,KAAK,EAAE,CAAC;gBACV,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,UAAU;oBAC9B,GAAG,GAAG,GAAG,GAAG,GAAG,cAAc,CAAC,CAAC,CAAC,EAAE,CAAC;YACvC,CAAC;YACD,OAAO,GAAG,GAAG,GAAG,CAAC;QACnB,CAAC;QACD,IAAI,MAAM,GAAG,EAAE,CAAC;QAChB,KAAK,MAAM,SAAS,IAAI,IAAI,CAAC,KAAK;YAChC,MAAM,GAAG,GAAG,MAAM,GAAG,eAAe,CAAC,SAAS,CAAC,EAAE,CAAC;QACpD,OAAO,GAAG,MAAM,GAAG,CAAC;IACtB,CAAC;;AAraH,gCAsaC;AAWD;;;;GAIG;AACH,IAAiB,qBAAqB,CAkBrC;AAlBD,WAAiB,qBAAqB;IACpC;;;;OAIG;IACH,SAAgB,cAAc,CAAC,IAAiB;QAC9C,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,OAAO;YACxB,OAAO,SAAS,CAAC;QAEnB,MAAM,GAAG,GAAG,IAAW,CAAC;QACxB,IAAI,SAAS,KAAK,GAAG,CAAC,UAAU;YAC9B,GAAG,CAAC,UAAU,GAAG,IAAI,CAAC,eAAe,EAAE,CAAC;QAE1C,MAAM,WAAW,GAAG,GAA4B,CAAC;QACjD,IAAA,qBAAM,EAAC,SAAS,KAAK,WAAW,CAAC,UAAU,CAAC,CAAC;QAC7C,OAAO,WAAW,CAAC;IACrB,CAAC;IAXe,oCAAc,iBAW7B,CAAA;AACH,CAAC,EAlBgB,qBAAqB,qCAArB,qBAAqB,QAkBrC","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 CartesianGeometry\r\n */\r\n\r\nimport { assert } from \"@itwin/core-bentley\";\r\nimport { Arc3d } from \"../curve/Arc3d\";\r\nimport { AnnounceNumberNumber, AnnounceNumberNumberCurvePrimitive } from \"../curve/CurvePrimitive\";\r\nimport { LineSegment3d } from \"../curve/LineSegment3d\";\r\nimport { Geometry } from \"../Geometry\";\r\nimport { GrowableXYZArray } from \"../geometry3d/GrowableXYZArray\";\r\nimport { IndexedXYZCollection } from \"../geometry3d/IndexedXYZCollection\";\r\nimport { Point3d, Vector3d } from \"../geometry3d/Point3dVector3d\";\r\nimport { Range3d } from \"../geometry3d/Range\";\r\nimport { GrowableXYZArrayCache } from \"../geometry3d/ReusableObjectCache\";\r\nimport { Segment1d } from \"../geometry3d/Segment1d\";\r\nimport { Transform } from \"../geometry3d/Transform\";\r\nimport { Matrix4d } from \"../geometry4d/Matrix4d\";\r\nimport { BooleanClipNodeIntersection } from \"./BooleanClipNode\";\r\nimport { ClipPlane } from \"./ClipPlane\";\r\nimport { ClipMaskXYZRangePlanes, ClipPrimitive, ClipPrimitiveProps, ClipShape } from \"./ClipPrimitive\";\r\nimport { Clipper, ClipPlaneContainment } from \"./ClipUtils\";\r\nimport { ConvexClipPlaneSet } from \"./ConvexClipPlaneSet\";\r\n\r\n/**\r\n * Wire format describing a [[ClipVector]].\r\n * @public\r\n */\r\nexport type ClipVectorProps = ClipPrimitiveProps[];\r\n\r\n/**\r\n * Class holding an array structure of shapes defined by `ClipPrimitive`\r\n * * The `ClipVector` defines an intersection of the member `ClipPrimitive` regions.\r\n * * In the most common usage, one of the `ClipPrimitive` will be an outer region, and all others are holes with marker\r\n * flag indicating that the outside of each hole is live.\r\n * @public\r\n */\r\nexport class ClipVector implements Clipper {\r\n  private _clips: ClipPrimitive[];\r\n  /**\r\n   * Range acting as first filter.\r\n   * * This is understood as overall range limit, not as precise planes.\r\n   * * Applying any rotation to the whole ClipVector generally expands this range, rather than exactly transforming\r\n   * its planes.\r\n   */\r\n  public boundingRange: Range3d = Range3d.createNull();\r\n  /** Returns a reference to the array of ClipShapes. */\r\n  public get clips() { return this._clips; }\r\n  private constructor(clips?: ClipPrimitive[]) {\r\n    this._clips = clips ? clips : [];\r\n  }\r\n  /** Returns true if this ClipVector contains a ClipPrimitive. */\r\n  public get isValid(): boolean { return this._clips.length > 0; }\r\n  /** Create a ClipVector with an empty set of ClipShapes. */\r\n  public static createEmpty(result?: ClipVector): ClipVector {\r\n    if (result) {\r\n      result._clips.length = 0;\r\n      return result;\r\n    }\r\n    return new ClipVector();\r\n  }\r\n  /** Create a ClipVector from an array of ClipPrimitives (or derived classes) (capture the pointers) */\r\n  public static createCapture(clips: ClipPrimitive[], result?: ClipVector): ClipVector {\r\n    if (result) {\r\n      result._clips = clips;\r\n      return result;\r\n    }\r\n    return new ClipVector(clips);\r\n  }\r\n  /** Create a ClipVector from (clones of) an array of ClipPrimitives */\r\n  public static create(clips: ClipPrimitive[], result?: ClipVector): ClipVector {\r\n    const clipClones: ClipPrimitive[] = [];\r\n    for (const clip of clips)\r\n      clipClones.push(clip.clone());\r\n    return ClipVector.createCapture(clipClones, result);\r\n  }\r\n  /** Create a deep copy of another ClipVector */\r\n  public clone(result?: ClipVector): ClipVector {\r\n    const retVal = result ? result : new ClipVector();\r\n    retVal._clips.length = 0;\r\n    for (const clip of this._clips) {\r\n      retVal._clips.push(clip.clone());\r\n    }\r\n    retVal.boundingRange.setFrom(this.boundingRange);\r\n    return retVal;\r\n  }\r\n  /** Parse this ClipVector into a JSON object. */\r\n  public toJSON(): ClipVectorProps {\r\n    if (!this.isValid)\r\n      return [];\r\n\r\n    return this.clips.map((clip) => clip.toJSON());\r\n  }\r\n  /** Parse a JSON object into a new ClipVector. */\r\n  public static fromJSON(json: ClipVectorProps | undefined, result?: ClipVector): ClipVector {\r\n    result = result ? result : new ClipVector();\r\n    result.clear();\r\n    if (!Array.isArray(json))\r\n      return result;\r\n    try {\r\n      for (const clip of json) {\r\n        const clipPrim = ClipPrimitive.fromJSON(clip);\r\n        if (clipPrim)\r\n          result._clips.push(clipPrim);\r\n      }\r\n    } catch {\r\n      result.clear();\r\n    }\r\n    return result;\r\n  }\r\n  /** Empties out the array of ClipShapes. */\r\n  public clear() {\r\n    this._clips.length = 0;\r\n  }\r\n  /** Append a deep copy of the given ClipPrimitive to this ClipVector. */\r\n  public appendClone(clip: ClipPrimitive) {\r\n    this._clips.push(clip.clone());\r\n  }\r\n  /** Append a reference of the given ClipPrimitive to this ClipVector. */\r\n  public appendReference(clip: ClipPrimitive) {\r\n    this._clips.push(clip);\r\n  }\r\n  /** Create and append a new ClipPrimitive to the array given a shape as an array of points. Returns true if successful. */\r\n  public appendShape(shape: Point3d[], zLow?: number, zHigh?: number,\r\n    transform?: Transform, isMask: boolean = false, invisible: boolean = false): boolean {\r\n    const clip = ClipShape.createShape(shape, zLow, zHigh, transform, isMask, invisible);\r\n    if (!clip)\r\n      return false;\r\n    this._clips.push(clip);\r\n    return true;\r\n  }\r\n  /** Returns true if the given point lies inside all of this ClipVector's ClipShapes (by rule of intersection).*/\r\n  public pointInside(point: Point3d, onTolerance: number = Geometry.smallMetricDistanceSquared): boolean {\r\n    return this.isPointOnOrInside(point, onTolerance);\r\n  }\r\n  /**\r\n   * Method from [[Clipper]] interface.\r\n   * * Implement as dispatch to clipPlaneSets as supplied by derived class.\r\n   */\r\n  public isPointOnOrInside(point: Point3d, onTolerance: number = Geometry.smallMetricDistanceSquared): boolean {\r\n    if (!this.boundingRange.isNull && !this.boundingRange.containsPoint(point))\r\n      return false;\r\n\r\n    for (const clip of this._clips) {\r\n      if (!clip.pointInside(point, onTolerance))\r\n        return false;\r\n    }\r\n    return true;\r\n  }\r\n  // Proxy object to implement line and arc clip.\r\n  private _clipNodeProxy?: BooleanClipNodeIntersection;\r\n  private ensureProxyClipNode(): boolean {\r\n    if (this._clipNodeProxy)\r\n      return true;\r\n    this._clipNodeProxy = new BooleanClipNodeIntersection(true);\r\n    let numChildren = 0;\r\n    for (const child of this._clips) {\r\n      const q = child.fetchClipPlanesRef();\r\n      if (q) {\r\n        numChildren++;\r\n        this._clipNodeProxy.captureChild(q);\r\n      }\r\n    }\r\n    return numChildren > 0;\r\n  }\r\n  /**\r\n   * Method from [[Clipper]] interface.\r\n   * * Implement as dispatch to clipPlaneSets as supplied by derived class.\r\n   */\r\n  public announceClippedSegmentIntervals(\r\n    f0: number, f1: number, pointA: Point3d, pointB: Point3d, announce?: AnnounceNumberNumber,\r\n  ): boolean {\r\n    this.ensureProxyClipNode();\r\n    if (this._clipNodeProxy)\r\n      return this._clipNodeProxy.announceClippedSegmentIntervals(f0, f1, pointA, pointB, announce);\r\n    return false;\r\n  }\r\n  /** Method from [[Clipper]] interface.\r\n   * * Implement as dispatch to clipPlaneSets as supplied by derived class.\r\n   */\r\n  public announceClippedArcIntervals(arc: Arc3d, announce?: AnnounceNumberNumberCurvePrimitive): boolean {\r\n    this.ensureProxyClipNode();\r\n    if (this._clipNodeProxy)\r\n      return this._clipNodeProxy.announceClippedArcIntervals(arc, announce);\r\n    return false;\r\n  }\r\n  /** Execute polygon clip as intersection of the child primitives. */\r\n  public appendPolygonClip(\r\n    xyz: IndexedXYZCollection,\r\n    insideFragments: GrowableXYZArray[],\r\n    outsideFragments: GrowableXYZArray[],\r\n    arrayCache: GrowableXYZArrayCache) {\r\n    this.ensureProxyClipNode();\r\n    if (this._clipNodeProxy)\r\n      this._clipNodeProxy.appendPolygonClip(xyz, insideFragments, outsideFragments, arrayCache);\r\n  }\r\n  /**\r\n   * Transforms this ClipVector to a new coordinate-system.\r\n   * Note that if the transform has rotate and scale the boundingRange member expands.\r\n   * Returns true if successful.\r\n   */\r\n  public transformInPlace(transform: Transform): boolean {\r\n    for (const clip of this._clips)\r\n      if (clip.transformInPlace(transform) === false)\r\n        return false;\r\n\r\n    if (!this.boundingRange.isNull)\r\n      transform.multiplyRange(this.boundingRange, this.boundingRange);\r\n\r\n    return true;\r\n  }\r\n  /**\r\n   * A simple way of packaging this ClipVector's ClipShape points into a multidimensional array, while also\r\n   * taking into account each ClipPrimitive's individual transforms.\r\n   * ClipPrimitives OTHER THAN ClipShape are ignored.\r\n   * Information out:\r\n   *  - All of the loop points are stored in the multidimensional Point3d array given (will return unchanged upon failure).\r\n   *  - If given a transform, will be set from the transformFromClip of the first ClipPrimitive.\r\n   *  - The ClipMask of the final ClipPrimitive is stored in the returned array at index 0.\r\n   *  - The last valid zLow found is stored in the returned array at index 1.\r\n   *  - The last valid zHigh found is stored in the returned array at index 2.\r\n   */\r\n  public extractBoundaryLoops(loopPoints: Point3d[][], transform?: Transform): number[] {\r\n    let clipM = ClipMaskXYZRangePlanes.None;\r\n    let zBack = -Number.MAX_VALUE;\r\n    let zFront = Number.MAX_VALUE;\r\n    const retVal: number[] = [];\r\n    let nLoops = 0;\r\n\r\n    if (this._clips.length === 0)\r\n      return retVal;\r\n    let firstClipShape: ClipShape | undefined;\r\n    const deltaTrans = Transform.createIdentity();\r\n\r\n    for (const clip of this._clips) {\r\n      if (clip instanceof ClipShape) {\r\n        if (firstClipShape !== undefined && clip !== firstClipShape) {      // Is not the first iteration\r\n          let fwdTrans = Transform.createIdentity();\r\n          let invTrans = Transform.createIdentity();\r\n\r\n          if (firstClipShape.transformValid && clip.transformValid) {\r\n            fwdTrans = clip.transformFromClip!.clone();\r\n            invTrans = firstClipShape.transformToClip!.clone();\r\n          }\r\n          deltaTrans.setFrom(invTrans.multiplyTransformTransform(fwdTrans));\r\n        }\r\n        if (!firstClipShape)\r\n          firstClipShape = clip;\r\n        loopPoints[nLoops] = [];\r\n\r\n        if (clip.polygon !== undefined) {\r\n          clipM = ClipMaskXYZRangePlanes.XAndY;\r\n\r\n          if (clip.zHighValid) {\r\n            clipM = clipM | ClipMaskXYZRangePlanes.ZHigh;\r\n            zFront = clip.zHigh!;\r\n          }\r\n          if (clip.zLowValid) {\r\n            clipM = clipM | ClipMaskXYZRangePlanes.ZLow;\r\n            zBack = clip.zLow!;\r\n          }\r\n\r\n          for (const point of clip.polygon)\r\n            loopPoints[nLoops].push(point.clone());\r\n          deltaTrans.multiplyPoint3dArray(loopPoints[nLoops], loopPoints[nLoops]);\r\n          nLoops++;\r\n        }\r\n      }\r\n    }\r\n    retVal.push(clipM);\r\n    retVal.push(zBack);\r\n    retVal.push(zFront);\r\n    if (transform && firstClipShape)\r\n      transform.setFrom(firstClipShape.transformFromClip!);\r\n    return retVal;\r\n  }\r\n  /** Sets this ClipVector and all of its members to the visibility specified. */\r\n  public setInvisible(invisible: boolean) {\r\n    for (const clip of this._clips)\r\n      clip.setInvisible(invisible);\r\n  }\r\n  /**\r\n   * For every clip, parse the member point array into the member clip plane object (only for clipPlanes member,\r\n   * not the mask)\r\n   */\r\n  public parseClipPlanes() {\r\n    for (const clip of this._clips)\r\n      clip.fetchClipPlanesRef();\r\n  }\r\n  /**\r\n   * Multiply all ClipPlanes DPoint4d by matrix.\r\n   * @param matrix matrix to apply.\r\n   * @param invert if true, use in verse of the matrix.\r\n   * @param transpose if true, use the transpose of the matrix (or inverse, per invert parameter)\r\n   * * Note that if matrixA is applied to all of space, the matrix to send to this method to get a corresponding effect on the plane is the inverse transpose of matrixA\r\n   * * Callers that will apply the same matrix to many planes should pre-invert the matrix for efficiency.\r\n   * * Both params default to true to get the full effect of transforming space.\r\n   * @param matrix matrix to apply\r\n   * @returns false if matrix inversion fails.\r\n   */\r\n  public multiplyPlanesByMatrix4d(matrix: Matrix4d, invert: boolean = true, transpose: boolean = true): boolean {\r\n    if (invert) {  // form inverse once here, reuse for all planes\r\n      const inverse = matrix.createInverse();\r\n      if (!inverse)\r\n        return false;\r\n      return this.multiplyPlanesByMatrix4d(inverse, false, transpose);\r\n    }\r\n    // no inverse necessary -- lower level cannot fail.\r\n    for (const clip of this._clips)\r\n      clip.multiplyPlanesByMatrix4d(matrix, false, transpose);\r\n    return true;\r\n  }\r\n  /**\r\n   * Determines whether the given points fall inside or outside this set of ClipShapes. If any set is defined\r\n   * by masking planes, checks the mask planes only, provided that ignoreMasks is false. Otherwise, checks the\r\n   * _clipPlanes member.\r\n   */\r\n  public classifyPointContainment(points: Point3d[], ignoreMasks: boolean = false): ClipPlaneContainment {\r\n    let currentContainment = ClipPlaneContainment.Ambiguous;\r\n\r\n    for (const primitive of this._clips) {\r\n      const thisContainment = primitive.classifyPointContainment(points, ignoreMasks);\r\n\r\n      if (ClipPlaneContainment.Ambiguous === thisContainment)\r\n        return ClipPlaneContainment.Ambiguous;\r\n\r\n      if (ClipPlaneContainment.Ambiguous === currentContainment)\r\n        currentContainment = thisContainment;\r\n      else if (currentContainment !== thisContainment)\r\n        return ClipPlaneContainment.Ambiguous;\r\n    }\r\n    return currentContainment;\r\n  }\r\n  /**\r\n   * Determines whether a 3D range lies inside or outside this set of ClipShapes. If any set is defined by masking planes,\r\n   * checks the mask planes only, provided that ignoreMasks is false. Otherwise, checks the clip planes member.\r\n   */\r\n  public classifyRangeContainment(range: Range3d, ignoreMasks: boolean): ClipPlaneContainment {\r\n    const corners: Point3d[] = range.corners();\r\n    return this.classifyPointContainment(corners, ignoreMasks);\r\n  }\r\n  /**\r\n   * For an array of points (making up a LineString), tests whether the segment between each point lies inside the\r\n   * ClipVector.\r\n   * If true, returns true immediately.\r\n   */\r\n  public isAnyLineStringPointInside(points: Point3d[]): boolean {\r\n    for (const clip of this._clips) {\r\n      const clipPlaneSet = clip.fetchClipPlanesRef();\r\n      if (clipPlaneSet !== undefined) {\r\n        for (let i = 0; i + 1 < points.length; i++) {\r\n          const segment = LineSegment3d.create(points[i], points[i + 1]);\r\n          if (clipPlaneSet.isAnyPointInOrOnFromSegment(segment))\r\n            return true;\r\n        }\r\n      }\r\n    }\r\n    return false;\r\n  }\r\n  /** Note: Line segments are used to represent 1 dimensional intervals here, rather than segments. */\r\n  public sumSizes(intervals: Segment1d[], begin: number, end: number): number {\r\n    let s = 0.0;\r\n    for (let i = begin; i < end; i++)\r\n      s += (intervals[i].x1 - intervals[i].x0);\r\n    return s;\r\n  }\r\n  private static readonly _TARGET_FRACTION_SUM = 0.99999999;\r\n  /**\r\n   * For an array of points that make up a LineString, develops a line segment between each point pair,\r\n   * and returns true if all segments lie inside this ClipVector.\r\n   */\r\n  public isLineStringCompletelyContained(points: Point3d[]): boolean {\r\n    const clipIntervals: Segment1d[] = [];\r\n\r\n    for (let i = 0; i + 1 < points.length; i++) {\r\n      const segment = LineSegment3d.create(points[i], points[i + 1]);\r\n      let fractionSum = 0.0;\r\n      let index0 = 0;\r\n\r\n      for (const clip of this._clips) {\r\n        const clipPlaneSet = clip.fetchClipPlanesRef();\r\n        if (clipPlaneSet !== undefined) {\r\n          clipPlaneSet.appendIntervalsFromSegment(segment, clipIntervals);\r\n          const index1 = clipIntervals.length;\r\n          fractionSum += this.sumSizes(clipIntervals, index0, index1);\r\n          index0 = index1;\r\n          // ASSUME primitives are non-overlapping...\r\n          if (fractionSum >= ClipVector._TARGET_FRACTION_SUM)\r\n            break;\r\n        }\r\n      }\r\n      if (fractionSum < ClipVector._TARGET_FRACTION_SUM)\r\n        return false;\r\n    }\r\n    return true;\r\n  }\r\n  /**\r\n   * Serializes this ClipVector to a compact string representation appropriate for transmission as part of a URL.\r\n   * Chiefly used for requesting [Tile]($frontend)s with section cut facets.\r\n   * UnionOfConvexClipPlaneSets is obtained for each ClipPrimitive. The encoding is as follows:\r\n   *  ClipVector:\r\n   *    ClipPrimitive[]\r\n   *    _\r\n   *  ClipPrimitive:\r\n   *    invisible: 0|1\r\n   *    ConvexClipPlaneSet[]\r\n   *    _\r\n   *  ConvexClipPlaneSet:\r\n   *    ClipPlane[]\r\n   *    _\r\n   *  ClipPlane:\r\n   *    flags: 0|1|2|3, where 1=invisible and 2=interior\r\n   *    inwardNormal: Number[3]\r\n   *    distance: Number\r\n   *  Number:\r\n   *    number\r\n   *    _\r\n   */\r\n  public toCompactString(): string {\r\n    function formatNumber(num: number) {\r\n      return `${num.toString()}_`;\r\n    }\r\n    function formatVector3d(vec: Vector3d) {\r\n      return `${formatNumber(vec.x)}${formatNumber(vec.y)}${formatNumber(vec.z)}`;\r\n    }\r\n    function formatFlags(flags: number) {\r\n      const f = flags.toString();\r\n      assert(1 === f.length);\r\n      return f;\r\n    }\r\n    function formatPlane(plane: ClipPlane) {\r\n      let flags = plane.invisible ? 1 : 0;\r\n      flags |= (plane.interior ? 2 : 0);\r\n      return `${formatFlags(flags)}${formatVector3d(plane.inwardNormalRef)}${formatNumber(plane.distance)}`;\r\n    }\r\n    function formatPlaneSet(set: ConvexClipPlaneSet) {\r\n      let planes = \"\";\r\n      for (const plane of set.planes)\r\n        planes = `${planes}${formatPlane(plane)}`;\r\n\r\n      return `${planes}_`;\r\n    }\r\n    function formatPrimitive(prim: ClipPrimitive) {\r\n      const flags = prim.invisible ? 1 : 0;\r\n      let str = flags.toString();\r\n      assert(1 === str.length);\r\n\r\n      const union = prim.fetchClipPlanesRef();\r\n      if (union) {\r\n        for (const s of union.convexSets)\r\n          str = `${str}${formatPlaneSet(s)}`;\r\n      }\r\n      return `${str}_`;\r\n    }\r\n    let result = \"\";\r\n    for (const primitive of this.clips)\r\n      result = `${result}${formatPrimitive(primitive)}`;\r\n    return `${result}_`;\r\n  }\r\n}\r\n\r\n/**\r\n * Bundles a [[ClipVector]] with its compact string representation.\r\n * @note The string representation is computed once; the ClipVector is assumed not to be subsequently modified.\r\n * @see [[StringifiedClipVector.fromClipVector]] to create from a ClipVector.\r\n * @see [[ClipVector.toCompactString]] for a description of the string representation.\r\n * @alpha\r\n */\r\nexport type StringifiedClipVector = ClipVector & { readonly clipString: string };\r\n\r\n/**\r\n * Bundles a ClipVector with its compact string representation.\r\n * @note The string representation is computed once; the ClipVector is assumed not to be subsequently modified.\r\n * @alpha\r\n */\r\nexport namespace StringifiedClipVector { // eslint-disable-line @typescript-eslint/no-redeclare\r\n  /** Create from a ClipVector.\r\n   * @param clip The ClipVector to stringify.\r\n   * @returns The input ClipVector with its compact string representation, or undefined if the input is undefined or empty.\r\n   * @note The string representation is computed once; the ClipVector is assumed not to be subsequently modified.\r\n   */\r\n  export function fromClipVector(clip?: ClipVector): StringifiedClipVector | undefined {\r\n    if (!clip || !clip.isValid)\r\n      return undefined;\r\n\r\n    const ret = clip as any;\r\n    if (undefined === ret.clipString)\r\n      ret.clipString = clip.toCompactString();\r\n\r\n    const stringified = ret as StringifiedClipVector;\r\n    assert(undefined !== stringified.clipString);\r\n    return stringified;\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"ClipVector.js","sourceRoot":"","sources":["../../../src/clipping/ClipVector.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F;;GAEG;AAEH,sDAA6C;AAG7C,0DAAuD;AACvD,0CAAuC;AAIvC,+CAA8C;AAG9C,uDAAoD;AAEpD,uDAAgE;AAEhE,mDAAuG;AACvG,2CAA4D;AAS5D;;;;;;GAMG;AACH,MAAa,UAAU;IACb,MAAM,CAAkB;IAChC;;;;;OAKG;IACI,aAAa,GAAY,eAAO,CAAC,UAAU,EAAE,CAAC;IACrD,sDAAsD;IACtD,IAAW,KAAK,KAAK,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IAC1C,YAAoB,KAAuB;QACzC,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;IACnC,CAAC;IACD,gEAAgE;IAChE,IAAW,OAAO,KAAc,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;IAChE,2DAA2D;IACpD,MAAM,CAAC,WAAW,CAAC,MAAmB;QAC3C,IAAI,MAAM,EAAE,CAAC;YACX,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;YACzB,OAAO,MAAM,CAAC;QAChB,CAAC;QACD,OAAO,IAAI,UAAU,EAAE,CAAC;IAC1B,CAAC;IACD,sGAAsG;IAC/F,MAAM,CAAC,aAAa,CAAC,KAAsB,EAAE,MAAmB;QACrE,IAAI,MAAM,EAAE,CAAC;YACX,MAAM,CAAC,MAAM,GAAG,KAAK,CAAC;YACtB,OAAO,MAAM,CAAC;QAChB,CAAC;QACD,OAAO,IAAI,UAAU,CAAC,KAAK,CAAC,CAAC;IAC/B,CAAC;IACD,sEAAsE;IAC/D,MAAM,CAAC,MAAM,CAAC,KAAsB,EAAE,MAAmB;QAC9D,MAAM,UAAU,GAAoB,EAAE,CAAC;QACvC,KAAK,MAAM,IAAI,IAAI,KAAK;YACtB,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC;QAChC,OAAO,UAAU,CAAC,aAAa,CAAC,UAAU,EAAE,MAAM,CAAC,CAAC;IACtD,CAAC;IACD,+CAA+C;IACxC,KAAK,CAAC,MAAmB;QAC9B,MAAM,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,UAAU,EAAE,CAAC;QAClD,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;QACzB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAC/B,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC;QACnC,CAAC;QACD,MAAM,CAAC,aAAa,CAAC,OAAO,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;QACjD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,gDAAgD;IACzC,MAAM;QACX,IAAI,CAAC,IAAI,CAAC,OAAO;YACf,OAAO,EAAE,CAAC;QAEZ,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;IACjD,CAAC;IACD,iDAAiD;IAC1C,MAAM,CAAC,QAAQ,CAAC,IAAiC,EAAE,MAAmB;QAC3E,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,UAAU,EAAE,CAAC;QAC5C,MAAM,CAAC,KAAK,EAAE,CAAC;QACf,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC;YACtB,OAAO,MAAM,CAAC;QAChB,IAAI,CAAC;YACH,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;gBACxB,MAAM,QAAQ,GAAG,6BAAa,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;gBAC9C,IAAI,QAAQ;oBACV,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACjC,CAAC;QACH,CAAC;QAAC,MAAM,CAAC;YACP,MAAM,CAAC,KAAK,EAAE,CAAC;QACjB,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,2CAA2C;IACpC,KAAK;QACV,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;IACzB,CAAC;IACD,wEAAwE;IACjE,WAAW,CAAC,IAAmB;QACpC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC;IACjC,CAAC;IACD,wEAAwE;IACjE,eAAe,CAAC,IAAmB;QACxC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACzB,CAAC;IACD,0HAA0H;IACnH,WAAW,CAAC,KAAgB,EAAE,IAAa,EAAE,KAAc,EAChE,SAAqB,EAAE,SAAkB,KAAK,EAAE,YAAqB,KAAK;QAC1E,MAAM,IAAI,GAAG,yBAAS,CAAC,WAAW,CAAC,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,CAAC,CAAC;QACrF,IAAI,CAAC,IAAI;YACP,OAAO,KAAK,CAAC;QACf,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACvB,OAAO,IAAI,CAAC;IACd,CAAC;IACD,gHAAgH;IACzG,WAAW,CAAC,KAAc,EAAE,cAAsB,mBAAQ,CAAC,0BAA0B;QAC1F,OAAO,IAAI,CAAC,iBAAiB,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC;IACpD,CAAC;IACD;;;OAGG;IACI,iBAAiB,CAAC,KAAc,EAAE,cAAsB,mBAAQ,CAAC,0BAA0B;QAChG,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,aAAa,CAAC,KAAK,CAAC;YACxE,OAAO,KAAK,CAAC;QAEf,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAC/B,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,WAAW,CAAC;gBACvC,OAAO,KAAK,CAAC;QACjB,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IACD,+CAA+C;IACvC,cAAc,CAA+B;IAC7C,mBAAmB;QACzB,IAAI,IAAI,CAAC,cAAc;YACrB,OAAO,IAAI,CAAC;QACd,IAAI,CAAC,cAAc,GAAG,IAAI,6CAA2B,CAAC,IAAI,CAAC,CAAC;QAC5D,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAChC,MAAM,CAAC,GAAG,KAAK,CAAC,kBAAkB,EAAE,CAAC;YACrC,IAAI,CAAC,EAAE,CAAC;gBACN,WAAW,EAAE,CAAC;gBACd,IAAI,CAAC,cAAc,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YACtC,CAAC;QACH,CAAC;QACD,OAAO,WAAW,GAAG,CAAC,CAAC;IACzB,CAAC;IACD;;;OAGG;IACI,+BAA+B,CACpC,EAAU,EAAE,EAAU,EAAE,MAAe,EAAE,MAAe,EAAE,QAA+B;QAEzF,IAAI,CAAC,mBAAmB,EAAE,CAAC;QAC3B,IAAI,IAAI,CAAC,cAAc;YACrB,OAAO,IAAI,CAAC,cAAc,CAAC,+BAA+B,CAAC,EAAE,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC;QAC/F,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;OAEG;IACI,2BAA2B,CAAC,GAAU,EAAE,QAA6C;QAC1F,IAAI,CAAC,mBAAmB,EAAE,CAAC;QAC3B,IAAI,IAAI,CAAC,cAAc;YACrB,OAAO,IAAI,CAAC,cAAc,CAAC,2BAA2B,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;QACxE,OAAO,KAAK,CAAC;IACf,CAAC;IACD,oEAAoE;IAC7D,iBAAiB,CACtB,GAAyB,EACzB,eAAmC,EACnC,gBAAoC,EACpC,UAAiC;QACjC,IAAI,CAAC,mBAAmB,EAAE,CAAC;QAC3B,IAAI,IAAI,CAAC,cAAc;YACrB,IAAI,CAAC,cAAc,CAAC,iBAAiB,CAAC,GAAG,EAAE,eAAe,EAAE,gBAAgB,EAAE,UAAU,CAAC,CAAC;IAC9F,CAAC;IACD;;;;OAIG;IACI,gBAAgB,CAAC,SAAoB;QAC1C,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,MAAM;YAC5B,IAAI,IAAI,CAAC,gBAAgB,CAAC,SAAS,CAAC,KAAK,KAAK;gBAC5C,OAAO,KAAK,CAAC;QAEjB,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,MAAM;YAC5B,SAAS,CAAC,aAAa,CAAC,IAAI,CAAC,aAAa,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC;QAElE,OAAO,IAAI,CAAC;IACd,CAAC;IACD;;;;;;;;;;OAUG;IACI,oBAAoB,CAAC,UAAuB,EAAE,SAAqB;QACxE,IAAI,KAAK,GAAG,sCAAsB,CAAC,IAAI,CAAC;QACxC,IAAI,KAAK,GAAG,CAAC,MAAM,CAAC,SAAS,CAAC;QAC9B,IAAI,MAAM,GAAG,MAAM,CAAC,SAAS,CAAC;QAC9B,MAAM,MAAM,GAAa,EAAE,CAAC;QAC5B,IAAI,MAAM,GAAG,CAAC,CAAC;QAEf,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC;YAC1B,OAAO,MAAM,CAAC;QAChB,IAAI,cAAqC,CAAC;QAC1C,MAAM,UAAU,GAAG,qBAAS,CAAC,cAAc,EAAE,CAAC;QAE9C,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAC/B,IAAI,IAAI,YAAY,yBAAS,EAAE,CAAC;gBAC9B,IAAI,cAAc,KAAK,SAAS,IAAI,IAAI,KAAK,cAAc,EAAE,CAAC,CAAM,6BAA6B;oBAC/F,IAAI,QAAQ,GAAG,qBAAS,CAAC,cAAc,EAAE,CAAC;oBAC1C,IAAI,QAAQ,GAAG,qBAAS,CAAC,cAAc,EAAE,CAAC;oBAE1C,IAAI,cAAc,CAAC,cAAc,IAAI,IAAI,CAAC,cAAc,EAAE,CAAC;wBACzD,QAAQ,GAAG,IAAI,CAAC,iBAAkB,CAAC,KAAK,EAAE,CAAC;wBAC3C,QAAQ,GAAG,cAAc,CAAC,eAAgB,CAAC,KAAK,EAAE,CAAC;oBACrD,CAAC;oBACD,UAAU,CAAC,OAAO,CAAC,QAAQ,CAAC,0BAA0B,CAAC,QAAQ,CAAC,CAAC,CAAC;gBACpE,CAAC;gBACD,IAAI,CAAC,cAAc;oBACjB,cAAc,GAAG,IAAI,CAAC;gBACxB,UAAU,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC;gBAExB,IAAI,IAAI,CAAC,OAAO,KAAK,SAAS,EAAE,CAAC;oBAC/B,KAAK,GAAG,sCAAsB,CAAC,KAAK,CAAC;oBAErC,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;wBACpB,KAAK,GAAG,KAAK,GAAG,sCAAsB,CAAC,KAAK,CAAC;wBAC7C,MAAM,GAAG,IAAI,CAAC,KAAM,CAAC;oBACvB,CAAC;oBACD,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;wBACnB,KAAK,GAAG,KAAK,GAAG,sCAAsB,CAAC,IAAI,CAAC;wBAC5C,KAAK,GAAG,IAAI,CAAC,IAAK,CAAC;oBACrB,CAAC;oBAED,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO;wBAC9B,UAAU,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC;oBACzC,UAAU,CAAC,oBAAoB,CAAC,UAAU,CAAC,MAAM,CAAC,EAAE,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC;oBACxE,MAAM,EAAE,CAAC;gBACX,CAAC;YACH,CAAC;QACH,CAAC;QACD,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACnB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACnB,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACpB,IAAI,SAAS,IAAI,cAAc;YAC7B,SAAS,CAAC,OAAO,CAAC,cAAc,CAAC,iBAAkB,CAAC,CAAC;QACvD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,+EAA+E;IACxE,YAAY,CAAC,SAAkB;QACpC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,MAAM;YAC5B,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC;IACjC,CAAC;IACD;;;OAGG;IACI,eAAe;QACpB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,MAAM;YAC5B,IAAI,CAAC,kBAAkB,EAAE,CAAC;IAC9B,CAAC;IACD;;;;;;;;;;OAUG;IACI,wBAAwB,CAAC,MAAgB,EAAE,SAAkB,IAAI,EAAE,YAAqB,IAAI;QACjG,IAAI,MAAM,EAAE,CAAC,CAAE,+CAA+C;YAC5D,MAAM,OAAO,GAAG,MAAM,CAAC,aAAa,EAAE,CAAC;YACvC,IAAI,CAAC,OAAO;gBACV,OAAO,KAAK,CAAC;YACf,OAAO,IAAI,CAAC,wBAAwB,CAAC,OAAO,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;QAClE,CAAC;QACD,mDAAmD;QACnD,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,MAAM;YAC5B,IAAI,CAAC,wBAAwB,CAAC,MAAM,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;QAC1D,OAAO,IAAI,CAAC;IACd,CAAC;IACD;;;;OAIG;IACI,wBAAwB,CAAC,MAAiB,EAAE,cAAuB,KAAK;QAC7E,IAAI,kBAAkB,GAAG,gCAAoB,CAAC,SAAS,CAAC;QAExD,KAAK,MAAM,SAAS,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YACpC,MAAM,eAAe,GAAG,SAAS,CAAC,wBAAwB,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;YAEhF,IAAI,gCAAoB,CAAC,SAAS,KAAK,eAAe;gBACpD,OAAO,gCAAoB,CAAC,SAAS,CAAC;YAExC,IAAI,gCAAoB,CAAC,SAAS,KAAK,kBAAkB;gBACvD,kBAAkB,GAAG,eAAe,CAAC;iBAClC,IAAI,kBAAkB,KAAK,eAAe;gBAC7C,OAAO,gCAAoB,CAAC,SAAS,CAAC;QAC1C,CAAC;QACD,OAAO,kBAAkB,CAAC;IAC5B,CAAC;IACD;;;OAGG;IACI,wBAAwB,CAAC,KAAc,EAAE,WAAoB;QAClE,MAAM,OAAO,GAAc,KAAK,CAAC,OAAO,EAAE,CAAC;QAC3C,OAAO,IAAI,CAAC,wBAAwB,CAAC,OAAO,EAAE,WAAW,CAAC,CAAC;IAC7D,CAAC;IACD;;;;OAIG;IACI,0BAA0B,CAAC,MAAiB;QACjD,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAC/B,MAAM,YAAY,GAAG,IAAI,CAAC,kBAAkB,EAAE,CAAC;YAC/C,IAAI,YAAY,KAAK,SAAS,EAAE,CAAC;gBAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC3C,MAAM,OAAO,GAAG,6BAAa,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oBAC/D,IAAI,YAAY,CAAC,2BAA2B,CAAC,OAAO,CAAC;wBACnD,OAAO,IAAI,CAAC;gBAChB,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,oGAAoG;IAC7F,QAAQ,CAAC,SAAsB,EAAE,KAAa,EAAE,GAAW;QAChE,IAAI,CAAC,GAAG,GAAG,CAAC;QACZ,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE;YAC9B,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAC3C,OAAO,CAAC,CAAC;IACX,CAAC;IACO,MAAM,CAAU,oBAAoB,GAAG,UAAU,CAAC;IAC1D;;;OAGG;IACI,+BAA+B,CAAC,MAAiB;QACtD,MAAM,aAAa,GAAgB,EAAE,CAAC;QAEtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,MAAM,OAAO,GAAG,6BAAa,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC/D,IAAI,WAAW,GAAG,GAAG,CAAC;YACtB,IAAI,MAAM,GAAG,CAAC,CAAC;YAEf,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;gBAC/B,MAAM,YAAY,GAAG,IAAI,CAAC,kBAAkB,EAAE,CAAC;gBAC/C,IAAI,YAAY,KAAK,SAAS,EAAE,CAAC;oBAC/B,YAAY,CAAC,0BAA0B,CAAC,OAAO,EAAE,aAAa,CAAC,CAAC;oBAChE,MAAM,MAAM,GAAG,aAAa,CAAC,MAAM,CAAC;oBACpC,WAAW,IAAI,IAAI,CAAC,QAAQ,CAAC,aAAa,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;oBAC5D,MAAM,GAAG,MAAM,CAAC;oBAChB,2CAA2C;oBAC3C,IAAI,WAAW,IAAI,UAAU,CAAC,oBAAoB;wBAChD,MAAM;gBACV,CAAC;YACH,CAAC;YACD,IAAI,WAAW,GAAG,UAAU,CAAC,oBAAoB;gBAC/C,OAAO,KAAK,CAAC;QACjB,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IACD;;;;;;;;;;;;;;;;;;;;;OAqBG;IACI,eAAe;QACpB,SAAS,YAAY,CAAC,GAAW;YAC/B,OAAO,GAAG,GAAG,CAAC,QAAQ,EAAE,GAAG,CAAC;QAC9B,CAAC;QACD,SAAS,cAAc,CAAC,GAAa;YACnC,OAAO,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;QAC9E,CAAC;QACD,SAAS,WAAW,CAAC,KAAa;YAChC,MAAM,CAAC,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAC;YAC3B,IAAA,qBAAM,EAAC,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC;YACvB,OAAO,CAAC,CAAC;QACX,CAAC;QACD,SAAS,WAAW,CAAC,KAAgB;YACnC,IAAI,KAAK,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACpC,KAAK,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAClC,OAAO,GAAG,WAAW,CAAC,KAAK,CAAC,GAAG,cAAc,CAAC,KAAK,CAAC,eAAe,CAAC,GAAG,YAAY,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC;QACxG,CAAC;QACD,SAAS,cAAc,CAAC,GAAuB;YAC7C,IAAI,MAAM,GAAG,EAAE,CAAC;YAChB,KAAK,MAAM,KAAK,IAAI,GAAG,CAAC,MAAM;gBAC5B,MAAM,GAAG,GAAG,MAAM,GAAG,WAAW,CAAC,KAAK,CAAC,EAAE,CAAC;YAE5C,OAAO,GAAG,MAAM,GAAG,CAAC;QACtB,CAAC;QACD,SAAS,eAAe,CAAC,IAAmB;YAC1C,MAAM,KAAK,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACrC,IAAI,GAAG,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAC;YAC3B,IAAA,qBAAM,EAAC,CAAC,KAAK,GAAG,CAAC,MAAM,CAAC,CAAC;YAEzB,MAAM,KAAK,GAAG,IAAI,CAAC,kBAAkB,EAAE,CAAC;YACxC,IAAI,KAAK,EAAE,CAAC;gBACV,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,UAAU;oBAC9B,GAAG,GAAG,GAAG,GAAG,GAAG,cAAc,CAAC,CAAC,CAAC,EAAE,CAAC;YACvC,CAAC;YACD,OAAO,GAAG,GAAG,GAAG,CAAC;QACnB,CAAC;QACD,IAAI,MAAM,GAAG,EAAE,CAAC;QAChB,KAAK,MAAM,SAAS,IAAI,IAAI,CAAC,KAAK;YAChC,MAAM,GAAG,GAAG,MAAM,GAAG,eAAe,CAAC,SAAS,CAAC,EAAE,CAAC;QACpD,OAAO,GAAG,MAAM,GAAG,CAAC;IACtB,CAAC;;AAraH,gCAsaC;AAWD;;;;GAIG;AACH,IAAiB,qBAAqB,CAkBrC;AAlBD,WAAiB,qBAAqB;IACpC;;;;OAIG;IACH,SAAgB,cAAc,CAAC,IAAiB;QAC9C,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,OAAO;YACxB,OAAO,SAAS,CAAC;QAEnB,MAAM,GAAG,GAAG,IAAW,CAAC;QACxB,IAAI,SAAS,KAAK,GAAG,CAAC,UAAU;YAC9B,GAAG,CAAC,UAAU,GAAG,IAAI,CAAC,eAAe,EAAE,CAAC;QAE1C,MAAM,WAAW,GAAG,GAA4B,CAAC;QACjD,IAAA,qBAAM,EAAC,SAAS,KAAK,WAAW,CAAC,UAAU,CAAC,CAAC;QAC7C,OAAO,WAAW,CAAC;IACrB,CAAC;IAXe,oCAAc,iBAW7B,CAAA;AACH,CAAC,EAlBgB,qBAAqB,qCAArB,qBAAqB,QAkBrC","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n\n/** @packageDocumentation\n * @module CartesianGeometry\n */\n\nimport { assert } from \"@itwin/core-bentley\";\nimport { Arc3d } from \"../curve/Arc3d\";\nimport { AnnounceNumberNumber, AnnounceNumberNumberCurvePrimitive } from \"../curve/CurvePrimitive\";\nimport { LineSegment3d } from \"../curve/LineSegment3d\";\nimport { Geometry } from \"../Geometry\";\nimport { GrowableXYZArray } from \"../geometry3d/GrowableXYZArray\";\nimport { IndexedXYZCollection } from \"../geometry3d/IndexedXYZCollection\";\nimport { Point3d, Vector3d } from \"../geometry3d/Point3dVector3d\";\nimport { Range3d } from \"../geometry3d/Range\";\nimport { GrowableXYZArrayCache } from \"../geometry3d/ReusableObjectCache\";\nimport { Segment1d } from \"../geometry3d/Segment1d\";\nimport { Transform } from \"../geometry3d/Transform\";\nimport { Matrix4d } from \"../geometry4d/Matrix4d\";\nimport { BooleanClipNodeIntersection } from \"./BooleanClipNode\";\nimport { ClipPlane } from \"./ClipPlane\";\nimport { ClipMaskXYZRangePlanes, ClipPrimitive, ClipPrimitiveProps, ClipShape } from \"./ClipPrimitive\";\nimport { Clipper, ClipPlaneContainment } from \"./ClipUtils\";\nimport { ConvexClipPlaneSet } from \"./ConvexClipPlaneSet\";\n\n/**\n * Wire format describing a [[ClipVector]].\n * @public\n */\nexport type ClipVectorProps = ClipPrimitiveProps[];\n\n/**\n * Class holding an array structure of shapes defined by `ClipPrimitive`\n * * The `ClipVector` defines an intersection of the member `ClipPrimitive` regions.\n * * In the most common usage, one of the `ClipPrimitive` will be an outer region, and all others are holes with marker\n * flag indicating that the outside of each hole is live.\n * @public\n */\nexport class ClipVector implements Clipper {\n  private _clips: ClipPrimitive[];\n  /**\n   * Range acting as first filter.\n   * * This is understood as overall range limit, not as precise planes.\n   * * Applying any rotation to the whole ClipVector generally expands this range, rather than exactly transforming\n   * its planes.\n   */\n  public boundingRange: Range3d = Range3d.createNull();\n  /** Returns a reference to the array of ClipShapes. */\n  public get clips() { return this._clips; }\n  private constructor(clips?: ClipPrimitive[]) {\n    this._clips = clips ? clips : [];\n  }\n  /** Returns true if this ClipVector contains a ClipPrimitive. */\n  public get isValid(): boolean { return this._clips.length > 0; }\n  /** Create a ClipVector with an empty set of ClipShapes. */\n  public static createEmpty(result?: ClipVector): ClipVector {\n    if (result) {\n      result._clips.length = 0;\n      return result;\n    }\n    return new ClipVector();\n  }\n  /** Create a ClipVector from an array of ClipPrimitives (or derived classes) (capture the pointers) */\n  public static createCapture(clips: ClipPrimitive[], result?: ClipVector): ClipVector {\n    if (result) {\n      result._clips = clips;\n      return result;\n    }\n    return new ClipVector(clips);\n  }\n  /** Create a ClipVector from (clones of) an array of ClipPrimitives */\n  public static create(clips: ClipPrimitive[], result?: ClipVector): ClipVector {\n    const clipClones: ClipPrimitive[] = [];\n    for (const clip of clips)\n      clipClones.push(clip.clone());\n    return ClipVector.createCapture(clipClones, result);\n  }\n  /** Create a deep copy of another ClipVector */\n  public clone(result?: ClipVector): ClipVector {\n    const retVal = result ? result : new ClipVector();\n    retVal._clips.length = 0;\n    for (const clip of this._clips) {\n      retVal._clips.push(clip.clone());\n    }\n    retVal.boundingRange.setFrom(this.boundingRange);\n    return retVal;\n  }\n  /** Parse this ClipVector into a JSON object. */\n  public toJSON(): ClipVectorProps {\n    if (!this.isValid)\n      return [];\n\n    return this.clips.map((clip) => clip.toJSON());\n  }\n  /** Parse a JSON object into a new ClipVector. */\n  public static fromJSON(json: ClipVectorProps | undefined, result?: ClipVector): ClipVector {\n    result = result ? result : new ClipVector();\n    result.clear();\n    if (!Array.isArray(json))\n      return result;\n    try {\n      for (const clip of json) {\n        const clipPrim = ClipPrimitive.fromJSON(clip);\n        if (clipPrim)\n          result._clips.push(clipPrim);\n      }\n    } catch {\n      result.clear();\n    }\n    return result;\n  }\n  /** Empties out the array of ClipShapes. */\n  public clear() {\n    this._clips.length = 0;\n  }\n  /** Append a deep copy of the given ClipPrimitive to this ClipVector. */\n  public appendClone(clip: ClipPrimitive) {\n    this._clips.push(clip.clone());\n  }\n  /** Append a reference of the given ClipPrimitive to this ClipVector. */\n  public appendReference(clip: ClipPrimitive) {\n    this._clips.push(clip);\n  }\n  /** Create and append a new ClipPrimitive to the array given a shape as an array of points. Returns true if successful. */\n  public appendShape(shape: Point3d[], zLow?: number, zHigh?: number,\n    transform?: Transform, isMask: boolean = false, invisible: boolean = false): boolean {\n    const clip = ClipShape.createShape(shape, zLow, zHigh, transform, isMask, invisible);\n    if (!clip)\n      return false;\n    this._clips.push(clip);\n    return true;\n  }\n  /** Returns true if the given point lies inside all of this ClipVector's ClipShapes (by rule of intersection).*/\n  public pointInside(point: Point3d, onTolerance: number = Geometry.smallMetricDistanceSquared): boolean {\n    return this.isPointOnOrInside(point, onTolerance);\n  }\n  /**\n   * Method from [[Clipper]] interface.\n   * * Implement as dispatch to clipPlaneSets as supplied by derived class.\n   */\n  public isPointOnOrInside(point: Point3d, onTolerance: number = Geometry.smallMetricDistanceSquared): boolean {\n    if (!this.boundingRange.isNull && !this.boundingRange.containsPoint(point))\n      return false;\n\n    for (const clip of this._clips) {\n      if (!clip.pointInside(point, onTolerance))\n        return false;\n    }\n    return true;\n  }\n  // Proxy object to implement line and arc clip.\n  private _clipNodeProxy?: BooleanClipNodeIntersection;\n  private ensureProxyClipNode(): boolean {\n    if (this._clipNodeProxy)\n      return true;\n    this._clipNodeProxy = new BooleanClipNodeIntersection(true);\n    let numChildren = 0;\n    for (const child of this._clips) {\n      const q = child.fetchClipPlanesRef();\n      if (q) {\n        numChildren++;\n        this._clipNodeProxy.captureChild(q);\n      }\n    }\n    return numChildren > 0;\n  }\n  /**\n   * Method from [[Clipper]] interface.\n   * * Implement as dispatch to clipPlaneSets as supplied by derived class.\n   */\n  public announceClippedSegmentIntervals(\n    f0: number, f1: number, pointA: Point3d, pointB: Point3d, announce?: AnnounceNumberNumber,\n  ): boolean {\n    this.ensureProxyClipNode();\n    if (this._clipNodeProxy)\n      return this._clipNodeProxy.announceClippedSegmentIntervals(f0, f1, pointA, pointB, announce);\n    return false;\n  }\n  /** Method from [[Clipper]] interface.\n   * * Implement as dispatch to clipPlaneSets as supplied by derived class.\n   */\n  public announceClippedArcIntervals(arc: Arc3d, announce?: AnnounceNumberNumberCurvePrimitive): boolean {\n    this.ensureProxyClipNode();\n    if (this._clipNodeProxy)\n      return this._clipNodeProxy.announceClippedArcIntervals(arc, announce);\n    return false;\n  }\n  /** Execute polygon clip as intersection of the child primitives. */\n  public appendPolygonClip(\n    xyz: IndexedXYZCollection,\n    insideFragments: GrowableXYZArray[],\n    outsideFragments: GrowableXYZArray[],\n    arrayCache: GrowableXYZArrayCache) {\n    this.ensureProxyClipNode();\n    if (this._clipNodeProxy)\n      this._clipNodeProxy.appendPolygonClip(xyz, insideFragments, outsideFragments, arrayCache);\n  }\n  /**\n   * Transforms this ClipVector to a new coordinate-system.\n   * Note that if the transform has rotate and scale the boundingRange member expands.\n   * Returns true if successful.\n   */\n  public transformInPlace(transform: Transform): boolean {\n    for (const clip of this._clips)\n      if (clip.transformInPlace(transform) === false)\n        return false;\n\n    if (!this.boundingRange.isNull)\n      transform.multiplyRange(this.boundingRange, this.boundingRange);\n\n    return true;\n  }\n  /**\n   * A simple way of packaging this ClipVector's ClipShape points into a multidimensional array, while also\n   * taking into account each ClipPrimitive's individual transforms.\n   * ClipPrimitives OTHER THAN ClipShape are ignored.\n   * Information out:\n   *  - All of the loop points are stored in the multidimensional Point3d array given (will return unchanged upon failure).\n   *  - If given a transform, will be set from the transformFromClip of the first ClipPrimitive.\n   *  - The ClipMask of the final ClipPrimitive is stored in the returned array at index 0.\n   *  - The last valid zLow found is stored in the returned array at index 1.\n   *  - The last valid zHigh found is stored in the returned array at index 2.\n   */\n  public extractBoundaryLoops(loopPoints: Point3d[][], transform?: Transform): number[] {\n    let clipM = ClipMaskXYZRangePlanes.None;\n    let zBack = -Number.MAX_VALUE;\n    let zFront = Number.MAX_VALUE;\n    const retVal: number[] = [];\n    let nLoops = 0;\n\n    if (this._clips.length === 0)\n      return retVal;\n    let firstClipShape: ClipShape | undefined;\n    const deltaTrans = Transform.createIdentity();\n\n    for (const clip of this._clips) {\n      if (clip instanceof ClipShape) {\n        if (firstClipShape !== undefined && clip !== firstClipShape) {      // Is not the first iteration\n          let fwdTrans = Transform.createIdentity();\n          let invTrans = Transform.createIdentity();\n\n          if (firstClipShape.transformValid && clip.transformValid) {\n            fwdTrans = clip.transformFromClip!.clone();\n            invTrans = firstClipShape.transformToClip!.clone();\n          }\n          deltaTrans.setFrom(invTrans.multiplyTransformTransform(fwdTrans));\n        }\n        if (!firstClipShape)\n          firstClipShape = clip;\n        loopPoints[nLoops] = [];\n\n        if (clip.polygon !== undefined) {\n          clipM = ClipMaskXYZRangePlanes.XAndY;\n\n          if (clip.zHighValid) {\n            clipM = clipM | ClipMaskXYZRangePlanes.ZHigh;\n            zFront = clip.zHigh!;\n          }\n          if (clip.zLowValid) {\n            clipM = clipM | ClipMaskXYZRangePlanes.ZLow;\n            zBack = clip.zLow!;\n          }\n\n          for (const point of clip.polygon)\n            loopPoints[nLoops].push(point.clone());\n          deltaTrans.multiplyPoint3dArray(loopPoints[nLoops], loopPoints[nLoops]);\n          nLoops++;\n        }\n      }\n    }\n    retVal.push(clipM);\n    retVal.push(zBack);\n    retVal.push(zFront);\n    if (transform && firstClipShape)\n      transform.setFrom(firstClipShape.transformFromClip!);\n    return retVal;\n  }\n  /** Sets this ClipVector and all of its members to the visibility specified. */\n  public setInvisible(invisible: boolean) {\n    for (const clip of this._clips)\n      clip.setInvisible(invisible);\n  }\n  /**\n   * For every clip, parse the member point array into the member clip plane object (only for clipPlanes member,\n   * not the mask)\n   */\n  public parseClipPlanes() {\n    for (const clip of this._clips)\n      clip.fetchClipPlanesRef();\n  }\n  /**\n   * Multiply all ClipPlanes DPoint4d by matrix.\n   * @param matrix matrix to apply.\n   * @param invert if true, use in verse of the matrix.\n   * @param transpose if true, use the transpose of the matrix (or inverse, per invert parameter)\n   * * Note that if matrixA is applied to all of space, the matrix to send to this method to get a corresponding effect on the plane is the inverse transpose of matrixA\n   * * Callers that will apply the same matrix to many planes should pre-invert the matrix for efficiency.\n   * * Both params default to true to get the full effect of transforming space.\n   * @param matrix matrix to apply\n   * @returns false if matrix inversion fails.\n   */\n  public multiplyPlanesByMatrix4d(matrix: Matrix4d, invert: boolean = true, transpose: boolean = true): boolean {\n    if (invert) {  // form inverse once here, reuse for all planes\n      const inverse = matrix.createInverse();\n      if (!inverse)\n        return false;\n      return this.multiplyPlanesByMatrix4d(inverse, false, transpose);\n    }\n    // no inverse necessary -- lower level cannot fail.\n    for (const clip of this._clips)\n      clip.multiplyPlanesByMatrix4d(matrix, false, transpose);\n    return true;\n  }\n  /**\n   * Determines whether the given points fall inside or outside this set of ClipShapes. If any set is defined\n   * by masking planes, checks the mask planes only, provided that ignoreMasks is false. Otherwise, checks the\n   * _clipPlanes member.\n   */\n  public classifyPointContainment(points: Point3d[], ignoreMasks: boolean = false): ClipPlaneContainment {\n    let currentContainment = ClipPlaneContainment.Ambiguous;\n\n    for (const primitive of this._clips) {\n      const thisContainment = primitive.classifyPointContainment(points, ignoreMasks);\n\n      if (ClipPlaneContainment.Ambiguous === thisContainment)\n        return ClipPlaneContainment.Ambiguous;\n\n      if (ClipPlaneContainment.Ambiguous === currentContainment)\n        currentContainment = thisContainment;\n      else if (currentContainment !== thisContainment)\n        return ClipPlaneContainment.Ambiguous;\n    }\n    return currentContainment;\n  }\n  /**\n   * Determines whether a 3D range lies inside or outside this set of ClipShapes. If any set is defined by masking planes,\n   * checks the mask planes only, provided that ignoreMasks is false. Otherwise, checks the clip planes member.\n   */\n  public classifyRangeContainment(range: Range3d, ignoreMasks: boolean): ClipPlaneContainment {\n    const corners: Point3d[] = range.corners();\n    return this.classifyPointContainment(corners, ignoreMasks);\n  }\n  /**\n   * For an array of points (making up a LineString), tests whether the segment between each point lies inside the\n   * ClipVector.\n   * If true, returns true immediately.\n   */\n  public isAnyLineStringPointInside(points: Point3d[]): boolean {\n    for (const clip of this._clips) {\n      const clipPlaneSet = clip.fetchClipPlanesRef();\n      if (clipPlaneSet !== undefined) {\n        for (let i = 0; i + 1 < points.length; i++) {\n          const segment = LineSegment3d.create(points[i], points[i + 1]);\n          if (clipPlaneSet.isAnyPointInOrOnFromSegment(segment))\n            return true;\n        }\n      }\n    }\n    return false;\n  }\n  /** Note: Line segments are used to represent 1 dimensional intervals here, rather than segments. */\n  public sumSizes(intervals: Segment1d[], begin: number, end: number): number {\n    let s = 0.0;\n    for (let i = begin; i < end; i++)\n      s += (intervals[i].x1 - intervals[i].x0);\n    return s;\n  }\n  private static readonly _TARGET_FRACTION_SUM = 0.99999999;\n  /**\n   * For an array of points that make up a LineString, develops a line segment between each point pair,\n   * and returns true if all segments lie inside this ClipVector.\n   */\n  public isLineStringCompletelyContained(points: Point3d[]): boolean {\n    const clipIntervals: Segment1d[] = [];\n\n    for (let i = 0; i + 1 < points.length; i++) {\n      const segment = LineSegment3d.create(points[i], points[i + 1]);\n      let fractionSum = 0.0;\n      let index0 = 0;\n\n      for (const clip of this._clips) {\n        const clipPlaneSet = clip.fetchClipPlanesRef();\n        if (clipPlaneSet !== undefined) {\n          clipPlaneSet.appendIntervalsFromSegment(segment, clipIntervals);\n          const index1 = clipIntervals.length;\n          fractionSum += this.sumSizes(clipIntervals, index0, index1);\n          index0 = index1;\n          // ASSUME primitives are non-overlapping...\n          if (fractionSum >= ClipVector._TARGET_FRACTION_SUM)\n            break;\n        }\n      }\n      if (fractionSum < ClipVector._TARGET_FRACTION_SUM)\n        return false;\n    }\n    return true;\n  }\n  /**\n   * Serializes this ClipVector to a compact string representation appropriate for transmission as part of a URL.\n   * Chiefly used for requesting [Tile]($frontend)s with section cut facets.\n   * UnionOfConvexClipPlaneSets is obtained for each ClipPrimitive. The encoding is as follows:\n   *  ClipVector:\n   *    ClipPrimitive[]\n   *    _\n   *  ClipPrimitive:\n   *    invisible: 0|1\n   *    ConvexClipPlaneSet[]\n   *    _\n   *  ConvexClipPlaneSet:\n   *    ClipPlane[]\n   *    _\n   *  ClipPlane:\n   *    flags: 0|1|2|3, where 1=invisible and 2=interior\n   *    inwardNormal: Number[3]\n   *    distance: Number\n   *  Number:\n   *    number\n   *    _\n   */\n  public toCompactString(): string {\n    function formatNumber(num: number) {\n      return `${num.toString()}_`;\n    }\n    function formatVector3d(vec: Vector3d) {\n      return `${formatNumber(vec.x)}${formatNumber(vec.y)}${formatNumber(vec.z)}`;\n    }\n    function formatFlags(flags: number) {\n      const f = flags.toString();\n      assert(1 === f.length);\n      return f;\n    }\n    function formatPlane(plane: ClipPlane) {\n      let flags = plane.invisible ? 1 : 0;\n      flags |= (plane.interior ? 2 : 0);\n      return `${formatFlags(flags)}${formatVector3d(plane.inwardNormalRef)}${formatNumber(plane.distance)}`;\n    }\n    function formatPlaneSet(set: ConvexClipPlaneSet) {\n      let planes = \"\";\n      for (const plane of set.planes)\n        planes = `${planes}${formatPlane(plane)}`;\n\n      return `${planes}_`;\n    }\n    function formatPrimitive(prim: ClipPrimitive) {\n      const flags = prim.invisible ? 1 : 0;\n      let str = flags.toString();\n      assert(1 === str.length);\n\n      const union = prim.fetchClipPlanesRef();\n      if (union) {\n        for (const s of union.convexSets)\n          str = `${str}${formatPlaneSet(s)}`;\n      }\n      return `${str}_`;\n    }\n    let result = \"\";\n    for (const primitive of this.clips)\n      result = `${result}${formatPrimitive(primitive)}`;\n    return `${result}_`;\n  }\n}\n\n/**\n * Bundles a [[ClipVector]] with its compact string representation.\n * @note The string representation is computed once; the ClipVector is assumed not to be subsequently modified.\n * @see [[StringifiedClipVector.fromClipVector]] to create from a ClipVector.\n * @see [[ClipVector.toCompactString]] for a description of the string representation.\n * @alpha\n */\nexport type StringifiedClipVector = ClipVector & { readonly clipString: string };\n\n/**\n * Bundles a ClipVector with its compact string representation.\n * @note The string representation is computed once; the ClipVector is assumed not to be subsequently modified.\n * @alpha\n */\nexport namespace StringifiedClipVector { // eslint-disable-line @typescript-eslint/no-redeclare\n  /** Create from a ClipVector.\n   * @param clip The ClipVector to stringify.\n   * @returns The input ClipVector with its compact string representation, or undefined if the input is undefined or empty.\n   * @note The string representation is computed once; the ClipVector is assumed not to be subsequently modified.\n   */\n  export function fromClipVector(clip?: ClipVector): StringifiedClipVector | undefined {\n    if (!clip || !clip.isValid)\n      return undefined;\n\n    const ret = clip as any;\n    if (undefined === ret.clipString)\n      ret.clipString = clip.toCompactString();\n\n    const stringified = ret as StringifiedClipVector;\n    assert(undefined !== stringified.clipString);\n    return stringified;\n  }\n}\n"]}