@itwin/core-geometry 5.11.0-dev.13 → 5.11.0-dev.15

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

@@ -1 +1 @@
-{"version":3,"file":"CurveCollection.js","sourceRoot":"","sources":["../../../src/curve/CurveCollection.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F;;GAEG;AAEH,sDAA6C;AAC7C,0CAAuC;AAGvC,qDAAkD;AAKlD,uDAAqG;AACrG,+DAA4D;AAC5D,qDAAkE;AAGlE,mDAAgD;AAChD,kGAA+F;AAC/F,8EAA2E;AAC3E,kGAA+F;AAC/F,oGAAiG;AACjG,0EAAuE;AACvE,4FAAyF;AACzF,4EAAyE;AACzE,wFAAqF;AACrF,iDAA8C;AAC9C,6CAA0C;AAoB1C;;;;;;;;;;;;GAYG;AACH,MAAsB,eAAgB,SAAQ,6BAAa;IACzD,wCAAwC;IACxB,gBAAgB,GAAG,iBAAiB,CAAC;IAGrD,uDAAuD;IAChD,OAAO,GAAY,KAAK,CAAC;IAGhC,6DAA6D;IACtD,UAAU;QACf,OAAO,qCAAiB,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;IAC5C,CAAC;IACO,mBAAmB,CACzB,UAAmB,EAAE,SAAsC,KAAK,EAAE,MAA4B,EAAE,SAAkB,KAAK;QAEvH,IAAI,OAAwC,CAAC;QAC7C,MAAM,OAAO,GAAG,IAAI,yCAAmB,EAAE,CAAC;QAC1C,IAAI,GAAG,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC;QAC9C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9C,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC/B,IAAI,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC;gBAClB,uFAAuF;gBACvF,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,oCAAkB,CAAC,mDAAmD,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,iCAAe,CAAC,IAAI,CAAC;gBACnI,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,oCAAkB,CAAC,mDAAmD,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,iCAAe,CAAC,IAAI,CAAC;gBAC1J,GAAG,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;YACvB,CAAC;YACD,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,cAAc,CAAC,UAAU,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,YAAY,CAAC,UAAU,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;YAClH,IAAI,EAAE,EAAE,CAAC;gBACP,MAAM,OAAO,GAAG,yCAAmB,CAAC,cAAc,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;gBACrE,IAAA,qBAAM,EAAC,SAAS,KAAK,OAAO,EAAE,kDAAkD,CAAC,CAAC;gBAClF,OAAO,GAAG,MAAM,GAAG,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;YAC3C,CAAC;QACH,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IACD;;;;;;OAMG;IACI,YAAY,CACjB,UAAmB,EAAE,SAAsC,KAAK,EAAE,MAA4B;QAE9F,OAAO,IAAI,CAAC,mBAAmB,CAAC,UAAU,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;IAC9D,CAAC;IACD;;;;;;OAMG;IACI,cAAc,CACnB,UAAmB,EAAE,SAAsC,KAAK,EAAE,MAA4B;QAE9F,OAAO,IAAI,CAAC,mBAAmB,CAAC,UAAU,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;IACpE,CAAC;IACD;;;;;;;;;;OAUG;IACI,YAAY,CACjB,UAAmB,EAAE,eAAsD,EAAE,OAAwB;QAErG,MAAM,aAAa,GAAG,IAAI,2DAA4B,CAAC,UAAU,EAAE,eAAe,EAAE,OAAO,CAAC,CAAC;QAC7F,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;YAChC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAClC,IAAI,KAAK,YAAY,+BAAc;oBACjC,KAAK,CAAC,kBAAkB,CAAC,aAAa,EAAE,OAAO,EAAE,aAAa,CAAC,CAAC;qBAC7D,IAAI,KAAK,YAAY,eAAe;oBACvC,KAAK,CAAC,YAAY,CAAC,UAAU,EAAE,eAAe,EAAE,OAAO,CAAC,CAAC;YAC7D,CAAC;QACH,CAAC;IACH,CAAC;IACD;;;;;;;OAOG;IACI,WAAW,CAAC,UAAmB,EAAE,OAAwB;QAC9D,MAAM,QAAQ,GAA0B,EAAE,CAAC;QAC3C,IAAI,CAAC,YAAY,CAAC,UAAU,EAAE,CAAC,CAAsB,EAAE,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC;QAC7F,OAAO,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,QAAQ,CAAC;IACxD,CAAC;IACD;;;;;;;OAOG;IACI,cAAc,CAAC,UAAmB,EAAE,OAAwB;QACjE,MAAM,IAAI,GAAG,OAAO,EAAE,SAAS,IAAI,UAAU,CAAC;QAC9C,IAAI,OAA6B,CAAC;QAClC,IAAI,OAAO,EAAE,WAAW,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,YAAY,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;YACjF,OAAO,GAAG,mBAAQ,CAAC,8BAA8B,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,EAAE,OAAO,CAAC,WAAW,CAAC,CAAC,EAAE,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;QACzH,MAAM,gBAAgB,GAAG,CAAC,EAAW,EAAU,EAAE;YAC/C,OAAO,OAAO,EAAE,oBAAoB,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,kBAAkB,EAAE,IAAI,EAAE,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC;QACvI,CAAC,CAAC;QACF,IAAI,cAA+C,CAAC;QACpD,IAAI,YAAY,GAAG,mBAAQ,CAAC,qBAAqB,CAAC;QAClD,MAAM,qBAAqB,GAAG,CAAC,OAA4B,EAAE,EAAE;YAC7D,MAAM,KAAK,GAAG,gBAAgB,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;YAC9C,IAAI,CAAC,cAAc,IAAI,KAAK,GAAG,YAAY,EAAE,CAAC;gBAC5C,cAAc,GAAG,OAAO,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC;gBAC/C,YAAY,GAAG,KAAK,CAAC;YACvB,CAAC;QACH,CAAC,CAAC;QACF,IAAI,CAAC,YAAY,CAAC,UAAU,EAAE,qBAAqB,EAAE,OAAO,CAAC,CAAC;QAC9D,OAAO,cAAc,CAAC;IACxB,CAAC;IACD,oHAAoH;IAC7G,cAAc;QACnB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ;YAC/B,KAAK,CAAC,cAAc,EAAE,CAAC;IAC3B,CAAC;IACD;;;;;;OAMG;IACI,MAAM;QACX,OAAO,mCAAgB,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACvC,CAAC;IACD,wGAAwG;IACjG,2BAA2B;QAChC,OAAO,6DAA6B,CAAC,sBAAsB,CAAC,IAAI,CAAC,CAAC;IACpE,CAAC;IACD,8CAA8C;IACvC,mBAAmB,CAAC,SAAoB;QAC7C,OAAO,iDAAuB,CAAC,mBAAmB,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;IACtE,CAAC;IACD,0BAA0B;IACV,KAAK;QACnB,OAAO,uCAAkB,CAAC,KAAK,CAAC,IAAI,CAAoB,CAAC;IAC3D,CAAC;IACD,gDAAgD;IAChC,gBAAgB,CAAC,SAAoB;QACnD,OAAO,uCAAkB,CAAC,KAAK,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;IACnD,CAAC;IACD,uFAAuF;IAChF,4BAA4B;QACjC,OAAO,2DAA4B,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAClD,CAAC;IACD;;;;OAIG;IACK,wBAAwB,CAC9B,OAAyB,EAAE,0BAAmC,EAAE,qBAA8B,KAAK;QAEnG,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAClB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAClC,IAAI,KAAK,YAAY,+BAAc;oBACjC,KAAK,CAAC,wBAAwB,CAAC,OAAO,EAAE,0BAA0B,EAAE,kBAAkB,CAAC,CAAC;qBACrF,IAAI,KAAK,YAAY,eAAe;oBACvC,KAAK,CAAC,wBAAwB,CAAC,OAAO,EAAE,0BAA0B,EAAE,kBAAkB,CAAC,CAAC;YAC5F,CAAC;QACH,CAAC;IACH,CAAC;IACD;;;;;;;;OAQG;IACI,sBAAsB,CAC3B,cAAiC,EAAE,6BAAsC,KAAK,EAAE,qBAA8B,KAAK;QAEnH,MAAM,OAAO,GAAqB,cAAc,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,cAAc,CAAC;QACrF,IAAI,CAAC,wBAAwB,CAAC,OAAO,EAAE,0BAA0B,EAAE,kBAAkB,CAAC,CAAC;QACvF,OAAO,OAAO,CAAC;IACjB,CAAC;IACD;;;;;;OAMG;IACH,IAAW,eAAe;QACxB,OAAO,IAAI,CAAC,eAAe,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,eAAe,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,eAAe,EAAE,KAAK,CAAC,CAAC;IACtG,CAAC;IACD,+BAA+B;IACxB,WAAW;QAChB,OAAO,IAAI,CAAC,eAAe,CAAC;IAC9B,CAAC;IACD;;;;OAIG;IACH,IAAW,UAAU;QACnB,OAAO,IAAI,CAAC,eAAe,EAAE,KAAK,CAAC,CAAC;IACtC,CAAC;IACD;;;;OAIG;IACI,MAAM;QACX,OAAO,IAAI,CAAC,UAAU,CAAC;IACzB,CAAC;IACD;;;;OAIG;IACH,IAAW,YAAY;QACrB,OAAO,IAAI,CAAC,eAAe,EAAE,KAAK,CAAC,CAAC;IACtC,CAAC;IACD;;;;OAIG;IACI,MAAM;QACX,OAAO,IAAI,CAAC,YAAY,CAAC;IAC3B,CAAC;IAqBD;;;;OAIG;IACI,WAAW,CAAC,aAAsB,EAAE,SAAqB;QAC9D,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC/B,IAAI,QAAQ,EAAE,CAAC;YACb,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;gBACzB,CAAC,CAAC,WAAW,CAAC,aAAa,EAAE,SAAS,CAAC,CAAC;YAC1C,CAAC;QACH,CAAC;IACH,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,4CAA4C,CACxD,MAAiC,EAAE,WAAmB,GAAG;QAEzD,IAAI,CAAC,MAAM;YACT,OAAO,SAAS,CAAC;QACnB,IAAI,MAAM,YAAY,+BAAc,EAAE,CAAC;YACrC,OAAO,yCAAmB,CAAC,4BAA4B,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;QAC5E,CAAC;aAAM,IAAI,MAAM,YAAY,eAAe,IAAI,MAAM,CAAC,QAAQ,KAAK,SAAS;YAC3E,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC;gBACpC,MAAM,MAAM,GAAG,IAAI,CAAC,4CAA4C,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;gBAClF,IAAI,MAAM;oBACR,OAAO,MAAM,CAAC;YAClB,CAAC;QACH,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;;OAOG;IACI,uBAAuB,CAAC,GAAqB,EAAE,OAAiB;QACrE,OAAO,qDAAyB,CAAC,kCAAkC,CAAC,IAAI,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;IAC1F,CAAC;IACD,8GAA8G;IACvG,sBAAsB,CAAC,UAAoB;QAChD,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAClC,IAAI,KAAK,KAAK,UAAU;gBACtB,OAAO,IAAI,CAAC;YACd,IAAI,KAAK,YAAY,eAAe,EAAE,CAAC;gBACrC,MAAM,MAAM,GAAG,KAAK,CAAC,sBAAsB,CAAC,UAAU,CAAC,CAAC;gBACxD,IAAI,MAAM;oBACR,OAAO,MAAM,CAAC;YAClB,CAAC;QACH,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAAA,CAAC;CACH;AA7TD,0CA6TC;AAED;;;;;;;;;GASG;AACH,MAAsB,UAAW,SAAQ,eAAe;IACtD,yCAAyC;IAC/B,OAAO,CAAmB;IACpC,kBAAkB;IAClB;QACE,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC;IACpB,CAAC;IACD,2CAA2C;IAC3C,IAAoB,QAAQ;QAC1B,OAAO,IAAI,CAAC,OAAO,CAAC;IACtB,CAAC;IACD,kFAAkF;IAC3E,UAAU,CAAC,MAAgB;QAChC,MAAM,UAAU,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACpC,IAAI,UAAU;YACZ,OAAO,UAAU,CAAC,eAAe,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;;YAE/C,OAAO,SAAS,CAAC;IACrB,CAAC;IACD,6EAA6E;IACtE,QAAQ,CAAC,MAAgB;QAC9B,MAAM,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACzD,IAAI,SAAS;YACX,OAAO,SAAS,CAAC,eAAe,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;;YAE9C,OAAO,SAAS,CAAC;IACrB,CAAC;IACD;;;;;OAKG;IACI,uBAAuB,CAAC,YAAoB,mBAAQ,CAAC,mBAAmB,EAAE,SAAkB,KAAK;QACtG,MAAM,EAAE,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC;QAC7B,MAAM,EAAE,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;QAC3B,OAAO,EAAE,KAAK,SAAS,IAAI,EAAE,KAAK,SAAS,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,eAAe,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,aAAa,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC,CAAC;IAChI,CAAC;IACD;;;OAGG;IACI,uBAAuB,CAAC,MAAc;QAC3C,MAAM,UAAU,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACpC,IAAI,UAAU;YACZ,OAAO,UAAU,CAAC,4BAA4B,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;;YAE5D,OAAO,SAAS,CAAC;IACrB,CAAC;IACD;;;OAGG;IACI,qBAAqB,CAAC,MAAc;QACzC,MAAM,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACzD,IAAI,SAAS;YACX,OAAO,SAAS,CAAC,4BAA4B,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;;YAE3D,OAAO,SAAS,CAAC;IACrB,CAAC;IACD;;;;;OAKG;IACI,oBAAoB,CAAC,KAAa,EAAE,SAAkB,IAAI;QAC/D,MAAM,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;QAC/B,IAAI,CAAC,KAAK,CAAC;YACT,OAAO,SAAS,CAAC;QACnB,IAAI,KAAK,IAAI,CAAC,IAAI,KAAK,GAAG,CAAC,EAAE,uCAAuC;YAClE,OAAO,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QAC9B,IAAI,MAAM,EAAE,CAAC;YACX,MAAM,MAAM,GAAG,mBAAQ,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YACzC,OAAO,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QAC/B,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;OAGG;IACI,gBAAgB,CAAC,OAAuB;QAC7C;;;;WAIG;QACH,MAAM,IAAI,GAAG,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC;QACxC,IAAI,IAAI,YAAY,UAAU,EAAE,CAAC;YAC/B,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;YAC/B,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBAC1B,MAAM,EAAE,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;gBACvB,IAAI,EAAE,YAAY,2BAAY;oBAC5B,OAAO,EAAE,CAAC,YAAY,CAAC;YAC3B,CAAC;QACH,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAGD;;;;OAIG;IACI,WAAW,CAAC,KAA2B;QAC5C,IAAI,KAAK,IAAI,KAAK,YAAY,+BAAc,EAAE,CAAC;YAC7C,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACzB,OAAO,IAAI,CAAC;QACd,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,8BAA8B;IACvB,QAAQ,CAAC,CAAS;QACvB,IAAI,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM;YAAE,OAAO,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QACpD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,mEAAmE;IACnD,WAAW,CAAC,KAAc,EAAE,SAAqB;QAC/D,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO;YAC9B,KAAK,CAAC,WAAW,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;IACxC,CAAC;IACD;;;OAGG;IACI,sBAAsB;QAC3B,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO;YAC9B,KAAK,CAAC,cAAc,EAAE,CAAC;QACzB,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,CAAC;IACzB,CAAC;IACD,0CAA0C;IAC1B,cAAc;QAC5B,IAAI,CAAC,sBAAsB,EAAE,CAAC;IAChC,CAAC;IACD;;;OAGG;IACI,UAAU,CAAC,MAAkC,EAAE,iBAA2B;QAC/E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7C,IAAI,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,MAAM;gBAC5B,OAAO,CAAC,CAAC;QACb,CAAC;QACD,IAAI,iBAAiB,IAAI,KAAK,EAAE,CAAC;YAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC7C,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;gBACnC,IAAI,UAAU,YAAY,uBAAU,EAAE,CAAC;oBACrC,IAAI,UAAU,CAAC,UAAU,KAAK,MAAM;wBAClC,OAAO,CAAC,CAAC;gBACb,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,6GAA6G;IACtG,gEAAgE,CACrE,KAAa,EAAE,QAAgB,EAAE,SAAkB,KAAK,EAAE,MAA4B;QAEtF,MAAM,SAAS,GAAG,IAAI,CAAC,oBAAoB,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QAC3D,IAAI,SAAS,EAAE,CAAC;YACd,OAAO,yCAAmB,CAAC,8CAA8C,CAAC,SAAS,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;QACzG,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;CACF;AAvKD,gCAuKC;AAED;;;;GAIG;AACH,MAAa,WAAY,SAAQ,eAAe;IAC9C,wCAAwC;IACxB,mBAAmB,GAAG,aAAa,CAAC;IACpD,sDAAsD;IAC/C,mBAAmB,CAAC,KAAoB;QAC7C,OAAO,KAAK,YAAY,WAAW,CAAC;IACtC,CAAC;IACD;;;OAGG;IACO,SAAS,CAAa;IAChC,uCAAuC;IACvC;QACE,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,SAAS,GAAG,EAAE,CAAC;IACtB,CAAC;IACD,kDAAkD;IAClD,IAAoB,QAAQ;QAC1B,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;IACD,gCAAgC;IACzB,MAAM,CAAC,MAAM,CAAC,GAAG,IAAgB;QACtC,MAAM,MAAM,GAAG,IAAI,WAAW,EAAE,CAAC;QACjC,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC;YACzB,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;QAC5B,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,gFAAgF;IACzE,eAAe;QACpB,OAAO,CAAC,CAAC;IACX,CAAC;IACD,mEAAmE;IAC5D,wBAAwB,CAAC,SAAkC,EAAE,gBAAwB,CAAC,CAAC;QAC5F,OAAO,SAAS,CAAC,mBAAmB,CAAC,IAAI,EAAE,aAAa,CAAC,CAAC;IAC5D,CAAC;IACD,0CAA0C;IACnC,YAAY,CAAC,OAAuB;QACzC,MAAM,KAAK,GAAG,IAAI,WAAW,EAAE,CAAC;QAChC,IAAI,KAAK,CAAC;QACV,KAAK,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAC5B,IAAI,KAAK,YAAY,+BAAc,EAAE,CAAC;gBACpC,MAAM,EAAE,GAAG,2BAAY,CAAC,MAAM,EAAE,CAAC;gBACjC,KAAK,CAAC,WAAW,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;gBAC/B,IAAI,EAAE;oBACJ,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAC5B,CAAC;iBAAM,IAAI,KAAK,YAAY,eAAe,EAAE,CAAC;gBAC5C,MAAM,YAAY,GAAG,KAAK,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC;gBACjD,IAAI,YAAY;oBACd,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;YACtC,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,oCAAoC;IAC7B,cAAc;QACnB,OAAO,IAAI,WAAW,EAAE,CAAC;IAC3B,CAAC;IACD,mBAAmB;IACZ,WAAW,CAAC,KAA2B;QAC5C,IAAI,KAAK;YACP,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC7B,OAAO,IAAI,CAAC;IACd,CAAC;IACD,2BAA2B;IACpB,QAAQ,CAAC,CAAS;QACvB,IAAI,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM;YAC3B,OAAO,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QAC3B,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,8EAA8E;IACvE,yBAAyB,CAAC,OAAwB;QACvD,OAAO,OAAO,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC;IACzC,CAAC;CACF;AA3ED,kCA2EC","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n\n/** @packageDocumentation\n * @module Curve\n */\n\nimport { assert } from \"@itwin/core-bentley\";\nimport { Geometry } from \"../Geometry\";\nimport { GeometryHandler } from \"../geometry3d/GeometryHandler\";\nimport { GrowableXYZArray } from \"../geometry3d/GrowableXYZArray\";\nimport { Matrix3d } from \"../geometry3d/Matrix3d\";\nimport { Point3d, Vector3d } from \"../geometry3d/Point3dVector3d\";\nimport { Range1d, Range3d } from \"../geometry3d/Range\";\nimport { Ray3d } from \"../geometry3d/Ray3d\";\nimport { Transform } from \"../geometry3d/Transform\";\nimport { CurveExtendMode, CurveExtendOptions, VariantCurveExtendParameter } from \"./CurveExtendMode\";\nimport { CurveLocationDetail } from \"./CurveLocationDetail\";\nimport { CurvePrimitive, TangentOptions } from \"./CurvePrimitive\";\nimport { RecursiveCurveProcessor } from \"./CurveProcessor\";\nimport { AnyCurve, type AnyRegion } from \"./CurveTypes\";\nimport { GeometryQuery } from \"./GeometryQuery\";\nimport { AnnounceTangentStrokeHandler } from \"./internalContexts/AnnounceTangentStrokeHandler\";\nimport { CloneCurvesContext } from \"./internalContexts/CloneCurvesContext\";\nimport { CloneWithExpandedLineStrings } from \"./internalContexts/CloneWithExpandedLineStrings\";\nimport { CountLinearPartsSearchContext } from \"./internalContexts/CountLinearPartsSearchContext\";\nimport { GapSearchContext } from \"./internalContexts/GapSearchContext\";\nimport { PlaneAltitudeRangeContext } from \"./internalContexts/PlaneAltitudeRangeContext\";\nimport { SumLengthsContext } from \"./internalContexts/SumLengthsContext\";\nimport { TransformInPlaceContext } from \"./internalContexts/TransformInPlaceContext\";\nimport { LineString3d } from \"./LineString3d\";\nimport { ProxyCurve } from \"./ProxyCurve\";\nimport { StrokeOptions } from \"./StrokeOptions\";\n\nimport type { Path } from \"./Path\";\nimport type { Loop } from \"./Loop\";\n\n/** Note: CurveChain and BagOfCurves classes are located in this file to prevent circular dependency. */\n\n/**\n * Describes the concrete type of a [[CurveCollection]]. Each type name maps to a specific subclass and can be\n * used in conditional statements for type-switching.\n *    - \"loop\" => [[Loop]]\n *    - \"path\" => [[Path]]\n *    - \"unionRegion\" => [[UnionRegion]]\n *    - \"parityRegion\" => [[ParityRegion]]\n *    - \"bagOfCurves\" => [[BagOfCurves]]\n * @public\n */\nexport type CurveCollectionType = \"loop\" | \"path\" | \"unionRegion\" | \"parityRegion\" | \"bagOfCurves\";\n\n/**\n * A `CurveCollection` is an abstract (non-instantiable) class for various sets of curves with particular structures:\n * - [[CurveChain]] - a non-instantiable intermediate class for a sequence of [[CurvePrimitive]] joining head-to-tail.\n * The two instantiable forms of `CurveChain` are:\n *   - [[Path]] - a chain of curves. Does not have to be closed or planar. A closed `Path` is not treated as bounding a surface.\n *   - [[Loop]] - a closed and planar chain of curves. A `Loop` is treated as bounding a planar area.\n * - [[ParityRegion]] - a collection of coplanar `Loop`, with \"in/out\" classification by parity rules.\n * - [[UnionRegion]] - a collection of coplanar `Loop` and/or `ParityRegion`, with \"in/out\" classification by union rules.\n * - [[BagOfCurves]] - a collection of [[AnyCurve]] with no implied structure.\n *\n * @see [Curve Collections]($docs/learning/geometry/CurveCollection.md) learning article.\n * @public\n */\nexport abstract class CurveCollection extends GeometryQuery {\n  /** String name for schema properties */\n  public readonly geometryCategory = \"curveCollection\";\n  /** Type discriminator. */\n  public abstract readonly curveCollectionType: CurveCollectionType;\n  /** Flag for inner loop status. Only used by `Loop`. */\n  public isInner: boolean = false;\n  /** Return the curve children. */\n  public abstract override get children(): AnyCurve[];\n  /** Return the sum of the lengths of all contained curves. */\n  public sumLengths(): number {\n    return SumLengthsContext.sumLengths(this);\n  }\n  private computeClosestPoint(\n    spacePoint: Point3d, extend: VariantCurveExtendParameter = false, result?: CurveLocationDetail, xyOnly: boolean = false,\n  ): CurveLocationDetail | undefined {\n    let detailA: CurveLocationDetail | undefined;\n    const detailB = new CurveLocationDetail();\n    let ext = this.isAnyRegion() ? false : extend;\n    for (let i = 0; i < this.children.length; i++) {\n      const child = this.children[i];\n      if (this.isPath()) {\n        // head only extends at start; tail only at end. NOTE: child may be both head and tail!\n        const mode0 = (i === 0) ? CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(extend, 0) : CurveExtendMode.None;\n        const mode1 = (i === this.children.length - 1) ? CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(extend, 1) : CurveExtendMode.None;\n        ext = [mode0, mode1];\n      }\n      const cp = xyOnly ? child.closestPointXY(spacePoint, ext, detailB) : child.closestPoint(spacePoint, ext, detailB);\n      if (cp) {\n        const smaller = CurveLocationDetail.chooseSmallerA(detailA, detailB);\n        assert(undefined !== smaller, \"expect defined because detailB is always defined\");\n        detailA = result = smaller.clone(result);\n      }\n    }\n    return detailA;\n  }\n  /**\n   * Return the closest point on the contained curves.\n   * @param spacePoint point in space.\n   * @param extend extend applicable only to [[Path]] and [[BagOfCurves]]. Default value `false`.\n   * @param result (optional) pre-allocated detail to populate and return.\n   * @returns details of the closest point.\n   */\n  public closestPoint(\n    spacePoint: Point3d, extend: VariantCurveExtendParameter = false, result?: CurveLocationDetail,\n  ): CurveLocationDetail | undefined {\n    return this.computeClosestPoint(spacePoint, extend, result);\n  }\n  /**\n   * Return the closest point on the contained curves as viewed in the xy-plane (ignoring z).\n   * @param spacePoint point in space.\n   * @param extend (optional) extend applicable only to [[Path]] and [[BagOfCurves]]. Default value `false`.\n   * @param result (optional) pre-allocated detail to populate and return.\n   * @returns details of the closest point.\n   */\n  public closestPointXY(\n    spacePoint: Point3d, extend: VariantCurveExtendParameter = false, result?: CurveLocationDetail,\n  ): CurveLocationDetail | undefined {\n    return this.computeClosestPoint(spacePoint, extend, result, true);\n  }\n  /**\n   * Announce all points `P` on the contained curves such that the line containing `spacePoint` and `P` is tangent to\n   * the contained curves in the view defined by `options.vectorToEye`.\n   * * Strictly speaking, each tangent line lies in the plane through `P` whose normal is the cross product of the curve\n   * tangent at `P` and `options.vectorToEye`. This is equivalent to tangency as seen in a view plane perpendicular to\n   * `options.vectorToEye`.\n   * @param spacePoint point in space.\n   * @param announceTangent callback to announce each computed tangent. The received [[CurveLocationDetail]] is reused\n   * internally, so it should be cloned in the callback if it needs to be saved.\n   * @param options (optional) options for computing tangents. See [[TangentOptions]] for defaults.\n   */\n  public emitTangents(\n    spacePoint: Point3d, announceTangent: (tangent: CurveLocationDetail) => any, options?: TangentOptions,\n  ): void {\n    const strokeHandler = new AnnounceTangentStrokeHandler(spacePoint, announceTangent, options);\n    if (this.children !== undefined) {\n      for (const child of this.children) {\n        if (child instanceof CurvePrimitive)\n          child.emitStrokableParts(strokeHandler, options?.strokeOptions);\n        else if (child instanceof CurveCollection)\n          child.emitTangents(spacePoint, announceTangent, options);\n      }\n    }\n  }\n  /**\n   * Return all points `P` on the contained curves such that the line containing `spacePoint` and `P` is tangent to the\n   * contained curves in the view defined by `options.vectorToEye`.\n   * * See [[emitTangents]] for the definition of tangency employed.\n   * @param spacePoint point in space.\n   * @param options (optional) options for computing tangents. See [[TangentOptions]] for defaults.\n   * @returns an array of details of all tangent points or undefined if no tangent was found.\n   */\n  public allTangents(spacePoint: Point3d, options?: TangentOptions): CurveLocationDetail[] | undefined {\n    const tangents: CurveLocationDetail[] = [];\n    this.emitTangents(spacePoint, (t: CurveLocationDetail) => tangents.push(t.clone()), options);\n    return (tangents.length === 0) ? undefined : tangents;\n  }\n  /**\n   * Return the point `P` on the contained curves such that the line containing `spacePoint` and `P` is tangent to the\n   * contained curves in the view defined by `options.vectorToEye`, and `P` is closest to `options.hintPoint` in this view.\n   * * See [[emitTangents]] for the definition of tangency employed.\n   * @param spacePoint point in space.\n   * @param options (optional) options for computing tangents. See [[TangentOptions]] for defaults.\n   * @returns the detail of the closest tangent point or undefined if no tangent was found.\n   */\n  public closestTangent(spacePoint: Point3d, options?: TangentOptions): CurveLocationDetail | undefined {\n    const hint = options?.hintPoint ?? spacePoint;\n    let toLocal: Matrix3d | undefined;\n    if (options?.vectorToEye && !options.vectorToEye.isExactEqual({ x: 0, y: 0, z: 1 }))\n      toLocal = Matrix3d.createRigidViewAxesZTowardsEye(options.vectorToEye.x, options.vectorToEye.y, options.vectorToEye.z);\n    const measureHintDist2 = (pt: Point3d): number => { // measure distance to hint in view plane coordinates\n      return toLocal?.multiplyTransposeXYZ(hint.x - pt.x, hint.y - pt.y, hint.z - pt.z).magnitudeSquaredXY() ?? pt.distanceSquaredXY(hint);\n    };\n    let closestTangent: CurveLocationDetail | undefined;\n    let closestDist2 = Geometry.largeCoordinateResult;\n    const collectClosestTangent = (tangent: CurveLocationDetail) => {\n      const dist2 = measureHintDist2(tangent.point);\n      if (!closestTangent || dist2 < closestDist2) {\n        closestTangent = tangent.clone(closestTangent);\n        closestDist2 = dist2;\n      }\n    };\n    this.emitTangents(spacePoint, collectClosestTangent, options);\n    return closestTangent;\n  }\n  /** Reverse the collection's data so that each child curve's fractional stroking moves in the opposite direction. */\n  public reverseInPlace(): void {\n    for (const curve of this.children)\n      curve.reverseInPlace();\n  }\n  /**\n   * Return the max gap between adjacent primitives in Path and Loop collections.\n   * * In a Path, gaps are computed between consecutive primitives.\n   * * In a Loop, gaps are computed between consecutive primitives and between last and first.\n   * * Gaps are NOT computed between consecutive CurvePrimitives in \"unstructured\" collections. The type is\n   * \"unstructured\" so gaps should not be semantically meaningful.\n   */\n  public maxGap(): number {\n    return GapSearchContext.maxGap(this);\n  }\n  /** Return true if the curve collection has any primitives other than LineSegment3d and LineString3d  */\n  public checkForNonLinearPrimitives(): boolean {\n    return CountLinearPartsSearchContext.hasNonLinearPrimitives(this);\n  }\n  /** Apply transform recursively to children */\n  public tryTransformInPlace(transform: Transform): boolean {\n    return TransformInPlaceContext.tryTransformInPlace(this, transform);\n  }\n  /** Return a deep copy. */\n  public override clone(): CurveCollection {\n    return CloneCurvesContext.clone(this) as CurveCollection;\n  }\n  /** Create a deep copy of transformed curves. */\n  public override cloneTransformed(transform: Transform): CurveCollection | undefined {\n    return CloneCurvesContext.clone(this, transform);\n  }\n  /** Create a deep copy with all linestrings broken down into multiple LineSegment3d. */\n  public cloneWithExpandedLineStrings(): CurveCollection {\n    return CloneWithExpandedLineStrings.clone(this);\n  }\n  /**\n   * Push all CurvePrimitives contained in the instance onto the `results` array.\n   * * This method is recursive. For example, if the CurveCollection contains a Loop, all CurvePrimitives\n   * of the Loop are pushed onto `results`.\n   */\n  private collectCurvePrimitivesGo(\n    results: CurvePrimitive[], smallestPossiblePrimitives: boolean, explodeLinestrings: boolean = false,\n  ): void {\n    if (this.children) {\n      for (const child of this.children) {\n        if (child instanceof CurvePrimitive)\n          child.collectCurvePrimitivesGo(results, smallestPossiblePrimitives, explodeLinestrings);\n        else if (child instanceof CurveCollection)\n          child.collectCurvePrimitivesGo(results, smallestPossiblePrimitives, explodeLinestrings);\n      }\n    }\n  }\n  /**\n   * Return an array containing all CurvePrimitives in the instance.\n   * * This method is recursive. For example, if the CurveCollection contains a Loop, all CurvePrimitives of\n   * the Loop are pushed onto the returned array.\n   * @param collectorArray optional array to receive primitives. If present, new primitives are ADDED (without\n   * clearing the array).\n   * @param smallestPossiblePrimitives if false, CurvePrimitiveWithDistanceIndex returns only itself. If true,\n   * it recurses to its (otherwise hidden) children.\n   */\n  public collectCurvePrimitives(\n    collectorArray?: CurvePrimitive[], smallestPossiblePrimitives: boolean = false, explodeLineStrings: boolean = false,\n  ): CurvePrimitive[] {\n    const results: CurvePrimitive[] = collectorArray === undefined ? [] : collectorArray;\n    this.collectCurvePrimitivesGo(results, smallestPossiblePrimitives, explodeLineStrings);\n    return results;\n  }\n  /**\n   * Return true for planar region types:\n   * * `Loop`\n   * * `ParityRegion`\n   * * `UnionRegion`\n   * @see isAnyRegion\n   */\n  public get isAnyRegionType(): boolean {\n    return this.dgnBoundaryType() === 2 || this.dgnBoundaryType() === 4 || this.dgnBoundaryType() === 5;\n  }\n  /** Type guard for AnyRegion */\n  public isAnyRegion(): this is AnyRegion {\n    return this.isAnyRegionType;\n  }\n  /**\n   * Return true for a `Path`, i.e. a chain of curves joined head-to-tail.\n   * * This is NOT a test for (lack of) physical closure.\n   * @see [[isPath]], [[CurveChain.isPhysicallyClosedCurve]]\n   */\n  public get isOpenPath(): boolean {\n    return this.dgnBoundaryType() === 1;\n  }\n  /**\n   * Type guard for Path.\n   * * This is NOT a test for (lack of) physical closure.\n   * @see [[CurveChain.isPhysicallyClosedCurve]]\n   */\n  public isPath(): this is Path {\n    return this.isOpenPath;\n  }\n  /**\n   * Return true for a single-loop planar region type, i.e. `Loop`.\n   * * This is NOT a test for physical closure.\n   * @see [[isLoop]], [[CurveChain.isPhysicallyClosedCurve]]\n   */\n  public get isClosedPath(): boolean {\n    return this.dgnBoundaryType() === 2;\n  }\n  /**\n   * Type guard for Loop.\n   * * This is NOT a test for physical closure.\n   * @see [[CurveChain.isPhysicallyClosedCurve]]\n   */\n  public isLoop(): this is Loop {\n    return this.isClosedPath;\n  }\n\n  /** Return a CurveCollection with the same structure but all curves replaced by strokes. */\n  public abstract cloneStroked(options?: StrokeOptions): CurveCollection;\n  /** Support method for ICurvePrimitive ... one line call to specific announce method . . */\n  public abstract announceToCurveProcessor(processor: RecursiveCurveProcessor): void;\n  /** Clone an empty collection. */\n  public abstract cloneEmptyPeer(): CurveCollection;\n  /**\n   * Return the boundary type of a corresponding MicroStation CurveVector.\n   * * Derived class must implement.\n   */\n  public abstract dgnBoundaryType(): number;\n  /**\n   * Try to add a child.\n   * @param child child to add.\n   * @return true if child is an acceptable type for this collection.\n   */\n  public abstract tryAddChild(child: AnyCurve | undefined): boolean;\n  /** Return a child identified by by index */\n  public abstract getChild(i: number): AnyCurve | undefined;\n  /**\n   * Extend (increase) the given range as needed to encompass all curves in the curve collection.\n   * @param rangeToExtend the given range.\n   * @param transform if supplied, the range is extended with transformed curves.\n   */\n  public extendRange(rangeToExtend: Range3d, transform?: Transform): void {\n    const children = this.children;\n    if (children) {\n      for (const c of children) {\n        c.extendRange(rangeToExtend, transform);\n      }\n    }\n  }\n  /**\n   * Find any CurvePrimitive in the source and evaluate it at the given fraction.\n   * * The first CurvePrimitive found is evaluated. Any other CurvePrimitives are ignored.\n   * @param source containing `CurvePrimitive` or `CurveCollection`\n   * @param fraction fraction to use in `curve.fractionToPoint(fraction)`\n   */\n  public static createCurveLocationDetailOnAnyCurvePrimitive(\n    source: GeometryQuery | undefined, fraction: number = 0.5,\n  ): CurveLocationDetail | undefined {\n    if (!source)\n      return undefined;\n    if (source instanceof CurvePrimitive) {\n      return CurveLocationDetail.createCurveEvaluatedFraction(source, fraction);\n    } else if (source instanceof CurveCollection && source.children !== undefined)\n      for (const child of source.children) {\n        const detail = this.createCurveLocationDetailOnAnyCurvePrimitive(child, fraction);\n        if (detail)\n          return detail;\n      }\n    return undefined;\n  }\n  /**\n   * Project instance geometry (via dispatch) onto the given ray, and return the extreme fractional parameters\n   * of projection.\n   * @param ray ray onto which the instance is projected. A `Vector3d` is treated as a `Ray3d` with zero origin.\n   * @param lowHigh optional receiver for output\n   * @returns range of fractional projection parameters onto the ray, where 0.0 is start of the ray and 1.0 is the\n   * end of the ray.\n   */\n  public projectedParameterRange(ray: Vector3d | Ray3d, lowHigh?: Range1d): Range1d | undefined {\n    return PlaneAltitudeRangeContext.findExtremeFractionsAlongDirection(this, ray, lowHigh);\n  }\n  /** Return the immediate parent of the input curve in the instance, or undefined if it is not a descendant. */\n  public findParentOfDescendant(descendant: AnyCurve): CurveCollection | undefined {\n    for (const child of this.children) {\n      if (child === descendant)\n        return this;\n      if (child instanceof CurveCollection) {\n        const parent = child.findParentOfDescendant(descendant);\n        if (parent)\n          return parent;\n      }\n    }\n    return undefined;\n  };\n}\n\n/**\n * Shared base class for use by both open and closed paths.\n * * A `CurveChain` contains only CurvePrimitives. No other paths, loops, or regions allowed.\n * * The specific derived classes are `Path` and `Loop`.\n * * `CurveChain` is an intermediate class. It is not instantiable on its own.\n * * The related class `CurveChainWithDistanceIndex` is a `CurvePrimitive` whose API presents well-defined mappings\n * from fraction to xyz over the entire chain, but in fact does all the calculations over multiple primitives.\n * @see [Curve Collections]($docs/learning/geometry/CurveCollection.md) learning article.\n * @public\n */\nexport abstract class CurveChain extends CurveCollection {\n  /** The curve primitives in the chain. */\n  protected _curves: CurvePrimitive[];\n  /** Constructor */\n  protected constructor() {\n    super();\n    this._curves = [];\n  }\n  /** Return the array of `CurvePrimitive` */\n  public override get children(): CurvePrimitive[] {\n    return this._curves;\n  }\n  /** Return the start point of the curve chain (start point of the first child). */\n  public startPoint(result?: Point3d): Point3d | undefined {\n    const firstChild = this.getChild(0);\n    if (firstChild)\n      return firstChild.fractionToPoint(0.0, result);\n    else\n      return undefined;\n  }\n  /** Return the end point of the curve chain (end point of the last child). */\n  public endPoint(result?: Point3d): Point3d | undefined {\n    const lastChild = this.getChild(this._curves.length - 1);\n    if (lastChild)\n      return lastChild.fractionToPoint(1.0, result);\n    else\n      return undefined;\n  }\n  /**\n   * Whether the chain start and end points are defined and within tolerance.\n   * * Does not check for planarity or degeneracy.\n   * @param tolerance optional distance tolerance (default is [[Geometry.smallMetricDistance]])\n   * @param xyOnly if true, ignore z coordinate (default is `false`)\n   */\n  public isPhysicallyClosedCurve(tolerance: number = Geometry.smallMetricDistance, xyOnly: boolean = false): boolean {\n    const p0 = this.startPoint();\n    const p1 = this.endPoint();\n    return p0 !== undefined && p1 !== undefined && (xyOnly ? p0.isAlmostEqualXY(p1, tolerance) : p0.isAlmostEqual(p1, tolerance));\n  }\n  /**\n   * Return the start point and derivative of the first child of the curve chain.\n   * * For queries interior to the chain, use [[CurveChainWithDistanceIndex.fractionToPointAndDerivative]].\n   */\n  public startPointAndDerivative(result?: Ray3d): Ray3d | undefined {\n    const firstChild = this.getChild(0);\n    if (firstChild)\n      return firstChild.fractionToPointAndDerivative(0.0, result);\n    else\n      return undefined;\n  }\n  /**\n   * Return the end point and derivative of the last child of the curve chain.\n   * * For queries interior to the chain, use [[CurveChainWithDistanceIndex.fractionToPointAndDerivative]].\n   */\n  public endPointAndDerivative(result?: Ray3d): Ray3d | undefined {\n    const lastChild = this.getChild(this._curves.length - 1);\n    if (lastChild)\n      return lastChild.fractionToPointAndDerivative(1.0, result);\n    else\n      return undefined;\n  }\n  /**\n   * Return the curve primitive at the given `index`, optionally using `modulo` to map `index` to the cyclic indexing.\n   * * In particular, `-1` is the final curve.\n   * @param index cyclic index\n   * @param cyclic whether to employ modulo operator for wrap-around indexing. Default is `true`.\n   */\n  public cyclicCurvePrimitive(index: number, cyclic: boolean = true): CurvePrimitive | undefined {\n    const n = this.children.length;\n    if (n === 0)\n      return undefined;\n    if (index >= 0 && index < n) // try simplest non-cyclic access first\n      return this.children[index];\n    if (cyclic) {\n      const index2 = Geometry.modulo(index, n);\n      return this.children[index2];\n    }\n    return undefined;\n  }\n  /**\n   * Stroke the chain into a simple xyz array.\n   * @param options tolerance parameters controlling the stroking.\n   */\n  public getPackedStrokes(options?: StrokeOptions): GrowableXYZArray | undefined {\n    /**\n     * The object returned by \"cloneStroked\" has the same type (Loop or Path) but instead of a chain of\n     * CurvePrimitives as children, it has a single LineString3d child. \"getPackedStrokes\" just returns\n     * the points of that LineString3d using \"packedPoints\".\n     */\n    const tree = this.cloneStroked(options);\n    if (tree instanceof CurveChain) {\n      const children = tree.children;\n      if (children.length === 1) {\n        const ls = children[0];\n        if (ls instanceof LineString3d)\n          return ls.packedPoints;\n      }\n    }\n    return undefined;\n  }\n  /** Return a structural clone, with CurvePrimitive objects stroked. */\n  public abstract override cloneStroked(options?: StrokeOptions): CurveChain;\n  /**\n   * Add a child curve.\n   * @param child curve to add to the chain. The curve is captured by this instance.\n   * @return whether the child was added\n   */\n  public tryAddChild(child: AnyCurve | undefined): boolean {\n    if (child && child instanceof CurvePrimitive) {\n      this._curves.push(child);\n      return true;\n    }\n    return false;\n  }\n  /** Return a child by index */\n  public getChild(i: number): CurvePrimitive | undefined {\n    if (i < this._curves.length) return this._curves[i];\n    return undefined;\n  }\n  /** Invoke `curve.extendRange(range, transform)` for each child  */\n  public override extendRange(range: Range3d, transform?: Transform): void {\n    for (const curve of this._curves)\n      curve.extendRange(range, transform);\n  }\n  /**\n   * Reverse each child curve (in place).\n   * Reverse the order of the children array.\n   */\n  public reverseChildrenInPlace(): void {\n    for (const curve of this._curves)\n      curve.reverseInPlace();\n    this._curves.reverse();\n  }\n  /** Same as [[reverseChildrenInPlace]]. */\n  public override reverseInPlace(): void {\n    this.reverseChildrenInPlace();\n  }\n  /**\n   * Return the index where target is found in the array of children.\n   * @param alsoSearchProxies whether to also check proxy curves of the children\n   */\n  public childIndex(target: CurvePrimitive | undefined, alsoSearchProxies?: boolean): number | undefined {\n    for (let i = 0; i < this._curves.length; i++) {\n      if (this._curves[i] === target)\n        return i;\n    }\n    if (alsoSearchProxies ?? false) {\n      for (let i = 0; i < this._curves.length; i++) {\n        const childCurve = this._curves[i];\n        if (childCurve instanceof ProxyCurve) {\n          if (childCurve.proxyCurve === target)\n            return i;\n        }\n      }\n    }\n    return undefined;\n  }\n  /** Evaluate an indexed curve at a fraction. Return as a CurveLocationDetail that indicates the primitive. */\n  public primitiveIndexAndFractionToCurveLocationDetailPointAndDerivative(\n    index: number, fraction: number, cyclic: boolean = false, result?: CurveLocationDetail,\n  ): CurveLocationDetail | undefined {\n    const primitive = this.cyclicCurvePrimitive(index, cyclic);\n    if (primitive) {\n      return CurveLocationDetail.createCurveEvaluatedFractionPointAndDerivative(primitive, fraction, result);\n    }\n    return undefined;\n  }\n}\n\n/**\n * * A `BagOfCurves` object is a collection of `AnyCurve` objects.\n * * A `BagOfCurves` has no implied properties such as being planar.\n * @public\n */\nexport class BagOfCurves extends CurveCollection {\n  /** String name for schema properties */\n  public readonly curveCollectionType = \"bagOfCurves\";\n  /** Test if `other` is an instance of `BagOfCurves` */\n  public isSameGeometryClass(other: GeometryQuery): boolean {\n    return other instanceof BagOfCurves;\n  }\n  /**\n   * Array of children.\n   * * No restrictions on type.\n   */\n  protected _children: AnyCurve[];\n  /** Construct an empty `BagOfCurves` */\n  public constructor() {\n    super();\n    this._children = [];\n  }\n  /** Return the (reference to) array of children */\n  public override get children(): AnyCurve[] {\n    return this._children;\n  }\n  /** Create with given curves. */\n  public static create(...data: AnyCurve[]): BagOfCurves {\n    const result = new BagOfCurves();\n    for (const child of data) {\n      result.tryAddChild(child);\n    }\n    return result;\n  }\n  /** Return the boundary type (0) of a corresponding  MicroStation CurveVector */\n  public dgnBoundaryType(): number {\n    return 0;\n  }\n  /** Invoke `processor.announceBagOfCurves(this, indexInParent);` */\n  public announceToCurveProcessor(processor: RecursiveCurveProcessor, indexInParent: number = -1): void {\n    return processor.announceBagOfCurves(this, indexInParent);\n  }\n  /** Clone all children in stroked form. */\n  public cloneStroked(options?: StrokeOptions): BagOfCurves {\n    const clone = new BagOfCurves();\n    let child;\n    for (child of this.children) {\n      if (child instanceof CurvePrimitive) {\n        const ls = LineString3d.create();\n        child.emitStrokes(ls, options);\n        if (ls)\n          clone.children.push(ls);\n      } else if (child instanceof CurveCollection) {\n        const childStrokes = child.cloneStroked(options);\n        if (childStrokes)\n          clone.children.push(childStrokes);\n      }\n    }\n    return clone;\n  }\n  /** Return an empty `BagOfCurves` */\n  public cloneEmptyPeer(): BagOfCurves {\n    return new BagOfCurves();\n  }\n  /** Add a child  */\n  public tryAddChild(child: AnyCurve | undefined): boolean {\n    if (child)\n      this._children.push(child);\n    return true;\n  }\n  /** Get a child by index */\n  public getChild(i: number): AnyCurve | undefined {\n    if (i < this._children.length)\n      return this._children[i];\n    return undefined;\n  }\n  /** Second step of double dispatch:  call `handler.handleBagOfCurves(this)` */\n  public dispatchToGeometryHandler(handler: GeometryHandler): any {\n    return handler.handleBagOfCurves(this);\n  }\n}\n"]}
+{"version":3,"file":"CurveCollection.js","sourceRoot":"","sources":["../../../src/curve/CurveCollection.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F;;GAEG;AAEH,sDAA6C;AAC7C,0CAAuC;AAGvC,qDAAkD;AAKlD,uDAAqG;AACrG,+DAA4D;AAC5D,qDAAkE;AAGlE,mDAAgD;AAChD,kGAA+F;AAC/F,8EAA2E;AAC3E,kGAA+F;AAC/F,oGAAiG;AACjG,0EAAuE;AACvE,4FAAyF;AACzF,4EAAyE;AACzE,wFAAqF;AACrF,iDAA8C;AAC9C,6CAA0C;AAoB1C;;;;;;;;;;;;GAYG;AACH,MAAsB,eAAgB,SAAQ,6BAAa;IACzD,wCAAwC;IACxB,gBAAgB,GAAG,iBAAiB,CAAC;IAGrD,uDAAuD;IAChD,OAAO,GAAY,KAAK,CAAC;IAGhC,6DAA6D;IACtD,UAAU;QACf,OAAO,qCAAiB,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;IAC5C,CAAC;IACO,mBAAmB,CACzB,UAAmB,EAAE,SAAsC,KAAK,EAAE,MAA4B,EAAE,SAAkB,KAAK;QAEvH,IAAI,OAAwC,CAAC;QAC7C,MAAM,OAAO,GAAG,IAAI,yCAAmB,EAAE,CAAC;QAC1C,IAAI,GAAG,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC;QAC9C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9C,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC/B,IAAI,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC;gBAClB,uFAAuF;gBACvF,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,oCAAkB,CAAC,mDAAmD,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,iCAAe,CAAC,IAAI,CAAC;gBACnI,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,oCAAkB,CAAC,mDAAmD,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,iCAAe,CAAC,IAAI,CAAC;gBAC1J,GAAG,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;YACvB,CAAC;YACD,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,cAAc,CAAC,UAAU,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,YAAY,CAAC,UAAU,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;YAClH,IAAI,EAAE,EAAE,CAAC;gBACP,MAAM,OAAO,GAAG,yCAAmB,CAAC,cAAc,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;gBACrE,IAAA,qBAAM,EAAC,SAAS,KAAK,OAAO,EAAE,kDAAkD,CAAC,CAAC;gBAClF,OAAO,GAAG,MAAM,GAAG,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;YAC3C,CAAC;QACH,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IACD;;;;;;OAMG;IACI,YAAY,CACjB,UAAmB,EAAE,SAAsC,KAAK,EAAE,MAA4B;QAE9F,OAAO,IAAI,CAAC,mBAAmB,CAAC,UAAU,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;IAC9D,CAAC;IACD;;;;;;OAMG;IACI,cAAc,CACnB,UAAmB,EAAE,SAAsC,KAAK,EAAE,MAA4B;QAE9F,OAAO,IAAI,CAAC,mBAAmB,CAAC,UAAU,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;IACpE,CAAC;IACD;;;;;;;;;;OAUG;IACI,YAAY,CACjB,UAAmB,EAAE,eAAsD,EAAE,OAAwB;QAErG,MAAM,aAAa,GAAG,IAAI,2DAA4B,CAAC,UAAU,EAAE,eAAe,EAAE,OAAO,CAAC,CAAC;QAC7F,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;YAChC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAClC,IAAI,KAAK,YAAY,+BAAc;oBACjC,KAAK,CAAC,kBAAkB,CAAC,aAAa,EAAE,OAAO,EAAE,aAAa,CAAC,CAAC;qBAC7D,IAAI,KAAK,YAAY,eAAe;oBACvC,KAAK,CAAC,YAAY,CAAC,UAAU,EAAE,eAAe,EAAE,OAAO,CAAC,CAAC;YAC7D,CAAC;QACH,CAAC;IACH,CAAC;IACD;;;;;;;OAOG;IACI,WAAW,CAAC,UAAmB,EAAE,OAAwB;QAC9D,MAAM,QAAQ,GAA0B,EAAE,CAAC;QAC3C,IAAI,CAAC,YAAY,CAAC,UAAU,EAAE,CAAC,CAAsB,EAAE,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC;QAC7F,OAAO,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,QAAQ,CAAC;IACxD,CAAC;IACD;;;;;;;OAOG;IACI,cAAc,CAAC,UAAmB,EAAE,OAAwB;QACjE,MAAM,IAAI,GAAG,OAAO,EAAE,SAAS,IAAI,UAAU,CAAC;QAC9C,IAAI,OAA6B,CAAC;QAClC,IAAI,OAAO,EAAE,WAAW,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,YAAY,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;YACjF,OAAO,GAAG,mBAAQ,CAAC,8BAA8B,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,EAAE,OAAO,CAAC,WAAW,CAAC,CAAC,EAAE,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;QACzH,MAAM,gBAAgB,GAAG,CAAC,EAAW,EAAU,EAAE;YAC/C,OAAO,OAAO,EAAE,oBAAoB,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,kBAAkB,EAAE,IAAI,EAAE,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC;QACvI,CAAC,CAAC;QACF,IAAI,cAA+C,CAAC;QACpD,IAAI,YAAY,GAAG,mBAAQ,CAAC,qBAAqB,CAAC;QAClD,MAAM,qBAAqB,GAAG,CAAC,OAA4B,EAAE,EAAE;YAC7D,MAAM,KAAK,GAAG,gBAAgB,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;YAC9C,IAAI,CAAC,cAAc,IAAI,KAAK,GAAG,YAAY,EAAE,CAAC;gBAC5C,cAAc,GAAG,OAAO,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC;gBAC/C,YAAY,GAAG,KAAK,CAAC;YACvB,CAAC;QACH,CAAC,CAAC;QACF,IAAI,CAAC,YAAY,CAAC,UAAU,EAAE,qBAAqB,EAAE,OAAO,CAAC,CAAC;QAC9D,OAAO,cAAc,CAAC;IACxB,CAAC;IACD,oHAAoH;IAC7G,cAAc;QACnB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ;YAC/B,KAAK,CAAC,cAAc,EAAE,CAAC;IAC3B,CAAC;IACD;;;;;;OAMG;IACI,MAAM;QACX,OAAO,mCAAgB,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACvC,CAAC;IACD,wGAAwG;IACjG,2BAA2B;QAChC,OAAO,6DAA6B,CAAC,sBAAsB,CAAC,IAAI,CAAC,CAAC;IACpE,CAAC;IACD,8CAA8C;IACvC,mBAAmB,CAAC,SAAoB;QAC7C,OAAO,iDAAuB,CAAC,mBAAmB,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;IACtE,CAAC;IACD,0BAA0B;IACV,KAAK;QACnB,OAAO,uCAAkB,CAAC,KAAK,CAAC,IAAI,CAAoB,CAAC;IAC3D,CAAC;IACD,gDAAgD;IAChC,gBAAgB,CAAC,SAAoB;QACnD,OAAO,uCAAkB,CAAC,KAAK,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;IACnD,CAAC;IACD,uFAAuF;IAChF,4BAA4B;QACjC,OAAO,2DAA4B,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAClD,CAAC;IACD;;;;OAIG;IACK,wBAAwB,CAC9B,OAAyB,EAAE,0BAAmC,EAAE,qBAA8B,KAAK;QAEnG,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAClB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAClC,IAAI,KAAK,YAAY,+BAAc;oBACjC,KAAK,CAAC,wBAAwB,CAAC,OAAO,EAAE,0BAA0B,EAAE,kBAAkB,CAAC,CAAC;qBACrF,IAAI,KAAK,YAAY,eAAe;oBACvC,KAAK,CAAC,wBAAwB,CAAC,OAAO,EAAE,0BAA0B,EAAE,kBAAkB,CAAC,CAAC;YAC5F,CAAC;QACH,CAAC;IACH,CAAC;IACD;;;;;;;;OAQG;IACI,sBAAsB,CAC3B,cAAiC,EAAE,6BAAsC,KAAK,EAAE,qBAA8B,KAAK;QAEnH,MAAM,OAAO,GAAqB,cAAc,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,cAAc,CAAC;QACrF,IAAI,CAAC,wBAAwB,CAAC,OAAO,EAAE,0BAA0B,EAAE,kBAAkB,CAAC,CAAC;QACvF,OAAO,OAAO,CAAC;IACjB,CAAC;IACD;;;;;;OAMG;IACH,IAAW,eAAe;QACxB,OAAO,IAAI,CAAC,eAAe,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,eAAe,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,eAAe,EAAE,KAAK,CAAC,CAAC;IACtG,CAAC;IACD,+BAA+B;IACxB,WAAW;QAChB,OAAO,IAAI,CAAC,eAAe,CAAC;IAC9B,CAAC;IACD;;;;OAIG;IACH,IAAW,UAAU;QACnB,OAAO,IAAI,CAAC,eAAe,EAAE,KAAK,CAAC,CAAC;IACtC,CAAC;IACD;;;;OAIG;IACI,MAAM;QACX,OAAO,IAAI,CAAC,UAAU,CAAC;IACzB,CAAC;IACD;;;;OAIG;IACH,IAAW,YAAY;QACrB,OAAO,IAAI,CAAC,eAAe,EAAE,KAAK,CAAC,CAAC;IACtC,CAAC;IACD;;;;OAIG;IACI,MAAM;QACX,OAAO,IAAI,CAAC,YAAY,CAAC;IAC3B,CAAC;IAqBD;;;;OAIG;IACI,WAAW,CAAC,aAAsB,EAAE,SAAqB;QAC9D,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC/B,IAAI,QAAQ,EAAE,CAAC;YACb,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;gBACzB,CAAC,CAAC,WAAW,CAAC,aAAa,EAAE,SAAS,CAAC,CAAC;YAC1C,CAAC;QACH,CAAC;IACH,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,4CAA4C,CACxD,MAAiC,EAAE,WAAmB,GAAG;QAEzD,IAAI,CAAC,MAAM;YACT,OAAO,SAAS,CAAC;QACnB,IAAI,MAAM,YAAY,+BAAc,EAAE,CAAC;YACrC,OAAO,yCAAmB,CAAC,4BAA4B,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;QAC5E,CAAC;aAAM,IAAI,MAAM,YAAY,eAAe,IAAI,MAAM,CAAC,QAAQ,KAAK,SAAS;YAC3E,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC;gBACpC,MAAM,MAAM,GAAG,IAAI,CAAC,4CAA4C,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;gBAClF,IAAI,MAAM;oBACR,OAAO,MAAM,CAAC;YAClB,CAAC;QACH,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;;OAOG;IACI,uBAAuB,CAAC,GAAqB,EAAE,OAAiB;QACrE,OAAO,qDAAyB,CAAC,kCAAkC,CAAC,IAAI,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;IAC1F,CAAC;IACD,8GAA8G;IACvG,sBAAsB,CAAC,UAAoB;QAChD,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAClC,IAAI,KAAK,KAAK,UAAU;gBACtB,OAAO,IAAI,CAAC;YACd,IAAI,KAAK,YAAY,eAAe,EAAE,CAAC;gBACrC,MAAM,MAAM,GAAG,KAAK,CAAC,sBAAsB,CAAC,UAAU,CAAC,CAAC;gBACxD,IAAI,MAAM;oBACR,OAAO,MAAM,CAAC;YAClB,CAAC;QACH,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAAA,CAAC;CACH;AA7TD,0CA6TC;AAED;;;;;;;;;GASG;AACH,MAAsB,UAAW,SAAQ,eAAe;IACtD,yCAAyC;IAC/B,OAAO,CAAmB;IACpC,kBAAkB;IAClB;QACE,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC;IACpB,CAAC;IACD,2CAA2C;IAC3C,IAAoB,QAAQ;QAC1B,OAAO,IAAI,CAAC,OAAO,CAAC;IACtB,CAAC;IACD,kFAAkF;IAC3E,UAAU,CAAC,MAAgB;QAChC,MAAM,UAAU,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACpC,IAAI,UAAU;YACZ,OAAO,UAAU,CAAC,eAAe,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;;YAE/C,OAAO,SAAS,CAAC;IACrB,CAAC;IACD,6EAA6E;IACtE,QAAQ,CAAC,MAAgB;QAC9B,MAAM,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACzD,IAAI,SAAS;YACX,OAAO,SAAS,CAAC,eAAe,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;;YAE9C,OAAO,SAAS,CAAC;IACrB,CAAC;IACD;;;;;OAKG;IACI,uBAAuB,CAAC,YAAoB,mBAAQ,CAAC,mBAAmB,EAAE,SAAkB,KAAK;QACtG,MAAM,EAAE,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC;QAC7B,MAAM,EAAE,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;QAC3B,OAAO,EAAE,KAAK,SAAS,IAAI,EAAE,KAAK,SAAS,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,eAAe,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,aAAa,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC,CAAC;IAChI,CAAC;IACD;;;OAGG;IACI,uBAAuB,CAAC,MAAc;QAC3C,MAAM,UAAU,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACpC,IAAI,UAAU;YACZ,OAAO,UAAU,CAAC,4BAA4B,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;;YAE5D,OAAO,SAAS,CAAC;IACrB,CAAC;IACD;;;OAGG;IACI,qBAAqB,CAAC,MAAc;QACzC,MAAM,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACzD,IAAI,SAAS;YACX,OAAO,SAAS,CAAC,4BAA4B,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;;YAE3D,OAAO,SAAS,CAAC;IACrB,CAAC;IACD;;;;;OAKG;IACI,oBAAoB,CAAC,KAAa,EAAE,SAAkB,IAAI;QAC/D,MAAM,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;QAC/B,IAAI,CAAC,KAAK,CAAC;YACT,OAAO,SAAS,CAAC;QACnB,IAAI,KAAK,IAAI,CAAC,IAAI,KAAK,GAAG,CAAC,EAAE,uCAAuC;YAClE,OAAO,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QAC9B,IAAI,MAAM,EAAE,CAAC;YACX,MAAM,MAAM,GAAG,mBAAQ,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YACzC,OAAO,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QAC/B,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;OAGG;IACI,gBAAgB,CAAC,OAAuB;QAC7C;;;;WAIG;QACH,MAAM,IAAI,GAAG,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC;QACxC,IAAI,IAAI,YAAY,UAAU,EAAE,CAAC;YAC/B,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;YAC/B,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBAC1B,MAAM,EAAE,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;gBACvB,IAAI,EAAE,YAAY,2BAAY;oBAC5B,OAAO,EAAE,CAAC,YAAY,CAAC;YAC3B,CAAC;QACH,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAGD;;;;OAIG;IACI,WAAW,CAAC,KAA2B;QAC5C,IAAI,KAAK,IAAI,KAAK,YAAY,+BAAc,EAAE,CAAC;YAC7C,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACzB,OAAO,IAAI,CAAC;QACd,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,8BAA8B;IACvB,QAAQ,CAAC,CAAS;QACvB,IAAI,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM;YAAE,OAAO,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QACpD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,mEAAmE;IACnD,WAAW,CAAC,KAAc,EAAE,SAAqB;QAC/D,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO;YAC9B,KAAK,CAAC,WAAW,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;IACxC,CAAC;IACD;;;OAGG;IACI,sBAAsB;QAC3B,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO;YAC9B,KAAK,CAAC,cAAc,EAAE,CAAC;QACzB,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,CAAC;IACzB,CAAC;IACD,0CAA0C;IAC1B,cAAc;QAC5B,IAAI,CAAC,sBAAsB,EAAE,CAAC;IAChC,CAAC;IACD;;;OAGG;IACI,UAAU,CAAC,MAAkC,EAAE,iBAA2B;QAC/E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7C,IAAI,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,MAAM;gBAC5B,OAAO,CAAC,CAAC;QACb,CAAC;QACD,IAAI,iBAAiB,IAAI,KAAK,EAAE,CAAC;YAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC7C,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;gBACnC,IAAI,UAAU,YAAY,uBAAU,EAAE,CAAC;oBACrC,IAAI,UAAU,CAAC,UAAU,KAAK,MAAM;wBAClC,OAAO,CAAC,CAAC;gBACb,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,6GAA6G;IACtG,gEAAgE,CACrE,KAAa,EAAE,QAAgB,EAAE,SAAkB,KAAK,EAAE,MAA4B;QAEtF,MAAM,SAAS,GAAG,IAAI,CAAC,oBAAoB,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QAC3D,IAAI,SAAS,EAAE,CAAC;YACd,OAAO,yCAAmB,CAAC,8CAA8C,CAAC,SAAS,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;QACzG,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;CACF;AAvKD,gCAuKC;AAED;;;;GAIG;AACH,MAAa,WAAY,SAAQ,eAAe;IAC9C,wCAAwC;IACxB,mBAAmB,GAAG,aAAa,CAAC;IACpD,sDAAsD;IAC/C,mBAAmB,CAAC,KAAoB;QAC7C,OAAO,KAAK,YAAY,WAAW,CAAC;IACtC,CAAC;IACD;;;OAGG;IACO,SAAS,CAAa;IAChC,uCAAuC;IACvC;QACE,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,SAAS,GAAG,EAAE,CAAC;IACtB,CAAC;IACD,kDAAkD;IAClD,IAAoB,QAAQ;QAC1B,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;IACD,gCAAgC;IACzB,MAAM,CAAC,MAAM,CAAC,GAAG,IAAgB;QACtC,MAAM,MAAM,GAAG,IAAI,WAAW,EAAE,CAAC;QACjC,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC;YACzB,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;QAC5B,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,gFAAgF;IACzE,eAAe;QACpB,OAAO,CAAC,CAAC;IACX,CAAC;IACD,mEAAmE;IAC5D,wBAAwB,CAAC,SAAkC,EAAE,gBAAwB,CAAC,CAAC;QAC5F,OAAO,SAAS,CAAC,mBAAmB,CAAC,IAAI,EAAE,aAAa,CAAC,CAAC;IAC5D,CAAC;IACD,0CAA0C;IACnC,YAAY,CAAC,OAAuB;QACzC,MAAM,KAAK,GAAG,IAAI,WAAW,EAAE,CAAC;QAChC,IAAI,KAAK,CAAC;QACV,KAAK,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAC5B,IAAI,KAAK,YAAY,+BAAc,EAAE,CAAC;gBACpC,MAAM,EAAE,GAAG,2BAAY,CAAC,MAAM,EAAE,CAAC;gBACjC,KAAK,CAAC,WAAW,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;gBAC/B,IAAI,EAAE;oBACJ,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAC5B,CAAC;iBAAM,IAAI,KAAK,YAAY,eAAe,EAAE,CAAC;gBAC5C,MAAM,YAAY,GAAG,KAAK,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC;gBACjD,IAAI,YAAY;oBACd,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;YACtC,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,oCAAoC;IAC7B,cAAc;QACnB,OAAO,IAAI,WAAW,EAAE,CAAC;IAC3B,CAAC;IACD,mBAAmB;IACZ,WAAW,CAAC,KAA2B;QAC5C,IAAI,KAAK;YACP,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC7B,OAAO,IAAI,CAAC;IACd,CAAC;IACD,2BAA2B;IACpB,QAAQ,CAAC,CAAS;QACvB,IAAI,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM;YAC3B,OAAO,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QAC3B,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,8EAA8E;IACvE,yBAAyB,CAAC,OAAwB;QACvD,OAAO,OAAO,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC;IACzC,CAAC;CACF;AA3ED,kCA2EC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n\r\n/** @packageDocumentation\r\n * @module Curve\r\n */\r\n\r\nimport { assert } from \"@itwin/core-bentley\";\r\nimport { Geometry } from \"../Geometry\";\r\nimport { GeometryHandler } from \"../geometry3d/GeometryHandler\";\r\nimport { GrowableXYZArray } from \"../geometry3d/GrowableXYZArray\";\r\nimport { Matrix3d } from \"../geometry3d/Matrix3d\";\r\nimport { Point3d, Vector3d } from \"../geometry3d/Point3dVector3d\";\r\nimport { Range1d, Range3d } from \"../geometry3d/Range\";\r\nimport { Ray3d } from \"../geometry3d/Ray3d\";\r\nimport { Transform } from \"../geometry3d/Transform\";\r\nimport { CurveExtendMode, CurveExtendOptions, VariantCurveExtendParameter } from \"./CurveExtendMode\";\r\nimport { CurveLocationDetail } from \"./CurveLocationDetail\";\r\nimport { CurvePrimitive, TangentOptions } from \"./CurvePrimitive\";\r\nimport { RecursiveCurveProcessor } from \"./CurveProcessor\";\r\nimport { AnyCurve, type AnyRegion } from \"./CurveTypes\";\r\nimport { GeometryQuery } from \"./GeometryQuery\";\r\nimport { AnnounceTangentStrokeHandler } from \"./internalContexts/AnnounceTangentStrokeHandler\";\r\nimport { CloneCurvesContext } from \"./internalContexts/CloneCurvesContext\";\r\nimport { CloneWithExpandedLineStrings } from \"./internalContexts/CloneWithExpandedLineStrings\";\r\nimport { CountLinearPartsSearchContext } from \"./internalContexts/CountLinearPartsSearchContext\";\r\nimport { GapSearchContext } from \"./internalContexts/GapSearchContext\";\r\nimport { PlaneAltitudeRangeContext } from \"./internalContexts/PlaneAltitudeRangeContext\";\r\nimport { SumLengthsContext } from \"./internalContexts/SumLengthsContext\";\r\nimport { TransformInPlaceContext } from \"./internalContexts/TransformInPlaceContext\";\r\nimport { LineString3d } from \"./LineString3d\";\r\nimport { ProxyCurve } from \"./ProxyCurve\";\r\nimport { StrokeOptions } from \"./StrokeOptions\";\r\n\r\nimport type { Path } from \"./Path\";\r\nimport type { Loop } from \"./Loop\";\r\n\r\n/** Note: CurveChain and BagOfCurves classes are located in this file to prevent circular dependency. */\r\n\r\n/**\r\n * Describes the concrete type of a [[CurveCollection]]. Each type name maps to a specific subclass and can be\r\n * used in conditional statements for type-switching.\r\n *    - \"loop\" => [[Loop]]\r\n *    - \"path\" => [[Path]]\r\n *    - \"unionRegion\" => [[UnionRegion]]\r\n *    - \"parityRegion\" => [[ParityRegion]]\r\n *    - \"bagOfCurves\" => [[BagOfCurves]]\r\n * @public\r\n */\r\nexport type CurveCollectionType = \"loop\" | \"path\" | \"unionRegion\" | \"parityRegion\" | \"bagOfCurves\";\r\n\r\n/**\r\n * A `CurveCollection` is an abstract (non-instantiable) class for various sets of curves with particular structures:\r\n * - [[CurveChain]] - a non-instantiable intermediate class for a sequence of [[CurvePrimitive]] joining head-to-tail.\r\n * The two instantiable forms of `CurveChain` are:\r\n *   - [[Path]] - a chain of curves. Does not have to be closed or planar. A closed `Path` is not treated as bounding a surface.\r\n *   - [[Loop]] - a closed and planar chain of curves. A `Loop` is treated as bounding a planar area.\r\n * - [[ParityRegion]] - a collection of coplanar `Loop`, with \"in/out\" classification by parity rules.\r\n * - [[UnionRegion]] - a collection of coplanar `Loop` and/or `ParityRegion`, with \"in/out\" classification by union rules.\r\n * - [[BagOfCurves]] - a collection of [[AnyCurve]] with no implied structure.\r\n *\r\n * @see [Curve Collections]($docs/learning/geometry/CurveCollection.md) learning article.\r\n * @public\r\n */\r\nexport abstract class CurveCollection extends GeometryQuery {\r\n  /** String name for schema properties */\r\n  public readonly geometryCategory = \"curveCollection\";\r\n  /** Type discriminator. */\r\n  public abstract readonly curveCollectionType: CurveCollectionType;\r\n  /** Flag for inner loop status. Only used by `Loop`. */\r\n  public isInner: boolean = false;\r\n  /** Return the curve children. */\r\n  public abstract override get children(): AnyCurve[];\r\n  /** Return the sum of the lengths of all contained curves. */\r\n  public sumLengths(): number {\r\n    return SumLengthsContext.sumLengths(this);\r\n  }\r\n  private computeClosestPoint(\r\n    spacePoint: Point3d, extend: VariantCurveExtendParameter = false, result?: CurveLocationDetail, xyOnly: boolean = false,\r\n  ): CurveLocationDetail | undefined {\r\n    let detailA: CurveLocationDetail | undefined;\r\n    const detailB = new CurveLocationDetail();\r\n    let ext = this.isAnyRegion() ? false : extend;\r\n    for (let i = 0; i < this.children.length; i++) {\r\n      const child = this.children[i];\r\n      if (this.isPath()) {\r\n        // head only extends at start; tail only at end. NOTE: child may be both head and tail!\r\n        const mode0 = (i === 0) ? CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(extend, 0) : CurveExtendMode.None;\r\n        const mode1 = (i === this.children.length - 1) ? CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(extend, 1) : CurveExtendMode.None;\r\n        ext = [mode0, mode1];\r\n      }\r\n      const cp = xyOnly ? child.closestPointXY(spacePoint, ext, detailB) : child.closestPoint(spacePoint, ext, detailB);\r\n      if (cp) {\r\n        const smaller = CurveLocationDetail.chooseSmallerA(detailA, detailB);\r\n        assert(undefined !== smaller, \"expect defined because detailB is always defined\");\r\n        detailA = result = smaller.clone(result);\r\n      }\r\n    }\r\n    return detailA;\r\n  }\r\n  /**\r\n   * Return the closest point on the contained curves.\r\n   * @param spacePoint point in space.\r\n   * @param extend extend applicable only to [[Path]] and [[BagOfCurves]]. Default value `false`.\r\n   * @param result (optional) pre-allocated detail to populate and return.\r\n   * @returns details of the closest point.\r\n   */\r\n  public closestPoint(\r\n    spacePoint: Point3d, extend: VariantCurveExtendParameter = false, result?: CurveLocationDetail,\r\n  ): CurveLocationDetail | undefined {\r\n    return this.computeClosestPoint(spacePoint, extend, result);\r\n  }\r\n  /**\r\n   * Return the closest point on the contained curves as viewed in the xy-plane (ignoring z).\r\n   * @param spacePoint point in space.\r\n   * @param extend (optional) extend applicable only to [[Path]] and [[BagOfCurves]]. Default value `false`.\r\n   * @param result (optional) pre-allocated detail to populate and return.\r\n   * @returns details of the closest point.\r\n   */\r\n  public closestPointXY(\r\n    spacePoint: Point3d, extend: VariantCurveExtendParameter = false, result?: CurveLocationDetail,\r\n  ): CurveLocationDetail | undefined {\r\n    return this.computeClosestPoint(spacePoint, extend, result, true);\r\n  }\r\n  /**\r\n   * Announce all points `P` on the contained curves such that the line containing `spacePoint` and `P` is tangent to\r\n   * the contained curves in the view defined by `options.vectorToEye`.\r\n   * * Strictly speaking, each tangent line lies in the plane through `P` whose normal is the cross product of the curve\r\n   * tangent at `P` and `options.vectorToEye`. This is equivalent to tangency as seen in a view plane perpendicular to\r\n   * `options.vectorToEye`.\r\n   * @param spacePoint point in space.\r\n   * @param announceTangent callback to announce each computed tangent. The received [[CurveLocationDetail]] is reused\r\n   * internally, so it should be cloned in the callback if it needs to be saved.\r\n   * @param options (optional) options for computing tangents. See [[TangentOptions]] for defaults.\r\n   */\r\n  public emitTangents(\r\n    spacePoint: Point3d, announceTangent: (tangent: CurveLocationDetail) => any, options?: TangentOptions,\r\n  ): void {\r\n    const strokeHandler = new AnnounceTangentStrokeHandler(spacePoint, announceTangent, options);\r\n    if (this.children !== undefined) {\r\n      for (const child of this.children) {\r\n        if (child instanceof CurvePrimitive)\r\n          child.emitStrokableParts(strokeHandler, options?.strokeOptions);\r\n        else if (child instanceof CurveCollection)\r\n          child.emitTangents(spacePoint, announceTangent, options);\r\n      }\r\n    }\r\n  }\r\n  /**\r\n   * Return all points `P` on the contained curves such that the line containing `spacePoint` and `P` is tangent to the\r\n   * contained curves in the view defined by `options.vectorToEye`.\r\n   * * See [[emitTangents]] for the definition of tangency employed.\r\n   * @param spacePoint point in space.\r\n   * @param options (optional) options for computing tangents. See [[TangentOptions]] for defaults.\r\n   * @returns an array of details of all tangent points or undefined if no tangent was found.\r\n   */\r\n  public allTangents(spacePoint: Point3d, options?: TangentOptions): CurveLocationDetail[] | undefined {\r\n    const tangents: CurveLocationDetail[] = [];\r\n    this.emitTangents(spacePoint, (t: CurveLocationDetail) => tangents.push(t.clone()), options);\r\n    return (tangents.length === 0) ? undefined : tangents;\r\n  }\r\n  /**\r\n   * Return the point `P` on the contained curves such that the line containing `spacePoint` and `P` is tangent to the\r\n   * contained curves in the view defined by `options.vectorToEye`, and `P` is closest to `options.hintPoint` in this view.\r\n   * * See [[emitTangents]] for the definition of tangency employed.\r\n   * @param spacePoint point in space.\r\n   * @param options (optional) options for computing tangents. See [[TangentOptions]] for defaults.\r\n   * @returns the detail of the closest tangent point or undefined if no tangent was found.\r\n   */\r\n  public closestTangent(spacePoint: Point3d, options?: TangentOptions): CurveLocationDetail | undefined {\r\n    const hint = options?.hintPoint ?? spacePoint;\r\n    let toLocal: Matrix3d | undefined;\r\n    if (options?.vectorToEye && !options.vectorToEye.isExactEqual({ x: 0, y: 0, z: 1 }))\r\n      toLocal = Matrix3d.createRigidViewAxesZTowardsEye(options.vectorToEye.x, options.vectorToEye.y, options.vectorToEye.z);\r\n    const measureHintDist2 = (pt: Point3d): number => { // measure distance to hint in view plane coordinates\r\n      return toLocal?.multiplyTransposeXYZ(hint.x - pt.x, hint.y - pt.y, hint.z - pt.z).magnitudeSquaredXY() ?? pt.distanceSquaredXY(hint);\r\n    };\r\n    let closestTangent: CurveLocationDetail | undefined;\r\n    let closestDist2 = Geometry.largeCoordinateResult;\r\n    const collectClosestTangent = (tangent: CurveLocationDetail) => {\r\n      const dist2 = measureHintDist2(tangent.point);\r\n      if (!closestTangent || dist2 < closestDist2) {\r\n        closestTangent = tangent.clone(closestTangent);\r\n        closestDist2 = dist2;\r\n      }\r\n    };\r\n    this.emitTangents(spacePoint, collectClosestTangent, options);\r\n    return closestTangent;\r\n  }\r\n  /** Reverse the collection's data so that each child curve's fractional stroking moves in the opposite direction. */\r\n  public reverseInPlace(): void {\r\n    for (const curve of this.children)\r\n      curve.reverseInPlace();\r\n  }\r\n  /**\r\n   * Return the max gap between adjacent primitives in Path and Loop collections.\r\n   * * In a Path, gaps are computed between consecutive primitives.\r\n   * * In a Loop, gaps are computed between consecutive primitives and between last and first.\r\n   * * Gaps are NOT computed between consecutive CurvePrimitives in \"unstructured\" collections. The type is\r\n   * \"unstructured\" so gaps should not be semantically meaningful.\r\n   */\r\n  public maxGap(): number {\r\n    return GapSearchContext.maxGap(this);\r\n  }\r\n  /** Return true if the curve collection has any primitives other than LineSegment3d and LineString3d  */\r\n  public checkForNonLinearPrimitives(): boolean {\r\n    return CountLinearPartsSearchContext.hasNonLinearPrimitives(this);\r\n  }\r\n  /** Apply transform recursively to children */\r\n  public tryTransformInPlace(transform: Transform): boolean {\r\n    return TransformInPlaceContext.tryTransformInPlace(this, transform);\r\n  }\r\n  /** Return a deep copy. */\r\n  public override clone(): CurveCollection {\r\n    return CloneCurvesContext.clone(this) as CurveCollection;\r\n  }\r\n  /** Create a deep copy of transformed curves. */\r\n  public override cloneTransformed(transform: Transform): CurveCollection | undefined {\r\n    return CloneCurvesContext.clone(this, transform);\r\n  }\r\n  /** Create a deep copy with all linestrings broken down into multiple LineSegment3d. */\r\n  public cloneWithExpandedLineStrings(): CurveCollection {\r\n    return CloneWithExpandedLineStrings.clone(this);\r\n  }\r\n  /**\r\n   * Push all CurvePrimitives contained in the instance onto the `results` array.\r\n   * * This method is recursive. For example, if the CurveCollection contains a Loop, all CurvePrimitives\r\n   * of the Loop are pushed onto `results`.\r\n   */\r\n  private collectCurvePrimitivesGo(\r\n    results: CurvePrimitive[], smallestPossiblePrimitives: boolean, explodeLinestrings: boolean = false,\r\n  ): void {\r\n    if (this.children) {\r\n      for (const child of this.children) {\r\n        if (child instanceof CurvePrimitive)\r\n          child.collectCurvePrimitivesGo(results, smallestPossiblePrimitives, explodeLinestrings);\r\n        else if (child instanceof CurveCollection)\r\n          child.collectCurvePrimitivesGo(results, smallestPossiblePrimitives, explodeLinestrings);\r\n      }\r\n    }\r\n  }\r\n  /**\r\n   * Return an array containing all CurvePrimitives in the instance.\r\n   * * This method is recursive. For example, if the CurveCollection contains a Loop, all CurvePrimitives of\r\n   * the Loop are pushed onto the returned array.\r\n   * @param collectorArray optional array to receive primitives. If present, new primitives are ADDED (without\r\n   * clearing the array).\r\n   * @param smallestPossiblePrimitives if false, CurvePrimitiveWithDistanceIndex returns only itself. If true,\r\n   * it recurses to its (otherwise hidden) children.\r\n   */\r\n  public collectCurvePrimitives(\r\n    collectorArray?: CurvePrimitive[], smallestPossiblePrimitives: boolean = false, explodeLineStrings: boolean = false,\r\n  ): CurvePrimitive[] {\r\n    const results: CurvePrimitive[] = collectorArray === undefined ? [] : collectorArray;\r\n    this.collectCurvePrimitivesGo(results, smallestPossiblePrimitives, explodeLineStrings);\r\n    return results;\r\n  }\r\n  /**\r\n   * Return true for planar region types:\r\n   * * `Loop`\r\n   * * `ParityRegion`\r\n   * * `UnionRegion`\r\n   * @see isAnyRegion\r\n   */\r\n  public get isAnyRegionType(): boolean {\r\n    return this.dgnBoundaryType() === 2 || this.dgnBoundaryType() === 4 || this.dgnBoundaryType() === 5;\r\n  }\r\n  /** Type guard for AnyRegion */\r\n  public isAnyRegion(): this is AnyRegion {\r\n    return this.isAnyRegionType;\r\n  }\r\n  /**\r\n   * Return true for a `Path`, i.e. a chain of curves joined head-to-tail.\r\n   * * This is NOT a test for (lack of) physical closure.\r\n   * @see [[isPath]], [[CurveChain.isPhysicallyClosedCurve]]\r\n   */\r\n  public get isOpenPath(): boolean {\r\n    return this.dgnBoundaryType() === 1;\r\n  }\r\n  /**\r\n   * Type guard for Path.\r\n   * * This is NOT a test for (lack of) physical closure.\r\n   * @see [[CurveChain.isPhysicallyClosedCurve]]\r\n   */\r\n  public isPath(): this is Path {\r\n    return this.isOpenPath;\r\n  }\r\n  /**\r\n   * Return true for a single-loop planar region type, i.e. `Loop`.\r\n   * * This is NOT a test for physical closure.\r\n   * @see [[isLoop]], [[CurveChain.isPhysicallyClosedCurve]]\r\n   */\r\n  public get isClosedPath(): boolean {\r\n    return this.dgnBoundaryType() === 2;\r\n  }\r\n  /**\r\n   * Type guard for Loop.\r\n   * * This is NOT a test for physical closure.\r\n   * @see [[CurveChain.isPhysicallyClosedCurve]]\r\n   */\r\n  public isLoop(): this is Loop {\r\n    return this.isClosedPath;\r\n  }\r\n\r\n  /** Return a CurveCollection with the same structure but all curves replaced by strokes. */\r\n  public abstract cloneStroked(options?: StrokeOptions): CurveCollection;\r\n  /** Support method for ICurvePrimitive ... one line call to specific announce method . . */\r\n  public abstract announceToCurveProcessor(processor: RecursiveCurveProcessor): void;\r\n  /** Clone an empty collection. */\r\n  public abstract cloneEmptyPeer(): CurveCollection;\r\n  /**\r\n   * Return the boundary type of a corresponding MicroStation CurveVector.\r\n   * * Derived class must implement.\r\n   */\r\n  public abstract dgnBoundaryType(): number;\r\n  /**\r\n   * Try to add a child.\r\n   * @param child child to add.\r\n   * @return true if child is an acceptable type for this collection.\r\n   */\r\n  public abstract tryAddChild(child: AnyCurve | undefined): boolean;\r\n  /** Return a child identified by by index */\r\n  public abstract getChild(i: number): AnyCurve | undefined;\r\n  /**\r\n   * Extend (increase) the given range as needed to encompass all curves in the curve collection.\r\n   * @param rangeToExtend the given range.\r\n   * @param transform if supplied, the range is extended with transformed curves.\r\n   */\r\n  public extendRange(rangeToExtend: Range3d, transform?: Transform): void {\r\n    const children = this.children;\r\n    if (children) {\r\n      for (const c of children) {\r\n        c.extendRange(rangeToExtend, transform);\r\n      }\r\n    }\r\n  }\r\n  /**\r\n   * Find any CurvePrimitive in the source and evaluate it at the given fraction.\r\n   * * The first CurvePrimitive found is evaluated. Any other CurvePrimitives are ignored.\r\n   * @param source containing `CurvePrimitive` or `CurveCollection`\r\n   * @param fraction fraction to use in `curve.fractionToPoint(fraction)`\r\n   */\r\n  public static createCurveLocationDetailOnAnyCurvePrimitive(\r\n    source: GeometryQuery | undefined, fraction: number = 0.5,\r\n  ): CurveLocationDetail | undefined {\r\n    if (!source)\r\n      return undefined;\r\n    if (source instanceof CurvePrimitive) {\r\n      return CurveLocationDetail.createCurveEvaluatedFraction(source, fraction);\r\n    } else if (source instanceof CurveCollection && source.children !== undefined)\r\n      for (const child of source.children) {\r\n        const detail = this.createCurveLocationDetailOnAnyCurvePrimitive(child, fraction);\r\n        if (detail)\r\n          return detail;\r\n      }\r\n    return undefined;\r\n  }\r\n  /**\r\n   * Project instance geometry (via dispatch) onto the given ray, and return the extreme fractional parameters\r\n   * of projection.\r\n   * @param ray ray onto which the instance is projected. A `Vector3d` is treated as a `Ray3d` with zero origin.\r\n   * @param lowHigh optional receiver for output\r\n   * @returns range of fractional projection parameters onto the ray, where 0.0 is start of the ray and 1.0 is the\r\n   * end of the ray.\r\n   */\r\n  public projectedParameterRange(ray: Vector3d | Ray3d, lowHigh?: Range1d): Range1d | undefined {\r\n    return PlaneAltitudeRangeContext.findExtremeFractionsAlongDirection(this, ray, lowHigh);\r\n  }\r\n  /** Return the immediate parent of the input curve in the instance, or undefined if it is not a descendant. */\r\n  public findParentOfDescendant(descendant: AnyCurve): CurveCollection | undefined {\r\n    for (const child of this.children) {\r\n      if (child === descendant)\r\n        return this;\r\n      if (child instanceof CurveCollection) {\r\n        const parent = child.findParentOfDescendant(descendant);\r\n        if (parent)\r\n          return parent;\r\n      }\r\n    }\r\n    return undefined;\r\n  };\r\n}\r\n\r\n/**\r\n * Shared base class for use by both open and closed paths.\r\n * * A `CurveChain` contains only CurvePrimitives. No other paths, loops, or regions allowed.\r\n * * The specific derived classes are `Path` and `Loop`.\r\n * * `CurveChain` is an intermediate class. It is not instantiable on its own.\r\n * * The related class `CurveChainWithDistanceIndex` is a `CurvePrimitive` whose API presents well-defined mappings\r\n * from fraction to xyz over the entire chain, but in fact does all the calculations over multiple primitives.\r\n * @see [Curve Collections]($docs/learning/geometry/CurveCollection.md) learning article.\r\n * @public\r\n */\r\nexport abstract class CurveChain extends CurveCollection {\r\n  /** The curve primitives in the chain. */\r\n  protected _curves: CurvePrimitive[];\r\n  /** Constructor */\r\n  protected constructor() {\r\n    super();\r\n    this._curves = [];\r\n  }\r\n  /** Return the array of `CurvePrimitive` */\r\n  public override get children(): CurvePrimitive[] {\r\n    return this._curves;\r\n  }\r\n  /** Return the start point of the curve chain (start point of the first child). */\r\n  public startPoint(result?: Point3d): Point3d | undefined {\r\n    const firstChild = this.getChild(0);\r\n    if (firstChild)\r\n      return firstChild.fractionToPoint(0.0, result);\r\n    else\r\n      return undefined;\r\n  }\r\n  /** Return the end point of the curve chain (end point of the last child). */\r\n  public endPoint(result?: Point3d): Point3d | undefined {\r\n    const lastChild = this.getChild(this._curves.length - 1);\r\n    if (lastChild)\r\n      return lastChild.fractionToPoint(1.0, result);\r\n    else\r\n      return undefined;\r\n  }\r\n  /**\r\n   * Whether the chain start and end points are defined and within tolerance.\r\n   * * Does not check for planarity or degeneracy.\r\n   * @param tolerance optional distance tolerance (default is [[Geometry.smallMetricDistance]])\r\n   * @param xyOnly if true, ignore z coordinate (default is `false`)\r\n   */\r\n  public isPhysicallyClosedCurve(tolerance: number = Geometry.smallMetricDistance, xyOnly: boolean = false): boolean {\r\n    const p0 = this.startPoint();\r\n    const p1 = this.endPoint();\r\n    return p0 !== undefined && p1 !== undefined && (xyOnly ? p0.isAlmostEqualXY(p1, tolerance) : p0.isAlmostEqual(p1, tolerance));\r\n  }\r\n  /**\r\n   * Return the start point and derivative of the first child of the curve chain.\r\n   * * For queries interior to the chain, use [[CurveChainWithDistanceIndex.fractionToPointAndDerivative]].\r\n   */\r\n  public startPointAndDerivative(result?: Ray3d): Ray3d | undefined {\r\n    const firstChild = this.getChild(0);\r\n    if (firstChild)\r\n      return firstChild.fractionToPointAndDerivative(0.0, result);\r\n    else\r\n      return undefined;\r\n  }\r\n  /**\r\n   * Return the end point and derivative of the last child of the curve chain.\r\n   * * For queries interior to the chain, use [[CurveChainWithDistanceIndex.fractionToPointAndDerivative]].\r\n   */\r\n  public endPointAndDerivative(result?: Ray3d): Ray3d | undefined {\r\n    const lastChild = this.getChild(this._curves.length - 1);\r\n    if (lastChild)\r\n      return lastChild.fractionToPointAndDerivative(1.0, result);\r\n    else\r\n      return undefined;\r\n  }\r\n  /**\r\n   * Return the curve primitive at the given `index`, optionally using `modulo` to map `index` to the cyclic indexing.\r\n   * * In particular, `-1` is the final curve.\r\n   * @param index cyclic index\r\n   * @param cyclic whether to employ modulo operator for wrap-around indexing. Default is `true`.\r\n   */\r\n  public cyclicCurvePrimitive(index: number, cyclic: boolean = true): CurvePrimitive | undefined {\r\n    const n = this.children.length;\r\n    if (n === 0)\r\n      return undefined;\r\n    if (index >= 0 && index < n) // try simplest non-cyclic access first\r\n      return this.children[index];\r\n    if (cyclic) {\r\n      const index2 = Geometry.modulo(index, n);\r\n      return this.children[index2];\r\n    }\r\n    return undefined;\r\n  }\r\n  /**\r\n   * Stroke the chain into a simple xyz array.\r\n   * @param options tolerance parameters controlling the stroking.\r\n   */\r\n  public getPackedStrokes(options?: StrokeOptions): GrowableXYZArray | undefined {\r\n    /**\r\n     * The object returned by \"cloneStroked\" has the same type (Loop or Path) but instead of a chain of\r\n     * CurvePrimitives as children, it has a single LineString3d child. \"getPackedStrokes\" just returns\r\n     * the points of that LineString3d using \"packedPoints\".\r\n     */\r\n    const tree = this.cloneStroked(options);\r\n    if (tree instanceof CurveChain) {\r\n      const children = tree.children;\r\n      if (children.length === 1) {\r\n        const ls = children[0];\r\n        if (ls instanceof LineString3d)\r\n          return ls.packedPoints;\r\n      }\r\n    }\r\n    return undefined;\r\n  }\r\n  /** Return a structural clone, with CurvePrimitive objects stroked. */\r\n  public abstract override cloneStroked(options?: StrokeOptions): CurveChain;\r\n  /**\r\n   * Add a child curve.\r\n   * @param child curve to add to the chain. The curve is captured by this instance.\r\n   * @return whether the child was added\r\n   */\r\n  public tryAddChild(child: AnyCurve | undefined): boolean {\r\n    if (child && child instanceof CurvePrimitive) {\r\n      this._curves.push(child);\r\n      return true;\r\n    }\r\n    return false;\r\n  }\r\n  /** Return a child by index */\r\n  public getChild(i: number): CurvePrimitive | undefined {\r\n    if (i < this._curves.length) return this._curves[i];\r\n    return undefined;\r\n  }\r\n  /** Invoke `curve.extendRange(range, transform)` for each child  */\r\n  public override extendRange(range: Range3d, transform?: Transform): void {\r\n    for (const curve of this._curves)\r\n      curve.extendRange(range, transform);\r\n  }\r\n  /**\r\n   * Reverse each child curve (in place).\r\n   * Reverse the order of the children array.\r\n   */\r\n  public reverseChildrenInPlace(): void {\r\n    for (const curve of this._curves)\r\n      curve.reverseInPlace();\r\n    this._curves.reverse();\r\n  }\r\n  /** Same as [[reverseChildrenInPlace]]. */\r\n  public override reverseInPlace(): void {\r\n    this.reverseChildrenInPlace();\r\n  }\r\n  /**\r\n   * Return the index where target is found in the array of children.\r\n   * @param alsoSearchProxies whether to also check proxy curves of the children\r\n   */\r\n  public childIndex(target: CurvePrimitive | undefined, alsoSearchProxies?: boolean): number | undefined {\r\n    for (let i = 0; i < this._curves.length; i++) {\r\n      if (this._curves[i] === target)\r\n        return i;\r\n    }\r\n    if (alsoSearchProxies ?? false) {\r\n      for (let i = 0; i < this._curves.length; i++) {\r\n        const childCurve = this._curves[i];\r\n        if (childCurve instanceof ProxyCurve) {\r\n          if (childCurve.proxyCurve === target)\r\n            return i;\r\n        }\r\n      }\r\n    }\r\n    return undefined;\r\n  }\r\n  /** Evaluate an indexed curve at a fraction. Return as a CurveLocationDetail that indicates the primitive. */\r\n  public primitiveIndexAndFractionToCurveLocationDetailPointAndDerivative(\r\n    index: number, fraction: number, cyclic: boolean = false, result?: CurveLocationDetail,\r\n  ): CurveLocationDetail | undefined {\r\n    const primitive = this.cyclicCurvePrimitive(index, cyclic);\r\n    if (primitive) {\r\n      return CurveLocationDetail.createCurveEvaluatedFractionPointAndDerivative(primitive, fraction, result);\r\n    }\r\n    return undefined;\r\n  }\r\n}\r\n\r\n/**\r\n * * A `BagOfCurves` object is a collection of `AnyCurve` objects.\r\n * * A `BagOfCurves` has no implied properties such as being planar.\r\n * @public\r\n */\r\nexport class BagOfCurves extends CurveCollection {\r\n  /** String name for schema properties */\r\n  public readonly curveCollectionType = \"bagOfCurves\";\r\n  /** Test if `other` is an instance of `BagOfCurves` */\r\n  public isSameGeometryClass(other: GeometryQuery): boolean {\r\n    return other instanceof BagOfCurves;\r\n  }\r\n  /**\r\n   * Array of children.\r\n   * * No restrictions on type.\r\n   */\r\n  protected _children: AnyCurve[];\r\n  /** Construct an empty `BagOfCurves` */\r\n  public constructor() {\r\n    super();\r\n    this._children = [];\r\n  }\r\n  /** Return the (reference to) array of children */\r\n  public override get children(): AnyCurve[] {\r\n    return this._children;\r\n  }\r\n  /** Create with given curves. */\r\n  public static create(...data: AnyCurve[]): BagOfCurves {\r\n    const result = new BagOfCurves();\r\n    for (const child of data) {\r\n      result.tryAddChild(child);\r\n    }\r\n    return result;\r\n  }\r\n  /** Return the boundary type (0) of a corresponding  MicroStation CurveVector */\r\n  public dgnBoundaryType(): number {\r\n    return 0;\r\n  }\r\n  /** Invoke `processor.announceBagOfCurves(this, indexInParent);` */\r\n  public announceToCurveProcessor(processor: RecursiveCurveProcessor, indexInParent: number = -1): void {\r\n    return processor.announceBagOfCurves(this, indexInParent);\r\n  }\r\n  /** Clone all children in stroked form. */\r\n  public cloneStroked(options?: StrokeOptions): BagOfCurves {\r\n    const clone = new BagOfCurves();\r\n    let child;\r\n    for (child of this.children) {\r\n      if (child instanceof CurvePrimitive) {\r\n        const ls = LineString3d.create();\r\n        child.emitStrokes(ls, options);\r\n        if (ls)\r\n          clone.children.push(ls);\r\n      } else if (child instanceof CurveCollection) {\r\n        const childStrokes = child.cloneStroked(options);\r\n        if (childStrokes)\r\n          clone.children.push(childStrokes);\r\n      }\r\n    }\r\n    return clone;\r\n  }\r\n  /** Return an empty `BagOfCurves` */\r\n  public cloneEmptyPeer(): BagOfCurves {\r\n    return new BagOfCurves();\r\n  }\r\n  /** Add a child  */\r\n  public tryAddChild(child: AnyCurve | undefined): boolean {\r\n    if (child)\r\n      this._children.push(child);\r\n    return true;\r\n  }\r\n  /** Get a child by index */\r\n  public getChild(i: number): AnyCurve | undefined {\r\n    if (i < this._children.length)\r\n      return this._children[i];\r\n    return undefined;\r\n  }\r\n  /** Second step of double dispatch:  call `handler.handleBagOfCurves(this)` */\r\n  public dispatchToGeometryHandler(handler: GeometryHandler): any {\r\n    return handler.handleBagOfCurves(this);\r\n  }\r\n}\r\n"]}

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

@@ -1 +1 @@
-{"version":3,"file":"CurveCurve.js","sourceRoot":"","sources":["../../../src/curve/CurveCurve.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH,0CAAuC;AAKvC,4FAAyF;AACzF,oFAAiF;AACjF,sFAAmF;AA6BnF;;;GAGG;AACH,MAAa,UAAU;IACrB;;;;;;;;OAQG;IACI,MAAM,CAAC,mBAAmB,CAC/B,MAAgB,EAChB,OAAgB,EAChB,MAAgB,EAChB,OAAgB,EAChB,YAAoB,mBAAQ,CAAC,mBAAmB;QAEhD,OAAO,UAAU,CAAC,4BAA4B,CAAC,SAAS,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,SAAS,CAAC,CAAC;IACzG,CAAC;IACD;;;;;;;;;OASG;IACI,MAAM,CAAC,4BAA4B,CACxC,YAAkC,EAClC,MAAgB,EAChB,OAAgB,EAChB,MAAgB,EAChB,OAAgB,EAChB,YAAoB,mBAAQ,CAAC,mBAAmB;QAEhD,MAAM,OAAO,GAAG,IAAI,6CAAqB,CAAC,YAAY,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,SAAS,CAAC,CAAC;QAC7F,MAAM,CAAC,yBAAyB,CAAC,OAAO,CAAC,CAAC;QAC1C,OAAO,OAAO,CAAC,iBAAiB,EAAE,CAAC;IACrC,CAAC;IACD;;;;;;;;;OASG;IACI,MAAM,CAAC,oBAAoB,CAChC,MAAgB,EAAE,OAAgB,EAAE,MAAgB,EAAE,OAAgB;QAEtE,MAAM,OAAO,GAAG,IAAI,+CAAsB,CAAC,OAAO,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;QACrE,MAAM,CAAC,yBAAyB,CAAC,OAAO,CAAC,CAAC;QAC1C,OAAO,OAAO,CAAC,iBAAiB,EAAE,CAAC;IACrC,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,iCAAiC,CAC7C,UAA4B,EAAE,YAAoB,mBAAQ,CAAC,mBAAmB;QAE9E,MAAM,OAAO,GAAG,IAAI,6CAAqB,CAAC,SAAS,EAAE,KAAK,EAAE,SAAS,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;QACzF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,MAAM,MAAM,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;YAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC/C,OAAO,CAAC,cAAc,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;gBACtC,MAAM,CAAC,yBAAyB,CAAC,OAAO,CAAC,CAAC;YAC5C,CAAC;QACH,CAAC;QACD,OAAO,OAAO,CAAC,iBAAiB,EAAE,CAAC;IACrC,CAAC;IACD;;;;;;;;;;;;;;OAcG;IACI,MAAM,CAAC,6BAA6B,CACzC,MAAgB,EAAE,MAAgB,EAAE,uBAAmD,mBAAQ,CAAC,qBAAqB;QAErH,MAAM,cAAc,GAAG,mBAAQ,CAAC,QAAQ,CAAC,oBAAoB,CAAC,CAAC;QAC/D,MAAM,WAAW,GAAG,cAAc,CAAC,CAAC,CAAC,oBAAoB,CAAC,CAAC,CAAC,oBAAoB,CAAC,WAAW,IAAI,mBAAQ,CAAC,qBAAqB,CAAC;QAC/H,MAAM,WAAW,GAAG,cAAc,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,oBAAoB,CAAC,WAAW,CAAC;QAClF,MAAM,eAAe,GAAG,cAAc,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,oBAAoB,CAAC,eAAe,CAAC;QAC1F,MAAM,aAAa,GAAG,cAAc,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,oBAAoB,CAAC,aAAa,CAAC;QACtF,MAAM,OAAO,GAAG,IAAI,qDAAyB,CAAC,MAAM,EAAE,WAAW,EAAE,eAAe,EAAE,aAAa,CAAC,CAAC;QACnG,OAAO,CAAC,mBAAmB,GAAG,WAAW,CAAC;QAC1C,MAAM,CAAC,yBAAyB,CAAC,OAAO,CAAC,CAAC;QAC1C,OAAO,OAAO,CAAC,iBAAiB,EAAE,CAAC;IACrC,CAAC;IACD;;;;;;;;;;;;OAYG;IACI,MAAM,CAAC,8BAA8B,CAC1C,MAAgB,EAAE,MAAgB,EAAE,OAA2B;QAE/D,IAAI,OAAO,KAAK,SAAS;YACvB,OAAO,GAAG,EAAE,WAAW,EAAE,mBAAQ,CAAC,qBAAqB,EAAE,CAAC;QAC5D,MAAM,eAAe,GAAG,IAAI,CAAC,6BAA6B,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;QACpF,IAAI,CAAC,eAAe,CAAC,MAAM;YACzB,OAAO,SAAS,CAAC;QACnB,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,IAAI,SAAS,GAAG,mBAAQ,CAAC,qBAAqB,CAAC;QAC/C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE,CAAC;YAChD,MAAM,MAAM,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;YAC5C,IAAI,MAAM,GAAG,SAAS,EAAE,CAAC;gBACvB,IAAI,GAAG,CAAC,CAAC;gBACT,SAAS,GAAG,MAAM,CAAC;YACrB,CAAC;QACH,CAAC;QACD,OAAO,eAAe,CAAC,IAAI,CAAC,CAAC;IAC/B,CAAC;CACF;AAxID,gCAwIC","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n/** @packageDocumentation\n * @module Curve\n */\n\nimport { Geometry } from \"../Geometry\";\nimport { Matrix4d } from \"../geometry4d/Matrix4d\";\nimport { CurveLocationDetailPair } from \"./CurveLocationDetail\";\nimport { CurvePrimitive } from \"./CurvePrimitive\";\nimport { AnyCurve } from \"./CurveTypes\";\nimport { CurveCurveCloseApproachXY } from \"./internalContexts/CurveCurveCloseApproachXY\";\nimport { CurveCurveIntersectXY } from \"./internalContexts/CurveCurveIntersectXY\";\nimport { CurveCurveIntersectXYZ } from \"./internalContexts/CurveCurveIntersectXYZ\";\n\n/**\n * Options used for method [[CurveCurve.closeApproachProjectedXYPairs]] and [[CurveCurve.closestApproachProjectedXYPair]].\n * @public\n */\nexport interface CurveCurveOptions {\n  /**\n   * Maximum xy approach distance to be returned.\n   * Default: {@link Geometry.largeCoordinateResult}.\n   */\n  maxDistance?: number;\n  /**\n   * Tolerance for comparing xy points.\n   * Default: {@link Geometry.smallMetricDistance}.\n   */\n  xyTolerance?: number;\n  /**\n   * Newton convergence tolerance, in parametric space.\n   * Default: {@link Geometry.smallNewtonStep}.\n   */\n  newtonTolerance?: number;\n  /**\n   * Maximum number of iterations for the Newton method.\n   * Default: 50.\n   */\n  maxIterations?: number;\n}\n\n/**\n * `CurveCurve` has static method for various computations that work on a pair of curves or curve collections.\n * @public\n */\nexport class CurveCurve {\n  /**\n   * Return xy intersections of 2 curves.\n   * * Curves can be extended if extend flags are set. B-splines are not extended even if the flag is set.\n   * @param curveA first curve\n   * @param extendA true to allow curveA to extend\n   * @param curveB second curve\n   * @param extendB true to allow curveB to extend\n   * @param tolerance optional distance tolerance for coincidence\n   */\n  public static intersectionXYPairs(\n    curveA: AnyCurve,\n    extendA: boolean,\n    curveB: AnyCurve,\n    extendB: boolean,\n    tolerance: number = Geometry.smallMetricDistance,\n  ): CurveLocationDetailPair[] {\n    return CurveCurve.intersectionProjectedXYPairs(undefined, curveA, extendA, curveB, extendB, tolerance);\n  }\n  /**\n   * Return xy intersections of 2 projected curves.\n   * * Curves can be extended if extend flags are set. B-splines are not extended even if the flag is set.\n   * @param worldToLocal transform (possibly perspective) defining the local coordinates in which to compute xy intersections\n   * @param curveA first curve\n   * @param extendA true to allow curveA to extend\n   * @param curveB second curve\n   * @param extendB true to allow curveB to extend\n   * @param tolerance optional distance tolerance for coincidence\n   */\n  public static intersectionProjectedXYPairs(\n    worldToLocal: Matrix4d | undefined,\n    curveA: AnyCurve,\n    extendA: boolean,\n    curveB: AnyCurve,\n    extendB: boolean,\n    tolerance: number = Geometry.smallMetricDistance,\n  ): CurveLocationDetailPair[] {\n    const handler = new CurveCurveIntersectXY(worldToLocal, extendA, curveB, extendB, tolerance);\n    curveA.dispatchToGeometryHandler(handler);\n    return handler.grabPairedResults();\n  }\n  /**\n   * Return full 3d xyz intersections of 2 curves.\n   *  * Implemented for combinations of LineSegment3d, LineString3d, Arc3d.\n   *  * Not Implemented for bspline and bezier curves.\n   * @param curveA first curve\n   * @param extendA true to allow curveA to extend\n   * @param curveB second curve\n   * @param extendB true to allow curveB to extend\n   * @returns array of intersections structured as CurveLocationDetailPair[]\n   */\n  public static intersectionXYZPairs(\n    curveA: AnyCurve, extendA: boolean, curveB: AnyCurve, extendB: boolean,\n  ): CurveLocationDetailPair[] {\n    const handler = new CurveCurveIntersectXYZ(extendA, curveB, extendB);\n    curveA.dispatchToGeometryHandler(handler);\n    return handler.grabPairedResults();\n  }\n  /**\n   * Return xy intersections of input curves.\n   * @param primitives input curves to intersect\n   * @param tolerance optional distance tolerance for coincidence\n   */\n  public static allIntersectionsAmongPrimitivesXY(\n    primitives: CurvePrimitive[], tolerance: number = Geometry.smallMetricDistance,\n  ): CurveLocationDetailPair[] {\n    const handler = new CurveCurveIntersectXY(undefined, false, undefined, false, tolerance);\n    for (let i = 0; i < primitives.length; i++) {\n      const curveA = primitives[i];\n      for (let j = i + 1; j < primitives.length; j++) {\n        handler.resetGeometryB(primitives[j]);\n        curveA.dispatchToGeometryHandler(handler);\n      }\n    }\n    return handler.grabPairedResults();\n  }\n  /**\n   * Return at least one XY close approach between 2 curves.\n   * * Close approach xy-distances are measured without regard to z. This is equivalent to their separation distance\n   * as seen in the top view, or as measured between their projections onto the xy-plane.\n   * * If more than one approach is returned, one of them is the closest approach.\n   * * If an input curve is a `CurveCollection`, then close approaches are computed to each `CurvePrimitive` child.\n   * This can lead to many returned pairs, especially when both inputs are `CurveCollection`s. If an input curve is\n   * an `AnyRegion`, then close approaches are computed only to the defining curves, not to the area they enclose.\n   * @param curveA first curve\n   * @param curveB second curve\n   * @param maxDistanceOrOptions maximum xy-distance to consider between the curves, or a list of extended options.\n   * Close approaches further than this xy-distance are not returned.\n   * @return array of detail pairs of close xy-approaches. XY-length of the returned close approach is set in `detailA.a`\n   * and `detailB.a`.\n   */\n  public static closeApproachProjectedXYPairs(\n    curveA: AnyCurve, curveB: AnyCurve, maxDistanceOrOptions: number | CurveCurveOptions = Geometry.largeCoordinateResult,\n  ): CurveLocationDetailPair[] {\n    const optionIsNumber = Geometry.isNumber(maxDistanceOrOptions);\n    const maxDistance = optionIsNumber ? maxDistanceOrOptions : maxDistanceOrOptions.maxDistance ?? Geometry.largeCoordinateResult;\n    const xyTolerance = optionIsNumber ? undefined : maxDistanceOrOptions.xyTolerance;\n    const newtonTolerance = optionIsNumber ? undefined : maxDistanceOrOptions.newtonTolerance;\n    const maxIterations = optionIsNumber ? undefined : maxDistanceOrOptions.maxIterations;\n    const handler = new CurveCurveCloseApproachXY(curveB, xyTolerance, newtonTolerance, maxIterations);\n    handler.maxDistanceToAccept = maxDistance;\n    curveA.dispatchToGeometryHandler(handler);\n    return handler.grabPairedResults();\n  }\n  /**\n   * Convenience method that calls [[closeApproachProjectedXYPairs]] with a large `maxDistance`\n   * and returns a detail pair representing the closest xy-approach between the curves.\n   * * There may be many detail pairs that represent \"closest\" xy-approach, including coincident interval pairs,\n   * isolated intersections, or close approaches within tolerance of each other. This method makes no attempt to\n   * distinguish among them, and returns a pair whose `detail.point` values are separated by the smallest xy distance\n   * found among the pairs.\n   * @param curveA first curve\n   * @param curveB second curve\n   * @param options optional parameters for close approach calculation\n   * @return detail pair of closest xy-approach, undefined if not found. XY-length of the returned close approach is\n   * set in `detailA.a` and `detailB.a`.\n   */\n  public static closestApproachProjectedXYPair(\n    curveA: AnyCurve, curveB: AnyCurve, options?: CurveCurveOptions\n  ): CurveLocationDetailPair | undefined {\n    if (options === undefined)\n      options = { maxDistance: Geometry.largeCoordinateResult };\n    const closeApproaches = this.closeApproachProjectedXYPairs(curveA, curveB, options);\n    if (!closeApproaches.length)\n      return undefined;\n    let iMin = 0;\n    let minDistXY = Geometry.largeCoordinateResult;\n    for (let i = 0; i < closeApproaches.length; ++i) {\n      const distXY = closeApproaches[i].detailA.a;\n      if (distXY < minDistXY) {\n        iMin = i;\n        minDistXY = distXY;\n      }\n    }\n    return closeApproaches[iMin];\n  }\n}\n"]}
+{"version":3,"file":"CurveCurve.js","sourceRoot":"","sources":["../../../src/curve/CurveCurve.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH,0CAAuC;AAKvC,4FAAyF;AACzF,oFAAiF;AACjF,sFAAmF;AA6BnF;;;GAGG;AACH,MAAa,UAAU;IACrB;;;;;;;;OAQG;IACI,MAAM,CAAC,mBAAmB,CAC/B,MAAgB,EAChB,OAAgB,EAChB,MAAgB,EAChB,OAAgB,EAChB,YAAoB,mBAAQ,CAAC,mBAAmB;QAEhD,OAAO,UAAU,CAAC,4BAA4B,CAAC,SAAS,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,SAAS,CAAC,CAAC;IACzG,CAAC;IACD;;;;;;;;;OASG;IACI,MAAM,CAAC,4BAA4B,CACxC,YAAkC,EAClC,MAAgB,EAChB,OAAgB,EAChB,MAAgB,EAChB,OAAgB,EAChB,YAAoB,mBAAQ,CAAC,mBAAmB;QAEhD,MAAM,OAAO,GAAG,IAAI,6CAAqB,CAAC,YAAY,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,SAAS,CAAC,CAAC;QAC7F,MAAM,CAAC,yBAAyB,CAAC,OAAO,CAAC,CAAC;QAC1C,OAAO,OAAO,CAAC,iBAAiB,EAAE,CAAC;IACrC,CAAC;IACD;;;;;;;;;OASG;IACI,MAAM,CAAC,oBAAoB,CAChC,MAAgB,EAAE,OAAgB,EAAE,MAAgB,EAAE,OAAgB;QAEtE,MAAM,OAAO,GAAG,IAAI,+CAAsB,CAAC,OAAO,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;QACrE,MAAM,CAAC,yBAAyB,CAAC,OAAO,CAAC,CAAC;QAC1C,OAAO,OAAO,CAAC,iBAAiB,EAAE,CAAC;IACrC,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,iCAAiC,CAC7C,UAA4B,EAAE,YAAoB,mBAAQ,CAAC,mBAAmB;QAE9E,MAAM,OAAO,GAAG,IAAI,6CAAqB,CAAC,SAAS,EAAE,KAAK,EAAE,SAAS,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;QACzF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,MAAM,MAAM,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;YAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC/C,OAAO,CAAC,cAAc,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;gBACtC,MAAM,CAAC,yBAAyB,CAAC,OAAO,CAAC,CAAC;YAC5C,CAAC;QACH,CAAC;QACD,OAAO,OAAO,CAAC,iBAAiB,EAAE,CAAC;IACrC,CAAC;IACD;;;;;;;;;;;;;;OAcG;IACI,MAAM,CAAC,6BAA6B,CACzC,MAAgB,EAAE,MAAgB,EAAE,uBAAmD,mBAAQ,CAAC,qBAAqB;QAErH,MAAM,cAAc,GAAG,mBAAQ,CAAC,QAAQ,CAAC,oBAAoB,CAAC,CAAC;QAC/D,MAAM,WAAW,GAAG,cAAc,CAAC,CAAC,CAAC,oBAAoB,CAAC,CAAC,CAAC,oBAAoB,CAAC,WAAW,IAAI,mBAAQ,CAAC,qBAAqB,CAAC;QAC/H,MAAM,WAAW,GAAG,cAAc,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,oBAAoB,CAAC,WAAW,CAAC;QAClF,MAAM,eAAe,GAAG,cAAc,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,oBAAoB,CAAC,eAAe,CAAC;QAC1F,MAAM,aAAa,GAAG,cAAc,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,oBAAoB,CAAC,aAAa,CAAC;QACtF,MAAM,OAAO,GAAG,IAAI,qDAAyB,CAAC,MAAM,EAAE,WAAW,EAAE,eAAe,EAAE,aAAa,CAAC,CAAC;QACnG,OAAO,CAAC,mBAAmB,GAAG,WAAW,CAAC;QAC1C,MAAM,CAAC,yBAAyB,CAAC,OAAO,CAAC,CAAC;QAC1C,OAAO,OAAO,CAAC,iBAAiB,EAAE,CAAC;IACrC,CAAC;IACD;;;;;;;;;;;;OAYG;IACI,MAAM,CAAC,8BAA8B,CAC1C,MAAgB,EAAE,MAAgB,EAAE,OAA2B;QAE/D,IAAI,OAAO,KAAK,SAAS;YACvB,OAAO,GAAG,EAAE,WAAW,EAAE,mBAAQ,CAAC,qBAAqB,EAAE,CAAC;QAC5D,MAAM,eAAe,GAAG,IAAI,CAAC,6BAA6B,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;QACpF,IAAI,CAAC,eAAe,CAAC,MAAM;YACzB,OAAO,SAAS,CAAC;QACnB,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,IAAI,SAAS,GAAG,mBAAQ,CAAC,qBAAqB,CAAC;QAC/C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE,CAAC;YAChD,MAAM,MAAM,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;YAC5C,IAAI,MAAM,GAAG,SAAS,EAAE,CAAC;gBACvB,IAAI,GAAG,CAAC,CAAC;gBACT,SAAS,GAAG,MAAM,CAAC;YACrB,CAAC;QACH,CAAC;QACD,OAAO,eAAe,CAAC,IAAI,CAAC,CAAC;IAC/B,CAAC;CACF;AAxID,gCAwIC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n/** @packageDocumentation\r\n * @module Curve\r\n */\r\n\r\nimport { Geometry } from \"../Geometry\";\r\nimport { Matrix4d } from \"../geometry4d/Matrix4d\";\r\nimport { CurveLocationDetailPair } from \"./CurveLocationDetail\";\r\nimport { CurvePrimitive } from \"./CurvePrimitive\";\r\nimport { AnyCurve } from \"./CurveTypes\";\r\nimport { CurveCurveCloseApproachXY } from \"./internalContexts/CurveCurveCloseApproachXY\";\r\nimport { CurveCurveIntersectXY } from \"./internalContexts/CurveCurveIntersectXY\";\r\nimport { CurveCurveIntersectXYZ } from \"./internalContexts/CurveCurveIntersectXYZ\";\r\n\r\n/**\r\n * Options used for method [[CurveCurve.closeApproachProjectedXYPairs]] and [[CurveCurve.closestApproachProjectedXYPair]].\r\n * @public\r\n */\r\nexport interface CurveCurveOptions {\r\n  /**\r\n   * Maximum xy approach distance to be returned.\r\n   * Default: {@link Geometry.largeCoordinateResult}.\r\n   */\r\n  maxDistance?: number;\r\n  /**\r\n   * Tolerance for comparing xy points.\r\n   * Default: {@link Geometry.smallMetricDistance}.\r\n   */\r\n  xyTolerance?: number;\r\n  /**\r\n   * Newton convergence tolerance, in parametric space.\r\n   * Default: {@link Geometry.smallNewtonStep}.\r\n   */\r\n  newtonTolerance?: number;\r\n  /**\r\n   * Maximum number of iterations for the Newton method.\r\n   * Default: 50.\r\n   */\r\n  maxIterations?: number;\r\n}\r\n\r\n/**\r\n * `CurveCurve` has static method for various computations that work on a pair of curves or curve collections.\r\n * @public\r\n */\r\nexport class CurveCurve {\r\n  /**\r\n   * Return xy intersections of 2 curves.\r\n   * * Curves can be extended if extend flags are set. B-splines are not extended even if the flag is set.\r\n   * @param curveA first curve\r\n   * @param extendA true to allow curveA to extend\r\n   * @param curveB second curve\r\n   * @param extendB true to allow curveB to extend\r\n   * @param tolerance optional distance tolerance for coincidence\r\n   */\r\n  public static intersectionXYPairs(\r\n    curveA: AnyCurve,\r\n    extendA: boolean,\r\n    curveB: AnyCurve,\r\n    extendB: boolean,\r\n    tolerance: number = Geometry.smallMetricDistance,\r\n  ): CurveLocationDetailPair[] {\r\n    return CurveCurve.intersectionProjectedXYPairs(undefined, curveA, extendA, curveB, extendB, tolerance);\r\n  }\r\n  /**\r\n   * Return xy intersections of 2 projected curves.\r\n   * * Curves can be extended if extend flags are set. B-splines are not extended even if the flag is set.\r\n   * @param worldToLocal transform (possibly perspective) defining the local coordinates in which to compute xy intersections\r\n   * @param curveA first curve\r\n   * @param extendA true to allow curveA to extend\r\n   * @param curveB second curve\r\n   * @param extendB true to allow curveB to extend\r\n   * @param tolerance optional distance tolerance for coincidence\r\n   */\r\n  public static intersectionProjectedXYPairs(\r\n    worldToLocal: Matrix4d | undefined,\r\n    curveA: AnyCurve,\r\n    extendA: boolean,\r\n    curveB: AnyCurve,\r\n    extendB: boolean,\r\n    tolerance: number = Geometry.smallMetricDistance,\r\n  ): CurveLocationDetailPair[] {\r\n    const handler = new CurveCurveIntersectXY(worldToLocal, extendA, curveB, extendB, tolerance);\r\n    curveA.dispatchToGeometryHandler(handler);\r\n    return handler.grabPairedResults();\r\n  }\r\n  /**\r\n   * Return full 3d xyz intersections of 2 curves.\r\n   *  * Implemented for combinations of LineSegment3d, LineString3d, Arc3d.\r\n   *  * Not Implemented for bspline and bezier curves.\r\n   * @param curveA first curve\r\n   * @param extendA true to allow curveA to extend\r\n   * @param curveB second curve\r\n   * @param extendB true to allow curveB to extend\r\n   * @returns array of intersections structured as CurveLocationDetailPair[]\r\n   */\r\n  public static intersectionXYZPairs(\r\n    curveA: AnyCurve, extendA: boolean, curveB: AnyCurve, extendB: boolean,\r\n  ): CurveLocationDetailPair[] {\r\n    const handler = new CurveCurveIntersectXYZ(extendA, curveB, extendB);\r\n    curveA.dispatchToGeometryHandler(handler);\r\n    return handler.grabPairedResults();\r\n  }\r\n  /**\r\n   * Return xy intersections of input curves.\r\n   * @param primitives input curves to intersect\r\n   * @param tolerance optional distance tolerance for coincidence\r\n   */\r\n  public static allIntersectionsAmongPrimitivesXY(\r\n    primitives: CurvePrimitive[], tolerance: number = Geometry.smallMetricDistance,\r\n  ): CurveLocationDetailPair[] {\r\n    const handler = new CurveCurveIntersectXY(undefined, false, undefined, false, tolerance);\r\n    for (let i = 0; i < primitives.length; i++) {\r\n      const curveA = primitives[i];\r\n      for (let j = i + 1; j < primitives.length; j++) {\r\n        handler.resetGeometryB(primitives[j]);\r\n        curveA.dispatchToGeometryHandler(handler);\r\n      }\r\n    }\r\n    return handler.grabPairedResults();\r\n  }\r\n  /**\r\n   * Return at least one XY close approach between 2 curves.\r\n   * * Close approach xy-distances are measured without regard to z. This is equivalent to their separation distance\r\n   * as seen in the top view, or as measured between their projections onto the xy-plane.\r\n   * * If more than one approach is returned, one of them is the closest approach.\r\n   * * If an input curve is a `CurveCollection`, then close approaches are computed to each `CurvePrimitive` child.\r\n   * This can lead to many returned pairs, especially when both inputs are `CurveCollection`s. If an input curve is\r\n   * an `AnyRegion`, then close approaches are computed only to the defining curves, not to the area they enclose.\r\n   * @param curveA first curve\r\n   * @param curveB second curve\r\n   * @param maxDistanceOrOptions maximum xy-distance to consider between the curves, or a list of extended options.\r\n   * Close approaches further than this xy-distance are not returned.\r\n   * @return array of detail pairs of close xy-approaches. XY-length of the returned close approach is set in `detailA.a`\r\n   * and `detailB.a`.\r\n   */\r\n  public static closeApproachProjectedXYPairs(\r\n    curveA: AnyCurve, curveB: AnyCurve, maxDistanceOrOptions: number | CurveCurveOptions = Geometry.largeCoordinateResult,\r\n  ): CurveLocationDetailPair[] {\r\n    const optionIsNumber = Geometry.isNumber(maxDistanceOrOptions);\r\n    const maxDistance = optionIsNumber ? maxDistanceOrOptions : maxDistanceOrOptions.maxDistance ?? Geometry.largeCoordinateResult;\r\n    const xyTolerance = optionIsNumber ? undefined : maxDistanceOrOptions.xyTolerance;\r\n    const newtonTolerance = optionIsNumber ? undefined : maxDistanceOrOptions.newtonTolerance;\r\n    const maxIterations = optionIsNumber ? undefined : maxDistanceOrOptions.maxIterations;\r\n    const handler = new CurveCurveCloseApproachXY(curveB, xyTolerance, newtonTolerance, maxIterations);\r\n    handler.maxDistanceToAccept = maxDistance;\r\n    curveA.dispatchToGeometryHandler(handler);\r\n    return handler.grabPairedResults();\r\n  }\r\n  /**\r\n   * Convenience method that calls [[closeApproachProjectedXYPairs]] with a large `maxDistance`\r\n   * and returns a detail pair representing the closest xy-approach between the curves.\r\n   * * There may be many detail pairs that represent \"closest\" xy-approach, including coincident interval pairs,\r\n   * isolated intersections, or close approaches within tolerance of each other. This method makes no attempt to\r\n   * distinguish among them, and returns a pair whose `detail.point` values are separated by the smallest xy distance\r\n   * found among the pairs.\r\n   * @param curveA first curve\r\n   * @param curveB second curve\r\n   * @param options optional parameters for close approach calculation\r\n   * @return detail pair of closest xy-approach, undefined if not found. XY-length of the returned close approach is\r\n   * set in `detailA.a` and `detailB.a`.\r\n   */\r\n  public static closestApproachProjectedXYPair(\r\n    curveA: AnyCurve, curveB: AnyCurve, options?: CurveCurveOptions\r\n  ): CurveLocationDetailPair | undefined {\r\n    if (options === undefined)\r\n      options = { maxDistance: Geometry.largeCoordinateResult };\r\n    const closeApproaches = this.closeApproachProjectedXYPairs(curveA, curveB, options);\r\n    if (!closeApproaches.length)\r\n      return undefined;\r\n    let iMin = 0;\r\n    let minDistXY = Geometry.largeCoordinateResult;\r\n    for (let i = 0; i < closeApproaches.length; ++i) {\r\n      const distXY = closeApproaches[i].detailA.a;\r\n      if (distXY < minDistXY) {\r\n        iMin = i;\r\n        minDistXY = distXY;\r\n      }\r\n    }\r\n    return closeApproaches[iMin];\r\n  }\r\n}\r\n"]}

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

@@ -1 +1 @@
-{"version":3,"file":"CurveExtendMode.js","sourceRoot":"","sources":["../../../src/curve/CurveExtendMode.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH,0CAAuC;AAGvC;;;;GAIG;AACH,IAAY,eAOX;AAPD,WAAY,eAAe;IACzB,4BAA4B;IAC5B,qDAAQ,CAAA;IACR,qEAAqE;IACrE,+DAAa,CAAA;IACb,8CAA8C;IAC9C,2DAAW,CAAA;AACb,CAAC,EAPW,eAAe,+BAAf,eAAe,QAO1B;AACD;;;GAGG;AACH,MAAa,kBAAkB;IAC7B;;;;;;OAMG;IACI,MAAM,CAAC,mDAAmD,CAC/D,KAA8C,EAAE,QAAe;QAE/D,KAAK,KAAK,KAAK,CAAC;QAChB,IAAI,KAAK,KAAK,KAAK;YACjB,OAAO,eAAe,CAAC,IAAI,CAAC;QAC9B,IAAI,KAAK,KAAK,IAAI;YAChB,OAAO,eAAe,CAAC,OAAO,CAAC;QACjC,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;YACtB,OAAO,KAAK,CAAC,MAAM,GAAG,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,IAAI,CAAC;QAC1E,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,eAAe,CAAC,WAAoD,EAAE,QAAgB;QAClG,WAAW,KAAK,KAAK,CAAC;QACtB,IAAI,QAAQ,GAAG,CAAC,EAAE,CAAC;YACjB,MAAM,IAAI,GAAG,kBAAkB,CAAC,mDAAmD,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;YACpG,IAAI,IAAI,KAAK,eAAe,CAAC,IAAI;gBAC/B,QAAQ,GAAG,GAAG,CAAC;QACnB,CAAC;aAAM,IAAI,QAAQ,GAAG,GAAG,EAAE,CAAC;YAC1B,MAAM,IAAI,GAAG,kBAAkB,CAAC,mDAAmD,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;YACpG,IAAI,IAAI,KAAK,eAAe,CAAC,IAAI;gBAC/B,QAAQ,GAAG,GAAG,CAAC;QACnB,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IACD;;;;;;;;;OASG;IACI,MAAM,CAAC,kCAAkC,CAC9C,WAAoD,EAAE,OAAe,EAAE,KAAiB;QAExF,WAAW,KAAK,KAAK,CAAC;QACtB,IAAI,QAAQ,GAAG,KAAK,CAAC,+BAA+B,CAAC,OAAO,CAAC,CAAC;QAC9D,IAAI,OAAO,GAAG,IAAI,CAAC;QACnB,IAAI,CAAC,KAAK,CAAC,gBAAgB,CAAC,OAAO,CAAC,EAAE,CAAC;YACrC,MAAM,cAAc,GAAG,KAAK,CAAC,cAAc,EAAE,CAAC;YAC9C,MAAM,KAAK,GAAG,kBAAkB,CAAC,mDAAmD,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;YACrG,MAAM,KAAK,GAAG,kBAAkB,CAAC,mDAAmD,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;YACrG,IAAI,KAAK,KAAK,eAAe,CAAC,IAAI,EAAE,CAAC;gBACnC,IAAI,KAAK,KAAK,eAAe,CAAC,IAAI,EAAE,CAAC,CAAC,0BAA0B;oBAC9D,IAAI,QAAQ,GAAG,GAAG;wBAChB,QAAQ,IAAI,cAAc,CAAC;gBAC/B,CAAC;YACH,CAAC;iBAAM,IAAI,KAAK,KAAK,eAAe,CAAC,IAAI,EAAE,CAAC,CAAC,0BAA0B;gBACrE,IAAI,QAAQ,GAAG,GAAG;oBAChB,QAAQ,IAAI,cAAc,CAAC;YAC/B,CAAC;iBAAM,CAAC,CAAC,uBAAuB;gBAC9B,QAAQ,GAAG,mBAAQ,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;gBAC1C,OAAO,GAAG,KAAK,CAAC;YAClB,CAAC;QACH,CAAC;QACD,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,CAAC;IAC/B,CAAC;IAED,gFAAgF;IACzE,MAAM,CAAC,6BAA6B,CACzC,WAAoD,EAAE,OAAe,EAAE,KAAiB;QAExF,OAAO,IAAI,CAAC,kCAAkC,CAAC,WAAW,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC,QAAQ,CAAC;IACvF,CAAC;CACF;AAjFD,gDAiFC","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n/** @packageDocumentation\n * @module Curve\n */\n\nimport { Geometry } from \"../Geometry\";\nimport { AngleSweep } from \"../geometry3d/AngleSweep\";\n\n/**\n * Enumeration of condition for extending a curve beyond start or end point.\n * * Not all CurvePrimitives support these modes.\n * @public\n */\nexport enum CurveExtendMode {\n  /** No extension allowed. */\n  None = 0,\n  /** Extend along continuation of the end tangent. Not implemented. */\n  OnTangent = 1,\n  /** Extend along continuation of the curve. */\n  OnCurve = 2,\n}\n/**\n * Logic for deciding how a curve may be extended for closest point or intersection searches.\n * @public\n */\nexport class CurveExtendOptions {\n  /**\n   * Given a `VariantCurveExtendParameter`, isolate the particular CurveExtendMode in effect at an end.\n   * * Return `CurveExtendMode.None` if `param === false`.\n   * * Return `CurveExtendMode.OnCurve` if `param === true`.\n   * * Return the param if it is a single CurveExtendMode.\n   * * Return dereferenced array at entry `endIndex` if the param is an array of CurveExtendMode.\n   */\n  public static resolveVariantCurveExtendParameterToCurveExtendMode(\n    param: VariantCurveExtendParameter | undefined, endIndex: 0 | 1,\n  ): CurveExtendMode {\n    param ??= false;\n    if (param === false)\n      return CurveExtendMode.None;\n    if (param === true)\n      return CurveExtendMode.OnCurve;\n    if (Array.isArray(param))\n      return param.length > endIndex ? param[endIndex] : CurveExtendMode.None;\n    return param;\n  }\n  /**\n   * Correct fraction to be within [0,1].\n   * * If fraction is in [0,1] return it unchanged.\n   * * If fraction is less than 0 use `extendParam` to decide whether to return it unchanged, or to return 0.\n   * * If fraction is greater than 1 use `extendParam` to decide whether to return it unchanged, or to return 1.\n   */\n  public static correctFraction(extendParam: VariantCurveExtendParameter | undefined, fraction: number): number {\n    extendParam ??= false;\n    if (fraction < 0) {\n      const mode = CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(extendParam, 0);\n      if (mode === CurveExtendMode.None)\n        fraction = 0.0;\n    } else if (fraction > 1.0) {\n      const mode = CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(extendParam, 1);\n      if (mode === CurveExtendMode.None)\n        fraction = 1.0;\n    }\n    return fraction;\n  }\n  /**\n   * Adjust a radians value to an angle sweep, extending beyond or clamping to [0,1] according to `extendParam`:\n   * * If `radians` is within the sweep, convert it to a fraction of the sweep.\n   * * If `radians` is outside the sweep and `extendParam` does not allow extension at both ends, adjust the fraction:\n   *   * fraction below 0 if `extendParam` allows extension only at start\n   *   * fraction above 1 if `extendParam` allows extension only at end\n   *   * fraction clamped to [0,1] if `extendParam` disallows extension at both ends\n   * @returns adjusted fraction of sweep, and a boolean indicating whether it is valid, i.e. whether `radians` lies in\n   * the sweep extended per `extendParam`.\n   */\n  public static resolveRadiansToValidSweepFraction(\n    extendParam: VariantCurveExtendParameter | undefined, radians: number, sweep: AngleSweep,\n  ): { fraction: number, isValid: boolean } {\n    extendParam ??= false;\n    let fraction = sweep.radiansToSignedPeriodicFraction(radians);\n    let isValid = true;\n    if (!sweep.isRadiansInSweep(radians)) {\n      const fractionPeriod = sweep.fractionPeriod();\n      const mode0 = CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(extendParam, 0);\n      const mode1 = CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(extendParam, 1);\n      if (mode0 !== CurveExtendMode.None) {\n        if (mode1 === CurveExtendMode.None) { // only extend to negative\n          if (fraction > 1.0)\n            fraction -= fractionPeriod;\n        }\n      } else if (mode1 !== CurveExtendMode.None) { // only extend to positive\n        if (fraction < 0.0)\n          fraction += fractionPeriod;\n      } else { // no extension allowed\n        fraction = Geometry.clamp(fraction, 0, 1);\n        isValid = false;\n      }\n    }\n    return { fraction, isValid };\n  }\n\n  /** Call [[resolveRadiansToValidSweepFraction]] and return only the fraction. */\n  public static resolveRadiansToSweepFraction(\n    extendParam: VariantCurveExtendParameter | undefined, radians: number, sweep: AngleSweep,\n  ): number {\n    return this.resolveRadiansToValidSweepFraction(extendParam, radians, sweep).fraction;\n  }\n}\n/**\n * Variant options for extending a curve.\n * * Useful for specifying either a single boolean/`CurveExtendMode` option applicable to both ends of the curve,\n * or an array of options, the first entry of which applies to the curve start; the second, to curve end.\n * @public\n */\nexport type VariantCurveExtendParameter = boolean | CurveExtendMode | CurveExtendMode[];\n"]}
+{"version":3,"file":"CurveExtendMode.js","sourceRoot":"","sources":["../../../src/curve/CurveExtendMode.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH,0CAAuC;AAGvC;;;;GAIG;AACH,IAAY,eAOX;AAPD,WAAY,eAAe;IACzB,4BAA4B;IAC5B,qDAAQ,CAAA;IACR,qEAAqE;IACrE,+DAAa,CAAA;IACb,8CAA8C;IAC9C,2DAAW,CAAA;AACb,CAAC,EAPW,eAAe,+BAAf,eAAe,QAO1B;AACD;;;GAGG;AACH,MAAa,kBAAkB;IAC7B;;;;;;OAMG;IACI,MAAM,CAAC,mDAAmD,CAC/D,KAA8C,EAAE,QAAe;QAE/D,KAAK,KAAK,KAAK,CAAC;QAChB,IAAI,KAAK,KAAK,KAAK;YACjB,OAAO,eAAe,CAAC,IAAI,CAAC;QAC9B,IAAI,KAAK,KAAK,IAAI;YAChB,OAAO,eAAe,CAAC,OAAO,CAAC;QACjC,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;YACtB,OAAO,KAAK,CAAC,MAAM,GAAG,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,IAAI,CAAC;QAC1E,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,eAAe,CAAC,WAAoD,EAAE,QAAgB;QAClG,WAAW,KAAK,KAAK,CAAC;QACtB,IAAI,QAAQ,GAAG,CAAC,EAAE,CAAC;YACjB,MAAM,IAAI,GAAG,kBAAkB,CAAC,mDAAmD,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;YACpG,IAAI,IAAI,KAAK,eAAe,CAAC,IAAI;gBAC/B,QAAQ,GAAG,GAAG,CAAC;QACnB,CAAC;aAAM,IAAI,QAAQ,GAAG,GAAG,EAAE,CAAC;YAC1B,MAAM,IAAI,GAAG,kBAAkB,CAAC,mDAAmD,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;YACpG,IAAI,IAAI,KAAK,eAAe,CAAC,IAAI;gBAC/B,QAAQ,GAAG,GAAG,CAAC;QACnB,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IACD;;;;;;;;;OASG;IACI,MAAM,CAAC,kCAAkC,CAC9C,WAAoD,EAAE,OAAe,EAAE,KAAiB;QAExF,WAAW,KAAK,KAAK,CAAC;QACtB,IAAI,QAAQ,GAAG,KAAK,CAAC,+BAA+B,CAAC,OAAO,CAAC,CAAC;QAC9D,IAAI,OAAO,GAAG,IAAI,CAAC;QACnB,IAAI,CAAC,KAAK,CAAC,gBAAgB,CAAC,OAAO,CAAC,EAAE,CAAC;YACrC,MAAM,cAAc,GAAG,KAAK,CAAC,cAAc,EAAE,CAAC;YAC9C,MAAM,KAAK,GAAG,kBAAkB,CAAC,mDAAmD,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;YACrG,MAAM,KAAK,GAAG,kBAAkB,CAAC,mDAAmD,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;YACrG,IAAI,KAAK,KAAK,eAAe,CAAC,IAAI,EAAE,CAAC;gBACnC,IAAI,KAAK,KAAK,eAAe,CAAC,IAAI,EAAE,CAAC,CAAC,0BAA0B;oBAC9D,IAAI,QAAQ,GAAG,GAAG;wBAChB,QAAQ,IAAI,cAAc,CAAC;gBAC/B,CAAC;YACH,CAAC;iBAAM,IAAI,KAAK,KAAK,eAAe,CAAC,IAAI,EAAE,CAAC,CAAC,0BAA0B;gBACrE,IAAI,QAAQ,GAAG,GAAG;oBAChB,QAAQ,IAAI,cAAc,CAAC;YAC/B,CAAC;iBAAM,CAAC,CAAC,uBAAuB;gBAC9B,QAAQ,GAAG,mBAAQ,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;gBAC1C,OAAO,GAAG,KAAK,CAAC;YAClB,CAAC;QACH,CAAC;QACD,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,CAAC;IAC/B,CAAC;IAED,gFAAgF;IACzE,MAAM,CAAC,6BAA6B,CACzC,WAAoD,EAAE,OAAe,EAAE,KAAiB;QAExF,OAAO,IAAI,CAAC,kCAAkC,CAAC,WAAW,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC,QAAQ,CAAC;IACvF,CAAC;CACF;AAjFD,gDAiFC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n/** @packageDocumentation\r\n * @module Curve\r\n */\r\n\r\nimport { Geometry } from \"../Geometry\";\r\nimport { AngleSweep } from \"../geometry3d/AngleSweep\";\r\n\r\n/**\r\n * Enumeration of condition for extending a curve beyond start or end point.\r\n * * Not all CurvePrimitives support these modes.\r\n * @public\r\n */\r\nexport enum CurveExtendMode {\r\n  /** No extension allowed. */\r\n  None = 0,\r\n  /** Extend along continuation of the end tangent. Not implemented. */\r\n  OnTangent = 1,\r\n  /** Extend along continuation of the curve. */\r\n  OnCurve = 2,\r\n}\r\n/**\r\n * Logic for deciding how a curve may be extended for closest point or intersection searches.\r\n * @public\r\n */\r\nexport class CurveExtendOptions {\r\n  /**\r\n   * Given a `VariantCurveExtendParameter`, isolate the particular CurveExtendMode in effect at an end.\r\n   * * Return `CurveExtendMode.None` if `param === false`.\r\n   * * Return `CurveExtendMode.OnCurve` if `param === true`.\r\n   * * Return the param if it is a single CurveExtendMode.\r\n   * * Return dereferenced array at entry `endIndex` if the param is an array of CurveExtendMode.\r\n   */\r\n  public static resolveVariantCurveExtendParameterToCurveExtendMode(\r\n    param: VariantCurveExtendParameter | undefined, endIndex: 0 | 1,\r\n  ): CurveExtendMode {\r\n    param ??= false;\r\n    if (param === false)\r\n      return CurveExtendMode.None;\r\n    if (param === true)\r\n      return CurveExtendMode.OnCurve;\r\n    if (Array.isArray(param))\r\n      return param.length > endIndex ? param[endIndex] : CurveExtendMode.None;\r\n    return param;\r\n  }\r\n  /**\r\n   * Correct fraction to be within [0,1].\r\n   * * If fraction is in [0,1] return it unchanged.\r\n   * * If fraction is less than 0 use `extendParam` to decide whether to return it unchanged, or to return 0.\r\n   * * If fraction is greater than 1 use `extendParam` to decide whether to return it unchanged, or to return 1.\r\n   */\r\n  public static correctFraction(extendParam: VariantCurveExtendParameter | undefined, fraction: number): number {\r\n    extendParam ??= false;\r\n    if (fraction < 0) {\r\n      const mode = CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(extendParam, 0);\r\n      if (mode === CurveExtendMode.None)\r\n        fraction = 0.0;\r\n    } else if (fraction > 1.0) {\r\n      const mode = CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(extendParam, 1);\r\n      if (mode === CurveExtendMode.None)\r\n        fraction = 1.0;\r\n    }\r\n    return fraction;\r\n  }\r\n  /**\r\n   * Adjust a radians value to an angle sweep, extending beyond or clamping to [0,1] according to `extendParam`:\r\n   * * If `radians` is within the sweep, convert it to a fraction of the sweep.\r\n   * * If `radians` is outside the sweep and `extendParam` does not allow extension at both ends, adjust the fraction:\r\n   *   * fraction below 0 if `extendParam` allows extension only at start\r\n   *   * fraction above 1 if `extendParam` allows extension only at end\r\n   *   * fraction clamped to [0,1] if `extendParam` disallows extension at both ends\r\n   * @returns adjusted fraction of sweep, and a boolean indicating whether it is valid, i.e. whether `radians` lies in\r\n   * the sweep extended per `extendParam`.\r\n   */\r\n  public static resolveRadiansToValidSweepFraction(\r\n    extendParam: VariantCurveExtendParameter | undefined, radians: number, sweep: AngleSweep,\r\n  ): { fraction: number, isValid: boolean } {\r\n    extendParam ??= false;\r\n    let fraction = sweep.radiansToSignedPeriodicFraction(radians);\r\n    let isValid = true;\r\n    if (!sweep.isRadiansInSweep(radians)) {\r\n      const fractionPeriod = sweep.fractionPeriod();\r\n      const mode0 = CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(extendParam, 0);\r\n      const mode1 = CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(extendParam, 1);\r\n      if (mode0 !== CurveExtendMode.None) {\r\n        if (mode1 === CurveExtendMode.None) { // only extend to negative\r\n          if (fraction > 1.0)\r\n            fraction -= fractionPeriod;\r\n        }\r\n      } else if (mode1 !== CurveExtendMode.None) { // only extend to positive\r\n        if (fraction < 0.0)\r\n          fraction += fractionPeriod;\r\n      } else { // no extension allowed\r\n        fraction = Geometry.clamp(fraction, 0, 1);\r\n        isValid = false;\r\n      }\r\n    }\r\n    return { fraction, isValid };\r\n  }\r\n\r\n  /** Call [[resolveRadiansToValidSweepFraction]] and return only the fraction. */\r\n  public static resolveRadiansToSweepFraction(\r\n    extendParam: VariantCurveExtendParameter | undefined, radians: number, sweep: AngleSweep,\r\n  ): number {\r\n    return this.resolveRadiansToValidSweepFraction(extendParam, radians, sweep).fraction;\r\n  }\r\n}\r\n/**\r\n * Variant options for extending a curve.\r\n * * Useful for specifying either a single boolean/`CurveExtendMode` option applicable to both ends of the curve,\r\n * or an array of options, the first entry of which applies to the curve start; the second, to curve end.\r\n * @public\r\n */\r\nexport type VariantCurveExtendParameter = boolean | CurveExtendMode | CurveExtendMode[];\r\n"]}

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

@@ -73,20 +73,51 @@ export interface MiteredSweepOptions {
  */
 export interface CreateFilletsInLineStringOptions {
     /**
-     * Allow creation of retrograde edges to join large-radius fillets.
-     * * If `true` (default), cusps are present in the output `Path` when the radius is too large.
-     * * If `false`, a fillet with overly large radius is disallowed, resulting in a simple corner.
+    * Whether to allow cusps in the output `Path`. Default value is `true`.
+    * * A _cusp_ forms when a fillet's radius is large enough to consume an adjacent line string segment, or when two
+    * fillets intersect.
+    * * Each cusp results in a retrograde "cusp segment" or gap in the output `Path`, as per the `cuspSegments` option.
+    * * The length of cusp segments in the output `Path` is bounded above by the `cuspTolerance` option.
+    * * When this option is `false`, cusps are avoided by suppressing one or both of their constituent fillets. Where two
+    * fillets combine to form a cusp, but either fillet by itself does not form a cusp, the fillet with smaller chain
+    * index survives.
     */
     allowCusp?: boolean;
     /**
-     * Whether to fillet the closure.
+     * Whether to fillet the closure of the input line string. Default value is `false`.
      * * If `true`, the input line string is treated as a polygon (closure point optional), and the output `Path` is
      * closed and has a fillet at its start point. If both first and last input points are identical, the last point's
      * entry in the radius array is ignored.
-     * * If `false` (default), the first and last points receive no fillet and their respective entries in the radius
-     * array are ignored.
+     * * If `false`, the first and last points receive no fillet and their respective entries in the radius array are
+     * ignored.
      */
     filletClosure?: boolean;
+    /**
+     * Maximum distance between first and last input points for the line string to be considered closed. Default value is
+     * [[Geometry.smallMetricDistance]].
+     * * This distance is used when `filletClosure` is `true` to detect whether the last point is redundant and thus to
+     * be ignored during processing.
+     */
+    closureTolerance?: number;
+    /**
+     * Maximum allowable length of a cusp when `allowCusp` is `true`. Default value is [[Geometry.smallMetricDistance]].
+     * * A cusp's length is defined to be the length of its "cusp segment", regardless of whether the cusp segment
+     * appears in the output `Path` (cf. option `cuspSegments`).
+     * * A cusp whose length exceeds `cuspTolerance` is avoided by suppressing one or both of the cusp's constituent
+     * fillets. Where two fillets combine to form such a cusp, but either fillet by itself produces a cusp shorter than
+     * `cuspTolerance`, the fillet that generates the shorter cusp survives; if the fillets by themselves generate equal
+     * length cusps, the fillet with smaller chain index survives.
+     */
+    cuspTolerance?: number;
+    /**
+     *  Whether to output a `LineSegment3d` for each cusp segment. Default value is `true`.
+     * * The _cusp segment_ of a cusp is the retrograde line segment that bridges the gap formed by the cusp along its
+     * consumed line string edge, possibly extended.
+     * * When `allowCusp` and `cuspSegments` are `true`, the output `Path` is guaranteed to be continuous; otherwise, the
+     * output `Path` has a gap at each cusp, and downstream processing may not tolerate these gaps if they are too large.
+     * * Compare this option to `allowCusp`, which controls the presence of the cusps themselves.
+     */
+    cuspSegments?: boolean;
 }
 /**
  * Options used for method [[CurveFactory.fromFilletedLineString]].
@@ -123,7 +154,7 @@ export declare class CurveFactory {
      */
     static createArcPointTangentPoint(start: Point3d, tangentAtStart: Vector3d, end: Point3d): Arc3d | undefined;
     /**
-     * Construct a sequence of alternating lines and arcs with the arcs creating tangent transition between consecutive edges.
+     * Construct a sequence of alternating lines and arcs with each arc creating a smooth transition between consecutive edges.
      *  * If the radius parameter is a number, that radius is used throughout.
      *  * If the radius parameter is an array of numbers, `radius[i]` is applied at `point[i]`.
      *  * A zero radius for any point indicates to leave the as a simple corner.

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

@@ -1 +1 @@
-{"version":3,"file":"CurveFactory.d.ts","sourceRoot":"","sources":["../../../src/curve/CurveFactory.ts"],"names":[],"mappings":"AAUA,OAAO,EAAkC,mBAAmB,EAAE,sBAAsB,EAAE,MAAM,aAAa,CAAC;AAC1G,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAC5C,OAAO,EAAE,UAAU,EAAE,MAAM,0BAA0B,CAAC;AACtD,OAAO,EAAE,SAAS,EAAE,iBAAiB,EAAE,MAAM,yBAAyB,CAAC;AACvE,OAAO,EAAE,oBAAoB,EAAE,MAAM,oCAAoC,CAAC;AAE1E,OAAO,EAAE,4BAA4B,EAAE,MAAM,4CAA4C,CAAC;AAG1F,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAElE,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAG5C,OAAO,EAAE,KAAK,EAAE,MAAM,wBAAwB,CAAC;AAE/C,OAAO,EAAE,eAAe,EAAE,MAAM,sBAAsB,CAAC;AAGvD,OAAO,EAAE,UAAU,EAAE,MAAM,qBAAqB,CAAC;AAEjD,OAAO,EAAE,KAAK,EAAgB,MAAM,SAAS,CAAC;AAC9C,OAAO,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AAC/C,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAClD,OAAO,EAAE,QAAQ,EAAa,MAAM,cAAc,CAAC;AACnD,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAEhD,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAC9C,OAAO,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAC9B,OAAO,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAG9B,OAAO,EAAE,wBAAwB,EAAE,MAAM,6BAA6B,CAAC;AACvE,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAEhD;;;;GAIG;AACH,MAAM,WAAW,yBAAyB;IACxC,iCAAiC;IACjC,MAAM,EAAE,4BAA4B,EAAE,CAAC;IACvC,4DAA4D;IAC5D,QAAQ,EAAE,QAAQ,EAAE,CAAC;IACrB;;;OAGG;IACH,UAAU,CAAC,EAAE,UAAU,CAAC;IACxB,iFAAiF;IACjF,IAAI,CAAC,EAAE,eAAe,CAAC;CACxB;AAED;;;GAGG;AACH,oBAAY,wBAAwB;IAClC,8DAA8D;IAC9D,QAAQ,IAAI;IACZ,wEAAwE;IACxE,cAAc,IAAI;IAClB,6FAA6F;IAC7F,QAAQ,IAAI;CACb;AAED;;;GAGG;AACH,MAAM,WAAW,mBAAmB;IAClC,iIAAiI;IACjI,sBAAsB,CAAC,EAAE,OAAO,CAAC;IACjC,uJAAuJ;IACvJ,YAAY,CAAC,EAAE,wBAAwB,CAAC;IACxC,wFAAwF;IACxF,aAAa,CAAC,EAAE,aAAa,CAAC;IAC9B,oGAAoG;IACpG,MAAM,CAAC,EAAE,OAAO,CAAC;IACjB,wIAAwI;IACxI,YAAY,CAAC,EAAE,QAAQ,CAAC;IACxB,qIAAqI;IACrI,UAAU,CAAC,EAAE,QAAQ,CAAC;CACvB;AAeD;;;GAGG;AACH,MAAM,WAAW,gCAAgC;IAC/C;;;;MAIE;IACF,SAAS,CAAC,EAAE,OAAO,CAAC;IACpB;;;;;;;OAOG;IACH,aAAa,CAAC,EAAE,OAAO,CAAC;CACzB;AAED;;;GAGG;AACH,MAAM,WAAW,yBAAyB;IACxC;;;OAGG;IACH,eAAe,CAAC,EAAE,mBAAmB,CAAC;IACtC;;;OAGG;IACH,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB;;;OAGG;IACH,iBAAiB,CAAC,EAAE,OAAO,CAAC;CAC7B;AAED;;;GAGG;AACH,qBAAa,YAAY;IACvB,mFAAmF;IACnF,OAAO,CAAC,MAAM,CAAC,iBAAiB;IAUhC;;;;OAIG;WACW,0BAA0B,CAAC,KAAK,EAAE,OAAO,EAAE,cAAc,EAAE,QAAQ,EAAE,GAAG,EAAE,OAAO,GAAG,KAAK,GAAG,SAAS;IAOnH;;;;;;;;OAQG;WACW,yBAAyB,CACrC,MAAM,EAAE,YAAY,GAAG,oBAAoB,GAAG,OAAO,EAAE,EACvD,MAAM,EAAE,MAAM,GAAG,MAAM,EAAE,EACzB,kBAAkB,GAAE,OAAO,GAAG,gCAAuC,GACpE,IAAI,GAAG,SAAS;IA8DnB,8GAA8G;IAC9G,OAAO,CAAC,MAAM,CAAC,wBAAwB;IAevC;;;;;OAKG;IACH,OAAO,CAAC,MAAM,CAAC,iBAAiB;IAUhC;;;;;;;;OAQG;IACH,OAAO,CAAC,MAAM,CAAC,8BAA8B;IAwC7C;;;OAGG;IACH,OAAO,CAAC,MAAM,CAAC,oBAAoB;IA0BnC,uCAAuC;IACvC,OAAO,CAAC,MAAM,CAAC,0BAA0B;IA4BzC,gHAAgH;IAChH,OAAO,CAAC,MAAM,CAAC,4BAA4B;IAmB3C;;;;;;;;;;;;;;;;;;;;OAoBG;WACW,sBAAsB,CAClC,kBAAkB,EAAE,UAAU,EAAE,OAAO,CAAC,EAAE,yBAAyB,GAClE,KAAK,CAAC,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC,GAAG,SAAS;IAqDvC;;;;OAIG;WACW,iBAAiB,CAC7B,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,GAAE,MAAU,EAAE,YAAY,CAAC,EAAE,MAAM,GACnF,IAAI;IA4CP;;;;;;;;OAQG;WACW,kBAAkB,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,YAAY,GAAE,OAAe,EAAE,SAAS,GAAE,MAAqC,GAAG,OAAO;IA6BpJ;;;;;;;OAOG;WACW,2BAA2B,CACvC,SAAS,EAAE,SAAS,EAAE,UAAU,EAAE,iBAAiB,EAAE,EAAE,6BAA6B,GAAE,MAAY,GACjG,IAAI;IAWP,OAAO,CAAC,MAAM,CAAC,wBAAwB;IAQvC;;;;OAIG;WACW,kBAAkB,CAC9B,UAAU,EAAE,cAAc,GAAG,UAAU,EAAE,UAAU,EAAE,MAAM,GAC1D,aAAa,GAAG,aAAa,EAAE,GAAG,SAAS;IAmB9C,0DAA0D;IAC1D,OAAO,CAAC,MAAM,CAAC,oBAAoB;IAYnC,uGAAuG;WACzF,wBAAwB,CACpC,UAAU,EAAE,oBAAoB,GAAG,OAAO,EAAE,GAAG,cAAc,EAAE,WAAW,EAAE,MAAM,GAAG,KAAK,GAAG,KAAK,GACjG,KAAK,GAAG,SAAS;IAsBpB;;;;;;;;;;;;;;;;;;;OAmBG;WACW,yBAAyB,CAAC,UAAU,EAAE,oBAAoB,EAAE,WAAW,EAAE,MAAM,GAAG,KAAK,GAAG,KAAK,GAAG,KAAK,EAAE;IAUvH,6EAA6E;IAC7E,OAAO,CAAC,MAAM,CAAC,iBAAiB;IAuBhC;;;OAGG;IACH,OAAO,CAAC,MAAM,CAAC,+BAA+B;IAsB9C,qHAAqH;IACrH,OAAO,CAAC,MAAM,CAAC,uBAAuB;IAmBtC;;;;OAIG;IACH,OAAO,CAAC,MAAM,CAAC,cAAc;IAqB7B;;;;;;;;;;;;;;;;;;;OAmBG;WACW,0BAA0B,CACtC,UAAU,EAAE,oBAAoB,GAAG,OAAO,EAAE,GAAG,cAAc,GAAG,UAAU,EAC1E,cAAc,EAAE,QAAQ,EACxB,OAAO,CAAC,EAAE,mBAAmB,GAC5B,yBAAyB,GAAG,SAAS;IAkCxC;;;;;;;;OAQG;WACW,2BAA2B,CACvC,KAAK,EAAE,OAAO,EAAE,cAAc,EAAE,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,CAAC,EAAE,QAAQ,EAAE,KAAK,CAAC,EAAE,KAAK,GAAG,UAAU,GACxG,KAAK,GAAG,SAAS;IAIpB;;;;;;;;;OASG;WACW,0BAA0B,CACtC,UAAU,EAAE,wBAAwB,EACpC,UAAU,EAAE,OAAO,EACnB,aAAa,EAAE,OAAO,EACtB,WAAW,EAAE,OAAO,GACnB,aAAa,EAAE,GAAG,SAAS;IAsC9B;;;;;;;;;OASG;WACW,0CAA0C,CACtD,UAAU,EAAE,wBAAwB,EACpC,MAAM,EAAE,OAAO,EACf,MAAM,EAAE,OAAO,EACf,MAAM,EAAE,OAAO,EACf,YAAY,EAAE,MAAM,GACnB,aAAa,EAAE,GAAG,SAAS;IAgD9B;;;;;;;;;OASG;WACW,6BAA6B,CACzC,UAAU,EAAE,wBAAwB,EACpC,MAAM,EAAE,OAAO,EACf,MAAM,EAAE,OAAO,EACf,MAAM,EAAE,OAAO,EACf,OAAO,EAAE,MAAM,EACf,OAAO,EAAE,MAAM,EACf,SAAS,EAAE,MAAM,GAChB,aAAa,EAAE,GAAG,SAAS;IAsD9B,iDAAiD;WACnC,yBAAyB,CACrC,MAAM,EAAE,sBAAsB,EAAE,MAAM,EAAE,sBAAsB,GAAG,KAAK,GAAG,SAAS;CAsBrF"}
+{"version":3,"file":"CurveFactory.d.ts","sourceRoot":"","sources":["../../../src/curve/CurveFactory.ts"],"names":[],"mappings":"AAUA,OAAO,EAAkC,mBAAmB,EAAE,sBAAsB,EAAE,MAAM,aAAa,CAAC;AAC1G,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAC5C,OAAO,EAAE,UAAU,EAAE,MAAM,0BAA0B,CAAC;AACtD,OAAO,EAAE,SAAS,EAAE,iBAAiB,EAAE,MAAM,yBAAyB,CAAC;AACvE,OAAO,EAAE,oBAAoB,EAAE,MAAM,oCAAoC,CAAC;AAE1E,OAAO,EAAE,4BAA4B,EAAE,MAAM,4CAA4C,CAAC;AAG1F,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAElE,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAG5C,OAAO,EAAE,KAAK,EAAE,MAAM,wBAAwB,CAAC;AAE/C,OAAO,EAAE,eAAe,EAAE,MAAM,sBAAsB,CAAC;AAGvD,OAAO,EAAE,UAAU,EAAE,MAAM,qBAAqB,CAAC;AAEjD,OAAO,EAAE,KAAK,EAAgB,MAAM,SAAS,CAAC;AAC9C,OAAO,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AAC/C,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAClD,OAAO,EAAE,QAAQ,EAAa,MAAM,cAAc,CAAC;AACnD,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAEhD,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAC9C,OAAO,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAC9B,OAAO,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAG9B,OAAO,EAAE,wBAAwB,EAAE,MAAM,6BAA6B,CAAC;AACvE,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAEhD;;;;GAIG;AACH,MAAM,WAAW,yBAAyB;IACxC,iCAAiC;IACjC,MAAM,EAAE,4BAA4B,EAAE,CAAC;IACvC,4DAA4D;IAC5D,QAAQ,EAAE,QAAQ,EAAE,CAAC;IACrB;;;OAGG;IACH,UAAU,CAAC,EAAE,UAAU,CAAC;IACxB,iFAAiF;IACjF,IAAI,CAAC,EAAE,eAAe,CAAC;CACxB;AAED;;;GAGG;AACH,oBAAY,wBAAwB;IAClC,8DAA8D;IAC9D,QAAQ,IAAI;IACZ,wEAAwE;IACxE,cAAc,IAAI;IAClB,6FAA6F;IAC7F,QAAQ,IAAI;CACb;AAED;;;GAGG;AACH,MAAM,WAAW,mBAAmB;IAClC,iIAAiI;IACjI,sBAAsB,CAAC,EAAE,OAAO,CAAC;IACjC,uJAAuJ;IACvJ,YAAY,CAAC,EAAE,wBAAwB,CAAC;IACxC,wFAAwF;IACxF,aAAa,CAAC,EAAE,aAAa,CAAC;IAC9B,oGAAoG;IACpG,MAAM,CAAC,EAAE,OAAO,CAAC;IACjB,wIAAwI;IACxI,YAAY,CAAC,EAAE,QAAQ,CAAC;IACxB,qIAAqI;IACrI,UAAU,CAAC,EAAE,QAAQ,CAAC;CACvB;AAeD;;;GAGG;AACH,MAAM,WAAW,gCAAgC;IAC/C;;;;;;;;;MASE;IACF,SAAS,CAAC,EAAE,OAAO,CAAC;IACpB;;;;;;;OAOG;IACH,aAAa,CAAC,EAAE,OAAO,CAAC;IACxB;;;;;OAKG;IACH,gBAAgB,CAAC,EAAE,MAAM,CAAC;IAC1B;;;;;;;;OAQG;IACH,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB;;;;;;;OAOG;IACH,YAAY,CAAC,EAAE,OAAO,CAAC;CACxB;AAED;;;GAGG;AACH,MAAM,WAAW,yBAAyB;IACxC;;;OAGG;IACH,eAAe,CAAC,EAAE,mBAAmB,CAAC;IACtC;;;OAGG;IACH,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB;;;OAGG;IACH,iBAAiB,CAAC,EAAE,OAAO,CAAC;CAC7B;AAED;;;GAGG;AACH,qBAAa,YAAY;IACvB,mFAAmF;IACnF,OAAO,CAAC,MAAM,CAAC,iBAAiB;IAUhC;;;;OAIG;WACW,0BAA0B,CAAC,KAAK,EAAE,OAAO,EAAE,cAAc,EAAE,QAAQ,EAAE,GAAG,EAAE,OAAO,GAAG,KAAK,GAAG,SAAS;IAOnH;;;;;;;;OAQG;WACW,yBAAyB,CACrC,MAAM,EAAE,YAAY,GAAG,oBAAoB,GAAG,OAAO,EAAE,EACvD,MAAM,EAAE,MAAM,GAAG,MAAM,EAAE,EACzB,kBAAkB,GAAE,OAAO,GAAG,gCAAuC,GACpE,IAAI,GAAG,SAAS;IAqFnB,8GAA8G;IAC9G,OAAO,CAAC,MAAM,CAAC,wBAAwB;IAevC;;;;;OAKG;IACH,OAAO,CAAC,MAAM,CAAC,iBAAiB;IAUhC;;;;;;;;OAQG;IACH,OAAO,CAAC,MAAM,CAAC,8BAA8B;IAwC7C;;;OAGG;IACH,OAAO,CAAC,MAAM,CAAC,oBAAoB;IA0BnC,uCAAuC;IACvC,OAAO,CAAC,MAAM,CAAC,0BAA0B;IA4BzC,gHAAgH;IAChH,OAAO,CAAC,MAAM,CAAC,4BAA4B;IAmB3C;;;;;;;;;;;;;;;;;;;;OAoBG;WACW,sBAAsB,CAClC,kBAAkB,EAAE,UAAU,EAAE,OAAO,CAAC,EAAE,yBAAyB,GAClE,KAAK,CAAC,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC,GAAG,SAAS;IAqDvC;;;;OAIG;WACW,iBAAiB,CAC7B,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,GAAE,MAAU,EAAE,YAAY,CAAC,EAAE,MAAM,GACnF,IAAI;IA4CP;;;;;;;;OAQG;WACW,kBAAkB,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,YAAY,GAAE,OAAe,EAAE,SAAS,GAAE,MAAqC,GAAG,OAAO;IA6BpJ;;;;;;;OAOG;WACW,2BAA2B,CACvC,SAAS,EAAE,SAAS,EAAE,UAAU,EAAE,iBAAiB,EAAE,EAAE,6BAA6B,GAAE,MAAY,GACjG,IAAI;IAWP,OAAO,CAAC,MAAM,CAAC,wBAAwB;IAQvC;;;;OAIG;WACW,kBAAkB,CAC9B,UAAU,EAAE,cAAc,GAAG,UAAU,EAAE,UAAU,EAAE,MAAM,GAC1D,aAAa,GAAG,aAAa,EAAE,GAAG,SAAS;IAmB9C,0DAA0D;IAC1D,OAAO,CAAC,MAAM,CAAC,oBAAoB;IAYnC,uGAAuG;WACzF,wBAAwB,CACpC,UAAU,EAAE,oBAAoB,GAAG,OAAO,EAAE,GAAG,cAAc,EAAE,WAAW,EAAE,MAAM,GAAG,KAAK,GAAG,KAAK,GACjG,KAAK,GAAG,SAAS;IAsBpB;;;;;;;;;;;;;;;;;;;OAmBG;WACW,yBAAyB,CAAC,UAAU,EAAE,oBAAoB,EAAE,WAAW,EAAE,MAAM,GAAG,KAAK,GAAG,KAAK,GAAG,KAAK,EAAE;IAUvH,6EAA6E;IAC7E,OAAO,CAAC,MAAM,CAAC,iBAAiB;IAuBhC;;;OAGG;IACH,OAAO,CAAC,MAAM,CAAC,+BAA+B;IAsB9C,qHAAqH;IACrH,OAAO,CAAC,MAAM,CAAC,uBAAuB;IAmBtC;;;;OAIG;IACH,OAAO,CAAC,MAAM,CAAC,cAAc;IAqB7B;;;;;;;;;;;;;;;;;;;OAmBG;WACW,0BAA0B,CACtC,UAAU,EAAE,oBAAoB,GAAG,OAAO,EAAE,GAAG,cAAc,GAAG,UAAU,EAC1E,cAAc,EAAE,QAAQ,EACxB,OAAO,CAAC,EAAE,mBAAmB,GAC5B,yBAAyB,GAAG,SAAS;IAkCxC;;;;;;;;OAQG;WACW,2BAA2B,CACvC,KAAK,EAAE,OAAO,EAAE,cAAc,EAAE,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,CAAC,EAAE,QAAQ,EAAE,KAAK,CAAC,EAAE,KAAK,GAAG,UAAU,GACxG,KAAK,GAAG,SAAS;IAIpB;;;;;;;;;OASG;WACW,0BAA0B,CACtC,UAAU,EAAE,wBAAwB,EACpC,UAAU,EAAE,OAAO,EACnB,aAAa,EAAE,OAAO,EACtB,WAAW,EAAE,OAAO,GACnB,aAAa,EAAE,GAAG,SAAS;IAsC9B;;;;;;;;;OASG;WACW,0CAA0C,CACtD,UAAU,EAAE,wBAAwB,EACpC,MAAM,EAAE,OAAO,EACf,MAAM,EAAE,OAAO,EACf,MAAM,EAAE,OAAO,EACf,YAAY,EAAE,MAAM,GACnB,aAAa,EAAE,GAAG,SAAS;IAgD9B;;;;;;;;;OASG;WACW,6BAA6B,CACzC,UAAU,EAAE,wBAAwB,EACpC,MAAM,EAAE,OAAO,EACf,MAAM,EAAE,OAAO,EACf,MAAM,EAAE,OAAO,EACf,OAAO,EAAE,MAAM,EACf,OAAO,EAAE,MAAM,EACf,SAAS,EAAE,MAAM,GAChB,aAAa,EAAE,GAAG,SAAS;IAsD9B,iDAAiD;WACnC,yBAAyB,CACrC,MAAM,EAAE,sBAAsB,EAAE,MAAM,EAAE,sBAAsB,GAAG,KAAK,GAAG,SAAS;CAsBrF"}

package/lib/cjs/curve/CurveFactory.js

@@ -74,7 +74,7 @@ class CurveFactory {
             return undefined;
     }
     /**
-     * Construct a sequence of alternating lines and arcs with the arcs creating tangent transition between consecutive edges.
+     * Construct a sequence of alternating lines and arcs with each arc creating a smooth transition between consecutive edges.
      *  * If the radius parameter is a number, that radius is used throughout.
      *  * If the radius parameter is an array of numbers, `radius[i]` is applied at `point[i]`.
      *  * A zero radius for any point indicates to leave the as a simple corner.
@@ -87,20 +87,18 @@ class CurveFactory {
             return this.createFilletsInLineString(new Point3dArrayCarrier_1.Point3dArrayCarrier(points), radius, allowCuspOrOptions);
         if (points instanceof LineString3d_1.LineString3d)
             return this.createFilletsInLineString(points.packedPoints, radius, allowCuspOrOptions);
-        let allowCusp = true;
-        let filletClosure = false;
-        if (typeof allowCuspOrOptions === "boolean") {
-            allowCusp = allowCuspOrOptions;
-        }
-        else {
-            allowCusp = allowCuspOrOptions.allowCusp ?? true;
-            filletClosure = allowCuspOrOptions.filletClosure ?? false;
-        }
+        const haveBoolean = typeof allowCuspOrOptions === "boolean";
+        const allowCusp = haveBoolean ? allowCuspOrOptions : allowCuspOrOptions.allowCusp ?? true;
+        const filletClosure = haveBoolean ? false : allowCuspOrOptions.filletClosure ?? false;
+        const closureTolerance = haveBoolean ? Geometry_1.Geometry.smallMetricDistance : allowCuspOrOptions.closureTolerance ?? Geometry_1.Geometry.smallMetricDistance;
+        const cuspTolerance = haveBoolean ? Geometry_1.Geometry.smallMetricDistance : allowCuspOrOptions.cuspTolerance ?? Geometry_1.Geometry.smallMetricDistance;
+        const cuspSegments = haveBoolean ? true : allowCuspOrOptions.cuspSegments ?? true;
         let n = points.length;
-        if (filletClosure && points.almostEqualIndexIndex(0, n - 1))
+        if (filletClosure && points.almostEqualIndexIndex(0, n - 1, closureTolerance))
             n--; // ignore closure point
         if (n <= 1)
             return undefined;
+        // create blend data at each vertex
         const pointA = Point3dVector3d_1.Point3d.create();
         const pointB = Point3dVector3d_1.Point3d.create();
         const pointC = Point3dVector3d_1.Point3d.create();
@@ -121,17 +119,41 @@ class CurveFactory {
             }
         }
         (0, core_bentley_1.assert)(blendArray.length === n);
-        if (!allowCusp) {
-            // suppress arcs that overlap a neighboring arc, or that consume the entire segment
-            for (let i = 0; i < n; i++) {
-                const bB = blendArray[i];
-                if (!bB.arc)
-                    continue;
-                const bA = blendArray[Geometry_1.Geometry.modulo(i - 1, n)];
-                const bC = blendArray[Geometry_1.Geometry.modulo(i + 1, n)];
-                if (bB.fraction10 > 1 || bB.fraction12 > 1 || bB.fraction10 + bA.fraction12 > 1 || bB.fraction12 + bC.fraction10 > 1) {
-                    bB.fraction10 = bB.fraction12 = 0;
-                    bB.arc = undefined;
+        // For each edge, look at its 0|1|2 fillets to determine whether/which to suppress.
+        // When a cusp is generated by 2 fillets, use this HEURISTIC:
+        // * Prefer to keep the fillet that results in the smaller allowable cusp segment.
+        // * If by itself, each fillet results in a cusp segment of equal allowable length (possibly zero), keep the first.
+        const edgeHasCusp = (fillet0, fillet1) => fillet0.fraction12 + fillet1.fraction10 > 1;
+        const cuspSegmentLength = (checkedEdgeIndex, fillet0, fillet1) => points.distanceUncheckedIndexIndex(checkedEdgeIndex, points.cyclicIndex(checkedEdgeIndex + 1)) * (fillet0.fraction12 + fillet1.fraction10 - 1);
+        const filletOvershootsEdge = (fillet, filletIndex) => filletIndex === 0 ? fillet.fraction12 > 1 : fillet.fraction10 > 1;
+        const cuspNeedsRemoval = (checkedEdgeIndex, fillet0, fillet1) => edgeHasCusp(fillet0, fillet1) && (!allowCusp || cuspSegmentLength(checkedEdgeIndex, fillet0, fillet1) > cuspTolerance);
+        const removeFillet = (fillet) => { fillet.fraction10 = fillet.fraction12 = 0; fillet.arc = undefined; };
+        for (let iEdge = 0; iEdge < (filletClosure ? n : n - 1); iEdge++) {
+            const fillet0 = blendArray[iEdge];
+            const fillet1 = blendArray[Geometry_1.Geometry.modulo(iEdge + 1, n)];
+            if (cuspNeedsRemoval(iEdge, fillet0, fillet1)) {
+                const fillet0OvershootsEdge = filletOvershootsEdge(fillet0, 0);
+                const fillet1OvershootsEdge = filletOvershootsEdge(fillet1, 1);
+                // prefer to remove just one fillet
+                if (fillet0OvershootsEdge && !fillet1OvershootsEdge) {
+                    removeFillet(fillet0);
+                }
+                else if (!fillet0OvershootsEdge && fillet1OvershootsEdge) {
+                    removeFillet(fillet1);
+                }
+                else if (!fillet0OvershootsEdge && !fillet1OvershootsEdge) {
+                    removeFillet(fillet1); // fillets intersect (arbitrary choice)
+                }
+                else if (fillet1.fraction10 < fillet0.fraction12) {
+                    removeFillet(fillet0); // fillet1 yields smaller cusp segment
+                }
+                else {
+                    removeFillet(fillet1); // fillet0 yields smaller cusp segment, or they are equal (arbitrary choice)
+                }
+                // re-evaluate the edge after removal of a fillet; if a disallowed cusp persists, remove the other fillet
+                if (cuspNeedsRemoval(iEdge, fillet0, fillet1)) {
+                    removeFillet(fillet0);
+                    removeFillet(fillet1);
                 }
             }
         }
@@ -141,7 +163,7 @@ class CurveFactory {
             path.tryAddChild(b0.arc);
             if (i + 1 < n || filletClosure) {
                 const b1 = blendArray[Geometry_1.Geometry.modulo(i + 1, n)];
-                this.addPartialSegment(path, allowCusp, b0.point, b1.point, b0.fraction12, 1 - b1.fraction10);
+                this.addPartialSegment(path, cuspSegments, b0.point, b1.point, b0.fraction12, 1 - b1.fraction10);
             }
         }
         return path;