@itwin/core-geometry 4.3.0-dev.14 → 4.3.0-dev.16

package/lib/esm/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;AAIH,OAAO,EAAE,WAAW,EAAE,MAAM,0BAA0B,CAAC;AACvD,OAAO,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAC;AACrD,OAAO,EAA4D,cAAc,EAAE,MAAM,yBAAyB,CAAC;AAEnH,OAAO,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAC;AACrD,OAAO,EAAE,IAAI,EAAE,MAAM,eAAe,CAAC;AACrC,OAAO,EAAE,IAAI,EAAE,MAAM,eAAe,CAAC;AACrC,OAAO,EAAE,kBAAkB,EAAE,SAAS,EAAE,MAAM,oBAAoB,CAAC;AACnE,OAAO,EAAE,WAAW,EAAE,MAAM,sBAAsB,CAAC;AACnD,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AACvC,OAAO,EAAE,YAAY,EAAE,MAAM,4BAA4B,CAAC;AAE1D,OAAO,EAAE,gBAAgB,EAAE,MAAM,gCAAgC,CAAC;AAGlE,OAAO,EAAE,mBAAmB,EAAE,MAAM,mCAAmC,CAAC;AACxE,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAClE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AACvD,OAAO,EAAE,qBAAqB,EAAE,MAAM,mCAAmC,CAAC;AAG1E,OAAO,EAAE,eAAe,EAAE,MAAM,6BAA6B,CAAC;AAC9D,OAAO,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AACxC,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAChD,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAC1C,OAAO,EAAE,kBAAkB,EAAE,MAAM,sBAAsB,CAAC;AAC1D,OAAO,EAAE,8BAA8B,EAAE,MAAM,mDAAmD,CAAC;AACnG,OAAO,EAAE,0BAA0B,EAAE,MAAM,8BAA8B,CAAC;AAE1E;;;GAGG;AACH,MAAM,CAAN,IAAY,oBAOX;AAPD,WAAY,oBAAoB;IAC9B,yBAAyB;IACzB,mFAAkB,CAAA;IAClB,oCAAoC;IACpC,yEAAa,CAAA;IACb,0BAA0B;IAC1B,qFAAmB,CAAA;AACrB,CAAC,EAPW,oBAAoB,KAApB,oBAAoB,QAO/B;AACD;;;GAGG;AACH,MAAM,CAAN,IAAY,cAOX;AAPD,WAAY,cAAc;IACxB,4DAA4D;IAC5D,2DAAY,CAAA;IACZ,6DAA6D;IAC7D,8DAAc,CAAA;IACd,6CAA6C;IAC7C,uEAAkB,CAAA;AACpB,CAAC,EAPW,cAAc,KAAd,cAAc,QAOzB;AAED;;;GAGG;AACH,MAAM,CAAN,IAAY,UAOX;AAPD,WAAY,UAAU;IACpB,kDAAkD;IAClD,2DAAY,CAAA;IACZ,kCAAkC;IAClC,6DAAa,CAAA;IACb,iCAAiC;IACjC,6DAAa,CAAA;AACf,CAAC,EAPW,UAAU,KAAV,UAAU,QAOrB;AAmED;;;GAGG;AACH,MAAa,aAAa;IAOxB;;;;;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;YAC1B,EAAE,GAAG,iBAAiB,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC;YAC3C,IAAI,EAAE,GAAG,EAAE,GAAG,QAAQ,CAAC,aAAa,EAAE;gBACpC,IAAI,GAAG,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;gBACvB,IAAI,IAAI,IAAI,GAAG,IAAI,IAAI,IAAI,GAAG,EAAE;oBAC9B,KAAK,CAAC,eAAe,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;oBACvC,IAAI,OAAO,CAAC,iBAAiB,CAAC,SAAS,CAAC,EAAE;wBACxC,IAAI,QAAQ;4BACV,QAAQ,CAAC,EAAE,EAAE,EAAE,EAAE,KAAK,CAAC,CAAC;;4BAExB,OAAO,IAAI,CAAC;qBACf;iBACF;gBACD,EAAE,GAAG,EAAE,CAAC;aACT;SACF;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,WAAW,CACvB,SAAoB,EAAE,EAAkB,EAAE,QAA6C;QAEvF,IAAI,QAAQ,EAAE;YACZ,KAAK,MAAM,EAAE,IAAI,SAAS,EAAE;gBAC1B,QAAQ,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;aAC/B;SACF;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;gBAC3B,MAAM,YAAY,GAAG,MAAM,CAAC,iBAAiB,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;gBACpE,IAAI,YAAY;oBACd,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;aAC7B;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,uEAAuE;QACvE,uEAAuE;QACvE,MAAM,YAAY,GAAG,aAAa,CAAC,cAAc,GAAG,YAAY,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;QACvE,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,YAAY,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,qBAAqB,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;YACtC,MAAM,IAAI,GAAG,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC;YAC1C,IAAI,CAAC,mBAAmB,CAAC,YAAY,CAAC,CAAC;YACvC,MAAM,kBAAkB,GAAG,SAAS,CAAC,eAAe,CAAC,WAAW,EAAE,IAAI,EAAE,kBAAkB,CAAC,YAAY,CAAC,CAAC;YACzG,IAAI,kBAAkB,EAAE;gBACtB,kBAAkB,CAAC,mBAAmB,CAAC,YAAY,CAAC,CAAC;gBACrD,IAAI,CAAC,MAAM;oBACT,MAAM,GAAG,CAAC,kBAAkB,YAAY,WAAW,CAAC,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC,CAAC,WAAW,CAAC,MAAM,CAAC,kBAAkB,CAAC,CAAC;qBAChH,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC,kBAAkB,CAAC;oBAC9C,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAI,kBAAkC,CAAC,QAAQ,CAAC,CAAC;aACzE;SACF;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,YAAY,CAAC,KAAe,EAAE,OAAgB;QAC1D,IAAI,KAAK,YAAY,cAAc;YACjC,OAAO,aAAa,CAAC,oBAAoB,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;QAC5D,IAAI,KAAK,CAAC,WAAW,EAAE,EAAE;YACvB,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;SACzB;QACD,MAAM,MAAM,GAAe,EAAE,CAAC;QAC9B,IAAI,KAAK,YAAY,IAAI,IAAI,KAAK,YAAY,WAAW,EAAE;YACzD,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,QAAQ,EAAE;gBAClC,MAAM,WAAW,GAAG,aAAa,CAAC,YAAY,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;gBAC/D,MAAM,CAAC,IAAI,CAAC,GAAG,WAAW,CAAC,CAAC;aAC7B;SACF;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;YACX,OAAO,CAAC,WAAW,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;SACtC;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;YAC3C,IAAI,qBAAqB,GAAG,KAAK,EAAE,UAAU,GAAG,KAAK,CAAC;YAEtD,KAAK,MAAM,KAAK,IAAI,SAAS,CAAC,MAAM,EAAE;gBACpC,IAAI,SAAS,GAAG,CAAC,EAAE,UAAU,GAAG,CAAC,CAAC;gBAClC,MAAM,aAAa,GAAG,KAAK,CAAC,QAAQ,GAAG,SAAS,CAAC;gBAEjD,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;gBAChC,MAAM,OAAO,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC;gBAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;oBACtC,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;iBACxF;gBAED,UAAU,GAAG,CAAC,UAAU,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC;gBACpD,IAAI,SAAS,KAAK,CAAC,EAAE;oBACnB,qBAAqB,GAAG,IAAI,CAAC;oBAC7B,MAAM;iBACP;aACF;YAED,IAAI,CAAC,UAAU,EAAG,6CAA6C;gBAC7D,OAAO,UAAU,CAAC,aAAa,CAAC;YAClC,IAAI,CAAC,qBAAqB;gBACxB,OAAO,UAAU,CAAC,YAAY,CAAC;SAClC;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,gBAAgB,EAAE,CAAC;QACpC,IAAI,qBAAqB,EAAE;YACzB,0EAA0E;YAC1E,IAAI,SAAS,YAAY,kBAAkB,EAAE;gBAC3C,KAAK,MAAM,KAAK,IAAI,SAAS,CAAC,MAAM,EAAE;oBACpC,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,gBAAgB,EAAE,CAAC;oBAC3C,IAAI,oBAAoB,EAAE;wBACxB,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;qBAC7B;iBACF;aACF;iBAAM,EAAG,oCAAoC;gBAC5C,IAAI,qBAAqB,IAAI,SAAS,CAAC,SAAS,EAAE;oBAChD,YAAY;iBACb;qBAAM;oBACL,MAAM,oBAAoB,GAAG,SAAS,CAAC,cAAc,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;oBACnE,IAAI,oBAAoB;wBACtB,YAAY,CAAC,oBAAoB,CAAC,CAAC;iBACtC;aACF;SACF;QAED,IAAI,iBAAiB,EAAE;YACrB,2CAA2C;YAC3C,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,EAAE,CAAC;YAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;gBAC1B,MAAM,OAAO,GAAG,OAAO,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC;gBAC7C,MAAM,WAAW,GAAG,IAAI,gBAAgB,EAAE,CAAC;gBAC3C,MAAM,UAAU,GAAG,YAAY,CAAC,mBAAmB,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;gBACtE,IAAI,SAAS,YAAY,kBAAkB,EAAE;oBAC3C,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;iBAC7B;qBAAM;oBACL,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;iBACzC;aACF;SACF;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,0BAA0B,EAAE;YACrD,KAAK,MAAM,OAAO,IAAI,WAAW,CAAC,UAAU,EAAE;gBAC5C,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,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC;gBACjE,CAAC,EACD,qBAAqB,EAAE,iBAAiB,EAAE,qBAAqB,CAAC,CAAC;aACpE;SACF;aAAM,IAAI,WAAW,YAAY,kBAAkB,IAAI,WAAW,YAAY,SAAS,EAAE;YACxF,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,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC;YACjE,CAAC,EACD,qBAAqB,EAAE,iBAAiB,EAAE,qBAAqB,CAAC,CAAC;SACpE;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,8CAA8C,CAAC,SAA6B,EAAE,KAAc;QACxG,MAAM,MAAM,GAAG,OAAO,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,kBAAkB;YACvC,OAAO,IAAI,CAAC,8CAA8C,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;QAC7E,IAAI,OAAO,YAAY,0BAA0B,EAAE;YACjD,MAAM,UAAU,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC;YACxC,KAAK,MAAM,CAAC,IAAI,OAAO,CAAC,UAAU,EAAE;gBAClC,MAAM,MAAM,GAAG,IAAI,CAAC,8CAA8C,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;gBAC7E,UAAU,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;aAChC;YACD,OAAO,UAAU,CAAC;SACnB;QACD,IAAI,OAAO,YAAY,aAAa,EAAE;YACpC,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;SACtF;QACD,IAAI,OAAO,YAAY,UAAU,EAAE;YACjC,MAAM,iBAAiB,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;YACxC,KAAK,MAAM,CAAC,IAAI,OAAO,CAAC,KAAK,EAAE;gBAC7B,IAAI,oBAAoB,IAAI,CAAC,CAAC,SAAS,EAAE;oBACvC,sFAAsF;iBACvF;qBAAM;oBACL,MAAM,MAAM,GAAG,IAAI,CAAC,mCAAmC,CAAC,CAAC,EAAE,KAAK,EAAE,oBAAoB,CAAC,CAAC;oBACxF,iBAAiB,CAAC,SAAS,CAAC,MAAM,EAAE,iBAAiB,CAAC,CAAC;iBACxD;aACF;YACD,OAAO,iBAAiB,CAAC;SAE1B;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,kBAAkB;YACvC,OAAO,IAAI,CAAC,oCAAoC,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;QAEnE,IAAI,OAAO,YAAY,0BAA0B,EAAE;YACjD,KAAK,MAAM,CAAC,IAAI,OAAO,CAAC,UAAU,EAAE;gBAClC,IAAI,IAAI,CAAC,oCAAoC,CAAC,CAAC,EAAE,KAAK,CAAC;oBACrD,OAAO,IAAI,CAAC;aACf;YACD,OAAO,KAAK,CAAC;SACd;QAED,IAAI,OAAO,YAAY,aAAa,EAAE;YACpC,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;SAC5E;QAED,IAAI,OAAO,YAAY,UAAU,EAAE;YACjC,MAAM,iBAAiB,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;YACxC,KAAK,MAAM,CAAC,IAAI,OAAO,CAAC,KAAK,EAAE;gBAC7B,IAAI,oBAAoB,IAAI,CAAC,CAAC,SAAS,EAAE;oBACvC,sFAAsF;iBACvF;qBAAM;oBACL,MAAM,MAAM,GAAG,IAAI,CAAC,mCAAmC,CAAC,CAAC,EAAE,KAAK,EAAE,oBAAoB,CAAC,CAAC;oBACxF,iBAAiB,CAAC,SAAS,CAAC,MAAM,EAAE,iBAAiB,CAAC,CAAC;iBACxD;aACF;YACD,OAAO,CAAC,iBAAiB,CAAC,MAAM,CAAC;SAClC;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,gBAAgB,EAAE,CAAC;QACpC,IAAI,qBAAqB,EAAE;YACzB,0EAA0E;YAC1E,KAAK,MAAM,KAAK,IAAI,SAAS,CAAC,MAAM,EAAE;gBACpC,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;oBACxB,MAAM,WAAW,GAAG,IAAI,gBAAgB,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;iBACf;aACF;SACF;QAED,IAAI,iBAAiB,EAAE;YACrB,2CAA2C;YAC3C,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,EAAE,CAAC;YAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;gBAC1B,MAAM,OAAO,GAAG,OAAO,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC;gBAC7C,MAAM,WAAW,GAAG,IAAI,gBAAgB,EAAE,CAAC;gBAC3C,MAAM,UAAU,GAAG,YAAY,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;aACf;SACF;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;;;;;OASG;IACI,MAAM,CAAC,sBAAsB,CAClC,MAAe,EAAE,aAAwB,EAAE,MAAe,EAAE,aAAwB,EAAE,YAAqB;QAE3G,MAAM,aAAa,GAAG,aAAa,CAAC,cAAc,GAAG,aAAa,CAAC,OAAO,CAAC,aAAa,CAAC,cAAc,CAAC,CAAC;QACzG,IAAI,CAAC,aAAa;YAChB,OAAO,KAAK,CAAC;QACf,IAAI,QAAQ,GAAG,MAAM,CAAC;QACtB,IAAI,YAAY,EAAE;YAChB,QAAQ,GAAG,aAAa,CAAC,UAAU,GAAG,MAAM,CAAC,KAAK,CAAC,aAAa,CAAC,UAAU,CAAC,CAAC;YAC7E,QAAQ,CAAC,aAAa,CAAC,YAAY,CAAC,CAAC;SACtC;QACD,kFAAkF;QAClF,MAAM,cAAc,GAAG,aAAa,CAAC,0BAA0B,CAAC,aAAa,EAAE,aAAa,CAAC,CAAC;QAC9F,MAAM,OAAO,GAAG,eAAe,CAAC,MAAM,EAAE,CAAC;QACzC,OAAO,CAAC,uBAAuB,CAAC,cAAc,EAAE,MAAM,CAAC,CAAC;QACxD,MAAM,KAAK,GAAG,OAAO,CAAC,aAAa,EAAE,CAAC;QACtC,MAAM,OAAO,GAAG,aAAa,CAAC,YAAY,GAAG,kBAAkB,CAAC,oBAAoB,CAAC,KAAK,EAAE,aAAa,CAAC,YAAY,CAAC,CAAC,OAAO,CAAC;QAChI,OAAO,aAAa,CAAC,yBAAyB,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;IACpE,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,SAAS,CAAC,GAAQ;QAC9B,IAAI,GAAG,EAAE;YACP,IAAI,GAAG,CAAC,iBAAiB;mBACpB,GAAG,CAAC,+BAA+B;mBACnC,GAAG,CAAC,2BAA2B;gBAClC,OAAO,IAAI,CAAC;SACf;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;YACjD,OAAO,SAAS,CAAC,MAAM,GAAG,SAAS,EAAE;gBACnC,MAAM,CAAC,GAAG,SAAS,CAAC,GAAG,EAAE,CAAC;gBAC1B,UAAU,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;aAC3B;YACD,SAAS,CAAC,IAAI,CAAC,UAAU,CAAC,WAAW,CAAC,SAAS,CAAC,CAAC,CAAC;SACnD;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;YACzB,OAAO,8BAA8B,CAAC,wBAAwB,CAC5D,IAAI,mBAAmB,CAAC,MAAM,CAAC,EAAE,UAAU,EAAE,WAAW,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;SACrE;QACD,OAAO,8BAA8B,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;YACpD,iCAAiC;YACjC,OAAO;SACR;QACD,IAAI,EAAE,GAAG,EAAE,GAAG,GAAG,EAAE;YACjB,IAAI,EAAE,GAAG,GAAG;gBACV,QAAQ,CAAC,OAAO,EAAE,CAAC;SACtB;aAAM,IAAI,EAAE,GAAG,EAAE,GAAG,GAAG,EAAE;YACxB,2CAA2C;YAC3C,MAAM,QAAQ,GAAG,CAAC,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;YACjC,IAAI,EAAE,GAAG,GAAG,EAAE;gBACZ,OAAO,QAAQ,CAAC,uBAAuB,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;aACxD;iBAAM;gBACL,OAAO,QAAQ,CAAC,uBAAuB,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;aACxD;SACF;aAAM;YACL,2HAA2H;YAC3H,qFAAqF;YACrF,IAAI,EAAE,GAAG,GAAG,EAAE;gBACZ,QAAQ,CAAC,uBAAuB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;aAC5C;iBAAM,IAAI,EAAE,GAAG,GAAG,EAAE;gBACnB,QAAQ,CAAC,uBAAuB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;aAC5C;SACF;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;YACpB,IAAI,CAAC,0BAA0B,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,iBAAiB,CAAC,CAAC;YACjG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE;gBACpB,IAAI,CAAC,0BAA0B,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,iBAAiB,CAAC,CAAC;gBACjG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE;oBACpB,IAAI,CAAC,0BAA0B,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,iBAAiB,CAAC,CAAC;iBAClG;aACF;SACF;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;YACpD,6DAA6D;YAC7D,OAAO;SACR;QACD,IAAI,EAAE,GAAG,EAAE,GAAG,GAAG,EAAE;YACjB,IAAI,EAAE,GAAG,GAAG;gBACV,QAAQ,CAAC,OAAO,EAAE,CAAC;SACtB;aAAM,IAAI,EAAE,GAAG,EAAE,GAAG,GAAG,EAAE;YACxB,2CAA2C;YAC3C,MAAM,QAAQ,GAAG,CAAC,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;YACjC,IAAI,EAAE,GAAG,GAAG,EAAE;gBACZ,OAAO,QAAQ,CAAC,uBAAuB,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;aACxD;iBAAM;gBACL,OAAO,QAAQ,CAAC,uBAAuB,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;aACxD;SACF;aAAM;YACL,2HAA2H;YAC3H,qFAAqF;YACrF,IAAI,EAAE,GAAG,GAAG,EAAE;gBACZ,QAAQ,CAAC,uBAAuB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;aAC5C;iBAAM,IAAI,EAAE,GAAG,GAAG,EAAE;gBACnB,QAAQ,CAAC,uBAAuB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;aAC5C;SACF;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;YACxD,IAAI,CAAC,uBAAuB,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,cAAc,CAAC,CAAC;SACvF;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;YAC1C,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;SACN;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;YAC1C,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;SAChE;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,qBAAqB,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;YACxB,IAAI,CAAC,CAAC,iBAAiB,EAAE;gBACvB,OAAO,SAAS,KAAK,CAAC,KAAK,GAAG,UAAU,CAAC,GAAG,EAAE,CAAC,EAAE;oBAC/C,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;iBAC/B;gBACD,yBAAyB;gBACzB,MAAM,IAAI,GAAG,UAAU,CAAC;gBAAC,UAAU,GAAG,cAAc,CAAC;gBAAC,cAAc,GAAG,IAAI,CAAC;aAC7E;SACF;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,qBAAqB,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;YACxB,IAAI,CAAC,CAAC,iBAAiB,EAAE;gBACvB,oDAAoD;gBACpD,OAAO,SAAS,KAAK,CAAC,KAAK,GAAG,YAAY,CAAC,GAAG,EAAE,CAAC,EAAE;oBACjD,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;iBAC/B;gBACD,oDAAoD;gBACpD,OAAO,SAAS,KAAK,CAAC,KAAK,GAAG,aAAa,CAAC,GAAG,EAAE,CAAC,EAAE;oBAClD,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;iBAC/B;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;aAC3F;SACF;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;YACH,aAAa,CAAC,YAAY,EAAE,UAAU,EAAE,UAAU,CAAC,CAAC;YACpD,aAAa,CAAC,aAAa,EAAE,WAAW,EAAE,UAAU,CAAC,CAAC;SACvD;IACH,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,wBAAwB,CAAC,OAA2B;QAChE,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;QAC9B,MAAM,QAAQ,GAAG,OAAO,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;YACtB,MAAM,QAAQ,GAAG,kBAAkB,CAAC,WAAW,EAAE,CAAC;YAClD,QAAQ,CAAC,mBAAmB,CAAC,CAAC,CAAC,YAAY,EAAE,CAAC,CAAC;YAC/C,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;SAC5B;QACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;gBAC9B,MAAM,GAAG,GAAG,YAAY,CAAC,yBAAyB,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;gBACzE,IAAI,GAAG,EAAE;oBACP,IAAI,OAAO,CAAC,sBAAsB,CAAC,GAAG,EAAE,QAAQ,CAAC,EAAE;wBACjD,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,SAAS,CAAC,oBAAoB,CAAC,SAAS,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;wBACrE,IAAI,MAAM,EAAE;4BACV,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;yBAC5C;qBACF;iBACF;aACF;SACF;QACD,OAAO,0BAA0B,CAAC,gBAAgB,CAAC,WAAW,CAAC,CAAC;IAClE,CAAC;;AAj3Bc,yCAA2B,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;SANnD,aAAa;AAy3B1B,SAAS,aAAa,CACpB,SAA6B,EAC7B,WAA2C,EAC3C,UAAiC;IAEjC,IAAI,WAAW,KAAK,SAAS;QAC3B,UAAU,CAAC,cAAc,CAAC,SAAS,CAAC,CAAC;SAClC;QACH,KAAK,MAAM,CAAC,IAAI,SAAS;YACvB,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;KACvB;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;QACH,KAAK,MAAM,CAAC,IAAI,SAAS;YACvB,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;KACvB;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 { Arc3d } from \"../curve/Arc3d\";\r\nimport { AnyCurve, AnyRegion } from \"../curve/CurveTypes\";\r\nimport { BagOfCurves } from \"../curve/CurveCollection\";\r\nimport { CurveFactory } from \"../curve/CurveFactory\";\r\nimport { AnnounceNumberNumber, AnnounceNumberNumberCurvePrimitive, CurvePrimitive } from \"../curve/CurvePrimitive\";\r\nimport { GeometryQuery } from \"../curve/GeometryQuery\";\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 { 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 { XAndY } from \"../geometry3d/XYZProps\";\r\nimport { PolyfaceBuilder } from \"../polyface/PolyfaceBuilder\";\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    // Create \"local region\" which is the result of rotating region to make\r\n    // it parallel to the xy-plane and then translating it to the xy-plane.\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;\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        else if (!result.tryAddChild(clippedLocalRegion))\r\n          result.children.push(...(clippedLocalRegion as UnionRegion).children);\r\n      }\r\n    }\r\n    return result;\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   * 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 range in local coordinates of first geometry\r\n   * @param local0ToWorld placement transform for first geometry\r\n   * @param range1 range in local coordinates of second geometry\r\n   * @param local1ToWorld placement transform for second geometry. 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 = ClipUtilities._workTransform = local1ToWorld.inverse(ClipUtilities._workTransform);\r\n    if (!worldToLocal1)\r\n      return false;\r\n    let myRange1 = range1;\r\n    if (range1Margin) {\r\n      myRange1 = ClipUtilities._workRange = range1.clone(ClipUtilities._workRange);\r\n      myRange1.expandInPlace(range1Margin);\r\n    }\r\n    // convert range0 into a clipper in local1 coordinates, then intersect with range1\r\n    const local0ToLocal1 = worldToLocal1.multiplyTransformTransform(local0ToWorld, worldToLocal1);\r\n    const builder = PolyfaceBuilder.create();\r\n    builder.addTransformedRangeMesh(local0ToLocal1, range0);\r\n    const mesh0 = builder.claimPolyface();\r\n    const clipper = ClipUtilities._workClipper = ConvexClipPlaneSet.createConvexPolyface(mesh0, ClipUtilities._workClipper).clipper;\r\n    return ClipUtilities.doesClipperIntersectRange(clipper, myRange1);\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\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,OAAO,EAAE,MAAM,EAAE,MAAM,qBAAqB,CAAC;AAE7C,OAAO,EAAE,WAAW,EAAE,MAAM,0BAA0B,CAAC;AACvD,OAAO,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAC;AACrD,OAAO,EAA4D,cAAc,EAAE,MAAM,yBAAyB,CAAC;AAGnH,OAAO,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AACvD,OAAO,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAC;AACrD,OAAO,EAAE,IAAI,EAAE,MAAM,eAAe,CAAC;AACrC,OAAO,EAAE,IAAI,EAAE,MAAM,eAAe,CAAC;AACrC,OAAO,EAAE,kBAAkB,EAAE,SAAS,EAAE,MAAM,oBAAoB,CAAC;AACnE,OAAO,EAAE,WAAW,EAAE,MAAM,sBAAsB,CAAC;AACnD,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AACvC,OAAO,EAAE,YAAY,EAAE,MAAM,4BAA4B,CAAC;AAE1D,OAAO,EAAE,gBAAgB,EAAE,MAAM,gCAAgC,CAAC;AAGlE,OAAO,EAAE,mBAAmB,EAAE,MAAM,mCAAmC,CAAC;AACxE,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAClE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AACvD,OAAO,EAAE,qBAAqB,EAAE,MAAM,mCAAmC,CAAC;AAC1E,OAAO,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AAEpD,OAAO,EAAE,eAAe,EAAE,MAAM,6BAA6B,CAAC;AAC9D,OAAO,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AACxC,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAChD,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAC1C,OAAO,EAAE,kBAAkB,EAAE,MAAM,sBAAsB,CAAC;AAC1D,OAAO,EAAE,8BAA8B,EAAE,MAAM,mDAAmD,CAAC;AACnG,OAAO,EAAE,0BAA0B,EAAE,MAAM,8BAA8B,CAAC;AAE1E;;;GAGG;AACH,MAAM,CAAN,IAAY,oBAOX;AAPD,WAAY,oBAAoB;IAC9B,yBAAyB;IACzB,mFAAkB,CAAA;IAClB,oCAAoC;IACpC,yEAAa,CAAA;IACb,0BAA0B;IAC1B,qFAAmB,CAAA;AACrB,CAAC,EAPW,oBAAoB,KAApB,oBAAoB,QAO/B;AACD;;;GAGG;AACH,MAAM,CAAN,IAAY,cAOX;AAPD,WAAY,cAAc;IACxB,4DAA4D;IAC5D,2DAAY,CAAA;IACZ,6DAA6D;IAC7D,8DAAc,CAAA;IACd,6CAA6C;IAC7C,uEAAkB,CAAA;AACpB,CAAC,EAPW,cAAc,KAAd,cAAc,QAOzB;AAED;;;GAGG;AACH,MAAM,CAAN,IAAY,UAOX;AAPD,WAAY,UAAU;IACpB,kDAAkD;IAClD,2DAAY,CAAA;IACZ,kCAAkC;IAClC,6DAAa,CAAA;IACb,iCAAiC;IACjC,6DAAa,CAAA;AACf,CAAC,EAPW,UAAU,KAAV,UAAU,QAOrB;AAmED;;;GAGG;AACH,MAAa,aAAa;IAOxB;;;;;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;YAC1B,EAAE,GAAG,iBAAiB,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC;YAC3C,IAAI,EAAE,GAAG,EAAE,GAAG,QAAQ,CAAC,aAAa,EAAE;gBACpC,IAAI,GAAG,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;gBACvB,IAAI,IAAI,IAAI,GAAG,IAAI,IAAI,IAAI,GAAG,EAAE;oBAC9B,KAAK,CAAC,eAAe,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;oBACvC,IAAI,OAAO,CAAC,iBAAiB,CAAC,SAAS,CAAC,EAAE;wBACxC,IAAI,QAAQ;4BACV,QAAQ,CAAC,EAAE,EAAE,EAAE,EAAE,KAAK,CAAC,CAAC;;4BAExB,OAAO,IAAI,CAAC;qBACf;iBACF;gBACD,EAAE,GAAG,EAAE,CAAC;aACT;SACF;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,WAAW,CACvB,SAAoB,EAAE,EAAkB,EAAE,QAA6C;QAEvF,IAAI,QAAQ,EAAE;YACZ,KAAK,MAAM,EAAE,IAAI,SAAS,EAAE;gBAC1B,QAAQ,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;aAC/B;SACF;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;gBAC3B,MAAM,YAAY,GAAG,MAAM,CAAC,iBAAiB,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;gBACpE,IAAI,YAAY;oBACd,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;aAC7B;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,uEAAuE;QACvE,uEAAuE;QACvE,MAAM,YAAY,GAAG,aAAa,CAAC,cAAc,GAAG,YAAY,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;QACvE,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,YAAY,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,qBAAqB,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;YACtC,MAAM,IAAI,GAAG,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC;YAC1C,IAAI,CAAC,mBAAmB,CAAC,YAAY,CAAC,CAAC;YACvC,MAAM,kBAAkB,GAAG,SAAS,CAAC,eAAe,CAAC,WAAW,EAAE,IAAI,EAAE,kBAAkB,CAAC,YAAY,CAAC,CAAC;YACzG,IAAI,kBAAkB,EAAE;gBACtB,kBAAkB,CAAC,mBAAmB,CAAC,YAAY,CAAC,CAAC;gBACrD,IAAI,CAAC,MAAM;oBACT,MAAM,GAAG,CAAC,kBAAkB,YAAY,WAAW,CAAC,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC,CAAC,WAAW,CAAC,MAAM,CAAC,kBAAkB,CAAC,CAAC;qBAChH,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC,kBAAkB,CAAC;oBAC9C,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAI,kBAAkC,CAAC,QAAQ,CAAC,CAAC;aACzE;SACF;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,YAAY,CAAC,KAAe,EAAE,OAAgB;QAC1D,IAAI,KAAK,YAAY,cAAc;YACjC,OAAO,aAAa,CAAC,oBAAoB,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;QAC5D,IAAI,KAAK,CAAC,WAAW,EAAE,EAAE;YACvB,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;SACzB;QACD,MAAM,MAAM,GAAe,EAAE,CAAC;QAC9B,IAAI,KAAK,YAAY,IAAI,IAAI,KAAK,YAAY,WAAW,EAAE;YACzD,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,QAAQ,EAAE;gBAClC,MAAM,WAAW,GAAG,aAAa,CAAC,YAAY,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;gBAC/D,MAAM,CAAC,IAAI,CAAC,GAAG,WAAW,CAAC,CAAC;aAC7B;SACF;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;YACX,OAAO,CAAC,WAAW,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;SACtC;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;YAC3C,IAAI,qBAAqB,GAAG,KAAK,EAAE,UAAU,GAAG,KAAK,CAAC;YAEtD,KAAK,MAAM,KAAK,IAAI,SAAS,CAAC,MAAM,EAAE;gBACpC,IAAI,SAAS,GAAG,CAAC,EAAE,UAAU,GAAG,CAAC,CAAC;gBAClC,MAAM,aAAa,GAAG,KAAK,CAAC,QAAQ,GAAG,SAAS,CAAC;gBAEjD,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;gBAChC,MAAM,OAAO,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC;gBAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;oBACtC,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;iBACxF;gBAED,UAAU,GAAG,CAAC,UAAU,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC;gBACpD,IAAI,SAAS,KAAK,CAAC,EAAE;oBACnB,qBAAqB,GAAG,IAAI,CAAC;oBAC7B,MAAM;iBACP;aACF;YAED,IAAI,CAAC,UAAU,EAAG,6CAA6C;gBAC7D,OAAO,UAAU,CAAC,aAAa,CAAC;YAClC,IAAI,CAAC,qBAAqB;gBACxB,OAAO,UAAU,CAAC,YAAY,CAAC;SAClC;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,gBAAgB,EAAE,CAAC;QACpC,IAAI,qBAAqB,EAAE;YACzB,0EAA0E;YAC1E,IAAI,SAAS,YAAY,kBAAkB,EAAE;gBAC3C,KAAK,MAAM,KAAK,IAAI,SAAS,CAAC,MAAM,EAAE;oBACpC,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,gBAAgB,EAAE,CAAC;oBAC3C,IAAI,oBAAoB,EAAE;wBACxB,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;qBAC7B;iBACF;aACF;iBAAM,EAAG,oCAAoC;gBAC5C,IAAI,qBAAqB,IAAI,SAAS,CAAC,SAAS,EAAE;oBAChD,YAAY;iBACb;qBAAM;oBACL,MAAM,oBAAoB,GAAG,SAAS,CAAC,cAAc,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;oBACnE,IAAI,oBAAoB;wBACtB,YAAY,CAAC,oBAAoB,CAAC,CAAC;iBACtC;aACF;SACF;QAED,IAAI,iBAAiB,EAAE;YACrB,2CAA2C;YAC3C,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,EAAE,CAAC;YAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;gBAC1B,MAAM,OAAO,GAAG,OAAO,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC;gBAC7C,MAAM,WAAW,GAAG,IAAI,gBAAgB,EAAE,CAAC;gBAC3C,MAAM,UAAU,GAAG,YAAY,CAAC,mBAAmB,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;gBACtE,IAAI,SAAS,YAAY,kBAAkB,EAAE;oBAC3C,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;iBAC7B;qBAAM;oBACL,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;iBACzC;aACF;SACF;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,0BAA0B,EAAE;YACrD,KAAK,MAAM,OAAO,IAAI,WAAW,CAAC,UAAU,EAAE;gBAC5C,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,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC;gBACjE,CAAC,EACD,qBAAqB,EAAE,iBAAiB,EAAE,qBAAqB,CAAC,CAAC;aACpE;SACF;aAAM,IAAI,WAAW,YAAY,kBAAkB,IAAI,WAAW,YAAY,SAAS,EAAE;YACxF,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,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC;YACjE,CAAC,EACD,qBAAqB,EAAE,iBAAiB,EAAE,qBAAqB,CAAC,CAAC;SACpE;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,8CAA8C,CAAC,SAA6B,EAAE,KAAc;QACxG,MAAM,MAAM,GAAG,OAAO,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,kBAAkB;YACvC,OAAO,IAAI,CAAC,8CAA8C,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;QAC7E,IAAI,OAAO,YAAY,0BAA0B,EAAE;YACjD,MAAM,UAAU,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC;YACxC,KAAK,MAAM,CAAC,IAAI,OAAO,CAAC,UAAU,EAAE;gBAClC,MAAM,MAAM,GAAG,IAAI,CAAC,8CAA8C,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;gBAC7E,UAAU,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;aAChC;YACD,OAAO,UAAU,CAAC;SACnB;QACD,IAAI,OAAO,YAAY,aAAa,EAAE;YACpC,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;SACtF;QACD,IAAI,OAAO,YAAY,UAAU,EAAE;YACjC,MAAM,iBAAiB,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;YACxC,KAAK,MAAM,CAAC,IAAI,OAAO,CAAC,KAAK,EAAE;gBAC7B,IAAI,oBAAoB,IAAI,CAAC,CAAC,SAAS,EAAE;oBACvC,sFAAsF;iBACvF;qBAAM;oBACL,MAAM,MAAM,GAAG,IAAI,CAAC,mCAAmC,CAAC,CAAC,EAAE,KAAK,EAAE,oBAAoB,CAAC,CAAC;oBACxF,iBAAiB,CAAC,SAAS,CAAC,MAAM,EAAE,iBAAiB,CAAC,CAAC;iBACxD;aACF;YACD,OAAO,iBAAiB,CAAC;SAE1B;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,kBAAkB;YACvC,OAAO,IAAI,CAAC,oCAAoC,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;QAEnE,IAAI,OAAO,YAAY,0BAA0B,EAAE;YACjD,KAAK,MAAM,CAAC,IAAI,OAAO,CAAC,UAAU,EAAE;gBAClC,IAAI,IAAI,CAAC,oCAAoC,CAAC,CAAC,EAAE,KAAK,CAAC;oBACrD,OAAO,IAAI,CAAC;aACf;YACD,OAAO,KAAK,CAAC;SACd;QAED,IAAI,OAAO,YAAY,aAAa,EAAE;YACpC,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;SAC5E;QAED,IAAI,OAAO,YAAY,UAAU,EAAE;YACjC,MAAM,iBAAiB,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;YACxC,KAAK,MAAM,CAAC,IAAI,OAAO,CAAC,KAAK,EAAE;gBAC7B,IAAI,oBAAoB,IAAI,CAAC,CAAC,SAAS,EAAE;oBACvC,sFAAsF;iBACvF;qBAAM;oBACL,MAAM,MAAM,GAAG,IAAI,CAAC,mCAAmC,CAAC,CAAC,EAAE,KAAK,EAAE,oBAAoB,CAAC,CAAC;oBACxF,iBAAiB,CAAC,SAAS,CAAC,MAAM,EAAE,iBAAiB,CAAC,CAAC;iBACxD;aACF;YACD,OAAO,CAAC,iBAAiB,CAAC,MAAM,CAAC;SAClC;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,gBAAgB,EAAE,CAAC;QACpC,IAAI,qBAAqB,EAAE;YACzB,0EAA0E;YAC1E,KAAK,MAAM,KAAK,IAAI,SAAS,CAAC,MAAM,EAAE;gBACpC,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;oBACxB,MAAM,WAAW,GAAG,IAAI,gBAAgB,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;iBACf;aACF;SACF;QAED,IAAI,iBAAiB,EAAE;YACrB,2CAA2C;YAC3C,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,EAAE,CAAC;YAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;gBAC1B,MAAM,OAAO,GAAG,OAAO,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC;gBAC7C,MAAM,WAAW,GAAG,IAAI,gBAAgB,EAAE,CAAC;gBAC3C,MAAM,UAAU,GAAG,YAAY,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;aACf;SACF;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,SAAS,CAAC,cAAc,EAAE,CAAC;QACzC,MAAM,OAAO,GAAG,eAAe,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,kBAAkB,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;YACpB,MAAM,CAAC,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;gBAC1B,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;aAChC;SACF;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;YAC/D,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QAClB,IAAI,eAAe,GAAG,KAAK,CAAC;QAC5B,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE;YACrB,MAAM,OAAO,GAAG,aAAa,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YAClE,MAAM,OAAO,GAAG,kBAAkB,CAAC,mBAAmB,CAAC,KAAK,CAAC,CAAC;YAC9D,eAAe,GAAG,OAAO,CAAC,qBAAqB,CAAC,OAAO,EAAE,gBAAgB,CAAC,CAAC;SAC5E;aAAM,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE;YAC5B,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;SACrD;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;YAChB,QAAQ,GAAG,IAAI,CAAC,UAAU,GAAG,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YAC3D,QAAQ,CAAC,aAAa,CAAC,YAAY,CAAC,CAAC;SACtC;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,OAAO,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;YACP,IAAI,GAAG,CAAC,iBAAiB;mBACpB,GAAG,CAAC,+BAA+B;mBACnC,GAAG,CAAC,2BAA2B;gBAClC,OAAO,IAAI,CAAC;SACf;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;YACjD,OAAO,SAAS,CAAC,MAAM,GAAG,SAAS,EAAE;gBACnC,MAAM,CAAC,GAAG,SAAS,CAAC,GAAG,EAAE,CAAC;gBAC1B,UAAU,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;aAC3B;YACD,SAAS,CAAC,IAAI,CAAC,UAAU,CAAC,WAAW,CAAC,SAAS,CAAC,CAAC,CAAC;SACnD;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;YACzB,OAAO,8BAA8B,CAAC,wBAAwB,CAC5D,IAAI,mBAAmB,CAAC,MAAM,CAAC,EAAE,UAAU,EAAE,WAAW,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;SACrE;QACD,OAAO,8BAA8B,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;YACpD,iCAAiC;YACjC,OAAO;SACR;QACD,IAAI,EAAE,GAAG,EAAE,GAAG,GAAG,EAAE;YACjB,IAAI,EAAE,GAAG,GAAG;gBACV,QAAQ,CAAC,OAAO,EAAE,CAAC;SACtB;aAAM,IAAI,EAAE,GAAG,EAAE,GAAG,GAAG,EAAE;YACxB,2CAA2C;YAC3C,MAAM,QAAQ,GAAG,CAAC,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;YACjC,IAAI,EAAE,GAAG,GAAG,EAAE;gBACZ,OAAO,QAAQ,CAAC,uBAAuB,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;aACxD;iBAAM;gBACL,OAAO,QAAQ,CAAC,uBAAuB,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;aACxD;SACF;aAAM;YACL,2HAA2H;YAC3H,qFAAqF;YACrF,IAAI,EAAE,GAAG,GAAG,EAAE;gBACZ,QAAQ,CAAC,uBAAuB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;aAC5C;iBAAM,IAAI,EAAE,GAAG,GAAG,EAAE;gBACnB,QAAQ,CAAC,uBAAuB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;aAC5C;SACF;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;YACpB,IAAI,CAAC,0BAA0B,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,iBAAiB,CAAC,CAAC;YACjG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE;gBACpB,IAAI,CAAC,0BAA0B,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,iBAAiB,CAAC,CAAC;gBACjG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE;oBACpB,IAAI,CAAC,0BAA0B,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,iBAAiB,CAAC,CAAC;iBAClG;aACF;SACF;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;YACpD,6DAA6D;YAC7D,OAAO;SACR;QACD,IAAI,EAAE,GAAG,EAAE,GAAG,GAAG,EAAE;YACjB,IAAI,EAAE,GAAG,GAAG;gBACV,QAAQ,CAAC,OAAO,EAAE,CAAC;SACtB;aAAM,IAAI,EAAE,GAAG,EAAE,GAAG,GAAG,EAAE;YACxB,2CAA2C;YAC3C,MAAM,QAAQ,GAAG,CAAC,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;YACjC,IAAI,EAAE,GAAG,GAAG,EAAE;gBACZ,OAAO,QAAQ,CAAC,uBAAuB,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;aACxD;iBAAM;gBACL,OAAO,QAAQ,CAAC,uBAAuB,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;aACxD;SACF;aAAM;YACL,2HAA2H;YAC3H,qFAAqF;YACrF,IAAI,EAAE,GAAG,GAAG,EAAE;gBACZ,QAAQ,CAAC,uBAAuB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;aAC5C;iBAAM,IAAI,EAAE,GAAG,GAAG,EAAE;gBACnB,QAAQ,CAAC,uBAAuB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;aAC5C;SACF;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;YACxD,IAAI,CAAC,uBAAuB,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,cAAc,CAAC,CAAC;SACvF;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;YAC1C,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;SACN;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;YAC1C,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;SAChE;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,qBAAqB,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;YACxB,IAAI,CAAC,CAAC,iBAAiB,EAAE;gBACvB,OAAO,SAAS,KAAK,CAAC,KAAK,GAAG,UAAU,CAAC,GAAG,EAAE,CAAC,EAAE;oBAC/C,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;iBAC/B;gBACD,yBAAyB;gBACzB,MAAM,IAAI,GAAG,UAAU,CAAC;gBAAC,UAAU,GAAG,cAAc,CAAC;gBAAC,cAAc,GAAG,IAAI,CAAC;aAC7E;SACF;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,qBAAqB,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;YACxB,IAAI,CAAC,CAAC,iBAAiB,EAAE;gBACvB,oDAAoD;gBACpD,OAAO,SAAS,KAAK,CAAC,KAAK,GAAG,YAAY,CAAC,GAAG,EAAE,CAAC,EAAE;oBACjD,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;iBAC/B;gBACD,oDAAoD;gBACpD,OAAO,SAAS,KAAK,CAAC,KAAK,GAAG,aAAa,CAAC,GAAG,EAAE,CAAC,EAAE;oBAClD,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;iBAC/B;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;aAC3F;SACF;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;YACH,aAAa,CAAC,YAAY,EAAE,UAAU,EAAE,UAAU,CAAC,CAAC;YACpD,aAAa,CAAC,aAAa,EAAE,WAAW,EAAE,UAAU,CAAC,CAAC;SACvD;IACH,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,wBAAwB,CAAC,OAA2B;QAChE,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;QAC9B,MAAM,QAAQ,GAAG,OAAO,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;YACtB,MAAM,QAAQ,GAAG,kBAAkB,CAAC,WAAW,EAAE,CAAC;YAClD,QAAQ,CAAC,mBAAmB,CAAC,CAAC,CAAC,YAAY,EAAE,CAAC,CAAC;YAC/C,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;SAC5B;QACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;gBAC9B,MAAM,GAAG,GAAG,YAAY,CAAC,yBAAyB,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;gBACzE,IAAI,GAAG,EAAE;oBACP,IAAI,OAAO,CAAC,sBAAsB,CAAC,GAAG,EAAE,QAAQ,CAAC,EAAE;wBACjD,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,SAAS,CAAC,oBAAoB,CAAC,SAAS,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;wBACrE,IAAI,MAAM,EAAE;4BACV,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;yBAC5C;qBACF;iBACF;aACF;SACF;QACD,OAAO,0BAA0B,CAAC,gBAAgB,CAAC,WAAW,CAAC,CAAC;IAClE,CAAC;;AA97Bc,yCAA2B,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;SANnD,aAAa;AAs8B1B,SAAS,aAAa,CACpB,SAA6B,EAC7B,WAA2C,EAC3C,UAAiC;IAEjC,IAAI,WAAW,KAAK,SAAS;QAC3B,UAAU,CAAC,cAAc,CAAC,SAAS,CAAC,CAAC;SAClC;QACH,KAAK,MAAM,CAAC,IAAI,SAAS;YACvB,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;KACvB;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;QACH,KAAK,MAAM,CAAC,IAAI,SAAS;YACvB,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;KACvB;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 } 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 { 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 { XAndY } from \"../geometry3d/XYZProps\";\r\nimport { PolyfaceBuilder } from \"../polyface/PolyfaceBuilder\";\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    // Create \"local region\" which is the result of rotating region to make\r\n    // it parallel to the xy-plane and then translating it to the xy-plane.\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;\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        else if (!result.tryAddChild(clippedLocalRegion))\r\n          result.children.push(...(clippedLocalRegion as UnionRegion).children);\r\n      }\r\n    }\r\n    return result;\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\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"]}

package/lib/esm/numerics/Newton.js

@@ -247,7 +247,8 @@ export class Newton2dUnboundedWithDerivative extends AbstractNewtonIterator {
     computeStep() {
         if (this._func.evaluate(this._currentUV.x, this._currentUV.y)) {
             const fA = this._func.currentF;
-            if (SmallSystem.linearSystem2d(fA.vectorU.x, fA.vectorV.x, fA.vectorU.y, fA.vectorV.y, fA.origin.x, fA.origin.y, this._currentStep))
+            if ( // Given X_{n+1} = X_n - dX = X_n - JInv(X_n) F(X_n), we solve J(X_n) dX = F(X_n) for dX:
+            SmallSystem.linearSystem2d(fA.vectorU.x, fA.vectorV.x, fA.vectorU.y, fA.vectorV.y, fA.origin.x, fA.origin.y, this._currentStep))
                 return true;
         }
         return false;

package/lib/esm/numerics/Newton.js.map

@@ -1 +1 @@
-{"version":3,"file":"Newton.js","sourceRoot":"","sources":["../../../src/numerics/Newton.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAE/F;;GAEG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AACvC,OAAO,EAAE,yBAAyB,EAAE,MAAM,yCAAyC,CAAC;AACpF,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAClE,OAAO,EAAE,WAAW,EAAE,MAAM,eAAe,CAAC;AAE5C,0BAA0B;AAE1B;;;;GAIG;AACH,MAAM,OAAgB,sBAAsB;IAa1C;;;;;;;;;;;OAWG;IACH,YACE,oBAA4B,OAAO,EACnC,8BAAsC,CAAC,EACvC,gBAAwB,EAAE;QAM5B,sEAAsE;QAC5D,iBAAY,GAAW,CAAC,CAAC;QAOnC,uDAAuD;QAChD,kBAAa,GAAW,CAAC,CAAC;QAb/B,IAAI,CAAC,kBAAkB,GAAG,iBAAiB,CAAC;QAC5C,IAAI,CAAC,4BAA4B,GAAG,2BAA2B,CAAC;QAChE,IAAI,CAAC,cAAc,GAAG,aAAa,CAAC;IACtC,CAAC;IAWD;;;;;OAKG;IACI,eAAe,CAAC,KAAa;QAClC,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,kBAAkB,EAAE;YAC7C,IAAI,CAAC,YAAY,EAAE,CAAC;YACpB,OAAO,IAAI,CAAC,YAAY,IAAI,IAAI,CAAC,4BAA4B,CAAC;SAC/D;QACD,IAAI,CAAC,YAAY,GAAG,CAAC,CAAC;QACtB,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;;OAMG;IACI,aAAa;QAClB,IAAI,CAAC,YAAY,GAAG,CAAC,CAAC;QACtB,IAAI,CAAC,aAAa,GAAG,CAAC,CAAC;QACvB,OAAO,IAAI,CAAC,aAAa,EAAE,GAAG,IAAI,CAAC,cAAc,IAAI,IAAI,CAAC,WAAW,EAAE,EAAE;YACvE,IAAI,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,eAAe,EAAE,CAAC,IAAI,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,EAAE;gBAC/E,OAAO,IAAI,CAAC;aACb;YACD,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC;SAC9B;QACD,OAAO,KAAK,CAAC;IACf,CAAC;CACF;AACD;;;;GAIG;AACH,MAAM,OAAgB,oBAAoB;CAOzC;AACD;;;;;;GAMG;AACH,MAAM,OAAO,iBAAkB,SAAQ,sBAAsB;IAQ3D;;;OAGG;IACH,YAAmB,IAA0B;QAC3C,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IACpB,CAAC;IACD,+CAA+C;IACxC,IAAI,CAAC,CAAS;QACnB,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;QACnB,OAAO,IAAI,CAAC;IACd,CAAC;IACD,+CAA+C;IACxC,IAAI;QACT,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;IACD,qCAAqC;IAC9B,SAAS,CAAC,CAAS;QACxB,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC;IACnB,CAAC;IACD,sEAAsE;IAC/D,gBAAgB;QACrB,qFAAqF;QACrF,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC;IACvD,CAAC;IACD,0CAA0C;IACnC,WAAW;QAChB,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE;YACvC,MAAM,EAAE,GAAG,QAAQ,CAAC,yBAAyB,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,GAAG,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;YAC1G,IAAI,EAAE,KAAK,SAAS,EAAE;gBACpB,IAAI,CAAC,YAAY,GAAG,EAAE,CAAC;gBACvB,OAAO,IAAI,CAAC;aACb;SACF;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,qFAAqF;IAC9E,eAAe;QACpB,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,GAAG,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IACxE,CAAC;CACF;AAED;;;GAGG;AACH,MAAM,OAAgB,mBAAmB;CAKxC;AAED;;;;;;GAMG;AACH,MAAM,OAAO,sCAAuC,SAAQ,sBAAsB;IAahF;;;OAGG;IACH,YAAmB,IAAyB;QAC1C,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,WAAW,GAAG,MAAM,CAAC;IAC5B,CAAC;IACD,+CAA+C;IACxC,IAAI,CAAC,CAAS;QACnB,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;QACnB,OAAO,IAAI,CAAC;IACd,CAAC;IACD,+CAA+C;IACxC,IAAI;QACT,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;IACD,sEAAsE;IAC/D,gBAAgB;QACrB,qFAAqF;QACrF,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC;IACvD,CAAC;IACD,mEAAmE;IAC5D,WAAW;QAChB,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE;YACvC,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,SAAS;YACzC,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,WAAW,CAAC,EAAE;gBAC1D,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,aAAa;gBAC7C,MAAM,EAAE,GAAG,QAAQ,CAAC,yBAAyB,CAAC,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC;gBAChF,IAAI,EAAE,KAAK,SAAS,EAAE;oBACpB,IAAI,CAAC,YAAY,GAAG,EAAE,CAAC;oBACvB,OAAO,IAAI,CAAC;iBACb;aACF;SACF;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,qFAAqF;IAC9E,eAAe;QACpB,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,GAAG,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IACxE,CAAC;CACF;AAED;;;GAGG;AACH,MAAM,OAAgB,sBAAsB;IAyB1C;;;OAGG;IACH;QACE,IAAI,CAAC,QAAQ,GAAG,yBAAyB,CAAC,aAAa,EAAE,CAAC;IAC5D,CAAC;CACF;AAED;;;;;;;;;;;GAWG;AACH,MAAM,OAAO,+BAAgC,SAAQ,sBAAsB;IAMzE;;;OAGG;IACH,YAAmB,IAA4B;QAC7C,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,YAAY,GAAG,QAAQ,CAAC,UAAU,EAAE,CAAC;QAC1C,IAAI,CAAC,UAAU,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC;IACzC,CAAC;IACD,+DAA+D;IACxD,KAAK,CAAC,CAAS,EAAE,CAAS;QAC/B,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC1B,OAAO,IAAI,CAAC;IACd,CAAC;IACD,qDAAqD;IAC9C,IAAI;QACT,OAAO,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;IAC3B,CAAC;IACD,qDAAqD;IAC9C,IAAI;QACT,OAAO,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;IAC3B,CAAC;IACD,kHAAkH;IAC3G,gBAAgB;QACrB,iCAAiC;QACjC,wHAAwH;QACxH,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IACtG,CAAC;IACD;;;OAGG;IACI,WAAW;QAChB,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE;YAC7D,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC;YAC/B,IACE,WAAW,CAAC,cAAc,CACxB,EAAE,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,EAC1B,EAAE,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,EAC1B,EAAE,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,EACxB,IAAI,CAAC,YAAY,CAClB;gBAED,OAAO,IAAI,CAAC;SACf;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;OAEG;IACI,eAAe;QACpB,OAAO,QAAQ,CAAC,QAAQ,CACtB,IAAI,CAAC,YAAY,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,EACzD,IAAI,CAAC,YAAY,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAC1D,CAAC;IACJ,CAAC;CACF;AACD;;;;GAIG;AACH,MAAM,OAAO,YAAY;IACvB;;;;;;;;OAQG;IACI,MAAM,CAAC,WAAW,CACvB,CAAS,EACT,IAAuC,EACvC,UAA6C,EAC7C,oBAA4B,QAAQ,CAAC,kBAAkB;QAEvD,IAAI,YAAY,GAAG,CAAC,CAAC;QACrB,IAAI,SAAiB,CAAC;QACtB,MAAM,MAAM,GAAG,OAAO,CAAC;QACvB,KAAK,IAAI,SAAS,GAAG,CAAC,EAAE,SAAS,GAAG,EAAE,EAAE,SAAS,EAAE,EAAE;YACnD,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YAClB,MAAM,EAAE,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;YACzB,IAAI,CAAC,KAAK,SAAS,IAAI,EAAE,KAAK,SAAS,EAAE;gBACvC,MAAM,EAAE,GAAG,QAAQ,CAAC,2BAA2B,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;gBACvD,IAAI,EAAE,KAAK,SAAS;oBAClB,OAAO,SAAS,CAAC;gBACnB,CAAC,IAAI,EAAE,CAAC;gBACR,oDAAoD;gBACpD,SAAS,GAAG,iBAAiB,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC;gBACrD,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE;oBAC5B,YAAY,EAAE,CAAC;oBACf,IAAI,EAAE,KAAK,GAAG,IAAI,YAAY,GAAG,CAAC,EAAI,wCAAwC;wBAC5E,OAAO,CAAC,CAAC;iBACZ;qBAAM;oBACL,YAAY,GAAG,CAAC,CAAC;iBAClB;aACF;SACF;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;CACF","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n\r\n/** @packageDocumentation\r\n * @module Numerics\r\n */\r\n\r\nimport { Geometry } from \"../Geometry\";\r\nimport { Plane3dByOriginAndVectors } from \"../geometry3d/Plane3dByOriginAndVectors\";\r\nimport { Point2d, Vector2d } from \"../geometry3d/Point2dVector2d\";\r\nimport { SmallSystem } from \"./Polynomials\";\r\n\r\n// cspell:word currentdFdX\r\n\r\n/**\r\n * Base class for Newton iterations in various dimensions.\r\n * Dimension-specific classes carry all dimension-related data and answer generalized queries from this base class.\r\n * @internal\r\n */\r\nexport abstract class AbstractNewtonIterator {\r\n  /** Compute a step. The current x and function values must be retained for use in later method calls. */\r\n  public abstract computeStep(): boolean;\r\n  /**\r\n   * Return the current step size, scaled for use in tolerance tests.\r\n   * * This is a single number, typically the max of various per-dimension `dx/(1+x)` for the x and dx of that dimension.\r\n   */\r\n  public abstract currentStepSize(): number;\r\n  /**\r\n   * Apply the current step (in all dimensions).\r\n   * @param isFinalStep true if this is a final step.\r\n   */\r\n  public abstract applyCurrentStep(isFinalStep: boolean): boolean;\r\n  /**\r\n   * The constructor.\r\n   * @param stepSizeTarget tolerance to consider a single step converged.\r\n   * This number should be \"moderately\" strict. Because 2 successive convergences are required,\r\n   * it is expected that a first \"accept\" for (say) 10 to 14 digit step will be followed by another\r\n   * iteration. A well behaved newton would then hypothetically double the number of digits to\r\n   * 20 to 28. Since the IEEE double only carries 16 digits, this second-convergence step will\r\n   * typically achieve full precision.\r\n   * @param successiveConvergenceTarget number of successive convergences required for acceptance.\r\n   * @param maxIterations max number of iterations. A typical newton step converges in 3 to 6 iterations.\r\n   * Allow 15 to 20 to catch difficult cases.\r\n   */\r\n  protected constructor(\r\n    stepSizeTolerance: number = 1.0e-11,\r\n    successiveConvergenceTarget: number = 2,\r\n    maxIterations: number = 15,\r\n  ) {\r\n    this._stepSizeTolerance = stepSizeTolerance;\r\n    this._successiveConvergenceTarget = successiveConvergenceTarget;\r\n    this._maxIterations = maxIterations;\r\n  }\r\n  /** Number of consecutive steps which passed convergence condition. */\r\n  protected _numAccepted: number = 0;\r\n  /** Target number of successive convergences. */\r\n  protected _successiveConvergenceTarget: number;\r\n  /** Convergence target (the implementation-specific currentStepSize is compared to this). */\r\n  protected _stepSizeTolerance: number;\r\n  /** Max iterations allowed. */\r\n  protected _maxIterations: number;\r\n  /** Number of iterations (incremented at each step). */\r\n  public numIterations: number = 0;\r\n  /**\r\n   * Test if a step is converged.\r\n   * * Convergence is accepted with enough (_successiveConvergenceTarget) small steps (according to _stepSizeTolerance)\r\n   * occur in succession.\r\n   * @param delta step size as reported by currentStepSize.\r\n   */\r\n  public testConvergence(delta: number): boolean {\r\n    if (Math.abs(delta) < this._stepSizeTolerance) {\r\n      this._numAccepted++;\r\n      return this._numAccepted >= this._successiveConvergenceTarget;\r\n    }\r\n    this._numAccepted = 0;\r\n    return false;\r\n  }\r\n  /**\r\n   * Run iterations, calling various methods from base and derived classes:\r\n   * * computeStep -- typically evaluate derivatives and solve linear system.\r\n   * * currentStepSize -- return numeric measure of the step just computed by computeStep.\r\n   * * testConvergence -- test if the step from currentStepSize (along with recent steps) is converged.\r\n   * * applyCurrentStep -- apply the step to the independent variables.\r\n   */\r\n  public runIterations(): boolean {\r\n    this._numAccepted = 0;\r\n    this.numIterations = 0;\r\n    while (this.numIterations++ < this._maxIterations && this.computeStep()) {\r\n      if (this.testConvergence(this.currentStepSize()) && this.applyCurrentStep(true)) {\r\n        return true;\r\n      }\r\n      this.applyCurrentStep(false);\r\n    }\r\n    return false;\r\n  }\r\n}\r\n/**\r\n * Object to evaluate a newton function. The object must retain most-recent function and derivative\r\n * values for immediate query.\r\n * @internal\r\n */\r\nexport abstract class NewtonEvaluatorRtoRD {\r\n  /** Evaluate the function and its derivative at x. */\r\n  public abstract evaluate(x: number): boolean;\r\n  /** Most recent function value, i.e., f(x_n). */\r\n  public currentF!: number;\r\n  /** Most recent evaluated derivative, i.e., f'(x_n). */\r\n  public currentdFdX!: number;\r\n}\r\n/**\r\n * Newton iterator for use when both function and derivative can be evaluated.\r\n * To solve `f(x) = 0`, the Newton iteration is `x_{n+1} = x_n - dx = x_n - f(x_n)/f'(x_n)`.\r\n * To solve `f(x) = target` which is equivalent to solving  `g(x) = f(x) - target = 0`, the Newton iteration is\r\n * `x_{n+1} = x_n - dx = x_n - g(x_n)/g'(x_n) = x_n - (f(x_n)-target)/f'(x_n)`.\r\n * @internal\r\n */\r\nexport class Newton1dUnbounded extends AbstractNewtonIterator {\r\n  private _func: NewtonEvaluatorRtoRD;\r\n  /** Current step is dx. */\r\n  private _currentStep!: number;\r\n  /** Current X is x_n. */\r\n  private _currentX!: number;\r\n  /** The target */\r\n  private _target!: number;\r\n  /**\r\n   * Constructor for 1D newton iteration with derivatives.\r\n   * @param func function that returns both function value and derivative.\r\n   */\r\n  public constructor(func: NewtonEvaluatorRtoRD) {\r\n    super();\r\n    this._func = func;\r\n    this.setTarget(0);\r\n  }\r\n  /** Set the independent variable, i.e., x_n. */\r\n  public setX(x: number): boolean {\r\n    this._currentX = x;\r\n    return true;\r\n  }\r\n  /** Get the independent variable, i.e., x_n. */\r\n  public getX(): number {\r\n    return this._currentX;\r\n  }\r\n  /** Set the target function value. */\r\n  public setTarget(y: number): void {\r\n    this._target = y;\r\n  }\r\n  /** Move the current X by the just-computed step, i.e., `x_n - dx`. */\r\n  public applyCurrentStep(): boolean {\r\n    // console.log(this._currentX - this._currentStep); // print approximations for debug\r\n    return this.setX(this._currentX - this._currentStep);\r\n  }\r\n  /** Compute the univariate newton step. */\r\n  public computeStep(): boolean {\r\n    if (this._func.evaluate(this._currentX)) {\r\n      const dx = Geometry.conditionalDivideFraction(this._func.currentF - this._target, this._func.currentdFdX);\r\n      if (dx !== undefined) {\r\n        this._currentStep = dx;\r\n        return true;\r\n      }\r\n    }\r\n    return false;\r\n  }\r\n  /** Return the current step size as a relative number, i.e., `|dx / (1 + |x_n|)|`. */\r\n  public currentStepSize(): number {\r\n    return Math.abs(this._currentStep / (1.0 + Math.abs(this._currentX)));\r\n  }\r\n}\r\n\r\n/**\r\n * Object to evaluate a newton function (without derivative). The object must retain most-recent function value.\r\n * @internal\r\n */\r\nexport abstract class NewtonEvaluatorRtoR {\r\n  /** Evaluate function value into member currentF */\r\n  public abstract evaluate(x: number): boolean;\r\n  /** Most recent function evaluation, i.e., f(x_n). */\r\n  public currentF!: number;\r\n}\r\n\r\n/**\r\n * Newton iteration for a univariate function, using approximate derivatives.\r\n * To approximate the derivatives we use a small step `h`, i.e., `f'(x_n) = (f(x_n + h) - f(x_n)) / h`.\r\n * Therefore, to solve `f(x) = 0`, the iteration is\r\n * `x_{n+1} = x_n - dx = x_n - f(x_n)/f'(x_n) = x_n - f(x_n) * h / (f(x_n + h) - f(x_n))`.\r\n * @internal\r\n */\r\nexport class Newton1dUnboundedApproximateDerivative extends AbstractNewtonIterator {\r\n  private _func: NewtonEvaluatorRtoR;\r\n  /** Current step is dx. */\r\n  private _currentStep!: number;\r\n  /** Current X is x_n. */\r\n  private _currentX!: number;\r\n  /**\r\n   * Step size for approximate derivative for the iteration.\r\n   * * Initialized to 1e-8, which is appropriate for iteration in fraction space.\r\n   * * Should be larger for iteration with real distance as x.\r\n   */\r\n  public derivativeH: number; // h\r\n\r\n  /**\r\n   * Constructor for 1D newton iteration with approximate derivatives.\r\n   * @param func function that only returns function value (and not derivative).\r\n   */\r\n  public constructor(func: NewtonEvaluatorRtoR) {\r\n    super();\r\n    this._func = func;\r\n    this.derivativeH = 1.0e-8;\r\n  }\r\n  /** Set the independent variable, i.e., x_n. */\r\n  public setX(x: number): boolean {\r\n    this._currentX = x;\r\n    return true;\r\n  }\r\n  /** Get the independent variable, i.e., x_n. */\r\n  public getX(): number {\r\n    return this._currentX;\r\n  }\r\n  /** Move the current X by the just-computed step, i.e., `x_n - dx`. */\r\n  public applyCurrentStep(): boolean {\r\n    // console.log(this._currentX - this._currentStep); // print approximations for debug\r\n    return this.setX(this._currentX - this._currentStep);\r\n  }\r\n  /** Univariate newton step computed with approximate derivative. */\r\n  public computeStep(): boolean {\r\n    if (this._func.evaluate(this._currentX)) {\r\n      const fA = this._func.currentF; // f(x_n)\r\n      if (this._func.evaluate(this._currentX + this.derivativeH)) {\r\n        const fB = this._func.currentF; // f(x_n + h)\r\n        const dx = Geometry.conditionalDivideFraction(fA, (fB - fA) / this.derivativeH);\r\n        if (dx !== undefined) {\r\n          this._currentStep = dx;\r\n          return true;\r\n        }\r\n      }\r\n    }\r\n    return false;\r\n  }\r\n  /** Return the current step size as a relative number, i.e., `|dx / (1 + |x_n|)|`. */\r\n  public currentStepSize(): number {\r\n    return Math.abs(this._currentStep / (1.0 + Math.abs(this._currentX)));\r\n  }\r\n}\r\n\r\n/**\r\n * Object to evaluate a 2-parameter newton function with derivatives.\r\n * @internal\r\n */\r\nexport abstract class NewtonEvaluatorRRtoRRD {\r\n  /**\r\n   * Iteration controller calls this to ask for evaluation of the function and its two partial derivatives.\r\n   * * The implementation returns true, it must set the currentF object.\r\n   */\r\n  public abstract evaluate(x: number, y: number): boolean;\r\n  /**\r\n   * Most recent function evaluation as parts of the plane.\r\n   * * See doc of [[Newton2dUnboundedWithDerivative]] class for info on 2d newton method.\r\n   * * For current value (u,v) of the independent variable, and `F(u,v) := (x(u,v), y(u,v)), the returned plane has:\r\n   * * `origin.x` = x(u,v)\r\n   * * `origin.y` = y(u,v)\r\n   * * `vectorU.x` = dx/du\r\n   * * `vectorU.y` = dy/du\r\n   * * `vectorV.x` = dx/dv\r\n   * * `vectorV.y` = dy/dv\r\n   * * In other words, the plane stores the columns of the Jacobian matrix J of F: `vectorU` stores the partials\r\n   * of F with respect to u (the first column of J), and `vectorV` stores the partials of F with respect to v\r\n   * (the second column of J):\r\n   *\r\n   * `[vectorU.x   vectorV.x]`\r\n   *\r\n   * `[vectorU.y   vectorV.y]`\r\n   */\r\n  public currentF!: Plane3dByOriginAndVectors;\r\n  /**\r\n   * Constructor.\r\n   * * This creates a currentF object to (repeatedly) receive function and derivatives.\r\n   */\r\n  public constructor() {\r\n    this.currentF = Plane3dByOriginAndVectors.createXYPlane();\r\n  }\r\n}\r\n\r\n/**\r\n * Implement evaluation steps for newton iteration in 2 dimensions, using caller supplied NewtonEvaluatorRRtoRRD object.\r\n * * Suppose we want to find the roots of `F(u,v) := (x(u,v), y(u,v))`. Writing `X := (u,v)` and `F(X)` as column vectors,\r\n *  the 2D Newton's iteration to find a root of `F` is given by:\r\n * `X_{n+1} = X_n - dX = X_n - JInv(X_n)F(X_n)`, where `JInv` is the inverse of the Jacobian matrix `J`, and `J` is\r\n * defined as:\r\n *\r\n * `[dx/du   dx/dv]`\r\n *\r\n * `[dy/du   dy/dv]`\r\n * @internal\r\n */\r\nexport class Newton2dUnboundedWithDerivative extends AbstractNewtonIterator {\r\n  private _func: NewtonEvaluatorRRtoRRD;\r\n  /** Current step, or dX = (du, dv). */\r\n  private _currentStep: Vector2d;\r\n  /** Current uv parameters, or X_n = (u_n, v_n). */\r\n  private _currentUV: Point2d;\r\n  /**\r\n   * Constructor for 2D newton iteration with derivatives.\r\n   * @param func function that returns both function value and derivative.\r\n   */\r\n  public constructor(func: NewtonEvaluatorRRtoRRD) {\r\n    super();\r\n    this._func = func;\r\n    this._currentStep = Vector2d.createZero();\r\n    this._currentUV = Point2d.createZero();\r\n  }\r\n  /** Set the current uv parameters, i.e., `X_n = (u_n, v_n)`. */\r\n  public setUV(u: number, v: number): boolean {\r\n    this._currentUV.set(u, v);\r\n    return true;\r\n  }\r\n  /** Get the current u parameter of X_n, i.e., u_n. */\r\n  public getU(): number {\r\n    return this._currentUV.x;\r\n  }\r\n  /** Get the current v parameter of X_n, i.e., v_n. */\r\n  public getV(): number {\r\n    return this._currentUV.y;\r\n  }\r\n  /** Update the current uv parameter by currentStep, i.e., compute `X_{n+1} := X_n - dX = (u_n - du, v_n - dv)`. */\r\n  public applyCurrentStep(): boolean {\r\n    // print approximations for debug\r\n    // console.log(\"(\" + (this._currentUV.x - this._currentStep.x) + \",\" + (this._currentUV.y - this._currentStep.y) + \")\");\r\n    return this.setUV(this._currentUV.x - this._currentStep.x, this._currentUV.y - this._currentStep.y);\r\n  }\r\n  /**\r\n   * Evaluate the functions and derivatives at `X_n = (u_n, v_n)`, and solve the Jacobian matrix equation to\r\n   * compute `dX = (du, dv)`.\r\n   */\r\n  public computeStep(): boolean {\r\n    if (this._func.evaluate(this._currentUV.x, this._currentUV.y)) {\r\n      const fA = this._func.currentF;\r\n      if (\r\n        SmallSystem.linearSystem2d(\r\n          fA.vectorU.x, fA.vectorV.x,\r\n          fA.vectorU.y, fA.vectorV.y,\r\n          fA.origin.x, fA.origin.y,\r\n          this._currentStep,\r\n        )\r\n      )\r\n        return true;\r\n    }\r\n    return false;\r\n  }\r\n  /**\r\n   * Return the current relative step size, i.e., the larger absolute component of `dX / (1 + |X_n|)`\r\n   */\r\n  public currentStepSize(): number {\r\n    return Geometry.maxAbsXY(\r\n      this._currentStep.x / (1.0 + Math.abs(this._currentUV.x)),\r\n      this._currentStep.y / (1.0 + Math.abs(this._currentUV.y)),\r\n    );\r\n  }\r\n}\r\n/**\r\n * SimpleNewton has static methods for newton methods with evaluated functions presented as immediate arguments\r\n * (not function object).\r\n * @internal\r\n */\r\nexport class SimpleNewton {\r\n  /**\r\n   * Run a one-dimensional newton iteration with separate functions for function and derivative.\r\n   * * Completion is at 2 (TWO) successive passes at `absoluteTolerance + relTol * abs(x)`, where relTol is\r\n   * chosen internally.\r\n   * * `absoluteTolerance` is usually aggressively tight -- should come into play only for x near zero.\r\n   * * The `relTol` is fluffy (for instance around 1e-11) but in properly converging cases the extra pass after\r\n   * first success normally moves to full machine precision.\r\n   * * This is an open-loop newton -- it just runs, and returns undefined if anything bad happens.\r\n   */\r\n  public static runNewton1D(\r\n    x: number,\r\n    func: (x: number) => number | undefined,\r\n    derivative: (x: number) => number | undefined,\r\n    absoluteTolerance: number = Geometry.smallFloatingPoint,\r\n  ): number | undefined {\r\n    let numConverged = 0;\r\n    let tolerance: number;\r\n    const relTol = 1.0e-11;\r\n    for (let iteration = 0; iteration < 20; iteration++) {\r\n      const f = func(x);\r\n      const df = derivative(x);\r\n      if (f !== undefined && df !== undefined) {\r\n        const dx = Geometry.conditionalDivideCoordinate(f, df);\r\n        if (dx === undefined)\r\n          return undefined;\r\n        x -= dx;\r\n        // console.log(x); // print approximations for debug\r\n        tolerance = absoluteTolerance + Math.abs(x) * relTol;\r\n        if (Math.abs(dx) < tolerance) {\r\n          numConverged++;\r\n          if (dx === 0.0 || numConverged > 1)   // bypass convergence count on true 0 dx\r\n            return x;\r\n        } else {\r\n          numConverged = 0;\r\n        }\r\n      }\r\n    }\r\n    return undefined;\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"Newton.js","sourceRoot":"","sources":["../../../src/numerics/Newton.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAE/F;;GAEG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AACvC,OAAO,EAAE,yBAAyB,EAAE,MAAM,yCAAyC,CAAC;AACpF,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAClE,OAAO,EAAE,WAAW,EAAE,MAAM,eAAe,CAAC;AAE5C,0BAA0B;AAE1B;;;;GAIG;AACH,MAAM,OAAgB,sBAAsB;IAa1C;;;;;;;;;;;OAWG;IACH,YACE,oBAA4B,OAAO,EACnC,8BAAsC,CAAC,EACvC,gBAAwB,EAAE;QAM5B,sEAAsE;QAC5D,iBAAY,GAAW,CAAC,CAAC;QAOnC,uDAAuD;QAChD,kBAAa,GAAW,CAAC,CAAC;QAb/B,IAAI,CAAC,kBAAkB,GAAG,iBAAiB,CAAC;QAC5C,IAAI,CAAC,4BAA4B,GAAG,2BAA2B,CAAC;QAChE,IAAI,CAAC,cAAc,GAAG,aAAa,CAAC;IACtC,CAAC;IAWD;;;;;OAKG;IACI,eAAe,CAAC,KAAa;QAClC,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,kBAAkB,EAAE;YAC7C,IAAI,CAAC,YAAY,EAAE,CAAC;YACpB,OAAO,IAAI,CAAC,YAAY,IAAI,IAAI,CAAC,4BAA4B,CAAC;SAC/D;QACD,IAAI,CAAC,YAAY,GAAG,CAAC,CAAC;QACtB,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;;OAMG;IACI,aAAa;QAClB,IAAI,CAAC,YAAY,GAAG,CAAC,CAAC;QACtB,IAAI,CAAC,aAAa,GAAG,CAAC,CAAC;QACvB,OAAO,IAAI,CAAC,aAAa,EAAE,GAAG,IAAI,CAAC,cAAc,IAAI,IAAI,CAAC,WAAW,EAAE,EAAE;YACvE,IAAI,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,eAAe,EAAE,CAAC,IAAI,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,EAAE;gBAC/E,OAAO,IAAI,CAAC;aACb;YACD,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC;SAC9B;QACD,OAAO,KAAK,CAAC;IACf,CAAC;CACF;AACD;;;;GAIG;AACH,MAAM,OAAgB,oBAAoB;CAOzC;AACD;;;;;;GAMG;AACH,MAAM,OAAO,iBAAkB,SAAQ,sBAAsB;IAQ3D;;;OAGG;IACH,YAAmB,IAA0B;QAC3C,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IACpB,CAAC;IACD,+CAA+C;IACxC,IAAI,CAAC,CAAS;QACnB,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;QACnB,OAAO,IAAI,CAAC;IACd,CAAC;IACD,+CAA+C;IACxC,IAAI;QACT,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;IACD,qCAAqC;IAC9B,SAAS,CAAC,CAAS;QACxB,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC;IACnB,CAAC;IACD,sEAAsE;IAC/D,gBAAgB;QACrB,qFAAqF;QACrF,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC;IACvD,CAAC;IACD,0CAA0C;IACnC,WAAW;QAChB,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE;YACvC,MAAM,EAAE,GAAG,QAAQ,CAAC,yBAAyB,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,GAAG,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;YAC1G,IAAI,EAAE,KAAK,SAAS,EAAE;gBACpB,IAAI,CAAC,YAAY,GAAG,EAAE,CAAC;gBACvB,OAAO,IAAI,CAAC;aACb;SACF;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,qFAAqF;IAC9E,eAAe;QACpB,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,GAAG,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IACxE,CAAC;CACF;AAED;;;GAGG;AACH,MAAM,OAAgB,mBAAmB;CAKxC;AAED;;;;;;GAMG;AACH,MAAM,OAAO,sCAAuC,SAAQ,sBAAsB;IAahF;;;OAGG;IACH,YAAmB,IAAyB;QAC1C,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,WAAW,GAAG,MAAM,CAAC;IAC5B,CAAC;IACD,+CAA+C;IACxC,IAAI,CAAC,CAAS;QACnB,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;QACnB,OAAO,IAAI,CAAC;IACd,CAAC;IACD,+CAA+C;IACxC,IAAI;QACT,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;IACD,sEAAsE;IAC/D,gBAAgB;QACrB,qFAAqF;QACrF,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC;IACvD,CAAC;IACD,mEAAmE;IAC5D,WAAW;QAChB,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE;YACvC,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,SAAS;YACzC,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,WAAW,CAAC,EAAE;gBAC1D,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,aAAa;gBAC7C,MAAM,EAAE,GAAG,QAAQ,CAAC,yBAAyB,CAAC,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC;gBAChF,IAAI,EAAE,KAAK,SAAS,EAAE;oBACpB,IAAI,CAAC,YAAY,GAAG,EAAE,CAAC;oBACvB,OAAO,IAAI,CAAC;iBACb;aACF;SACF;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,qFAAqF;IAC9E,eAAe;QACpB,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,GAAG,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IACxE,CAAC;CACF;AAED;;;GAGG;AACH,MAAM,OAAgB,sBAAsB;IAyB1C;;;OAGG;IACH;QACE,IAAI,CAAC,QAAQ,GAAG,yBAAyB,CAAC,aAAa,EAAE,CAAC;IAC5D,CAAC;CACF;AAED;;;;;;;;;;;GAWG;AACH,MAAM,OAAO,+BAAgC,SAAQ,sBAAsB;IAMzE;;;OAGG;IACH,YAAmB,IAA4B;QAC7C,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,YAAY,GAAG,QAAQ,CAAC,UAAU,EAAE,CAAC;QAC1C,IAAI,CAAC,UAAU,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC;IACzC,CAAC;IACD,+DAA+D;IACxD,KAAK,CAAC,CAAS,EAAE,CAAS;QAC/B,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC1B,OAAO,IAAI,CAAC;IACd,CAAC;IACD,qDAAqD;IAC9C,IAAI;QACT,OAAO,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;IAC3B,CAAC;IACD,qDAAqD;IAC9C,IAAI;QACT,OAAO,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;IAC3B,CAAC;IACD,kHAAkH;IAC3G,gBAAgB;QACrB,iCAAiC;QACjC,wHAAwH;QACxH,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IACtG,CAAC;IACD;;;OAGG;IACI,WAAW;QAChB,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE;YAC7D,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC;YAC/B,KAAM,yFAAyF;YAC7F,WAAW,CAAC,cAAc,CACxB,EAAE,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,EAC1B,EAAE,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,EAC1B,EAAE,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,EACxB,IAAI,CAAC,YAAY,CAClB;gBAED,OAAO,IAAI,CAAC;SACf;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;OAEG;IACI,eAAe;QACpB,OAAO,QAAQ,CAAC,QAAQ,CACtB,IAAI,CAAC,YAAY,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,EACzD,IAAI,CAAC,YAAY,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAC1D,CAAC;IACJ,CAAC;CACF;AACD;;;;GAIG;AACH,MAAM,OAAO,YAAY;IACvB;;;;;;;;OAQG;IACI,MAAM,CAAC,WAAW,CACvB,CAAS,EACT,IAAuC,EACvC,UAA6C,EAC7C,oBAA4B,QAAQ,CAAC,kBAAkB;QAEvD,IAAI,YAAY,GAAG,CAAC,CAAC;QACrB,IAAI,SAAiB,CAAC;QACtB,MAAM,MAAM,GAAG,OAAO,CAAC;QACvB,KAAK,IAAI,SAAS,GAAG,CAAC,EAAE,SAAS,GAAG,EAAE,EAAE,SAAS,EAAE,EAAE;YACnD,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YAClB,MAAM,EAAE,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;YACzB,IAAI,CAAC,KAAK,SAAS,IAAI,EAAE,KAAK,SAAS,EAAE;gBACvC,MAAM,EAAE,GAAG,QAAQ,CAAC,2BAA2B,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;gBACvD,IAAI,EAAE,KAAK,SAAS;oBAClB,OAAO,SAAS,CAAC;gBACnB,CAAC,IAAI,EAAE,CAAC;gBACR,oDAAoD;gBACpD,SAAS,GAAG,iBAAiB,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC;gBACrD,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE;oBAC5B,YAAY,EAAE,CAAC;oBACf,IAAI,EAAE,KAAK,GAAG,IAAI,YAAY,GAAG,CAAC,EAAI,wCAAwC;wBAC5E,OAAO,CAAC,CAAC;iBACZ;qBAAM;oBACL,YAAY,GAAG,CAAC,CAAC;iBAClB;aACF;SACF;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;CACF","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n\r\n/** @packageDocumentation\r\n * @module Numerics\r\n */\r\n\r\nimport { Geometry } from \"../Geometry\";\r\nimport { Plane3dByOriginAndVectors } from \"../geometry3d/Plane3dByOriginAndVectors\";\r\nimport { Point2d, Vector2d } from \"../geometry3d/Point2dVector2d\";\r\nimport { SmallSystem } from \"./Polynomials\";\r\n\r\n// cspell:word currentdFdX\r\n\r\n/**\r\n * Base class for Newton iterations in various dimensions.\r\n * Dimension-specific classes carry all dimension-related data and answer generalized queries from this base class.\r\n * @internal\r\n */\r\nexport abstract class AbstractNewtonIterator {\r\n  /** Compute a step. The current x and function values must be retained for use in later method calls. */\r\n  public abstract computeStep(): boolean;\r\n  /**\r\n   * Return the current step size, scaled for use in tolerance tests.\r\n   * * This is a single number, typically the max of various per-dimension `dx/(1+x)` for the x and dx of that dimension.\r\n   */\r\n  public abstract currentStepSize(): number;\r\n  /**\r\n   * Apply the current step (in all dimensions).\r\n   * @param isFinalStep true if this is a final step.\r\n   */\r\n  public abstract applyCurrentStep(isFinalStep: boolean): boolean;\r\n  /**\r\n   * The constructor.\r\n   * @param stepSizeTarget tolerance to consider a single step converged.\r\n   * This number should be \"moderately\" strict. Because 2 successive convergences are required,\r\n   * it is expected that a first \"accept\" for (say) 10 to 14 digit step will be followed by another\r\n   * iteration. A well behaved newton would then hypothetically double the number of digits to\r\n   * 20 to 28. Since the IEEE double only carries 16 digits, this second-convergence step will\r\n   * typically achieve full precision.\r\n   * @param successiveConvergenceTarget number of successive convergences required for acceptance.\r\n   * @param maxIterations max number of iterations. A typical newton step converges in 3 to 6 iterations.\r\n   * Allow 15 to 20 to catch difficult cases.\r\n   */\r\n  protected constructor(\r\n    stepSizeTolerance: number = 1.0e-11,\r\n    successiveConvergenceTarget: number = 2,\r\n    maxIterations: number = 15,\r\n  ) {\r\n    this._stepSizeTolerance = stepSizeTolerance;\r\n    this._successiveConvergenceTarget = successiveConvergenceTarget;\r\n    this._maxIterations = maxIterations;\r\n  }\r\n  /** Number of consecutive steps which passed convergence condition. */\r\n  protected _numAccepted: number = 0;\r\n  /** Target number of successive convergences. */\r\n  protected _successiveConvergenceTarget: number;\r\n  /** Convergence target (the implementation-specific currentStepSize is compared to this). */\r\n  protected _stepSizeTolerance: number;\r\n  /** Max iterations allowed. */\r\n  protected _maxIterations: number;\r\n  /** Number of iterations (incremented at each step). */\r\n  public numIterations: number = 0;\r\n  /**\r\n   * Test if a step is converged.\r\n   * * Convergence is accepted with enough (_successiveConvergenceTarget) small steps (according to _stepSizeTolerance)\r\n   * occur in succession.\r\n   * @param delta step size as reported by currentStepSize.\r\n   */\r\n  public testConvergence(delta: number): boolean {\r\n    if (Math.abs(delta) < this._stepSizeTolerance) {\r\n      this._numAccepted++;\r\n      return this._numAccepted >= this._successiveConvergenceTarget;\r\n    }\r\n    this._numAccepted = 0;\r\n    return false;\r\n  }\r\n  /**\r\n   * Run iterations, calling various methods from base and derived classes:\r\n   * * computeStep -- typically evaluate derivatives and solve linear system.\r\n   * * currentStepSize -- return numeric measure of the step just computed by computeStep.\r\n   * * testConvergence -- test if the step from currentStepSize (along with recent steps) is converged.\r\n   * * applyCurrentStep -- apply the step to the independent variables.\r\n   */\r\n  public runIterations(): boolean {\r\n    this._numAccepted = 0;\r\n    this.numIterations = 0;\r\n    while (this.numIterations++ < this._maxIterations && this.computeStep()) {\r\n      if (this.testConvergence(this.currentStepSize()) && this.applyCurrentStep(true)) {\r\n        return true;\r\n      }\r\n      this.applyCurrentStep(false);\r\n    }\r\n    return false;\r\n  }\r\n}\r\n/**\r\n * Object to evaluate a newton function. The object must retain most-recent function and derivative\r\n * values for immediate query.\r\n * @internal\r\n */\r\nexport abstract class NewtonEvaluatorRtoRD {\r\n  /** Evaluate the function and its derivative at x. */\r\n  public abstract evaluate(x: number): boolean;\r\n  /** Most recent function value, i.e., f(x_n). */\r\n  public currentF!: number;\r\n  /** Most recent evaluated derivative, i.e., f'(x_n). */\r\n  public currentdFdX!: number;\r\n}\r\n/**\r\n * Newton iterator for use when both function and derivative can be evaluated.\r\n * To solve `f(x) = 0`, the Newton iteration is `x_{n+1} = x_n - dx = x_n - f(x_n)/f'(x_n)`.\r\n * To solve `f(x) = target` which is equivalent to solving  `g(x) = f(x) - target = 0`, the Newton iteration is\r\n * `x_{n+1} = x_n - dx = x_n - g(x_n)/g'(x_n) = x_n - (f(x_n)-target)/f'(x_n)`.\r\n * @internal\r\n */\r\nexport class Newton1dUnbounded extends AbstractNewtonIterator {\r\n  private _func: NewtonEvaluatorRtoRD;\r\n  /** Current step is dx. */\r\n  private _currentStep!: number;\r\n  /** Current X is x_n. */\r\n  private _currentX!: number;\r\n  /** The target */\r\n  private _target!: number;\r\n  /**\r\n   * Constructor for 1D newton iteration with derivatives.\r\n   * @param func function that returns both function value and derivative.\r\n   */\r\n  public constructor(func: NewtonEvaluatorRtoRD) {\r\n    super();\r\n    this._func = func;\r\n    this.setTarget(0);\r\n  }\r\n  /** Set the independent variable, i.e., x_n. */\r\n  public setX(x: number): boolean {\r\n    this._currentX = x;\r\n    return true;\r\n  }\r\n  /** Get the independent variable, i.e., x_n. */\r\n  public getX(): number {\r\n    return this._currentX;\r\n  }\r\n  /** Set the target function value. */\r\n  public setTarget(y: number): void {\r\n    this._target = y;\r\n  }\r\n  /** Move the current X by the just-computed step, i.e., `x_n - dx`. */\r\n  public applyCurrentStep(): boolean {\r\n    // console.log(this._currentX - this._currentStep); // print approximations for debug\r\n    return this.setX(this._currentX - this._currentStep);\r\n  }\r\n  /** Compute the univariate newton step. */\r\n  public computeStep(): boolean {\r\n    if (this._func.evaluate(this._currentX)) {\r\n      const dx = Geometry.conditionalDivideFraction(this._func.currentF - this._target, this._func.currentdFdX);\r\n      if (dx !== undefined) {\r\n        this._currentStep = dx;\r\n        return true;\r\n      }\r\n    }\r\n    return false;\r\n  }\r\n  /** Return the current step size as a relative number, i.e., `|dx / (1 + |x_n|)|`. */\r\n  public currentStepSize(): number {\r\n    return Math.abs(this._currentStep / (1.0 + Math.abs(this._currentX)));\r\n  }\r\n}\r\n\r\n/**\r\n * Object to evaluate a newton function (without derivative). The object must retain most-recent function value.\r\n * @internal\r\n */\r\nexport abstract class NewtonEvaluatorRtoR {\r\n  /** Evaluate function value into member currentF */\r\n  public abstract evaluate(x: number): boolean;\r\n  /** Most recent function evaluation, i.e., f(x_n). */\r\n  public currentF!: number;\r\n}\r\n\r\n/**\r\n * Newton iteration for a univariate function, using approximate derivatives.\r\n * To approximate the derivatives we use a small step `h`, i.e., `f'(x_n) = (f(x_n + h) - f(x_n)) / h`.\r\n * Therefore, to solve `f(x) = 0`, the iteration is\r\n * `x_{n+1} = x_n - dx = x_n - f(x_n)/f'(x_n) = x_n - f(x_n) * h / (f(x_n + h) - f(x_n))`.\r\n * @internal\r\n */\r\nexport class Newton1dUnboundedApproximateDerivative extends AbstractNewtonIterator {\r\n  private _func: NewtonEvaluatorRtoR;\r\n  /** Current step is dx. */\r\n  private _currentStep!: number;\r\n  /** Current X is x_n. */\r\n  private _currentX!: number;\r\n  /**\r\n   * Step size for approximate derivative for the iteration.\r\n   * * Initialized to 1e-8, which is appropriate for iteration in fraction space.\r\n   * * Should be larger for iteration with real distance as x.\r\n   */\r\n  public derivativeH: number; // h\r\n\r\n  /**\r\n   * Constructor for 1D newton iteration with approximate derivatives.\r\n   * @param func function that only returns function value (and not derivative).\r\n   */\r\n  public constructor(func: NewtonEvaluatorRtoR) {\r\n    super();\r\n    this._func = func;\r\n    this.derivativeH = 1.0e-8;\r\n  }\r\n  /** Set the independent variable, i.e., x_n. */\r\n  public setX(x: number): boolean {\r\n    this._currentX = x;\r\n    return true;\r\n  }\r\n  /** Get the independent variable, i.e., x_n. */\r\n  public getX(): number {\r\n    return this._currentX;\r\n  }\r\n  /** Move the current X by the just-computed step, i.e., `x_n - dx`. */\r\n  public applyCurrentStep(): boolean {\r\n    // console.log(this._currentX - this._currentStep); // print approximations for debug\r\n    return this.setX(this._currentX - this._currentStep);\r\n  }\r\n  /** Univariate newton step computed with approximate derivative. */\r\n  public computeStep(): boolean {\r\n    if (this._func.evaluate(this._currentX)) {\r\n      const fA = this._func.currentF; // f(x_n)\r\n      if (this._func.evaluate(this._currentX + this.derivativeH)) {\r\n        const fB = this._func.currentF; // f(x_n + h)\r\n        const dx = Geometry.conditionalDivideFraction(fA, (fB - fA) / this.derivativeH);\r\n        if (dx !== undefined) {\r\n          this._currentStep = dx;\r\n          return true;\r\n        }\r\n      }\r\n    }\r\n    return false;\r\n  }\r\n  /** Return the current step size as a relative number, i.e., `|dx / (1 + |x_n|)|`. */\r\n  public currentStepSize(): number {\r\n    return Math.abs(this._currentStep / (1.0 + Math.abs(this._currentX)));\r\n  }\r\n}\r\n\r\n/**\r\n * Object to evaluate a 2-parameter newton function with derivatives.\r\n * @internal\r\n */\r\nexport abstract class NewtonEvaluatorRRtoRRD {\r\n  /**\r\n   * Iteration controller calls this to ask for evaluation of the function and its two partial derivatives.\r\n   * * The implementation returns true, it must set the currentF object.\r\n   */\r\n  public abstract evaluate(x: number, y: number): boolean;\r\n  /**\r\n   * Most recent function evaluation as parts of the plane.\r\n   * * See doc of [[Newton2dUnboundedWithDerivative]] class for info on 2d newton method.\r\n   * * For current value (u,v) of the independent variable, and `F(u,v) := (x(u,v), y(u,v)), the returned plane has:\r\n   * * `origin.x` = x(u,v)\r\n   * * `origin.y` = y(u,v)\r\n   * * `vectorU.x` = dx/du\r\n   * * `vectorU.y` = dy/du\r\n   * * `vectorV.x` = dx/dv\r\n   * * `vectorV.y` = dy/dv\r\n   * * In other words, the plane stores the columns of the Jacobian matrix J of F: `vectorU` stores the partials\r\n   * of F with respect to u (the first column of J), and `vectorV` stores the partials of F with respect to v\r\n   * (the second column of J):\r\n   *\r\n   * `[vectorU.x   vectorV.x]`\r\n   *\r\n   * `[vectorU.y   vectorV.y]`\r\n   */\r\n  public currentF!: Plane3dByOriginAndVectors;\r\n  /**\r\n   * Constructor.\r\n   * * This creates a currentF object to (repeatedly) receive function and derivatives.\r\n   */\r\n  public constructor() {\r\n    this.currentF = Plane3dByOriginAndVectors.createXYPlane();\r\n  }\r\n}\r\n\r\n/**\r\n * Implement evaluation steps for newton iteration in 2 dimensions, using caller supplied NewtonEvaluatorRRtoRRD object.\r\n * * Suppose we want to find the roots of `F(u,v) := (x(u,v), y(u,v))`. Writing `X := (u,v)` and `F(X)` as column vectors,\r\n *  the 2D Newton's iteration to find a root of `F` is given by:\r\n * `X_{n+1} = X_n - dX = X_n - JInv(X_n)F(X_n)`, where `JInv` is the inverse of the Jacobian matrix `J`, and `J` is\r\n * defined as:\r\n *\r\n * `[dx/du   dx/dv]`\r\n *\r\n * `[dy/du   dy/dv]`\r\n * @internal\r\n */\r\nexport class Newton2dUnboundedWithDerivative extends AbstractNewtonIterator {\r\n  private _func: NewtonEvaluatorRRtoRRD;\r\n  /** Current step, or dX = (du, dv). */\r\n  private _currentStep: Vector2d;\r\n  /** Current uv parameters, or X_n = (u_n, v_n). */\r\n  private _currentUV: Point2d;\r\n  /**\r\n   * Constructor for 2D newton iteration with derivatives.\r\n   * @param func function that returns both function value and derivative.\r\n   */\r\n  public constructor(func: NewtonEvaluatorRRtoRRD) {\r\n    super();\r\n    this._func = func;\r\n    this._currentStep = Vector2d.createZero();\r\n    this._currentUV = Point2d.createZero();\r\n  }\r\n  /** Set the current uv parameters, i.e., `X_n = (u_n, v_n)`. */\r\n  public setUV(u: number, v: number): boolean {\r\n    this._currentUV.set(u, v);\r\n    return true;\r\n  }\r\n  /** Get the current u parameter of X_n, i.e., u_n. */\r\n  public getU(): number {\r\n    return this._currentUV.x;\r\n  }\r\n  /** Get the current v parameter of X_n, i.e., v_n. */\r\n  public getV(): number {\r\n    return this._currentUV.y;\r\n  }\r\n  /** Update the current uv parameter by currentStep, i.e., compute `X_{n+1} := X_n - dX = (u_n - du, v_n - dv)`. */\r\n  public applyCurrentStep(): boolean {\r\n    // print approximations for debug\r\n    // console.log(\"(\" + (this._currentUV.x - this._currentStep.x) + \",\" + (this._currentUV.y - this._currentStep.y) + \")\");\r\n    return this.setUV(this._currentUV.x - this._currentStep.x, this._currentUV.y - this._currentStep.y);\r\n  }\r\n  /**\r\n   * Evaluate the functions and derivatives at `X_n = (u_n, v_n)`, and solve the Jacobian matrix equation to\r\n   * compute `dX = (du, dv)`.\r\n   */\r\n  public computeStep(): boolean {\r\n    if (this._func.evaluate(this._currentUV.x, this._currentUV.y)) {\r\n      const fA = this._func.currentF;\r\n      if (  // Given X_{n+1} = X_n - dX = X_n - JInv(X_n) F(X_n), we solve J(X_n) dX = F(X_n) for dX:\r\n        SmallSystem.linearSystem2d(\r\n          fA.vectorU.x, fA.vectorV.x,\r\n          fA.vectorU.y, fA.vectorV.y,\r\n          fA.origin.x, fA.origin.y,\r\n          this._currentStep,\r\n        )\r\n      )\r\n        return true;\r\n    }\r\n    return false;\r\n  }\r\n  /**\r\n   * Return the current relative step size, i.e., the larger absolute component of `dX / (1 + |X_n|)`\r\n   */\r\n  public currentStepSize(): number {\r\n    return Geometry.maxAbsXY(\r\n      this._currentStep.x / (1.0 + Math.abs(this._currentUV.x)),\r\n      this._currentStep.y / (1.0 + Math.abs(this._currentUV.y)),\r\n    );\r\n  }\r\n}\r\n/**\r\n * SimpleNewton has static methods for newton methods with evaluated functions presented as immediate arguments\r\n * (not function object).\r\n * @internal\r\n */\r\nexport class SimpleNewton {\r\n  /**\r\n   * Run a one-dimensional newton iteration with separate functions for function and derivative.\r\n   * * Completion is at 2 (TWO) successive passes at `absoluteTolerance + relTol * abs(x)`, where relTol is\r\n   * chosen internally.\r\n   * * `absoluteTolerance` is usually aggressively tight -- should come into play only for x near zero.\r\n   * * The `relTol` is fluffy (for instance around 1e-11) but in properly converging cases the extra pass after\r\n   * first success normally moves to full machine precision.\r\n   * * This is an open-loop newton -- it just runs, and returns undefined if anything bad happens.\r\n   */\r\n  public static runNewton1D(\r\n    x: number,\r\n    func: (x: number) => number | undefined,\r\n    derivative: (x: number) => number | undefined,\r\n    absoluteTolerance: number = Geometry.smallFloatingPoint,\r\n  ): number | undefined {\r\n    let numConverged = 0;\r\n    let tolerance: number;\r\n    const relTol = 1.0e-11;\r\n    for (let iteration = 0; iteration < 20; iteration++) {\r\n      const f = func(x);\r\n      const df = derivative(x);\r\n      if (f !== undefined && df !== undefined) {\r\n        const dx = Geometry.conditionalDivideCoordinate(f, df);\r\n        if (dx === undefined)\r\n          return undefined;\r\n        x -= dx;\r\n        // console.log(x); // print approximations for debug\r\n        tolerance = absoluteTolerance + Math.abs(x) * relTol;\r\n        if (Math.abs(dx) < tolerance) {\r\n          numConverged++;\r\n          if (dx === 0.0 || numConverged > 1)   // bypass convergence count on true 0 dx\r\n            return x;\r\n        } else {\r\n          numConverged = 0;\r\n        }\r\n      }\r\n    }\r\n    return undefined;\r\n  }\r\n}\r\n"]}

package/lib/esm/polyface/PolyfaceBuilder.d.ts

@@ -99,6 +99,7 @@ export declare class PolyfaceBuilder extends NullGeometryHandler {
     /** add facets for a transformed unit box. */
     addTransformedUnitBox(transform: Transform): void;
     /** Add facets for a transformed range box.
+     * * For best results, the transformed range corners should define a nonzero volume or area.
      * @param transform applied to the range points before adding to the polyface
      * @param range sides become 6 quad polyface facets
      * @param faceSelector for each face in the order of BoxTopology.cornerIndexCCW, faceSelector[i]===false skips that facet.

package/lib/esm/polyface/PolyfaceBuilder.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"PolyfaceBuilder.d.ts","sourceRoot":"","sources":["../../../src/polyface/PolyfaceBuilder.ts"],"names":[],"mappings":"AAKA;;GAEG;AAEH,OAAO,EAAE,KAAK,EAAE,MAAM,gBAAgB,CAAC;AAEvC,OAAO,EAAE,QAAQ,EAAE,SAAS,EAAE,MAAM,qBAAqB,CAAC;AAG1D,OAAO,EAAE,cAAc,EAAE,MAAM,yBAAyB,CAAC;AACzD,OAAO,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AACvD,OAAO,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAC;AACrD,OAAO,EAAE,IAAI,EAAE,MAAM,eAAe,CAAC;AACrC,OAAO,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAC;AAGrD,OAAO,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AACvD,OAAO,EAAE,WAAW,EAAE,MAAM,sBAAsB,CAAC;AAMnD,OAAO,EAAE,mBAAmB,EAAE,SAAS,EAAE,MAAM,+BAA+B,CAAC;AAE/E,OAAO,EAAE,eAAe,EAAE,MAAM,+BAA+B,CAAC;AAChE,OAAO,EAAE,gBAAgB,EAAE,MAAM,gCAAgC,CAAC;AAClE,OAAO,EAAE,oBAAoB,EAAE,MAAM,oCAAoC,CAAC;AAG1E,OAAO,EAAE,OAAO,EAAE,MAAM,+BAA+B,CAAC;AAExD,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAO,MAAM,+BAA+B,CAAC;AAEvE,OAAO,EAAW,OAAO,EAAE,MAAM,qBAAqB,CAAC;AACvD,OAAO,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AACpD,OAAO,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AAEpD,OAAO,EAAE,KAAK,EAAE,MAAM,wBAAwB,CAAC;AAC/C,OAAO,EAAE,GAAG,EAAE,MAAM,cAAc,CAAC;AACnC,OAAO,EAAE,IAAI,EAAE,MAAM,eAAe,CAAC;AACrC,OAAO,EAAE,WAAW,EAAE,MAAM,sBAAsB,CAAC;AACnD,OAAO,EAAE,eAAe,EAAE,MAAM,0BAA0B,CAAC;AAC3D,OAAO,EAAE,UAAU,EAAE,MAAM,qBAAqB,CAAC;AACjD,OAAO,EAAE,MAAM,EAAE,MAAM,iBAAiB,CAAC;AAEzC,OAAO,EAAE,SAAS,EAAE,MAAM,oBAAoB,CAAC;AAC/C,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAE,yBAAyB,EAAE,MAAM,mBAAmB,CAAC;AAMvF,OAAO,EAAE,eAAe,EAAE,eAAe,EAAE,MAAM,YAAY,CAAC;AA+F9D;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4CG;AACH,qBAAa,eAAgB,SAAQ,mBAAmB;IACtD,OAAO,CAAC,SAAS,CAAkB;IACnC,OAAO,CAAC,QAAQ,CAAgB;IAChC,qEAAqE;IACrE,IAAW,OAAO,IAAI,aAAa,CAA0B;IAE7D,OAAO,CAAC,SAAS,CAAU;IAC3B,2EAA2E;IAC3E,IAAW,YAAY,IAAI,OAAO,CAA2B;IAC7D;;;;OAIG;IACI,aAAa,CAAC,QAAQ,GAAE,OAAc,EAAE,SAAS,GAAE,MAAqC,GAAG,eAAe;IAKjH,sFAAsF;IAC/E,uBAAuB;IAE9B,OAAO;IAOP;;;OAGG;WACW,MAAM,CAAC,OAAO,CAAC,EAAE,aAAa,GAAG,eAAe;IAG9D,6CAA6C;IACtC,qBAAqB,CAAC,SAAS,EAAE,SAAS;IAIjD;;;;MAIE;IACK,uBAAuB,CAAC,SAAS,EAAE,SAAS,EAAE,KAAK,EAAE,OAAO,EAAE,YAAY,CAAC,EAAE,OAAO,EAAE;IAuB7F;;;OAGG;IACI,cAAc,CAAC,SAAS,EAAE,OAAO,EAAE,EAAE,EAAE,YAAY,EAAE,MAAM,EAAE,OAAO,GAAG,IAAI;IAkBlF;;;;;;OAMG;IACI,oCAAoC,CAAC,EAAE,EAAE,YAAY,EAAE,MAAM,EAAE,OAAO,GAAG,IAAI;IA6CpF;;OAEG;IACI,QAAQ,CAAC,GAAG,EAAE,OAAO,GAAG,MAAM;IAGrC;;;OAGG;IACI,cAAc,CAAC,GAAG,EAAE,OAAO,GAAG,MAAM;IAI3C;;OAEG;IACI,UAAU,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM;IAG/C;;;OAGG;IACI,gBAAgB,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM;IAIrD,OAAO,CAAC,MAAM,CAAC,oBAAoB,CAAoB;IACvD,OAAO,CAAC,MAAM,CAAC,oBAAoB,CAAqB;IACxD,OAAO,CAAC,MAAM,CAAC,gBAAgB,CAAoB;IACnD;;;;OAIG;IACI,0BAA0B,CAAC,EAAE,EAAE,YAAY,EAAE,KAAK,EAAE,MAAM,EAAE,SAAS,CAAC,EAAE,SAAS,EAAE,UAAU,CAAC,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS;IAUlI;;;;OAIG;IACI,gCAAgC,CAAC,GAAG,EAAE,gBAAgB,EAAE,KAAK,EAAE,MAAM,EAAE,SAAS,CAAC,EAAE,SAAS,EAAE,UAAU,CAAC,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS;IAU7I;;;;OAIG;IACI,iCAAiC,CAAC,GAAG,EAAE,gBAAgB,EAAE,KAAK,EAAE,MAAM,EAAE,SAAS,CAAC,EAAE,SAAS,EAAE,UAAU,CAAC,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS;IAU9I;;;;OAIG;IACI,yBAAyB,CAAC,IAAI,EAAE,eAAe,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS;IAS1F;;;OAGG;IACI,+BAA+B,CAAC,IAAI,EAAE,eAAe,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS;IAIhG;;;;OAIG;IACI,0BAA0B,CAAC,EAAE,EAAE,YAAY,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,WAAW,CAAC,EAAE,MAAM,EAAE,WAAW,CAAC,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS;IAK7I;;;;;OAKG;IACI,2BAA2B,CAAC,EAAE,EAAE,YAAY,EAAE,KAAK,EAAE,MAAM,EAAE,SAAS,CAAC,EAAE,SAAS,EAAE,WAAW,CAAC,EAAE,MAAM,EAAE,WAAW,CAAC,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS;IAc1J;;OAEG;IACI,WAAW,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM;IAG3D;;;OAGG;IACI,iBAAiB,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM;IAIjE,+GAA+G;IAC/G,OAAO,CAAC,8BAA8B;IAQtC,gDAAgD;IAChD,OAAO,CAAC,2BAA2B;IASnC;;;;;;OAMG;IACI,YAAY,CAAC,MAAM,EAAE,OAAO,EAAE,GAAG,gBAAgB,EAAE,MAAM,CAAC,EAAE,OAAO,EAAE,EAAE,OAAO,CAAC,EAAE,QAAQ,EAAE,EAAE,MAAM,CAAC,EAAE,MAAM,EAAE;IAuGrH;;;;;OAKG;IACH,OAAO,CAAC,0BAA0B;IAgBlC,kFAAkF;IAClF,OAAO,CAAC,0BAA0B;IAclC,oFAAoF;IACpF,OAAO,CAAC,2BAA2B;IAcnC,4EAA4E;IAC5E,OAAO,CAAC,0BAA0B;IAelC;;;;;;OAMG;IACI,gBAAgB,CAAC,MAAM,EAAE,OAAO,EAAE,GAAG,gBAAgB,EAAE,MAAM,CAAC,EAAE,OAAO,EAAE,EAAE,OAAO,CAAC,EAAE,QAAQ,EAAE,EAAE,MAAM,CAAC,EAAE,MAAM,EAAE;IAgEzH;;;OAGG;IACH,OAAO,CAAC,8BAA8B;IActC,gFAAgF;IAChF,OAAO,CAAC,8BAA8B;IAYtC,gFAAgF;IAChF,OAAO,CAAC,+BAA+B;IAYvC,gFAAgF;IAChF,OAAO,CAAC,8BAA8B;IAYtC,0EAA0E;IAC1E,OAAO,CAAC,gBAAgB;IAOxB,OAAO,CAAC,iBAAiB;IAczB,OAAO,CAAC,mBAAmB;IAgB3B;;;;OAIG;IACI,wCAAwC,CAAC,WAAW,EAAE,YAAY,EAAE,EAAE,EAAE,MAAM,EAAE,WAAW,EAAE,YAAY,EAAE,EAAE,EAAE,MAAM,EAAE,UAAU,GAAE,OAAe;IA0CzJ;;;;OAIG;IACI,sCAAsC,CAAC,WAAW,EAAE,YAAY,EAAE,WAAW,EAAE,YAAY;IA8ClG;;;;OAIG;IACI,gCAAgC,CAAC,MAAM,EAAE,QAAQ,EAAE,UAAU,EAAE,SAAS,EAAE,UAAU,EAAE,SAAS,EAAE,UAAU,GAAE,OAAe;IA6BnI,OAAO,CAAC,uBAAuB;IAuB/B;;OAEG;IACI,OAAO,CAAC,IAAI,EAAE,IAAI;IA6BzB;;OAEG;IACI,YAAY,CAAC,OAAO,EAAE,SAAS,EAAE,cAAc,CAAC,EAAE,MAAM,EAAE,gBAAgB,CAAC,EAAE,MAAM;IAmD1F;;;;;;;OAOG;IACI,gCAAgC,CAAC,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,QAAQ;IA0B3E;;OAEG;IACI,kBAAkB,CAAC,OAAO,EAAE,eAAe;IA2BlD;;OAEG;IACI,qBAAqB,CAAC,MAAM,EAAE,SAAS,GAAG,IAAI;IAMrD;;;;OAIG;IACI,kCAAkC,CAAC,IAAI,EAAE,QAAQ,GAAG,aAAa;IAaxE,OAAO,CAAC,oCAAoC;IAe5C,OAAO,CAAC,yBAAyB;IAyDjC,OAAO,CAAC,2BAA2B;IAmBnC;;;;;OAKG;IACI,cAAc,CAAC,OAAO,EAAE,WAAW;IAmB1C;;OAEG;IACI,aAAa,CAAC,OAAO,EAAE,UAAU,GAAG,OAAO;IAmClD;;OAEG;IACI,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,WAAW,CAAC,EAAE,MAAM;IAuBrD;;OAEG;IACI,MAAM,CAAC,GAAG,EAAE,GAAG;IAsCtB;;;;;;OAMG;IACI,UAAU,CAAC,MAAM,EAAE,OAAO,EAAE,EAAE,cAAc,CAAC,EAAE,MAAM;IAqB5D;;;;;;OAMG;IACI,0BAA0B,CAAC,MAAM,EAAE,gBAAgB;IAkC1D;;;;;;;;;;OAUG;IACI,0BAA0B,CAAC,MAAM,EAAE,gBAAgB,EAAE,OAAO,EAAE,gBAAgB,GAAG,SAAS,EAC/F,MAAM,EAAE,eAAe,GAAG,SAAS,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,SAAS,EAAE,WAAW,CAAC,EAAE,OAAO,EAAE;IAwD5F;;OAEG;IACI,mBAAmB,CAAC,OAAO,EAAE,eAAe;IAInD;;;;;;MAME;IACK,0BAA0B,CAAC,OAAO,EAAE,eAAe,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,OAAO;IA0BvF,2DAA2D;IACpD,kBAAkB,CAAC,MAAM,EAAE,eAAe,EAAE,QAAQ,GAAE,OAAe,EAAE,SAAS,CAAC,EAAE,SAAS;IAInG;;;;OAIG;IACI,OAAO,IAAI,OAAO;IAIzB,uCAAuC;IACvB,UAAU,CAAC,CAAC,EAAE,IAAI,GAAG,GAAG;IACxC,4CAA4C;IAC5B,eAAe,CAAC,CAAC,EAAE,SAAS,GAAG,GAAG;IAClD,yCAAyC;IACzB,YAAY,CAAC,CAAC,EAAE,MAAM,GAAG,GAAG;IAC5C,sCAAsC;IACtB,SAAS,CAAC,CAAC,EAAE,GAAG,GAAG,GAAG;IACtC,8CAA8C;IAC9B,iBAAiB,CAAC,CAAC,EAAE,WAAW,GAAG,GAAG;IACtD,kDAAkD;IAClC,qBAAqB,CAAC,CAAC,EAAE,eAAe,GAAG,GAAG;IAC9D,6CAA6C;IAC7B,gBAAgB,CAAC,CAAC,EAAE,UAAU,GAAG,GAAG;IACpD,uCAAuC;IACvB,UAAU,CAAC,CAAC,EAAE,IAAI,GAAG,GAAG;IACxC,+CAA+C;IAC/B,kBAAkB,CAAC,CAAC,EAAE,YAAY,GAAG,GAAG;IACxD,8CAA8C;IAC9B,iBAAiB,CAAC,CAAC,EAAE,WAAW,GAAG,GAAG;IACtD,iHAAiH;IAC1G,gBAAgB,CAAC,CAAC,EAAE,aAAa;IAExC;;;;;;;OAOG;IACI,QAAQ,CAAC,KAAK,EAAE,aAAa,EAAE,kBAAkB,GAAE,yBAA4E,EACpI,qBAAqB,GAAE,yBAAyB,GAAG,SAAyD;IA6B9G;;;;;;;;OAQG;IACI,aAAa,CAAC,MAAM,EAAE,aAAa,EAAE,KAAK,EAAE,QAAQ,EAAE;IAY7D;;OAEG;WACW,eAAe,CAAC,KAAK,EAAE,aAAa,EAAE,OAAO,CAAC,EAAE,aAAa,EAAE,kBAAkB,GAAE,yBAA4E,GAAG,eAAe;IAM/L;;OAEG;WACW,oBAAoB,CAAC,KAAK,EAAE,aAAa,EAAE,KAAK,EAAE,QAAQ,EAAE,GAAG,eAAe;IAO5F;;OAEG;WACW,6BAA6B,CAAC,MAAM,EAAE,OAAO,EAAE,EAAE,YAAY,CAAC,EAAE,SAAS,GAAG,eAAe,GAAG,SAAS;IAkBrH;;;;;;;;;OASG;IACI,mBAAmB,CAAC,UAAU,EAAE,OAAO,EAAE,EAAE,EAAE,UAAU,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,WAAW,CAAC,EAAE,QAAQ,EAAE,EAAE,EAAE,OAAO,GAAE,OAAe;IAclI;;;;;;;;;;OAUG;IACI,aAAa,CAAC,OAAO,EAAE,SAAS,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,SAAS,EAAE,IAAI,CAAC,EAAE,SAAS;IAiHvG;;;OAGG;WACW,4BAA4B,CAAC,MAAM,EAAE,OAAO,EAAE,EAAE,OAAO,CAAC,EAAE,aAAa,GAAG,eAAe,GAAG,SAAS;IAMnH;;;;;;;;;OASG;IACI,wCAAwC,CAAC,OAAO,EAAE,OAAO,EAAE,GAAG,YAAY,GAAG,oBAAoB,EAAE,OAAO,EAAE,OAAO,EAAE,GAAG,YAAY,GAAG,oBAAoB;IAUlK,OAAO,CAAC,yBAAyB;IAuBjC;;;;;;;;OAQG;IACI,eAAe,CAAC,UAAU,EAAE,oBAAoB,GAAG,OAAO,EAAE,GAAG,cAAc,EAAE,WAAW,EAAE,MAAM,GAAG,KAAK,GAAG,KAAK,EAAE,cAAc,GAAE,MAAW;IAgBtJ,sGAAsG;IACtG,OAAO,CAAC,cAAc;IAWtB;;MAEE;IACF,OAAO,CAAC,YAAY;IAyCpB;;;;;;OAMG;IACI,uBAAuB,CAAC,MAAM,EAAE,eAAe,EAAE,WAAW,EAAE,QAAQ,EAAE,gBAAgB,GAAE,OAAe,GAAG,OAAO;CA0C3H"}
+{"version":3,"file":"PolyfaceBuilder.d.ts","sourceRoot":"","sources":["../../../src/polyface/PolyfaceBuilder.ts"],"names":[],"mappings":"AAKA;;GAEG;AAEH,OAAO,EAAE,KAAK,EAAE,MAAM,gBAAgB,CAAC;AAEvC,OAAO,EAAE,QAAQ,EAAE,SAAS,EAAE,MAAM,qBAAqB,CAAC;AAG1D,OAAO,EAAE,cAAc,EAAE,MAAM,yBAAyB,CAAC;AACzD,OAAO,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AACvD,OAAO,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAC;AACrD,OAAO,EAAE,IAAI,EAAE,MAAM,eAAe,CAAC;AACrC,OAAO,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAC;AAGrD,OAAO,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AACvD,OAAO,EAAE,WAAW,EAAE,MAAM,sBAAsB,CAAC;AAMnD,OAAO,EAAE,mBAAmB,EAAE,SAAS,EAAE,MAAM,+BAA+B,CAAC;AAE/E,OAAO,EAAE,eAAe,EAAE,MAAM,+BAA+B,CAAC;AAChE,OAAO,EAAE,gBAAgB,EAAE,MAAM,gCAAgC,CAAC;AAClE,OAAO,EAAE,oBAAoB,EAAE,MAAM,oCAAoC,CAAC;AAG1E,OAAO,EAAE,OAAO,EAAE,MAAM,+BAA+B,CAAC;AAExD,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAO,MAAM,+BAA+B,CAAC;AAEvE,OAAO,EAAW,OAAO,EAAE,MAAM,qBAAqB,CAAC;AACvD,OAAO,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AACpD,OAAO,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AAEpD,OAAO,EAAE,KAAK,EAAE,MAAM,wBAAwB,CAAC;AAC/C,OAAO,EAAE,GAAG,EAAE,MAAM,cAAc,CAAC;AACnC,OAAO,EAAE,IAAI,EAAE,MAAM,eAAe,CAAC;AACrC,OAAO,EAAE,WAAW,EAAE,MAAM,sBAAsB,CAAC;AACnD,OAAO,EAAE,eAAe,EAAE,MAAM,0BAA0B,CAAC;AAC3D,OAAO,EAAE,UAAU,EAAE,MAAM,qBAAqB,CAAC;AACjD,OAAO,EAAE,MAAM,EAAE,MAAM,iBAAiB,CAAC;AAEzC,OAAO,EAAE,SAAS,EAAE,MAAM,oBAAoB,CAAC;AAC/C,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAE,yBAAyB,EAAE,MAAM,mBAAmB,CAAC;AAMvF,OAAO,EAAE,eAAe,EAAE,eAAe,EAAE,MAAM,YAAY,CAAC;AA+F9D;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4CG;AACH,qBAAa,eAAgB,SAAQ,mBAAmB;IACtD,OAAO,CAAC,SAAS,CAAkB;IACnC,OAAO,CAAC,QAAQ,CAAgB;IAChC,qEAAqE;IACrE,IAAW,OAAO,IAAI,aAAa,CAA0B;IAE7D,OAAO,CAAC,SAAS,CAAU;IAC3B,2EAA2E;IAC3E,IAAW,YAAY,IAAI,OAAO,CAA2B;IAC7D;;;;OAIG;IACI,aAAa,CAAC,QAAQ,GAAE,OAAc,EAAE,SAAS,GAAE,MAAqC,GAAG,eAAe;IAKjH,sFAAsF;IAC/E,uBAAuB;IAE9B,OAAO;IAOP;;;OAGG;WACW,MAAM,CAAC,OAAO,CAAC,EAAE,aAAa,GAAG,eAAe;IAG9D,6CAA6C;IACtC,qBAAqB,CAAC,SAAS,EAAE,SAAS;IAIjD;;;;;MAKE;IACK,uBAAuB,CAAC,SAAS,EAAE,SAAS,EAAE,KAAK,EAAE,OAAO,EAAE,YAAY,CAAC,EAAE,OAAO,EAAE;IAuB7F;;;OAGG;IACI,cAAc,CAAC,SAAS,EAAE,OAAO,EAAE,EAAE,EAAE,YAAY,EAAE,MAAM,EAAE,OAAO,GAAG,IAAI;IAkBlF;;;;;;OAMG;IACI,oCAAoC,CAAC,EAAE,EAAE,YAAY,EAAE,MAAM,EAAE,OAAO,GAAG,IAAI;IA6CpF;;OAEG;IACI,QAAQ,CAAC,GAAG,EAAE,OAAO,GAAG,MAAM;IAGrC;;;OAGG;IACI,cAAc,CAAC,GAAG,EAAE,OAAO,GAAG,MAAM;IAI3C;;OAEG;IACI,UAAU,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM;IAG/C;;;OAGG;IACI,gBAAgB,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM;IAIrD,OAAO,CAAC,MAAM,CAAC,oBAAoB,CAAoB;IACvD,OAAO,CAAC,MAAM,CAAC,oBAAoB,CAAqB;IACxD,OAAO,CAAC,MAAM,CAAC,gBAAgB,CAAoB;IACnD;;;;OAIG;IACI,0BAA0B,CAAC,EAAE,EAAE,YAAY,EAAE,KAAK,EAAE,MAAM,EAAE,SAAS,CAAC,EAAE,SAAS,EAAE,UAAU,CAAC,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS;IAUlI;;;;OAIG;IACI,gCAAgC,CAAC,GAAG,EAAE,gBAAgB,EAAE,KAAK,EAAE,MAAM,EAAE,SAAS,CAAC,EAAE,SAAS,EAAE,UAAU,CAAC,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS;IAU7I;;;;OAIG;IACI,iCAAiC,CAAC,GAAG,EAAE,gBAAgB,EAAE,KAAK,EAAE,MAAM,EAAE,SAAS,CAAC,EAAE,SAAS,EAAE,UAAU,CAAC,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS;IAU9I;;;;OAIG;IACI,yBAAyB,CAAC,IAAI,EAAE,eAAe,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS;IAS1F;;;OAGG;IACI,+BAA+B,CAAC,IAAI,EAAE,eAAe,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS;IAIhG;;;;OAIG;IACI,0BAA0B,CAAC,EAAE,EAAE,YAAY,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,WAAW,CAAC,EAAE,MAAM,EAAE,WAAW,CAAC,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS;IAK7I;;;;;OAKG;IACI,2BAA2B,CAAC,EAAE,EAAE,YAAY,EAAE,KAAK,EAAE,MAAM,EAAE,SAAS,CAAC,EAAE,SAAS,EAAE,WAAW,CAAC,EAAE,MAAM,EAAE,WAAW,CAAC,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS;IAc1J;;OAEG;IACI,WAAW,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM;IAG3D;;;OAGG;IACI,iBAAiB,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM;IAIjE,+GAA+G;IAC/G,OAAO,CAAC,8BAA8B;IAQtC,gDAAgD;IAChD,OAAO,CAAC,2BAA2B;IASnC;;;;;;OAMG;IACI,YAAY,CAAC,MAAM,EAAE,OAAO,EAAE,GAAG,gBAAgB,EAAE,MAAM,CAAC,EAAE,OAAO,EAAE,EAAE,OAAO,CAAC,EAAE,QAAQ,EAAE,EAAE,MAAM,CAAC,EAAE,MAAM,EAAE;IAuGrH;;;;;OAKG;IACH,OAAO,CAAC,0BAA0B;IAgBlC,kFAAkF;IAClF,OAAO,CAAC,0BAA0B;IAclC,oFAAoF;IACpF,OAAO,CAAC,2BAA2B;IAcnC,4EAA4E;IAC5E,OAAO,CAAC,0BAA0B;IAelC;;;;;;OAMG;IACI,gBAAgB,CAAC,MAAM,EAAE,OAAO,EAAE,GAAG,gBAAgB,EAAE,MAAM,CAAC,EAAE,OAAO,EAAE,EAAE,OAAO,CAAC,EAAE,QAAQ,EAAE,EAAE,MAAM,CAAC,EAAE,MAAM,EAAE;IAgEzH;;;OAGG;IACH,OAAO,CAAC,8BAA8B;IActC,gFAAgF;IAChF,OAAO,CAAC,8BAA8B;IAYtC,gFAAgF;IAChF,OAAO,CAAC,+BAA+B;IAYvC,gFAAgF;IAChF,OAAO,CAAC,8BAA8B;IAYtC,0EAA0E;IAC1E,OAAO,CAAC,gBAAgB;IAOxB,OAAO,CAAC,iBAAiB;IAczB,OAAO,CAAC,mBAAmB;IAgB3B;;;;OAIG;IACI,wCAAwC,CAAC,WAAW,EAAE,YAAY,EAAE,EAAE,EAAE,MAAM,EAAE,WAAW,EAAE,YAAY,EAAE,EAAE,EAAE,MAAM,EAAE,UAAU,GAAE,OAAe;IA0CzJ;;;;OAIG;IACI,sCAAsC,CAAC,WAAW,EAAE,YAAY,EAAE,WAAW,EAAE,YAAY;IA8ClG;;;;OAIG;IACI,gCAAgC,CAAC,MAAM,EAAE,QAAQ,EAAE,UAAU,EAAE,SAAS,EAAE,UAAU,EAAE,SAAS,EAAE,UAAU,GAAE,OAAe;IA6BnI,OAAO,CAAC,uBAAuB;IAuB/B;;OAEG;IACI,OAAO,CAAC,IAAI,EAAE,IAAI;IA6BzB;;OAEG;IACI,YAAY,CAAC,OAAO,EAAE,SAAS,EAAE,cAAc,CAAC,EAAE,MAAM,EAAE,gBAAgB,CAAC,EAAE,MAAM;IAmD1F;;;;;;;OAOG;IACI,gCAAgC,CAAC,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,QAAQ;IA0B3E;;OAEG;IACI,kBAAkB,CAAC,OAAO,EAAE,eAAe;IA2BlD;;OAEG;IACI,qBAAqB,CAAC,MAAM,EAAE,SAAS,GAAG,IAAI;IAMrD;;;;OAIG;IACI,kCAAkC,CAAC,IAAI,EAAE,QAAQ,GAAG,aAAa;IAaxE,OAAO,CAAC,oCAAoC;IAe5C,OAAO,CAAC,yBAAyB;IAyDjC,OAAO,CAAC,2BAA2B;IAmBnC;;;;;OAKG;IACI,cAAc,CAAC,OAAO,EAAE,WAAW;IAmB1C;;OAEG;IACI,aAAa,CAAC,OAAO,EAAE,UAAU,GAAG,OAAO;IAmClD;;OAEG;IACI,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,WAAW,CAAC,EAAE,MAAM;IAuBrD;;OAEG;IACI,MAAM,CAAC,GAAG,EAAE,GAAG;IAsCtB;;;;;;OAMG;IACI,UAAU,CAAC,MAAM,EAAE,OAAO,EAAE,EAAE,cAAc,CAAC,EAAE,MAAM;IAqB5D;;;;;;OAMG;IACI,0BAA0B,CAAC,MAAM,EAAE,gBAAgB;IAkC1D;;;;;;;;;;OAUG;IACI,0BAA0B,CAAC,MAAM,EAAE,gBAAgB,EAAE,OAAO,EAAE,gBAAgB,GAAG,SAAS,EAC/F,MAAM,EAAE,eAAe,GAAG,SAAS,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,SAAS,EAAE,WAAW,CAAC,EAAE,OAAO,EAAE;IAwD5F;;OAEG;IACI,mBAAmB,CAAC,OAAO,EAAE,eAAe;IAInD;;;;;;MAME;IACK,0BAA0B,CAAC,OAAO,EAAE,eAAe,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,OAAO;IA0BvF,2DAA2D;IACpD,kBAAkB,CAAC,MAAM,EAAE,eAAe,EAAE,QAAQ,GAAE,OAAe,EAAE,SAAS,CAAC,EAAE,SAAS;IAInG;;;;OAIG;IACI,OAAO,IAAI,OAAO;IAIzB,uCAAuC;IACvB,UAAU,CAAC,CAAC,EAAE,IAAI,GAAG,GAAG;IACxC,4CAA4C;IAC5B,eAAe,CAAC,CAAC,EAAE,SAAS,GAAG,GAAG;IAClD,yCAAyC;IACzB,YAAY,CAAC,CAAC,EAAE,MAAM,GAAG,GAAG;IAC5C,sCAAsC;IACtB,SAAS,CAAC,CAAC,EAAE,GAAG,GAAG,GAAG;IACtC,8CAA8C;IAC9B,iBAAiB,CAAC,CAAC,EAAE,WAAW,GAAG,GAAG;IACtD,kDAAkD;IAClC,qBAAqB,CAAC,CAAC,EAAE,eAAe,GAAG,GAAG;IAC9D,6CAA6C;IAC7B,gBAAgB,CAAC,CAAC,EAAE,UAAU,GAAG,GAAG;IACpD,uCAAuC;IACvB,UAAU,CAAC,CAAC,EAAE,IAAI,GAAG,GAAG;IACxC,+CAA+C;IAC/B,kBAAkB,CAAC,CAAC,EAAE,YAAY,GAAG,GAAG;IACxD,8CAA8C;IAC9B,iBAAiB,CAAC,CAAC,EAAE,WAAW,GAAG,GAAG;IACtD,iHAAiH;IAC1G,gBAAgB,CAAC,CAAC,EAAE,aAAa;IAExC;;;;;;;OAOG;IACI,QAAQ,CAAC,KAAK,EAAE,aAAa,EAAE,kBAAkB,GAAE,yBAA4E,EACpI,qBAAqB,GAAE,yBAAyB,GAAG,SAAyD;IA6B9G;;;;;;;;OAQG;IACI,aAAa,CAAC,MAAM,EAAE,aAAa,EAAE,KAAK,EAAE,QAAQ,EAAE;IAY7D;;OAEG;WACW,eAAe,CAAC,KAAK,EAAE,aAAa,EAAE,OAAO,CAAC,EAAE,aAAa,EAAE,kBAAkB,GAAE,yBAA4E,GAAG,eAAe;IAM/L;;OAEG;WACW,oBAAoB,CAAC,KAAK,EAAE,aAAa,EAAE,KAAK,EAAE,QAAQ,EAAE,GAAG,eAAe;IAO5F;;OAEG;WACW,6BAA6B,CAAC,MAAM,EAAE,OAAO,EAAE,EAAE,YAAY,CAAC,EAAE,SAAS,GAAG,eAAe,GAAG,SAAS;IAkBrH;;;;;;;;;OASG;IACI,mBAAmB,CAAC,UAAU,EAAE,OAAO,EAAE,EAAE,EAAE,UAAU,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,WAAW,CAAC,EAAE,QAAQ,EAAE,EAAE,EAAE,OAAO,GAAE,OAAe;IAclI;;;;;;;;;;OAUG;IACI,aAAa,CAAC,OAAO,EAAE,SAAS,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,SAAS,EAAE,IAAI,CAAC,EAAE,SAAS;IAiHvG;;;OAGG;WACW,4BAA4B,CAAC,MAAM,EAAE,OAAO,EAAE,EAAE,OAAO,CAAC,EAAE,aAAa,GAAG,eAAe,GAAG,SAAS;IAMnH;;;;;;;;;OASG;IACI,wCAAwC,CAAC,OAAO,EAAE,OAAO,EAAE,GAAG,YAAY,GAAG,oBAAoB,EAAE,OAAO,EAAE,OAAO,EAAE,GAAG,YAAY,GAAG,oBAAoB;IAUlK,OAAO,CAAC,yBAAyB;IAuBjC;;;;;;;;OAQG;IACI,eAAe,CAAC,UAAU,EAAE,oBAAoB,GAAG,OAAO,EAAE,GAAG,cAAc,EAAE,WAAW,EAAE,MAAM,GAAG,KAAK,GAAG,KAAK,EAAE,cAAc,GAAE,MAAW;IAgBtJ,sGAAsG;IACtG,OAAO,CAAC,cAAc;IAWtB;;MAEE;IACF,OAAO,CAAC,YAAY;IAyCpB;;;;;;OAMG;IACI,uBAAuB,CAAC,MAAM,EAAE,eAAe,EAAE,WAAW,EAAE,QAAQ,EAAE,gBAAgB,GAAE,OAAe,GAAG,OAAO;CA0C3H"}

package/lib/esm/polyface/PolyfaceBuilder.js

@@ -206,6 +206,7 @@ class PolyfaceBuilder extends NullGeometryHandler {
         this.addTransformedRangeMesh(transform, Range3d.createXYZXYZ(0, 0, 0, 1, 1, 1));
     }
     /** Add facets for a transformed range box.
+     * * For best results, the transformed range corners should define a nonzero volume or area.
      * @param transform applied to the range points before adding to the polyface
      * @param range sides become 6 quad polyface facets
      * @param faceSelector for each face in the order of BoxTopology.cornerIndexCCW, faceSelector[i]===false skips that facet.