@itwin/core-geometry 5.12.0-dev.8 → 5.12.0

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,uDAAuD;IAChD,OAAO;QACZ,IAAI,CAAC,cAAc,EAAE,CAAC;QACtB,OAAO,IAAI,CAAC;IACd,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;AAlUD,0CAkUC;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  /** Call [[reverseInPlace]] and return the instance. */\n  public reverse(): this {\n    this.reverseInPlace();\n    return this;\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"]}

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

@@ -411,6 +411,8 @@ export declare abstract class CurvePrimitive extends GeometryQuery {
     getFractionToDistanceScale(): number | undefined;
     /** Reverse the curve's data so that its fractional stroking moves in the opposite direction. */
     abstract reverseInPlace(): void;
+    /** Call [[reverseInPlace]] and return the instance. */
+    reverse(): this;
     /**
      * Compute intersections of the curve with a plane.
      * * The intersections are appended to the result array.

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

@@ -1 +1 @@
-{"version":3,"file":"CurvePrimitive.d.ts","sourceRoot":"","sources":["../../../src/curve/CurvePrimitive.ts"],"names":[],"mappings":"AAQA,OAAO,EAAE,cAAc,EAAE,MAAM,+BAA+B,CAAC;AAC/D,OAAO,EAAuB,KAAK,sBAAsB,EAAE,MAAM,aAAa,CAAC;AAE/E,OAAO,EAAE,OAAO,EAAE,KAAK,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AACvE,OAAO,EAAE,KAAK,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AAC5D,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAC5C,OAAO,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AACpD,OAAO,EAAqB,mBAAmB,EAAqB,MAAM,uBAAuB,CAAC;AAClG,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAKhD,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAE9C,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,yBAAyB,CAAC;AAC5D,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,SAAS,CAAC;AACrC,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,0BAA0B,CAAC;AAC9D,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,yBAAyB,CAAC;AAC9D,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,uBAAuB,CAAC;AACrD,OAAO,KAAK,EAAE,2BAA2B,EAAE,MAAM,+BAA+B,CAAC;AACjF,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,yBAAyB,CAAC;AAC9D,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,6BAA6B,CAAC;AACtE,OAAO,KAAK,EAAE,oBAAoB,EAAE,MAAM,iCAAiC,CAAC;AAC5E,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,+BAA+B,CAAC;AACpE,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AACrD,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AACrD,OAAO,KAAK,EAAE,4BAA4B,EAAE,MAAM,4CAA4C,CAAC;AAC/F,OAAO,KAAK,EAAE,yBAAyB,EAAE,MAAM,yCAAyC,CAAC;AACzF,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AACrD,OAAO,KAAK,EAAE,2BAA2B,EAAE,MAAM,mBAAmB,CAAC;AAErE;;;;;;;;;;;;;;;GAeG;AACH,MAAM,MAAM,kBAAkB,GAAG,KAAK,GAAG,aAAa,GAAG,YAAY,GAAG,cAAc,GAAG,aAAa,GAAG,kBAAkB,GAAG,6BAA6B,GAAG,oBAAoB,GAAG,YAAY,CAAC;AAClM;;;;GAIG;AACH,MAAM,MAAM,iBAAiB,GAAG,KAAK,GAAG,aAAa,GAAG,YAAY,GAAG,cAAc,GAAG,aAAa,GAAG,cAAc,GAAG,kBAAkB,GAAG,2BAA2B,GAAG,oBAAoB,GAAG,YAAY,CAAC;AAChN;;;GAGG;AACH,MAAM,MAAM,oBAAoB,GAAG,aAAa,GAAG,YAAY,CAAC;AAChE;;;;GAIG;AACH,MAAM,MAAM,kCAAkC,GAAG,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,cAAc,KAAK,IAAI,CAAC;AACtG;;;GAGG;AACH,MAAM,MAAM,oBAAoB,GAAG,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,KAAK,IAAI,CAAC;AACpE;;GAEG;AACH,MAAM,MAAM,sBAAsB,GAAG,CAAC,EAAE,EAAE,cAAc,KAAK,IAAI,CAAC;AAElE;;;;GAIG;AACH,MAAM,WAAW,cAAc;IAC7B;;;OAGG;IACH,SAAS,CAAC,EAAE,OAAO,CAAC;IACpB;;;OAGG;IACH,WAAW,CAAC,EAAE,QAAQ,CAAC;IACvB,+DAA+D;IAC/D,aAAa,CAAC,EAAE,aAAa,CAAC;IAC9B;;;;OAIG;IACH,MAAM,CAAC,EAAE,2BAA2B,CAAC;IACrC;;;;;;OAMG;IACH,WAAW,CAAC,EAAE,MAAM,CAAC;CACtB;AAED;;;;;;;;;;;;;GAaG;AACH,8BAAsB,cAAe,SAAQ,aAAa;IACxD,wCAAwC;IACxC,SAAgB,gBAAgB,oBAAoB;IACpD,wCAAwC;IACxC,kBAAyB,kBAAkB,EAAE,kBAAkB,CAAC;IAChE,kBAAkB;IAClB,SAAS;IAGT;;OAEG;IACI,UAAU,CAAC,EAAE,cAAc,CAAC;IACnC;;;OAGG;IACI,QAAQ,CAAC,EAAE,mBAAmB,CAAC;IACtC;;;OAGG;IACI,MAAM,CAAC,EAAE,mBAAmB,CAAC;IACpC;;OAEG;IACI,MAAM,CAAC,EAAE,GAAG,CAAC;IACpB;;;;OAIG;aACa,eAAe,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,OAAO,GAAG,OAAO;IAC5E;;;;;;;OAOG;aACa,4BAA4B,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,KAAK,GAAG,KAAK;IACrF;;;;;OAKG;IACI,6BAA6B,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,KAAK,GAAG,KAAK;IAK7E;;;;OAIG;IACI,mBAAmB,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS;IAShE;;;;;;;;;OASG;aACa,8BAA8B,CAC5C,QAAQ,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,yBAAyB,GACnD,yBAAyB,GAAG,SAAS;IACxC;;;;;;OAMG;IACI,qBAAqB,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,SAAS,GAAG,SAAS,GAAG,SAAS;IAiBzF;;;;;OAKG;IACI,mCAAmC,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM;IAapE;;;;OAIG;IACI,mCAAmC,CAAC,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,OAAO;IAIvF;;;OAGG;IACI,WAAW,IAAI,MAAM;IAK5B;;;;;OAKG;IACI,2BAA2B,CAAC,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,MAAM;IAchF;;;OAGG;IACI,qBAAqB,CAAC,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,CAAC,EAAE,SAAS,GAAG,OAAO;IAGlG,2GAA2G;IACpG,4BAA4B,CAAC,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,CAAC,EAAE,SAAS,GAAG,OAAO;IAQzG;;;;;;;;;;;;;;;OAeG;IACI,4BAA4B,CACjC,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,SAAS,CAAC,EAAE,SAAS,EAAE,mBAAmB,GAAE,MAAY,GAC5G,OAAO;IAkCV;;;;;;;;;;;OAWG;IACI,2CAA2C,CAChD,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,EAAE,QAAQ,GAAE,MAAU,GAC9E,MAAM;IAUT;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;OAkCG;IACI,8BAA8B,CACnC,aAAa,EAAE,MAAM,EAAE,cAAc,EAAE,MAAM,EAAE,cAAc,EAAE,OAAO,EAAE,MAAM,CAAC,EAAE,mBAAmB,GACnG,mBAAmB;IAsBtB;;;;;;;;;;;;;;;;;OAiBG;IACH,SAAS,CAAC,qCAAqC,CAC7C,aAAa,EAAE,MAAM,EAAE,cAAc,EAAE,MAAM,EAAE,cAAc,EAAE,OAAO,EAAE,MAAM,CAAC,EAAE,mBAAmB,GACnG,mBAAmB;IA0EtB;;;;;;;;OAQG;IACH,IAAW,yBAAyB,IAAI,OAAO,CAE9C;IACD;;;;;;;;;;OAUG;aACa,WAAW,IAAI,MAAM;IACrC;;;;;;;;;OASG;IACI,YAAY,CACjB,UAAU,EAAE,OAAO,EAAE,MAAM,GAAE,2BAAmC,EAAE,MAAM,CAAC,EAAE,mBAAmB,GAC7F,mBAAmB,GAAG,SAAS;IAKlC;;;;;;;;;;OAUG;IACI,cAAc,CACnB,UAAU,EAAE,OAAO,EAAE,MAAM,GAAE,2BAAmC,EAAE,MAAM,CAAC,EAAE,mBAAmB,GAC7F,mBAAmB,GAAG,SAAS;IAKlC;;;;;;;;;;OAUG;IACI,YAAY,CACjB,UAAU,EAAE,OAAO,EAAE,eAAe,EAAE,CAAC,OAAO,EAAE,mBAAmB,KAAK,GAAG,EAAE,OAAO,CAAC,EAAE,cAAc,GACpG,IAAI;IAIP;;;;;;;OAOG;IACI,WAAW,CAAC,UAAU,EAAE,OAAO,EAAE,OAAO,CAAC,EAAE,cAAc,GAAG,mBAAmB,EAAE,GAAG,SAAS;IAKpG;;;;;;;OAOG;IACI,cAAc,CAAC,UAAU,EAAE,OAAO,EAAE,OAAO,CAAC,EAAE,cAAc,GAAG,mBAAmB,GAAG,SAAS;IAoBrG;;;;;;OAMG;IACI,qBAAqB,CAAC,OAAO,EAAE,OAAO,EAAE,QAAQ,CAAC,EAAE,kCAAkC,GAAG,OAAO;IAGtG,2BAA2B;aACF,KAAK,IAAI,cAAc;IAChD,uCAAuC;aACd,gBAAgB,CAAC,SAAS,EAAE,SAAS,GAAG,cAAc,GAAG,SAAS;IAC3F;;;;OAIG;IACI,iBAAiB,CAAC,UAAU,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,GAAG,cAAc,GAAG,SAAS;IAG5F;;;;;;;;;;;;OAYG;IACI,0BAA0B,IAAI,MAAM,GAAG,SAAS;IAGvD,gGAAgG;aAChF,cAAc,IAAI,IAAI;IACtC;;;;;;;;;;OAUG;IACI,6BAA6B,CAAC,KAAK,EAAE,sBAAsB,EAAE,MAAM,EAAE,mBAAmB,EAAE,GAAG,MAAM;IAM1G;;;;;;;;;OASG;WACW,sBAAsB,CAClC,OAAO,EAAE,mBAAmB,EAAE,EAC9B,WAAW,GAAE,OAAc,EAC3B,uBAAuB,GAAE,OAAe,EACxC,yBAAyB,SAA6B,EACtD,oBAAoB,SAA+B,GAClD,IAAI;IAyDP;;;OAGG;aACa,SAAS,CAAC,KAAK,EAAE,4BAA4B,GAAG,OAAO;IACvE,sGAAsG;IAC/F,UAAU,CAAC,MAAM,CAAC,EAAE,OAAO,GAAG,OAAO;IAG5C,qGAAqG;IAC9F,QAAQ,CAAC,MAAM,CAAC,EAAE,OAAO,GAAG,OAAO;IAG1C;;;;;OAKG;IACI,uBAAuB,CAAC,SAAS,GAAE,MAAqC,EAAE,MAAM,GAAE,OAAe,GAAG,OAAO;IAMlH,0DAA0D;aAC1C,WAAW,CAAC,IAAI,EAAE,YAAY,EAAE,OAAO,CAAC,EAAE,aAAa,GAAG,IAAI;IAC9E;;;OAGG;aACa,kBAAkB,CAAC,IAAI,EAAE,cAAc,EAAE,OAAO,CAAC,EAAE,aAAa,GAAG,IAAI;IACvF;;;;;OAKG;aACa,4BAA4B,CAAC,OAAO,CAAC,EAAE,aAAa,GAAG,MAAM;IAC7E;;;;;;;;;;;;OAYG;IACI,qCAAqC,CAAC,OAAO,CAAC,EAAE,aAAa,EAAE,SAAS,CAAC,EAAE,cAAc;IAQhG;;;;;;;;;;;OAWG;IACI,8BAA8B,CAAC,GAAG,EAAE,cAAc,EAAE,UAAU,EAAE,YAAY,GAAG,MAAM;IAU5F;;;;;OAKG;WACW,qBAAqB,CAAC,KAAK,EAAE,cAAc,EAAE,QAAQ,EAAE,cAAc,EAAE,SAAS,CAAC,EAAE,cAAc;IAK/G;;;;;;;;OAQG;IACI,wBAAwB,CAC7B,cAAc,EAAE,cAAc,EAAE,EAAE,2BAA2B,EAAE,OAAO,EAAE,mBAAmB,GAAE,OAAe,GAC3G,IAAI;IAGP;;;;;;;;OAQG;IACI,sBAAsB,CAC3B,cAAc,CAAC,EAAE,cAAc,EAAE,EAAE,0BAA0B,GAAE,OAAe,EAAE,kBAAkB,GAAE,OAAe,GAClH,cAAc,EAAE;IAKnB;;;;;;OAMG;aACa,iBAAiB,CAC/B,uBAAuB,EAAE,MAAM,GAAG,aAAa,GAC9C,cAAc,GAAG,cAAc,EAAE,GAAG,SAAS;IAEhD;;;;;;;OAOG;IACI,uBAAuB,CAAC,IAAI,EAAE,QAAQ,GAAG,KAAK,EAAE,QAAQ,CAAC,EAAE,OAAO,GAAG,OAAO,GAAG,SAAS;CAGhG"}
+{"version":3,"file":"CurvePrimitive.d.ts","sourceRoot":"","sources":["../../../src/curve/CurvePrimitive.ts"],"names":[],"mappings":"AAQA,OAAO,EAAE,cAAc,EAAE,MAAM,+BAA+B,CAAC;AAC/D,OAAO,EAAuB,KAAK,sBAAsB,EAAE,MAAM,aAAa,CAAC;AAE/E,OAAO,EAAE,OAAO,EAAE,KAAK,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AACvE,OAAO,EAAE,KAAK,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AAC5D,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAC5C,OAAO,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AACpD,OAAO,EAAqB,mBAAmB,EAAqB,MAAM,uBAAuB,CAAC;AAClG,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAKhD,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAE9C,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,yBAAyB,CAAC;AAC5D,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,SAAS,CAAC;AACrC,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,0BAA0B,CAAC;AAC9D,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,yBAAyB,CAAC;AAC9D,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,uBAAuB,CAAC;AACrD,OAAO,KAAK,EAAE,2BAA2B,EAAE,MAAM,+BAA+B,CAAC;AACjF,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,yBAAyB,CAAC;AAC9D,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,6BAA6B,CAAC;AACtE,OAAO,KAAK,EAAE,oBAAoB,EAAE,MAAM,iCAAiC,CAAC;AAC5E,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,+BAA+B,CAAC;AACpE,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AACrD,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AACrD,OAAO,KAAK,EAAE,4BAA4B,EAAE,MAAM,4CAA4C,CAAC;AAC/F,OAAO,KAAK,EAAE,yBAAyB,EAAE,MAAM,yCAAyC,CAAC;AACzF,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AACrD,OAAO,KAAK,EAAE,2BAA2B,EAAE,MAAM,mBAAmB,CAAC;AAErE;;;;;;;;;;;;;;;GAeG;AACH,MAAM,MAAM,kBAAkB,GAAG,KAAK,GAAG,aAAa,GAAG,YAAY,GAAG,cAAc,GAAG,aAAa,GAAG,kBAAkB,GAAG,6BAA6B,GAAG,oBAAoB,GAAG,YAAY,CAAC;AAClM;;;;GAIG;AACH,MAAM,MAAM,iBAAiB,GAAG,KAAK,GAAG,aAAa,GAAG,YAAY,GAAG,cAAc,GAAG,aAAa,GAAG,cAAc,GAAG,kBAAkB,GAAG,2BAA2B,GAAG,oBAAoB,GAAG,YAAY,CAAC;AAChN;;;GAGG;AACH,MAAM,MAAM,oBAAoB,GAAG,aAAa,GAAG,YAAY,CAAC;AAChE;;;;GAIG;AACH,MAAM,MAAM,kCAAkC,GAAG,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,cAAc,KAAK,IAAI,CAAC;AACtG;;;GAGG;AACH,MAAM,MAAM,oBAAoB,GAAG,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,KAAK,IAAI,CAAC;AACpE;;GAEG;AACH,MAAM,MAAM,sBAAsB,GAAG,CAAC,EAAE,EAAE,cAAc,KAAK,IAAI,CAAC;AAElE;;;;GAIG;AACH,MAAM,WAAW,cAAc;IAC7B;;;OAGG;IACH,SAAS,CAAC,EAAE,OAAO,CAAC;IACpB;;;OAGG;IACH,WAAW,CAAC,EAAE,QAAQ,CAAC;IACvB,+DAA+D;IAC/D,aAAa,CAAC,EAAE,aAAa,CAAC;IAC9B;;;;OAIG;IACH,MAAM,CAAC,EAAE,2BAA2B,CAAC;IACrC;;;;;;OAMG;IACH,WAAW,CAAC,EAAE,MAAM,CAAC;CACtB;AAED;;;;;;;;;;;;;GAaG;AACH,8BAAsB,cAAe,SAAQ,aAAa;IACxD,wCAAwC;IACxC,SAAgB,gBAAgB,oBAAoB;IACpD,wCAAwC;IACxC,kBAAyB,kBAAkB,EAAE,kBAAkB,CAAC;IAChE,kBAAkB;IAClB,SAAS;IAGT;;OAEG;IACI,UAAU,CAAC,EAAE,cAAc,CAAC;IACnC;;;OAGG;IACI,QAAQ,CAAC,EAAE,mBAAmB,CAAC;IACtC;;;OAGG;IACI,MAAM,CAAC,EAAE,mBAAmB,CAAC;IACpC;;OAEG;IACI,MAAM,CAAC,EAAE,GAAG,CAAC;IACpB;;;;OAIG;aACa,eAAe,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,OAAO,GAAG,OAAO;IAC5E;;;;;;;OAOG;aACa,4BAA4B,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,KAAK,GAAG,KAAK;IACrF;;;;;OAKG;IACI,6BAA6B,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,KAAK,GAAG,KAAK;IAK7E;;;;OAIG;IACI,mBAAmB,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS;IAShE;;;;;;;;;OASG;aACa,8BAA8B,CAC5C,QAAQ,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,yBAAyB,GACnD,yBAAyB,GAAG,SAAS;IACxC;;;;;;OAMG;IACI,qBAAqB,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,SAAS,GAAG,SAAS,GAAG,SAAS;IAiBzF;;;;;OAKG;IACI,mCAAmC,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM;IAapE;;;;OAIG;IACI,mCAAmC,CAAC,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,OAAO;IAIvF;;;OAGG;IACI,WAAW,IAAI,MAAM;IAK5B;;;;;OAKG;IACI,2BAA2B,CAAC,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,MAAM;IAchF;;;OAGG;IACI,qBAAqB,CAAC,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,CAAC,EAAE,SAAS,GAAG,OAAO;IAGlG,2GAA2G;IACpG,4BAA4B,CAAC,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,CAAC,EAAE,SAAS,GAAG,OAAO;IAQzG;;;;;;;;;;;;;;;OAeG;IACI,4BAA4B,CACjC,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,SAAS,CAAC,EAAE,SAAS,EAAE,mBAAmB,GAAE,MAAY,GAC5G,OAAO;IAkCV;;;;;;;;;;;OAWG;IACI,2CAA2C,CAChD,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,EAAE,QAAQ,GAAE,MAAU,GAC9E,MAAM;IAUT;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;OAkCG;IACI,8BAA8B,CACnC,aAAa,EAAE,MAAM,EAAE,cAAc,EAAE,MAAM,EAAE,cAAc,EAAE,OAAO,EAAE,MAAM,CAAC,EAAE,mBAAmB,GACnG,mBAAmB;IAsBtB;;;;;;;;;;;;;;;;;OAiBG;IACH,SAAS,CAAC,qCAAqC,CAC7C,aAAa,EAAE,MAAM,EAAE,cAAc,EAAE,MAAM,EAAE,cAAc,EAAE,OAAO,EAAE,MAAM,CAAC,EAAE,mBAAmB,GACnG,mBAAmB;IA0EtB;;;;;;;;OAQG;IACH,IAAW,yBAAyB,IAAI,OAAO,CAE9C;IACD;;;;;;;;;;OAUG;aACa,WAAW,IAAI,MAAM;IACrC;;;;;;;;;OASG;IACI,YAAY,CACjB,UAAU,EAAE,OAAO,EAAE,MAAM,GAAE,2BAAmC,EAAE,MAAM,CAAC,EAAE,mBAAmB,GAC7F,mBAAmB,GAAG,SAAS;IAKlC;;;;;;;;;;OAUG;IACI,cAAc,CACnB,UAAU,EAAE,OAAO,EAAE,MAAM,GAAE,2BAAmC,EAAE,MAAM,CAAC,EAAE,mBAAmB,GAC7F,mBAAmB,GAAG,SAAS;IAKlC;;;;;;;;;;OAUG;IACI,YAAY,CACjB,UAAU,EAAE,OAAO,EAAE,eAAe,EAAE,CAAC,OAAO,EAAE,mBAAmB,KAAK,GAAG,EAAE,OAAO,CAAC,EAAE,cAAc,GACpG,IAAI;IAIP;;;;;;;OAOG;IACI,WAAW,CAAC,UAAU,EAAE,OAAO,EAAE,OAAO,CAAC,EAAE,cAAc,GAAG,mBAAmB,EAAE,GAAG,SAAS;IAKpG;;;;;;;OAOG;IACI,cAAc,CAAC,UAAU,EAAE,OAAO,EAAE,OAAO,CAAC,EAAE,cAAc,GAAG,mBAAmB,GAAG,SAAS;IAoBrG;;;;;;OAMG;IACI,qBAAqB,CAAC,OAAO,EAAE,OAAO,EAAE,QAAQ,CAAC,EAAE,kCAAkC,GAAG,OAAO;IAGtG,2BAA2B;aACF,KAAK,IAAI,cAAc;IAChD,uCAAuC;aACd,gBAAgB,CAAC,SAAS,EAAE,SAAS,GAAG,cAAc,GAAG,SAAS;IAC3F;;;;OAIG;IACI,iBAAiB,CAAC,UAAU,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,GAAG,cAAc,GAAG,SAAS;IAG5F;;;;;;;;;;;;OAYG;IACI,0BAA0B,IAAI,MAAM,GAAG,SAAS;IAGvD,gGAAgG;aAChF,cAAc,IAAI,IAAI;IACtC,uDAAuD;IAChD,OAAO,IAAI,IAAI;IAItB;;;;;;;;;;OAUG;IACI,6BAA6B,CAAC,KAAK,EAAE,sBAAsB,EAAE,MAAM,EAAE,mBAAmB,EAAE,GAAG,MAAM;IAM1G;;;;;;;;;OASG;WACW,sBAAsB,CAClC,OAAO,EAAE,mBAAmB,EAAE,EAC9B,WAAW,GAAE,OAAc,EAC3B,uBAAuB,GAAE,OAAe,EACxC,yBAAyB,SAA6B,EACtD,oBAAoB,SAA+B,GAClD,IAAI;IAyDP;;;OAGG;aACa,SAAS,CAAC,KAAK,EAAE,4BAA4B,GAAG,OAAO;IACvE,sGAAsG;IAC/F,UAAU,CAAC,MAAM,CAAC,EAAE,OAAO,GAAG,OAAO;IAG5C,qGAAqG;IAC9F,QAAQ,CAAC,MAAM,CAAC,EAAE,OAAO,GAAG,OAAO;IAG1C;;;;;OAKG;IACI,uBAAuB,CAAC,SAAS,GAAE,MAAqC,EAAE,MAAM,GAAE,OAAe,GAAG,OAAO;IAMlH,0DAA0D;aAC1C,WAAW,CAAC,IAAI,EAAE,YAAY,EAAE,OAAO,CAAC,EAAE,aAAa,GAAG,IAAI;IAC9E;;;OAGG;aACa,kBAAkB,CAAC,IAAI,EAAE,cAAc,EAAE,OAAO,CAAC,EAAE,aAAa,GAAG,IAAI;IACvF;;;;;OAKG;aACa,4BAA4B,CAAC,OAAO,CAAC,EAAE,aAAa,GAAG,MAAM;IAC7E;;;;;;;;;;;;OAYG;IACI,qCAAqC,CAAC,OAAO,CAAC,EAAE,aAAa,EAAE,SAAS,CAAC,EAAE,cAAc;IAQhG;;;;;;;;;;;OAWG;IACI,8BAA8B,CAAC,GAAG,EAAE,cAAc,EAAE,UAAU,EAAE,YAAY,GAAG,MAAM;IAU5F;;;;;OAKG;WACW,qBAAqB,CAAC,KAAK,EAAE,cAAc,EAAE,QAAQ,EAAE,cAAc,EAAE,SAAS,CAAC,EAAE,cAAc;IAK/G;;;;;;;;OAQG;IACI,wBAAwB,CAC7B,cAAc,EAAE,cAAc,EAAE,EAAE,2BAA2B,EAAE,OAAO,EAAE,mBAAmB,GAAE,OAAe,GAC3G,IAAI;IAGP;;;;;;;;OAQG;IACI,sBAAsB,CAC3B,cAAc,CAAC,EAAE,cAAc,EAAE,EAAE,0BAA0B,GAAE,OAAe,EAAE,kBAAkB,GAAE,OAAe,GAClH,cAAc,EAAE;IAKnB;;;;;;OAMG;aACa,iBAAiB,CAC/B,uBAAuB,EAAE,MAAM,GAAG,aAAa,GAC9C,cAAc,GAAG,cAAc,EAAE,GAAG,SAAS;IAEhD;;;;;;;OAOG;IACI,uBAAuB,CAAC,IAAI,EAAE,QAAQ,GAAG,KAAK,EAAE,QAAQ,CAAC,EAAE,OAAO,GAAG,OAAO,GAAG,SAAS;CAGhG"}

package/lib/cjs/curve/CurvePrimitive.js

@@ -528,6 +528,11 @@ class CurvePrimitive extends GeometryQuery_1.GeometryQuery {
     getFractionToDistanceScale() {
         return undefined;
     }
+    /** Call [[reverseInPlace]] and return the instance. */
+    reverse() {
+        this.reverseInPlace();
+        return this;
+    }
     /**
      * Compute intersections of the curve with a plane.
      * * The intersections are appended to the result array.

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

@@ -1 +1 @@
-{"version":3,"file":"CurvePrimitive.js","sourceRoot":"","sources":["../../../src/curve/CurvePrimitive.ts"],"names":[],"mappings":";;;AAAA;;;+FAG+F;AAC/F;;GAEG;AACH,sDAA6C;AAC7C,kEAA+D;AAC/D,0CAA+E;AAC/E,qDAAkD;AAClD,mEAAuE;AACvE,+CAA4D;AAC5D,+CAA4C;AAC5C,uDAAoD;AACpD,+DAAkG;AAClG,mDAAgD;AAChD,kHAA+G;AAC/G,4FAAyF;AACzF,kGAA+F;AAC/F,8EAA2E;AAkG3E;;;;;;;;;;;;;GAaG;AACH,MAAsB,cAAe,SAAQ,6BAAa;IACxD,wCAAwC;IACxB,gBAAgB,GAAG,gBAAgB,CAAC;IAGpD,kBAAkB;IAClB;QACE,KAAK,EAAE,CAAC;IACV,CAAC;IACD;;OAEG;IACI,UAAU,CAAkB;IACnC;;;OAGG;IACI,QAAQ,CAAuB;IACtC;;;OAGG;IACI,MAAM,CAAuB;IACpC;;OAEG;IACI,MAAM,CAAO;IAgBpB;;;;;OAKG;IACI,6BAA6B,CAAC,QAAgB,EAAE,MAAc;QACnE,MAAM,GAAG,GAAG,IAAI,CAAC,4BAA4B,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;QAChE,GAAG,CAAC,+BAA+B,CAAC,GAAG,CAAC,CAAC;QACzC,OAAO,GAAG,CAAC;IACb,CAAC;IACD;;;;OAIG;IACI,mBAAmB,CAAC,QAAgB;QACzC,MAAM,IAAI,GAAG,IAAI,CAAC,8BAA8B,CAAC,QAAQ,CAAC,CAAC;QAC3D,IAAI,CAAC,IAAI;YACP,OAAO,SAAS,CAAC;QACnB,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,YAAY,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACtD,MAAM,CAAC,GAAG,KAAK,CAAC,SAAS,EAAE,CAAC;QAC5B,MAAM,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,SAAS,EAAE,CAAC;QACnC,OAAO,mBAAQ,CAAC,yBAAyB,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;IAC1D,CAAC;IAcD;;;;;;OAMG;IACI,qBAAqB,CAAC,QAAgB,EAAE,MAAkB;QAC/D,MAAM,KAAK,GAAG,IAAI,CAAC,8BAA8B,CAAC,QAAQ,CAAC,CAAC;QAC5D,IAAI,CAAC,KAAK;YACR,OAAO,SAAS,CAAC;QACnB,6FAA6F;QAC7F,kFAAkF;QAClF,IAAI,IAAI,GAAG,mBAAQ,CAAC,sBAAsB,CAAC,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC,OAAO,EAAE,oBAAS,CAAC,GAAG,CAAC,CAAC;QACxF,IAAI,IAAI;YACN,OAAO,qBAAS,CAAC,UAAU,CAAC,KAAK,CAAC,MAAM,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC;QAC1D,qGAAqG;QACrG,oGAAoG;QACpG,MAAM,UAAU,GAAG,mBAAQ,CAAC,qCAAqC,CAAC,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC;QAChG,IAAI,GAAG,mBAAQ,CAAC,sBAAsB,CAAC,KAAK,CAAC,OAAO,EAAE,UAAU,EAAE,oBAAS,CAAC,GAAG,CAAC,CAAC;QACjF,IAAI,IAAI;YACN,OAAO,qBAAS,CAAC,UAAU,CAAC,KAAK,CAAC,MAAM,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC;QAC1D,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;OAKG;IACI,mCAAmC,CAAC,QAAgB;QACzD,MAAM,KAAK,GAAG,IAAI,CAAC,8BAA8B,CAAC,QAAQ,CAAC,CAAC;QAC5D,IAAI,CAAC,KAAK;YACR,OAAO,GAAG,CAAC;QACb,MAAM,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,cAAc,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;QAC1D,MAAM,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC,SAAS,EAAE,CAAC;QACpC,IAAI,CAAC,KAAK,GAAG;YACX,OAAO,GAAG,CAAC;QACb,MAAM,CAAC,GAAG,mBAAQ,CAAC,2BAA2B,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC;QACjE,IAAI,CAAC,KAAK,SAAS;YACjB,OAAO,CAAC,CAAC;QACX,OAAO,GAAG,CAAC;IACb,CAAC;IACD;;;;OAIG;IACI,mCAAmC,CAAC,QAAgB,EAAE,QAAgB;QAC3E,MAAM,GAAG,GAAG,IAAI,CAAC,6BAA6B,CAAC,QAAQ,CAAC,CAAC;QACzD,OAAO,GAAG,CAAC,eAAe,CAAC,QAAQ,CAAC,CAAC;IACvC,CAAC;IACD;;;OAGG;IACI,WAAW;QAChB,MAAM,OAAO,GAAG,IAAI,uCAAkB,EAAE,CAAC;QACzC,IAAI,CAAC,kBAAkB,CAAC,OAAO,CAAC,CAAC;QACjC,OAAO,OAAO,CAAC,MAAM,EAAE,CAAC;IAC1B,CAAC;IACD;;;;;OAKG;IACI,2BAA2B,CAAC,SAAiB,EAAE,SAAiB;QACrE,IAAI,SAAS,KAAK,SAAS;YACzB,OAAO,GAAG,CAAC;QACb,MAAM,KAAK,GAAG,IAAI,CAAC,0BAA0B,EAAE,CAAC;QAChD,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACxB,0DAA0D;YAC1D,mDAAmD;YACnD,MAAM,WAAW,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;YACvC,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,SAAS,GAAG,SAAS,CAAC,GAAG,WAAW,CAAC,CAAC;QACzD,CAAC;QACD,MAAM,OAAO,GAAG,IAAI,uCAAkB,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;QAC7D,IAAI,CAAC,kBAAkB,CAAC,OAAO,CAAC,CAAC;QACjC,OAAO,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;IACpC,CAAC;IACD;;;OAGG;IACI,qBAAqB,CAAC,SAAiB,EAAE,SAAiB,EAAE,SAAqB;QACtF,OAAO,IAAI,CAAC,4BAA4B,CAAC,SAAS,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC;IAC5E,CAAC;IACD,2GAA2G;IACpG,4BAA4B,CAAC,SAAiB,EAAE,SAAiB,EAAE,SAAqB;QAC7F,IAAI,SAAS,KAAK,SAAS;YACzB,OAAO,eAAO,CAAC,MAAM,CAAC,IAAI,CAAC,eAAe,CAAC,SAAS,CAAC,CAAC,CAAC;QACzD,MAAM,QAAQ,GAAG,IAAI,CAAC,iBAAiB,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;QAC9D,IAAI,QAAQ;YACV,OAAO,QAAQ,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;QACnC,OAAO,eAAO,CAAC,UAAU,EAAE,CAAC;IAC9B,CAAC;IACD;;;;;;;;;;;;;;;OAeG;IACI,4BAA4B,CACjC,SAAiB,EAAE,SAAiB,EAAE,KAAa,EAAE,SAAqB,EAAE,sBAA8B,GAAG;QAE7G,MAAM,KAAK,GAAG,eAAO,CAAC,UAAU,EAAE,CAAC;QACnC,MAAM,SAAS,GAAG,yBAAO,CAAC,MAAM,EAAE,CAAC;QACnC,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC,CAAC;QAC9C,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC;QAC5C,6DAA6D;QAC7D,MAAM,aAAa,GAAG,CAAC,SAAiB,EAAE,YAAoB,EAAE,MAAc,EAAE,EAAE;YAChF,IAAI,CAAC,GAAG,SAAS,CAAC;YAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,YAAY,EAAE,CAAC;gBACnD,IAAI,CAAC,eAAe,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;gBACnC,IAAI,SAAS;oBACX,KAAK,CAAC,sBAAsB,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;;oBAEnD,KAAK,CAAC,WAAW,CAAC,SAAS,CAAC,CAAC;YACjC,CAAC;QACH,CAAC,CAAC;QACF,MAAM,aAAa,GAAG,KAAK,GAAG,CAAC,CAAC;QAChC,IAAI,aAAa,GAAG,CAAC,EAAE,CAAC;YACtB,MAAM,cAAc,GAAG,GAAG,GAAG,CAAC,aAAa,GAAG,CAAC,CAAC,CAAC;YACjD,MAAM,kBAAkB,GAAG,cAAc,GAAG,CAAC,SAAS,GAAG,SAAS,CAAC,CAAC;YACpE,aAAa,CAAC,SAAS,GAAG,kBAAkB,EAAE,kBAAkB,EAAE,aAAa,CAAC,CAAC;QACnF,CAAC;QACD,IAAI,mBAAmB,GAAG,GAAG,EAAE,CAAC;YAC9B,2GAA2G;YAC3G,qEAAqE;YACrE,MAAM,SAAS,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;YAChC,MAAM,cAAc,GAAG,aAAa,GAAG,CAAC,CAAC;YACzC,MAAM,cAAc,GAAG,GAAG,GAAG,cAAc,CAAC,CAAE,qCAAqC;YACnF,MAAM,kBAAkB,GAAG,CAAC,GAAG,cAAc,GAAG,CAAC,SAAS,GAAG,SAAS,CAAC,CAAC,CAAC,gEAAgE;YACzI,aAAa,CAAC,SAAS,GAAG,kBAAkB,GAAG,GAAG,EAAE,kBAAkB,EAAE,cAAc,CAAC,CAAC;YACxF,KAAK,CAAC,gBAAgB,CAAC,SAAS,EAAE,mBAAmB,CAAC,CAAC;QACzD,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;;;;;;;OAWG;IACI,2CAA2C,CAChD,SAAiB,EAAE,SAAiB,EAAE,WAAmB,EAAE,WAAmB,CAAC;QAE/E,IAAI,SAAS,GAAG,SAAS,EAAE,CAAC;YAC1B,MAAM,KAAK,GAAG,SAAS,CAAC;YACxB,SAAS,GAAG,SAAS,CAAC;YACtB,SAAS,GAAG,KAAK,CAAC;QACpB,CAAC;QACD,MAAM,OAAO,GAAG,IAAI,uCAAkB,CAAC,SAAS,EAAE,SAAS,EAAE,QAAQ,CAAC,CAAC;QACvE,OAAO,CAAC,qCAAqC,CAAC,IAAI,EAAE,WAAW,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC;QACvF,OAAO,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;IACpC,CAAC;IACD;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;OAkCG;IACI,8BAA8B,CACnC,aAAqB,EAAE,cAAsB,EAAE,cAAuB,EAAE,MAA4B;QAEpG,MAAM,KAAK,GAAG,IAAI,CAAC,0BAA0B,EAAE,CAAC;QAChD,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACxB,2DAA2D;YAC3D,mDAAmD;YACnD,MAAM,WAAW,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;YACvC,MAAM,kBAAkB,GAAG,mBAAQ,CAAC,yBAAyB,CAAC,cAAc,EAAE,WAAW,CAAC,CAAC;YAC3F,IAAI,kBAAkB,KAAK,SAAS,EAAE,CAAC;gBACrC,OAAO,yCAAmB,CAAC,iDAAiD,CAC1E,IAAI,EAAE,aAAa,EAAE,IAAI,CAAC,eAAe,CAAC,aAAa,CAAC,EAAE,GAAG,EAAE,uCAAiB,CAAC,KAAK,CAAC,CAAC;YAC5F,CAAC;YACD,OAAO,yCAAmB,CAAC,mCAAmC,CAC5D,cAAc,EACd,IAAI,EACJ,aAAa,EACb,aAAa,GAAG,kBAAkB,EAClC,cAAc,EACd,MAAM,CACP,CAAC;QACJ,CAAC;QACD,OAAO,IAAI,CAAC,qCAAqC,CAAC,aAAa,EAAE,cAAc,EAAE,cAAc,EAAE,MAAM,CAAC,CAAC;IAC3G,CAAC;IACD;;;;;;;;;;;;;;;;;OAiBG;IACO,qCAAqC,CAC7C,aAAqB,EAAE,cAAsB,EAAE,cAAuB,EAAE,MAA4B;QAEpG,IAAI,aAAqB,CAAC;QAC1B,MAAM,aAAa,GAAG,GAAG,CAAC,CAAE,qEAAqE;QACjG,IAAI,cAAc,KAAK,GAAG;YACxB,OAAO,yCAAmB,CAAC,4BAA4B,CAAC,IAAI,EAAE,aAAa,EAAE,MAAM,CAAC,CAAC,CAAC,8CAA8C;QACtI,IAAI,cAAc,GAAG,GAAG,EAAE,CAAC;YACzB,aAAa,GAAG,GAAG,CAAC;YACpB,IAAI,aAAa,IAAI,GAAG,EAAE,CAAC;gBACzB,MAAM,gBAAgB,GAAG,GAAG,GAAG,aAAa,CAAC;gBAC7C,cAAc,IAAI,IAAI,CAAC,2BAA2B,CAAC,gBAAgB,EAAE,aAAa,CAAC,CAAC;gBACpF,aAAa,GAAG,gBAAgB,CAAC;YACnC,CAAC;QACH,CAAC;aAAM,CAAC,CAAC,uBAAuB;YAC9B,aAAa,GAAG,GAAG,CAAC;YACpB,IAAI,aAAa,IAAI,GAAG,EAAE,CAAC;gBACzB,MAAM,gBAAgB,GAAG,GAAG,GAAG,aAAa,CAAC;gBAC7C,cAAc,IAAI,IAAI,CAAC,2BAA2B,CAAC,aAAa,EAAE,gBAAgB,CAAC,CAAC;gBACpF,aAAa,GAAG,gBAAgB,CAAC;YACnC,CAAC;QACH,CAAC;QACD,MAAM,eAAe,GAAG,IAAI,CAAC,2BAA2B,CAAC,aAAa,EAAE,aAAa,CAAC,CAAC;QACvF,IAAA,qBAAM,EAAC,eAAe,GAAG,GAAG,CAAC,CAAC;QAC9B,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC;QAC7C,IAAI,eAAe,GAAG,WAAW,IAAI,CAAC,cAAc;YAClD,OAAO,yCAAmB,CAAC,mCAAmC,CAAC,cAAc,EAAE,IAAI,EAAE,aAAa,EAAE,aAAa,EAAE,cAAc,EAAE,MAAM,CAAC,CAAC;QAE7I,MAAM,YAAY,GAAG,mBAAQ,CAAC,2BAA2B,CAAC,WAAW,EAAE,eAAe,CAAC,CAAC;QACxF,IAAI,SAAS,KAAK,YAAY,EAAE,CAAC;YAC/B,uBAAuB;YACvB,MAAM,GAAG,yCAAmB,CAAC,4BAA4B,CAAC,IAAI,EAAE,aAAa,EAAE,MAAM,CAAC,CAAC;YACvF,MAAM,CAAC,iBAAiB,GAAG,uCAAiB,CAAC,KAAK,CAAC;YACnD,OAAO,MAAM,CAAC;QAChB,CAAC;QACD,MAAM,eAAe,GAAG,cAAc,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;QAC1D,IAAI,SAAS,GAAG,mBAAQ,CAAC,WAAW,CAAC,aAAa,EAAE,YAAY,EAAE,aAAa,CAAC,CAAC;QACjF,IAAI,SAAS,GAAG,aAAa,CAAC;QAC9B,IAAI,SAAS,GAAG,GAAG,CAAC;QACpB,MAAM,GAAG,GAAG,OAAO,GAAG,eAAe,CAAC;QACtC,IAAI,YAAY,GAAG,CAAC,CAAC;QACrB,MAAM,OAAO,GAAG,aAAK,CAAC,WAAW,EAAE,CAAC;QACpC,sBAAsB;QACtB,qHAAqH;QACrH,wDAAwD;QACxD,qCAAqC;QACrC,KAAK,IAAI,UAAU,GAAG,CAAC,EAAE,UAAU,GAAG,EAAE,EAAE,UAAU,EAAE,EAAE,CAAC;YACvD,MAAM,UAAU,GAAG,IAAI,CAAC,2BAA2B,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;YAC1E,MAAM,WAAW,GAAG,SAAS,GAAG,SAAS,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC;YAC/E,MAAM,UAAU,GAAG,SAAS,GAAG,WAAW,GAAG,UAAU,CAAC;YACxD,MAAM,aAAa,GAAG,WAAW,GAAG,UAAU,CAAC;YAC/C,IAAI,IAAI,CAAC,GAAG,CAAC,aAAa,CAAC,GAAG,GAAG,EAAE,CAAC;gBAClC,YAAY,EAAE,CAAC;gBACf,IAAI,YAAY,GAAG,CAAC;oBAClB,MAAM;YACV,CAAC;iBAAM,CAAC;gBACN,YAAY,GAAG,CAAC,CAAC;YACnB,CAAC;YACD,IAAI,CAAC,4BAA4B,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;YACtD,MAAM,gBAAgB,GAAG,OAAO,CAAC,SAAS,CAAC,SAAS,EAAE,CAAC;YACvD,SAAS,GAAG,SAAS,CAAC;YACtB,SAAS,GAAG,SAAS,GAAG,eAAe,GAAG,aAAa,GAAG,gBAAgB,CAAC;YAC3E,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC,CAAC,mHAAmH;gBAChJ,YAAY,GAAG,GAAG,CAAC;gBACnB,MAAM;YACR,CAAC;YACD,SAAS,GAAG,UAAU,CAAC;QACzB,CAAC;QACD,IAAI,YAAY,GAAG,CAAC;YAClB,OAAO,yCAAmB,CAAC,mCAAmC,CAC5D,cAAc,EAAE,IAAI,EAAE,aAAa,EAAE,SAAS,EAAE,cAAc,EAAE,MAAM,CACvE,CAAC;QACJ,MAAM,GAAG,yCAAmB,CAAC,4BAA4B,CAAC,IAAI,EAAE,aAAa,EAAE,MAAM,CAAC,CAAC;QACvF,MAAM,CAAC,iBAAiB,GAAG,uCAAiB,CAAC,KAAK,CAAC;QACnD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;;;;OAQG;IACH,IAAW,yBAAyB;QAClC,OAAO,KAAK,CAAC;IACf,CAAC;IAaD;;;;;;;;;OASG;IACI,YAAY,CACjB,UAAmB,EAAE,SAAsC,KAAK,EAAE,MAA4B;QAE9F,MAAM,aAAa,GAAG,IAAI,qDAAyB,CAAC,UAAU,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;QAChF,IAAI,CAAC,kBAAkB,CAAC,aAAa,CAAC,CAAC;QACvC,OAAO,aAAa,CAAC,WAAW,EAAE,CAAC;IACrC,CAAC;IACD;;;;;;;;;;OAUG;IACI,cAAc,CACnB,UAAmB,EAAE,SAAsC,KAAK,EAAE,MAA4B;QAE9F,MAAM,aAAa,GAAG,IAAI,qDAAyB,CAAC,UAAU,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;QACtF,IAAI,CAAC,kBAAkB,CAAC,aAAa,CAAC,CAAC;QACvC,OAAO,aAAa,CAAC,WAAW,EAAE,CAAC;IACrC,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,CAAC,kBAAkB,CAAC,aAAa,EAAE,OAAO,EAAE,aAAa,CAAC,CAAC;IACjE,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;;;;;;OAMG;IACI,qBAAqB,CAAC,OAAgB,EAAE,QAA6C;QAC1F,OAAO,OAAO,CAAC,6BAA6B,EAAE,CAAC,IAAI,EAAE,QAAQ,CAAC,IAAI,KAAK,CAAC;IAC1E,CAAC;IAKD;;;;OAIG;IACI,iBAAiB,CAAC,UAAkB,EAAE,UAAkB;QAC7D,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;;;;;;;OAYG;IACI,0BAA0B;QAC/B,OAAO,SAAS,CAAC;IACnB,CAAC;IAGD;;;;;;;;;;OAUG;IACI,6BAA6B,CAAC,KAA6B,EAAE,MAA6B;QAC/F,MAAM,aAAa,GAAG,IAAI,2EAAoC,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QAC9E,MAAM,EAAE,GAAG,MAAM,CAAC,MAAM,CAAC;QACzB,IAAI,CAAC,kBAAkB,CAAC,aAAa,CAAC,CAAC;QACvC,OAAO,MAAM,CAAC,MAAM,GAAG,EAAE,CAAC;IAC5B,CAAC;IACD;;;;;;;;;OASG;IACI,MAAM,CAAC,sBAAsB,CAClC,OAA8B,EAC9B,cAAuB,IAAI,EAC3B,0BAAmC,KAAK,EACxC,yBAAyB,GAAG,mBAAQ,CAAC,iBAAiB,EACtD,oBAAoB,GAAG,mBAAQ,CAAC,mBAAmB;QAEnD,MAAM,EAAE,GAAG,OAAO,CAAC,MAAM,CAAC;QAC1B,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,MAAM,MAAM,GAAG,yBAAO,CAAC,MAAM,EAAE,CAAC;QAChC,MAAM,MAAM,GAAG,yBAAO,CAAC,MAAM,EAAE,CAAC;QAChC,IAAI,kBAAuC,CAAC;QAC5C,KAAK,IAAI,cAAc,GAAG,CAAC,EAAE,cAAc,GAAG,EAAE,EAAE,cAAc,EAAE,EAAE,CAAC;YACnE,kBAAkB,GAAG,SAAS,CAAC;YAC/B,MAAM,MAAM,GAAG,OAAO,CAAC,cAAc,CAAC,CAAC;YACvC,IAAI,QAAQ,GAAG,MAAM,CAAC,QAAQ,CAAC;YAC/B,IAAI,MAAM,GAAG,WAAW,IAAI,mBAAQ,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;YACtD,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC;gBACjB,MAAM,CAAC,KAAK,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;gBAChC,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;YAChC,CAAC;YACD,IAAI,yBAAyB,GAAG,CAAC,EAAE,CAAC;gBAClC,IAAI,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,yBAAyB,EAAE,CAAC;oBACnD,QAAQ,GAAG,GAAG,CAAC;oBACf,MAAM,GAAG,IAAI,CAAC;oBACd,MAAM,CAAC,YAAY,GAAG,uCAAiB,CAAC,gBAAgB,CAAC;oBACzD,kBAAkB,GAAG,MAAM,CAAC;gBAC9B,CAAC;gBACD,IAAI,IAAI,CAAC,GAAG,CAAC,QAAQ,GAAG,GAAG,CAAC,GAAG,yBAAyB,EAAE,CAAC;oBACzD,QAAQ,GAAG,GAAG,CAAC;oBACf,MAAM,GAAG,IAAI,CAAC;oBACd,MAAM,CAAC,YAAY,GAAG,uCAAiB,CAAC,gBAAgB,CAAC;oBACzD,kBAAkB,GAAG,MAAM,CAAC;oBAC5B,IAAI,MAAM,CAAC,KAAK;wBACd,kBAAkB,GAAG,MAAM,CAAC,KAAK,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;gBACzD,CAAC;YACH,CAAC;YACD,IAAI,oBAAoB,GAAG,CAAC,IAAI,MAAM,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;gBAC3D,wKAAwK;gBACxK,IAAI,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,oBAAoB,EAAE,CAAC;oBAC1D,QAAQ,GAAG,GAAG,CAAC;oBACf,MAAM,CAAC,YAAY,GAAG,uCAAiB,CAAC,gBAAgB,CAAC;oBACzD,kBAAkB,GAAG,MAAM,CAAC;gBAC9B,CAAC;qBAAM,IAAI,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,oBAAoB,EAAE,CAAC;oBACjE,QAAQ,GAAG,GAAG,CAAC;oBACf,MAAM,CAAC,YAAY,GAAG,uCAAiB,CAAC,gBAAgB,CAAC;oBACzD,kBAAkB,GAAG,MAAM,CAAC;gBAC9B,CAAC;YACH,CAAC;YACD,IAAI,MAAM,EAAE,CAAC;gBACX,IAAI,uBAAuB,EAAE,CAAC;oBAC5B,MAAM,CAAC,QAAQ,GAAG,QAAQ,CAAC;oBAC3B,IAAI,kBAAkB,KAAK,SAAS;wBAClC,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,kBAAkB,CAAC,CAAC;gBAC7C,CAAC;gBACD,IAAI,WAAW,GAAG,cAAc;oBAC9B,OAAO,CAAC,WAAW,CAAC,GAAG,MAAM,CAAC;gBAChC,WAAW,EAAE,CAAC;YAChB,CAAC;QACH,CAAC;QACD,IAAI,WAAW,GAAG,EAAE;YAClB,OAAO,CAAC,MAAM,GAAG,WAAW,CAAC;IACjC,CAAC;IAMD,sGAAsG;IAC/F,UAAU,CAAC,MAAgB;QAChC,OAAO,IAAI,CAAC,eAAe,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;IAC3C,CAAC;IACD,qGAAqG;IAC9F,QAAQ,CAAC,MAAgB;QAC9B,OAAO,IAAI,CAAC,eAAe,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;IAC3C,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;IAgBD;;;;;;;;;;;;OAYG;IACI,qCAAqC,CAAC,OAAuB,EAAE,SAA0B;QAC9F,MAAM,CAAC,GAAG,IAAI,CAAC,4BAA4B,CAAC,OAAO,CAAC,CAAC;QACrD,MAAM,CAAC,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;QAC7B,cAAc,CAAC,qBAAqB,CAClC,IAAI,EACJ,+BAAc,CAAC,wBAAwB,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EACzD,SAAS,CAAC,CAAC;IACf,CAAC;IACD;;;;;;;;;;;OAWG;IACI,8BAA8B,CAAC,GAAmB,EAAE,UAAwB;QACjF,MAAM,SAAS,GAAG,UAAU,CAAC,SAAS,EAAE,CAAC;QACzC,IAAI,GAAG,CAAC,SAAS,IAAI,GAAG,CAAC,SAAS,KAAK,IAAI,IAAI,GAAG,CAAC,SAAS,GAAG,CAAC,EAAE,CAAC;YACjE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,GAAG,CAAC,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;gBACxC,MAAM,QAAQ,GAAG,CAAC,GAAG,GAAG,CAAC,SAAS,CAAC;gBACnC,UAAU,CAAC,qBAAqB,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;YACnD,CAAC;QACH,CAAC;QACD,OAAO,UAAU,CAAC,SAAS,EAAE,GAAG,SAAS,CAAC;IAC5C,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,qBAAqB,CAAC,KAAqB,EAAE,QAAwB,EAAE,SAA0B;QAC7G,IAAI,SAAS;YACX,SAAS,CAAC,mBAAmB,CAAC,QAAQ,CAAC,SAAS,EAAE,QAAQ,CAAC,WAAW,CAAC,CAAC;QAC1E,KAAK,CAAC,UAAU,GAAG,QAAQ,CAAC;IAC9B,CAAC;IACD;;;;;;;;OAQG;IACI,wBAAwB,CAC7B,cAAgC,EAAE,2BAAoC,EAAE,sBAA+B,KAAK;QAE5G,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC5B,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;IAYD;;;;;;;OAOG;IACI,uBAAuB,CAAC,IAAsB,EAAE,QAAkB;QACvE,OAAO,SAAS,CAAC,CAAC,6EAA6E;IACjG,CAAC;CACF;AA9xBD,wCA8xBC","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 */\nimport { assert } from \"@itwin/core-bentley\";\nimport { StrokeCountMap } from \"../curve/Query/StrokeCountMap\";\nimport { AxisOrder, Geometry, type PlaneAltitudeEvaluator } from \"../Geometry\";\nimport { Matrix3d } from \"../geometry3d/Matrix3d\";\nimport { Point3d, type Vector3d } from \"../geometry3d/Point3dVector3d\";\nimport { type Range1d, Range3d } from \"../geometry3d/Range\";\nimport { Ray3d } from \"../geometry3d/Ray3d\";\nimport { Transform } from \"../geometry3d/Transform\";\nimport { CurveIntervalRole, CurveLocationDetail, CurveSearchStatus } from \"./CurveLocationDetail\";\nimport { GeometryQuery } from \"./GeometryQuery\";\nimport { AppendPlaneIntersectionStrokeHandler } from \"./internalContexts/AppendPlaneIntersectionStrokeHandler\";\nimport { ClosestPointStrokeHandler } from \"./internalContexts/ClosestPointStrokeHandler\";\nimport { AnnounceTangentStrokeHandler } from \"./internalContexts/AnnounceTangentStrokeHandler\";\nimport { CurveLengthContext } from \"./internalContexts/CurveLengthContext\";\nimport { LineString3d } from \"./LineString3d\";\n\nimport type { AkimaCurve3d } from \"../bspline/AkimaCurve3d\";\nimport type { Arc3d } from \"./Arc3d\";\nimport type { BezierCurve3d } from \"../bspline/BezierCurve3d\";\nimport type { BSplineCurve3d } from \"../bspline/BSplineCurve\";\nimport type { Clipper } from \"../clipping/ClipUtils\";\nimport type { CurveChainWithDistanceIndex } from \"./CurveChainWithDistanceIndex\";\nimport type { DirectSpiral3d } from \"./spiral/DirectSpiral3d\";\nimport type { IntegratedSpiral3d } from \"./spiral/IntegratedSpiral3d\";\nimport type { InterpolationCurve3d } from \"../bspline/InterpolationCurve3d\";\nimport type { IStrokeHandler } from \"../geometry3d/GeometryHandler\";\nimport type { LineSegment3d } from \"./LineSegment3d\";\nimport type { OffsetOptions } from \"./OffsetOptions\";\nimport type { Plane3dByOriginAndUnitNormal } from \"../geometry3d/Plane3dByOriginAndUnitNormal\";\nimport type { Plane3dByOriginAndVectors } from \"../geometry3d/Plane3dByOriginAndVectors\";\nimport type { StrokeOptions } from \"./StrokeOptions\";\nimport type { VariantCurveExtendParameter } from \"./CurveExtendMode\";\n\n/**\n * Describes the concrete type of a [[CurvePrimitive]]. Each type name maps to a specific subclass and can be used\n * for type-switching in conditional statements.\n *  - \"arc\" => [[Arc3d]]\n *  - \"lineSegment\" => [[LineSegment3d]]\n *  - \"lineString\" => [[LineString3d]]\n *  - \"bsplineCurve\" => [[BSplineCurve3dBase]] which is an intermediate class implemented by [[BSplineCurve3d]] and\n * [[BSplineCurve3dH]]\n *  - \"bezierCurve\" => [[BezierCurveBase]] which is an intermediate class implemented by [[BezierCurve3d]] and\n * [[BezierCurve3dH]]\n *  - \"transitionSpiral\" => [[TransitionSpiral3d]]\n *  - \"curveChainWithDistanceIndex\" => [[CurveChainWithDistanceIndex]]\n * @see [Curve Collections]($docs/learning/geometry/CurvePrimitive.md) learning article.\n * @see [[AnyCurvePrimitive]] for a union type that supports compile-time type narrowing.\n * @public\n */\nexport type CurvePrimitiveType = \"arc\" | \"lineSegment\" | \"lineString\" | \"bsplineCurve\" | \"bezierCurve\" | \"transitionSpiral\" | \"curveChainWithDistanceIndex\" | \"interpolationCurve\" | \"akimaCurve\";\n/**\n * Union type for subclasses of [[CurvePrimitive]]. Specific subclasses can be discriminated at compile- or run-time\n * using [[CurvePrimitive.curvePrimitiveType]].\n * @public\n */\nexport type AnyCurvePrimitive = Arc3d | LineSegment3d | LineString3d | BSplineCurve3d | BezierCurve3d | DirectSpiral3d | IntegratedSpiral3d | CurveChainWithDistanceIndex | InterpolationCurve3d | AkimaCurve3d;\n/**\n * Union type for a linear [[CurvePrimitive]].\n * @public\n */\nexport type LinearCurvePrimitive = LineSegment3d | LineString3d;\n/**\n * Function signature for callback which announces a pair of numbers, such as a fractional interval, along with a\n * containing CurvePrimitive.\n * @public\n */\nexport type AnnounceNumberNumberCurvePrimitive = (a0: number, a1: number, cp: CurvePrimitive) => void;\n/**\n * Function signature for a callback which announces a pair of numbers\n * @public\n */\nexport type AnnounceNumberNumber = (a0: number, a1: number) => void;\n/** Function signature for a callback which announces a curve primitive\n * @public\n */\nexport type AnnounceCurvePrimitive = (cp: CurvePrimitive) => void;\n\n/**\n * Options for computing tangents to a curve from a fixed point `P`.\n * See [[CurvePrimitive.emitTangents]], [[CurvePrimitive.allTangents]], and [[CurvePrimitive.closestTangent]].\n * @public\n */\nexport interface TangentOptions {\n  /**\n   * The tangent point returned by [[CurvePrimitive.closestTangent]] is nearest to this point as seen in the view plane.\n   * * Default value is the fixed point `P`.\n   */\n  hintPoint?: Point3d,\n  /**\n   * Tangents are computed as seen in a view plane perpendicular to this vector.\n   * * Default value is (0,0,1), i.e., tangents are computed as seen in the top view.\n   */\n  vectorToEye?: Vector3d,\n  /** Stroke options for default stroke-based implementations. */\n  strokeOptions?: StrokeOptions,\n  /**\n   * Compute tangents to the curve extended according to variant type.\n   * * This option is ignored for linear segments and linestrings.\n   * * Default value is `false`.\n   */\n  extend?: VariantCurveExtendParameter,\n  /**\n   * Distance tolerance, interpreted as follows:\n   * * Maximum distance of `P` from the tangent plane at curve point `Q` in order for `Q-P` to be considered a\n   * tangent to the curve.\n   * * Minimum length of a line/stroke segment for which to consider computing a tangent.\n   * * Default value is [[Geometry.smallMetricDistance]].\n   */\n  distanceTol?: number,\n}\n\n/**\n * A curve primitive is bounded.\n * A curve primitive maps fractions in 0..1 to points in space.\n * As the fraction proceeds from 0 towards 1, the point moves \"forward\" along the curve.\n * True distance along the curve is not always strictly proportional to fraction.\n * * A LineSegment3d always has proportional fraction and distance.\n * * An Arc3d which is true circular has proportional fraction and distance.\n * * A LineString3d is not proportional (except for special case of all segments of equal length).\n * * A Spiral3d is proportional.\n * * A BsplineCurve3d is only proportional for special cases.\n * For fractions outside 0..1, the curve primitive class may either (a) return the near endpoint or (b) evaluate\n * an extended curve.\n * @public\n */\nexport abstract class CurvePrimitive extends GeometryQuery {\n  /** String name for schema properties */\n  public readonly geometryCategory = \"curvePrimitive\";\n  /** String name for schema properties */\n  public abstract readonly curvePrimitiveType: CurvePrimitiveType;\n  /** Constructor */\n  protected constructor() {\n    super();\n  }\n  /**\n   * Data attached during stroking for facets.\n   */\n  public strokeData?: StrokeCountMap;\n  /**\n   * Data attached in curve cutting.\n   * @internal\n   */\n  public startCut?: CurveLocationDetail;\n  /**\n   * Data attached in curve cutting.\n   * @internal\n   */\n  public endCut?: CurveLocationDetail;\n  /**\n   * Data attached by various algorithms (e.g. Region booleans)\n   */\n  public parent?: any;\n  /**\n   * Return the point (x,y,z) on the curve at fractional position.\n   * @param fraction fractional position along the geometry.\n   * @returns Returns a point on the curve.\n   */\n  public abstract fractionToPoint(fraction: number, result?: Point3d): Point3d;\n  /**\n   * Return the point (x,y,z) and derivative on the curve at fractional position.\n   * * Note that this derivative is \"derivative of xyz with respect to fraction\".\n   * * This derivative shows the speed of the \"fractional point\" moving along the curve.\n   * * This is not generally a unit vector. Use fractionToPointAndUnitTangent for a unit vector.\n   * @param fraction fractional position along the geometry.\n   * @returns Returns a ray whose origin is the curve point and direction is the derivative with respect to the fraction.\n   */\n  public abstract fractionToPointAndDerivative(fraction: number, result?: Ray3d): Ray3d;\n  /**\n   * Returns a ray whose origin is the curve point and direction is the unit tangent.\n   * @param fraction fractional position on the curve.\n   * @param result optional preallocated ray.\n   * @returns tangent ray with normalized direction or zero vector if the derivative vanishes.\n   */\n  public fractionToPointAndUnitTangent(fraction: number, result?: Ray3d): Ray3d {\n    const ray = this.fractionToPointAndDerivative(fraction, result);\n    ray.trySetDirectionMagnitudeInPlace(1.0);\n    return ray;\n  }\n  /**\n   * Returns the (absolute) curvature magnitude.\n   * * Base implementation in CurvePrimitive computes curvature from the first and second derivative vectors.\n   * @param fraction fractional position on the curve\n   */\n  public fractionToCurvature(fraction: number): number | undefined {\n    const data = this.fractionToPointAnd2Derivatives(fraction);\n    if (!data)\n      return undefined;\n    const cross = data.vectorU.crossProduct(data.vectorV);\n    const a = cross.magnitude();\n    const b = data.vectorU.magnitude();\n    return Geometry.conditionalDivideFraction(a, b * b * b);\n  }\n  /**\n   * Return a plane with\n   * * origin at fractional position along the curve\n   * * vectorU is the first derivative, i.e. tangent vector with length equal to the rate of change with respect to\n   * the fraction.\n   * * vectorV is the second derivative, i.e. derivative of vectorU which points in the direction of the curve's\n   * derivative's change.\n   * * **Note:** We are dealing with a parametric equation of the curve (a function f : R -> R^3) so first and\n   * second derivatives are in fact derivatives of the parametric equation.\n   */\n  public abstract fractionToPointAnd2Derivatives(\n    fraction: number, result?: Plane3dByOriginAndVectors\n  ): Plane3dByOriginAndVectors | undefined;\n  /**\n   * Construct a Frenet frame:\n   * * origin at the point on the curve\n   * * x axis is unit vector along the curve (tangent)\n   * * y axis is perpendicular and in the plane of the osculating circle. y axis is called \"main normal\"\n   * * z axis perpendicular to those. z axis is called \"bi-normal\"\n   */\n  public fractionToFrenetFrame(fraction: number, result?: Transform): Transform | undefined {\n    const plane = this.fractionToPointAnd2Derivatives(fraction);\n    if (!plane)\n      return undefined;\n    // first derivative (plane.vectorU) and second derivative (plane.vectorV) are not essentially\n    // perpendicular so we use createRigidFromColumns to make 3 perpendicular vectors.\n    let axes = Matrix3d.createRigidFromColumns(plane.vectorU, plane.vectorV, AxisOrder.XYZ);\n    if (axes)\n      return Transform.createRefs(plane.origin, axes, result);\n    // 2nd derivative not distinct. for example if curve is linear at fraction so second derivative is 0.\n    // in this case we find perpendicular vector to plane.vectorU and pass it to createRigidFromColumns.\n    const perpVector = Matrix3d.createPerpendicularVectorFavorXYPlane(plane.vectorU, plane.vectorV);\n    axes = Matrix3d.createRigidFromColumns(plane.vectorU, perpVector, AxisOrder.XYZ);\n    if (axes)\n      return Transform.createRefs(plane.origin, axes, result);\n    return undefined;\n  }\n  /**\n   * Construct signed distance from a point on the planar curve to its center of curvature (in xy only).\n   * * Positive distance means the center is to the left of the curve at fraction.\n   * * Negative distance means the center is to the right of the curve at fraction.\n   * * Zero distance means curve is linear at fraction.\n   */\n  public fractionToSignedXYRadiusOfCurvature(fraction: number): number {\n    const plane = this.fractionToPointAnd2Derivatives(fraction);\n    if (!plane)\n      return 0.0;\n    const cross = plane.vectorU.crossProductXY(plane.vectorV);\n    const b = plane.vectorU.magnitude();\n    if (b === 0.0)\n      return 0.0;\n    const r = Geometry.conditionalDivideCoordinate(b * b * b, cross);\n    if (r !== undefined)\n      return r;\n    return 0.0;\n  }\n  /**\n   * Construct a point extrapolated along tangent at fraction.\n   * @param fraction fractional position on the primitive\n   * @param distance (signed) distance to move on the tangent.\n   */\n  public fractionAndDistanceToPointOnTangent(fraction: number, distance: number): Point3d {\n    const ray = this.fractionToPointAndUnitTangent(fraction);\n    return ray.fractionToPoint(distance);\n  }\n  /**\n   * Return the length of the curve.\n   * * Curve length is always positive.\n   */\n  public curveLength(): number {\n    const context = new CurveLengthContext();\n    this.emitStrokableParts(context);\n    return context.getSum();\n  }\n  /**\n   * Returns a (high accuracy) length of the curve between fractional positions.\n   * * Curve length is always positive.\n   * * Default implementation applies a generic Gaussian integration.\n   * * Most curve classes (certainly LineSegment, LineString, Arc) are expected to provide efficient implementations.\n   */\n  public curveLengthBetweenFractions(fraction0: number, fraction1: number): number {\n    if (fraction0 === fraction1)\n      return 0.0;\n    const scale = this.getFractionToDistanceScale();\n    if (scale !== undefined) {\n      // We are in luck! simple proportions determine it all !!!\n      // (for example, a LineSegment3d or a circular arc)\n      const totalLength = this.curveLength();\n      return Math.abs((fraction1 - fraction0) * totalLength);\n    }\n    const context = new CurveLengthContext(fraction0, fraction1);\n    this.emitStrokableParts(context);\n    return Math.abs(context.getSum());\n  }\n  /**\n   * Returns the range of the curve between fractional positions.\n   * * Default implementation calls [[rangeBetweenFractionsByClone]].\n   */\n  public rangeBetweenFractions(fraction0: number, fraction1: number, transform?: Transform): Range3d {\n    return this.rangeBetweenFractionsByClone(fraction0, fraction1, transform);\n  }\n  /** Returns a high accuracy range of the curve between fractional positions using [[clonePartialCurve]]. */\n  public rangeBetweenFractionsByClone(fraction0: number, fraction1: number, transform?: Transform): Range3d {\n    if (fraction0 === fraction1)\n      return Range3d.create(this.fractionToPoint(fraction0));\n    const fragment = this.clonePartialCurve(fraction0, fraction1);\n    if (fragment)\n      return fragment.range(transform);\n    return Range3d.createNull();\n  }\n  /**\n   * Returns an approximate range based on a fixed number of evaluations.\n   * * Default implementation returns a range determined by evaluating a specified number of points on the curve.\n   * * Optionally evaluate again at interval midpoints and extrapolate any increase.\n   * * For a smooth curve, Richardson extrapolation suggests each subdivision moves 3/4 of the way to final. So\n   * extrapolationFactor of 1/3 speculatively moves closer to the tight range, and larger multipliers increase\n   * confidence in being safely larger.\n   * * This function is faster to compute the range of a portion of a curve, because some curves can be\n   * expensive to compute the partial curve and/or to compute the partial curve's range.\n   * @param fraction0 start fraction for evaluation\n   * @param fraction1 end fraction for evaluation\n   * @param count number of points to evaluate\n   * @param transform optional transform to be applied to the curve\n   * @param extrapolationFactor if positive, evaluate again at interval midpoints and apply this fraction multiplier\n   * to any increase in size.\n   */\n  public rangeBetweenFractionsByCount(\n    fraction0: number, fraction1: number, count: number, transform?: Transform, extrapolationFactor: number = 0.0,\n  ): Range3d {\n    const range = Range3d.createNull();\n    const workPoint = Point3d.create();\n    range.extendPoint(this.startPoint(workPoint));\n    range.extendPoint(this.endPoint(workPoint));\n    // Evaluate at count fractions (fraction0 + i * fractionStep)\n    const evaluateSteps = (fractionA: number, fractionStep: number, countA: number) => {\n      let f = fractionA;\n      for (let i = 0; i < countA; i++, f += fractionStep) {\n        this.fractionToPoint(f, workPoint);\n        if (transform)\n          range.extendTransformedPoint(transform, workPoint);\n        else\n          range.extendPoint(workPoint);\n      }\n    };\n    const interiorCount = count - 2;\n    if (interiorCount > 0) {\n      const localFraction0 = 1.0 / (interiorCount + 1);\n      const globalFractionStep = localFraction0 * (fraction1 - fraction0);\n      evaluateSteps(fraction0 + globalFractionStep, globalFractionStep, interiorCount);\n    }\n    if (extrapolationFactor > 0.0) {\n      // Evaluate at midpoints.  Where this makes the range larger, apply extrapolationFactor to move it to safer\n      // excess value. same interior step, but shift to interval midpoints.\n      const baseRange = range.clone();\n      const interiorCount1 = interiorCount + 1;\n      const localFraction0 = 0.5 / interiorCount1;  // we only evaluate at new midpoints.\n      const globalFractionStep = 2 * localFraction0 * (fraction1 - fraction0); // same as above, but avoids special logic for interiorCount = 0\n      evaluateSteps(fraction0 + globalFractionStep * 0.5, globalFractionStep, interiorCount1);\n      range.extendWhenLarger(baseRange, extrapolationFactor);\n    }\n    return range;\n  }\n  /**\n   * Run an integration (with a default Gaussian quadrature) with a fixed fractional step\n   * * This is typically called by specific curve type implementations of curveLengthBetweenFractions.\n   * * For example, in Arc3d implementation of curveLengthBetweenFractions:\n   *     * If the Arc3d is true circular, it the arc is true circular, use the direct `arcLength = radius * sweepRadians`\n   *     * If the Arc3d is not true circular, call this method with an interval count appropriate to eccentricity and\n   * sweepRadians.\n   * @returns Returns the curve length via an integral estimated by numerical quadrature between the fractional positions.\n   * @param fraction0 start fraction for integration\n   * @param fraction1 end fraction for integration\n   * @param numInterval number of quadrature intervals\n   */\n  public curveLengthWithFixedIntervalCountQuadrature(\n    fraction0: number, fraction1: number, numInterval: number, numGauss: number = 5,\n  ): number {\n    if (fraction0 > fraction1) {\n      const fSave = fraction0;\n      fraction0 = fraction1;\n      fraction1 = fSave;\n    }\n    const context = new CurveLengthContext(fraction0, fraction1, numGauss);\n    context.announceIntervalForUniformStepStrokes(this, numInterval, fraction0, fraction1);\n    return Math.abs(context.getSum());\n  }\n  /**\n   * (Attempt to) find a position on the curve at a signed distance from start fraction.\n   * * Return the position as a CurveLocationDetail.\n   * * In the `CurveLocationDetail`, record:\n   *   * `fraction` = fractional position\n   *   * `point` = coordinates of the point\n   *   * `a` = (signed!) distance moved.   If `allowExtension` is false and the move reached the start or end of the\n   * curve, this distance is smaller than the requested signedDistance.\n   *   * `curveSearchStatus` indicates one of:\n   *     * `error` (unusual) computation failed not supported for this curve.\n   *     * `success` full movement completed\n   *     * `stoppedAtBoundary` partial movement completed. This can be due to either\n   *        * `allowExtension` parameter sent as `false`\n   *        * the curve type (e.g. bspline) does not support extended range.\n   * * if `allowExtension` is true, movement may still end at the startPoint or end point for curves that do not support\n   * extended geometry (specifically bsplines)\n   * * if the curve returns a value (i.e. not `undefined`) for `curve.getFractionToDistanceScale()`, the base class\n   * carries out the computation\n   *    and returns a final location.\n   *   * LineSegment3d relies on this.\n   * * If the curve does not implement the computation or the curve has zero length, the returned `CurveLocationDetail`\n   * has\n   *    * `fraction` = the value of `startFraction`\n   *    * `point` = result of `curve.fractionToPoint(startFraction)`\n   *    * `a` = 0\n   *    * `curveStartState` = `CurveSearchStatus.error`\n   * @param startFraction fractional position where the move starts\n   * @param signedDistance distance to move.   Negative distance is backwards in the fraction space\n   * @param allowExtension if true, allow the move to go beyond the startPoint or endpoint of the curve.  If false,\n   * do not allow movement beyond the startPoint or endpoint\n   * @param result optional result.\n   * @returns A CurveLocationDetail annotated as above. Note that if the curve does not support the calculation, there is\n   * still a result which contains the point at the input startFraction, with failure indicated in the `curveSearchStatus`\n   * member.\n   */\n  public moveSignedDistanceFromFraction(\n    startFraction: number, signedDistance: number, allowExtension: boolean, result?: CurveLocationDetail,\n  ): CurveLocationDetail {\n    const scale = this.getFractionToDistanceScale();\n    if (scale !== undefined) {\n      // We are in luck! simple proportions determine it all  !!!\n      // (for example, a LineSegment3d or a circular arc)\n      const totalLength = this.curveLength();\n      const signedFractionMove = Geometry.conditionalDivideFraction(signedDistance, totalLength);\n      if (signedFractionMove === undefined) {\n        return CurveLocationDetail.createCurveFractionPointDistanceCurveSearchStatus(\n          this, startFraction, this.fractionToPoint(startFraction), 0.0, CurveSearchStatus.error);\n      }\n      return CurveLocationDetail.createConditionalMoveSignedDistance(\n        allowExtension,\n        this,\n        startFraction,\n        startFraction + signedFractionMove,\n        signedDistance,\n        result,\n      );\n    }\n    return this.moveSignedDistanceFromFractionGeneric(startFraction, signedDistance, allowExtension, result);\n  }\n  /**\n   * Generic algorithm to search for point at signed distance from a fractional startPoint.\n   * * This will work for well for smooth curves.\n   * * Curves with tangent or other low-order-derivative discontinuities may need to implement specialized algorithms.\n   * * We need to find an endFraction which is the end-of-interval (usually upper) limit of integration of the tangent\n   * magnitude from startFraction to endFraction\n   * * That integral is a function of endFraction.\n   * * The derivative of that integral with respect to end fraction is the tangent magnitude at end fraction.\n   * * Use that function and (easily evaluated!) derivative for a Newton iteration\n   * * TO ALL WHO HAVE FUZZY MEMORIES OF CALCULUS CLASS: \"The derivative of the integral wrt upper limit is the value\n   * of the integrand there\" is the fundamental theorem of integral calculus !!! The fundamental theorem is not just\n   * an abstraction !!! It is being used  here in its barest possible form !!!\n   * * See https://en.wikipedia.org/wiki/Fundamental_theorem_of_calculus\n   * @param startFraction\n   * @param signedDistance\n   * @param _allowExtension\n   * @param result\n   */\n  protected moveSignedDistanceFromFractionGeneric(\n    startFraction: number, signedDistance: number, allowExtension: boolean, result?: CurveLocationDetail,\n  ): CurveLocationDetail {\n    let limitFraction: number;\n    const slackFraction = 0.1;  // slack to use when integration would otherwise have no room to work\n    if (signedDistance === 0.0)\n      return CurveLocationDetail.createCurveEvaluatedFraction(this, startFraction, result); // no movement, just evaluate at startFraction\n    if (signedDistance > 0.0) {\n      limitFraction = 1.0;\n      if (startFraction >= 1.0) {\n        const newStartFraction = 1.0 - slackFraction;\n        signedDistance += this.curveLengthBetweenFractions(newStartFraction, startFraction);\n        startFraction = newStartFraction;\n      }\n    } else { // signedDistance < 0.0\n      limitFraction = 0.0;\n      if (startFraction <= 0.0) {\n        const newStartFraction = 0.0 + slackFraction;\n        signedDistance -= this.curveLengthBetweenFractions(startFraction, newStartFraction);\n        startFraction = newStartFraction;\n      }\n    }\n    const availableLength = this.curveLengthBetweenFractions(startFraction, limitFraction);\n    assert(availableLength > 0.0);\n    const absDistance = Math.abs(signedDistance);\n    if (availableLength < absDistance && !allowExtension)\n      return CurveLocationDetail.createConditionalMoveSignedDistance(allowExtension, this, startFraction, limitFraction, signedDistance, result);\n\n    const fractionStep = Geometry.conditionalDivideCoordinate(absDistance, availableLength);\n    if (undefined === fractionStep) {\n      // no available length!\n      result = CurveLocationDetail.createCurveEvaluatedFraction(this, startFraction, result);\n      result.curveSearchStatus = CurveSearchStatus.error;\n      return result;\n    }\n    const directionFactor = signedDistance < 0.0 ? -1.0 : 1.0;\n    let fractionB = Geometry.interpolate(startFraction, fractionStep, limitFraction);\n    let fractionA = startFraction;\n    let distanceA = 0.0;\n    const tol = 1.0e-12 * availableLength;\n    let numConverged = 0;\n    const tangent = Ray3d.createXAxis();\n    // on each loop entry:\n    // fractionA is the most recent endOfInterval.  (It may have been reached by a mixture of forward and backward step.)\n    // distanceA is the distance to (the point at) fractionA\n    // fractionB is the next end fraction\n    for (let iterations = 0; iterations < 10; iterations++) {\n      const distanceAB = this.curveLengthBetweenFractions(fractionA, fractionB);\n      const directionAB = fractionB > fractionA ? directionFactor : -directionFactor;\n      const distance0B = distanceA + directionAB * distanceAB;\n      const distanceError = absDistance - distance0B;\n      if (Math.abs(distanceError) < tol) {\n        numConverged++;\n        if (numConverged > 1)\n          break;\n      } else {\n        numConverged = 0;\n      }\n      this.fractionToPointAndDerivative(fractionB, tangent);\n      const tangentMagnitude = tangent.direction.magnitude();\n      fractionA = fractionB;\n      fractionB = fractionA + directionFactor * distanceError / tangentMagnitude;\n      if (fractionA === fractionB) { // YES -- that is an exact equality test.   When it happens, there's no need for confirming with another iteration.\n        numConverged = 100;\n        break;\n      }\n      distanceA = distance0B;\n    }\n    if (numConverged > 1)\n      return CurveLocationDetail.createConditionalMoveSignedDistance(\n        allowExtension, this, startFraction, fractionB, signedDistance, result,\n      );\n    result = CurveLocationDetail.createCurveEvaluatedFraction(this, startFraction, result);\n    result.curveSearchStatus = CurveSearchStatus.error;\n    return result;\n  }\n  /**\n   * * Returns true if the curve can be easily extended past its start/end point (i.e., beyond the usual\n   * fraction space [0,1]). Otherwise, returns false.\n   * * Base class default implementation returns false.\n   * * These classes (and perhaps others in the future) will return true:\n   *   * LineSegment3d\n   *   * LineString3d\n   *   * Arc3d\n   */\n  public get isExtensibleFractionSpace(): boolean {\n    return false;\n  }\n  /**\n   * Compute a length for curve which may be a fast approximation to the true length.\n   * This is expected to be either (a) exact or (b) larger than the actual length, but by no more than\n   * a small multiple, perhaps up to PI/2, but commonly much closer to 1.\n   *\n   * * An example use of this is for setting a tolerance which is a small multiple of the curve length.\n   * * Simple line, circular arc, and transition spiral may return exact length\n   * * Ellipse may return circumference of some circle or polygon that encloses the ellipse.\n   * * bspline curve may return control polygon length\n   * *\n   */\n  public abstract quickLength(): number;\n  /**\n   * Search for a point on the curve that is closest to the spacePoint.\n   * * If the space point is exactly on the curve, this is the reverse of fractionToPoint.\n   * * Since CurvePrimitive should always have start and end available as candidate points, this method should always\n   * succeed.\n   * @param spacePoint point in space.\n   * @param extend (optional) compute the closest point to the curve extended according to variant type (default false).\n   * @param result (optional) pre-allocated detail to populate and return.\n   * @returns details `d` of the closest point. The distance from spacePoint to the closest point is stored in `d.a`.\n   */\n  public closestPoint(\n    spacePoint: Point3d, extend: VariantCurveExtendParameter = false, result?: CurveLocationDetail,\n  ): CurveLocationDetail | undefined {\n    const strokeHandler = new ClosestPointStrokeHandler(spacePoint, extend, result);\n    this.emitStrokableParts(strokeHandler);\n    return strokeHandler.claimResult();\n  }\n  /**\n   * Search for a point on the curve that is closest to `spacePoint`, ignoring z-coordinates.\n   * * This is equivalent to finding the closest point as seen in the top view.\n   * * If the space point is exactly on the curve, this is the reverse of fractionToPoint.\n   * * Since CurvePrimitive should always have start and end available as candidate points, this method should always\n   * succeed.\n   * @param spacePoint point in space.\n   * @param extend (optional) compute the closest point to the curve extended according to variant type (default false).\n   * @param result (optional) pre-allocated detail to populate and return.\n   * @returns details `d` of the closest point. The distance from spacePoint to the closest point is stored in `d.a`.\n   */\n  public closestPointXY(\n    spacePoint: Point3d, extend: VariantCurveExtendParameter = false, result?: CurveLocationDetail,\n  ): CurveLocationDetail | undefined {\n    const strokeHandler = new ClosestPointStrokeHandler(spacePoint, extend, result, true);\n    this.emitStrokableParts(strokeHandler);\n    return strokeHandler.claimResult();\n  }\n  /**\n   * Announce all points `P` on the curve such that the line containing `spacePoint` and `P` is tangent to the curve in\n   * 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    this.emitStrokableParts(strokeHandler, options?.strokeOptions);\n  }\n  /**\n   * Return all points `P` on the curve such that the line containing `spacePoint` and `P` is tangent to the curve in\n   * 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 curve such that the line containing `spacePoint` and `P` is tangent to the curve in\n   * 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  /**\n   * Find intervals of this curve that are interior to the clipper.\n   * * Default implementation calls `clipper.announceClippedCurveIntervals`; subclasses can implement more efficiently as necessary.\n   * @param clipper clip structure (e.g. clip planes)\n   * @param announce (optional) called to announce each fractional interval: `announce(fraction0, fraction1, this)`\n   * @returns true if any \"in\" segments are announced.\n   */\n  public announceClipIntervals(clipper: Clipper, announce?: AnnounceNumberNumberCurvePrimitive): boolean {\n    return clipper.announceClippedCurveIntervals?.(this, announce) ?? false;\n  }\n  /** Return a deep clone. */\n  public abstract override clone(): CurvePrimitive;\n  /** Return a transformed deep clone. */\n  public abstract override cloneTransformed(transform: Transform): CurvePrimitive | undefined;\n  /**\n   * Return (if possible) a curve primitive which is a portion of this curve.\n   * @param _fractionA [in] start fraction\n   * @param _fractionB [in] end fraction\n   */\n  public clonePartialCurve(_fractionA: number, _fractionB: number): CurvePrimitive | undefined {\n    return undefined;\n  }\n  /**\n   * If the curve primitive has distance-along-curve strictly proportional to curve fraction, return the scale factor.\n   * If distance-along-the-curve is not proportional, return undefined.\n   * * When defined, the scale factor is always the length of the curve.\n   * * This scale factor is typically available for these curve types:\n   * * * All `LineSegment3d`\n   * * * Arc3d which is a true circular arc (axes perpendicular and of equal length).\n   * * * CurveChainWithDistanceIndex\n   * * This scale factor is undefined for these curve types:\n   * * * Arc3d which is a true ellipse, i.e. unequal lengths of defining vectors or non-perpendicular defining vectors.\n   * * * bspline and bezier curves\n   * @returns scale factor or undefined\n   */\n  public getFractionToDistanceScale(): number | undefined {\n    return undefined;\n  }\n  /** Reverse the curve's data so that its fractional stroking moves in the opposite direction. */\n  public abstract reverseInPlace(): void;\n  /**\n   * Compute intersections of the curve with a plane.\n   * * The intersections are appended to the result array.\n   * * The base class implementation emits strokes to an AppendPlaneIntersectionStrokeHandler object, which uses a\n   * Newton iteration to get high-accuracy intersection points within strokes.\n   * * Derived classes should override this default implementation if there are easy analytic solutions.\n   * * Derived classes are free to implement extended intersections (e.g. arc!!!)\n   * @param plane The plane to be intersected.\n   * @param result Array to receive intersections\n   * @returns Return the number of CurveLocationDetail's added to the result array.\n   */\n  public appendPlaneIntersectionPoints(plane: PlaneAltitudeEvaluator, result: CurveLocationDetail[]): number {\n    const strokeHandler = new AppendPlaneIntersectionStrokeHandler(plane, result);\n    const n0 = result.length;\n    this.emitStrokableParts(strokeHandler);\n    return result.length - n0;\n  }\n  /**\n   * Examine contents of an array of CurveLocationDetail.\n   * Filter the intersections according to the parameters.\n   * @param allowExtend if false, remove points on the extension.\n   * @param applySnappedCoordinates if true, change the stored fractions and coordinates to exact end values.\n   * Otherwise use the exact values only for purpose of updating the curveIntervalRole.\n   * @param startEndFractionTolerance if nonzero, adjust fraction to 0 or 1 with this tolerance.\n   * @param startEndXYZTolerance if nonzero, adjust to endpoint with this tolerance.\n   * @internal\n   */\n  public static snapAndRestrictDetails(\n    details: CurveLocationDetail[],\n    allowExtend: boolean = true,\n    applySnappedCoordinates: boolean = false,\n    startEndFractionTolerance = Geometry.smallAngleRadians,\n    startEndXYZTolerance = Geometry.smallMetricDistance,\n  ): void {\n    const n0 = details.length;\n    let acceptIndex = 0;\n    const point0 = Point3d.create();\n    const point1 = Point3d.create();\n    let snappedCoordinates: Point3d | undefined;\n    for (let candidateIndex = 0; candidateIndex < n0; candidateIndex++) {\n      snappedCoordinates = undefined;\n      const detail = details[candidateIndex];\n      let fraction = detail.fraction;\n      let accept = allowExtend || Geometry.isIn01(fraction);\n      if (detail.curve) {\n        detail.curve.startPoint(point0);\n        detail.curve.endPoint(point1);\n      }\n      if (startEndFractionTolerance > 0) {\n        if (Math.abs(fraction) < startEndFractionTolerance) {\n          fraction = 0.0;\n          accept = true;\n          detail.intervalRole = CurveIntervalRole.isolatedAtVertex;\n          snappedCoordinates = point0;\n        }\n        if (Math.abs(fraction - 1.0) < startEndFractionTolerance) {\n          fraction = 1.0;\n          accept = true;\n          detail.intervalRole = CurveIntervalRole.isolatedAtVertex;\n          snappedCoordinates = point1;\n          if (detail.curve)\n            snappedCoordinates = detail.curve.startPoint(point1);\n        }\n      }\n      if (startEndXYZTolerance > 0 && detail.curve !== undefined) {\n        // REMARK: always test both endpoints.   If there is a cyclic fraction space, an intersection marked as \"after\" the end might have wrapped all the way to the beginning.\n        if (detail.point.distance(point0) <= startEndXYZTolerance) {\n          fraction = 0.0;\n          detail.intervalRole = CurveIntervalRole.isolatedAtVertex;\n          snappedCoordinates = point0;\n        } else if (detail.point.distance(point1) <= startEndXYZTolerance) {\n          fraction = 1.0;\n          detail.intervalRole = CurveIntervalRole.isolatedAtVertex;\n          snappedCoordinates = point1;\n        }\n      }\n      if (accept) {\n        if (applySnappedCoordinates) {\n          detail.fraction = fraction;\n          if (snappedCoordinates !== undefined)\n            detail.point.setFrom(snappedCoordinates);\n        }\n        if (acceptIndex < candidateIndex)\n          details[acceptIndex] = detail;\n        acceptIndex++;\n      }\n    }\n    if (acceptIndex < n0)\n      details.length = acceptIndex;\n  }\n  /**\n   * Ask if the curve is within tolerance of a plane.\n   * @returns Returns true if the curve is completely within tolerance of the plane.\n   */\n  public abstract isInPlane(plane: Plane3dByOriginAndUnitNormal): boolean;\n  /** Return the startPoint of the primitive. The default implementation returns fractionToPoint(0.0) */\n  public startPoint(result?: Point3d): Point3d {\n    return this.fractionToPoint(0.0, result);\n  }\n  /** Return the end point of the primitive. The default implementation returns fractionToPoint(1.0) */\n  public endPoint(result?: Point3d): Point3d {\n    return this.fractionToPoint(1.0, result);\n  }\n  /**\n   * Whether the 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  /** Append stroke points to caller-supplied linestring. */\n  public abstract emitStrokes(dest: LineString3d, options?: StrokeOptions): void;\n  /**\n   * Ask the curve to announce points and simple subcurve fragments for stroking.\n   * See IStrokeHandler for description of the sequence of the method calls.\n   */\n  public abstract emitStrokableParts(dest: IStrokeHandler, options?: StrokeOptions): void;\n  /**\n   * Return the stroke count required for given options.\n   * * This returns a single number\n   * * See [[computeAndAttachRecursiveStrokeCounts]] to get structured per-component counts and fraction mappings.\n   * @param options StrokeOptions that determine count\n   */\n  public abstract computeStrokeCountForOptions(options?: StrokeOptions): number;\n  /**\n   * Attach StrokeCountMap structure to this primitive (and recursively to any children)\n   * * Base class implementation (here) gets the simple count from [[computeStrokeCountForOptions]] and attaches it.\n   * * [[LineString3d]], [[Arc3d]], [[BezierCurve3d]], [[BezierCurve3dH]] accept that default.\n   * * Subdivided primitives ([[LineString3d]], [[BSplineCurve3d]]) implement themselves and attach a StrokeCountMap containing the\n   *       total count, and also containing an array of StrokeCountMap per component.\n   * * For [[CurveChainWithDistanceIndex]], the top level gets (only) a total count, and each child gets\n   *       its own StrokeCountMap with appropriate structure.\n   * @param options StrokeOptions that determine count\n   * @param parentStrokeMap optional map from parent.  Its count, curveLength, and a1 values are increased with count\n   * and distance from this primitive.\n   * @return sum of `a0+this.curveLength()`, for use as `a0` of successor in chain.\n   */\n  public computeAndAttachRecursiveStrokeCounts(options?: StrokeOptions, parentMap?: StrokeCountMap) {\n    const n = this.computeStrokeCountForOptions(options);\n    const a = this.curveLength();\n    CurvePrimitive.installStrokeCountMap(\n      this,\n      StrokeCountMap.createWithCurvePrimitive(this, n, a, 0, a),\n      parentMap);\n  }\n  /**\n   * Evaluate strokes at fractions indicated in a StrokeCountMap.\n   *   * Base class implementation (here) gets the simple count from [[computeStrokeCountForOptions]] and strokes at\n   * uniform fractions.\n   *   * [[LineString3d]], [[Arc3d]], [[BezierCurve3d]], [[BezierCurve3dH]] accept that default.\n   *   * Subdivided primitives ([[LineString3d]], [[BSplineCurve3d]]) implement themselves and evaluate within components.\n   *   * [[CurveChainWithDistanceIndex]] recurses to its children.\n   * * if packedFraction and packedDerivative arrays are present in the LineString3d, fill them.\n   * @param map = stroke count data.\n   * @param linestring = receiver linestring.\n   * @return number of strokes added.  0 if any errors matching the map to the curve primitive.\n   */\n  public addMappedStrokesToLineString3D(map: StrokeCountMap, linestring: LineString3d): number {\n    const numPoint0 = linestring.numPoints();\n    if (map.primitive && map.primitive === this && map.numStroke > 0) {\n      for (let i = 0; i <= map.numStroke; i++) {\n        const fraction = i / map.numStroke;\n        linestring.appendFractionToPoint(this, fraction);\n      }\n    }\n    return linestring.numPoints() - numPoint0;\n  }\n  /**\n   * Final install step to save curveMap in curve. If parentMap is given, update its length, count, and a1 fields\n   * @param curve curve to receive the annotation\n   * @param map\n   * @param parentMap\n   */\n  public static installStrokeCountMap(curve: CurvePrimitive, curveMap: StrokeCountMap, parentMap?: StrokeCountMap) {\n    if (parentMap)\n      parentMap.addToCountAndLength(curveMap.numStroke, curveMap.curveLength);\n    curve.strokeData = curveMap;\n  }\n  /**\n   * Return an array containing only the curve primitives.\n   * * This DEFAULT implementation simply pushes `this` to the collectorArray.\n   * @param collectorArray array to receive primitives (pushed -- the array is not cleared)\n   * @param smallestPossiblePrimitives if true, a [[CurveChainWithDistanceIndex]] recurses on its (otherwise hidden)\n   * children. If false, it returns only itself.\n   * @param explodeLinestrings if true, push a [[LineSegment3d]] for each segment of a [[LineString3d]]. If false,\n   * push only the [[LineString3d]].\n   */\n  public collectCurvePrimitivesGo(\n    collectorArray: CurvePrimitive[], _smallestPossiblePrimitives: boolean, _explodeLinestrings: boolean = false,\n  ): void {\n    collectorArray.push(this);\n  }\n  /**\n   * Return an array containing only the curve primitives.\n   * * This DEFAULT implementation captures the optional collector and calls [[collectCurvePrimitivesGo]].\n   * @param collectorArray optional array to receive primitives.   If present, new primitives are ADDED (without\n   * clearing the array.)\n   * @param smallestPossiblePrimitives if false (default), a [[CurveChainWithDistanceIndex]] returns only itself;\n   * otherwise, it recurses to its (otherwise hidden) children.\n   * @param explodeLinestrings whether to return [[LineSegment3d]]s for a [[LineString3d]] (default false).\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   * Construct an offset of the instance curve as viewed in the xy-plane (ignoring z).\n   * * No attempt is made to join the offsets of smaller constituent primitives. To construct a fully joined offset\n   * for an aggregate instance (e.g., LineString3d, CurveChainWithDistanceIndex), use [[CurveOps.constructCurveXYOffset]]\n   * instead.\n   * @param offsetDistanceOrOptions offset distance (positive to left of the instance curve), or options object\n   */\n  public abstract constructOffsetXY(\n    offsetDistanceOrOptions: number | OffsetOptions\n  ): CurvePrimitive | CurvePrimitive[] | undefined;\n\n  /**\n   * Project instance geometry (via dispatch) onto the line of the given ray, and return the extreme fractional\n   * parameters 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 undefined; // common implementation delegated to subclasses to avoid circular dependency\n  }\n}\n"]}
+{"version":3,"file":"CurvePrimitive.js","sourceRoot":"","sources":["../../../src/curve/CurvePrimitive.ts"],"names":[],"mappings":";;;AAAA;;;+FAG+F;AAC/F;;GAEG;AACH,sDAA6C;AAC7C,kEAA+D;AAC/D,0CAA+E;AAC/E,qDAAkD;AAClD,mEAAuE;AACvE,+CAA4D;AAC5D,+CAA4C;AAC5C,uDAAoD;AACpD,+DAAkG;AAClG,mDAAgD;AAChD,kHAA+G;AAC/G,4FAAyF;AACzF,kGAA+F;AAC/F,8EAA2E;AAkG3E;;;;;;;;;;;;;GAaG;AACH,MAAsB,cAAe,SAAQ,6BAAa;IACxD,wCAAwC;IACxB,gBAAgB,GAAG,gBAAgB,CAAC;IAGpD,kBAAkB;IAClB;QACE,KAAK,EAAE,CAAC;IACV,CAAC;IACD;;OAEG;IACI,UAAU,CAAkB;IACnC;;;OAGG;IACI,QAAQ,CAAuB;IACtC;;;OAGG;IACI,MAAM,CAAuB;IACpC;;OAEG;IACI,MAAM,CAAO;IAgBpB;;;;;OAKG;IACI,6BAA6B,CAAC,QAAgB,EAAE,MAAc;QACnE,MAAM,GAAG,GAAG,IAAI,CAAC,4BAA4B,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;QAChE,GAAG,CAAC,+BAA+B,CAAC,GAAG,CAAC,CAAC;QACzC,OAAO,GAAG,CAAC;IACb,CAAC;IACD;;;;OAIG;IACI,mBAAmB,CAAC,QAAgB;QACzC,MAAM,IAAI,GAAG,IAAI,CAAC,8BAA8B,CAAC,QAAQ,CAAC,CAAC;QAC3D,IAAI,CAAC,IAAI;YACP,OAAO,SAAS,CAAC;QACnB,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,YAAY,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACtD,MAAM,CAAC,GAAG,KAAK,CAAC,SAAS,EAAE,CAAC;QAC5B,MAAM,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,SAAS,EAAE,CAAC;QACnC,OAAO,mBAAQ,CAAC,yBAAyB,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;IAC1D,CAAC;IAcD;;;;;;OAMG;IACI,qBAAqB,CAAC,QAAgB,EAAE,MAAkB;QAC/D,MAAM,KAAK,GAAG,IAAI,CAAC,8BAA8B,CAAC,QAAQ,CAAC,CAAC;QAC5D,IAAI,CAAC,KAAK;YACR,OAAO,SAAS,CAAC;QACnB,6FAA6F;QAC7F,kFAAkF;QAClF,IAAI,IAAI,GAAG,mBAAQ,CAAC,sBAAsB,CAAC,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC,OAAO,EAAE,oBAAS,CAAC,GAAG,CAAC,CAAC;QACxF,IAAI,IAAI;YACN,OAAO,qBAAS,CAAC,UAAU,CAAC,KAAK,CAAC,MAAM,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC;QAC1D,qGAAqG;QACrG,oGAAoG;QACpG,MAAM,UAAU,GAAG,mBAAQ,CAAC,qCAAqC,CAAC,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC;QAChG,IAAI,GAAG,mBAAQ,CAAC,sBAAsB,CAAC,KAAK,CAAC,OAAO,EAAE,UAAU,EAAE,oBAAS,CAAC,GAAG,CAAC,CAAC;QACjF,IAAI,IAAI;YACN,OAAO,qBAAS,CAAC,UAAU,CAAC,KAAK,CAAC,MAAM,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC;QAC1D,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;OAKG;IACI,mCAAmC,CAAC,QAAgB;QACzD,MAAM,KAAK,GAAG,IAAI,CAAC,8BAA8B,CAAC,QAAQ,CAAC,CAAC;QAC5D,IAAI,CAAC,KAAK;YACR,OAAO,GAAG,CAAC;QACb,MAAM,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,cAAc,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;QAC1D,MAAM,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC,SAAS,EAAE,CAAC;QACpC,IAAI,CAAC,KAAK,GAAG;YACX,OAAO,GAAG,CAAC;QACb,MAAM,CAAC,GAAG,mBAAQ,CAAC,2BAA2B,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC;QACjE,IAAI,CAAC,KAAK,SAAS;YACjB,OAAO,CAAC,CAAC;QACX,OAAO,GAAG,CAAC;IACb,CAAC;IACD;;;;OAIG;IACI,mCAAmC,CAAC,QAAgB,EAAE,QAAgB;QAC3E,MAAM,GAAG,GAAG,IAAI,CAAC,6BAA6B,CAAC,QAAQ,CAAC,CAAC;QACzD,OAAO,GAAG,CAAC,eAAe,CAAC,QAAQ,CAAC,CAAC;IACvC,CAAC;IACD;;;OAGG;IACI,WAAW;QAChB,MAAM,OAAO,GAAG,IAAI,uCAAkB,EAAE,CAAC;QACzC,IAAI,CAAC,kBAAkB,CAAC,OAAO,CAAC,CAAC;QACjC,OAAO,OAAO,CAAC,MAAM,EAAE,CAAC;IAC1B,CAAC;IACD;;;;;OAKG;IACI,2BAA2B,CAAC,SAAiB,EAAE,SAAiB;QACrE,IAAI,SAAS,KAAK,SAAS;YACzB,OAAO,GAAG,CAAC;QACb,MAAM,KAAK,GAAG,IAAI,CAAC,0BAA0B,EAAE,CAAC;QAChD,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACxB,0DAA0D;YAC1D,mDAAmD;YACnD,MAAM,WAAW,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;YACvC,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,SAAS,GAAG,SAAS,CAAC,GAAG,WAAW,CAAC,CAAC;QACzD,CAAC;QACD,MAAM,OAAO,GAAG,IAAI,uCAAkB,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;QAC7D,IAAI,CAAC,kBAAkB,CAAC,OAAO,CAAC,CAAC;QACjC,OAAO,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;IACpC,CAAC;IACD;;;OAGG;IACI,qBAAqB,CAAC,SAAiB,EAAE,SAAiB,EAAE,SAAqB;QACtF,OAAO,IAAI,CAAC,4BAA4B,CAAC,SAAS,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC;IAC5E,CAAC;IACD,2GAA2G;IACpG,4BAA4B,CAAC,SAAiB,EAAE,SAAiB,EAAE,SAAqB;QAC7F,IAAI,SAAS,KAAK,SAAS;YACzB,OAAO,eAAO,CAAC,MAAM,CAAC,IAAI,CAAC,eAAe,CAAC,SAAS,CAAC,CAAC,CAAC;QACzD,MAAM,QAAQ,GAAG,IAAI,CAAC,iBAAiB,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;QAC9D,IAAI,QAAQ;YACV,OAAO,QAAQ,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;QACnC,OAAO,eAAO,CAAC,UAAU,EAAE,CAAC;IAC9B,CAAC;IACD;;;;;;;;;;;;;;;OAeG;IACI,4BAA4B,CACjC,SAAiB,EAAE,SAAiB,EAAE,KAAa,EAAE,SAAqB,EAAE,sBAA8B,GAAG;QAE7G,MAAM,KAAK,GAAG,eAAO,CAAC,UAAU,EAAE,CAAC;QACnC,MAAM,SAAS,GAAG,yBAAO,CAAC,MAAM,EAAE,CAAC;QACnC,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC,CAAC;QAC9C,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC;QAC5C,6DAA6D;QAC7D,MAAM,aAAa,GAAG,CAAC,SAAiB,EAAE,YAAoB,EAAE,MAAc,EAAE,EAAE;YAChF,IAAI,CAAC,GAAG,SAAS,CAAC;YAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,YAAY,EAAE,CAAC;gBACnD,IAAI,CAAC,eAAe,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;gBACnC,IAAI,SAAS;oBACX,KAAK,CAAC,sBAAsB,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;;oBAEnD,KAAK,CAAC,WAAW,CAAC,SAAS,CAAC,CAAC;YACjC,CAAC;QACH,CAAC,CAAC;QACF,MAAM,aAAa,GAAG,KAAK,GAAG,CAAC,CAAC;QAChC,IAAI,aAAa,GAAG,CAAC,EAAE,CAAC;YACtB,MAAM,cAAc,GAAG,GAAG,GAAG,CAAC,aAAa,GAAG,CAAC,CAAC,CAAC;YACjD,MAAM,kBAAkB,GAAG,cAAc,GAAG,CAAC,SAAS,GAAG,SAAS,CAAC,CAAC;YACpE,aAAa,CAAC,SAAS,GAAG,kBAAkB,EAAE,kBAAkB,EAAE,aAAa,CAAC,CAAC;QACnF,CAAC;QACD,IAAI,mBAAmB,GAAG,GAAG,EAAE,CAAC;YAC9B,2GAA2G;YAC3G,qEAAqE;YACrE,MAAM,SAAS,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;YAChC,MAAM,cAAc,GAAG,aAAa,GAAG,CAAC,CAAC;YACzC,MAAM,cAAc,GAAG,GAAG,GAAG,cAAc,CAAC,CAAE,qCAAqC;YACnF,MAAM,kBAAkB,GAAG,CAAC,GAAG,cAAc,GAAG,CAAC,SAAS,GAAG,SAAS,CAAC,CAAC,CAAC,gEAAgE;YACzI,aAAa,CAAC,SAAS,GAAG,kBAAkB,GAAG,GAAG,EAAE,kBAAkB,EAAE,cAAc,CAAC,CAAC;YACxF,KAAK,CAAC,gBAAgB,CAAC,SAAS,EAAE,mBAAmB,CAAC,CAAC;QACzD,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;;;;;;;OAWG;IACI,2CAA2C,CAChD,SAAiB,EAAE,SAAiB,EAAE,WAAmB,EAAE,WAAmB,CAAC;QAE/E,IAAI,SAAS,GAAG,SAAS,EAAE,CAAC;YAC1B,MAAM,KAAK,GAAG,SAAS,CAAC;YACxB,SAAS,GAAG,SAAS,CAAC;YACtB,SAAS,GAAG,KAAK,CAAC;QACpB,CAAC;QACD,MAAM,OAAO,GAAG,IAAI,uCAAkB,CAAC,SAAS,EAAE,SAAS,EAAE,QAAQ,CAAC,CAAC;QACvE,OAAO,CAAC,qCAAqC,CAAC,IAAI,EAAE,WAAW,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC;QACvF,OAAO,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;IACpC,CAAC;IACD;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;OAkCG;IACI,8BAA8B,CACnC,aAAqB,EAAE,cAAsB,EAAE,cAAuB,EAAE,MAA4B;QAEpG,MAAM,KAAK,GAAG,IAAI,CAAC,0BAA0B,EAAE,CAAC;QAChD,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACxB,2DAA2D;YAC3D,mDAAmD;YACnD,MAAM,WAAW,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;YACvC,MAAM,kBAAkB,GAAG,mBAAQ,CAAC,yBAAyB,CAAC,cAAc,EAAE,WAAW,CAAC,CAAC;YAC3F,IAAI,kBAAkB,KAAK,SAAS,EAAE,CAAC;gBACrC,OAAO,yCAAmB,CAAC,iDAAiD,CAC1E,IAAI,EAAE,aAAa,EAAE,IAAI,CAAC,eAAe,CAAC,aAAa,CAAC,EAAE,GAAG,EAAE,uCAAiB,CAAC,KAAK,CAAC,CAAC;YAC5F,CAAC;YACD,OAAO,yCAAmB,CAAC,mCAAmC,CAC5D,cAAc,EACd,IAAI,EACJ,aAAa,EACb,aAAa,GAAG,kBAAkB,EAClC,cAAc,EACd,MAAM,CACP,CAAC;QACJ,CAAC;QACD,OAAO,IAAI,CAAC,qCAAqC,CAAC,aAAa,EAAE,cAAc,EAAE,cAAc,EAAE,MAAM,CAAC,CAAC;IAC3G,CAAC;IACD;;;;;;;;;;;;;;;;;OAiBG;IACO,qCAAqC,CAC7C,aAAqB,EAAE,cAAsB,EAAE,cAAuB,EAAE,MAA4B;QAEpG,IAAI,aAAqB,CAAC;QAC1B,MAAM,aAAa,GAAG,GAAG,CAAC,CAAE,qEAAqE;QACjG,IAAI,cAAc,KAAK,GAAG;YACxB,OAAO,yCAAmB,CAAC,4BAA4B,CAAC,IAAI,EAAE,aAAa,EAAE,MAAM,CAAC,CAAC,CAAC,8CAA8C;QACtI,IAAI,cAAc,GAAG,GAAG,EAAE,CAAC;YACzB,aAAa,GAAG,GAAG,CAAC;YACpB,IAAI,aAAa,IAAI,GAAG,EAAE,CAAC;gBACzB,MAAM,gBAAgB,GAAG,GAAG,GAAG,aAAa,CAAC;gBAC7C,cAAc,IAAI,IAAI,CAAC,2BAA2B,CAAC,gBAAgB,EAAE,aAAa,CAAC,CAAC;gBACpF,aAAa,GAAG,gBAAgB,CAAC;YACnC,CAAC;QACH,CAAC;aAAM,CAAC,CAAC,uBAAuB;YAC9B,aAAa,GAAG,GAAG,CAAC;YACpB,IAAI,aAAa,IAAI,GAAG,EAAE,CAAC;gBACzB,MAAM,gBAAgB,GAAG,GAAG,GAAG,aAAa,CAAC;gBAC7C,cAAc,IAAI,IAAI,CAAC,2BAA2B,CAAC,aAAa,EAAE,gBAAgB,CAAC,CAAC;gBACpF,aAAa,GAAG,gBAAgB,CAAC;YACnC,CAAC;QACH,CAAC;QACD,MAAM,eAAe,GAAG,IAAI,CAAC,2BAA2B,CAAC,aAAa,EAAE,aAAa,CAAC,CAAC;QACvF,IAAA,qBAAM,EAAC,eAAe,GAAG,GAAG,CAAC,CAAC;QAC9B,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC;QAC7C,IAAI,eAAe,GAAG,WAAW,IAAI,CAAC,cAAc;YAClD,OAAO,yCAAmB,CAAC,mCAAmC,CAAC,cAAc,EAAE,IAAI,EAAE,aAAa,EAAE,aAAa,EAAE,cAAc,EAAE,MAAM,CAAC,CAAC;QAE7I,MAAM,YAAY,GAAG,mBAAQ,CAAC,2BAA2B,CAAC,WAAW,EAAE,eAAe,CAAC,CAAC;QACxF,IAAI,SAAS,KAAK,YAAY,EAAE,CAAC;YAC/B,uBAAuB;YACvB,MAAM,GAAG,yCAAmB,CAAC,4BAA4B,CAAC,IAAI,EAAE,aAAa,EAAE,MAAM,CAAC,CAAC;YACvF,MAAM,CAAC,iBAAiB,GAAG,uCAAiB,CAAC,KAAK,CAAC;YACnD,OAAO,MAAM,CAAC;QAChB,CAAC;QACD,MAAM,eAAe,GAAG,cAAc,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;QAC1D,IAAI,SAAS,GAAG,mBAAQ,CAAC,WAAW,CAAC,aAAa,EAAE,YAAY,EAAE,aAAa,CAAC,CAAC;QACjF,IAAI,SAAS,GAAG,aAAa,CAAC;QAC9B,IAAI,SAAS,GAAG,GAAG,CAAC;QACpB,MAAM,GAAG,GAAG,OAAO,GAAG,eAAe,CAAC;QACtC,IAAI,YAAY,GAAG,CAAC,CAAC;QACrB,MAAM,OAAO,GAAG,aAAK,CAAC,WAAW,EAAE,CAAC;QACpC,sBAAsB;QACtB,qHAAqH;QACrH,wDAAwD;QACxD,qCAAqC;QACrC,KAAK,IAAI,UAAU,GAAG,CAAC,EAAE,UAAU,GAAG,EAAE,EAAE,UAAU,EAAE,EAAE,CAAC;YACvD,MAAM,UAAU,GAAG,IAAI,CAAC,2BAA2B,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;YAC1E,MAAM,WAAW,GAAG,SAAS,GAAG,SAAS,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC;YAC/E,MAAM,UAAU,GAAG,SAAS,GAAG,WAAW,GAAG,UAAU,CAAC;YACxD,MAAM,aAAa,GAAG,WAAW,GAAG,UAAU,CAAC;YAC/C,IAAI,IAAI,CAAC,GAAG,CAAC,aAAa,CAAC,GAAG,GAAG,EAAE,CAAC;gBAClC,YAAY,EAAE,CAAC;gBACf,IAAI,YAAY,GAAG,CAAC;oBAClB,MAAM;YACV,CAAC;iBAAM,CAAC;gBACN,YAAY,GAAG,CAAC,CAAC;YACnB,CAAC;YACD,IAAI,CAAC,4BAA4B,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;YACtD,MAAM,gBAAgB,GAAG,OAAO,CAAC,SAAS,CAAC,SAAS,EAAE,CAAC;YACvD,SAAS,GAAG,SAAS,CAAC;YACtB,SAAS,GAAG,SAAS,GAAG,eAAe,GAAG,aAAa,GAAG,gBAAgB,CAAC;YAC3E,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC,CAAC,mHAAmH;gBAChJ,YAAY,GAAG,GAAG,CAAC;gBACnB,MAAM;YACR,CAAC;YACD,SAAS,GAAG,UAAU,CAAC;QACzB,CAAC;QACD,IAAI,YAAY,GAAG,CAAC;YAClB,OAAO,yCAAmB,CAAC,mCAAmC,CAC5D,cAAc,EAAE,IAAI,EAAE,aAAa,EAAE,SAAS,EAAE,cAAc,EAAE,MAAM,CACvE,CAAC;QACJ,MAAM,GAAG,yCAAmB,CAAC,4BAA4B,CAAC,IAAI,EAAE,aAAa,EAAE,MAAM,CAAC,CAAC;QACvF,MAAM,CAAC,iBAAiB,GAAG,uCAAiB,CAAC,KAAK,CAAC;QACnD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;;;;OAQG;IACH,IAAW,yBAAyB;QAClC,OAAO,KAAK,CAAC;IACf,CAAC;IAaD;;;;;;;;;OASG;IACI,YAAY,CACjB,UAAmB,EAAE,SAAsC,KAAK,EAAE,MAA4B;QAE9F,MAAM,aAAa,GAAG,IAAI,qDAAyB,CAAC,UAAU,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;QAChF,IAAI,CAAC,kBAAkB,CAAC,aAAa,CAAC,CAAC;QACvC,OAAO,aAAa,CAAC,WAAW,EAAE,CAAC;IACrC,CAAC;IACD;;;;;;;;;;OAUG;IACI,cAAc,CACnB,UAAmB,EAAE,SAAsC,KAAK,EAAE,MAA4B;QAE9F,MAAM,aAAa,GAAG,IAAI,qDAAyB,CAAC,UAAU,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;QACtF,IAAI,CAAC,kBAAkB,CAAC,aAAa,CAAC,CAAC;QACvC,OAAO,aAAa,CAAC,WAAW,EAAE,CAAC;IACrC,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,CAAC,kBAAkB,CAAC,aAAa,EAAE,OAAO,EAAE,aAAa,CAAC,CAAC;IACjE,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;;;;;;OAMG;IACI,qBAAqB,CAAC,OAAgB,EAAE,QAA6C;QAC1F,OAAO,OAAO,CAAC,6BAA6B,EAAE,CAAC,IAAI,EAAE,QAAQ,CAAC,IAAI,KAAK,CAAC;IAC1E,CAAC;IAKD;;;;OAIG;IACI,iBAAiB,CAAC,UAAkB,EAAE,UAAkB;QAC7D,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;;;;;;;OAYG;IACI,0BAA0B;QAC/B,OAAO,SAAS,CAAC;IACnB,CAAC;IAGD,uDAAuD;IAChD,OAAO;QACZ,IAAI,CAAC,cAAc,EAAE,CAAC;QACtB,OAAO,IAAI,CAAC;IACd,CAAC;IACD;;;;;;;;;;OAUG;IACI,6BAA6B,CAAC,KAA6B,EAAE,MAA6B;QAC/F,MAAM,aAAa,GAAG,IAAI,2EAAoC,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QAC9E,MAAM,EAAE,GAAG,MAAM,CAAC,MAAM,CAAC;QACzB,IAAI,CAAC,kBAAkB,CAAC,aAAa,CAAC,CAAC;QACvC,OAAO,MAAM,CAAC,MAAM,GAAG,EAAE,CAAC;IAC5B,CAAC;IACD;;;;;;;;;OASG;IACI,MAAM,CAAC,sBAAsB,CAClC,OAA8B,EAC9B,cAAuB,IAAI,EAC3B,0BAAmC,KAAK,EACxC,yBAAyB,GAAG,mBAAQ,CAAC,iBAAiB,EACtD,oBAAoB,GAAG,mBAAQ,CAAC,mBAAmB;QAEnD,MAAM,EAAE,GAAG,OAAO,CAAC,MAAM,CAAC;QAC1B,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,MAAM,MAAM,GAAG,yBAAO,CAAC,MAAM,EAAE,CAAC;QAChC,MAAM,MAAM,GAAG,yBAAO,CAAC,MAAM,EAAE,CAAC;QAChC,IAAI,kBAAuC,CAAC;QAC5C,KAAK,IAAI,cAAc,GAAG,CAAC,EAAE,cAAc,GAAG,EAAE,EAAE,cAAc,EAAE,EAAE,CAAC;YACnE,kBAAkB,GAAG,SAAS,CAAC;YAC/B,MAAM,MAAM,GAAG,OAAO,CAAC,cAAc,CAAC,CAAC;YACvC,IAAI,QAAQ,GAAG,MAAM,CAAC,QAAQ,CAAC;YAC/B,IAAI,MAAM,GAAG,WAAW,IAAI,mBAAQ,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;YACtD,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC;gBACjB,MAAM,CAAC,KAAK,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;gBAChC,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;YAChC,CAAC;YACD,IAAI,yBAAyB,GAAG,CAAC,EAAE,CAAC;gBAClC,IAAI,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,yBAAyB,EAAE,CAAC;oBACnD,QAAQ,GAAG,GAAG,CAAC;oBACf,MAAM,GAAG,IAAI,CAAC;oBACd,MAAM,CAAC,YAAY,GAAG,uCAAiB,CAAC,gBAAgB,CAAC;oBACzD,kBAAkB,GAAG,MAAM,CAAC;gBAC9B,CAAC;gBACD,IAAI,IAAI,CAAC,GAAG,CAAC,QAAQ,GAAG,GAAG,CAAC,GAAG,yBAAyB,EAAE,CAAC;oBACzD,QAAQ,GAAG,GAAG,CAAC;oBACf,MAAM,GAAG,IAAI,CAAC;oBACd,MAAM,CAAC,YAAY,GAAG,uCAAiB,CAAC,gBAAgB,CAAC;oBACzD,kBAAkB,GAAG,MAAM,CAAC;oBAC5B,IAAI,MAAM,CAAC,KAAK;wBACd,kBAAkB,GAAG,MAAM,CAAC,KAAK,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;gBACzD,CAAC;YACH,CAAC;YACD,IAAI,oBAAoB,GAAG,CAAC,IAAI,MAAM,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;gBAC3D,wKAAwK;gBACxK,IAAI,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,oBAAoB,EAAE,CAAC;oBAC1D,QAAQ,GAAG,GAAG,CAAC;oBACf,MAAM,CAAC,YAAY,GAAG,uCAAiB,CAAC,gBAAgB,CAAC;oBACzD,kBAAkB,GAAG,MAAM,CAAC;gBAC9B,CAAC;qBAAM,IAAI,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,oBAAoB,EAAE,CAAC;oBACjE,QAAQ,GAAG,GAAG,CAAC;oBACf,MAAM,CAAC,YAAY,GAAG,uCAAiB,CAAC,gBAAgB,CAAC;oBACzD,kBAAkB,GAAG,MAAM,CAAC;gBAC9B,CAAC;YACH,CAAC;YACD,IAAI,MAAM,EAAE,CAAC;gBACX,IAAI,uBAAuB,EAAE,CAAC;oBAC5B,MAAM,CAAC,QAAQ,GAAG,QAAQ,CAAC;oBAC3B,IAAI,kBAAkB,KAAK,SAAS;wBAClC,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,kBAAkB,CAAC,CAAC;gBAC7C,CAAC;gBACD,IAAI,WAAW,GAAG,cAAc;oBAC9B,OAAO,CAAC,WAAW,CAAC,GAAG,MAAM,CAAC;gBAChC,WAAW,EAAE,CAAC;YAChB,CAAC;QACH,CAAC;QACD,IAAI,WAAW,GAAG,EAAE;YAClB,OAAO,CAAC,MAAM,GAAG,WAAW,CAAC;IACjC,CAAC;IAMD,sGAAsG;IAC/F,UAAU,CAAC,MAAgB;QAChC,OAAO,IAAI,CAAC,eAAe,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;IAC3C,CAAC;IACD,qGAAqG;IAC9F,QAAQ,CAAC,MAAgB;QAC9B,OAAO,IAAI,CAAC,eAAe,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;IAC3C,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;IAgBD;;;;;;;;;;;;OAYG;IACI,qCAAqC,CAAC,OAAuB,EAAE,SAA0B;QAC9F,MAAM,CAAC,GAAG,IAAI,CAAC,4BAA4B,CAAC,OAAO,CAAC,CAAC;QACrD,MAAM,CAAC,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;QAC7B,cAAc,CAAC,qBAAqB,CAClC,IAAI,EACJ,+BAAc,CAAC,wBAAwB,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EACzD,SAAS,CAAC,CAAC;IACf,CAAC;IACD;;;;;;;;;;;OAWG;IACI,8BAA8B,CAAC,GAAmB,EAAE,UAAwB;QACjF,MAAM,SAAS,GAAG,UAAU,CAAC,SAAS,EAAE,CAAC;QACzC,IAAI,GAAG,CAAC,SAAS,IAAI,GAAG,CAAC,SAAS,KAAK,IAAI,IAAI,GAAG,CAAC,SAAS,GAAG,CAAC,EAAE,CAAC;YACjE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,GAAG,CAAC,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;gBACxC,MAAM,QAAQ,GAAG,CAAC,GAAG,GAAG,CAAC,SAAS,CAAC;gBACnC,UAAU,CAAC,qBAAqB,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;YACnD,CAAC;QACH,CAAC;QACD,OAAO,UAAU,CAAC,SAAS,EAAE,GAAG,SAAS,CAAC;IAC5C,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,qBAAqB,CAAC,KAAqB,EAAE,QAAwB,EAAE,SAA0B;QAC7G,IAAI,SAAS;YACX,SAAS,CAAC,mBAAmB,CAAC,QAAQ,CAAC,SAAS,EAAE,QAAQ,CAAC,WAAW,CAAC,CAAC;QAC1E,KAAK,CAAC,UAAU,GAAG,QAAQ,CAAC;IAC9B,CAAC;IACD;;;;;;;;OAQG;IACI,wBAAwB,CAC7B,cAAgC,EAAE,2BAAoC,EAAE,sBAA+B,KAAK;QAE5G,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC5B,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;IAYD;;;;;;;OAOG;IACI,uBAAuB,CAAC,IAAsB,EAAE,QAAkB;QACvE,OAAO,SAAS,CAAC,CAAC,6EAA6E;IACjG,CAAC;CACF;AAnyBD,wCAmyBC","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 */\nimport { assert } from \"@itwin/core-bentley\";\nimport { StrokeCountMap } from \"../curve/Query/StrokeCountMap\";\nimport { AxisOrder, Geometry, type PlaneAltitudeEvaluator } from \"../Geometry\";\nimport { Matrix3d } from \"../geometry3d/Matrix3d\";\nimport { Point3d, type Vector3d } from \"../geometry3d/Point3dVector3d\";\nimport { type Range1d, Range3d } from \"../geometry3d/Range\";\nimport { Ray3d } from \"../geometry3d/Ray3d\";\nimport { Transform } from \"../geometry3d/Transform\";\nimport { CurveIntervalRole, CurveLocationDetail, CurveSearchStatus } from \"./CurveLocationDetail\";\nimport { GeometryQuery } from \"./GeometryQuery\";\nimport { AppendPlaneIntersectionStrokeHandler } from \"./internalContexts/AppendPlaneIntersectionStrokeHandler\";\nimport { ClosestPointStrokeHandler } from \"./internalContexts/ClosestPointStrokeHandler\";\nimport { AnnounceTangentStrokeHandler } from \"./internalContexts/AnnounceTangentStrokeHandler\";\nimport { CurveLengthContext } from \"./internalContexts/CurveLengthContext\";\nimport { LineString3d } from \"./LineString3d\";\n\nimport type { AkimaCurve3d } from \"../bspline/AkimaCurve3d\";\nimport type { Arc3d } from \"./Arc3d\";\nimport type { BezierCurve3d } from \"../bspline/BezierCurve3d\";\nimport type { BSplineCurve3d } from \"../bspline/BSplineCurve\";\nimport type { Clipper } from \"../clipping/ClipUtils\";\nimport type { CurveChainWithDistanceIndex } from \"./CurveChainWithDistanceIndex\";\nimport type { DirectSpiral3d } from \"./spiral/DirectSpiral3d\";\nimport type { IntegratedSpiral3d } from \"./spiral/IntegratedSpiral3d\";\nimport type { InterpolationCurve3d } from \"../bspline/InterpolationCurve3d\";\nimport type { IStrokeHandler } from \"../geometry3d/GeometryHandler\";\nimport type { LineSegment3d } from \"./LineSegment3d\";\nimport type { OffsetOptions } from \"./OffsetOptions\";\nimport type { Plane3dByOriginAndUnitNormal } from \"../geometry3d/Plane3dByOriginAndUnitNormal\";\nimport type { Plane3dByOriginAndVectors } from \"../geometry3d/Plane3dByOriginAndVectors\";\nimport type { StrokeOptions } from \"./StrokeOptions\";\nimport type { VariantCurveExtendParameter } from \"./CurveExtendMode\";\n\n/**\n * Describes the concrete type of a [[CurvePrimitive]]. Each type name maps to a specific subclass and can be used\n * for type-switching in conditional statements.\n *  - \"arc\" => [[Arc3d]]\n *  - \"lineSegment\" => [[LineSegment3d]]\n *  - \"lineString\" => [[LineString3d]]\n *  - \"bsplineCurve\" => [[BSplineCurve3dBase]] which is an intermediate class implemented by [[BSplineCurve3d]] and\n * [[BSplineCurve3dH]]\n *  - \"bezierCurve\" => [[BezierCurveBase]] which is an intermediate class implemented by [[BezierCurve3d]] and\n * [[BezierCurve3dH]]\n *  - \"transitionSpiral\" => [[TransitionSpiral3d]]\n *  - \"curveChainWithDistanceIndex\" => [[CurveChainWithDistanceIndex]]\n * @see [Curve Collections]($docs/learning/geometry/CurvePrimitive.md) learning article.\n * @see [[AnyCurvePrimitive]] for a union type that supports compile-time type narrowing.\n * @public\n */\nexport type CurvePrimitiveType = \"arc\" | \"lineSegment\" | \"lineString\" | \"bsplineCurve\" | \"bezierCurve\" | \"transitionSpiral\" | \"curveChainWithDistanceIndex\" | \"interpolationCurve\" | \"akimaCurve\";\n/**\n * Union type for subclasses of [[CurvePrimitive]]. Specific subclasses can be discriminated at compile- or run-time\n * using [[CurvePrimitive.curvePrimitiveType]].\n * @public\n */\nexport type AnyCurvePrimitive = Arc3d | LineSegment3d | LineString3d | BSplineCurve3d | BezierCurve3d | DirectSpiral3d | IntegratedSpiral3d | CurveChainWithDistanceIndex | InterpolationCurve3d | AkimaCurve3d;\n/**\n * Union type for a linear [[CurvePrimitive]].\n * @public\n */\nexport type LinearCurvePrimitive = LineSegment3d | LineString3d;\n/**\n * Function signature for callback which announces a pair of numbers, such as a fractional interval, along with a\n * containing CurvePrimitive.\n * @public\n */\nexport type AnnounceNumberNumberCurvePrimitive = (a0: number, a1: number, cp: CurvePrimitive) => void;\n/**\n * Function signature for a callback which announces a pair of numbers\n * @public\n */\nexport type AnnounceNumberNumber = (a0: number, a1: number) => void;\n/** Function signature for a callback which announces a curve primitive\n * @public\n */\nexport type AnnounceCurvePrimitive = (cp: CurvePrimitive) => void;\n\n/**\n * Options for computing tangents to a curve from a fixed point `P`.\n * See [[CurvePrimitive.emitTangents]], [[CurvePrimitive.allTangents]], and [[CurvePrimitive.closestTangent]].\n * @public\n */\nexport interface TangentOptions {\n  /**\n   * The tangent point returned by [[CurvePrimitive.closestTangent]] is nearest to this point as seen in the view plane.\n   * * Default value is the fixed point `P`.\n   */\n  hintPoint?: Point3d,\n  /**\n   * Tangents are computed as seen in a view plane perpendicular to this vector.\n   * * Default value is (0,0,1), i.e., tangents are computed as seen in the top view.\n   */\n  vectorToEye?: Vector3d,\n  /** Stroke options for default stroke-based implementations. */\n  strokeOptions?: StrokeOptions,\n  /**\n   * Compute tangents to the curve extended according to variant type.\n   * * This option is ignored for linear segments and linestrings.\n   * * Default value is `false`.\n   */\n  extend?: VariantCurveExtendParameter,\n  /**\n   * Distance tolerance, interpreted as follows:\n   * * Maximum distance of `P` from the tangent plane at curve point `Q` in order for `Q-P` to be considered a\n   * tangent to the curve.\n   * * Minimum length of a line/stroke segment for which to consider computing a tangent.\n   * * Default value is [[Geometry.smallMetricDistance]].\n   */\n  distanceTol?: number,\n}\n\n/**\n * A curve primitive is bounded.\n * A curve primitive maps fractions in 0..1 to points in space.\n * As the fraction proceeds from 0 towards 1, the point moves \"forward\" along the curve.\n * True distance along the curve is not always strictly proportional to fraction.\n * * A LineSegment3d always has proportional fraction and distance.\n * * An Arc3d which is true circular has proportional fraction and distance.\n * * A LineString3d is not proportional (except for special case of all segments of equal length).\n * * A Spiral3d is proportional.\n * * A BsplineCurve3d is only proportional for special cases.\n * For fractions outside 0..1, the curve primitive class may either (a) return the near endpoint or (b) evaluate\n * an extended curve.\n * @public\n */\nexport abstract class CurvePrimitive extends GeometryQuery {\n  /** String name for schema properties */\n  public readonly geometryCategory = \"curvePrimitive\";\n  /** String name for schema properties */\n  public abstract readonly curvePrimitiveType: CurvePrimitiveType;\n  /** Constructor */\n  protected constructor() {\n    super();\n  }\n  /**\n   * Data attached during stroking for facets.\n   */\n  public strokeData?: StrokeCountMap;\n  /**\n   * Data attached in curve cutting.\n   * @internal\n   */\n  public startCut?: CurveLocationDetail;\n  /**\n   * Data attached in curve cutting.\n   * @internal\n   */\n  public endCut?: CurveLocationDetail;\n  /**\n   * Data attached by various algorithms (e.g. Region booleans)\n   */\n  public parent?: any;\n  /**\n   * Return the point (x,y,z) on the curve at fractional position.\n   * @param fraction fractional position along the geometry.\n   * @returns Returns a point on the curve.\n   */\n  public abstract fractionToPoint(fraction: number, result?: Point3d): Point3d;\n  /**\n   * Return the point (x,y,z) and derivative on the curve at fractional position.\n   * * Note that this derivative is \"derivative of xyz with respect to fraction\".\n   * * This derivative shows the speed of the \"fractional point\" moving along the curve.\n   * * This is not generally a unit vector. Use fractionToPointAndUnitTangent for a unit vector.\n   * @param fraction fractional position along the geometry.\n   * @returns Returns a ray whose origin is the curve point and direction is the derivative with respect to the fraction.\n   */\n  public abstract fractionToPointAndDerivative(fraction: number, result?: Ray3d): Ray3d;\n  /**\n   * Returns a ray whose origin is the curve point and direction is the unit tangent.\n   * @param fraction fractional position on the curve.\n   * @param result optional preallocated ray.\n   * @returns tangent ray with normalized direction or zero vector if the derivative vanishes.\n   */\n  public fractionToPointAndUnitTangent(fraction: number, result?: Ray3d): Ray3d {\n    const ray = this.fractionToPointAndDerivative(fraction, result);\n    ray.trySetDirectionMagnitudeInPlace(1.0);\n    return ray;\n  }\n  /**\n   * Returns the (absolute) curvature magnitude.\n   * * Base implementation in CurvePrimitive computes curvature from the first and second derivative vectors.\n   * @param fraction fractional position on the curve\n   */\n  public fractionToCurvature(fraction: number): number | undefined {\n    const data = this.fractionToPointAnd2Derivatives(fraction);\n    if (!data)\n      return undefined;\n    const cross = data.vectorU.crossProduct(data.vectorV);\n    const a = cross.magnitude();\n    const b = data.vectorU.magnitude();\n    return Geometry.conditionalDivideFraction(a, b * b * b);\n  }\n  /**\n   * Return a plane with\n   * * origin at fractional position along the curve\n   * * vectorU is the first derivative, i.e. tangent vector with length equal to the rate of change with respect to\n   * the fraction.\n   * * vectorV is the second derivative, i.e. derivative of vectorU which points in the direction of the curve's\n   * derivative's change.\n   * * **Note:** We are dealing with a parametric equation of the curve (a function f : R -> R^3) so first and\n   * second derivatives are in fact derivatives of the parametric equation.\n   */\n  public abstract fractionToPointAnd2Derivatives(\n    fraction: number, result?: Plane3dByOriginAndVectors\n  ): Plane3dByOriginAndVectors | undefined;\n  /**\n   * Construct a Frenet frame:\n   * * origin at the point on the curve\n   * * x axis is unit vector along the curve (tangent)\n   * * y axis is perpendicular and in the plane of the osculating circle. y axis is called \"main normal\"\n   * * z axis perpendicular to those. z axis is called \"bi-normal\"\n   */\n  public fractionToFrenetFrame(fraction: number, result?: Transform): Transform | undefined {\n    const plane = this.fractionToPointAnd2Derivatives(fraction);\n    if (!plane)\n      return undefined;\n    // first derivative (plane.vectorU) and second derivative (plane.vectorV) are not essentially\n    // perpendicular so we use createRigidFromColumns to make 3 perpendicular vectors.\n    let axes = Matrix3d.createRigidFromColumns(plane.vectorU, plane.vectorV, AxisOrder.XYZ);\n    if (axes)\n      return Transform.createRefs(plane.origin, axes, result);\n    // 2nd derivative not distinct. for example if curve is linear at fraction so second derivative is 0.\n    // in this case we find perpendicular vector to plane.vectorU and pass it to createRigidFromColumns.\n    const perpVector = Matrix3d.createPerpendicularVectorFavorXYPlane(plane.vectorU, plane.vectorV);\n    axes = Matrix3d.createRigidFromColumns(plane.vectorU, perpVector, AxisOrder.XYZ);\n    if (axes)\n      return Transform.createRefs(plane.origin, axes, result);\n    return undefined;\n  }\n  /**\n   * Construct signed distance from a point on the planar curve to its center of curvature (in xy only).\n   * * Positive distance means the center is to the left of the curve at fraction.\n   * * Negative distance means the center is to the right of the curve at fraction.\n   * * Zero distance means curve is linear at fraction.\n   */\n  public fractionToSignedXYRadiusOfCurvature(fraction: number): number {\n    const plane = this.fractionToPointAnd2Derivatives(fraction);\n    if (!plane)\n      return 0.0;\n    const cross = plane.vectorU.crossProductXY(plane.vectorV);\n    const b = plane.vectorU.magnitude();\n    if (b === 0.0)\n      return 0.0;\n    const r = Geometry.conditionalDivideCoordinate(b * b * b, cross);\n    if (r !== undefined)\n      return r;\n    return 0.0;\n  }\n  /**\n   * Construct a point extrapolated along tangent at fraction.\n   * @param fraction fractional position on the primitive\n   * @param distance (signed) distance to move on the tangent.\n   */\n  public fractionAndDistanceToPointOnTangent(fraction: number, distance: number): Point3d {\n    const ray = this.fractionToPointAndUnitTangent(fraction);\n    return ray.fractionToPoint(distance);\n  }\n  /**\n   * Return the length of the curve.\n   * * Curve length is always positive.\n   */\n  public curveLength(): number {\n    const context = new CurveLengthContext();\n    this.emitStrokableParts(context);\n    return context.getSum();\n  }\n  /**\n   * Returns a (high accuracy) length of the curve between fractional positions.\n   * * Curve length is always positive.\n   * * Default implementation applies a generic Gaussian integration.\n   * * Most curve classes (certainly LineSegment, LineString, Arc) are expected to provide efficient implementations.\n   */\n  public curveLengthBetweenFractions(fraction0: number, fraction1: number): number {\n    if (fraction0 === fraction1)\n      return 0.0;\n    const scale = this.getFractionToDistanceScale();\n    if (scale !== undefined) {\n      // We are in luck! simple proportions determine it all !!!\n      // (for example, a LineSegment3d or a circular arc)\n      const totalLength = this.curveLength();\n      return Math.abs((fraction1 - fraction0) * totalLength);\n    }\n    const context = new CurveLengthContext(fraction0, fraction1);\n    this.emitStrokableParts(context);\n    return Math.abs(context.getSum());\n  }\n  /**\n   * Returns the range of the curve between fractional positions.\n   * * Default implementation calls [[rangeBetweenFractionsByClone]].\n   */\n  public rangeBetweenFractions(fraction0: number, fraction1: number, transform?: Transform): Range3d {\n    return this.rangeBetweenFractionsByClone(fraction0, fraction1, transform);\n  }\n  /** Returns a high accuracy range of the curve between fractional positions using [[clonePartialCurve]]. */\n  public rangeBetweenFractionsByClone(fraction0: number, fraction1: number, transform?: Transform): Range3d {\n    if (fraction0 === fraction1)\n      return Range3d.create(this.fractionToPoint(fraction0));\n    const fragment = this.clonePartialCurve(fraction0, fraction1);\n    if (fragment)\n      return fragment.range(transform);\n    return Range3d.createNull();\n  }\n  /**\n   * Returns an approximate range based on a fixed number of evaluations.\n   * * Default implementation returns a range determined by evaluating a specified number of points on the curve.\n   * * Optionally evaluate again at interval midpoints and extrapolate any increase.\n   * * For a smooth curve, Richardson extrapolation suggests each subdivision moves 3/4 of the way to final. So\n   * extrapolationFactor of 1/3 speculatively moves closer to the tight range, and larger multipliers increase\n   * confidence in being safely larger.\n   * * This function is faster to compute the range of a portion of a curve, because some curves can be\n   * expensive to compute the partial curve and/or to compute the partial curve's range.\n   * @param fraction0 start fraction for evaluation\n   * @param fraction1 end fraction for evaluation\n   * @param count number of points to evaluate\n   * @param transform optional transform to be applied to the curve\n   * @param extrapolationFactor if positive, evaluate again at interval midpoints and apply this fraction multiplier\n   * to any increase in size.\n   */\n  public rangeBetweenFractionsByCount(\n    fraction0: number, fraction1: number, count: number, transform?: Transform, extrapolationFactor: number = 0.0,\n  ): Range3d {\n    const range = Range3d.createNull();\n    const workPoint = Point3d.create();\n    range.extendPoint(this.startPoint(workPoint));\n    range.extendPoint(this.endPoint(workPoint));\n    // Evaluate at count fractions (fraction0 + i * fractionStep)\n    const evaluateSteps = (fractionA: number, fractionStep: number, countA: number) => {\n      let f = fractionA;\n      for (let i = 0; i < countA; i++, f += fractionStep) {\n        this.fractionToPoint(f, workPoint);\n        if (transform)\n          range.extendTransformedPoint(transform, workPoint);\n        else\n          range.extendPoint(workPoint);\n      }\n    };\n    const interiorCount = count - 2;\n    if (interiorCount > 0) {\n      const localFraction0 = 1.0 / (interiorCount + 1);\n      const globalFractionStep = localFraction0 * (fraction1 - fraction0);\n      evaluateSteps(fraction0 + globalFractionStep, globalFractionStep, interiorCount);\n    }\n    if (extrapolationFactor > 0.0) {\n      // Evaluate at midpoints.  Where this makes the range larger, apply extrapolationFactor to move it to safer\n      // excess value. same interior step, but shift to interval midpoints.\n      const baseRange = range.clone();\n      const interiorCount1 = interiorCount + 1;\n      const localFraction0 = 0.5 / interiorCount1;  // we only evaluate at new midpoints.\n      const globalFractionStep = 2 * localFraction0 * (fraction1 - fraction0); // same as above, but avoids special logic for interiorCount = 0\n      evaluateSteps(fraction0 + globalFractionStep * 0.5, globalFractionStep, interiorCount1);\n      range.extendWhenLarger(baseRange, extrapolationFactor);\n    }\n    return range;\n  }\n  /**\n   * Run an integration (with a default Gaussian quadrature) with a fixed fractional step\n   * * This is typically called by specific curve type implementations of curveLengthBetweenFractions.\n   * * For example, in Arc3d implementation of curveLengthBetweenFractions:\n   *     * If the Arc3d is true circular, it the arc is true circular, use the direct `arcLength = radius * sweepRadians`\n   *     * If the Arc3d is not true circular, call this method with an interval count appropriate to eccentricity and\n   * sweepRadians.\n   * @returns Returns the curve length via an integral estimated by numerical quadrature between the fractional positions.\n   * @param fraction0 start fraction for integration\n   * @param fraction1 end fraction for integration\n   * @param numInterval number of quadrature intervals\n   */\n  public curveLengthWithFixedIntervalCountQuadrature(\n    fraction0: number, fraction1: number, numInterval: number, numGauss: number = 5,\n  ): number {\n    if (fraction0 > fraction1) {\n      const fSave = fraction0;\n      fraction0 = fraction1;\n      fraction1 = fSave;\n    }\n    const context = new CurveLengthContext(fraction0, fraction1, numGauss);\n    context.announceIntervalForUniformStepStrokes(this, numInterval, fraction0, fraction1);\n    return Math.abs(context.getSum());\n  }\n  /**\n   * (Attempt to) find a position on the curve at a signed distance from start fraction.\n   * * Return the position as a CurveLocationDetail.\n   * * In the `CurveLocationDetail`, record:\n   *   * `fraction` = fractional position\n   *   * `point` = coordinates of the point\n   *   * `a` = (signed!) distance moved.   If `allowExtension` is false and the move reached the start or end of the\n   * curve, this distance is smaller than the requested signedDistance.\n   *   * `curveSearchStatus` indicates one of:\n   *     * `error` (unusual) computation failed not supported for this curve.\n   *     * `success` full movement completed\n   *     * `stoppedAtBoundary` partial movement completed. This can be due to either\n   *        * `allowExtension` parameter sent as `false`\n   *        * the curve type (e.g. bspline) does not support extended range.\n   * * if `allowExtension` is true, movement may still end at the startPoint or end point for curves that do not support\n   * extended geometry (specifically bsplines)\n   * * if the curve returns a value (i.e. not `undefined`) for `curve.getFractionToDistanceScale()`, the base class\n   * carries out the computation\n   *    and returns a final location.\n   *   * LineSegment3d relies on this.\n   * * If the curve does not implement the computation or the curve has zero length, the returned `CurveLocationDetail`\n   * has\n   *    * `fraction` = the value of `startFraction`\n   *    * `point` = result of `curve.fractionToPoint(startFraction)`\n   *    * `a` = 0\n   *    * `curveStartState` = `CurveSearchStatus.error`\n   * @param startFraction fractional position where the move starts\n   * @param signedDistance distance to move.   Negative distance is backwards in the fraction space\n   * @param allowExtension if true, allow the move to go beyond the startPoint or endpoint of the curve.  If false,\n   * do not allow movement beyond the startPoint or endpoint\n   * @param result optional result.\n   * @returns A CurveLocationDetail annotated as above. Note that if the curve does not support the calculation, there is\n   * still a result which contains the point at the input startFraction, with failure indicated in the `curveSearchStatus`\n   * member.\n   */\n  public moveSignedDistanceFromFraction(\n    startFraction: number, signedDistance: number, allowExtension: boolean, result?: CurveLocationDetail,\n  ): CurveLocationDetail {\n    const scale = this.getFractionToDistanceScale();\n    if (scale !== undefined) {\n      // We are in luck! simple proportions determine it all  !!!\n      // (for example, a LineSegment3d or a circular arc)\n      const totalLength = this.curveLength();\n      const signedFractionMove = Geometry.conditionalDivideFraction(signedDistance, totalLength);\n      if (signedFractionMove === undefined) {\n        return CurveLocationDetail.createCurveFractionPointDistanceCurveSearchStatus(\n          this, startFraction, this.fractionToPoint(startFraction), 0.0, CurveSearchStatus.error);\n      }\n      return CurveLocationDetail.createConditionalMoveSignedDistance(\n        allowExtension,\n        this,\n        startFraction,\n        startFraction + signedFractionMove,\n        signedDistance,\n        result,\n      );\n    }\n    return this.moveSignedDistanceFromFractionGeneric(startFraction, signedDistance, allowExtension, result);\n  }\n  /**\n   * Generic algorithm to search for point at signed distance from a fractional startPoint.\n   * * This will work for well for smooth curves.\n   * * Curves with tangent or other low-order-derivative discontinuities may need to implement specialized algorithms.\n   * * We need to find an endFraction which is the end-of-interval (usually upper) limit of integration of the tangent\n   * magnitude from startFraction to endFraction\n   * * That integral is a function of endFraction.\n   * * The derivative of that integral with respect to end fraction is the tangent magnitude at end fraction.\n   * * Use that function and (easily evaluated!) derivative for a Newton iteration\n   * * TO ALL WHO HAVE FUZZY MEMORIES OF CALCULUS CLASS: \"The derivative of the integral wrt upper limit is the value\n   * of the integrand there\" is the fundamental theorem of integral calculus !!! The fundamental theorem is not just\n   * an abstraction !!! It is being used  here in its barest possible form !!!\n   * * See https://en.wikipedia.org/wiki/Fundamental_theorem_of_calculus\n   * @param startFraction\n   * @param signedDistance\n   * @param _allowExtension\n   * @param result\n   */\n  protected moveSignedDistanceFromFractionGeneric(\n    startFraction: number, signedDistance: number, allowExtension: boolean, result?: CurveLocationDetail,\n  ): CurveLocationDetail {\n    let limitFraction: number;\n    const slackFraction = 0.1;  // slack to use when integration would otherwise have no room to work\n    if (signedDistance === 0.0)\n      return CurveLocationDetail.createCurveEvaluatedFraction(this, startFraction, result); // no movement, just evaluate at startFraction\n    if (signedDistance > 0.0) {\n      limitFraction = 1.0;\n      if (startFraction >= 1.0) {\n        const newStartFraction = 1.0 - slackFraction;\n        signedDistance += this.curveLengthBetweenFractions(newStartFraction, startFraction);\n        startFraction = newStartFraction;\n      }\n    } else { // signedDistance < 0.0\n      limitFraction = 0.0;\n      if (startFraction <= 0.0) {\n        const newStartFraction = 0.0 + slackFraction;\n        signedDistance -= this.curveLengthBetweenFractions(startFraction, newStartFraction);\n        startFraction = newStartFraction;\n      }\n    }\n    const availableLength = this.curveLengthBetweenFractions(startFraction, limitFraction);\n    assert(availableLength > 0.0);\n    const absDistance = Math.abs(signedDistance);\n    if (availableLength < absDistance && !allowExtension)\n      return CurveLocationDetail.createConditionalMoveSignedDistance(allowExtension, this, startFraction, limitFraction, signedDistance, result);\n\n    const fractionStep = Geometry.conditionalDivideCoordinate(absDistance, availableLength);\n    if (undefined === fractionStep) {\n      // no available length!\n      result = CurveLocationDetail.createCurveEvaluatedFraction(this, startFraction, result);\n      result.curveSearchStatus = CurveSearchStatus.error;\n      return result;\n    }\n    const directionFactor = signedDistance < 0.0 ? -1.0 : 1.0;\n    let fractionB = Geometry.interpolate(startFraction, fractionStep, limitFraction);\n    let fractionA = startFraction;\n    let distanceA = 0.0;\n    const tol = 1.0e-12 * availableLength;\n    let numConverged = 0;\n    const tangent = Ray3d.createXAxis();\n    // on each loop entry:\n    // fractionA is the most recent endOfInterval.  (It may have been reached by a mixture of forward and backward step.)\n    // distanceA is the distance to (the point at) fractionA\n    // fractionB is the next end fraction\n    for (let iterations = 0; iterations < 10; iterations++) {\n      const distanceAB = this.curveLengthBetweenFractions(fractionA, fractionB);\n      const directionAB = fractionB > fractionA ? directionFactor : -directionFactor;\n      const distance0B = distanceA + directionAB * distanceAB;\n      const distanceError = absDistance - distance0B;\n      if (Math.abs(distanceError) < tol) {\n        numConverged++;\n        if (numConverged > 1)\n          break;\n      } else {\n        numConverged = 0;\n      }\n      this.fractionToPointAndDerivative(fractionB, tangent);\n      const tangentMagnitude = tangent.direction.magnitude();\n      fractionA = fractionB;\n      fractionB = fractionA + directionFactor * distanceError / tangentMagnitude;\n      if (fractionA === fractionB) { // YES -- that is an exact equality test.   When it happens, there's no need for confirming with another iteration.\n        numConverged = 100;\n        break;\n      }\n      distanceA = distance0B;\n    }\n    if (numConverged > 1)\n      return CurveLocationDetail.createConditionalMoveSignedDistance(\n        allowExtension, this, startFraction, fractionB, signedDistance, result,\n      );\n    result = CurveLocationDetail.createCurveEvaluatedFraction(this, startFraction, result);\n    result.curveSearchStatus = CurveSearchStatus.error;\n    return result;\n  }\n  /**\n   * * Returns true if the curve can be easily extended past its start/end point (i.e., beyond the usual\n   * fraction space [0,1]). Otherwise, returns false.\n   * * Base class default implementation returns false.\n   * * These classes (and perhaps others in the future) will return true:\n   *   * LineSegment3d\n   *   * LineString3d\n   *   * Arc3d\n   */\n  public get isExtensibleFractionSpace(): boolean {\n    return false;\n  }\n  /**\n   * Compute a length for curve which may be a fast approximation to the true length.\n   * This is expected to be either (a) exact or (b) larger than the actual length, but by no more than\n   * a small multiple, perhaps up to PI/2, but commonly much closer to 1.\n   *\n   * * An example use of this is for setting a tolerance which is a small multiple of the curve length.\n   * * Simple line, circular arc, and transition spiral may return exact length\n   * * Ellipse may return circumference of some circle or polygon that encloses the ellipse.\n   * * bspline curve may return control polygon length\n   * *\n   */\n  public abstract quickLength(): number;\n  /**\n   * Search for a point on the curve that is closest to the spacePoint.\n   * * If the space point is exactly on the curve, this is the reverse of fractionToPoint.\n   * * Since CurvePrimitive should always have start and end available as candidate points, this method should always\n   * succeed.\n   * @param spacePoint point in space.\n   * @param extend (optional) compute the closest point to the curve extended according to variant type (default false).\n   * @param result (optional) pre-allocated detail to populate and return.\n   * @returns details `d` of the closest point. The distance from spacePoint to the closest point is stored in `d.a`.\n   */\n  public closestPoint(\n    spacePoint: Point3d, extend: VariantCurveExtendParameter = false, result?: CurveLocationDetail,\n  ): CurveLocationDetail | undefined {\n    const strokeHandler = new ClosestPointStrokeHandler(spacePoint, extend, result);\n    this.emitStrokableParts(strokeHandler);\n    return strokeHandler.claimResult();\n  }\n  /**\n   * Search for a point on the curve that is closest to `spacePoint`, ignoring z-coordinates.\n   * * This is equivalent to finding the closest point as seen in the top view.\n   * * If the space point is exactly on the curve, this is the reverse of fractionToPoint.\n   * * Since CurvePrimitive should always have start and end available as candidate points, this method should always\n   * succeed.\n   * @param spacePoint point in space.\n   * @param extend (optional) compute the closest point to the curve extended according to variant type (default false).\n   * @param result (optional) pre-allocated detail to populate and return.\n   * @returns details `d` of the closest point. The distance from spacePoint to the closest point is stored in `d.a`.\n   */\n  public closestPointXY(\n    spacePoint: Point3d, extend: VariantCurveExtendParameter = false, result?: CurveLocationDetail,\n  ): CurveLocationDetail | undefined {\n    const strokeHandler = new ClosestPointStrokeHandler(spacePoint, extend, result, true);\n    this.emitStrokableParts(strokeHandler);\n    return strokeHandler.claimResult();\n  }\n  /**\n   * Announce all points `P` on the curve such that the line containing `spacePoint` and `P` is tangent to the curve in\n   * 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    this.emitStrokableParts(strokeHandler, options?.strokeOptions);\n  }\n  /**\n   * Return all points `P` on the curve such that the line containing `spacePoint` and `P` is tangent to the curve in\n   * 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 curve such that the line containing `spacePoint` and `P` is tangent to the curve in\n   * 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  /**\n   * Find intervals of this curve that are interior to the clipper.\n   * * Default implementation calls `clipper.announceClippedCurveIntervals`; subclasses can implement more efficiently as necessary.\n   * @param clipper clip structure (e.g. clip planes)\n   * @param announce (optional) called to announce each fractional interval: `announce(fraction0, fraction1, this)`\n   * @returns true if any \"in\" segments are announced.\n   */\n  public announceClipIntervals(clipper: Clipper, announce?: AnnounceNumberNumberCurvePrimitive): boolean {\n    return clipper.announceClippedCurveIntervals?.(this, announce) ?? false;\n  }\n  /** Return a deep clone. */\n  public abstract override clone(): CurvePrimitive;\n  /** Return a transformed deep clone. */\n  public abstract override cloneTransformed(transform: Transform): CurvePrimitive | undefined;\n  /**\n   * Return (if possible) a curve primitive which is a portion of this curve.\n   * @param _fractionA [in] start fraction\n   * @param _fractionB [in] end fraction\n   */\n  public clonePartialCurve(_fractionA: number, _fractionB: number): CurvePrimitive | undefined {\n    return undefined;\n  }\n  /**\n   * If the curve primitive has distance-along-curve strictly proportional to curve fraction, return the scale factor.\n   * If distance-along-the-curve is not proportional, return undefined.\n   * * When defined, the scale factor is always the length of the curve.\n   * * This scale factor is typically available for these curve types:\n   * * * All `LineSegment3d`\n   * * * Arc3d which is a true circular arc (axes perpendicular and of equal length).\n   * * * CurveChainWithDistanceIndex\n   * * This scale factor is undefined for these curve types:\n   * * * Arc3d which is a true ellipse, i.e. unequal lengths of defining vectors or non-perpendicular defining vectors.\n   * * * bspline and bezier curves\n   * @returns scale factor or undefined\n   */\n  public getFractionToDistanceScale(): number | undefined {\n    return undefined;\n  }\n  /** Reverse the curve's data so that its fractional stroking moves in the opposite direction. */\n  public abstract reverseInPlace(): void;\n  /** Call [[reverseInPlace]] and return the instance. */\n  public reverse(): this {\n    this.reverseInPlace();\n    return this;\n  }\n  /**\n   * Compute intersections of the curve with a plane.\n   * * The intersections are appended to the result array.\n   * * The base class implementation emits strokes to an AppendPlaneIntersectionStrokeHandler object, which uses a\n   * Newton iteration to get high-accuracy intersection points within strokes.\n   * * Derived classes should override this default implementation if there are easy analytic solutions.\n   * * Derived classes are free to implement extended intersections (e.g. arc!!!)\n   * @param plane The plane to be intersected.\n   * @param result Array to receive intersections\n   * @returns Return the number of CurveLocationDetail's added to the result array.\n   */\n  public appendPlaneIntersectionPoints(plane: PlaneAltitudeEvaluator, result: CurveLocationDetail[]): number {\n    const strokeHandler = new AppendPlaneIntersectionStrokeHandler(plane, result);\n    const n0 = result.length;\n    this.emitStrokableParts(strokeHandler);\n    return result.length - n0;\n  }\n  /**\n   * Examine contents of an array of CurveLocationDetail.\n   * Filter the intersections according to the parameters.\n   * @param allowExtend if false, remove points on the extension.\n   * @param applySnappedCoordinates if true, change the stored fractions and coordinates to exact end values.\n   * Otherwise use the exact values only for purpose of updating the curveIntervalRole.\n   * @param startEndFractionTolerance if nonzero, adjust fraction to 0 or 1 with this tolerance.\n   * @param startEndXYZTolerance if nonzero, adjust to endpoint with this tolerance.\n   * @internal\n   */\n  public static snapAndRestrictDetails(\n    details: CurveLocationDetail[],\n    allowExtend: boolean = true,\n    applySnappedCoordinates: boolean = false,\n    startEndFractionTolerance = Geometry.smallAngleRadians,\n    startEndXYZTolerance = Geometry.smallMetricDistance,\n  ): void {\n    const n0 = details.length;\n    let acceptIndex = 0;\n    const point0 = Point3d.create();\n    const point1 = Point3d.create();\n    let snappedCoordinates: Point3d | undefined;\n    for (let candidateIndex = 0; candidateIndex < n0; candidateIndex++) {\n      snappedCoordinates = undefined;\n      const detail = details[candidateIndex];\n      let fraction = detail.fraction;\n      let accept = allowExtend || Geometry.isIn01(fraction);\n      if (detail.curve) {\n        detail.curve.startPoint(point0);\n        detail.curve.endPoint(point1);\n      }\n      if (startEndFractionTolerance > 0) {\n        if (Math.abs(fraction) < startEndFractionTolerance) {\n          fraction = 0.0;\n          accept = true;\n          detail.intervalRole = CurveIntervalRole.isolatedAtVertex;\n          snappedCoordinates = point0;\n        }\n        if (Math.abs(fraction - 1.0) < startEndFractionTolerance) {\n          fraction = 1.0;\n          accept = true;\n          detail.intervalRole = CurveIntervalRole.isolatedAtVertex;\n          snappedCoordinates = point1;\n          if (detail.curve)\n            snappedCoordinates = detail.curve.startPoint(point1);\n        }\n      }\n      if (startEndXYZTolerance > 0 && detail.curve !== undefined) {\n        // REMARK: always test both endpoints.   If there is a cyclic fraction space, an intersection marked as \"after\" the end might have wrapped all the way to the beginning.\n        if (detail.point.distance(point0) <= startEndXYZTolerance) {\n          fraction = 0.0;\n          detail.intervalRole = CurveIntervalRole.isolatedAtVertex;\n          snappedCoordinates = point0;\n        } else if (detail.point.distance(point1) <= startEndXYZTolerance) {\n          fraction = 1.0;\n          detail.intervalRole = CurveIntervalRole.isolatedAtVertex;\n          snappedCoordinates = point1;\n        }\n      }\n      if (accept) {\n        if (applySnappedCoordinates) {\n          detail.fraction = fraction;\n          if (snappedCoordinates !== undefined)\n            detail.point.setFrom(snappedCoordinates);\n        }\n        if (acceptIndex < candidateIndex)\n          details[acceptIndex] = detail;\n        acceptIndex++;\n      }\n    }\n    if (acceptIndex < n0)\n      details.length = acceptIndex;\n  }\n  /**\n   * Ask if the curve is within tolerance of a plane.\n   * @returns Returns true if the curve is completely within tolerance of the plane.\n   */\n  public abstract isInPlane(plane: Plane3dByOriginAndUnitNormal): boolean;\n  /** Return the startPoint of the primitive. The default implementation returns fractionToPoint(0.0) */\n  public startPoint(result?: Point3d): Point3d {\n    return this.fractionToPoint(0.0, result);\n  }\n  /** Return the end point of the primitive. The default implementation returns fractionToPoint(1.0) */\n  public endPoint(result?: Point3d): Point3d {\n    return this.fractionToPoint(1.0, result);\n  }\n  /**\n   * Whether the 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  /** Append stroke points to caller-supplied linestring. */\n  public abstract emitStrokes(dest: LineString3d, options?: StrokeOptions): void;\n  /**\n   * Ask the curve to announce points and simple subcurve fragments for stroking.\n   * See IStrokeHandler for description of the sequence of the method calls.\n   */\n  public abstract emitStrokableParts(dest: IStrokeHandler, options?: StrokeOptions): void;\n  /**\n   * Return the stroke count required for given options.\n   * * This returns a single number\n   * * See [[computeAndAttachRecursiveStrokeCounts]] to get structured per-component counts and fraction mappings.\n   * @param options StrokeOptions that determine count\n   */\n  public abstract computeStrokeCountForOptions(options?: StrokeOptions): number;\n  /**\n   * Attach StrokeCountMap structure to this primitive (and recursively to any children)\n   * * Base class implementation (here) gets the simple count from [[computeStrokeCountForOptions]] and attaches it.\n   * * [[LineString3d]], [[Arc3d]], [[BezierCurve3d]], [[BezierCurve3dH]] accept that default.\n   * * Subdivided primitives ([[LineString3d]], [[BSplineCurve3d]]) implement themselves and attach a StrokeCountMap containing the\n   *       total count, and also containing an array of StrokeCountMap per component.\n   * * For [[CurveChainWithDistanceIndex]], the top level gets (only) a total count, and each child gets\n   *       its own StrokeCountMap with appropriate structure.\n   * @param options StrokeOptions that determine count\n   * @param parentStrokeMap optional map from parent.  Its count, curveLength, and a1 values are increased with count\n   * and distance from this primitive.\n   * @return sum of `a0+this.curveLength()`, for use as `a0` of successor in chain.\n   */\n  public computeAndAttachRecursiveStrokeCounts(options?: StrokeOptions, parentMap?: StrokeCountMap) {\n    const n = this.computeStrokeCountForOptions(options);\n    const a = this.curveLength();\n    CurvePrimitive.installStrokeCountMap(\n      this,\n      StrokeCountMap.createWithCurvePrimitive(this, n, a, 0, a),\n      parentMap);\n  }\n  /**\n   * Evaluate strokes at fractions indicated in a StrokeCountMap.\n   *   * Base class implementation (here) gets the simple count from [[computeStrokeCountForOptions]] and strokes at\n   * uniform fractions.\n   *   * [[LineString3d]], [[Arc3d]], [[BezierCurve3d]], [[BezierCurve3dH]] accept that default.\n   *   * Subdivided primitives ([[LineString3d]], [[BSplineCurve3d]]) implement themselves and evaluate within components.\n   *   * [[CurveChainWithDistanceIndex]] recurses to its children.\n   * * if packedFraction and packedDerivative arrays are present in the LineString3d, fill them.\n   * @param map = stroke count data.\n   * @param linestring = receiver linestring.\n   * @return number of strokes added.  0 if any errors matching the map to the curve primitive.\n   */\n  public addMappedStrokesToLineString3D(map: StrokeCountMap, linestring: LineString3d): number {\n    const numPoint0 = linestring.numPoints();\n    if (map.primitive && map.primitive === this && map.numStroke > 0) {\n      for (let i = 0; i <= map.numStroke; i++) {\n        const fraction = i / map.numStroke;\n        linestring.appendFractionToPoint(this, fraction);\n      }\n    }\n    return linestring.numPoints() - numPoint0;\n  }\n  /**\n   * Final install step to save curveMap in curve. If parentMap is given, update its length, count, and a1 fields\n   * @param curve curve to receive the annotation\n   * @param map\n   * @param parentMap\n   */\n  public static installStrokeCountMap(curve: CurvePrimitive, curveMap: StrokeCountMap, parentMap?: StrokeCountMap) {\n    if (parentMap)\n      parentMap.addToCountAndLength(curveMap.numStroke, curveMap.curveLength);\n    curve.strokeData = curveMap;\n  }\n  /**\n   * Return an array containing only the curve primitives.\n   * * This DEFAULT implementation simply pushes `this` to the collectorArray.\n   * @param collectorArray array to receive primitives (pushed -- the array is not cleared)\n   * @param smallestPossiblePrimitives if true, a [[CurveChainWithDistanceIndex]] recurses on its (otherwise hidden)\n   * children. If false, it returns only itself.\n   * @param explodeLinestrings if true, push a [[LineSegment3d]] for each segment of a [[LineString3d]]. If false,\n   * push only the [[LineString3d]].\n   */\n  public collectCurvePrimitivesGo(\n    collectorArray: CurvePrimitive[], _smallestPossiblePrimitives: boolean, _explodeLinestrings: boolean = false,\n  ): void {\n    collectorArray.push(this);\n  }\n  /**\n   * Return an array containing only the curve primitives.\n   * * This DEFAULT implementation captures the optional collector and calls [[collectCurvePrimitivesGo]].\n   * @param collectorArray optional array to receive primitives.   If present, new primitives are ADDED (without\n   * clearing the array.)\n   * @param smallestPossiblePrimitives if false (default), a [[CurveChainWithDistanceIndex]] returns only itself;\n   * otherwise, it recurses to its (otherwise hidden) children.\n   * @param explodeLinestrings whether to return [[LineSegment3d]]s for a [[LineString3d]] (default false).\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   * Construct an offset of the instance curve as viewed in the xy-plane (ignoring z).\n   * * No attempt is made to join the offsets of smaller constituent primitives. To construct a fully joined offset\n   * for an aggregate instance (e.g., LineString3d, CurveChainWithDistanceIndex), use [[CurveOps.constructCurveXYOffset]]\n   * instead.\n   * @param offsetDistanceOrOptions offset distance (positive to left of the instance curve), or options object\n   */\n  public abstract constructOffsetXY(\n    offsetDistanceOrOptions: number | OffsetOptions\n  ): CurvePrimitive | CurvePrimitive[] | undefined;\n\n  /**\n   * Project instance geometry (via dispatch) onto the line of the given ray, and return the extreme fractional\n   * parameters 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 undefined; // common implementation delegated to subclasses to avoid circular dependency\n  }\n}\n"]}

package/lib/cjs/curve/Query/PlanarSubdivision.d.ts

@@ -35,11 +35,11 @@ export declare class PlanarSubdivision {
     /**
      * Based on computed (and toleranced) area, push the loop (pointer) onto the appropriate array of positive, negative,
      * or sliver loops.
-     * @param zeroAreaTolerance absolute area tolerance for sliver face detection
+     * @param areaTol absolute area tolerance for sliver face detection
      * @param isSliverFace whether the loop is known a priori (e.g., via topology) to have zero area
      * @returns the area (forced to zero if within tolerance)
      */
-    static collectSignedLoop(loop: Loop, outLoops: SignedLoops, zeroAreaTolerance?: number, isSliverFace?: boolean): number;
+    static collectSignedLoop(loop: Loop, outLoops: SignedLoops, areaTol?: number, isSliverFace?: boolean): number;
     /** Extract geometric info from a topological edge. */
     private static extractGeometryFromEdge;
     /** Create the geometry for a topological edge. */
@@ -63,7 +63,7 @@ export declare class PlanarSubdivision {
     private static isNullFace;
     /** Look across edge mates (possibly several) for a non-null mate face. */
     private static getNonNullEdgeMate;
-    static collectSignedLoopSetsInHalfEdgeGraph(graph: HalfEdgeGraph, zeroAreaTolerance?: number): SignedLoops[];
+    static collectSignedLoopSetsInHalfEdgeGraph(graph: HalfEdgeGraph, closureTol?: number, areaTol?: number): SignedLoops[];
 }
 /**
  * @internal