@itwin/core-geometry 4.2.0-dev.9 → 4.3.0-dev.1

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

@@ -1 +1 @@
-{"version":3,"file":"CurveChainWithDistanceIndex.js","sourceRoot":"","sources":["../../../src/curve/CurveChainWithDistanceIndex.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F;;GAEG;AAEH,4DAAyD;AACzD,kEAA+D;AAC/D,0CAAuC;AAIvC,mEAAkE;AAClE,+CAAuD;AAGvD,uDAA+C;AAC/C,uDAAqG;AACrG,+DAA4D;AAE5D,4FAAyF;AAEzF,mDAAgD;AAChD,iCAA8B;AAG9B;;;;;;GAMG;AACH,MAAa,YAAY;IAevB,yEAAyE;IACzE,YACE,cAAsB,EAAE,cAAsB,EAC9C,SAAiB,EAAE,SAAiB,EACpC,UAA0B,EAAE,KAAe;QAE3C,IAAI,CAAC,cAAc,GAAG,cAAc,CAAC;QACrC,IAAI,CAAC,cAAc,GAAG,cAAc,CAAC;QACrC,IAAI,CAAC,cAAc,GAAG,SAAS,CAAC;QAChC,IAAI,CAAC,cAAc,GAAG,SAAS,CAAC;QAChC,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;QAC7B,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;IACb,CAAC;IACD;;;OAGG;IACI,qBAAqB,CAAC,QAAgB;QAC3C,OAAO,QAAQ,IAAI,IAAI,CAAC,cAAc,IAAI,QAAQ,IAAI,IAAI,CAAC,cAAc,CAAC;IAC5E,CAAC;IACD,0GAA0G;IACnG,4BAA4B,CAAC,UAAmB;QACrD,IAAI,IAAI,CAAC,KAAK,EAAE;YACd,OAAO,IAAI,CAAC,KAAK,CAAC,eAAe,CAAC,UAAU,CAAC,CAAC;SAC/C;QACD,uCAAuC;QACvC,MAAM,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC,YAAY,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;QAC/D,IAAI,MAAM;YACR,OAAO,MAAM,CAAC,CAAC,CAAC;QAClB,OAAO,CAAC,CAAC;IACX,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,8BAA8B,CAAC,SAAyB,EAAE,UAAmB;QACzF,MAAM,eAAe,GAAmB,EAAE,CAAC;QAC3C,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE;YACzB,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,4BAA4B,CAAC,UAAU,CAAC,CAAC;YACjD,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;SACzB;QACD,eAAe,CAAC,IAAI,CAAC,CAAC,CAAe,EAAE,CAAe,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACtE,OAAO,eAAe,CAAC;IACzB,CAAC;IACD;;;OAGG;IACI,kCAAkC,CAAC,KAAqB,EAAE,QAAgB;QAC/E,OAAO,IAAI,CAAC,UAAU,KAAK,KAAK,IAAI,QAAQ,IAAI,IAAI,CAAC,cAAc,IAAI,QAAQ,IAAI,IAAI,CAAC,cAAc,CAAC;IACzG,CAAC;IACD;;;OAGG;IACI,wCAAwC,CAAC,QAAgB;QAC9D,OAAO,mBAAQ,CAAC,kBAAkB,CAChC,IAAI,CAAC,cAAc,EAAE,IAAI,CAAC,cAAc,EACxC,IAAI,CAAC,cAAc,EAAE,IAAI,CAAC,cAAc,EACxC,QAAQ,EAAE,IAAI,CAAC,cAAc,CAAE,CAAC,CAAC,wEAAwE;IAC7G,CAAC;IACD,gGAAgG;IACzF,oCAAoC,CAAC,aAAqB,EAAE,kBAA4B;QAC7F,oFAAoF;QACpF,MAAM,WAAW,GAAG,IAAI,CAAC,UAAU,CAAC,8BAA8B,CAChE,IAAI,CAAC,cAAc,EAAE,aAAa,GAAG,IAAI,CAAC,cAAc,EAAE,kBAAkB,IAAI,KAAK,CAAC,CAAC;QACzF,OAAO,WAAW,CAAC,QAAQ,CAAC;IAC9B,CAAC;IACD;;;OAGG;IACI,mBAAmB,CAAC,cAAsB;QAC/C,OAAO,cAAc,GAAG,CAAC,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC,cAAc,CAAC,CAAC;IACpH,CAAC;IACD;;;;OAIG;IACI,4BAA4B,CAAC,aAAqB;QACvD,MAAM,EAAE,GAAG,IAAI,CAAC,cAAc,CAAC;QAC/B,MAAM,EAAE,GAAG,IAAI,CAAC,cAAc,CAAC;QAC/B,MAAM,EAAE,GAAG,IAAI,CAAC,cAAc,CAAC;QAC/B,MAAM,EAAE,GAAG,IAAI,CAAC,cAAc,CAAC;QAC/B,IAAI,CAAC,cAAc,GAAG,GAAG,GAAG,EAAE,CAAC;QAC/B,IAAI,CAAC,cAAc,GAAG,GAAG,GAAG,EAAE,CAAC;QAC/B,IAAI,CAAC,cAAc,GAAG,aAAa,GAAG,EAAE,CAAC;QACzC,IAAI,CAAC,cAAc,GAAG,aAAa,GAAG,EAAE,CAAC;IAC3C,CAAC;IACD,2DAA2D;IACpD,2BAA2B,CAAC,QAAgB;QACjD,OAAO,IAAI,CAAC,4BAA4B,CAAC,QAAQ,CAAC,CAAC;IACrD,CAAC;IACD;;;;OAIG;IACI,4BAA4B,CAAC,QAAgB;QAClD,IAAI,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,2BAA2B,CAAC,IAAI,CAAC,cAAc,EAAE,QAAQ,CAAC,CAAC;QACnF,IAAI,QAAQ,GAAG,IAAI,CAAC,cAAc;YAChC,CAAC,GAAG,CAAC,CAAC,CAAC;QACT,OAAO,IAAI,CAAC,cAAc,GAAG,CAAC,CAAC;IACjC,CAAC;CACF;AAzHD,oCAyHC;AAED,mEAAmE;AACnE,MAAM,gCAAgC;IAGpC;QACE,IAAI,CAAC,oBAAoB,GAAG,CAAC,CAAC;QAC9B,IAAI,CAAC,UAAU,GAAG,EAAE,CAAC;IACvB,CAAC;IACD,0EAA0E;IACnE,yBAAyB,CAAC,GAAmB,IAAI,CAAC;IAClD,mBAAmB,CAAC,GAAmB,IAAI,CAAC;IAC5C,uBAAuB,CAAC,GAAmB,IAAI,CAAC;IAChD,iBAAiB,CAAC,GAAmB,IAAI,CAAC;IAC1C,oBAAoB,CAAC,IAAa,EAAE,SAAiB,EAAE,QAAkB,IAAI,CAAC;IACrF,2FAA2F;IACpF,uBAAuB,CAC5B,EAAkB,EAAE,MAAe,EAAE,MAAe,EAAE,UAAkB,EAAE,SAAiB,EAAE,SAAiB;QAE9G,MAAM,cAAc,GAAG,MAAM,CAAC,KAAK,EAAE,CAAC;QACtC,MAAM,cAAc,GAAG,MAAM,CAAC,KAAK,EAAE,CAAC;QACtC,IAAI,EAAE,GAAG,IAAI,CAAC,oBAAoB,CAAC;QACnC,IAAI,UAAU,IAAI,CAAC,EAAE;YACnB,IAAI,CAAC,oBAAoB,IAAI,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;YACrD,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,YAAY,CAAC,SAAS,EAAE,SAAS,EAAE,EAAE,EAAE,IAAI,CAAC,oBAAoB,EAAE,EAAE,EAC3F,eAAO,CAAC,MAAM,CAAC,cAAc,EAAE,cAAc,CAAC,CAAC,CAAC,CAAC;SACpD;aAAM;YACL,IAAI,EAAE,CAAC;YACP,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,SAAS,EAAE,CAAC,IAAI,UAAU,EAAE,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE;gBAC7D,EAAE,GAAG,mBAAQ,CAAC,WAAW,CAAC,SAAS,EAAE,CAAC,GAAG,UAAU,EAAE,SAAS,CAAC,CAAC;gBAChE,MAAM,CAAC,WAAW,CAAC,EAAE,EAAE,MAAM,EAAE,cAAc,CAAC,CAAC;gBAC/C,EAAE,GAAG,IAAI,CAAC,oBAAoB,CAAC;gBAC/B,IAAI,CAAC,oBAAoB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC;gBAC3E,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,YAAY,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,oBAAoB,EAAE,EAAE,EAC7E,eAAO,CAAC,MAAM,CAAC,cAAc,EAAE,cAAc,CAAC,CAAC,CAAC,CAAC;gBACnD,cAAc,CAAC,OAAO,CAAC,cAAc,CAAC,CAAC;aACxC;SACF;IACH,CAAC;IACM,qCAAqC,CAC1C,EAAkB,EAAE,UAAkB,EAAE,SAAiB,EAAE,SAAiB;QAE5E,IAAI,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;QACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,SAAS,EAAE,CAAC,IAAI,UAAU,EAAE,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE;YAC7D,EAAE,GAAG,mBAAQ,CAAC,WAAW,CAAC,SAAS,EAAE,CAAC,GAAG,UAAU,EAAE,SAAS,CAAC,CAAC;YAChE,CAAC,GAAG,EAAE,CAAC,2BAA2B,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YAC3C,EAAE,GAAG,IAAI,CAAC,oBAAoB,CAAC;YAC/B,IAAI,CAAC,oBAAoB,IAAI,CAAC,CAAC;YAC/B,MAAM,KAAK,GAAG,EAAE,CAAC,qBAAqB,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YAC/C,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,YAAY,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,oBAAoB,EAAE,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC;SAC1F;IACH,CAAC;IACM,6BAA6B,KAAe,OAAO,IAAI,CAAC,CAAC,CAAC;IAC1D,MAAM,CAAC,uBAAuB,CAAC,IAAgB,EAAE,OAAuB;QAC7E,MAAM,OAAO,GAAG,IAAI,gCAAgC,EAAE,CAAC;QACvD,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE;YACjC,KAAK,CAAC,kBAAkB,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;SAC5C;QACD,MAAM,SAAS,GAAG,OAAO,CAAC,UAAU,CAAC;QACrC,OAAO,SAAS,CAAC;IACnB,CAAC;CACF;AACD;;;;;;;;GAQG;AACH,MAAa,2BAA4B,SAAQ,+BAAc;IAM7D,uDAAuD;IAChD,mBAAmB,CAAC,KAAoB;QAC7C,OAAO,KAAK,YAAY,2BAA2B,CAAC;IACtD,CAAC;IACD,4FAA4F;IAC5F,YAAoB,IAAgB,EAAE,SAAyB;QAC7D,KAAK,EAAE,CAAC;QAXV,wCAAwC;QACxB,uBAAkB,GAAG,6BAA6B,CAAC;QAWjE,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;QAC5B,IAAI,CAAC,YAAY,GAAG,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC;IAChG,CAAC;IACD;;;OAGG;IACI,gBAAgB,CAAC,SAAoB;QAC1C,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QAC7B,IAAI,CAAC,YAAY,4BAAU,IAAI,CAAC,CAAC,mBAAmB,CAAC,SAAS,CAAC;YAC7D,OAAO,2BAA2B,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;QACtD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;OAGG;IACH,IAAW,IAAI;QACb,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IACD;;;OAGG;IACH,IAAW,SAAS;QAClB,OAAO,IAAI,CAAC,UAAU,CAAC;IACzB,CAAC;IACD,0BAA0B;IACnB,KAAK;QACV,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,EAAgB,CAAC;QAC3C,OAAO,2BAA2B,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;IACtD,CAAC;IACD,0BAA0B;IACV,iBAAiB,CAAC,SAAiB,EAAE,SAAiB;QACpE,IAAI,SAAS,KAAK,SAAS;YACzB,OAAO,SAAS,CAAC;QACnB,IAAI,KAAK,GAAG,SAAS,CAAC;QACtB,IAAI,KAAK,GAAG,SAAS,CAAC;QACtB,MAAM,QAAQ,GAAG,SAAS,GAAG,SAAS,CAAC;QACvC,IAAI,QAAQ,EAAE;YACZ,KAAK,GAAG,SAAS,CAAC;YAClB,KAAK,GAAG,SAAS,CAAC;SACnB;QACD,MAAM,cAAc,GAAG,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC;QACjD,MAAM,cAAc,GAAG,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC;QACjD,MAAM,SAAS,GAAG,IAAI,CAAC,uBAAuB,CAAC,cAAc,EAAE,IAAI,CAAC,CAAC;QACrE,IAAI,SAAS,KAAK,SAAS;YACzB,OAAO,SAAS,CAAC;QACnB,MAAM,SAAS,GAAG,IAAI,CAAC,uBAAuB,CAAC,cAAc,EAAE,IAAI,CAAC,CAAC;QACrE,IAAI,SAAS,KAAK,SAAS;YACzB,OAAO,SAAS,CAAC;QACnB,MAAM,gBAAgB,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,SAAS,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;QAC3E,IAAI,SAAS,KAAK,gBAAgB;YAChC,OAAO,SAAS,CAAC;QACnB,MAAM,gBAAgB,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,SAAS,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;QAC3E,IAAI,SAAS,KAAK,gBAAgB;YAChC,OAAO,SAAS,CAAC;QACnB,MAAM,cAAc,GAAG,SAAS,CAAC,oCAAoC,CAAC,cAAc,EAAE,IAAI,CAAC,CAAC;QAC5F,MAAM,cAAc,GAAG,SAAS,CAAC,oCAAoC,CAAC,cAAc,EAAE,IAAI,CAAC,CAAC;QAE5F,qDAAqD;QACrD,MAAM,OAAO,GAAG,WAAI,CAAC,MAAM,EAAE,CAAC;QAC9B,MAAM,eAAe,GAAG,CACtB,UAA0B,EAAE,cAAsB,EAAE,cAAsB,EAAE,aAAsB,EACzF,EAAE;YACX,IAAI,cAAc,KAAK,cAAc;gBACnC,OAAO,KAAK,CAAC;YACf,IAAI,QAAQ,CAAC;YACb,IAAI,cAAc,KAAK,GAAG,IAAI,cAAc,KAAK,GAAG,EAAE;gBACpD,QAAQ,GAAG,UAAU,CAAC,KAAK,EAAE,CAAC;gBAC9B,IAAI,aAAa;oBACf,QAAQ,CAAC,cAAc,EAAE,CAAC;aAC7B;iBAAM;gBACL,QAAQ,GAAG,aAAa,CAAC,CAAC;oBACxB,UAAU,CAAC,iBAAiB,CAAC,cAAc,EAAE,cAAc,CAAC;oBAC5D,CAAC,CAAC,UAAU,CAAC,iBAAiB,CAAC,cAAc,EAAE,cAAc,CAAC,CAAC;aAClE;YACD,IAAI,QAAQ,EAAE;gBACZ,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBAChC,OAAO,IAAI,CAAC;aACb;YACD,OAAO,KAAK,CAAC;QACf,CAAC,CAAC;QACF,IAAI,SAAS,CAAC,UAAU,KAAK,SAAS,CAAC,UAAU,EAAE;YACjD,+CAA+C;YAC/C,IAAI,eAAe,CAAC,SAAS,CAAC,UAAU,EAAE,cAAc,EAAE,cAAc,EAAE,QAAQ,CAAC;gBACjF,OAAO,2BAA2B,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC,wDAAwD;YACrH,OAAO,SAAS,CAAC;SAClB;QACD,eAAe,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,gBAAgB,CAAC,EAAE,cAAc,EAAE,GAAG,EAAE,QAAQ,CAAC,CAAC;QACtF,mDAAmD;QACnD,KAAK,IAAI,UAAU,GAAG,gBAAgB,GAAG,CAAC,EAAE,UAAU,GAAG,gBAAgB,EAAE,UAAU,EAAE,EAAE;YACvF,eAAe,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,UAAU,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,QAAQ,CAAC,CAAC;SACtE;QACD,eAAe,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,gBAAgB,CAAC,EAAE,GAAG,EAAE,cAAc,EAAE,QAAQ,CAAC,CAAC;QACtF,wEAAwE;QACxE,IAAI,QAAQ;YACV,OAAO,CAAC,QAAQ,CAAC,OAAO,EAAE,CAAC;QAC7B,OAAO,2BAA2B,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;IAC5D,CAAC;IACD;;;OAGG;IACI,SAAS,CAAC,KAAmC;QAClD,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE;YACnC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC;gBACrB,OAAO,KAAK,CAAC;SAChB;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IACD,yGAAyG;IACzF,UAAU,CAAC,MAAgB;QACzC,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC;QAC7C,IAAI,CAAC;YACH,OAAO,CAAC,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;QAC9B,OAAO,yBAAO,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;IACpC,CAAC;IACD,qGAAqG;IACrF,QAAQ,CAAC,MAAgB;QACvC,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9C,IAAI,CAAC;YACH,OAAO,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QAC5B,OAAO,yBAAO,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;IACpC,CAAC;IACD,gDAAgD;IACzC,WAAW,CAAC,IAAkB,EAAE,OAAuB;QAC5D,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE;YACnC,CAAC,CAAC,WAAW,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;SAC9B;IACH,CAAC;IACD;;;OAGG;IACI,kBAAkB,CAAC,IAAoB,EAAE,OAAuB;QACrE,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE;YACnC,CAAC,CAAC,kBAAkB,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;SACrC;IACH,CAAC;IACD;;;OAGG;IACI,4BAA4B,CAAC,OAAuB;QACzD,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE;YACnC,SAAS,IAAI,CAAC,CAAC,4BAA4B,CAAC,OAAO,CAAC,CAAC;SACtD;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;OAMG;IACa,wBAAwB,CACtC,cAAgC,EAAE,6BAAsC,KAAK,EAAE,qBAA8B,KAAK;QAElH,IAAI,0BAA0B,EAAE;YAC9B,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE;gBACnC,CAAC,CAAC,wBAAwB,CAAC,cAAc,EAAE,0BAA0B,EAAE,kBAAkB,CAAC,CAAC;aAC5F;SACF;aAAM;YACL,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;SAC3B;IACH,CAAC;IACD;;;;OAIG;IACa,qCAAqC,CAAC,OAAuB,EAAE,eAAgC;QAC7G,MAAM,KAAK,GAAG,+BAAc,CAAC,yCAAyC,CAAC,IAAI,EAAE,eAAe,CAAC,CAAC;QAC9F,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE;YACnC,CAAC,CAAC,qCAAqC,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;SACzD;QACD,+BAAc,CAAC,qBAAqB,CAAC,IAAI,EAAE,KAAK,EAAE,eAAe,CAAC,CAAC;IACrE,CAAC;IACD;;;OAGG;IACI,yBAAyB,CAAC,OAAwB;QACvD,OAAO,IAAI,CAAC,KAAK,CAAC,yBAAyB,CAAC,OAAO,CAAC,CAAC;IACvD,CAAC;IACD,mGAAmG;IAC5F,WAAW,CAAC,aAAsB,EAAE,SAAqB;QAC9D,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,aAAa,EAAE,SAAS,CAAC,CAAC;IACnD,CAAC;IACD;;;;OAIG;IACa,2BAA2B,CAAC,SAAiB,EAAE,SAAiB;QAC9E,OAAO,IAAI,CAAC,GAAG,CAAC,SAAS,GAAG,SAAS,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC;IAC7D,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,aAAa,CAAC,IAAgB,EAAE,OAAuB;QACnE,MAAM,SAAS,GAAG,gCAAgC,CAAC,uBAAuB,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QAC1F,MAAM,MAAM,GAAG,IAAI,2BAA2B,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;QAChE,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;OAIG;IACI,uBAAuB,CAAC,QAAgB,EAAE,qBAA8B,KAAK;QAClF,MAAM,CAAC,GAAG,IAAI,CAAC,4BAA4B,CAAC,QAAQ,EAAE,kBAAkB,CAAC,CAAC;QAC1E,IAAI,SAAS,KAAK,CAAC;YACjB,OAAO,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QAC5B,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;OAIG;IACO,4BAA4B,CAAC,QAAgB,EAAE,qBAA8B,KAAK;QAC1F,MAAM,YAAY,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC;QAC5C,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC;QAClC,IAAI,YAAY,GAAG,CAAC,EAAE;YACpB,IAAI,QAAQ,GAAG,GAAG;gBAChB,OAAO,kBAAkB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;YAC5C,IAAI,QAAQ,GAAG,IAAI,CAAC,YAAY;gBAC9B,OAAO,kBAAkB,CAAC,CAAC,CAAC,CAAC,YAAY,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;YAC7D,wBAAwB;YACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,EAAE,CAAC,EAAE,EAAE;gBACrC,IAAI,SAAS,CAAC,CAAC,CAAC,CAAC,qBAAqB,CAAC,QAAQ,CAAC;oBAAE,OAAO,CAAC,CAAC;aAC5D;SACF;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;OAGG;IACI,4BAA4B,CAAC,QAAgB;QAClD,OAAO,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC;IACtC,CAAC;IACD;;;;OAIG;IACI,+BAA+B,CAAC,KAAqB,EAAE,QAAgB;QAC5E,MAAM,YAAY,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC;QAC5C,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC;QAClC,IAAI,YAAY,GAAG,CAAC,EAAE;YACpB,wBAAwB;YACxB,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE;gBAChC,IAAI,QAAQ,CAAC,kCAAkC,CAAC,KAAK,EAAE,QAAQ,CAAC;oBAC9D,OAAO,QAAQ,CAAC;aACnB;YACD,IAAI,QAAQ,IAAI,CAAC;gBACf,OAAO,SAAS,CAAC,CAAC,CAAC,CAAC;YACtB,IAAI,QAAQ,GAAG,GAAG;gBAChB,OAAO,SAAS,CAAC,YAAY,GAAG,CAAC,CAAC,CAAC;SACtC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,0CAA0C;IAC1B,WAAW;QACzB,OAAO,IAAI,CAAC,YAAY,CAAC;IAC3B,CAAC;IACD;;;OAGG;IACI,WAAW;QAChB,OAAO,IAAI,CAAC,YAAY,CAAC;IAC3B,CAAC;IACD;;;;OAIG;IACI,eAAe,CAAC,QAAgB,EAAE,MAAgB;QACvD,MAAM,aAAa,GAAG,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC;QACnD,MAAM,QAAQ,GAAG,IAAI,CAAC,uBAAuB,CAAC,aAAa,EAAE,IAAI,CAAC,CAAC;QACnE,IAAI,QAAQ,EAAE;YACZ,MAAM,aAAa,GAAG,QAAQ,CAAC,oCAAoC,CAAC,aAAa,EAAE,IAAI,CAAC,CAAC;YACzF,OAAO,QAAQ,CAAC,UAAU,CAAC,eAAe,CAAC,aAAa,EAAE,MAAM,CAAC,CAAC;SACnE;QACD,wCAAwC;QACxC,mEAAmE;QACnE,OAAO,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,eAAe,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;IACpE,CAAC;IACD;;;;;;;OAOG;IACI,4BAA4B,CAAC,QAAgB,EAAE,MAAc;QAClE,MAAM,iBAAiB,GAAG,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC;QACvD,MAAM,QAAQ,GAAG,IAAI,CAAC,uBAAuB,CAAC,iBAAiB,EAAE,IAAI,CAAE,CAAC;QACxE,MAAM,aAAa,GAAG,QAAQ,CAAC,oCAAoC,CAAC,iBAAiB,EAAE,IAAI,CAAC,CAAC;QAC7F,MAAM,GAAG,QAAQ,CAAC,UAAU,CAAC,4BAA4B,CAAC,aAAa,EAAE,MAAM,CAAC,CAAC;QACjF,iFAAiF;QACjF,6EAA6E;QAC7E,sEAAsE;QACtE,2CAA2C;QAC3C,MAAM,CAAC,GAAG,IAAI,CAAC,YAAY,GAAG,MAAM,CAAC,SAAS,CAAC,SAAS,EAAE,CAAC;QAC3D,MAAM,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QACjC,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;OAKG;IACa,6BAA6B,CAAC,QAAgB,EAAE,MAAc;QAC5E,MAAM,iBAAiB,GAAG,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC;QACvD,MAAM,QAAQ,GAAG,IAAI,CAAC,uBAAuB,CAAC,iBAAiB,EAAE,IAAI,CAAE,CAAC;QACxE,MAAM,aAAa,GAAG,QAAQ,CAAC,oCAAoC,CAAC,iBAAiB,EAAE,IAAI,CAAC,CAAC;QAC7F,MAAM,GAAG,QAAQ,CAAC,UAAU,CAAC,4BAA4B,CAAC,aAAa,EAAE,MAAM,CAAC,CAAC;QACjF,MAAM,CAAC,SAAS,CAAC,gBAAgB,EAAE,CAAC;QACpC,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;;OAMG;IACI,8BAA8B,CACnC,QAAgB,EAAE,MAAkC;QAEpD,MAAM,iBAAiB,GAAG,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC;QACvD,MAAM,QAAQ,GAAG,IAAI,CAAC,uBAAuB,CAAC,iBAAiB,EAAE,IAAI,CAAE,CAAC;QACxE,MAAM,aAAa,GAAG,QAAQ,CAAC,oCAAoC,CAAC,iBAAiB,EAAE,IAAI,CAAC,CAAC;QAC7F,MAAM,GAAG,QAAQ,CAAC,UAAU,CAAC,8BAA8B,CAAC,aAAa,EAAE,MAAM,CAAC,CAAC;QACnF,IAAI,CAAC,MAAM;YACT,OAAO,SAAS,CAAC;QACnB,gFAAgF;QAChF,kFAAkF;QAClF,qCAAqC;QACrC,oDAAoD;QACpD,kEAAkE;QAClE,yCAAyC;QACzC,uCAAuC;QACvC,MAAM,IAAI,GAAG,MAAM,CAAC,OAAO,CAAC,SAAS,EAAE,CAAC;QACxC,MAAM,KAAK,GAAG,IAAI,GAAG,IAAI,CAAC;QAC1B,MAAM,KAAK,GAAG,MAAM,CAAC,OAAO,CAAC,UAAU,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QACxD,MAAM,CAAC,OAAO,CAAC,gBAAgB,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC;QAChE,MAAM,KAAK,GAAG,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC;QACvC,MAAM,CAAC,OAAO,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;QACnC,MAAM,CAAC,OAAO,CAAC,YAAY,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC;QAC3C,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;OAGG;IACI,mBAAmB,CAAC,SAAoB;QAC7C,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE;YACnC,IAAI,CAAC,CAAC,CAAC,mBAAmB,CAAC,SAAS,CAAC;gBACnC,OAAO,EAAE,CAAC;SACb;QACD,OAAO,OAAO,KAAK,CAAC,CAAC;IACvB,CAAC;IACD,gGAAgG;IACzF,cAAc;QACnB,IAAI,CAAC,KAAK,CAAC,sBAAsB,EAAE,CAAC;QACpC,MAAM,WAAW,GAAG,IAAI,CAAC,YAAY,CAAC;QACtC,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,UAAU,EAAE;YACtC,QAAQ,CAAC,4BAA4B,CAAC,WAAW,CAAC,CAAC;SACpD;QACD,IAAI,CAAC,UAAU,CAAC,OAAO,EAAE,CAAC;IAC5B,CAAC;IACD;;;;;OAKG;IACa,aAAa,CAAC,KAAoB;QAChD,IAAI,KAAK,YAAY,2BAA2B,EAAE;YAChD,OAAO,mBAAQ,CAAC,gBAAgB,CAAC,IAAI,CAAC,YAAY,EAAE,KAAK,CAAC,YAAY,CAAC;mBAClE,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;SAC5C;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;OAKG;IACa,8BAA8B,CAC5C,aAAqB,EAAE,cAAsB,EAAE,cAAuB,EAAE,MAA4B;QAEpG,MAAM,SAAS,GAAG,aAAa,GAAG,IAAI,CAAC,YAAY,CAAC;QACpD,MAAM,SAAS,GAAG,SAAS,GAAG,cAAc,CAAC;QAC7C,MAAM,SAAS,GAAG,IAAI,CAAC,uBAAuB,CAAC,SAAS,EAAE,IAAI,CAAE,CAAC;QACjE,MAAM,WAAW,GAAG,SAAS,CAAC,UAAU,CAAC,8BAA8B,CAAC,SAAS,CAAC,cAAc,EAAE,SAAS,GAAG,SAAS,CAAC,cAAc,EAAE,cAAc,EAAE,MAAM,CAAC,CAAC;QAChK,MAAM,WAAW,GAAG,aAAa,GAAG,CAAC,cAAc,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC;QACzE,MAAM,WAAW,GAAG,yCAAmB,CAAC,mCAAmC,CAAC,cAAc,EAAE,IAAI,EAAE,aAAa,EAAE,WAAW,EAAE,cAAc,EAAE,MAAM,CAAC,CAAC;QACtJ,WAAW,CAAC,WAAW,GAAG,WAAW,CAAC;QACtC,OAAO,WAAW,CAAC;IACrB,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,yBAAyB,CACrC,QAAiB,IAAI;QAErB,MAAM,CAAC,GAAG;YACR,QAAQ,EAAE,IAAI,CAAC,SAAS;YACxB,SAAS,EAAE,IAAI,CAAC,UAAU;YAC1B,WAAW,EAAE,IAAI,CAAC,YAAY;YAC9B,YAAY,EAAE,IAAI,CAAC,aAAa;SACjC,CAAC;QACF,IAAI,KAAK,EAAE;YACT,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,aAAa,GAAG,CAAC,CAAC;SAC9D;QACD,OAAO,CAAC,CAAC;IACX,CAAC;IAKD;;;;;;;;;OASG;IACa,YAAY,CAC1B,UAAmB,EAAE,MAAmC;QAExD,IAAI,WAA4C,CAAC;QACjD,IAAI,IAAI,GAAG,MAAM,CAAC,SAAS,CAAC;QAC5B,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;QAC9C,IAAI,WAAW,KAAK,CAAC,EAAE;YACrB,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,UAAU,EAAE,MAAM,CAAC,CAAC;SACtE;aAAM;YACL,MAAM,eAAe,GAAG,YAAY,CAAC,8BAA8B,CAAC,IAAI,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC;YACjG,MAAM,OAAO,GAAG,CAAC,oCAAkB,CAAC,mDAAmD,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,iCAAe,CAAC,IAAI,CAAC,CAAC;YAC1H,MAAM,OAAO,GAAG,CAAC,iCAAe,CAAC,IAAI,EAAE,oCAAkB,CAAC,mDAAmD,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC;YAC1H,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YACrC,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAC9D,2BAA2B,CAAC,SAAS,EAAE,CAAC;YACxC,2BAA2B,CAAC,aAAa,IAAI,eAAe,CAAC,MAAM,CAAC;YACpE,KAAK,MAAM,CAAC,IAAI,eAAe,EAAE;gBAC/B,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI;oBACZ,MAAM;gBACR,2BAA2B,CAAC,UAAU,EAAE,CAAC;gBACzC,MAAM,KAAK,GAAG,CAAC,CAAC,UAAU,CAAC;gBAC3B,MAAM,OAAO,GAAG,KAAK,CAAC,YAAY,CAAC,UAAU,EAC3C,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;gBACjE,IAAI,OAAO,IAAI,OAAO,CAAC,CAAC,GAAG,IAAI,EAAE;oBAC/B,IAAI,GAAG,OAAO,CAAC,CAAC,CAAC;oBACjB,WAAW,GAAG,yCAAmB,CAAC,wBAAwB,CAAC,OAAO,CAAC,KAAK,EAAE,OAAO,CAAC,QAAQ,EAAE,OAAO,CAAC,KAAK,EAAE,WAAW,CAAE,CAAC;oBACzH,WAAW,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC;oBAC1B,2BAA2B,CAAC,YAAY,EAAE,CAAC;iBAC5C;aACF;SACF;QACD,IAAI,CAAC,WAAW;YACd,OAAO,SAAS,CAAC;QACnB,MAAM,QAAQ,GAAG,IAAI,CAAC,+BAA+B,CAAC,WAAW,CAAC,KAAM,EAAE,WAAW,CAAC,QAAQ,CAAC,CAAC;QAChG,IAAI,QAAQ,EAAE;YACZ,MAAM,aAAa,GAAG,QAAQ,CAAC,4BAA4B,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;YAClF,MAAM,aAAa,GAAG,IAAI,CAAC,4BAA4B,CAAC,aAAa,CAAC,CAAC;YACvE,MAAM,WAAW,GAAG,yCAAmB,CAAC,wBAAwB,CAAC,IAAI,EAAE,aAAa,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC;YACzG,WAAW,CAAC,WAAW,GAAG,WAAW,CAAC;YACtC,WAAW,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC;YAC9B,OAAO,WAAW,CAAC;SACpB;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;OAKG;IACa,iBAAiB,CAC/B,uBAA+C;QAE/C,MAAM,OAAO,GAAG,6BAAa,CAAC,MAAM,CAAC,uBAAuB,CAAC,CAAC;QAC9D,MAAM,OAAO,GAAqB,EAAE,CAAC;QACrC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,sBAAsB,CAAC,SAAS,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE;YACrE,MAAM,MAAM,GAAG,IAAI,CAAC,iBAAiB,CAAC,OAAO,CAAC,CAAC;YAC/C,IAAI,MAAM,KAAK,SAAS,EAAE;gBACxB,IAAI,MAAM,YAAY,+BAAc;oBAClC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;qBAClB,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC;oBAC5B,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;aAC5C;SACF;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IACD;;;;;;;OAOG;IACa,uBAAuB,CAAC,GAAqB,EAAE,OAAiB;QAC9E,OAAO,qDAAyB,CAAC,kCAAkC,CAAC,IAAI,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;IAC1F,CAAC;;AA1Fc,qCAAS,GAAG,CAAC,AAAJ,CAAK;AACd,sCAAU,GAAG,CAAC,AAAJ,CAAK;AACf,wCAAY,GAAG,CAAC,AAAJ,CAAK;AACjB,yCAAa,GAAG,CAAC,AAAJ,CAAK;AAtctB,kEAA2B","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n\r\n/** @packageDocumentation\r\n * @module Curve\r\n */\r\n\r\nimport { CurvePrimitive } from \"../curve/CurvePrimitive\";\r\nimport { StrokeCountMap } from \"../curve/Query/StrokeCountMap\";\r\nimport { Geometry } from \"../Geometry\";\r\nimport { GeometryHandler, IStrokeHandler } from \"../geometry3d/GeometryHandler\";\r\nimport { Plane3dByOriginAndUnitNormal } from \"../geometry3d/Plane3dByOriginAndUnitNormal\";\r\nimport { Plane3dByOriginAndVectors } from \"../geometry3d/Plane3dByOriginAndVectors\";\r\nimport { Point3d, Vector3d } from \"../geometry3d/Point3dVector3d\";\r\nimport { Range1d, Range3d } from \"../geometry3d/Range\";\r\nimport { Ray3d } from \"../geometry3d/Ray3d\";\r\nimport { Transform } from \"../geometry3d/Transform\";\r\nimport { CurveChain } from \"./CurveCollection\";\r\nimport { CurveExtendMode, CurveExtendOptions, VariantCurveExtendParameter } from \"./CurveExtendMode\";\r\nimport { CurveLocationDetail } from \"./CurveLocationDetail\";\r\nimport { GeometryQuery } from \"./GeometryQuery\";\r\nimport { PlaneAltitudeRangeContext } from \"./internalContexts/PlaneAltitudeRangeContext\";\r\nimport { LineString3d } from \"./LineString3d\";\r\nimport { OffsetOptions } from \"./OffsetOptions\";\r\nimport { Path } from \"./Path\";\r\nimport { StrokeOptions } from \"./StrokeOptions\";\r\n\r\n/**\r\n * Annotation of an interval of a curve.\r\n * * The interval is marked with two pairs of numbers:\r\n * * * fraction0, fraction1 = fraction parameters along the child curve\r\n * * * distance0,distance1 = distances within containing CurveChainWithDistanceIndex\r\n * @public\r\n */\r\nexport class PathFragment {\r\n  /** Distance along parent to this fragment start */\r\n  public chainDistance0: number;\r\n  /** Distance along parent to this fragment end */\r\n  public chainDistance1: number;\r\n  /** Fractional position of this fragment start within its curve primitive. */\r\n  public childFraction0: number;\r\n  /** Fractional position of this fragment end within its curve primitive.. */\r\n  public childFraction1: number;\r\n  /** Curve primitive of this fragment, as presented in stroker.  Note that this might have become a proxy. */\r\n  public childCurve: CurvePrimitive;\r\n  /** Optional range */\r\n  public range?: Range3d;\r\n  /** Working var for use in searches. */\r\n  public a: number;\r\n  /** Create a fragment with complete fraction, distance and child data. */\r\n  public constructor(\r\n    childFraction0: number, childFraction1: number,\r\n    distance0: number, distance1: number,\r\n    childCurve: CurvePrimitive, range?: Range3d,\r\n  ) {\r\n    this.childFraction0 = childFraction0;\r\n    this.childFraction1 = childFraction1;\r\n    this.chainDistance0 = distance0;\r\n    this.chainDistance1 = distance1;\r\n    this.childCurve = childCurve;\r\n    this.range = range;\r\n    this.a = 0;\r\n  }\r\n  /**\r\n   * Return true if the distance is within the distance limits of this fragment.\r\n   * @param distance\r\n   */\r\n  public containsChainDistance(distance: number): boolean {\r\n    return distance >= this.chainDistance0 && distance <= this.chainDistance1;\r\n  }\r\n  /** Return a quick distance to the curve.  This may be SMALLER than true distance but may not be larger */\r\n  public quickMinDistanceToChildCurve(spacePoint: Point3d): number {\r\n    if (this.range) {\r\n      return this.range.distanceToPoint(spacePoint);\r\n    }\r\n    // ugh.  have to do real computation ..\r\n    const detail = this.childCurve.closestPoint(spacePoint, false);\r\n    if (detail)\r\n      return detail.a;\r\n    return 0;\r\n  }\r\n  /**\r\n   * Return an array with (references to) all the path fragments, sorted smallest to largest on the \"a\" value\r\n   * equal to the quick min distance to the fragment\r\n   */\r\n  public static collectSortedQuickMinDistances(fragments: PathFragment[], spacePoint: Point3d): PathFragment[] {\r\n    const sortedFragments: PathFragment[] = [];\r\n    for (const f of fragments) {\r\n      f.a = f.quickMinDistanceToChildCurve(spacePoint);\r\n      sortedFragments.push(f);\r\n    }\r\n    sortedFragments.sort((a: PathFragment, b: PathFragment) => a.a - b.a);\r\n    return sortedFragments;\r\n  }\r\n  /**\r\n   * Return true if this fragment addresses `curve` and brackets `fraction`\r\n   * @param distance\r\n   */\r\n  public containsChildCurveAndChildFraction(curve: CurvePrimitive, fraction: number): boolean {\r\n    return this.childCurve === curve && fraction >= this.childFraction0 && fraction <= this.childFraction1;\r\n  }\r\n  /**\r\n   * Convert distance to local fraction, and apply that to interpolate between the stored curve fractions.\r\n   * Note that proportional calculation does NOT account for nonuniform parameterization in the child curve.\r\n   */\r\n  public chainDistanceToInterpolatedChildFraction(distance: number): number {\r\n    return Geometry.inverseInterpolate(\r\n      this.childFraction0, this.chainDistance0,\r\n      this.childFraction1, this.chainDistance1,\r\n      distance, this.childFraction0)!; // the interval \"must\" have nonzero length, division should be safe . ..\r\n  }\r\n  /** Convert chainDistance to true chidFraction, using detailed moveSignedDistanceFromFraction */\r\n  public chainDistanceToAccurateChildFraction(chainDistance: number, allowExtrapolation?: boolean): number {\r\n    // The fragments are really expected to do good mappings in their distance range ...\r\n    const childDetail = this.childCurve.moveSignedDistanceFromFraction(\r\n      this.childFraction0, chainDistance - this.chainDistance0, allowExtrapolation ?? false);\r\n    return childDetail.fraction;\r\n  }\r\n  /**\r\n   * Return the scale factor to map childCurve fraction derivatives to chain fraction derivatives\r\n   * @param globalDistance total length of the global curve.\r\n   */\r\n  public fractionScaleFactor(globalDistance: number): number {\r\n    return globalDistance * (this.childFraction1 - this.childFraction0) / (this.chainDistance1 - this.chainDistance0);\r\n  }\r\n  /**\r\n   * Reverse the fraction and distance data.\r\n   * * each child fraction `f` is replaced by `1-f`\r\n   * * each `chainDistance` is replaced by `totalDistance-chainDistance`\r\n   */\r\n  public reverseFractionsAndDistances(totalDistance: number) {\r\n    const f0 = this.childFraction0;\r\n    const f1 = this.childFraction1;\r\n    const d0 = this.chainDistance0;\r\n    const d1 = this.chainDistance1;\r\n    this.childFraction0 = 1.0 - f1;\r\n    this.childFraction1 = 1.0 - f0;\r\n    this.chainDistance0 = totalDistance - d1;\r\n    this.chainDistance1 = totalDistance - d0;\r\n  }\r\n  /** @deprecated in 3.x. Use childFractionToChainDistance */\r\n  public childFractionTChainDistance(fraction: number): number {\r\n    return this.childFractionToChainDistance(fraction);\r\n  }\r\n  /**\r\n   * Convert a fractional position on the childCurve to distance in the chain space.\r\n   * * Return value is SIGNED -- will be negative when fraction < this.childFraction0.\r\n   * @param fraction fraction along the curve within this fragment\r\n   */\r\n  public childFractionToChainDistance(fraction: number): number {\r\n    let d = this.childCurve.curveLengthBetweenFractions(this.childFraction0, fraction);\r\n    if (fraction < this.childFraction0)\r\n      d = -d;\r\n    return this.chainDistance0 + d;\r\n  }\r\n}\r\n\r\n/** Non-instantiable class to build a distance index for a path. */\r\nclass DistanceIndexConstructionContext implements IStrokeHandler {\r\n  private _fragments: PathFragment[];\r\n  private _accumulatedDistance: number;\r\n  private constructor() {\r\n    this._accumulatedDistance = 0;\r\n    this._fragments = [];\r\n  }\r\n  // ignore curve announcements -- they are repeated in stroke announcements\r\n  public startParentCurvePrimitive(_cp: CurvePrimitive) { }\r\n  public startCurvePrimitive(_cp: CurvePrimitive) { }\r\n  public endParentCurvePrimitive(_cp: CurvePrimitive) { }\r\n  public endCurvePrimitive(_cp: CurvePrimitive) { }\r\n  public announcePointTangent(_xyz: Point3d, _fraction: number, _tangent: Vector3d) { }\r\n  /** Announce numPoints interpolated between point0 and point1, with associated fractions */\r\n  public announceSegmentInterval(\r\n    cp: CurvePrimitive, point0: Point3d, point1: Point3d, numStrokes: number, fraction0: number, fraction1: number,\r\n  ): void {\r\n    const fragmentPoint0 = point0.clone();\r\n    const fragmentPoint1 = point1.clone();\r\n    let d0 = this._accumulatedDistance;\r\n    if (numStrokes <= 1) {\r\n      this._accumulatedDistance += point0.distance(point1);\r\n      this._fragments.push(new PathFragment(fraction0, fraction1, d0, this._accumulatedDistance, cp,\r\n        Range3d.create(fragmentPoint0, fragmentPoint1)));\r\n    } else {\r\n      let f1;\r\n      for (let i = 1, f0 = fraction0; i <= numStrokes; i++, f0 = f1) {\r\n        f1 = Geometry.interpolate(fraction0, i / numStrokes, fraction1);\r\n        point0.interpolate(f1, point1, fragmentPoint1);\r\n        d0 = this._accumulatedDistance;\r\n        this._accumulatedDistance += (Math.abs(f1 - f0) * point0.distance(point1));\r\n        this._fragments.push(new PathFragment(f0, f1, d0, this._accumulatedDistance, cp,\r\n          Range3d.create(fragmentPoint0, fragmentPoint1)));\r\n        fragmentPoint0.setFrom(fragmentPoint1);\r\n      }\r\n    }\r\n  }\r\n  public announceIntervalForUniformStepStrokes(\r\n    cp: CurvePrimitive, numStrokes: number, fraction0: number, fraction1: number,\r\n  ): void {\r\n    let f1, d, d0;\r\n    for (let i = 1, f0 = fraction0; i <= numStrokes; i++, f0 = f1) {\r\n      f1 = Geometry.interpolate(fraction0, i / numStrokes, fraction1);\r\n      d = cp.curveLengthBetweenFractions(f0, f1);\r\n      d0 = this._accumulatedDistance;\r\n      this._accumulatedDistance += d;\r\n      const range = cp.rangeBetweenFractions(f0, f1);\r\n      this._fragments.push(new PathFragment(f0, f1, d0, this._accumulatedDistance, cp, range));\r\n    }\r\n  }\r\n  public needPrimaryGeometryForStrokes?(): boolean { return true; }\r\n  public static createPathFragmentIndex(path: CurveChain, options?: StrokeOptions): PathFragment[] {\r\n    const handler = new DistanceIndexConstructionContext();\r\n    for (const curve of path.children) {\r\n      curve.emitStrokableParts(handler, options);\r\n    }\r\n    const fragments = handler._fragments;\r\n    return fragments;\r\n  }\r\n}\r\n/**\r\n * `CurveChainWithDistanceIndex` is a CurvePrimitive whose fractional parameterization is proportional to true\r\n * distance along a CurveChain.\r\n * * For example if the total length of the chain is `L`, then the distance along the chain from parameters `t0`\r\n * to `t1` is easily computed as `L*(t1-t0)`.\r\n * * The curve chain can be any type derived from CurveChain.\r\n * * * i.e. either a `Path` or a `Loop`\r\n * @public\r\n */\r\nexport class CurveChainWithDistanceIndex extends CurvePrimitive {\r\n  /** String name for schema properties */\r\n  public readonly curvePrimitiveType = \"curveChainWithDistanceIndex\";\r\n  private readonly _path: CurveChain;\r\n  private readonly _fragments: PathFragment[];\r\n  private readonly _totalLength: number; // matches final fragment distance1.\r\n  /** Test if other is a `CurveChainWithDistanceIndex` */\r\n  public isSameGeometryClass(other: GeometryQuery): boolean {\r\n    return other instanceof CurveChainWithDistanceIndex;\r\n  }\r\n  // final assembly of CurveChainWithDistanceIndex -- caller must create valid fragment index.\r\n  private constructor(path: CurveChain, fragments: PathFragment[]) {\r\n    super();\r\n    this._path = path;\r\n    this._fragments = fragments;\r\n    this._totalLength = fragments.length > 0 ? fragments[fragments.length - 1].chainDistance1 : 0;\r\n  }\r\n  /**\r\n   * Create a clone, transformed and with its own distance index.\r\n   * @param transform transform to apply in the clone.\r\n   */\r\n  public cloneTransformed(transform: Transform): CurveChainWithDistanceIndex | undefined {\r\n    const c = this._path.clone();\r\n    if (c instanceof CurveChain && c.tryTransformInPlace(transform))\r\n      return CurveChainWithDistanceIndex.createCapture(c);\r\n    return undefined;\r\n  }\r\n  /**\r\n   * Reference to the contained path.\r\n   * * Do not modify the path.  The distance index will be wrong.\r\n   */\r\n  public get path(): CurveChain {\r\n    return this._path;\r\n  }\r\n  /**\r\n   * Reference to the fragments array.\r\n   * * Do not modify.\r\n   */\r\n  public get fragments(): PathFragment[] {\r\n    return this._fragments;\r\n  }\r\n  /** Return a deep clone */\r\n  public clone(): CurveChainWithDistanceIndex {\r\n    const c = this._path.clone() as CurveChain;\r\n    return CurveChainWithDistanceIndex.createCapture(c);\r\n  }\r\n  /** Return a deep clone */\r\n  public override clonePartialCurve(fractionA: number, fractionB: number): CurveChainWithDistanceIndex | undefined {\r\n    if (fractionA === fractionB)\r\n      return undefined;\r\n    let fracA = fractionA;\r\n    let fracB = fractionB;\r\n    const reversed = fractionA > fractionB;\r\n    if (reversed) {\r\n      fracA = fractionB;\r\n      fracB = fractionA;\r\n    }\r\n    const chainDistanceA = fracA * this._totalLength;\r\n    const chainDistanceB = fracB * this._totalLength;\r\n    const fragmentA = this.chainDistanceToFragment(chainDistanceA, true);\r\n    if (undefined === fragmentA)\r\n      return undefined;\r\n    const fragmentB = this.chainDistanceToFragment(chainDistanceB, true);\r\n    if (undefined === fragmentB)\r\n      return undefined;\r\n    const childCurveIndexA = this._path.childIndex(fragmentA.childCurve, true);\r\n    if (undefined === childCurveIndexA)\r\n      return undefined;\r\n    const childCurveIndexB = this._path.childIndex(fragmentB.childCurve, true);\r\n    if (undefined === childCurveIndexB)\r\n      return undefined;\r\n    const childFractionA = fragmentA.chainDistanceToAccurateChildFraction(chainDistanceA, true);\r\n    const childFractionB = fragmentB.chainDistanceToAccurateChildFraction(chainDistanceB, true);\r\n\r\n    // add a (possibly reversed) partial clone to newPath\r\n    const newPath = Path.create();\r\n    const addPartialChild = (\r\n      childCurve: CurvePrimitive, childFraction0: number, childFraction1: number, reversedClone: boolean,\r\n    ): boolean => {\r\n      if (childFraction0 === childFraction1)\r\n        return false;\r\n      let newCurve;\r\n      if (childFraction0 === 0.0 && childFraction1 === 1.0) {\r\n        newCurve = childCurve.clone();\r\n        if (reversedClone)\r\n          newCurve.reverseInPlace();\r\n      } else {\r\n        newCurve = reversedClone ?\r\n          childCurve.clonePartialCurve(childFraction1, childFraction0)\r\n          : childCurve.clonePartialCurve(childFraction0, childFraction1);\r\n      }\r\n      if (newCurve) {\r\n        newPath.children.push(newCurve);\r\n        return true;\r\n      }\r\n      return false;\r\n    };\r\n    if (fragmentA.childCurve === fragmentB.childCurve) {\r\n      // the two distances are within the same curve.\r\n      if (addPartialChild(fragmentA.childCurve, childFractionA, childFractionB, reversed))\r\n        return CurveChainWithDistanceIndex.createCapture(newPath); // singleton -- children[] does not need to be reversed.\r\n      return undefined;\r\n    }\r\n    addPartialChild(this._path.children[childCurveIndexA], childFractionA, 1.0, reversed);\r\n    // at least two distinct children are impacted ....\r\n    for (let childIndex = childCurveIndexA + 1; childIndex < childCurveIndexB; childIndex++) {\r\n      addPartialChild(this._path.children[childIndex], 0.0, 1.0, reversed);\r\n    }\r\n    addPartialChild(this._path.children[childCurveIndexB], 0.0, childFractionB, reversed);\r\n    // This reverses array entries but not orientation within each curve ...\r\n    if (reversed)\r\n      newPath.children.reverse();\r\n    return CurveChainWithDistanceIndex.createCapture(newPath);\r\n  }\r\n  /**\r\n   * Ask if the curve is within tolerance of a plane.\r\n   * @returns Returns true if the curve is completely within tolerance of the plane.\r\n   */\r\n  public isInPlane(plane: Plane3dByOriginAndUnitNormal): boolean {\r\n    for (const c of this._path.children) {\r\n      if (!c.isInPlane(plane))\r\n        return false;\r\n    }\r\n    return true;\r\n  }\r\n  /** Return the start point of the primitive.  The default implementation returns fractionToPoint (0.0) */\r\n  public override startPoint(result?: Point3d): Point3d {\r\n    const c = this._path.cyclicCurvePrimitive(0);\r\n    if (c)\r\n      return c.startPoint(result);\r\n    return Point3d.createZero(result);\r\n  }\r\n  /** Return the end point of the primitive. The default implementation returns fractionToPoint(1.0) */\r\n  public override endPoint(result?: Point3d): Point3d {\r\n    const c = this._path.cyclicCurvePrimitive(-1);\r\n    if (c)\r\n      return c.endPoint(result);\r\n    return Point3d.createZero(result);\r\n  }\r\n  /** Add strokes to caller-supplied linestring */\r\n  public emitStrokes(dest: LineString3d, options?: StrokeOptions): void {\r\n    for (const c of this._path.children) {\r\n      c.emitStrokes(dest, options);\r\n    }\r\n  }\r\n  /**\r\n   * Ask the curve to announce points and simple subcurve fragments for stroking.\r\n   * See IStrokeHandler for description of the sequence of the method calls.\r\n   */\r\n  public emitStrokableParts(dest: IStrokeHandler, options?: StrokeOptions): void {\r\n    for (const c of this._path.children) {\r\n      c.emitStrokableParts(dest, options);\r\n    }\r\n  }\r\n  /**\r\n   * Return the stroke count required for given options.\r\n   * @param options StrokeOptions that determine count\r\n   */\r\n  public computeStrokeCountForOptions(options?: StrokeOptions): number {\r\n    let numStroke = 0;\r\n    for (const c of this._path.children) {\r\n      numStroke += c.computeStrokeCountForOptions(options);\r\n    }\r\n    return numStroke;\r\n  }\r\n  /**\r\n   * Return an array containing only the curve primitives.\r\n   * @param collectorArray array to receive primitives (pushed -- the array is not cleared)\r\n   * @param smallestPossiblePrimitives if true, recurse on the (otherwise hidden) children. If false, only push `this`.\r\n   * @param explodeLinestrings (if smallestPossiblePrimitives is true) whether to push a [[LineSegment3d]] for each\r\n   * segment of a [[LineString3d]] child. If false, push only the [[LineString3d]].\r\n   */\r\n  public override collectCurvePrimitivesGo(\r\n    collectorArray: CurvePrimitive[], smallestPossiblePrimitives: boolean = false, explodeLineStrings: boolean = false,\r\n  ): void {\r\n    if (smallestPossiblePrimitives) {\r\n      for (const c of this._path.children) {\r\n        c.collectCurvePrimitivesGo(collectorArray, smallestPossiblePrimitives, explodeLineStrings);\r\n      }\r\n    } else {\r\n      collectorArray.push(this);\r\n    }\r\n  }\r\n  /**\r\n   * Construct StrokeCountMap for each child, accumulating data to stroke count map for this primitive.\r\n   * @param options StrokeOptions that determine count\r\n   * @param parentStrokeMap evolving parent map.\r\n   */\r\n  public override computeAndAttachRecursiveStrokeCounts(options?: StrokeOptions, parentStrokeMap?: StrokeCountMap) {\r\n    const myMap = StrokeCountMap.createWithCurvePrimitiveAndOptionalParent(this, parentStrokeMap);\r\n    for (const c of this._path.children) {\r\n      c.computeAndAttachRecursiveStrokeCounts(options, myMap);\r\n    }\r\n    CurvePrimitive.installStrokeCountMap(this, myMap, parentStrokeMap);\r\n  }\r\n  /**\r\n   * Second step of double dispatch:  call `this._path.dispatchToGeometryHandler (handler)`\r\n   * * Note that this exposes the children individually to the handler.\r\n   */\r\n  public dispatchToGeometryHandler(handler: GeometryHandler): any {\r\n    return this._path.dispatchToGeometryHandler(handler);\r\n  }\r\n  /** Extend (increase) `rangeToExtend` as needed to include these curves (optionally transformed) */\r\n  public extendRange(rangeToExtend: Range3d, transform?: Transform): void {\r\n    this._path.extendRange(rangeToExtend, transform);\r\n  }\r\n  /**\r\n   * Curve length is always positive.\r\n   * @returns Returns a (high accuracy) length of the curve between fractional positions\r\n   * @returns Returns the length of the curve.\r\n   */\r\n  public override curveLengthBetweenFractions(fraction0: number, fraction1: number): number {\r\n    return Math.abs(fraction1 - fraction0) * this._totalLength;\r\n  }\r\n  /**\r\n   * Capture (not clone) a path into a new `CurveChainWithDistanceIndex`\r\n   * @param path primitive array to be CAPTURED (not cloned)\r\n   */\r\n  public static createCapture(path: CurveChain, options?: StrokeOptions): CurveChainWithDistanceIndex {\r\n    const fragments = DistanceIndexConstructionContext.createPathFragmentIndex(path, options);\r\n    const result = new CurveChainWithDistanceIndex(path, fragments);\r\n    return result;\r\n  }\r\n  /**\r\n   * Resolve a fraction of the CurveChain to a PathFragment\r\n   * @param distance\r\n   * @param allowExtrapolation\r\n   */\r\n  public chainDistanceToFragment(distance: number, allowExtrapolation: boolean = false): PathFragment | undefined {\r\n    const i = this.chainDistanceToFragmentIndex(distance, allowExtrapolation);\r\n    if (undefined !== i)\r\n      return this._fragments[i];\r\n    return undefined;\r\n  }\r\n  /**\r\n   * Resolve a fraction of the CurveChain to a PathFragment index\r\n   * @param distance\r\n   * @param allowExtrapolation\r\n   */\r\n  protected chainDistanceToFragmentIndex(distance: number, allowExtrapolation: boolean = false): number | undefined {\r\n    const numFragments = this._fragments.length;\r\n    const fragments = this._fragments;\r\n    if (numFragments > 0) {\r\n      if (distance < 0.0)\r\n        return allowExtrapolation ? 0 : undefined;\r\n      if (distance > this._totalLength)\r\n        return allowExtrapolation ? (numFragments - 1) : undefined;\r\n      // humbug, linear search\r\n      for (let i = 0; i < numFragments; i++) {\r\n        if (fragments[i].containsChainDistance(distance)) return i;\r\n      }\r\n    }\r\n    return undefined;\r\n  }\r\n  /**\r\n   * Convert distance along the chain to fraction along the chain.\r\n   * @param distance distance along the chain\r\n   */\r\n  public chainDistanceToChainFraction(distance: number): number {\r\n    return distance / this._totalLength;\r\n  }\r\n  /**\r\n   * Resolve a fraction within a specific curve to a fragment.\r\n   * @param curve\r\n   * @param fraction\r\n   */\r\n  public curveAndChildFractionToFragment(curve: CurvePrimitive, fraction: number): PathFragment | undefined {\r\n    const numFragments = this._fragments.length;\r\n    const fragments = this._fragments;\r\n    if (numFragments > 0) {\r\n      // humbug, linear search\r\n      for (const fragment of fragments) {\r\n        if (fragment.containsChildCurveAndChildFraction(curve, fraction))\r\n          return fragment;\r\n      }\r\n      if (fraction <= 0)\r\n        return fragments[0];\r\n      if (fraction > 1.0)\r\n        return fragments[numFragments - 1];\r\n    }\r\n    return undefined;\r\n  }\r\n  /** Returns the total length of curves. */\r\n  public override curveLength(): number {\r\n    return this._totalLength;\r\n  }\r\n  /**\r\n   * Returns the total length of the path.\r\n   * * This is exact (and simple property lookup) because the true lengths were summed at construction time.\r\n   */\r\n  public quickLength(): number {\r\n    return this._totalLength;\r\n  }\r\n  /**\r\n   * Return the point (x,y,z) on the curve at fractional position along the chain.\r\n   * @param fraction fractional position along the geometry.\r\n   * @returns Returns a point on the curve.\r\n   */\r\n  public fractionToPoint(fraction: number, result?: Point3d): Point3d {\r\n    const chainDistance = fraction * this._totalLength;\r\n    const fragment = this.chainDistanceToFragment(chainDistance, true);\r\n    if (fragment) {\r\n      const childFraction = fragment.chainDistanceToAccurateChildFraction(chainDistance, true);\r\n      return fragment.childCurve.fractionToPoint(childFraction, result);\r\n    }\r\n    // no fragment found.  Use _fragments[0]\r\n    //    fragment = this.chainDistanceToFragment(chainDistance, true);\r\n    return this._fragments[0].childCurve.fractionToPoint(0.0, result);\r\n  }\r\n  /**\r\n   * Return the point (x,y,z) and derivative on the curve at fractional position.\r\n   * * Note that this derivative is \"derivative of xyz with respect to fraction.\"\r\n   * * this derivative shows the speed of the \"fractional point\" moving along the curve.\r\n   * * this is not generally a unit vector.  use fractionToPointAndUnitTangent for a unit vector.\r\n   * @param fraction fractional position along the geometry.\r\n   * @returns Returns a ray whose origin is the curve point and direction is the derivative with respect to the fraction.\r\n   */\r\n  public fractionToPointAndDerivative(fraction: number, result?: Ray3d): Ray3d {\r\n    const distanceAlongPath = fraction * this._totalLength;\r\n    const fragment = this.chainDistanceToFragment(distanceAlongPath, true)!;\r\n    const curveFraction = fragment.chainDistanceToAccurateChildFraction(distanceAlongPath, true);\r\n    result = fragment.childCurve.fractionToPointAndDerivative(curveFraction, result);\r\n    // Fractional arc length parameterization for the curve C is f=f(t)=s(t)/L, where\r\n    // L is total length of C, f'=||C'||/L, and inverse t=t(f), t'=1/f'=L/||C'||.\r\n    // Then d/df(C(t(f)))=C't'=C'L/||C'||. The fragment gave us C', so the\r\n    // derivative we seek is just a scale away.\r\n    const a = this._totalLength / result.direction.magnitude();\r\n    result.direction.scaleInPlace(a);\r\n    return result;\r\n  }\r\n  /**\r\n   * Returns a ray whose origin is the curve point and direction is the unit tangent.\r\n   * @param fraction fractional position on the curve\r\n   * @param result optional receiver for the result.\r\n   * Returns a ray whose origin is the curve point and direction is the unit tangent.\r\n   */\r\n  public override fractionToPointAndUnitTangent(fraction: number, result?: Ray3d): Ray3d {\r\n    const distanceAlongPath = fraction * this._totalLength;\r\n    const fragment = this.chainDistanceToFragment(distanceAlongPath, true)!;\r\n    const curveFraction = fragment.chainDistanceToAccurateChildFraction(distanceAlongPath, true);\r\n    result = fragment.childCurve.fractionToPointAndDerivative(curveFraction, result);\r\n    result.direction.normalizeInPlace();\r\n    return result;\r\n  }\r\n  /**\r\n   * Return a plane with\r\n   * * origin at fractional position along the curve\r\n   * * vectorU is the first derivative, i.e. tangent vector with length equal to the rate of change with respect to\r\n   * the fraction.\r\n   * * vectorV is the second derivative, i.e.derivative of vectorU.\r\n   */\r\n  public fractionToPointAnd2Derivatives(\r\n    fraction: number, result?: Plane3dByOriginAndVectors,\r\n  ): Plane3dByOriginAndVectors | undefined {\r\n    const distanceAlongPath = fraction * this._totalLength;\r\n    const fragment = this.chainDistanceToFragment(distanceAlongPath, true)!;\r\n    const curveFraction = fragment.chainDistanceToAccurateChildFraction(distanceAlongPath, true);\r\n    result = fragment.childCurve.fractionToPointAnd2Derivatives(curveFraction, result);\r\n    if (!result)\r\n      return undefined;\r\n    // See fractionToPointAndDerivative for derivation of d/df(C(t(f)))=L C'/||C'||.\r\n    // For the 2nd deriv, use quotient rule, d/dt||x(t)||=x.x'/||x|| and ||x||^2=x.x :\r\n    // d/df(C'(t(f))) = L d/df(C'/||C'||)\r\n    //  = L (||C'|| d/df(C') - C' d/df||C'||) / ||C'||^2\r\n    //  = L (||C'|| C\" L/||C'|| - C' C'.C\"/||C'|| L/||C'||) / ||C'||^2\r\n    //  = (L/||C'||)^2 (C\" - C' C'.C\"/C'.C' )\r\n    // We have C' and C\" from the fragment.\r\n    const magU = result.vectorU.magnitude();\r\n    const dotUU = magU * magU;\r\n    const dotUV = result.vectorU.dotProduct(result.vectorV);\r\n    result.vectorV.addScaledInPlace(result.vectorU, -dotUV / dotUU);\r\n    const scale = this._totalLength / magU;\r\n    result.vectorU.scaleInPlace(scale);\r\n    result.vectorV.scaleInPlace(scale * scale);\r\n    return result;\r\n  }\r\n  /**\r\n   * Attempt to transform in place.\r\n   * * Warning: If any child fails, this object becomes invalid.  But that should never happen.\r\n   */\r\n  public tryTransformInPlace(transform: Transform): boolean {\r\n    let numFail = 0;\r\n    for (const c of this._path.children) {\r\n      if (!c.tryTransformInPlace(transform))\r\n        numFail++;\r\n    }\r\n    return numFail === 0;\r\n  }\r\n  /** Reverse the curve's data so that its fractional stroking moves in the opposite direction. */\r\n  public reverseInPlace(): void {\r\n    this._path.reverseChildrenInPlace();\r\n    const totalLength = this._totalLength;\r\n    for (const fragment of this._fragments) {\r\n      fragment.reverseFractionsAndDistances(totalLength);\r\n    }\r\n    this._fragments.reverse();\r\n  }\r\n  /**\r\n   * Test for equality conditions:\r\n   * * Mismatched totalLength is a quick exit condition\r\n   * * If totalLength matches, recurse to the path for matching primitives.\r\n   * @param other\r\n   */\r\n  public override isAlmostEqual(other: GeometryQuery): boolean {\r\n    if (other instanceof CurveChainWithDistanceIndex) {\r\n      return Geometry.isSameCoordinate(this._totalLength, other._totalLength)\r\n        && this._path.isAlmostEqual(other._path);\r\n    }\r\n    return false;\r\n  }\r\n  /**\r\n   * Implement moveSignedDistanceFromFraction.\r\n   * * See `CurvePrimitive` for parameter details.\r\n   * * The returned location directly identifies fractional position along the CurveChainWithDistanceIndex, and\r\n   * has pointer to an additional detail for the child curve.\r\n   */\r\n  public override moveSignedDistanceFromFraction(\r\n    startFraction: number, signedDistance: number, allowExtension: boolean, result?: CurveLocationDetail,\r\n  ): CurveLocationDetail {\r\n    const distanceA = startFraction * this._totalLength;\r\n    const distanceB = distanceA + signedDistance;\r\n    const fragmentB = this.chainDistanceToFragment(distanceB, true)!;\r\n    const childDetail = fragmentB.childCurve.moveSignedDistanceFromFraction(fragmentB.childFraction0, distanceB - fragmentB.chainDistance0, allowExtension, result);\r\n    const endFraction = startFraction + (signedDistance / this._totalLength);\r\n    const chainDetail = CurveLocationDetail.createConditionalMoveSignedDistance(allowExtension, this, startFraction, endFraction, signedDistance, result);\r\n    chainDetail.childDetail = childDetail;\r\n    return chainDetail;\r\n  }\r\n  /**\r\n   * The returned object has\r\n   * * numCalls = number of times closestPoint was called.\r\n   * * numCurvesTested = number of curves tested with full closestPoint\r\n   * * numAssigned = number of times a new minimum value was recorded\r\n   * * numCandidate = number of curves that would be tested in worst case.\r\n   * return an object summarizing closest point test counts\r\n   * @param clear if true, counts are cleared after the return object is formed.\r\n   */\r\n  public static getClosestPointTestCounts(\r\n    clear: boolean = true,\r\n  ): { numCalls: number, numTested: number, numAssigned: number, numCandidate: number } {\r\n    const a = {\r\n      numCalls: this._numCalls,\r\n      numTested: this._numTested,\r\n      numAssigned: this._numAssigned,\r\n      numCandidate: this._numCandidate,\r\n    };\r\n    if (clear) {\r\n      this._numTested = this._numAssigned = this._numCandidate = 0;\r\n    }\r\n    return a;\r\n  }\r\n  private static _numCalls = 0;\r\n  private static _numTested = 0;\r\n  private static _numAssigned = 0;\r\n  private static _numCandidate = 0;\r\n  /**\r\n   * Search for the curve point that is closest to the spacePoint.\r\n   * * The CurveChainWithDistanceIndex invokes the base class CurvePrimitive method, which\r\n   *     (via a handler) determines a CurveLocation detail among the children.\r\n   * * The returned detail directly identifies fractional position along the CurveChainWithDistanceIndex, and\r\n   * has pointer to an additional detail for the child curve.\r\n   * @param spacePoint point in space\r\n   * @param extend true to extend the curve\r\n   * @returns Returns a CurveLocationDetail structure that holds the details of the close point.\r\n   */\r\n  public override closestPoint(\r\n    spacePoint: Point3d, extend: VariantCurveExtendParameter,\r\n  ): CurveLocationDetail | undefined {\r\n    let childDetail: CurveLocationDetail | undefined;\r\n    let aMin = Number.MAX_VALUE;\r\n    const numChildren = this.path.children.length;\r\n    if (numChildren === 1) {\r\n      childDetail = this.path.children[0].closestPoint(spacePoint, extend);\r\n    } else {\r\n      const sortedFragments = PathFragment.collectSortedQuickMinDistances(this._fragments, spacePoint);\r\n      const extend0 = [CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(extend, 0), CurveExtendMode.None];\r\n      const extend1 = [CurveExtendMode.None, CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(extend, 1)];\r\n      const fragment0 = this._fragments[0];\r\n      const fragment1 = this._fragments[this._fragments.length - 1];\r\n      CurveChainWithDistanceIndex._numCalls++;\r\n      CurveChainWithDistanceIndex._numCandidate += sortedFragments.length;\r\n      for (const f of sortedFragments) {\r\n        if (f.a > aMin)\r\n          break;\r\n        CurveChainWithDistanceIndex._numTested++;\r\n        const child = f.childCurve;\r\n        const detailA = child.closestPoint(spacePoint,\r\n          f === fragment0 ? extend0 : f === fragment1 ? extend1 : false);\r\n        if (detailA && detailA.a < aMin) {\r\n          aMin = detailA.a;\r\n          childDetail = CurveLocationDetail.createCurveFractionPoint(detailA.curve, detailA.fraction, detailA.point, childDetail)!;\r\n          childDetail.a = detailA.a;\r\n          CurveChainWithDistanceIndex._numAssigned++;\r\n        }\r\n      }\r\n    }\r\n    if (!childDetail)\r\n      return undefined;\r\n    const fragment = this.curveAndChildFractionToFragment(childDetail.curve!, childDetail.fraction);\r\n    if (fragment) {\r\n      const chainDistance = fragment.childFractionToChainDistance(childDetail.fraction);\r\n      const chainFraction = this.chainDistanceToChainFraction(chainDistance);\r\n      const chainDetail = CurveLocationDetail.createCurveFractionPoint(this, chainFraction, childDetail.point);\r\n      chainDetail.childDetail = childDetail;\r\n      chainDetail.a = childDetail.a;\r\n      return chainDetail;\r\n    }\r\n    return undefined;\r\n  }\r\n  /**\r\n   * Construct an offset of each child as viewed in the xy-plane (ignoring z).\r\n   * * No attempt is made to join the offset children. Use RegionOps.constructCurveXYOffset() to return a fully\r\n   * joined offset.\r\n   * @param offsetDistanceOrOptions offset distance (positive to left of the instance curve), or options object\r\n   */\r\n  public override constructOffsetXY(\r\n    offsetDistanceOrOptions: number | OffsetOptions,\r\n  ): CurvePrimitive | CurvePrimitive[] | undefined {\r\n    const options = OffsetOptions.create(offsetDistanceOrOptions);\r\n    const offsets: CurvePrimitive[] = [];\r\n    for (const prim of this.collectCurvePrimitives(undefined, true, true)) {\r\n      const offset = prim.constructOffsetXY(options);\r\n      if (offset !== undefined) {\r\n        if (offset instanceof CurvePrimitive)\r\n          offsets.push(offset);\r\n        else if (Array.isArray(offset))\r\n          offset.forEach((cp) => offsets.push(cp));\r\n      }\r\n    }\r\n    return offsets;\r\n  }\r\n  /**\r\n   * Project instance geometry (via dispatch) onto the given ray, and return the extreme fractional parameters of\r\n   * projection.\r\n   * @param ray ray onto which the instance is projected. A `Vector3d` is treated as a `Ray3d` with zero origin.\r\n   * @param lowHigh optional receiver for output\r\n   * @returns range of fractional projection parameters onto the ray, where 0.0 is start of the ray and 1.0 is the\r\n   * end of the ray.\r\n   */\r\n  public override projectedParameterRange(ray: Vector3d | Ray3d, lowHigh?: Range1d): Range1d | undefined {\r\n    return PlaneAltitudeRangeContext.findExtremeFractionsAlongDirection(this, ray, lowHigh);\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"CurveChainWithDistanceIndex.js","sourceRoot":"","sources":["../../../src/curve/CurveChainWithDistanceIndex.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F;;GAEG;AACH,sDAA6C;AAC7C,4DAAyD;AACzD,kEAA+D;AAC/D,0CAAuC;AAIvC,mEAAkE;AAClE,+CAAuD;AAGvD,uDAA+C;AAC/C,uDAAqG;AACrG,+DAA4D;AAE5D,4FAAyF;AAEzF,mDAAgD;AAChD,iCAA8B;AAG9B;;;;;;GAMG;AACH,MAAa,YAAY;IAevB,0EAA0E;IAC1E,YACE,cAAsB,EACtB,cAAsB,EACtB,SAAiB,EACjB,SAAiB,EACjB,UAA0B,EAC1B,KAAe;QAEf,IAAI,CAAC,cAAc,GAAG,cAAc,CAAC;QACrC,IAAI,CAAC,cAAc,GAAG,cAAc,CAAC;QACrC,IAAI,CAAC,cAAc,GAAG,SAAS,CAAC;QAChC,IAAI,CAAC,cAAc,GAAG,SAAS,CAAC;QAChC,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;QAC7B,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;IACb,CAAC;IACD,kFAAkF;IAC3E,qBAAqB,CAAC,QAAgB;QAC3C,OAAO,QAAQ,IAAI,IAAI,CAAC,cAAc,IAAI,QAAQ,IAAI,IAAI,CAAC,cAAc,CAAC;IAC5E,CAAC;IACD;;;;OAIG;IACI,4BAA4B,CAAC,UAAmB;QACrD,IAAI,IAAI,CAAC,KAAK;YACZ,OAAO,IAAI,CAAC,KAAK,CAAC,eAAe,CAAC,UAAU,CAAC,CAAC;QAChD,MAAM,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC,YAAY,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;QAC/D,IAAI,MAAM;YACR,OAAO,MAAM,CAAC,CAAC,CAAC;QAClB,OAAO,CAAC,CAAC;IACX,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,8BAA8B,CAAC,SAAyB,EAAE,UAAmB;QACzF,MAAM,eAAe,GAAmB,EAAE,CAAC;QAC3C,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE;YAC5B,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,4BAA4B,CAAC,UAAU,CAAC,CAAC;YACvD,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;SAC5B;QACD,eAAe,CAAC,IAAI,CAAC,CAAC,KAAmB,EAAE,KAAmB,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACtF,OAAO,eAAe,CAAC;IACzB,CAAC;IACD,gFAAgF;IACzE,kCAAkC,CAAC,KAAqB,EAAE,QAAgB;QAC/E,OAAO,IAAI,CAAC,UAAU,KAAK,KAAK,IAAI,QAAQ,IAAI,IAAI,CAAC,cAAc,IAAI,QAAQ,IAAI,IAAI,CAAC,cAAc,CAAC;IACzG,CAAC;IACD;;;OAGG;IACI,wCAAwC,CAAC,QAAgB;QAC9D,OAAO,mBAAQ,CAAC,kBAAkB,CAChC,IAAI,CAAC,cAAc,EACnB,IAAI,CAAC,cAAc,EACnB,IAAI,CAAC,cAAc,EACnB,IAAI,CAAC,cAAc,EACnB,QAAQ,EACR,IAAI,CAAC,cAAc,CACnB,CAAC,CAAC,mEAAmE;IACzE,CAAC;IACD,kHAAkH;IAC3G,oCAAoC,CAAC,aAAqB,EAAE,kBAA4B;QAC7F,MAAM,WAAW,GAAG,IAAI,CAAC,UAAU,CAAC,8BAA8B,CAChE,IAAI,CAAC,cAAc,EAAE,aAAa,GAAG,IAAI,CAAC,cAAc,EAAE,kBAAkB,IAAI,KAAK,CACtF,CAAC;QACF,OAAO,WAAW,CAAC,QAAQ,CAAC;IAC9B,CAAC;IACD;;;OAGG;IACI,mBAAmB,CAAC,cAAsB;QAC/C,OAAO,cAAc,GAAG,CAAC,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC,cAAc,CAAC,CAAC;IACpH,CAAC;IACD;;;;;OAKG;IACI,4BAA4B,CAAC,aAAqB;QACvD,MAAM,EAAE,GAAG,IAAI,CAAC,cAAc,CAAC;QAC/B,MAAM,EAAE,GAAG,IAAI,CAAC,cAAc,CAAC;QAC/B,MAAM,EAAE,GAAG,IAAI,CAAC,cAAc,CAAC;QAC/B,MAAM,EAAE,GAAG,IAAI,CAAC,cAAc,CAAC;QAC/B,IAAI,CAAC,cAAc,GAAG,GAAG,GAAG,EAAE,CAAC;QAC/B,IAAI,CAAC,cAAc,GAAG,GAAG,GAAG,EAAE,CAAC;QAC/B,IAAI,CAAC,cAAc,GAAG,aAAa,GAAG,EAAE,CAAC;QACzC,IAAI,CAAC,cAAc,GAAG,aAAa,GAAG,EAAE,CAAC;IAC3C,CAAC;IACD,2EAA2E;IACpE,2BAA2B,CAAC,QAAgB;QACjD,OAAO,IAAI,CAAC,4BAA4B,CAAC,QAAQ,CAAC,CAAC;IACrD,CAAC;IACD;;;;OAIG;IACI,4BAA4B,CAAC,QAAgB;QAClD,IAAI,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,2BAA2B,CAAC,IAAI,CAAC,cAAc,EAAE,QAAQ,CAAC,CAAC;QACnF,IAAI,QAAQ,GAAG,IAAI,CAAC,cAAc;YAChC,CAAC,GAAG,CAAC,CAAC,CAAC;QACT,OAAO,IAAI,CAAC,cAAc,GAAG,CAAC,CAAC;IACjC,CAAC;CACF;AA7HD,oCA6HC;AAED,0EAA0E;AAC1E,MAAM,gCAAgC;IAGpC;QACE,IAAI,CAAC,oBAAoB,GAAG,CAAC,CAAC;QAC9B,IAAI,CAAC,UAAU,GAAG,EAAE,CAAC;IACvB,CAAC;IACD,0EAA0E;IACnE,yBAAyB,CAAC,GAAmB,IAAI,CAAC;IAClD,mBAAmB,CAAC,GAAmB,IAAI,CAAC;IAC5C,uBAAuB,CAAC,GAAmB,IAAI,CAAC;IAChD,iBAAiB,CAAC,GAAmB,IAAI,CAAC;IAC1C,oBAAoB,CAAC,IAAa,EAAE,SAAiB,EAAE,QAAkB,IAAI,CAAC;IAC9E,uBAAuB,CAC5B,EAAkB,EAAE,MAAe,EAAE,MAAe,EAAE,UAAkB,EAAE,SAAiB,EAAE,SAAiB;QAE9G,MAAM,cAAc,GAAG,MAAM,CAAC,KAAK,EAAE,CAAC;QACtC,MAAM,cAAc,GAAG,MAAM,CAAC,KAAK,EAAE,CAAC;QACtC,IAAI,EAAE,GAAG,IAAI,CAAC,oBAAoB,CAAC;QACnC,IAAI,UAAU,IAAI,CAAC,EAAE;YACnB,IAAI,CAAC,oBAAoB,IAAI,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;YACrD,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,YAAY,CAAC,SAAS,EAAE,SAAS,EAAE,EAAE,EAAE,IAAI,CAAC,oBAAoB,EAAE,EAAE,EAC3F,eAAO,CAAC,MAAM,CAAC,cAAc,EAAE,cAAc,CAAC,CAAC,CAAC,CAAC;SACpD;aAAM;YACL,IAAI,EAAE,CAAC;YACP,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,SAAS,EAAE,CAAC,IAAI,UAAU,EAAE,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE;gBAC7D,EAAE,GAAG,mBAAQ,CAAC,WAAW,CAAC,SAAS,EAAE,CAAC,GAAG,UAAU,EAAE,SAAS,CAAC,CAAC;gBAChE,MAAM,CAAC,WAAW,CAAC,EAAE,EAAE,MAAM,EAAE,cAAc,CAAC,CAAC;gBAC/C,EAAE,GAAG,IAAI,CAAC,oBAAoB,CAAC;gBAC/B,IAAI,CAAC,oBAAoB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC;gBAC3E,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,YAAY,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,oBAAoB,EAAE,EAAE,EAC7E,eAAO,CAAC,MAAM,CAAC,cAAc,EAAE,cAAc,CAAC,CAAC,CAAC,CAAC;gBACnD,cAAc,CAAC,OAAO,CAAC,cAAc,CAAC,CAAC;aACxC;SACF;IACH,CAAC;IACM,qCAAqC,CAC1C,EAAkB,EAAE,UAAkB,EAAE,SAAiB,EAAE,SAAiB;QAE5E,IAAI,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;QACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,SAAS,EAAE,CAAC,IAAI,UAAU,EAAE,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE;YAC7D,EAAE,GAAG,mBAAQ,CAAC,WAAW,CAAC,SAAS,EAAE,CAAC,GAAG,UAAU,EAAE,SAAS,CAAC,CAAC;YAChE,CAAC,GAAG,EAAE,CAAC,2BAA2B,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YAC3C,EAAE,GAAG,IAAI,CAAC,oBAAoB,CAAC;YAC/B,IAAI,CAAC,oBAAoB,IAAI,CAAC,CAAC;YAC/B,MAAM,KAAK,GAAG,EAAE,CAAC,qBAAqB,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YAC/C,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,YAAY,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,oBAAoB,EAAE,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC;SAC1F;IACH,CAAC;IACM,6BAA6B;QAClC,OAAO,IAAI,CAAC;IACd,CAAC;IACD,8DAA8D;IACvD,MAAM,CAAC,uBAAuB,CAAC,IAAgB,EAAE,OAAuB;QAC7E,MAAM,OAAO,GAAG,IAAI,gCAAgC,EAAE,CAAC;QACvD,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE;YACjC,KAAK,CAAC,kBAAkB,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;SAC5C;QACD,MAAM,SAAS,GAAG,OAAO,CAAC,UAAU,CAAC;QACrC,OAAO,SAAS,CAAC;IACnB,CAAC;CACF;AACD;;;;;;;GAOG;AACH,MAAa,2BAA4B,SAAQ,+BAAc;IAU7D,yDAAyD;IAClD,mBAAmB,CAAC,KAAoB;QAC7C,OAAO,KAAK,YAAY,2BAA2B,CAAC;IACtD,CAAC;IACD,4FAA4F;IAC5F,YAAoB,IAAgB,EAAE,SAAyB;QAC7D,KAAK,EAAE,CAAC;QAfV,wCAAwC;QACxB,uBAAkB,GAAG,6BAA6B,CAAC;QAejE,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;QAC5B,IAAI,CAAC,YAAY,GAAG,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC;IAChG,CAAC;IACD;;;OAGG;IACI,gBAAgB,CAAC,SAAoB;QAC1C,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QAC7B,IAAI,CAAC,YAAY,4BAAU,IAAI,CAAC,CAAC,mBAAmB,CAAC,SAAS,CAAC;YAC7D,OAAO,2BAA2B,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;QACtD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;OAGG;IACH,IAAW,IAAI;QACb,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IACD;;;OAGG;IACH,IAAW,SAAS;QAClB,OAAO,IAAI,CAAC,UAAU,CAAC;IACzB,CAAC;IACD,0BAA0B;IACnB,KAAK;QACV,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,EAAgB,CAAC;QAC3C,OAAO,2BAA2B,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;IACtD,CAAC;IACD,0BAA0B;IACV,iBAAiB,CAAC,SAAiB,EAAE,SAAiB;QACpE,IAAI,SAAS,KAAK,SAAS;YACzB,OAAO,SAAS,CAAC;QACnB,IAAI,KAAK,GAAG,SAAS,CAAC;QACtB,IAAI,KAAK,GAAG,SAAS,CAAC;QACtB,MAAM,QAAQ,GAAG,SAAS,GAAG,SAAS,CAAC;QACvC,IAAI,QAAQ,EAAE;YACZ,KAAK,GAAG,SAAS,CAAC;YAClB,KAAK,GAAG,SAAS,CAAC;SACnB;QACD,MAAM,cAAc,GAAG,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC;QACjD,MAAM,cAAc,GAAG,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC;QACjD,MAAM,SAAS,GAAG,IAAI,CAAC,uBAAuB,CAAC,cAAc,EAAE,IAAI,CAAC,CAAC;QACrE,IAAI,SAAS,KAAK,SAAS;YACzB,OAAO,SAAS,CAAC;QACnB,MAAM,SAAS,GAAG,IAAI,CAAC,uBAAuB,CAAC,cAAc,EAAE,IAAI,CAAC,CAAC;QACrE,IAAI,SAAS,KAAK,SAAS;YACzB,OAAO,SAAS,CAAC;QACnB,MAAM,gBAAgB,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,SAAS,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;QAC3E,IAAI,SAAS,KAAK,gBAAgB;YAChC,OAAO,SAAS,CAAC;QACnB,MAAM,gBAAgB,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,SAAS,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;QAC3E,IAAI,SAAS,KAAK,gBAAgB;YAChC,OAAO,SAAS,CAAC;QACnB,MAAM,cAAc,GAAG,SAAS,CAAC,oCAAoC,CAAC,cAAc,EAAE,IAAI,CAAC,CAAC;QAC5F,MAAM,cAAc,GAAG,SAAS,CAAC,oCAAoC,CAAC,cAAc,EAAE,IAAI,CAAC,CAAC;QAC5F,qDAAqD;QACrD,MAAM,OAAO,GAAG,WAAI,CAAC,MAAM,EAAE,CAAC;QAC9B,MAAM,eAAe,GAAG,CACtB,UAA0B,EAAE,cAAsB,EAAE,cAAsB,EAAE,aAAsB,EACzF,EAAE;YACX,IAAI,cAAc,KAAK,cAAc;gBACnC,OAAO,KAAK,CAAC;YACf,IAAI,QAAQ,CAAC;YACb,IAAI,cAAc,KAAK,GAAG,IAAI,cAAc,KAAK,GAAG,EAAE;gBACpD,QAAQ,GAAG,UAAU,CAAC,KAAK,EAAE,CAAC;gBAC9B,IAAI,aAAa;oBACf,QAAQ,CAAC,cAAc,EAAE,CAAC;aAC7B;iBAAM;gBACL,QAAQ,GAAG,aAAa,CAAC,CAAC;oBACxB,UAAU,CAAC,iBAAiB,CAAC,cAAc,EAAE,cAAc,CAAC;oBAC5D,CAAC,CAAC,UAAU,CAAC,iBAAiB,CAAC,cAAc,EAAE,cAAc,CAAC,CAAC;aAClE;YACD,IAAI,QAAQ,EAAE;gBACZ,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBAChC,OAAO,IAAI,CAAC;aACb;YACD,OAAO,KAAK,CAAC;QACf,CAAC,CAAC;QACF,IAAI,SAAS,CAAC,UAAU,KAAK,SAAS,CAAC,UAAU,EAAE;YACjD,+CAA+C;YAC/C,IAAI,eAAe,CAAC,SAAS,CAAC,UAAU,EAAE,cAAc,EAAE,cAAc,EAAE,QAAQ,CAAC;gBACjF,OAAO,2BAA2B,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC,wDAAwD;YACrH,OAAO,SAAS,CAAC;SAClB;QACD,eAAe,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,gBAAgB,CAAC,EAAE,cAAc,EAAE,GAAG,EAAE,QAAQ,CAAC,CAAC;QACtF,mDAAmD;QACnD,KAAK,IAAI,UAAU,GAAG,gBAAgB,GAAG,CAAC,EAAE,UAAU,GAAG,gBAAgB,EAAE,UAAU,EAAE,EAAE;YACvF,eAAe,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,UAAU,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,QAAQ,CAAC,CAAC;SACtE;QACD,eAAe,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,gBAAgB,CAAC,EAAE,GAAG,EAAE,cAAc,EAAE,QAAQ,CAAC,CAAC;QACtF,wEAAwE;QACxE,IAAI,QAAQ;YACV,OAAO,CAAC,QAAQ,CAAC,OAAO,EAAE,CAAC;QAC7B,OAAO,2BAA2B,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;IAC5D,CAAC;IACD;;;OAGG;IACI,SAAS,CAAC,KAAmC;QAClD,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE;YACnC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC;gBACrB,OAAO,KAAK,CAAC;SAChB;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IACD,8CAA8C;IAC9B,UAAU,CAAC,MAAgB;QACzC,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC;QAC7C,IAAI,CAAC;YACH,OAAO,CAAC,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;QAC9B,OAAO,yBAAO,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;IACpC,CAAC;IACD,+CAA+C;IAC/B,QAAQ,CAAC,MAAgB;QACvC,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9C,IAAI,CAAC;YACH,OAAO,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QAC5B,OAAO,yBAAO,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;IACpC,CAAC;IACD,gDAAgD;IACzC,WAAW,CAAC,IAAkB,EAAE,OAAuB;QAC5D,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE;YACnC,CAAC,CAAC,WAAW,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;SAC9B;IACH,CAAC;IACD;;;OAGG;IACI,kBAAkB,CAAC,IAAoB,EAAE,OAAuB;QACrE,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE;YACnC,CAAC,CAAC,kBAAkB,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;SACrC;IACH,CAAC;IACD;;;OAGG;IACI,4BAA4B,CAAC,OAAuB;QACzD,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE;YACnC,SAAS,IAAI,CAAC,CAAC,4BAA4B,CAAC,OAAO,CAAC,CAAC;SACtD;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;OAMG;IACa,wBAAwB,CACtC,cAAgC,EAAE,6BAAsC,KAAK,EAAE,qBAA8B,KAAK;QAElH,IAAI,0BAA0B,EAAE;YAC9B,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE;gBACnC,CAAC,CAAC,wBAAwB,CAAC,cAAc,EAAE,0BAA0B,EAAE,kBAAkB,CAAC,CAAC;aAC5F;SACF;aAAM;YACL,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;SAC3B;IACH,CAAC;IACD;;;;OAIG;IACa,qCAAqC,CAAC,OAAuB,EAAE,eAAgC;QAC7G,MAAM,KAAK,GAAG,+BAAc,CAAC,yCAAyC,CAAC,IAAI,EAAE,eAAe,CAAC,CAAC;QAC9F,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE;YACnC,CAAC,CAAC,qCAAqC,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;SACzD;QACD,+BAAc,CAAC,qBAAqB,CAAC,IAAI,EAAE,KAAK,EAAE,eAAe,CAAC,CAAC;IACrE,CAAC;IACD;;;OAGG;IACI,yBAAyB,CAAC,OAAwB;QACvD,OAAO,OAAO,CAAC,iCAAiC,CAAC,IAAI,CAAC,CAAC;IACzD,CAAC;IACD,wFAAwF;IACjF,WAAW,CAAC,aAAsB,EAAE,SAAqB;QAC9D,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,aAAa,EAAE,SAAS,CAAC,CAAC;IACnD,CAAC;IACD,6FAA6F;IAC7E,2BAA2B,CAAC,SAAiB,EAAE,SAAiB;QAC9E,OAAO,IAAI,CAAC,GAAG,CAAC,SAAS,GAAG,SAAS,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC;IAC7D,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,aAAa,CAAC,IAAgB,EAAE,OAAuB;QACnE,MAAM,SAAS,GAAG,gCAAgC,CAAC,uBAAuB,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QAC1F,MAAM,MAAM,GAAG,IAAI,2BAA2B,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;QAChE,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;OAKG;IACI,uBAAuB,CAAC,QAAgB,EAAE,qBAA8B,KAAK;QAClF,MAAM,CAAC,GAAG,IAAI,CAAC,4BAA4B,CAAC,QAAQ,EAAE,kBAAkB,CAAC,CAAC;QAC1E,IAAI,SAAS,KAAK,CAAC;YACjB,OAAO,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QAC5B,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;OAKG;IACO,4BAA4B,CAAC,QAAgB,EAAE,qBAA8B,KAAK;QAC1F,MAAM,YAAY,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC;QAC5C,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC;QAClC,IAAI,YAAY,GAAG,CAAC,EAAE;YACpB,IAAI,QAAQ,GAAG,GAAG;gBAChB,OAAO,kBAAkB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;YAC5C,IAAI,QAAQ,GAAG,IAAI,CAAC,YAAY;gBAC9B,OAAO,kBAAkB,CAAC,CAAC,CAAC,CAAC,YAAY,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;YAC7D,8CAA8C;YAC9C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,EAAE,CAAC,EAAE,EAAE;gBACrC,IAAI,SAAS,CAAC,CAAC,CAAC,CAAC,qBAAqB,CAAC,QAAQ,CAAC;oBAC9C,OAAO,CAAC,CAAC;aACZ;SACF;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;OAGG;IACI,4BAA4B,CAAC,QAAgB;QAClD,OAAO,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC;IACtC,CAAC;IACD,4GAA4G;IACrG,+BAA+B,CAAC,KAAqB,EAAE,QAAgB;QAC5E,MAAM,YAAY,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC;QAC5C,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC;QAClC,IAAI,YAAY,GAAG,CAAC,EAAE;YACpB,IAAI,QAAQ,GAAG,CAAC;gBACd,OAAO,SAAS,CAAC,CAAC,CAAC,CAAC;YACtB,IAAI,QAAQ,GAAG,GAAG;gBAChB,OAAO,SAAS,CAAC,YAAY,GAAG,CAAC,CAAC,CAAC;YACrC,8CAA8C;YAC9C,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE;gBAChC,IAAI,QAAQ,CAAC,kCAAkC,CAAC,KAAK,EAAE,QAAQ,CAAC;oBAC9D,OAAO,QAAQ,CAAC;aACnB;SACF;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,gDAAgD;IAChC,WAAW;QACzB,OAAO,IAAI,CAAC,YAAY,CAAC;IAC3B,CAAC;IACD;;;OAGG;IACI,WAAW;QAChB,OAAO,IAAI,CAAC,YAAY,CAAC;IAC3B,CAAC;IACD;;;;OAIG;IACI,eAAe,CAAC,QAAgB,EAAE,MAAgB;QACvD,MAAM,iBAAiB,GAAG,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC;QACvD,MAAM,QAAQ,GAAG,IAAI,CAAC,uBAAuB,CAAC,iBAAiB,EAAE,IAAI,CAAC,CAAC;QACvE,IAAI,QAAQ,EAAE;YACZ,MAAM,aAAa,GAAG,QAAQ,CAAC,oCAAoC,CAAC,iBAAiB,EAAE,IAAI,CAAC,CAAC;YAC7F,OAAO,QAAQ,CAAC,UAAU,CAAC,eAAe,CAAC,aAAa,EAAE,MAAM,CAAC,CAAC;SACnE;QACD,IAAA,qBAAM,EAAC,KAAK,CAAC,CAAC,CAAC,8BAA8B;QAC7C,+DAA+D;QAC/D,OAAO,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,eAAe,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;IACpE,CAAC;IACD;;;;;;;;OAQG;IACI,4BAA4B,CAAC,QAAgB,EAAE,MAAc;QAClE,MAAM,iBAAiB,GAAG,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC;QACvD,MAAM,QAAQ,GAAG,IAAI,CAAC,uBAAuB,CAAC,iBAAiB,EAAE,IAAI,CAAE,CAAC;QACxE,MAAM,aAAa,GAAG,QAAQ,CAAC,oCAAoC,CAAC,iBAAiB,EAAE,IAAI,CAAC,CAAC;QAC7F,MAAM,GAAG,QAAQ,CAAC,UAAU,CAAC,4BAA4B,CAAC,aAAa,EAAE,MAAM,CAAC,CAAC;QACjF,qGAAqG;QACrG,gHAAgH;QAChH,kHAAkH;QAClH,gHAAgH;QAChH,wDAAwD;QACxD,mEAAmE;QACnE,MAAM,CAAC,GAAG,IAAI,CAAC,YAAY,GAAG,MAAM,CAAC,SAAS,CAAC,SAAS,EAAE,CAAC,CAAC,WAAW;QACvE,MAAM,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QACjC,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;;;;;OASG;IACa,6BAA6B,CAAC,QAAgB,EAAE,MAAc;QAC5E,MAAM,iBAAiB,GAAG,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC;QACvD,MAAM,QAAQ,GAAG,IAAI,CAAC,uBAAuB,CAAC,iBAAiB,EAAE,IAAI,CAAE,CAAC;QACxE,MAAM,aAAa,GAAG,QAAQ,CAAC,oCAAoC,CAAC,iBAAiB,EAAE,IAAI,CAAC,CAAC;QAC7F,MAAM,GAAG,QAAQ,CAAC,UAAU,CAAC,4BAA4B,CAAC,aAAa,EAAE,MAAM,CAAC,CAAC;QACjF,MAAM,CAAC,SAAS,CAAC,gBAAgB,EAAE,CAAC;QACpC,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;;;OAOG;IACI,8BAA8B,CACnC,QAAgB,EAAE,MAAkC;QAEpD,MAAM,iBAAiB,GAAG,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC;QACvD,MAAM,QAAQ,GAAG,IAAI,CAAC,uBAAuB,CAAC,iBAAiB,EAAE,IAAI,CAAE,CAAC;QACxE,MAAM,aAAa,GAAG,QAAQ,CAAC,oCAAoC,CAAC,iBAAiB,EAAE,IAAI,CAAC,CAAC;QAC7F,MAAM,GAAG,QAAQ,CAAC,UAAU,CAAC,8BAA8B,CAAC,aAAa,EAAE,MAAM,CAAC,CAAC;QACnF,IAAI,CAAC,MAAM;YACT,OAAO,SAAS,CAAC;QACnB,+EAA+E;QAC/E,mFAAmF;QACnF,6EAA6E;QAC7E,uFAAuF;QACvF,kEAAkE;QAClE,qFAAqF;QACrF,yFAAyF;QACzF,8CAA8C;QAC9C,mEAAmE;QACnE,MAAM,IAAI,GAAG,MAAM,CAAC,OAAO,CAAC,SAAS,EAAE,CAAC,CAAC,SAAS;QAClD,MAAM,KAAK,GAAG,IAAI,GAAG,IAAI,CAAC,CAAC,WAAW;QACtC,MAAM,KAAK,GAAG,MAAM,CAAC,OAAO,CAAC,UAAU,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,QAAQ;QACjE,MAAM,CAAC,OAAO,CAAC,gBAAgB,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,wCAAwC;QACzG,MAAM,KAAK,GAAG,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,CAAC,WAAW;QACnD,MAAM,CAAC,OAAO,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,4BAA4B;QAChE,MAAM,CAAC,OAAO,CAAC,YAAY,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,mCAAmC;QAC/E,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;OAKG;IACI,mBAAmB,CAAC,SAAoB;QAC7C,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE;YACnC,IAAI,CAAC,CAAC,CAAC,mBAAmB,CAAC,SAAS,CAAC;gBACnC,OAAO,EAAE,CAAC;SACb;QACD,OAAO,OAAO,KAAK,CAAC,CAAC;IACvB,CAAC;IACD,gGAAgG;IACzF,cAAc;QACnB,IAAI,CAAC,KAAK,CAAC,sBAAsB,EAAE,CAAC;QACpC,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,UAAU,EAAE;YACtC,QAAQ,CAAC,4BAA4B,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;SAC1D;QACD,IAAI,CAAC,UAAU,CAAC,OAAO,EAAE,CAAC;IAC5B,CAAC;IACD;;;;OAIG;IACa,aAAa,CAAC,KAAoB;QAChD,IAAI,KAAK,YAAY,2BAA2B,EAAE;YAChD,OAAO,mBAAQ,CAAC,gBAAgB,CAAC,IAAI,CAAC,YAAY,EAAE,KAAK,CAAC,YAAY,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;SAClH;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;OAKG;IACa,8BAA8B,CAC5C,aAAqB,EAAE,cAAsB,EAAE,cAAuB,EAAE,MAA4B;QAEpG,MAAM,SAAS,GAAG,aAAa,GAAG,IAAI,CAAC,YAAY,CAAC;QACpD,MAAM,SAAS,GAAG,SAAS,GAAG,cAAc,CAAC;QAC7C,MAAM,SAAS,GAAG,IAAI,CAAC,uBAAuB,CAAC,SAAS,EAAE,IAAI,CAAE,CAAC;QACjE,MAAM,WAAW,GAAG,SAAS,CAAC,UAAU,CAAC,8BAA8B,CACrE,SAAS,CAAC,cAAc,EAAE,SAAS,GAAG,SAAS,CAAC,cAAc,EAAE,cAAc,EAAE,MAAM,CACvF,CAAC,CAAC,0CAA0C;QAC7C,MAAM,WAAW,GAAG,aAAa,GAAG,CAAC,cAAc,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC;QACzE,MAAM,WAAW,GAAG,yCAAmB,CAAC,mCAAmC,CACzE,cAAc,EAAE,IAAI,EAAE,aAAa,EAAE,WAAW,EAAE,cAAc,EAAE,MAAM,CACzE,CAAC,CAAC,2CAA2C;QAC9C,WAAW,CAAC,WAAW,GAAG,WAAW,CAAC;QACtC,OAAO,WAAW,CAAC;IACrB,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,yBAAyB,CACrC,QAAiB,IAAI;QAErB,MAAM,CAAC,GAAG;YACR,QAAQ,EAAE,IAAI,CAAC,SAAS;YACxB,SAAS,EAAE,IAAI,CAAC,UAAU;YAC1B,WAAW,EAAE,IAAI,CAAC,YAAY;YAC9B,YAAY,EAAE,IAAI,CAAC,aAAa;SACjC,CAAC;QACF,IAAI,KAAK,EAAE;YACT,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,aAAa,GAAG,CAAC,CAAC;SAC9D;QACD,OAAO,CAAC,CAAC;IACX,CAAC;IACD;;;;;;;;;OASG;IACa,YAAY,CAAC,UAAmB,EAAE,MAAmC;QACnF,IAAI,WAA4C,CAAC;QACjD,IAAI,IAAI,GAAG,MAAM,CAAC,SAAS,CAAC;QAC5B,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;QAC9C,IAAI,WAAW,KAAK,CAAC,EAAE;YACrB,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,UAAU,EAAE,MAAM,CAAC,CAAC;SACtE;aAAM;YACL,MAAM,eAAe,GAAG,YAAY,CAAC,8BAA8B,CAAC,IAAI,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC;YACjG,MAAM,OAAO,GAAG;gBACd,oCAAkB,CAAC,mDAAmD,CAAC,MAAM,EAAE,CAAC,CAAC;gBACjF,iCAAe,CAAC,IAAI;aACrB,CAAC;YACF,MAAM,OAAO,GAAG;gBACd,iCAAe,CAAC,IAAI;gBACpB,oCAAkB,CAAC,mDAAmD,CAAC,MAAM,EAAE,CAAC,CAAC;aAClF,CAAC;YACF,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YACrC,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAC9D,2BAA2B,CAAC,SAAS,EAAE,CAAC;YACxC,2BAA2B,CAAC,aAAa,IAAI,eAAe,CAAC,MAAM,CAAC;YACpE,IAAI,OAAwC,CAAC;YAC7C,KAAK,MAAM,cAAc,IAAI,eAAe,EAAE;gBAC5C,IAAI,cAAc,CAAC,CAAC,GAAG,IAAI;oBACzB,2FAA2F;oBAC3F,0FAA0F;oBAC1F,MAAM;gBACR,2BAA2B,CAAC,UAAU,EAAE,CAAC;gBACzC,MAAM,KAAK,GAAG,cAAc,CAAC,UAAU,CAAC;gBACxC,OAAO,GAAG,KAAK,CAAC,YAAY,CAC1B,UAAU,EAAE,cAAc,KAAK,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,cAAc,KAAK,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,OAAO,CAC7G,CAAC;gBACF,IAAI,OAAO,IAAI,OAAO,CAAC,CAAC,GAAG,IAAI,EAAE;oBAC/B,IAAI,GAAG,OAAO,CAAC,CAAC,CAAC;oBACjB,WAAW,GAAG,OAAO,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;oBACzC,2BAA2B,CAAC,YAAY,EAAE,CAAC;iBAC5C;aACF;SACF;QACD,IAAI,CAAC,WAAW;YACd,OAAO,SAAS,CAAC;QACnB,OAAO,IAAI,CAAC,kBAAkB,CAAC,WAAW,CAAC,CAAC;IAC9C,CAAC;IACD;;;;;OAKG;IACa,iBAAiB,CAC/B,uBAA+C;QAE/C,MAAM,OAAO,GAAG,6BAAa,CAAC,MAAM,CAAC,uBAAuB,CAAC,CAAC;QAC9D,MAAM,OAAO,GAAqB,EAAE,CAAC;QACrC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,sBAAsB,CAAC,SAAS,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE;YACrE,MAAM,MAAM,GAAG,IAAI,CAAC,iBAAiB,CAAC,OAAO,CAAC,CAAC;YAC/C,IAAI,MAAM,KAAK,SAAS,EAAE;gBACxB,IAAI,MAAM,YAAY,+BAAc;oBAClC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;qBAClB,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC;oBAC5B,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;aAC5C;SACF;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IACD;;;;;;;OAOG;IACa,uBAAuB,CAAC,GAAqB,EAAE,OAAiB;QAC9E,OAAO,qDAAyB,CAAC,kCAAkC,CAAC,IAAI,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;IAC1F,CAAC;IACD;;;;OAIG;IACI,kBAAkB,CAAC,WAAgC;QACxD,IAAI,CAAC,WAAW,CAAC,KAAK;YACpB,OAAO,SAAS,CAAC;QACnB,MAAM,QAAQ,GAAG,IAAI,CAAC,+BAA+B,CAAC,WAAW,CAAC,KAAK,EAAE,WAAW,CAAC,QAAQ,CAAC,CAAC;QAC/F,IAAI,QAAQ,EAAE;YACZ,MAAM,aAAa,GAAG,QAAQ,CAAC,4BAA4B,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;YAClF,MAAM,aAAa,GAAG,IAAI,CAAC,4BAA4B,CAAC,aAAa,CAAC,CAAC;YACvE,MAAM,WAAW,GAAG,yCAAmB,CAAC,wBAAwB,CAAC,IAAI,EAAE,aAAa,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC;YACzG,WAAW,CAAC,WAAW,GAAG,WAAW,CAAC;YACtC,WAAW,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC;YAC9B,OAAO,WAAW,CAAC;SACpB;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;;AA/iBc,qCAAS,GAAG,CAAC,AAAJ,CAAK;AACd,sCAAU,GAAG,CAAC,AAAJ,CAAK;AACf,wCAAY,GAAG,CAAC,AAAJ,CAAK;AACjB,yCAAa,GAAG,CAAC,AAAJ,CAAK;AATtB,kEAA2B","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n\r\n/** @packageDocumentation\r\n * @module Curve\r\n */\r\nimport { assert } from \"@itwin/core-bentley\";\r\nimport { CurvePrimitive } from \"../curve/CurvePrimitive\";\r\nimport { StrokeCountMap } from \"../curve/Query/StrokeCountMap\";\r\nimport { Geometry } from \"../Geometry\";\r\nimport { GeometryHandler, IStrokeHandler } from \"../geometry3d/GeometryHandler\";\r\nimport { Plane3dByOriginAndUnitNormal } from \"../geometry3d/Plane3dByOriginAndUnitNormal\";\r\nimport { Plane3dByOriginAndVectors } from \"../geometry3d/Plane3dByOriginAndVectors\";\r\nimport { Point3d, Vector3d } from \"../geometry3d/Point3dVector3d\";\r\nimport { Range1d, Range3d } from \"../geometry3d/Range\";\r\nimport { Ray3d } from \"../geometry3d/Ray3d\";\r\nimport { Transform } from \"../geometry3d/Transform\";\r\nimport { CurveChain } from \"./CurveCollection\";\r\nimport { CurveExtendMode, CurveExtendOptions, VariantCurveExtendParameter } from \"./CurveExtendMode\";\r\nimport { CurveLocationDetail } from \"./CurveLocationDetail\";\r\nimport { GeometryQuery } from \"./GeometryQuery\";\r\nimport { PlaneAltitudeRangeContext } from \"./internalContexts/PlaneAltitudeRangeContext\";\r\nimport { LineString3d } from \"./LineString3d\";\r\nimport { OffsetOptions } from \"./OffsetOptions\";\r\nimport { Path } from \"./Path\";\r\nimport { StrokeOptions } from \"./StrokeOptions\";\r\n\r\n/**\r\n * Annotation of a fragment, i.e. an interval of a curve.\r\n * * The interval is marked with two pairs of numbers:\r\n * * * fraction0, fraction1 = fraction parameters along the child curve.\r\n * * * distance0, distance1 = distances within containing CurveChainWithDistanceIndex.\r\n * @public\r\n */\r\nexport class PathFragment {\r\n  /** Distance along parent to this fragment start. */\r\n  public chainDistance0: number;\r\n  /** Distance along parent to this fragment end. */\r\n  public chainDistance1: number;\r\n  /** The start of this `PathFragment`, as a local fractional parameter of `this.childCurve`. */\r\n  public childFraction0: number;\r\n  /** The end of this `PathFragment`, as a local fractional parameter of `this.childCurve`. */\r\n  public childFraction1: number;\r\n  /** Curve primitive of this fragment, as presented in stroker. Note that this might have become a proxy. */\r\n  public childCurve: CurvePrimitive;\r\n  /** Optional range */\r\n  public range?: Range3d;\r\n  /** Working var for use in searches. */\r\n  public a: number;\r\n  /** Create a fragment with complete fraction, distance, and child data. */\r\n  public constructor(\r\n    childFraction0: number,\r\n    childFraction1: number,\r\n    distance0: number,\r\n    distance1: number,\r\n    childCurve: CurvePrimitive,\r\n    range?: Range3d,\r\n  ) {\r\n    this.childFraction0 = childFraction0;\r\n    this.childFraction1 = childFraction1;\r\n    this.chainDistance0 = distance0;\r\n    this.chainDistance1 = distance1;\r\n    this.childCurve = childCurve;\r\n    this.range = range;\r\n    this.a = 0;\r\n  }\r\n  /** Return true if the distance is within the distance limits of this fragment. */\r\n  public containsChainDistance(distance: number): boolean {\r\n    return distance >= this.chainDistance0 && distance <= this.chainDistance1;\r\n  }\r\n  /**\r\n   * Return a quick minimum distance from spacePoint to the curve.\r\n   * * The returned distance is to the curve's range box if defined; otherwise, the true distance is computed.\r\n   * * Thus the returned distance may be SMALLER than the true distance to the curve, but not larger.\r\n   */\r\n  public quickMinDistanceToChildCurve(spacePoint: Point3d): number {\r\n    if (this.range)\r\n      return this.range.distanceToPoint(spacePoint);\r\n    const detail = this.childCurve.closestPoint(spacePoint, false);\r\n    if (detail)\r\n      return detail.a;\r\n    return 0;\r\n  }\r\n  /**\r\n   * Return an array with (references to) all the input path fragments, sorted smallest to largest on the \"a\" value,\r\n   * initialized with `quickMinDistanceToChildCurve`\r\n   */\r\n  public static collectSortedQuickMinDistances(fragments: PathFragment[], spacePoint: Point3d): PathFragment[] {\r\n    const sortedFragments: PathFragment[] = [];\r\n    for (const frag of fragments) {\r\n      frag.a = frag.quickMinDistanceToChildCurve(spacePoint);\r\n      sortedFragments.push(frag);\r\n    }\r\n    sortedFragments.sort((frag1: PathFragment, frag2: PathFragment) => frag1.a - frag2.a);\r\n    return sortedFragments;\r\n  }\r\n  /** Return true if `this` fragment addresses `curve` and brackets `fraction`. */\r\n  public containsChildCurveAndChildFraction(curve: CurvePrimitive, fraction: number): boolean {\r\n    return this.childCurve === curve && fraction >= this.childFraction0 && fraction <= this.childFraction1;\r\n  }\r\n  /**\r\n   * Convert distance to local fraction and apply that to interpolate between the stored curve fractions.\r\n   * Note that proportional calculation does NOT account for non-uniform parameterization in the child curve.\r\n   */\r\n  public chainDistanceToInterpolatedChildFraction(distance: number): number {\r\n    return Geometry.inverseInterpolate(\r\n      this.childFraction0,\r\n      this.chainDistance0,\r\n      this.childFraction1,\r\n      this.chainDistance1,\r\n      distance,\r\n      this.childFraction0,\r\n    )!; // the interval must have nonzero length so division should be safe\r\n  }\r\n  /** Convert the given chainDistance to a fraction along this childCurve using `moveSignedDistanceFromFraction`. */\r\n  public chainDistanceToAccurateChildFraction(chainDistance: number, allowExtrapolation?: boolean): number {\r\n    const childDetail = this.childCurve.moveSignedDistanceFromFraction(\r\n      this.childFraction0, chainDistance - this.chainDistance0, allowExtrapolation ?? false,\r\n    );\r\n    return childDetail.fraction;\r\n  }\r\n  /**\r\n   * Return the scale factor to map childCurve fraction derivatives to chain fraction derivatives.\r\n   * @param globalDistance total length of the global curve\r\n   */\r\n  public fractionScaleFactor(globalDistance: number): number {\r\n    return globalDistance * (this.childFraction1 - this.childFraction0) / (this.chainDistance1 - this.chainDistance0);\r\n  }\r\n  /**\r\n   * Reverse the fraction and distance data.\r\n   * * Each child fraction `f` is replaced by `1-f`\r\n   * * Each `chainDistance` is replaced by `totalDistance - chainDistance`\r\n   * @param totalDistance the total distance\r\n   */\r\n  public reverseFractionsAndDistances(totalDistance: number) {\r\n    const f0 = this.childFraction0;\r\n    const f1 = this.childFraction1;\r\n    const d0 = this.chainDistance0;\r\n    const d1 = this.chainDistance1;\r\n    this.childFraction0 = 1.0 - f1;\r\n    this.childFraction1 = 1.0 - f0;\r\n    this.chainDistance0 = totalDistance - d1;\r\n    this.chainDistance1 = totalDistance - d0;\r\n  }\r\n  /** @deprecated in 3.x. Use `PathFragment.childFractionToChainDistance`. */\r\n  public childFractionTChainDistance(fraction: number): number {\r\n    return this.childFractionToChainDistance(fraction);\r\n  }\r\n  /**\r\n   * Convert a fractional position on the childCurve of this fragment to distance on the curve chain.\r\n   * * Return value is SIGNED and will be negative when `fraction < this.childFraction0`.\r\n   * @param fraction the fractional position on the childCurve of this fragment\r\n   */\r\n  public childFractionToChainDistance(fraction: number): number {\r\n    let d = this.childCurve.curveLengthBetweenFractions(this.childFraction0, fraction);\r\n    if (fraction < this.childFraction0)\r\n      d = -d;\r\n    return this.chainDistance0 + d;\r\n  }\r\n}\r\n\r\n/** Non-instantiable class to build a distance index for a curve chain. */\r\nclass DistanceIndexConstructionContext implements IStrokeHandler {\r\n  private _fragments: PathFragment[];\r\n  private _accumulatedDistance: number;\r\n  private constructor() {\r\n    this._accumulatedDistance = 0;\r\n    this._fragments = [];\r\n  }\r\n  // ignore curve announcements -- they are repeated in stroke announcements\r\n  public startParentCurvePrimitive(_cp: CurvePrimitive) { }\r\n  public startCurvePrimitive(_cp: CurvePrimitive) { }\r\n  public endParentCurvePrimitive(_cp: CurvePrimitive) { }\r\n  public endCurvePrimitive(_cp: CurvePrimitive) { }\r\n  public announcePointTangent(_xyz: Point3d, _fraction: number, _tangent: Vector3d) { }\r\n  public announceSegmentInterval(\r\n    cp: CurvePrimitive, point0: Point3d, point1: Point3d, numStrokes: number, fraction0: number, fraction1: number,\r\n  ): void {\r\n    const fragmentPoint0 = point0.clone();\r\n    const fragmentPoint1 = point1.clone();\r\n    let d0 = this._accumulatedDistance;\r\n    if (numStrokes <= 1) {\r\n      this._accumulatedDistance += point0.distance(point1);\r\n      this._fragments.push(new PathFragment(fraction0, fraction1, d0, this._accumulatedDistance, cp,\r\n        Range3d.create(fragmentPoint0, fragmentPoint1)));\r\n    } else {\r\n      let f1;\r\n      for (let i = 1, f0 = fraction0; i <= numStrokes; i++, f0 = f1) {\r\n        f1 = Geometry.interpolate(fraction0, i / numStrokes, fraction1);\r\n        point0.interpolate(f1, point1, fragmentPoint1);\r\n        d0 = this._accumulatedDistance;\r\n        this._accumulatedDistance += (Math.abs(f1 - f0) * point0.distance(point1));\r\n        this._fragments.push(new PathFragment(f0, f1, d0, this._accumulatedDistance, cp,\r\n          Range3d.create(fragmentPoint0, fragmentPoint1)));\r\n        fragmentPoint0.setFrom(fragmentPoint1);\r\n      }\r\n    }\r\n  }\r\n  public announceIntervalForUniformStepStrokes(\r\n    cp: CurvePrimitive, numStrokes: number, fraction0: number, fraction1: number,\r\n  ): void {\r\n    let f1, d, d0;\r\n    for (let i = 1, f0 = fraction0; i <= numStrokes; i++, f0 = f1) {\r\n      f1 = Geometry.interpolate(fraction0, i / numStrokes, fraction1);\r\n      d = cp.curveLengthBetweenFractions(f0, f1);\r\n      d0 = this._accumulatedDistance;\r\n      this._accumulatedDistance += d;\r\n      const range = cp.rangeBetweenFractions(f0, f1);\r\n      this._fragments.push(new PathFragment(f0, f1, d0, this._accumulatedDistance, cp, range));\r\n    }\r\n  }\r\n  public needPrimaryGeometryForStrokes?(): boolean {\r\n    return true;\r\n  }\r\n  /** Create an array of PathFragment from input curve chain. */\r\n  public static createPathFragmentIndex(path: CurveChain, options?: StrokeOptions): PathFragment[] {\r\n    const handler = new DistanceIndexConstructionContext();\r\n    for (const curve of path.children) {\r\n      curve.emitStrokableParts(handler, options);\r\n    }\r\n    const fragments = handler._fragments;\r\n    return fragments;\r\n  }\r\n}\r\n/**\r\n * `CurveChainWithDistanceIndex` is a CurvePrimitive whose fractional parameterization is proportional to true\r\n * distance along a CurveChain.\r\n * * For example if the total length of the chain is `L`, then the distance along the chain from parameters `t0`\r\n * to `t1` is easily computed as `L*(t1-t0)`.\r\n * * The curve chain can be any type derived from `CurveChain`, i.e., either a `Path` or a `Loop`.\r\n * @public\r\n */\r\nexport class CurveChainWithDistanceIndex extends CurvePrimitive {\r\n  /** String name for schema properties */\r\n  public readonly curvePrimitiveType = \"curveChainWithDistanceIndex\";\r\n  private readonly _path: CurveChain;\r\n  private readonly _fragments: PathFragment[];\r\n  private readonly _totalLength: number; // matches final fragment distance1.\r\n  private static _numCalls = 0;\r\n  private static _numTested = 0;\r\n  private static _numAssigned = 0;\r\n  private static _numCandidate = 0;\r\n  /** Test if `other` is a `CurveChainWithDistanceIndex` */\r\n  public isSameGeometryClass(other: GeometryQuery): boolean {\r\n    return other instanceof CurveChainWithDistanceIndex;\r\n  }\r\n  // final assembly of CurveChainWithDistanceIndex -- caller must create valid fragment index.\r\n  private constructor(path: CurveChain, fragments: PathFragment[]) {\r\n    super();\r\n    this._path = path;\r\n    this._fragments = fragments;\r\n    this._totalLength = fragments.length > 0 ? fragments[fragments.length - 1].chainDistance1 : 0;\r\n  }\r\n  /**\r\n   * Create a clone, transformed and with its own distance index.\r\n   * @param transform transform to apply in the clone.\r\n   */\r\n  public cloneTransformed(transform: Transform): CurveChainWithDistanceIndex | undefined {\r\n    const c = this._path.clone();\r\n    if (c instanceof CurveChain && c.tryTransformInPlace(transform))\r\n      return CurveChainWithDistanceIndex.createCapture(c);\r\n    return undefined;\r\n  }\r\n  /**\r\n   * Reference to the contained path.\r\n   * * Do not modify the path. The distance index will be wrong.\r\n   */\r\n  public get path(): CurveChain {\r\n    return this._path;\r\n  }\r\n  /**\r\n   * Reference to the fragments array.\r\n   * * Do not modify.\r\n   */\r\n  public get fragments(): PathFragment[] {\r\n    return this._fragments;\r\n  }\r\n  /** Return a deep clone */\r\n  public clone(): CurveChainWithDistanceIndex {\r\n    const c = this._path.clone() as CurveChain;\r\n    return CurveChainWithDistanceIndex.createCapture(c);\r\n  }\r\n  /** Return a deep clone */\r\n  public override clonePartialCurve(fractionA: number, fractionB: number): CurveChainWithDistanceIndex | undefined {\r\n    if (fractionA === fractionB)\r\n      return undefined;\r\n    let fracA = fractionA;\r\n    let fracB = fractionB;\r\n    const reversed = fractionA > fractionB;\r\n    if (reversed) {\r\n      fracA = fractionB;\r\n      fracB = fractionA;\r\n    }\r\n    const chainDistanceA = fracA * this._totalLength;\r\n    const chainDistanceB = fracB * this._totalLength;\r\n    const fragmentA = this.chainDistanceToFragment(chainDistanceA, true);\r\n    if (undefined === fragmentA)\r\n      return undefined;\r\n    const fragmentB = this.chainDistanceToFragment(chainDistanceB, true);\r\n    if (undefined === fragmentB)\r\n      return undefined;\r\n    const childCurveIndexA = this._path.childIndex(fragmentA.childCurve, true);\r\n    if (undefined === childCurveIndexA)\r\n      return undefined;\r\n    const childCurveIndexB = this._path.childIndex(fragmentB.childCurve, true);\r\n    if (undefined === childCurveIndexB)\r\n      return undefined;\r\n    const childFractionA = fragmentA.chainDistanceToAccurateChildFraction(chainDistanceA, true);\r\n    const childFractionB = fragmentB.chainDistanceToAccurateChildFraction(chainDistanceB, true);\r\n    // add a (possibly reversed) partial clone to newPath\r\n    const newPath = Path.create();\r\n    const addPartialChild = (\r\n      childCurve: CurvePrimitive, childFraction0: number, childFraction1: number, reversedClone: boolean,\r\n    ): boolean => {\r\n      if (childFraction0 === childFraction1)\r\n        return false;\r\n      let newCurve;\r\n      if (childFraction0 === 0.0 && childFraction1 === 1.0) {\r\n        newCurve = childCurve.clone();\r\n        if (reversedClone)\r\n          newCurve.reverseInPlace();\r\n      } else {\r\n        newCurve = reversedClone ?\r\n          childCurve.clonePartialCurve(childFraction1, childFraction0)\r\n          : childCurve.clonePartialCurve(childFraction0, childFraction1);\r\n      }\r\n      if (newCurve) {\r\n        newPath.children.push(newCurve);\r\n        return true;\r\n      }\r\n      return false;\r\n    };\r\n    if (fragmentA.childCurve === fragmentB.childCurve) {\r\n      // the two distances are within the same curve.\r\n      if (addPartialChild(fragmentA.childCurve, childFractionA, childFractionB, reversed))\r\n        return CurveChainWithDistanceIndex.createCapture(newPath); // singleton -- children[] does not need to be reversed.\r\n      return undefined;\r\n    }\r\n    addPartialChild(this._path.children[childCurveIndexA], childFractionA, 1.0, reversed);\r\n    // at least two distinct children are impacted ....\r\n    for (let childIndex = childCurveIndexA + 1; childIndex < childCurveIndexB; childIndex++) {\r\n      addPartialChild(this._path.children[childIndex], 0.0, 1.0, reversed);\r\n    }\r\n    addPartialChild(this._path.children[childCurveIndexB], 0.0, childFractionB, reversed);\r\n    // This reverses array entries but not orientation within each curve ...\r\n    if (reversed)\r\n      newPath.children.reverse();\r\n    return CurveChainWithDistanceIndex.createCapture(newPath);\r\n  }\r\n  /**\r\n   * Ask if the curve is within tolerance of a plane.\r\n   * @returns Returns true if the curve is completely within tolerance of the plane.\r\n   */\r\n  public isInPlane(plane: Plane3dByOriginAndUnitNormal): boolean {\r\n    for (const c of this._path.children) {\r\n      if (!c.isInPlane(plane))\r\n        return false;\r\n    }\r\n    return true;\r\n  }\r\n  /** Return the start point of `this` curve. */\r\n  public override startPoint(result?: Point3d): Point3d {\r\n    const c = this._path.cyclicCurvePrimitive(0);\r\n    if (c)\r\n      return c.startPoint(result);\r\n    return Point3d.createZero(result);\r\n  }\r\n  /** Return the end point of of `this` curve. */\r\n  public override endPoint(result?: Point3d): Point3d {\r\n    const c = this._path.cyclicCurvePrimitive(-1);\r\n    if (c)\r\n      return c.endPoint(result);\r\n    return Point3d.createZero(result);\r\n  }\r\n  /** Add strokes to caller-supplied linestring */\r\n  public emitStrokes(dest: LineString3d, options?: StrokeOptions): void {\r\n    for (const c of this._path.children) {\r\n      c.emitStrokes(dest, options);\r\n    }\r\n  }\r\n  /**\r\n   * Ask the curve to announce points and simple subcurve fragments for stroking.\r\n   * See IStrokeHandler for description of the sequence of the method calls.\r\n   */\r\n  public emitStrokableParts(dest: IStrokeHandler, options?: StrokeOptions): void {\r\n    for (const c of this._path.children) {\r\n      c.emitStrokableParts(dest, options);\r\n    }\r\n  }\r\n  /**\r\n   * Return the stroke count required for given options.\r\n   * @param options StrokeOptions that determine count\r\n   */\r\n  public computeStrokeCountForOptions(options?: StrokeOptions): number {\r\n    let numStroke = 0;\r\n    for (const c of this._path.children) {\r\n      numStroke += c.computeStrokeCountForOptions(options);\r\n    }\r\n    return numStroke;\r\n  }\r\n  /**\r\n   * Return an array containing only the curve primitives.\r\n   * @param collectorArray array to receive primitives (pushed -- the array is not cleared)\r\n   * @param smallestPossiblePrimitives if true, recurse on the children. If false, only push `this`.\r\n   * @param explodeLinestrings (if smallestPossiblePrimitives is true) whether to push a [[LineSegment3d]] for each\r\n   * segment of a [[LineString3d]] child. If false, push only the [[LineString3d]].\r\n   */\r\n  public override collectCurvePrimitivesGo(\r\n    collectorArray: CurvePrimitive[], smallestPossiblePrimitives: boolean = false, explodeLineStrings: boolean = false,\r\n  ): void {\r\n    if (smallestPossiblePrimitives) {\r\n      for (const c of this._path.children) {\r\n        c.collectCurvePrimitivesGo(collectorArray, smallestPossiblePrimitives, explodeLineStrings);\r\n      }\r\n    } else {\r\n      collectorArray.push(this);\r\n    }\r\n  }\r\n  /**\r\n   * Construct StrokeCountMap for each child, accumulating data to stroke count map for this primitive.\r\n   * @param options StrokeOptions that determine count\r\n   * @param parentStrokeMap evolving parent map.\r\n   */\r\n  public override computeAndAttachRecursiveStrokeCounts(options?: StrokeOptions, parentStrokeMap?: StrokeCountMap) {\r\n    const myMap = StrokeCountMap.createWithCurvePrimitiveAndOptionalParent(this, parentStrokeMap);\r\n    for (const c of this._path.children) {\r\n      c.computeAndAttachRecursiveStrokeCounts(options, myMap);\r\n    }\r\n    CurvePrimitive.installStrokeCountMap(this, myMap, parentStrokeMap);\r\n  }\r\n  /**\r\n   * Second step of double dispatch: call `this._path.dispatchToGeometryHandler (handler)`\r\n   * * Note that this exposes the children individually to the handler.\r\n   */\r\n  public dispatchToGeometryHandler(handler: GeometryHandler): any {\r\n    return handler.handleCurveChainWithDistanceIndex(this);\r\n  }\r\n  /** Extend `rangeToExtend` as needed to include these curves (optionally transformed) */\r\n  public extendRange(rangeToExtend: Range3d, transform?: Transform): void {\r\n    this._path.extendRange(rangeToExtend, transform);\r\n  }\r\n  /** Return a (high accuracy and positive) length of the curve between fractional positions */\r\n  public override curveLengthBetweenFractions(fraction0: number, fraction1: number): number {\r\n    return Math.abs(fraction1 - fraction0) * this._totalLength;\r\n  }\r\n  /**\r\n   * Capture (not clone) a path into a new `CurveChainWithDistanceIndex`\r\n   * @param path primitive array to be CAPTURED (not cloned)\r\n   */\r\n  public static createCapture(path: CurveChain, options?: StrokeOptions): CurveChainWithDistanceIndex {\r\n    const fragments = DistanceIndexConstructionContext.createPathFragmentIndex(path, options);\r\n    const result = new CurveChainWithDistanceIndex(path, fragments);\r\n    return result;\r\n  }\r\n  /**\r\n   * Return the PathFragment object at the given `distance` along the chain.\r\n   * @param distance distance along the chain.\r\n   * @param allowExtrapolation if `true`, returns first fragment for negative distances and returns last fragment\r\n   * for distances larger than curve length. If `false` returns `undefined` for those out of bound distances.\r\n   */\r\n  public chainDistanceToFragment(distance: number, allowExtrapolation: boolean = false): PathFragment | undefined {\r\n    const i = this.chainDistanceToFragmentIndex(distance, allowExtrapolation);\r\n    if (undefined !== i)\r\n      return this._fragments[i];\r\n    return undefined;\r\n  }\r\n  /**\r\n   * Return the index of the PathFragment at the given `distance` along the chain.\r\n   * @param distance distance along the chain.\r\n   * @param allowExtrapolation if `true`, returns 0 for negative distances and returns last fragment index for\r\n   * distances larger than curve length. If `false` returns `undefined` for those out of bound distances.\r\n   */\r\n  protected chainDistanceToFragmentIndex(distance: number, allowExtrapolation: boolean = false): number | undefined {\r\n    const numFragments = this._fragments.length;\r\n    const fragments = this._fragments;\r\n    if (numFragments > 0) {\r\n      if (distance < 0.0)\r\n        return allowExtrapolation ? 0 : undefined;\r\n      if (distance > this._totalLength)\r\n        return allowExtrapolation ? (numFragments - 1) : undefined;\r\n      // linear search (opportunity for improvement)\r\n      for (let i = 0; i < numFragments; i++) {\r\n        if (fragments[i].containsChainDistance(distance))\r\n          return i;\r\n      }\r\n    }\r\n    return undefined;\r\n  }\r\n  /**\r\n   * Convert distance along the chain to fraction along the chain.\r\n   * @param distance distance along the chain.\r\n   */\r\n  public chainDistanceToChainFraction(distance: number): number {\r\n    return distance / this._totalLength;\r\n  }\r\n  /** Return the PathFragment object containing the point at the given `fraction` of the given child curve. */\r\n  public curveAndChildFractionToFragment(curve: CurvePrimitive, fraction: number): PathFragment | undefined {\r\n    const numFragments = this._fragments.length;\r\n    const fragments = this._fragments;\r\n    if (numFragments > 0) {\r\n      if (fraction < 0)\r\n        return fragments[0];\r\n      if (fraction > 1.0)\r\n        return fragments[numFragments - 1];\r\n      // linear search (opportunity for improvement)\r\n      for (const fragment of fragments) {\r\n        if (fragment.containsChildCurveAndChildFraction(curve, fraction))\r\n          return fragment;\r\n      }\r\n    }\r\n    return undefined;\r\n  }\r\n  /** Returns the total length of `this` curve. */\r\n  public override curveLength(): number {\r\n    return this._totalLength;\r\n  }\r\n  /**\r\n   * Returns the total length of the path.\r\n   * * This is exact (and simple property lookup) because the true lengths were summed at construction time.\r\n   */\r\n  public quickLength(): number {\r\n    return this._totalLength;\r\n  }\r\n  /**\r\n   * Return the point (x,y,z) on the curve at fractional position along the chain.\r\n   * @param fraction fractional position along the curve.\r\n   * @returns a point on the curve.\r\n   */\r\n  public fractionToPoint(fraction: number, result?: Point3d): Point3d {\r\n    const distanceAlongPath = fraction * this._totalLength;\r\n    const fragment = this.chainDistanceToFragment(distanceAlongPath, true);\r\n    if (fragment) {\r\n      const childFraction = fragment.chainDistanceToAccurateChildFraction(distanceAlongPath, true);\r\n      return fragment.childCurve.fractionToPoint(childFraction, result);\r\n    }\r\n    assert(false); // we never expect to get here\r\n    // no fragment found. just return the first point on the curve.\r\n    return this._fragments[0].childCurve.fractionToPoint(0.0, result);\r\n  }\r\n  /**\r\n   * Return the point (x,y,z) and derivative on the curve at fractional position.\r\n   * * Note that the derivative is \"derivative of xyz with respect to fraction\".\r\n   * * The derivative shows the speed of the \"fractional point\" moving along the curve.\r\n   * * The derivative is not generally a unit vector. Use `fractionToPointAndUnitTangent` for a unit vector.\r\n   * @param fraction fractional position along the geometry.\r\n   * @param result optional receiver for the result.\r\n   * @returns a ray whose origin is the curve point and direction is the derivative with respect to the fraction.\r\n   */\r\n  public fractionToPointAndDerivative(fraction: number, result?: Ray3d): Ray3d {\r\n    const distanceAlongPath = fraction * this._totalLength;\r\n    const fragment = this.chainDistanceToFragment(distanceAlongPath, true)!;\r\n    const childFraction = fragment.chainDistanceToAccurateChildFraction(distanceAlongPath, true);\r\n    result = fragment.childCurve.fractionToPointAndDerivative(childFraction, result);\r\n    // Recall the standard arclength formula s(t) for the curve C = C(t), with derivative s'(t) = ||C'||.\r\n    // Define fractional arclength for C by f = f(t) = s(t)/L, where L is the total length of C. Then f' = ||C'||/L.\r\n    // Denote the inverse of f by t = t(f). Then C = C(t(f)) is a parameterization of C by its fractional arclength f.\r\n    // Since the derivative of t is t'=1/f'=L/||C'||, the derivative we seek is d/df(C(t(f))) = C' t' = C' L/||C'||.\r\n    // The fragment gives us C', so we're just a scale away.\r\n    // Math details can be found at core/geometry/internaldocs/Curve.md\r\n    const a = this._totalLength / result.direction.magnitude(); // L/||C'||\r\n    result.direction.scaleInPlace(a);\r\n    return result;\r\n  }\r\n  /**\r\n   * Return the point (x,y,z) and normalized derivative on the curve at fractional position.\r\n   * * Note that the derivative is \"derivative of xyz with respect to fraction\".\r\n   * * The un-normalized derivative shows the speed of the \"fractional point\" moving along the curve.\r\n   * * To find the un-normalized derivative, use `fractionToPointAndDerivative`.\r\n   * @param fraction fractional position on the curve\r\n   * @param result optional receiver for the result.\r\n   * @returns a ray whose origin is the curve point and direction is the normalized derivative with respect to\r\n   * the fraction.\r\n   */\r\n  public override fractionToPointAndUnitTangent(fraction: number, result?: Ray3d): Ray3d {\r\n    const distanceAlongPath = fraction * this._totalLength;\r\n    const fragment = this.chainDistanceToFragment(distanceAlongPath, true)!;\r\n    const childFraction = fragment.chainDistanceToAccurateChildFraction(distanceAlongPath, true);\r\n    result = fragment.childCurve.fractionToPointAndDerivative(childFraction, result);\r\n    result.direction.normalizeInPlace();\r\n    return result;\r\n  }\r\n  /**\r\n   * Return a plane with\r\n   * * origin at fractional position along the curve\r\n   * * vectorU is the first derivative, i.e. tangent vector with length equal to the rate of change with respect to\r\n   * the fraction.\r\n   * * vectorV is the second derivative, i.e. derivative of vectorU which points in the direction of the curve's\r\n   * derivative's change.\r\n   */\r\n  public fractionToPointAnd2Derivatives(\r\n    fraction: number, result?: Plane3dByOriginAndVectors,\r\n  ): Plane3dByOriginAndVectors | undefined {\r\n    const distanceAlongPath = fraction * this._totalLength;\r\n    const fragment = this.chainDistanceToFragment(distanceAlongPath, true)!;\r\n    const childFraction = fragment.chainDistanceToAccurateChildFraction(distanceAlongPath, true);\r\n    result = fragment.childCurve.fractionToPointAnd2Derivatives(childFraction, result);\r\n    if (!result)\r\n      return undefined;\r\n    // See fractionToPointAndDerivative, where we show d/df(C(t(f))) = L C'/||C'||.\r\n    // Here we seek the 2nd derivative. We'll use the quotient rule, and the identities\r\n    // d/dt||x(t)|| = x.x'/||x|| and ||x||^2 = x.x, where \".\" is the dot product.\r\n    // d2/df2(C(t(f))) = L d/df(C'/||C'||) = L (||C'|| d/df(C') - C' d/df||C'||) / ||C'||^2\r\n    //  = L (||C'|| C\" L/||C'|| - C' C'.C\"/||C'|| L/||C'||) / ||C'||^2\r\n    //  = (L/||C'||)^2 (C\" - C' C'.C\"/C'.C' ), where C' and C\" are given by the fragment.\r\n    // The second derivative that fractionToPointAnd2Derivatives returns is C\", so the second\r\n    // derivative we seek is just few scales away.\r\n    // Math details can be found at core/geometry/internaldocs/Curve.md\r\n    const magU = result.vectorU.magnitude(); // ||C'||\r\n    const dotUU = magU * magU; // ||C'||^2\r\n    const dotUV = result.vectorU.dotProduct(result.vectorV); // C'.C\"\r\n    result.vectorV.addScaledInPlace(result.vectorU, -dotUV / dotUU); // add -(C'*C'.C\")/(||C'||^2) to vectorV\r\n    const scale = this._totalLength / magU; // L/||C'||\r\n    result.vectorU.scaleInPlace(scale); // scale vectorU by L/||C'||\r\n    result.vectorV.scaleInPlace(scale * scale); // scale vectorV by (L/||C'(t)||)^2\r\n    return result;\r\n  }\r\n  /**\r\n   * Attempt to transform in place.\r\n   * * Warning: If any child transform fails, `this` object becomes invalid but that should never happen.\r\n   * @param transform the transform to be applied.\r\n   * @returns true if all of child transforms succeed and false otherwise.\r\n   */\r\n  public tryTransformInPlace(transform: Transform): boolean {\r\n    let numFail = 0;\r\n    for (const c of this._path.children) {\r\n      if (!c.tryTransformInPlace(transform))\r\n        numFail++;\r\n    }\r\n    return numFail === 0;\r\n  }\r\n  /** Reverse the curve's data so that its fractional stroking moves in the opposite direction. */\r\n  public reverseInPlace(): void {\r\n    this._path.reverseChildrenInPlace();\r\n    for (const fragment of this._fragments) {\r\n      fragment.reverseFractionsAndDistances(this._totalLength);\r\n    }\r\n    this._fragments.reverse();\r\n  }\r\n  /**\r\n   * Test for equality conditions.\r\n   * * Mismatched total length is a quick exit condition.\r\n   * * If total length matches, recurse to the path for matching primitives.\r\n   */\r\n  public override isAlmostEqual(other: GeometryQuery): boolean {\r\n    if (other instanceof CurveChainWithDistanceIndex) {\r\n      return Geometry.isSameCoordinate(this._totalLength, other._totalLength) && this._path.isAlmostEqual(other._path);\r\n    }\r\n    return false;\r\n  }\r\n  /**\r\n   * (Attempt to) find a position on the curve at a signed distance from start fraction.\r\n   * * See `CurvePrimitive.moveSignedDistanceFromFraction` for parameter details.\r\n   * * The returned location directly identifies fractional position along the CurveChainWithDistanceIndex and\r\n   * has pointer to an additional detail for the child curve.\r\n   */\r\n  public override moveSignedDistanceFromFraction(\r\n    startFraction: number, signedDistance: number, allowExtension: boolean, result?: CurveLocationDetail,\r\n  ): CurveLocationDetail {\r\n    const distanceA = startFraction * this._totalLength;\r\n    const distanceB = distanceA + signedDistance;\r\n    const fragmentB = this.chainDistanceToFragment(distanceB, true)!;\r\n    const childDetail = fragmentB.childCurve.moveSignedDistanceFromFraction(\r\n      fragmentB.childFraction0, distanceB - fragmentB.chainDistance0, allowExtension, result,\r\n    ); // local detail related to the child curve\r\n    const endFraction = startFraction + (signedDistance / this._totalLength);\r\n    const chainDetail = CurveLocationDetail.createConditionalMoveSignedDistance(\r\n      allowExtension, this, startFraction, endFraction, signedDistance, result,\r\n    ); // global detail related to the curve chain\r\n    chainDetail.childDetail = childDetail;\r\n    return chainDetail;\r\n  }\r\n  /**\r\n   * Return an object summarizing closest point test counts.\r\n   * The returned object has\r\n   * * numCalls = number of times closestPoint was called.\r\n   * * numCurvesTested = number of curves tested with full closestPoint.\r\n   * * numAssigned = number of times a new minimum value was recorded.\r\n   * * numCandidate = number of curves that would be tested in worst case.\r\n   * @param clear if true, counts are cleared after the return object is formed.\r\n   */\r\n  public static getClosestPointTestCounts(\r\n    clear: boolean = true,\r\n  ): { numCalls: number, numTested: number, numAssigned: number, numCandidate: number } {\r\n    const a = {\r\n      numCalls: this._numCalls,\r\n      numTested: this._numTested,\r\n      numAssigned: this._numAssigned,\r\n      numCandidate: this._numCandidate,\r\n    };\r\n    if (clear) {\r\n      this._numTested = this._numAssigned = this._numCandidate = 0;\r\n    }\r\n    return a;\r\n  }\r\n  /**\r\n   * Search for the curve point that is closest to the spacePoint.\r\n   * * The CurveChainWithDistanceIndex invokes the base class CurvePrimitive method, which (via a handler)\r\n   * determines a CurveLocation detail among the children.\r\n   * * The returned detail directly identifies fractional position along the CurveChainWithDistanceIndex and\r\n   * has pointer to an additional detail for the child curve.\r\n   * @param spacePoint point in space\r\n   * @param extend true to extend the curve\r\n   * @returns a CurveLocationDetail structure that holds the details of the close point.\r\n   */\r\n  public override closestPoint(spacePoint: Point3d, extend: VariantCurveExtendParameter): CurveLocationDetail | undefined {\r\n    let childDetail: CurveLocationDetail | undefined;\r\n    let aMin = Number.MAX_VALUE;\r\n    const numChildren = this.path.children.length;\r\n    if (numChildren === 1) {\r\n      childDetail = this.path.children[0].closestPoint(spacePoint, extend);\r\n    } else {\r\n      const sortedFragments = PathFragment.collectSortedQuickMinDistances(this._fragments, spacePoint);\r\n      const extend0 = [\r\n        CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(extend, 0),\r\n        CurveExtendMode.None,\r\n      ];\r\n      const extend1 = [\r\n        CurveExtendMode.None,\r\n        CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(extend, 1),\r\n      ];\r\n      const fragment0 = this._fragments[0];\r\n      const fragment1 = this._fragments[this._fragments.length - 1];\r\n      CurveChainWithDistanceIndex._numCalls++;\r\n      CurveChainWithDistanceIndex._numCandidate += sortedFragments.length;\r\n      let detailA: CurveLocationDetail | undefined;\r\n      for (const sortedFragment of sortedFragments) {\r\n        if (sortedFragment.a > aMin)\r\n          // sortedFragments help early exit because it is likely that one of the first few fragments\r\n          // in sortedFragments is the fragment with minimum distance from space point to the curve.\r\n          break;\r\n        CurveChainWithDistanceIndex._numTested++;\r\n        const child = sortedFragment.childCurve;\r\n        detailA = child.closestPoint(\r\n          spacePoint, sortedFragment === fragment0 ? extend0 : sortedFragment === fragment1 ? extend1 : false, detailA,\r\n        );\r\n        if (detailA && detailA.a < aMin) {\r\n          aMin = detailA.a;\r\n          childDetail = detailA.clone(childDetail);\r\n          CurveChainWithDistanceIndex._numAssigned++;\r\n        }\r\n      }\r\n    }\r\n    if (!childDetail)\r\n      return undefined;\r\n    return this.computeChainDetail(childDetail);\r\n  }\r\n  /**\r\n   * Construct an offset of each child as viewed in the xy-plane (ignoring z).\r\n   * * No attempt is made to join the offset children. Use RegionOps.constructCurveXYOffset to return a fully\r\n   * joined offset.\r\n   * @param offsetDistanceOrOptions offset distance (positive to left of the instance curve) or offset options object.\r\n   */\r\n  public override constructOffsetXY(\r\n    offsetDistanceOrOptions: number | OffsetOptions,\r\n  ): CurvePrimitive | CurvePrimitive[] | undefined {\r\n    const options = OffsetOptions.create(offsetDistanceOrOptions);\r\n    const offsets: CurvePrimitive[] = [];\r\n    for (const prim of this.collectCurvePrimitives(undefined, true, true)) {\r\n      const offset = prim.constructOffsetXY(options);\r\n      if (offset !== undefined) {\r\n        if (offset instanceof CurvePrimitive)\r\n          offsets.push(offset);\r\n        else if (Array.isArray(offset))\r\n          offset.forEach((cp) => offsets.push(cp));\r\n      }\r\n    }\r\n    return offsets;\r\n  }\r\n  /**\r\n   * Project instance geometry (via dispatch) onto the given ray, and return the extreme fractional parameters of\r\n   * projection.\r\n   * @param ray ray onto which the instance is projected. A `Vector3d` is treated as a `Ray3d` with zero origin.\r\n   * @param lowHigh optional receiver for output.\r\n   * @returns range of fractional projection parameters onto the ray, where 0.0 is start of the ray and 1.0 is the\r\n   * end of the ray.\r\n   */\r\n  public override projectedParameterRange(ray: Vector3d | Ray3d, lowHigh?: Range1d): Range1d | undefined {\r\n    return PlaneAltitudeRangeContext.findExtremeFractionsAlongDirection(this, ray, lowHigh);\r\n  }\r\n  /**\r\n   * Compute the global chain detail corresponding to a local child detail.\r\n   * @param childDetail the local detail, with respect to a child of this chain.\r\n   * @returns the global detail, with respect to this chain.\r\n   */\r\n  public computeChainDetail(childDetail: CurveLocationDetail): CurveLocationDetail | undefined {\r\n    if (!childDetail.curve)\r\n      return undefined;\r\n    const fragment = this.curveAndChildFractionToFragment(childDetail.curve, childDetail.fraction);\r\n    if (fragment) {\r\n      const chainDistance = fragment.childFractionToChainDistance(childDetail.fraction);\r\n      const chainFraction = this.chainDistanceToChainFraction(chainDistance);\r\n      const chainDetail = CurveLocationDetail.createCurveFractionPoint(this, chainFraction, childDetail.point);\r\n      chainDetail.childDetail = childDetail;\r\n      chainDetail.a = childDetail.a;\r\n      return chainDetail;\r\n    }\r\n    return undefined;\r\n  }\r\n}\r\n"]}

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

@@ -4,12 +4,15 @@ import { Point3d, Vector3d } from "../geometry3d/Point3dVector3d";
 import { Range1d, Range3d } from "../geometry3d/Range";
 import { Ray3d } from "../geometry3d/Ray3d";
 import { Transform } from "../geometry3d/Transform";
-import { AnyCurve } from "./CurveChain";
 import { CurveLocationDetail } from "./CurveLocationDetail";
 import { CurvePrimitive } from "./CurvePrimitive";
 import { RecursiveCurveProcessor } from "./CurveProcessor";
+import { AnyCurve, type AnyRegion } from "./CurveTypes";
 import { GeometryQuery } from "./GeometryQuery";
 import { StrokeOptions } from "./StrokeOptions";
+import type { Path } from "./Path";
+import type { Loop } from "./Loop";
+/** Note: CurveChain and BagOfCurves classes are located in this file to prevent circular dependency. */
 /**
  * Describes the concrete type of a [[CurveCollection]]. Each type name maps to a specific subclass and can be
  * used in conditional statements for type-switching.
@@ -86,17 +89,28 @@ export declare abstract class CurveCollection extends GeometryQuery {
      * * `Loop`
      * * `ParityRegion`
      * * `UnionRegion`
+     * @see isAnyRegion
      */
     get isAnyRegionType(): boolean;
-    /** Return true for a `Path`, i.e. a chain of curves joined head-to-tail */
+    /** Type guard for AnyRegion */
+    isAnyRegion(): this is AnyRegion;
+    /**
+     * Return true for a `Path`, i.e. a chain of curves joined head-to-tail
+     * @see isPath
+     */
     get isOpenPath(): boolean;
+    /** Type guard for Path */
+    isPath(): this is Path;
     /**
      * Return true for a single-loop planar region type, i.e. `Loop`.
      * * This is NOT a test for physical closure of a `Path`.
+     * @see isLoop
      */
     get isClosedPath(): boolean;
+    /** Type guard for Loop */
+    isLoop(): this is Loop;
     /** Return a CurveCollection with the same structure but all curves replaced by strokes. */
-    abstract cloneStroked(options?: StrokeOptions): AnyCurve;
+    abstract cloneStroked(options?: StrokeOptions): CurveCollection;
     /** Support method for ICurvePrimitive ... one line call to specific announce method . . */
     abstract announceToCurveProcessor(processor: RecursiveCurveProcessor): void;
     /** Clone an empty collection. */
@@ -140,7 +154,7 @@ export declare abstract class CurveCollection extends GeometryQuery {
 /**
  * Shared base class for use by both open and closed paths.
  * * A `CurveChain` contains only CurvePrimitives. No other paths, loops, or regions allowed.
- * * The specific derived classes are `Path` and `Loop`
+ * * The specific derived classes are `Path` and `Loop`.
  * * `CurveChain` is an intermediate class. It is not instantiable on its own.
  * * The related class `CurveChainWithDistanceIndex` is a `CurvePrimitive` whose API presents well-defined mappings
  * from fraction to xyz over the entire chain, but in fact does all the calculations over multiple primitives.
@@ -166,7 +180,7 @@ export declare abstract class CurveChain extends CurveCollection {
      */
     getPackedStrokes(options?: StrokeOptions): GrowableXYZArray | undefined;
     /** Return a structural clone, with CurvePrimitive objects stroked. */
-    abstract cloneStroked(options?: StrokeOptions): AnyCurve;
+    abstract cloneStroked(options?: StrokeOptions): CurveChain;
     /**
      * Add a child curve.
      * * Returns false if the given child is not a CurvePrimitive.
@@ -225,18 +239,4 @@ export declare class BagOfCurves extends CurveCollection {
     /** Second step of double dispatch:  call `handler.handleBagOfCurves(this)` */
     dispatchToGeometryHandler(handler: GeometryHandler): any;
 }
-/**
- * * Options to control method `RegionOps.consolidateAdjacentPrimitives`
- * @public
- */
-export declare class ConsolidateAdjacentCurvePrimitivesOptions {
-    /** True to consolidated linear geometry   (e.g. separate LineSegment3d and LineString3d) into LineString3d */
-    consolidateLinearGeometry: boolean;
-    /** True to consolidate contiguous arcs */
-    consolidateCompatibleArcs: boolean;
-    /** Tolerance for collapsing identical points */
-    duplicatePointTolerance: number;
-    /** Tolerance for removing interior colinear points. */
-    colinearPointTolerance: number;
-}
 //# sourceMappingURL=CurveCollection.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"CurveCollection.d.ts","sourceRoot":"","sources":["../../../src/curve/CurveCollection.ts"],"names":[],"mappings":"AASA,OAAO,EAAE,eAAe,EAAE,MAAM,+BAA+B,CAAC;AAChE,OAAO,EAAE,gBAAgB,EAAE,MAAM,gCAAgC,CAAC;AAClE,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAClE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AACvD,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAC5C,OAAO,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AACpD,OAAO,EAAE,QAAQ,EAAE,MAAM,cAAc,CAAC;AACxC,OAAO,EAAE,mBAAmB,EAAE,MAAM,uBAAuB,CAAC;AAC5D,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAClD,OAAO,EAAE,uBAAuB,EAAE,MAAM,kBAAkB,CAAC;AAC3D,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAUhD,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAEhD;;;;;;;;;GASG;AACH,MAAM,MAAM,mBAAmB,GAAG,MAAM,GAAG,MAAM,GAAG,aAAa,GAAG,cAAc,GAAG,aAAa,CAAC;AAEnG;;;;;;;;;;;;;;GAcG;AACH,8BAAsB,eAAgB,SAAQ,aAAa;IACzD,wCAAwC;IACxC,SAAgB,gBAAgB,qBAAqB;IACrD,0BAA0B;IAC1B,kBAAyB,mBAAmB,EAAE,mBAAmB,CAAC;IAElE,uDAAuD;IAChD,OAAO,EAAE,OAAO,CAAS;IAChC,6DAA6D;IACtD,UAAU,IAAI,MAAM;IAG3B,uDAAuD;IAChD,YAAY,CAAC,UAAU,EAAE,OAAO,GAAG,mBAAmB,GAAG,SAAS;IAezE;;;;;;OAMG;IACI,MAAM,IAAI,MAAM;IAGvB,wGAAwG;IACjG,2BAA2B,IAAI,OAAO;IAG7C,8CAA8C;IACvC,mBAAmB,CAAC,SAAS,EAAE,SAAS,GAAG,OAAO;IAGzD,0BAA0B;IACV,KAAK,IAAI,eAAe;IAGxC,gDAAgD;IAChC,gBAAgB,CAAC,SAAS,EAAE,SAAS,GAAG,eAAe,GAAG,SAAS;IAGnF,uFAAuF;IAChF,4BAA4B,IAAI,eAAe;IAGtD;;;;OAIG;IACH,OAAO,CAAC,wBAAwB;IAYhC;;;;;;;;OAQG;IACI,sBAAsB,CAC3B,cAAc,CAAC,EAAE,cAAc,EAAE,EAAE,0BAA0B,GAAE,OAAe,EAAE,kBAAkB,GAAE,OAAe,GAClH,cAAc,EAAE;IAKnB;;;;;OAKG;IACH,IAAW,eAAe,IAAI,OAAO,CAEpC;IACD,2EAA2E;IAC3E,IAAW,UAAU,IAAI,OAAO,CAE/B;IACD;;;OAGG;IACH,IAAW,YAAY,IAAI,OAAO,CAEjC;IACD,2FAA2F;aAC3E,YAAY,CAAC,OAAO,CAAC,EAAE,aAAa,GAAG,QAAQ;IAC/D,2FAA2F;aAC3E,wBAAwB,CAAC,SAAS,EAAE,uBAAuB,GAAG,IAAI;IAClF,iCAAiC;aACjB,cAAc,IAAI,eAAe;IACjD;;;OAGG;aACa,eAAe,IAAI,MAAM;IACzC;;;;OAIG;aACa,WAAW,CAAC,KAAK,EAAE,QAAQ,GAAG,SAAS,GAAG,OAAO;IACjE,4CAA4C;aAC5B,QAAQ,CAAC,CAAC,EAAE,MAAM,GAAG,QAAQ,GAAG,SAAS;IACzD;;;;OAIG;IACI,WAAW,CAAC,aAAa,EAAE,OAAO,EAAE,SAAS,CAAC,EAAE,SAAS,GAAG,IAAI;IAQvE;;;;;OAKG;WACW,4CAA4C,CACxD,MAAM,EAAE,aAAa,GAAG,SAAS,EAAE,QAAQ,GAAE,MAAY,GACxD,mBAAmB,GAAG,SAAS;IAalC;;;;;;;OAOG;IACI,uBAAuB,CAAC,GAAG,EAAE,QAAQ,GAAG,KAAK,EAAE,OAAO,CAAC,EAAE,OAAO,GAAG,OAAO,GAAG,SAAS;CAG9F;AAED;;;;;;;;;GASG;AACH,8BAAsB,UAAW,SAAQ,eAAe;IACtD,yCAAyC;IACzC,SAAS,CAAC,OAAO,EAAE,cAAc,EAAE,CAAC;IACpC,kBAAkB;IAClB,SAAS;IAIT,2CAA2C;IAC3C,IAAoB,QAAQ,IAAI,cAAc,EAAE,CAI/C;IACD;;;;OAIG;IACI,oBAAoB,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,GAAE,OAAc,GAAG,cAAc,GAAG,SAAS;IAY9F;;;OAGG;IACI,gBAAgB,CAAC,OAAO,CAAC,EAAE,aAAa,GAAG,gBAAgB,GAAG,SAAS;IAiB9E,sEAAsE;aAC7C,YAAY,CAAC,OAAO,CAAC,EAAE,aAAa,GAAG,QAAQ;IACxE;;;OAGG;IACI,WAAW,CAAC,KAAK,EAAE,QAAQ,GAAG,SAAS,GAAG,OAAO;IAOxD,8BAA8B;IACvB,QAAQ,CAAC,CAAC,EAAE,MAAM,GAAG,cAAc,GAAG,SAAS;IAItD,mEAAmE;IACnD,WAAW,CAAC,KAAK,EAAE,OAAO,EAAE,SAAS,CAAC,EAAE,SAAS,GAAG,IAAI;IAIxE;;;OAGG;IACI,sBAAsB,IAAI,IAAI;IAKrC;;;OAGG;IACI,UAAU,CAAC,MAAM,EAAE,cAAc,GAAG,SAAS,EAAE,iBAAiB,CAAC,EAAE,OAAO,GAAG,MAAM,GAAG,SAAS;IAgBtG,6GAA6G;IACtG,gEAAgE,CACrE,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,MAAM,GAAE,OAAe,EAAE,MAAM,CAAC,EAAE,mBAAmB,GACrF,mBAAmB,GAAG,SAAS;CAOnC;AAED;;;;GAIG;AACH,qBAAa,WAAY,SAAQ,eAAe;IAC9C,wCAAwC;IACxC,SAAgB,mBAAmB,iBAAiB;IACpD,sDAAsD;IAC/C,mBAAmB,CAAC,KAAK,EAAE,aAAa,GAAG,OAAO;IAGzD;;;OAGG;IACH,SAAS,CAAC,SAAS,EAAE,QAAQ,EAAE,CAAC;IAChC,uCAAuC;;IAKvC,kDAAkD;IAClD,IAAoB,QAAQ,IAAI,QAAQ,EAAE,CAEzC;IACD,gCAAgC;WAClB,MAAM,CAAC,GAAG,IAAI,EAAE,QAAQ,EAAE,GAAG,WAAW;IAOtD,gFAAgF;IACzE,eAAe,IAAI,MAAM;IAGhC,mEAAmE;IAC5D,wBAAwB,CAAC,SAAS,EAAE,uBAAuB,EAAE,aAAa,GAAE,MAAW,GAAG,IAAI;IAGrG,0CAA0C;IACnC,YAAY,CAAC,OAAO,CAAC,EAAE,aAAa,GAAG,WAAW;IAiBzD,oCAAoC;IAC7B,cAAc,IAAI,WAAW;IAGpC,mBAAmB;IACZ,WAAW,CAAC,KAAK,EAAE,QAAQ,GAAG,SAAS,GAAG,OAAO;IAKxD,2BAA2B;IACpB,QAAQ,CAAC,CAAC,EAAE,MAAM,GAAG,QAAQ,GAAG,SAAS;IAKhD,8EAA8E;IACvE,yBAAyB,CAAC,OAAO,EAAE,eAAe,GAAG,GAAG;CAGhE;AAED;;;GAGG;AACH,qBAAa,yCAAyC;IACpD,8GAA8G;IACvG,yBAAyB,EAAE,OAAO,CAAQ;IACjD,0CAA0C;IACnC,yBAAyB,EAAE,OAAO,CAAQ;IACjD,gDAAgD;IACzC,uBAAuB,SAAgC;IAC9D,uDAAuD;IAChD,sBAAsB,SAAgC;CAC9D"}
+{"version":3,"file":"CurveCollection.d.ts","sourceRoot":"","sources":["../../../src/curve/CurveCollection.ts"],"names":[],"mappings":"AASA,OAAO,EAAE,eAAe,EAAE,MAAM,+BAA+B,CAAC;AAChE,OAAO,EAAE,gBAAgB,EAAE,MAAM,gCAAgC,CAAC;AAClE,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAClE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AACvD,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAC5C,OAAO,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AACpD,OAAO,EAAE,mBAAmB,EAAE,MAAM,uBAAuB,CAAC;AAC5D,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAClD,OAAO,EAAE,uBAAuB,EAAE,MAAM,kBAAkB,CAAC;AAC3D,OAAO,EAAE,QAAQ,EAAE,KAAK,SAAS,EAAE,MAAM,cAAc,CAAC;AACxD,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAUhD,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAEhD,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AACnC,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAEnC,wGAAwG;AAExG;;;;;;;;;GASG;AACH,MAAM,MAAM,mBAAmB,GAAG,MAAM,GAAG,MAAM,GAAG,aAAa,GAAG,cAAc,GAAG,aAAa,CAAC;AAEnG;;;;;;;;;;;;;;GAcG;AACH,8BAAsB,eAAgB,SAAQ,aAAa;IACzD,wCAAwC;IACxC,SAAgB,gBAAgB,qBAAqB;IACrD,0BAA0B;IAC1B,kBAAyB,mBAAmB,EAAE,mBAAmB,CAAC;IAElE,uDAAuD;IAChD,OAAO,EAAE,OAAO,CAAS;IAChC,6DAA6D;IACtD,UAAU,IAAI,MAAM;IAG3B,uDAAuD;IAChD,YAAY,CAAC,UAAU,EAAE,OAAO,GAAG,mBAAmB,GAAG,SAAS;IAezE;;;;;;OAMG;IACI,MAAM,IAAI,MAAM;IAGvB,wGAAwG;IACjG,2BAA2B,IAAI,OAAO;IAG7C,8CAA8C;IACvC,mBAAmB,CAAC,SAAS,EAAE,SAAS,GAAG,OAAO;IAGzD,0BAA0B;IACV,KAAK,IAAI,eAAe;IAGxC,gDAAgD;IAChC,gBAAgB,CAAC,SAAS,EAAE,SAAS,GAAG,eAAe,GAAG,SAAS;IAGnF,uFAAuF;IAChF,4BAA4B,IAAI,eAAe;IAGtD;;;;OAIG;IACH,OAAO,CAAC,wBAAwB;IAYhC;;;;;;;;OAQG;IACI,sBAAsB,CAC3B,cAAc,CAAC,EAAE,cAAc,EAAE,EAAE,0BAA0B,GAAE,OAAe,EAAE,kBAAkB,GAAE,OAAe,GAClH,cAAc,EAAE;IAKnB;;;;;;OAMG;IACH,IAAW,eAAe,IAAI,OAAO,CAEpC;IACD,+BAA+B;IACxB,WAAW,IAAI,IAAI,IAAI,SAAS;IAGvC;;;OAGG;IACH,IAAW,UAAU,IAAI,OAAO,CAE/B;IACD,0BAA0B;IACnB,MAAM,IAAI,IAAI,IAAI,IAAI;IAG7B;;;;OAIG;IACH,IAAW,YAAY,IAAI,OAAO,CAEjC;IACD,0BAA0B;IACnB,MAAM,IAAI,IAAI,IAAI,IAAI;IAI7B,2FAA2F;aAC3E,YAAY,CAAC,OAAO,CAAC,EAAE,aAAa,GAAG,eAAe;IACtE,2FAA2F;aAC3E,wBAAwB,CAAC,SAAS,EAAE,uBAAuB,GAAG,IAAI;IAClF,iCAAiC;aACjB,cAAc,IAAI,eAAe;IACjD;;;OAGG;aACa,eAAe,IAAI,MAAM;IACzC;;;;OAIG;aACa,WAAW,CAAC,KAAK,EAAE,QAAQ,GAAG,SAAS,GAAG,OAAO;IACjE,4CAA4C;aAC5B,QAAQ,CAAC,CAAC,EAAE,MAAM,GAAG,QAAQ,GAAG,SAAS;IACzD;;;;OAIG;IACI,WAAW,CAAC,aAAa,EAAE,OAAO,EAAE,SAAS,CAAC,EAAE,SAAS,GAAG,IAAI;IAQvE;;;;;OAKG;WACW,4CAA4C,CACxD,MAAM,EAAE,aAAa,GAAG,SAAS,EAAE,QAAQ,GAAE,MAAY,GACxD,mBAAmB,GAAG,SAAS;IAalC;;;;;;;OAOG;IACI,uBAAuB,CAAC,GAAG,EAAE,QAAQ,GAAG,KAAK,EAAE,OAAO,CAAC,EAAE,OAAO,GAAG,OAAO,GAAG,SAAS;CAG9F;AAED;;;;;;;;;GASG;AACH,8BAAsB,UAAW,SAAQ,eAAe;IACtD,yCAAyC;IACzC,SAAS,CAAC,OAAO,EAAE,cAAc,EAAE,CAAC;IACpC,kBAAkB;IAClB,SAAS;IAIT,2CAA2C;IAC3C,IAAoB,QAAQ,IAAI,cAAc,EAAE,CAE/C;IACD;;;;OAIG;IACI,oBAAoB,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,GAAE,OAAc,GAAG,cAAc,GAAG,SAAS;IAY9F;;;OAGG;IACI,gBAAgB,CAAC,OAAO,CAAC,EAAE,aAAa,GAAG,gBAAgB,GAAG,SAAS;IAiB9E,sEAAsE;aAC7C,YAAY,CAAC,OAAO,CAAC,EAAE,aAAa,GAAG,UAAU;IAC1E;;;OAGG;IACI,WAAW,CAAC,KAAK,EAAE,QAAQ,GAAG,SAAS,GAAG,OAAO;IAOxD,8BAA8B;IACvB,QAAQ,CAAC,CAAC,EAAE,MAAM,GAAG,cAAc,GAAG,SAAS;IAItD,mEAAmE;IACnD,WAAW,CAAC,KAAK,EAAE,OAAO,EAAE,SAAS,CAAC,EAAE,SAAS,GAAG,IAAI;IAIxE;;;OAGG;IACI,sBAAsB,IAAI,IAAI;IAKrC;;;OAGG;IACI,UAAU,CAAC,MAAM,EAAE,cAAc,GAAG,SAAS,EAAE,iBAAiB,CAAC,EAAE,OAAO,GAAG,MAAM,GAAG,SAAS;IAgBtG,6GAA6G;IACtG,gEAAgE,CACrE,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,MAAM,GAAE,OAAe,EAAE,MAAM,CAAC,EAAE,mBAAmB,GACrF,mBAAmB,GAAG,SAAS;CAOnC;AAED;;;;GAIG;AACH,qBAAa,WAAY,SAAQ,eAAe;IAC9C,wCAAwC;IACxC,SAAgB,mBAAmB,iBAAiB;IACpD,sDAAsD;IAC/C,mBAAmB,CAAC,KAAK,EAAE,aAAa,GAAG,OAAO;IAGzD;;;OAGG;IACH,SAAS,CAAC,SAAS,EAAE,QAAQ,EAAE,CAAC;IAChC,uCAAuC;;IAKvC,kDAAkD;IAClD,IAAoB,QAAQ,IAAI,QAAQ,EAAE,CAEzC;IACD,gCAAgC;WAClB,MAAM,CAAC,GAAG,IAAI,EAAE,QAAQ,EAAE,GAAG,WAAW;IAOtD,gFAAgF;IACzE,eAAe,IAAI,MAAM;IAGhC,mEAAmE;IAC5D,wBAAwB,CAAC,SAAS,EAAE,uBAAuB,EAAE,aAAa,GAAE,MAAW,GAAG,IAAI;IAGrG,0CAA0C;IACnC,YAAY,CAAC,OAAO,CAAC,EAAE,aAAa,GAAG,WAAW;IAiBzD,oCAAoC;IAC7B,cAAc,IAAI,WAAW;IAGpC,mBAAmB;IACZ,WAAW,CAAC,KAAK,EAAE,QAAQ,GAAG,SAAS,GAAG,OAAO;IAKxD,2BAA2B;IACpB,QAAQ,CAAC,CAAC,EAAE,MAAM,GAAG,QAAQ,GAAG,SAAS;IAKhD,8EAA8E;IACvE,yBAAyB,CAAC,OAAO,EAAE,eAAe,GAAG,GAAG;CAGhE"}

package/lib/cjs/curve/CurveCollection.js

@@ -4,7 +4,7 @@
 * See LICENSE.md in the project root for license terms and full copyright notice.
 *--------------------------------------------------------------------------------------------*/
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.ConsolidateAdjacentCurvePrimitivesOptions = exports.BagOfCurves = exports.CurveChain = exports.CurveCollection = void 0;
+exports.BagOfCurves = exports.CurveChain = exports.CurveCollection = void 0;
 /** @packageDocumentation
  * @module Curve
  */
@@ -130,21 +130,38 @@ class CurveCollection extends GeometryQuery_1.GeometryQuery {
      * * `Loop`
      * * `ParityRegion`
      * * `UnionRegion`
+     * @see isAnyRegion
      */
     get isAnyRegionType() {
         return this.dgnBoundaryType() === 2 || this.dgnBoundaryType() === 4 || this.dgnBoundaryType() === 5;
     }
-    /** Return true for a `Path`, i.e. a chain of curves joined head-to-tail */
+    /** Type guard for AnyRegion */
+    isAnyRegion() {
+        return this.isAnyRegionType;
+    }
+    /**
+     * Return true for a `Path`, i.e. a chain of curves joined head-to-tail
+     * @see isPath
+     */
     get isOpenPath() {
         return this.dgnBoundaryType() === 1;
     }
+    /** Type guard for Path */
+    isPath() {
+        return this.isOpenPath;
+    }
     /**
      * Return true for a single-loop planar region type, i.e. `Loop`.
      * * This is NOT a test for physical closure of a `Path`.
+     * @see isLoop
      */
     get isClosedPath() {
         return this.dgnBoundaryType() === 2;
     }
+    /** Type guard for Loop */
+    isLoop() {
+        return this.isClosedPath;
+    }
     /**
      * Extend (increase) the given range as needed to encompass all curves in the curve collection.
      * @param rangeToExtend the given range.
@@ -194,7 +211,7 @@ exports.CurveCollection = CurveCollection;
 /**
  * Shared base class for use by both open and closed paths.
  * * A `CurveChain` contains only CurvePrimitives. No other paths, loops, or regions allowed.
- * * The specific derived classes are `Path` and `Loop`
+ * * The specific derived classes are `Path` and `Loop`.
  * * `CurveChain` is an intermediate class. It is not instantiable on its own.
  * * The related class `CurveChainWithDistanceIndex` is a `CurvePrimitive` whose API presents well-defined mappings
  * from fraction to xyz over the entire chain, but in fact does all the calculations over multiple primitives.
@@ -209,8 +226,6 @@ class CurveChain extends CurveCollection {
     }
     /** Return the array of `CurvePrimitive` */
     get children() {
-        if (this._curves === undefined)
-            this._curves = [];
         return this._curves;
     }
     /**
@@ -390,21 +405,4 @@ class BagOfCurves extends CurveCollection {
     }
 }
 exports.BagOfCurves = BagOfCurves;
-/**
- * * Options to control method `RegionOps.consolidateAdjacentPrimitives`
- * @public
- */
-class ConsolidateAdjacentCurvePrimitivesOptions {
-    constructor() {
-        /** True to consolidated linear geometry   (e.g. separate LineSegment3d and LineString3d) into LineString3d */
-        this.consolidateLinearGeometry = true;
-        /** True to consolidate contiguous arcs */
-        this.consolidateCompatibleArcs = true;
-        /** Tolerance for collapsing identical points */
-        this.duplicatePointTolerance = Geometry_1.Geometry.smallMetricDistance;
-        /** Tolerance for removing interior colinear points. */
-        this.colinearPointTolerance = Geometry_1.Geometry.smallMetricDistance;
-    }
-}
-exports.ConsolidateAdjacentCurvePrimitivesOptions = ConsolidateAdjacentCurvePrimitivesOptions;
 //# sourceMappingURL=CurveCollection.js.map

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;AACH,0CAAuC;AAQvC,+DAA4D;AAC5D,qDAAkD;AAElD,mDAAgD;AAChD,8EAA2E;AAC3E,kGAA+F;AAC/F,oGAAiG;AACjG,0EAAuE;AACvE,4FAAyF;AACzF,4EAAyE;AACzE,wFAAqF;AACrF,iDAA8C;AAC9C,6CAA0C;AAe1C;;;;;;;;;;;;;;GAcG;AACH,MAAsB,eAAgB,SAAQ,6BAAa;IAA3D;;QACE,wCAAwC;QACxB,qBAAgB,GAAG,iBAAiB,CAAC;QAGrD,mEAAmE;QACnE,uDAAuD;QAChD,YAAO,GAAY,KAAK,CAAC;IAwKlC,CAAC;IAvKC,6DAA6D;IACtD,UAAU;QACf,OAAO,qCAAiB,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;IAC5C,CAAC;IACD,uDAAuD;IAChD,YAAY,CAAC,UAAmB;QACrC,IAAI,OAAwC,CAAC;QAC7C,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS,EAAE;YAC/B,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE;gBACjC,IAAI,KAAK,YAAY,+BAAc,EAAE;oBACnC,MAAM,OAAO,GAAG,KAAK,CAAC,YAAY,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;oBACtD,OAAO,GAAG,yCAAmB,CAAC,cAAc,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;iBAChE;qBAAM,IAAI,KAAK,YAAY,eAAe,EAAE;oBAC3C,MAAM,OAAO,GAAG,KAAK,CAAC,YAAY,CAAC,UAAU,CAAC,CAAC;oBAC/C,OAAO,GAAG,yCAAmB,CAAC,cAAc,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;iBAChE;aACF;SACF;QACD,OAAO,OAAO,CAAC;IACjB,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;YACjB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE;gBACjC,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;aAC3F;SACF;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;;;;;OAKG;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,2EAA2E;IAC3E,IAAW,UAAU;QACnB,OAAO,IAAI,CAAC,eAAe,EAAE,KAAK,CAAC,CAAC;IACtC,CAAC;IACD;;;OAGG;IACH,IAAW,YAAY;QACrB,OAAO,IAAI,CAAC,eAAe,EAAE,KAAK,CAAC,CAAC;IACtC,CAAC;IAoBD;;;;OAIG;IACI,WAAW,CAAC,aAAsB,EAAE,SAAqB;QAC9D,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC/B,IAAI,QAAQ,EAAE;YACZ,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE;gBACxB,CAAC,CAAC,WAAW,CAAC,aAAa,EAAE,SAAS,CAAC,CAAC;aACzC;SACF;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;YACpC,OAAO,yCAAmB,CAAC,4BAA4B,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;SAC3E;aAAM,IAAI,MAAM,YAAY,eAAe,IAAI,MAAM,CAAC,QAAQ,KAAK,SAAS;YAC3E,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,QAAQ,EAAE;gBACnC,MAAM,MAAM,GAAG,IAAI,CAAC,4CAA4C,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;gBAClF,IAAI,MAAM;oBACR,OAAO,MAAM,CAAC;aACjB;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;CACF;AA/KD,0CA+KC;AAED;;;;;;;;;GASG;AACH,MAAsB,UAAW,SAAQ,eAAe;IAGtD,kBAAkB;IAClB;QACE,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC;IACpB,CAAC;IACD,2CAA2C;IAC3C,IAAoB,QAAQ;QAC1B,IAAI,IAAI,CAAC,OAAO,KAAK,SAAS;YAC5B,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC;QACpB,OAAO,IAAI,CAAC,OAAO,CAAC;IACtB,CAAC;IACD;;;;OAIG;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;YACV,MAAM,MAAM,GAAG,mBAAQ,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YACzC,OAAO,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;SAC9B;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;YAC9B,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;YAC/B,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE;gBACzB,MAAM,EAAE,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;gBACvB,IAAI,EAAE,YAAY,2BAAY;oBAC5B,OAAO,EAAE,CAAC,YAAY,CAAC;aAC1B;SACF;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAGD;;;OAGG;IACI,WAAW,CAAC,KAA2B;QAC5C,IAAI,KAAK,IAAI,KAAK,YAAY,+BAAc,EAAE;YAC5C,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACzB,OAAO,IAAI,CAAC;SACb;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;;;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;YAC5C,IAAI,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,MAAM;gBAC5B,OAAO,CAAC,CAAC;SACZ;QACD,IAAI,iBAAiB,IAAI,KAAK,EAAE;YAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gBAC5C,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;gBACnC,IAAI,UAAU,YAAY,uBAAU,EAAE;oBACpC,IAAI,UAAU,CAAC,UAAU,KAAK,MAAM;wBAClC,OAAO,CAAC,CAAC;iBACZ;aACF;SACF;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;YACb,OAAO,yCAAmB,CAAC,8CAA8C,CAAC,SAAS,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;SACxG;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;CACF;AAlHD,gCAkHC;AAED;;;;GAIG;AACH,MAAa,WAAY,SAAQ,eAAe;IAG9C,sDAAsD;IAC/C,mBAAmB,CAAC,KAAoB;QAC7C,OAAO,KAAK,YAAY,WAAW,CAAC;IACtC,CAAC;IAMD,uCAAuC;IACvC;QACE,KAAK,EAAE,CAAC;QAbV,wCAAwC;QACxB,wBAAmB,GAAG,aAAa,CAAC;QAalD,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;YACxB,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;SAC3B;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;YAC3B,IAAI,KAAK,YAAY,+BAAc,EAAE;gBACnC,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;aAC3B;iBAAM,IAAI,KAAK,YAAY,eAAe,EAAE;gBAC3C,MAAM,YAAY,GAAG,KAAK,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC;gBACjD,IAAI,YAAY;oBACd,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;aACrC;SACF;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;AAED;;;GAGG;AACH,MAAa,yCAAyC;IAAtD;QACE,8GAA8G;QACvG,8BAAyB,GAAY,IAAI,CAAC;QACjD,0CAA0C;QACnC,8BAAyB,GAAY,IAAI,CAAC;QACjD,gDAAgD;QACzC,4BAAuB,GAAG,mBAAQ,CAAC,mBAAmB,CAAC;QAC9D,uDAAuD;QAChD,2BAAsB,GAAG,mBAAQ,CAAC,mBAAmB,CAAC;IAC/D,CAAC;CAAA;AATD,8FASC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n\r\n/** @packageDocumentation\r\n * @module Curve\r\n */\r\nimport { Geometry } from \"../Geometry\";\r\nimport { GeometryHandler } from \"../geometry3d/GeometryHandler\";\r\nimport { GrowableXYZArray } from \"../geometry3d/GrowableXYZArray\";\r\nimport { Point3d, Vector3d } from \"../geometry3d/Point3dVector3d\";\r\nimport { Range1d, Range3d } from \"../geometry3d/Range\";\r\nimport { Ray3d } from \"../geometry3d/Ray3d\";\r\nimport { Transform } from \"../geometry3d/Transform\";\r\nimport { AnyCurve } from \"./CurveChain\";\r\nimport { CurveLocationDetail } from \"./CurveLocationDetail\";\r\nimport { CurvePrimitive } from \"./CurvePrimitive\";\r\nimport { RecursiveCurveProcessor } from \"./CurveProcessor\";\r\nimport { GeometryQuery } from \"./GeometryQuery\";\r\nimport { CloneCurvesContext } from \"./internalContexts/CloneCurvesContext\";\r\nimport { CloneWithExpandedLineStrings } from \"./internalContexts/CloneWithExpandedLineStrings\";\r\nimport { CountLinearPartsSearchContext } from \"./internalContexts/CountLinearPartsSearchContext\";\r\nimport { GapSearchContext } from \"./internalContexts/GapSearchContext\";\r\nimport { PlaneAltitudeRangeContext } from \"./internalContexts/PlaneAltitudeRangeContext\";\r\nimport { SumLengthsContext } from \"./internalContexts/SumLengthsContext\";\r\nimport { TransformInPlaceContext } from \"./internalContexts/TransformInPlaceContext\";\r\nimport { LineString3d } from \"./LineString3d\";\r\nimport { ProxyCurve } from \"./ProxyCurve\";\r\nimport { StrokeOptions } from \"./StrokeOptions\";\r\n\r\n/**\r\n * Describes the concrete type of a [[CurveCollection]]. Each type name maps to a specific subclass and can be\r\n * used in conditional statements for type-switching.\r\n *    - \"loop\" => [[Loop]]\r\n *    - \"path\" => [[Path]]\r\n *    - \"unionRegion\" => [[UnionRegion]]\r\n *    - \"parityRegion\" => [[ParityRegion]]\r\n *    - \"bagOfCurves\" => [[BagOfCurves]]\r\n * @public\r\n */\r\nexport type CurveCollectionType = \"loop\" | \"path\" | \"unionRegion\" | \"parityRegion\" | \"bagOfCurves\";\r\n\r\n/**\r\n * A `CurveCollection` is an abstract (non-instantiable) class for various sets of curves with particular structures:\r\n * - `CurveChain` is a (non-instantiable) intermediate class for a sequence of `CurvePrimitive` joining head-to-tail.\r\n * The two instantiable forms of `CurveChain` are\r\n *   - `Path` - A chain not required to close and not enclosing a planar area (so curves do not have to be on the\r\n * same plane).\r\n *   - `Loop` - A chain required to close from last to first so that a planar area is enclosed (so curves have to\r\n * be on the same plane).\r\n * - `ParityRegion` -- a collection of coplanar `Loop`, with \"in/out\" classification by parity rules.\r\n * - `UnionRegion` -- a collection of coplanar `Loop` and/or `ParityRegion`, with \"in/out\" classification by union rules.\r\n * - `BagOfCurves` -- a collection of `AnyCurve` with no implied structure.\r\n *\r\n * @see [Curve Collections]($docs/learning/geometry/CurveCollection.md) learning article.\r\n * @public\r\n */\r\nexport abstract class CurveCollection extends GeometryQuery {\r\n  /** String name for schema properties */\r\n  public readonly geometryCategory = \"curveCollection\";\r\n  /** Type discriminator. */\r\n  public abstract readonly curveCollectionType: CurveCollectionType;\r\n  /* eslint-disable @typescript-eslint/naming-convention, no-empty */\r\n  /** Flag for inner loop status. Only used by `Loop`. */\r\n  public isInner: boolean = false;\r\n  /** Return the sum of the lengths of all contained curves. */\r\n  public sumLengths(): number {\r\n    return SumLengthsContext.sumLengths(this);\r\n  }\r\n  /** Return the closest point on the contained curves */\r\n  public closestPoint(spacePoint: Point3d): CurveLocationDetail | undefined {\r\n    let detailA: CurveLocationDetail | undefined;\r\n    if (this.children !== undefined) {\r\n      for (const child of this.children) {\r\n        if (child instanceof CurvePrimitive) {\r\n          const detailB = child.closestPoint(spacePoint, false);\r\n          detailA = CurveLocationDetail.chooseSmallerA(detailA, detailB);\r\n        } else if (child instanceof CurveCollection) {\r\n          const detailB = child.closestPoint(spacePoint);\r\n          detailA = CurveLocationDetail.chooseSmallerA(detailA, detailB);\r\n        }\r\n      }\r\n    }\r\n    return detailA;\r\n  }\r\n  /**\r\n   * Return the max gap between adjacent primitives in Path and Loop collections.\r\n   * * In a Path, gaps are computed between consecutive primitives.\r\n   * * In a Loop, gaps are computed between consecutive primitives and between last and first.\r\n   * * Gaps are NOT computed between consecutive CurvePrimitives in \"unstructured\" collections. The type is\r\n   * \"unstructured\" so gaps should not be semantically meaningful.\r\n   */\r\n  public maxGap(): number {\r\n    return GapSearchContext.maxGap(this);\r\n  }\r\n  /** Return true if the curve collection has any primitives other than LineSegment3d and LineString3d  */\r\n  public checkForNonLinearPrimitives(): boolean {\r\n    return CountLinearPartsSearchContext.hasNonLinearPrimitives(this);\r\n  }\r\n  /** Apply transform recursively to children */\r\n  public tryTransformInPlace(transform: Transform): boolean {\r\n    return TransformInPlaceContext.tryTransformInPlace(this, transform);\r\n  }\r\n  /** Return a deep copy. */\r\n  public override clone(): CurveCollection {\r\n    return CloneCurvesContext.clone(this) as CurveCollection;\r\n  }\r\n  /** Create a deep copy of transformed curves. */\r\n  public override cloneTransformed(transform: Transform): CurveCollection | undefined {\r\n    return CloneCurvesContext.clone(this, transform);\r\n  }\r\n  /** Create a deep copy with all linestrings broken down into multiple LineSegment3d. */\r\n  public cloneWithExpandedLineStrings(): CurveCollection {\r\n    return CloneWithExpandedLineStrings.clone(this);\r\n  }\r\n  /**\r\n   * Push all CurvePrimitives contained in the instance onto the `results` array.\r\n   * * This method is recursive. For example, if the CurveCollection contains a Loop, all CurvePrimitives\r\n   * of the Loop are pushed onto `results`.\r\n   */\r\n  private collectCurvePrimitivesGo(\r\n    results: CurvePrimitive[], smallestPossiblePrimitives: boolean, explodeLinestrings: boolean = false,\r\n  ): void {\r\n    if (this.children) {\r\n      for (const child of this.children) {\r\n        if (child instanceof CurvePrimitive)\r\n          child.collectCurvePrimitivesGo(results, smallestPossiblePrimitives, explodeLinestrings);\r\n        else if (child instanceof CurveCollection)\r\n          child.collectCurvePrimitivesGo(results, smallestPossiblePrimitives, explodeLinestrings);\r\n      }\r\n    }\r\n  }\r\n  /**\r\n   * Return an array containing all CurvePrimitives in the instance.\r\n   * * This method is recursive. For example, if the CurveCollection contains a Loop, all CurvePrimitives of\r\n   * the Loop are pushed onto the returned array.\r\n   * @param collectorArray optional array to receive primitives. If present, new primitives are ADDED (without\r\n   * clearing the array).\r\n   * @param smallestPossiblePrimitives if false, CurvePrimitiveWithDistanceIndex returns only itself. If true,\r\n   * it recurses to its (otherwise hidden) children.\r\n   */\r\n  public collectCurvePrimitives(\r\n    collectorArray?: CurvePrimitive[], smallestPossiblePrimitives: boolean = false, explodeLineStrings: boolean = false,\r\n  ): CurvePrimitive[] {\r\n    const results: CurvePrimitive[] = collectorArray === undefined ? [] : collectorArray;\r\n    this.collectCurvePrimitivesGo(results, smallestPossiblePrimitives, explodeLineStrings);\r\n    return results;\r\n  }\r\n  /**\r\n   * Return true for planar region types:\r\n   * * `Loop`\r\n   * * `ParityRegion`\r\n   * * `UnionRegion`\r\n   */\r\n  public get isAnyRegionType(): boolean {\r\n    return this.dgnBoundaryType() === 2 || this.dgnBoundaryType() === 4 || this.dgnBoundaryType() === 5;\r\n  }\r\n  /** Return true for a `Path`, i.e. a chain of curves joined head-to-tail */\r\n  public get isOpenPath(): boolean {\r\n    return this.dgnBoundaryType() === 1;\r\n  }\r\n  /**\r\n   * Return true for a single-loop planar region type, i.e. `Loop`.\r\n   * * This is NOT a test for physical closure of a `Path`.\r\n   */\r\n  public get isClosedPath(): boolean {\r\n    return this.dgnBoundaryType() === 2;\r\n  }\r\n  /** Return a CurveCollection with the same structure but all curves replaced by strokes. */\r\n  public abstract cloneStroked(options?: StrokeOptions): AnyCurve;\r\n  /** Support method for ICurvePrimitive ... one line call to specific announce method . . */\r\n  public abstract announceToCurveProcessor(processor: RecursiveCurveProcessor): void;\r\n  /** Clone an empty collection. */\r\n  public abstract cloneEmptyPeer(): CurveCollection;\r\n  /**\r\n   * Return the boundary type of a corresponding MicroStation CurveVector.\r\n   * * Derived class must implement.\r\n   */\r\n  public abstract dgnBoundaryType(): number;\r\n  /**\r\n   * Try to add a child.\r\n   * @param child child to add.\r\n   * @return true if child is an acceptable type for this collection.\r\n   */\r\n  public abstract tryAddChild(child: AnyCurve | undefined): boolean;\r\n  /** Return a child identified by by index */\r\n  public abstract getChild(i: number): AnyCurve | undefined;\r\n  /**\r\n   * Extend (increase) the given range as needed to encompass all curves in the curve collection.\r\n   * @param rangeToExtend the given range.\r\n   * @param transform if supplied, the range is extended with transformed curves.\r\n   */\r\n  public extendRange(rangeToExtend: Range3d, transform?: Transform): void {\r\n    const children = this.children;\r\n    if (children) {\r\n      for (const c of children) {\r\n        c.extendRange(rangeToExtend, transform);\r\n      }\r\n    }\r\n  }\r\n  /**\r\n   * Find any CurvePrimitive in the source and evaluate it at the given fraction.\r\n   * * The first CurvePrimitive found is evaluated. Any other CurvePrimitives are ignored.\r\n   * @param source containing `CurvePrimitive` or `CurveCollection`\r\n   * @param fraction fraction to use in `curve.fractionToPoint(fraction)`\r\n   */\r\n  public static createCurveLocationDetailOnAnyCurvePrimitive(\r\n    source: GeometryQuery | undefined, fraction: number = 0.5,\r\n  ): CurveLocationDetail | undefined {\r\n    if (!source)\r\n      return undefined;\r\n    if (source instanceof CurvePrimitive) {\r\n      return CurveLocationDetail.createCurveEvaluatedFraction(source, fraction);\r\n    } else if (source instanceof CurveCollection && source.children !== undefined)\r\n      for (const child of source.children) {\r\n        const detail = this.createCurveLocationDetailOnAnyCurvePrimitive(child, fraction);\r\n        if (detail)\r\n          return detail;\r\n      }\r\n    return undefined;\r\n  }\r\n  /**\r\n   * Project instance geometry (via dispatch) onto the given ray, and return the extreme fractional parameters\r\n   * of projection.\r\n   * @param ray ray onto which the instance is projected. A `Vector3d` is treated as a `Ray3d` with zero origin.\r\n   * @param lowHigh optional receiver for output\r\n   * @returns range of fractional projection parameters onto the ray, where 0.0 is start of the ray and 1.0 is the\r\n   * end of the ray.\r\n   */\r\n  public projectedParameterRange(ray: Vector3d | Ray3d, lowHigh?: Range1d): Range1d | undefined {\r\n    return PlaneAltitudeRangeContext.findExtremeFractionsAlongDirection(this, ray, lowHigh);\r\n  }\r\n}\r\n\r\n/**\r\n * Shared base class for use by both open and closed paths.\r\n * * A `CurveChain` contains only CurvePrimitives. No other paths, loops, or regions allowed.\r\n * * The specific derived classes are `Path` and `Loop`\r\n * * `CurveChain` is an intermediate class. It is not instantiable on its own.\r\n * * The related class `CurveChainWithDistanceIndex` is a `CurvePrimitive` whose API presents well-defined mappings\r\n * from fraction to xyz over the entire chain, but in fact does all the calculations over multiple primitives.\r\n * @see [Curve Collections]($docs/learning/geometry/CurveCollection.md) learning article.\r\n * @public\r\n */\r\nexport abstract class CurveChain extends CurveCollection {\r\n  /** The curve primitives in the chain. */\r\n  protected _curves: CurvePrimitive[];\r\n  /** Constructor */\r\n  protected constructor() {\r\n    super();\r\n    this._curves = [];\r\n  }\r\n  /** Return the array of `CurvePrimitive` */\r\n  public override get children(): CurvePrimitive[] {\r\n    if (this._curves === undefined)\r\n      this._curves = [];\r\n    return this._curves;\r\n  }\r\n  /**\r\n   * Return the curve primitive at the given `index`, optionally using `modulo` to map `index` to the cyclic indexing.\r\n   * * In particular, `-1` is the final curve.\r\n   * @param index cyclic index\r\n   */\r\n  public cyclicCurvePrimitive(index: number, cyclic: boolean = true): CurvePrimitive | undefined {\r\n    const n = this.children.length;\r\n    if (n === 0)\r\n      return undefined;\r\n    if (index >= 0 && index < n) // try simplest non-cyclic access first\r\n      return this.children[index];\r\n    if (cyclic) {\r\n      const index2 = Geometry.modulo(index, n);\r\n      return this.children[index2];\r\n    }\r\n    return undefined;\r\n  }\r\n  /**\r\n   * Stroke the chain into a simple xyz array.\r\n   * @param options tolerance parameters controlling the stroking.\r\n   */\r\n  public getPackedStrokes(options?: StrokeOptions): GrowableXYZArray | undefined {\r\n    /**\r\n     * The object returned by \"cloneStroked\" has the same type (Loop or Path) but instead of a chain of\r\n     * CurvePrimitives as children, it has a single LineString3d child. \"getPackedStrokes\" just returns\r\n     * the points of that LineString3d using \"packedPoints\".\r\n     */\r\n    const tree = this.cloneStroked(options);\r\n    if (tree instanceof CurveChain) {\r\n      const children = tree.children;\r\n      if (children.length === 1) {\r\n        const ls = children[0];\r\n        if (ls instanceof LineString3d)\r\n          return ls.packedPoints;\r\n      }\r\n    }\r\n    return undefined;\r\n  }\r\n  /** Return a structural clone, with CurvePrimitive objects stroked. */\r\n  public abstract override cloneStroked(options?: StrokeOptions): AnyCurve;\r\n  /**\r\n   * Add a child curve.\r\n   * * Returns false if the given child is not a CurvePrimitive.\r\n   */\r\n  public tryAddChild(child: AnyCurve | undefined): boolean {\r\n    if (child && child instanceof CurvePrimitive) {\r\n      this._curves.push(child);\r\n      return true;\r\n    }\r\n    return false;\r\n  }\r\n  /** Return a child by index */\r\n  public getChild(i: number): CurvePrimitive | undefined {\r\n    if (i < this._curves.length) return this._curves[i];\r\n    return undefined;\r\n  }\r\n  /** Invoke `curve.extendRange(range, transform)` for each child  */\r\n  public override extendRange(range: Range3d, transform?: Transform): void {\r\n    for (const curve of this._curves)\r\n      curve.extendRange(range, transform);\r\n  }\r\n  /**\r\n   * Reverse each child curve (in place)\r\n   * Reverse the order of the children in the CurveChain array.\r\n   */\r\n  public reverseChildrenInPlace(): void {\r\n    for (const curve of this._curves)\r\n      curve.reverseInPlace();\r\n    this._curves.reverse();\r\n  }\r\n  /**\r\n   * Return the index where target is found in the array of children.\r\n   * @param alsoSearchProxies whether to also check proxy curves of the children\r\n   */\r\n  public childIndex(target: CurvePrimitive | undefined, alsoSearchProxies?: boolean): number | undefined {\r\n    for (let i = 0; i < this._curves.length; i++) {\r\n      if (this._curves[i] === target)\r\n        return i;\r\n    }\r\n    if (alsoSearchProxies ?? false) {\r\n      for (let i = 0; i < this._curves.length; i++) {\r\n        const childCurve = this._curves[i];\r\n        if (childCurve instanceof ProxyCurve) {\r\n          if (childCurve.proxyCurve === target)\r\n            return i;\r\n        }\r\n      }\r\n    }\r\n    return undefined;\r\n  }\r\n  /** Evaluate an indexed curve at a fraction. Return as a CurveLocationDetail that indicates the primitive. */\r\n  public primitiveIndexAndFractionToCurveLocationDetailPointAndDerivative(\r\n    index: number, fraction: number, cyclic: boolean = false, result?: CurveLocationDetail,\r\n  ): CurveLocationDetail | undefined {\r\n    const primitive = this.cyclicCurvePrimitive(index, cyclic);\r\n    if (primitive) {\r\n      return CurveLocationDetail.createCurveEvaluatedFractionPointAndDerivative(primitive, fraction, result);\r\n    }\r\n    return undefined;\r\n  }\r\n}\r\n\r\n/**\r\n * * A `BagOfCurves` object is a collection of `AnyCurve` objects.\r\n * * A `BagOfCurves` has no implied properties such as being planar.\r\n * @public\r\n */\r\nexport class BagOfCurves extends CurveCollection {\r\n  /** String name for schema properties */\r\n  public readonly curveCollectionType = \"bagOfCurves\";\r\n  /** Test if `other` is an instance of `BagOfCurves` */\r\n  public isSameGeometryClass(other: GeometryQuery): boolean {\r\n    return other instanceof BagOfCurves;\r\n  }\r\n  /**\r\n   * Array of children.\r\n   * * No restrictions on type.\r\n   */\r\n  protected _children: AnyCurve[];\r\n  /** Construct an empty `BagOfCurves` */\r\n  public constructor() {\r\n    super();\r\n    this._children = [];\r\n  }\r\n  /** Return the (reference to) array of children */\r\n  public override get children(): AnyCurve[] {\r\n    return this._children;\r\n  }\r\n  /** Create with given curves. */\r\n  public static create(...data: AnyCurve[]): BagOfCurves {\r\n    const result = new BagOfCurves();\r\n    for (const child of data) {\r\n      result.tryAddChild(child);\r\n    }\r\n    return result;\r\n  }\r\n  /** Return the boundary type (0) of a corresponding  MicroStation CurveVector */\r\n  public dgnBoundaryType(): number {\r\n    return 0;\r\n  }\r\n  /** Invoke `processor.announceBagOfCurves(this, indexInParent);` */\r\n  public announceToCurveProcessor(processor: RecursiveCurveProcessor, indexInParent: number = -1): void {\r\n    return processor.announceBagOfCurves(this, indexInParent);\r\n  }\r\n  /** Clone all children in stroked form. */\r\n  public cloneStroked(options?: StrokeOptions): BagOfCurves {\r\n    const clone = new BagOfCurves();\r\n    let child;\r\n    for (child of this.children) {\r\n      if (child instanceof CurvePrimitive) {\r\n        const ls = LineString3d.create();\r\n        child.emitStrokes(ls, options);\r\n        if (ls)\r\n          clone.children.push(ls);\r\n      } else if (child instanceof CurveCollection) {\r\n        const childStrokes = child.cloneStroked(options);\r\n        if (childStrokes)\r\n          clone.children.push(childStrokes);\r\n      }\r\n    }\r\n    return clone;\r\n  }\r\n  /** Return an empty `BagOfCurves` */\r\n  public cloneEmptyPeer(): BagOfCurves {\r\n    return new BagOfCurves();\r\n  }\r\n  /** Add a child  */\r\n  public tryAddChild(child: AnyCurve | undefined): boolean {\r\n    if (child)\r\n      this._children.push(child);\r\n    return true;\r\n  }\r\n  /** Get a child by index */\r\n  public getChild(i: number): AnyCurve | undefined {\r\n    if (i < this._children.length)\r\n      return this._children[i];\r\n    return undefined;\r\n  }\r\n  /** Second step of double dispatch:  call `handler.handleBagOfCurves(this)` */\r\n  public dispatchToGeometryHandler(handler: GeometryHandler): any {\r\n    return handler.handleBagOfCurves(this);\r\n  }\r\n}\r\n\r\n/**\r\n * * Options to control method `RegionOps.consolidateAdjacentPrimitives`\r\n * @public\r\n */\r\nexport class ConsolidateAdjacentCurvePrimitivesOptions {\r\n  /** True to consolidated linear geometry   (e.g. separate LineSegment3d and LineString3d) into LineString3d */\r\n  public consolidateLinearGeometry: boolean = true;\r\n  /** True to consolidate contiguous arcs */\r\n  public consolidateCompatibleArcs: boolean = true;\r\n  /** Tolerance for collapsing identical points */\r\n  public duplicatePointTolerance = Geometry.smallMetricDistance;\r\n  /** Tolerance for removing interior colinear points. */\r\n  public colinearPointTolerance = Geometry.smallMetricDistance;\r\n}\r\n"]}
+{"version":3,"file":"CurveCollection.js","sourceRoot":"","sources":["../../../src/curve/CurveCollection.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F;;GAEG;AACH,0CAAuC;AAOvC,+DAA4D;AAC5D,qDAAkD;AAGlD,mDAAgD;AAChD,8EAA2E;AAC3E,kGAA+F;AAC/F,oGAAiG;AACjG,0EAAuE;AACvE,4FAAyF;AACzF,4EAAyE;AACzE,wFAAqF;AACrF,iDAA8C;AAC9C,6CAA0C;AAoB1C;;;;;;;;;;;;;;GAcG;AACH,MAAsB,eAAgB,SAAQ,6BAAa;IAA3D;;QACE,wCAAwC;QACxB,qBAAgB,GAAG,iBAAiB,CAAC;QAGrD,mEAAmE;QACnE,uDAAuD;QAChD,YAAO,GAAY,KAAK,CAAC;IA0LlC,CAAC;IAzLC,6DAA6D;IACtD,UAAU;QACf,OAAO,qCAAiB,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;IAC5C,CAAC;IACD,uDAAuD;IAChD,YAAY,CAAC,UAAmB;QACrC,IAAI,OAAwC,CAAC;QAC7C,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS,EAAE;YAC/B,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE;gBACjC,IAAI,KAAK,YAAY,+BAAc,EAAE;oBACnC,MAAM,OAAO,GAAG,KAAK,CAAC,YAAY,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;oBACtD,OAAO,GAAG,yCAAmB,CAAC,cAAc,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;iBAChE;qBAAM,IAAI,KAAK,YAAY,eAAe,EAAE;oBAC3C,MAAM,OAAO,GAAG,KAAK,CAAC,YAAY,CAAC,UAAU,CAAC,CAAC;oBAC/C,OAAO,GAAG,yCAAmB,CAAC,cAAc,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;iBAChE;aACF;SACF;QACD,OAAO,OAAO,CAAC;IACjB,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;YACjB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE;gBACjC,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;aAC3F;SACF;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;;;OAGG;IACH,IAAW,UAAU;QACnB,OAAO,IAAI,CAAC,eAAe,EAAE,KAAK,CAAC,CAAC;IACtC,CAAC;IACD,0BAA0B;IACnB,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,0BAA0B;IACnB,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;YACZ,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE;gBACxB,CAAC,CAAC,WAAW,CAAC,aAAa,EAAE,SAAS,CAAC,CAAC;aACzC;SACF;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;YACpC,OAAO,yCAAmB,CAAC,4BAA4B,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;SAC3E;aAAM,IAAI,MAAM,YAAY,eAAe,IAAI,MAAM,CAAC,QAAQ,KAAK,SAAS;YAC3E,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,QAAQ,EAAE;gBACnC,MAAM,MAAM,GAAG,IAAI,CAAC,4CAA4C,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;gBAClF,IAAI,MAAM;oBACR,OAAO,MAAM,CAAC;aACjB;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;CACF;AAjMD,0CAiMC;AAED;;;;;;;;;GASG;AACH,MAAsB,UAAW,SAAQ,eAAe;IAGtD,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;;;;OAIG;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;YACV,MAAM,MAAM,GAAG,mBAAQ,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YACzC,OAAO,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;SAC9B;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;YAC9B,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;YAC/B,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE;gBACzB,MAAM,EAAE,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;gBACvB,IAAI,EAAE,YAAY,2BAAY;oBAC5B,OAAO,EAAE,CAAC,YAAY,CAAC;aAC1B;SACF;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAGD;;;OAGG;IACI,WAAW,CAAC,KAA2B;QAC5C,IAAI,KAAK,IAAI,KAAK,YAAY,+BAAc,EAAE;YAC5C,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACzB,OAAO,IAAI,CAAC;SACb;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;;;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;YAC5C,IAAI,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,MAAM;gBAC5B,OAAO,CAAC,CAAC;SACZ;QACD,IAAI,iBAAiB,IAAI,KAAK,EAAE;YAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gBAC5C,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;gBACnC,IAAI,UAAU,YAAY,uBAAU,EAAE;oBACpC,IAAI,UAAU,CAAC,UAAU,KAAK,MAAM;wBAClC,OAAO,CAAC,CAAC;iBACZ;aACF;SACF;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;YACb,OAAO,yCAAmB,CAAC,8CAA8C,CAAC,SAAS,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;SACxG;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;CACF;AAhHD,gCAgHC;AAED;;;;GAIG;AACH,MAAa,WAAY,SAAQ,eAAe;IAG9C,sDAAsD;IAC/C,mBAAmB,CAAC,KAAoB;QAC7C,OAAO,KAAK,YAAY,WAAW,CAAC;IACtC,CAAC;IAMD,uCAAuC;IACvC;QACE,KAAK,EAAE,CAAC;QAbV,wCAAwC;QACxB,wBAAmB,GAAG,aAAa,CAAC;QAalD,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;YACxB,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;SAC3B;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;YAC3B,IAAI,KAAK,YAAY,+BAAc,EAAE;gBACnC,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;aAC3B;iBAAM,IAAI,KAAK,YAAY,eAAe,EAAE;gBAC3C,MAAM,YAAY,GAAG,KAAK,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC;gBACjD,IAAI,YAAY;oBACd,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;aACrC;SACF;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,oCAAoC;IAC7B,cAAc;QACnB,OAAO,IAAI,WAAW,EAAE,CAAC;IAC3B,CAAC;IACD,mBAAmB;IACZ,WAAW,CAAC,KAA2B;QAC5C,IAAI,KAAK;YACP,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC7B,OAAO,IAAI,CAAC;IACd,CAAC;IACD,2BAA2B;IACpB,QAAQ,CAAC,CAAS;QACvB,IAAI,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM;YAC3B,OAAO,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QAC3B,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,8EAA8E;IACvE,yBAAyB,CAAC,OAAwB;QACvD,OAAO,OAAO,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC;IACzC,CAAC;CACF;AA3ED,kCA2EC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n\r\n/** @packageDocumentation\r\n * @module Curve\r\n */\r\nimport { Geometry } from \"../Geometry\";\r\nimport { GeometryHandler } from \"../geometry3d/GeometryHandler\";\r\nimport { GrowableXYZArray } from \"../geometry3d/GrowableXYZArray\";\r\nimport { Point3d, Vector3d } from \"../geometry3d/Point3dVector3d\";\r\nimport { Range1d, Range3d } from \"../geometry3d/Range\";\r\nimport { Ray3d } from \"../geometry3d/Ray3d\";\r\nimport { Transform } from \"../geometry3d/Transform\";\r\nimport { CurveLocationDetail } from \"./CurveLocationDetail\";\r\nimport { CurvePrimitive } from \"./CurvePrimitive\";\r\nimport { RecursiveCurveProcessor } from \"./CurveProcessor\";\r\nimport { AnyCurve, type AnyRegion } from \"./CurveTypes\";\r\nimport { GeometryQuery } from \"./GeometryQuery\";\r\nimport { CloneCurvesContext } from \"./internalContexts/CloneCurvesContext\";\r\nimport { CloneWithExpandedLineStrings } from \"./internalContexts/CloneWithExpandedLineStrings\";\r\nimport { CountLinearPartsSearchContext } from \"./internalContexts/CountLinearPartsSearchContext\";\r\nimport { GapSearchContext } from \"./internalContexts/GapSearchContext\";\r\nimport { PlaneAltitudeRangeContext } from \"./internalContexts/PlaneAltitudeRangeContext\";\r\nimport { SumLengthsContext } from \"./internalContexts/SumLengthsContext\";\r\nimport { TransformInPlaceContext } from \"./internalContexts/TransformInPlaceContext\";\r\nimport { LineString3d } from \"./LineString3d\";\r\nimport { ProxyCurve } from \"./ProxyCurve\";\r\nimport { StrokeOptions } from \"./StrokeOptions\";\r\n\r\nimport type { Path } from \"./Path\";\r\nimport type { Loop } from \"./Loop\";\r\n\r\n/** Note: CurveChain and BagOfCurves classes are located in this file to prevent circular dependency. */\r\n\r\n/**\r\n * Describes the concrete type of a [[CurveCollection]]. Each type name maps to a specific subclass and can be\r\n * used in conditional statements for type-switching.\r\n *    - \"loop\" => [[Loop]]\r\n *    - \"path\" => [[Path]]\r\n *    - \"unionRegion\" => [[UnionRegion]]\r\n *    - \"parityRegion\" => [[ParityRegion]]\r\n *    - \"bagOfCurves\" => [[BagOfCurves]]\r\n * @public\r\n */\r\nexport type CurveCollectionType = \"loop\" | \"path\" | \"unionRegion\" | \"parityRegion\" | \"bagOfCurves\";\r\n\r\n/**\r\n * A `CurveCollection` is an abstract (non-instantiable) class for various sets of curves with particular structures:\r\n * - `CurveChain` is a (non-instantiable) intermediate class for a sequence of `CurvePrimitive` joining head-to-tail.\r\n * The two instantiable forms of `CurveChain` are\r\n *   - `Path` - A chain not required to close and not enclosing a planar area (so curves do not have to be on the\r\n * same plane).\r\n *   - `Loop` - A chain required to close from last to first so that a planar area is enclosed (so curves have to\r\n * be on the same plane).\r\n * - `ParityRegion` -- a collection of coplanar `Loop`, with \"in/out\" classification by parity rules.\r\n * - `UnionRegion` -- a collection of coplanar `Loop` and/or `ParityRegion`, with \"in/out\" classification by union rules.\r\n * - `BagOfCurves` -- a collection of `AnyCurve` with no implied structure.\r\n *\r\n * @see [Curve Collections]($docs/learning/geometry/CurveCollection.md) learning article.\r\n * @public\r\n */\r\nexport abstract class CurveCollection extends GeometryQuery {\r\n  /** String name for schema properties */\r\n  public readonly geometryCategory = \"curveCollection\";\r\n  /** Type discriminator. */\r\n  public abstract readonly curveCollectionType: CurveCollectionType;\r\n  /* eslint-disable @typescript-eslint/naming-convention, no-empty */\r\n  /** Flag for inner loop status. Only used by `Loop`. */\r\n  public isInner: boolean = false;\r\n  /** Return the sum of the lengths of all contained curves. */\r\n  public sumLengths(): number {\r\n    return SumLengthsContext.sumLengths(this);\r\n  }\r\n  /** Return the closest point on the contained curves */\r\n  public closestPoint(spacePoint: Point3d): CurveLocationDetail | undefined {\r\n    let detailA: CurveLocationDetail | undefined;\r\n    if (this.children !== undefined) {\r\n      for (const child of this.children) {\r\n        if (child instanceof CurvePrimitive) {\r\n          const detailB = child.closestPoint(spacePoint, false);\r\n          detailA = CurveLocationDetail.chooseSmallerA(detailA, detailB);\r\n        } else if (child instanceof CurveCollection) {\r\n          const detailB = child.closestPoint(spacePoint);\r\n          detailA = CurveLocationDetail.chooseSmallerA(detailA, detailB);\r\n        }\r\n      }\r\n    }\r\n    return detailA;\r\n  }\r\n  /**\r\n   * Return the max gap between adjacent primitives in Path and Loop collections.\r\n   * * In a Path, gaps are computed between consecutive primitives.\r\n   * * In a Loop, gaps are computed between consecutive primitives and between last and first.\r\n   * * Gaps are NOT computed between consecutive CurvePrimitives in \"unstructured\" collections. The type is\r\n   * \"unstructured\" so gaps should not be semantically meaningful.\r\n   */\r\n  public maxGap(): number {\r\n    return GapSearchContext.maxGap(this);\r\n  }\r\n  /** Return true if the curve collection has any primitives other than LineSegment3d and LineString3d  */\r\n  public checkForNonLinearPrimitives(): boolean {\r\n    return CountLinearPartsSearchContext.hasNonLinearPrimitives(this);\r\n  }\r\n  /** Apply transform recursively to children */\r\n  public tryTransformInPlace(transform: Transform): boolean {\r\n    return TransformInPlaceContext.tryTransformInPlace(this, transform);\r\n  }\r\n  /** Return a deep copy. */\r\n  public override clone(): CurveCollection {\r\n    return CloneCurvesContext.clone(this) as CurveCollection;\r\n  }\r\n  /** Create a deep copy of transformed curves. */\r\n  public override cloneTransformed(transform: Transform): CurveCollection | undefined {\r\n    return CloneCurvesContext.clone(this, transform);\r\n  }\r\n  /** Create a deep copy with all linestrings broken down into multiple LineSegment3d. */\r\n  public cloneWithExpandedLineStrings(): CurveCollection {\r\n    return CloneWithExpandedLineStrings.clone(this);\r\n  }\r\n  /**\r\n   * Push all CurvePrimitives contained in the instance onto the `results` array.\r\n   * * This method is recursive. For example, if the CurveCollection contains a Loop, all CurvePrimitives\r\n   * of the Loop are pushed onto `results`.\r\n   */\r\n  private collectCurvePrimitivesGo(\r\n    results: CurvePrimitive[], smallestPossiblePrimitives: boolean, explodeLinestrings: boolean = false,\r\n  ): void {\r\n    if (this.children) {\r\n      for (const child of this.children) {\r\n        if (child instanceof CurvePrimitive)\r\n          child.collectCurvePrimitivesGo(results, smallestPossiblePrimitives, explodeLinestrings);\r\n        else if (child instanceof CurveCollection)\r\n          child.collectCurvePrimitivesGo(results, smallestPossiblePrimitives, explodeLinestrings);\r\n      }\r\n    }\r\n  }\r\n  /**\r\n   * Return an array containing all CurvePrimitives in the instance.\r\n   * * This method is recursive. For example, if the CurveCollection contains a Loop, all CurvePrimitives of\r\n   * the Loop are pushed onto the returned array.\r\n   * @param collectorArray optional array to receive primitives. If present, new primitives are ADDED (without\r\n   * clearing the array).\r\n   * @param smallestPossiblePrimitives if false, CurvePrimitiveWithDistanceIndex returns only itself. If true,\r\n   * it recurses to its (otherwise hidden) children.\r\n   */\r\n  public collectCurvePrimitives(\r\n    collectorArray?: CurvePrimitive[], smallestPossiblePrimitives: boolean = false, explodeLineStrings: boolean = false,\r\n  ): CurvePrimitive[] {\r\n    const results: CurvePrimitive[] = collectorArray === undefined ? [] : collectorArray;\r\n    this.collectCurvePrimitivesGo(results, smallestPossiblePrimitives, explodeLineStrings);\r\n    return results;\r\n  }\r\n  /**\r\n   * Return true for planar region types:\r\n   * * `Loop`\r\n   * * `ParityRegion`\r\n   * * `UnionRegion`\r\n   * @see isAnyRegion\r\n   */\r\n  public get isAnyRegionType(): boolean {\r\n    return this.dgnBoundaryType() === 2 || this.dgnBoundaryType() === 4 || this.dgnBoundaryType() === 5;\r\n  }\r\n  /** Type guard for AnyRegion */\r\n  public isAnyRegion(): this is AnyRegion {\r\n    return this.isAnyRegionType;\r\n  }\r\n  /**\r\n   * Return true for a `Path`, i.e. a chain of curves joined head-to-tail\r\n   * @see isPath\r\n   */\r\n  public get isOpenPath(): boolean {\r\n    return this.dgnBoundaryType() === 1;\r\n  }\r\n  /** Type guard for Path */\r\n  public isPath(): this is Path {\r\n    return this.isOpenPath;\r\n  }\r\n  /**\r\n   * Return true for a single-loop planar region type, i.e. `Loop`.\r\n   * * This is NOT a test for physical closure of a `Path`.\r\n   * @see isLoop\r\n   */\r\n  public get isClosedPath(): boolean {\r\n    return this.dgnBoundaryType() === 2;\r\n  }\r\n  /** Type guard for Loop */\r\n  public isLoop(): this is Loop {\r\n    return this.isClosedPath;\r\n  }\r\n\r\n  /** Return a CurveCollection with the same structure but all curves replaced by strokes. */\r\n  public abstract cloneStroked(options?: StrokeOptions): CurveCollection;\r\n  /** Support method for ICurvePrimitive ... one line call to specific announce method . . */\r\n  public abstract announceToCurveProcessor(processor: RecursiveCurveProcessor): void;\r\n  /** Clone an empty collection. */\r\n  public abstract cloneEmptyPeer(): CurveCollection;\r\n  /**\r\n   * Return the boundary type of a corresponding MicroStation CurveVector.\r\n   * * Derived class must implement.\r\n   */\r\n  public abstract dgnBoundaryType(): number;\r\n  /**\r\n   * Try to add a child.\r\n   * @param child child to add.\r\n   * @return true if child is an acceptable type for this collection.\r\n   */\r\n  public abstract tryAddChild(child: AnyCurve | undefined): boolean;\r\n  /** Return a child identified by by index */\r\n  public abstract getChild(i: number): AnyCurve | undefined;\r\n  /**\r\n   * Extend (increase) the given range as needed to encompass all curves in the curve collection.\r\n   * @param rangeToExtend the given range.\r\n   * @param transform if supplied, the range is extended with transformed curves.\r\n   */\r\n  public extendRange(rangeToExtend: Range3d, transform?: Transform): void {\r\n    const children = this.children;\r\n    if (children) {\r\n      for (const c of children) {\r\n        c.extendRange(rangeToExtend, transform);\r\n      }\r\n    }\r\n  }\r\n  /**\r\n   * Find any CurvePrimitive in the source and evaluate it at the given fraction.\r\n   * * The first CurvePrimitive found is evaluated. Any other CurvePrimitives are ignored.\r\n   * @param source containing `CurvePrimitive` or `CurveCollection`\r\n   * @param fraction fraction to use in `curve.fractionToPoint(fraction)`\r\n   */\r\n  public static createCurveLocationDetailOnAnyCurvePrimitive(\r\n    source: GeometryQuery | undefined, fraction: number = 0.5,\r\n  ): CurveLocationDetail | undefined {\r\n    if (!source)\r\n      return undefined;\r\n    if (source instanceof CurvePrimitive) {\r\n      return CurveLocationDetail.createCurveEvaluatedFraction(source, fraction);\r\n    } else if (source instanceof CurveCollection && source.children !== undefined)\r\n      for (const child of source.children) {\r\n        const detail = this.createCurveLocationDetailOnAnyCurvePrimitive(child, fraction);\r\n        if (detail)\r\n          return detail;\r\n      }\r\n    return undefined;\r\n  }\r\n  /**\r\n   * Project instance geometry (via dispatch) onto the given ray, and return the extreme fractional parameters\r\n   * of projection.\r\n   * @param ray ray onto which the instance is projected. A `Vector3d` is treated as a `Ray3d` with zero origin.\r\n   * @param lowHigh optional receiver for output\r\n   * @returns range of fractional projection parameters onto the ray, where 0.0 is start of the ray and 1.0 is the\r\n   * end of the ray.\r\n   */\r\n  public projectedParameterRange(ray: Vector3d | Ray3d, lowHigh?: Range1d): Range1d | undefined {\r\n    return PlaneAltitudeRangeContext.findExtremeFractionsAlongDirection(this, ray, lowHigh);\r\n  }\r\n}\r\n\r\n/**\r\n * Shared base class for use by both open and closed paths.\r\n * * A `CurveChain` contains only CurvePrimitives. No other paths, loops, or regions allowed.\r\n * * The specific derived classes are `Path` and `Loop`.\r\n * * `CurveChain` is an intermediate class. It is not instantiable on its own.\r\n * * The related class `CurveChainWithDistanceIndex` is a `CurvePrimitive` whose API presents well-defined mappings\r\n * from fraction to xyz over the entire chain, but in fact does all the calculations over multiple primitives.\r\n * @see [Curve Collections]($docs/learning/geometry/CurveCollection.md) learning article.\r\n * @public\r\n */\r\nexport abstract class CurveChain extends CurveCollection {\r\n  /** The curve primitives in the chain. */\r\n  protected _curves: CurvePrimitive[];\r\n  /** Constructor */\r\n  protected constructor() {\r\n    super();\r\n    this._curves = [];\r\n  }\r\n  /** Return the array of `CurvePrimitive` */\r\n  public override get children(): CurvePrimitive[] {\r\n    return this._curves;\r\n  }\r\n  /**\r\n   * Return the curve primitive at the given `index`, optionally using `modulo` to map `index` to the cyclic indexing.\r\n   * * In particular, `-1` is the final curve.\r\n   * @param index cyclic index\r\n   */\r\n  public cyclicCurvePrimitive(index: number, cyclic: boolean = true): CurvePrimitive | undefined {\r\n    const n = this.children.length;\r\n    if (n === 0)\r\n      return undefined;\r\n    if (index >= 0 && index < n) // try simplest non-cyclic access first\r\n      return this.children[index];\r\n    if (cyclic) {\r\n      const index2 = Geometry.modulo(index, n);\r\n      return this.children[index2];\r\n    }\r\n    return undefined;\r\n  }\r\n  /**\r\n   * Stroke the chain into a simple xyz array.\r\n   * @param options tolerance parameters controlling the stroking.\r\n   */\r\n  public getPackedStrokes(options?: StrokeOptions): GrowableXYZArray | undefined {\r\n    /**\r\n     * The object returned by \"cloneStroked\" has the same type (Loop or Path) but instead of a chain of\r\n     * CurvePrimitives as children, it has a single LineString3d child. \"getPackedStrokes\" just returns\r\n     * the points of that LineString3d using \"packedPoints\".\r\n     */\r\n    const tree = this.cloneStroked(options);\r\n    if (tree instanceof CurveChain) {\r\n      const children = tree.children;\r\n      if (children.length === 1) {\r\n        const ls = children[0];\r\n        if (ls instanceof LineString3d)\r\n          return ls.packedPoints;\r\n      }\r\n    }\r\n    return undefined;\r\n  }\r\n  /** Return a structural clone, with CurvePrimitive objects stroked. */\r\n  public abstract override cloneStroked(options?: StrokeOptions): CurveChain;\r\n  /**\r\n   * Add a child curve.\r\n   * * Returns false if the given child is not a CurvePrimitive.\r\n   */\r\n  public tryAddChild(child: AnyCurve | undefined): boolean {\r\n    if (child && child instanceof CurvePrimitive) {\r\n      this._curves.push(child);\r\n      return true;\r\n    }\r\n    return false;\r\n  }\r\n  /** Return a child by index */\r\n  public getChild(i: number): CurvePrimitive | undefined {\r\n    if (i < this._curves.length) return this._curves[i];\r\n    return undefined;\r\n  }\r\n  /** Invoke `curve.extendRange(range, transform)` for each child  */\r\n  public override extendRange(range: Range3d, transform?: Transform): void {\r\n    for (const curve of this._curves)\r\n      curve.extendRange(range, transform);\r\n  }\r\n  /**\r\n   * Reverse each child curve (in place)\r\n   * Reverse the order of the children in the CurveChain array.\r\n   */\r\n  public reverseChildrenInPlace(): void {\r\n    for (const curve of this._curves)\r\n      curve.reverseInPlace();\r\n    this._curves.reverse();\r\n  }\r\n  /**\r\n   * Return the index where target is found in the array of children.\r\n   * @param alsoSearchProxies whether to also check proxy curves of the children\r\n   */\r\n  public childIndex(target: CurvePrimitive | undefined, alsoSearchProxies?: boolean): number | undefined {\r\n    for (let i = 0; i < this._curves.length; i++) {\r\n      if (this._curves[i] === target)\r\n        return i;\r\n    }\r\n    if (alsoSearchProxies ?? false) {\r\n      for (let i = 0; i < this._curves.length; i++) {\r\n        const childCurve = this._curves[i];\r\n        if (childCurve instanceof ProxyCurve) {\r\n          if (childCurve.proxyCurve === target)\r\n            return i;\r\n        }\r\n      }\r\n    }\r\n    return undefined;\r\n  }\r\n  /** Evaluate an indexed curve at a fraction. Return as a CurveLocationDetail that indicates the primitive. */\r\n  public primitiveIndexAndFractionToCurveLocationDetailPointAndDerivative(\r\n    index: number, fraction: number, cyclic: boolean = false, result?: CurveLocationDetail,\r\n  ): CurveLocationDetail | undefined {\r\n    const primitive = this.cyclicCurvePrimitive(index, cyclic);\r\n    if (primitive) {\r\n      return CurveLocationDetail.createCurveEvaluatedFractionPointAndDerivative(primitive, fraction, result);\r\n    }\r\n    return undefined;\r\n  }\r\n}\r\n\r\n/**\r\n * * A `BagOfCurves` object is a collection of `AnyCurve` objects.\r\n * * A `BagOfCurves` has no implied properties such as being planar.\r\n * @public\r\n */\r\nexport class BagOfCurves extends CurveCollection {\r\n  /** String name for schema properties */\r\n  public readonly curveCollectionType = \"bagOfCurves\";\r\n  /** Test if `other` is an instance of `BagOfCurves` */\r\n  public isSameGeometryClass(other: GeometryQuery): boolean {\r\n    return other instanceof BagOfCurves;\r\n  }\r\n  /**\r\n   * Array of children.\r\n   * * No restrictions on type.\r\n   */\r\n  protected _children: AnyCurve[];\r\n  /** Construct an empty `BagOfCurves` */\r\n  public constructor() {\r\n    super();\r\n    this._children = [];\r\n  }\r\n  /** Return the (reference to) array of children */\r\n  public override get children(): AnyCurve[] {\r\n    return this._children;\r\n  }\r\n  /** Create with given curves. */\r\n  public static create(...data: AnyCurve[]): BagOfCurves {\r\n    const result = new BagOfCurves();\r\n    for (const child of data) {\r\n      result.tryAddChild(child);\r\n    }\r\n    return result;\r\n  }\r\n  /** Return the boundary type (0) of a corresponding  MicroStation CurveVector */\r\n  public dgnBoundaryType(): number {\r\n    return 0;\r\n  }\r\n  /** Invoke `processor.announceBagOfCurves(this, indexInParent);` */\r\n  public announceToCurveProcessor(processor: RecursiveCurveProcessor, indexInParent: number = -1): void {\r\n    return processor.announceBagOfCurves(this, indexInParent);\r\n  }\r\n  /** Clone all children in stroked form. */\r\n  public cloneStroked(options?: StrokeOptions): BagOfCurves {\r\n    const clone = new BagOfCurves();\r\n    let child;\r\n    for (child of this.children) {\r\n      if (child instanceof CurvePrimitive) {\r\n        const ls = LineString3d.create();\r\n        child.emitStrokes(ls, options);\r\n        if (ls)\r\n          clone.children.push(ls);\r\n      } else if (child instanceof CurveCollection) {\r\n        const childStrokes = child.cloneStroked(options);\r\n        if (childStrokes)\r\n          clone.children.push(childStrokes);\r\n      }\r\n    }\r\n    return clone;\r\n  }\r\n  /** Return an empty `BagOfCurves` */\r\n  public cloneEmptyPeer(): BagOfCurves {\r\n    return new BagOfCurves();\r\n  }\r\n  /** Add a child  */\r\n  public tryAddChild(child: AnyCurve | undefined): boolean {\r\n    if (child)\r\n      this._children.push(child);\r\n    return true;\r\n  }\r\n  /** Get a child by index */\r\n  public getChild(i: number): AnyCurve | undefined {\r\n    if (i < this._children.length)\r\n      return this._children[i];\r\n    return undefined;\r\n  }\r\n  /** Second step of double dispatch:  call `handler.handleBagOfCurves(this)` */\r\n  public dispatchToGeometryHandler(handler: GeometryHandler): any {\r\n    return handler.handleBagOfCurves(this);\r\n  }\r\n}\r\n"]}