@itwin/core-geometry 5.1.0-dev.22 → 5.1.0-dev.26

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 (463) hide show
  1. package/lib/cjs/Constant.js.map +1 -1
  2. package/lib/cjs/Geometry.js.map +1 -1
  3. package/lib/cjs/bspline/AkimaCurve3d.js.map +1 -1
  4. package/lib/cjs/bspline/BSpline1dNd.js.map +1 -1
  5. package/lib/cjs/bspline/BSplineCurve.js.map +1 -1
  6. package/lib/cjs/bspline/BSplineCurve3dH.js.map +1 -1
  7. package/lib/cjs/bspline/BSplineCurveOps.js.map +1 -1
  8. package/lib/cjs/bspline/BSplineSurface.js.map +1 -1
  9. package/lib/cjs/bspline/Bezier1dNd.js.map +1 -1
  10. package/lib/cjs/bspline/BezierCurve3d.js.map +1 -1
  11. package/lib/cjs/bspline/BezierCurve3dH.js.map +1 -1
  12. package/lib/cjs/bspline/BezierCurveBase.js.map +1 -1
  13. package/lib/cjs/bspline/InterpolationCurve3d.js.map +1 -1
  14. package/lib/cjs/bspline/KnotVector.js.map +1 -1
  15. package/lib/cjs/bspline/SurfaceLocationDetail.js.map +1 -1
  16. package/lib/cjs/clipping/AlternatingConvexClipTree.js.map +1 -1
  17. package/lib/cjs/clipping/BooleanClipFactory.js.map +1 -1
  18. package/lib/cjs/clipping/BooleanClipNode.js.map +1 -1
  19. package/lib/cjs/clipping/ClipPlane.js.map +1 -1
  20. package/lib/cjs/clipping/ClipPrimitive.js.map +1 -1
  21. package/lib/cjs/clipping/ClipUtils.js.map +1 -1
  22. package/lib/cjs/clipping/ClipVector.js.map +1 -1
  23. package/lib/cjs/clipping/ConvexClipPlaneSet.js.map +1 -1
  24. package/lib/cjs/clipping/UnionOfConvexClipPlaneSets.js.map +1 -1
  25. package/lib/cjs/clipping/internalContexts/LineStringOffsetClipperContext.js.map +1 -1
  26. package/lib/cjs/core-geometry.js.map +1 -1
  27. package/lib/cjs/curve/Arc3d.js.map +1 -1
  28. package/lib/cjs/curve/ConstructCurveBetweenCurves.js.map +1 -1
  29. package/lib/cjs/curve/CoordinateXYZ.js.map +1 -1
  30. package/lib/cjs/curve/CurveChainWithDistanceIndex.js.map +1 -1
  31. package/lib/cjs/curve/CurveCollection.d.ts +31 -1
  32. package/lib/cjs/curve/CurveCollection.d.ts.map +1 -1
  33. package/lib/cjs/curve/CurveCollection.js +65 -0
  34. package/lib/cjs/curve/CurveCollection.js.map +1 -1
  35. package/lib/cjs/curve/CurveCurve.js.map +1 -1
  36. package/lib/cjs/curve/CurveExtendMode.js.map +1 -1
  37. package/lib/cjs/curve/CurveFactory.js.map +1 -1
  38. package/lib/cjs/curve/CurveLocationDetail.d.ts +24 -24
  39. package/lib/cjs/curve/CurveLocationDetail.d.ts.map +1 -1
  40. package/lib/cjs/curve/CurveLocationDetail.js +24 -24
  41. package/lib/cjs/curve/CurveLocationDetail.js.map +1 -1
  42. package/lib/cjs/curve/CurveOps.js.map +1 -1
  43. package/lib/cjs/curve/CurvePrimitive.d.ts +2 -2
  44. package/lib/cjs/curve/CurvePrimitive.js.map +1 -1
  45. package/lib/cjs/curve/CurveProcessor.js.map +1 -1
  46. package/lib/cjs/curve/CurveTypes.js.map +1 -1
  47. package/lib/cjs/curve/CurveWireMomentsXYZ.js.map +1 -1
  48. package/lib/cjs/curve/GeometryQuery.js.map +1 -1
  49. package/lib/cjs/curve/LineSegment3d.js.map +1 -1
  50. package/lib/cjs/curve/LineString3d.js.map +1 -1
  51. package/lib/cjs/curve/Loop.js.map +1 -1
  52. package/lib/cjs/curve/OffsetOptions.js.map +1 -1
  53. package/lib/cjs/curve/ParityRegion.js.map +1 -1
  54. package/lib/cjs/curve/Path.js.map +1 -1
  55. package/lib/cjs/curve/PointString3d.js.map +1 -1
  56. package/lib/cjs/curve/ProxyCurve.js.map +1 -1
  57. package/lib/cjs/curve/Query/ConsolidateAdjacentPrimitivesContext.js.map +1 -1
  58. package/lib/cjs/curve/Query/CurveSplitContext.js.map +1 -1
  59. package/lib/cjs/curve/Query/CylindricalRange.js.map +1 -1
  60. package/lib/cjs/curve/Query/InOutTests.js.map +1 -1
  61. package/lib/cjs/curve/Query/PlanarSubdivision.js.map +1 -1
  62. package/lib/cjs/curve/Query/StrokeCountChain.js.map +1 -1
  63. package/lib/cjs/curve/Query/StrokeCountMap.js.map +1 -1
  64. package/lib/cjs/curve/RegionMomentsXY.js.map +1 -1
  65. package/lib/cjs/curve/RegionOps.js.map +1 -1
  66. package/lib/cjs/curve/RegionOpsClassificationSweeps.js.map +1 -1
  67. package/lib/cjs/curve/StrokeOptions.js.map +1 -1
  68. package/lib/cjs/curve/UnionRegion.js.map +1 -1
  69. package/lib/cjs/curve/internalContexts/AnnounceTangentStrokeHandler.js.map +1 -1
  70. package/lib/cjs/curve/internalContexts/AppendPlaneIntersectionStrokeHandler.js.map +1 -1
  71. package/lib/cjs/curve/internalContexts/ChainCollectorContext.js.map +1 -1
  72. package/lib/cjs/curve/internalContexts/CloneCurvesContext.js.map +1 -1
  73. package/lib/cjs/curve/internalContexts/CloneWithExpandedLineStrings.js.map +1 -1
  74. package/lib/cjs/curve/internalContexts/ClosestPointStrokeHandler.js.map +1 -1
  75. package/lib/cjs/curve/internalContexts/CountLinearPartsSearchContext.js.map +1 -1
  76. package/lib/cjs/curve/internalContexts/CurveCurveCloseApproachXY.js.map +1 -1
  77. package/lib/cjs/curve/internalContexts/CurveCurveIntersectXY.js.map +1 -1
  78. package/lib/cjs/curve/internalContexts/CurveCurveIntersectXYZ.js.map +1 -1
  79. package/lib/cjs/curve/internalContexts/CurveLengthContext.js.map +1 -1
  80. package/lib/cjs/curve/internalContexts/CurveOffsetXYHandler.js.map +1 -1
  81. package/lib/cjs/curve/internalContexts/EllipticalArcApproximationContext.js.map +1 -1
  82. package/lib/cjs/curve/internalContexts/GapSearchContext.js.map +1 -1
  83. package/lib/cjs/curve/internalContexts/MultiChainCollector.js.map +1 -1
  84. package/lib/cjs/curve/internalContexts/NewtonRtoRStrokeHandler.js.map +1 -1
  85. package/lib/cjs/curve/internalContexts/PlaneAltitudeRangeContext.js.map +1 -1
  86. package/lib/cjs/curve/internalContexts/PolygonOffsetContext.js.map +1 -1
  87. package/lib/cjs/curve/internalContexts/SumLengthsContext.js.map +1 -1
  88. package/lib/cjs/curve/internalContexts/TransferWithSplitArcs.js.map +1 -1
  89. package/lib/cjs/curve/internalContexts/TransformInPlaceContext.js.map +1 -1
  90. package/lib/cjs/curve/spiral/AustralianRailCorpXYEvaluator.js.map +1 -1
  91. package/lib/cjs/curve/spiral/ClothoidSeries.js.map +1 -1
  92. package/lib/cjs/curve/spiral/CubicEvaluator.js.map +1 -1
  93. package/lib/cjs/curve/spiral/CzechSpiralEvaluator.js.map +1 -1
  94. package/lib/cjs/curve/spiral/DirectHalfCosineSpiralEvaluator.js.map +1 -1
  95. package/lib/cjs/curve/spiral/DirectSpiral3d.js.map +1 -1
  96. package/lib/cjs/curve/spiral/IntegratedSpiral3d.js.map +1 -1
  97. package/lib/cjs/curve/spiral/MXCubicAlongArcSpiralEvaluator.js.map +1 -1
  98. package/lib/cjs/curve/spiral/NormalizedTransition.js.map +1 -1
  99. package/lib/cjs/curve/spiral/PolishCubicSpiralEvaluator.js.map +1 -1
  100. package/lib/cjs/curve/spiral/TransitionConditionalProperties.js.map +1 -1
  101. package/lib/cjs/curve/spiral/TransitionSpiral3d.js.map +1 -1
  102. package/lib/cjs/curve/spiral/XYCurveEvaluator.js.map +1 -1
  103. package/lib/cjs/geometry3d/Angle.js.map +1 -1
  104. package/lib/cjs/geometry3d/AngleSweep.js.map +1 -1
  105. package/lib/cjs/geometry3d/BarycentricTriangle.js.map +1 -1
  106. package/lib/cjs/geometry3d/BilinearPatch.js.map +1 -1
  107. package/lib/cjs/geometry3d/CoincidentGeometryOps.js.map +1 -1
  108. package/lib/cjs/geometry3d/Ellipsoid.js.map +1 -1
  109. package/lib/cjs/geometry3d/FrameBuilder.js.map +1 -1
  110. package/lib/cjs/geometry3d/FrustumAnimation.js.map +1 -1
  111. package/lib/cjs/geometry3d/GeometryHandler.js.map +1 -1
  112. package/lib/cjs/geometry3d/GrowableBlockedArray.js.map +1 -1
  113. package/lib/cjs/geometry3d/GrowableFloat64Array.js.map +1 -1
  114. package/lib/cjs/geometry3d/GrowableXYArray.js.map +1 -1
  115. package/lib/cjs/geometry3d/GrowableXYZArray.js.map +1 -1
  116. package/lib/cjs/geometry3d/IndexedCollectionInterval.js.map +1 -1
  117. package/lib/cjs/geometry3d/IndexedXYCollection.js.map +1 -1
  118. package/lib/cjs/geometry3d/IndexedXYZCollection.js.map +1 -1
  119. package/lib/cjs/geometry3d/LongitudeLatitudeAltitude.js.map +1 -1
  120. package/lib/cjs/geometry3d/Matrix3d.js.map +1 -1
  121. package/lib/cjs/geometry3d/OrderedRotationAngles.js.map +1 -1
  122. package/lib/cjs/geometry3d/Plane3d.js.map +1 -1
  123. package/lib/cjs/geometry3d/Plane3dByOriginAndUnitNormal.js.map +1 -1
  124. package/lib/cjs/geometry3d/Plane3dByOriginAndVectors.js.map +1 -1
  125. package/lib/cjs/geometry3d/Point2dArrayCarrier.js.map +1 -1
  126. package/lib/cjs/geometry3d/Point2dVector2d.js.map +1 -1
  127. package/lib/cjs/geometry3d/Point3dArrayCarrier.js.map +1 -1
  128. package/lib/cjs/geometry3d/Point3dVector3d.js.map +1 -1
  129. package/lib/cjs/geometry3d/PointHelpers.js.map +1 -1
  130. package/lib/cjs/geometry3d/PointStreaming.js.map +1 -1
  131. package/lib/cjs/geometry3d/PolygonOps.js.map +1 -1
  132. package/lib/cjs/geometry3d/PolylineCompressionByEdgeOffset.js.map +1 -1
  133. package/lib/cjs/geometry3d/PolylineOps.js.map +1 -1
  134. package/lib/cjs/geometry3d/Range.js.map +1 -1
  135. package/lib/cjs/geometry3d/Ray2d.js.map +1 -1
  136. package/lib/cjs/geometry3d/Ray3d.js.map +1 -1
  137. package/lib/cjs/geometry3d/ReusableObjectCache.js.map +1 -1
  138. package/lib/cjs/geometry3d/Segment1d.js.map +1 -1
  139. package/lib/cjs/geometry3d/SortablePolygon.js.map +1 -1
  140. package/lib/cjs/geometry3d/Transform.js.map +1 -1
  141. package/lib/cjs/geometry3d/UVSurfaceOps.js.map +1 -1
  142. package/lib/cjs/geometry3d/XYZProps.js.map +1 -1
  143. package/lib/cjs/geometry3d/YawPitchRollAngles.js.map +1 -1
  144. package/lib/cjs/geometry4d/Map4d.js.map +1 -1
  145. package/lib/cjs/geometry4d/Matrix4d.js.map +1 -1
  146. package/lib/cjs/geometry4d/MomentData.js.map +1 -1
  147. package/lib/cjs/geometry4d/PlaneByOriginAndVectors4d.js.map +1 -1
  148. package/lib/cjs/geometry4d/Point4d.js.map +1 -1
  149. package/lib/cjs/numerics/BandedSystem.js.map +1 -1
  150. package/lib/cjs/numerics/BezierPolynomials.js.map +1 -1
  151. package/lib/cjs/numerics/ClusterableArray.js.map +1 -1
  152. package/lib/cjs/numerics/Complex.js.map +1 -1
  153. package/lib/cjs/numerics/ConvexPolygon2d.js.map +1 -1
  154. package/lib/cjs/numerics/Newton.js.map +1 -1
  155. package/lib/cjs/numerics/PascalCoefficients.js.map +1 -1
  156. package/lib/cjs/numerics/PolarData.js.map +1 -1
  157. package/lib/cjs/numerics/Polynomials.js.map +1 -1
  158. package/lib/cjs/numerics/Quadrature.js.map +1 -1
  159. package/lib/cjs/numerics/Range1dArray.js.map +1 -1
  160. package/lib/cjs/numerics/SmallSystem.js.map +1 -1
  161. package/lib/cjs/numerics/TriDiagonalSystem.js.map +1 -1
  162. package/lib/cjs/numerics/UnionFind.js.map +1 -1
  163. package/lib/cjs/numerics/UsageSums.js.map +1 -1
  164. package/lib/cjs/polyface/AuxData.js.map +1 -1
  165. package/lib/cjs/polyface/BoxTopology.js.map +1 -1
  166. package/lib/cjs/polyface/FacetFaceData.js.map +1 -1
  167. package/lib/cjs/polyface/FacetLocationDetail.js.map +1 -1
  168. package/lib/cjs/polyface/FacetOrientation.js.map +1 -1
  169. package/lib/cjs/polyface/GreedyTriangulationBetweenLineStrings.js.map +1 -1
  170. package/lib/cjs/polyface/IndexedEdgeMatcher.js.map +1 -1
  171. package/lib/cjs/polyface/IndexedPolyfaceVisitor.js.map +1 -1
  172. package/lib/cjs/polyface/IndexedPolyfaceWalker.js.map +1 -1
  173. package/lib/cjs/polyface/Polyface.js.map +1 -1
  174. package/lib/cjs/polyface/PolyfaceBuilder.js.map +1 -1
  175. package/lib/cjs/polyface/PolyfaceClip.js.map +1 -1
  176. package/lib/cjs/polyface/PolyfaceData.js.map +1 -1
  177. package/lib/cjs/polyface/PolyfaceQuery.js.map +1 -1
  178. package/lib/cjs/polyface/RangeLengthData.js.map +1 -1
  179. package/lib/cjs/polyface/RangeTree/LineString3dRangeTreeContext.js.map +1 -1
  180. package/lib/cjs/polyface/RangeTree/MinimumValueTester.js.map +1 -1
  181. package/lib/cjs/polyface/RangeTree/Point3dArrayRangeTreeContext.js.map +1 -1
  182. package/lib/cjs/polyface/RangeTree/PolyfaceRangeTreeContext.js.map +1 -1
  183. package/lib/cjs/polyface/RangeTree/RangeTreeNode.js.map +1 -1
  184. package/lib/cjs/polyface/RangeTree/RangeTreeSearchHandlers.js.map +1 -1
  185. package/lib/cjs/polyface/TaggedNumericData.js.map +1 -1
  186. package/lib/cjs/polyface/TriangleCandidate.js.map +1 -1
  187. package/lib/cjs/polyface/multiclip/BuildAverageNormalsContext.js.map +1 -1
  188. package/lib/cjs/polyface/multiclip/GriddedRaggedRange2dSet.js.map +1 -1
  189. package/lib/cjs/polyface/multiclip/GriddedRaggedRange2dSetWithOverflow.js.map +1 -1
  190. package/lib/cjs/polyface/multiclip/LinearSearchRange2dArray.js.map +1 -1
  191. package/lib/cjs/polyface/multiclip/OffsetMeshContext.js.map +1 -1
  192. package/lib/cjs/polyface/multiclip/Range2dSearchInterface.js.map +1 -1
  193. package/lib/cjs/polyface/multiclip/RangeSearch.js.map +1 -1
  194. package/lib/cjs/polyface/multiclip/SweepLineStringToFacetContext.js.map +1 -1
  195. package/lib/cjs/polyface/multiclip/XYPointBuckets.js.map +1 -1
  196. package/lib/cjs/serialization/BGFBAccessors.js.map +1 -1
  197. package/lib/cjs/serialization/BGFBReader.js.map +1 -1
  198. package/lib/cjs/serialization/BGFBWriter.js.map +1 -1
  199. package/lib/cjs/serialization/BentleyGeometryFlatBuffer.js.map +1 -1
  200. package/lib/cjs/serialization/DeepCompare.js.map +1 -1
  201. package/lib/cjs/serialization/GeometrySamples.js.map +1 -1
  202. package/lib/cjs/serialization/IModelJsonSchema.js.map +1 -1
  203. package/lib/cjs/serialization/SerializationHelpers.js.map +1 -1
  204. package/lib/cjs/solid/Box.js.map +1 -1
  205. package/lib/cjs/solid/Cone.js.map +1 -1
  206. package/lib/cjs/solid/LinearSweep.js.map +1 -1
  207. package/lib/cjs/solid/RotationalSweep.js.map +1 -1
  208. package/lib/cjs/solid/RuledSweep.js.map +1 -1
  209. package/lib/cjs/solid/SolidPrimitive.js.map +1 -1
  210. package/lib/cjs/solid/Sphere.js.map +1 -1
  211. package/lib/cjs/solid/SweepContour.js.map +1 -1
  212. package/lib/cjs/solid/TorusPipe.js.map +1 -1
  213. package/lib/cjs/topology/ChainMerge.js.map +1 -1
  214. package/lib/cjs/topology/Graph.js.map +1 -1
  215. package/lib/cjs/topology/HalfEdgeGraphFromIndexedLoopsContext.js.map +1 -1
  216. package/lib/cjs/topology/HalfEdgeGraphSearch.js.map +1 -1
  217. package/lib/cjs/topology/HalfEdgeGraphSpineContext.js.map +1 -1
  218. package/lib/cjs/topology/HalfEdgeGraphValidation.js.map +1 -1
  219. package/lib/cjs/topology/HalfEdgeMarkSet.js.map +1 -1
  220. package/lib/cjs/topology/HalfEdgeNodeXYZUV.js.map +1 -1
  221. package/lib/cjs/topology/HalfEdgePointInGraphSearch.js.map +1 -1
  222. package/lib/cjs/topology/HalfEdgePositionDetail.js.map +1 -1
  223. package/lib/cjs/topology/HalfEdgePriorityQueue.js.map +1 -1
  224. package/lib/cjs/topology/InsertAndRetriangulateContext.js.map +1 -1
  225. package/lib/cjs/topology/MaskManager.js.map +1 -1
  226. package/lib/cjs/topology/Merging.js.map +1 -1
  227. package/lib/cjs/topology/RegularizeFace.js.map +1 -1
  228. package/lib/cjs/topology/SignedDataSummary.js.map +1 -1
  229. package/lib/cjs/topology/SpaceTriangulation.js.map +1 -1
  230. package/lib/cjs/topology/Triangulation.js.map +1 -1
  231. package/lib/cjs/topology/XYParitySearchContext.js.map +1 -1
  232. package/lib/esm/Constant.js.map +1 -1
  233. package/lib/esm/Geometry.js.map +1 -1
  234. package/lib/esm/bspline/AkimaCurve3d.js.map +1 -1
  235. package/lib/esm/bspline/BSpline1dNd.js.map +1 -1
  236. package/lib/esm/bspline/BSplineCurve.js.map +1 -1
  237. package/lib/esm/bspline/BSplineCurve3dH.js.map +1 -1
  238. package/lib/esm/bspline/BSplineCurveOps.js.map +1 -1
  239. package/lib/esm/bspline/BSplineSurface.js.map +1 -1
  240. package/lib/esm/bspline/Bezier1dNd.js.map +1 -1
  241. package/lib/esm/bspline/BezierCurve3d.js.map +1 -1
  242. package/lib/esm/bspline/BezierCurve3dH.js.map +1 -1
  243. package/lib/esm/bspline/BezierCurveBase.js.map +1 -1
  244. package/lib/esm/bspline/InterpolationCurve3d.js.map +1 -1
  245. package/lib/esm/bspline/KnotVector.js.map +1 -1
  246. package/lib/esm/bspline/SurfaceLocationDetail.js.map +1 -1
  247. package/lib/esm/clipping/AlternatingConvexClipTree.js.map +1 -1
  248. package/lib/esm/clipping/BooleanClipFactory.js.map +1 -1
  249. package/lib/esm/clipping/BooleanClipNode.js.map +1 -1
  250. package/lib/esm/clipping/ClipPlane.js.map +1 -1
  251. package/lib/esm/clipping/ClipPrimitive.js.map +1 -1
  252. package/lib/esm/clipping/ClipUtils.js.map +1 -1
  253. package/lib/esm/clipping/ClipVector.js.map +1 -1
  254. package/lib/esm/clipping/ConvexClipPlaneSet.js.map +1 -1
  255. package/lib/esm/clipping/UnionOfConvexClipPlaneSets.js.map +1 -1
  256. package/lib/esm/clipping/internalContexts/LineStringOffsetClipperContext.js.map +1 -1
  257. package/lib/esm/core-geometry.js.map +1 -1
  258. package/lib/esm/curve/Arc3d.js.map +1 -1
  259. package/lib/esm/curve/ConstructCurveBetweenCurves.js.map +1 -1
  260. package/lib/esm/curve/CoordinateXYZ.js.map +1 -1
  261. package/lib/esm/curve/CurveChainWithDistanceIndex.js.map +1 -1
  262. package/lib/esm/curve/CurveCollection.d.ts +31 -1
  263. package/lib/esm/curve/CurveCollection.d.ts.map +1 -1
  264. package/lib/esm/curve/CurveCollection.js +65 -0
  265. package/lib/esm/curve/CurveCollection.js.map +1 -1
  266. package/lib/esm/curve/CurveCurve.js.map +1 -1
  267. package/lib/esm/curve/CurveExtendMode.js.map +1 -1
  268. package/lib/esm/curve/CurveFactory.js.map +1 -1
  269. package/lib/esm/curve/CurveLocationDetail.d.ts +24 -24
  270. package/lib/esm/curve/CurveLocationDetail.d.ts.map +1 -1
  271. package/lib/esm/curve/CurveLocationDetail.js +24 -24
  272. package/lib/esm/curve/CurveLocationDetail.js.map +1 -1
  273. package/lib/esm/curve/CurveOps.js.map +1 -1
  274. package/lib/esm/curve/CurvePrimitive.d.ts +2 -2
  275. package/lib/esm/curve/CurvePrimitive.js.map +1 -1
  276. package/lib/esm/curve/CurveProcessor.js.map +1 -1
  277. package/lib/esm/curve/CurveTypes.js.map +1 -1
  278. package/lib/esm/curve/CurveWireMomentsXYZ.js.map +1 -1
  279. package/lib/esm/curve/GeometryQuery.js.map +1 -1
  280. package/lib/esm/curve/LineSegment3d.js.map +1 -1
  281. package/lib/esm/curve/LineString3d.js.map +1 -1
  282. package/lib/esm/curve/Loop.js.map +1 -1
  283. package/lib/esm/curve/OffsetOptions.js.map +1 -1
  284. package/lib/esm/curve/ParityRegion.js.map +1 -1
  285. package/lib/esm/curve/Path.js.map +1 -1
  286. package/lib/esm/curve/PointString3d.js.map +1 -1
  287. package/lib/esm/curve/ProxyCurve.js.map +1 -1
  288. package/lib/esm/curve/Query/ConsolidateAdjacentPrimitivesContext.js.map +1 -1
  289. package/lib/esm/curve/Query/CurveSplitContext.js.map +1 -1
  290. package/lib/esm/curve/Query/CylindricalRange.js.map +1 -1
  291. package/lib/esm/curve/Query/InOutTests.js.map +1 -1
  292. package/lib/esm/curve/Query/PlanarSubdivision.js.map +1 -1
  293. package/lib/esm/curve/Query/StrokeCountChain.js.map +1 -1
  294. package/lib/esm/curve/Query/StrokeCountMap.js.map +1 -1
  295. package/lib/esm/curve/RegionMomentsXY.js.map +1 -1
  296. package/lib/esm/curve/RegionOps.js.map +1 -1
  297. package/lib/esm/curve/RegionOpsClassificationSweeps.js.map +1 -1
  298. package/lib/esm/curve/StrokeOptions.js.map +1 -1
  299. package/lib/esm/curve/UnionRegion.js.map +1 -1
  300. package/lib/esm/curve/internalContexts/AnnounceTangentStrokeHandler.js.map +1 -1
  301. package/lib/esm/curve/internalContexts/AppendPlaneIntersectionStrokeHandler.js.map +1 -1
  302. package/lib/esm/curve/internalContexts/ChainCollectorContext.js.map +1 -1
  303. package/lib/esm/curve/internalContexts/CloneCurvesContext.js.map +1 -1
  304. package/lib/esm/curve/internalContexts/CloneWithExpandedLineStrings.js.map +1 -1
  305. package/lib/esm/curve/internalContexts/ClosestPointStrokeHandler.js.map +1 -1
  306. package/lib/esm/curve/internalContexts/CountLinearPartsSearchContext.js.map +1 -1
  307. package/lib/esm/curve/internalContexts/CurveCurveCloseApproachXY.js.map +1 -1
  308. package/lib/esm/curve/internalContexts/CurveCurveIntersectXY.js.map +1 -1
  309. package/lib/esm/curve/internalContexts/CurveCurveIntersectXYZ.js.map +1 -1
  310. package/lib/esm/curve/internalContexts/CurveLengthContext.js.map +1 -1
  311. package/lib/esm/curve/internalContexts/CurveOffsetXYHandler.js.map +1 -1
  312. package/lib/esm/curve/internalContexts/EllipticalArcApproximationContext.js.map +1 -1
  313. package/lib/esm/curve/internalContexts/GapSearchContext.js.map +1 -1
  314. package/lib/esm/curve/internalContexts/MultiChainCollector.js.map +1 -1
  315. package/lib/esm/curve/internalContexts/NewtonRtoRStrokeHandler.js.map +1 -1
  316. package/lib/esm/curve/internalContexts/PlaneAltitudeRangeContext.js.map +1 -1
  317. package/lib/esm/curve/internalContexts/PolygonOffsetContext.js.map +1 -1
  318. package/lib/esm/curve/internalContexts/SumLengthsContext.js.map +1 -1
  319. package/lib/esm/curve/internalContexts/TransferWithSplitArcs.js.map +1 -1
  320. package/lib/esm/curve/internalContexts/TransformInPlaceContext.js.map +1 -1
  321. package/lib/esm/curve/spiral/AustralianRailCorpXYEvaluator.js.map +1 -1
  322. package/lib/esm/curve/spiral/ClothoidSeries.js.map +1 -1
  323. package/lib/esm/curve/spiral/CubicEvaluator.js.map +1 -1
  324. package/lib/esm/curve/spiral/CzechSpiralEvaluator.js.map +1 -1
  325. package/lib/esm/curve/spiral/DirectHalfCosineSpiralEvaluator.js.map +1 -1
  326. package/lib/esm/curve/spiral/DirectSpiral3d.js.map +1 -1
  327. package/lib/esm/curve/spiral/IntegratedSpiral3d.js.map +1 -1
  328. package/lib/esm/curve/spiral/MXCubicAlongArcSpiralEvaluator.js.map +1 -1
  329. package/lib/esm/curve/spiral/NormalizedTransition.js.map +1 -1
  330. package/lib/esm/curve/spiral/PolishCubicSpiralEvaluator.js.map +1 -1
  331. package/lib/esm/curve/spiral/TransitionConditionalProperties.js.map +1 -1
  332. package/lib/esm/curve/spiral/TransitionSpiral3d.js.map +1 -1
  333. package/lib/esm/curve/spiral/XYCurveEvaluator.js.map +1 -1
  334. package/lib/esm/geometry3d/Angle.js.map +1 -1
  335. package/lib/esm/geometry3d/AngleSweep.js.map +1 -1
  336. package/lib/esm/geometry3d/BarycentricTriangle.js.map +1 -1
  337. package/lib/esm/geometry3d/BilinearPatch.js.map +1 -1
  338. package/lib/esm/geometry3d/CoincidentGeometryOps.js.map +1 -1
  339. package/lib/esm/geometry3d/Ellipsoid.js.map +1 -1
  340. package/lib/esm/geometry3d/FrameBuilder.js.map +1 -1
  341. package/lib/esm/geometry3d/FrustumAnimation.js.map +1 -1
  342. package/lib/esm/geometry3d/GeometryHandler.js.map +1 -1
  343. package/lib/esm/geometry3d/GrowableBlockedArray.js.map +1 -1
  344. package/lib/esm/geometry3d/GrowableFloat64Array.js.map +1 -1
  345. package/lib/esm/geometry3d/GrowableXYArray.js.map +1 -1
  346. package/lib/esm/geometry3d/GrowableXYZArray.js.map +1 -1
  347. package/lib/esm/geometry3d/IndexedCollectionInterval.js.map +1 -1
  348. package/lib/esm/geometry3d/IndexedXYCollection.js.map +1 -1
  349. package/lib/esm/geometry3d/IndexedXYZCollection.js.map +1 -1
  350. package/lib/esm/geometry3d/LongitudeLatitudeAltitude.js.map +1 -1
  351. package/lib/esm/geometry3d/Matrix3d.js.map +1 -1
  352. package/lib/esm/geometry3d/OrderedRotationAngles.js.map +1 -1
  353. package/lib/esm/geometry3d/Plane3d.js.map +1 -1
  354. package/lib/esm/geometry3d/Plane3dByOriginAndUnitNormal.js.map +1 -1
  355. package/lib/esm/geometry3d/Plane3dByOriginAndVectors.js.map +1 -1
  356. package/lib/esm/geometry3d/Point2dArrayCarrier.js.map +1 -1
  357. package/lib/esm/geometry3d/Point2dVector2d.js.map +1 -1
  358. package/lib/esm/geometry3d/Point3dArrayCarrier.js.map +1 -1
  359. package/lib/esm/geometry3d/Point3dVector3d.js.map +1 -1
  360. package/lib/esm/geometry3d/PointHelpers.js.map +1 -1
  361. package/lib/esm/geometry3d/PointStreaming.js.map +1 -1
  362. package/lib/esm/geometry3d/PolygonOps.js.map +1 -1
  363. package/lib/esm/geometry3d/PolylineCompressionByEdgeOffset.js.map +1 -1
  364. package/lib/esm/geometry3d/PolylineOps.js.map +1 -1
  365. package/lib/esm/geometry3d/Range.js.map +1 -1
  366. package/lib/esm/geometry3d/Ray2d.js.map +1 -1
  367. package/lib/esm/geometry3d/Ray3d.js.map +1 -1
  368. package/lib/esm/geometry3d/ReusableObjectCache.js.map +1 -1
  369. package/lib/esm/geometry3d/Segment1d.js.map +1 -1
  370. package/lib/esm/geometry3d/SortablePolygon.js.map +1 -1
  371. package/lib/esm/geometry3d/Transform.js.map +1 -1
  372. package/lib/esm/geometry3d/UVSurfaceOps.js.map +1 -1
  373. package/lib/esm/geometry3d/XYZProps.js.map +1 -1
  374. package/lib/esm/geometry3d/YawPitchRollAngles.js.map +1 -1
  375. package/lib/esm/geometry4d/Map4d.js.map +1 -1
  376. package/lib/esm/geometry4d/Matrix4d.js.map +1 -1
  377. package/lib/esm/geometry4d/MomentData.js.map +1 -1
  378. package/lib/esm/geometry4d/PlaneByOriginAndVectors4d.js.map +1 -1
  379. package/lib/esm/geometry4d/Point4d.js.map +1 -1
  380. package/lib/esm/numerics/BandedSystem.js.map +1 -1
  381. package/lib/esm/numerics/BezierPolynomials.js.map +1 -1
  382. package/lib/esm/numerics/ClusterableArray.js.map +1 -1
  383. package/lib/esm/numerics/Complex.js.map +1 -1
  384. package/lib/esm/numerics/ConvexPolygon2d.js.map +1 -1
  385. package/lib/esm/numerics/Newton.js.map +1 -1
  386. package/lib/esm/numerics/PascalCoefficients.js.map +1 -1
  387. package/lib/esm/numerics/PolarData.js.map +1 -1
  388. package/lib/esm/numerics/Polynomials.js.map +1 -1
  389. package/lib/esm/numerics/Quadrature.js.map +1 -1
  390. package/lib/esm/numerics/Range1dArray.js.map +1 -1
  391. package/lib/esm/numerics/SmallSystem.js.map +1 -1
  392. package/lib/esm/numerics/TriDiagonalSystem.js.map +1 -1
  393. package/lib/esm/numerics/UnionFind.js.map +1 -1
  394. package/lib/esm/numerics/UsageSums.js.map +1 -1
  395. package/lib/esm/polyface/AuxData.js.map +1 -1
  396. package/lib/esm/polyface/BoxTopology.js.map +1 -1
  397. package/lib/esm/polyface/FacetFaceData.js.map +1 -1
  398. package/lib/esm/polyface/FacetLocationDetail.js.map +1 -1
  399. package/lib/esm/polyface/FacetOrientation.js.map +1 -1
  400. package/lib/esm/polyface/GreedyTriangulationBetweenLineStrings.js.map +1 -1
  401. package/lib/esm/polyface/IndexedEdgeMatcher.js.map +1 -1
  402. package/lib/esm/polyface/IndexedPolyfaceVisitor.js.map +1 -1
  403. package/lib/esm/polyface/IndexedPolyfaceWalker.js.map +1 -1
  404. package/lib/esm/polyface/Polyface.js.map +1 -1
  405. package/lib/esm/polyface/PolyfaceBuilder.js.map +1 -1
  406. package/lib/esm/polyface/PolyfaceClip.js.map +1 -1
  407. package/lib/esm/polyface/PolyfaceData.js.map +1 -1
  408. package/lib/esm/polyface/PolyfaceQuery.js.map +1 -1
  409. package/lib/esm/polyface/RangeLengthData.js.map +1 -1
  410. package/lib/esm/polyface/RangeTree/LineString3dRangeTreeContext.js.map +1 -1
  411. package/lib/esm/polyface/RangeTree/MinimumValueTester.js.map +1 -1
  412. package/lib/esm/polyface/RangeTree/Point3dArrayRangeTreeContext.js.map +1 -1
  413. package/lib/esm/polyface/RangeTree/PolyfaceRangeTreeContext.js.map +1 -1
  414. package/lib/esm/polyface/RangeTree/RangeTreeNode.js.map +1 -1
  415. package/lib/esm/polyface/RangeTree/RangeTreeSearchHandlers.js.map +1 -1
  416. package/lib/esm/polyface/TaggedNumericData.js.map +1 -1
  417. package/lib/esm/polyface/TriangleCandidate.js.map +1 -1
  418. package/lib/esm/polyface/multiclip/BuildAverageNormalsContext.js.map +1 -1
  419. package/lib/esm/polyface/multiclip/GriddedRaggedRange2dSet.js.map +1 -1
  420. package/lib/esm/polyface/multiclip/GriddedRaggedRange2dSetWithOverflow.js.map +1 -1
  421. package/lib/esm/polyface/multiclip/LinearSearchRange2dArray.js.map +1 -1
  422. package/lib/esm/polyface/multiclip/OffsetMeshContext.js.map +1 -1
  423. package/lib/esm/polyface/multiclip/Range2dSearchInterface.js.map +1 -1
  424. package/lib/esm/polyface/multiclip/RangeSearch.js.map +1 -1
  425. package/lib/esm/polyface/multiclip/SweepLineStringToFacetContext.js.map +1 -1
  426. package/lib/esm/polyface/multiclip/XYPointBuckets.js.map +1 -1
  427. package/lib/esm/serialization/BGFBAccessors.js.map +1 -1
  428. package/lib/esm/serialization/BGFBReader.js.map +1 -1
  429. package/lib/esm/serialization/BGFBWriter.js.map +1 -1
  430. package/lib/esm/serialization/BentleyGeometryFlatBuffer.js.map +1 -1
  431. package/lib/esm/serialization/DeepCompare.js.map +1 -1
  432. package/lib/esm/serialization/GeometrySamples.js.map +1 -1
  433. package/lib/esm/serialization/IModelJsonSchema.js.map +1 -1
  434. package/lib/esm/serialization/SerializationHelpers.js.map +1 -1
  435. package/lib/esm/solid/Box.js.map +1 -1
  436. package/lib/esm/solid/Cone.js.map +1 -1
  437. package/lib/esm/solid/LinearSweep.js.map +1 -1
  438. package/lib/esm/solid/RotationalSweep.js.map +1 -1
  439. package/lib/esm/solid/RuledSweep.js.map +1 -1
  440. package/lib/esm/solid/SolidPrimitive.js.map +1 -1
  441. package/lib/esm/solid/Sphere.js.map +1 -1
  442. package/lib/esm/solid/SweepContour.js.map +1 -1
  443. package/lib/esm/solid/TorusPipe.js.map +1 -1
  444. package/lib/esm/topology/ChainMerge.js.map +1 -1
  445. package/lib/esm/topology/Graph.js.map +1 -1
  446. package/lib/esm/topology/HalfEdgeGraphFromIndexedLoopsContext.js.map +1 -1
  447. package/lib/esm/topology/HalfEdgeGraphSearch.js.map +1 -1
  448. package/lib/esm/topology/HalfEdgeGraphSpineContext.js.map +1 -1
  449. package/lib/esm/topology/HalfEdgeGraphValidation.js.map +1 -1
  450. package/lib/esm/topology/HalfEdgeMarkSet.js.map +1 -1
  451. package/lib/esm/topology/HalfEdgeNodeXYZUV.js.map +1 -1
  452. package/lib/esm/topology/HalfEdgePointInGraphSearch.js.map +1 -1
  453. package/lib/esm/topology/HalfEdgePositionDetail.js.map +1 -1
  454. package/lib/esm/topology/HalfEdgePriorityQueue.js.map +1 -1
  455. package/lib/esm/topology/InsertAndRetriangulateContext.js.map +1 -1
  456. package/lib/esm/topology/MaskManager.js.map +1 -1
  457. package/lib/esm/topology/Merging.js.map +1 -1
  458. package/lib/esm/topology/RegularizeFace.js.map +1 -1
  459. package/lib/esm/topology/SignedDataSummary.js.map +1 -1
  460. package/lib/esm/topology/SpaceTriangulation.js.map +1 -1
  461. package/lib/esm/topology/Triangulation.js.map +1 -1
  462. package/lib/esm/topology/XYParitySearchContext.js.map +1 -1
  463. package/package.json +3 -3
@@ -1 +1 @@
1
- {"version":3,"file":"CurveCollection.js","sourceRoot":"","sources":["../../../src/curve/CurveCollection.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAE/F;;GAEG;AACH,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AAQvC,OAAO,EAAE,mBAAmB,EAAE,MAAM,uBAAuB,CAAC;AAC5D,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAGlD,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAChD,OAAO,EAAE,kBAAkB,EAAE,MAAM,uCAAuC,CAAC;AAC3E,OAAO,EAAE,4BAA4B,EAAE,MAAM,iDAAiD,CAAC;AAC/F,OAAO,EAAE,6BAA6B,EAAE,MAAM,kDAAkD,CAAC;AACjG,OAAO,EAAE,gBAAgB,EAAE,MAAM,qCAAqC,CAAC;AACvE,OAAO,EAAE,yBAAyB,EAAE,MAAM,8CAA8C,CAAC;AACzF,OAAO,EAAE,iBAAiB,EAAE,MAAM,sCAAsC,CAAC;AACzE,OAAO,EAAE,uBAAuB,EAAE,MAAM,4CAA4C,CAAC;AACrF,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAC9C,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAoB1C;;;;;;;;;;;;GAYG;AACH,MAAM,OAAgB,eAAgB,SAAQ,aAAa;IACzD,wCAAwC;IACxB,gBAAgB,GAAG,iBAAiB,CAAC;IAGrD,uDAAuD;IAChD,OAAO,GAAY,KAAK,CAAC;IAGhC,6DAA6D;IACtD,UAAU;QACf,OAAO,iBAAiB,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,mBAAmB,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,mBAAmB,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,gBAAgB,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACvC,CAAC;IACD,wGAAwG;IACjG,2BAA2B;QAChC,OAAO,6BAA6B,CAAC,sBAAsB,CAAC,IAAI,CAAC,CAAC;IACpE,CAAC;IACD,8CAA8C;IACvC,mBAAmB,CAAC,SAAoB;QAC7C,OAAO,uBAAuB,CAAC,mBAAmB,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;IACtE,CAAC;IACD,0BAA0B;IACV,KAAK;QACnB,OAAO,kBAAkB,CAAC,KAAK,CAAC,IAAI,CAAoB,CAAC;IAC3D,CAAC;IACD,gDAAgD;IAChC,gBAAgB,CAAC,SAAoB;QACnD,OAAO,kBAAkB,CAAC,KAAK,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;IACnD,CAAC;IACD,uFAAuF;IAChF,4BAA4B;QACjC,OAAO,4BAA4B,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,cAAc;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,cAAc,EAAE,CAAC;YACrC,OAAO,mBAAmB,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,yBAAyB,CAAC,kCAAkC,CAAC,IAAI,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;IAC1F,CAAC;IACD,8GAA8G;IACvG,sBAAsB,CAAC,UAAoB;QAChD,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAClC,IAAI,KAAK,KAAK,UAAU;gBACtB,OAAO,IAAI,CAAC;YACd,IAAI,KAAK,YAAY,eAAe,EAAE,CAAC;gBACrC,MAAM,MAAM,GAAG,KAAK,CAAC,sBAAsB,CAAC,UAAU,CAAC,CAAC;gBACxD,IAAI,MAAM;oBACR,OAAO,MAAM,CAAC;YAClB,CAAC;QACH,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAAA,CAAC;CACH;AAED;;;;;;;;;GASG;AACH,MAAM,OAAgB,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,QAAQ,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,YAAY;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,cAAc,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,UAAU,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,mBAAmB,CAAC,8CAA8C,CAAC,SAAS,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;QACzG,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;CACF;AAED;;;;GAIG;AACH,MAAM,OAAO,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,cAAc,EAAE,CAAC;gBACpC,MAAM,EAAE,GAAG,YAAY,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,mBAAmB,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,mBAAmB,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","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 /** Return the immediate parent of the input curve in the instance, or undefined if it is not a descendant. */\n public findParentOfDescendant(descendant: AnyCurve): CurveCollection | undefined {\n for (const child of this.children) {\n if (child === descendant)\n return this;\n if (child instanceof CurveCollection) {\n const parent = child.findParentOfDescendant(descendant);\n if (parent)\n return parent;\n }\n }\n return undefined;\n };\n}\n\n/**\n * Shared base class for use by both open and closed paths.\n * * A `CurveChain` contains only CurvePrimitives. No other paths, loops, or regions allowed.\n * * The specific derived classes are `Path` and `Loop`.\n * * `CurveChain` is an intermediate class. It is not instantiable on its own.\n * * The related class `CurveChainWithDistanceIndex` is a `CurvePrimitive` whose API presents well-defined mappings\n * from fraction to xyz over the entire chain, but in fact does all the calculations over multiple primitives.\n * @see [Curve Collections]($docs/learning/geometry/CurveCollection.md) learning article.\n * @public\n */\nexport abstract class CurveChain extends CurveCollection {\n /** The curve primitives in the chain. */\n protected _curves: CurvePrimitive[];\n /** Constructor */\n protected constructor() {\n super();\n this._curves = [];\n }\n /** Return the array of `CurvePrimitive` */\n public override get children(): CurvePrimitive[] {\n return this._curves;\n }\n /** Return the start point of the curve chain (start point of the first child). */\n public startPoint(result?: Point3d): Point3d | undefined {\n const firstChild = this.getChild(0);\n if (firstChild)\n return firstChild.fractionToPoint(0.0, result);\n else\n return undefined;\n }\n /** Return the end point of the curve chain (end point of the last child). */\n public endPoint(result?: Point3d): Point3d | undefined {\n const lastChild = this.getChild(this._curves.length - 1);\n if (lastChild)\n return lastChild.fractionToPoint(1.0, result);\n else\n return undefined;\n }\n /**\n * 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"]}
1
+ {"version":3,"file":"CurveCollection.js","sourceRoot":"","sources":["../../../src/curve/CurveCollection.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAE/F;;GAEG;AACH,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AAQvC,OAAO,EAAE,mBAAmB,EAAE,MAAM,uBAAuB,CAAC;AAC5D,OAAO,EAAE,cAAc,EAAkB,MAAM,kBAAkB,CAAC;AAGlE,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAChD,OAAO,EAAE,kBAAkB,EAAE,MAAM,uCAAuC,CAAC;AAC3E,OAAO,EAAE,4BAA4B,EAAE,MAAM,iDAAiD,CAAC;AAC/F,OAAO,EAAE,6BAA6B,EAAE,MAAM,kDAAkD,CAAC;AACjG,OAAO,EAAE,gBAAgB,EAAE,MAAM,qCAAqC,CAAC;AACvE,OAAO,EAAE,yBAAyB,EAAE,MAAM,8CAA8C,CAAC;AACzF,OAAO,EAAE,iBAAiB,EAAE,MAAM,sCAAsC,CAAC;AACzE,OAAO,EAAE,uBAAuB,EAAE,MAAM,4CAA4C,CAAC;AACrF,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAC9C,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAK1C,OAAO,EAAE,4BAA4B,EAAE,MAAM,iDAAiD,CAAC;AAC/F,OAAO,EAAE,QAAQ,EAAE,MAAM,wBAAwB,CAAC;AAgBlD;;;;;;;;;;;;GAYG;AACH,MAAM,OAAgB,eAAgB,SAAQ,aAAa;IACzD,wCAAwC;IACxB,gBAAgB,GAAG,iBAAiB,CAAC;IAGrD,uDAAuD;IAChD,OAAO,GAAY,KAAK,CAAC;IAGhC,6DAA6D;IACtD,UAAU;QACf,OAAO,iBAAiB,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,mBAAmB,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,mBAAmB,CAAC,cAAc,CAAC,OAAO,EAAE,OAAO,CAAE,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;YAC3F,CAAC;QACH,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IACD;;;;;;;;;;OAUG;IACI,YAAY,CACjB,UAAmB,EAAE,eAAsD,EAAE,OAAwB;QAErG,MAAM,aAAa,GAAG,IAAI,4BAA4B,CAAC,UAAU,EAAE,eAAe,EAAE,OAAO,CAAC,CAAC;QAC7F,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;YAChC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAClC,IAAI,KAAK,YAAY,cAAc;oBACjC,KAAK,CAAC,kBAAkB,CAAC,aAAa,EAAE,OAAO,EAAE,aAAa,CAAC,CAAC;qBAC7D,IAAI,KAAK,YAAY,eAAe;oBACvC,KAAK,CAAC,YAAY,CAAC,UAAU,EAAE,eAAe,EAAE,OAAO,CAAC,CAAC;YAC7D,CAAC;QACH,CAAC;IACH,CAAC;IACD;;;;;;;OAOG;IACI,WAAW,CAAC,UAAmB,EAAE,OAAwB;QAC9D,MAAM,QAAQ,GAA0B,EAAE,CAAC;QAC3C,IAAI,CAAC,YAAY,CAAC,UAAU,EAAE,CAAC,CAAsB,EAAE,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC;QAC7F,OAAO,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,QAAQ,CAAC;IACxD,CAAC;IACD;;;;;;;OAOG;IACI,cAAc,CAAC,UAAmB,EAAE,OAAwB;QACjE,MAAM,IAAI,GAAG,OAAO,EAAE,SAAS,IAAI,UAAU,CAAC;QAC9C,IAAI,OAA6B,CAAC;QAClC,IAAI,OAAO,EAAE,WAAW,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,YAAY,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;YACjF,OAAO,GAAG,QAAQ,CAAC,8BAA8B,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,EAAE,OAAO,CAAC,WAAW,CAAC,CAAC,EAAE,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;QACzH,MAAM,gBAAgB,GAAG,CAAC,EAAW,EAAU,EAAE;YAC/C,OAAO,OAAO,EAAE,oBAAoB,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,kBAAkB,EAAE,IAAI,EAAE,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC;QACvI,CAAC,CAAC;QACF,IAAI,cAA+C,CAAC;QACpD,IAAI,YAAY,GAAG,QAAQ,CAAC,qBAAqB,CAAC;QAClD,MAAM,qBAAqB,GAAG,CAAC,OAA4B,EAAE,EAAE;YAC7D,MAAM,KAAK,GAAG,gBAAgB,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;YAC9C,IAAI,CAAC,cAAc,IAAI,KAAK,GAAG,YAAY,EAAE,CAAC;gBAC5C,cAAc,GAAG,OAAO,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC;gBAC/C,YAAY,GAAG,KAAK,CAAC;YACvB,CAAC;QACH,CAAC,CAAC;QACF,IAAI,CAAC,YAAY,CAAC,UAAU,EAAE,qBAAqB,EAAE,OAAO,CAAC,CAAC;QAC9D,OAAO,cAAc,CAAC;IACxB,CAAC;IACD,oHAAoH;IAC7G,cAAc;QACnB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ;YAC/B,KAAK,CAAC,cAAc,EAAE,CAAC;IAC3B,CAAC;IACD;;;;;;OAMG;IACI,MAAM;QACX,OAAO,gBAAgB,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACvC,CAAC;IACD,wGAAwG;IACjG,2BAA2B;QAChC,OAAO,6BAA6B,CAAC,sBAAsB,CAAC,IAAI,CAAC,CAAC;IACpE,CAAC;IACD,8CAA8C;IACvC,mBAAmB,CAAC,SAAoB;QAC7C,OAAO,uBAAuB,CAAC,mBAAmB,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;IACtE,CAAC;IACD,0BAA0B;IACV,KAAK;QACnB,OAAO,kBAAkB,CAAC,KAAK,CAAC,IAAI,CAAoB,CAAC;IAC3D,CAAC;IACD,gDAAgD;IAChC,gBAAgB,CAAC,SAAoB;QACnD,OAAO,kBAAkB,CAAC,KAAK,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;IACnD,CAAC;IACD,uFAAuF;IAChF,4BAA4B;QACjC,OAAO,4BAA4B,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,cAAc;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,cAAc,EAAE,CAAC;YACrC,OAAO,mBAAmB,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,yBAAyB,CAAC,kCAAkC,CAAC,IAAI,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;IAC1F,CAAC;IACD,8GAA8G;IACvG,sBAAsB,CAAC,UAAoB;QAChD,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAClC,IAAI,KAAK,KAAK,UAAU;gBACtB,OAAO,IAAI,CAAC;YACd,IAAI,KAAK,YAAY,eAAe,EAAE,CAAC;gBACrC,MAAM,MAAM,GAAG,KAAK,CAAC,sBAAsB,CAAC,UAAU,CAAC,CAAC;gBACxD,IAAI,MAAM;oBACR,OAAO,MAAM,CAAC;YAClB,CAAC;QACH,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAAA,CAAC;CACH;AAED;;;;;;;;;GASG;AACH,MAAM,OAAgB,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,QAAQ,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,YAAY;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,cAAc,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,UAAU,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,mBAAmB,CAAC,8CAA8C,CAAC,SAAS,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;QACzG,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;CACF;AAED;;;;GAIG;AACH,MAAM,OAAO,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,cAAc,EAAE,CAAC;gBACpC,MAAM,EAAE,GAAG,YAAY,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,mBAAmB,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,mBAAmB,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","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, TangentOptions } 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\nimport { AnnounceTangentStrokeHandler } from \"./internalContexts/AnnounceTangentStrokeHandler\";\r\nimport { Matrix3d } from \"../geometry3d/Matrix3d\";\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 /**\r\n * Announce all points `P` on the contained curves such that the line containing `spacePoint` and `P` is tangent to\r\n * the contained curves in the view defined by `options.vectorToEye`.\r\n * * Strictly speaking, each tangent line lies in the plane through `P` whose normal is the cross product of the curve\r\n * tangent at `P` and `options.vectorToEye`. This is equivalent to tangency as seen in a view plane perpendicular to\r\n * `options.vectorToEye`.\r\n * @param spacePoint point in space.\r\n * @param announceTangent callback to announce each computed tangent. The received [[CurveLocationDetail]] is reused\r\n * internally, so it should be cloned in the callback if it needs to be saved.\r\n * @param options (optional) options for computing tangents. See [[TangentOptions]] for defaults.\r\n */\r\n public emitTangents(\r\n spacePoint: Point3d, announceTangent: (tangent: CurveLocationDetail) => any, options?: TangentOptions,\r\n ): void {\r\n const strokeHandler = new AnnounceTangentStrokeHandler(spacePoint, announceTangent, options);\r\n if (this.children !== undefined) {\r\n for (const child of this.children) {\r\n if (child instanceof CurvePrimitive)\r\n child.emitStrokableParts(strokeHandler, options?.strokeOptions);\r\n else if (child instanceof CurveCollection)\r\n child.emitTangents(spacePoint, announceTangent, options);\r\n }\r\n }\r\n }\r\n /**\r\n * Return all points `P` on the contained curves such that the line containing `spacePoint` and `P` is tangent to the\r\n * contained curves in the view defined by `options.vectorToEye`.\r\n * * See [[emitTangents]] for the definition of tangency employed.\r\n * @param spacePoint point in space.\r\n * @param options (optional) options for computing tangents. See [[TangentOptions]] for defaults.\r\n * @returns an array of details of all tangent points or undefined if no tangent was found.\r\n */\r\n public allTangents(spacePoint: Point3d, options?: TangentOptions): CurveLocationDetail[] | undefined {\r\n const tangents: CurveLocationDetail[] = [];\r\n this.emitTangents(spacePoint, (t: CurveLocationDetail) => tangents.push(t.clone()), options);\r\n return (tangents.length === 0) ? undefined : tangents;\r\n }\r\n /**\r\n * Return the point `P` on the contained curves such that the line containing `spacePoint` and `P` is tangent to the\r\n * contained curves in the view defined by `options.vectorToEye`, and `P` is closest to `options.hintPoint` in this view.\r\n * * See [[emitTangents]] for the definition of tangency employed.\r\n * @param spacePoint point in space.\r\n * @param options (optional) options for computing tangents. See [[TangentOptions]] for defaults.\r\n * @returns the detail of the closest tangent point or undefined if no tangent was found.\r\n */\r\n public closestTangent(spacePoint: Point3d, options?: TangentOptions): CurveLocationDetail | undefined {\r\n const hint = options?.hintPoint ?? spacePoint;\r\n let toLocal: Matrix3d | undefined;\r\n if (options?.vectorToEye && !options.vectorToEye.isExactEqual({ x: 0, y: 0, z: 1 }))\r\n toLocal = Matrix3d.createRigidViewAxesZTowardsEye(options.vectorToEye.x, options.vectorToEye.y, options.vectorToEye.z);\r\n const measureHintDist2 = (pt: Point3d): number => { // measure distance to hint in view plane coordinates\r\n return toLocal?.multiplyTransposeXYZ(hint.x - pt.x, hint.y - pt.y, hint.z - pt.z).magnitudeSquaredXY() ?? pt.distanceSquaredXY(hint);\r\n };\r\n let closestTangent: CurveLocationDetail | undefined;\r\n let closestDist2 = Geometry.largeCoordinateResult;\r\n const collectClosestTangent = (tangent: CurveLocationDetail) => {\r\n const dist2 = measureHintDist2(tangent.point);\r\n if (!closestTangent || dist2 < closestDist2) {\r\n closestTangent = tangent.clone(closestTangent);\r\n closestDist2 = dist2;\r\n }\r\n };\r\n this.emitTangents(spacePoint, collectClosestTangent, options);\r\n return closestTangent;\r\n }\r\n /** Reverse the collection's data so that each child curve's fractional stroking moves in the opposite direction. */\r\n public reverseInPlace(): void {\r\n for (const curve of this.children)\r\n curve.reverseInPlace();\r\n }\r\n /**\r\n * Return the max gap between adjacent primitives in Path and Loop collections.\r\n * * In a Path, gaps are computed between consecutive primitives.\r\n * * In a Loop, gaps are computed between consecutive primitives and between last and first.\r\n * * Gaps are NOT computed between consecutive CurvePrimitives in \"unstructured\" collections. The type is\r\n * \"unstructured\" so gaps should not be semantically meaningful.\r\n */\r\n public maxGap(): number {\r\n return GapSearchContext.maxGap(this);\r\n }\r\n /** Return true if the curve collection has any primitives other than LineSegment3d and LineString3d */\r\n public checkForNonLinearPrimitives(): boolean {\r\n return CountLinearPartsSearchContext.hasNonLinearPrimitives(this);\r\n }\r\n /** Apply transform recursively to children */\r\n public tryTransformInPlace(transform: Transform): boolean {\r\n return TransformInPlaceContext.tryTransformInPlace(this, transform);\r\n }\r\n /** Return a deep copy. */\r\n public override clone(): CurveCollection {\r\n return CloneCurvesContext.clone(this) as CurveCollection;\r\n }\r\n /** Create a deep copy of transformed curves. */\r\n public override cloneTransformed(transform: Transform): CurveCollection | undefined {\r\n return CloneCurvesContext.clone(this, transform);\r\n }\r\n /** Create a deep copy with all linestrings broken down into multiple LineSegment3d. */\r\n public cloneWithExpandedLineStrings(): CurveCollection {\r\n return CloneWithExpandedLineStrings.clone(this);\r\n }\r\n /**\r\n * Push all CurvePrimitives contained in the instance onto the `results` array.\r\n * * This method is recursive. For example, if the CurveCollection contains a Loop, all CurvePrimitives\r\n * of the Loop are pushed onto `results`.\r\n */\r\n private collectCurvePrimitivesGo(\r\n results: CurvePrimitive[], smallestPossiblePrimitives: boolean, explodeLinestrings: boolean = false,\r\n ): void {\r\n if (this.children) {\r\n for (const child of this.children) {\r\n if (child instanceof CurvePrimitive)\r\n child.collectCurvePrimitivesGo(results, smallestPossiblePrimitives, explodeLinestrings);\r\n else if (child instanceof CurveCollection)\r\n child.collectCurvePrimitivesGo(results, smallestPossiblePrimitives, explodeLinestrings);\r\n }\r\n }\r\n }\r\n /**\r\n * Return an array containing all CurvePrimitives in the instance.\r\n * * This method is recursive. For example, if the CurveCollection contains a Loop, all CurvePrimitives of\r\n * the Loop are pushed onto the returned array.\r\n * @param collectorArray optional array to receive primitives. If present, new primitives are ADDED (without\r\n * clearing the array).\r\n * @param smallestPossiblePrimitives if false, CurvePrimitiveWithDistanceIndex returns only itself. If true,\r\n * it recurses to its (otherwise hidden) children.\r\n */\r\n public collectCurvePrimitives(\r\n collectorArray?: CurvePrimitive[], smallestPossiblePrimitives: boolean = false, explodeLineStrings: boolean = false,\r\n ): CurvePrimitive[] {\r\n const results: CurvePrimitive[] = collectorArray === undefined ? [] : collectorArray;\r\n this.collectCurvePrimitivesGo(results, smallestPossiblePrimitives, explodeLineStrings);\r\n return results;\r\n }\r\n /**\r\n * Return true for planar region types:\r\n * * `Loop`\r\n * * `ParityRegion`\r\n * * `UnionRegion`\r\n * @see isAnyRegion\r\n */\r\n public get isAnyRegionType(): boolean {\r\n return this.dgnBoundaryType() === 2 || this.dgnBoundaryType() === 4 || this.dgnBoundaryType() === 5;\r\n }\r\n /** Type guard for AnyRegion */\r\n public isAnyRegion(): this is AnyRegion {\r\n return this.isAnyRegionType;\r\n }\r\n /**\r\n * Return true for a `Path`, i.e. a chain of curves joined head-to-tail\r\n * @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 /** Return the immediate parent of the input curve in the instance, or undefined if it is not a descendant. */\r\n public findParentOfDescendant(descendant: AnyCurve): CurveCollection | undefined {\r\n for (const child of this.children) {\r\n if (child === descendant)\r\n return this;\r\n if (child instanceof CurveCollection) {\r\n const parent = child.findParentOfDescendant(descendant);\r\n if (parent)\r\n return parent;\r\n }\r\n }\r\n return undefined;\r\n };\r\n}\r\n\r\n/**\r\n * Shared base class for use by both open and closed paths.\r\n * * A `CurveChain` contains only CurvePrimitives. No other paths, loops, or regions allowed.\r\n * * The specific derived classes are `Path` and `Loop`.\r\n * * `CurveChain` is an intermediate class. It is not instantiable on its own.\r\n * * The related class `CurveChainWithDistanceIndex` is a `CurvePrimitive` whose API presents well-defined mappings\r\n * from fraction to xyz over the entire chain, but in fact does all the calculations over multiple primitives.\r\n * @see [Curve Collections]($docs/learning/geometry/CurveCollection.md) learning article.\r\n * @public\r\n */\r\nexport abstract class CurveChain extends CurveCollection {\r\n /** The curve primitives in the chain. */\r\n protected _curves: CurvePrimitive[];\r\n /** Constructor */\r\n protected constructor() {\r\n super();\r\n this._curves = [];\r\n }\r\n /** Return the array of `CurvePrimitive` */\r\n public override get children(): CurvePrimitive[] {\r\n return this._curves;\r\n }\r\n /** Return the start point of the curve chain (start point of the first child). */\r\n public startPoint(result?: Point3d): Point3d | undefined {\r\n const firstChild = this.getChild(0);\r\n if (firstChild)\r\n return firstChild.fractionToPoint(0.0, result);\r\n else\r\n return undefined;\r\n }\r\n /** Return the end point of the curve chain (end point of the last child). */\r\n public endPoint(result?: Point3d): Point3d | undefined {\r\n const lastChild = this.getChild(this._curves.length - 1);\r\n if (lastChild)\r\n return lastChild.fractionToPoint(1.0, result);\r\n else\r\n return undefined;\r\n }\r\n /**\r\n * Return the start point and derivative of the first child of the curve chain.\r\n * * For queries interior to the chain, use [[CurveChainWithDistanceIndex.fractionToPointAndDerivative]].\r\n */\r\n public startPointAndDerivative(result?: Ray3d): Ray3d | undefined {\r\n const firstChild = this.getChild(0);\r\n if (firstChild)\r\n return firstChild.fractionToPointAndDerivative(0.0, result);\r\n else\r\n return undefined;\r\n }\r\n /**\r\n * Return the end point and derivative of the last child of the curve chain.\r\n * * For queries interior to the chain, use [[CurveChainWithDistanceIndex.fractionToPointAndDerivative]].\r\n */\r\n public endPointAndDerivative(result?: Ray3d): Ray3d | undefined {\r\n const lastChild = this.getChild(this._curves.length - 1);\r\n if (lastChild)\r\n return lastChild.fractionToPointAndDerivative(1.0, result);\r\n else\r\n return undefined;\r\n }\r\n /**\r\n * Return the curve primitive at the given `index`, optionally using `modulo` to map `index` to the cyclic indexing.\r\n * * In particular, `-1` is the final curve.\r\n * @param index cyclic index\r\n */\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 +1 @@
1
- {"version":3,"file":"CurveCurve.js","sourceRoot":"","sources":["../../../src/curve/CurveCurve.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AAKvC,OAAO,EAAE,yBAAyB,EAAE,MAAM,8CAA8C,CAAC;AACzF,OAAO,EAAE,qBAAqB,EAAE,MAAM,0CAA0C,CAAC;AACjF,OAAO,EAAE,sBAAsB,EAAE,MAAM,2CAA2C,CAAC;AAEnF;;;GAGG;AACH,MAAM,OAAO,UAAU;IACrB;;;;;;;;OAQG;IACI,MAAM,CAAC,mBAAmB,CAC/B,MAAgB,EAChB,OAAgB,EAChB,MAAgB,EAChB,OAAgB,EAChB,YAAoB,QAAQ,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,QAAQ,CAAC,mBAAmB;QAEhD,MAAM,OAAO,GAAG,IAAI,qBAAqB,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,sBAAsB,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,QAAQ,CAAC,mBAAmB;QAE9E,MAAM,OAAO,GAAG,IAAI,qBAAqB,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,yBAAyB,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","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"]}
1
+ {"version":3,"file":"CurveCurve.js","sourceRoot":"","sources":["../../../src/curve/CurveCurve.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AAKvC,OAAO,EAAE,yBAAyB,EAAE,MAAM,8CAA8C,CAAC;AACzF,OAAO,EAAE,qBAAqB,EAAE,MAAM,0CAA0C,CAAC;AACjF,OAAO,EAAE,sBAAsB,EAAE,MAAM,2CAA2C,CAAC;AAEnF;;;GAGG;AACH,MAAM,OAAO,UAAU;IACrB;;;;;;;;OAQG;IACI,MAAM,CAAC,mBAAmB,CAC/B,MAAgB,EAChB,OAAgB,EAChB,MAAgB,EAChB,OAAgB,EAChB,YAAoB,QAAQ,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,QAAQ,CAAC,mBAAmB;QAEhD,MAAM,OAAO,GAAG,IAAI,qBAAqB,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,sBAAsB,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,QAAQ,CAAC,mBAAmB;QAE9E,MAAM,OAAO,GAAG,IAAI,qBAAqB,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,yBAAyB,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","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 +1 @@
1
- {"version":3,"file":"CurveExtendMode.js","sourceRoot":"","sources":["../../../src/curve/CurveExtendMode.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AAGvC;;;;GAIG;AACH,MAAM,CAAN,IAAY,eAOX;AAPD,WAAY,eAAe;IACzB,4BAA4B;IAC5B,qDAAQ,CAAA;IACR,oDAAoD;IACpD,+DAAa,CAAA;IACb,8CAA8C;IAC9C,2DAAW,CAAA;AACb,CAAC,EAPW,eAAe,KAAf,eAAe,QAO1B;AACD;;;GAGG;AACH,MAAM,OAAO,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;;;;;;;;;OASG;IACI,MAAM,CAAC,kCAAkC,CAC9C,WAAwC,EAAE,OAAe,EAAE,KAAiB;QAE5E,IAAI,QAAQ,GAAG,KAAK,CAAC,+BAA+B,CAAC,OAAO,CAAC,CAAC;QAC9D,IAAI,OAAO,GAAG,IAAI,CAAC;QACnB,IAAI,CAAC,KAAK,CAAC,gBAAgB,CAAC,OAAO,CAAC,EAAE,CAAC;YACrC,MAAM,cAAc,GAAG,KAAK,CAAC,cAAc,EAAE,CAAC;YAC9C,MAAM,KAAK,GAAG,kBAAkB,CAAC,mDAAmD,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;YACrG,MAAM,KAAK,GAAG,kBAAkB,CAAC,mDAAmD,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;YACrG,IAAI,KAAK,KAAK,eAAe,CAAC,IAAI,EAAE,CAAC;gBACnC,IAAI,KAAK,KAAK,eAAe,CAAC,IAAI,EAAE,CAAC,CAAC,0BAA0B;oBAC9D,IAAI,QAAQ,GAAG,GAAG;wBAChB,QAAQ,IAAI,cAAc,CAAC;gBAC/B,CAAC;YACH,CAAC;iBAAM,IAAI,KAAK,KAAK,eAAe,CAAC,IAAI,EAAE,CAAC,CAAC,0BAA0B;gBACrE,IAAI,QAAQ,GAAG,GAAG;oBAChB,QAAQ,IAAI,cAAc,CAAC;YAC/B,CAAC;iBAAM,CAAC,CAAC,uBAAuB;gBAC9B,QAAQ,GAAG,QAAQ,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;gBAC1C,OAAO,GAAG,KAAK,CAAC;YAClB,CAAC;QACH,CAAC;QACD,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,CAAC;IAC/B,CAAC;IAED,gFAAgF;IACzE,MAAM,CAAC,6BAA6B,CACzC,WAAwC,EAAE,OAAe,EAAE,KAAiB;QAE5E,OAAO,IAAI,CAAC,kCAAkC,CAAC,WAAW,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC,QAAQ,CAAC;IACvF,CAAC;CACF","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, extending beyond or clamping to [0,1] according to `extendParam`:\n * * If `radians` is within the sweep, convert it to a fraction of the sweep.\n * * If `radians` is outside the sweep and `extendParam` does not allow extension at both ends, adjust the fraction:\n * * fraction below 0 if `extendParam` allows extension only at start\n * * fraction above 1 if `extendParam` allows extension only at end\n * * fraction clamped to [0,1] if `extendParam` disallows extension at both ends\n * @returns adjusted fraction of sweep, and a boolean indicating whether it is valid, i.e. whether `radians` lies in\n * the sweep extended per `extendParam`.\n */\n public static resolveRadiansToValidSweepFraction(\n extendParam: VariantCurveExtendParameter, radians: number, sweep: AngleSweep,\n ): { fraction: number, isValid: boolean } {\n let fraction = sweep.radiansToSignedPeriodicFraction(radians);\n let isValid = true;\n if (!sweep.isRadiansInSweep(radians)) {\n const fractionPeriod = sweep.fractionPeriod();\n const mode0 = CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(extendParam, 0);\n const mode1 = CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(extendParam, 1);\n if (mode0 !== CurveExtendMode.None) {\n if (mode1 === CurveExtendMode.None) { // only extend to negative\n if (fraction > 1.0)\n fraction -= fractionPeriod;\n }\n } else if (mode1 !== CurveExtendMode.None) { // only extend to positive\n if (fraction < 0.0)\n fraction += fractionPeriod;\n } else { // no extension allowed\n fraction = Geometry.clamp(fraction, 0, 1);\n isValid = false;\n }\n }\n return { fraction, isValid };\n }\n\n /** Call [[resolveRadiansToValidSweepFraction]] and return only the fraction. */\n public static resolveRadiansToSweepFraction(\n extendParam: VariantCurveExtendParameter, radians: number, sweep: AngleSweep,\n ): number {\n return this.resolveRadiansToValidSweepFraction(extendParam, radians, sweep).fraction;\n }\n}\n/**\n * Variant options for extending a curve.\n * * Useful for specifying either a single boolean/`CurveExtendMode` option applicable to both ends of the curve,\n * or an array of options, the first entry of which applies to the curve start; the second, to curve end.\n * @public\n */\nexport type VariantCurveExtendParameter = boolean | CurveExtendMode | CurveExtendMode[];\n"]}
1
+ {"version":3,"file":"CurveExtendMode.js","sourceRoot":"","sources":["../../../src/curve/CurveExtendMode.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AAGvC;;;;GAIG;AACH,MAAM,CAAN,IAAY,eAOX;AAPD,WAAY,eAAe;IACzB,4BAA4B;IAC5B,qDAAQ,CAAA;IACR,oDAAoD;IACpD,+DAAa,CAAA;IACb,8CAA8C;IAC9C,2DAAW,CAAA;AACb,CAAC,EAPW,eAAe,KAAf,eAAe,QAO1B;AACD;;;GAGG;AACH,MAAM,OAAO,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;;;;;;;;;OASG;IACI,MAAM,CAAC,kCAAkC,CAC9C,WAAwC,EAAE,OAAe,EAAE,KAAiB;QAE5E,IAAI,QAAQ,GAAG,KAAK,CAAC,+BAA+B,CAAC,OAAO,CAAC,CAAC;QAC9D,IAAI,OAAO,GAAG,IAAI,CAAC;QACnB,IAAI,CAAC,KAAK,CAAC,gBAAgB,CAAC,OAAO,CAAC,EAAE,CAAC;YACrC,MAAM,cAAc,GAAG,KAAK,CAAC,cAAc,EAAE,CAAC;YAC9C,MAAM,KAAK,GAAG,kBAAkB,CAAC,mDAAmD,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;YACrG,MAAM,KAAK,GAAG,kBAAkB,CAAC,mDAAmD,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;YACrG,IAAI,KAAK,KAAK,eAAe,CAAC,IAAI,EAAE,CAAC;gBACnC,IAAI,KAAK,KAAK,eAAe,CAAC,IAAI,EAAE,CAAC,CAAC,0BAA0B;oBAC9D,IAAI,QAAQ,GAAG,GAAG;wBAChB,QAAQ,IAAI,cAAc,CAAC;gBAC/B,CAAC;YACH,CAAC;iBAAM,IAAI,KAAK,KAAK,eAAe,CAAC,IAAI,EAAE,CAAC,CAAC,0BAA0B;gBACrE,IAAI,QAAQ,GAAG,GAAG;oBAChB,QAAQ,IAAI,cAAc,CAAC;YAC/B,CAAC;iBAAM,CAAC,CAAC,uBAAuB;gBAC9B,QAAQ,GAAG,QAAQ,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;gBAC1C,OAAO,GAAG,KAAK,CAAC;YAClB,CAAC;QACH,CAAC;QACD,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,CAAC;IAC/B,CAAC;IAED,gFAAgF;IACzE,MAAM,CAAC,6BAA6B,CACzC,WAAwC,EAAE,OAAe,EAAE,KAAiB;QAE5E,OAAO,IAAI,CAAC,kCAAkC,CAAC,WAAW,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC,QAAQ,CAAC;IACvF,CAAC;CACF","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n/** @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, extending beyond or clamping to [0,1] according to `extendParam`:\r\n * * If `radians` is within the sweep, convert it to a fraction of the sweep.\r\n * * If `radians` is outside the sweep and `extendParam` does not allow extension at both ends, adjust the fraction:\r\n * * fraction below 0 if `extendParam` allows extension only at start\r\n * * fraction above 1 if `extendParam` allows extension only at end\r\n * * fraction clamped to [0,1] if `extendParam` disallows extension at both ends\r\n * @returns adjusted fraction of sweep, and a boolean indicating whether it is valid, i.e. whether `radians` lies in\r\n * the sweep extended per `extendParam`.\r\n */\r\n public static resolveRadiansToValidSweepFraction(\r\n extendParam: VariantCurveExtendParameter, radians: number, sweep: AngleSweep,\r\n ): { fraction: number, isValid: boolean } {\r\n let fraction = sweep.radiansToSignedPeriodicFraction(radians);\r\n let isValid = true;\r\n if (!sweep.isRadiansInSweep(radians)) {\r\n const fractionPeriod = sweep.fractionPeriod();\r\n const mode0 = CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(extendParam, 0);\r\n const mode1 = CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(extendParam, 1);\r\n if (mode0 !== CurveExtendMode.None) {\r\n if (mode1 === CurveExtendMode.None) { // only extend to negative\r\n if (fraction > 1.0)\r\n fraction -= fractionPeriod;\r\n }\r\n } else if (mode1 !== CurveExtendMode.None) { // only extend to positive\r\n if (fraction < 0.0)\r\n fraction += fractionPeriod;\r\n } else { // no extension allowed\r\n fraction = Geometry.clamp(fraction, 0, 1);\r\n isValid = false;\r\n }\r\n }\r\n return { fraction, isValid };\r\n }\r\n\r\n /** Call [[resolveRadiansToValidSweepFraction]] and return only the fraction. */\r\n public static resolveRadiansToSweepFraction(\r\n extendParam: VariantCurveExtendParameter, radians: number, sweep: AngleSweep,\r\n ): number {\r\n return this.resolveRadiansToValidSweepFraction(extendParam, radians, sweep).fraction;\r\n }\r\n}\r\n/**\r\n * Variant options for extending a curve.\r\n * * Useful for specifying either a single boolean/`CurveExtendMode` option applicable to both ends of the curve,\r\n * or an array of options, the first entry of which applies to the curve start; the second, to curve end.\r\n * @public\r\n */\r\nexport type VariantCurveExtendParameter = boolean | CurveExtendMode | CurveExtendMode[];\r\n"]}
@@ -1 +1 @@
1
- {"version":3,"file":"CurveFactory.js","sourceRoot":"","sources":["../../../src/curve/CurveFactory.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAE/F;;GAEG;AAEH,OAAO,EAAE,SAAS,EAAE,SAAS,EAAE,QAAQ,EAA0B,MAAM,aAAa,CAAC;AACrF,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAC5C,OAAO,EAAE,UAAU,EAAE,MAAM,0BAA0B,CAAC;AAGtD,OAAO,EAAE,QAAQ,EAAE,MAAM,wBAAwB,CAAC;AAElD,OAAO,EAAE,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AACzD,OAAO,EAAE,mBAAmB,EAAE,MAAM,mCAAmC,CAAC;AACxE,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAClE,OAAO,EAAE,WAAW,EAAE,MAAM,2BAA2B,CAAC;AACxD,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAC5C,OAAO,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AACpD,OAAO,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AAEpD,OAAO,EAAE,WAAW,EAAE,MAAM,yBAAyB,CAAC;AAEtD,OAAO,EAAE,eAAe,EAAE,MAAM,6BAA6B,CAAC;AAC9D,OAAO,EAAE,IAAI,EAAE,MAAM,eAAe,CAAC;AACrC,OAAO,EAAE,UAAU,EAAE,MAAM,qBAAqB,CAAC;AACjD,OAAO,EAAE,SAAS,EAAE,MAAM,oBAAoB,CAAC;AAC/C,OAAO,EAAE,KAAK,EAAgB,MAAM,SAAS,CAAC;AAC9C,OAAO,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AAC/C,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAElD,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAChD,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAChD,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAC9C,OAAO,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAC9B,OAAO,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAC9B,OAAO,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AACxC,OAAO,EAAE,kBAAkB,EAAE,MAAM,6BAA6B,CAAC;AAyBjE;;;GAGG;AACH,MAAM,CAAN,IAAY,wBAOX;AAPD,WAAY,wBAAwB;IAClC,8DAA8D;IAC9D,+EAAY,CAAA;IACZ,wEAAwE;IACxE,2FAAkB,CAAA;IAClB,6FAA6F;IAC7F,+EAAY,CAAA;AACd,CAAC,EAPW,wBAAwB,KAAxB,wBAAwB,QAOnC;AAgCA,CAAC;AAEF;;;GAGG;AACH,MAAM,OAAO,YAAY;IACvB,mFAAmF;IAC3E,MAAM,CAAC,iBAAiB,CAC9B,IAAU,EAAE,WAAoB,EAChC,MAA2B,EAAE,MAA2B,EACxD,SAAiB,EAAE,SAAiB;QAEpC,IAAI,WAAW,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC,EAAE,CAAC;YAC3C,IAAI,MAAM,KAAK,SAAS,IAAI,MAAM,KAAK,SAAS,IAAI,CAAC,QAAQ,CAAC,mBAAmB,CAAC,SAAS,EAAE,SAAS,CAAC;gBACrG,IAAI,CAAC,WAAW,CAAC,aAAa,CAAC,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,SAAS,EAAE,MAAM,CAAC,EAAE,MAAM,CAAC,WAAW,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC;QACzH,CAAC;IACH,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,0BAA0B,CAAC,KAAc,EAAE,cAAwB,EAAE,GAAY;QAC7F,MAAM,GAAG,GAAG,KAAK,CAAC,6BAA6B,CAAC,KAAK,EAAE,cAAc,EAAE,GAAG,CAAC,CAAC;QAC5E,IAAI,GAAG,YAAY,KAAK;YACtB,OAAO,GAAG,CAAC;;YAEX,OAAO,SAAS,CAAC;IACrB,CAAC;IACD;;;;;;;;;OASG;IACI,MAAM,CAAC,yBAAyB,CACrC,MAAuD,EACvD,MAAyB,EACzB,uBAAgC,IAAI;QAEpC,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC;YACvB,OAAO,IAAI,CAAC,yBAAyB,CAAC,IAAI,mBAAmB,CAAC,MAAM,CAAC,EAAE,MAAM,EAAE,oBAAoB,CAAC,CAAC;QACvG,IAAI,MAAM,YAAY,YAAY;YAChC,OAAO,IAAI,CAAC,yBAAyB,CAAC,MAAM,CAAC,YAAY,EAAE,MAAM,EAAE,oBAAoB,CAAC,CAAC;QAC3F,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;QACxB,IAAI,CAAC,IAAI,CAAC;YACR,OAAO,SAAS,CAAC;QACnB,MAAM,MAAM,GAAG,MAAM,CAAC,6BAA6B,CAAC,CAAC,CAAE,CAAC;QACxD,MAAM,MAAM,GAAG,MAAM,CAAC,6BAA6B,CAAC,CAAC,CAAE,CAAC;QACxD,4DAA4D;QAC5D,MAAM,UAAU,GAAmB,EAAE,CAAC;QACtC,yCAAyC;QACzC,UAAU,CAAC,IAAI,CAAC,EAAE,UAAU,EAAE,GAAG,EAAE,UAAU,EAAE,GAAG,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;QAC7E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/B,MAAM,MAAM,GAAG,MAAM,CAAC,6BAA6B,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC;YAC5D,IAAI,UAAU,GAAG,CAAC,CAAC;YACnB,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;gBAC1B,IAAI,CAAC,GAAG,MAAM,CAAC,MAAM;oBACnB,UAAU,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YAC3B,CAAC;iBAAM,IAAI,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC;gBAChC,UAAU,GAAG,MAAM,CAAC;YACtB,IAAI,UAAU,KAAK,GAAG;gBACpB,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,eAAe,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,UAAU,CAAC,CAAC,CAAC;;gBAE3E,UAAU,CAAC,IAAI,CAAC,EAAE,UAAU,EAAE,GAAG,EAAE,UAAU,EAAE,GAAG,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;YAC/E,MAAM,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC;YAC9B,MAAM,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC;QAChC,CAAC;QACD,UAAU,CAAC,IAAI,CAAC,EAAE,UAAU,EAAE,GAAG,EAAE,UAAU,EAAE,GAAG,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;QAC7E,IAAI,CAAC,oBAAoB,EAAE,CAAC;YAC1B,kFAAkF;YAClF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC/B,MAAM,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;gBACxB,IAAI,CAAC,CAAC,UAAU,GAAG,GAAG;uBACjB,CAAC,CAAC,UAAU,GAAG,GAAG;uBAClB,GAAG,GAAG,CAAC,CAAC,UAAU,GAAG,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,UAAU;uBACjD,CAAC,CAAC,UAAU,GAAG,GAAG,GAAG,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC;oBACvD,CAAC,CAAC,UAAU,GAAG,GAAG,CAAC;oBACnB,CAAC,CAAC,UAAU,GAAG,GAAG,CAAC;oBACnB,UAAU,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,SAAS,CAAC;gBAChC,CAAC;YACH,CAAC;YACD;;;;;;;;;;;gBAWI;QACN,CAAC;QACD,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;QAC3B,IAAI,CAAC,iBAAiB,CACpB,IAAI,EAAE,oBAAoB,EAC1B,UAAU,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,KAAK,EACxC,UAAU,CAAC,CAAC,CAAC,CAAC,UAAU,EAAE,GAAG,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,UAAU,CACzD,CAAC;QACF,uCAAuC;QACvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,MAAM,EAAE,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;YACzB,MAAM,EAAE,GAAG,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC7B,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;YACzB,IAAI,CAAC,iBAAiB,CAAC,IAAI,EAAE,oBAAoB,EAAE,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,UAAU,EAAE,GAAG,GAAG,EAAE,CAAC,UAAU,CAAC,CAAC;QAC7G,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,iBAAiB,CAC7B,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,IAAY,CAAC,EAAE,YAAqB;QAEpF,IAAI,MAAM,GAAG,QAAQ,CAAC,0BAA0B,CAAC,YAAY,CAAC,CAAC;QAC/D,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAC9B,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAC9B,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAC9B,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAC9B,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,GAAG,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,EAAE,GAAG,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC;QAC9E,IAAI,MAAM,KAAK,GAAG;YAChB,OAAO,IAAI,CAAC,aAAa,CAAC;gBACxB,OAAO,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC;gBAC7B,OAAO,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC;gBAC7B,OAAO,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC;gBAC7B,OAAO,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC;gBAC7B,OAAO,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC;aAC9B,CAAC,CAAC;aACA,CAAC;YACJ,MAAM,OAAO,GAAG,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAC9C,MAAM,OAAO,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC;YAC9C,MAAM,GAAG,GAAG,IAAI,GAAG,MAAM,CAAC;YAC1B,MAAM,GAAG,GAAG,IAAI,GAAG,MAAM,CAAC;YAC1B,MAAM,GAAG,GAAG,IAAI,GAAG,MAAM,CAAC;YAC1B,MAAM,GAAG,GAAG,IAAI,GAAG,MAAM,CAAC;YAC1B,MAAM,OAAO,GAAG;gBACd,OAAO,CAAC,MAAM,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;gBAC3B,OAAO,CAAC,MAAM,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;gBAC3B,OAAO,CAAC,MAAM,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;gBAC3B,OAAO,CAAC,MAAM,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;aAC5B,CAAC;YACF,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;YAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,MAAM,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;gBAC1B,MAAM,UAAU,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBACxC,MAAM,UAAU,GAAG,QAAQ,CAAC,cAAc,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;gBAC/D,MAAM,GAAG,GAAG,KAAK,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,UAAU,CAAC,qBAAqB,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;gBAC5F,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;gBACtB,MAAM,MAAM,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAC;gBAC9B,IAAI,CAAC,UAAU,CAAC,YAAY;oBAC1B,IAAI,CAAC,WAAW,CAAC,aAAa,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;gBAC1E,OAAO,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;gBAC/B,OAAO,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;YACjC,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;IACD;;;;;;;OAOG;IACI,MAAM,CAAC,kBAAkB,CAAC,IAAW,EAAE,IAAW,EAAE,eAAwB,KAAK;QACtF,IAAI,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;YAC3C,MAAM,SAAS,GAAG,QAAQ,CAAC,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACtG,yFAAyF;YACzF,MAAM,IAAI,GAAG,IAAI,CAAC,yBAAyB,CAAC,IAAI,CAAC,KAAK,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC;YAC7E,IAAI,IAAI,CAAC,KAAK,CAAC,YAAY,GAAG,CAAC;gBAC7B,IAAI,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC;YACpC,MAAM,MAAM,GAAG,IAAI,CAAC,yBAAyB,CAAC,IAAI,CAAC,KAAK,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC;YAC/E,IAAI,IAAI,CAAC,KAAK,CAAC,YAAY,GAAG,CAAC;gBAC7B,MAAM,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC;YACtC,IAAI,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,EAAE,CAAC;gBAC/B,IAAI,CAAC,KAAK,CAAC,kBAAkB,CAC3B,IAAI,CAAC,KAAK,CAAC,YAAY,EAAE,IAAI,CAAC,KAAK,CAAC,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,YAAY,GAAG,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,YAAY,CACjH,CAAC;gBACF,OAAO,IAAI,CAAC;YACd,CAAC;YACD,6BAA6B;YAC7B,IAAI,YAAY,EAAE,CAAC;gBACjB,MAAM,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC;gBACpC,IAAI,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,EAAE,CAAC;oBAC/B,IAAI,CAAC,KAAK,CAAC,kBAAkB,CAC3B,IAAI,CAAC,KAAK,CAAC,YAAY,EAAE,IAAI,CAAC,KAAK,CAAC,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,YAAY,GAAG,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,YAAY,CACjH,CAAC;oBACF,OAAO,IAAI,CAAC;gBACd,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;;;OAOG;IACI,MAAM,CAAC,2BAA2B,CACvC,SAAoB,EAAE,UAA+B,EAAE,gCAAwC,GAAG;QAElG,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;QAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/C,MAAM,GAAG,GAAG,SAAS,CAAC,gCAAgC,CACpD,UAAU,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,EACxB,6BAA6B,EAC7B,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC;YAChC,OAAO,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;QAC3B,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IACO,MAAM,CAAC,wBAAwB,CAAC,SAAsD,EAAE,MAAuB;QACrH,IAAI,SAAS,YAAY,aAAa;YACpC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;aACpB,IAAI,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE,CAAC;YAClC,KAAK,MAAM,CAAC,IAAI,SAAS;gBACvB,IAAI,CAAC,wBAAwB,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;QAC7C,CAAC;IACH,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,kBAAkB,CAC9B,UAAuC,EAAE,UAAkB;QAE3D,IAAI,UAAU,YAAY,aAAa,EAAE,CAAC;YACxC,OAAO,IAAI,CAAC,gBAAgB,CAAC,UAAU,CAAC,UAAU,EAAE,EAAE,UAAU,CAAC,QAAQ,EAAE,EAAE,UAAU,EAAE,UAAU,EAAE,KAAK,CAAC,CAAC;QAC9G,CAAC;aAAM,IAAI,UAAU,YAAY,KAAK,EAAE,CAAC;YACvC,OAAO,SAAS,CAAC,cAAc,CAAC,UAAU,EAAE,UAAU,EAAE,KAAK,CAAC,CAAC;QACjE,CAAC;aAAM,IAAI,UAAU,YAAY,cAAc,EAAE,CAAC;YAChD,MAAM,OAAO,GAAG,eAAe,CAAC,MAAM,EAAE,CAAC;YACzC,OAAO,CAAC,eAAe,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC;YAChD,OAAO,OAAO,CAAC,aAAa,EAAE,CAAC;QACjC,CAAC;aAAM,IAAI,UAAU,YAAY,UAAU,EAAE,CAAC;YAC5C,MAAM,MAAM,GAAoB,EAAE,CAAC;YACnC,KAAK,MAAM,CAAC,IAAI,UAAU,CAAC,QAAQ,EAAE,CAAC;gBACpC,MAAM,IAAI,GAAG,IAAI,CAAC,kBAAkB,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;gBACpD,IAAI,CAAC,wBAAwB,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;YAC9C,CAAC;YACD,OAAO,MAAM,CAAC;QAChB,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,0DAA0D;IAClD,MAAM,CAAC,oBAAoB,CAAC,KAAwD;QAC1F,IAAI,KAAK,YAAY,cAAc;YACjC,OAAO,KAAK,CAAC,4BAA4B,CAAC,GAAG,CAAC,CAAC;QACjD,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC;YAClB,OAAO,SAAS,CAAC;QACnB,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;YACtB,KAAK,GAAG,IAAI,mBAAmB,CAAC,KAAK,CAAC,CAAC;QACzC,MAAM,GAAG,GAAG,KAAK,CAAC,UAAU,EAAE,CAAC;QAC/B,KAAK,CAAC,+BAA+B,CAAC,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;QACrD,KAAK,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,SAAS,CAAC,CAAC;QAC5C,OAAO,GAAG,CAAC;IACb,CAAC;IAAA,CAAC;IACF,uGAAuG;IAChG,MAAM,CAAC,wBAAwB,CACpC,UAA6D,EAAE,WAAmC;QAElG,MAAM,GAAG,GAAG,YAAY,CAAC,oBAAoB,CAAC,UAAU,CAAC,CAAC;QAC1D,IAAI,CAAC,GAAG;YACN,OAAO,SAAS,CAAC;QACnB,IAAI,GAAU,CAAC;QACf,IAAI,WAAW,YAAY,KAAK,EAAE,CAAC;YACjC,GAAG,GAAG,WAAW,CAAC,KAAK,EAAE,CAAC;YAC1B,GAAG,CAAC,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC;QAC1B,CAAC;aAAM,CAAC;YACN,MAAM,OAAO,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC;YAClC,MAAM,QAAQ,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC;YACnC,MAAM,OAAO,GAAG,CAAC,OAAO,WAAW,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC;YAChF,MAAM,QAAQ,GAAG,CAAC,OAAO,WAAW,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC;YACjF,MAAM,SAAS,GAAG,QAAQ,CAAC,kBAAkB,CAAC,GAAG,CAAC,SAAS,EAAE,SAAS,CAAC,GAAG,CAAC,CAAC;YAC5E,SAAS,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC;YACjD,SAAS,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC;YACnD,GAAG,GAAG,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC;QACpD,CAAC;QACD,IAAI,GAAG,CAAC,cAAc,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,SAAS,CAAC,GAAG,GAAG;YACtD,GAAG,CAAC,cAAc,EAAE,CAAC;QACvB,OAAO,GAAG,CAAC;IACb,CAAC;IACD;;;;;;;;;;;;;;;;;;;OAmBG;IACI,MAAM,CAAC,yBAAyB,CAAC,UAAgC,EAAE,WAAmC;QAC3G,MAAM,GAAG,GAAG,YAAY,CAAC,wBAAwB,CAAC,UAAU,EAAE,WAAW,CAAC,CAAC;QAC3E,IAAI,CAAC,GAAG;YACN,OAAO,EAAE,CAAC;QACZ,MAAM,aAAa,GAAG,YAAY,CAAC,0BAA0B,CAAC,UAAU,EAAE,GAAG,CAAC,CAAC;QAC/E,IAAI,aAAa;YACf,OAAO,aAAa,CAAC,QAAmB,CAAC;QAC3C,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,6EAA6E;IACrE,MAAM,CAAC,iBAAiB,CAC9B,KAAqE,EACrE,OAAuB;QAEvB,IAAI,YAAY,EAAE,UAAgC,CAAC;QACnD,IAAI,KAAK,YAAY,cAAc,EAAE,CAAC;YACpC,YAAY,GAAG,KAAK,CAAC,4BAA4B,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC;YACjE,UAAU,GAAG,KAAK,CAAC,4BAA4B,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC;YAC/D,MAAM,OAAO,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC;YACtC,KAAK,CAAC,WAAW,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;YACpC,KAAK,GAAG,OAAO,CAAC,YAAY,CAAC;QAC/B,CAAC;aAAM,IAAI,KAAK,YAAY,UAAU,EAAE,CAAC;YACvC,YAAY,GAAG,KAAK,CAAC,uBAAuB,EAAE,EAAE,SAAS,CAAC;YAC1D,UAAU,GAAG,KAAK,CAAC,qBAAqB,EAAE,EAAE,SAAS,CAAC;YACtD,MAAM,OAAO,GAAG,KAAK,CAAC,gBAAgB,CAAC,OAAO,CAAC,CAAC;YAChD,IAAI,CAAC,OAAO;gBACV,OAAO,SAAS,CAAC;YACnB,KAAK,GAAG,OAAO,CAAC;QAClB,CAAC;aAAM,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;YAC7B,KAAK,GAAG,IAAI,mBAAmB,CAAC,KAAK,CAAC,CAAC;QACzC,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,YAAY,EAAE,UAAU,EAAE,CAAC;IACtD,CAAC;IAED;;;OAGG;IACK,MAAM,CAAC,+BAA+B,CAC5C,UAAwC,EACxC,SAAuC,EACvC,cAAgC,EAChC,OAA6B;QAE7B,MAAM,OAAO,GAAG,OAAO,EAAE,YAAY,IAAI,CAAC,cAAc,EAAE,YAAY,IAAI,UAAU,CAAC,YAAY,EAAE,CAAC,CAAC;QACrG,MAAM,OAAO,GAAG,OAAO,EAAE,UAAU,IAAI,CAAC,cAAc,EAAE,UAAU,IAAI,SAAS,CAAC,YAAY,EAAE,CAAC,CAAC;QAChG,IAAI,OAAO,EAAE,sBAAsB,IAAI,UAAU,CAAC,YAAY,EAAE,CAAC,aAAa,CAAC,SAAS,CAAC,YAAY,EAAE,CAAC,EAAE,CAAC;YACzG,MAAM,SAAS,GAAG,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACxC,IAAI,SAAS,CAAC,mBAAmB,EAAE,EAAE,CAAC,CAAC,sBAAsB;gBAC3D,UAAU,CAAC,YAAY,EAAE,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;gBAC7C,SAAS,CAAC,YAAY,EAAE,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;gBAC5C,OAAO;YACT,CAAC;QACH,CAAC;QACD,IAAI,OAAO,CAAC,mBAAmB,EAAE;YAC/B,UAAU,CAAC,YAAY,EAAE,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;QAC7C,IAAI,OAAO,CAAC,mBAAmB,EAAE;YAC/B,SAAS,CAAC,YAAY,EAAE,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;IAC9C,CAAC;IAED,qHAAqH;IAC7G,MAAM,CAAC,uBAAuB,CAAC,KAAe,EAAE,WAAqB;QAC3E,IAAI,WAAkC,CAAC;QACvC,IAAI,KAAK,YAAY,cAAc,EAAE,CAAC;YACpC,IAAI,KAAK,CAAC,UAAU,EAAE,CAAC,aAAa,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC;gBACpD,WAAW,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACrC,CAAC;aAAM,IAAI,KAAK,CAAC,WAAW,EAAE;YAC5B,WAAW,GAAG,KAAK,CAAC;QACtB,IAAI,WAAW,EAAE,CAAC;YAChB,2GAA2G;YAC3G,MAAM,OAAO,GAAG,QAAQ,CAAC,kBAAkB,CAAC,WAAW,CAAC,CAAC,SAAS,EAAE,CAAC;YACrE,MAAM,UAAU,GAAG,WAAW,CAAC,gBAAgB,CAAC,SAAS,CAAC,qBAAqB,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC,CAAC;YACrG,IAAI,UAAU,EAAE,CAAC,CAAC,6BAA6B;gBAC7C,MAAM,MAAM,GAAG,SAAS,CAAC,aAAa,CAAC,UAAuB,CAAC,CAAC;gBAChE,IAAI,MAAM,IAAI,MAAM,GAAG,CAAC;oBACtB,KAAK,CAAC,cAAc,EAAE,CAAC;YAC3B,CAAC;QACH,CAAC;IACH,CAAC;IAED;;;;OAIG;IACK,MAAM,CAAC,cAAc,CAC3B,MAAiC,EACjC,UAAwC,EACxC,UAAwC,EACxC,WAAyC,EACzC,OAAiB;QAEjB,MAAM,WAAW,GAAG,QAAQ,CAAC,cAAc,CAAC,UAAU,CAAC,YAAY,EAAE,EAAE,UAAU,CAAC,YAAY,EAAE,CAAC,CAAC;QAClG,MAAM,SAAS,GAAG,SAAS,CAAC,+BAA+B,CACzD,WAAW,EAAE,WAAW,CAAC,YAAY,EAAE,EAAE,WAAW,CAAC,YAAY,EAAE,CACpE,CAAC;QACF,IAAI,SAAS,KAAK,SAAS;YACzB,OAAO,OAAO,CAAC;QACjB,MAAM,kBAAkB,GAAG,OAAO,CAAC,gBAAgB,CAAC,SAAS,CAAC,CAAC;QAC/D,IAAI,kBAAkB,KAAK,SAAS;YAClC,OAAO,OAAO,CAAC;QACjB,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QAChC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAC;QACzC,OAAO,kBAAkB,CAAC;IAC5B,CAAC;IAED;;;;;;;;;;;;;;;;;;;OAmBG;IACI,MAAM,CAAC,0BAA0B,CACtC,UAA0E,EAC1E,cAAwB,EACxB,OAA6B;QAE7B,IAAI,CAAC,OAAO;YACV,OAAO,GAAG,EAAE,CAAC;QACf,MAAM,IAAI,GAAG,IAAI,CAAC,iBAAiB,CAAC,UAAU,EAAE,OAAO,CAAC,aAAa,CAAC,CAAC;QACvE,IAAI,CAAC,IAAI;YACP,OAAO,SAAS,CAAC;QACnB,MAAM,MAAM,GAAG,WAAW,CAAC,qCAAqC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC/E,IAAI,CAAC,MAAM,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC;YAC9B,OAAO,SAAS,CAAC;QACnB,IAAI,CAAC,+BAA+B,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;QAE1F,kHAAkH;QAClH,+GAA+G;QAC/G,IAAI,CAAC,uBAAuB,CAAC,cAAc,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,YAAY,EAAE,CAAC,CAAC;QAEvE,MAAM,WAAW,GAA8B,EAAE,QAAQ,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC;QAC5E,IAAI,cAAc,GAAG,IAAI,CAAC,cAAc,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC;QACvG,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE;YACpC,cAAc,GAAG,IAAI,CAAC,cAAc,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC;QAEzG,IAAI,OAAO,CAAC,YAAY,EAAE,CAAC;YACzB,MAAM,UAAU,GAAG,UAAU,CAAC,MAAM,CAAC,WAAW,CAAC,QAAQ,EAAE,OAAO,CAAC,MAAM,IAAI,KAAK,CAAC,CAAC;YACpF,IAAI,UAAU,EAAE,CAAC;gBACf,WAAW,CAAC,UAAU,GAAG,UAAU,CAAC;gBACpC,IAAI,wBAAwB,CAAC,QAAQ,KAAK,OAAO,CAAC,YAAY,EAAE,CAAC;oBAC/D,MAAM,OAAO,GAAG,eAAe,CAAC,MAAM,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC;oBAC9D,OAAO,CAAC,aAAa,CAAC,UAAU,CAAC,CAAC;oBAClC,WAAW,CAAC,IAAI,GAAG,OAAO,CAAC,aAAa,EAAE,CAAC;gBAC7C,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,WAAW,CAAC;IACrB,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,2BAA2B,CACvC,KAAc,EAAE,cAAwB,EAAE,MAAc,EAAE,QAAmB,EAAE,KAA0B;QAEzG,OAAO,KAAK,CAAC,gCAAgC,CAAC,KAAK,EAAE,cAAc,EAAE,MAAM,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC;IAChG,CAAC;IACD;;;;;;;;;OASG;IACI,MAAM,CAAC,0BAA0B,CACtC,UAAoC,EACpC,UAAmB,EACnB,aAAsB,EACtB,WAAoB;QAEpB,MAAM,QAAQ,GAAG,QAAQ,CAAC,cAAc,CAAC,UAAU,EAAE,aAAa,CAAC,CAAC;QACpE,MAAM,SAAS,GAAG,QAAQ,CAAC,cAAc,CAAC,aAAa,EAAE,WAAW,CAAC,CAAC;QACtE,MAAM,eAAe,GAAG,QAAQ,CAAC,SAAS,EAAE,CAAC;QAC7C,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC;QACrD,MAAM,eAAe,GAAG,QAAQ,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC;QACtD,MAAM,iBAAiB,GAAG,GAAG,GAAG,eAAe,CAAC,OAAO,CAAC;QACxD,MAAM,SAAS,GAAG,SAAS,GAAG,eAAe,CAAC,OAAO,CAAC;QACtD,MAAM,KAAK,GAAG,QAAQ,CAAC,6BAA6B,CAAC,SAAS,CAAC,CAAC,EAAE,KAAK,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC,CAAC;QAClG,MAAM,MAAM,GAAG,SAAS,CAAC,UAAU,CAAC,UAAU,CAAC,KAAK,EAAE,EAAE,KAAK,CAAC,CAAC;QAC/D,yEAAyE;QACzE,0EAA0E;QAC1E,MAAM,gBAAgB,GAAG,kBAAkB,CAAC,iBAAiB,CAAC,UAAU,EAAE,GAAG,EAAE,SAAS,EACtF,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,aAAa,CAAC,iBAAiB,CAAC,EAAE,eAAe,EAAE,SAAS,EAAE,MAAM,CAAC,CAAC;QACtG,IAAI,gBAAgB,EAAE,CAAC;YACrB,MAAM,4BAA4B,GAAG,SAAS,GAAG,iBAAiB,CAAC;YACnE,MAAM,2BAA2B,GAAG,QAAQ,CAAC,WAAW,CAAC,GAAG,EAAE,KAAK,CAAC,aAAa,CAAC,4BAA4B,CAAC,CAAC,CAAC;YACjH,MAAM,SAAS,GAAG,2BAA2B,CAAC,kBAAkB,CAAC,UAAU,EAAE,aAAa,CAAC,CAAC;YAC5F,MAAM,iBAAiB,GAAG,2BAA2B,CAAC,kBAAkB,CAAC,UAAU,EAAE,gBAAgB,CAAC,QAAQ,EAAE,CAAC,CAAC;YAClH,MAAM,WAAW,GAAG,SAAS,GAAG,iBAAiB,CAAC;YAClD,MAAM,OAAO,GAAG,kBAAkB,CAAC,iBAAiB,CAAC,UAAU,EAAE,GAAG,EAAE,SAAS,EAC7E,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,aAAa,CAAC,iBAAiB,CAAC,EAAE,eAAe,GAAG,WAAW,EAAE,SAAS,EAAE,MAAM,CAAE,CAAC;YACrH,MAAM,UAAU,GAAG,QAAQ,CAAC,SAAS,EAAE,CAAC;YACxC,MAAM,QAAQ,GAAG,QAAQ,CAAC,cAAc,CAAC,aAAa,EAAE,WAAW,CAAC,CAAC;YACrE,QAAQ,CAAC,aAAa,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC;YAC7C,MAAM,MAAM,GAAG,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YAC5C,MAAM,KAAK,GAAG,QAAQ,CAAC,6BAA6B,CAAC,SAAS,CAAC,CAAC,EAAE,KAAK,CAAC,aAAa,CAAC,SAAS,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;YAC5G,MAAM,MAAM,GAAG,SAAS,CAAC,UAAU,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;YACnD,MAAM,OAAO,GAAG,kBAAkB,CAAC,iBAAiB,CAAC,UAAU,EAC7D,CAAC,EAAE,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,EAAE,KAAK,CAAC,IAAI,EAAE,EAAE,SAAS,EAAE,OAAO,CAAC,WAAW,EAAE,EAAE,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,CAAE,CAAC;YAC5G,OAAO,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;QAC5B,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;;;;OASG;IACI,MAAM,CAAC,0CAA0C,CACtD,UAAoC,EACpC,MAAe,EACf,MAAe,EACf,MAAe,EACf,YAAoB;QAEpB,MAAM,QAAQ,GAAG,QAAQ,CAAC,cAAc,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QACzD,MAAM,QAAQ,GAAG,QAAQ,CAAC,cAAc,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QACzD,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC;QACrD,MAAM,aAAa,GAAG,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;QACnD,MAAM,iBAAiB,GAAG,GAAG,GAAG,aAAa,CAAC,OAAO,CAAC;QACtD,MAAM,eAAe,GAAG,GAAG,GAAG,CAAC,IAAI,CAAC,EAAE,GAAG,aAAa,CAAC,OAAO,CAAC,CAAC;QAChE,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACvD,MAAM,SAAS,GAAG,kBAAkB,CAAC,iBAAiB,CACpD,UAAU,EAAE,CAAC,EAAE,SAAS,EACxB,KAAK,CAAC,IAAI,EAAE,EAAE,KAAK,CAAC,aAAa,CAAC,iBAAiB,CAAC,EACpD,YAAY,EAAE,SAAS,EAAE,SAAS,CAAC,cAAc,EAAE,CACpD,CAAC;QACF,IAAI,SAAS,EAAE,CAAC;YACd,MAAM,aAAa,GAAG,SAAS,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;YACnD,MAAM,UAAU,GAAG,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;YAC3C,MAAM,UAAU,GAAG,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;YAC3C,oGAAoG;YACpG,uFAAuF;YACvF,MAAM,UAAU,GAAG,aAAa,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,eAAe,CAAC,CAAC;YAC/D,MAAM,WAAW,GAAG,QAAQ,CAAC,yBAAyB,CAAC,UAAU,GAAG,UAAU,GAAG,aAAa,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;YAC9G,MAAM,WAAW,GAAG,QAAQ,CAAC,yBAAyB,CAAC,UAAU,GAAG,UAAU,GAAG,aAAa,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;YAC9G,IAAI,WAAW,KAAK,SAAS,IAAI,WAAW,KAAK,SAAS,EAAE,CAAC;gBAC3D,MAAM,KAAK,GAAG,QAAQ,CAAC,6BAA6B,CAAC,SAAS,CAAC,CAAC,EAAE,KAAK,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC,CAAC;gBAClG,MAAM,YAAY,GAAG,MAAM,CAAC,WAAW,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;gBAC7D,MAAM,MAAM,GAAG,SAAS,CAAC,UAAU,CAAC,YAAY,EAAE,KAAK,CAAC,CAAC;gBACzD,MAAM,QAAQ,GAAG,kBAAkB,CAAC,iBAAiB,CACnD,UAAU,EAAE,CAAC,EAAE,SAAS,EACxB,KAAK,CAAC,IAAI,EAAE,EAAE,KAAK,CAAC,aAAa,CAAC,iBAAiB,CAAC,EACpD,YAAY,EAAE,SAAS,EAAE,MAAM,CAC/B,CAAC;gBACH,MAAM,KAAK,GAAG,QAAQ,CAAC,6BAA6B,CAAC,SAAS,CAAC,CAAC,EAAE,KAAK,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC,CAAC;gBAClG,MAAM,YAAY,GAAG,MAAM,CAAC,WAAW,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;gBAC7D,MAAM,MAAM,GAAG,SAAS,CAAC,UAAU,CAAC,YAAY,EAAE,KAAK,CAAC,CAAC;gBACzD,MAAM,QAAQ,GAAG,kBAAkB,CAAC,iBAAiB,CACnD,UAAU,EAAE,CAAC,EAAE,SAAS,EACxB,KAAK,CAAC,IAAI,EAAE,EAAE,KAAK,CAAC,aAAa,CAAC,CAAC,iBAAiB,CAAC,EACrD,YAAY,EAAE,SAAS,EAAE,MAAM,CAC/B,CAAC;gBACH,OAAO,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;YAC9B,CAAC;QACH,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;;;;OASG;IACI,MAAM,CAAC,6BAA6B,CACzC,UAAoC,EACpC,MAAe,EACf,MAAe,EACf,MAAe,EACf,OAAe,EACf,OAAe,EACf,SAAiB;QAEjB,MAAM,QAAQ,GAAG,QAAQ,CAAC,cAAc,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC;QACzE,MAAM,QAAQ,GAAG,QAAQ,CAAC,cAAc,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC;QACzE,MAAM,MAAM,GAAG,QAAQ,CAAC,SAAS,EAAE,CAAC;QACpC,MAAM,MAAM,GAAG,QAAQ,CAAC,SAAS,EAAE,CAAC;QACpC,IAAI,MAAM,KAAK,SAAS,IAAI,MAAM,KAAK,SAAS;YAC9C,OAAO,SAAS,CAAC;QACnB,MAAM,UAAU,GAAG,MAAM,CAAC,mBAAmB,EAAE,CAAC;QAChD,MAAM,UAAU,GAAG,MAAM,CAAC,mBAAmB,EAAE,CAAC;QAChD,MAAM,QAAQ,GAAG,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;QAC9C,MAAM,KAAK,GAAG,QAAQ,CAAC,aAAa,CAAC,QAAQ,CAAC,OAAO,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAClE,MAAM,KAAK,GAAG,CAAE,KAAK,CAAC;QACtB,MAAM,OAAO,GAAG,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QAC5C,MAAM,OAAO,GAAG,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QAC5C,MAAM,OAAO,GAAG,kBAAkB,CAAC,iBAAiB,CAAC,UAAU,EAC7D,CAAC,EAAE,OAAO,EAAE,KAAK,CAAC,IAAI,EAAE,EAAE,SAAS,EAAE,OAAO,EAAE,SAAS,EAAE,SAAS,CAAC,cAAc,EAAE,CAAE,CAAC;QACxF,MAAM,OAAO,GAAG,kBAAkB,CAAC,iBAAiB,CAAC,UAAU,EAC7D,CAAC,EAAE,OAAO,EAAE,KAAK,CAAC,IAAI,EAAE,EAAE,SAAS,EAAE,OAAO,EAAE,SAAS,EAAE,SAAS,CAAC,cAAc,EAAE,CAAE,CAAC;QACxF,MAAM,UAAU,GAAG,OAAO,CAAC,6BAA6B,CAAC,GAAG,CAAC,CAAC;QAC9D,MAAM,UAAU,GAAG,OAAO,CAAC,6BAA6B,CAAC,GAAG,CAAC,CAAC;QAC9D,oGAAoG;QACpG,MAAM,EAAE,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,GAAG,OAAO,GAAG,UAAU,CAAC,SAAS,CAAC,CAAC,CAAC;QAClE,MAAM,EAAE,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,GAAG,OAAO,GAAG,UAAU,CAAC,SAAS,CAAC,CAAC,CAAC;QAClE,MAAM,EAAE,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,GAAG,OAAO,GAAG,UAAU,CAAC,SAAS,CAAC,CAAC,CAAC;QAClE,MAAM,EAAE,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,GAAG,OAAO,GAAG,UAAU,CAAC,SAAS,CAAC,CAAC,CAAC;QAClE,+DAA+D;QAC/D,MAAM,OAAO,GAAG,QAAQ,CAAC,gBAAgB,CAAC,MAAM,EAAE,EAAE,EAAE,UAAU,EAAE,EAAE,CAAC,CAAC;QACtE,MAAM,OAAO,GAAG,QAAQ,CAAC,gBAAgB,CAAC,MAAM,EAAE,EAAE,EAAE,UAAU,EAAE,EAAE,CAAC,CAAC;QACtE,MAAM,EAAE,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC;QAC7B,IAAI,WAAW,CAAC,cAAc,CAC5B,MAAM,CAAC,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC,EACnB,MAAM,CAAC,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC,EACnB,OAAO,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC;YACpD,MAAM,UAAU,GAAG,MAAM,CAAC,UAAU,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;YACnD,MAAM,UAAU,GAAG,MAAM,CAAC,UAAU,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;YACnD,MAAM,MAAM,GAAG,SAAS,CAAC,4BAA4B,CAAC,UAAU,EAAE,MAAM,EAAE,UAAU,EAAE,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAC;YACxG,MAAM,MAAM,GAAG,SAAS,CAAC,4BAA4B,CAAC,UAAU,EAAE,MAAM,EAAE,UAAU,EAAE,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAC;YACxG,OAAO,CAAC,mBAAmB,CAAC,MAAM,CAAC,CAAC;YACpC,OAAO,CAAC,mBAAmB,CAAC,MAAM,CAAC,CAAC;YACpC,MAAM,KAAK,GAAG,OAAO,CAAC,6BAA6B,CAAC,GAAG,CAAC,CAAC;YACzD,MAAM,KAAK,GAAG,OAAO,CAAC,6BAA6B,CAAC,GAAG,CAAC,CAAC;YACzD,KAAK,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC;YACnC,MAAM,KAAK,GAAG,KAAK,CAAC,SAAS,CAAC,SAAS,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;YACzD,IAAI,OAAO,GAAG,CAAC;gBACb,KAAK,CAAC,UAAU,CAAC,CAAE,KAAK,CAAC,OAAO,CAAC,CAAC;YACpC,MAAM,GAAG,GAAG,YAAY,CAAC,2BAA2B,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,SAAS,EAAE,OAAO,EAAE,SAAS,EAAE,KAAK,CAAE,CAAC;YAChH,OAAO,CAAC,OAAO,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;QACjC,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,iDAAiD;IAC1C,MAAM,CAAC,yBAAyB,CACrC,MAA8B,EAAE,MAA8B;QAC9D,MAAM,SAAS,GAAG,MAAM,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAC9C,MAAM,SAAS,GAAG,MAAM,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAC9C,MAAM,QAAQ,GAAG,MAAM,CAAC,OAAO,EAAE,CAAC;QAClC,MAAM,QAAQ,GAAG,MAAM,CAAC,OAAO,EAAE,CAAC;QAClC,MAAM,QAAQ,GAAG,MAAM,CAAC,OAAO,EAAE,CAAC;QAClC,MAAM,QAAQ,GAAG,MAAM,CAAC,OAAO,EAAE,CAAC;QAClC,MAAM,QAAQ,GAAG,MAAM,CAAC,OAAO,EAAE,CAAC;QAClC,MAAM,QAAQ,GAAG,MAAM,CAAC,OAAO,EAAE,CAAC;QAClC,MAAM,QAAQ,GAAG,QAAQ,CAAC,gBAAgB,CAAC,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC;QACnF,MAAM,QAAQ,GAAG,QAAQ,CAAC,gBAAgB,CAAC,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC;QACnF,MAAM,QAAQ,GAAG,QAAQ,CAAC,gBAAgB,CAAC,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC;QACnF,MAAM,SAAS,GAAG,WAAW,CAAC,cAAc,CAC1C,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAC5B,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAC5B,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAC5B,CAAC,SAAS,EAAE,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;QAC/B,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;YAC5B,OAAO,KAAK,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC;QACjG,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;CACF","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n\n/** @packageDocumentation\n * @module Curve\n */\n\nimport { AxisIndex, AxisOrder, Geometry, PlaneAltitudeEvaluator } from \"../Geometry\";\nimport { Angle } from \"../geometry3d/Angle\";\nimport { AngleSweep } from \"../geometry3d/AngleSweep\";\nimport { Ellipsoid, GeodesicPathPoint } from \"../geometry3d/Ellipsoid\";\nimport { IndexedXYZCollection } from \"../geometry3d/IndexedXYZCollection\";\nimport { Matrix3d } from \"../geometry3d/Matrix3d\";\nimport { Plane3dByOriginAndUnitNormal } from \"../geometry3d/Plane3dByOriginAndUnitNormal\";\nimport { Vector2d } from \"../geometry3d/Point2dVector2d\";\nimport { Point3dArrayCarrier } from \"../geometry3d/Point3dArrayCarrier\";\nimport { Point3d, Vector3d } from \"../geometry3d/Point3dVector3d\";\nimport { PolylineOps } from \"../geometry3d/PolylineOps\";\nimport { Ray3d } from \"../geometry3d/Ray3d\";\nimport { Segment1d } from \"../geometry3d/Segment1d\";\nimport { Transform } from \"../geometry3d/Transform\";\nimport { XAndY } from \"../geometry3d/XYZProps\";\nimport { SmallSystem } from \"../numerics/SmallSystem\";\nimport { IndexedPolyface } from \"../polyface/Polyface\";\nimport { PolyfaceBuilder } from \"../polyface/PolyfaceBuilder\";\nimport { Cone } from \"../solid/Cone\";\nimport { RuledSweep } from \"../solid/RuledSweep\";\nimport { TorusPipe } from \"../solid/TorusPipe\";\nimport { Arc3d, ArcBlendData } from \"./Arc3d\";\nimport { CurveChain } from \"./CurveCollection\";\nimport { CurvePrimitive } from \"./CurvePrimitive\";\nimport { AnyCurve, AnyRegion } from \"./CurveTypes\";\nimport { GeometryQuery } from \"./GeometryQuery\";\nimport { LineSegment3d } from \"./LineSegment3d\";\nimport { LineString3d } from \"./LineString3d\";\nimport { Loop } from \"./Loop\";\nimport { Path } from \"./Path\";\nimport { RegionOps } from \"./RegionOps\";\nimport { IntegratedSpiral3d } from \"./spiral/IntegratedSpiral3d\";\nimport { IntegratedSpiralTypeName } from \"./spiral/TransitionSpiral3d\";\nimport { StrokeOptions } from \"./StrokeOptions\";\n\n// cspell:word CCWXY\n\n/**\n * Interface to carry parallel arrays of planes and sections, and optional geometry assembled from them,\n * as returned by [CurveFactory.createMiteredSweepSections].\n * @public\n */\nexport interface SectionSequenceWithPlanes {\n /** The plane of each section. */\n planes: Plane3dByOriginAndUnitNormal[];\n /** Section curve projected onto the corresponding plane. */\n sections: AnyCurve[];\n /**\n * Optional `RuledSweep` generated from the sections.\n * * The `RuledSweep` and sections array refer to the same section objects.\n */\n ruledSweep?: RuledSweep;\n /** Optional mesh generated from the `RuledSweep` generated from the sections. */\n mesh?: IndexedPolyface;\n}\n\n/**\n * Enumeration of geometric output for [CurveFactory.createMiteredSweepSections].\n * @public\n */\nexport enum MiteredSweepOutputSelect {\n /** Output only the parallel arrays of planes and sections. */\n Sections = 0,\n /** Output planes and sections, as well as the assembled ruled sweep. */\n AlsoRuledSweep = 1,\n /** Output planes and sections, as well as the assembled ruled sweep and its stroked mesh. */\n AlsoMesh = 2,\n}\n\n/**\n * Interface bundling options for [CurveFactory.createMiteredSweepSections].\n * @public\n */\nexport interface MiteredSweepOptions {\n /** Whether first and last planes are averaged and equated when the centerline is physically closed. Default value is `false`. */\n wrapIfPhysicallyClosed?: boolean;\n /** Whether to output sections only, or sections plus optional geometry constructed from them. Default value is `MiteredSweepOutputSelect.Sections`. */\n outputSelect?: MiteredSweepOutputSelect;\n /** How to stroke smooth input curves. If undefined, default stroke options are used. */\n strokeOptions?: StrokeOptions;\n /** Whether to cap the ruled sweep if outputting a ruled sweep or mesh. Default value is `false`. */\n capped?: boolean;\n /** The first section's normal is aligned to this vector, typically the start tangent of the smooth curve stroked for the centerline. */\n startTangent?: Vector3d;\n /** The last section's normal is aligned to this vector, typically the end tangent of the smooth curve stroked for the centerline. */\n endTangent?: Vector3d;\n}\n\n/**\n * Curve strokes plus start/end tangents.\n * @internal\n*/\ninterface SmoothCurveData {\n /** Samples along a curve. */\n strokes: IndexedXYZCollection;\n /** Start tangent (unnormalized). May be undefined if the curve is linear. */\n startTangent?: Vector3d;\n /** End tangent (unnormalized). May be undefined if the curve is linear. */\n endTangent?: Vector3d;\n};\n\n/**\n * The `CurveFactory` class contains methods for specialized curve constructions.\n * @public\n */\nexport class CurveFactory {\n /** (Cautiously) construct and save a line segment between fractional positions. */\n private static addPartialSegment(\n path: Path, allowBackup: boolean,\n pointA: Point3d | undefined, pointB: Point3d | undefined,\n fraction0: number, fraction1: number,\n ) {\n if (allowBackup || (fraction1 > fraction0)) {\n if (pointA !== undefined && pointB !== undefined && !Geometry.isAlmostEqualNumber(fraction0, fraction1))\n path.tryAddChild(LineSegment3d.create(pointA.interpolate(fraction0, pointB), pointA.interpolate(fraction1, pointB)));\n }\n }\n /**\n * Create a circular arc defined by start point, tangent at start point, and end point.\n * * The circular arc is swept from start to end toward direction of the `tangentAtStart`.\n * * If tangent is parallel to line segment from start to end, return `undefined`.\n */\n public static createArcPointTangentPoint(start: Point3d, tangentAtStart: Vector3d, end: Point3d): Arc3d | undefined {\n const ret = Arc3d.createCircularStartTangentEnd(start, tangentAtStart, end);\n if (ret instanceof Arc3d)\n return ret;\n else\n return undefined;\n }\n /**\n * Construct a sequence of alternating lines and arcs with the arcs creating tangent transition between consecutive edges.\n * * If the radius parameter is a number, that radius is used throughout.\n * * If the radius parameter is an array of numbers, `radius[i]` is applied at `point[i]`.\n * * Note that since no fillet is constructed at the initial or final point, those entries in `radius[]` are never referenced.\n * * A zero radius for any point indicates to leave the as a simple corner.\n * @param points point source\n * @param radius fillet radius or array of radii indexed to correspond to the points.\n * @param allowBackupAlongEdge true to allow edges to be created going \"backwards\" along edges if needed to create the blend.\n */\n public static createFilletsInLineString(\n points: LineString3d | IndexedXYZCollection | Point3d[],\n radius: number | number[],\n allowBackupAlongEdge: boolean = true,\n ): Path | undefined {\n if (Array.isArray(points))\n return this.createFilletsInLineString(new Point3dArrayCarrier(points), radius, allowBackupAlongEdge);\n if (points instanceof LineString3d)\n return this.createFilletsInLineString(points.packedPoints, radius, allowBackupAlongEdge);\n const n = points.length;\n if (n <= 1)\n return undefined;\n const pointA = points.getPoint3dAtCheckedPointIndex(0)!;\n const pointB = points.getPoint3dAtCheckedPointIndex(1)!;\n // remark: n=2 and n=3 cases should fall out from loop logic\n const blendArray: ArcBlendData[] = [];\n // build one-sided blends at each end . .\n blendArray.push({ fraction10: 0.0, fraction12: 0.0, point: pointA.clone() });\n for (let i = 1; i + 1 < n; i++) {\n const pointC = points.getPoint3dAtCheckedPointIndex(i + 1)!;\n let thisRadius = 0;\n if (Array.isArray(radius)) {\n if (i < radius.length)\n thisRadius = radius[i];\n } else if (Number.isFinite(radius))\n thisRadius = radius;\n if (thisRadius !== 0.0)\n blendArray.push(Arc3d.createFilletArc(pointA, pointB, pointC, thisRadius));\n else\n blendArray.push({ fraction10: 0.0, fraction12: 0.0, point: pointB.clone() });\n pointA.setFromPoint3d(pointB);\n pointB.setFromPoint3d(pointC);\n }\n blendArray.push({ fraction10: 0.0, fraction12: 0.0, point: pointB.clone() });\n if (!allowBackupAlongEdge) {\n // suppress arcs that have overlap with both neighbors or flood either neighbor ..\n for (let i = 1; i + 1 < n; i++) {\n const b = blendArray[i];\n if (b.fraction10 > 1.0\n || b.fraction12 > 1.0\n || 1.0 - b.fraction10 < blendArray[i - 1].fraction12\n || b.fraction12 > 1.0 - blendArray[i + 1].fraction10) {\n b.fraction10 = 0.0;\n b.fraction12 = 0.0;\n blendArray[i].arc = undefined;\n }\n }\n /* The \"1-b\" logic above prevents this loop from ever doing anything.\n // on edge with conflict, suppress the arc with larger fraction\n for (let i = 1; i < n; i++) {\n const b0 = blendArray[i - 1];\n const b1 = blendArray[i];\n if (b0.fraction12 > 1 - b1.fraction10) {\n const b = b0.fraction12 > b1.fraction12 ? b1 : b0;\n b.fraction10 = 0.0;\n b.fraction12 = 0.0;\n blendArray[i].arc = undefined;\n }\n } */\n }\n const path = Path.create();\n this.addPartialSegment(\n path, allowBackupAlongEdge,\n blendArray[0].point, blendArray[1].point,\n blendArray[0].fraction12, 1.0 - blendArray[1].fraction10,\n );\n // add each path and successor edge ...\n for (let i = 1; i + 1 < points.length; i++) {\n const b0 = blendArray[i];\n const b1 = blendArray[i + 1];\n path.tryAddChild(b0.arc);\n this.addPartialSegment(path, allowBackupAlongEdge, b0.point, b1.point, b0.fraction12, 1.0 - b1.fraction10);\n }\n return path;\n }\n /**\n * Create a `Loop` with given xy corners and fixed z.\n * * The corners always proceed counter clockwise from lower left.\n * * If the radius is too large for the outer rectangle size, it is reduced to half of the the smaller x or y size.\n */\n public static createRectangleXY(\n x0: number, y0: number, x1: number, y1: number, z: number = 0, filletRadius?: number,\n ): Loop {\n let radius = Geometry.correctSmallMetricDistance(filletRadius);\n const xMin = Math.min(x0, x1);\n const xMax = Math.max(x0, x1);\n const yMin = Math.min(y0, y1);\n const yMax = Math.max(y0, y1);\n radius = Math.min(Math.abs(radius), 0.5 * (xMax - xMin), 0.5 * (yMax - yMin));\n if (radius === 0.0)\n return Loop.createPolygon([\n Point3d.create(xMin, yMin, z),\n Point3d.create(xMax, yMin, z),\n Point3d.create(xMax, yMax, z),\n Point3d.create(xMin, yMax, z),\n Point3d.create(xMin, yMin, z),\n ]);\n else {\n const vectorU = Vector3d.create(radius, 0, 0);\n const vectorV = Vector3d.create(0, radius, 0);\n const x0A = xMin + radius;\n const y0A = yMin + radius;\n const x1A = xMax - radius;\n const y1A = yMax - radius;\n const centers = [\n Point3d.create(x1A, y1A, z),\n Point3d.create(x0A, y1A, z),\n Point3d.create(x0A, y0A, z),\n Point3d.create(x1A, y0A, z),\n ];\n const loop = Loop.create();\n for (let i = 0; i < 4; i++) {\n const center = centers[i];\n const nextCenter = centers[(i + 1) % 4];\n const edgeVector = Vector3d.createStartEnd(center, nextCenter);\n const arc = Arc3d.create(center, vectorU, vectorV, AngleSweep.createStartEndDegrees(0, 90));\n loop.tryAddChild(arc);\n const arcEnd = arc.endPoint();\n if (!edgeVector.isAlmostZero)\n loop.tryAddChild(LineSegment3d.create(arcEnd, arcEnd.plus(edgeVector)));\n vectorU.rotate90CCWXY(vectorU);\n vectorV.rotate90CCWXY(vectorV);\n }\n return loop;\n }\n }\n /**\n * If `arcB` is a continuation of `arcA`, extend `arcA` (in place) to include the range of `arcB`\n * * This only succeeds if the two arcs are part of identical complete arcs and end of `arcA` matches the beginning of `arcB`.\n * @param arcA first arc, modified in place.\n * @param arcB second arc, unmodified.\n * @param allowReversed whether to consolidate even when second arc is reversed.\n * @returns whether `arcA` was modified.\n */\n public static appendToArcInPlace(arcA: Arc3d, arcB: Arc3d, allowReverse: boolean = false): boolean {\n if (arcA.center.isAlmostEqual(arcB.center)) {\n const sweepSign = Geometry.split3WaySign(arcA.sweep.sweepRadians * arcB.sweep.sweepRadians, -1, 0, 1);\n // evaluate derivatives wrt radians (not fraction!), but adjust direction for sweep signs\n const endA = arcA.angleToPointAndDerivative(arcA.sweep.fractionToAngle(1.0));\n if (arcA.sweep.sweepRadians < 0)\n endA.direction.scaleInPlace(-1.0);\n const startB = arcB.angleToPointAndDerivative(arcB.sweep.fractionToAngle(0.0));\n if (arcB.sweep.sweepRadians < 0)\n startB.direction.scaleInPlace(-1.0);\n if (endA.isAlmostEqual(startB)) {\n arcA.sweep.setStartEndRadians(\n arcA.sweep.startRadians, arcA.sweep.startRadians + arcA.sweep.sweepRadians + sweepSign * arcB.sweep.sweepRadians,\n );\n return true;\n }\n // Also ok if negated tangent\n if (allowReverse) {\n startB.direction.scaleInPlace(-1.0);\n if (endA.isAlmostEqual(startB)) {\n arcA.sweep.setStartEndRadians(\n arcA.sweep.startRadians, arcA.sweep.startRadians + arcA.sweep.sweepRadians - sweepSign * arcB.sweep.sweepRadians,\n );\n return true;\n }\n }\n }\n return false;\n }\n /**\n * Return a `Path` containing arcs are on the surface of an ellipsoid and pass through a sequence of points.\n * * Each arc passes through the two given endpoints and in the plane containing the true surface normal at\n * given `fractionForIntermediateNormal`\n * @param ellipsoid\n * @param pathPoints\n * @param fractionForIntermediateNormal fractional position for surface normal used to create the section plane.\n */\n public static assembleArcChainOnEllipsoid(\n ellipsoid: Ellipsoid, pathPoints: GeodesicPathPoint[], fractionForIntermediateNormal: number = 0.5,\n ): Path {\n const arcPath = Path.create();\n for (let i = 0; i + 1 < pathPoints.length; i++) {\n const arc = ellipsoid.sectionArcWithIntermediateNormal(\n pathPoints[i].toAngles(),\n fractionForIntermediateNormal,\n pathPoints[i + 1].toAngles());\n arcPath.tryAddChild(arc);\n }\n return arcPath;\n }\n private static appendGeometryQueryArray(candidate: GeometryQuery | GeometryQuery[] | undefined, result: GeometryQuery[]) {\n if (candidate instanceof GeometryQuery)\n result.push(candidate);\n else if (Array.isArray(candidate)) {\n for (const p of candidate)\n this.appendGeometryQueryArray(p, result);\n }\n }\n /**\n * Create solid primitives for pipe segments (e.g. Cone or TorusPipe) around line and arc primitives.\n * @param centerline centerline geometry.\n * @param pipeRadius radius of pipe.\n */\n public static createPipeSegments(\n centerline: CurvePrimitive | CurveChain, pipeRadius: number,\n ): GeometryQuery | GeometryQuery[] | undefined {\n if (centerline instanceof LineSegment3d) {\n return Cone.createAxisPoints(centerline.startPoint(), centerline.endPoint(), pipeRadius, pipeRadius, false);\n } else if (centerline instanceof Arc3d) {\n return TorusPipe.createAlongArc(centerline, pipeRadius, false);\n } else if (centerline instanceof CurvePrimitive) {\n const builder = PolyfaceBuilder.create();\n builder.addMiteredPipes(centerline, pipeRadius);\n return builder.claimPolyface();\n } else if (centerline instanceof CurveChain) {\n const result: GeometryQuery[] = [];\n for (const p of centerline.children) {\n const pipe = this.createPipeSegments(p, pipeRadius);\n this.appendGeometryQueryArray(pipe, result);\n }\n return result;\n }\n return undefined;\n }\n /** Get start point and tangent for variant curve data. */\n private static startPointAndTangent(curve: IndexedXYZCollection | Point3d[] | CurvePrimitive): Ray3d | undefined {\n if (curve instanceof CurvePrimitive)\n return curve.fractionToPointAndDerivative(0.0);\n if (curve.length < 2)\n return undefined;\n if (Array.isArray(curve))\n curve = new Point3dArrayCarrier(curve);\n const ray = Ray3d.createZero();\n curve.getPoint3dAtUncheckedPointIndex(0, ray.origin);\n curve.vectorIndexIndex(0, 1, ray.direction);\n return ray;\n };\n /** Create an [[Arc3d]] from `sectionData` that has its center at the start point of the centerline. */\n public static createArcFromSectionData(\n centerline: IndexedXYZCollection | Point3d[] | CurvePrimitive, sectionData: number | XAndY | Arc3d,\n ): Arc3d | undefined {\n const ray = CurveFactory.startPointAndTangent(centerline);\n if (!ray)\n return undefined;\n let arc: Arc3d;\n if (sectionData instanceof Arc3d) {\n arc = sectionData.clone();\n arc.center = ray.origin;\n } else {\n const vector0 = Vector3d.create();\n const vector90 = Vector3d.create();\n const length0 = (typeof sectionData === \"number\") ? sectionData : sectionData.x;\n const length90 = (typeof sectionData === \"number\") ? sectionData : sectionData.y;\n const baseFrame = Matrix3d.createRigidHeadsUp(ray.direction, AxisOrder.ZXY);\n baseFrame.columnX(vector0).scaleInPlace(length0);\n baseFrame.columnY(vector90).scaleInPlace(length90);\n arc = Arc3d.create(ray.origin, vector0, vector90);\n }\n if (arc.binormalVector().dotProduct(ray.direction) < 0.0)\n arc.reverseInPlace();\n return arc;\n }\n /**\n * Create section arcs for mitered pipe.\n * * At the end of each pipe segment, the pipe is mitered by the plane that bisects the angle between successive\n * centerline segments.\n * * The section arcs are constructed so that lines between corresponding fractional positions on the arcs are\n * axial lines on the pipes.\n * * This means that the initial arc's vector0 and vector90 lengths and angular separation are _not_ preserved in\n * the section arcs.\n * * Circular or elliptical pipe cross sections can be specified by supplying either a radius, a pair of semi-axis\n * lengths, or an Arc3d:\n * * For semi-axis length input, x and y correspond to ellipse local axes perpendicular to each other and to the\n * start tangent.\n * * For Arc3d input, the center is translated to the centerline start point. For best results, ensure this arc\n * is perpendicular to the centerline start tangent.\n * * This function internally calls [[createMiteredSweepSections]] with default options.\n * @param centerline centerline of pipe. For best results, ensure no successive duplicate points with e.g.,\n * [[GrowableXYZArray.createCompressed]].\n * @param sectionData circle radius, ellipse semi-axis lengths, or full Arc3d (if not full, function makes it full).\n * @returns array of sections or empty array if section creation failed.\n */\n public static createMiteredPipeSections(centerline: IndexedXYZCollection, sectionData: number | XAndY | Arc3d): Arc3d[] {\n const arc = CurveFactory.createArcFromSectionData(centerline, sectionData);\n if (!arc)\n return [];\n const miteredSweeps = CurveFactory.createMiteredSweepSections(centerline, arc);\n if (miteredSweeps)\n return miteredSweeps.sections as Arc3d[];\n return [];\n }\n\n /** For a smooth curve, stroke and return unnormalized start/end tangents. */\n private static strokeSmoothCurve(\n curve: IndexedXYZCollection | Point3d[] | CurvePrimitive | CurveChain,\n options?: StrokeOptions,\n ): SmoothCurveData | undefined {\n let startTangent, endTangent: Vector3d | undefined;\n if (curve instanceof CurvePrimitive) {\n startTangent = curve.fractionToPointAndDerivative(0.0).direction;\n endTangent = curve.fractionToPointAndDerivative(1.0).direction;\n const strokes = LineString3d.create();\n curve.emitStrokes(strokes, options);\n curve = strokes.packedPoints;\n } else if (curve instanceof CurveChain) {\n startTangent = curve.startPointAndDerivative()?.direction;\n endTangent = curve.endPointAndDerivative()?.direction;\n const strokes = curve.getPackedStrokes(options);\n if (!strokes)\n return undefined;\n curve = strokes;\n } else if (Array.isArray(curve))\n curve = new Point3dArrayCarrier(curve);\n return { strokes: curve, startTangent, endTangent };\n }\n\n /**\n * Align two bisector plane normals to given smooth rail tangents or optional overrides.\n * * Optionally average the normals for physically closed rail.\n */\n private static alignFirstAndLastBisectorPlanes(\n firstPlane: Plane3dByOriginAndUnitNormal,\n lastPlane: Plane3dByOriginAndUnitNormal,\n smoothRailData?: SmoothCurveData,\n options?: MiteredSweepOptions,\n ) {\n const normal0 = options?.startTangent ?? (smoothRailData?.startTangent ?? firstPlane.getNormalRef());\n const normal1 = options?.endTangent ?? (smoothRailData?.endTangent ?? lastPlane.getNormalRef());\n if (options?.wrapIfPhysicallyClosed && firstPlane.getOriginRef().isAlmostEqual(lastPlane.getOriginRef())) {\n const avgNormal = normal0.plus(normal1);\n if (avgNormal.tryNormalizeInPlace()) { // ignore cusp at seam\n firstPlane.getNormalRef().setFrom(avgNormal);\n lastPlane.getNormalRef().setFrom(avgNormal);\n return;\n }\n }\n if (normal0.tryNormalizeInPlace())\n firstPlane.getNormalRef().setFrom(normal0);\n if (normal1.tryNormalizeInPlace())\n lastPlane.getNormalRef().setFrom(normal1);\n }\n\n /** Reverse a closed curve or region if necessary so that its orientation is CCW with respect to the plane normal. */\n private static alignClosedCurveToPlane(curve: AnyCurve, planeNormal: Vector3d) {\n let closedCurve: AnyRegion | undefined;\n if (curve instanceof CurvePrimitive) {\n if (curve.startPoint().isAlmostEqual(curve.endPoint()))\n closedCurve = Loop.create(curve);\n } else if (curve.isAnyRegion())\n closedCurve = curve;\n if (closedCurve) {\n // The alignment condition is equivalent to positive projected curve area computed wrt to the plane normal.\n const toLocal = Matrix3d.createRigidHeadsUp(planeNormal).transpose();\n const projection = closedCurve.cloneTransformed(Transform.createOriginAndMatrix(undefined, toLocal));\n if (projection) { // now we can ignore z-coords\n const areaXY = RegionOps.computeXYArea(projection as AnyRegion);\n if (areaXY && areaXY < 0)\n curve.reverseInPlace();\n }\n }\n }\n\n /**\n * Projection to target plane, constructing sweep direction from two given planes.\n * * If successful, push the target plane and swept section to the output arrays and return the swept section.\n * * If unsuccessful, leave the output arrays alone and return the input section.\n */\n private static doSweepToPlane(\n output: SectionSequenceWithPlanes,\n edgePlane0: Plane3dByOriginAndUnitNormal,\n edgePlane1: Plane3dByOriginAndUnitNormal,\n targetPlane: Plane3dByOriginAndUnitNormal,\n section: AnyCurve,\n ): AnyCurve {\n const sweepVector = Vector3d.createStartEnd(edgePlane0.getOriginRef(), edgePlane1.getOriginRef());\n const transform = Transform.createFlattenAlongVectorToPlane(\n sweepVector, targetPlane.getOriginRef(), targetPlane.getNormalRef(),\n );\n if (transform === undefined)\n return section;\n const transformedSection = section.cloneTransformed(transform);\n if (transformedSection === undefined)\n return section;\n output.planes.push(targetPlane);\n output.sections.push(transformedSection);\n return transformedSection;\n }\n\n /**\n * Sweep the `initialSection` along each segment of the (stroked) `centerline` until it hits the bisector plane at\n * the next vertex.\n * * For best results, the caller should place `initialSection` in a plane perpendicular to the `centerline`\n * start tangent.\n * * This plane is commonly (but not necessarily) through the centerline start point itself.\n * * To compute the sections, `initialSection` is projected in the direction of the centerline start tangent onto\n * the first bisector plane at the centerline start. The result of this projection will be likewise projected onto\n * the second plane, and so on in sequence.\n * * By default, the first/last bisector plane normals are set to the centerline start/end tangents. The caller can\n * override these with tangents supplied in `options`. If the centerline is physically closed and\n * `options.wrapIfPhysicallyClosed` is true, the first and last plane normals are averaged and equated.\n * * The centerline path does NOT have to be planar, however non-planarity will result in twisting of the sections\n * in the bisector planes.\n * @param centerline sweep path. Will be stroked if smooth.\n * @param initialSection profile curve to be swept. As noted above, this should be on a plane perpendicular to the\n * centerline start tangent.\n * @param options options for computation and output.\n * @return array of sections, formed from projecting `initialSection` successively onto the bisector planes.\n */\n public static createMiteredSweepSections(\n centerline: IndexedXYZCollection | Point3d[] | CurvePrimitive | CurveChain,\n initialSection: AnyCurve,\n options?: MiteredSweepOptions,\n ): SectionSequenceWithPlanes | undefined {\n if (!options)\n options = {};\n const rail = this.strokeSmoothCurve(centerline, options.strokeOptions);\n if (!rail)\n return undefined;\n const planes = PolylineOps.createBisectorPlanesForDistinctPoints(rail.strokes);\n if (!planes || planes.length < 2)\n return undefined;\n this.alignFirstAndLastBisectorPlanes(planes[0], planes[planes.length - 1], rail, options);\n\n // RuledSweep facet construction assumes the contours are oriented CCW with respect to the sweep direction so that\n // facet normals point outward. We only have to align the first contour; the rest will inherit its orientation.\n this.alignClosedCurveToPlane(initialSection, planes[0].getNormalRef());\n\n const sectionData: SectionSequenceWithPlanes = { sections: [], planes: [] };\n let currentSection = this.doSweepToPlane(sectionData, planes[0], planes[1], planes[0], initialSection);\n for (let i = 1; i < planes.length; i++)\n currentSection = this.doSweepToPlane(sectionData, planes[i - 1], planes[i], planes[i], currentSection);\n\n if (options.outputSelect) {\n const ruledSweep = RuledSweep.create(sectionData.sections, options.capped ?? false);\n if (ruledSweep) {\n sectionData.ruledSweep = ruledSweep;\n if (MiteredSweepOutputSelect.AlsoMesh === options.outputSelect) {\n const builder = PolyfaceBuilder.create(options.strokeOptions);\n builder.addRuledSweep(ruledSweep);\n sectionData.mesh = builder.claimPolyface();\n }\n }\n }\n return sectionData;\n }\n /**\n * Create a circular arc from start point, tangent at start, radius, optional plane normal, arc sweep.\n * * The vector from start point to center is in the direction of upVector crossed with tangentA.\n * @param start start point.\n * @param tangentAtStart vector in tangent direction at the start.\n * @param radius signed radius.\n * @param upVector optional out-of-plane vector. Defaults to positive Z.\n * @param sweep angular range. If single `Angle` is given, start angle is at 0 degrees (the start point).\n */\n public static createArcPointTangentRadius(\n start: Point3d, tangentAtStart: Vector3d, radius: number, upVector?: Vector3d, sweep?: Angle | AngleSweep,\n ): Arc3d | undefined {\n return Arc3d.createCircularStartTangentRadius(start, tangentAtStart, radius, upVector, sweep);\n }\n /**\n * Compute 2 spirals (all in XY) for a symmetric line-to-line transition.\n * * First spiral begins at given start point.\n * * first tangent aims at shoulder.\n * * outbound spiral joins line from shoulder to target.\n * @param spiralType name of spiral type. THIS MUST BE AN \"Integrated\" SPIRAL TYPE.\n * @param startPoint inbound start point.\n * @param shoulder point target point for (both) spiral-to-line tangencies.\n * @return array with the computed spirals, or undefined if failure.\n */\n public static createLineSpiralSpiralLine(\n spiralType: IntegratedSpiralTypeName,\n startPoint: Point3d,\n shoulderPoint: Point3d,\n targetPoint: Point3d,\n ): GeometryQuery[] | undefined {\n const vectorAB = Vector3d.createStartEnd(startPoint, shoulderPoint);\n const vectorBC0 = Vector3d.createStartEnd(shoulderPoint, targetPoint);\n const referenceLength = vectorAB.magnitude();\n const radiansAB = Math.atan2(vectorAB.y, vectorAB.x);\n const lineTurnRadians = vectorAB.angleToXY(vectorBC0);\n const spiralTurnRadians = 0.5 * lineTurnRadians.radians;\n const radiansBC = radiansAB + lineTurnRadians.radians;\n const axesA = Matrix3d.createRotationAroundAxisIndex(AxisIndex.Z, Angle.createRadians(radiansAB));\n const frameA = Transform.createRefs(startPoint.clone(), axesA);\n // We know how much it has to turn, and but not the length or end radius.\n // make a spiral of referenceLength and scale it back to the junction line\n const spiralARefLength = IntegratedSpiral3d.createFrom4OutOf5(spiralType, 0.0, undefined,\n Angle.createRadians(0), Angle.createRadians(spiralTurnRadians), referenceLength, undefined, frameA);\n if (spiralARefLength) {\n const midPlanePerpendicularRadians = radiansAB + spiralTurnRadians;\n const midPlanePerpendicularVector = Vector3d.createPolar(1.0, Angle.createRadians(midPlanePerpendicularRadians));\n const altitudeB = midPlanePerpendicularVector.dotProductStartEnd(startPoint, shoulderPoint);\n const altitudeSpiralEnd = midPlanePerpendicularVector.dotProductStartEnd(startPoint, spiralARefLength.endPoint());\n const scaleFactor = altitudeB / altitudeSpiralEnd;\n const spiralA = IntegratedSpiral3d.createFrom4OutOf5(spiralType, 0.0, undefined,\n Angle.createRadians(0), Angle.createRadians(spiralTurnRadians), referenceLength * scaleFactor, undefined, frameA)!;\n const distanceAB = vectorAB.magnitude();\n const vectorBC = Vector3d.createStartEnd(shoulderPoint, targetPoint);\n vectorBC.scaleToLength(distanceAB, vectorBC);\n const pointC = shoulderPoint.plus(vectorBC);\n const axesC = Matrix3d.createRotationAroundAxisIndex(AxisIndex.Z, Angle.createRadians(radiansBC + Math.PI));\n const frameC = Transform.createRefs(pointC, axesC);\n const spiralC = IntegratedSpiral3d.createFrom4OutOf5(spiralType,\n 0, -spiralA.radius01.x1, Angle.zero(), undefined, spiralA.curveLength(), Segment1d.create(1, 0), frameC)!;\n return [spiralA, spiralC];\n }\n return undefined;\n }\n /**\n * Compute 2 spirals (all in XY) for a symmetric line-to-line transition.\n * * Spiral length is given.\n * * tangency points float on both lines.\n * @param spiralType name of spiral type. THIS MUST BE AN \"Integrated\" SPIRAL TYPE.\n * @param pointA inbound start point.\n * @param shoulder point target point for (both) spiral-to-line tangencies.\n * @param spiralLength for each part of the spiral pair.\n * @return array with the computed spirals, or undefined if failure.\n */\n public static createLineSpiralSpiralLineWithSpiralLength(\n spiralType: IntegratedSpiralTypeName,\n pointA: Point3d,\n pointB: Point3d,\n pointC: Point3d,\n spiralLength: number,\n ): GeometryQuery[] | undefined {\n const vectorAB = Vector3d.createStartEnd(pointA, pointB);\n const vectorBC = Vector3d.createStartEnd(pointB, pointC);\n const radiansAB = Math.atan2(vectorAB.y, vectorAB.x);\n const lineTurnAngle = vectorAB.angleToXY(vectorBC);\n const spiralTurnRadians = 0.5 * lineTurnAngle.radians;\n const bisectorRadians = 0.5 * (Math.PI - lineTurnAngle.radians);\n const radiansCB = Math.atan2(-vectorBC.y, -vectorBC.x);\n const spiralAB0 = IntegratedSpiral3d.createFrom4OutOf5(\n spiralType, 0, undefined,\n Angle.zero(), Angle.createRadians(spiralTurnRadians),\n spiralLength, undefined, Transform.createIdentity(),\n );\n if (spiralAB0) {\n const localEndPoint = spiralAB0.fractionToPoint(1);\n const distanceAB = pointA.distance(pointB);\n const distanceCB = pointC.distance(pointB);\n // The spiral eventually has to end on the bisector, at localEndPoint.y height from the inbound line\n // distance from shoulder to projection of that point to point E on the inbound line is\n const distanceBE = localEndPoint.y / Math.tan(bisectorRadians);\n const xFractionAB = Geometry.conditionalDivideFraction(distanceAB - distanceBE - localEndPoint.x, distanceAB);\n const xFractionCB = Geometry.conditionalDivideFraction(distanceCB - distanceBE - localEndPoint.x, distanceCB);\n if (xFractionAB !== undefined && xFractionCB !== undefined) {\n const axesA = Matrix3d.createRotationAroundAxisIndex(AxisIndex.Z, Angle.createRadians(radiansAB));\n const frameAOrigin = pointA.interpolate(xFractionAB, pointB);\n const frameA = Transform.createRefs(frameAOrigin, axesA);\n const spiralAB = IntegratedSpiral3d.createFrom4OutOf5(\n spiralType, 0, undefined,\n Angle.zero(), Angle.createRadians(spiralTurnRadians),\n spiralLength, undefined, frameA,\n )!;\n const axesB = Matrix3d.createRotationAroundAxisIndex(AxisIndex.Z, Angle.createRadians(radiansCB));\n const frameBOrigin = pointC.interpolate(xFractionCB, pointB);\n const frameB = Transform.createRefs(frameBOrigin, axesB);\n const spiralBC = IntegratedSpiral3d.createFrom4OutOf5(\n spiralType, 0, undefined,\n Angle.zero(), Angle.createRadians(-spiralTurnRadians),\n spiralLength, undefined, frameB,\n )!;\n return [spiralAB, spiralBC];\n }\n }\n return undefined;\n }\n /**\n * Compute 2 spirals and an arc (all in XY) for a symmetric line-to-line transition.\n * Spiral lengths and arc radius are given (e.g., from design speed standards).\n * @param spiralType name of spiral type. THIS MUST BE AN \"Integrated\" SPIRAL TYPE.\n * @param pointA inbound start point.\n * @param pointB shoulder (target) point for (both) spiral-to-line tangencies.\n * @param lengthA inbound spiral length.\n * @param lengthB outbound spiral length.\n * @return array with the computed spirals, or undefined if failure.\n */\n public static createLineSpiralArcSpiralLine(\n spiralType: IntegratedSpiralTypeName,\n pointA: Point3d,\n pointB: Point3d,\n pointC: Point3d,\n lengthA: number,\n lengthB: number,\n arcRadius: number,\n ): GeometryQuery[] | undefined {\n const vectorAB = Vector3d.createStartEnd(pointA, pointB); vectorAB.z = 0;\n const vectorCB = Vector3d.createStartEnd(pointC, pointB); vectorCB.z = 0;\n const unitAB = vectorAB.normalize();\n const unitCB = vectorCB.normalize();\n if (unitAB === undefined || unitCB === undefined)\n return undefined;\n const unitPerpAB = unitAB.unitPerpendicularXY();\n const unitPerpCB = unitCB.unitPerpendicularXY();\n const thetaABC = vectorAB.angleToXY(vectorCB);\n const sideA = Geometry.split3WaySign(thetaABC.radians, 1, -1, -1);\n const sideB = - sideA;\n const radiusA = sideA * Math.abs(arcRadius);\n const radiusB = sideB * Math.abs(arcRadius);\n const spiralA = IntegratedSpiral3d.createFrom4OutOf5(spiralType,\n 0, radiusA, Angle.zero(), undefined, lengthA, undefined, Transform.createIdentity())!;\n const spiralB = IntegratedSpiral3d.createFrom4OutOf5(spiralType,\n 0, radiusB, Angle.zero(), undefined, lengthB, undefined, Transform.createIdentity())!;\n const spiralEndA = spiralA.fractionToPointAndUnitTangent(1.0);\n const spiralEndB = spiralB.fractionToPointAndUnitTangent(1.0);\n // From the end of spiral, step away to arc center (and this is in local coordinates of each spiral)\n const sA = spiralEndA.origin.x - radiusA * spiralEndA.direction.y;\n const tA = spiralEndA.origin.y + radiusA * spiralEndA.direction.x;\n const sB = spiralEndB.origin.x - radiusB * spiralEndB.direction.y;\n const tB = spiralEndB.origin.y + radiusB * spiralEndB.direction.x;\n // Those local coordinates are rotated to unitAB and unitBC ...\n const vectorA = Vector3d.createAdd2Scaled(unitAB, sA, unitPerpAB, tA);\n const vectorB = Vector3d.createAdd2Scaled(unitCB, sB, unitPerpCB, tB);\n const uv = Vector2d.create();\n if (SmallSystem.linearSystem2d(\n unitAB.x, -unitCB.x,\n unitAB.y, -unitCB.y,\n vectorB.x - vectorA.x, vectorB.y - vectorA.y, uv)) {\n const tangencyAB = pointB.plusScaled(unitAB, uv.x);\n const tangencyCB = pointB.plusScaled(unitCB, uv.y);\n const frameA = Transform.createOriginAndMatrixColumns(tangencyAB, unitAB, unitPerpAB, Vector3d.unitZ());\n const frameB = Transform.createOriginAndMatrixColumns(tangencyCB, unitCB, unitPerpCB, Vector3d.unitZ());\n spiralA.tryTransformInPlace(frameA);\n spiralB.tryTransformInPlace(frameB);\n const rayA1 = spiralA.fractionToPointAndUnitTangent(1.0);\n const rayB0 = spiralB.fractionToPointAndUnitTangent(1.0);\n rayB0.direction.scaleInPlace(-1.0);\n const sweep = rayA1.direction.angleToXY(rayB0.direction);\n if (radiusA < 0)\n sweep.setRadians(- sweep.radians);\n const arc = CurveFactory.createArcPointTangentRadius(rayA1.origin, rayA1.direction, radiusA, undefined, sweep)!;\n return [spiralA, arc, spiralB];\n }\n return undefined;\n }\n /** Return the intersection point of 3 planes. */\n public static planePlaneIntersectionRay(\n planeA: PlaneAltitudeEvaluator, planeB: PlaneAltitudeEvaluator): Ray3d | undefined {\n const altitudeA = planeA.altitudeXYZ(0, 0, 0);\n const altitudeB = planeB.altitudeXYZ(0, 0, 0);\n const normalAx = planeA.normalX();\n const normalAy = planeA.normalY();\n const normalAz = planeA.normalZ();\n const normalBx = planeB.normalX();\n const normalBy = planeB.normalY();\n const normalBz = planeB.normalZ();\n const normalCx = Geometry.crossProductXYXY(normalAy, normalAz, normalBy, normalBz);\n const normalCy = Geometry.crossProductXYXY(normalAz, normalAx, normalBz, normalBx);\n const normalCz = Geometry.crossProductXYXY(normalAx, normalAy, normalBx, normalBy);\n const rayOrigin = SmallSystem.linearSystem3d(\n normalAx, normalAy, normalAz,\n normalBx, normalBy, normalBz,\n normalCx, normalCy, normalCz,\n -altitudeA, -altitudeB, 0.0);\n if (rayOrigin !== undefined) {\n return Ray3d.createXYZUVW(rayOrigin.x, rayOrigin.y, rayOrigin.z, normalCx, normalCy, normalCz);\n }\n return undefined;\n }\n}\n"]}
1
+ {"version":3,"file":"CurveFactory.js","sourceRoot":"","sources":["../../../src/curve/CurveFactory.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAE/F;;GAEG;AAEH,OAAO,EAAE,SAAS,EAAE,SAAS,EAAE,QAAQ,EAA0B,MAAM,aAAa,CAAC;AACrF,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAC5C,OAAO,EAAE,UAAU,EAAE,MAAM,0BAA0B,CAAC;AAGtD,OAAO,EAAE,QAAQ,EAAE,MAAM,wBAAwB,CAAC;AAElD,OAAO,EAAE,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AACzD,OAAO,EAAE,mBAAmB,EAAE,MAAM,mCAAmC,CAAC;AACxE,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAClE,OAAO,EAAE,WAAW,EAAE,MAAM,2BAA2B,CAAC;AACxD,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAC5C,OAAO,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AACpD,OAAO,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AAEpD,OAAO,EAAE,WAAW,EAAE,MAAM,yBAAyB,CAAC;AAEtD,OAAO,EAAE,eAAe,EAAE,MAAM,6BAA6B,CAAC;AAC9D,OAAO,EAAE,IAAI,EAAE,MAAM,eAAe,CAAC;AACrC,OAAO,EAAE,UAAU,EAAE,MAAM,qBAAqB,CAAC;AACjD,OAAO,EAAE,SAAS,EAAE,MAAM,oBAAoB,CAAC;AAC/C,OAAO,EAAE,KAAK,EAAgB,MAAM,SAAS,CAAC;AAC9C,OAAO,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AAC/C,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAElD,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAChD,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAChD,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAC9C,OAAO,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAC9B,OAAO,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAC9B,OAAO,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AACxC,OAAO,EAAE,kBAAkB,EAAE,MAAM,6BAA6B,CAAC;AAyBjE;;;GAGG;AACH,MAAM,CAAN,IAAY,wBAOX;AAPD,WAAY,wBAAwB;IAClC,8DAA8D;IAC9D,+EAAY,CAAA;IACZ,wEAAwE;IACxE,2FAAkB,CAAA;IAClB,6FAA6F;IAC7F,+EAAY,CAAA;AACd,CAAC,EAPW,wBAAwB,KAAxB,wBAAwB,QAOnC;AAgCA,CAAC;AAEF;;;GAGG;AACH,MAAM,OAAO,YAAY;IACvB,mFAAmF;IAC3E,MAAM,CAAC,iBAAiB,CAC9B,IAAU,EAAE,WAAoB,EAChC,MAA2B,EAAE,MAA2B,EACxD,SAAiB,EAAE,SAAiB;QAEpC,IAAI,WAAW,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC,EAAE,CAAC;YAC3C,IAAI,MAAM,KAAK,SAAS,IAAI,MAAM,KAAK,SAAS,IAAI,CAAC,QAAQ,CAAC,mBAAmB,CAAC,SAAS,EAAE,SAAS,CAAC;gBACrG,IAAI,CAAC,WAAW,CAAC,aAAa,CAAC,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,SAAS,EAAE,MAAM,CAAC,EAAE,MAAM,CAAC,WAAW,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC;QACzH,CAAC;IACH,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,0BAA0B,CAAC,KAAc,EAAE,cAAwB,EAAE,GAAY;QAC7F,MAAM,GAAG,GAAG,KAAK,CAAC,6BAA6B,CAAC,KAAK,EAAE,cAAc,EAAE,GAAG,CAAC,CAAC;QAC5E,IAAI,GAAG,YAAY,KAAK;YACtB,OAAO,GAAG,CAAC;;YAEX,OAAO,SAAS,CAAC;IACrB,CAAC;IACD;;;;;;;;;OASG;IACI,MAAM,CAAC,yBAAyB,CACrC,MAAuD,EACvD,MAAyB,EACzB,uBAAgC,IAAI;QAEpC,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC;YACvB,OAAO,IAAI,CAAC,yBAAyB,CAAC,IAAI,mBAAmB,CAAC,MAAM,CAAC,EAAE,MAAM,EAAE,oBAAoB,CAAC,CAAC;QACvG,IAAI,MAAM,YAAY,YAAY;YAChC,OAAO,IAAI,CAAC,yBAAyB,CAAC,MAAM,CAAC,YAAY,EAAE,MAAM,EAAE,oBAAoB,CAAC,CAAC;QAC3F,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;QACxB,IAAI,CAAC,IAAI,CAAC;YACR,OAAO,SAAS,CAAC;QACnB,MAAM,MAAM,GAAG,MAAM,CAAC,6BAA6B,CAAC,CAAC,CAAE,CAAC;QACxD,MAAM,MAAM,GAAG,MAAM,CAAC,6BAA6B,CAAC,CAAC,CAAE,CAAC;QACxD,4DAA4D;QAC5D,MAAM,UAAU,GAAmB,EAAE,CAAC;QACtC,yCAAyC;QACzC,UAAU,CAAC,IAAI,CAAC,EAAE,UAAU,EAAE,GAAG,EAAE,UAAU,EAAE,GAAG,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;QAC7E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/B,MAAM,MAAM,GAAG,MAAM,CAAC,6BAA6B,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC;YAC5D,IAAI,UAAU,GAAG,CAAC,CAAC;YACnB,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;gBAC1B,IAAI,CAAC,GAAG,MAAM,CAAC,MAAM;oBACnB,UAAU,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YAC3B,CAAC;iBAAM,IAAI,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC;gBAChC,UAAU,GAAG,MAAM,CAAC;YACtB,IAAI,UAAU,KAAK,GAAG;gBACpB,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,eAAe,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,UAAU,CAAC,CAAC,CAAC;;gBAE3E,UAAU,CAAC,IAAI,CAAC,EAAE,UAAU,EAAE,GAAG,EAAE,UAAU,EAAE,GAAG,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;YAC/E,MAAM,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC;YAC9B,MAAM,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC;QAChC,CAAC;QACD,UAAU,CAAC,IAAI,CAAC,EAAE,UAAU,EAAE,GAAG,EAAE,UAAU,EAAE,GAAG,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;QAC7E,IAAI,CAAC,oBAAoB,EAAE,CAAC;YAC1B,kFAAkF;YAClF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC/B,MAAM,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;gBACxB,IAAI,CAAC,CAAC,UAAU,GAAG,GAAG;uBACjB,CAAC,CAAC,UAAU,GAAG,GAAG;uBAClB,GAAG,GAAG,CAAC,CAAC,UAAU,GAAG,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,UAAU;uBACjD,CAAC,CAAC,UAAU,GAAG,GAAG,GAAG,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC;oBACvD,CAAC,CAAC,UAAU,GAAG,GAAG,CAAC;oBACnB,CAAC,CAAC,UAAU,GAAG,GAAG,CAAC;oBACnB,UAAU,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,SAAS,CAAC;gBAChC,CAAC;YACH,CAAC;YACD;;;;;;;;;;;gBAWI;QACN,CAAC;QACD,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;QAC3B,IAAI,CAAC,iBAAiB,CACpB,IAAI,EAAE,oBAAoB,EAC1B,UAAU,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,KAAK,EACxC,UAAU,CAAC,CAAC,CAAC,CAAC,UAAU,EAAE,GAAG,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,UAAU,CACzD,CAAC;QACF,uCAAuC;QACvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,MAAM,EAAE,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;YACzB,MAAM,EAAE,GAAG,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC7B,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;YACzB,IAAI,CAAC,iBAAiB,CAAC,IAAI,EAAE,oBAAoB,EAAE,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,UAAU,EAAE,GAAG,GAAG,EAAE,CAAC,UAAU,CAAC,CAAC;QAC7G,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,iBAAiB,CAC7B,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,IAAY,CAAC,EAAE,YAAqB;QAEpF,IAAI,MAAM,GAAG,QAAQ,CAAC,0BAA0B,CAAC,YAAY,CAAC,CAAC;QAC/D,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAC9B,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAC9B,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAC9B,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAC9B,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,GAAG,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,EAAE,GAAG,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC;QAC9E,IAAI,MAAM,KAAK,GAAG;YAChB,OAAO,IAAI,CAAC,aAAa,CAAC;gBACxB,OAAO,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC;gBAC7B,OAAO,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC;gBAC7B,OAAO,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC;gBAC7B,OAAO,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC;gBAC7B,OAAO,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC;aAC9B,CAAC,CAAC;aACA,CAAC;YACJ,MAAM,OAAO,GAAG,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAC9C,MAAM,OAAO,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC;YAC9C,MAAM,GAAG,GAAG,IAAI,GAAG,MAAM,CAAC;YAC1B,MAAM,GAAG,GAAG,IAAI,GAAG,MAAM,CAAC;YAC1B,MAAM,GAAG,GAAG,IAAI,GAAG,MAAM,CAAC;YAC1B,MAAM,GAAG,GAAG,IAAI,GAAG,MAAM,CAAC;YAC1B,MAAM,OAAO,GAAG;gBACd,OAAO,CAAC,MAAM,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;gBAC3B,OAAO,CAAC,MAAM,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;gBAC3B,OAAO,CAAC,MAAM,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;gBAC3B,OAAO,CAAC,MAAM,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;aAC5B,CAAC;YACF,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;YAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,MAAM,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;gBAC1B,MAAM,UAAU,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBACxC,MAAM,UAAU,GAAG,QAAQ,CAAC,cAAc,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;gBAC/D,MAAM,GAAG,GAAG,KAAK,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,UAAU,CAAC,qBAAqB,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;gBAC5F,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;gBACtB,MAAM,MAAM,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAC;gBAC9B,IAAI,CAAC,UAAU,CAAC,YAAY;oBAC1B,IAAI,CAAC,WAAW,CAAC,aAAa,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;gBAC1E,OAAO,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;gBAC/B,OAAO,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;YACjC,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;IACD;;;;;;;OAOG;IACI,MAAM,CAAC,kBAAkB,CAAC,IAAW,EAAE,IAAW,EAAE,eAAwB,KAAK;QACtF,IAAI,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;YAC3C,MAAM,SAAS,GAAG,QAAQ,CAAC,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACtG,yFAAyF;YACzF,MAAM,IAAI,GAAG,IAAI,CAAC,yBAAyB,CAAC,IAAI,CAAC,KAAK,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC;YAC7E,IAAI,IAAI,CAAC,KAAK,CAAC,YAAY,GAAG,CAAC;gBAC7B,IAAI,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC;YACpC,MAAM,MAAM,GAAG,IAAI,CAAC,yBAAyB,CAAC,IAAI,CAAC,KAAK,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC;YAC/E,IAAI,IAAI,CAAC,KAAK,CAAC,YAAY,GAAG,CAAC;gBAC7B,MAAM,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC;YACtC,IAAI,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,EAAE,CAAC;gBAC/B,IAAI,CAAC,KAAK,CAAC,kBAAkB,CAC3B,IAAI,CAAC,KAAK,CAAC,YAAY,EAAE,IAAI,CAAC,KAAK,CAAC,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,YAAY,GAAG,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,YAAY,CACjH,CAAC;gBACF,OAAO,IAAI,CAAC;YACd,CAAC;YACD,6BAA6B;YAC7B,IAAI,YAAY,EAAE,CAAC;gBACjB,MAAM,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC;gBACpC,IAAI,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,EAAE,CAAC;oBAC/B,IAAI,CAAC,KAAK,CAAC,kBAAkB,CAC3B,IAAI,CAAC,KAAK,CAAC,YAAY,EAAE,IAAI,CAAC,KAAK,CAAC,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,YAAY,GAAG,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,YAAY,CACjH,CAAC;oBACF,OAAO,IAAI,CAAC;gBACd,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;;;OAOG;IACI,MAAM,CAAC,2BAA2B,CACvC,SAAoB,EAAE,UAA+B,EAAE,gCAAwC,GAAG;QAElG,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;QAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/C,MAAM,GAAG,GAAG,SAAS,CAAC,gCAAgC,CACpD,UAAU,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,EACxB,6BAA6B,EAC7B,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC;YAChC,OAAO,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;QAC3B,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IACO,MAAM,CAAC,wBAAwB,CAAC,SAAsD,EAAE,MAAuB;QACrH,IAAI,SAAS,YAAY,aAAa;YACpC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;aACpB,IAAI,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE,CAAC;YAClC,KAAK,MAAM,CAAC,IAAI,SAAS;gBACvB,IAAI,CAAC,wBAAwB,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;QAC7C,CAAC;IACH,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,kBAAkB,CAC9B,UAAuC,EAAE,UAAkB;QAE3D,IAAI,UAAU,YAAY,aAAa,EAAE,CAAC;YACxC,OAAO,IAAI,CAAC,gBAAgB,CAAC,UAAU,CAAC,UAAU,EAAE,EAAE,UAAU,CAAC,QAAQ,EAAE,EAAE,UAAU,EAAE,UAAU,EAAE,KAAK,CAAC,CAAC;QAC9G,CAAC;aAAM,IAAI,UAAU,YAAY,KAAK,EAAE,CAAC;YACvC,OAAO,SAAS,CAAC,cAAc,CAAC,UAAU,EAAE,UAAU,EAAE,KAAK,CAAC,CAAC;QACjE,CAAC;aAAM,IAAI,UAAU,YAAY,cAAc,EAAE,CAAC;YAChD,MAAM,OAAO,GAAG,eAAe,CAAC,MAAM,EAAE,CAAC;YACzC,OAAO,CAAC,eAAe,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC;YAChD,OAAO,OAAO,CAAC,aAAa,EAAE,CAAC;QACjC,CAAC;aAAM,IAAI,UAAU,YAAY,UAAU,EAAE,CAAC;YAC5C,MAAM,MAAM,GAAoB,EAAE,CAAC;YACnC,KAAK,MAAM,CAAC,IAAI,UAAU,CAAC,QAAQ,EAAE,CAAC;gBACpC,MAAM,IAAI,GAAG,IAAI,CAAC,kBAAkB,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;gBACpD,IAAI,CAAC,wBAAwB,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;YAC9C,CAAC;YACD,OAAO,MAAM,CAAC;QAChB,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,0DAA0D;IAClD,MAAM,CAAC,oBAAoB,CAAC,KAAwD;QAC1F,IAAI,KAAK,YAAY,cAAc;YACjC,OAAO,KAAK,CAAC,4BAA4B,CAAC,GAAG,CAAC,CAAC;QACjD,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC;YAClB,OAAO,SAAS,CAAC;QACnB,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;YACtB,KAAK,GAAG,IAAI,mBAAmB,CAAC,KAAK,CAAC,CAAC;QACzC,MAAM,GAAG,GAAG,KAAK,CAAC,UAAU,EAAE,CAAC;QAC/B,KAAK,CAAC,+BAA+B,CAAC,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;QACrD,KAAK,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,SAAS,CAAC,CAAC;QAC5C,OAAO,GAAG,CAAC;IACb,CAAC;IAAA,CAAC;IACF,uGAAuG;IAChG,MAAM,CAAC,wBAAwB,CACpC,UAA6D,EAAE,WAAmC;QAElG,MAAM,GAAG,GAAG,YAAY,CAAC,oBAAoB,CAAC,UAAU,CAAC,CAAC;QAC1D,IAAI,CAAC,GAAG;YACN,OAAO,SAAS,CAAC;QACnB,IAAI,GAAU,CAAC;QACf,IAAI,WAAW,YAAY,KAAK,EAAE,CAAC;YACjC,GAAG,GAAG,WAAW,CAAC,KAAK,EAAE,CAAC;YAC1B,GAAG,CAAC,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC;QAC1B,CAAC;aAAM,CAAC;YACN,MAAM,OAAO,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC;YAClC,MAAM,QAAQ,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC;YACnC,MAAM,OAAO,GAAG,CAAC,OAAO,WAAW,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC;YAChF,MAAM,QAAQ,GAAG,CAAC,OAAO,WAAW,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC;YACjF,MAAM,SAAS,GAAG,QAAQ,CAAC,kBAAkB,CAAC,GAAG,CAAC,SAAS,EAAE,SAAS,CAAC,GAAG,CAAC,CAAC;YAC5E,SAAS,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC;YACjD,SAAS,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC;YACnD,GAAG,GAAG,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC;QACpD,CAAC;QACD,IAAI,GAAG,CAAC,cAAc,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,SAAS,CAAC,GAAG,GAAG;YACtD,GAAG,CAAC,cAAc,EAAE,CAAC;QACvB,OAAO,GAAG,CAAC;IACb,CAAC;IACD;;;;;;;;;;;;;;;;;;;OAmBG;IACI,MAAM,CAAC,yBAAyB,CAAC,UAAgC,EAAE,WAAmC;QAC3G,MAAM,GAAG,GAAG,YAAY,CAAC,wBAAwB,CAAC,UAAU,EAAE,WAAW,CAAC,CAAC;QAC3E,IAAI,CAAC,GAAG;YACN,OAAO,EAAE,CAAC;QACZ,MAAM,aAAa,GAAG,YAAY,CAAC,0BAA0B,CAAC,UAAU,EAAE,GAAG,CAAC,CAAC;QAC/E,IAAI,aAAa;YACf,OAAO,aAAa,CAAC,QAAmB,CAAC;QAC3C,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,6EAA6E;IACrE,MAAM,CAAC,iBAAiB,CAC9B,KAAqE,EACrE,OAAuB;QAEvB,IAAI,YAAY,EAAE,UAAgC,CAAC;QACnD,IAAI,KAAK,YAAY,cAAc,EAAE,CAAC;YACpC,YAAY,GAAG,KAAK,CAAC,4BAA4B,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC;YACjE,UAAU,GAAG,KAAK,CAAC,4BAA4B,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC;YAC/D,MAAM,OAAO,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC;YACtC,KAAK,CAAC,WAAW,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;YACpC,KAAK,GAAG,OAAO,CAAC,YAAY,CAAC;QAC/B,CAAC;aAAM,IAAI,KAAK,YAAY,UAAU,EAAE,CAAC;YACvC,YAAY,GAAG,KAAK,CAAC,uBAAuB,EAAE,EAAE,SAAS,CAAC;YAC1D,UAAU,GAAG,KAAK,CAAC,qBAAqB,EAAE,EAAE,SAAS,CAAC;YACtD,MAAM,OAAO,GAAG,KAAK,CAAC,gBAAgB,CAAC,OAAO,CAAC,CAAC;YAChD,IAAI,CAAC,OAAO;gBACV,OAAO,SAAS,CAAC;YACnB,KAAK,GAAG,OAAO,CAAC;QAClB,CAAC;aAAM,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;YAC7B,KAAK,GAAG,IAAI,mBAAmB,CAAC,KAAK,CAAC,CAAC;QACzC,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,YAAY,EAAE,UAAU,EAAE,CAAC;IACtD,CAAC;IAED;;;OAGG;IACK,MAAM,CAAC,+BAA+B,CAC5C,UAAwC,EACxC,SAAuC,EACvC,cAAgC,EAChC,OAA6B;QAE7B,MAAM,OAAO,GAAG,OAAO,EAAE,YAAY,IAAI,CAAC,cAAc,EAAE,YAAY,IAAI,UAAU,CAAC,YAAY,EAAE,CAAC,CAAC;QACrG,MAAM,OAAO,GAAG,OAAO,EAAE,UAAU,IAAI,CAAC,cAAc,EAAE,UAAU,IAAI,SAAS,CAAC,YAAY,EAAE,CAAC,CAAC;QAChG,IAAI,OAAO,EAAE,sBAAsB,IAAI,UAAU,CAAC,YAAY,EAAE,CAAC,aAAa,CAAC,SAAS,CAAC,YAAY,EAAE,CAAC,EAAE,CAAC;YACzG,MAAM,SAAS,GAAG,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACxC,IAAI,SAAS,CAAC,mBAAmB,EAAE,EAAE,CAAC,CAAC,sBAAsB;gBAC3D,UAAU,CAAC,YAAY,EAAE,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;gBAC7C,SAAS,CAAC,YAAY,EAAE,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;gBAC5C,OAAO;YACT,CAAC;QACH,CAAC;QACD,IAAI,OAAO,CAAC,mBAAmB,EAAE;YAC/B,UAAU,CAAC,YAAY,EAAE,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;QAC7C,IAAI,OAAO,CAAC,mBAAmB,EAAE;YAC/B,SAAS,CAAC,YAAY,EAAE,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;IAC9C,CAAC;IAED,qHAAqH;IAC7G,MAAM,CAAC,uBAAuB,CAAC,KAAe,EAAE,WAAqB;QAC3E,IAAI,WAAkC,CAAC;QACvC,IAAI,KAAK,YAAY,cAAc,EAAE,CAAC;YACpC,IAAI,KAAK,CAAC,UAAU,EAAE,CAAC,aAAa,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC;gBACpD,WAAW,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACrC,CAAC;aAAM,IAAI,KAAK,CAAC,WAAW,EAAE;YAC5B,WAAW,GAAG,KAAK,CAAC;QACtB,IAAI,WAAW,EAAE,CAAC;YAChB,2GAA2G;YAC3G,MAAM,OAAO,GAAG,QAAQ,CAAC,kBAAkB,CAAC,WAAW,CAAC,CAAC,SAAS,EAAE,CAAC;YACrE,MAAM,UAAU,GAAG,WAAW,CAAC,gBAAgB,CAAC,SAAS,CAAC,qBAAqB,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC,CAAC;YACrG,IAAI,UAAU,EAAE,CAAC,CAAC,6BAA6B;gBAC7C,MAAM,MAAM,GAAG,SAAS,CAAC,aAAa,CAAC,UAAuB,CAAC,CAAC;gBAChE,IAAI,MAAM,IAAI,MAAM,GAAG,CAAC;oBACtB,KAAK,CAAC,cAAc,EAAE,CAAC;YAC3B,CAAC;QACH,CAAC;IACH,CAAC;IAED;;;;OAIG;IACK,MAAM,CAAC,cAAc,CAC3B,MAAiC,EACjC,UAAwC,EACxC,UAAwC,EACxC,WAAyC,EACzC,OAAiB;QAEjB,MAAM,WAAW,GAAG,QAAQ,CAAC,cAAc,CAAC,UAAU,CAAC,YAAY,EAAE,EAAE,UAAU,CAAC,YAAY,EAAE,CAAC,CAAC;QAClG,MAAM,SAAS,GAAG,SAAS,CAAC,+BAA+B,CACzD,WAAW,EAAE,WAAW,CAAC,YAAY,EAAE,EAAE,WAAW,CAAC,YAAY,EAAE,CACpE,CAAC;QACF,IAAI,SAAS,KAAK,SAAS;YACzB,OAAO,OAAO,CAAC;QACjB,MAAM,kBAAkB,GAAG,OAAO,CAAC,gBAAgB,CAAC,SAAS,CAAC,CAAC;QAC/D,IAAI,kBAAkB,KAAK,SAAS;YAClC,OAAO,OAAO,CAAC;QACjB,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QAChC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAC;QACzC,OAAO,kBAAkB,CAAC;IAC5B,CAAC;IAED;;;;;;;;;;;;;;;;;;;OAmBG;IACI,MAAM,CAAC,0BAA0B,CACtC,UAA0E,EAC1E,cAAwB,EACxB,OAA6B;QAE7B,IAAI,CAAC,OAAO;YACV,OAAO,GAAG,EAAE,CAAC;QACf,MAAM,IAAI,GAAG,IAAI,CAAC,iBAAiB,CAAC,UAAU,EAAE,OAAO,CAAC,aAAa,CAAC,CAAC;QACvE,IAAI,CAAC,IAAI;YACP,OAAO,SAAS,CAAC;QACnB,MAAM,MAAM,GAAG,WAAW,CAAC,qCAAqC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC/E,IAAI,CAAC,MAAM,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC;YAC9B,OAAO,SAAS,CAAC;QACnB,IAAI,CAAC,+BAA+B,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;QAE1F,kHAAkH;QAClH,+GAA+G;QAC/G,IAAI,CAAC,uBAAuB,CAAC,cAAc,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,YAAY,EAAE,CAAC,CAAC;QAEvE,MAAM,WAAW,GAA8B,EAAE,QAAQ,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC;QAC5E,IAAI,cAAc,GAAG,IAAI,CAAC,cAAc,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC;QACvG,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE;YACpC,cAAc,GAAG,IAAI,CAAC,cAAc,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC;QAEzG,IAAI,OAAO,CAAC,YAAY,EAAE,CAAC;YACzB,MAAM,UAAU,GAAG,UAAU,CAAC,MAAM,CAAC,WAAW,CAAC,QAAQ,EAAE,OAAO,CAAC,MAAM,IAAI,KAAK,CAAC,CAAC;YACpF,IAAI,UAAU,EAAE,CAAC;gBACf,WAAW,CAAC,UAAU,GAAG,UAAU,CAAC;gBACpC,IAAI,wBAAwB,CAAC,QAAQ,KAAK,OAAO,CAAC,YAAY,EAAE,CAAC;oBAC/D,MAAM,OAAO,GAAG,eAAe,CAAC,MAAM,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC;oBAC9D,OAAO,CAAC,aAAa,CAAC,UAAU,CAAC,CAAC;oBAClC,WAAW,CAAC,IAAI,GAAG,OAAO,CAAC,aAAa,EAAE,CAAC;gBAC7C,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,WAAW,CAAC;IACrB,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,2BAA2B,CACvC,KAAc,EAAE,cAAwB,EAAE,MAAc,EAAE,QAAmB,EAAE,KAA0B;QAEzG,OAAO,KAAK,CAAC,gCAAgC,CAAC,KAAK,EAAE,cAAc,EAAE,MAAM,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC;IAChG,CAAC;IACD;;;;;;;;;OASG;IACI,MAAM,CAAC,0BAA0B,CACtC,UAAoC,EACpC,UAAmB,EACnB,aAAsB,EACtB,WAAoB;QAEpB,MAAM,QAAQ,GAAG,QAAQ,CAAC,cAAc,CAAC,UAAU,EAAE,aAAa,CAAC,CAAC;QACpE,MAAM,SAAS,GAAG,QAAQ,CAAC,cAAc,CAAC,aAAa,EAAE,WAAW,CAAC,CAAC;QACtE,MAAM,eAAe,GAAG,QAAQ,CAAC,SAAS,EAAE,CAAC;QAC7C,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC;QACrD,MAAM,eAAe,GAAG,QAAQ,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC;QACtD,MAAM,iBAAiB,GAAG,GAAG,GAAG,eAAe,CAAC,OAAO,CAAC;QACxD,MAAM,SAAS,GAAG,SAAS,GAAG,eAAe,CAAC,OAAO,CAAC;QACtD,MAAM,KAAK,GAAG,QAAQ,CAAC,6BAA6B,CAAC,SAAS,CAAC,CAAC,EAAE,KAAK,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC,CAAC;QAClG,MAAM,MAAM,GAAG,SAAS,CAAC,UAAU,CAAC,UAAU,CAAC,KAAK,EAAE,EAAE,KAAK,CAAC,CAAC;QAC/D,yEAAyE;QACzE,0EAA0E;QAC1E,MAAM,gBAAgB,GAAG,kBAAkB,CAAC,iBAAiB,CAAC,UAAU,EAAE,GAAG,EAAE,SAAS,EACtF,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,aAAa,CAAC,iBAAiB,CAAC,EAAE,eAAe,EAAE,SAAS,EAAE,MAAM,CAAC,CAAC;QACtG,IAAI,gBAAgB,EAAE,CAAC;YACrB,MAAM,4BAA4B,GAAG,SAAS,GAAG,iBAAiB,CAAC;YACnE,MAAM,2BAA2B,GAAG,QAAQ,CAAC,WAAW,CAAC,GAAG,EAAE,KAAK,CAAC,aAAa,CAAC,4BAA4B,CAAC,CAAC,CAAC;YACjH,MAAM,SAAS,GAAG,2BAA2B,CAAC,kBAAkB,CAAC,UAAU,EAAE,aAAa,CAAC,CAAC;YAC5F,MAAM,iBAAiB,GAAG,2BAA2B,CAAC,kBAAkB,CAAC,UAAU,EAAE,gBAAgB,CAAC,QAAQ,EAAE,CAAC,CAAC;YAClH,MAAM,WAAW,GAAG,SAAS,GAAG,iBAAiB,CAAC;YAClD,MAAM,OAAO,GAAG,kBAAkB,CAAC,iBAAiB,CAAC,UAAU,EAAE,GAAG,EAAE,SAAS,EAC7E,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,aAAa,CAAC,iBAAiB,CAAC,EAAE,eAAe,GAAG,WAAW,EAAE,SAAS,EAAE,MAAM,CAAE,CAAC;YACrH,MAAM,UAAU,GAAG,QAAQ,CAAC,SAAS,EAAE,CAAC;YACxC,MAAM,QAAQ,GAAG,QAAQ,CAAC,cAAc,CAAC,aAAa,EAAE,WAAW,CAAC,CAAC;YACrE,QAAQ,CAAC,aAAa,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC;YAC7C,MAAM,MAAM,GAAG,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YAC5C,MAAM,KAAK,GAAG,QAAQ,CAAC,6BAA6B,CAAC,SAAS,CAAC,CAAC,EAAE,KAAK,CAAC,aAAa,CAAC,SAAS,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;YAC5G,MAAM,MAAM,GAAG,SAAS,CAAC,UAAU,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;YACnD,MAAM,OAAO,GAAG,kBAAkB,CAAC,iBAAiB,CAAC,UAAU,EAC7D,CAAC,EAAE,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,EAAE,KAAK,CAAC,IAAI,EAAE,EAAE,SAAS,EAAE,OAAO,CAAC,WAAW,EAAE,EAAE,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,CAAE,CAAC;YAC5G,OAAO,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;QAC5B,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;;;;OASG;IACI,MAAM,CAAC,0CAA0C,CACtD,UAAoC,EACpC,MAAe,EACf,MAAe,EACf,MAAe,EACf,YAAoB;QAEpB,MAAM,QAAQ,GAAG,QAAQ,CAAC,cAAc,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QACzD,MAAM,QAAQ,GAAG,QAAQ,CAAC,cAAc,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QACzD,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC;QACrD,MAAM,aAAa,GAAG,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;QACnD,MAAM,iBAAiB,GAAG,GAAG,GAAG,aAAa,CAAC,OAAO,CAAC;QACtD,MAAM,eAAe,GAAG,GAAG,GAAG,CAAC,IAAI,CAAC,EAAE,GAAG,aAAa,CAAC,OAAO,CAAC,CAAC;QAChE,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACvD,MAAM,SAAS,GAAG,kBAAkB,CAAC,iBAAiB,CACpD,UAAU,EAAE,CAAC,EAAE,SAAS,EACxB,KAAK,CAAC,IAAI,EAAE,EAAE,KAAK,CAAC,aAAa,CAAC,iBAAiB,CAAC,EACpD,YAAY,EAAE,SAAS,EAAE,SAAS,CAAC,cAAc,EAAE,CACpD,CAAC;QACF,IAAI,SAAS,EAAE,CAAC;YACd,MAAM,aAAa,GAAG,SAAS,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;YACnD,MAAM,UAAU,GAAG,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;YAC3C,MAAM,UAAU,GAAG,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;YAC3C,oGAAoG;YACpG,uFAAuF;YACvF,MAAM,UAAU,GAAG,aAAa,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,eAAe,CAAC,CAAC;YAC/D,MAAM,WAAW,GAAG,QAAQ,CAAC,yBAAyB,CAAC,UAAU,GAAG,UAAU,GAAG,aAAa,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;YAC9G,MAAM,WAAW,GAAG,QAAQ,CAAC,yBAAyB,CAAC,UAAU,GAAG,UAAU,GAAG,aAAa,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;YAC9G,IAAI,WAAW,KAAK,SAAS,IAAI,WAAW,KAAK,SAAS,EAAE,CAAC;gBAC3D,MAAM,KAAK,GAAG,QAAQ,CAAC,6BAA6B,CAAC,SAAS,CAAC,CAAC,EAAE,KAAK,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC,CAAC;gBAClG,MAAM,YAAY,GAAG,MAAM,CAAC,WAAW,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;gBAC7D,MAAM,MAAM,GAAG,SAAS,CAAC,UAAU,CAAC,YAAY,EAAE,KAAK,CAAC,CAAC;gBACzD,MAAM,QAAQ,GAAG,kBAAkB,CAAC,iBAAiB,CACnD,UAAU,EAAE,CAAC,EAAE,SAAS,EACxB,KAAK,CAAC,IAAI,EAAE,EAAE,KAAK,CAAC,aAAa,CAAC,iBAAiB,CAAC,EACpD,YAAY,EAAE,SAAS,EAAE,MAAM,CAC/B,CAAC;gBACH,MAAM,KAAK,GAAG,QAAQ,CAAC,6BAA6B,CAAC,SAAS,CAAC,CAAC,EAAE,KAAK,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC,CAAC;gBAClG,MAAM,YAAY,GAAG,MAAM,CAAC,WAAW,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;gBAC7D,MAAM,MAAM,GAAG,SAAS,CAAC,UAAU,CAAC,YAAY,EAAE,KAAK,CAAC,CAAC;gBACzD,MAAM,QAAQ,GAAG,kBAAkB,CAAC,iBAAiB,CACnD,UAAU,EAAE,CAAC,EAAE,SAAS,EACxB,KAAK,CAAC,IAAI,EAAE,EAAE,KAAK,CAAC,aAAa,CAAC,CAAC,iBAAiB,CAAC,EACrD,YAAY,EAAE,SAAS,EAAE,MAAM,CAC/B,CAAC;gBACH,OAAO,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;YAC9B,CAAC;QACH,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;;;;OASG;IACI,MAAM,CAAC,6BAA6B,CACzC,UAAoC,EACpC,MAAe,EACf,MAAe,EACf,MAAe,EACf,OAAe,EACf,OAAe,EACf,SAAiB;QAEjB,MAAM,QAAQ,GAAG,QAAQ,CAAC,cAAc,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC;QACzE,MAAM,QAAQ,GAAG,QAAQ,CAAC,cAAc,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC;QACzE,MAAM,MAAM,GAAG,QAAQ,CAAC,SAAS,EAAE,CAAC;QACpC,MAAM,MAAM,GAAG,QAAQ,CAAC,SAAS,EAAE,CAAC;QACpC,IAAI,MAAM,KAAK,SAAS,IAAI,MAAM,KAAK,SAAS;YAC9C,OAAO,SAAS,CAAC;QACnB,MAAM,UAAU,GAAG,MAAM,CAAC,mBAAmB,EAAE,CAAC;QAChD,MAAM,UAAU,GAAG,MAAM,CAAC,mBAAmB,EAAE,CAAC;QAChD,MAAM,QAAQ,GAAG,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;QAC9C,MAAM,KAAK,GAAG,QAAQ,CAAC,aAAa,CAAC,QAAQ,CAAC,OAAO,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAClE,MAAM,KAAK,GAAG,CAAE,KAAK,CAAC;QACtB,MAAM,OAAO,GAAG,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QAC5C,MAAM,OAAO,GAAG,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QAC5C,MAAM,OAAO,GAAG,kBAAkB,CAAC,iBAAiB,CAAC,UAAU,EAC7D,CAAC,EAAE,OAAO,EAAE,KAAK,CAAC,IAAI,EAAE,EAAE,SAAS,EAAE,OAAO,EAAE,SAAS,EAAE,SAAS,CAAC,cAAc,EAAE,CAAE,CAAC;QACxF,MAAM,OAAO,GAAG,kBAAkB,CAAC,iBAAiB,CAAC,UAAU,EAC7D,CAAC,EAAE,OAAO,EAAE,KAAK,CAAC,IAAI,EAAE,EAAE,SAAS,EAAE,OAAO,EAAE,SAAS,EAAE,SAAS,CAAC,cAAc,EAAE,CAAE,CAAC;QACxF,MAAM,UAAU,GAAG,OAAO,CAAC,6BAA6B,CAAC,GAAG,CAAC,CAAC;QAC9D,MAAM,UAAU,GAAG,OAAO,CAAC,6BAA6B,CAAC,GAAG,CAAC,CAAC;QAC9D,oGAAoG;QACpG,MAAM,EAAE,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,GAAG,OAAO,GAAG,UAAU,CAAC,SAAS,CAAC,CAAC,CAAC;QAClE,MAAM,EAAE,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,GAAG,OAAO,GAAG,UAAU,CAAC,SAAS,CAAC,CAAC,CAAC;QAClE,MAAM,EAAE,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,GAAG,OAAO,GAAG,UAAU,CAAC,SAAS,CAAC,CAAC,CAAC;QAClE,MAAM,EAAE,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,GAAG,OAAO,GAAG,UAAU,CAAC,SAAS,CAAC,CAAC,CAAC;QAClE,+DAA+D;QAC/D,MAAM,OAAO,GAAG,QAAQ,CAAC,gBAAgB,CAAC,MAAM,EAAE,EAAE,EAAE,UAAU,EAAE,EAAE,CAAC,CAAC;QACtE,MAAM,OAAO,GAAG,QAAQ,CAAC,gBAAgB,CAAC,MAAM,EAAE,EAAE,EAAE,UAAU,EAAE,EAAE,CAAC,CAAC;QACtE,MAAM,EAAE,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC;QAC7B,IAAI,WAAW,CAAC,cAAc,CAC5B,MAAM,CAAC,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC,EACnB,MAAM,CAAC,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC,EACnB,OAAO,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC;YACpD,MAAM,UAAU,GAAG,MAAM,CAAC,UAAU,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;YACnD,MAAM,UAAU,GAAG,MAAM,CAAC,UAAU,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;YACnD,MAAM,MAAM,GAAG,SAAS,CAAC,4BAA4B,CAAC,UAAU,EAAE,MAAM,EAAE,UAAU,EAAE,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAC;YACxG,MAAM,MAAM,GAAG,SAAS,CAAC,4BAA4B,CAAC,UAAU,EAAE,MAAM,EAAE,UAAU,EAAE,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAC;YACxG,OAAO,CAAC,mBAAmB,CAAC,MAAM,CAAC,CAAC;YACpC,OAAO,CAAC,mBAAmB,CAAC,MAAM,CAAC,CAAC;YACpC,MAAM,KAAK,GAAG,OAAO,CAAC,6BAA6B,CAAC,GAAG,CAAC,CAAC;YACzD,MAAM,KAAK,GAAG,OAAO,CAAC,6BAA6B,CAAC,GAAG,CAAC,CAAC;YACzD,KAAK,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC;YACnC,MAAM,KAAK,GAAG,KAAK,CAAC,SAAS,CAAC,SAAS,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;YACzD,IAAI,OAAO,GAAG,CAAC;gBACb,KAAK,CAAC,UAAU,CAAC,CAAE,KAAK,CAAC,OAAO,CAAC,CAAC;YACpC,MAAM,GAAG,GAAG,YAAY,CAAC,2BAA2B,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,SAAS,EAAE,OAAO,EAAE,SAAS,EAAE,KAAK,CAAE,CAAC;YAChH,OAAO,CAAC,OAAO,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;QACjC,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,iDAAiD;IAC1C,MAAM,CAAC,yBAAyB,CACrC,MAA8B,EAAE,MAA8B;QAC9D,MAAM,SAAS,GAAG,MAAM,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAC9C,MAAM,SAAS,GAAG,MAAM,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAC9C,MAAM,QAAQ,GAAG,MAAM,CAAC,OAAO,EAAE,CAAC;QAClC,MAAM,QAAQ,GAAG,MAAM,CAAC,OAAO,EAAE,CAAC;QAClC,MAAM,QAAQ,GAAG,MAAM,CAAC,OAAO,EAAE,CAAC;QAClC,MAAM,QAAQ,GAAG,MAAM,CAAC,OAAO,EAAE,CAAC;QAClC,MAAM,QAAQ,GAAG,MAAM,CAAC,OAAO,EAAE,CAAC;QAClC,MAAM,QAAQ,GAAG,MAAM,CAAC,OAAO,EAAE,CAAC;QAClC,MAAM,QAAQ,GAAG,QAAQ,CAAC,gBAAgB,CAAC,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC;QACnF,MAAM,QAAQ,GAAG,QAAQ,CAAC,gBAAgB,CAAC,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC;QACnF,MAAM,QAAQ,GAAG,QAAQ,CAAC,gBAAgB,CAAC,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC;QACnF,MAAM,SAAS,GAAG,WAAW,CAAC,cAAc,CAC1C,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAC5B,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAC5B,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAC5B,CAAC,SAAS,EAAE,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;QAC/B,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;YAC5B,OAAO,KAAK,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC;QACjG,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;CACF","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n\r\n/** @packageDocumentation\r\n * @module Curve\r\n */\r\n\r\nimport { AxisIndex, AxisOrder, Geometry, PlaneAltitudeEvaluator } from \"../Geometry\";\r\nimport { Angle } from \"../geometry3d/Angle\";\r\nimport { AngleSweep } from \"../geometry3d/AngleSweep\";\r\nimport { Ellipsoid, GeodesicPathPoint } from \"../geometry3d/Ellipsoid\";\r\nimport { IndexedXYZCollection } from \"../geometry3d/IndexedXYZCollection\";\r\nimport { Matrix3d } from \"../geometry3d/Matrix3d\";\r\nimport { Plane3dByOriginAndUnitNormal } from \"../geometry3d/Plane3dByOriginAndUnitNormal\";\r\nimport { Vector2d } from \"../geometry3d/Point2dVector2d\";\r\nimport { Point3dArrayCarrier } from \"../geometry3d/Point3dArrayCarrier\";\r\nimport { Point3d, Vector3d } from \"../geometry3d/Point3dVector3d\";\r\nimport { PolylineOps } from \"../geometry3d/PolylineOps\";\r\nimport { Ray3d } from \"../geometry3d/Ray3d\";\r\nimport { Segment1d } from \"../geometry3d/Segment1d\";\r\nimport { Transform } from \"../geometry3d/Transform\";\r\nimport { XAndY } from \"../geometry3d/XYZProps\";\r\nimport { SmallSystem } from \"../numerics/SmallSystem\";\r\nimport { IndexedPolyface } from \"../polyface/Polyface\";\r\nimport { PolyfaceBuilder } from \"../polyface/PolyfaceBuilder\";\r\nimport { Cone } from \"../solid/Cone\";\r\nimport { RuledSweep } from \"../solid/RuledSweep\";\r\nimport { TorusPipe } from \"../solid/TorusPipe\";\r\nimport { Arc3d, ArcBlendData } from \"./Arc3d\";\r\nimport { CurveChain } from \"./CurveCollection\";\r\nimport { CurvePrimitive } from \"./CurvePrimitive\";\r\nimport { AnyCurve, AnyRegion } from \"./CurveTypes\";\r\nimport { GeometryQuery } from \"./GeometryQuery\";\r\nimport { LineSegment3d } from \"./LineSegment3d\";\r\nimport { LineString3d } from \"./LineString3d\";\r\nimport { Loop } from \"./Loop\";\r\nimport { Path } from \"./Path\";\r\nimport { RegionOps } from \"./RegionOps\";\r\nimport { IntegratedSpiral3d } from \"./spiral/IntegratedSpiral3d\";\r\nimport { IntegratedSpiralTypeName } from \"./spiral/TransitionSpiral3d\";\r\nimport { StrokeOptions } from \"./StrokeOptions\";\r\n\r\n// cspell:word CCWXY\r\n\r\n/**\r\n * Interface to carry parallel arrays of planes and sections, and optional geometry assembled from them,\r\n * as returned by [CurveFactory.createMiteredSweepSections].\r\n * @public\r\n */\r\nexport interface SectionSequenceWithPlanes {\r\n /** The plane of each section. */\r\n planes: Plane3dByOriginAndUnitNormal[];\r\n /** Section curve projected onto the corresponding plane. */\r\n sections: AnyCurve[];\r\n /**\r\n * Optional `RuledSweep` generated from the sections.\r\n * * The `RuledSweep` and sections array refer to the same section objects.\r\n */\r\n ruledSweep?: RuledSweep;\r\n /** Optional mesh generated from the `RuledSweep` generated from the sections. */\r\n mesh?: IndexedPolyface;\r\n}\r\n\r\n/**\r\n * Enumeration of geometric output for [CurveFactory.createMiteredSweepSections].\r\n * @public\r\n */\r\nexport enum MiteredSweepOutputSelect {\r\n /** Output only the parallel arrays of planes and sections. */\r\n Sections = 0,\r\n /** Output planes and sections, as well as the assembled ruled sweep. */\r\n AlsoRuledSweep = 1,\r\n /** Output planes and sections, as well as the assembled ruled sweep and its stroked mesh. */\r\n AlsoMesh = 2,\r\n}\r\n\r\n/**\r\n * Interface bundling options for [CurveFactory.createMiteredSweepSections].\r\n * @public\r\n */\r\nexport interface MiteredSweepOptions {\r\n /** Whether first and last planes are averaged and equated when the centerline is physically closed. Default value is `false`. */\r\n wrapIfPhysicallyClosed?: boolean;\r\n /** Whether to output sections only, or sections plus optional geometry constructed from them. Default value is `MiteredSweepOutputSelect.Sections`. */\r\n outputSelect?: MiteredSweepOutputSelect;\r\n /** How to stroke smooth input curves. If undefined, default stroke options are used. */\r\n strokeOptions?: StrokeOptions;\r\n /** Whether to cap the ruled sweep if outputting a ruled sweep or mesh. Default value is `false`. */\r\n capped?: boolean;\r\n /** The first section's normal is aligned to this vector, typically the start tangent of the smooth curve stroked for the centerline. */\r\n startTangent?: Vector3d;\r\n /** The last section's normal is aligned to this vector, typically the end tangent of the smooth curve stroked for the centerline. */\r\n endTangent?: Vector3d;\r\n}\r\n\r\n/**\r\n * Curve strokes plus start/end tangents.\r\n * @internal\r\n*/\r\ninterface SmoothCurveData {\r\n /** Samples along a curve. */\r\n strokes: IndexedXYZCollection;\r\n /** Start tangent (unnormalized). May be undefined if the curve is linear. */\r\n startTangent?: Vector3d;\r\n /** End tangent (unnormalized). May be undefined if the curve is linear. */\r\n endTangent?: Vector3d;\r\n};\r\n\r\n/**\r\n * The `CurveFactory` class contains methods for specialized curve constructions.\r\n * @public\r\n */\r\nexport class CurveFactory {\r\n /** (Cautiously) construct and save a line segment between fractional positions. */\r\n private static addPartialSegment(\r\n path: Path, allowBackup: boolean,\r\n pointA: Point3d | undefined, pointB: Point3d | undefined,\r\n fraction0: number, fraction1: number,\r\n ) {\r\n if (allowBackup || (fraction1 > fraction0)) {\r\n if (pointA !== undefined && pointB !== undefined && !Geometry.isAlmostEqualNumber(fraction0, fraction1))\r\n path.tryAddChild(LineSegment3d.create(pointA.interpolate(fraction0, pointB), pointA.interpolate(fraction1, pointB)));\r\n }\r\n }\r\n /**\r\n * Create a circular arc defined by start point, tangent at start point, and end point.\r\n * * The circular arc is swept from start to end toward direction of the `tangentAtStart`.\r\n * * If tangent is parallel to line segment from start to end, return `undefined`.\r\n */\r\n public static createArcPointTangentPoint(start: Point3d, tangentAtStart: Vector3d, end: Point3d): Arc3d | undefined {\r\n const ret = Arc3d.createCircularStartTangentEnd(start, tangentAtStart, end);\r\n if (ret instanceof Arc3d)\r\n return ret;\r\n else\r\n return undefined;\r\n }\r\n /**\r\n * Construct a sequence of alternating lines and arcs with the arcs creating tangent transition between consecutive edges.\r\n * * If the radius parameter is a number, that radius is used throughout.\r\n * * If the radius parameter is an array of numbers, `radius[i]` is applied at `point[i]`.\r\n * * Note that since no fillet is constructed at the initial or final point, those entries in `radius[]` are never referenced.\r\n * * A zero radius for any point indicates to leave the as a simple corner.\r\n * @param points point source\r\n * @param radius fillet radius or array of radii indexed to correspond to the points.\r\n * @param allowBackupAlongEdge true to allow edges to be created going \"backwards\" along edges if needed to create the blend.\r\n */\r\n public static createFilletsInLineString(\r\n points: LineString3d | IndexedXYZCollection | Point3d[],\r\n radius: number | number[],\r\n allowBackupAlongEdge: boolean = true,\r\n ): Path | undefined {\r\n if (Array.isArray(points))\r\n return this.createFilletsInLineString(new Point3dArrayCarrier(points), radius, allowBackupAlongEdge);\r\n if (points instanceof LineString3d)\r\n return this.createFilletsInLineString(points.packedPoints, radius, allowBackupAlongEdge);\r\n const n = points.length;\r\n if (n <= 1)\r\n return undefined;\r\n const pointA = points.getPoint3dAtCheckedPointIndex(0)!;\r\n const pointB = points.getPoint3dAtCheckedPointIndex(1)!;\r\n // remark: n=2 and n=3 cases should fall out from loop logic\r\n const blendArray: ArcBlendData[] = [];\r\n // build one-sided blends at each end . .\r\n blendArray.push({ fraction10: 0.0, fraction12: 0.0, point: pointA.clone() });\r\n for (let i = 1; i + 1 < n; i++) {\r\n const pointC = points.getPoint3dAtCheckedPointIndex(i + 1)!;\r\n let thisRadius = 0;\r\n if (Array.isArray(radius)) {\r\n if (i < radius.length)\r\n thisRadius = radius[i];\r\n } else if (Number.isFinite(radius))\r\n thisRadius = radius;\r\n if (thisRadius !== 0.0)\r\n blendArray.push(Arc3d.createFilletArc(pointA, pointB, pointC, thisRadius));\r\n else\r\n blendArray.push({ fraction10: 0.0, fraction12: 0.0, point: pointB.clone() });\r\n pointA.setFromPoint3d(pointB);\r\n pointB.setFromPoint3d(pointC);\r\n }\r\n blendArray.push({ fraction10: 0.0, fraction12: 0.0, point: pointB.clone() });\r\n if (!allowBackupAlongEdge) {\r\n // suppress arcs that have overlap with both neighbors or flood either neighbor ..\r\n for (let i = 1; i + 1 < n; i++) {\r\n const b = blendArray[i];\r\n if (b.fraction10 > 1.0\r\n || b.fraction12 > 1.0\r\n || 1.0 - b.fraction10 < blendArray[i - 1].fraction12\r\n || b.fraction12 > 1.0 - blendArray[i + 1].fraction10) {\r\n b.fraction10 = 0.0;\r\n b.fraction12 = 0.0;\r\n blendArray[i].arc = undefined;\r\n }\r\n }\r\n /* The \"1-b\" logic above prevents this loop from ever doing anything.\r\n // on edge with conflict, suppress the arc with larger fraction\r\n for (let i = 1; i < n; i++) {\r\n const b0 = blendArray[i - 1];\r\n const b1 = blendArray[i];\r\n if (b0.fraction12 > 1 - b1.fraction10) {\r\n const b = b0.fraction12 > b1.fraction12 ? b1 : b0;\r\n b.fraction10 = 0.0;\r\n b.fraction12 = 0.0;\r\n blendArray[i].arc = undefined;\r\n }\r\n } */\r\n }\r\n const path = Path.create();\r\n this.addPartialSegment(\r\n path, allowBackupAlongEdge,\r\n blendArray[0].point, blendArray[1].point,\r\n blendArray[0].fraction12, 1.0 - blendArray[1].fraction10,\r\n );\r\n // add each path and successor edge ...\r\n for (let i = 1; i + 1 < points.length; i++) {\r\n const b0 = blendArray[i];\r\n const b1 = blendArray[i + 1];\r\n path.tryAddChild(b0.arc);\r\n this.addPartialSegment(path, allowBackupAlongEdge, b0.point, b1.point, b0.fraction12, 1.0 - b1.fraction10);\r\n }\r\n return path;\r\n }\r\n /**\r\n * Create a `Loop` with given xy corners and fixed z.\r\n * * The corners always proceed counter clockwise from lower left.\r\n * * If the radius is too large for the outer rectangle size, it is reduced to half of the the smaller x or y size.\r\n */\r\n public static createRectangleXY(\r\n x0: number, y0: number, x1: number, y1: number, z: number = 0, filletRadius?: number,\r\n ): Loop {\r\n let radius = Geometry.correctSmallMetricDistance(filletRadius);\r\n const xMin = Math.min(x0, x1);\r\n const xMax = Math.max(x0, x1);\r\n const yMin = Math.min(y0, y1);\r\n const yMax = Math.max(y0, y1);\r\n radius = Math.min(Math.abs(radius), 0.5 * (xMax - xMin), 0.5 * (yMax - yMin));\r\n if (radius === 0.0)\r\n return Loop.createPolygon([\r\n Point3d.create(xMin, yMin, z),\r\n Point3d.create(xMax, yMin, z),\r\n Point3d.create(xMax, yMax, z),\r\n Point3d.create(xMin, yMax, z),\r\n Point3d.create(xMin, yMin, z),\r\n ]);\r\n else {\r\n const vectorU = Vector3d.create(radius, 0, 0);\r\n const vectorV = Vector3d.create(0, radius, 0);\r\n const x0A = xMin + radius;\r\n const y0A = yMin + radius;\r\n const x1A = xMax - radius;\r\n const y1A = yMax - radius;\r\n const centers = [\r\n Point3d.create(x1A, y1A, z),\r\n Point3d.create(x0A, y1A, z),\r\n Point3d.create(x0A, y0A, z),\r\n Point3d.create(x1A, y0A, z),\r\n ];\r\n const loop = Loop.create();\r\n for (let i = 0; i < 4; i++) {\r\n const center = centers[i];\r\n const nextCenter = centers[(i + 1) % 4];\r\n const edgeVector = Vector3d.createStartEnd(center, nextCenter);\r\n const arc = Arc3d.create(center, vectorU, vectorV, AngleSweep.createStartEndDegrees(0, 90));\r\n loop.tryAddChild(arc);\r\n const arcEnd = arc.endPoint();\r\n if (!edgeVector.isAlmostZero)\r\n loop.tryAddChild(LineSegment3d.create(arcEnd, arcEnd.plus(edgeVector)));\r\n vectorU.rotate90CCWXY(vectorU);\r\n vectorV.rotate90CCWXY(vectorV);\r\n }\r\n return loop;\r\n }\r\n }\r\n /**\r\n * If `arcB` is a continuation of `arcA`, extend `arcA` (in place) to include the range of `arcB`\r\n * * This only succeeds if the two arcs are part of identical complete arcs and end of `arcA` matches the beginning of `arcB`.\r\n * @param arcA first arc, modified in place.\r\n * @param arcB second arc, unmodified.\r\n * @param allowReversed whether to consolidate even when second arc is reversed.\r\n * @returns whether `arcA` was modified.\r\n */\r\n public static appendToArcInPlace(arcA: Arc3d, arcB: Arc3d, allowReverse: boolean = false): boolean {\r\n if (arcA.center.isAlmostEqual(arcB.center)) {\r\n const sweepSign = Geometry.split3WaySign(arcA.sweep.sweepRadians * arcB.sweep.sweepRadians, -1, 0, 1);\r\n // evaluate derivatives wrt radians (not fraction!), but adjust direction for sweep signs\r\n const endA = arcA.angleToPointAndDerivative(arcA.sweep.fractionToAngle(1.0));\r\n if (arcA.sweep.sweepRadians < 0)\r\n endA.direction.scaleInPlace(-1.0);\r\n const startB = arcB.angleToPointAndDerivative(arcB.sweep.fractionToAngle(0.0));\r\n if (arcB.sweep.sweepRadians < 0)\r\n startB.direction.scaleInPlace(-1.0);\r\n if (endA.isAlmostEqual(startB)) {\r\n arcA.sweep.setStartEndRadians(\r\n arcA.sweep.startRadians, arcA.sweep.startRadians + arcA.sweep.sweepRadians + sweepSign * arcB.sweep.sweepRadians,\r\n );\r\n return true;\r\n }\r\n // Also ok if negated tangent\r\n if (allowReverse) {\r\n startB.direction.scaleInPlace(-1.0);\r\n if (endA.isAlmostEqual(startB)) {\r\n arcA.sweep.setStartEndRadians(\r\n arcA.sweep.startRadians, arcA.sweep.startRadians + arcA.sweep.sweepRadians - sweepSign * arcB.sweep.sweepRadians,\r\n );\r\n return true;\r\n }\r\n }\r\n }\r\n return false;\r\n }\r\n /**\r\n * Return a `Path` containing arcs are on the surface of an ellipsoid and pass through a sequence of points.\r\n * * Each arc passes through the two given endpoints and in the plane containing the true surface normal at\r\n * given `fractionForIntermediateNormal`\r\n * @param ellipsoid\r\n * @param pathPoints\r\n * @param fractionForIntermediateNormal fractional position for surface normal used to create the section plane.\r\n */\r\n public static assembleArcChainOnEllipsoid(\r\n ellipsoid: Ellipsoid, pathPoints: GeodesicPathPoint[], fractionForIntermediateNormal: number = 0.5,\r\n ): Path {\r\n const arcPath = Path.create();\r\n for (let i = 0; i + 1 < pathPoints.length; i++) {\r\n const arc = ellipsoid.sectionArcWithIntermediateNormal(\r\n pathPoints[i].toAngles(),\r\n fractionForIntermediateNormal,\r\n pathPoints[i + 1].toAngles());\r\n arcPath.tryAddChild(arc);\r\n }\r\n return arcPath;\r\n }\r\n private static appendGeometryQueryArray(candidate: GeometryQuery | GeometryQuery[] | undefined, result: GeometryQuery[]) {\r\n if (candidate instanceof GeometryQuery)\r\n result.push(candidate);\r\n else if (Array.isArray(candidate)) {\r\n for (const p of candidate)\r\n this.appendGeometryQueryArray(p, result);\r\n }\r\n }\r\n /**\r\n * Create solid primitives for pipe segments (e.g. Cone or TorusPipe) around line and arc primitives.\r\n * @param centerline centerline geometry.\r\n * @param pipeRadius radius of pipe.\r\n */\r\n public static createPipeSegments(\r\n centerline: CurvePrimitive | CurveChain, pipeRadius: number,\r\n ): GeometryQuery | GeometryQuery[] | undefined {\r\n if (centerline instanceof LineSegment3d) {\r\n return Cone.createAxisPoints(centerline.startPoint(), centerline.endPoint(), pipeRadius, pipeRadius, false);\r\n } else if (centerline instanceof Arc3d) {\r\n return TorusPipe.createAlongArc(centerline, pipeRadius, false);\r\n } else if (centerline instanceof CurvePrimitive) {\r\n const builder = PolyfaceBuilder.create();\r\n builder.addMiteredPipes(centerline, pipeRadius);\r\n return builder.claimPolyface();\r\n } else if (centerline instanceof CurveChain) {\r\n const result: GeometryQuery[] = [];\r\n for (const p of centerline.children) {\r\n const pipe = this.createPipeSegments(p, pipeRadius);\r\n this.appendGeometryQueryArray(pipe, result);\r\n }\r\n return result;\r\n }\r\n return undefined;\r\n }\r\n /** Get start point and tangent for variant curve data. */\r\n private static startPointAndTangent(curve: IndexedXYZCollection | Point3d[] | CurvePrimitive): Ray3d | undefined {\r\n if (curve instanceof CurvePrimitive)\r\n return curve.fractionToPointAndDerivative(0.0);\r\n if (curve.length < 2)\r\n return undefined;\r\n if (Array.isArray(curve))\r\n curve = new Point3dArrayCarrier(curve);\r\n const ray = Ray3d.createZero();\r\n curve.getPoint3dAtUncheckedPointIndex(0, ray.origin);\r\n curve.vectorIndexIndex(0, 1, ray.direction);\r\n return ray;\r\n };\r\n /** Create an [[Arc3d]] from `sectionData` that has its center at the start point of the centerline. */\r\n public static createArcFromSectionData(\r\n centerline: IndexedXYZCollection | Point3d[] | CurvePrimitive, sectionData: number | XAndY | Arc3d,\r\n ): Arc3d | undefined {\r\n const ray = CurveFactory.startPointAndTangent(centerline);\r\n if (!ray)\r\n return undefined;\r\n let arc: Arc3d;\r\n if (sectionData instanceof Arc3d) {\r\n arc = sectionData.clone();\r\n arc.center = ray.origin;\r\n } else {\r\n const vector0 = Vector3d.create();\r\n const vector90 = Vector3d.create();\r\n const length0 = (typeof sectionData === \"number\") ? sectionData : sectionData.x;\r\n const length90 = (typeof sectionData === \"number\") ? sectionData : sectionData.y;\r\n const baseFrame = Matrix3d.createRigidHeadsUp(ray.direction, AxisOrder.ZXY);\r\n baseFrame.columnX(vector0).scaleInPlace(length0);\r\n baseFrame.columnY(vector90).scaleInPlace(length90);\r\n arc = Arc3d.create(ray.origin, vector0, vector90);\r\n }\r\n if (arc.binormalVector().dotProduct(ray.direction) < 0.0)\r\n arc.reverseInPlace();\r\n return arc;\r\n }\r\n /**\r\n * Create section arcs for mitered pipe.\r\n * * At the end of each pipe segment, the pipe is mitered by the plane that bisects the angle between successive\r\n * centerline segments.\r\n * * The section arcs are constructed so that lines between corresponding fractional positions on the arcs are\r\n * axial lines on the pipes.\r\n * * This means that the initial arc's vector0 and vector90 lengths and angular separation are _not_ preserved in\r\n * the section arcs.\r\n * * Circular or elliptical pipe cross sections can be specified by supplying either a radius, a pair of semi-axis\r\n * lengths, or an Arc3d:\r\n * * For semi-axis length input, x and y correspond to ellipse local axes perpendicular to each other and to the\r\n * start tangent.\r\n * * For Arc3d input, the center is translated to the centerline start point. For best results, ensure this arc\r\n * is perpendicular to the centerline start tangent.\r\n * * This function internally calls [[createMiteredSweepSections]] with default options.\r\n * @param centerline centerline of pipe. For best results, ensure no successive duplicate points with e.g.,\r\n * [[GrowableXYZArray.createCompressed]].\r\n * @param sectionData circle radius, ellipse semi-axis lengths, or full Arc3d (if not full, function makes it full).\r\n * @returns array of sections or empty array if section creation failed.\r\n */\r\n public static createMiteredPipeSections(centerline: IndexedXYZCollection, sectionData: number | XAndY | Arc3d): Arc3d[] {\r\n const arc = CurveFactory.createArcFromSectionData(centerline, sectionData);\r\n if (!arc)\r\n return [];\r\n const miteredSweeps = CurveFactory.createMiteredSweepSections(centerline, arc);\r\n if (miteredSweeps)\r\n return miteredSweeps.sections as Arc3d[];\r\n return [];\r\n }\r\n\r\n /** For a smooth curve, stroke and return unnormalized start/end tangents. */\r\n private static strokeSmoothCurve(\r\n curve: IndexedXYZCollection | Point3d[] | CurvePrimitive | CurveChain,\r\n options?: StrokeOptions,\r\n ): SmoothCurveData | undefined {\r\n let startTangent, endTangent: Vector3d | undefined;\r\n if (curve instanceof CurvePrimitive) {\r\n startTangent = curve.fractionToPointAndDerivative(0.0).direction;\r\n endTangent = curve.fractionToPointAndDerivative(1.0).direction;\r\n const strokes = LineString3d.create();\r\n curve.emitStrokes(strokes, options);\r\n curve = strokes.packedPoints;\r\n } else if (curve instanceof CurveChain) {\r\n startTangent = curve.startPointAndDerivative()?.direction;\r\n endTangent = curve.endPointAndDerivative()?.direction;\r\n const strokes = curve.getPackedStrokes(options);\r\n if (!strokes)\r\n return undefined;\r\n curve = strokes;\r\n } else if (Array.isArray(curve))\r\n curve = new Point3dArrayCarrier(curve);\r\n return { strokes: curve, startTangent, endTangent };\r\n }\r\n\r\n /**\r\n * Align two bisector plane normals to given smooth rail tangents or optional overrides.\r\n * * Optionally average the normals for physically closed rail.\r\n */\r\n private static alignFirstAndLastBisectorPlanes(\r\n firstPlane: Plane3dByOriginAndUnitNormal,\r\n lastPlane: Plane3dByOriginAndUnitNormal,\r\n smoothRailData?: SmoothCurveData,\r\n options?: MiteredSweepOptions,\r\n ) {\r\n const normal0 = options?.startTangent ?? (smoothRailData?.startTangent ?? firstPlane.getNormalRef());\r\n const normal1 = options?.endTangent ?? (smoothRailData?.endTangent ?? lastPlane.getNormalRef());\r\n if (options?.wrapIfPhysicallyClosed && firstPlane.getOriginRef().isAlmostEqual(lastPlane.getOriginRef())) {\r\n const avgNormal = normal0.plus(normal1);\r\n if (avgNormal.tryNormalizeInPlace()) { // ignore cusp at seam\r\n firstPlane.getNormalRef().setFrom(avgNormal);\r\n lastPlane.getNormalRef().setFrom(avgNormal);\r\n return;\r\n }\r\n }\r\n if (normal0.tryNormalizeInPlace())\r\n firstPlane.getNormalRef().setFrom(normal0);\r\n if (normal1.tryNormalizeInPlace())\r\n lastPlane.getNormalRef().setFrom(normal1);\r\n }\r\n\r\n /** Reverse a closed curve or region if necessary so that its orientation is CCW with respect to the plane normal. */\r\n private static alignClosedCurveToPlane(curve: AnyCurve, planeNormal: Vector3d) {\r\n let closedCurve: AnyRegion | undefined;\r\n if (curve instanceof CurvePrimitive) {\r\n if (curve.startPoint().isAlmostEqual(curve.endPoint()))\r\n closedCurve = Loop.create(curve);\r\n } else if (curve.isAnyRegion())\r\n closedCurve = curve;\r\n if (closedCurve) {\r\n // The alignment condition is equivalent to positive projected curve area computed wrt to the plane normal.\r\n const toLocal = Matrix3d.createRigidHeadsUp(planeNormal).transpose();\r\n const projection = closedCurve.cloneTransformed(Transform.createOriginAndMatrix(undefined, toLocal));\r\n if (projection) { // now we can ignore z-coords\r\n const areaXY = RegionOps.computeXYArea(projection as AnyRegion);\r\n if (areaXY && areaXY < 0)\r\n curve.reverseInPlace();\r\n }\r\n }\r\n }\r\n\r\n /**\r\n * Projection to target plane, constructing sweep direction from two given planes.\r\n * * If successful, push the target plane and swept section to the output arrays and return the swept section.\r\n * * If unsuccessful, leave the output arrays alone and return the input section.\r\n */\r\n private static doSweepToPlane(\r\n output: SectionSequenceWithPlanes,\r\n edgePlane0: Plane3dByOriginAndUnitNormal,\r\n edgePlane1: Plane3dByOriginAndUnitNormal,\r\n targetPlane: Plane3dByOriginAndUnitNormal,\r\n section: AnyCurve,\r\n ): AnyCurve {\r\n const sweepVector = Vector3d.createStartEnd(edgePlane0.getOriginRef(), edgePlane1.getOriginRef());\r\n const transform = Transform.createFlattenAlongVectorToPlane(\r\n sweepVector, targetPlane.getOriginRef(), targetPlane.getNormalRef(),\r\n );\r\n if (transform === undefined)\r\n return section;\r\n const transformedSection = section.cloneTransformed(transform);\r\n if (transformedSection === undefined)\r\n return section;\r\n output.planes.push(targetPlane);\r\n output.sections.push(transformedSection);\r\n return transformedSection;\r\n }\r\n\r\n /**\r\n * Sweep the `initialSection` along each segment of the (stroked) `centerline` until it hits the bisector plane at\r\n * the next vertex.\r\n * * For best results, the caller should place `initialSection` in a plane perpendicular to the `centerline`\r\n * start tangent.\r\n * * This plane is commonly (but not necessarily) through the centerline start point itself.\r\n * * To compute the sections, `initialSection` is projected in the direction of the centerline start tangent onto\r\n * the first bisector plane at the centerline start. The result of this projection will be likewise projected onto\r\n * the second plane, and so on in sequence.\r\n * * By default, the first/last bisector plane normals are set to the centerline start/end tangents. The caller can\r\n * override these with tangents supplied in `options`. If the centerline is physically closed and\r\n * `options.wrapIfPhysicallyClosed` is true, the first and last plane normals are averaged and equated.\r\n * * The centerline path does NOT have to be planar, however non-planarity will result in twisting of the sections\r\n * in the bisector planes.\r\n * @param centerline sweep path. Will be stroked if smooth.\r\n * @param initialSection profile curve to be swept. As noted above, this should be on a plane perpendicular to the\r\n * centerline start tangent.\r\n * @param options options for computation and output.\r\n * @return array of sections, formed from projecting `initialSection` successively onto the bisector planes.\r\n */\r\n public static createMiteredSweepSections(\r\n centerline: IndexedXYZCollection | Point3d[] | CurvePrimitive | CurveChain,\r\n initialSection: AnyCurve,\r\n options?: MiteredSweepOptions,\r\n ): SectionSequenceWithPlanes | undefined {\r\n if (!options)\r\n options = {};\r\n const rail = this.strokeSmoothCurve(centerline, options.strokeOptions);\r\n if (!rail)\r\n return undefined;\r\n const planes = PolylineOps.createBisectorPlanesForDistinctPoints(rail.strokes);\r\n if (!planes || planes.length < 2)\r\n return undefined;\r\n this.alignFirstAndLastBisectorPlanes(planes[0], planes[planes.length - 1], rail, options);\r\n\r\n // RuledSweep facet construction assumes the contours are oriented CCW with respect to the sweep direction so that\r\n // facet normals point outward. We only have to align the first contour; the rest will inherit its orientation.\r\n this.alignClosedCurveToPlane(initialSection, planes[0].getNormalRef());\r\n\r\n const sectionData: SectionSequenceWithPlanes = { sections: [], planes: [] };\r\n let currentSection = this.doSweepToPlane(sectionData, planes[0], planes[1], planes[0], initialSection);\r\n for (let i = 1; i < planes.length; i++)\r\n currentSection = this.doSweepToPlane(sectionData, planes[i - 1], planes[i], planes[i], currentSection);\r\n\r\n if (options.outputSelect) {\r\n const ruledSweep = RuledSweep.create(sectionData.sections, options.capped ?? false);\r\n if (ruledSweep) {\r\n sectionData.ruledSweep = ruledSweep;\r\n if (MiteredSweepOutputSelect.AlsoMesh === options.outputSelect) {\r\n const builder = PolyfaceBuilder.create(options.strokeOptions);\r\n builder.addRuledSweep(ruledSweep);\r\n sectionData.mesh = builder.claimPolyface();\r\n }\r\n }\r\n }\r\n return sectionData;\r\n }\r\n /**\r\n * Create a circular arc from start point, tangent at start, radius, optional plane normal, arc sweep.\r\n * * The vector from start point to center is in the direction of upVector crossed with tangentA.\r\n * @param start start point.\r\n * @param tangentAtStart vector in tangent direction at the start.\r\n * @param radius signed radius.\r\n * @param upVector optional out-of-plane vector. Defaults to positive Z.\r\n * @param sweep angular range. If single `Angle` is given, start angle is at 0 degrees (the start point).\r\n */\r\n public static createArcPointTangentRadius(\r\n start: Point3d, tangentAtStart: Vector3d, radius: number, upVector?: Vector3d, sweep?: Angle | AngleSweep,\r\n ): Arc3d | undefined {\r\n return Arc3d.createCircularStartTangentRadius(start, tangentAtStart, radius, upVector, sweep);\r\n }\r\n /**\r\n * Compute 2 spirals (all in XY) for a symmetric line-to-line transition.\r\n * * First spiral begins at given start point.\r\n * * first tangent aims at shoulder.\r\n * * outbound spiral joins line from shoulder to target.\r\n * @param spiralType name of spiral type. THIS MUST BE AN \"Integrated\" SPIRAL TYPE.\r\n * @param startPoint inbound start point.\r\n * @param shoulder point target point for (both) spiral-to-line tangencies.\r\n * @return array with the computed spirals, or undefined if failure.\r\n */\r\n public static createLineSpiralSpiralLine(\r\n spiralType: IntegratedSpiralTypeName,\r\n startPoint: Point3d,\r\n shoulderPoint: Point3d,\r\n targetPoint: Point3d,\r\n ): GeometryQuery[] | undefined {\r\n const vectorAB = Vector3d.createStartEnd(startPoint, shoulderPoint);\r\n const vectorBC0 = Vector3d.createStartEnd(shoulderPoint, targetPoint);\r\n const referenceLength = vectorAB.magnitude();\r\n const radiansAB = Math.atan2(vectorAB.y, vectorAB.x);\r\n const lineTurnRadians = vectorAB.angleToXY(vectorBC0);\r\n const spiralTurnRadians = 0.5 * lineTurnRadians.radians;\r\n const radiansBC = radiansAB + lineTurnRadians.radians;\r\n const axesA = Matrix3d.createRotationAroundAxisIndex(AxisIndex.Z, Angle.createRadians(radiansAB));\r\n const frameA = Transform.createRefs(startPoint.clone(), axesA);\r\n // We know how much it has to turn, and but not the length or end radius.\r\n // make a spiral of referenceLength and scale it back to the junction line\r\n const spiralARefLength = IntegratedSpiral3d.createFrom4OutOf5(spiralType, 0.0, undefined,\r\n Angle.createRadians(0), Angle.createRadians(spiralTurnRadians), referenceLength, undefined, frameA);\r\n if (spiralARefLength) {\r\n const midPlanePerpendicularRadians = radiansAB + spiralTurnRadians;\r\n const midPlanePerpendicularVector = Vector3d.createPolar(1.0, Angle.createRadians(midPlanePerpendicularRadians));\r\n const altitudeB = midPlanePerpendicularVector.dotProductStartEnd(startPoint, shoulderPoint);\r\n const altitudeSpiralEnd = midPlanePerpendicularVector.dotProductStartEnd(startPoint, spiralARefLength.endPoint());\r\n const scaleFactor = altitudeB / altitudeSpiralEnd;\r\n const spiralA = IntegratedSpiral3d.createFrom4OutOf5(spiralType, 0.0, undefined,\r\n Angle.createRadians(0), Angle.createRadians(spiralTurnRadians), referenceLength * scaleFactor, undefined, frameA)!;\r\n const distanceAB = vectorAB.magnitude();\r\n const vectorBC = Vector3d.createStartEnd(shoulderPoint, targetPoint);\r\n vectorBC.scaleToLength(distanceAB, vectorBC);\r\n const pointC = shoulderPoint.plus(vectorBC);\r\n const axesC = Matrix3d.createRotationAroundAxisIndex(AxisIndex.Z, Angle.createRadians(radiansBC + Math.PI));\r\n const frameC = Transform.createRefs(pointC, axesC);\r\n const spiralC = IntegratedSpiral3d.createFrom4OutOf5(spiralType,\r\n 0, -spiralA.radius01.x1, Angle.zero(), undefined, spiralA.curveLength(), Segment1d.create(1, 0), frameC)!;\r\n return [spiralA, spiralC];\r\n }\r\n return undefined;\r\n }\r\n /**\r\n * Compute 2 spirals (all in XY) for a symmetric line-to-line transition.\r\n * * Spiral length is given.\r\n * * tangency points float on both lines.\r\n * @param spiralType name of spiral type. THIS MUST BE AN \"Integrated\" SPIRAL TYPE.\r\n * @param pointA inbound start point.\r\n * @param shoulder point target point for (both) spiral-to-line tangencies.\r\n * @param spiralLength for each part of the spiral pair.\r\n * @return array with the computed spirals, or undefined if failure.\r\n */\r\n public static createLineSpiralSpiralLineWithSpiralLength(\r\n spiralType: IntegratedSpiralTypeName,\r\n pointA: Point3d,\r\n pointB: Point3d,\r\n pointC: Point3d,\r\n spiralLength: number,\r\n ): GeometryQuery[] | undefined {\r\n const vectorAB = Vector3d.createStartEnd(pointA, pointB);\r\n const vectorBC = Vector3d.createStartEnd(pointB, pointC);\r\n const radiansAB = Math.atan2(vectorAB.y, vectorAB.x);\r\n const lineTurnAngle = vectorAB.angleToXY(vectorBC);\r\n const spiralTurnRadians = 0.5 * lineTurnAngle.radians;\r\n const bisectorRadians = 0.5 * (Math.PI - lineTurnAngle.radians);\r\n const radiansCB = Math.atan2(-vectorBC.y, -vectorBC.x);\r\n const spiralAB0 = IntegratedSpiral3d.createFrom4OutOf5(\r\n spiralType, 0, undefined,\r\n Angle.zero(), Angle.createRadians(spiralTurnRadians),\r\n spiralLength, undefined, Transform.createIdentity(),\r\n );\r\n if (spiralAB0) {\r\n const localEndPoint = spiralAB0.fractionToPoint(1);\r\n const distanceAB = pointA.distance(pointB);\r\n const distanceCB = pointC.distance(pointB);\r\n // The spiral eventually has to end on the bisector, at localEndPoint.y height from the inbound line\r\n // distance from shoulder to projection of that point to point E on the inbound line is\r\n const distanceBE = localEndPoint.y / Math.tan(bisectorRadians);\r\n const xFractionAB = Geometry.conditionalDivideFraction(distanceAB - distanceBE - localEndPoint.x, distanceAB);\r\n const xFractionCB = Geometry.conditionalDivideFraction(distanceCB - distanceBE - localEndPoint.x, distanceCB);\r\n if (xFractionAB !== undefined && xFractionCB !== undefined) {\r\n const axesA = Matrix3d.createRotationAroundAxisIndex(AxisIndex.Z, Angle.createRadians(radiansAB));\r\n const frameAOrigin = pointA.interpolate(xFractionAB, pointB);\r\n const frameA = Transform.createRefs(frameAOrigin, axesA);\r\n const spiralAB = IntegratedSpiral3d.createFrom4OutOf5(\r\n spiralType, 0, undefined,\r\n Angle.zero(), Angle.createRadians(spiralTurnRadians),\r\n spiralLength, undefined, frameA,\r\n )!;\r\n const axesB = Matrix3d.createRotationAroundAxisIndex(AxisIndex.Z, Angle.createRadians(radiansCB));\r\n const frameBOrigin = pointC.interpolate(xFractionCB, pointB);\r\n const frameB = Transform.createRefs(frameBOrigin, axesB);\r\n const spiralBC = IntegratedSpiral3d.createFrom4OutOf5(\r\n spiralType, 0, undefined,\r\n Angle.zero(), Angle.createRadians(-spiralTurnRadians),\r\n spiralLength, undefined, frameB,\r\n )!;\r\n return [spiralAB, spiralBC];\r\n }\r\n }\r\n return undefined;\r\n }\r\n /**\r\n * Compute 2 spirals and an arc (all in XY) for a symmetric line-to-line transition.\r\n * Spiral lengths and arc radius are given (e.g., from design speed standards).\r\n * @param spiralType name of spiral type. THIS MUST BE AN \"Integrated\" SPIRAL TYPE.\r\n * @param pointA inbound start point.\r\n * @param pointB shoulder (target) point for (both) spiral-to-line tangencies.\r\n * @param lengthA inbound spiral length.\r\n * @param lengthB outbound spiral length.\r\n * @return array with the computed spirals, or undefined if failure.\r\n */\r\n public static createLineSpiralArcSpiralLine(\r\n spiralType: IntegratedSpiralTypeName,\r\n pointA: Point3d,\r\n pointB: Point3d,\r\n pointC: Point3d,\r\n lengthA: number,\r\n lengthB: number,\r\n arcRadius: number,\r\n ): GeometryQuery[] | undefined {\r\n const vectorAB = Vector3d.createStartEnd(pointA, pointB); vectorAB.z = 0;\r\n const vectorCB = Vector3d.createStartEnd(pointC, pointB); vectorCB.z = 0;\r\n const unitAB = vectorAB.normalize();\r\n const unitCB = vectorCB.normalize();\r\n if (unitAB === undefined || unitCB === undefined)\r\n return undefined;\r\n const unitPerpAB = unitAB.unitPerpendicularXY();\r\n const unitPerpCB = unitCB.unitPerpendicularXY();\r\n const thetaABC = vectorAB.angleToXY(vectorCB);\r\n const sideA = Geometry.split3WaySign(thetaABC.radians, 1, -1, -1);\r\n const sideB = - sideA;\r\n const radiusA = sideA * Math.abs(arcRadius);\r\n const radiusB = sideB * Math.abs(arcRadius);\r\n const spiralA = IntegratedSpiral3d.createFrom4OutOf5(spiralType,\r\n 0, radiusA, Angle.zero(), undefined, lengthA, undefined, Transform.createIdentity())!;\r\n const spiralB = IntegratedSpiral3d.createFrom4OutOf5(spiralType,\r\n 0, radiusB, Angle.zero(), undefined, lengthB, undefined, Transform.createIdentity())!;\r\n const spiralEndA = spiralA.fractionToPointAndUnitTangent(1.0);\r\n const spiralEndB = spiralB.fractionToPointAndUnitTangent(1.0);\r\n // From the end of spiral, step away to arc center (and this is in local coordinates of each spiral)\r\n const sA = spiralEndA.origin.x - radiusA * spiralEndA.direction.y;\r\n const tA = spiralEndA.origin.y + radiusA * spiralEndA.direction.x;\r\n const sB = spiralEndB.origin.x - radiusB * spiralEndB.direction.y;\r\n const tB = spiralEndB.origin.y + radiusB * spiralEndB.direction.x;\r\n // Those local coordinates are rotated to unitAB and unitBC ...\r\n const vectorA = Vector3d.createAdd2Scaled(unitAB, sA, unitPerpAB, tA);\r\n const vectorB = Vector3d.createAdd2Scaled(unitCB, sB, unitPerpCB, tB);\r\n const uv = Vector2d.create();\r\n if (SmallSystem.linearSystem2d(\r\n unitAB.x, -unitCB.x,\r\n unitAB.y, -unitCB.y,\r\n vectorB.x - vectorA.x, vectorB.y - vectorA.y, uv)) {\r\n const tangencyAB = pointB.plusScaled(unitAB, uv.x);\r\n const tangencyCB = pointB.plusScaled(unitCB, uv.y);\r\n const frameA = Transform.createOriginAndMatrixColumns(tangencyAB, unitAB, unitPerpAB, Vector3d.unitZ());\r\n const frameB = Transform.createOriginAndMatrixColumns(tangencyCB, unitCB, unitPerpCB, Vector3d.unitZ());\r\n spiralA.tryTransformInPlace(frameA);\r\n spiralB.tryTransformInPlace(frameB);\r\n const rayA1 = spiralA.fractionToPointAndUnitTangent(1.0);\r\n const rayB0 = spiralB.fractionToPointAndUnitTangent(1.0);\r\n rayB0.direction.scaleInPlace(-1.0);\r\n const sweep = rayA1.direction.angleToXY(rayB0.direction);\r\n if (radiusA < 0)\r\n sweep.setRadians(- sweep.radians);\r\n const arc = CurveFactory.createArcPointTangentRadius(rayA1.origin, rayA1.direction, radiusA, undefined, sweep)!;\r\n return [spiralA, arc, spiralB];\r\n }\r\n return undefined;\r\n }\r\n /** Return the intersection point of 3 planes. */\r\n public static planePlaneIntersectionRay(\r\n planeA: PlaneAltitudeEvaluator, planeB: PlaneAltitudeEvaluator): Ray3d | undefined {\r\n const altitudeA = planeA.altitudeXYZ(0, 0, 0);\r\n const altitudeB = planeB.altitudeXYZ(0, 0, 0);\r\n const normalAx = planeA.normalX();\r\n const normalAy = planeA.normalY();\r\n const normalAz = planeA.normalZ();\r\n const normalBx = planeB.normalX();\r\n const normalBy = planeB.normalY();\r\n const normalBz = planeB.normalZ();\r\n const normalCx = Geometry.crossProductXYXY(normalAy, normalAz, normalBy, normalBz);\r\n const normalCy = Geometry.crossProductXYXY(normalAz, normalAx, normalBz, normalBx);\r\n const normalCz = Geometry.crossProductXYXY(normalAx, normalAy, normalBx, normalBy);\r\n const rayOrigin = SmallSystem.linearSystem3d(\r\n normalAx, normalAy, normalAz,\r\n normalBx, normalBy, normalBz,\r\n normalCx, normalCy, normalCz,\r\n -altitudeA, -altitudeB, 0.0);\r\n if (rayOrigin !== undefined) {\r\n return Ray3d.createXYZUVW(rayOrigin.x, rayOrigin.y, rayOrigin.z, normalCx, normalCy, normalCz);\r\n }\r\n return undefined;\r\n }\r\n}\r\n"]}