npm - @itwin/core-geometry - Versions diffs - 5.0.0-dev.9 → 5.0.0-dev.92 - Mend

@itwin/core-geometry 5.0.0-dev.9 → 5.0.0-dev.92

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (1004) hide show

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

	@@ -1 +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;AAGlD,mDAAgD;AAChD,8EAA2E;AAC3E,kGAA+F;AAC/F,oGAAiG;AACjG,0EAAuE;AACvE,4FAAyF;AACzF,4EAAyE;AACzE,wFAAqF;AACrF,iDAA8C;AAC9C,6CAA0C;AAoB1C;;;;;;;;;;;;GAYG;AACH,MAAsB,eAAgB,SAAQ,6BAAa;IAA3D;;QACE,wCAAwC;QACxB,qBAAgB,GAAG,iBAAiB,CAAC;QAGrD,uDAAuD;QAChD,YAAO,GAAY,KAAK,CAAC;IAqMlC,CAAC;IAlMC,6DAA6D;IACtD,UAAU;QACf,OAAO,qCAAiB,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;IAC5C,CAAC;IACD;;;;;;OAMG;IACI,YAAY,CACjB,UAAmB,EAAE,UAAuC,KAAK,EAAE,MAA4B;QAE/F,IAAI,OAAwC,CAAC;QAC7C,MAAM,OAAO,GAAG,IAAI,yCAAmB,EAAE,CAAC;QAC1C,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;YAChC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAClC,IAAI,KAAK,CAAC,YAAY,CAAC,UAAU,EAAE,KAAK,EAAE,OAAO,CAAC;oBAChD,OAAO,GAAG,MAAM,GAAG,yCAAmB,CAAC,cAAc,CAAC,OAAO,EAAE,OAAO,CAAE,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;YAC3F,CAAC;QACH,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IACD,oHAAoH;IAC7G,cAAc;QACnB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ;YAC/B,KAAK,CAAC,cAAc,EAAE,CAAC;IAC3B,CAAC;IACD;;;;;;OAMG;IACI,MAAM;QACX,OAAO,mCAAgB,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACvC,CAAC;IACD,wGAAwG;IACjG,2BAA2B;QAChC,OAAO,6DAA6B,CAAC,sBAAsB,CAAC,IAAI,CAAC,CAAC;IACpE,CAAC;IACD,8CAA8C;IACvC,mBAAmB,CAAC,SAAoB;QAC7C,OAAO,iDAAuB,CAAC,mBAAmB,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;IACtE,CAAC;IACD,0BAA0B;IACV,KAAK;QACnB,OAAO,uCAAkB,CAAC,KAAK,CAAC,IAAI,CAAoB,CAAC;IAC3D,CAAC;IACD,gDAAgD;IAChC,gBAAgB,CAAC,SAAoB;QACnD,OAAO,uCAAkB,CAAC,KAAK,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;IACnD,CAAC;IACD,uFAAuF;IAChF,4BAA4B;QACjC,OAAO,2DAA4B,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAClD,CAAC;IACD;;;;OAIG;IACK,wBAAwB,CAC9B,OAAyB,EAAE,0BAAmC,EAAE,qBAA8B,KAAK;QAEnG,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAClB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAClC,IAAI,KAAK,YAAY,+BAAc;oBACjC,KAAK,CAAC,wBAAwB,CAAC,OAAO,EAAE,0BAA0B,EAAE,kBAAkB,CAAC,CAAC;qBACrF,IAAI,KAAK,YAAY,eAAe;oBACvC,KAAK,CAAC,wBAAwB,CAAC,OAAO,EAAE,0BAA0B,EAAE,kBAAkB,CAAC,CAAC;YAC5F,CAAC;QACH,CAAC;IACH,CAAC;IACD;;;;;;;;OAQG;IACI,sBAAsB,CAC3B,cAAiC,EAAE,6BAAsC,KAAK,EAAE,qBAA8B,KAAK;QAEnH,MAAM,OAAO,GAAqB,cAAc,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,cAAc,CAAC;QACrF,IAAI,CAAC,wBAAwB,CAAC,OAAO,EAAE,0BAA0B,EAAE,kBAAkB,CAAC,CAAC;QACvF,OAAO,OAAO,CAAC;IACjB,CAAC;IACD;;;;;;OAMG;IACH,IAAW,eAAe;QACxB,OAAO,IAAI,CAAC,eAAe,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,eAAe,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,eAAe,EAAE,KAAK,CAAC,CAAC;IACtG,CAAC;IACD,+BAA+B;IACxB,WAAW;QAChB,OAAO,IAAI,CAAC,eAAe,CAAC;IAC9B,CAAC;IACD;;;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,CAAC;YACb,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;gBACzB,CAAC,CAAC,WAAW,CAAC,aAAa,EAAE,SAAS,CAAC,CAAC;YAC1C,CAAC;QACH,CAAC;IACH,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,4CAA4C,CACxD,MAAiC,EAAE,WAAmB,GAAG;QAEzD,IAAI,CAAC,MAAM;YACT,OAAO,SAAS,CAAC;QACnB,IAAI,MAAM,YAAY,+BAAc,EAAE,CAAC;YACrC,OAAO,yCAAmB,CAAC,4BAA4B,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;QAC5E,CAAC;aAAM,IAAI,MAAM,YAAY,eAAe,IAAI,MAAM,CAAC,QAAQ,KAAK,SAAS;YAC3E,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC;gBACpC,MAAM,MAAM,GAAG,IAAI,CAAC,4CAA4C,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;gBAClF,IAAI,MAAM;oBACR,OAAO,MAAM,CAAC;YAClB,CAAC;QACH,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;;OAOG;IACI,uBAAuB,CAAC,GAAqB,EAAE,OAAiB;QACrE,OAAO,qDAAyB,CAAC,kCAAkC,CAAC,IAAI,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;IAC1F,CAAC;CACF;AA3MD,0CA2MC;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,kFAAkF;IAC3E,UAAU,CAAC,MAAgB;QAChC,MAAM,UAAU,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACpC,IAAI,UAAU;YACZ,OAAO,UAAU,CAAC,eAAe,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;;YAE/C,OAAO,SAAS,CAAC;IACrB,CAAC;IACD,6EAA6E;IACtE,QAAQ,CAAC,MAAgB;QAC9B,MAAM,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACzD,IAAI,SAAS;YACX,OAAO,SAAS,CAAC,eAAe,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;;YAE9C,OAAO,SAAS,CAAC;IACrB,CAAC;IACD;;;;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,CAAC;YACX,MAAM,MAAM,GAAG,mBAAQ,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YACzC,OAAO,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QAC/B,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;OAGG;IACI,gBAAgB,CAAC,OAAuB;QAC7C;;;;WAIG;QACH,MAAM,IAAI,GAAG,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC;QACxC,IAAI,IAAI,YAAY,UAAU,EAAE,CAAC;YAC/B,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;YAC/B,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBAC1B,MAAM,EAAE,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;gBACvB,IAAI,EAAE,YAAY,2BAAY;oBAC5B,OAAO,EAAE,CAAC,YAAY,CAAC;YAC3B,CAAC;QACH,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAGD;;;;OAIG;IACI,WAAW,CAAC,KAA2B;QAC5C,IAAI,KAAK,IAAI,KAAK,YAAY,+BAAc,EAAE,CAAC;YAC7C,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACzB,OAAO,IAAI,CAAC;QACd,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,8BAA8B;IACvB,QAAQ,CAAC,CAAS;QACvB,IAAI,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM;YAAE,OAAO,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QACpD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,mEAAmE;IACnD,WAAW,CAAC,KAAc,EAAE,SAAqB;QAC/D,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO;YAC9B,KAAK,CAAC,WAAW,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;IACxC,CAAC;IACD;;;OAGG;IACI,sBAAsB;QAC3B,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO;YAC9B,KAAK,CAAC,cAAc,EAAE,CAAC;QACzB,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,CAAC;IACzB,CAAC;IACD,0CAA0C;IAC1B,cAAc;QAC5B,IAAI,CAAC,sBAAsB,EAAE,CAAC;IAChC,CAAC;IACD;;;OAGG;IACI,UAAU,CAAC,MAAkC,EAAE,iBAA2B;QAC/E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7C,IAAI,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,MAAM;gBAC5B,OAAO,CAAC,CAAC;QACb,CAAC;QACD,IAAI,iBAAiB,IAAI,KAAK,EAAE,CAAC;YAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC7C,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;gBACnC,IAAI,UAAU,YAAY,uBAAU,EAAE,CAAC;oBACrC,IAAI,UAAU,CAAC,UAAU,KAAK,MAAM;wBAClC,OAAO,CAAC,CAAC;gBACb,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,6GAA6G;IACtG,gEAAgE,CACrE,KAAa,EAAE,QAAgB,EAAE,SAAkB,KAAK,EAAE,MAA4B;QAEtF,MAAM,SAAS,GAAG,IAAI,CAAC,oBAAoB,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QAC3D,IAAI,SAAS,EAAE,CAAC;YACd,OAAO,yCAAmB,CAAC,8CAA8C,CAAC,SAAS,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;QACzG,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;CACF;AArID,gCAqIC;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,CAAC;YACzB,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;QAC5B,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,gFAAgF;IACzE,eAAe;QACpB,OAAO,CAAC,CAAC;IACX,CAAC;IACD,mEAAmE;IAC5D,wBAAwB,CAAC,SAAkC,EAAE,gBAAwB,CAAC,CAAC;QAC5F,OAAO,SAAS,CAAC,mBAAmB,CAAC,IAAI,EAAE,aAAa,CAAC,CAAC;IAC5D,CAAC;IACD,0CAA0C;IACnC,YAAY,CAAC,OAAuB;QACzC,MAAM,KAAK,GAAG,IAAI,WAAW,EAAE,CAAC;QAChC,IAAI,KAAK,CAAC;QACV,KAAK,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAC5B,IAAI,KAAK,YAAY,+BAAc,EAAE,CAAC;gBACpC,MAAM,EAAE,GAAG,2BAAY,CAAC,MAAM,EAAE,CAAC;gBACjC,KAAK,CAAC,WAAW,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;gBAC/B,IAAI,EAAE;oBACJ,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAC5B,CAAC;iBAAM,IAAI,KAAK,YAAY,eAAe,EAAE,CAAC;gBAC5C,MAAM,YAAY,GAAG,KAAK,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC;gBACjD,IAAI,YAAY;oBACd,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;YACtC,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;;OAMG;IACa,YAAY,CAC1B,UAAmB,EAAE,SAAsC,KAAK,EAAE,MAA4B;QAE9F,IAAI,OAAwC,CAAC;QAC7C,MAAM,OAAO,GAAG,IAAI,yCAAmB,EAAE,CAAC;QAC1C,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;YAChC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAClC,IAAI,KAAK,CAAC,YAAY,CAAC,UAAU,EAAE,MAAM,EAAE,OAAO,CAAC;oBACjD,OAAO,GAAG,MAAM,GAAG,yCAAmB,CAAC,cAAc,CAAC,OAAO,EAAE,OAAO,CAAE,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;YAC3F,CAAC;QACH,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,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;AA/FD,kCA+FC","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 { VariantCurveExtendParameter } from \"./CurveExtendMode\";\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]] - a non-instantiable intermediate class for a sequence of [[CurvePrimitive]] joining head-to-tail.\r\n * The two instantiable forms of `CurveChain` are:\r\n * - [[Path]] - a chain of curves. Does not have to be closed or planar. A closed `Path` is not treated as bounding a surface.\r\n * - [[Loop]] - a closed and planar chain of curves. A `Loop` is treated as bounding a planar area.\r\n * - [[ParityRegion]] - a collection of coplanar `Loop`, with \"in/out\" classification by parity rules.\r\n * - [[UnionRegion]] - a collection of coplanar `Loop` and/or `ParityRegion`, with \"in/out\" classification by union rules.\r\n * - [[BagOfCurves]] - a collection of [[AnyCurve]] with no implied structure.\r\n \r\n @see [Curve Collections]($docs/learning/geometry/CurveCollection.md) learning article.\r\n * @public\r\n /\r\nexport abstract class CurveCollection extends GeometryQuery {\r\n /* String name for schema properties /\r\n public readonly geometryCategory = \"curveCollection\";\r\n /* Type discriminator. /\r\n public abstract readonly curveCollectionType: CurveCollectionType;\r\n /* Flag for inner loop status. Only used by `Loop`. /\r\n public isInner: boolean = false;\r\n /* Return the curve children. /\r\n public abstract override get children(): AnyCurve[];\r\n /* Return the sum of the lengths of all contained curves. /\r\n public sumLengths(): number {\r\n return SumLengthsContext.sumLengths(this);\r\n }\r\n /\r\n Return the closest point on the contained curves.\r\n * @param spacePoint point in space.\r\n * @param _extend unused here (pass false), but applicable to overrides in [[Path]] and [[BagOfCurves]].\r\n * @param result optional pre-allocated detail to populate and return.\r\n * @returns details of the closest point.\r\n /\r\n public closestPoint(\r\n spacePoint: Point3d, _extend: VariantCurveExtendParameter = false, result?: CurveLocationDetail,\r\n ): CurveLocationDetail \| undefined {\r\n let detailA: CurveLocationDetail \| undefined;\r\n const detailB = new CurveLocationDetail();\r\n if (this.children !== undefined) {\r\n for (const child of this.children) {\r\n if (child.closestPoint(spacePoint, false, detailB))\r\n detailA = result = CurveLocationDetail.chooseSmallerA(detailA, detailB)!.clone(result);\r\n }\r\n }\r\n return detailA;\r\n }\r\n /* Reverse the collection's data so that each child curve's fractional stroking moves in the opposite direction. /\r\n public reverseInPlace(): void {\r\n for (const curve of this.children)\r\n curve.reverseInPlace();\r\n }\r\n /\r\n Return the max gap between adjacent primitives in Path and Loop collections.\r\n * * In a Path, gaps are computed between consecutive primitives.\r\n * * In a Loop, gaps are computed between consecutive primitives and between last and first.\r\n * * Gaps are NOT computed between consecutive CurvePrimitives in \"unstructured\" collections. The type is\r\n * \"unstructured\" so gaps should not be semantically meaningful.\r\n /\r\n public maxGap(): number {\r\n return GapSearchContext.maxGap(this);\r\n }\r\n /* Return true if the curve collection has any primitives other than LineSegment3d and LineString3d /\r\n public checkForNonLinearPrimitives(): boolean {\r\n return CountLinearPartsSearchContext.hasNonLinearPrimitives(this);\r\n }\r\n /* Apply transform recursively to children /\r\n public tryTransformInPlace(transform: Transform): boolean {\r\n return TransformInPlaceContext.tryTransformInPlace(this, transform);\r\n }\r\n /* Return a deep copy. /\r\n public override clone(): CurveCollection {\r\n return CloneCurvesContext.clone(this) as CurveCollection;\r\n }\r\n /* Create a deep copy of transformed curves. /\r\n public override cloneTransformed(transform: Transform): CurveCollection \| undefined {\r\n return CloneCurvesContext.clone(this, transform);\r\n }\r\n /* Create a deep copy with all linestrings broken down into multiple LineSegment3d. /\r\n public cloneWithExpandedLineStrings(): CurveCollection {\r\n return CloneWithExpandedLineStrings.clone(this);\r\n }\r\n /\r\n Push all CurvePrimitives contained in the instance onto the `results` array.\r\n * * This method is recursive. For example, if the CurveCollection contains a Loop, all CurvePrimitives\r\n * of the Loop are pushed onto `results`.\r\n /\r\n private collectCurvePrimitivesGo(\r\n results: CurvePrimitive[], smallestPossiblePrimitives: boolean, explodeLinestrings: boolean = false,\r\n ): void {\r\n if (this.children) {\r\n for (const child of this.children) {\r\n if (child instanceof CurvePrimitive)\r\n child.collectCurvePrimitivesGo(results, smallestPossiblePrimitives, explodeLinestrings);\r\n else if (child instanceof CurveCollection)\r\n child.collectCurvePrimitivesGo(results, smallestPossiblePrimitives, explodeLinestrings);\r\n }\r\n }\r\n }\r\n /\r\n Return an array containing all CurvePrimitives in the instance.\r\n * * This method is recursive. For example, if the CurveCollection contains a Loop, all CurvePrimitives of\r\n * the Loop are pushed onto the returned array.\r\n * @param collectorArray optional array to receive primitives. If present, new primitives are ADDED (without\r\n * clearing the array).\r\n * @param smallestPossiblePrimitives if false, CurvePrimitiveWithDistanceIndex returns only itself. If true,\r\n * it recurses to its (otherwise hidden) children.\r\n /\r\n public collectCurvePrimitives(\r\n collectorArray?: CurvePrimitive[], smallestPossiblePrimitives: boolean = false, explodeLineStrings: boolean = false,\r\n ): CurvePrimitive[] {\r\n const results: CurvePrimitive[] = collectorArray === undefined ? [] : collectorArray;\r\n this.collectCurvePrimitivesGo(results, smallestPossiblePrimitives, explodeLineStrings);\r\n return results;\r\n }\r\n /\r\n Return true for planar region types:\r\n * * `Loop`\r\n * * `ParityRegion`\r\n * * `UnionRegion`\r\n * @see isAnyRegion\r\n /\r\n public get isAnyRegionType(): boolean {\r\n return this.dgnBoundaryType() === 2 \|\| this.dgnBoundaryType() === 4 \|\| this.dgnBoundaryType() === 5;\r\n }\r\n /* Type guard for AnyRegion /\r\n public isAnyRegion(): this is AnyRegion {\r\n return this.isAnyRegionType;\r\n }\r\n /\r\n Return true for a `Path`, i.e. a chain of curves joined head-to-tail\r\n * @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 /* Return the start point of the curve chain (start point of the first child). /\r\n public startPoint(result?: Point3d): Point3d \| undefined {\r\n const firstChild = this.getChild(0);\r\n if (firstChild)\r\n return firstChild.fractionToPoint(0.0, result);\r\n else\r\n return undefined;\r\n }\r\n /* Return the end point of the curve chain (end point of the last child). /\r\n public endPoint(result?: Point3d): Point3d \| undefined {\r\n const lastChild = this.getChild(this._curves.length - 1);\r\n if (lastChild)\r\n return lastChild.fractionToPoint(1.0, result);\r\n else\r\n return undefined;\r\n }\r\n /\r\n 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 * @param child curve to add to the chain. The curve is captured by this instance.\r\n * @return whether the child was added\r\n /\r\n public tryAddChild(child: AnyCurve \| undefined): boolean {\r\n if (child && child instanceof CurvePrimitive) {\r\n this._curves.push(child);\r\n return true;\r\n }\r\n return false;\r\n }\r\n /* Return a child by index /\r\n public getChild(i: number): CurvePrimitive \| undefined {\r\n if (i < this._curves.length) return this._curves[i];\r\n return undefined;\r\n }\r\n /* Invoke `curve.extendRange(range, transform)` for each child /\r\n public override extendRange(range: Range3d, transform?: Transform): void {\r\n for (const curve of this._curves)\r\n curve.extendRange(range, transform);\r\n }\r\n /\r\n Reverse each child curve (in place).\r\n * Reverse the order of the children array.\r\n /\r\n public reverseChildrenInPlace(): void {\r\n for (const curve of this._curves)\r\n curve.reverseInPlace();\r\n this._curves.reverse();\r\n }\r\n /* Same as [[reverseChildrenInPlace]]. /\r\n public override reverseInPlace(): void {\r\n this.reverseChildrenInPlace();\r\n }\r\n /\r\n Return the index where target is found in the array of children.\r\n * @param alsoSearchProxies whether to also check proxy curves of the children\r\n /\r\n public childIndex(target: CurvePrimitive \| undefined, alsoSearchProxies?: boolean): number \| undefined {\r\n for (let i = 0; i < this._curves.length; i++) {\r\n if (this._curves[i] === target)\r\n return i;\r\n }\r\n if (alsoSearchProxies ?? false) {\r\n for (let i = 0; i < this._curves.length; i++) {\r\n const childCurve = this._curves[i];\r\n if (childCurve instanceof ProxyCurve) {\r\n if (childCurve.proxyCurve === target)\r\n return i;\r\n }\r\n }\r\n }\r\n return undefined;\r\n }\r\n /* Evaluate an indexed curve at a fraction. Return as a CurveLocationDetail that indicates the primitive. /\r\n public primitiveIndexAndFractionToCurveLocationDetailPointAndDerivative(\r\n index: number, fraction: number, cyclic: boolean = false, result?: CurveLocationDetail,\r\n ): CurveLocationDetail \| undefined {\r\n const primitive = this.cyclicCurvePrimitive(index, cyclic);\r\n if (primitive) {\r\n return CurveLocationDetail.createCurveEvaluatedFractionPointAndDerivative(primitive, fraction, result);\r\n }\r\n return undefined;\r\n }\r\n}\r\n\r\n/\r\n * A `BagOfCurves` object is a collection of `AnyCurve` objects.\r\n * * A `BagOfCurves` has no implied properties such as being planar.\r\n * @public\r\n /\r\nexport class BagOfCurves extends CurveCollection {\r\n /* String name for schema properties /\r\n public readonly curveCollectionType = \"bagOfCurves\";\r\n /* Test if `other` is an instance of `BagOfCurves` /\r\n public isSameGeometryClass(other: GeometryQuery): boolean {\r\n return other instanceof BagOfCurves;\r\n }\r\n /\r\n Array of children.\r\n * * No restrictions on type.\r\n /\r\n protected _children: AnyCurve[];\r\n /* Construct an empty `BagOfCurves` /\r\n public constructor() {\r\n super();\r\n this._children = [];\r\n }\r\n /* Return the (reference to) array of children /\r\n public override get children(): AnyCurve[] {\r\n return this._children;\r\n }\r\n /* Create with given curves. /\r\n public static create(...data: AnyCurve[]): BagOfCurves {\r\n const result = new BagOfCurves();\r\n for (const child of data) {\r\n result.tryAddChild(child);\r\n }\r\n return result;\r\n }\r\n /* Return the boundary type (0) of a corresponding MicroStation CurveVector /\r\n public dgnBoundaryType(): number {\r\n return 0;\r\n }\r\n /* Invoke `processor.announceBagOfCurves(this, indexInParent);` /\r\n public announceToCurveProcessor(processor: RecursiveCurveProcessor, indexInParent: number = -1): void {\r\n return processor.announceBagOfCurves(this, indexInParent);\r\n }\r\n /* Clone all children in stroked form. /\r\n public cloneStroked(options?: StrokeOptions): BagOfCurves {\r\n const clone = new BagOfCurves();\r\n let child;\r\n for (child of this.children) {\r\n if (child instanceof CurvePrimitive) {\r\n const ls = LineString3d.create();\r\n child.emitStrokes(ls, options);\r\n if (ls)\r\n clone.children.push(ls);\r\n } else if (child instanceof CurveCollection) {\r\n const childStrokes = child.cloneStroked(options);\r\n if (childStrokes)\r\n clone.children.push(childStrokes);\r\n }\r\n }\r\n return clone;\r\n }\r\n /\r\n Return the closest point on the contained curves.\r\n * @param spacePoint point in space.\r\n * @param extend applicable only to children of type [[CurvePrimitive]], [[Path]], or [[BagOfCurves]]\r\n * @param result optional pre-allocated detail to populate and return.\r\n * @returns details of the closest point.\r\n /\r\n public override closestPoint(\r\n spacePoint: Point3d, extend: VariantCurveExtendParameter = false, result?: CurveLocationDetail,\r\n ): CurveLocationDetail \| undefined {\r\n let detailA: CurveLocationDetail \| undefined;\r\n const detailB = new CurveLocationDetail();\r\n if (this.children !== undefined) {\r\n for (const child of this.children) {\r\n if (child.closestPoint(spacePoint, extend, detailB))\r\n detailA = result = CurveLocationDetail.chooseSmallerA(detailA, detailB)!.clone(result);\r\n }\r\n }\r\n return detailA;\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"]}
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;AAGlD,mDAAgD;AAChD,8EAA2E;AAC3E,kGAA+F;AAC/F,oGAAiG;AACjG,0EAAuE;AACvE,4FAAyF;AACzF,4EAAyE;AACzE,wFAAqF;AACrF,iDAA8C;AAC9C,6CAA0C;AAoB1C;;;;;;;;;;;;GAYG;AACH,MAAsB,eAAgB,SAAQ,6BAAa;IACzD,wCAAwC;IACxB,gBAAgB,GAAG,iBAAiB,CAAC;IAGrD,uDAAuD;IAChD,OAAO,GAAY,KAAK,CAAC;IAGhC,6DAA6D;IACtD,UAAU;QACf,OAAO,qCAAiB,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;IAC5C,CAAC;IACD;;;;;;OAMG;IACI,YAAY,CACjB,UAAmB,EAAE,UAAuC,KAAK,EAAE,MAA4B;QAE/F,IAAI,OAAwC,CAAC;QAC7C,MAAM,OAAO,GAAG,IAAI,yCAAmB,EAAE,CAAC;QAC1C,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;YAChC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAClC,IAAI,KAAK,CAAC,YAAY,CAAC,UAAU,EAAE,KAAK,EAAE,OAAO,CAAC;oBAChD,OAAO,GAAG,MAAM,GAAG,yCAAmB,CAAC,cAAc,CAAC,OAAO,EAAE,OAAO,CAAE,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;YAC3F,CAAC;QACH,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IACD,oHAAoH;IAC7G,cAAc;QACnB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ;YAC/B,KAAK,CAAC,cAAc,EAAE,CAAC;IAC3B,CAAC;IACD;;;;;;OAMG;IACI,MAAM;QACX,OAAO,mCAAgB,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACvC,CAAC;IACD,wGAAwG;IACjG,2BAA2B;QAChC,OAAO,6DAA6B,CAAC,sBAAsB,CAAC,IAAI,CAAC,CAAC;IACpE,CAAC;IACD,8CAA8C;IACvC,mBAAmB,CAAC,SAAoB;QAC7C,OAAO,iDAAuB,CAAC,mBAAmB,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;IACtE,CAAC;IACD,0BAA0B;IACV,KAAK;QACnB,OAAO,uCAAkB,CAAC,KAAK,CAAC,IAAI,CAAoB,CAAC;IAC3D,CAAC;IACD,gDAAgD;IAChC,gBAAgB,CAAC,SAAoB;QACnD,OAAO,uCAAkB,CAAC,KAAK,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;IACnD,CAAC;IACD,uFAAuF;IAChF,4BAA4B;QACjC,OAAO,2DAA4B,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAClD,CAAC;IACD;;;;OAIG;IACK,wBAAwB,CAC9B,OAAyB,EAAE,0BAAmC,EAAE,qBAA8B,KAAK;QAEnG,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAClB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAClC,IAAI,KAAK,YAAY,+BAAc;oBACjC,KAAK,CAAC,wBAAwB,CAAC,OAAO,EAAE,0BAA0B,EAAE,kBAAkB,CAAC,CAAC;qBACrF,IAAI,KAAK,YAAY,eAAe;oBACvC,KAAK,CAAC,wBAAwB,CAAC,OAAO,EAAE,0BAA0B,EAAE,kBAAkB,CAAC,CAAC;YAC5F,CAAC;QACH,CAAC;IACH,CAAC;IACD;;;;;;;;OAQG;IACI,sBAAsB,CAC3B,cAAiC,EAAE,6BAAsC,KAAK,EAAE,qBAA8B,KAAK;QAEnH,MAAM,OAAO,GAAqB,cAAc,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,cAAc,CAAC;QACrF,IAAI,CAAC,wBAAwB,CAAC,OAAO,EAAE,0BAA0B,EAAE,kBAAkB,CAAC,CAAC;QACvF,OAAO,OAAO,CAAC;IACjB,CAAC;IACD;;;;;;OAMG;IACH,IAAW,eAAe;QACxB,OAAO,IAAI,CAAC,eAAe,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,eAAe,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,eAAe,EAAE,KAAK,CAAC,CAAC;IACtG,CAAC;IACD,+BAA+B;IACxB,WAAW;QAChB,OAAO,IAAI,CAAC,eAAe,CAAC;IAC9B,CAAC;IACD;;;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,CAAC;YACb,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;gBACzB,CAAC,CAAC,WAAW,CAAC,aAAa,EAAE,SAAS,CAAC,CAAC;YAC1C,CAAC;QACH,CAAC;IACH,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,4CAA4C,CACxD,MAAiC,EAAE,WAAmB,GAAG;QAEzD,IAAI,CAAC,MAAM;YACT,OAAO,SAAS,CAAC;QACnB,IAAI,MAAM,YAAY,+BAAc,EAAE,CAAC;YACrC,OAAO,yCAAmB,CAAC,4BAA4B,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;QAC5E,CAAC;aAAM,IAAI,MAAM,YAAY,eAAe,IAAI,MAAM,CAAC,QAAQ,KAAK,SAAS;YAC3E,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC;gBACpC,MAAM,MAAM,GAAG,IAAI,CAAC,4CAA4C,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;gBAClF,IAAI,MAAM;oBACR,OAAO,MAAM,CAAC;YAClB,CAAC;QACH,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;;OAOG;IACI,uBAAuB,CAAC,GAAqB,EAAE,OAAiB;QACrE,OAAO,qDAAyB,CAAC,kCAAkC,CAAC,IAAI,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;IAC1F,CAAC;CACF;AA3MD,0CA2MC;AAED;;;;;;;;;GASG;AACH,MAAsB,UAAW,SAAQ,eAAe;IACtD,yCAAyC;IAC/B,OAAO,CAAmB;IACpC,kBAAkB;IAClB;QACE,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC;IACpB,CAAC;IACD,2CAA2C;IAC3C,IAAoB,QAAQ;QAC1B,OAAO,IAAI,CAAC,OAAO,CAAC;IACtB,CAAC;IACD,kFAAkF;IAC3E,UAAU,CAAC,MAAgB;QAChC,MAAM,UAAU,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACpC,IAAI,UAAU;YACZ,OAAO,UAAU,CAAC,eAAe,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;;YAE/C,OAAO,SAAS,CAAC;IACrB,CAAC;IACD,6EAA6E;IACtE,QAAQ,CAAC,MAAgB;QAC9B,MAAM,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACzD,IAAI,SAAS;YACX,OAAO,SAAS,CAAC,eAAe,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;;YAE9C,OAAO,SAAS,CAAC;IACrB,CAAC;IACD;;;OAGG;IACI,uBAAuB,CAAC,MAAc;QAC3C,MAAM,UAAU,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACpC,IAAI,UAAU;YACZ,OAAO,UAAU,CAAC,4BAA4B,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;;YAE5D,OAAO,SAAS,CAAC;IACrB,CAAC;IACD;;;OAGG;IACI,qBAAqB,CAAC,MAAc;QACzC,MAAM,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACzD,IAAI,SAAS;YACX,OAAO,SAAS,CAAC,4BAA4B,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;;YAE3D,OAAO,SAAS,CAAC;IACrB,CAAC;IACD;;;;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,CAAC;YACX,MAAM,MAAM,GAAG,mBAAQ,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YACzC,OAAO,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QAC/B,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;OAGG;IACI,gBAAgB,CAAC,OAAuB;QAC7C;;;;WAIG;QACH,MAAM,IAAI,GAAG,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC;QACxC,IAAI,IAAI,YAAY,UAAU,EAAE,CAAC;YAC/B,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;YAC/B,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBAC1B,MAAM,EAAE,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;gBACvB,IAAI,EAAE,YAAY,2BAAY;oBAC5B,OAAO,EAAE,CAAC,YAAY,CAAC;YAC3B,CAAC;QACH,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAGD;;;;OAIG;IACI,WAAW,CAAC,KAA2B;QAC5C,IAAI,KAAK,IAAI,KAAK,YAAY,+BAAc,EAAE,CAAC;YAC7C,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACzB,OAAO,IAAI,CAAC;QACd,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,8BAA8B;IACvB,QAAQ,CAAC,CAAS;QACvB,IAAI,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM;YAAE,OAAO,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QACpD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,mEAAmE;IACnD,WAAW,CAAC,KAAc,EAAE,SAAqB;QAC/D,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO;YAC9B,KAAK,CAAC,WAAW,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;IACxC,CAAC;IACD;;;OAGG;IACI,sBAAsB;QAC3B,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO;YAC9B,KAAK,CAAC,cAAc,EAAE,CAAC;QACzB,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,CAAC;IACzB,CAAC;IACD,0CAA0C;IAC1B,cAAc;QAC5B,IAAI,CAAC,sBAAsB,EAAE,CAAC;IAChC,CAAC;IACD;;;OAGG;IACI,UAAU,CAAC,MAAkC,EAAE,iBAA2B;QAC/E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7C,IAAI,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,MAAM;gBAC5B,OAAO,CAAC,CAAC;QACb,CAAC;QACD,IAAI,iBAAiB,IAAI,KAAK,EAAE,CAAC;YAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC7C,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;gBACnC,IAAI,UAAU,YAAY,uBAAU,EAAE,CAAC;oBACrC,IAAI,UAAU,CAAC,UAAU,KAAK,MAAM;wBAClC,OAAO,CAAC,CAAC;gBACb,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,6GAA6G;IACtG,gEAAgE,CACrE,KAAa,EAAE,QAAgB,EAAE,SAAkB,KAAK,EAAE,MAA4B;QAEtF,MAAM,SAAS,GAAG,IAAI,CAAC,oBAAoB,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QAC3D,IAAI,SAAS,EAAE,CAAC;YACd,OAAO,yCAAmB,CAAC,8CAA8C,CAAC,SAAS,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;QACzG,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;CACF;AA3JD,gCA2JC;AAED;;;;GAIG;AACH,MAAa,WAAY,SAAQ,eAAe;IAC9C,wCAAwC;IACxB,mBAAmB,GAAG,aAAa,CAAC;IACpD,sDAAsD;IAC/C,mBAAmB,CAAC,KAAoB;QAC7C,OAAO,KAAK,YAAY,WAAW,CAAC;IACtC,CAAC;IACD;;;OAGG;IACO,SAAS,CAAa;IAChC,uCAAuC;IACvC;QACE,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,SAAS,GAAG,EAAE,CAAC;IACtB,CAAC;IACD,kDAAkD;IAClD,IAAoB,QAAQ;QAC1B,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;IACD,gCAAgC;IACzB,MAAM,CAAC,MAAM,CAAC,GAAG,IAAgB;QACtC,MAAM,MAAM,GAAG,IAAI,WAAW,EAAE,CAAC;QACjC,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC;YACzB,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;QAC5B,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,gFAAgF;IACzE,eAAe;QACpB,OAAO,CAAC,CAAC;IACX,CAAC;IACD,mEAAmE;IAC5D,wBAAwB,CAAC,SAAkC,EAAE,gBAAwB,CAAC,CAAC;QAC5F,OAAO,SAAS,CAAC,mBAAmB,CAAC,IAAI,EAAE,aAAa,CAAC,CAAC;IAC5D,CAAC;IACD,0CAA0C;IACnC,YAAY,CAAC,OAAuB;QACzC,MAAM,KAAK,GAAG,IAAI,WAAW,EAAE,CAAC;QAChC,IAAI,KAAK,CAAC;QACV,KAAK,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAC5B,IAAI,KAAK,YAAY,+BAAc,EAAE,CAAC;gBACpC,MAAM,EAAE,GAAG,2BAAY,CAAC,MAAM,EAAE,CAAC;gBACjC,KAAK,CAAC,WAAW,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;gBAC/B,IAAI,EAAE;oBACJ,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAC5B,CAAC;iBAAM,IAAI,KAAK,YAAY,eAAe,EAAE,CAAC;gBAC5C,MAAM,YAAY,GAAG,KAAK,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC;gBACjD,IAAI,YAAY;oBACd,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;YACtC,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;;OAMG;IACa,YAAY,CAC1B,UAAmB,EAAE,SAAsC,KAAK,EAAE,MAA4B;QAE9F,IAAI,OAAwC,CAAC;QAC7C,MAAM,OAAO,GAAG,IAAI,yCAAmB,EAAE,CAAC;QAC1C,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;YAChC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAClC,IAAI,KAAK,CAAC,YAAY,CAAC,UAAU,EAAE,MAAM,EAAE,OAAO,CAAC;oBACjD,OAAO,GAAG,MAAM,GAAG,yCAAmB,CAAC,cAAc,CAAC,OAAO,EAAE,OAAO,CAAE,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;YAC3F,CAAC;QACH,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,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;AA/FD,kCA+FC","sourcesContent":["/---------------------------------------------------------------------------------------------\n Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n--------------------------------------------------------------------------------------------/\n\n/** @packageDocumentation\n * @module Curve\n /\nimport { Geometry } from \"../Geometry\";\nimport { GeometryHandler } from \"../geometry3d/GeometryHandler\";\nimport { GrowableXYZArray } from \"../geometry3d/GrowableXYZArray\";\nimport { Point3d, Vector3d } from \"../geometry3d/Point3dVector3d\";\nimport { Range1d, Range3d } from \"../geometry3d/Range\";\nimport { Ray3d } from \"../geometry3d/Ray3d\";\nimport { Transform } from \"../geometry3d/Transform\";\nimport { VariantCurveExtendParameter } from \"./CurveExtendMode\";\nimport { CurveLocationDetail } from \"./CurveLocationDetail\";\nimport { CurvePrimitive } from \"./CurvePrimitive\";\nimport { RecursiveCurveProcessor } from \"./CurveProcessor\";\nimport { AnyCurve, type AnyRegion } from \"./CurveTypes\";\nimport { GeometryQuery } from \"./GeometryQuery\";\nimport { CloneCurvesContext } from \"./internalContexts/CloneCurvesContext\";\nimport { CloneWithExpandedLineStrings } from \"./internalContexts/CloneWithExpandedLineStrings\";\nimport { CountLinearPartsSearchContext } from \"./internalContexts/CountLinearPartsSearchContext\";\nimport { GapSearchContext } from \"./internalContexts/GapSearchContext\";\nimport { PlaneAltitudeRangeContext } from \"./internalContexts/PlaneAltitudeRangeContext\";\nimport { SumLengthsContext } from \"./internalContexts/SumLengthsContext\";\nimport { TransformInPlaceContext } from \"./internalContexts/TransformInPlaceContext\";\nimport { LineString3d } from \"./LineString3d\";\nimport { ProxyCurve } from \"./ProxyCurve\";\nimport { StrokeOptions } from \"./StrokeOptions\";\n\nimport type { Path } from \"./Path\";\nimport type { Loop } from \"./Loop\";\n\n/* Note: CurveChain and BagOfCurves classes are located in this file to prevent circular dependency. /\n\n/\n Describes the concrete type of a [[CurveCollection]]. Each type name maps to a specific subclass and can be\n * used in conditional statements for type-switching.\n * - \"loop\" => [[Loop]]\n * - \"path\" => [[Path]]\n * - \"unionRegion\" => [[UnionRegion]]\n * - \"parityRegion\" => [[ParityRegion]]\n * - \"bagOfCurves\" => [[BagOfCurves]]\n * @public\n /\nexport type CurveCollectionType = \"loop\" \| \"path\" \| \"unionRegion\" \| \"parityRegion\" \| \"bagOfCurves\";\n\n/\n A `CurveCollection` is an abstract (non-instantiable) class for various sets of curves with particular structures:\n * - [[CurveChain]] - a non-instantiable intermediate class for a sequence of [[CurvePrimitive]] joining head-to-tail.\n * The two instantiable forms of `CurveChain` are:\n * - [[Path]] - a chain of curves. Does not have to be closed or planar. A closed `Path` is not treated as bounding a surface.\n * - [[Loop]] - a closed and planar chain of curves. A `Loop` is treated as bounding a planar area.\n * - [[ParityRegion]] - a collection of coplanar `Loop`, with \"in/out\" classification by parity rules.\n * - [[UnionRegion]] - a collection of coplanar `Loop` and/or `ParityRegion`, with \"in/out\" classification by union rules.\n * - [[BagOfCurves]] - a collection of [[AnyCurve]] with no implied structure.\n \n @see [Curve Collections]($docs/learning/geometry/CurveCollection.md) learning article.\n * @public\n /\nexport abstract class CurveCollection extends GeometryQuery {\n /* String name for schema properties /\n public readonly geometryCategory = \"curveCollection\";\n /* Type discriminator. /\n public abstract readonly curveCollectionType: CurveCollectionType;\n /* Flag for inner loop status. Only used by `Loop`. /\n public isInner: boolean = false;\n /* Return the curve children. /\n public abstract override get children(): AnyCurve[];\n /* Return the sum of the lengths of all contained curves. /\n public sumLengths(): number {\n return SumLengthsContext.sumLengths(this);\n }\n /\n Return the closest point on the contained curves.\n * @param spacePoint point in space.\n * @param _extend unused here (pass false), but applicable to overrides in [[Path]] and [[BagOfCurves]].\n * @param result optional pre-allocated detail to populate and return.\n * @returns details of the closest point.\n /\n public closestPoint(\n spacePoint: Point3d, _extend: VariantCurveExtendParameter = false, result?: CurveLocationDetail,\n ): CurveLocationDetail \| undefined {\n let detailA: CurveLocationDetail \| undefined;\n const detailB = new CurveLocationDetail();\n if (this.children !== undefined) {\n for (const child of this.children) {\n if (child.closestPoint(spacePoint, false, detailB))\n detailA = result = CurveLocationDetail.chooseSmallerA(detailA, detailB)!.clone(result);\n }\n }\n return detailA;\n }\n /* Reverse the collection's data so that each child curve's fractional stroking moves in the opposite direction. /\n public reverseInPlace(): void {\n for (const curve of this.children)\n curve.reverseInPlace();\n }\n /\n Return the max gap between adjacent primitives in Path and Loop collections.\n * * In a Path, gaps are computed between consecutive primitives.\n * * In a Loop, gaps are computed between consecutive primitives and between last and first.\n * * Gaps are NOT computed between consecutive CurvePrimitives in \"unstructured\" collections. The type is\n * \"unstructured\" so gaps should not be semantically meaningful.\n /\n public maxGap(): number {\n return GapSearchContext.maxGap(this);\n }\n /* Return true if the curve collection has any primitives other than LineSegment3d and LineString3d /\n public checkForNonLinearPrimitives(): boolean {\n return CountLinearPartsSearchContext.hasNonLinearPrimitives(this);\n }\n /* Apply transform recursively to children /\n public tryTransformInPlace(transform: Transform): boolean {\n return TransformInPlaceContext.tryTransformInPlace(this, transform);\n }\n /* Return a deep copy. /\n public override clone(): CurveCollection {\n return CloneCurvesContext.clone(this) as CurveCollection;\n }\n /* Create a deep copy of transformed curves. /\n public override cloneTransformed(transform: Transform): CurveCollection \| undefined {\n return CloneCurvesContext.clone(this, transform);\n }\n /* Create a deep copy with all linestrings broken down into multiple LineSegment3d. /\n public cloneWithExpandedLineStrings(): CurveCollection {\n return CloneWithExpandedLineStrings.clone(this);\n }\n /\n Push all CurvePrimitives contained in the instance onto the `results` array.\n * * This method is recursive. For example, if the CurveCollection contains a Loop, all CurvePrimitives\n * of the Loop are pushed onto `results`.\n /\n private collectCurvePrimitivesGo(\n results: CurvePrimitive[], smallestPossiblePrimitives: boolean, explodeLinestrings: boolean = false,\n ): void {\n if (this.children) {\n for (const child of this.children) {\n if (child instanceof CurvePrimitive)\n child.collectCurvePrimitivesGo(results, smallestPossiblePrimitives, explodeLinestrings);\n else if (child instanceof CurveCollection)\n child.collectCurvePrimitivesGo(results, smallestPossiblePrimitives, explodeLinestrings);\n }\n }\n }\n /\n Return an array containing all CurvePrimitives in the instance.\n * * This method is recursive. For example, if the CurveCollection contains a Loop, all CurvePrimitives of\n * the Loop are pushed onto the returned array.\n * @param collectorArray optional array to receive primitives. If present, new primitives are ADDED (without\n * clearing the array).\n * @param smallestPossiblePrimitives if false, CurvePrimitiveWithDistanceIndex returns only itself. If true,\n * it recurses to its (otherwise hidden) children.\n /\n public collectCurvePrimitives(\n collectorArray?: CurvePrimitive[], smallestPossiblePrimitives: boolean = false, explodeLineStrings: boolean = false,\n ): CurvePrimitive[] {\n const results: CurvePrimitive[] = collectorArray === undefined ? [] : collectorArray;\n this.collectCurvePrimitivesGo(results, smallestPossiblePrimitives, explodeLineStrings);\n return results;\n }\n /\n Return true for planar region types:\n * * `Loop`\n * * `ParityRegion`\n * * `UnionRegion`\n * @see isAnyRegion\n /\n public get isAnyRegionType(): boolean {\n return this.dgnBoundaryType() === 2 \|\| this.dgnBoundaryType() === 4 \|\| this.dgnBoundaryType() === 5;\n }\n /* Type guard for AnyRegion /\n public isAnyRegion(): this is AnyRegion {\n return this.isAnyRegionType;\n }\n /\n Return true for a `Path`, i.e. a chain of curves joined head-to-tail\n * @see isPath\n /\n public get isOpenPath(): boolean {\n return this.dgnBoundaryType() === 1;\n }\n /* Type guard for Path /\n public isPath(): this is Path {\n return this.isOpenPath;\n }\n /\n Return true for a single-loop planar region type, i.e. `Loop`.\n * * This is NOT a test for physical closure of a `Path`.\n * @see isLoop\n /\n public get isClosedPath(): boolean {\n return this.dgnBoundaryType() === 2;\n }\n /* Type guard for Loop /\n public isLoop(): this is Loop {\n return this.isClosedPath;\n }\n\n /* Return a CurveCollection with the same structure but all curves replaced by strokes. /\n public abstract cloneStroked(options?: StrokeOptions): CurveCollection;\n /* Support method for ICurvePrimitive ... one line call to specific announce method . . /\n public abstract announceToCurveProcessor(processor: RecursiveCurveProcessor): void;\n /* Clone an empty collection. /\n public abstract cloneEmptyPeer(): CurveCollection;\n /\n Return the boundary type of a corresponding MicroStation CurveVector.\n * * Derived class must implement.\n /\n public abstract dgnBoundaryType(): number;\n /\n Try to add a child.\n * @param child child to add.\n * @return true if child is an acceptable type for this collection.\n /\n public abstract tryAddChild(child: AnyCurve \| undefined): boolean;\n /* Return a child identified by by index /\n public abstract getChild(i: number): AnyCurve \| undefined;\n /\n Extend (increase) the given range as needed to encompass all curves in the curve collection.\n * @param rangeToExtend the given range.\n * @param transform if supplied, the range is extended with transformed curves.\n /\n public extendRange(rangeToExtend: Range3d, transform?: Transform): void {\n const children = this.children;\n if (children) {\n for (const c of children) {\n c.extendRange(rangeToExtend, transform);\n }\n }\n }\n /\n Find any CurvePrimitive in the source and evaluate it at the given fraction.\n * * The first CurvePrimitive found is evaluated. Any other CurvePrimitives are ignored.\n * @param source containing `CurvePrimitive` or `CurveCollection`\n * @param fraction fraction to use in `curve.fractionToPoint(fraction)`\n /\n public static createCurveLocationDetailOnAnyCurvePrimitive(\n source: GeometryQuery \| undefined, fraction: number = 0.5,\n ): CurveLocationDetail \| undefined {\n if (!source)\n return undefined;\n if (source instanceof CurvePrimitive) {\n return CurveLocationDetail.createCurveEvaluatedFraction(source, fraction);\n } else if (source instanceof CurveCollection && source.children !== undefined)\n for (const child of source.children) {\n const detail = this.createCurveLocationDetailOnAnyCurvePrimitive(child, fraction);\n if (detail)\n return detail;\n }\n return undefined;\n }\n /\n Project instance geometry (via dispatch) onto the given ray, and return the extreme fractional parameters\n * of projection.\n * @param ray ray onto which the instance is projected. A `Vector3d` is treated as a `Ray3d` with zero origin.\n * @param lowHigh optional receiver for output\n * @returns range of fractional projection parameters onto the ray, where 0.0 is start of the ray and 1.0 is the\n * end of the ray.\n /\n public projectedParameterRange(ray: Vector3d \| Ray3d, lowHigh?: Range1d): Range1d \| undefined {\n return PlaneAltitudeRangeContext.findExtremeFractionsAlongDirection(this, ray, lowHigh);\n }\n}\n\n/\n Shared base class for use by both open and closed paths.\n * * A `CurveChain` contains only CurvePrimitives. No other paths, loops, or regions allowed.\n * * The specific derived classes are `Path` and `Loop`.\n * * `CurveChain` is an intermediate class. It is not instantiable on its own.\n * * The related class `CurveChainWithDistanceIndex` is a `CurvePrimitive` whose API presents well-defined mappings\n * from fraction to xyz over the entire chain, but in fact does all the calculations over multiple primitives.\n * @see [Curve Collections]($docs/learning/geometry/CurveCollection.md) learning article.\n * @public\n /\nexport abstract class CurveChain extends CurveCollection {\n /* The curve primitives in the chain. /\n protected _curves: CurvePrimitive[];\n /* Constructor /\n protected constructor() {\n super();\n this._curves = [];\n }\n /* Return the array of `CurvePrimitive` /\n public override get children(): CurvePrimitive[] {\n return this._curves;\n }\n /* Return the start point of the curve chain (start point of the first child). /\n public startPoint(result?: Point3d): Point3d \| undefined {\n const firstChild = this.getChild(0);\n if (firstChild)\n return firstChild.fractionToPoint(0.0, result);\n else\n return undefined;\n }\n /* Return the end point of the curve chain (end point of the last child). /\n public endPoint(result?: Point3d): Point3d \| undefined {\n const lastChild = this.getChild(this._curves.length - 1);\n if (lastChild)\n return lastChild.fractionToPoint(1.0, result);\n else\n return undefined;\n }\n /\n Return the start point and derivative of the first child of the curve chain.\n * * For queries interior to the chain, use [[CurveChainWithDistanceIndex.fractionToPointAndDerivative]].\n /\n public startPointAndDerivative(result?: Ray3d): Ray3d \| undefined {\n const firstChild = this.getChild(0);\n if (firstChild)\n return firstChild.fractionToPointAndDerivative(0.0, result);\n else\n return undefined;\n }\n /\n Return the end point and derivative of the last child of the curve chain.\n * * For queries interior to the chain, use [[CurveChainWithDistanceIndex.fractionToPointAndDerivative]].\n /\n public endPointAndDerivative(result?: Ray3d): Ray3d \| undefined {\n const lastChild = this.getChild(this._curves.length - 1);\n if (lastChild)\n return lastChild.fractionToPointAndDerivative(1.0, result);\n else\n return undefined;\n }\n /\n Return the curve primitive at the given `index`, optionally using `modulo` to map `index` to the cyclic indexing.\n * * In particular, `-1` is the final curve.\n * @param index cyclic index\n /\n public cyclicCurvePrimitive(index: number, cyclic: boolean = true): CurvePrimitive \| undefined {\n const n = this.children.length;\n if (n === 0)\n return undefined;\n if (index >= 0 && index < n) // try simplest non-cyclic access first\n return this.children[index];\n if (cyclic) {\n const index2 = Geometry.modulo(index, n);\n return this.children[index2];\n }\n return undefined;\n }\n /\n Stroke the chain into a simple xyz array.\n * @param options tolerance parameters controlling the stroking.\n /\n public getPackedStrokes(options?: StrokeOptions): GrowableXYZArray \| undefined {\n /\n The object returned by \"cloneStroked\" has the same type (Loop or Path) but instead of a chain of\n * CurvePrimitives as children, it has a single LineString3d child. \"getPackedStrokes\" just returns\n * the points of that LineString3d using \"packedPoints\".\n /\n const tree = this.cloneStroked(options);\n if (tree instanceof CurveChain) {\n const children = tree.children;\n if (children.length === 1) {\n const ls = children[0];\n if (ls instanceof LineString3d)\n return ls.packedPoints;\n }\n }\n return undefined;\n }\n /* Return a structural clone, with CurvePrimitive objects stroked. /\n public abstract override cloneStroked(options?: StrokeOptions): CurveChain;\n /\n Add a child curve.\n * @param child curve to add to the chain. The curve is captured by this instance.\n * @return whether the child was added\n /\n public tryAddChild(child: AnyCurve \| undefined): boolean {\n if (child && child instanceof CurvePrimitive) {\n this._curves.push(child);\n return true;\n }\n return false;\n }\n /* Return a child by index /\n public getChild(i: number): CurvePrimitive \| undefined {\n if (i < this._curves.length) return this._curves[i];\n return undefined;\n }\n /* Invoke `curve.extendRange(range, transform)` for each child /\n public override extendRange(range: Range3d, transform?: Transform): void {\n for (const curve of this._curves)\n curve.extendRange(range, transform);\n }\n /\n Reverse each child curve (in place).\n * Reverse the order of the children array.\n /\n public reverseChildrenInPlace(): void {\n for (const curve of this._curves)\n curve.reverseInPlace();\n this._curves.reverse();\n }\n /* Same as [[reverseChildrenInPlace]]. /\n public override reverseInPlace(): void {\n this.reverseChildrenInPlace();\n }\n /\n Return the index where target is found in the array of children.\n * @param alsoSearchProxies whether to also check proxy curves of the children\n /\n public childIndex(target: CurvePrimitive \| undefined, alsoSearchProxies?: boolean): number \| undefined {\n for (let i = 0; i < this._curves.length; i++) {\n if (this._curves[i] === target)\n return i;\n }\n if (alsoSearchProxies ?? false) {\n for (let i = 0; i < this._curves.length; i++) {\n const childCurve = this._curves[i];\n if (childCurve instanceof ProxyCurve) {\n if (childCurve.proxyCurve === target)\n return i;\n }\n }\n }\n return undefined;\n }\n /* Evaluate an indexed curve at a fraction. Return as a CurveLocationDetail that indicates the primitive. /\n public primitiveIndexAndFractionToCurveLocationDetailPointAndDerivative(\n index: number, fraction: number, cyclic: boolean = false, result?: CurveLocationDetail,\n ): CurveLocationDetail \| undefined {\n const primitive = this.cyclicCurvePrimitive(index, cyclic);\n if (primitive) {\n return CurveLocationDetail.createCurveEvaluatedFractionPointAndDerivative(primitive, fraction, result);\n }\n return undefined;\n }\n}\n\n/\n * A `BagOfCurves` object is a collection of `AnyCurve` objects.\n * * A `BagOfCurves` has no implied properties such as being planar.\n * @public\n /\nexport class BagOfCurves extends CurveCollection {\n /* String name for schema properties /\n public readonly curveCollectionType = \"bagOfCurves\";\n /* Test if `other` is an instance of `BagOfCurves` /\n public isSameGeometryClass(other: GeometryQuery): boolean {\n return other instanceof BagOfCurves;\n }\n /\n Array of children.\n * * No restrictions on type.\n /\n protected _children: AnyCurve[];\n /* Construct an empty `BagOfCurves` /\n public constructor() {\n super();\n this._children = [];\n }\n /* Return the (reference to) array of children /\n public override get children(): AnyCurve[] {\n return this._children;\n }\n /* Create with given curves. /\n public static create(...data: AnyCurve[]): BagOfCurves {\n const result = new BagOfCurves();\n for (const child of data) {\n result.tryAddChild(child);\n }\n return result;\n }\n /* Return the boundary type (0) of a corresponding MicroStation CurveVector /\n public dgnBoundaryType(): number {\n return 0;\n }\n /* Invoke `processor.announceBagOfCurves(this, indexInParent);` /\n public announceToCurveProcessor(processor: RecursiveCurveProcessor, indexInParent: number = -1): void {\n return processor.announceBagOfCurves(this, indexInParent);\n }\n /* Clone all children in stroked form. /\n public cloneStroked(options?: StrokeOptions): BagOfCurves {\n const clone = new BagOfCurves();\n let child;\n for (child of this.children) {\n if (child instanceof CurvePrimitive) {\n const ls = LineString3d.create();\n child.emitStrokes(ls, options);\n if (ls)\n clone.children.push(ls);\n } else if (child instanceof CurveCollection) {\n const childStrokes = child.cloneStroked(options);\n if (childStrokes)\n clone.children.push(childStrokes);\n }\n }\n return clone;\n }\n /\n Return the closest point on the contained curves.\n * @param spacePoint point in space.\n * @param extend applicable only to children of type [[CurvePrimitive]], [[Path]], or [[BagOfCurves]]\n * @param result optional pre-allocated detail to populate and return.\n * @returns details of the closest point.\n /\n public override closestPoint(\n spacePoint: Point3d, extend: VariantCurveExtendParameter = false, result?: CurveLocationDetail,\n ): CurveLocationDetail \| undefined {\n let detailA: CurveLocationDetail \| undefined;\n const detailB = new CurveLocationDetail();\n if (this.children !== undefined) {\n for (const child of this.children) {\n if (child.closestPoint(spacePoint, extend, detailB))\n detailA = result = CurveLocationDetail.chooseSmallerA(detailA, detailB)!.clone(result);\n }\n }\n return detailA;\n }\n /* Return an empty `BagOfCurves` /\n public cloneEmptyPeer(): BagOfCurves {\n return new BagOfCurves();\n }\n /* Add a child /\n public tryAddChild(child: AnyCurve \| undefined): boolean {\n if (child)\n this._children.push(child);\n return true;\n }\n /* Get a child by index /\n public getChild(i: number): AnyCurve \| undefined {\n if (i < this._children.length)\n return this._children[i];\n return undefined;\n }\n /* Second step of double dispatch: call `handler.handleBagOfCurves(this)` */\n public dispatchToGeometryHandler(handler: GeometryHandler): any {\n return handler.handleBagOfCurves(this);\n }\n}\n"]}

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

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

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

	@@ -1 +1 @@
1	- {"version":3,"file":"CurveExtendMode.js","sourceRoot":"","sources":["../../../src/curve/CurveExtendMode.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH,0CAAuC;AAGvC;;;;GAIG;AACH,IAAY,eAOX;AAPD,WAAY,eAAe;IACzB,4BAA4B;IAC5B,qDAAQ,CAAA;IACR,oDAAoD;IACpD,+DAAa,CAAA;IACb,8CAA8C;IAC9C,2DAAW,CAAA;AACb,CAAC,EAPW,eAAe,+BAAf,eAAe,QAO1B;AACD;;;GAGG;AACH,MAAa,kBAAkB;IAC7B;;;;;;OAMG;IACI,MAAM,CAAC,mDAAmD,CAC/D,KAAkC,EAAE,QAAe;QAEnD,IAAI,KAAK,KAAK,KAAK;YACjB,OAAO,eAAe,CAAC,IAAI,CAAC;QAC9B,IAAI,KAAK,KAAK,IAAI;YAChB,OAAO,eAAe,CAAC,OAAO,CAAC;QACjC,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;YACtB,OAAO,KAAK,CAAC,MAAM,GAAG,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,IAAI,CAAC;QAC1E,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,eAAe,CAAC,WAAwC,EAAE,QAAgB;QACtF,IAAI,QAAQ,GAAG,CAAC,EAAE,CAAC;YACjB,MAAM,IAAI,GAAG,kBAAkB,CAAC,mDAAmD,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;YACpG,IAAI,IAAI,KAAK,eAAe,CAAC,IAAI;gBAC/B,QAAQ,GAAG,GAAG,CAAC;QACnB,CAAC;aAAM,IAAI,QAAQ,GAAG,GAAG,EAAE,CAAC;YAC1B,MAAM,IAAI,GAAG,kBAAkB,CAAC,mDAAmD,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;YACpG,IAAI,IAAI,KAAK,eAAe,CAAC,IAAI;gBAC/B,QAAQ,GAAG,GAAG,CAAC;QACnB,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IACD;;;;;;OAMG;IACI,MAAM,CAAC,6BAA6B,CACzC,WAAwC,EAAE,OAAe,EAAE,KAAiB;QAE5E,IAAI,QAAQ,GAAG,KAAK,CAAC,+BAA+B,CAAC,OAAO,CAAC,CAAC;QAC9D,IAAI,CAAC,KAAK,CAAC,gBAAgB,CAAC,OAAO,CAAC,EAAE,CAAC;YACrC,MAAM,cAAc,GAAG,KAAK,CAAC,cAAc,EAAE,CAAC;YAC9C,MAAM,KAAK,GAAG,kBAAkB,CAAC,mDAAmD,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;YACrG,MAAM,KAAK,GAAG,kBAAkB,CAAC,mDAAmD,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;YACrG,IAAI,KAAK,KAAK,eAAe,CAAC,IAAI,EAAE,CAAC;gBACnC,IAAI,KAAK,KAAK,eAAe,CAAC,IAAI,EAAE,CAAC;oBACnC,sEAAsE;oBACtE,QAAQ,GAAG,KAAK,CAAC,+BAA+B,CAAC,OAAO,CAAC,CAAC;gBAC5D,CAAC;qBAAM,CAAC;oBACN,0BAA0B;oBAC1B,IAAI,QAAQ,GAAG,GAAG;wBAChB,QAAQ,IAAI,cAAc,CAAC;gBAC/B,CAAC;YACH,CAAC;iBAAM,IAAI,KAAK,KAAK,eAAe,CAAC,IAAI,EAAE,CAAC;gBAC1C,IAAI,QAAQ,GAAG,GAAG;oBAChB,QAAQ,IAAI,cAAc,CAAC;YAC/B,CAAC;iBAAM,CAAC,CAAC,eAAe;gBACtB,QAAQ,GAAG,mBAAQ,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAC5C,CAAC;QACH,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;CACF;AAtED,gDAsEC","sourcesContent":["/---------------------------------------------------------------------------------------------\r\n Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n--------------------------------------------------------------------------------------------/\r\n/** @packageDocumentation\r\n * @module Curve\r\n /\r\n\r\nimport { Geometry } from \"../Geometry\";\r\nimport { AngleSweep } from \"../geometry3d/AngleSweep\";\r\n\r\n/\r\n Enumeration of condition for extending a curve beyond start or end point.\r\n * * Not all CurvePrimitives support these modes.\r\n * @public\r\n /\r\nexport enum CurveExtendMode {\r\n /* No extension allowed. /\r\n None = 0,\r\n /* Extend along continuation of the end tangent. /\r\n OnTangent = 1,\r\n /* Extend along continuation of the curve. /\r\n OnCurve = 2,\r\n}\r\n/\r\n Logic for deciding how a curve may be extended for closest point or intersection searches.\r\n * @public\r\n /\r\nexport class CurveExtendOptions {\r\n /\r\n Given a `VariantCurveExtendParameter`, isolate the particular CurveExtendMode in effect at an end.\r\n * * Return `CurveExtendMode.None` if `param === false`.\r\n * * Return `CurveExtendMode.OnCurve` if `param === true`.\r\n * * Return the param if it is a single CurveExtendMode.\r\n * * Return dereferenced array at entry `endIndex` if the param is an array of CurveExtendMode.\r\n /\r\n public static resolveVariantCurveExtendParameterToCurveExtendMode(\r\n param: VariantCurveExtendParameter, endIndex: 0 \| 1,\r\n ): CurveExtendMode {\r\n if (param === false)\r\n return CurveExtendMode.None;\r\n if (param === true)\r\n return CurveExtendMode.OnCurve;\r\n if (Array.isArray(param))\r\n return param.length > endIndex ? param[endIndex] : CurveExtendMode.None;\r\n return param;\r\n }\r\n /\r\n Correct fraction to be within [0,1].\r\n * * If fraction is in [0,1] return it unchanged.\r\n * * If fraction is less than 0 use `extendParam` to decide whether to return it unchanged, or to return 0.\r\n * * If fraction is greater than 1 use `extendParam` to decide whether to return it unchanged, or to return 1.\r\n /\r\n public static correctFraction(extendParam: VariantCurveExtendParameter, fraction: number): number {\r\n if (fraction < 0) {\r\n const mode = CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(extendParam, 0);\r\n if (mode === CurveExtendMode.None)\r\n fraction = 0.0;\r\n } else if (fraction > 1.0) {\r\n const mode = CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(extendParam, 1);\r\n if (mode === CurveExtendMode.None)\r\n fraction = 1.0;\r\n }\r\n return fraction;\r\n }\r\n /\r\n Adjust a radians value to an angle sweep, allowing the extendParam to affect choice among periodic fractions.\r\n * * If radians is within the sweep, convert it to a fraction of the sweep.\r\n * * If radians is outside, use the extendParam to choose among:\r\n * * fraction below 0.\r\n * * fraction above 1.\r\n /\r\n public static resolveRadiansToSweepFraction(\r\n extendParam: VariantCurveExtendParameter, radians: number, sweep: AngleSweep,\r\n ): number {\r\n let fraction = sweep.radiansToSignedPeriodicFraction(radians);\r\n if (!sweep.isRadiansInSweep(radians)) {\r\n const fractionPeriod = sweep.fractionPeriod();\r\n const mode0 = CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(extendParam, 0);\r\n const mode1 = CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(extendParam, 1);\r\n if (mode0 !== CurveExtendMode.None) {\r\n if (mode1 !== CurveExtendMode.None) {\r\n // both extensions possible; let the sweep resolve to the \"closer\" end\r\n fraction = sweep.radiansToSignedPeriodicFraction(radians);\r\n } else {\r\n // only extend to negative\r\n if (fraction > 1.0)\r\n fraction -= fractionPeriod;\r\n }\r\n } else if (mode1 !== CurveExtendMode.None) {\r\n if (fraction < 0.0)\r\n fraction += fractionPeriod;\r\n } else { // both clamped\r\n fraction = Geometry.clamp(fraction, 0, 1);\r\n }\r\n }\r\n return fraction;\r\n }\r\n}\r\n/\r\n Variant options for extending a curve.\r\n * * Useful for specifying either a single boolean/`CurveExtendMode` option applicable to both ends of the curve,\r\n * or an array of options, the first entry of which applies to the curve start; the second, to curve end.\r\n * @public\r\n */\r\nexport type VariantCurveExtendParameter = boolean \| CurveExtendMode \| CurveExtendMode[];\r\n"]}
1	+ {"version":3,"file":"CurveExtendMode.js","sourceRoot":"","sources":["../../../src/curve/CurveExtendMode.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH,0CAAuC;AAGvC;;;;GAIG;AACH,IAAY,eAOX;AAPD,WAAY,eAAe;IACzB,4BAA4B;IAC5B,qDAAQ,CAAA;IACR,oDAAoD;IACpD,+DAAa,CAAA;IACb,8CAA8C;IAC9C,2DAAW,CAAA;AACb,CAAC,EAPW,eAAe,+BAAf,eAAe,QAO1B;AACD;;;GAGG;AACH,MAAa,kBAAkB;IAC7B;;;;;;OAMG;IACI,MAAM,CAAC,mDAAmD,CAC/D,KAAkC,EAAE,QAAe;QAEnD,IAAI,KAAK,KAAK,KAAK;YACjB,OAAO,eAAe,CAAC,IAAI,CAAC;QAC9B,IAAI,KAAK,KAAK,IAAI;YAChB,OAAO,eAAe,CAAC,OAAO,CAAC;QACjC,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;YACtB,OAAO,KAAK,CAAC,MAAM,GAAG,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,IAAI,CAAC;QAC1E,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,eAAe,CAAC,WAAwC,EAAE,QAAgB;QACtF,IAAI,QAAQ,GAAG,CAAC,EAAE,CAAC;YACjB,MAAM,IAAI,GAAG,kBAAkB,CAAC,mDAAmD,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;YACpG,IAAI,IAAI,KAAK,eAAe,CAAC,IAAI;gBAC/B,QAAQ,GAAG,GAAG,CAAC;QACnB,CAAC;aAAM,IAAI,QAAQ,GAAG,GAAG,EAAE,CAAC;YAC1B,MAAM,IAAI,GAAG,kBAAkB,CAAC,mDAAmD,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;YACpG,IAAI,IAAI,KAAK,eAAe,CAAC,IAAI;gBAC/B,QAAQ,GAAG,GAAG,CAAC;QACnB,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IACD;;;;;;OAMG;IACI,MAAM,CAAC,6BAA6B,CACzC,WAAwC,EAAE,OAAe,EAAE,KAAiB;QAE5E,IAAI,QAAQ,GAAG,KAAK,CAAC,+BAA+B,CAAC,OAAO,CAAC,CAAC;QAC9D,IAAI,CAAC,KAAK,CAAC,gBAAgB,CAAC,OAAO,CAAC,EAAE,CAAC;YACrC,MAAM,cAAc,GAAG,KAAK,CAAC,cAAc,EAAE,CAAC;YAC9C,MAAM,KAAK,GAAG,kBAAkB,CAAC,mDAAmD,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;YACrG,MAAM,KAAK,GAAG,kBAAkB,CAAC,mDAAmD,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;YACrG,IAAI,KAAK,KAAK,eAAe,CAAC,IAAI,EAAE,CAAC;gBACnC,IAAI,KAAK,KAAK,eAAe,CAAC,IAAI,EAAE,CAAC;oBACnC,sEAAsE;oBACtE,QAAQ,GAAG,KAAK,CAAC,+BAA+B,CAAC,OAAO,CAAC,CAAC;gBAC5D,CAAC;qBAAM,CAAC;oBACN,0BAA0B;oBAC1B,IAAI,QAAQ,GAAG,GAAG;wBAChB,QAAQ,IAAI,cAAc,CAAC;gBAC/B,CAAC;YACH,CAAC;iBAAM,IAAI,KAAK,KAAK,eAAe,CAAC,IAAI,EAAE,CAAC;gBAC1C,IAAI,QAAQ,GAAG,GAAG;oBAChB,QAAQ,IAAI,cAAc,CAAC;YAC/B,CAAC;iBAAM,CAAC,CAAC,eAAe;gBACtB,QAAQ,GAAG,mBAAQ,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAC5C,CAAC;QACH,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;CACF;AAtED,gDAsEC","sourcesContent":["/---------------------------------------------------------------------------------------------\n Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n--------------------------------------------------------------------------------------------/\n/** @packageDocumentation\n * @module Curve\n /\n\nimport { Geometry } from \"../Geometry\";\nimport { AngleSweep } from \"../geometry3d/AngleSweep\";\n\n/\n Enumeration of condition for extending a curve beyond start or end point.\n * * Not all CurvePrimitives support these modes.\n * @public\n /\nexport enum CurveExtendMode {\n /* No extension allowed. /\n None = 0,\n /* Extend along continuation of the end tangent. /\n OnTangent = 1,\n /* Extend along continuation of the curve. /\n OnCurve = 2,\n}\n/\n Logic for deciding how a curve may be extended for closest point or intersection searches.\n * @public\n /\nexport class CurveExtendOptions {\n /\n Given a `VariantCurveExtendParameter`, isolate the particular CurveExtendMode in effect at an end.\n * * Return `CurveExtendMode.None` if `param === false`.\n * * Return `CurveExtendMode.OnCurve` if `param === true`.\n * * Return the param if it is a single CurveExtendMode.\n * * Return dereferenced array at entry `endIndex` if the param is an array of CurveExtendMode.\n /\n public static resolveVariantCurveExtendParameterToCurveExtendMode(\n param: VariantCurveExtendParameter, endIndex: 0 \| 1,\n ): CurveExtendMode {\n if (param === false)\n return CurveExtendMode.None;\n if (param === true)\n return CurveExtendMode.OnCurve;\n if (Array.isArray(param))\n return param.length > endIndex ? param[endIndex] : CurveExtendMode.None;\n return param;\n }\n /\n Correct fraction to be within [0,1].\n * * If fraction is in [0,1] return it unchanged.\n * * If fraction is less than 0 use `extendParam` to decide whether to return it unchanged, or to return 0.\n * * If fraction is greater than 1 use `extendParam` to decide whether to return it unchanged, or to return 1.\n /\n public static correctFraction(extendParam: VariantCurveExtendParameter, fraction: number): number {\n if (fraction < 0) {\n const mode = CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(extendParam, 0);\n if (mode === CurveExtendMode.None)\n fraction = 0.0;\n } else if (fraction > 1.0) {\n const mode = CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(extendParam, 1);\n if (mode === CurveExtendMode.None)\n fraction = 1.0;\n }\n return fraction;\n }\n /\n Adjust a radians value to an angle sweep, allowing the extendParam to affect choice among periodic fractions.\n * * If radians is within the sweep, convert it to a fraction of the sweep.\n * * If radians is outside, use the extendParam to choose among:\n * * fraction below 0.\n * * fraction above 1.\n /\n public static resolveRadiansToSweepFraction(\n extendParam: VariantCurveExtendParameter, radians: number, sweep: AngleSweep,\n ): number {\n let fraction = sweep.radiansToSignedPeriodicFraction(radians);\n if (!sweep.isRadiansInSweep(radians)) {\n const fractionPeriod = sweep.fractionPeriod();\n const mode0 = CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(extendParam, 0);\n const mode1 = CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(extendParam, 1);\n if (mode0 !== CurveExtendMode.None) {\n if (mode1 !== CurveExtendMode.None) {\n // both extensions possible; let the sweep resolve to the \"closer\" end\n fraction = sweep.radiansToSignedPeriodicFraction(radians);\n } else {\n // only extend to negative\n if (fraction > 1.0)\n fraction -= fractionPeriod;\n }\n } else if (mode1 !== CurveExtendMode.None) {\n if (fraction < 0.0)\n fraction += fractionPeriod;\n } else { // both clamped\n fraction = Geometry.clamp(fraction, 0, 1);\n }\n }\n return fraction;\n }\n}\n/\n Variant options for extending a curve.\n * * Useful for specifying either a single boolean/`CurveExtendMode` option applicable to both ends of the curve,\n * or an array of options, the first entry of which applies to the curve start; the second, to curve end.\n * @public\n */\nexport type VariantCurveExtendParameter = boolean \| CurveExtendMode \| CurveExtendMode[];\n"]}

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

@@ -23,13 +23,14 @@ import { Path } from "./Path";
 import { IntegratedSpiralTypeName } from "./spiral/TransitionSpiral3d";
 import { StrokeOptions } from "./StrokeOptions";
 /**
- * Interface to carry parallel arrays of planes and sections, and optional geometry assembled from them, as returned by [CurveFactory.createMiteredSweepSections].
+ * Interface to carry parallel arrays of planes and sections, and optional geometry assembled from them,
+ * as returned by [CurveFactory.createMiteredSweepSections].
  * @public
  */
 export interface SectionSequenceWithPlanes {
-    /** the plane of each section */
+    /** The plane of each section. */
     planes: Plane3dByOriginAndUnitNormal[];
-    /** section curve projected onto the corresponding plane */
+    /** Section curve projected onto the corresponding plane. */
     sections: AnyCurve[];
     /**
      * Optional `RuledSweep` generated from the sections.
@@ -60,17 +61,21 @@ export interface MiteredSweepOptions {
     wrapIfPhysicallyClosed?: boolean;
     /** Whether to output sections only, or sections plus optional geometry constructed from them. Default value is `MiteredSweepOutputSelect.Sections`. */
     outputSelect?: MiteredSweepOutputSelect;
-    /** How to stroke the ruled sweep if outputting a mesh. If undefined, default stroke options are used. */
+    /** How to stroke smooth input curves. If undefined, default stroke options are used. */
     strokeOptions?: StrokeOptions;
     /** Whether to cap the ruled sweep if outputting a ruled sweep or mesh. Default value is `false`. */
     capped?: boolean;
+    /** The first section's normal is aligned to this vector, typically the start tangent of the smooth curve stroked for the centerline. */
+    startTangent?: Vector3d;
+    /** The last section's normal is aligned to this vector, typically the end tangent of the smooth curve stroked for the centerline. */
+    endTangent?: Vector3d;
 }
 /**
  * The `CurveFactory` class contains methods for specialized curve constructions.
  * @public
  */
 export declare class CurveFactory {
-    /** (cautiously) construct and save a line segment between fractional positions. */
+    /** (Cautiously) construct and save a line segment between fractional positions. */
     private static addPartialSegment;
     /**
      * Create a circular arc defined by start point, tangent at start point, and end point.
@@ -89,23 +94,25 @@ export declare class CurveFactory {
      * @param allowBackupAlongEdge true to allow edges to be created going "backwards" along edges if needed to create the blend.
      */
     static createFilletsInLineString(points: LineString3d | IndexedXYZCollection | Point3d[], radius: number | number[], allowBackupAlongEdge?: boolean): Path | undefined;
-    /** Create a `Loop` with given xy corners and fixed z.
+    /**
+     * Create a `Loop` with given xy corners and fixed z.
      * * The corners always proceed counter clockwise from lower left.
      * * If the radius is too large for the outer rectangle size, it is reduced to half of the the smaller x or y size.
-    */
+     */
     static createRectangleXY(x0: number, y0: number, x1: number, y1: number, z?: number, filletRadius?: number): Loop;
     /**
      * If `arcB` is a continuation of `arcA`, extend `arcA` (in place) to include the range of `arcB`
      * * This only succeeds if the two arcs are part of identical complete arcs and end of `arcA` matches the beginning of `arcB`.
-     * @param arcA first arc, modified in place
-     * @param arcB second arc, unmodified
-     * @param allowReversed whether to consolidate even when second arc is reversed
-     * @returns whether `arcA` was modified
+     * @param arcA first arc, modified in place.
+     * @param arcB second arc, unmodified.
+     * @param allowReversed whether to consolidate even when second arc is reversed.
+     * @returns whether `arcA` was modified.
      */
     static appendToArcInPlace(arcA: Arc3d, arcB: Arc3d, allowReverse?: boolean): boolean;
     /**
      * Return a `Path` containing arcs are on the surface of an ellipsoid and pass through a sequence of points.
-     * * Each arc passes through the two given endpoints and in the plane containing the true surface normal at given `fractionForIntermediateNormal`
+     * * Each arc passes through the two given endpoints and in the plane containing the true surface normal at
+     * given `fractionForIntermediateNormal`
      * @param ellipsoid
      * @param pathPoints
      * @param fractionForIntermediateNormal fractional position for surface normal used to create the section plane.
@@ -114,39 +121,71 @@ export declare class CurveFactory {
     private static appendGeometryQueryArray;
     /**
      * Create solid primitives for pipe segments (e.g. Cone or TorusPipe) around line and arc primitives.
-     * @param centerline centerline geometry/
+     * @param centerline centerline geometry.
      * @param pipeRadius radius of pipe.
      */
     static createPipeSegments(centerline: CurvePrimitive | CurveChain, pipeRadius: number): GeometryQuery | GeometryQuery[] | undefined;
+    /** Get start point and tangent for variant curve data. */
+    private static startPointAndTangent;
+    /** Create an [[Arc3d]] from `sectionData` that has its center at the start point of the centerline. */
+    static createArcFromSectionData(centerline: IndexedXYZCollection | Point3d[] | CurvePrimitive, sectionData: number | XAndY | Arc3d): Arc3d | undefined;
     /**
-     * * Create section arcs for mitered pipe.
-     * * At each end of each pipe, the pipe is cut by the plane that bisects the angle between successive pipe centerlines.
-     * * The arc definitions are constructed so that lines between corresponding fractional positions on the arcs are
-     *     axial lines on the pipes.
-     * * This means that each arc definition axes (aka vector0 and vector90) are _not_ perpendicular to each other.
-     * * Circular or elliptical pipe cross sections can be specified by supplying either a radius, a pair of semi-axis lengths, or a full Arc3d.
-     *    * For semi-axis length input, x corresponds to an ellipse local axis nominally situated parallel to the xy-plane.
-     *    * The center of Arc3d input is translated to the centerline start point to act as initial cross section.
-     * @param centerline centerline of pipe
-     * @param sectionData circle radius, ellipse semi-axis lengths, or full Arc3d
+     * Create section arcs for mitered pipe.
+     * * At the end of each pipe segment, the pipe is mitered by the plane that bisects the angle between successive
+     * centerline segments.
+     * * The section arcs are constructed so that lines between corresponding fractional positions on the arcs are
+     *   axial lines on the pipes.
+     * * This means that the initial arc's vector0 and vector90 lengths and angular separation are _not_ preserved in
+     * the section arcs.
+     * * Circular or elliptical pipe cross sections can be specified by supplying either a radius, a pair of semi-axis
+     * lengths, or an Arc3d:
+     *    * For semi-axis length input, x and y correspond to ellipse local axes perpendicular to each other and to the
+     * start tangent.
+     *    * For Arc3d input, the center is translated to the centerline start point. For best results, ensure this arc
+     * is perpendicular to the centerline start tangent.
+     * * This function internally calls [[createMiteredSweepSections]] with default options.
+     * @param centerline centerline of pipe. For best results, ensure no successive duplicate points with e.g.,
+     * [[GrowableXYZArray.createCompressed]].
+     * @param sectionData circle radius, ellipse semi-axis lengths, or full Arc3d (if not full, function makes it full).
+     * @returns array of sections or empty array if section creation failed.
      */
     static createMiteredPipeSections(centerline: IndexedXYZCollection, sectionData: number | XAndY | Arc3d): Arc3d[];
+    /** For a smooth curve, stroke and return unnormalized start/end tangents. */
+    private static strokeSmoothCurve;
+    /**
+     * Align two bisector plane normals to given smooth rail tangents or optional overrides.
+     * * Optionally average the normals for physically closed rail.
+     */
+    private static alignFirstAndLastBisectorPlanes;
+    /** Reverse a closed curve or region if necessary so that its orientation is CCW with respect to the plane normal. */
+    private static alignClosedCurveToPlane;
     /**
-     * Sweep the initialSection along each segment of the centerLine until it hits the bisector plane at the next vertex.
-     * * The caller should place the initialSection on a plane perpendicular to the first edge.
-     *   * This plane is commonly (but not necessarily) through the start point itself.
-     *   * If the geometry is not "on a perpendicular plane", the output geometry will still be flattened onto the various planes.
-     * * In the "open path" case (i.e when wrapIfPhysicallyClosed is false or the path does not have matched first and last points)
-     *       the first/last output plane will be at the start/end of the first/last edge and on a perpendicular plane.
-     * * In the "closed path" case, the output plane for the first and last point is the bisector of the start and end planes from the "open path" case,
-     *    and the first/last section geometry may be different from `initialSection`.
-     * * The centerline path does NOT have to be planar, however twisting effects effects will appear in the various bisector planes.
-     * @param centerline sweep path, e.g., as stroked from a smooth centerline curve
-     * @param initialSection profile curve to be swept. As noted above, this should be on a plane perpendicular to the first segment of the centerline.
-     * @param options options for computation and output
-     * @return array of sections, starting with `initialSection` projected along the first edge to the first plane.
+     * Projection to target plane, constructing sweep direction from two given planes.
+     * * If successful, push the target plane and swept section to the output arrays and return the swept section.
+     * * If unsuccessful, leave the output arrays alone and return the input section.
      */
-    static createMiteredSweepSections(centerline: IndexedXYZCollection | Point3d[], initialSection: AnyCurve, options: MiteredSweepOptions): SectionSequenceWithPlanes | undefined;
+    private static doSweepToPlane;
+    /**
+     * Sweep the `initialSection` along each segment of the (stroked) `centerline` until it hits the bisector plane at
+     * the next vertex.
+     * * For best results, the caller should place `initialSection` in a plane perpendicular to the `centerline`
+     * start tangent.
+     *   * This plane is commonly (but not necessarily) through the centerline start point itself.
+     *   * To compute the sections, `initialSection` is projected in the direction of the centerline start tangent onto
+     * the first bisector plane at the centerline start. The result of this projection will be likewise projected onto
+     * the second plane, and so on in sequence.
+     * * By default, the first/last bisector plane normals are set to the centerline start/end tangents. The caller can
+     * override these with tangents supplied in `options`. If the centerline is physically closed and
+     * `options.wrapIfPhysicallyClosed` is true, the first and last plane normals are averaged and equated.
+     * * The centerline path does NOT have to be planar, however non-planarity will result in twisting of the sections
+     * in the bisector planes.
+     * @param centerline sweep path. Will be stroked if smooth.
+     * @param initialSection profile curve to be swept. As noted above, this should be on a plane perpendicular to the
+     * centerline start tangent.
+     * @param options options for computation and output.
+     * @return array of sections, formed from projecting `initialSection` successively onto the bisector planes.
+     */
+    static createMiteredSweepSections(centerline: IndexedXYZCollection | Point3d[] | CurvePrimitive | CurveChain, initialSection: AnyCurve, options?: MiteredSweepOptions): SectionSequenceWithPlanes | undefined;
     /**
      * Create a circular arc from start point, tangent at start, radius, optional plane normal, arc sweep.
      * * The vector from start point to center is in the direction of upVector crossed with tangentA.
@@ -160,11 +199,11 @@ export declare class CurveFactory {
     /**
      * Compute 2 spirals (all in XY) for a symmetric line-to-line transition.
      * * First spiral begins at given start point.
-     * * first tangent aims at shoulder
+     * * first tangent aims at shoulder.
      * * outbound spiral joins line from shoulder to target.
-     * @param spiralType name of spiral type.  THIS MUST BE AN "Integrated" SPIRAL TYPE
+     * @param spiralType name of spiral type. THIS MUST BE AN "Integrated" SPIRAL TYPE.
      * @param startPoint inbound start point.
-     * @param shoulder point target point for (both) spiral-to-line tangencies
+     * @param shoulder point target point for (both) spiral-to-line tangencies.
      * @return array with the computed spirals, or undefined if failure.
      */
     static createLineSpiralSpiralLine(spiralType: IntegratedSpiralTypeName, startPoint: Point3d, shoulderPoint: Point3d, targetPoint: Point3d): GeometryQuery[] | undefined;
@@ -172,30 +211,25 @@ export declare class CurveFactory {
      * Compute 2 spirals (all in XY) for a symmetric line-to-line transition.
      * * Spiral length is given.
      * * tangency points float on both lines.
-     * @param spiralType name of spiral type.  THIS MUST BE AN "Integrated" SPIRAL TYPE
+     * @param spiralType name of spiral type.  THIS MUST BE AN "Integrated" SPIRAL TYPE.
      * @param pointA inbound start point.
-     * @param shoulder point target point for (both) spiral-to-line tangencies
+     * @param shoulder point target point for (both) spiral-to-line tangencies.
      * @param spiralLength for each part of the spiral pair.
      * @return array with the computed spirals, or undefined if failure.
      */
     static createLineSpiralSpiralLineWithSpiralLength(spiralType: IntegratedSpiralTypeName, pointA: Point3d, pointB: Point3d, pointC: Point3d, spiralLength: number): GeometryQuery[] | undefined;
     /**
      * Compute 2 spirals and an arc (all in XY) for a symmetric line-to-line transition.
-     * Spiral lengths and arc radius are given.   (e.g. from design speed standards.)
-     * @param spiralType name of spiral type.  THIS MUST BE AN "Integrated" SPIRAL TYPE
+     * Spiral lengths and arc radius are given (e.g., from design speed standards).
+     * @param spiralType name of spiral type. THIS MUST BE AN "Integrated" SPIRAL TYPE.
      * @param pointA inbound start point.
-     * @param pointB shoulder (target)  point for (both) spiral-to-line tangencies
-     * @param lengthA inbound spiral length
-     * @param lengthB outbound spiral length
+     * @param pointB shoulder (target)  point for (both) spiral-to-line tangencies.
+     * @param lengthA inbound spiral length.
+     * @param lengthB outbound spiral length.
      * @return array with the computed spirals, or undefined if failure.
      */
     static createLineSpiralArcSpiralLine(spiralType: IntegratedSpiralTypeName, pointA: Point3d, pointB: Point3d, pointC: Point3d, lengthA: number, lengthB: number, arcRadius: number): GeometryQuery[] | undefined;
-    /**
-     * Return the intersection point of 3 planes.
-     * @param planeA
-     * @param planeB
-     * @param planeC
-     */
+    /** Return the intersection point of 3 planes. */
     static planePlaneIntersectionRay(planeA: PlaneAltitudeEvaluator, planeB: PlaneAltitudeEvaluator): Ray3d | undefined;
 }
 //# sourceMappingURL=CurveFactory.d.ts.map

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

	@@ -1 +1 @@
1	- {"version":3,"file":"CurveFactory.d.ts","sourceRoot":"","sources":["../../../src/curve/CurveFactory.ts"],"names":[],"mappings":"AAKA;;GAEG;~~AAIH~~,OAAO,EAAkC,sBAAsB,EAAE,MAAM,aAAa,CAAC;AACrF,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAC5C,OAAO,EAAE,UAAU,EAAE,MAAM,0BAA0B,CAAC;AACtD,OAAO,EAAE,SAAS,EAAE,iBAAiB,EAAE,MAAM,yBAAyB,CAAC;AACvE,OAAO,EAAE,oBAAoB,EAAE,MAAM,oCAAoC,CAAC;AAE1E,OAAO,EAAE,4BAA4B,EAAE,MAAM,4CAA4C,CAAC;AAG1F,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAElE,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAG5C,OAAO,EAAE,KAAK,EAAE,MAAM,wBAAwB,CAAC;AAE/C,OAAO,EAAE,eAAe,EAAE,MAAM,sBAAsB,CAAC;AAGvD,OAAO,EAAE,UAAU,EAAE,MAAM,qBAAqB,CAAC;AAEjD,OAAO,EAAE,KAAK,EAAgB,MAAM,SAAS,CAAC;AAC9C,OAAO,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AAC/C,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAClD,OAAO,EAAE,QAAQ,~~EAAE~~,MAAM,cAAc,CAAC;~~AACxC~~,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAEhD,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAC9C,OAAO,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAC9B,OAAO,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;~~AAE9B~~,OAAO,EAAE,wBAAwB,EAAE,MAAM,6BAA6B,CAAC;AACvE,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAIhD~~;;;GAGG~~;AACH,MAAM,WAAW,yBAAyB;IACxC,~~gCAAgC~~;~~IAChC~~,MAAM,EAAE,4BAA4B,EAAE,CAAC;IACvC,~~2DAA2D~~;~~IAC3D~~,QAAQ,EAAE,QAAQ,EAAE,CAAC;IACrB;;;OAGG;IACH,UAAU,CAAC,EAAE,UAAU,CAAC;IACxB,iFAAiF;IACjF,IAAI,CAAC,EAAE,eAAe,CAAC;CACxB;AAED;;;GAGG;AACH,oBAAY,wBAAwB;IAClC,8DAA8D;IAC9D,QAAQ,IAAI;IACZ,wEAAwE;IACxE,cAAc,IAAI;IAClB,6FAA6F;IAC7F,QAAQ,IAAI;CACb;AAED;;;GAGG;AACH,MAAM,WAAW,mBAAmB;IAClC,iIAAiI;IACjI,sBAAsB,CAAC,EAAE,OAAO,CAAC;IACjC,uJAAuJ;IACvJ,YAAY,CAAC,EAAE,wBAAwB,CAAC;IACxC,~~yGAAyG~~;~~IACzG~~,aAAa,CAAC,EAAE,aAAa,CAAC;IAC9B,oGAAoG;IACpG,MAAM,CAAC,EAAE,OAAO,CAAC;~~CAClB~~;~~AAED~~;;;GAGG;AACH,qBAAa,YAAY;IACvB,mFAAmF;IACnF,OAAO,CAAC,MAAM,CAAC,iBAAiB;~~IAMhC~~;;;;OAIG;WACW,0BAA0B,CAAC,KAAK,EAAE,OAAO,EAAE,cAAc,EAAE,QAAQ,EAAE,GAAG,EAAE,OAAO,GAAG,KAAK,GAAG,SAAS;IAOnH;;;;;;;;;OASG;WACW,yBAAyB,~~CAAC~~,MAAM,EAAE,YAAY,GAAG,oBAAoB,GAAG,OAAO,EAAE,~~EAAE~~,MAAM,EAAE,MAAM,GAAG,MAAM,EAAE,~~EAAE~~,oBAAoB,GAAE,OAAc,~~GAAG~~,IAAI,GAAG,SAAS;~~IAuEnL;;;MAGE~~;~~WACY~~,iBAAiB,~~CAAC~~,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,GAAE,MAAU,EAAE,YAAY,CAAC,EAAE,MAAM,~~GAAG~~,IAAI;~~IAkC3H~~;;;;;;;OAOG;WACW,kBAAkB,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,YAAY,GAAE,OAAe,GAAG,OAAO;~~IA2BlG;;;;;;OAMG~~;WACW,2BAA2B,~~CAAC~~,SAAS,EAAE,SAAS,EAAE,UAAU,EAAE,iBAAiB,EAAE,EAAE,6BAA6B,GAAE,MAAY,~~GAAG~~,IAAI;~~IAYnJ~~,OAAO,CAAC,MAAM,CAAC,wBAAwB;~~IAUvC~~;;;;OAIG;WACW,kBAAkB,~~CAAC~~,UAAU,EAAE,cAAc,GAAG,UAAU,EAAE,UAAU,EAAE,MAAM,~~GAAG~~,aAAa,GAAG,aAAa,EAAE,GAAG,SAAS;~~IAoB1I;;;;;;;;;;;OAWG~~;WACW,yBAAyB,CAAC,UAAU,EAAE,oBAAoB,EAAE,WAAW,EAAE,MAAM,GAAG,KAAK,GAAG,KAAK,GAAG,KAAK,EAAE;~~IAqDvH;;;;;;;;;;;;;;OAcG~~;WACW,0BAA0B,~~CAAC~~,UAAU,EAAE,oBAAoB,GAAG,OAAO,EAAE,~~EAAE~~,cAAc,EAAE,QAAQ,~~EAAE~~,OAAO,EAAE,mBAAmB,~~GAAG~~,yBAAyB,GAAG,SAAS;~~IA2CrL~~;;;;;;;;OAQG;WACW,2BAA2B,CACvC,KAAK,EAAE,OAAO,EAAE,cAAc,EAAE,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,CAAC,EAAE,QAAQ,EAAE,KAAK,CAAC,EAAE,KAAK,GAAG,UAAU,GACxG,KAAK,GAAG,SAAS;~~IAIpB~~;;;;;;;;;OASG;WACW,0BAA0B,CACtC,UAAU,EAAE,wBAAwB,EACpC,UAAU,EAAE,OAAO,EACnB,aAAa,EAAE,OAAO,EACtB,WAAW,EAAE,OAAO,GACnB,aAAa,EAAE,GAAG,SAAS;~~IAmC9B~~;;;;;;;;;OASG;WACW,0CAA0C,CACtD,UAAU,EAAE,wBAAwB,EACpC,MAAM,EAAE,OAAO,EACf,MAAM,EAAE,OAAO,EACf,MAAM,EAAE,OAAO,EACf,YAAY,EAAE,MAAM,GACnB,aAAa,EAAE,GAAG,SAAS;~~IAoC9B~~;;;;;;;;;OASG;WACW,6BAA6B,CACzC,UAAU,EAAE,wBAAwB,EACpC,MAAM,EAAE,OAAO,EACf,MAAM,EAAE,OAAO,EACf,MAAM,EAAE,OAAO,EACf,OAAO,EAAE,MAAM,EACf,OAAO,EAAE,MAAM,EACf,SAAS,EAAE,MAAM,GAChB,aAAa,EAAE,GAAG,SAAS;~~IAoD9B;;;;;OAKG~~;~~WACW~~,yBAAyB,CACrC,MAAM,EAAE,sBAAsB,EAAE,MAAM,EAAE,sBAAsB,GAAG,KAAK,GAAG,SAAS;~~CAuBrF~~"}
1	+ {"version":3,"file":"CurveFactory.d.ts","sourceRoot":"","sources":["../../../src/curve/CurveFactory.ts"],"names":[],"mappings":"AAKA;;GAEG;AAEH,OAAO,EAAkC,sBAAsB,EAAE,MAAM,aAAa,CAAC;AACrF,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAC5C,OAAO,EAAE,UAAU,EAAE,MAAM,0BAA0B,CAAC;AACtD,OAAO,EAAE,SAAS,EAAE,iBAAiB,EAAE,MAAM,yBAAyB,CAAC;AACvE,OAAO,EAAE,oBAAoB,EAAE,MAAM,oCAAoC,CAAC;AAE1E,OAAO,EAAE,4BAA4B,EAAE,MAAM,4CAA4C,CAAC;AAG1F,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAElE,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAG5C,OAAO,EAAE,KAAK,EAAE,MAAM,wBAAwB,CAAC;AAE/C,OAAO,EAAE,eAAe,EAAE,MAAM,sBAAsB,CAAC;AAGvD,OAAO,EAAE,UAAU,EAAE,MAAM,qBAAqB,CAAC;AAEjD,OAAO,EAAE,KAAK,EAAgB,MAAM,SAAS,CAAC;AAC9C,OAAO,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AAC/C,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAClD,OAAO,EAAE,QAAQ,EAAa,MAAM,cAAc,CAAC;AACnD,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAEhD,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAC9C,OAAO,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAC9B,OAAO,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAG9B,OAAO,EAAE,wBAAwB,EAAE,MAAM,6BAA6B,CAAC;AACvE,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAIhD;;;;GAIG;AACH,MAAM,WAAW,yBAAyB;IACxC,iCAAiC;IACjC,MAAM,EAAE,4BAA4B,EAAE,CAAC;IACvC,4DAA4D;IAC5D,QAAQ,EAAE,QAAQ,EAAE,CAAC;IACrB;;;OAGG;IACH,UAAU,CAAC,EAAE,UAAU,CAAC;IACxB,iFAAiF;IACjF,IAAI,CAAC,EAAE,eAAe,CAAC;CACxB;AAED;;;GAGG;AACH,oBAAY,wBAAwB;IAClC,8DAA8D;IAC9D,QAAQ,IAAI;IACZ,wEAAwE;IACxE,cAAc,IAAI;IAClB,6FAA6F;IAC7F,QAAQ,IAAI;CACb;AAED;;;GAGG;AACH,MAAM,WAAW,mBAAmB;IAClC,iIAAiI;IACjI,sBAAsB,CAAC,EAAE,OAAO,CAAC;IACjC,uJAAuJ;IACvJ,YAAY,CAAC,EAAE,wBAAwB,CAAC;IACxC,wFAAwF;IACxF,aAAa,CAAC,EAAE,aAAa,CAAC;IAC9B,oGAAoG;IACpG,MAAM,CAAC,EAAE,OAAO,CAAC;IACjB,wIAAwI;IACxI,YAAY,CAAC,EAAE,QAAQ,CAAC;IACxB,qIAAqI;IACrI,UAAU,CAAC,EAAE,QAAQ,CAAC;CACvB;AAeD;;;GAGG;AACH,qBAAa,YAAY;IACvB,mFAAmF;IACnF,OAAO,CAAC,MAAM,CAAC,iBAAiB;IAUhC;;;;OAIG;WACW,0BAA0B,CAAC,KAAK,EAAE,OAAO,EAAE,cAAc,EAAE,QAAQ,EAAE,GAAG,EAAE,OAAO,GAAG,KAAK,GAAG,SAAS;IAOnH;;;;;;;;;OASG;WACW,yBAAyB,CACrC,MAAM,EAAE,YAAY,GAAG,oBAAoB,GAAG,OAAO,EAAE,EACvD,MAAM,EAAE,MAAM,GAAG,MAAM,EAAE,EACzB,oBAAoB,GAAE,OAAc,GACnC,IAAI,GAAG,SAAS;IAuEnB;;;;OAIG;WACW,iBAAiB,CAC7B,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,GAAE,MAAU,EAAE,YAAY,CAAC,EAAE,MAAM,GACnF,IAAI;IA4CP;;;;;;;OAOG;WACW,kBAAkB,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,YAAY,GAAE,OAAe,GAAG,OAAO;IA6BlG;;;;;;;OAOG;WACW,2BAA2B,CACvC,SAAS,EAAE,SAAS,EAAE,UAAU,EAAE,iBAAiB,EAAE,EAAE,6BAA6B,GAAE,MAAY,GACjG,IAAI;IAWP,OAAO,CAAC,MAAM,CAAC,wBAAwB;IAQvC;;;;OAIG;WACW,kBAAkB,CAC9B,UAAU,EAAE,cAAc,GAAG,UAAU,EAAE,UAAU,EAAE,MAAM,GAC1D,aAAa,GAAG,aAAa,EAAE,GAAG,SAAS;IAmB9C,0DAA0D;IAC1D,OAAO,CAAC,MAAM,CAAC,oBAAoB;IAYnC,uGAAuG;WACzF,wBAAwB,CACpC,UAAU,EAAE,oBAAoB,GAAG,OAAO,EAAE,GAAG,cAAc,EAAE,WAAW,EAAE,MAAM,GAAG,KAAK,GAAG,KAAK,GACjG,KAAK,GAAG,SAAS;IAsBpB;;;;;;;;;;;;;;;;;;;OAmBG;WACW,yBAAyB,CAAC,UAAU,EAAE,oBAAoB,EAAE,WAAW,EAAE,MAAM,GAAG,KAAK,GAAG,KAAK,GAAG,KAAK,EAAE;IAUvH,6EAA6E;IAC7E,OAAO,CAAC,MAAM,CAAC,iBAAiB;IAuBhC;;;OAGG;IACH,OAAO,CAAC,MAAM,CAAC,+BAA+B;IAsB9C,qHAAqH;IACrH,OAAO,CAAC,MAAM,CAAC,uBAAuB;IAmBtC;;;;OAIG;IACH,OAAO,CAAC,MAAM,CAAC,cAAc;IAqB7B;;;;;;;;;;;;;;;;;;;OAmBG;WACW,0BAA0B,CACtC,UAAU,EAAE,oBAAoB,GAAG,OAAO,EAAE,GAAG,cAAc,GAAG,UAAU,EAC1E,cAAc,EAAE,QAAQ,EACxB,OAAO,CAAC,EAAE,mBAAmB,GAC5B,yBAAyB,GAAG,SAAS;IAiCxC;;;;;;;;OAQG;WACW,2BAA2B,CACvC,KAAK,EAAE,OAAO,EAAE,cAAc,EAAE,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,CAAC,EAAE,QAAQ,EAAE,KAAK,CAAC,EAAE,KAAK,GAAG,UAAU,GACxG,KAAK,GAAG,SAAS;IAGpB;;;;;;;;;OASG;WACW,0BAA0B,CACtC,UAAU,EAAE,wBAAwB,EACpC,UAAU,EAAE,OAAO,EACnB,aAAa,EAAE,OAAO,EACtB,WAAW,EAAE,OAAO,GACnB,aAAa,EAAE,GAAG,SAAS;IAkC9B;;;;;;;;;OASG;WACW,0CAA0C,CACtD,UAAU,EAAE,wBAAwB,EACpC,MAAM,EAAE,OAAO,EACf,MAAM,EAAE,OAAO,EACf,MAAM,EAAE,OAAO,EACf,YAAY,EAAE,MAAM,GACnB,aAAa,EAAE,GAAG,SAAS;IA4C9B;;;;;;;;;OASG;WACW,6BAA6B,CACzC,UAAU,EAAE,wBAAwB,EACpC,MAAM,EAAE,OAAO,EACf,MAAM,EAAE,OAAO,EACf,MAAM,EAAE,OAAO,EACf,OAAO,EAAE,MAAM,EACf,OAAO,EAAE,MAAM,EACf,SAAS,EAAE,MAAM,GAChB,aAAa,EAAE,GAAG,SAAS;IAkD9B,iDAAiD;WACnC,yBAAyB,CACrC,MAAM,EAAE,sBAAsB,EAAE,MAAM,EAAE,sBAAsB,GAAG,KAAK,GAAG,SAAS;CAsBrF"}