@itwin/core-geometry 5.5.0-dev.4 → 5.5.0-dev.6
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.
- package/lib/cjs/Geometry.d.ts +7 -0
- package/lib/cjs/Geometry.d.ts.map +1 -1
- package/lib/cjs/Geometry.js +9 -0
- package/lib/cjs/Geometry.js.map +1 -1
- package/lib/cjs/bspline/BSplineCurve.d.ts.map +1 -1
- package/lib/cjs/bspline/BSplineCurve.js +2 -1
- package/lib/cjs/bspline/BSplineCurve.js.map +1 -1
- package/lib/cjs/bspline/BSplineCurveOps.d.ts.map +1 -1
- package/lib/cjs/bspline/BSplineCurveOps.js +4 -1
- package/lib/cjs/bspline/BSplineCurveOps.js.map +1 -1
- package/lib/cjs/bspline/BezierCurve3d.d.ts.map +1 -1
- package/lib/cjs/bspline/BezierCurve3d.js +14 -4
- package/lib/cjs/bspline/BezierCurve3d.js.map +1 -1
- package/lib/cjs/bspline/BezierCurve3dH.d.ts +2 -0
- package/lib/cjs/bspline/BezierCurve3dH.d.ts.map +1 -1
- package/lib/cjs/bspline/BezierCurve3dH.js +19 -3
- package/lib/cjs/bspline/BezierCurve3dH.js.map +1 -1
- package/lib/cjs/bspline/BezierCurveBase.d.ts +8 -2
- package/lib/cjs/bspline/BezierCurveBase.d.ts.map +1 -1
- package/lib/cjs/bspline/BezierCurveBase.js +10 -4
- package/lib/cjs/bspline/BezierCurveBase.js.map +1 -1
- package/lib/cjs/clipping/AlternatingConvexClipTree.js +4 -4
- package/lib/cjs/clipping/AlternatingConvexClipTree.js.map +1 -1
- package/lib/cjs/clipping/ClipPlane.d.ts +0 -3
- package/lib/cjs/clipping/ClipPlane.d.ts.map +1 -1
- package/lib/cjs/clipping/ClipPlane.js +9 -2
- package/lib/cjs/clipping/ClipPlane.js.map +1 -1
- package/lib/cjs/clipping/ClipPrimitive.d.ts +59 -9
- package/lib/cjs/clipping/ClipPrimitive.d.ts.map +1 -1
- package/lib/cjs/clipping/ClipPrimitive.js +124 -55
- package/lib/cjs/clipping/ClipPrimitive.js.map +1 -1
- package/lib/cjs/clipping/ClipUtils.js +1 -1
- package/lib/cjs/clipping/ClipUtils.js.map +1 -1
- package/lib/cjs/clipping/ClipVector.d.ts.map +1 -1
- package/lib/cjs/clipping/ClipVector.js +12 -8
- package/lib/cjs/clipping/ClipVector.js.map +1 -1
- package/lib/cjs/clipping/ConvexClipPlaneSet.d.ts +0 -2
- package/lib/cjs/clipping/ConvexClipPlaneSet.d.ts.map +1 -1
- package/lib/cjs/clipping/ConvexClipPlaneSet.js +19 -18
- package/lib/cjs/clipping/ConvexClipPlaneSet.js.map +1 -1
- package/lib/cjs/clipping/internalContexts/LineStringOffsetClipperContext.d.ts +1 -1
- package/lib/cjs/clipping/internalContexts/LineStringOffsetClipperContext.d.ts.map +1 -1
- package/lib/cjs/clipping/internalContexts/LineStringOffsetClipperContext.js +4 -5
- package/lib/cjs/clipping/internalContexts/LineStringOffsetClipperContext.js.map +1 -1
- package/lib/cjs/core-geometry.d.ts +0 -1
- package/lib/cjs/core-geometry.d.ts.map +1 -1
- package/lib/cjs/core-geometry.js +0 -1
- package/lib/cjs/core-geometry.js.map +1 -1
- package/lib/cjs/curve/Arc3d.js +2 -2
- package/lib/cjs/curve/Arc3d.js.map +1 -1
- package/lib/cjs/curve/CurveChainWithDistanceIndex.d.ts +12 -4
- package/lib/cjs/curve/CurveChainWithDistanceIndex.d.ts.map +1 -1
- package/lib/cjs/curve/CurveChainWithDistanceIndex.js +52 -33
- package/lib/cjs/curve/CurveChainWithDistanceIndex.js.map +1 -1
- package/lib/cjs/curve/CurveCollection.d.ts.map +1 -1
- package/lib/cjs/curve/CurveCollection.js +13 -6
- package/lib/cjs/curve/CurveCollection.js.map +1 -1
- package/lib/cjs/curve/CurveCurve.js +1 -1
- package/lib/cjs/curve/CurveCurve.js.map +1 -1
- package/lib/cjs/curve/CurveFactory.d.ts.map +1 -1
- package/lib/cjs/curve/CurveFactory.js +13 -1
- package/lib/cjs/curve/CurveFactory.js.map +1 -1
- package/lib/cjs/curve/CurveLocationDetail.d.ts +12 -4
- package/lib/cjs/curve/CurveLocationDetail.d.ts.map +1 -1
- package/lib/cjs/curve/CurveLocationDetail.js +14 -5
- package/lib/cjs/curve/CurveLocationDetail.js.map +1 -1
- package/lib/cjs/curve/CurvePrimitive.d.ts +5 -4
- package/lib/cjs/curve/CurvePrimitive.d.ts.map +1 -1
- package/lib/cjs/curve/CurvePrimitive.js +7 -4
- package/lib/cjs/curve/CurvePrimitive.js.map +1 -1
- package/lib/cjs/curve/LineString3d.d.ts +25 -16
- package/lib/cjs/curve/LineString3d.d.ts.map +1 -1
- package/lib/cjs/curve/LineString3d.js +90 -72
- package/lib/cjs/curve/LineString3d.js.map +1 -1
- package/lib/cjs/curve/Path.d.ts +0 -3
- package/lib/cjs/curve/Path.d.ts.map +1 -1
- package/lib/cjs/curve/Path.js +9 -2
- package/lib/cjs/curve/Path.js.map +1 -1
- package/lib/cjs/curve/Query/InOutTests.js.map +1 -1
- package/lib/cjs/curve/Query/PlanarSubdivision.d.ts.map +1 -1
- package/lib/cjs/curve/Query/PlanarSubdivision.js +25 -31
- package/lib/cjs/curve/Query/PlanarSubdivision.js.map +1 -1
- package/lib/cjs/curve/Query/StrokeCountChain.d.ts +7 -1
- package/lib/cjs/curve/Query/StrokeCountChain.d.ts.map +1 -1
- package/lib/cjs/curve/Query/StrokeCountChain.js +27 -36
- package/lib/cjs/curve/Query/StrokeCountChain.js.map +1 -1
- package/lib/cjs/curve/RegionMomentsXY.d.ts.map +1 -1
- package/lib/cjs/curve/RegionMomentsXY.js +7 -1
- package/lib/cjs/curve/RegionMomentsXY.js.map +1 -1
- package/lib/cjs/curve/RegionOps.d.ts.map +1 -1
- package/lib/cjs/curve/RegionOps.js +8 -5
- package/lib/cjs/curve/RegionOps.js.map +1 -1
- package/lib/cjs/curve/RegionOpsClassificationSweeps.d.ts.map +1 -1
- package/lib/cjs/curve/RegionOpsClassificationSweeps.js +6 -6
- package/lib/cjs/curve/RegionOpsClassificationSweeps.js.map +1 -1
- package/lib/cjs/curve/internalContexts/AnnounceTangentStrokeHandler.d.ts.map +1 -1
- package/lib/cjs/curve/internalContexts/AnnounceTangentStrokeHandler.js +4 -1
- package/lib/cjs/curve/internalContexts/AnnounceTangentStrokeHandler.js.map +1 -1
- package/lib/cjs/curve/internalContexts/ClosestPointStrokeHandler.d.ts.map +1 -1
- package/lib/cjs/curve/internalContexts/ClosestPointStrokeHandler.js +6 -1
- package/lib/cjs/curve/internalContexts/ClosestPointStrokeHandler.js.map +1 -1
- package/lib/cjs/curve/internalContexts/CurveCurveCloseApproachXY.d.ts +5 -21
- package/lib/cjs/curve/internalContexts/CurveCurveCloseApproachXY.d.ts.map +1 -1
- package/lib/cjs/curve/internalContexts/CurveCurveCloseApproachXY.js +29 -73
- package/lib/cjs/curve/internalContexts/CurveCurveCloseApproachXY.js.map +1 -1
- package/lib/cjs/curve/internalContexts/CurveCurveIntersectXY.d.ts +55 -13
- package/lib/cjs/curve/internalContexts/CurveCurveIntersectXY.d.ts.map +1 -1
- package/lib/cjs/curve/internalContexts/CurveCurveIntersectXY.js +238 -110
- package/lib/cjs/curve/internalContexts/CurveCurveIntersectXY.js.map +1 -1
- package/lib/cjs/curve/internalContexts/PolygonOffsetContext.js +1 -1
- package/lib/cjs/curve/internalContexts/PolygonOffsetContext.js.map +1 -1
- package/lib/cjs/curve/spiral/DirectSpiral3d.d.ts +1 -4
- package/lib/cjs/curve/spiral/DirectSpiral3d.d.ts.map +1 -1
- package/lib/cjs/curve/spiral/DirectSpiral3d.js +9 -9
- package/lib/cjs/curve/spiral/DirectSpiral3d.js.map +1 -1
- package/lib/cjs/curve/spiral/IntegratedSpiral3d.d.ts +11 -14
- package/lib/cjs/curve/spiral/IntegratedSpiral3d.d.ts.map +1 -1
- package/lib/cjs/curve/spiral/IntegratedSpiral3d.js +18 -18
- package/lib/cjs/curve/spiral/IntegratedSpiral3d.js.map +1 -1
- package/lib/cjs/curve/spiral/TransitionConditionalProperties.d.ts +7 -1
- package/lib/cjs/curve/spiral/TransitionConditionalProperties.d.ts.map +1 -1
- package/lib/cjs/curve/spiral/TransitionConditionalProperties.js.map +1 -1
- package/lib/cjs/geometry3d/Ellipsoid.d.ts +19 -7
- package/lib/cjs/geometry3d/Ellipsoid.d.ts.map +1 -1
- package/lib/cjs/geometry3d/Ellipsoid.js +26 -11
- package/lib/cjs/geometry3d/Ellipsoid.js.map +1 -1
- package/lib/cjs/geometry3d/FrustumAnimation.d.ts.map +1 -1
- package/lib/cjs/geometry3d/FrustumAnimation.js +11 -1
- package/lib/cjs/geometry3d/FrustumAnimation.js.map +1 -1
- package/lib/cjs/geometry3d/GrowableFloat64Array.d.ts +5 -1
- package/lib/cjs/geometry3d/GrowableFloat64Array.d.ts.map +1 -1
- package/lib/cjs/geometry3d/GrowableFloat64Array.js +11 -1
- package/lib/cjs/geometry3d/GrowableFloat64Array.js.map +1 -1
- package/lib/cjs/geometry3d/GrowableXYArray.d.ts +1 -1
- package/lib/cjs/geometry3d/GrowableXYArray.js +1 -1
- package/lib/cjs/geometry3d/GrowableXYArray.js.map +1 -1
- package/lib/cjs/geometry3d/GrowableXYZArray.d.ts +49 -8
- package/lib/cjs/geometry3d/GrowableXYZArray.d.ts.map +1 -1
- package/lib/cjs/geometry3d/GrowableXYZArray.js +90 -37
- package/lib/cjs/geometry3d/GrowableXYZArray.js.map +1 -1
- package/lib/cjs/geometry3d/IndexedXYZCollection.d.ts +100 -3
- package/lib/cjs/geometry3d/IndexedXYZCollection.d.ts.map +1 -1
- package/lib/cjs/geometry3d/IndexedXYZCollection.js +125 -0
- package/lib/cjs/geometry3d/IndexedXYZCollection.js.map +1 -1
- package/lib/cjs/geometry3d/Matrix3d.d.ts +10 -1
- package/lib/cjs/geometry3d/Matrix3d.d.ts.map +1 -1
- package/lib/cjs/geometry3d/Matrix3d.js +53 -34
- package/lib/cjs/geometry3d/Matrix3d.js.map +1 -1
- package/lib/cjs/geometry3d/Plane3dByOriginAndUnitNormal.js +1 -1
- package/lib/cjs/geometry3d/Plane3dByOriginAndUnitNormal.js.map +1 -1
- package/lib/cjs/geometry3d/Point3dArrayCarrier.d.ts +49 -2
- package/lib/cjs/geometry3d/Point3dArrayCarrier.d.ts.map +1 -1
- package/lib/cjs/geometry3d/Point3dArrayCarrier.js +67 -9
- package/lib/cjs/geometry3d/Point3dArrayCarrier.js.map +1 -1
- package/lib/cjs/geometry3d/Point3dVector3d.d.ts +1 -1
- package/lib/cjs/geometry3d/Point3dVector3d.js +1 -1
- package/lib/cjs/geometry3d/Point3dVector3d.js.map +1 -1
- package/lib/cjs/geometry3d/PointStreaming.js +1 -1
- package/lib/cjs/geometry3d/PointStreaming.js.map +1 -1
- package/lib/cjs/geometry3d/PolygonOps.d.ts +24 -32
- package/lib/cjs/geometry3d/PolygonOps.d.ts.map +1 -1
- package/lib/cjs/geometry3d/PolygonOps.js +147 -180
- package/lib/cjs/geometry3d/PolygonOps.js.map +1 -1
- package/lib/cjs/geometry3d/PolylineCompressionByEdgeOffset.js +5 -5
- package/lib/cjs/geometry3d/PolylineCompressionByEdgeOffset.js.map +1 -1
- package/lib/cjs/geometry3d/PolylineOps.d.ts.map +1 -1
- package/lib/cjs/geometry3d/PolylineOps.js +13 -3
- package/lib/cjs/geometry3d/PolylineOps.js.map +1 -1
- package/lib/cjs/geometry3d/Range.js.map +1 -1
- package/lib/cjs/geometry3d/Ray3d.d.ts +0 -3
- package/lib/cjs/geometry3d/Ray3d.d.ts.map +1 -1
- package/lib/cjs/geometry3d/Ray3d.js +5 -1
- package/lib/cjs/geometry3d/Ray3d.js.map +1 -1
- package/lib/cjs/geometry3d/SortablePolygon.d.ts +2 -2
- package/lib/cjs/geometry3d/SortablePolygon.d.ts.map +1 -1
- package/lib/cjs/geometry3d/SortablePolygon.js +14 -18
- package/lib/cjs/geometry3d/SortablePolygon.js.map +1 -1
- package/lib/cjs/geometry3d/Transform.d.ts +8 -0
- package/lib/cjs/geometry3d/Transform.d.ts.map +1 -1
- package/lib/cjs/geometry3d/Transform.js +15 -9
- package/lib/cjs/geometry3d/Transform.js.map +1 -1
- package/lib/cjs/numerics/ClusterableArray.d.ts +4 -2
- package/lib/cjs/numerics/ClusterableArray.d.ts.map +1 -1
- package/lib/cjs/numerics/ClusterableArray.js +6 -4
- package/lib/cjs/numerics/ClusterableArray.js.map +1 -1
- package/lib/cjs/numerics/Newton.d.ts +3 -1
- package/lib/cjs/numerics/Newton.d.ts.map +1 -1
- package/lib/cjs/numerics/Newton.js +5 -1
- package/lib/cjs/numerics/Newton.js.map +1 -1
- package/lib/cjs/polyface/AuxData.d.ts +1 -4
- package/lib/cjs/polyface/AuxData.d.ts.map +1 -1
- package/lib/cjs/polyface/AuxData.js +5 -1
- package/lib/cjs/polyface/AuxData.js.map +1 -1
- package/lib/cjs/polyface/GreedyTriangulationBetweenLineStrings.js +3 -3
- package/lib/cjs/polyface/GreedyTriangulationBetweenLineStrings.js.map +1 -1
- package/lib/cjs/polyface/Polyface.d.ts.map +1 -1
- package/lib/cjs/polyface/Polyface.js +14 -16
- package/lib/cjs/polyface/Polyface.js.map +1 -1
- package/lib/cjs/polyface/PolyfaceBuilder.d.ts +84 -28
- package/lib/cjs/polyface/PolyfaceBuilder.d.ts.map +1 -1
- package/lib/cjs/polyface/PolyfaceBuilder.js +277 -217
- package/lib/cjs/polyface/PolyfaceBuilder.js.map +1 -1
- package/lib/cjs/polyface/PolyfaceClip.d.ts +4 -3
- package/lib/cjs/polyface/PolyfaceClip.d.ts.map +1 -1
- package/lib/cjs/polyface/PolyfaceClip.js +11 -4
- package/lib/cjs/polyface/PolyfaceClip.js.map +1 -1
- package/lib/cjs/polyface/PolyfaceData.js.map +1 -1
- package/lib/cjs/polyface/PolyfaceQuery.d.ts.map +1 -1
- package/lib/cjs/polyface/PolyfaceQuery.js +9 -7
- package/lib/cjs/polyface/PolyfaceQuery.js.map +1 -1
- package/lib/cjs/polyface/RangeTree/LineString3dRangeTreeContext.d.ts.map +1 -1
- package/lib/cjs/polyface/RangeTree/LineString3dRangeTreeContext.js +3 -2
- package/lib/cjs/polyface/RangeTree/LineString3dRangeTreeContext.js.map +1 -1
- package/lib/cjs/polyface/RangeTree/RangeTreeNode.d.ts +1 -1
- package/lib/cjs/polyface/RangeTree/RangeTreeNode.js +2 -2
- package/lib/cjs/polyface/RangeTree/RangeTreeNode.js.map +1 -1
- package/lib/cjs/polyface/RangeTree/RangeTreeSearchHandlers.d.ts.map +1 -1
- package/lib/cjs/polyface/RangeTree/RangeTreeSearchHandlers.js +14 -12
- package/lib/cjs/polyface/RangeTree/RangeTreeSearchHandlers.js.map +1 -1
- package/lib/cjs/polyface/multiclip/BuildAverageNormalsContext.d.ts +1 -1
- package/lib/cjs/polyface/multiclip/BuildAverageNormalsContext.d.ts.map +1 -1
- package/lib/cjs/polyface/multiclip/BuildAverageNormalsContext.js +10 -6
- package/lib/cjs/polyface/multiclip/BuildAverageNormalsContext.js.map +1 -1
- package/lib/cjs/polyface/multiclip/OffsetMeshContext.js +4 -3
- package/lib/cjs/polyface/multiclip/OffsetMeshContext.js.map +1 -1
- package/lib/cjs/polyface/multiclip/SweepLineStringToFacetContext.d.ts.map +1 -1
- package/lib/cjs/polyface/multiclip/SweepLineStringToFacetContext.js +3 -5
- package/lib/cjs/polyface/multiclip/SweepLineStringToFacetContext.js.map +1 -1
- package/lib/cjs/polyface/multiclip/XYPointBuckets.d.ts +1 -1
- package/lib/cjs/polyface/multiclip/XYPointBuckets.d.ts.map +1 -1
- package/lib/cjs/polyface/multiclip/XYPointBuckets.js +4 -8
- package/lib/cjs/polyface/multiclip/XYPointBuckets.js.map +1 -1
- package/lib/cjs/serialization/BGFBAccessors.d.ts.map +1 -1
- package/lib/cjs/serialization/BGFBAccessors.js +1 -0
- package/lib/cjs/serialization/BGFBAccessors.js.map +1 -1
- package/lib/cjs/serialization/BGFBReader.d.ts.map +1 -1
- package/lib/cjs/serialization/BGFBReader.js +37 -7
- package/lib/cjs/serialization/BGFBReader.js.map +1 -1
- package/lib/cjs/serialization/BGFBWriter.d.ts +4 -4
- package/lib/cjs/serialization/BGFBWriter.d.ts.map +1 -1
- package/lib/cjs/serialization/BGFBWriter.js +24 -40
- package/lib/cjs/serialization/BGFBWriter.js.map +1 -1
- package/lib/cjs/serialization/IModelJsonSchema.d.ts.map +1 -1
- package/lib/cjs/serialization/IModelJsonSchema.js +9 -3
- package/lib/cjs/serialization/IModelJsonSchema.js.map +1 -1
- package/lib/cjs/serialization/SerializationHelpers.d.ts +0 -3
- package/lib/cjs/serialization/SerializationHelpers.d.ts.map +1 -1
- package/lib/cjs/serialization/SerializationHelpers.js +16 -7
- package/lib/cjs/serialization/SerializationHelpers.js.map +1 -1
- package/lib/cjs/solid/Box.d.ts +2 -2
- package/lib/cjs/solid/Box.d.ts.map +1 -1
- package/lib/cjs/solid/Box.js.map +1 -1
- package/lib/cjs/solid/Cone.d.ts +3 -2
- package/lib/cjs/solid/Cone.d.ts.map +1 -1
- package/lib/cjs/solid/Cone.js +4 -1
- package/lib/cjs/solid/Cone.js.map +1 -1
- package/lib/cjs/solid/LinearSweep.d.ts +1 -1
- package/lib/cjs/solid/LinearSweep.d.ts.map +1 -1
- package/lib/cjs/solid/LinearSweep.js +1 -1
- package/lib/cjs/solid/LinearSweep.js.map +1 -1
- package/lib/cjs/solid/RotationalSweep.d.ts.map +1 -1
- package/lib/cjs/solid/RotationalSweep.js +1 -3
- package/lib/cjs/solid/RotationalSweep.js.map +1 -1
- package/lib/cjs/solid/TorusPipe.d.ts +4 -3
- package/lib/cjs/solid/TorusPipe.d.ts.map +1 -1
- package/lib/cjs/solid/TorusPipe.js.map +1 -1
- package/lib/cjs/topology/ChainMerge.d.ts +4 -4
- package/lib/cjs/topology/ChainMerge.d.ts.map +1 -1
- package/lib/cjs/topology/ChainMerge.js +11 -1
- package/lib/cjs/topology/ChainMerge.js.map +1 -1
- package/lib/cjs/topology/Graph.d.ts +2 -0
- package/lib/cjs/topology/Graph.d.ts.map +1 -1
- package/lib/cjs/topology/Graph.js +5 -0
- package/lib/cjs/topology/Graph.js.map +1 -1
- package/lib/cjs/topology/HalfEdgeGraphSearch.d.ts.map +1 -1
- package/lib/cjs/topology/HalfEdgeGraphSearch.js +2 -0
- package/lib/cjs/topology/HalfEdgeGraphSearch.js.map +1 -1
- package/lib/cjs/topology/HalfEdgePointInGraphSearch.d.ts.map +1 -1
- package/lib/cjs/topology/HalfEdgePointInGraphSearch.js +23 -16
- package/lib/cjs/topology/HalfEdgePointInGraphSearch.js.map +1 -1
- package/lib/cjs/topology/HalfEdgePositionDetail.d.ts +20 -9
- package/lib/cjs/topology/HalfEdgePositionDetail.d.ts.map +1 -1
- package/lib/cjs/topology/HalfEdgePositionDetail.js +17 -13
- package/lib/cjs/topology/HalfEdgePositionDetail.js.map +1 -1
- package/lib/cjs/topology/HalfEdgePriorityQueue.d.ts.map +1 -1
- package/lib/cjs/topology/HalfEdgePriorityQueue.js +3 -1
- package/lib/cjs/topology/HalfEdgePriorityQueue.js.map +1 -1
- package/lib/cjs/topology/InsertAndRetriangulateContext.d.ts +6 -2
- package/lib/cjs/topology/InsertAndRetriangulateContext.d.ts.map +1 -1
- package/lib/cjs/topology/InsertAndRetriangulateContext.js +41 -35
- package/lib/cjs/topology/InsertAndRetriangulateContext.js.map +1 -1
- package/lib/cjs/topology/MaskManager.d.ts +7 -3
- package/lib/cjs/topology/MaskManager.d.ts.map +1 -1
- package/lib/cjs/topology/MaskManager.js +10 -4
- package/lib/cjs/topology/MaskManager.js.map +1 -1
- package/lib/cjs/topology/RegularizeFace.d.ts.map +1 -1
- package/lib/cjs/topology/RegularizeFace.js.map +1 -1
- package/lib/cjs/topology/Triangulation.d.ts +2 -1
- package/lib/cjs/topology/Triangulation.d.ts.map +1 -1
- package/lib/cjs/topology/Triangulation.js +12 -7
- package/lib/cjs/topology/Triangulation.js.map +1 -1
- package/lib/esm/Geometry.d.ts +7 -0
- package/lib/esm/Geometry.d.ts.map +1 -1
- package/lib/esm/Geometry.js +9 -0
- package/lib/esm/Geometry.js.map +1 -1
- package/lib/esm/bspline/BSplineCurve.d.ts.map +1 -1
- package/lib/esm/bspline/BSplineCurve.js +2 -1
- package/lib/esm/bspline/BSplineCurve.js.map +1 -1
- package/lib/esm/bspline/BSplineCurveOps.d.ts.map +1 -1
- package/lib/esm/bspline/BSplineCurveOps.js +4 -1
- package/lib/esm/bspline/BSplineCurveOps.js.map +1 -1
- package/lib/esm/bspline/BezierCurve3d.d.ts.map +1 -1
- package/lib/esm/bspline/BezierCurve3d.js +14 -4
- package/lib/esm/bspline/BezierCurve3d.js.map +1 -1
- package/lib/esm/bspline/BezierCurve3dH.d.ts +2 -0
- package/lib/esm/bspline/BezierCurve3dH.d.ts.map +1 -1
- package/lib/esm/bspline/BezierCurve3dH.js +19 -3
- package/lib/esm/bspline/BezierCurve3dH.js.map +1 -1
- package/lib/esm/bspline/BezierCurveBase.d.ts +8 -2
- package/lib/esm/bspline/BezierCurveBase.d.ts.map +1 -1
- package/lib/esm/bspline/BezierCurveBase.js +10 -4
- package/lib/esm/bspline/BezierCurveBase.js.map +1 -1
- package/lib/esm/clipping/AlternatingConvexClipTree.js +4 -4
- package/lib/esm/clipping/AlternatingConvexClipTree.js.map +1 -1
- package/lib/esm/clipping/ClipPlane.d.ts +0 -3
- package/lib/esm/clipping/ClipPlane.d.ts.map +1 -1
- package/lib/esm/clipping/ClipPlane.js +9 -2
- package/lib/esm/clipping/ClipPlane.js.map +1 -1
- package/lib/esm/clipping/ClipPrimitive.d.ts +59 -9
- package/lib/esm/clipping/ClipPrimitive.d.ts.map +1 -1
- package/lib/esm/clipping/ClipPrimitive.js +124 -55
- package/lib/esm/clipping/ClipPrimitive.js.map +1 -1
- package/lib/esm/clipping/ClipUtils.js +1 -1
- package/lib/esm/clipping/ClipUtils.js.map +1 -1
- package/lib/esm/clipping/ClipVector.d.ts.map +1 -1
- package/lib/esm/clipping/ClipVector.js +12 -8
- package/lib/esm/clipping/ClipVector.js.map +1 -1
- package/lib/esm/clipping/ConvexClipPlaneSet.d.ts +0 -2
- package/lib/esm/clipping/ConvexClipPlaneSet.d.ts.map +1 -1
- package/lib/esm/clipping/ConvexClipPlaneSet.js +20 -19
- package/lib/esm/clipping/ConvexClipPlaneSet.js.map +1 -1
- package/lib/esm/clipping/internalContexts/LineStringOffsetClipperContext.d.ts +1 -1
- package/lib/esm/clipping/internalContexts/LineStringOffsetClipperContext.d.ts.map +1 -1
- package/lib/esm/clipping/internalContexts/LineStringOffsetClipperContext.js +4 -5
- package/lib/esm/clipping/internalContexts/LineStringOffsetClipperContext.js.map +1 -1
- package/lib/esm/core-geometry.d.ts +0 -1
- package/lib/esm/core-geometry.d.ts.map +1 -1
- package/lib/esm/core-geometry.js +0 -1
- package/lib/esm/core-geometry.js.map +1 -1
- package/lib/esm/curve/Arc3d.js +2 -2
- package/lib/esm/curve/Arc3d.js.map +1 -1
- package/lib/esm/curve/CurveChainWithDistanceIndex.d.ts +12 -4
- package/lib/esm/curve/CurveChainWithDistanceIndex.d.ts.map +1 -1
- package/lib/esm/curve/CurveChainWithDistanceIndex.js +53 -34
- package/lib/esm/curve/CurveChainWithDistanceIndex.js.map +1 -1
- package/lib/esm/curve/CurveCollection.d.ts.map +1 -1
- package/lib/esm/curve/CurveCollection.js +13 -6
- package/lib/esm/curve/CurveCollection.js.map +1 -1
- package/lib/esm/curve/CurveCurve.js +1 -1
- package/lib/esm/curve/CurveCurve.js.map +1 -1
- package/lib/esm/curve/CurveFactory.d.ts.map +1 -1
- package/lib/esm/curve/CurveFactory.js +13 -1
- package/lib/esm/curve/CurveFactory.js.map +1 -1
- package/lib/esm/curve/CurveLocationDetail.d.ts +12 -4
- package/lib/esm/curve/CurveLocationDetail.d.ts.map +1 -1
- package/lib/esm/curve/CurveLocationDetail.js +14 -5
- package/lib/esm/curve/CurveLocationDetail.js.map +1 -1
- package/lib/esm/curve/CurvePrimitive.d.ts +5 -4
- package/lib/esm/curve/CurvePrimitive.d.ts.map +1 -1
- package/lib/esm/curve/CurvePrimitive.js +7 -4
- package/lib/esm/curve/CurvePrimitive.js.map +1 -1
- package/lib/esm/curve/LineString3d.d.ts +25 -16
- package/lib/esm/curve/LineString3d.d.ts.map +1 -1
- package/lib/esm/curve/LineString3d.js +90 -72
- package/lib/esm/curve/LineString3d.js.map +1 -1
- package/lib/esm/curve/Path.d.ts +0 -3
- package/lib/esm/curve/Path.d.ts.map +1 -1
- package/lib/esm/curve/Path.js +9 -2
- package/lib/esm/curve/Path.js.map +1 -1
- package/lib/esm/curve/Query/InOutTests.js.map +1 -1
- package/lib/esm/curve/Query/PlanarSubdivision.d.ts.map +1 -1
- package/lib/esm/curve/Query/PlanarSubdivision.js +25 -31
- package/lib/esm/curve/Query/PlanarSubdivision.js.map +1 -1
- package/lib/esm/curve/Query/StrokeCountChain.d.ts +7 -1
- package/lib/esm/curve/Query/StrokeCountChain.d.ts.map +1 -1
- package/lib/esm/curve/Query/StrokeCountChain.js +27 -36
- package/lib/esm/curve/Query/StrokeCountChain.js.map +1 -1
- package/lib/esm/curve/RegionMomentsXY.d.ts.map +1 -1
- package/lib/esm/curve/RegionMomentsXY.js +7 -1
- package/lib/esm/curve/RegionMomentsXY.js.map +1 -1
- package/lib/esm/curve/RegionOps.d.ts.map +1 -1
- package/lib/esm/curve/RegionOps.js +8 -5
- package/lib/esm/curve/RegionOps.js.map +1 -1
- package/lib/esm/curve/RegionOpsClassificationSweeps.d.ts.map +1 -1
- package/lib/esm/curve/RegionOpsClassificationSweeps.js +6 -6
- package/lib/esm/curve/RegionOpsClassificationSweeps.js.map +1 -1
- package/lib/esm/curve/internalContexts/AnnounceTangentStrokeHandler.d.ts.map +1 -1
- package/lib/esm/curve/internalContexts/AnnounceTangentStrokeHandler.js +4 -1
- package/lib/esm/curve/internalContexts/AnnounceTangentStrokeHandler.js.map +1 -1
- package/lib/esm/curve/internalContexts/ClosestPointStrokeHandler.d.ts.map +1 -1
- package/lib/esm/curve/internalContexts/ClosestPointStrokeHandler.js +6 -1
- package/lib/esm/curve/internalContexts/ClosestPointStrokeHandler.js.map +1 -1
- package/lib/esm/curve/internalContexts/CurveCurveCloseApproachXY.d.ts +5 -21
- package/lib/esm/curve/internalContexts/CurveCurveCloseApproachXY.d.ts.map +1 -1
- package/lib/esm/curve/internalContexts/CurveCurveCloseApproachXY.js +29 -73
- package/lib/esm/curve/internalContexts/CurveCurveCloseApproachXY.js.map +1 -1
- package/lib/esm/curve/internalContexts/CurveCurveIntersectXY.d.ts +55 -13
- package/lib/esm/curve/internalContexts/CurveCurveIntersectXY.d.ts.map +1 -1
- package/lib/esm/curve/internalContexts/CurveCurveIntersectXY.js +239 -111
- package/lib/esm/curve/internalContexts/CurveCurveIntersectXY.js.map +1 -1
- package/lib/esm/curve/internalContexts/PolygonOffsetContext.js +1 -1
- package/lib/esm/curve/internalContexts/PolygonOffsetContext.js.map +1 -1
- package/lib/esm/curve/spiral/DirectSpiral3d.d.ts +1 -4
- package/lib/esm/curve/spiral/DirectSpiral3d.d.ts.map +1 -1
- package/lib/esm/curve/spiral/DirectSpiral3d.js +9 -9
- package/lib/esm/curve/spiral/DirectSpiral3d.js.map +1 -1
- package/lib/esm/curve/spiral/IntegratedSpiral3d.d.ts +11 -14
- package/lib/esm/curve/spiral/IntegratedSpiral3d.d.ts.map +1 -1
- package/lib/esm/curve/spiral/IntegratedSpiral3d.js +18 -18
- package/lib/esm/curve/spiral/IntegratedSpiral3d.js.map +1 -1
- package/lib/esm/curve/spiral/TransitionConditionalProperties.d.ts +7 -1
- package/lib/esm/curve/spiral/TransitionConditionalProperties.d.ts.map +1 -1
- package/lib/esm/curve/spiral/TransitionConditionalProperties.js.map +1 -1
- package/lib/esm/geometry3d/Ellipsoid.d.ts +19 -7
- package/lib/esm/geometry3d/Ellipsoid.d.ts.map +1 -1
- package/lib/esm/geometry3d/Ellipsoid.js +26 -11
- package/lib/esm/geometry3d/Ellipsoid.js.map +1 -1
- package/lib/esm/geometry3d/FrustumAnimation.d.ts.map +1 -1
- package/lib/esm/geometry3d/FrustumAnimation.js +11 -1
- package/lib/esm/geometry3d/FrustumAnimation.js.map +1 -1
- package/lib/esm/geometry3d/GrowableFloat64Array.d.ts +5 -1
- package/lib/esm/geometry3d/GrowableFloat64Array.d.ts.map +1 -1
- package/lib/esm/geometry3d/GrowableFloat64Array.js +11 -1
- package/lib/esm/geometry3d/GrowableFloat64Array.js.map +1 -1
- package/lib/esm/geometry3d/GrowableXYArray.d.ts +1 -1
- package/lib/esm/geometry3d/GrowableXYArray.js +1 -1
- package/lib/esm/geometry3d/GrowableXYArray.js.map +1 -1
- package/lib/esm/geometry3d/GrowableXYZArray.d.ts +49 -8
- package/lib/esm/geometry3d/GrowableXYZArray.d.ts.map +1 -1
- package/lib/esm/geometry3d/GrowableXYZArray.js +90 -37
- package/lib/esm/geometry3d/GrowableXYZArray.js.map +1 -1
- package/lib/esm/geometry3d/IndexedXYZCollection.d.ts +100 -3
- package/lib/esm/geometry3d/IndexedXYZCollection.d.ts.map +1 -1
- package/lib/esm/geometry3d/IndexedXYZCollection.js +125 -0
- package/lib/esm/geometry3d/IndexedXYZCollection.js.map +1 -1
- package/lib/esm/geometry3d/Matrix3d.d.ts +10 -1
- package/lib/esm/geometry3d/Matrix3d.d.ts.map +1 -1
- package/lib/esm/geometry3d/Matrix3d.js +53 -34
- package/lib/esm/geometry3d/Matrix3d.js.map +1 -1
- package/lib/esm/geometry3d/Plane3dByOriginAndUnitNormal.js +1 -1
- package/lib/esm/geometry3d/Plane3dByOriginAndUnitNormal.js.map +1 -1
- package/lib/esm/geometry3d/Point3dArrayCarrier.d.ts +49 -2
- package/lib/esm/geometry3d/Point3dArrayCarrier.d.ts.map +1 -1
- package/lib/esm/geometry3d/Point3dArrayCarrier.js +67 -9
- package/lib/esm/geometry3d/Point3dArrayCarrier.js.map +1 -1
- package/lib/esm/geometry3d/Point3dVector3d.d.ts +1 -1
- package/lib/esm/geometry3d/Point3dVector3d.js +1 -1
- package/lib/esm/geometry3d/Point3dVector3d.js.map +1 -1
- package/lib/esm/geometry3d/PointStreaming.js +1 -1
- package/lib/esm/geometry3d/PointStreaming.js.map +1 -1
- package/lib/esm/geometry3d/PolygonOps.d.ts +24 -32
- package/lib/esm/geometry3d/PolygonOps.d.ts.map +1 -1
- package/lib/esm/geometry3d/PolygonOps.js +147 -180
- package/lib/esm/geometry3d/PolygonOps.js.map +1 -1
- package/lib/esm/geometry3d/PolylineCompressionByEdgeOffset.js +5 -5
- package/lib/esm/geometry3d/PolylineCompressionByEdgeOffset.js.map +1 -1
- package/lib/esm/geometry3d/PolylineOps.d.ts.map +1 -1
- package/lib/esm/geometry3d/PolylineOps.js +13 -3
- package/lib/esm/geometry3d/PolylineOps.js.map +1 -1
- package/lib/esm/geometry3d/Range.js.map +1 -1
- package/lib/esm/geometry3d/Ray3d.d.ts +0 -3
- package/lib/esm/geometry3d/Ray3d.d.ts.map +1 -1
- package/lib/esm/geometry3d/Ray3d.js +5 -1
- package/lib/esm/geometry3d/Ray3d.js.map +1 -1
- package/lib/esm/geometry3d/SortablePolygon.d.ts +2 -2
- package/lib/esm/geometry3d/SortablePolygon.d.ts.map +1 -1
- package/lib/esm/geometry3d/SortablePolygon.js +14 -18
- package/lib/esm/geometry3d/SortablePolygon.js.map +1 -1
- package/lib/esm/geometry3d/Transform.d.ts +8 -0
- package/lib/esm/geometry3d/Transform.d.ts.map +1 -1
- package/lib/esm/geometry3d/Transform.js +15 -9
- package/lib/esm/geometry3d/Transform.js.map +1 -1
- package/lib/esm/numerics/ClusterableArray.d.ts +4 -2
- package/lib/esm/numerics/ClusterableArray.d.ts.map +1 -1
- package/lib/esm/numerics/ClusterableArray.js +6 -4
- package/lib/esm/numerics/ClusterableArray.js.map +1 -1
- package/lib/esm/numerics/Newton.d.ts +3 -1
- package/lib/esm/numerics/Newton.d.ts.map +1 -1
- package/lib/esm/numerics/Newton.js +5 -1
- package/lib/esm/numerics/Newton.js.map +1 -1
- package/lib/esm/polyface/AuxData.d.ts +1 -4
- package/lib/esm/polyface/AuxData.d.ts.map +1 -1
- package/lib/esm/polyface/AuxData.js +5 -1
- package/lib/esm/polyface/AuxData.js.map +1 -1
- package/lib/esm/polyface/GreedyTriangulationBetweenLineStrings.js +3 -3
- package/lib/esm/polyface/GreedyTriangulationBetweenLineStrings.js.map +1 -1
- package/lib/esm/polyface/Polyface.d.ts.map +1 -1
- package/lib/esm/polyface/Polyface.js +14 -16
- package/lib/esm/polyface/Polyface.js.map +1 -1
- package/lib/esm/polyface/PolyfaceBuilder.d.ts +84 -28
- package/lib/esm/polyface/PolyfaceBuilder.d.ts.map +1 -1
- package/lib/esm/polyface/PolyfaceBuilder.js +277 -217
- package/lib/esm/polyface/PolyfaceBuilder.js.map +1 -1
- package/lib/esm/polyface/PolyfaceClip.d.ts +4 -3
- package/lib/esm/polyface/PolyfaceClip.d.ts.map +1 -1
- package/lib/esm/polyface/PolyfaceClip.js +11 -4
- package/lib/esm/polyface/PolyfaceClip.js.map +1 -1
- package/lib/esm/polyface/PolyfaceData.js.map +1 -1
- package/lib/esm/polyface/PolyfaceQuery.d.ts.map +1 -1
- package/lib/esm/polyface/PolyfaceQuery.js +9 -7
- package/lib/esm/polyface/PolyfaceQuery.js.map +1 -1
- package/lib/esm/polyface/RangeTree/LineString3dRangeTreeContext.d.ts.map +1 -1
- package/lib/esm/polyface/RangeTree/LineString3dRangeTreeContext.js +3 -2
- package/lib/esm/polyface/RangeTree/LineString3dRangeTreeContext.js.map +1 -1
- package/lib/esm/polyface/RangeTree/RangeTreeNode.d.ts +1 -1
- package/lib/esm/polyface/RangeTree/RangeTreeNode.js +2 -2
- package/lib/esm/polyface/RangeTree/RangeTreeNode.js.map +1 -1
- package/lib/esm/polyface/RangeTree/RangeTreeSearchHandlers.d.ts.map +1 -1
- package/lib/esm/polyface/RangeTree/RangeTreeSearchHandlers.js +14 -12
- package/lib/esm/polyface/RangeTree/RangeTreeSearchHandlers.js.map +1 -1
- package/lib/esm/polyface/multiclip/BuildAverageNormalsContext.d.ts +1 -1
- package/lib/esm/polyface/multiclip/BuildAverageNormalsContext.d.ts.map +1 -1
- package/lib/esm/polyface/multiclip/BuildAverageNormalsContext.js +10 -6
- package/lib/esm/polyface/multiclip/BuildAverageNormalsContext.js.map +1 -1
- package/lib/esm/polyface/multiclip/OffsetMeshContext.js +4 -3
- package/lib/esm/polyface/multiclip/OffsetMeshContext.js.map +1 -1
- package/lib/esm/polyface/multiclip/SweepLineStringToFacetContext.d.ts.map +1 -1
- package/lib/esm/polyface/multiclip/SweepLineStringToFacetContext.js +3 -5
- package/lib/esm/polyface/multiclip/SweepLineStringToFacetContext.js.map +1 -1
- package/lib/esm/polyface/multiclip/XYPointBuckets.d.ts +1 -1
- package/lib/esm/polyface/multiclip/XYPointBuckets.d.ts.map +1 -1
- package/lib/esm/polyface/multiclip/XYPointBuckets.js +4 -8
- package/lib/esm/polyface/multiclip/XYPointBuckets.js.map +1 -1
- package/lib/esm/serialization/BGFBAccessors.d.ts.map +1 -1
- package/lib/esm/serialization/BGFBAccessors.js +1 -0
- package/lib/esm/serialization/BGFBAccessors.js.map +1 -1
- package/lib/esm/serialization/BGFBReader.d.ts.map +1 -1
- package/lib/esm/serialization/BGFBReader.js +37 -7
- package/lib/esm/serialization/BGFBReader.js.map +1 -1
- package/lib/esm/serialization/BGFBWriter.d.ts +4 -4
- package/lib/esm/serialization/BGFBWriter.d.ts.map +1 -1
- package/lib/esm/serialization/BGFBWriter.js +24 -40
- package/lib/esm/serialization/BGFBWriter.js.map +1 -1
- package/lib/esm/serialization/IModelJsonSchema.d.ts.map +1 -1
- package/lib/esm/serialization/IModelJsonSchema.js +9 -3
- package/lib/esm/serialization/IModelJsonSchema.js.map +1 -1
- package/lib/esm/serialization/SerializationHelpers.d.ts +0 -3
- package/lib/esm/serialization/SerializationHelpers.d.ts.map +1 -1
- package/lib/esm/serialization/SerializationHelpers.js +16 -7
- package/lib/esm/serialization/SerializationHelpers.js.map +1 -1
- package/lib/esm/solid/Box.d.ts +2 -2
- package/lib/esm/solid/Box.d.ts.map +1 -1
- package/lib/esm/solid/Box.js.map +1 -1
- package/lib/esm/solid/Cone.d.ts +3 -2
- package/lib/esm/solid/Cone.d.ts.map +1 -1
- package/lib/esm/solid/Cone.js +4 -1
- package/lib/esm/solid/Cone.js.map +1 -1
- package/lib/esm/solid/LinearSweep.d.ts +1 -1
- package/lib/esm/solid/LinearSweep.d.ts.map +1 -1
- package/lib/esm/solid/LinearSweep.js +1 -1
- package/lib/esm/solid/LinearSweep.js.map +1 -1
- package/lib/esm/solid/RotationalSweep.d.ts.map +1 -1
- package/lib/esm/solid/RotationalSweep.js +1 -3
- package/lib/esm/solid/RotationalSweep.js.map +1 -1
- package/lib/esm/solid/TorusPipe.d.ts +4 -3
- package/lib/esm/solid/TorusPipe.d.ts.map +1 -1
- package/lib/esm/solid/TorusPipe.js.map +1 -1
- package/lib/esm/topology/ChainMerge.d.ts +4 -4
- package/lib/esm/topology/ChainMerge.d.ts.map +1 -1
- package/lib/esm/topology/ChainMerge.js +11 -1
- package/lib/esm/topology/ChainMerge.js.map +1 -1
- package/lib/esm/topology/Graph.d.ts +2 -0
- package/lib/esm/topology/Graph.d.ts.map +1 -1
- package/lib/esm/topology/Graph.js +5 -0
- package/lib/esm/topology/Graph.js.map +1 -1
- package/lib/esm/topology/HalfEdgeGraphSearch.d.ts.map +1 -1
- package/lib/esm/topology/HalfEdgeGraphSearch.js +2 -0
- package/lib/esm/topology/HalfEdgeGraphSearch.js.map +1 -1
- package/lib/esm/topology/HalfEdgePointInGraphSearch.d.ts.map +1 -1
- package/lib/esm/topology/HalfEdgePointInGraphSearch.js +23 -16
- package/lib/esm/topology/HalfEdgePointInGraphSearch.js.map +1 -1
- package/lib/esm/topology/HalfEdgePositionDetail.d.ts +20 -9
- package/lib/esm/topology/HalfEdgePositionDetail.d.ts.map +1 -1
- package/lib/esm/topology/HalfEdgePositionDetail.js +17 -13
- package/lib/esm/topology/HalfEdgePositionDetail.js.map +1 -1
- package/lib/esm/topology/HalfEdgePriorityQueue.d.ts.map +1 -1
- package/lib/esm/topology/HalfEdgePriorityQueue.js +4 -2
- package/lib/esm/topology/HalfEdgePriorityQueue.js.map +1 -1
- package/lib/esm/topology/InsertAndRetriangulateContext.d.ts +6 -2
- package/lib/esm/topology/InsertAndRetriangulateContext.d.ts.map +1 -1
- package/lib/esm/topology/InsertAndRetriangulateContext.js +41 -35
- package/lib/esm/topology/InsertAndRetriangulateContext.js.map +1 -1
- package/lib/esm/topology/MaskManager.d.ts +7 -3
- package/lib/esm/topology/MaskManager.d.ts.map +1 -1
- package/lib/esm/topology/MaskManager.js +10 -4
- package/lib/esm/topology/MaskManager.js.map +1 -1
- package/lib/esm/topology/RegularizeFace.d.ts.map +1 -1
- package/lib/esm/topology/RegularizeFace.js.map +1 -1
- package/lib/esm/topology/Triangulation.d.ts +2 -1
- package/lib/esm/topology/Triangulation.d.ts.map +1 -1
- package/lib/esm/topology/Triangulation.js +12 -7
- package/lib/esm/topology/Triangulation.js.map +1 -1
- package/package.json +3 -3
- package/lib/cjs/serialization/GeometrySamples.d.ts +0 -705
- package/lib/cjs/serialization/GeometrySamples.d.ts.map +0 -1
- package/lib/cjs/serialization/GeometrySamples.js +0 -2433
- package/lib/cjs/serialization/GeometrySamples.js.map +0 -1
- package/lib/esm/serialization/GeometrySamples.d.ts +0 -705
- package/lib/esm/serialization/GeometrySamples.d.ts.map +0 -1
- package/lib/esm/serialization/GeometrySamples.js +0 -2428
- package/lib/esm/serialization/GeometrySamples.js.map +0 -1
|
@@ -146,9 +146,15 @@ export declare class CurveChainWithDistanceIndex extends CurvePrimitive {
|
|
|
146
146
|
* @returns Returns true if the curve is completely within tolerance of the plane.
|
|
147
147
|
*/
|
|
148
148
|
isInPlane(plane: Plane3dByOriginAndUnitNormal): boolean;
|
|
149
|
-
/**
|
|
149
|
+
/**
|
|
150
|
+
* Return the start point of the chain.
|
|
151
|
+
* * If the chain is empty, a zero point is returned.
|
|
152
|
+
*/
|
|
150
153
|
startPoint(result?: Point3d): Point3d;
|
|
151
|
-
/**
|
|
154
|
+
/**
|
|
155
|
+
* Return the end point of of the chain.
|
|
156
|
+
* * If the chain is empty, a zero point is returned.
|
|
157
|
+
*/
|
|
152
158
|
endPoint(result?: Point3d): Point3d;
|
|
153
159
|
/** Add strokes to caller-supplied linestring */
|
|
154
160
|
emitStrokes(dest: LineString3d, options?: StrokeOptions): void;
|
|
@@ -226,7 +232,7 @@ export declare class CurveChainWithDistanceIndex extends CurvePrimitive {
|
|
|
226
232
|
/**
|
|
227
233
|
* Return the point (x,y,z) on the curve at fractional position along the chain.
|
|
228
234
|
* @param fraction fractional position along the curve.
|
|
229
|
-
* @returns a point on the curve.
|
|
235
|
+
* @returns a point on the curve. If the chain is empty, a zero point is returned.
|
|
230
236
|
*/
|
|
231
237
|
fractionToPoint(fraction: number, result?: Point3d): Point3d;
|
|
232
238
|
/**
|
|
@@ -237,6 +243,7 @@ export declare class CurveChainWithDistanceIndex extends CurvePrimitive {
|
|
|
237
243
|
* @param fraction fractional position along the geometry.
|
|
238
244
|
* @param result optional receiver for the result.
|
|
239
245
|
* @returns a ray whose origin is the curve point and direction is the derivative with respect to the fraction.
|
|
246
|
+
* If the chain is empty, a zero ray is returned.
|
|
240
247
|
*/
|
|
241
248
|
fractionToPointAndDerivative(fraction: number, result?: Ray3d): Ray3d;
|
|
242
249
|
/**
|
|
@@ -247,7 +254,7 @@ export declare class CurveChainWithDistanceIndex extends CurvePrimitive {
|
|
|
247
254
|
* @param fraction fractional position on the curve
|
|
248
255
|
* @param result optional receiver for the result.
|
|
249
256
|
* @returns a ray whose origin is the curve point and direction is the normalized derivative with respect to
|
|
250
|
-
* the fraction.
|
|
257
|
+
* the fraction. If the chain is empty, a zero ray is returned.
|
|
251
258
|
*/
|
|
252
259
|
fractionToPointAndUnitTangent(fraction: number, result?: Ray3d): Ray3d;
|
|
253
260
|
/**
|
|
@@ -279,6 +286,7 @@ export declare class CurveChainWithDistanceIndex extends CurvePrimitive {
|
|
|
279
286
|
* * See `CurvePrimitive.moveSignedDistanceFromFraction` for parameter details.
|
|
280
287
|
* * The returned location directly identifies fractional position along the CurveChainWithDistanceIndex and
|
|
281
288
|
* has pointer to an additional detail for the child curve.
|
|
289
|
+
* * If the chain is empty, return a default CurveLocationDetail whose `curveSearchStatus` member indicates error.
|
|
282
290
|
*/
|
|
283
291
|
moveSignedDistanceFromFraction(startFraction: number, signedDistance: number, allowExtension: boolean, result?: CurveLocationDetail): CurveLocationDetail;
|
|
284
292
|
/**
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"CurveChainWithDistanceIndex.d.ts","sourceRoot":"","sources":["../../../src/curve/CurveChainWithDistanceIndex.ts"],"names":[],"mappings":"AASA,OAAO,EAAE,cAAc,EAAE,MAAM,yBAAyB,CAAC;AACzD,OAAO,EAAE,cAAc,EAAE,MAAM,+BAA+B,CAAC;AAE/D,OAAO,EAAE,eAAe,EAAE,cAAc,EAAE,MAAM,+BAA+B,CAAC;AAChF,OAAO,EAAE,4BAA4B,EAAE,MAAM,4CAA4C,CAAC;AAC1F,OAAO,EAAE,yBAAyB,EAAE,MAAM,yCAAyC,CAAC;AACpF,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAClE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AACvD,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAC5C,OAAO,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AACpD,OAAO,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AAC/C,OAAO,EAAuC,2BAA2B,EAAE,MAAM,mBAAmB,CAAC;AACrG,OAAO,EAAE,mBAAmB,EAAE,uBAAuB,
|
|
1
|
+
{"version":3,"file":"CurveChainWithDistanceIndex.d.ts","sourceRoot":"","sources":["../../../src/curve/CurveChainWithDistanceIndex.ts"],"names":[],"mappings":"AASA,OAAO,EAAE,cAAc,EAAE,MAAM,yBAAyB,CAAC;AACzD,OAAO,EAAE,cAAc,EAAE,MAAM,+BAA+B,CAAC;AAE/D,OAAO,EAAE,eAAe,EAAE,cAAc,EAAE,MAAM,+BAA+B,CAAC;AAChF,OAAO,EAAE,4BAA4B,EAAE,MAAM,4CAA4C,CAAC;AAC1F,OAAO,EAAE,yBAAyB,EAAE,MAAM,yCAAyC,CAAC;AACpF,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAClE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AACvD,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAC5C,OAAO,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AACpD,OAAO,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AAC/C,OAAO,EAAuC,2BAA2B,EAAE,MAAM,mBAAmB,CAAC;AACrG,OAAO,EAAE,mBAAmB,EAAE,uBAAuB,EAAqB,MAAM,uBAAuB,CAAC;AACxG,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAEhD,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAC9C,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAChD,OAAO,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAC9B,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAEhD;;;;;;GAMG;AACH,qBAAa,YAAY;IACvB,oDAAoD;IAC7C,cAAc,EAAE,MAAM,CAAC;IAC9B,kDAAkD;IAC3C,cAAc,EAAE,MAAM,CAAC;IAC9B,8FAA8F;IACvF,cAAc,EAAE,MAAM,CAAC;IAC9B,4FAA4F;IACrF,cAAc,EAAE,MAAM,CAAC;IAC9B,2GAA2G;IACpG,UAAU,EAAE,cAAc,CAAC;IAClC,qBAAqB;IACd,KAAK,CAAC,EAAE,OAAO,CAAC;IACvB,uCAAuC;IAChC,CAAC,EAAE,MAAM,CAAC;IACjB,0EAA0E;gBAExE,cAAc,EAAE,MAAM,EACtB,cAAc,EAAE,MAAM,EACtB,SAAS,EAAE,MAAM,EACjB,SAAS,EAAE,MAAM,EACjB,UAAU,EAAE,cAAc,EAC1B,KAAK,CAAC,EAAE,OAAO;IAUjB,kFAAkF;IAC3E,qBAAqB,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO;IAGvD;;;;OAIG;IACI,4BAA4B,CAAC,UAAU,EAAE,OAAO,GAAG,MAAM;IAQhE;;;OAGG;WACW,8BAA8B,CAAC,SAAS,EAAE,YAAY,EAAE,EAAE,UAAU,EAAE,OAAO,GAAG,YAAY,EAAE;IAS5G,gFAAgF;IACzE,kCAAkC,CAAC,KAAK,EAAE,cAAc,EAAE,QAAQ,EAAE,MAAM,GAAG,OAAO;IAG3F;;;OAGG;IACI,wCAAwC,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM;IAYzE;;;;;;;OAOG;IACI,oCAAoC,CAAC,aAAa,EAAE,MAAM,EAAE,kBAAkB,CAAC,EAAE,OAAO,GAAG,MAAM;IAMxG;;;OAGG;IACI,mBAAmB,CAAC,cAAc,EAAE,MAAM,GAAG,MAAM;IAG1D;;;;;OAKG;IACI,4BAA4B,CAAC,aAAa,EAAE,MAAM;IAUzD;;;;OAIG;IACI,4BAA4B,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM;CAM9D;AAiED;;;;;;;;;;GAUG;AACH,qBAAa,2BAA4B,SAAQ,cAAc;IAC7D,wCAAwC;IACxC,SAAgB,kBAAkB,iCAAiC;IACnE,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAO;IAC7B,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAiB;IAC5C,OAAO,CAAC,QAAQ,CAAC,YAAY,CAAS;IACtC,OAAO,CAAC,MAAM,CAAC,SAAS,CAAK;IAC7B,OAAO,CAAC,MAAM,CAAC,UAAU,CAAK;IAC9B,OAAO,CAAC,MAAM,CAAC,YAAY,CAAK;IAChC,OAAO,CAAC,MAAM,CAAC,aAAa,CAAK;IACjC,yDAAyD;IAClD,mBAAmB,CAAC,KAAK,EAAE,aAAa,GAAG,OAAO;IAIzD,OAAO;IAMP;;;;OAIG;IACI,gBAAgB,CAAC,SAAS,EAAE,SAAS,EAAE,OAAO,CAAC,EAAE,aAAa,GAAG,2BAA2B,GAAG,SAAS;IAM/G;;;OAGG;IACH,IAAW,IAAI,IAAI,IAAI,CAEtB;IACD;;;OAGG;IACH,IAAW,SAAS,IAAI,YAAY,EAAE,CAErC;IACD;;;OAGG;IACI,KAAK,CAAC,OAAO,CAAC,EAAE,aAAa,GAAG,2BAA2B;IAIlE;;;;;;;OAOG;IACa,iBAAiB,CAAC,SAAS,EAAE,MAAM,GAAG,mBAAmB,EAAE,SAAS,EAAE,MAAM,GAAG,mBAAmB,EAAE,OAAO,CAAC,EAAE,aAAa,GAAG,2BAA2B,GAAG,SAAS;IAkErL;;;OAGG;IACI,SAAS,CAAC,KAAK,EAAE,4BAA4B,GAAG,OAAO;IAO9D;;;OAGG;IACa,UAAU,CAAC,MAAM,CAAC,EAAE,OAAO,GAAG,OAAO;IAKrD;;;OAGG;IACa,QAAQ,CAAC,MAAM,CAAC,EAAE,OAAO,GAAG,OAAO;IAKnD,gDAAgD;IACzC,WAAW,CAAC,IAAI,EAAE,YAAY,EAAE,OAAO,CAAC,EAAE,aAAa,GAAG,IAAI;IAKrE;;;OAGG;IACI,kBAAkB,CAAC,IAAI,EAAE,cAAc,EAAE,OAAO,CAAC,EAAE,aAAa,GAAG,IAAI;IAK9E;;;OAGG;IACI,4BAA4B,CAAC,OAAO,CAAC,EAAE,aAAa,GAAG,MAAM;IAOpE;;;;;;OAMG;IACa,wBAAwB,CACtC,cAAc,EAAE,cAAc,EAAE,EAAE,0BAA0B,GAAE,OAAe,EAAE,kBAAkB,GAAE,OAAe,GACjH,IAAI;IASP;;;;OAIG;IACa,qCAAqC,CAAC,OAAO,CAAC,EAAE,aAAa,EAAE,eAAe,CAAC,EAAE,cAAc;IAO/G;;;OAGG;IACI,yBAAyB,CAAC,OAAO,EAAE,eAAe,GAAG,GAAG;IAG/D,wFAAwF;IACjF,WAAW,CAAC,aAAa,EAAE,OAAO,EAAE,SAAS,CAAC,EAAE,SAAS,GAAG,IAAI;IAGvE,6FAA6F;IAC7E,2BAA2B,CAAC,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,MAAM;IAGzF;;MAEE;IACF,OAAO,CAAC,MAAM,CAAC,mBAAmB;IAclC;;;;OAIG;WACW,aAAa,CAAC,IAAI,EAAE,UAAU,EAAE,OAAO,CAAC,EAAE,aAAa,GAAG,2BAA2B;IAKnG;;;;;OAKG;IACI,uBAAuB,CAAC,QAAQ,EAAE,MAAM,EAAE,kBAAkB,GAAE,OAAe,GAAG,YAAY,GAAG,SAAS;IAM/G;;;;;OAKG;IACH,SAAS,CAAC,4BAA4B,CAAC,QAAQ,EAAE,MAAM,EAAE,kBAAkB,GAAE,OAAe,GAAG,MAAM,GAAG,SAAS;IAiBjH;;;OAGG;IACI,4BAA4B,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM;IAG7D,4GAA4G;IACrG,+BAA+B,CAAC,KAAK,EAAE,cAAc,EAAE,QAAQ,EAAE,MAAM,GAAG,YAAY,GAAG,SAAS;IAgBzG,gDAAgD;IAChC,WAAW,IAAI,MAAM;IAGrC;;;OAGG;IACI,WAAW,IAAI,MAAM;IAG5B;;;;OAIG;IACI,eAAe,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,OAAO,GAAG,OAAO;IASnE;;;;;;;;;OASG;IACI,4BAA4B,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,KAAK,GAAG,KAAK;IAiB5E;;;;;;;;;OASG;IACa,6BAA6B,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,KAAK,GAAG,KAAK;IAWtF;;;;;;;OAOG;IACa,8BAA8B,CAC5C,QAAQ,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,yBAAyB,GACnD,yBAAyB,GAAG,SAAS;IA0BxC;;;;;OAKG;IACI,mBAAmB,CAAC,SAAS,EAAE,SAAS,GAAG,OAAO;IAQzD,gGAAgG;IACzF,cAAc,IAAI,IAAI;IAO7B;;;;OAIG;IACa,aAAa,CAAC,KAAK,EAAE,aAAa,GAAG,OAAO;IAM5D;;;;;;OAMG;IACa,8BAA8B,CAC5C,aAAa,EAAE,MAAM,EAAE,cAAc,EAAE,MAAM,EAAE,cAAc,EAAE,OAAO,EAAE,MAAM,CAAC,EAAE,mBAAmB,GACnG,mBAAmB;IAmBtB;;;;;;;;OAQG;WACW,yBAAyB,CACrC,KAAK,GAAE,OAAc,GACpB;QAAE,QAAQ,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,MAAM,CAAC;QAAC,WAAW,EAAE,MAAM,CAAC;QAAC,YAAY,EAAE,MAAM,CAAA;KAAE;IAYrF;;;;;;;;;;OAUG;IACa,YAAY,CAAC,UAAU,EAAE,OAAO,EAAE,MAAM,EAAE,2BAA2B,EAAE,MAAM,CAAC,EAAE,mBAAmB,GAAG,mBAAmB,GAAG,SAAS;IA0CrJ;;;;;OAKG;IACa,iBAAiB,CAC/B,uBAAuB,EAAE,MAAM,GAAG,aAAa,GAC9C,cAAc,GAAG,cAAc,EAAE,GAAG,SAAS;IAchD;;;;;;;OAOG;IACa,uBAAuB,CAAC,GAAG,EAAE,QAAQ,GAAG,KAAK,EAAE,OAAO,CAAC,EAAE,OAAO,GAAG,OAAO,GAAG,SAAS;IAGtG;;;;;;OAMG;IACI,kBAAkB,CAAC,WAAW,EAAE,mBAAmB,EAAE,MAAM,CAAC,EAAE,mBAAmB,GAAG,mBAAmB,GAAG,SAAS;IAc1H;;;;;;;;;;;OAWG;WACW,+BAA+B,CAC3C,KAAK,EAAE,uBAAuB,EAAE,EAChC,MAAM,EAAE,MAAM,EACd,MAAM,CAAC,EAAE,2BAA2B,EACpC,MAAM,CAAC,EAAE,2BAA2B,EACpC,gBAAgB,CAAC,EAAE,OAAO,GACzB,uBAAuB,EAAE;CAkB7B"}
|
|
@@ -14,6 +14,7 @@ const StrokeCountMap_1 = require("../curve/Query/StrokeCountMap");
|
|
|
14
14
|
const Geometry_1 = require("../Geometry");
|
|
15
15
|
const Point3dVector3d_1 = require("../geometry3d/Point3dVector3d");
|
|
16
16
|
const Range_1 = require("../geometry3d/Range");
|
|
17
|
+
const Ray3d_1 = require("../geometry3d/Ray3d");
|
|
17
18
|
const CurveExtendMode_1 = require("./CurveExtendMode");
|
|
18
19
|
const CurveLocationDetail_1 = require("./CurveLocationDetail");
|
|
19
20
|
const PlaneAltitudeRangeContext_1 = require("./internalContexts/PlaneAltitudeRangeContext");
|
|
@@ -90,7 +91,9 @@ class PathFragment {
|
|
|
90
91
|
* Note that proportional calculation does NOT account for non-uniform parameterization in the child curve.
|
|
91
92
|
*/
|
|
92
93
|
chainDistanceToInterpolatedChildFraction(distance) {
|
|
93
|
-
|
|
94
|
+
const childFraction = Geometry_1.Geometry.inverseInterpolate(this.childFraction0, this.chainDistance0, this.childFraction1, this.chainDistance1, distance, this.childFraction0);
|
|
95
|
+
(0, core_bentley_1.assert)(childFraction !== undefined, "expect never undefined because defaultResult is defined");
|
|
96
|
+
return childFraction;
|
|
94
97
|
}
|
|
95
98
|
/**
|
|
96
99
|
* Convert the given chainDistance to a fraction along this childCurve using `moveSignedDistanceFromFraction`.
|
|
@@ -284,10 +287,10 @@ class CurveChainWithDistanceIndex extends CurvePrimitive_1.CurvePrimitive {
|
|
|
284
287
|
const chainDistanceA = chainFractionA * this._totalLength;
|
|
285
288
|
const chainDistanceB = chainFractionB * this._totalLength;
|
|
286
289
|
const fragmentA = this.chainDistanceToFragment(chainDistanceA, true);
|
|
287
|
-
if (
|
|
290
|
+
if (!fragmentA)
|
|
288
291
|
return undefined;
|
|
289
292
|
const fragmentB = this.chainDistanceToFragment(chainDistanceB, true);
|
|
290
|
-
if (
|
|
293
|
+
if (!fragmentB)
|
|
291
294
|
return undefined;
|
|
292
295
|
const childCurveIndexA = this._path.childIndex(fragmentA.childCurve, true);
|
|
293
296
|
if (undefined === childCurveIndexA)
|
|
@@ -347,19 +350,23 @@ class CurveChainWithDistanceIndex extends CurvePrimitive_1.CurvePrimitive {
|
|
|
347
350
|
}
|
|
348
351
|
return true;
|
|
349
352
|
}
|
|
350
|
-
/**
|
|
353
|
+
/**
|
|
354
|
+
* Return the start point of the chain.
|
|
355
|
+
* * If the chain is empty, a zero point is returned.
|
|
356
|
+
*/
|
|
351
357
|
startPoint(result) {
|
|
352
358
|
const c = this._path.cyclicCurvePrimitive(0);
|
|
353
|
-
|
|
354
|
-
|
|
355
|
-
return Point3dVector3d_1.Point3d.createZero(result);
|
|
359
|
+
(0, core_bentley_1.assert)(c !== undefined, "expect non-empty chain. Fix caller if this fails.");
|
|
360
|
+
return c?.startPoint(result) ?? Point3dVector3d_1.Point3d.createZero(result);
|
|
356
361
|
}
|
|
357
|
-
/**
|
|
362
|
+
/**
|
|
363
|
+
* Return the end point of of the chain.
|
|
364
|
+
* * If the chain is empty, a zero point is returned.
|
|
365
|
+
*/
|
|
358
366
|
endPoint(result) {
|
|
359
367
|
const c = this._path.cyclicCurvePrimitive(-1);
|
|
360
|
-
|
|
361
|
-
|
|
362
|
-
return Point3dVector3d_1.Point3d.createZero(result);
|
|
368
|
+
(0, core_bentley_1.assert)(c !== undefined, "expect non-empty chain. Fix caller if this fails.");
|
|
369
|
+
return c?.endPoint(result) ?? Point3dVector3d_1.Point3d.createZero(result);
|
|
363
370
|
}
|
|
364
371
|
/** Add strokes to caller-supplied linestring */
|
|
365
372
|
emitStrokes(dest, options) {
|
|
@@ -476,8 +483,9 @@ class CurveChainWithDistanceIndex extends CurvePrimitive_1.CurvePrimitive {
|
|
|
476
483
|
* distances larger than curve length. If `false` returns `undefined` for those out of bound distances.
|
|
477
484
|
*/
|
|
478
485
|
chainDistanceToFragmentIndex(distance, allowExtrapolation = false) {
|
|
479
|
-
const numFragments = this._fragments.length;
|
|
480
486
|
const fragments = this._fragments;
|
|
487
|
+
const numFragments = fragments.length;
|
|
488
|
+
(0, core_bentley_1.assert)(numFragments > 0, "expect non-empty chain. Fix caller if this fails.");
|
|
481
489
|
if (numFragments > 0) {
|
|
482
490
|
if (distance < 0.0)
|
|
483
491
|
return allowExtrapolation ? 0 : undefined;
|
|
@@ -529,7 +537,7 @@ class CurveChainWithDistanceIndex extends CurvePrimitive_1.CurvePrimitive {
|
|
|
529
537
|
/**
|
|
530
538
|
* Return the point (x,y,z) on the curve at fractional position along the chain.
|
|
531
539
|
* @param fraction fractional position along the curve.
|
|
532
|
-
* @returns a point on the curve.
|
|
540
|
+
* @returns a point on the curve. If the chain is empty, a zero point is returned.
|
|
533
541
|
*/
|
|
534
542
|
fractionToPoint(fraction, result) {
|
|
535
543
|
const distanceAlongPath = fraction * this._totalLength;
|
|
@@ -538,9 +546,7 @@ class CurveChainWithDistanceIndex extends CurvePrimitive_1.CurvePrimitive {
|
|
|
538
546
|
const childFraction = fragment.chainDistanceToAccurateChildFraction(distanceAlongPath, true);
|
|
539
547
|
return fragment.childCurve.fractionToPoint(childFraction, result);
|
|
540
548
|
}
|
|
541
|
-
|
|
542
|
-
// no fragment found. just return the first point on the curve.
|
|
543
|
-
return this._fragments[0].childCurve.fractionToPoint(0.0, result);
|
|
549
|
+
return Point3dVector3d_1.Point3d.createZero(result);
|
|
544
550
|
}
|
|
545
551
|
/**
|
|
546
552
|
* Return the point (x,y,z) and derivative on the curve at fractional position.
|
|
@@ -550,19 +556,22 @@ class CurveChainWithDistanceIndex extends CurvePrimitive_1.CurvePrimitive {
|
|
|
550
556
|
* @param fraction fractional position along the geometry.
|
|
551
557
|
* @param result optional receiver for the result.
|
|
552
558
|
* @returns a ray whose origin is the curve point and direction is the derivative with respect to the fraction.
|
|
559
|
+
* If the chain is empty, a zero ray is returned.
|
|
553
560
|
*/
|
|
554
561
|
fractionToPointAndDerivative(fraction, result) {
|
|
562
|
+
result = Ray3d_1.Ray3d.createZero(result);
|
|
555
563
|
const distanceAlongPath = fraction * this._totalLength;
|
|
556
564
|
const fragment = this.chainDistanceToFragment(distanceAlongPath, true);
|
|
565
|
+
if (!fragment)
|
|
566
|
+
return result;
|
|
557
567
|
const childFraction = fragment.chainDistanceToAccurateChildFraction(distanceAlongPath, true);
|
|
558
|
-
result = fragment.childCurve.fractionToPointAndDerivative(childFraction, result);
|
|
568
|
+
result = fragment.childCurve.fractionToPointAndDerivative(childFraction, result); // C'
|
|
559
569
|
// Recall the standard arclength formula s(t) for the curve C = C(t), with derivative s'(t) = ||C'||.
|
|
560
570
|
// Define fractional arclength for C by f = f(t) = s(t)/L, where L is the total length of C. Then f' = ||C'||/L.
|
|
561
571
|
// Denote the inverse of f by t = t(f). Then C = C(t(f)) is a parameterization of C by its fractional arclength f.
|
|
562
|
-
// Since the derivative of t is t'=1/f'=L/||C'||, the derivative we seek is d/df(C(t(f))) = C' t' = C' L/||C'
|
|
563
|
-
//
|
|
564
|
-
|
|
565
|
-
const a = this._totalLength / result.direction.magnitude(); // L/||C'||
|
|
572
|
+
// Since the derivative of t is t'=1/f'=L/||C'||, the derivative we seek is d/df(C(t(f))) = C' t' = C' L/||C'||,
|
|
573
|
+
// where C' is given by the fragment. More details at core/geometry/internaldocs/Curve.md.
|
|
574
|
+
const a = Geometry_1.Geometry.safeDivideFraction(this._totalLength, result.direction.magnitude(), 0);
|
|
566
575
|
result.direction.scaleInPlace(a);
|
|
567
576
|
return result;
|
|
568
577
|
}
|
|
@@ -574,11 +583,14 @@ class CurveChainWithDistanceIndex extends CurvePrimitive_1.CurvePrimitive {
|
|
|
574
583
|
* @param fraction fractional position on the curve
|
|
575
584
|
* @param result optional receiver for the result.
|
|
576
585
|
* @returns a ray whose origin is the curve point and direction is the normalized derivative with respect to
|
|
577
|
-
* the fraction.
|
|
586
|
+
* the fraction. If the chain is empty, a zero ray is returned.
|
|
578
587
|
*/
|
|
579
588
|
fractionToPointAndUnitTangent(fraction, result) {
|
|
589
|
+
result = Ray3d_1.Ray3d.createZero(result);
|
|
580
590
|
const distanceAlongPath = fraction * this._totalLength;
|
|
581
591
|
const fragment = this.chainDistanceToFragment(distanceAlongPath, true);
|
|
592
|
+
if (!fragment)
|
|
593
|
+
return result;
|
|
582
594
|
const childFraction = fragment.chainDistanceToAccurateChildFraction(distanceAlongPath, true);
|
|
583
595
|
result = fragment.childCurve.fractionToPointAndDerivative(childFraction, result);
|
|
584
596
|
result.direction.normalizeInPlace();
|
|
@@ -595,8 +607,10 @@ class CurveChainWithDistanceIndex extends CurvePrimitive_1.CurvePrimitive {
|
|
|
595
607
|
fractionToPointAnd2Derivatives(fraction, result) {
|
|
596
608
|
const distanceAlongPath = fraction * this._totalLength;
|
|
597
609
|
const fragment = this.chainDistanceToFragment(distanceAlongPath, true);
|
|
610
|
+
if (!fragment)
|
|
611
|
+
return undefined;
|
|
598
612
|
const childFraction = fragment.chainDistanceToAccurateChildFraction(distanceAlongPath, true);
|
|
599
|
-
result = fragment.childCurve.fractionToPointAnd2Derivatives(childFraction, result);
|
|
613
|
+
result = fragment.childCurve.fractionToPointAnd2Derivatives(childFraction, result); // C', C"
|
|
600
614
|
if (!result)
|
|
601
615
|
return undefined;
|
|
602
616
|
// See fractionToPointAndDerivative, where we show d/df(C(t(f))) = L C'/||C'||.
|
|
@@ -605,16 +619,15 @@ class CurveChainWithDistanceIndex extends CurvePrimitive_1.CurvePrimitive {
|
|
|
605
619
|
// d2/df2(C(t(f))) = L d/df(C'/||C'||) = L (||C'|| d/df(C') - C' d/df||C'||) / ||C'||^2
|
|
606
620
|
// = L (||C'|| C" L/||C'|| - C' C'.C"/||C'|| L/||C'||) / ||C'||^2
|
|
607
621
|
// = (L/||C'||)^2 (C" - C' C'.C"/C'.C' ), where C' and C" are given by the fragment.
|
|
608
|
-
//
|
|
609
|
-
|
|
610
|
-
|
|
611
|
-
const
|
|
612
|
-
const
|
|
613
|
-
|
|
614
|
-
|
|
615
|
-
|
|
616
|
-
result.
|
|
617
|
-
result.vectorV.scaleInPlace(scale * scale); // scale vectorV by (L/||C'(t)||)^2
|
|
622
|
+
// More details at core/geometry/internaldocs/Curve.md.
|
|
623
|
+
const magU = result.vectorU.magnitude();
|
|
624
|
+
const dotUU = magU * magU;
|
|
625
|
+
const dotUV = result.vectorU.dotProduct(result.vectorV);
|
|
626
|
+
const a = Geometry_1.Geometry.safeDivideFraction(-dotUV, dotUU, 0);
|
|
627
|
+
result.vectorV.addScaledInPlace(result.vectorU, a);
|
|
628
|
+
const b = Geometry_1.Geometry.safeDivideFraction(this._totalLength, magU, 0);
|
|
629
|
+
result.vectorU.scaleInPlace(b);
|
|
630
|
+
result.vectorV.scaleInPlace(b * b);
|
|
618
631
|
return result;
|
|
619
632
|
}
|
|
620
633
|
/**
|
|
@@ -655,11 +668,17 @@ class CurveChainWithDistanceIndex extends CurvePrimitive_1.CurvePrimitive {
|
|
|
655
668
|
* * See `CurvePrimitive.moveSignedDistanceFromFraction` for parameter details.
|
|
656
669
|
* * The returned location directly identifies fractional position along the CurveChainWithDistanceIndex and
|
|
657
670
|
* has pointer to an additional detail for the child curve.
|
|
671
|
+
* * If the chain is empty, return a default CurveLocationDetail whose `curveSearchStatus` member indicates error.
|
|
658
672
|
*/
|
|
659
673
|
moveSignedDistanceFromFraction(startFraction, signedDistance, allowExtension, result) {
|
|
660
674
|
const distanceA = startFraction * this._totalLength;
|
|
661
675
|
const distanceB = distanceA + signedDistance;
|
|
662
676
|
const fragmentB = this.chainDistanceToFragment(distanceB, true);
|
|
677
|
+
if (!fragmentB) {
|
|
678
|
+
result = CurveLocationDetail_1.CurveLocationDetail.create(undefined, result);
|
|
679
|
+
result.curveSearchStatus = CurveLocationDetail_1.CurveSearchStatus.error;
|
|
680
|
+
return result;
|
|
681
|
+
}
|
|
663
682
|
const childDetail = fragmentB.childCurve.moveSignedDistanceFromFraction(fragmentB.childFraction0, distanceB - fragmentB.chainDistance0, allowExtension, result?.childDetail); // local detail related to the child curve
|
|
664
683
|
const endFraction = startFraction + (signedDistance / this._totalLength);
|
|
665
684
|
const chainDetail = CurveLocationDetail_1.CurveLocationDetail.createConditionalMoveSignedDistance(allowExtension, this, startFraction, endFraction, signedDistance, result); // global detail related to the curve chain
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"CurveChainWithDistanceIndex.js","sourceRoot":"","sources":["../../../src/curve/CurveChainWithDistanceIndex.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F;;GAEG;AACH,sDAA6C;AAC7C,4DAAyD;AACzD,kEAA+D;AAC/D,0CAAuC;AAIvC,mEAAkE;AAClE,+CAAuD;AAIvD,uDAAqG;AACrG,+DAAqF;AAErF,4FAAyF;AAEzF,mDAAgD;AAChD,iCAA8B;AAG9B;;;;;;GAMG;AACH,MAAa,YAAY;IACvB,oDAAoD;IAC7C,cAAc,CAAS;IAC9B,kDAAkD;IAC3C,cAAc,CAAS;IAC9B,8FAA8F;IACvF,cAAc,CAAS;IAC9B,4FAA4F;IACrF,cAAc,CAAS;IAC9B,2GAA2G;IACpG,UAAU,CAAiB;IAClC,qBAAqB;IACd,KAAK,CAAW;IACvB,uCAAuC;IAChC,CAAC,CAAS;IACjB,0EAA0E;IAC1E,YACE,cAAsB,EACtB,cAAsB,EACtB,SAAiB,EACjB,SAAiB,EACjB,UAA0B,EAC1B,KAAe;QAEf,IAAI,CAAC,cAAc,GAAG,cAAc,CAAC;QACrC,IAAI,CAAC,cAAc,GAAG,cAAc,CAAC;QACrC,IAAI,CAAC,cAAc,GAAG,SAAS,CAAC;QAChC,IAAI,CAAC,cAAc,GAAG,SAAS,CAAC;QAChC,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;QAC7B,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;IACb,CAAC;IACD,kFAAkF;IAC3E,qBAAqB,CAAC,QAAgB;QAC3C,OAAO,QAAQ,IAAI,IAAI,CAAC,cAAc,IAAI,QAAQ,IAAI,IAAI,CAAC,cAAc,CAAC;IAC5E,CAAC;IACD;;;;OAIG;IACI,4BAA4B,CAAC,UAAmB;QACrD,IAAI,IAAI,CAAC,KAAK;YACZ,OAAO,IAAI,CAAC,KAAK,CAAC,eAAe,CAAC,UAAU,CAAC,CAAC;QAChD,MAAM,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC,YAAY,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;QAC/D,IAAI,MAAM;YACR,OAAO,MAAM,CAAC,CAAC,CAAC;QAClB,OAAO,CAAC,CAAC;IACX,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,8BAA8B,CAAC,SAAyB,EAAE,UAAmB;QACzF,MAAM,eAAe,GAAmB,EAAE,CAAC;QAC3C,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;YAC7B,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,4BAA4B,CAAC,UAAU,CAAC,CAAC;YACvD,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC7B,CAAC;QACD,eAAe,CAAC,IAAI,CAAC,CAAC,KAAmB,EAAE,KAAmB,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACtF,OAAO,eAAe,CAAC;IACzB,CAAC;IACD,gFAAgF;IACzE,kCAAkC,CAAC,KAAqB,EAAE,QAAgB;QAC/E,OAAO,IAAI,CAAC,UAAU,KAAK,KAAK,IAAI,QAAQ,IAAI,IAAI,CAAC,cAAc,IAAI,QAAQ,IAAI,IAAI,CAAC,cAAc,CAAC;IACzG,CAAC;IACD;;;OAGG;IACI,wCAAwC,CAAC,QAAgB;QAC9D,OAAO,mBAAQ,CAAC,kBAAkB,CAChC,IAAI,CAAC,cAAc,EACnB,IAAI,CAAC,cAAc,EACnB,IAAI,CAAC,cAAc,EACnB,IAAI,CAAC,cAAc,EACnB,QAAQ,EACR,IAAI,CAAC,cAAc,CACnB,CAAC,CAAC,mEAAmE;IACzE,CAAC;IACD;;;;;;;OAOG;IACI,oCAAoC,CAAC,aAAqB,EAAE,kBAA4B;QAC7F,MAAM,WAAW,GAAG,IAAI,CAAC,UAAU,CAAC,8BAA8B,CAChE,IAAI,CAAC,cAAc,EAAE,aAAa,GAAG,IAAI,CAAC,cAAc,EAAE,kBAAkB,IAAI,KAAK,CACtF,CAAC;QACF,OAAO,WAAW,CAAC,QAAQ,CAAC;IAC9B,CAAC;IACD;;;OAGG;IACI,mBAAmB,CAAC,cAAsB;QAC/C,OAAO,cAAc,GAAG,CAAC,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC,cAAc,CAAC,CAAC;IACpH,CAAC;IACD;;;;;OAKG;IACI,4BAA4B,CAAC,aAAqB;QACvD,MAAM,EAAE,GAAG,IAAI,CAAC,cAAc,CAAC;QAC/B,MAAM,EAAE,GAAG,IAAI,CAAC,cAAc,CAAC;QAC/B,MAAM,EAAE,GAAG,IAAI,CAAC,cAAc,CAAC;QAC/B,MAAM,EAAE,GAAG,IAAI,CAAC,cAAc,CAAC;QAC/B,IAAI,CAAC,cAAc,GAAG,GAAG,GAAG,EAAE,CAAC;QAC/B,IAAI,CAAC,cAAc,GAAG,GAAG,GAAG,EAAE,CAAC;QAC/B,IAAI,CAAC,cAAc,GAAG,aAAa,GAAG,EAAE,CAAC;QACzC,IAAI,CAAC,cAAc,GAAG,aAAa,GAAG,EAAE,CAAC;IAC3C,CAAC;IACD;;;;OAIG;IACI,4BAA4B,CAAC,QAAgB;QAClD,IAAI,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,2BAA2B,CAAC,IAAI,CAAC,cAAc,EAAE,QAAQ,CAAC,CAAC;QACnF,IAAI,QAAQ,GAAG,IAAI,CAAC,cAAc;YAChC,CAAC,GAAG,CAAC,CAAC,CAAC;QACT,OAAO,IAAI,CAAC,cAAc,GAAG,CAAC,CAAC;IACjC,CAAC;CACF;AAhID,oCAgIC;AAED,0EAA0E;AAC1E,MAAM,gCAAgC;IAC5B,UAAU,CAAiB;IAC3B,oBAAoB,CAAS;IACrC;QACE,IAAI,CAAC,oBAAoB,GAAG,CAAC,CAAC;QAC9B,IAAI,CAAC,UAAU,GAAG,EAAE,CAAC;IACvB,CAAC;IACD,0EAA0E;IACnE,yBAAyB,CAAC,GAAmB,IAAI,CAAC;IAClD,mBAAmB,CAAC,GAAmB,IAAI,CAAC;IAC5C,uBAAuB,CAAC,GAAmB,IAAI,CAAC;IAChD,iBAAiB,CAAC,GAAmB,IAAI,CAAC;IAC1C,oBAAoB,CAAC,IAAa,EAAE,SAAiB,EAAE,QAAkB,IAAI,CAAC;IAC9E,uBAAuB,CAC5B,EAAkB,EAAE,MAAe,EAAE,MAAe,EAAE,UAAkB,EAAE,SAAiB,EAAE,SAAiB;QAE9G,MAAM,cAAc,GAAG,MAAM,CAAC,KAAK,EAAE,CAAC;QACtC,MAAM,cAAc,GAAG,MAAM,CAAC,KAAK,EAAE,CAAC;QACtC,IAAI,EAAE,GAAG,IAAI,CAAC,oBAAoB,CAAC;QACnC,IAAI,UAAU,IAAI,CAAC,EAAE,CAAC;YACpB,IAAI,CAAC,oBAAoB,IAAI,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;YACrD,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,YAAY,CAAC,SAAS,EAAE,SAAS,EAAE,EAAE,EAAE,IAAI,CAAC,oBAAoB,EAAE,EAAE,EAC3F,eAAO,CAAC,MAAM,CAAC,cAAc,EAAE,cAAc,CAAC,CAAC,CAAC,CAAC;QACrD,CAAC;aAAM,CAAC;YACN,IAAI,EAAE,CAAC;YACP,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,SAAS,EAAE,CAAC,IAAI,UAAU,EAAE,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,CAAC;gBAC9D,EAAE,GAAG,mBAAQ,CAAC,WAAW,CAAC,SAAS,EAAE,CAAC,GAAG,UAAU,EAAE,SAAS,CAAC,CAAC;gBAChE,MAAM,CAAC,WAAW,CAAC,EAAE,EAAE,MAAM,EAAE,cAAc,CAAC,CAAC;gBAC/C,EAAE,GAAG,IAAI,CAAC,oBAAoB,CAAC;gBAC/B,IAAI,CAAC,oBAAoB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC;gBAC3E,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,YAAY,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,oBAAoB,EAAE,EAAE,EAC7E,eAAO,CAAC,MAAM,CAAC,cAAc,EAAE,cAAc,CAAC,CAAC,CAAC,CAAC;gBACnD,cAAc,CAAC,OAAO,CAAC,cAAc,CAAC,CAAC;YACzC,CAAC;QACH,CAAC;IACH,CAAC;IACM,qCAAqC,CAC1C,EAAkB,EAAE,UAAkB,EAAE,SAAiB,EAAE,SAAiB;QAE5E,IAAI,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;QACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,SAAS,EAAE,CAAC,IAAI,UAAU,EAAE,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,CAAC;YAC9D,EAAE,GAAG,mBAAQ,CAAC,WAAW,CAAC,SAAS,EAAE,CAAC,GAAG,UAAU,EAAE,SAAS,CAAC,CAAC;YAChE,CAAC,GAAG,EAAE,CAAC,2BAA2B,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YAC3C,EAAE,GAAG,IAAI,CAAC,oBAAoB,CAAC;YAC/B,IAAI,CAAC,oBAAoB,IAAI,CAAC,CAAC;YAC/B,MAAM,KAAK,GAAG,EAAE,CAAC,qBAAqB,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YAC/C,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,YAAY,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,oBAAoB,EAAE,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC;QAC3F,CAAC;IACH,CAAC;IACM,6BAA6B;QAClC,OAAO,IAAI,CAAC;IACd,CAAC;IACD,8DAA8D;IACvD,MAAM,CAAC,uBAAuB,CAAC,IAAgB,EAAE,OAAuB;QAC7E,MAAM,OAAO,GAAG,IAAI,gCAAgC,EAAE,CAAC;QACvD,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAClC,KAAK,CAAC,kBAAkB,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;QAC7C,CAAC;QACD,MAAM,SAAS,GAAG,OAAO,CAAC,UAAU,CAAC;QACrC,OAAO,SAAS,CAAC;IACnB,CAAC;CACF;AACD;;;;;;;;;;GAUG;AACH,MAAa,2BAA4B,SAAQ,+BAAc;IAC7D,wCAAwC;IACxB,kBAAkB,GAAG,6BAA6B,CAAC;IAClD,KAAK,CAAO;IACZ,UAAU,CAAiB;IAC3B,YAAY,CAAS,CAAC,oCAAoC;IACnE,MAAM,CAAC,SAAS,GAAG,CAAC,CAAC;IACrB,MAAM,CAAC,UAAU,GAAG,CAAC,CAAC;IACtB,MAAM,CAAC,YAAY,GAAG,CAAC,CAAC;IACxB,MAAM,CAAC,aAAa,GAAG,CAAC,CAAC;IACjC,yDAAyD;IAClD,mBAAmB,CAAC,KAAoB;QAC7C,OAAO,KAAK,YAAY,2BAA2B,CAAC;IACtD,CAAC;IACD,4FAA4F;IAC5F,YAAoB,IAAgB,EAAE,SAAyB;QAC7D,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,KAAK,GAAG,IAAI,YAAY,WAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,WAAI,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,oCAAoC;QAC9G,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;QAC5B,IAAI,CAAC,YAAY,GAAG,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC;IAChG,CAAC;IACD;;;;OAIG;IACI,gBAAgB,CAAC,SAAoB,EAAE,OAAuB;QACnE,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,EAAU,CAAC;QACrC,IAAI,CAAC,CAAC,mBAAmB,CAAC,SAAS,CAAC;YAClC,OAAO,2BAA2B,CAAC,aAAa,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;QAC/D,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;OAGG;IACH,IAAW,IAAI;QACb,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IACD;;;OAGG;IACH,IAAW,SAAS;QAClB,OAAO,IAAI,CAAC,UAAU,CAAC;IACzB,CAAC;IACD;;;OAGG;IACI,KAAK,CAAC,OAAuB;QAClC,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,EAAU,CAAC;QACrC,OAAO,2BAA2B,CAAC,aAAa,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;IAC/D,CAAC;IACD;;;;;;;OAOG;IACa,iBAAiB,CAAC,SAAuC,EAAE,SAAuC,EAAE,OAAuB;QACzI,MAAM,WAAW,GAAG,SAAS,YAAY,yCAAmB,CAAC;QAC7D,MAAM,WAAW,GAAG,SAAS,YAAY,yCAAmB,CAAC;QAC7D,IAAI,cAAc,GAAG,WAAW,CAAC,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC;QAClE,IAAI,cAAc,GAAG,WAAW,CAAC,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC;QAClE,IAAI,cAAc,KAAK,cAAc;YACnC,OAAO,SAAS,CAAC;QACnB,MAAM,QAAQ,GAAG,cAAc,GAAG,cAAc,CAAC;QACjD,IAAI,QAAQ;YACV,CAAC,cAAc,EAAE,cAAc,CAAC,GAAG,CAAC,cAAc,EAAE,cAAc,CAAC,CAAC;QACtE,MAAM,cAAc,GAAG,cAAc,GAAG,IAAI,CAAC,YAAY,CAAC;QAC1D,MAAM,cAAc,GAAG,cAAc,GAAG,IAAI,CAAC,YAAY,CAAC;QAC1D,MAAM,SAAS,GAAG,IAAI,CAAC,uBAAuB,CAAC,cAAc,EAAE,IAAI,CAAC,CAAC;QACrE,IAAI,SAAS,KAAK,SAAS;YACzB,OAAO,SAAS,CAAC;QACnB,MAAM,SAAS,GAAG,IAAI,CAAC,uBAAuB,CAAC,cAAc,EAAE,IAAI,CAAC,CAAC;QACrE,IAAI,SAAS,KAAK,SAAS;YACzB,OAAO,SAAS,CAAC;QACnB,MAAM,gBAAgB,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,SAAS,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;QAC3E,IAAI,SAAS,KAAK,gBAAgB;YAChC,OAAO,SAAS,CAAC;QACnB,MAAM,gBAAgB,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,SAAS,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;QAC3E,IAAI,SAAS,KAAK,gBAAgB;YAChC,OAAO,SAAS,CAAC;QACnB,MAAM,cAAc,GAAG,WAAW,IAAI,SAAS,CAAC,WAAW,CAAC,CAAC,CAAC,SAAS,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC,oCAAoC,CAAC,cAAc,EAAE,IAAI,CAAC,CAAC;QACpK,MAAM,cAAc,GAAG,WAAW,IAAI,SAAS,CAAC,WAAW,CAAC,CAAC,CAAC,SAAS,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC,oCAAoC,CAAC,cAAc,EAAE,IAAI,CAAC,CAAC;QACpK,qDAAqD;QACrD,MAAM,OAAO,GAAG,WAAI,CAAC,MAAM,EAAE,CAAC;QAC9B,MAAM,eAAe,GAAG,CACtB,UAA0B,EAAE,cAAsB,EAAE,cAAsB,EAAE,aAAsB,EACzF,EAAE;YACX,IAAI,cAAc,KAAK,cAAc;gBACnC,OAAO,KAAK,CAAC;YACf,IAAI,QAAQ,CAAC;YACb,IAAI,cAAc,KAAK,GAAG,IAAI,cAAc,KAAK,GAAG,EAAE,CAAC;gBACrD,QAAQ,GAAG,UAAU,CAAC,KAAK,EAAE,CAAC;gBAC9B,IAAI,aAAa;oBACf,QAAQ,CAAC,cAAc,EAAE,CAAC;YAC9B,CAAC;iBAAM,CAAC;gBACN,QAAQ,GAAG,aAAa,CAAC,CAAC;oBACxB,UAAU,CAAC,iBAAiB,CAAC,cAAc,EAAE,cAAc,CAAC;oBAC5D,CAAC,CAAC,UAAU,CAAC,iBAAiB,CAAC,cAAc,EAAE,cAAc,CAAC,CAAC;YACnE,CAAC;YACD,IAAI,QAAQ,EAAE,CAAC;gBACb,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBAChC,OAAO,IAAI,CAAC;YACd,CAAC;YACD,OAAO,KAAK,CAAC;QACf,CAAC,CAAC;QACF,IAAI,SAAS,CAAC,UAAU,KAAK,SAAS,CAAC,UAAU,EAAE,CAAC;YAClD,+CAA+C;YAC/C,IAAI,eAAe,CAAC,SAAS,CAAC,UAAU,EAAE,cAAc,EAAE,cAAc,EAAE,QAAQ,CAAC;gBACjF,OAAO,2BAA2B,CAAC,aAAa,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,wDAAwD;YAC9H,OAAO,SAAS,CAAC;QACnB,CAAC;QACD,eAAe,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,gBAAgB,CAAC,EAAE,cAAc,EAAE,GAAG,EAAE,QAAQ,CAAC,CAAC;QACtF,mDAAmD;QACnD,KAAK,IAAI,UAAU,GAAG,gBAAgB,GAAG,CAAC,EAAE,UAAU,GAAG,gBAAgB,EAAE,UAAU,EAAE,EAAE,CAAC;YACxF,eAAe,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,UAAU,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,QAAQ,CAAC,CAAC;QACvE,CAAC;QACD,eAAe,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,gBAAgB,CAAC,EAAE,GAAG,EAAE,cAAc,EAAE,QAAQ,CAAC,CAAC;QACtF,wEAAwE;QACxE,IAAI,QAAQ;YACV,OAAO,CAAC,QAAQ,CAAC,OAAO,EAAE,CAAC;QAC7B,OAAO,2BAA2B,CAAC,aAAa,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;IACrE,CAAC;IACD;;;OAGG;IACI,SAAS,CAAC,KAAmC;QAClD,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC;YACpC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC;gBACrB,OAAO,KAAK,CAAC;QACjB,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IACD,8CAA8C;IAC9B,UAAU,CAAC,MAAgB;QACzC,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC;QAC7C,IAAI,CAAC;YACH,OAAO,CAAC,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;QAC9B,OAAO,yBAAO,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;IACpC,CAAC;IACD,+CAA+C;IAC/B,QAAQ,CAAC,MAAgB;QACvC,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9C,IAAI,CAAC;YACH,OAAO,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QAC5B,OAAO,yBAAO,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;IACpC,CAAC;IACD,gDAAgD;IACzC,WAAW,CAAC,IAAkB,EAAE,OAAuB;QAC5D,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC;YACpC,CAAC,CAAC,WAAW,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QAC/B,CAAC;IACH,CAAC;IACD;;;OAGG;IACI,kBAAkB,CAAC,IAAoB,EAAE,OAAuB;QACrE,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC;YACpC,CAAC,CAAC,kBAAkB,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QACtC,CAAC;IACH,CAAC;IACD;;;OAGG;IACI,4BAA4B,CAAC,OAAuB;QACzD,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC;YACpC,SAAS,IAAI,CAAC,CAAC,4BAA4B,CAAC,OAAO,CAAC,CAAC;QACvD,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;OAMG;IACa,wBAAwB,CACtC,cAAgC,EAAE,6BAAsC,KAAK,EAAE,qBAA8B,KAAK;QAElH,IAAI,0BAA0B,EAAE,CAAC;YAC/B,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC;gBACpC,CAAC,CAAC,wBAAwB,CAAC,cAAc,EAAE,0BAA0B,EAAE,kBAAkB,CAAC,CAAC;YAC7F,CAAC;QACH,CAAC;aAAM,CAAC;YACN,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC5B,CAAC;IACH,CAAC;IACD;;;;OAIG;IACa,qCAAqC,CAAC,OAAuB,EAAE,eAAgC;QAC7G,MAAM,KAAK,GAAG,+BAAc,CAAC,yCAAyC,CAAC,IAAI,EAAE,eAAe,CAAC,CAAC;QAC9F,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC;YACpC,CAAC,CAAC,qCAAqC,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;QAC1D,CAAC;QACD,+BAAc,CAAC,qBAAqB,CAAC,IAAI,EAAE,KAAK,EAAE,eAAe,CAAC,CAAC;IACrE,CAAC;IACD;;;OAGG;IACI,yBAAyB,CAAC,OAAwB;QACvD,OAAO,OAAO,CAAC,iCAAiC,CAAC,IAAI,CAAC,CAAC;IACzD,CAAC;IACD,wFAAwF;IACjF,WAAW,CAAC,aAAsB,EAAE,SAAqB;QAC9D,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,aAAa,EAAE,SAAS,CAAC,CAAC;IACnD,CAAC;IACD,6FAA6F;IAC7E,2BAA2B,CAAC,SAAiB,EAAE,SAAiB;QAC9E,OAAO,IAAI,CAAC,GAAG,CAAC,SAAS,GAAG,SAAS,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC;IAC7D,CAAC;IACD;;MAEE;IACM,MAAM,CAAC,mBAAmB,CAAC,KAAiB;QAClD,IAAI,CAAC,CAAC,KAAK,KAAK,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,KAAqB,EAAE,EAAE,GAAG,OAAO,KAAK,YAAY,2BAA2B,CAAC,CAAC,CAAC,CAAC;YACtH,OAAO,KAAK,CAAC;QACf,MAAM,SAAS,GAAG,KAAK,CAAC,KAAK,EAAgB,CAAC;QAC9C,MAAM,YAAY,GAAG,SAAS,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,KAAqB,EAAE,EAAE;YACxE,IAAI,KAAK,YAAY,2BAA2B;gBAC9C,OAAO,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC;;gBAE3B,OAAO,CAAC,KAAK,CAAC,CAAC;QACnB,CAAC,CACA,CAAC;QACF,SAAS,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,QAAQ,EAAE,GAAG,YAAY,CAAC,CAAC;QACxD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,aAAa,CAAC,IAAgB,EAAE,OAAuB;QACnE,IAAI,GAAG,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,CAAC,CAAE,4BAA4B;QACpE,MAAM,SAAS,GAAG,gCAAgC,CAAC,uBAAuB,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QAC1F,OAAO,IAAI,2BAA2B,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;IAC1D,CAAC;IACD;;;;;OAKG;IACI,uBAAuB,CAAC,QAAgB,EAAE,qBAA8B,KAAK;QAClF,MAAM,CAAC,GAAG,IAAI,CAAC,4BAA4B,CAAC,QAAQ,EAAE,kBAAkB,CAAC,CAAC;QAC1E,IAAI,SAAS,KAAK,CAAC;YACjB,OAAO,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QAC5B,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;OAKG;IACO,4BAA4B,CAAC,QAAgB,EAAE,qBAA8B,KAAK;QAC1F,MAAM,YAAY,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC;QAC5C,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC;QAClC,IAAI,YAAY,GAAG,CAAC,EAAE,CAAC;YACrB,IAAI,QAAQ,GAAG,GAAG;gBAChB,OAAO,kBAAkB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;YAC5C,IAAI,QAAQ,GAAG,IAAI,CAAC,YAAY;gBAC9B,OAAO,kBAAkB,CAAC,CAAC,CAAC,CAAC,YAAY,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;YAC7D,8CAA8C;YAC9C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,EAAE,CAAC,EAAE,EAAE,CAAC;gBACtC,IAAI,SAAS,CAAC,CAAC,CAAC,CAAC,qBAAqB,CAAC,QAAQ,CAAC;oBAC9C,OAAO,CAAC,CAAC;YACb,CAAC;QACH,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;OAGG;IACI,4BAA4B,CAAC,QAAgB;QAClD,OAAO,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC;IACtC,CAAC;IACD,4GAA4G;IACrG,+BAA+B,CAAC,KAAqB,EAAE,QAAgB;QAC5E,MAAM,YAAY,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC;QAC5C,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC;QAClC,IAAI,YAAY,GAAG,CAAC,EAAE,CAAC;YACrB,IAAI,QAAQ,GAAG,CAAC;gBACd,OAAO,SAAS,CAAC,CAAC,CAAC,CAAC;YACtB,IAAI,QAAQ,GAAG,GAAG;gBAChB,OAAO,SAAS,CAAC,YAAY,GAAG,CAAC,CAAC,CAAC;YACrC,8CAA8C;YAC9C,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;gBACjC,IAAI,QAAQ,CAAC,kCAAkC,CAAC,KAAK,EAAE,QAAQ,CAAC;oBAC9D,OAAO,QAAQ,CAAC;YACpB,CAAC;QACH,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,gDAAgD;IAChC,WAAW;QACzB,OAAO,IAAI,CAAC,YAAY,CAAC;IAC3B,CAAC;IACD;;;OAGG;IACI,WAAW;QAChB,OAAO,IAAI,CAAC,YAAY,CAAC;IAC3B,CAAC;IACD;;;;OAIG;IACI,eAAe,CAAC,QAAgB,EAAE,MAAgB;QACvD,MAAM,iBAAiB,GAAG,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC;QACvD,MAAM,QAAQ,GAAG,IAAI,CAAC,uBAAuB,CAAC,iBAAiB,EAAE,IAAI,CAAC,CAAC;QACvE,IAAI,QAAQ,EAAE,CAAC;YACb,MAAM,aAAa,GAAG,QAAQ,CAAC,oCAAoC,CAAC,iBAAiB,EAAE,IAAI,CAAC,CAAC;YAC7F,OAAO,QAAQ,CAAC,UAAU,CAAC,eAAe,CAAC,aAAa,EAAE,MAAM,CAAC,CAAC;QACpE,CAAC;QACD,IAAA,qBAAM,EAAC,KAAK,CAAC,CAAC,CAAC,8BAA8B;QAC7C,+DAA+D;QAC/D,OAAO,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,eAAe,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;IACpE,CAAC;IACD;;;;;;;;OAQG;IACI,4BAA4B,CAAC,QAAgB,EAAE,MAAc;QAClE,MAAM,iBAAiB,GAAG,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC;QACvD,MAAM,QAAQ,GAAG,IAAI,CAAC,uBAAuB,CAAC,iBAAiB,EAAE,IAAI,CAAE,CAAC;QACxE,MAAM,aAAa,GAAG,QAAQ,CAAC,oCAAoC,CAAC,iBAAiB,EAAE,IAAI,CAAC,CAAC;QAC7F,MAAM,GAAG,QAAQ,CAAC,UAAU,CAAC,4BAA4B,CAAC,aAAa,EAAE,MAAM,CAAC,CAAC;QACjF,qGAAqG;QACrG,gHAAgH;QAChH,kHAAkH;QAClH,gHAAgH;QAChH,wDAAwD;QACxD,mEAAmE;QACnE,MAAM,CAAC,GAAG,IAAI,CAAC,YAAY,GAAG,MAAM,CAAC,SAAS,CAAC,SAAS,EAAE,CAAC,CAAC,WAAW;QACvE,MAAM,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QACjC,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;;;;;OASG;IACa,6BAA6B,CAAC,QAAgB,EAAE,MAAc;QAC5E,MAAM,iBAAiB,GAAG,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC;QACvD,MAAM,QAAQ,GAAG,IAAI,CAAC,uBAAuB,CAAC,iBAAiB,EAAE,IAAI,CAAE,CAAC;QACxE,MAAM,aAAa,GAAG,QAAQ,CAAC,oCAAoC,CAAC,iBAAiB,EAAE,IAAI,CAAC,CAAC;QAC7F,MAAM,GAAG,QAAQ,CAAC,UAAU,CAAC,4BAA4B,CAAC,aAAa,EAAE,MAAM,CAAC,CAAC;QACjF,MAAM,CAAC,SAAS,CAAC,gBAAgB,EAAE,CAAC;QACpC,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;;;OAOG;IACI,8BAA8B,CACnC,QAAgB,EAAE,MAAkC;QAEpD,MAAM,iBAAiB,GAAG,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC;QACvD,MAAM,QAAQ,GAAG,IAAI,CAAC,uBAAuB,CAAC,iBAAiB,EAAE,IAAI,CAAE,CAAC;QACxE,MAAM,aAAa,GAAG,QAAQ,CAAC,oCAAoC,CAAC,iBAAiB,EAAE,IAAI,CAAC,CAAC;QAC7F,MAAM,GAAG,QAAQ,CAAC,UAAU,CAAC,8BAA8B,CAAC,aAAa,EAAE,MAAM,CAAC,CAAC;QACnF,IAAI,CAAC,MAAM;YACT,OAAO,SAAS,CAAC;QACnB,+EAA+E;QAC/E,mFAAmF;QACnF,6EAA6E;QAC7E,uFAAuF;QACvF,kEAAkE;QAClE,qFAAqF;QACrF,yFAAyF;QACzF,8CAA8C;QAC9C,mEAAmE;QACnE,MAAM,IAAI,GAAG,MAAM,CAAC,OAAO,CAAC,SAAS,EAAE,CAAC,CAAC,SAAS;QAClD,MAAM,KAAK,GAAG,IAAI,GAAG,IAAI,CAAC,CAAC,WAAW;QACtC,MAAM,KAAK,GAAG,MAAM,CAAC,OAAO,CAAC,UAAU,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,QAAQ;QACjE,MAAM,CAAC,OAAO,CAAC,gBAAgB,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,wCAAwC;QACzG,MAAM,KAAK,GAAG,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,CAAC,WAAW;QACnD,MAAM,CAAC,OAAO,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,4BAA4B;QAChE,MAAM,CAAC,OAAO,CAAC,YAAY,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,mCAAmC;QAC/E,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;OAKG;IACI,mBAAmB,CAAC,SAAoB;QAC7C,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC;YACpC,IAAI,CAAC,CAAC,CAAC,mBAAmB,CAAC,SAAS,CAAC;gBACnC,OAAO,EAAE,CAAC;QACd,CAAC;QACD,OAAO,OAAO,KAAK,CAAC,CAAC;IACvB,CAAC;IACD,gGAAgG;IACzF,cAAc;QACnB,IAAI,CAAC,KAAK,CAAC,sBAAsB,EAAE,CAAC;QACpC,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YACvC,QAAQ,CAAC,4BAA4B,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QAC3D,CAAC;QACD,IAAI,CAAC,UAAU,CAAC,OAAO,EAAE,CAAC;IAC5B,CAAC;IACD;;;;OAIG;IACa,aAAa,CAAC,KAAoB;QAChD,IAAI,KAAK,YAAY,2BAA2B,EAAE,CAAC;YACjD,OAAO,mBAAQ,CAAC,gBAAgB,CAAC,IAAI,CAAC,YAAY,EAAE,KAAK,CAAC,YAAY,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QACnH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;OAKG;IACa,8BAA8B,CAC5C,aAAqB,EAAE,cAAsB,EAAE,cAAuB,EAAE,MAA4B;QAEpG,MAAM,SAAS,GAAG,aAAa,GAAG,IAAI,CAAC,YAAY,CAAC;QACpD,MAAM,SAAS,GAAG,SAAS,GAAG,cAAc,CAAC;QAC7C,MAAM,SAAS,GAAG,IAAI,CAAC,uBAAuB,CAAC,SAAS,EAAE,IAAI,CAAE,CAAC;QACjE,MAAM,WAAW,GAAG,SAAS,CAAC,UAAU,CAAC,8BAA8B,CACrE,SAAS,CAAC,cAAc,EAAE,SAAS,GAAG,SAAS,CAAC,cAAc,EAAE,cAAc,EAAE,MAAM,EAAE,WAAW,CACpG,CAAC,CAAC,0CAA0C;QAC7C,MAAM,WAAW,GAAG,aAAa,GAAG,CAAC,cAAc,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC;QACzE,MAAM,WAAW,GAAG,yCAAmB,CAAC,mCAAmC,CACzE,cAAc,EAAE,IAAI,EAAE,aAAa,EAAE,WAAW,EAAE,cAAc,EAAE,MAAM,CACzE,CAAC,CAAC,2CAA2C;QAC9C,WAAW,CAAC,WAAW,GAAG,WAAW,CAAC;QACtC,OAAO,WAAW,CAAC;IACrB,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,yBAAyB,CACrC,QAAiB,IAAI;QAErB,MAAM,CAAC,GAAG;YACR,QAAQ,EAAE,IAAI,CAAC,SAAS;YACxB,SAAS,EAAE,IAAI,CAAC,UAAU;YAC1B,WAAW,EAAE,IAAI,CAAC,YAAY;YAC9B,YAAY,EAAE,IAAI,CAAC,aAAa;SACjC,CAAC;QACF,IAAI,KAAK,EAAE,CAAC;YACV,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,aAAa,GAAG,CAAC,CAAC;QAC/D,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC;IACD;;;;;;;;;;OAUG;IACa,YAAY,CAAC,UAAmB,EAAE,MAAmC,EAAE,MAA4B;QACjH,IAAI,WAA4C,CAAC;QACjD,IAAI,IAAI,GAAG,MAAM,CAAC,SAAS,CAAC;QAC5B,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;QAC9C,IAAI,WAAW,KAAK,CAAC,EAAE,CAAC;YACtB,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,UAAU,EAAE,MAAM,CAAC,CAAC;QACvE,CAAC;aAAM,CAAC;YACN,MAAM,eAAe,GAAG,YAAY,CAAC,8BAA8B,CAAC,IAAI,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC;YACjG,MAAM,OAAO,GAAG;gBACd,oCAAkB,CAAC,mDAAmD,CAAC,MAAM,EAAE,CAAC,CAAC;gBACjF,iCAAe,CAAC,IAAI;aACrB,CAAC;YACF,MAAM,OAAO,GAAG;gBACd,iCAAe,CAAC,IAAI;gBACpB,oCAAkB,CAAC,mDAAmD,CAAC,MAAM,EAAE,CAAC,CAAC;aAClF,CAAC;YACF,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YACrC,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAC9D,2BAA2B,CAAC,SAAS,EAAE,CAAC;YACxC,2BAA2B,CAAC,aAAa,IAAI,eAAe,CAAC,MAAM,CAAC;YACpE,IAAI,OAAwC,CAAC;YAC7C,KAAK,MAAM,cAAc,IAAI,eAAe,EAAE,CAAC;gBAC7C,IAAI,cAAc,CAAC,CAAC,GAAG,IAAI;oBACzB,2FAA2F;oBAC3F,0FAA0F;oBAC1F,MAAM;gBACR,2BAA2B,CAAC,UAAU,EAAE,CAAC;gBACzC,MAAM,KAAK,GAAG,cAAc,CAAC,UAAU,CAAC;gBACxC,OAAO,GAAG,KAAK,CAAC,YAAY,CAC1B,UAAU,EAAE,cAAc,KAAK,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,cAAc,KAAK,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,OAAO,CAC7G,CAAC;gBACF,IAAI,OAAO,IAAI,OAAO,CAAC,CAAC,GAAG,IAAI,EAAE,CAAC;oBAChC,IAAI,GAAG,OAAO,CAAC,CAAC,CAAC;oBACjB,WAAW,GAAG,OAAO,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;oBACzC,2BAA2B,CAAC,YAAY,EAAE,CAAC;gBAC7C,CAAC;YACH,CAAC;QACH,CAAC;QACD,IAAI,CAAC,WAAW;YACd,OAAO,SAAS,CAAC;QACnB,OAAO,IAAI,CAAC,kBAAkB,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;IACtD,CAAC;IACD;;;;;OAKG;IACa,iBAAiB,CAC/B,uBAA+C;QAE/C,MAAM,OAAO,GAAG,6BAAa,CAAC,MAAM,CAAC,uBAAuB,CAAC,CAAC;QAC9D,MAAM,OAAO,GAAqB,EAAE,CAAC;QACrC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,sBAAsB,CAAC,SAAS,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC;YACtE,MAAM,MAAM,GAAG,IAAI,CAAC,iBAAiB,CAAC,OAAO,CAAC,CAAC;YAC/C,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;gBACzB,IAAI,MAAM,YAAY,+BAAc;oBAClC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;qBAClB,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC;oBAC5B,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;YAC7C,CAAC;QACH,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IACD;;;;;;;OAOG;IACa,uBAAuB,CAAC,GAAqB,EAAE,OAAiB;QAC9E,OAAO,qDAAyB,CAAC,kCAAkC,CAAC,IAAI,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;IAC1F,CAAC;IACD;;;;;;OAMG;IACI,kBAAkB,CAAC,WAAgC,EAAE,MAA4B;QACtF,IAAI,CAAC,WAAW,CAAC,KAAK;YACpB,OAAO,SAAS,CAAC;QACnB,MAAM,QAAQ,GAAG,IAAI,CAAC,+BAA+B,CAAC,WAAW,CAAC,KAAK,EAAE,WAAW,CAAC,QAAQ,CAAC,CAAC;QAC/F,IAAI,QAAQ,EAAE,CAAC;YACb,MAAM,aAAa,GAAG,QAAQ,CAAC,4BAA4B,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;YAClF,MAAM,aAAa,GAAG,IAAI,CAAC,4BAA4B,CAAC,aAAa,CAAC,CAAC;YACvE,MAAM,WAAW,GAAG,yCAAmB,CAAC,wBAAwB,CAAC,IAAI,EAAE,aAAa,EAAE,WAAW,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;YACjH,WAAW,CAAC,WAAW,GAAG,WAAW,CAAC;YACtC,WAAW,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC;YAC9B,OAAO,WAAW,CAAC;QACrB,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;;;;;;OAWG;IACI,MAAM,CAAC,+BAA+B,CAC3C,KAAgC,EAChC,MAAc,EACd,MAAoC,EACpC,MAAoC,EACpC,gBAA0B;QAE1B,KAAK,IAAI,CAAC,GAAG,MAAM,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE,CAAC;YAC3C,MAAM,eAAe,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACjC,IAAI,MAAM,EAAE,CAAC;gBACX,MAAM,WAAW,GAAG,MAAM,CAAC,kBAAkB,CAAC,eAAe,CAAC,OAAO,CAAC,CAAC;gBACvE,IAAI,WAAW;oBACb,eAAe,CAAC,OAAO,GAAG,WAAW,CAAC;YAC1C,CAAC;YACD,IAAI,MAAM,EAAE,CAAC;gBACX,MAAM,WAAW,GAAG,MAAM,CAAC,kBAAkB,CAAC,eAAe,CAAC,OAAO,CAAC,CAAC;gBACvE,IAAI,WAAW;oBACb,eAAe,CAAC,OAAO,GAAG,WAAW,CAAC;YAC1C,CAAC;QACH,CAAC;QACD,IAAI,gBAAgB;YAClB,KAAK,GAAG,6CAAuB,CAAC,wBAAwB,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QAC1E,OAAO,KAAK,CAAC;IACf,CAAC;;AAznBH,kEA0nBC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n\r\n/** @packageDocumentation\r\n * @module Curve\r\n */\r\nimport { assert } from \"@itwin/core-bentley\";\r\nimport { CurvePrimitive } from \"../curve/CurvePrimitive\";\r\nimport { StrokeCountMap } from \"../curve/Query/StrokeCountMap\";\r\nimport { Geometry } from \"../Geometry\";\r\nimport { GeometryHandler, IStrokeHandler } from \"../geometry3d/GeometryHandler\";\r\nimport { Plane3dByOriginAndUnitNormal } from \"../geometry3d/Plane3dByOriginAndUnitNormal\";\r\nimport { Plane3dByOriginAndVectors } from \"../geometry3d/Plane3dByOriginAndVectors\";\r\nimport { Point3d, Vector3d } from \"../geometry3d/Point3dVector3d\";\r\nimport { Range1d, Range3d } from \"../geometry3d/Range\";\r\nimport { Ray3d } from \"../geometry3d/Ray3d\";\r\nimport { Transform } from \"../geometry3d/Transform\";\r\nimport { CurveChain } from \"./CurveCollection\";\r\nimport { CurveExtendMode, CurveExtendOptions, VariantCurveExtendParameter } from \"./CurveExtendMode\";\r\nimport { CurveLocationDetail, CurveLocationDetailPair } from \"./CurveLocationDetail\";\r\nimport { GeometryQuery } from \"./GeometryQuery\";\r\nimport { PlaneAltitudeRangeContext } from \"./internalContexts/PlaneAltitudeRangeContext\";\r\nimport { LineString3d } from \"./LineString3d\";\r\nimport { OffsetOptions } from \"./OffsetOptions\";\r\nimport { Path } from \"./Path\";\r\nimport { StrokeOptions } from \"./StrokeOptions\";\r\n\r\n/**\r\n * Annotation of a fragment, i.e. an interval of a curve.\r\n * * The interval is marked with two pairs of numbers:\r\n * * * fraction0, fraction1 = fraction parameters along the child curve.\r\n * * * distance0, distance1 = distances within containing CurveChainWithDistanceIndex.\r\n * @public\r\n */\r\nexport class PathFragment {\r\n /** Distance along parent to this fragment start. */\r\n public chainDistance0: number;\r\n /** Distance along parent to this fragment end. */\r\n public chainDistance1: number;\r\n /** The start of this `PathFragment`, as a local fractional parameter of `this.childCurve`. */\r\n public childFraction0: number;\r\n /** The end of this `PathFragment`, as a local fractional parameter of `this.childCurve`. */\r\n public childFraction1: number;\r\n /** Curve primitive of this fragment, as presented in stroker. Note that this might have become a proxy. */\r\n public childCurve: CurvePrimitive;\r\n /** Optional range */\r\n public range?: Range3d;\r\n /** Working var for use in searches. */\r\n public a: number;\r\n /** Create a fragment with complete fraction, distance, and child data. */\r\n public constructor(\r\n childFraction0: number,\r\n childFraction1: number,\r\n distance0: number,\r\n distance1: number,\r\n childCurve: CurvePrimitive,\r\n range?: Range3d,\r\n ) {\r\n this.childFraction0 = childFraction0;\r\n this.childFraction1 = childFraction1;\r\n this.chainDistance0 = distance0;\r\n this.chainDistance1 = distance1;\r\n this.childCurve = childCurve;\r\n this.range = range;\r\n this.a = 0;\r\n }\r\n /** Return true if the distance is within the distance limits of this fragment. */\r\n public containsChainDistance(distance: number): boolean {\r\n return distance >= this.chainDistance0 && distance <= this.chainDistance1;\r\n }\r\n /**\r\n * Return a quick minimum distance from spacePoint to the curve.\r\n * * The returned distance is to the curve's range box if defined; otherwise, the true distance is computed.\r\n * * Thus the returned distance may be SMALLER than the true distance to the curve, but not larger.\r\n */\r\n public quickMinDistanceToChildCurve(spacePoint: Point3d): number {\r\n if (this.range)\r\n return this.range.distanceToPoint(spacePoint);\r\n const detail = this.childCurve.closestPoint(spacePoint, false);\r\n if (detail)\r\n return detail.a;\r\n return 0;\r\n }\r\n /**\r\n * Return an array with (references to) all the input path fragments, sorted smallest to largest on the \"a\" value,\r\n * initialized with `quickMinDistanceToChildCurve`\r\n */\r\n public static collectSortedQuickMinDistances(fragments: PathFragment[], spacePoint: Point3d): PathFragment[] {\r\n const sortedFragments: PathFragment[] = [];\r\n for (const frag of fragments) {\r\n frag.a = frag.quickMinDistanceToChildCurve(spacePoint);\r\n sortedFragments.push(frag);\r\n }\r\n sortedFragments.sort((frag1: PathFragment, frag2: PathFragment) => frag1.a - frag2.a);\r\n return sortedFragments;\r\n }\r\n /** Return true if `this` fragment addresses `curve` and brackets `fraction`. */\r\n public containsChildCurveAndChildFraction(curve: CurvePrimitive, fraction: number): boolean {\r\n return this.childCurve === curve && fraction >= this.childFraction0 && fraction <= this.childFraction1;\r\n }\r\n /**\r\n * Convert distance to local fraction and apply that to interpolate between the stored curve fractions.\r\n * Note that proportional calculation does NOT account for non-uniform parameterization in the child curve.\r\n */\r\n public chainDistanceToInterpolatedChildFraction(distance: number): number {\r\n return Geometry.inverseInterpolate(\r\n this.childFraction0,\r\n this.chainDistance0,\r\n this.childFraction1,\r\n this.chainDistance1,\r\n distance,\r\n this.childFraction0,\r\n )!; // the interval must have nonzero length so division should be safe\r\n }\r\n /**\r\n * Convert the given chainDistance to a fraction along this childCurve using `moveSignedDistanceFromFraction`.\r\n * @param chainDistance signed distance along the chain.\r\n * @param allowExtrapolation whether to extrapolate off the start of the chain if `chainDistance` is negative,\r\n * or off the end of the chain if `chainDistance` is more than `chainLength`. Extending the chain in this manner\r\n * may result in significant inaccuracy, especially for negative distances.\r\n * @return fraction local to the relevant chain primitive corresponding to the chain position at `chainDistance`.\r\n */\r\n public chainDistanceToAccurateChildFraction(chainDistance: number, allowExtrapolation?: boolean): number {\r\n const childDetail = this.childCurve.moveSignedDistanceFromFraction(\r\n this.childFraction0, chainDistance - this.chainDistance0, allowExtrapolation ?? false,\r\n );\r\n return childDetail.fraction;\r\n }\r\n /**\r\n * Return the scale factor to map childCurve fraction derivatives to chain fraction derivatives.\r\n * @param globalDistance total length of the global curve\r\n */\r\n public fractionScaleFactor(globalDistance: number): number {\r\n return globalDistance * (this.childFraction1 - this.childFraction0) / (this.chainDistance1 - this.chainDistance0);\r\n }\r\n /**\r\n * Reverse the fraction and distance data.\r\n * * Each child fraction `f` is replaced by `1-f`\r\n * * Each `chainDistance` is replaced by `totalDistance - chainDistance`\r\n * @param totalDistance the total distance\r\n */\r\n public reverseFractionsAndDistances(totalDistance: number) {\r\n const f0 = this.childFraction0;\r\n const f1 = this.childFraction1;\r\n const d0 = this.chainDistance0;\r\n const d1 = this.chainDistance1;\r\n this.childFraction0 = 1.0 - f1;\r\n this.childFraction1 = 1.0 - f0;\r\n this.chainDistance0 = totalDistance - d1;\r\n this.chainDistance1 = totalDistance - d0;\r\n }\r\n /**\r\n * Convert a fractional position on the childCurve of this fragment to distance on the curve chain.\r\n * * Return value is SIGNED and will be negative when `fraction < this.childFraction0`.\r\n * @param fraction the fractional position on the childCurve of this fragment\r\n */\r\n public childFractionToChainDistance(fraction: number): number {\r\n let d = this.childCurve.curveLengthBetweenFractions(this.childFraction0, fraction);\r\n if (fraction < this.childFraction0)\r\n d = -d;\r\n return this.chainDistance0 + d;\r\n }\r\n}\r\n\r\n/** Non-instantiable class to build a distance index for a curve chain. */\r\nclass DistanceIndexConstructionContext implements IStrokeHandler {\r\n private _fragments: PathFragment[];\r\n private _accumulatedDistance: number;\r\n private constructor() {\r\n this._accumulatedDistance = 0;\r\n this._fragments = [];\r\n }\r\n // ignore curve announcements -- they are repeated in stroke announcements\r\n public startParentCurvePrimitive(_cp: CurvePrimitive) { }\r\n public startCurvePrimitive(_cp: CurvePrimitive) { }\r\n public endParentCurvePrimitive(_cp: CurvePrimitive) { }\r\n public endCurvePrimitive(_cp: CurvePrimitive) { }\r\n public announcePointTangent(_xyz: Point3d, _fraction: number, _tangent: Vector3d) { }\r\n public announceSegmentInterval(\r\n cp: CurvePrimitive, point0: Point3d, point1: Point3d, numStrokes: number, fraction0: number, fraction1: number,\r\n ): void {\r\n const fragmentPoint0 = point0.clone();\r\n const fragmentPoint1 = point1.clone();\r\n let d0 = this._accumulatedDistance;\r\n if (numStrokes <= 1) {\r\n this._accumulatedDistance += point0.distance(point1);\r\n this._fragments.push(new PathFragment(fraction0, fraction1, d0, this._accumulatedDistance, cp,\r\n Range3d.create(fragmentPoint0, fragmentPoint1)));\r\n } else {\r\n let f1;\r\n for (let i = 1, f0 = fraction0; i <= numStrokes; i++, f0 = f1) {\r\n f1 = Geometry.interpolate(fraction0, i / numStrokes, fraction1);\r\n point0.interpolate(f1, point1, fragmentPoint1);\r\n d0 = this._accumulatedDistance;\r\n this._accumulatedDistance += (Math.abs(f1 - f0) * point0.distance(point1));\r\n this._fragments.push(new PathFragment(f0, f1, d0, this._accumulatedDistance, cp,\r\n Range3d.create(fragmentPoint0, fragmentPoint1)));\r\n fragmentPoint0.setFrom(fragmentPoint1);\r\n }\r\n }\r\n }\r\n public announceIntervalForUniformStepStrokes(\r\n cp: CurvePrimitive, numStrokes: number, fraction0: number, fraction1: number,\r\n ): void {\r\n let f1, d, d0;\r\n for (let i = 1, f0 = fraction0; i <= numStrokes; i++, f0 = f1) {\r\n f1 = Geometry.interpolate(fraction0, i / numStrokes, fraction1);\r\n d = cp.curveLengthBetweenFractions(f0, f1);\r\n d0 = this._accumulatedDistance;\r\n this._accumulatedDistance += d;\r\n const range = cp.rangeBetweenFractions(f0, f1);\r\n this._fragments.push(new PathFragment(f0, f1, d0, this._accumulatedDistance, cp, range));\r\n }\r\n }\r\n public needPrimaryGeometryForStrokes?(): boolean {\r\n return true;\r\n }\r\n /** Create an array of PathFragment from input curve chain. */\r\n public static createPathFragmentIndex(path: CurveChain, options?: StrokeOptions): PathFragment[] {\r\n const handler = new DistanceIndexConstructionContext();\r\n for (const curve of path.children) {\r\n curve.emitStrokableParts(handler, options);\r\n }\r\n const fragments = handler._fragments;\r\n return fragments;\r\n }\r\n}\r\n/**\r\n * `CurveChainWithDistanceIndex` is a [[CurvePrimitive]] whose fractional parameterization is proportional to true\r\n * distance along a path.\r\n * * For example if the total length of the chain is `L`, then the distance along the chain from parameters `t0`\r\n * to `t1` is easily computed as `L*(t1-t0)`.\r\n * * In this way the `CurveChainWithDistanceIndex` provides a global arc length parameterization for a [[CurveChain]].\r\n * * A `CurveChainWithDistanceIndex` can be created from any [[CurveChain]], but a [[Path]] is stored internally.\r\n * * Adding a `CurveChainWithDistanceIndex` to a `CurveChain` does not preserve the distance index; instead the\r\n * internal path children are added directly to the `CurveChain`.\r\n * @public\r\n */\r\nexport class CurveChainWithDistanceIndex extends CurvePrimitive {\r\n /** String name for schema properties */\r\n public readonly curvePrimitiveType = \"curveChainWithDistanceIndex\";\r\n private readonly _path: Path;\r\n private readonly _fragments: PathFragment[];\r\n private readonly _totalLength: number; // matches final fragment distance1.\r\n private static _numCalls = 0;\r\n private static _numTested = 0;\r\n private static _numAssigned = 0;\r\n private static _numCandidate = 0;\r\n /** Test if `other` is a `CurveChainWithDistanceIndex` */\r\n public isSameGeometryClass(other: GeometryQuery): boolean {\r\n return other instanceof CurveChainWithDistanceIndex;\r\n }\r\n // final assembly of CurveChainWithDistanceIndex -- caller must create valid fragment index.\r\n private constructor(path: CurveChain, fragments: PathFragment[]) {\r\n super();\r\n this._path = path instanceof Path ? path : Path.create(...path.children); // Loop semantics would be confusing\r\n this._fragments = fragments;\r\n this._totalLength = fragments.length > 0 ? fragments[fragments.length - 1].chainDistance1 : 0;\r\n }\r\n /**\r\n * Create a clone, transformed and with its own distance index.\r\n * @param transform transform to apply in the clone.\r\n * @param options how finely to stroke the path to create the distance index\r\n */\r\n public cloneTransformed(transform: Transform, options?: StrokeOptions): CurveChainWithDistanceIndex | undefined {\r\n const c = this._path.clone() as Path;\r\n if (c.tryTransformInPlace(transform))\r\n return CurveChainWithDistanceIndex.createCapture(c, options);\r\n return undefined;\r\n }\r\n /**\r\n * Reference to the contained path.\r\n * * Do not modify the path. The distance index will be wrong.\r\n */\r\n public get path(): Path {\r\n return this._path;\r\n }\r\n /**\r\n * Reference to the fragments array.\r\n * * Do not modify.\r\n */\r\n public get fragments(): PathFragment[] {\r\n return this._fragments;\r\n }\r\n /**\r\n * Return a deep clone with its own distance index.\r\n * @param options how finely to stroke the path to create the distance index\r\n */\r\n public clone(options?: StrokeOptions): CurveChainWithDistanceIndex {\r\n const c = this._path.clone() as Path;\r\n return CurveChainWithDistanceIndex.createCapture(c, options);\r\n }\r\n /**\r\n * Return a portion of this curve with its own distance index.\r\n * * Passing a chain detail containing a `childDetail` is more accurate for extending the instance beyond [0,1].\r\n * Such details are returned by e.g., [[CurveCurve.intersectionXYPairs]].\r\n * @param fractionA start fraction or chain detail\r\n * @param fractionB end fraction or chain detail\r\n * @param options how finely to stroke the path to create the distance index\r\n */\r\n public override clonePartialCurve(fractionA: number | CurveLocationDetail, fractionB: number | CurveLocationDetail, options?: StrokeOptions): CurveChainWithDistanceIndex | undefined {\r\n const haveDetailA = fractionA instanceof CurveLocationDetail;\r\n const haveDetailB = fractionB instanceof CurveLocationDetail;\r\n let chainFractionA = haveDetailA ? fractionA.fraction : fractionA;\r\n let chainFractionB = haveDetailB ? fractionB.fraction : fractionB;\r\n if (chainFractionA === chainFractionB)\r\n return undefined;\r\n const reversed = chainFractionA > chainFractionB;\r\n if (reversed)\r\n [chainFractionA, chainFractionB] = [chainFractionB, chainFractionA];\r\n const chainDistanceA = chainFractionA * this._totalLength;\r\n const chainDistanceB = chainFractionB * this._totalLength;\r\n const fragmentA = this.chainDistanceToFragment(chainDistanceA, true);\r\n if (undefined === fragmentA)\r\n return undefined;\r\n const fragmentB = this.chainDistanceToFragment(chainDistanceB, true);\r\n if (undefined === fragmentB)\r\n return undefined;\r\n const childCurveIndexA = this._path.childIndex(fragmentA.childCurve, true);\r\n if (undefined === childCurveIndexA)\r\n return undefined;\r\n const childCurveIndexB = this._path.childIndex(fragmentB.childCurve, true);\r\n if (undefined === childCurveIndexB)\r\n return undefined;\r\n const childFractionA = haveDetailA && fractionA.childDetail ? fractionA.childDetail.fraction : fragmentA.chainDistanceToAccurateChildFraction(chainDistanceA, true);\r\n const childFractionB = haveDetailB && fractionB.childDetail ? fractionB.childDetail.fraction : fragmentB.chainDistanceToAccurateChildFraction(chainDistanceB, true);\r\n // add a (possibly reversed) partial clone to newPath\r\n const newPath = Path.create();\r\n const addPartialChild = (\r\n childCurve: CurvePrimitive, childFraction0: number, childFraction1: number, reversedClone: boolean,\r\n ): boolean => {\r\n if (childFraction0 === childFraction1)\r\n return false;\r\n let newCurve;\r\n if (childFraction0 === 0.0 && childFraction1 === 1.0) {\r\n newCurve = childCurve.clone();\r\n if (reversedClone)\r\n newCurve.reverseInPlace();\r\n } else {\r\n newCurve = reversedClone ?\r\n childCurve.clonePartialCurve(childFraction1, childFraction0)\r\n : childCurve.clonePartialCurve(childFraction0, childFraction1);\r\n }\r\n if (newCurve) {\r\n newPath.children.push(newCurve);\r\n return true;\r\n }\r\n return false;\r\n };\r\n if (fragmentA.childCurve === fragmentB.childCurve) {\r\n // the two distances are within the same curve.\r\n if (addPartialChild(fragmentA.childCurve, childFractionA, childFractionB, reversed))\r\n return CurveChainWithDistanceIndex.createCapture(newPath, options); // singleton -- children[] does not need to be reversed.\r\n return undefined;\r\n }\r\n addPartialChild(this._path.children[childCurveIndexA], childFractionA, 1.0, reversed);\r\n // at least two distinct children are impacted ....\r\n for (let childIndex = childCurveIndexA + 1; childIndex < childCurveIndexB; childIndex++) {\r\n addPartialChild(this._path.children[childIndex], 0.0, 1.0, reversed);\r\n }\r\n addPartialChild(this._path.children[childCurveIndexB], 0.0, childFractionB, reversed);\r\n // This reverses array entries but not orientation within each curve ...\r\n if (reversed)\r\n newPath.children.reverse();\r\n return CurveChainWithDistanceIndex.createCapture(newPath, options);\r\n }\r\n /**\r\n * Ask if the curve is within tolerance of a plane.\r\n * @returns Returns true if the curve is completely within tolerance of the plane.\r\n */\r\n public isInPlane(plane: Plane3dByOriginAndUnitNormal): boolean {\r\n for (const c of this._path.children) {\r\n if (!c.isInPlane(plane))\r\n return false;\r\n }\r\n return true;\r\n }\r\n /** Return the start point of `this` curve. */\r\n public override startPoint(result?: Point3d): Point3d {\r\n const c = this._path.cyclicCurvePrimitive(0);\r\n if (c)\r\n return c.startPoint(result);\r\n return Point3d.createZero(result);\r\n }\r\n /** Return the end point of of `this` curve. */\r\n public override endPoint(result?: Point3d): Point3d {\r\n const c = this._path.cyclicCurvePrimitive(-1);\r\n if (c)\r\n return c.endPoint(result);\r\n return Point3d.createZero(result);\r\n }\r\n /** Add strokes to caller-supplied linestring */\r\n public emitStrokes(dest: LineString3d, options?: StrokeOptions): void {\r\n for (const c of this._path.children) {\r\n c.emitStrokes(dest, options);\r\n }\r\n }\r\n /**\r\n * Ask the curve to announce points and simple subcurve fragments for stroking.\r\n * See IStrokeHandler for description of the sequence of the method calls.\r\n */\r\n public emitStrokableParts(dest: IStrokeHandler, options?: StrokeOptions): void {\r\n for (const c of this._path.children) {\r\n c.emitStrokableParts(dest, options);\r\n }\r\n }\r\n /**\r\n * Return the stroke count required for given options.\r\n * @param options StrokeOptions that determine count\r\n */\r\n public computeStrokeCountForOptions(options?: StrokeOptions): number {\r\n let numStroke = 0;\r\n for (const c of this._path.children) {\r\n numStroke += c.computeStrokeCountForOptions(options);\r\n }\r\n return numStroke;\r\n }\r\n /**\r\n * Return an array containing only the curve primitives.\r\n * @param collectorArray array to receive primitives (pushed -- the array is not cleared)\r\n * @param smallestPossiblePrimitives if true, recurse on the children. If false, only push `this`.\r\n * @param explodeLinestrings (if smallestPossiblePrimitives is true) whether to push a [[LineSegment3d]] for each\r\n * segment of a [[LineString3d]] child. If false, push only the [[LineString3d]].\r\n */\r\n public override collectCurvePrimitivesGo(\r\n collectorArray: CurvePrimitive[], smallestPossiblePrimitives: boolean = false, explodeLineStrings: boolean = false,\r\n ): void {\r\n if (smallestPossiblePrimitives) {\r\n for (const c of this._path.children) {\r\n c.collectCurvePrimitivesGo(collectorArray, smallestPossiblePrimitives, explodeLineStrings);\r\n }\r\n } else {\r\n collectorArray.push(this);\r\n }\r\n }\r\n /**\r\n * Construct StrokeCountMap for each child, accumulating data to stroke count map for this primitive.\r\n * @param options StrokeOptions that determine count\r\n * @param parentStrokeMap evolving parent map.\r\n */\r\n public override computeAndAttachRecursiveStrokeCounts(options?: StrokeOptions, parentStrokeMap?: StrokeCountMap) {\r\n const myMap = StrokeCountMap.createWithCurvePrimitiveAndOptionalParent(this, parentStrokeMap);\r\n for (const c of this._path.children) {\r\n c.computeAndAttachRecursiveStrokeCounts(options, myMap);\r\n }\r\n CurvePrimitive.installStrokeCountMap(this, myMap, parentStrokeMap);\r\n }\r\n /**\r\n * Second step of double dispatch: call `this._path.dispatchToGeometryHandler (handler)`\r\n * * Note that this exposes the children individually to the handler.\r\n */\r\n public dispatchToGeometryHandler(handler: GeometryHandler): any {\r\n return handler.handleCurveChainWithDistanceIndex(this);\r\n }\r\n /** Extend `rangeToExtend` as needed to include these curves (optionally transformed) */\r\n public extendRange(rangeToExtend: Range3d, transform?: Transform): void {\r\n this._path.extendRange(rangeToExtend, transform);\r\n }\r\n /** Return a (high accuracy and positive) length of the curve between fractional positions */\r\n public override curveLengthBetweenFractions(fraction0: number, fraction1: number): number {\r\n return Math.abs(fraction1 - fraction0) * this._totalLength;\r\n }\r\n /** Flatten CurveChainWithDistanceIndex children in the input chain.\r\n * @return cloned flattened CurveChain, or reference to the input chain if no nesting\r\n */\r\n private static flattenNestedChains(chain: CurveChain): CurveChain {\r\n if (-1 === chain.children.findIndex((child: CurvePrimitive) => { return child instanceof CurveChainWithDistanceIndex; }))\r\n return chain;\r\n const flatChain = chain.clone() as CurveChain;\r\n const flatChildren = flatChain.children.flatMap((child: CurvePrimitive) => {\r\n if (child instanceof CurveChainWithDistanceIndex)\r\n return child.path.children;\r\n else\r\n return [child];\r\n },\r\n );\r\n flatChain.children.splice(0, Infinity, ...flatChildren);\r\n return flatChain;\r\n }\r\n /**\r\n * Capture (not clone) a path into a new `CurveChainWithDistanceIndex`.\r\n * @param path chain to be CAPTURED (not cloned)\r\n * @param options how finely to stroke the path to create the distance index\r\n */\r\n public static createCapture(path: CurveChain, options?: StrokeOptions): CurveChainWithDistanceIndex {\r\n path = this.flattenNestedChains(path); // nested chains not allowed\r\n const fragments = DistanceIndexConstructionContext.createPathFragmentIndex(path, options);\r\n return new CurveChainWithDistanceIndex(path, fragments);\r\n }\r\n /**\r\n * Return the PathFragment object at the given `distance` along the chain.\r\n * @param distance distance along the chain.\r\n * @param allowExtrapolation if `true`, returns first fragment for negative distances and returns last fragment\r\n * for distances larger than curve length. If `false` returns `undefined` for those out of bound distances.\r\n */\r\n public chainDistanceToFragment(distance: number, allowExtrapolation: boolean = false): PathFragment | undefined {\r\n const i = this.chainDistanceToFragmentIndex(distance, allowExtrapolation);\r\n if (undefined !== i)\r\n return this._fragments[i];\r\n return undefined;\r\n }\r\n /**\r\n * Return the index of the PathFragment at the given `distance` along the chain.\r\n * @param distance distance along the chain.\r\n * @param allowExtrapolation if `true`, returns 0 for negative distances and returns last fragment index for\r\n * distances larger than curve length. If `false` returns `undefined` for those out of bound distances.\r\n */\r\n protected chainDistanceToFragmentIndex(distance: number, allowExtrapolation: boolean = false): number | undefined {\r\n const numFragments = this._fragments.length;\r\n const fragments = this._fragments;\r\n if (numFragments > 0) {\r\n if (distance < 0.0)\r\n return allowExtrapolation ? 0 : undefined;\r\n if (distance > this._totalLength)\r\n return allowExtrapolation ? (numFragments - 1) : undefined;\r\n // linear search (opportunity for improvement)\r\n for (let i = 0; i < numFragments; i++) {\r\n if (fragments[i].containsChainDistance(distance))\r\n return i;\r\n }\r\n }\r\n return undefined;\r\n }\r\n /**\r\n * Convert distance along the chain to fraction along the chain.\r\n * @param distance distance along the chain.\r\n */\r\n public chainDistanceToChainFraction(distance: number): number {\r\n return distance / this._totalLength;\r\n }\r\n /** Return the PathFragment object containing the point at the given `fraction` of the given child curve. */\r\n public curveAndChildFractionToFragment(curve: CurvePrimitive, fraction: number): PathFragment | undefined {\r\n const numFragments = this._fragments.length;\r\n const fragments = this._fragments;\r\n if (numFragments > 0) {\r\n if (fraction < 0)\r\n return fragments[0];\r\n if (fraction > 1.0)\r\n return fragments[numFragments - 1];\r\n // linear search (opportunity for improvement)\r\n for (const fragment of fragments) {\r\n if (fragment.containsChildCurveAndChildFraction(curve, fraction))\r\n return fragment;\r\n }\r\n }\r\n return undefined;\r\n }\r\n /** Returns the total length of `this` curve. */\r\n public override curveLength(): number {\r\n return this._totalLength;\r\n }\r\n /**\r\n * Returns the total length of the path.\r\n * * This is exact (and simple property lookup) because the true lengths were summed at construction time.\r\n */\r\n public quickLength(): number {\r\n return this._totalLength;\r\n }\r\n /**\r\n * Return the point (x,y,z) on the curve at fractional position along the chain.\r\n * @param fraction fractional position along the curve.\r\n * @returns a point on the curve.\r\n */\r\n public fractionToPoint(fraction: number, result?: Point3d): Point3d {\r\n const distanceAlongPath = fraction * this._totalLength;\r\n const fragment = this.chainDistanceToFragment(distanceAlongPath, true);\r\n if (fragment) {\r\n const childFraction = fragment.chainDistanceToAccurateChildFraction(distanceAlongPath, true);\r\n return fragment.childCurve.fractionToPoint(childFraction, result);\r\n }\r\n assert(false); // we never expect to get here\r\n // no fragment found. just return the first point on the curve.\r\n return this._fragments[0].childCurve.fractionToPoint(0.0, result);\r\n }\r\n /**\r\n * Return the point (x,y,z) and derivative on the curve at fractional position.\r\n * * Note that the derivative is \"derivative of xyz with respect to fraction\".\r\n * * The derivative shows the speed of the \"fractional point\" moving along the curve.\r\n * * The derivative is not generally a unit vector. Use `fractionToPointAndUnitTangent` for a unit vector.\r\n * @param fraction fractional position along the geometry.\r\n * @param result optional receiver for the result.\r\n * @returns a ray whose origin is the curve point and direction is the derivative with respect to the fraction.\r\n */\r\n public fractionToPointAndDerivative(fraction: number, result?: Ray3d): Ray3d {\r\n const distanceAlongPath = fraction * this._totalLength;\r\n const fragment = this.chainDistanceToFragment(distanceAlongPath, true)!;\r\n const childFraction = fragment.chainDistanceToAccurateChildFraction(distanceAlongPath, true);\r\n result = fragment.childCurve.fractionToPointAndDerivative(childFraction, result);\r\n // Recall the standard arclength formula s(t) for the curve C = C(t), with derivative s'(t) = ||C'||.\r\n // Define fractional arclength for C by f = f(t) = s(t)/L, where L is the total length of C. Then f' = ||C'||/L.\r\n // Denote the inverse of f by t = t(f). Then C = C(t(f)) is a parameterization of C by its fractional arclength f.\r\n // Since the derivative of t is t'=1/f'=L/||C'||, the derivative we seek is d/df(C(t(f))) = C' t' = C' L/||C'||.\r\n // The fragment gives us C', so we're just a scale away.\r\n // Math details can be found at core/geometry/internaldocs/Curve.md\r\n const a = this._totalLength / result.direction.magnitude(); // L/||C'||\r\n result.direction.scaleInPlace(a);\r\n return result;\r\n }\r\n /**\r\n * Return the point (x,y,z) and normalized derivative on the curve at fractional position.\r\n * * Note that the derivative is \"derivative of xyz with respect to fraction\".\r\n * * The un-normalized derivative shows the speed of the \"fractional point\" moving along the curve.\r\n * * To find the un-normalized derivative, use `fractionToPointAndDerivative`.\r\n * @param fraction fractional position on the curve\r\n * @param result optional receiver for the result.\r\n * @returns a ray whose origin is the curve point and direction is the normalized derivative with respect to\r\n * the fraction.\r\n */\r\n public override fractionToPointAndUnitTangent(fraction: number, result?: Ray3d): Ray3d {\r\n const distanceAlongPath = fraction * this._totalLength;\r\n const fragment = this.chainDistanceToFragment(distanceAlongPath, true)!;\r\n const childFraction = fragment.chainDistanceToAccurateChildFraction(distanceAlongPath, true);\r\n result = fragment.childCurve.fractionToPointAndDerivative(childFraction, result);\r\n result.direction.normalizeInPlace();\r\n return result;\r\n }\r\n /**\r\n * Return a plane with\r\n * * origin at fractional position along the curve\r\n * * vectorU is the first derivative, i.e. tangent vector with length equal to the rate of change with respect to\r\n * the fraction.\r\n * * vectorV is the second derivative, i.e. derivative of vectorU which points in the direction of the curve's\r\n * derivative's change.\r\n */\r\n public fractionToPointAnd2Derivatives(\r\n fraction: number, result?: Plane3dByOriginAndVectors,\r\n ): Plane3dByOriginAndVectors | undefined {\r\n const distanceAlongPath = fraction * this._totalLength;\r\n const fragment = this.chainDistanceToFragment(distanceAlongPath, true)!;\r\n const childFraction = fragment.chainDistanceToAccurateChildFraction(distanceAlongPath, true);\r\n result = fragment.childCurve.fractionToPointAnd2Derivatives(childFraction, result);\r\n if (!result)\r\n return undefined;\r\n // See fractionToPointAndDerivative, where we show d/df(C(t(f))) = L C'/||C'||.\r\n // Here we seek the 2nd derivative. We'll use the quotient rule, and the identities\r\n // d/dt||x(t)|| = x.x'/||x|| and ||x||^2 = x.x, where \".\" is the dot product.\r\n // d2/df2(C(t(f))) = L d/df(C'/||C'||) = L (||C'|| d/df(C') - C' d/df||C'||) / ||C'||^2\r\n // = L (||C'|| C\" L/||C'|| - C' C'.C\"/||C'|| L/||C'||) / ||C'||^2\r\n // = (L/||C'||)^2 (C\" - C' C'.C\"/C'.C' ), where C' and C\" are given by the fragment.\r\n // The second derivative that fractionToPointAnd2Derivatives returns is C\", so the second\r\n // derivative we seek is just few scales away.\r\n // Math details can be found at core/geometry/internaldocs/Curve.md\r\n const magU = result.vectorU.magnitude(); // ||C'||\r\n const dotUU = magU * magU; // ||C'||^2\r\n const dotUV = result.vectorU.dotProduct(result.vectorV); // C'.C\"\r\n result.vectorV.addScaledInPlace(result.vectorU, -dotUV / dotUU); // add -(C'*C'.C\")/(||C'||^2) to vectorV\r\n const scale = this._totalLength / magU; // L/||C'||\r\n result.vectorU.scaleInPlace(scale); // scale vectorU by L/||C'||\r\n result.vectorV.scaleInPlace(scale * scale); // scale vectorV by (L/||C'(t)||)^2\r\n return result;\r\n }\r\n /**\r\n * Attempt to transform in place.\r\n * * Warning: If any child transform fails, `this` object becomes invalid but that should never happen.\r\n * @param transform the transform to be applied.\r\n * @returns true if all of child transforms succeed and false otherwise.\r\n */\r\n public tryTransformInPlace(transform: Transform): boolean {\r\n let numFail = 0;\r\n for (const c of this._path.children) {\r\n if (!c.tryTransformInPlace(transform))\r\n numFail++;\r\n }\r\n return numFail === 0;\r\n }\r\n /** Reverse the curve's data so that its fractional stroking moves in the opposite direction. */\r\n public reverseInPlace(): void {\r\n this._path.reverseChildrenInPlace();\r\n for (const fragment of this._fragments) {\r\n fragment.reverseFractionsAndDistances(this._totalLength);\r\n }\r\n this._fragments.reverse();\r\n }\r\n /**\r\n * Test for equality conditions.\r\n * * Mismatched total length is a quick exit condition.\r\n * * If total length matches, recurse to the path for matching primitives.\r\n */\r\n public override isAlmostEqual(other: GeometryQuery): boolean {\r\n if (other instanceof CurveChainWithDistanceIndex) {\r\n return Geometry.isSameCoordinate(this._totalLength, other._totalLength) && this._path.isAlmostEqual(other._path);\r\n }\r\n return false;\r\n }\r\n /**\r\n * (Attempt to) find a position on the curve at a signed distance from start fraction.\r\n * * See `CurvePrimitive.moveSignedDistanceFromFraction` for parameter details.\r\n * * The returned location directly identifies fractional position along the CurveChainWithDistanceIndex and\r\n * has pointer to an additional detail for the child curve.\r\n */\r\n public override moveSignedDistanceFromFraction(\r\n startFraction: number, signedDistance: number, allowExtension: boolean, result?: CurveLocationDetail,\r\n ): CurveLocationDetail {\r\n const distanceA = startFraction * this._totalLength;\r\n const distanceB = distanceA + signedDistance;\r\n const fragmentB = this.chainDistanceToFragment(distanceB, true)!;\r\n const childDetail = fragmentB.childCurve.moveSignedDistanceFromFraction(\r\n fragmentB.childFraction0, distanceB - fragmentB.chainDistance0, allowExtension, result?.childDetail,\r\n ); // local detail related to the child curve\r\n const endFraction = startFraction + (signedDistance / this._totalLength);\r\n const chainDetail = CurveLocationDetail.createConditionalMoveSignedDistance(\r\n allowExtension, this, startFraction, endFraction, signedDistance, result,\r\n ); // global detail related to the curve chain\r\n chainDetail.childDetail = childDetail;\r\n return chainDetail;\r\n }\r\n /**\r\n * Return an object summarizing closest point test counts.\r\n * The returned object has\r\n * * numCalls = number of times closestPoint was called.\r\n * * numCurvesTested = number of curves tested with full closestPoint.\r\n * * numAssigned = number of times a new minimum value was recorded.\r\n * * numCandidate = number of curves that would be tested in worst case.\r\n * @param clear if true, counts are cleared after the return object is formed.\r\n */\r\n public static getClosestPointTestCounts(\r\n clear: boolean = true,\r\n ): { numCalls: number, numTested: number, numAssigned: number, numCandidate: number } {\r\n const a = {\r\n numCalls: this._numCalls,\r\n numTested: this._numTested,\r\n numAssigned: this._numAssigned,\r\n numCandidate: this._numCandidate,\r\n };\r\n if (clear) {\r\n this._numTested = this._numAssigned = this._numCandidate = 0;\r\n }\r\n return a;\r\n }\r\n /**\r\n * Search for the curve point that is closest to the spacePoint.\r\n * * The CurveChainWithDistanceIndex invokes the base class CurvePrimitive method, which (via a handler)\r\n * determines a CurveLocation detail among the children.\r\n * * The returned detail directly identifies fractional position along the CurveChainWithDistanceIndex and\r\n * has pointer to an additional detail for the child curve.\r\n * @param spacePoint point in space\r\n * @param extend true to extend the curve\r\n * @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(spacePoint: Point3d, extend: VariantCurveExtendParameter, result?: CurveLocationDetail): CurveLocationDetail | undefined {\r\n let childDetail: CurveLocationDetail | undefined;\r\n let aMin = Number.MAX_VALUE;\r\n const numChildren = this.path.children.length;\r\n if (numChildren === 1) {\r\n childDetail = this.path.children[0].closestPoint(spacePoint, extend);\r\n } else {\r\n const sortedFragments = PathFragment.collectSortedQuickMinDistances(this._fragments, spacePoint);\r\n const extend0 = [\r\n CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(extend, 0),\r\n CurveExtendMode.None,\r\n ];\r\n const extend1 = [\r\n CurveExtendMode.None,\r\n CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(extend, 1),\r\n ];\r\n const fragment0 = this._fragments[0];\r\n const fragment1 = this._fragments[this._fragments.length - 1];\r\n CurveChainWithDistanceIndex._numCalls++;\r\n CurveChainWithDistanceIndex._numCandidate += sortedFragments.length;\r\n let detailA: CurveLocationDetail | undefined;\r\n for (const sortedFragment of sortedFragments) {\r\n if (sortedFragment.a > aMin)\r\n // sortedFragments help early exit because it is likely that one of the first few fragments\r\n // in sortedFragments is the fragment with minimum distance from space point to the curve.\r\n break;\r\n CurveChainWithDistanceIndex._numTested++;\r\n const child = sortedFragment.childCurve;\r\n detailA = child.closestPoint(\r\n spacePoint, sortedFragment === fragment0 ? extend0 : sortedFragment === fragment1 ? extend1 : false, detailA,\r\n );\r\n if (detailA && detailA.a < aMin) {\r\n aMin = detailA.a;\r\n childDetail = detailA.clone(childDetail);\r\n CurveChainWithDistanceIndex._numAssigned++;\r\n }\r\n }\r\n }\r\n if (!childDetail)\r\n return undefined;\r\n return this.computeChainDetail(childDetail, result);\r\n }\r\n /**\r\n * Construct an offset of each child as viewed in the xy-plane (ignoring z).\r\n * * No attempt is made to join the offset children. Use RegionOps.constructCurveXYOffset to return a fully\r\n * joined offset.\r\n * @param offsetDistanceOrOptions offset distance (positive to left of the instance curve) or offset options object.\r\n */\r\n public override constructOffsetXY(\r\n offsetDistanceOrOptions: number | OffsetOptions,\r\n ): CurvePrimitive | CurvePrimitive[] | undefined {\r\n const options = OffsetOptions.create(offsetDistanceOrOptions);\r\n const offsets: CurvePrimitive[] = [];\r\n for (const prim of this.collectCurvePrimitives(undefined, true, true)) {\r\n const offset = prim.constructOffsetXY(options);\r\n if (offset !== undefined) {\r\n if (offset instanceof CurvePrimitive)\r\n offsets.push(offset);\r\n else if (Array.isArray(offset))\r\n offset.forEach((cp) => offsets.push(cp));\r\n }\r\n }\r\n return offsets;\r\n }\r\n /**\r\n * Project instance geometry (via dispatch) onto the given ray, and return the extreme fractional parameters of\r\n * projection.\r\n * @param ray ray onto which the instance is projected. A `Vector3d` is treated as a `Ray3d` with zero origin.\r\n * @param lowHigh optional receiver for output.\r\n * @returns range of fractional projection parameters onto the ray, where 0.0 is start of the ray and 1.0 is the\r\n * end of the ray.\r\n */\r\n public override projectedParameterRange(ray: Vector3d | Ray3d, lowHigh?: Range1d): Range1d | undefined {\r\n return PlaneAltitudeRangeContext.findExtremeFractionsAlongDirection(this, ray, lowHigh);\r\n }\r\n /**\r\n * Compute the global chain detail corresponding to a local child detail.\r\n * @param childDetail the local (fragment) detail, captured as-is.\r\n * @param result optional pre-allocated detail to populate and return.\r\n * @returns global (chain) detail with its `childDetail` field pointing to the input and its `a`\r\n * field copied from the input, but if a PathFragment for `childDetail` cannot be resolved, return undefined.\r\n */\r\n public computeChainDetail(childDetail: CurveLocationDetail, result?: CurveLocationDetail): CurveLocationDetail | undefined {\r\n if (!childDetail.curve)\r\n return undefined;\r\n const fragment = this.curveAndChildFractionToFragment(childDetail.curve, childDetail.fraction);\r\n if (fragment) {\r\n const chainDistance = fragment.childFractionToChainDistance(childDetail.fraction);\r\n const chainFraction = this.chainDistanceToChainFraction(chainDistance);\r\n const chainDetail = CurveLocationDetail.createCurveFractionPoint(this, chainFraction, childDetail.point, result);\r\n chainDetail.childDetail = childDetail;\r\n chainDetail.a = childDetail.a;\r\n return chainDetail;\r\n }\r\n return undefined;\r\n }\r\n /**\r\n * Given a parent chain, convert the corresponding child details in the specified pairs.\r\n * * Converted details refer to the chain's global parameterization instead of the child's.\r\n * * It is assumed that for all i >= index0, `pairs[i].detailA.curve` is a child of chainA (similarly for chainB).\r\n * @param pairs array to mutate\r\n * @param index0 convert details of pairs in the tail of the array, starting at index0\r\n * @param chainA convert each specified detailA to the global parameterization of chainA\r\n * @param chainB convert each specified detailB to the global parameterization of chainB\r\n * @param compressAdjacent whether to remove adjacent duplicate pairs after conversion\r\n * @return the converted array\r\n * @internal\r\n */\r\n public static convertChildDetailToChainDetail(\r\n pairs: CurveLocationDetailPair[],\r\n index0: number,\r\n chainA?: CurveChainWithDistanceIndex,\r\n chainB?: CurveChainWithDistanceIndex,\r\n compressAdjacent?: boolean,\r\n ): CurveLocationDetailPair[] {\r\n for (let i = index0; i < pairs.length; ++i) {\r\n const childDetailPair = pairs[i];\r\n if (chainA) {\r\n const chainDetail = chainA.computeChainDetail(childDetailPair.detailA);\r\n if (chainDetail)\r\n childDetailPair.detailA = chainDetail;\r\n }\r\n if (chainB) {\r\n const chainDetail = chainB.computeChainDetail(childDetailPair.detailB);\r\n if (chainDetail)\r\n childDetailPair.detailB = chainDetail;\r\n }\r\n }\r\n if (compressAdjacent)\r\n pairs = CurveLocationDetailPair.removeAdjacentDuplicates(pairs, index0);\r\n return pairs;\r\n }\r\n}\r\n"]}
|
|
1
|
+
{"version":3,"file":"CurveChainWithDistanceIndex.js","sourceRoot":"","sources":["../../../src/curve/CurveChainWithDistanceIndex.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F;;GAEG;AACH,sDAA6C;AAC7C,4DAAyD;AACzD,kEAA+D;AAC/D,0CAAuC;AAIvC,mEAAkE;AAClE,+CAAuD;AACvD,+CAA4C;AAG5C,uDAAqG;AACrG,+DAAwG;AAExG,4FAAyF;AAEzF,mDAAgD;AAChD,iCAA8B;AAG9B;;;;;;GAMG;AACH,MAAa,YAAY;IACvB,oDAAoD;IAC7C,cAAc,CAAS;IAC9B,kDAAkD;IAC3C,cAAc,CAAS;IAC9B,8FAA8F;IACvF,cAAc,CAAS;IAC9B,4FAA4F;IACrF,cAAc,CAAS;IAC9B,2GAA2G;IACpG,UAAU,CAAiB;IAClC,qBAAqB;IACd,KAAK,CAAW;IACvB,uCAAuC;IAChC,CAAC,CAAS;IACjB,0EAA0E;IAC1E,YACE,cAAsB,EACtB,cAAsB,EACtB,SAAiB,EACjB,SAAiB,EACjB,UAA0B,EAC1B,KAAe;QAEf,IAAI,CAAC,cAAc,GAAG,cAAc,CAAC;QACrC,IAAI,CAAC,cAAc,GAAG,cAAc,CAAC;QACrC,IAAI,CAAC,cAAc,GAAG,SAAS,CAAC;QAChC,IAAI,CAAC,cAAc,GAAG,SAAS,CAAC;QAChC,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;QAC7B,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;IACb,CAAC;IACD,kFAAkF;IAC3E,qBAAqB,CAAC,QAAgB;QAC3C,OAAO,QAAQ,IAAI,IAAI,CAAC,cAAc,IAAI,QAAQ,IAAI,IAAI,CAAC,cAAc,CAAC;IAC5E,CAAC;IACD;;;;OAIG;IACI,4BAA4B,CAAC,UAAmB;QACrD,IAAI,IAAI,CAAC,KAAK;YACZ,OAAO,IAAI,CAAC,KAAK,CAAC,eAAe,CAAC,UAAU,CAAC,CAAC;QAChD,MAAM,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC,YAAY,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;QAC/D,IAAI,MAAM;YACR,OAAO,MAAM,CAAC,CAAC,CAAC;QAClB,OAAO,CAAC,CAAC;IACX,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,8BAA8B,CAAC,SAAyB,EAAE,UAAmB;QACzF,MAAM,eAAe,GAAmB,EAAE,CAAC;QAC3C,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;YAC7B,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,4BAA4B,CAAC,UAAU,CAAC,CAAC;YACvD,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC7B,CAAC;QACD,eAAe,CAAC,IAAI,CAAC,CAAC,KAAmB,EAAE,KAAmB,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACtF,OAAO,eAAe,CAAC;IACzB,CAAC;IACD,gFAAgF;IACzE,kCAAkC,CAAC,KAAqB,EAAE,QAAgB;QAC/E,OAAO,IAAI,CAAC,UAAU,KAAK,KAAK,IAAI,QAAQ,IAAI,IAAI,CAAC,cAAc,IAAI,QAAQ,IAAI,IAAI,CAAC,cAAc,CAAC;IACzG,CAAC;IACD;;;OAGG;IACI,wCAAwC,CAAC,QAAgB;QAC9D,MAAM,aAAa,GAAG,mBAAQ,CAAC,kBAAkB,CAC/C,IAAI,CAAC,cAAc,EACnB,IAAI,CAAC,cAAc,EACnB,IAAI,CAAC,cAAc,EACnB,IAAI,CAAC,cAAc,EACnB,QAAQ,EACR,IAAI,CAAC,cAAc,CACpB,CAAC;QACF,IAAA,qBAAM,EAAC,aAAa,KAAK,SAAS,EAAE,yDAAyD,CAAC,CAAC;QAC/F,OAAO,aAAa,CAAC;IACvB,CAAC;IACD;;;;;;;OAOG;IACI,oCAAoC,CAAC,aAAqB,EAAE,kBAA4B;QAC7F,MAAM,WAAW,GAAG,IAAI,CAAC,UAAU,CAAC,8BAA8B,CAChE,IAAI,CAAC,cAAc,EAAE,aAAa,GAAG,IAAI,CAAC,cAAc,EAAE,kBAAkB,IAAI,KAAK,CACtF,CAAC;QACF,OAAO,WAAW,CAAC,QAAQ,CAAC;IAC9B,CAAC;IACD;;;OAGG;IACI,mBAAmB,CAAC,cAAsB;QAC/C,OAAO,cAAc,GAAG,CAAC,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC,cAAc,CAAC,CAAC;IACpH,CAAC;IACD;;;;;OAKG;IACI,4BAA4B,CAAC,aAAqB;QACvD,MAAM,EAAE,GAAG,IAAI,CAAC,cAAc,CAAC;QAC/B,MAAM,EAAE,GAAG,IAAI,CAAC,cAAc,CAAC;QAC/B,MAAM,EAAE,GAAG,IAAI,CAAC,cAAc,CAAC;QAC/B,MAAM,EAAE,GAAG,IAAI,CAAC,cAAc,CAAC;QAC/B,IAAI,CAAC,cAAc,GAAG,GAAG,GAAG,EAAE,CAAC;QAC/B,IAAI,CAAC,cAAc,GAAG,GAAG,GAAG,EAAE,CAAC;QAC/B,IAAI,CAAC,cAAc,GAAG,aAAa,GAAG,EAAE,CAAC;QACzC,IAAI,CAAC,cAAc,GAAG,aAAa,GAAG,EAAE,CAAC;IAC3C,CAAC;IACD;;;;OAIG;IACI,4BAA4B,CAAC,QAAgB;QAClD,IAAI,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,2BAA2B,CAAC,IAAI,CAAC,cAAc,EAAE,QAAQ,CAAC,CAAC;QACnF,IAAI,QAAQ,GAAG,IAAI,CAAC,cAAc;YAChC,CAAC,GAAG,CAAC,CAAC,CAAC;QACT,OAAO,IAAI,CAAC,cAAc,GAAG,CAAC,CAAC;IACjC,CAAC;CACF;AAlID,oCAkIC;AAED,0EAA0E;AAC1E,MAAM,gCAAgC;IAC5B,UAAU,CAAiB;IAC3B,oBAAoB,CAAS;IACrC;QACE,IAAI,CAAC,oBAAoB,GAAG,CAAC,CAAC;QAC9B,IAAI,CAAC,UAAU,GAAG,EAAE,CAAC;IACvB,CAAC;IACD,0EAA0E;IACnE,yBAAyB,CAAC,GAAmB,IAAI,CAAC;IAClD,mBAAmB,CAAC,GAAmB,IAAI,CAAC;IAC5C,uBAAuB,CAAC,GAAmB,IAAI,CAAC;IAChD,iBAAiB,CAAC,GAAmB,IAAI,CAAC;IAC1C,oBAAoB,CAAC,IAAa,EAAE,SAAiB,EAAE,QAAkB,IAAI,CAAC;IAC9E,uBAAuB,CAC5B,EAAkB,EAAE,MAAe,EAAE,MAAe,EAAE,UAAkB,EAAE,SAAiB,EAAE,SAAiB;QAE9G,MAAM,cAAc,GAAG,MAAM,CAAC,KAAK,EAAE,CAAC;QACtC,MAAM,cAAc,GAAG,MAAM,CAAC,KAAK,EAAE,CAAC;QACtC,IAAI,EAAE,GAAG,IAAI,CAAC,oBAAoB,CAAC;QACnC,IAAI,UAAU,IAAI,CAAC,EAAE,CAAC;YACpB,IAAI,CAAC,oBAAoB,IAAI,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;YACrD,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,YAAY,CAAC,SAAS,EAAE,SAAS,EAAE,EAAE,EAAE,IAAI,CAAC,oBAAoB,EAAE,EAAE,EAC3F,eAAO,CAAC,MAAM,CAAC,cAAc,EAAE,cAAc,CAAC,CAAC,CAAC,CAAC;QACrD,CAAC;aAAM,CAAC;YACN,IAAI,EAAE,CAAC;YACP,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,SAAS,EAAE,CAAC,IAAI,UAAU,EAAE,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,CAAC;gBAC9D,EAAE,GAAG,mBAAQ,CAAC,WAAW,CAAC,SAAS,EAAE,CAAC,GAAG,UAAU,EAAE,SAAS,CAAC,CAAC;gBAChE,MAAM,CAAC,WAAW,CAAC,EAAE,EAAE,MAAM,EAAE,cAAc,CAAC,CAAC;gBAC/C,EAAE,GAAG,IAAI,CAAC,oBAAoB,CAAC;gBAC/B,IAAI,CAAC,oBAAoB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC;gBAC3E,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,YAAY,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,oBAAoB,EAAE,EAAE,EAC7E,eAAO,CAAC,MAAM,CAAC,cAAc,EAAE,cAAc,CAAC,CAAC,CAAC,CAAC;gBACnD,cAAc,CAAC,OAAO,CAAC,cAAc,CAAC,CAAC;YACzC,CAAC;QACH,CAAC;IACH,CAAC;IACM,qCAAqC,CAC1C,EAAkB,EAAE,UAAkB,EAAE,SAAiB,EAAE,SAAiB;QAE5E,IAAI,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;QACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,SAAS,EAAE,CAAC,IAAI,UAAU,EAAE,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,CAAC;YAC9D,EAAE,GAAG,mBAAQ,CAAC,WAAW,CAAC,SAAS,EAAE,CAAC,GAAG,UAAU,EAAE,SAAS,CAAC,CAAC;YAChE,CAAC,GAAG,EAAE,CAAC,2BAA2B,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YAC3C,EAAE,GAAG,IAAI,CAAC,oBAAoB,CAAC;YAC/B,IAAI,CAAC,oBAAoB,IAAI,CAAC,CAAC;YAC/B,MAAM,KAAK,GAAG,EAAE,CAAC,qBAAqB,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YAC/C,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,YAAY,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,oBAAoB,EAAE,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC;QAC3F,CAAC;IACH,CAAC;IACM,6BAA6B;QAClC,OAAO,IAAI,CAAC;IACd,CAAC;IACD,8DAA8D;IACvD,MAAM,CAAC,uBAAuB,CAAC,IAAgB,EAAE,OAAuB;QAC7E,MAAM,OAAO,GAAG,IAAI,gCAAgC,EAAE,CAAC;QACvD,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAClC,KAAK,CAAC,kBAAkB,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;QAC7C,CAAC;QACD,MAAM,SAAS,GAAG,OAAO,CAAC,UAAU,CAAC;QACrC,OAAO,SAAS,CAAC;IACnB,CAAC;CACF;AACD;;;;;;;;;;GAUG;AACH,MAAa,2BAA4B,SAAQ,+BAAc;IAC7D,wCAAwC;IACxB,kBAAkB,GAAG,6BAA6B,CAAC;IAClD,KAAK,CAAO;IACZ,UAAU,CAAiB;IAC3B,YAAY,CAAS,CAAC,oCAAoC;IACnE,MAAM,CAAC,SAAS,GAAG,CAAC,CAAC;IACrB,MAAM,CAAC,UAAU,GAAG,CAAC,CAAC;IACtB,MAAM,CAAC,YAAY,GAAG,CAAC,CAAC;IACxB,MAAM,CAAC,aAAa,GAAG,CAAC,CAAC;IACjC,yDAAyD;IAClD,mBAAmB,CAAC,KAAoB;QAC7C,OAAO,KAAK,YAAY,2BAA2B,CAAC;IACtD,CAAC;IACD,4FAA4F;IAC5F,YAAoB,IAAgB,EAAE,SAAyB;QAC7D,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,KAAK,GAAG,IAAI,YAAY,WAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,WAAI,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,oCAAoC;QAC9G,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;QAC5B,IAAI,CAAC,YAAY,GAAG,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC;IAChG,CAAC;IACD;;;;OAIG;IACI,gBAAgB,CAAC,SAAoB,EAAE,OAAuB;QACnE,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,EAAU,CAAC;QACrC,IAAI,CAAC,CAAC,mBAAmB,CAAC,SAAS,CAAC;YAClC,OAAO,2BAA2B,CAAC,aAAa,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;QAC/D,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;OAGG;IACH,IAAW,IAAI;QACb,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IACD;;;OAGG;IACH,IAAW,SAAS;QAClB,OAAO,IAAI,CAAC,UAAU,CAAC;IACzB,CAAC;IACD;;;OAGG;IACI,KAAK,CAAC,OAAuB;QAClC,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,EAAU,CAAC;QACrC,OAAO,2BAA2B,CAAC,aAAa,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;IAC/D,CAAC;IACD;;;;;;;OAOG;IACa,iBAAiB,CAAC,SAAuC,EAAE,SAAuC,EAAE,OAAuB;QACzI,MAAM,WAAW,GAAG,SAAS,YAAY,yCAAmB,CAAC;QAC7D,MAAM,WAAW,GAAG,SAAS,YAAY,yCAAmB,CAAC;QAC7D,IAAI,cAAc,GAAG,WAAW,CAAC,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC;QAClE,IAAI,cAAc,GAAG,WAAW,CAAC,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC;QAClE,IAAI,cAAc,KAAK,cAAc;YACnC,OAAO,SAAS,CAAC;QACnB,MAAM,QAAQ,GAAG,cAAc,GAAG,cAAc,CAAC;QACjD,IAAI,QAAQ;YACV,CAAC,cAAc,EAAE,cAAc,CAAC,GAAG,CAAC,cAAc,EAAE,cAAc,CAAC,CAAC;QACtE,MAAM,cAAc,GAAG,cAAc,GAAG,IAAI,CAAC,YAAY,CAAC;QAC1D,MAAM,cAAc,GAAG,cAAc,GAAG,IAAI,CAAC,YAAY,CAAC;QAC1D,MAAM,SAAS,GAAG,IAAI,CAAC,uBAAuB,CAAC,cAAc,EAAE,IAAI,CAAC,CAAC;QACrE,IAAI,CAAC,SAAS;YACZ,OAAO,SAAS,CAAC;QACnB,MAAM,SAAS,GAAG,IAAI,CAAC,uBAAuB,CAAC,cAAc,EAAE,IAAI,CAAC,CAAC;QACrE,IAAI,CAAC,SAAS;YACZ,OAAO,SAAS,CAAC;QACnB,MAAM,gBAAgB,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,SAAS,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;QAC3E,IAAI,SAAS,KAAK,gBAAgB;YAChC,OAAO,SAAS,CAAC;QACnB,MAAM,gBAAgB,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,SAAS,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;QAC3E,IAAI,SAAS,KAAK,gBAAgB;YAChC,OAAO,SAAS,CAAC;QACnB,MAAM,cAAc,GAAG,WAAW,IAAI,SAAS,CAAC,WAAW,CAAC,CAAC,CAAC,SAAS,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC,oCAAoC,CAAC,cAAc,EAAE,IAAI,CAAC,CAAC;QACpK,MAAM,cAAc,GAAG,WAAW,IAAI,SAAS,CAAC,WAAW,CAAC,CAAC,CAAC,SAAS,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC,oCAAoC,CAAC,cAAc,EAAE,IAAI,CAAC,CAAC;QACpK,qDAAqD;QACrD,MAAM,OAAO,GAAG,WAAI,CAAC,MAAM,EAAE,CAAC;QAC9B,MAAM,eAAe,GAAG,CACtB,UAA0B,EAAE,cAAsB,EAAE,cAAsB,EAAE,aAAsB,EACzF,EAAE;YACX,IAAI,cAAc,KAAK,cAAc;gBACnC,OAAO,KAAK,CAAC;YACf,IAAI,QAAQ,CAAC;YACb,IAAI,cAAc,KAAK,GAAG,IAAI,cAAc,KAAK,GAAG,EAAE,CAAC;gBACrD,QAAQ,GAAG,UAAU,CAAC,KAAK,EAAE,CAAC;gBAC9B,IAAI,aAAa;oBACf,QAAQ,CAAC,cAAc,EAAE,CAAC;YAC9B,CAAC;iBAAM,CAAC;gBACN,QAAQ,GAAG,aAAa,CAAC,CAAC;oBACxB,UAAU,CAAC,iBAAiB,CAAC,cAAc,EAAE,cAAc,CAAC;oBAC5D,CAAC,CAAC,UAAU,CAAC,iBAAiB,CAAC,cAAc,EAAE,cAAc,CAAC,CAAC;YACnE,CAAC;YACD,IAAI,QAAQ,EAAE,CAAC;gBACb,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBAChC,OAAO,IAAI,CAAC;YACd,CAAC;YACD,OAAO,KAAK,CAAC;QACf,CAAC,CAAC;QACF,IAAI,SAAS,CAAC,UAAU,KAAK,SAAS,CAAC,UAAU,EAAE,CAAC;YAClD,+CAA+C;YAC/C,IAAI,eAAe,CAAC,SAAS,CAAC,UAAU,EAAE,cAAc,EAAE,cAAc,EAAE,QAAQ,CAAC;gBACjF,OAAO,2BAA2B,CAAC,aAAa,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,wDAAwD;YAC9H,OAAO,SAAS,CAAC;QACnB,CAAC;QACD,eAAe,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,gBAAgB,CAAC,EAAE,cAAc,EAAE,GAAG,EAAE,QAAQ,CAAC,CAAC;QACtF,mDAAmD;QACnD,KAAK,IAAI,UAAU,GAAG,gBAAgB,GAAG,CAAC,EAAE,UAAU,GAAG,gBAAgB,EAAE,UAAU,EAAE,EAAE,CAAC;YACxF,eAAe,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,UAAU,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,QAAQ,CAAC,CAAC;QACvE,CAAC;QACD,eAAe,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,gBAAgB,CAAC,EAAE,GAAG,EAAE,cAAc,EAAE,QAAQ,CAAC,CAAC;QACtF,wEAAwE;QACxE,IAAI,QAAQ;YACV,OAAO,CAAC,QAAQ,CAAC,OAAO,EAAE,CAAC;QAC7B,OAAO,2BAA2B,CAAC,aAAa,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;IACrE,CAAC;IACD;;;OAGG;IACI,SAAS,CAAC,KAAmC;QAClD,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC;YACpC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC;gBACrB,OAAO,KAAK,CAAC;QACjB,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IACD;;;OAGG;IACa,UAAU,CAAC,MAAgB;QACzC,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC;QAC7C,IAAA,qBAAM,EAAC,CAAC,KAAK,SAAS,EAAE,mDAAmD,CAAC,CAAC;QAC7E,OAAO,CAAC,EAAE,UAAU,CAAC,MAAM,CAAC,IAAI,yBAAO,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;IAC7D,CAAC;IACD;;;OAGG;IACa,QAAQ,CAAC,MAAgB;QACvC,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9C,IAAA,qBAAM,EAAC,CAAC,KAAK,SAAS,EAAE,mDAAmD,CAAC,CAAC;QAC7E,OAAO,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,IAAI,yBAAO,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;IAC3D,CAAC;IACD,gDAAgD;IACzC,WAAW,CAAC,IAAkB,EAAE,OAAuB;QAC5D,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC;YACpC,CAAC,CAAC,WAAW,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QAC/B,CAAC;IACH,CAAC;IACD;;;OAGG;IACI,kBAAkB,CAAC,IAAoB,EAAE,OAAuB;QACrE,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC;YACpC,CAAC,CAAC,kBAAkB,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QACtC,CAAC;IACH,CAAC;IACD;;;OAGG;IACI,4BAA4B,CAAC,OAAuB;QACzD,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC;YACpC,SAAS,IAAI,CAAC,CAAC,4BAA4B,CAAC,OAAO,CAAC,CAAC;QACvD,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;OAMG;IACa,wBAAwB,CACtC,cAAgC,EAAE,6BAAsC,KAAK,EAAE,qBAA8B,KAAK;QAElH,IAAI,0BAA0B,EAAE,CAAC;YAC/B,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC;gBACpC,CAAC,CAAC,wBAAwB,CAAC,cAAc,EAAE,0BAA0B,EAAE,kBAAkB,CAAC,CAAC;YAC7F,CAAC;QACH,CAAC;aAAM,CAAC;YACN,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC5B,CAAC;IACH,CAAC;IACD;;;;OAIG;IACa,qCAAqC,CAAC,OAAuB,EAAE,eAAgC;QAC7G,MAAM,KAAK,GAAG,+BAAc,CAAC,yCAAyC,CAAC,IAAI,EAAE,eAAe,CAAC,CAAC;QAC9F,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC;YACpC,CAAC,CAAC,qCAAqC,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;QAC1D,CAAC;QACD,+BAAc,CAAC,qBAAqB,CAAC,IAAI,EAAE,KAAK,EAAE,eAAe,CAAC,CAAC;IACrE,CAAC;IACD;;;OAGG;IACI,yBAAyB,CAAC,OAAwB;QACvD,OAAO,OAAO,CAAC,iCAAiC,CAAC,IAAI,CAAC,CAAC;IACzD,CAAC;IACD,wFAAwF;IACjF,WAAW,CAAC,aAAsB,EAAE,SAAqB;QAC9D,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,aAAa,EAAE,SAAS,CAAC,CAAC;IACnD,CAAC;IACD,6FAA6F;IAC7E,2BAA2B,CAAC,SAAiB,EAAE,SAAiB;QAC9E,OAAO,IAAI,CAAC,GAAG,CAAC,SAAS,GAAG,SAAS,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC;IAC7D,CAAC;IACD;;MAEE;IACM,MAAM,CAAC,mBAAmB,CAAC,KAAiB;QAClD,IAAI,CAAC,CAAC,KAAK,KAAK,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,KAAqB,EAAE,EAAE,GAAG,OAAO,KAAK,YAAY,2BAA2B,CAAC,CAAC,CAAC,CAAC;YACtH,OAAO,KAAK,CAAC;QACf,MAAM,SAAS,GAAG,KAAK,CAAC,KAAK,EAAgB,CAAC;QAC9C,MAAM,YAAY,GAAG,SAAS,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,KAAqB,EAAE,EAAE;YACxE,IAAI,KAAK,YAAY,2BAA2B;gBAC9C,OAAO,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC;;gBAE3B,OAAO,CAAC,KAAK,CAAC,CAAC;QACnB,CAAC,CACA,CAAC;QACF,SAAS,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,QAAQ,EAAE,GAAG,YAAY,CAAC,CAAC;QACxD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,aAAa,CAAC,IAAgB,EAAE,OAAuB;QACnE,IAAI,GAAG,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,CAAC,CAAE,4BAA4B;QACpE,MAAM,SAAS,GAAG,gCAAgC,CAAC,uBAAuB,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QAC1F,OAAO,IAAI,2BAA2B,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;IAC1D,CAAC;IACD;;;;;OAKG;IACI,uBAAuB,CAAC,QAAgB,EAAE,qBAA8B,KAAK;QAClF,MAAM,CAAC,GAAG,IAAI,CAAC,4BAA4B,CAAC,QAAQ,EAAE,kBAAkB,CAAC,CAAC;QAC1E,IAAI,SAAS,KAAK,CAAC;YACjB,OAAO,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QAC5B,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;OAKG;IACO,4BAA4B,CAAC,QAAgB,EAAE,qBAA8B,KAAK;QAC1F,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC;QAClC,MAAM,YAAY,GAAG,SAAS,CAAC,MAAM,CAAC;QACtC,IAAA,qBAAM,EAAC,YAAY,GAAG,CAAC,EAAE,mDAAmD,CAAC,CAAC;QAC9E,IAAI,YAAY,GAAG,CAAC,EAAE,CAAC;YACrB,IAAI,QAAQ,GAAG,GAAG;gBAChB,OAAO,kBAAkB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;YAC5C,IAAI,QAAQ,GAAG,IAAI,CAAC,YAAY;gBAC9B,OAAO,kBAAkB,CAAC,CAAC,CAAC,CAAC,YAAY,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;YAC7D,8CAA8C;YAC9C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,EAAE,CAAC,EAAE,EAAE,CAAC;gBACtC,IAAI,SAAS,CAAC,CAAC,CAAC,CAAC,qBAAqB,CAAC,QAAQ,CAAC;oBAC9C,OAAO,CAAC,CAAC;YACb,CAAC;QACH,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;OAGG;IACI,4BAA4B,CAAC,QAAgB;QAClD,OAAO,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC;IACtC,CAAC;IACD,4GAA4G;IACrG,+BAA+B,CAAC,KAAqB,EAAE,QAAgB;QAC5E,MAAM,YAAY,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC;QAC5C,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC;QAClC,IAAI,YAAY,GAAG,CAAC,EAAE,CAAC;YACrB,IAAI,QAAQ,GAAG,CAAC;gBACd,OAAO,SAAS,CAAC,CAAC,CAAC,CAAC;YACtB,IAAI,QAAQ,GAAG,GAAG;gBAChB,OAAO,SAAS,CAAC,YAAY,GAAG,CAAC,CAAC,CAAC;YACrC,8CAA8C;YAC9C,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;gBACjC,IAAI,QAAQ,CAAC,kCAAkC,CAAC,KAAK,EAAE,QAAQ,CAAC;oBAC9D,OAAO,QAAQ,CAAC;YACpB,CAAC;QACH,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,gDAAgD;IAChC,WAAW;QACzB,OAAO,IAAI,CAAC,YAAY,CAAC;IAC3B,CAAC;IACD;;;OAGG;IACI,WAAW;QAChB,OAAO,IAAI,CAAC,YAAY,CAAC;IAC3B,CAAC;IACD;;;;OAIG;IACI,eAAe,CAAC,QAAgB,EAAE,MAAgB;QACvD,MAAM,iBAAiB,GAAG,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC;QACvD,MAAM,QAAQ,GAAG,IAAI,CAAC,uBAAuB,CAAC,iBAAiB,EAAE,IAAI,CAAC,CAAC;QACvE,IAAI,QAAQ,EAAE,CAAC;YACb,MAAM,aAAa,GAAG,QAAQ,CAAC,oCAAoC,CAAC,iBAAiB,EAAE,IAAI,CAAC,CAAC;YAC7F,OAAO,QAAQ,CAAC,UAAU,CAAC,eAAe,CAAC,aAAa,EAAE,MAAM,CAAC,CAAC;QACpE,CAAC;QACD,OAAO,yBAAO,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;IACpC,CAAC;IACD;;;;;;;;;OASG;IACI,4BAA4B,CAAC,QAAgB,EAAE,MAAc;QAClE,MAAM,GAAG,aAAK,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;QAClC,MAAM,iBAAiB,GAAG,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC;QACvD,MAAM,QAAQ,GAAG,IAAI,CAAC,uBAAuB,CAAC,iBAAiB,EAAE,IAAI,CAAC,CAAC;QACvE,IAAI,CAAC,QAAQ;YACX,OAAO,MAAM,CAAC;QAChB,MAAM,aAAa,GAAG,QAAQ,CAAC,oCAAoC,CAAC,iBAAiB,EAAE,IAAI,CAAC,CAAC;QAC7F,MAAM,GAAG,QAAQ,CAAC,UAAU,CAAC,4BAA4B,CAAC,aAAa,EAAE,MAAM,CAAC,CAAC,CAAC,KAAK;QACvF,qGAAqG;QACrG,gHAAgH;QAChH,kHAAkH;QAClH,gHAAgH;QAChH,0FAA0F;QAC1F,MAAM,CAAC,GAAG,mBAAQ,CAAC,kBAAkB,CAAC,IAAI,CAAC,YAAY,EAAE,MAAM,CAAC,SAAS,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC,CAAC;QAC1F,MAAM,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QACjC,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;;;;;OASG;IACa,6BAA6B,CAAC,QAAgB,EAAE,MAAc;QAC5E,MAAM,GAAG,aAAK,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;QAClC,MAAM,iBAAiB,GAAG,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC;QACvD,MAAM,QAAQ,GAAG,IAAI,CAAC,uBAAuB,CAAC,iBAAiB,EAAE,IAAI,CAAC,CAAC;QACvE,IAAI,CAAC,QAAQ;YACX,OAAO,MAAM,CAAC;QAChB,MAAM,aAAa,GAAG,QAAQ,CAAC,oCAAoC,CAAC,iBAAiB,EAAE,IAAI,CAAC,CAAC;QAC7F,MAAM,GAAG,QAAQ,CAAC,UAAU,CAAC,4BAA4B,CAAC,aAAa,EAAE,MAAM,CAAC,CAAC;QACjF,MAAM,CAAC,SAAS,CAAC,gBAAgB,EAAE,CAAC;QACpC,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;;;OAOG;IACa,8BAA8B,CAC5C,QAAgB,EAAE,MAAkC;QAEpD,MAAM,iBAAiB,GAAG,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC;QACvD,MAAM,QAAQ,GAAG,IAAI,CAAC,uBAAuB,CAAC,iBAAiB,EAAE,IAAI,CAAC,CAAC;QACvE,IAAI,CAAC,QAAQ;YACX,OAAO,SAAS,CAAC;QACnB,MAAM,aAAa,GAAG,QAAQ,CAAC,oCAAoC,CAAC,iBAAiB,EAAE,IAAI,CAAC,CAAC;QAC7F,MAAM,GAAG,QAAQ,CAAC,UAAU,CAAC,8BAA8B,CAAC,aAAa,EAAE,MAAM,CAAC,CAAC,CAAC,SAAS;QAC7F,IAAI,CAAC,MAAM;YACT,OAAO,SAAS,CAAC;QACnB,+EAA+E;QAC/E,mFAAmF;QACnF,6EAA6E;QAC7E,uFAAuF;QACvF,kEAAkE;QAClE,qFAAqF;QACrF,uDAAuD;QACvD,MAAM,IAAI,GAAG,MAAM,CAAC,OAAO,CAAC,SAAS,EAAE,CAAC;QACxC,MAAM,KAAK,GAAG,IAAI,GAAG,IAAI,CAAC;QAC1B,MAAM,KAAK,GAAG,MAAM,CAAC,OAAO,CAAC,UAAU,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QACxD,MAAM,CAAC,GAAG,mBAAQ,CAAC,kBAAkB,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC;QACxD,MAAM,CAAC,OAAO,CAAC,gBAAgB,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;QACnD,MAAM,CAAC,GAAG,mBAAQ,CAAC,kBAAkB,CAAC,IAAI,CAAC,YAAY,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;QAClE,MAAM,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAC/B,MAAM,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACnC,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;OAKG;IACI,mBAAmB,CAAC,SAAoB;QAC7C,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC;YACpC,IAAI,CAAC,CAAC,CAAC,mBAAmB,CAAC,SAAS,CAAC;gBACnC,OAAO,EAAE,CAAC;QACd,CAAC;QACD,OAAO,OAAO,KAAK,CAAC,CAAC;IACvB,CAAC;IACD,gGAAgG;IACzF,cAAc;QACnB,IAAI,CAAC,KAAK,CAAC,sBAAsB,EAAE,CAAC;QACpC,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YACvC,QAAQ,CAAC,4BAA4B,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QAC3D,CAAC;QACD,IAAI,CAAC,UAAU,CAAC,OAAO,EAAE,CAAC;IAC5B,CAAC;IACD;;;;OAIG;IACa,aAAa,CAAC,KAAoB;QAChD,IAAI,KAAK,YAAY,2BAA2B,EAAE,CAAC;YACjD,OAAO,mBAAQ,CAAC,gBAAgB,CAAC,IAAI,CAAC,YAAY,EAAE,KAAK,CAAC,YAAY,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QACnH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;;OAMG;IACa,8BAA8B,CAC5C,aAAqB,EAAE,cAAsB,EAAE,cAAuB,EAAE,MAA4B;QAEpG,MAAM,SAAS,GAAG,aAAa,GAAG,IAAI,CAAC,YAAY,CAAC;QACpD,MAAM,SAAS,GAAG,SAAS,GAAG,cAAc,CAAC;QAC7C,MAAM,SAAS,GAAG,IAAI,CAAC,uBAAuB,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;QAChE,IAAI,CAAC,SAAS,EAAE,CAAC;YACf,MAAM,GAAG,yCAAmB,CAAC,MAAM,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;YACvD,MAAM,CAAC,iBAAiB,GAAG,uCAAiB,CAAC,KAAK,CAAC;YACnD,OAAO,MAAM,CAAC;QAChB,CAAC;QACD,MAAM,WAAW,GAAG,SAAS,CAAC,UAAU,CAAC,8BAA8B,CACrE,SAAS,CAAC,cAAc,EAAE,SAAS,GAAG,SAAS,CAAC,cAAc,EAAE,cAAc,EAAE,MAAM,EAAE,WAAW,CACpG,CAAC,CAAC,0CAA0C;QAC7C,MAAM,WAAW,GAAG,aAAa,GAAG,CAAC,cAAc,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC;QACzE,MAAM,WAAW,GAAG,yCAAmB,CAAC,mCAAmC,CACzE,cAAc,EAAE,IAAI,EAAE,aAAa,EAAE,WAAW,EAAE,cAAc,EAAE,MAAM,CACzE,CAAC,CAAC,2CAA2C;QAC9C,WAAW,CAAC,WAAW,GAAG,WAAW,CAAC;QACtC,OAAO,WAAW,CAAC;IACrB,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,yBAAyB,CACrC,QAAiB,IAAI;QAErB,MAAM,CAAC,GAAG;YACR,QAAQ,EAAE,IAAI,CAAC,SAAS;YACxB,SAAS,EAAE,IAAI,CAAC,UAAU;YAC1B,WAAW,EAAE,IAAI,CAAC,YAAY;YAC9B,YAAY,EAAE,IAAI,CAAC,aAAa;SACjC,CAAC;QACF,IAAI,KAAK,EAAE,CAAC;YACV,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,aAAa,GAAG,CAAC,CAAC;QAC/D,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC;IACD;;;;;;;;;;OAUG;IACa,YAAY,CAAC,UAAmB,EAAE,MAAmC,EAAE,MAA4B;QACjH,IAAI,WAA4C,CAAC;QACjD,IAAI,IAAI,GAAG,MAAM,CAAC,SAAS,CAAC;QAC5B,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;QAC9C,IAAI,WAAW,KAAK,CAAC,EAAE,CAAC;YACtB,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,UAAU,EAAE,MAAM,CAAC,CAAC;QACvE,CAAC;aAAM,CAAC;YACN,MAAM,eAAe,GAAG,YAAY,CAAC,8BAA8B,CAAC,IAAI,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC;YACjG,MAAM,OAAO,GAAG;gBACd,oCAAkB,CAAC,mDAAmD,CAAC,MAAM,EAAE,CAAC,CAAC;gBACjF,iCAAe,CAAC,IAAI;aACrB,CAAC;YACF,MAAM,OAAO,GAAG;gBACd,iCAAe,CAAC,IAAI;gBACpB,oCAAkB,CAAC,mDAAmD,CAAC,MAAM,EAAE,CAAC,CAAC;aAClF,CAAC;YACF,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YACrC,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAC9D,2BAA2B,CAAC,SAAS,EAAE,CAAC;YACxC,2BAA2B,CAAC,aAAa,IAAI,eAAe,CAAC,MAAM,CAAC;YACpE,IAAI,OAAwC,CAAC;YAC7C,KAAK,MAAM,cAAc,IAAI,eAAe,EAAE,CAAC;gBAC7C,IAAI,cAAc,CAAC,CAAC,GAAG,IAAI;oBACzB,2FAA2F;oBAC3F,0FAA0F;oBAC1F,MAAM;gBACR,2BAA2B,CAAC,UAAU,EAAE,CAAC;gBACzC,MAAM,KAAK,GAAG,cAAc,CAAC,UAAU,CAAC;gBACxC,OAAO,GAAG,KAAK,CAAC,YAAY,CAC1B,UAAU,EAAE,cAAc,KAAK,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,cAAc,KAAK,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,OAAO,CAC7G,CAAC;gBACF,IAAI,OAAO,IAAI,OAAO,CAAC,CAAC,GAAG,IAAI,EAAE,CAAC;oBAChC,IAAI,GAAG,OAAO,CAAC,CAAC,CAAC;oBACjB,WAAW,GAAG,OAAO,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;oBACzC,2BAA2B,CAAC,YAAY,EAAE,CAAC;gBAC7C,CAAC;YACH,CAAC;QACH,CAAC;QACD,IAAI,CAAC,WAAW;YACd,OAAO,SAAS,CAAC;QACnB,OAAO,IAAI,CAAC,kBAAkB,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;IACtD,CAAC;IACD;;;;;OAKG;IACa,iBAAiB,CAC/B,uBAA+C;QAE/C,MAAM,OAAO,GAAG,6BAAa,CAAC,MAAM,CAAC,uBAAuB,CAAC,CAAC;QAC9D,MAAM,OAAO,GAAqB,EAAE,CAAC;QACrC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,sBAAsB,CAAC,SAAS,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC;YACtE,MAAM,MAAM,GAAG,IAAI,CAAC,iBAAiB,CAAC,OAAO,CAAC,CAAC;YAC/C,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;gBACzB,IAAI,MAAM,YAAY,+BAAc;oBAClC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;qBAClB,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC;oBAC5B,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;YAC7C,CAAC;QACH,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IACD;;;;;;;OAOG;IACa,uBAAuB,CAAC,GAAqB,EAAE,OAAiB;QAC9E,OAAO,qDAAyB,CAAC,kCAAkC,CAAC,IAAI,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;IAC1F,CAAC;IACD;;;;;;OAMG;IACI,kBAAkB,CAAC,WAAgC,EAAE,MAA4B;QACtF,IAAI,CAAC,WAAW,CAAC,KAAK;YACpB,OAAO,SAAS,CAAC;QACnB,MAAM,QAAQ,GAAG,IAAI,CAAC,+BAA+B,CAAC,WAAW,CAAC,KAAK,EAAE,WAAW,CAAC,QAAQ,CAAC,CAAC;QAC/F,IAAI,QAAQ,EAAE,CAAC;YACb,MAAM,aAAa,GAAG,QAAQ,CAAC,4BAA4B,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;YAClF,MAAM,aAAa,GAAG,IAAI,CAAC,4BAA4B,CAAC,aAAa,CAAC,CAAC;YACvE,MAAM,WAAW,GAAG,yCAAmB,CAAC,wBAAwB,CAAC,IAAI,EAAE,aAAa,EAAE,WAAW,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;YACjH,WAAW,CAAC,WAAW,GAAG,WAAW,CAAC;YACtC,WAAW,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC;YAC9B,OAAO,WAAW,CAAC;QACrB,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;;;;;;OAWG;IACI,MAAM,CAAC,+BAA+B,CAC3C,KAAgC,EAChC,MAAc,EACd,MAAoC,EACpC,MAAoC,EACpC,gBAA0B;QAE1B,KAAK,IAAI,CAAC,GAAG,MAAM,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE,CAAC;YAC3C,MAAM,eAAe,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACjC,IAAI,MAAM,EAAE,CAAC;gBACX,MAAM,WAAW,GAAG,MAAM,CAAC,kBAAkB,CAAC,eAAe,CAAC,OAAO,CAAC,CAAC;gBACvE,IAAI,WAAW;oBACb,eAAe,CAAC,OAAO,GAAG,WAAW,CAAC;YAC1C,CAAC;YACD,IAAI,MAAM,EAAE,CAAC;gBACX,MAAM,WAAW,GAAG,MAAM,CAAC,kBAAkB,CAAC,eAAe,CAAC,OAAO,CAAC,CAAC;gBACvE,IAAI,WAAW;oBACb,eAAe,CAAC,OAAO,GAAG,WAAW,CAAC;YAC1C,CAAC;QACH,CAAC;QACD,IAAI,gBAAgB;YAClB,KAAK,GAAG,6CAAuB,CAAC,wBAAwB,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QAC1E,OAAO,KAAK,CAAC;IACf,CAAC;;AAzoBH,kEA0oBC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n\r\n/** @packageDocumentation\r\n * @module Curve\r\n */\r\nimport { assert } from \"@itwin/core-bentley\";\r\nimport { CurvePrimitive } from \"../curve/CurvePrimitive\";\r\nimport { StrokeCountMap } from \"../curve/Query/StrokeCountMap\";\r\nimport { Geometry } from \"../Geometry\";\r\nimport { GeometryHandler, IStrokeHandler } from \"../geometry3d/GeometryHandler\";\r\nimport { Plane3dByOriginAndUnitNormal } from \"../geometry3d/Plane3dByOriginAndUnitNormal\";\r\nimport { Plane3dByOriginAndVectors } from \"../geometry3d/Plane3dByOriginAndVectors\";\r\nimport { Point3d, Vector3d } from \"../geometry3d/Point3dVector3d\";\r\nimport { Range1d, Range3d } from \"../geometry3d/Range\";\r\nimport { Ray3d } from \"../geometry3d/Ray3d\";\r\nimport { Transform } from \"../geometry3d/Transform\";\r\nimport { CurveChain } from \"./CurveCollection\";\r\nimport { CurveExtendMode, CurveExtendOptions, VariantCurveExtendParameter } from \"./CurveExtendMode\";\r\nimport { CurveLocationDetail, CurveLocationDetailPair, CurveSearchStatus } from \"./CurveLocationDetail\";\r\nimport { GeometryQuery } from \"./GeometryQuery\";\r\nimport { PlaneAltitudeRangeContext } from \"./internalContexts/PlaneAltitudeRangeContext\";\r\nimport { LineString3d } from \"./LineString3d\";\r\nimport { OffsetOptions } from \"./OffsetOptions\";\r\nimport { Path } from \"./Path\";\r\nimport { StrokeOptions } from \"./StrokeOptions\";\r\n\r\n/**\r\n * Annotation of a fragment, i.e. an interval of a curve.\r\n * * The interval is marked with two pairs of numbers:\r\n * * * fraction0, fraction1 = fraction parameters along the child curve.\r\n * * * distance0, distance1 = distances within containing CurveChainWithDistanceIndex.\r\n * @public\r\n */\r\nexport class PathFragment {\r\n /** Distance along parent to this fragment start. */\r\n public chainDistance0: number;\r\n /** Distance along parent to this fragment end. */\r\n public chainDistance1: number;\r\n /** The start of this `PathFragment`, as a local fractional parameter of `this.childCurve`. */\r\n public childFraction0: number;\r\n /** The end of this `PathFragment`, as a local fractional parameter of `this.childCurve`. */\r\n public childFraction1: number;\r\n /** Curve primitive of this fragment, as presented in stroker. Note that this might have become a proxy. */\r\n public childCurve: CurvePrimitive;\r\n /** Optional range */\r\n public range?: Range3d;\r\n /** Working var for use in searches. */\r\n public a: number;\r\n /** Create a fragment with complete fraction, distance, and child data. */\r\n public constructor(\r\n childFraction0: number,\r\n childFraction1: number,\r\n distance0: number,\r\n distance1: number,\r\n childCurve: CurvePrimitive,\r\n range?: Range3d,\r\n ) {\r\n this.childFraction0 = childFraction0;\r\n this.childFraction1 = childFraction1;\r\n this.chainDistance0 = distance0;\r\n this.chainDistance1 = distance1;\r\n this.childCurve = childCurve;\r\n this.range = range;\r\n this.a = 0;\r\n }\r\n /** Return true if the distance is within the distance limits of this fragment. */\r\n public containsChainDistance(distance: number): boolean {\r\n return distance >= this.chainDistance0 && distance <= this.chainDistance1;\r\n }\r\n /**\r\n * Return a quick minimum distance from spacePoint to the curve.\r\n * * The returned distance is to the curve's range box if defined; otherwise, the true distance is computed.\r\n * * Thus the returned distance may be SMALLER than the true distance to the curve, but not larger.\r\n */\r\n public quickMinDistanceToChildCurve(spacePoint: Point3d): number {\r\n if (this.range)\r\n return this.range.distanceToPoint(spacePoint);\r\n const detail = this.childCurve.closestPoint(spacePoint, false);\r\n if (detail)\r\n return detail.a;\r\n return 0;\r\n }\r\n /**\r\n * Return an array with (references to) all the input path fragments, sorted smallest to largest on the \"a\" value,\r\n * initialized with `quickMinDistanceToChildCurve`\r\n */\r\n public static collectSortedQuickMinDistances(fragments: PathFragment[], spacePoint: Point3d): PathFragment[] {\r\n const sortedFragments: PathFragment[] = [];\r\n for (const frag of fragments) {\r\n frag.a = frag.quickMinDistanceToChildCurve(spacePoint);\r\n sortedFragments.push(frag);\r\n }\r\n sortedFragments.sort((frag1: PathFragment, frag2: PathFragment) => frag1.a - frag2.a);\r\n return sortedFragments;\r\n }\r\n /** Return true if `this` fragment addresses `curve` and brackets `fraction`. */\r\n public containsChildCurveAndChildFraction(curve: CurvePrimitive, fraction: number): boolean {\r\n return this.childCurve === curve && fraction >= this.childFraction0 && fraction <= this.childFraction1;\r\n }\r\n /**\r\n * Convert distance to local fraction and apply that to interpolate between the stored curve fractions.\r\n * Note that proportional calculation does NOT account for non-uniform parameterization in the child curve.\r\n */\r\n public chainDistanceToInterpolatedChildFraction(distance: number): number {\r\n const childFraction = Geometry.inverseInterpolate(\r\n this.childFraction0,\r\n this.chainDistance0,\r\n this.childFraction1,\r\n this.chainDistance1,\r\n distance,\r\n this.childFraction0, // defaultResult\r\n );\r\n assert(childFraction !== undefined, \"expect never undefined because defaultResult is defined\");\r\n return childFraction;\r\n }\r\n /**\r\n * Convert the given chainDistance to a fraction along this childCurve using `moveSignedDistanceFromFraction`.\r\n * @param chainDistance signed distance along the chain.\r\n * @param allowExtrapolation whether to extrapolate off the start of the chain if `chainDistance` is negative,\r\n * or off the end of the chain if `chainDistance` is more than `chainLength`. Extending the chain in this manner\r\n * may result in significant inaccuracy, especially for negative distances.\r\n * @return fraction local to the relevant chain primitive corresponding to the chain position at `chainDistance`.\r\n */\r\n public chainDistanceToAccurateChildFraction(chainDistance: number, allowExtrapolation?: boolean): number {\r\n const childDetail = this.childCurve.moveSignedDistanceFromFraction(\r\n this.childFraction0, chainDistance - this.chainDistance0, allowExtrapolation ?? false,\r\n );\r\n return childDetail.fraction;\r\n }\r\n /**\r\n * Return the scale factor to map childCurve fraction derivatives to chain fraction derivatives.\r\n * @param globalDistance total length of the global curve\r\n */\r\n public fractionScaleFactor(globalDistance: number): number {\r\n return globalDistance * (this.childFraction1 - this.childFraction0) / (this.chainDistance1 - this.chainDistance0);\r\n }\r\n /**\r\n * Reverse the fraction and distance data.\r\n * * Each child fraction `f` is replaced by `1-f`\r\n * * Each `chainDistance` is replaced by `totalDistance - chainDistance`\r\n * @param totalDistance the total distance\r\n */\r\n public reverseFractionsAndDistances(totalDistance: number) {\r\n const f0 = this.childFraction0;\r\n const f1 = this.childFraction1;\r\n const d0 = this.chainDistance0;\r\n const d1 = this.chainDistance1;\r\n this.childFraction0 = 1.0 - f1;\r\n this.childFraction1 = 1.0 - f0;\r\n this.chainDistance0 = totalDistance - d1;\r\n this.chainDistance1 = totalDistance - d0;\r\n }\r\n /**\r\n * Convert a fractional position on the childCurve of this fragment to distance on the curve chain.\r\n * * Return value is SIGNED and will be negative when `fraction < this.childFraction0`.\r\n * @param fraction the fractional position on the childCurve of this fragment\r\n */\r\n public childFractionToChainDistance(fraction: number): number {\r\n let d = this.childCurve.curveLengthBetweenFractions(this.childFraction0, fraction);\r\n if (fraction < this.childFraction0)\r\n d = -d;\r\n return this.chainDistance0 + d;\r\n }\r\n}\r\n\r\n/** Non-instantiable class to build a distance index for a curve chain. */\r\nclass DistanceIndexConstructionContext implements IStrokeHandler {\r\n private _fragments: PathFragment[];\r\n private _accumulatedDistance: number;\r\n private constructor() {\r\n this._accumulatedDistance = 0;\r\n this._fragments = [];\r\n }\r\n // ignore curve announcements -- they are repeated in stroke announcements\r\n public startParentCurvePrimitive(_cp: CurvePrimitive) { }\r\n public startCurvePrimitive(_cp: CurvePrimitive) { }\r\n public endParentCurvePrimitive(_cp: CurvePrimitive) { }\r\n public endCurvePrimitive(_cp: CurvePrimitive) { }\r\n public announcePointTangent(_xyz: Point3d, _fraction: number, _tangent: Vector3d) { }\r\n public announceSegmentInterval(\r\n cp: CurvePrimitive, point0: Point3d, point1: Point3d, numStrokes: number, fraction0: number, fraction1: number,\r\n ): void {\r\n const fragmentPoint0 = point0.clone();\r\n const fragmentPoint1 = point1.clone();\r\n let d0 = this._accumulatedDistance;\r\n if (numStrokes <= 1) {\r\n this._accumulatedDistance += point0.distance(point1);\r\n this._fragments.push(new PathFragment(fraction0, fraction1, d0, this._accumulatedDistance, cp,\r\n Range3d.create(fragmentPoint0, fragmentPoint1)));\r\n } else {\r\n let f1;\r\n for (let i = 1, f0 = fraction0; i <= numStrokes; i++, f0 = f1) {\r\n f1 = Geometry.interpolate(fraction0, i / numStrokes, fraction1);\r\n point0.interpolate(f1, point1, fragmentPoint1);\r\n d0 = this._accumulatedDistance;\r\n this._accumulatedDistance += (Math.abs(f1 - f0) * point0.distance(point1));\r\n this._fragments.push(new PathFragment(f0, f1, d0, this._accumulatedDistance, cp,\r\n Range3d.create(fragmentPoint0, fragmentPoint1)));\r\n fragmentPoint0.setFrom(fragmentPoint1);\r\n }\r\n }\r\n }\r\n public announceIntervalForUniformStepStrokes(\r\n cp: CurvePrimitive, numStrokes: number, fraction0: number, fraction1: number,\r\n ): void {\r\n let f1, d, d0;\r\n for (let i = 1, f0 = fraction0; i <= numStrokes; i++, f0 = f1) {\r\n f1 = Geometry.interpolate(fraction0, i / numStrokes, fraction1);\r\n d = cp.curveLengthBetweenFractions(f0, f1);\r\n d0 = this._accumulatedDistance;\r\n this._accumulatedDistance += d;\r\n const range = cp.rangeBetweenFractions(f0, f1);\r\n this._fragments.push(new PathFragment(f0, f1, d0, this._accumulatedDistance, cp, range));\r\n }\r\n }\r\n public needPrimaryGeometryForStrokes?(): boolean {\r\n return true;\r\n }\r\n /** Create an array of PathFragment from input curve chain. */\r\n public static createPathFragmentIndex(path: CurveChain, options?: StrokeOptions): PathFragment[] {\r\n const handler = new DistanceIndexConstructionContext();\r\n for (const curve of path.children) {\r\n curve.emitStrokableParts(handler, options);\r\n }\r\n const fragments = handler._fragments;\r\n return fragments;\r\n }\r\n}\r\n/**\r\n * `CurveChainWithDistanceIndex` is a [[CurvePrimitive]] whose fractional parameterization is proportional to true\r\n * distance along a path.\r\n * * For example if the total length of the chain is `L`, then the distance along the chain from parameters `t0`\r\n * to `t1` is easily computed as `L*(t1-t0)`.\r\n * * In this way the `CurveChainWithDistanceIndex` provides a global arc length parameterization for a [[CurveChain]].\r\n * * A `CurveChainWithDistanceIndex` can be created from any [[CurveChain]], but a [[Path]] is stored internally.\r\n * * Adding a `CurveChainWithDistanceIndex` to a `CurveChain` does not preserve the distance index; instead the\r\n * internal path children are added directly to the `CurveChain`.\r\n * @public\r\n */\r\nexport class CurveChainWithDistanceIndex extends CurvePrimitive {\r\n /** String name for schema properties */\r\n public readonly curvePrimitiveType = \"curveChainWithDistanceIndex\";\r\n private readonly _path: Path;\r\n private readonly _fragments: PathFragment[];\r\n private readonly _totalLength: number; // matches final fragment distance1.\r\n private static _numCalls = 0;\r\n private static _numTested = 0;\r\n private static _numAssigned = 0;\r\n private static _numCandidate = 0;\r\n /** Test if `other` is a `CurveChainWithDistanceIndex` */\r\n public isSameGeometryClass(other: GeometryQuery): boolean {\r\n return other instanceof CurveChainWithDistanceIndex;\r\n }\r\n // final assembly of CurveChainWithDistanceIndex -- caller must create valid fragment index.\r\n private constructor(path: CurveChain, fragments: PathFragment[]) {\r\n super();\r\n this._path = path instanceof Path ? path : Path.create(...path.children); // Loop semantics would be confusing\r\n this._fragments = fragments;\r\n this._totalLength = fragments.length > 0 ? fragments[fragments.length - 1].chainDistance1 : 0;\r\n }\r\n /**\r\n * Create a clone, transformed and with its own distance index.\r\n * @param transform transform to apply in the clone.\r\n * @param options how finely to stroke the path to create the distance index\r\n */\r\n public cloneTransformed(transform: Transform, options?: StrokeOptions): CurveChainWithDistanceIndex | undefined {\r\n const c = this._path.clone() as Path;\r\n if (c.tryTransformInPlace(transform))\r\n return CurveChainWithDistanceIndex.createCapture(c, options);\r\n return undefined;\r\n }\r\n /**\r\n * Reference to the contained path.\r\n * * Do not modify the path. The distance index will be wrong.\r\n */\r\n public get path(): Path {\r\n return this._path;\r\n }\r\n /**\r\n * Reference to the fragments array.\r\n * * Do not modify.\r\n */\r\n public get fragments(): PathFragment[] {\r\n return this._fragments;\r\n }\r\n /**\r\n * Return a deep clone with its own distance index.\r\n * @param options how finely to stroke the path to create the distance index\r\n */\r\n public clone(options?: StrokeOptions): CurveChainWithDistanceIndex {\r\n const c = this._path.clone() as Path;\r\n return CurveChainWithDistanceIndex.createCapture(c, options);\r\n }\r\n /**\r\n * Return a portion of this curve with its own distance index.\r\n * * Passing a chain detail containing a `childDetail` is more accurate for extending the instance beyond [0,1].\r\n * Such details are returned by e.g., [[CurveCurve.intersectionXYPairs]].\r\n * @param fractionA start fraction or chain detail\r\n * @param fractionB end fraction or chain detail\r\n * @param options how finely to stroke the path to create the distance index\r\n */\r\n public override clonePartialCurve(fractionA: number | CurveLocationDetail, fractionB: number | CurveLocationDetail, options?: StrokeOptions): CurveChainWithDistanceIndex | undefined {\r\n const haveDetailA = fractionA instanceof CurveLocationDetail;\r\n const haveDetailB = fractionB instanceof CurveLocationDetail;\r\n let chainFractionA = haveDetailA ? fractionA.fraction : fractionA;\r\n let chainFractionB = haveDetailB ? fractionB.fraction : fractionB;\r\n if (chainFractionA === chainFractionB)\r\n return undefined;\r\n const reversed = chainFractionA > chainFractionB;\r\n if (reversed)\r\n [chainFractionA, chainFractionB] = [chainFractionB, chainFractionA];\r\n const chainDistanceA = chainFractionA * this._totalLength;\r\n const chainDistanceB = chainFractionB * this._totalLength;\r\n const fragmentA = this.chainDistanceToFragment(chainDistanceA, true);\r\n if (!fragmentA)\r\n return undefined;\r\n const fragmentB = this.chainDistanceToFragment(chainDistanceB, true);\r\n if (!fragmentB)\r\n return undefined;\r\n const childCurveIndexA = this._path.childIndex(fragmentA.childCurve, true);\r\n if (undefined === childCurveIndexA)\r\n return undefined;\r\n const childCurveIndexB = this._path.childIndex(fragmentB.childCurve, true);\r\n if (undefined === childCurveIndexB)\r\n return undefined;\r\n const childFractionA = haveDetailA && fractionA.childDetail ? fractionA.childDetail.fraction : fragmentA.chainDistanceToAccurateChildFraction(chainDistanceA, true);\r\n const childFractionB = haveDetailB && fractionB.childDetail ? fractionB.childDetail.fraction : fragmentB.chainDistanceToAccurateChildFraction(chainDistanceB, true);\r\n // add a (possibly reversed) partial clone to newPath\r\n const newPath = Path.create();\r\n const addPartialChild = (\r\n childCurve: CurvePrimitive, childFraction0: number, childFraction1: number, reversedClone: boolean,\r\n ): boolean => {\r\n if (childFraction0 === childFraction1)\r\n return false;\r\n let newCurve;\r\n if (childFraction0 === 0.0 && childFraction1 === 1.0) {\r\n newCurve = childCurve.clone();\r\n if (reversedClone)\r\n newCurve.reverseInPlace();\r\n } else {\r\n newCurve = reversedClone ?\r\n childCurve.clonePartialCurve(childFraction1, childFraction0)\r\n : childCurve.clonePartialCurve(childFraction0, childFraction1);\r\n }\r\n if (newCurve) {\r\n newPath.children.push(newCurve);\r\n return true;\r\n }\r\n return false;\r\n };\r\n if (fragmentA.childCurve === fragmentB.childCurve) {\r\n // the two distances are within the same curve.\r\n if (addPartialChild(fragmentA.childCurve, childFractionA, childFractionB, reversed))\r\n return CurveChainWithDistanceIndex.createCapture(newPath, options); // singleton -- children[] does not need to be reversed.\r\n return undefined;\r\n }\r\n addPartialChild(this._path.children[childCurveIndexA], childFractionA, 1.0, reversed);\r\n // at least two distinct children are impacted ....\r\n for (let childIndex = childCurveIndexA + 1; childIndex < childCurveIndexB; childIndex++) {\r\n addPartialChild(this._path.children[childIndex], 0.0, 1.0, reversed);\r\n }\r\n addPartialChild(this._path.children[childCurveIndexB], 0.0, childFractionB, reversed);\r\n // This reverses array entries but not orientation within each curve ...\r\n if (reversed)\r\n newPath.children.reverse();\r\n return CurveChainWithDistanceIndex.createCapture(newPath, options);\r\n }\r\n /**\r\n * Ask if the curve is within tolerance of a plane.\r\n * @returns Returns true if the curve is completely within tolerance of the plane.\r\n */\r\n public isInPlane(plane: Plane3dByOriginAndUnitNormal): boolean {\r\n for (const c of this._path.children) {\r\n if (!c.isInPlane(plane))\r\n return false;\r\n }\r\n return true;\r\n }\r\n /**\r\n * Return the start point of the chain.\r\n * * If the chain is empty, a zero point is returned.\r\n */\r\n public override startPoint(result?: Point3d): Point3d {\r\n const c = this._path.cyclicCurvePrimitive(0);\r\n assert(c !== undefined, \"expect non-empty chain. Fix caller if this fails.\");\r\n return c?.startPoint(result) ?? Point3d.createZero(result);\r\n }\r\n /**\r\n * Return the end point of of the chain.\r\n * * If the chain is empty, a zero point is returned.\r\n */\r\n public override endPoint(result?: Point3d): Point3d {\r\n const c = this._path.cyclicCurvePrimitive(-1);\r\n assert(c !== undefined, \"expect non-empty chain. Fix caller if this fails.\");\r\n return c?.endPoint(result) ?? Point3d.createZero(result);\r\n }\r\n /** Add strokes to caller-supplied linestring */\r\n public emitStrokes(dest: LineString3d, options?: StrokeOptions): void {\r\n for (const c of this._path.children) {\r\n c.emitStrokes(dest, options);\r\n }\r\n }\r\n /**\r\n * Ask the curve to announce points and simple subcurve fragments for stroking.\r\n * See IStrokeHandler for description of the sequence of the method calls.\r\n */\r\n public emitStrokableParts(dest: IStrokeHandler, options?: StrokeOptions): void {\r\n for (const c of this._path.children) {\r\n c.emitStrokableParts(dest, options);\r\n }\r\n }\r\n /**\r\n * Return the stroke count required for given options.\r\n * @param options StrokeOptions that determine count\r\n */\r\n public computeStrokeCountForOptions(options?: StrokeOptions): number {\r\n let numStroke = 0;\r\n for (const c of this._path.children) {\r\n numStroke += c.computeStrokeCountForOptions(options);\r\n }\r\n return numStroke;\r\n }\r\n /**\r\n * Return an array containing only the curve primitives.\r\n * @param collectorArray array to receive primitives (pushed -- the array is not cleared)\r\n * @param smallestPossiblePrimitives if true, recurse on the children. If false, only push `this`.\r\n * @param explodeLinestrings (if smallestPossiblePrimitives is true) whether to push a [[LineSegment3d]] for each\r\n * segment of a [[LineString3d]] child. If false, push only the [[LineString3d]].\r\n */\r\n public override collectCurvePrimitivesGo(\r\n collectorArray: CurvePrimitive[], smallestPossiblePrimitives: boolean = false, explodeLineStrings: boolean = false,\r\n ): void {\r\n if (smallestPossiblePrimitives) {\r\n for (const c of this._path.children) {\r\n c.collectCurvePrimitivesGo(collectorArray, smallestPossiblePrimitives, explodeLineStrings);\r\n }\r\n } else {\r\n collectorArray.push(this);\r\n }\r\n }\r\n /**\r\n * Construct StrokeCountMap for each child, accumulating data to stroke count map for this primitive.\r\n * @param options StrokeOptions that determine count\r\n * @param parentStrokeMap evolving parent map.\r\n */\r\n public override computeAndAttachRecursiveStrokeCounts(options?: StrokeOptions, parentStrokeMap?: StrokeCountMap) {\r\n const myMap = StrokeCountMap.createWithCurvePrimitiveAndOptionalParent(this, parentStrokeMap);\r\n for (const c of this._path.children) {\r\n c.computeAndAttachRecursiveStrokeCounts(options, myMap);\r\n }\r\n CurvePrimitive.installStrokeCountMap(this, myMap, parentStrokeMap);\r\n }\r\n /**\r\n * Second step of double dispatch: call `this._path.dispatchToGeometryHandler (handler)`\r\n * * Note that this exposes the children individually to the handler.\r\n */\r\n public dispatchToGeometryHandler(handler: GeometryHandler): any {\r\n return handler.handleCurveChainWithDistanceIndex(this);\r\n }\r\n /** Extend `rangeToExtend` as needed to include these curves (optionally transformed) */\r\n public extendRange(rangeToExtend: Range3d, transform?: Transform): void {\r\n this._path.extendRange(rangeToExtend, transform);\r\n }\r\n /** Return a (high accuracy and positive) length of the curve between fractional positions */\r\n public override curveLengthBetweenFractions(fraction0: number, fraction1: number): number {\r\n return Math.abs(fraction1 - fraction0) * this._totalLength;\r\n }\r\n /** Flatten CurveChainWithDistanceIndex children in the input chain.\r\n * @return cloned flattened CurveChain, or reference to the input chain if no nesting\r\n */\r\n private static flattenNestedChains(chain: CurveChain): CurveChain {\r\n if (-1 === chain.children.findIndex((child: CurvePrimitive) => { return child instanceof CurveChainWithDistanceIndex; }))\r\n return chain;\r\n const flatChain = chain.clone() as CurveChain;\r\n const flatChildren = flatChain.children.flatMap((child: CurvePrimitive) => {\r\n if (child instanceof CurveChainWithDistanceIndex)\r\n return child.path.children;\r\n else\r\n return [child];\r\n },\r\n );\r\n flatChain.children.splice(0, Infinity, ...flatChildren);\r\n return flatChain;\r\n }\r\n /**\r\n * Capture (not clone) a path into a new `CurveChainWithDistanceIndex`.\r\n * @param path chain to be CAPTURED (not cloned)\r\n * @param options how finely to stroke the path to create the distance index\r\n */\r\n public static createCapture(path: CurveChain, options?: StrokeOptions): CurveChainWithDistanceIndex {\r\n path = this.flattenNestedChains(path); // nested chains not allowed\r\n const fragments = DistanceIndexConstructionContext.createPathFragmentIndex(path, options);\r\n return new CurveChainWithDistanceIndex(path, fragments);\r\n }\r\n /**\r\n * Return the PathFragment object at the given `distance` along the chain.\r\n * @param distance distance along the chain.\r\n * @param allowExtrapolation if `true`, returns first fragment for negative distances and returns last fragment\r\n * for distances larger than curve length. If `false` returns `undefined` for those out of bound distances.\r\n */\r\n public chainDistanceToFragment(distance: number, allowExtrapolation: boolean = false): PathFragment | undefined {\r\n const i = this.chainDistanceToFragmentIndex(distance, allowExtrapolation);\r\n if (undefined !== i)\r\n return this._fragments[i];\r\n return undefined;\r\n }\r\n /**\r\n * Return the index of the PathFragment at the given `distance` along the chain.\r\n * @param distance distance along the chain.\r\n * @param allowExtrapolation if `true`, returns 0 for negative distances and returns last fragment index for\r\n * distances larger than curve length. If `false` returns `undefined` for those out of bound distances.\r\n */\r\n protected chainDistanceToFragmentIndex(distance: number, allowExtrapolation: boolean = false): number | undefined {\r\n const fragments = this._fragments;\r\n const numFragments = fragments.length;\r\n assert(numFragments > 0, \"expect non-empty chain. Fix caller if this fails.\");\r\n if (numFragments > 0) {\r\n if (distance < 0.0)\r\n return allowExtrapolation ? 0 : undefined;\r\n if (distance > this._totalLength)\r\n return allowExtrapolation ? (numFragments - 1) : undefined;\r\n // linear search (opportunity for improvement)\r\n for (let i = 0; i < numFragments; i++) {\r\n if (fragments[i].containsChainDistance(distance))\r\n return i;\r\n }\r\n }\r\n return undefined;\r\n }\r\n /**\r\n * Convert distance along the chain to fraction along the chain.\r\n * @param distance distance along the chain.\r\n */\r\n public chainDistanceToChainFraction(distance: number): number {\r\n return distance / this._totalLength;\r\n }\r\n /** Return the PathFragment object containing the point at the given `fraction` of the given child curve. */\r\n public curveAndChildFractionToFragment(curve: CurvePrimitive, fraction: number): PathFragment | undefined {\r\n const numFragments = this._fragments.length;\r\n const fragments = this._fragments;\r\n if (numFragments > 0) {\r\n if (fraction < 0)\r\n return fragments[0];\r\n if (fraction > 1.0)\r\n return fragments[numFragments - 1];\r\n // linear search (opportunity for improvement)\r\n for (const fragment of fragments) {\r\n if (fragment.containsChildCurveAndChildFraction(curve, fraction))\r\n return fragment;\r\n }\r\n }\r\n return undefined;\r\n }\r\n /** Returns the total length of `this` curve. */\r\n public override curveLength(): number {\r\n return this._totalLength;\r\n }\r\n /**\r\n * Returns the total length of the path.\r\n * * This is exact (and simple property lookup) because the true lengths were summed at construction time.\r\n */\r\n public quickLength(): number {\r\n return this._totalLength;\r\n }\r\n /**\r\n * Return the point (x,y,z) on the curve at fractional position along the chain.\r\n * @param fraction fractional position along the curve.\r\n * @returns a point on the curve. If the chain is empty, a zero point is returned.\r\n */\r\n public fractionToPoint(fraction: number, result?: Point3d): Point3d {\r\n const distanceAlongPath = fraction * this._totalLength;\r\n const fragment = this.chainDistanceToFragment(distanceAlongPath, true);\r\n if (fragment) {\r\n const childFraction = fragment.chainDistanceToAccurateChildFraction(distanceAlongPath, true);\r\n return fragment.childCurve.fractionToPoint(childFraction, result);\r\n }\r\n return Point3d.createZero(result);\r\n }\r\n /**\r\n * Return the point (x,y,z) and derivative on the curve at fractional position.\r\n * * Note that the derivative is \"derivative of xyz with respect to fraction\".\r\n * * The derivative shows the speed of the \"fractional point\" moving along the curve.\r\n * * The derivative is not generally a unit vector. Use `fractionToPointAndUnitTangent` for a unit vector.\r\n * @param fraction fractional position along the geometry.\r\n * @param result optional receiver for the result.\r\n * @returns a ray whose origin is the curve point and direction is the derivative with respect to the fraction.\r\n * If the chain is empty, a zero ray is returned.\r\n */\r\n public fractionToPointAndDerivative(fraction: number, result?: Ray3d): Ray3d {\r\n result = Ray3d.createZero(result);\r\n const distanceAlongPath = fraction * this._totalLength;\r\n const fragment = this.chainDistanceToFragment(distanceAlongPath, true);\r\n if (!fragment)\r\n return result;\r\n const childFraction = fragment.chainDistanceToAccurateChildFraction(distanceAlongPath, true);\r\n result = fragment.childCurve.fractionToPointAndDerivative(childFraction, result); // C'\r\n // Recall the standard arclength formula s(t) for the curve C = C(t), with derivative s'(t) = ||C'||.\r\n // Define fractional arclength for C by f = f(t) = s(t)/L, where L is the total length of C. Then f' = ||C'||/L.\r\n // Denote the inverse of f by t = t(f). Then C = C(t(f)) is a parameterization of C by its fractional arclength f.\r\n // Since the derivative of t is t'=1/f'=L/||C'||, the derivative we seek is d/df(C(t(f))) = C' t' = C' L/||C'||,\r\n // where C' is given by the fragment. More details at core/geometry/internaldocs/Curve.md.\r\n const a = Geometry.safeDivideFraction(this._totalLength, result.direction.magnitude(), 0);\r\n result.direction.scaleInPlace(a);\r\n return result;\r\n }\r\n /**\r\n * Return the point (x,y,z) and normalized derivative on the curve at fractional position.\r\n * * Note that the derivative is \"derivative of xyz with respect to fraction\".\r\n * * The un-normalized derivative shows the speed of the \"fractional point\" moving along the curve.\r\n * * To find the un-normalized derivative, use `fractionToPointAndDerivative`.\r\n * @param fraction fractional position on the curve\r\n * @param result optional receiver for the result.\r\n * @returns a ray whose origin is the curve point and direction is the normalized derivative with respect to\r\n * the fraction. If the chain is empty, a zero ray is returned.\r\n */\r\n public override fractionToPointAndUnitTangent(fraction: number, result?: Ray3d): Ray3d {\r\n result = Ray3d.createZero(result);\r\n const distanceAlongPath = fraction * this._totalLength;\r\n const fragment = this.chainDistanceToFragment(distanceAlongPath, true);\r\n if (!fragment)\r\n return result;\r\n const childFraction = fragment.chainDistanceToAccurateChildFraction(distanceAlongPath, true);\r\n result = fragment.childCurve.fractionToPointAndDerivative(childFraction, result);\r\n result.direction.normalizeInPlace();\r\n return result;\r\n }\r\n /**\r\n * Return a plane with\r\n * * origin at fractional position along the curve\r\n * * vectorU is the first derivative, i.e. tangent vector with length equal to the rate of change with respect to\r\n * the fraction.\r\n * * vectorV is the second derivative, i.e. derivative of vectorU which points in the direction of the curve's\r\n * derivative's change.\r\n */\r\n public override fractionToPointAnd2Derivatives(\r\n fraction: number, result?: Plane3dByOriginAndVectors,\r\n ): Plane3dByOriginAndVectors | undefined {\r\n const distanceAlongPath = fraction * this._totalLength;\r\n const fragment = this.chainDistanceToFragment(distanceAlongPath, true);\r\n if (!fragment)\r\n return undefined;\r\n const childFraction = fragment.chainDistanceToAccurateChildFraction(distanceAlongPath, true);\r\n result = fragment.childCurve.fractionToPointAnd2Derivatives(childFraction, result); // C', C\"\r\n if (!result)\r\n return undefined;\r\n // See fractionToPointAndDerivative, where we show d/df(C(t(f))) = L C'/||C'||.\r\n // Here we seek the 2nd derivative. We'll use the quotient rule, and the identities\r\n // d/dt||x(t)|| = x.x'/||x|| and ||x||^2 = x.x, where \".\" is the dot product.\r\n // d2/df2(C(t(f))) = L d/df(C'/||C'||) = L (||C'|| d/df(C') - C' d/df||C'||) / ||C'||^2\r\n // = L (||C'|| C\" L/||C'|| - C' C'.C\"/||C'|| L/||C'||) / ||C'||^2\r\n // = (L/||C'||)^2 (C\" - C' C'.C\"/C'.C' ), where C' and C\" are given by the fragment.\r\n // More details at core/geometry/internaldocs/Curve.md.\r\n const magU = result.vectorU.magnitude();\r\n const dotUU = magU * magU;\r\n const dotUV = result.vectorU.dotProduct(result.vectorV);\r\n const a = Geometry.safeDivideFraction(-dotUV, dotUU, 0);\r\n result.vectorV.addScaledInPlace(result.vectorU, a);\r\n const b = Geometry.safeDivideFraction(this._totalLength, magU, 0);\r\n result.vectorU.scaleInPlace(b);\r\n result.vectorV.scaleInPlace(b * b);\r\n return result;\r\n }\r\n /**\r\n * Attempt to transform in place.\r\n * * Warning: If any child transform fails, `this` object becomes invalid but that should never happen.\r\n * @param transform the transform to be applied.\r\n * @returns true if all of child transforms succeed and false otherwise.\r\n */\r\n public tryTransformInPlace(transform: Transform): boolean {\r\n let numFail = 0;\r\n for (const c of this._path.children) {\r\n if (!c.tryTransformInPlace(transform))\r\n numFail++;\r\n }\r\n return numFail === 0;\r\n }\r\n /** Reverse the curve's data so that its fractional stroking moves in the opposite direction. */\r\n public reverseInPlace(): void {\r\n this._path.reverseChildrenInPlace();\r\n for (const fragment of this._fragments) {\r\n fragment.reverseFractionsAndDistances(this._totalLength);\r\n }\r\n this._fragments.reverse();\r\n }\r\n /**\r\n * Test for equality conditions.\r\n * * Mismatched total length is a quick exit condition.\r\n * * If total length matches, recurse to the path for matching primitives.\r\n */\r\n public override isAlmostEqual(other: GeometryQuery): boolean {\r\n if (other instanceof CurveChainWithDistanceIndex) {\r\n return Geometry.isSameCoordinate(this._totalLength, other._totalLength) && this._path.isAlmostEqual(other._path);\r\n }\r\n return false;\r\n }\r\n /**\r\n * (Attempt to) find a position on the curve at a signed distance from start fraction.\r\n * * See `CurvePrimitive.moveSignedDistanceFromFraction` for parameter details.\r\n * * The returned location directly identifies fractional position along the CurveChainWithDistanceIndex and\r\n * has pointer to an additional detail for the child curve.\r\n * * If the chain is empty, return a default CurveLocationDetail whose `curveSearchStatus` member indicates error.\r\n */\r\n public override moveSignedDistanceFromFraction(\r\n startFraction: number, signedDistance: number, allowExtension: boolean, result?: CurveLocationDetail,\r\n ): CurveLocationDetail {\r\n const distanceA = startFraction * this._totalLength;\r\n const distanceB = distanceA + signedDistance;\r\n const fragmentB = this.chainDistanceToFragment(distanceB, true);\r\n if (!fragmentB) {\r\n result = CurveLocationDetail.create(undefined, result);\r\n result.curveSearchStatus = CurveSearchStatus.error;\r\n return result;\r\n }\r\n const childDetail = fragmentB.childCurve.moveSignedDistanceFromFraction(\r\n fragmentB.childFraction0, distanceB - fragmentB.chainDistance0, allowExtension, result?.childDetail,\r\n ); // local detail related to the child curve\r\n const endFraction = startFraction + (signedDistance / this._totalLength);\r\n const chainDetail = CurveLocationDetail.createConditionalMoveSignedDistance(\r\n allowExtension, this, startFraction, endFraction, signedDistance, result,\r\n ); // global detail related to the curve chain\r\n chainDetail.childDetail = childDetail;\r\n return chainDetail;\r\n }\r\n /**\r\n * Return an object summarizing closest point test counts.\r\n * The returned object has\r\n * * numCalls = number of times closestPoint was called.\r\n * * numCurvesTested = number of curves tested with full closestPoint.\r\n * * numAssigned = number of times a new minimum value was recorded.\r\n * * numCandidate = number of curves that would be tested in worst case.\r\n * @param clear if true, counts are cleared after the return object is formed.\r\n */\r\n public static getClosestPointTestCounts(\r\n clear: boolean = true,\r\n ): { numCalls: number, numTested: number, numAssigned: number, numCandidate: number } {\r\n const a = {\r\n numCalls: this._numCalls,\r\n numTested: this._numTested,\r\n numAssigned: this._numAssigned,\r\n numCandidate: this._numCandidate,\r\n };\r\n if (clear) {\r\n this._numTested = this._numAssigned = this._numCandidate = 0;\r\n }\r\n return a;\r\n }\r\n /**\r\n * Search for the curve point that is closest to the spacePoint.\r\n * * The CurveChainWithDistanceIndex invokes the base class CurvePrimitive method, which (via a handler)\r\n * determines a CurveLocation detail among the children.\r\n * * The returned detail directly identifies fractional position along the CurveChainWithDistanceIndex and\r\n * has pointer to an additional detail for the child curve.\r\n * @param spacePoint point in space\r\n * @param extend true to extend the curve\r\n * @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(spacePoint: Point3d, extend: VariantCurveExtendParameter, result?: CurveLocationDetail): CurveLocationDetail | undefined {\r\n let childDetail: CurveLocationDetail | undefined;\r\n let aMin = Number.MAX_VALUE;\r\n const numChildren = this.path.children.length;\r\n if (numChildren === 1) {\r\n childDetail = this.path.children[0].closestPoint(spacePoint, extend);\r\n } else {\r\n const sortedFragments = PathFragment.collectSortedQuickMinDistances(this._fragments, spacePoint);\r\n const extend0 = [\r\n CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(extend, 0),\r\n CurveExtendMode.None,\r\n ];\r\n const extend1 = [\r\n CurveExtendMode.None,\r\n CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(extend, 1),\r\n ];\r\n const fragment0 = this._fragments[0];\r\n const fragment1 = this._fragments[this._fragments.length - 1];\r\n CurveChainWithDistanceIndex._numCalls++;\r\n CurveChainWithDistanceIndex._numCandidate += sortedFragments.length;\r\n let detailA: CurveLocationDetail | undefined;\r\n for (const sortedFragment of sortedFragments) {\r\n if (sortedFragment.a > aMin)\r\n // sortedFragments help early exit because it is likely that one of the first few fragments\r\n // in sortedFragments is the fragment with minimum distance from space point to the curve.\r\n break;\r\n CurveChainWithDistanceIndex._numTested++;\r\n const child = sortedFragment.childCurve;\r\n detailA = child.closestPoint(\r\n spacePoint, sortedFragment === fragment0 ? extend0 : sortedFragment === fragment1 ? extend1 : false, detailA,\r\n );\r\n if (detailA && detailA.a < aMin) {\r\n aMin = detailA.a;\r\n childDetail = detailA.clone(childDetail);\r\n CurveChainWithDistanceIndex._numAssigned++;\r\n }\r\n }\r\n }\r\n if (!childDetail)\r\n return undefined;\r\n return this.computeChainDetail(childDetail, result);\r\n }\r\n /**\r\n * Construct an offset of each child as viewed in the xy-plane (ignoring z).\r\n * * No attempt is made to join the offset children. Use RegionOps.constructCurveXYOffset to return a fully\r\n * joined offset.\r\n * @param offsetDistanceOrOptions offset distance (positive to left of the instance curve) or offset options object.\r\n */\r\n public override constructOffsetXY(\r\n offsetDistanceOrOptions: number | OffsetOptions,\r\n ): CurvePrimitive | CurvePrimitive[] | undefined {\r\n const options = OffsetOptions.create(offsetDistanceOrOptions);\r\n const offsets: CurvePrimitive[] = [];\r\n for (const prim of this.collectCurvePrimitives(undefined, true, true)) {\r\n const offset = prim.constructOffsetXY(options);\r\n if (offset !== undefined) {\r\n if (offset instanceof CurvePrimitive)\r\n offsets.push(offset);\r\n else if (Array.isArray(offset))\r\n offset.forEach((cp) => offsets.push(cp));\r\n }\r\n }\r\n return offsets;\r\n }\r\n /**\r\n * Project instance geometry (via dispatch) onto the given ray, and return the extreme fractional parameters of\r\n * projection.\r\n * @param ray ray onto which the instance is projected. A `Vector3d` is treated as a `Ray3d` with zero origin.\r\n * @param lowHigh optional receiver for output.\r\n * @returns range of fractional projection parameters onto the ray, where 0.0 is start of the ray and 1.0 is the\r\n * end of the ray.\r\n */\r\n public override projectedParameterRange(ray: Vector3d | Ray3d, lowHigh?: Range1d): Range1d | undefined {\r\n return PlaneAltitudeRangeContext.findExtremeFractionsAlongDirection(this, ray, lowHigh);\r\n }\r\n /**\r\n * Compute the global chain detail corresponding to a local child detail.\r\n * @param childDetail the local (fragment) detail, captured as-is.\r\n * @param result optional pre-allocated detail to populate and return.\r\n * @returns global (chain) detail with its `childDetail` field pointing to the input and its `a`\r\n * field copied from the input, but if a PathFragment for `childDetail` cannot be resolved, return undefined.\r\n */\r\n public computeChainDetail(childDetail: CurveLocationDetail, result?: CurveLocationDetail): CurveLocationDetail | undefined {\r\n if (!childDetail.curve)\r\n return undefined;\r\n const fragment = this.curveAndChildFractionToFragment(childDetail.curve, childDetail.fraction);\r\n if (fragment) {\r\n const chainDistance = fragment.childFractionToChainDistance(childDetail.fraction);\r\n const chainFraction = this.chainDistanceToChainFraction(chainDistance);\r\n const chainDetail = CurveLocationDetail.createCurveFractionPoint(this, chainFraction, childDetail.point, result);\r\n chainDetail.childDetail = childDetail;\r\n chainDetail.a = childDetail.a;\r\n return chainDetail;\r\n }\r\n return undefined;\r\n }\r\n /**\r\n * Given a parent chain, convert the corresponding child details in the specified pairs.\r\n * * Converted details refer to the chain's global parameterization instead of the child's.\r\n * * It is assumed that for all i >= index0, `pairs[i].detailA.curve` is a child of chainA (similarly for chainB).\r\n * @param pairs array to mutate\r\n * @param index0 convert details of pairs in the tail of the array, starting at index0\r\n * @param chainA convert each specified detailA to the global parameterization of chainA\r\n * @param chainB convert each specified detailB to the global parameterization of chainB\r\n * @param compressAdjacent whether to remove adjacent duplicate pairs after conversion\r\n * @return the converted array\r\n * @internal\r\n */\r\n public static convertChildDetailToChainDetail(\r\n pairs: CurveLocationDetailPair[],\r\n index0: number,\r\n chainA?: CurveChainWithDistanceIndex,\r\n chainB?: CurveChainWithDistanceIndex,\r\n compressAdjacent?: boolean,\r\n ): CurveLocationDetailPair[] {\r\n for (let i = index0; i < pairs.length; ++i) {\r\n const childDetailPair = pairs[i];\r\n if (chainA) {\r\n const chainDetail = chainA.computeChainDetail(childDetailPair.detailA);\r\n if (chainDetail)\r\n childDetailPair.detailA = chainDetail;\r\n }\r\n if (chainB) {\r\n const chainDetail = chainB.computeChainDetail(childDetailPair.detailB);\r\n if (chainDetail)\r\n childDetailPair.detailB = chainDetail;\r\n }\r\n }\r\n if (compressAdjacent)\r\n pairs = CurveLocationDetailPair.removeAdjacentDuplicates(pairs, index0);\r\n return pairs;\r\n }\r\n}\r\n"]}
|