@itwin/core-geometry 3.5.0-dev.7 → 3.6.0-dev.1
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/CHANGELOG.md +65 -1
- package/lib/cjs/Geometry.d.ts +26 -10
- package/lib/cjs/Geometry.d.ts.map +1 -1
- package/lib/cjs/Geometry.js +32 -17
- package/lib/cjs/Geometry.js.map +1 -1
- package/lib/cjs/bspline/BSplineCurve.d.ts +11 -5
- package/lib/cjs/bspline/BSplineCurve.d.ts.map +1 -1
- package/lib/cjs/bspline/BSplineCurve.js +47 -18
- package/lib/cjs/bspline/BSplineCurve.js.map +1 -1
- package/lib/cjs/bspline/BezierCurveBase.d.ts +10 -3
- package/lib/cjs/bspline/BezierCurveBase.d.ts.map +1 -1
- package/lib/cjs/bspline/BezierCurveBase.js +12 -4
- package/lib/cjs/bspline/BezierCurveBase.js.map +1 -1
- package/lib/cjs/bspline/InterpolationCurve3d.d.ts.map +1 -1
- package/lib/cjs/bspline/InterpolationCurve3d.js +4 -1
- package/lib/cjs/bspline/InterpolationCurve3d.js.map +1 -1
- package/lib/cjs/bspline/KnotVector.d.ts.map +1 -1
- package/lib/cjs/bspline/KnotVector.js +3 -0
- package/lib/cjs/bspline/KnotVector.js.map +1 -1
- package/lib/cjs/curve/Arc3d.d.ts +10 -4
- package/lib/cjs/curve/Arc3d.d.ts.map +1 -1
- package/lib/cjs/curve/Arc3d.js +17 -5
- package/lib/cjs/curve/Arc3d.js.map +1 -1
- package/lib/cjs/curve/CurveChainWithDistanceIndex.d.ts +15 -7
- package/lib/cjs/curve/CurveChainWithDistanceIndex.d.ts.map +1 -1
- package/lib/cjs/curve/CurveChainWithDistanceIndex.js +46 -29
- package/lib/cjs/curve/CurveChainWithDistanceIndex.js.map +1 -1
- package/lib/cjs/curve/CurveCollection.d.ts +13 -4
- package/lib/cjs/curve/CurveCollection.d.ts.map +1 -1
- package/lib/cjs/curve/CurveCollection.js +23 -2
- package/lib/cjs/curve/CurveCollection.js.map +1 -1
- package/lib/cjs/curve/CurveCurveIntersectXY.js +1 -1
- package/lib/cjs/curve/CurveCurveIntersectXY.js.map +1 -1
- package/lib/cjs/curve/CurveCurveIntersectXYZ.d.ts +4 -3
- package/lib/cjs/curve/CurveCurveIntersectXYZ.d.ts.map +1 -1
- package/lib/cjs/curve/CurveCurveIntersectXYZ.js +8 -6
- package/lib/cjs/curve/CurveCurveIntersectXYZ.js.map +1 -1
- package/lib/cjs/curve/CurvePrimitive.d.ts +20 -18
- package/lib/cjs/curve/CurvePrimitive.d.ts.map +1 -1
- package/lib/cjs/curve/CurvePrimitive.js +58 -339
- package/lib/cjs/curve/CurvePrimitive.js.map +1 -1
- package/lib/cjs/curve/LineSegment3d.d.ts +8 -2
- package/lib/cjs/curve/LineSegment3d.d.ts.map +1 -1
- package/lib/cjs/curve/LineSegment3d.js +9 -0
- package/lib/cjs/curve/LineSegment3d.js.map +1 -1
- package/lib/cjs/curve/LineString3d.d.ts +18 -2
- package/lib/cjs/curve/LineString3d.d.ts.map +1 -1
- package/lib/cjs/curve/LineString3d.js +39 -23
- package/lib/cjs/curve/LineString3d.js.map +1 -1
- package/lib/cjs/curve/ProxyCurve.d.ts +9 -7
- package/lib/cjs/curve/ProxyCurve.d.ts.map +1 -1
- package/lib/cjs/curve/ProxyCurve.js +4 -0
- package/lib/cjs/curve/ProxyCurve.js.map +1 -1
- package/lib/cjs/curve/Query/PlanarSubdivision.d.ts +2 -1
- package/lib/cjs/curve/Query/PlanarSubdivision.d.ts.map +1 -1
- package/lib/cjs/curve/Query/PlanarSubdivision.js +5 -4
- package/lib/cjs/curve/Query/PlanarSubdivision.js.map +1 -1
- package/lib/cjs/curve/RegionOps.d.ts +5 -0
- package/lib/cjs/curve/RegionOps.d.ts.map +1 -1
- package/lib/cjs/curve/RegionOps.js +17 -3
- package/lib/cjs/curve/RegionOps.js.map +1 -1
- package/lib/cjs/curve/RegionOpsClassificationSweeps.d.ts +9 -6
- package/lib/cjs/curve/RegionOpsClassificationSweeps.d.ts.map +1 -1
- package/lib/cjs/curve/RegionOpsClassificationSweeps.js +55 -47
- package/lib/cjs/curve/RegionOpsClassificationSweeps.js.map +1 -1
- package/lib/cjs/curve/internalContexts/AppendPlaneIntersectionStrokeHandler.d.ts +55 -0
- package/lib/cjs/curve/internalContexts/AppendPlaneIntersectionStrokeHandler.d.ts.map +1 -0
- package/lib/cjs/curve/internalContexts/AppendPlaneIntersectionStrokeHandler.js +143 -0
- package/lib/cjs/curve/internalContexts/AppendPlaneIntersectionStrokeHandler.js.map +1 -0
- package/lib/cjs/curve/internalContexts/ClosestPointStrokeHandler.d.ts +43 -0
- package/lib/cjs/curve/internalContexts/ClosestPointStrokeHandler.d.ts.map +1 -0
- package/lib/cjs/curve/internalContexts/ClosestPointStrokeHandler.js +146 -0
- package/lib/cjs/curve/internalContexts/ClosestPointStrokeHandler.js.map +1 -0
- package/lib/cjs/curve/internalContexts/CurveLengthContext.d.ts +33 -0
- package/lib/cjs/curve/internalContexts/CurveLengthContext.d.ts.map +1 -0
- package/lib/cjs/curve/internalContexts/CurveLengthContext.js +91 -0
- package/lib/cjs/curve/internalContexts/CurveLengthContext.js.map +1 -0
- package/lib/cjs/curve/internalContexts/NewtonRtoRStrokeHandler.d.ts +21 -0
- package/lib/cjs/curve/internalContexts/NewtonRtoRStrokeHandler.d.ts.map +1 -0
- package/lib/cjs/curve/internalContexts/NewtonRtoRStrokeHandler.js +34 -0
- package/lib/cjs/curve/internalContexts/NewtonRtoRStrokeHandler.js.map +1 -0
- package/lib/cjs/curve/internalContexts/PlaneAltitudeRangeContext.d.ts +31 -8
- package/lib/cjs/curve/internalContexts/PlaneAltitudeRangeContext.d.ts.map +1 -1
- package/lib/cjs/curve/internalContexts/PlaneAltitudeRangeContext.js +77 -12
- package/lib/cjs/curve/internalContexts/PlaneAltitudeRangeContext.js.map +1 -1
- package/lib/cjs/curve/spiral/DirectSpiral3d.d.ts +2 -2
- package/lib/cjs/curve/spiral/DirectSpiral3d.d.ts.map +1 -1
- package/lib/cjs/curve/spiral/DirectSpiral3d.js +15 -8
- package/lib/cjs/curve/spiral/DirectSpiral3d.js.map +1 -1
- package/lib/cjs/curve/spiral/TransitionSpiral3d.d.ts +12 -7
- package/lib/cjs/curve/spiral/TransitionSpiral3d.d.ts.map +1 -1
- package/lib/cjs/curve/spiral/TransitionSpiral3d.js +12 -3
- package/lib/cjs/curve/spiral/TransitionSpiral3d.js.map +1 -1
- package/lib/cjs/geometry3d/Angle.d.ts +66 -42
- package/lib/cjs/geometry3d/Angle.d.ts.map +1 -1
- package/lib/cjs/geometry3d/Angle.js +201 -99
- package/lib/cjs/geometry3d/Angle.js.map +1 -1
- package/lib/cjs/geometry3d/AngleSweep.d.ts +102 -60
- package/lib/cjs/geometry3d/AngleSweep.d.ts.map +1 -1
- package/lib/cjs/geometry3d/AngleSweep.js +191 -106
- package/lib/cjs/geometry3d/AngleSweep.js.map +1 -1
- package/lib/cjs/geometry3d/Matrix3d.d.ts +25 -8
- package/lib/cjs/geometry3d/Matrix3d.d.ts.map +1 -1
- package/lib/cjs/geometry3d/Matrix3d.js +67 -15
- package/lib/cjs/geometry3d/Matrix3d.js.map +1 -1
- package/lib/cjs/geometry3d/Point2dArrayCarrier.d.ts +1 -0
- package/lib/cjs/geometry3d/Point2dArrayCarrier.d.ts.map +1 -1
- package/lib/cjs/geometry3d/Point2dArrayCarrier.js +2 -1
- package/lib/cjs/geometry3d/Point2dArrayCarrier.js.map +1 -1
- package/lib/cjs/geometry3d/Point2dVector2d.d.ts +86 -25
- package/lib/cjs/geometry3d/Point2dVector2d.d.ts.map +1 -1
- package/lib/cjs/geometry3d/Point2dVector2d.js +230 -81
- package/lib/cjs/geometry3d/Point2dVector2d.js.map +1 -1
- package/lib/cjs/geometry3d/Point3dArrayCarrier.d.ts +14 -4
- package/lib/cjs/geometry3d/Point3dArrayCarrier.d.ts.map +1 -1
- package/lib/cjs/geometry3d/Point3dArrayCarrier.js +15 -5
- package/lib/cjs/geometry3d/Point3dArrayCarrier.js.map +1 -1
- package/lib/cjs/geometry3d/Point3dVector3d.d.ts +121 -67
- package/lib/cjs/geometry3d/Point3dVector3d.d.ts.map +1 -1
- package/lib/cjs/geometry3d/Point3dVector3d.js +318 -137
- package/lib/cjs/geometry3d/Point3dVector3d.js.map +1 -1
- package/lib/cjs/geometry3d/Range.d.ts +1 -2
- package/lib/cjs/geometry3d/Range.d.ts.map +1 -1
- package/lib/cjs/geometry3d/Range.js +1 -2
- package/lib/cjs/geometry3d/Range.js.map +1 -1
- package/lib/cjs/geometry3d/Ray3d.d.ts +5 -5
- package/lib/cjs/geometry3d/Ray3d.js +5 -5
- package/lib/cjs/geometry3d/Ray3d.js.map +1 -1
- package/lib/cjs/geometry3d/Transform.d.ts.map +1 -1
- package/lib/cjs/geometry3d/Transform.js.map +1 -1
- package/lib/cjs/numerics/Polynomials.d.ts.map +1 -1
- package/lib/cjs/numerics/Polynomials.js +0 -1
- package/lib/cjs/numerics/Polynomials.js.map +1 -1
- package/lib/cjs/polyface/IndexedEdgeMatcher.d.ts +4 -4
- package/lib/cjs/polyface/IndexedEdgeMatcher.d.ts.map +1 -1
- package/lib/cjs/polyface/IndexedEdgeMatcher.js +3 -3
- package/lib/cjs/polyface/IndexedEdgeMatcher.js.map +1 -1
- package/lib/cjs/polyface/IndexedPolyfaceVisitor.d.ts.map +1 -1
- package/lib/cjs/polyface/IndexedPolyfaceVisitor.js.map +1 -1
- package/lib/cjs/polyface/Polyface.d.ts +7 -2
- package/lib/cjs/polyface/Polyface.d.ts.map +1 -1
- package/lib/cjs/polyface/Polyface.js +8 -1
- package/lib/cjs/polyface/Polyface.js.map +1 -1
- package/lib/cjs/polyface/PolyfaceBuilder.d.ts.map +1 -1
- package/lib/cjs/polyface/PolyfaceBuilder.js.map +1 -1
- package/lib/cjs/polyface/PolyfaceQuery.d.ts +36 -8
- package/lib/cjs/polyface/PolyfaceQuery.d.ts.map +1 -1
- package/lib/cjs/polyface/PolyfaceQuery.js +112 -31
- package/lib/cjs/polyface/PolyfaceQuery.js.map +1 -1
- package/lib/cjs/serialization/GeometrySamples.d.ts.map +1 -1
- package/lib/cjs/serialization/GeometrySamples.js.map +1 -1
- package/lib/cjs/serialization/IModelJsonSchema.d.ts +1 -1
- package/lib/cjs/serialization/IModelJsonSchema.d.ts.map +1 -1
- package/lib/cjs/serialization/IModelJsonSchema.js +4 -3
- package/lib/cjs/serialization/IModelJsonSchema.js.map +1 -1
- package/lib/cjs/solid/Sphere.d.ts +1 -1
- package/lib/cjs/solid/Sphere.js +3 -3
- package/lib/cjs/solid/Sphere.js.map +1 -1
- package/lib/cjs/solid/TorusPipe.d.ts +17 -13
- package/lib/cjs/solid/TorusPipe.d.ts.map +1 -1
- package/lib/cjs/solid/TorusPipe.js +67 -38
- package/lib/cjs/solid/TorusPipe.js.map +1 -1
- package/lib/cjs/topology/Graph.d.ts +1 -1
- package/lib/cjs/topology/Graph.js +1 -1
- package/lib/cjs/topology/Graph.js.map +1 -1
- package/lib/cjs/topology/Merging.d.ts.map +1 -1
- package/lib/cjs/topology/Merging.js +9 -1
- package/lib/cjs/topology/Merging.js.map +1 -1
- package/lib/cjs/topology/Triangulation.d.ts +1 -1
- package/lib/cjs/topology/Triangulation.js +1 -1
- package/lib/cjs/topology/Triangulation.js.map +1 -1
- package/lib/esm/Geometry.d.ts +26 -10
- package/lib/esm/Geometry.d.ts.map +1 -1
- package/lib/esm/Geometry.js +32 -17
- package/lib/esm/Geometry.js.map +1 -1
- package/lib/esm/bspline/BSplineCurve.d.ts +11 -5
- package/lib/esm/bspline/BSplineCurve.d.ts.map +1 -1
- package/lib/esm/bspline/BSplineCurve.js +47 -18
- package/lib/esm/bspline/BSplineCurve.js.map +1 -1
- package/lib/esm/bspline/BezierCurveBase.d.ts +10 -3
- package/lib/esm/bspline/BezierCurveBase.d.ts.map +1 -1
- package/lib/esm/bspline/BezierCurveBase.js +12 -4
- package/lib/esm/bspline/BezierCurveBase.js.map +1 -1
- package/lib/esm/bspline/InterpolationCurve3d.d.ts.map +1 -1
- package/lib/esm/bspline/InterpolationCurve3d.js +4 -1
- package/lib/esm/bspline/InterpolationCurve3d.js.map +1 -1
- package/lib/esm/bspline/KnotVector.d.ts.map +1 -1
- package/lib/esm/bspline/KnotVector.js +3 -0
- package/lib/esm/bspline/KnotVector.js.map +1 -1
- package/lib/esm/curve/Arc3d.d.ts +10 -4
- package/lib/esm/curve/Arc3d.d.ts.map +1 -1
- package/lib/esm/curve/Arc3d.js +17 -5
- package/lib/esm/curve/Arc3d.js.map +1 -1
- package/lib/esm/curve/CurveChainWithDistanceIndex.d.ts +15 -7
- package/lib/esm/curve/CurveChainWithDistanceIndex.d.ts.map +1 -1
- package/lib/esm/curve/CurveChainWithDistanceIndex.js +46 -29
- package/lib/esm/curve/CurveChainWithDistanceIndex.js.map +1 -1
- package/lib/esm/curve/CurveCollection.d.ts +13 -4
- package/lib/esm/curve/CurveCollection.d.ts.map +1 -1
- package/lib/esm/curve/CurveCollection.js +23 -2
- package/lib/esm/curve/CurveCollection.js.map +1 -1
- package/lib/esm/curve/CurveCurveIntersectXY.js +1 -1
- package/lib/esm/curve/CurveCurveIntersectXY.js.map +1 -1
- package/lib/esm/curve/CurveCurveIntersectXYZ.d.ts +4 -3
- package/lib/esm/curve/CurveCurveIntersectXYZ.d.ts.map +1 -1
- package/lib/esm/curve/CurveCurveIntersectXYZ.js +8 -6
- package/lib/esm/curve/CurveCurveIntersectXYZ.js.map +1 -1
- package/lib/esm/curve/CurvePrimitive.d.ts +20 -18
- package/lib/esm/curve/CurvePrimitive.d.ts.map +1 -1
- package/lib/esm/curve/CurvePrimitive.js +52 -333
- package/lib/esm/curve/CurvePrimitive.js.map +1 -1
- package/lib/esm/curve/LineSegment3d.d.ts +8 -2
- package/lib/esm/curve/LineSegment3d.d.ts.map +1 -1
- package/lib/esm/curve/LineSegment3d.js +9 -0
- package/lib/esm/curve/LineSegment3d.js.map +1 -1
- package/lib/esm/curve/LineString3d.d.ts +18 -2
- package/lib/esm/curve/LineString3d.d.ts.map +1 -1
- package/lib/esm/curve/LineString3d.js +39 -23
- package/lib/esm/curve/LineString3d.js.map +1 -1
- package/lib/esm/curve/ProxyCurve.d.ts +9 -7
- package/lib/esm/curve/ProxyCurve.d.ts.map +1 -1
- package/lib/esm/curve/ProxyCurve.js +4 -0
- package/lib/esm/curve/ProxyCurve.js.map +1 -1
- package/lib/esm/curve/Query/PlanarSubdivision.d.ts +2 -1
- package/lib/esm/curve/Query/PlanarSubdivision.d.ts.map +1 -1
- package/lib/esm/curve/Query/PlanarSubdivision.js +5 -4
- package/lib/esm/curve/Query/PlanarSubdivision.js.map +1 -1
- package/lib/esm/curve/RegionOps.d.ts +5 -0
- package/lib/esm/curve/RegionOps.d.ts.map +1 -1
- package/lib/esm/curve/RegionOps.js +17 -3
- package/lib/esm/curve/RegionOps.js.map +1 -1
- package/lib/esm/curve/RegionOpsClassificationSweeps.d.ts +9 -6
- package/lib/esm/curve/RegionOpsClassificationSweeps.d.ts.map +1 -1
- package/lib/esm/curve/RegionOpsClassificationSweeps.js +56 -48
- package/lib/esm/curve/RegionOpsClassificationSweeps.js.map +1 -1
- package/lib/esm/curve/internalContexts/AppendPlaneIntersectionStrokeHandler.d.ts +55 -0
- package/lib/esm/curve/internalContexts/AppendPlaneIntersectionStrokeHandler.d.ts.map +1 -0
- package/lib/esm/curve/internalContexts/AppendPlaneIntersectionStrokeHandler.js +139 -0
- package/lib/esm/curve/internalContexts/AppendPlaneIntersectionStrokeHandler.js.map +1 -0
- package/lib/esm/curve/internalContexts/ClosestPointStrokeHandler.d.ts +43 -0
- package/lib/esm/curve/internalContexts/ClosestPointStrokeHandler.d.ts.map +1 -0
- package/lib/esm/curve/internalContexts/ClosestPointStrokeHandler.js +142 -0
- package/lib/esm/curve/internalContexts/ClosestPointStrokeHandler.js.map +1 -0
- package/lib/esm/curve/internalContexts/CurveLengthContext.d.ts +33 -0
- package/lib/esm/curve/internalContexts/CurveLengthContext.d.ts.map +1 -0
- package/lib/esm/curve/internalContexts/CurveLengthContext.js +87 -0
- package/lib/esm/curve/internalContexts/CurveLengthContext.js.map +1 -0
- package/lib/esm/curve/internalContexts/NewtonRtoRStrokeHandler.d.ts +21 -0
- package/lib/esm/curve/internalContexts/NewtonRtoRStrokeHandler.d.ts.map +1 -0
- package/lib/esm/curve/internalContexts/NewtonRtoRStrokeHandler.js +30 -0
- package/lib/esm/curve/internalContexts/NewtonRtoRStrokeHandler.js.map +1 -0
- package/lib/esm/curve/internalContexts/PlaneAltitudeRangeContext.d.ts +31 -8
- package/lib/esm/curve/internalContexts/PlaneAltitudeRangeContext.d.ts.map +1 -1
- package/lib/esm/curve/internalContexts/PlaneAltitudeRangeContext.js +77 -12
- package/lib/esm/curve/internalContexts/PlaneAltitudeRangeContext.js.map +1 -1
- package/lib/esm/curve/spiral/DirectSpiral3d.d.ts +2 -2
- package/lib/esm/curve/spiral/DirectSpiral3d.d.ts.map +1 -1
- package/lib/esm/curve/spiral/DirectSpiral3d.js +15 -8
- package/lib/esm/curve/spiral/DirectSpiral3d.js.map +1 -1
- package/lib/esm/curve/spiral/TransitionSpiral3d.d.ts +12 -7
- package/lib/esm/curve/spiral/TransitionSpiral3d.d.ts.map +1 -1
- package/lib/esm/curve/spiral/TransitionSpiral3d.js +12 -3
- package/lib/esm/curve/spiral/TransitionSpiral3d.js.map +1 -1
- package/lib/esm/geometry3d/Angle.d.ts +66 -42
- package/lib/esm/geometry3d/Angle.d.ts.map +1 -1
- package/lib/esm/geometry3d/Angle.js +201 -99
- package/lib/esm/geometry3d/Angle.js.map +1 -1
- package/lib/esm/geometry3d/AngleSweep.d.ts +102 -60
- package/lib/esm/geometry3d/AngleSweep.d.ts.map +1 -1
- package/lib/esm/geometry3d/AngleSweep.js +191 -106
- package/lib/esm/geometry3d/AngleSweep.js.map +1 -1
- package/lib/esm/geometry3d/Matrix3d.d.ts +25 -8
- package/lib/esm/geometry3d/Matrix3d.d.ts.map +1 -1
- package/lib/esm/geometry3d/Matrix3d.js +67 -15
- package/lib/esm/geometry3d/Matrix3d.js.map +1 -1
- package/lib/esm/geometry3d/Point2dArrayCarrier.d.ts +1 -0
- package/lib/esm/geometry3d/Point2dArrayCarrier.d.ts.map +1 -1
- package/lib/esm/geometry3d/Point2dArrayCarrier.js +2 -1
- package/lib/esm/geometry3d/Point2dArrayCarrier.js.map +1 -1
- package/lib/esm/geometry3d/Point2dVector2d.d.ts +86 -25
- package/lib/esm/geometry3d/Point2dVector2d.d.ts.map +1 -1
- package/lib/esm/geometry3d/Point2dVector2d.js +230 -81
- package/lib/esm/geometry3d/Point2dVector2d.js.map +1 -1
- package/lib/esm/geometry3d/Point3dArrayCarrier.d.ts +14 -4
- package/lib/esm/geometry3d/Point3dArrayCarrier.d.ts.map +1 -1
- package/lib/esm/geometry3d/Point3dArrayCarrier.js +15 -5
- package/lib/esm/geometry3d/Point3dArrayCarrier.js.map +1 -1
- package/lib/esm/geometry3d/Point3dVector3d.d.ts +121 -67
- package/lib/esm/geometry3d/Point3dVector3d.d.ts.map +1 -1
- package/lib/esm/geometry3d/Point3dVector3d.js +318 -137
- package/lib/esm/geometry3d/Point3dVector3d.js.map +1 -1
- package/lib/esm/geometry3d/Range.d.ts +1 -2
- package/lib/esm/geometry3d/Range.d.ts.map +1 -1
- package/lib/esm/geometry3d/Range.js +1 -2
- package/lib/esm/geometry3d/Range.js.map +1 -1
- package/lib/esm/geometry3d/Ray3d.d.ts +5 -5
- package/lib/esm/geometry3d/Ray3d.js +5 -5
- package/lib/esm/geometry3d/Ray3d.js.map +1 -1
- package/lib/esm/geometry3d/Transform.d.ts.map +1 -1
- package/lib/esm/geometry3d/Transform.js.map +1 -1
- package/lib/esm/numerics/Polynomials.d.ts.map +1 -1
- package/lib/esm/numerics/Polynomials.js +0 -1
- package/lib/esm/numerics/Polynomials.js.map +1 -1
- package/lib/esm/polyface/IndexedEdgeMatcher.d.ts +4 -4
- package/lib/esm/polyface/IndexedEdgeMatcher.d.ts.map +1 -1
- package/lib/esm/polyface/IndexedEdgeMatcher.js +3 -3
- package/lib/esm/polyface/IndexedEdgeMatcher.js.map +1 -1
- package/lib/esm/polyface/IndexedPolyfaceVisitor.d.ts.map +1 -1
- package/lib/esm/polyface/IndexedPolyfaceVisitor.js.map +1 -1
- package/lib/esm/polyface/Polyface.d.ts +7 -2
- package/lib/esm/polyface/Polyface.d.ts.map +1 -1
- package/lib/esm/polyface/Polyface.js +8 -1
- package/lib/esm/polyface/Polyface.js.map +1 -1
- package/lib/esm/polyface/PolyfaceBuilder.d.ts.map +1 -1
- package/lib/esm/polyface/PolyfaceBuilder.js.map +1 -1
- package/lib/esm/polyface/PolyfaceQuery.d.ts +36 -8
- package/lib/esm/polyface/PolyfaceQuery.d.ts.map +1 -1
- package/lib/esm/polyface/PolyfaceQuery.js +113 -32
- package/lib/esm/polyface/PolyfaceQuery.js.map +1 -1
- package/lib/esm/serialization/GeometrySamples.d.ts.map +1 -1
- package/lib/esm/serialization/GeometrySamples.js.map +1 -1
- package/lib/esm/serialization/IModelJsonSchema.d.ts +1 -1
- package/lib/esm/serialization/IModelJsonSchema.d.ts.map +1 -1
- package/lib/esm/serialization/IModelJsonSchema.js +4 -3
- package/lib/esm/serialization/IModelJsonSchema.js.map +1 -1
- package/lib/esm/solid/Sphere.d.ts +1 -1
- package/lib/esm/solid/Sphere.js +3 -3
- package/lib/esm/solid/Sphere.js.map +1 -1
- package/lib/esm/solid/TorusPipe.d.ts +17 -13
- package/lib/esm/solid/TorusPipe.d.ts.map +1 -1
- package/lib/esm/solid/TorusPipe.js +67 -38
- package/lib/esm/solid/TorusPipe.js.map +1 -1
- package/lib/esm/topology/Graph.d.ts +1 -1
- package/lib/esm/topology/Graph.js +1 -1
- package/lib/esm/topology/Graph.js.map +1 -1
- package/lib/esm/topology/Merging.d.ts.map +1 -1
- package/lib/esm/topology/Merging.js +9 -1
- package/lib/esm/topology/Merging.js.map +1 -1
- package/lib/esm/topology/Triangulation.d.ts +1 -1
- package/lib/esm/topology/Triangulation.js +1 -1
- package/lib/esm/topology/Triangulation.js.map +1 -1
- package/package.json +5 -5
|
@@ -16,6 +16,7 @@ const Range_1 = require("../geometry3d/Range");
|
|
|
16
16
|
const CurveCollection_1 = require("./CurveCollection");
|
|
17
17
|
const CurveExtendMode_1 = require("./CurveExtendMode");
|
|
18
18
|
const CurveLocationDetail_1 = require("./CurveLocationDetail");
|
|
19
|
+
const PlaneAltitudeRangeContext_1 = require("./internalContexts/PlaneAltitudeRangeContext");
|
|
19
20
|
const PolygonOffsetContext_1 = require("./internalContexts/PolygonOffsetContext");
|
|
20
21
|
const Path_1 = require("./Path");
|
|
21
22
|
/**
|
|
@@ -81,9 +82,9 @@ class PathFragment {
|
|
|
81
82
|
}
|
|
82
83
|
/** Convert chainDistance to true chidFraction, using detailed moveSignedDistanceFromFraction
|
|
83
84
|
*/
|
|
84
|
-
chainDistanceToAccurateChildFraction(chainDistance) {
|
|
85
|
+
chainDistanceToAccurateChildFraction(chainDistance, allowExtrapolation) {
|
|
85
86
|
// The fragments are really expected to do good mappings in their distance range ...
|
|
86
|
-
const childDetail = this.childCurve.moveSignedDistanceFromFraction(this.childFraction0, chainDistance - this.chainDistance0, false);
|
|
87
|
+
const childDetail = this.childCurve.moveSignedDistanceFromFraction(this.childFraction0, chainDistance - this.chainDistance0, allowExtrapolation !== null && allowExtrapolation !== void 0 ? allowExtrapolation : false);
|
|
87
88
|
return childDetail.fraction;
|
|
88
89
|
}
|
|
89
90
|
/** Return the scale factor to map childCurve fraction derivatives to chain fraction derivatives
|
|
@@ -106,12 +107,16 @@ class PathFragment {
|
|
|
106
107
|
this.chainDistance0 = totalDistance - d1;
|
|
107
108
|
this.chainDistance1 = totalDistance - d0;
|
|
108
109
|
}
|
|
110
|
+
/** @deprecated Use childFractionToChainDistance */
|
|
111
|
+
childFractionTChainDistance(fraction) {
|
|
112
|
+
return this.childFractionToChainDistance(fraction);
|
|
113
|
+
}
|
|
109
114
|
/**
|
|
110
115
|
* convert a fractional position on the childCurve to distance in the chain space.
|
|
111
116
|
* * Return value is SIGNED -- will be negative when fraction < this.childFraction0.
|
|
112
117
|
* @param fraction fraction along the curve within this fragment
|
|
113
118
|
*/
|
|
114
|
-
|
|
119
|
+
childFractionToChainDistance(fraction) {
|
|
115
120
|
let d = this.childCurve.curveLengthBetweenFractions(this.childFraction0, fraction);
|
|
116
121
|
if (fraction < this.childFraction0)
|
|
117
122
|
d = -d;
|
|
@@ -145,7 +150,7 @@ class DistanceIndexConstructionContext {
|
|
|
145
150
|
let f1;
|
|
146
151
|
for (let i = 1, f0 = fraction0; i <= numStrokes; i++, f0 = f1) {
|
|
147
152
|
f1 = Geometry_1.Geometry.interpolate(fraction0, i / numStrokes, fraction1);
|
|
148
|
-
point0.interpolate(
|
|
153
|
+
point0.interpolate(f1, point1, fragmentPoint1);
|
|
149
154
|
d0 = this._accumulatedDistance;
|
|
150
155
|
this._accumulatedDistance += (Math.abs(f1 - f0) * point0.distance(point1));
|
|
151
156
|
this._fragments.push(new PathFragment(f0, f1, d0, this._accumulatedDistance, cp, Range_1.Range3d.create(fragmentPoint0, fragmentPoint1)));
|
|
@@ -213,37 +218,41 @@ class CurveChainWithDistanceIndex extends CurvePrimitive_1.CurvePrimitive {
|
|
|
213
218
|
return CurveChainWithDistanceIndex.createCapture(c);
|
|
214
219
|
}
|
|
215
220
|
/** Return a deep clone */
|
|
216
|
-
clonePartialCurve(
|
|
217
|
-
if (
|
|
221
|
+
clonePartialCurve(fractionA, fractionB) {
|
|
222
|
+
if (fractionA === fractionB)
|
|
218
223
|
return undefined;
|
|
219
|
-
let
|
|
220
|
-
let
|
|
221
|
-
const reversed =
|
|
224
|
+
let fracA = fractionA;
|
|
225
|
+
let fracB = fractionB;
|
|
226
|
+
const reversed = fractionA > fractionB;
|
|
222
227
|
if (reversed) {
|
|
223
|
-
|
|
224
|
-
|
|
228
|
+
fracA = fractionB;
|
|
229
|
+
fracB = fractionA;
|
|
225
230
|
}
|
|
226
|
-
const chainDistanceA =
|
|
227
|
-
const chainDistanceB =
|
|
228
|
-
const newPath = Path_1.Path.create();
|
|
231
|
+
const chainDistanceA = fracA * this._totalLength;
|
|
232
|
+
const chainDistanceB = fracB * this._totalLength;
|
|
229
233
|
const fragmentA = this.chainDistanceToFragment(chainDistanceA, true);
|
|
234
|
+
if (undefined === fragmentA)
|
|
235
|
+
return undefined;
|
|
230
236
|
const fragmentB = this.chainDistanceToFragment(chainDistanceB, true);
|
|
231
|
-
if (
|
|
237
|
+
if (undefined === fragmentB)
|
|
232
238
|
return undefined;
|
|
233
|
-
const childCurveIndexA = this._path.childIndex(fragmentA.childCurve);
|
|
234
|
-
|
|
235
|
-
const childFractionA = fragmentA.chainDistanceToAccurateChildFraction(chainDistanceA);
|
|
236
|
-
const childFractionB = fragmentB.chainDistanceToAccurateChildFraction(chainDistanceB);
|
|
237
|
-
if (childCurveIndexA === undefined || childCurveIndexB === undefined)
|
|
239
|
+
const childCurveIndexA = this._path.childIndex(fragmentA.childCurve, true);
|
|
240
|
+
if (undefined === childCurveIndexA)
|
|
238
241
|
return undefined;
|
|
242
|
+
const childCurveIndexB = this._path.childIndex(fragmentB.childCurve, true);
|
|
243
|
+
if (undefined === childCurveIndexB)
|
|
244
|
+
return undefined;
|
|
245
|
+
const childFractionA = fragmentA.chainDistanceToAccurateChildFraction(chainDistanceA, true);
|
|
246
|
+
const childFractionB = fragmentB.chainDistanceToAccurateChildFraction(chainDistanceB, true);
|
|
239
247
|
// add a (possibly reversed) partial clone to newPath
|
|
248
|
+
const newPath = Path_1.Path.create();
|
|
240
249
|
const addPartialChild = (childCurve, childFraction0, childFraction1, reversedClone) => {
|
|
241
|
-
if (
|
|
250
|
+
if (childFraction0 === childFraction1)
|
|
242
251
|
return false;
|
|
243
252
|
let newCurve;
|
|
244
|
-
if (
|
|
253
|
+
if (childFraction0 === 0.0 && childFraction1 === 1.0) {
|
|
245
254
|
newCurve = childCurve.clone();
|
|
246
|
-
if (
|
|
255
|
+
if (reversedClone)
|
|
247
256
|
newCurve.reverseInPlace();
|
|
248
257
|
}
|
|
249
258
|
else {
|
|
@@ -374,7 +383,7 @@ class CurveChainWithDistanceIndex extends CurvePrimitive_1.CurvePrimitive {
|
|
|
374
383
|
}
|
|
375
384
|
/**
|
|
376
385
|
* Capture (not clone) a path into a new `CurveChainWithDistanceIndex`
|
|
377
|
-
* @param
|
|
386
|
+
* @param path primitive array to be CAPTURED (not cloned)
|
|
378
387
|
*/
|
|
379
388
|
static createCapture(path, options) {
|
|
380
389
|
const fragments = DistanceIndexConstructionContext.createPathFragmentIndex(path, options);
|
|
@@ -471,7 +480,7 @@ class CurveChainWithDistanceIndex extends CurvePrimitive_1.CurvePrimitive {
|
|
|
471
480
|
const chainDistance = fraction * this._totalLength;
|
|
472
481
|
const fragment = this.chainDistanceToFragment(chainDistance, true);
|
|
473
482
|
if (fragment) {
|
|
474
|
-
const childFraction = fragment.chainDistanceToAccurateChildFraction(chainDistance);
|
|
483
|
+
const childFraction = fragment.chainDistanceToAccurateChildFraction(chainDistance, true);
|
|
475
484
|
return fragment.childCurve.fractionToPoint(childFraction, result);
|
|
476
485
|
}
|
|
477
486
|
// no fragment found. Use _fragments[0]
|
|
@@ -489,7 +498,7 @@ class CurveChainWithDistanceIndex extends CurvePrimitive_1.CurvePrimitive {
|
|
|
489
498
|
fractionToPointAndDerivative(fraction, result) {
|
|
490
499
|
const distanceAlongPath = fraction * this._totalLength;
|
|
491
500
|
const fragment = this.chainDistanceToFragment(distanceAlongPath, true);
|
|
492
|
-
const curveFraction = fragment.chainDistanceToAccurateChildFraction(distanceAlongPath);
|
|
501
|
+
const curveFraction = fragment.chainDistanceToAccurateChildFraction(distanceAlongPath, true);
|
|
493
502
|
result = fragment.childCurve.fractionToPointAndDerivative(curveFraction, result);
|
|
494
503
|
const a = this._totalLength / result.direction.magnitude();
|
|
495
504
|
result.direction.scaleInPlace(a);
|
|
@@ -504,7 +513,7 @@ class CurveChainWithDistanceIndex extends CurvePrimitive_1.CurvePrimitive {
|
|
|
504
513
|
fractionToPointAndUnitTangent(fraction, result) {
|
|
505
514
|
const distanceAlongPath = fraction * this._totalLength;
|
|
506
515
|
const fragment = this.chainDistanceToFragment(distanceAlongPath, true);
|
|
507
|
-
const curveFraction = fragment.chainDistanceToAccurateChildFraction(distanceAlongPath);
|
|
516
|
+
const curveFraction = fragment.chainDistanceToAccurateChildFraction(distanceAlongPath, true);
|
|
508
517
|
result = fragment.childCurve.fractionToPointAndDerivative(curveFraction, result);
|
|
509
518
|
result.direction.normalizeInPlace();
|
|
510
519
|
return result;
|
|
@@ -519,7 +528,7 @@ class CurveChainWithDistanceIndex extends CurvePrimitive_1.CurvePrimitive {
|
|
|
519
528
|
const totalLength = this._totalLength;
|
|
520
529
|
const distanceAlongPath = fraction * totalLength;
|
|
521
530
|
const fragment = this.chainDistanceToFragment(distanceAlongPath, true);
|
|
522
|
-
const curveFraction = fragment.chainDistanceToAccurateChildFraction(distanceAlongPath);
|
|
531
|
+
const curveFraction = fragment.chainDistanceToAccurateChildFraction(distanceAlongPath, true);
|
|
523
532
|
result = fragment.childCurve.fractionToPointAnd2Derivatives(curveFraction, result);
|
|
524
533
|
if (!result)
|
|
525
534
|
return undefined;
|
|
@@ -648,7 +657,7 @@ class CurveChainWithDistanceIndex extends CurvePrimitive_1.CurvePrimitive {
|
|
|
648
657
|
return undefined;
|
|
649
658
|
const fragment = this.curveAndChildFractionToFragment(childDetail.curve, childDetail.fraction);
|
|
650
659
|
if (fragment) {
|
|
651
|
-
const chainDistance = fragment.
|
|
660
|
+
const chainDistance = fragment.childFractionToChainDistance(childDetail.fraction);
|
|
652
661
|
const chainFraction = this.chainDistanceToChainFraction(chainDistance);
|
|
653
662
|
const chainDetail = CurveLocationDetail_1.CurveLocationDetail.createCurveFractionPoint(this, chainFraction, childDetail.point);
|
|
654
663
|
chainDetail.childDetail = childDetail;
|
|
@@ -676,6 +685,14 @@ class CurveChainWithDistanceIndex extends CurvePrimitive_1.CurvePrimitive {
|
|
|
676
685
|
}
|
|
677
686
|
return offsets;
|
|
678
687
|
}
|
|
688
|
+
/** Project instance geometry (via dispatch) onto the given ray, and return the extreme fractional parameters of projection.
|
|
689
|
+
* @param ray ray onto which the instance is projected. A `Vector3d` is treated as a `Ray3d` with zero origin.
|
|
690
|
+
* @param lowHigh optional receiver for output
|
|
691
|
+
* @returns range of fractional projection parameters onto the ray, where 0.0 is start of the ray and 1.0 is the end of the ray.
|
|
692
|
+
*/
|
|
693
|
+
projectedParameterRange(ray, lowHigh) {
|
|
694
|
+
return PlaneAltitudeRangeContext_1.PlaneAltitudeRangeContext.findExtremeFractionsAlongDirection(this, ray, lowHigh);
|
|
695
|
+
}
|
|
679
696
|
}
|
|
680
697
|
exports.CurveChainWithDistanceIndex = CurveChainWithDistanceIndex;
|
|
681
698
|
CurveChainWithDistanceIndex._numCalls = 0;
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"CurveChainWithDistanceIndex.js","sourceRoot":"","sources":["../../../src/curve/CurveChainWithDistanceIndex.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F;;GAEG;AAEH,4DAAyD;AACzD,kEAA+D;AAC/D,0CAAuC;AAIvC,mEAAkE;AAClE,+CAA8C;AAG9C,uDAA+C;AAC/C,uDAAqG;AACrG,+DAA4D;AAE5D,kFAAwE;AAExE,iCAA8B;AAG9B;;;;;;GAMG;AACH,MAAa,YAAY;IAevB,yEAAyE;IACzE,YAAmB,cAAsB,EAAE,cAAsB,EAAE,SAAiB,EAAE,SAAiB,EAAE,UAA0B,EACjI,KAAe;QACf,IAAI,CAAC,cAAc,GAAG,cAAc,CAAC;QACrC,IAAI,CAAC,cAAc,GAAG,cAAc,CAAC;QACrC,IAAI,CAAC,cAAc,GAAG,SAAS,CAAC;QAChC,IAAI,CAAC,cAAc,GAAG,SAAS,CAAC;QAChC,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;QAC7B,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;IACb,CAAC;IACD;;;OAGG;IACI,qBAAqB,CAAC,QAAgB;QAC3C,OAAO,QAAQ,IAAI,IAAI,CAAC,cAAc,IAAI,QAAQ,IAAI,IAAI,CAAC,cAAc,CAAC;IAC5E,CAAC;IACH,yFAAyF;IACzF,iBAAiB;IACR,4BAA4B,CAAC,UAAmB;QACrD,IAAI,IAAI,CAAC,KAAK,EAAC;YACb,OAAO,IAAI,CAAC,KAAK,CAAC,eAAe,CAAE,UAAU,CAAC,CAAC;SAChD;QACD,uCAAuC;QACvC,MAAM,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC,YAAY,CAAE,UAAU,EAAE,KAAK,CAAC,CAAC;QAChE,IAAI,MAAM;YACR,OAAO,MAAM,CAAC,CAAC,CAAC;QAClB,OAAO,CAAC,CAAC;IACX,CAAC;IACD,6FAA6F;IAC7F,kEAAkE;IAC3D,MAAM,CAAC,8BAA8B,CAAC,SAAyB,EAAE,UAAmB;QACzF,MAAM,eAAe,GAAoB,EAAE,CAAC;QAC5C,KAAK,MAAM,CAAC,IAAI,SAAS,EAAC;YACxB,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,4BAA4B,CAAE,UAAU,CAAC,CAAC;YAClD,eAAe,CAAC,IAAI,CAAE,CAAC,CAAC,CAAC;SAC1B;QACH,eAAe,CAAC,IAAI,CAAE,CAAC,CAAe,EAAE,CAAe,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,GAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACtE,OAAO,eAAe,CAAC;IACvB,CAAC;IACD;;;OAGG;IACI,kCAAkC,CAAC,KAAqB,EAAE,QAAgB;QAC/E,OAAO,IAAI,CAAC,UAAU,KAAK,KAAK,IAAI,QAAQ,IAAI,IAAI,CAAC,cAAc,IAAI,QAAQ,IAAI,IAAI,CAAC,cAAc,CAAC;IACzG,CAAC;IAED;;OAEG;IACI,wCAAwC,CAAC,QAAgB;QAC9D,OAAO,mBAAQ,CAAC,kBAAkB,CAChC,IAAI,CAAC,cAAc,EAAE,IAAI,CAAC,cAAc,EACxC,IAAI,CAAC,cAAc,EAAE,IAAI,CAAC,cAAc,EACxC,QAAQ,EAAE,IAAI,CAAC,cAAc,CAAE,CAAC,CAAI,wEAAwE;IAChH,CAAC;IACD;OACG;IACI,oCAAoC,CAAC,aAAqB;QAC/D,oFAAoF;QACpF,MAAM,WAAW,GAAG,IAAI,CAAC,UAAU,CAAC,8BAA8B,CAChE,IAAI,CAAC,cAAc,EAAE,aAAa,GAAG,IAAI,CAAC,cAAc,EAAE,KAAK,CAAC,CAAC;QACnE,OAAO,WAAW,CAAC,QAAQ,CAAC;IAC9B,CAAC;IACD;;OAEG;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;;;OAGG;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,2BAA2B,CAAC,QAAgB;QACjD,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;AAhHD,oCAgHC;AACD,mEAAmE;AACnE,MAAM,gCAAgC;IAGpC;QACE,IAAI,CAAC,oBAAoB,GAAG,CAAC,CAAC;QAC9B,IAAI,CAAC,UAAU,GAAG,EAAE,CAAC;IACvB,CAAC;IACD,0EAA0E;IACnE,yBAAyB,CAAC,GAAmB,IAAI,CAAC;IAClD,mBAAmB,CAAC,GAAmB,IAAI,CAAC;IAC5C,uBAAuB,CAAC,GAAmB,IAAI,CAAC;IAChD,iBAAiB,CAAC,GAAmB,IAAI,CAAC;IACjD,8CAA8C;IACvC,oBAAoB,CAAC,IAAa,EAAE,SAAiB,EAAE,QAAkB,IAAI,CAAC;IACrF,2FAA2F;IACpF,uBAAuB,CAC5B,EAAkB,EAClB,MAAe,EACf,MAAe,EACf,UAAkB,EAClB,SAAiB,EACjB,SAAiB;QACf,MAAM,cAAc,GAAG,MAAM,CAAC,KAAK,EAAG,CAAC;QACvC,MAAM,cAAc,GAAG,MAAM,CAAC,KAAK,EAAG,CAAC;QACzC,IAAI,EAAE,GAAG,IAAI,CAAC,oBAAoB,CAAC;QACnC,IAAI,UAAU,IAAI,CAAC,EAAE;YACnB,IAAI,CAAC,oBAAoB,IAAI,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;YACrD,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,YAAY,CAAC,SAAS,EAAE,SAAS,EAAE,EAAE,EAAE,IAAI,CAAC,oBAAoB,EAAE,EAAE,EAC3F,eAAO,CAAC,MAAM,CAAE,cAAc,EAAE,cAAc,CAAC,CAAC,CAAC,CAAC;SACrD;aAAM;YACL,IAAI,EAAE,CAAC;YACP,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,SAAS,EAAE,CAAC,IAAI,UAAU,EAAE,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE;gBAC7D,EAAE,GAAG,mBAAQ,CAAC,WAAW,CAAC,SAAS,EAAE,CAAC,GAAG,UAAU,EAAE,SAAS,CAAC,CAAC;gBAChE,MAAM,CAAC,WAAW,CAAE,SAAS,EAAE,MAAM,EAAE,cAAc,CAAC,CAAC;gBACvD,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,CAAE,cAAc,EAAE,cAAc,CAAC,CAAC,CAAC,CAAC;gBACpD,cAAc,CAAC,OAAO,CAAE,cAAc,CAAC,CAAC;aACzC;SACF;IACH,CAAC;IACM,qCAAqC,CAC1C,EAAkB,EAClB,UAAkB,EAClB,SAAiB,EACjB,SAAiB;QACjB,IAAI,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;QACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,SAAS,EAAE,CAAC,IAAI,UAAU,EAAE,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE;YAC7D,EAAE,GAAG,mBAAQ,CAAC,WAAW,CAAC,SAAS,EAAE,CAAC,GAAG,UAAU,EAAE,SAAS,CAAC,CAAC;YAChE,CAAC,GAAG,EAAE,CAAC,2BAA2B,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YAC3C,EAAE,GAAG,IAAI,CAAC,oBAAoB,CAAC;YAC/B,IAAI,CAAC,oBAAoB,IAAI,CAAC,CAAC;YAC/B,MAAM,KAAK,GAAG,EAAE,CAAC,qBAAqB,CAAE,EAAE,EAAE,EAAE,CAAC,CAAC;YAChD,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,YAAY,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,oBAAoB,EAAE,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC;SAC1F;IACH,CAAC;IACM,6BAA6B,KAAe,OAAO,IAAI,CAAC,CAAA,CAAC;IACzD,MAAM,CAAC,uBAAuB,CAAC,IAAgB,EAAE,OAAuB;QAC7E,MAAM,OAAO,GAAG,IAAI,gCAAgC,EAAE,CAAC;QACvD,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE;YACjC,KAAK,CAAC,kBAAkB,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;SAC5C;QACD,MAAM,SAAS,GAAG,OAAO,CAAC,UAAU,CAAC;QACrC,OAAO,SAAS,CAAC;IACnB,CAAC;CACF;AACD;;;;;;GAMG;AACH,MAAa,2BAA4B,SAAQ,+BAAc;IAS7D,4FAA4F;IAC5F,YAAoB,IAAgB,EAAE,SAAyB;QAC7D,KAAK,EAAE,CAAC;QAVV,wCAAwC;QACxB,uBAAkB,GAAG,6BAA6B,CAAC;QAUjE,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;QAC5B,IAAI,CAAC,YAAY,GAAG,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC;IAChG,CAAC;IARD,uDAAuD;IAChD,mBAAmB,CAAC,KAAoB,IAAa,OAAO,KAAK,YAAY,2BAA2B,CAAC,CAAC,CAAC;IAQlH;;;OAGG;IACI,gBAAgB,CAAC,SAAoB;QAC1C,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QAC7B,IAAI,CAAC,YAAY,4BAAU,IAAI,CAAC,CAAC,mBAAmB,CAAC,SAAS,CAAC;YAC7D,OAAO,2BAA2B,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;QACtD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;OAEG;IACH,IAAW,IAAI,KAAiB,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;IAEpD,0BAA0B;IACnB,KAAK;QACV,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,EAAgB,CAAC;QAC3C,OAAO,2BAA2B,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;IACtD,CAAC;IAED,0BAA0B;IACV,iBAAiB,CAAC,UAAkB,EAAE,UAAkB;QACtE,IAAI,UAAU,KAAK,UAAU;YAC3B,OAAO,SAAS,CAAC;QACnB,IAAI,SAAS,GAAG,UAAU,CAAC;QAC3B,IAAI,SAAS,GAAG,UAAU,CAAC;QAC3B,MAAM,QAAQ,GAAG,UAAU,GAAG,UAAU,CAAC;QACzC,IAAI,QAAQ,EAAC;YACX,SAAS,GAAG,UAAU,CAAC;YACvB,SAAS,GAAG,UAAU,CAAC;SACxB;QACD,MAAM,cAAc,GAAG,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC;QACrD,MAAM,cAAc,GAAG,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC;QACrD,MAAM,OAAO,GAAG,WAAI,CAAC,MAAM,EAAG,CAAC;QAC/B,MAAM,SAAS,GAAG,IAAI,CAAC,uBAAuB,CAAC,cAAc,EAAE,IAAI,CAAC,CAAC;QACrE,MAAM,SAAS,GAAG,IAAI,CAAC,uBAAuB,CAAE,cAAc,EAAE,IAAI,CAAC,CAAC;QACtE,IAAI,CAAC,SAAS,IAAI,CAAC,SAAS;YAC1B,OAAO,SAAS,CAAC;QACnB,MAAM,gBAAgB,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAE,SAAS,CAAC,UAAU,CAAC,CAAC;QACtE,MAAM,gBAAgB,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC;QACrE,MAAM,cAAc,GAAG,SAAS,CAAC,oCAAoC,CAAE,cAAc,CAAC,CAAC;QACvF,MAAM,cAAc,GAAG,SAAS,CAAC,oCAAoC,CAAE,cAAc,CAAC,CAAC;QACvF,IAAI,gBAAgB,KAAK,SAAS,IAAI,gBAAgB,KAAK,SAAS;YAChE,OAAO,SAAS,CAAC;QACrB,qDAAqD;QACrD,MAAM,eAAe,GAAG,CAAC,UAA0B,EAAE,cAAsB,EAAE,cAAsB,EAAE,aAAsB,EAAW,EAAE;YACtI,IAAI,SAAS,KAAK,SAAS;gBACzB,OAAO,KAAK,CAAC;YACf,IAAI,QAAQ,CAAC;YACb,IAAI,SAAS,KAAK,GAAG,IAAI,SAAS,KAAK,GAAG,EAAC;gBACzC,QAAQ,GAAG,UAAU,CAAC,KAAK,EAAG,CAAC;gBAC/B,IAAI,QAAQ;oBACV,QAAQ,CAAC,cAAc,EAAG,CAAC;aAC9B;iBAAM;gBACL,QAAQ,GAAG,aAAa,CAAA,CAAC;oBACX,UAAU,CAAC,iBAAiB,CAAE,cAAc,EAAE,cAAc,CAAC;oBAC/D,CAAC,CAAC,UAAU,CAAC,iBAAiB,CAAE,cAAc,EAAE,cAAc,CAAC,CAAC;aAC7E;YACH,IAAI,QAAQ,EAAC;gBACX,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBAChC,OAAO,IAAI,CAAC;aACX;YACH,OAAO,KAAK,CAAC;QACb,CAAC,CAAC;QAEF,IAAI,SAAS,CAAC,UAAU,KAAK,SAAS,CAAC,UAAU,EAAC;YAChD,+CAA+C;YAC/C,IAAI,eAAe,CAAE,SAAS,CAAC,UAAU,EAAE,cAAc,EAAE,cAAc,EAAE,QAAQ,CAAC;gBAClF,OAAO,2BAA2B,CAAC,aAAa,CAAE,OAAO,CAAC,CAAC,CAAG,wDAAwD;YACxH,OAAO,SAAS,CAAC;SAClB;QACD,eAAe,CAAE,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,gBAAgB,CAAC,EAAE,cAAc,EAAE,GAAG,EAAE,QAAQ,CAAC,CAAC;QACvF,mDAAmD;QACnD,KAAK,IAAI,UAAU,GAAG,gBAAgB,GAAG,CAAC,EAAE,UAAU,GAAG,gBAAgB,EAAE,UAAU,EAAE,EAAC;YACtF,eAAe,CAAE,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,UAAU,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,QAAQ,CAAC,CAAC;SACvE;QACD,eAAe,CAAE,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,gBAAgB,CAAC,EAAE,GAAG,EAAE,cAAc,EAAE,QAAQ,CAAC,CAAC;QACzF,wEAAwE;QACtE,IAAI,QAAQ;YACV,OAAO,CAAC,QAAQ,CAAC,OAAO,EAAG,CAAC;QAC9B,OAAO,2BAA2B,CAAC,aAAa,CAAE,OAAO,CAAC,CAAC;IAC7D,CAAC;IAED;;OAEG;IACI,SAAS,CAAC,KAAmC;QAClD,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE;YACnC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC;gBACrB,OAAO,KAAK,CAAC;SAChB;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,yGAAyG;IACzF,UAAU,CAAC,MAAgB;QACzC,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC;QAC7C,IAAI,CAAC;YACH,OAAO,CAAC,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;QAC9B,OAAO,yBAAO,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;IACpC,CAAC;IACD,qGAAqG;IACrF,QAAQ,CAAC,MAAgB;QACvC,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9C,IAAI,CAAC;YACH,OAAO,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QAC5B,OAAO,yBAAO,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;IACpC,CAAC;IACD,gDAAgD;IACzC,WAAW,CAAC,IAAkB,EAAE,OAAuB;QAC5D,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE;YACnC,CAAC,CAAC,WAAW,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;SAC9B;IACH,CAAC;IACD;;OAEG;IACI,kBAAkB,CAAC,IAAoB,EAAE,OAAuB;QACrE,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE;YACnC,CAAC,CAAC,kBAAkB,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;SACrC;IACH,CAAC;IACD;;;OAGG;IACI,4BAA4B,CAAC,OAAuB;QACzD,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE;YACnC,SAAS,IAAI,CAAC,CAAC,4BAA4B,CAAC,OAAO,CAAC,CAAC;SACtD;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;OAMG;IACa,wBAAwB,CAAC,cAAgC,EAAE,6BAAsC,KAAK,EAAE,qBAA8B,KAAK;QACzJ,IAAI,0BAA0B,EAAE;YAC9B,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE;gBACnC,CAAC,CAAC,wBAAwB,CAAC,cAAc,EAAE,0BAA0B,EAAE,kBAAkB,CAAC,CAAC;aAC5F;SACF;aAAM;YACL,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;SAC3B;IACH,CAAC;IAED;;;;OAIG;IACa,qCAAqC,CAAC,OAAuB,EAAE,eAAgC;QAC7G,MAAM,KAAK,GAAG,+BAAc,CAAC,yCAAyC,CAAC,IAAI,EAAE,eAAe,CAAC,CAAC;QAC9F,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE;YACnC,CAAC,CAAC,qCAAqC,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;SACzD;QACD,+BAAc,CAAC,qBAAqB,CAAC,IAAI,EAAE,KAAK,EAAE,eAAe,CAAC,CAAC;IACrE,CAAC;IACD;;OAEG;IACI,yBAAyB,CAAC,OAAwB;QACvD,OAAO,IAAI,CAAC,KAAK,CAAC,yBAAyB,CAAC,OAAO,CAAC,CAAC;IACvD,CAAC;IACD;OACG;IACI,WAAW,CAAC,aAAsB,EAAE,SAAqB;QAC9D,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,aAAa,EAAE,SAAS,CAAC,CAAC;IACnD,CAAC;IACD;;;;;OAKG;IACa,2BAA2B,CAAC,SAAiB,EAAE,SAAiB;QAC9E,OAAO,IAAI,CAAC,GAAG,CAAC,SAAS,GAAG,SAAS,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC;IAC7D,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,aAAa,CAAC,IAAgB,EAAE,OAAuB;QACnE,MAAM,SAAS,GAAG,gCAAgC,CAAC,uBAAuB,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QAC1F,MAAM,MAAM,GAAG,IAAI,2BAA2B,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;QAChE,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;OAIG;IACO,uBAAuB,CAAC,QAAgB,EAAE,qBAA8B,KAAK;QACrF,MAAM,YAAY,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC;QAC5C,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC;QAClC,IAAI,YAAY,GAAG,CAAC,EAAE;YACpB,IAAI,QAAQ,GAAG,GAAG;gBAChB,OAAO,kBAAkB,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;YACvD,IAAI,QAAQ,IAAI,IAAI,CAAC,YAAY;gBAC/B,OAAO,kBAAkB,CAAC,CAAC,CAAC,SAAS,CAAC,YAAY,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;YACtE,wBAAwB;YACxB,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE;gBAChC,IAAI,QAAQ,CAAC,qBAAqB,CAAC,QAAQ,CAAC;oBAAE,OAAO,QAAQ,CAAC;aAC/D;SACF;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;OAIG;IACQ,4BAA4B,CAAC,QAAgB,EAAE,qBAA8B,KAAK;QAC3F,MAAM,YAAY,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC;QAC5C,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC;QAClC,IAAI,YAAY,GAAG,CAAC,EAAE;YACpB,IAAI,QAAQ,GAAG,GAAG;gBAChB,OAAO,kBAAkB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;YAC5C,IAAI,QAAQ,GAAG,IAAI,CAAC,YAAY;gBAC9B,OAAO,kBAAkB,CAAC,CAAC,CAAC,CAAC,YAAY,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;YAC7D,wBAAwB;YACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,EAAE,CAAC,EAAE,EAAE;gBACrC,IAAI,SAAS,CAAC,CAAC,CAAC,CAAC,qBAAqB,CAAC,QAAQ,CAAC;oBAAE,OAAO,CAAC,CAAC;aAC5D;SACF;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;OAGG;IACI,4BAA4B,CAAC,QAAgB,IAAY,OAAO,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC;IACtG;;;;OAIG;IACO,+BAA+B,CAAC,KAAqB,EAAE,QAAgB;QAC/E,MAAM,YAAY,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC;QAC5C,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC;QAClC,IAAI,YAAY,GAAG,CAAC,EAAE;YACpB,wBAAwB;YACxB,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE;gBAChC,IAAI,QAAQ,CAAC,kCAAkC,CAAC,KAAK,EAAE,QAAQ,CAAC;oBAAE,OAAO,QAAQ,CAAC;aACnF;YACD,IAAI,QAAQ,IAAI,CAAC;gBACf,OAAO,SAAS,CAAC,CAAC,CAAC,CAAC;YACtB,IAAI,QAAQ,GAAG,GAAG;gBAChB,OAAO,SAAS,CAAC,YAAY,GAAG,CAAC,CAAC,CAAC;SACtC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;OAEG;IACa,WAAW;QACzB,OAAO,IAAI,CAAC,YAAY,CAAC;IAC3B,CAAC;IACD;;;OAGG;IACI,WAAW;QAChB,OAAO,IAAI,CAAC,YAAY,CAAC;IAC3B,CAAC;IAED;;;;OAIG;IACI,eAAe,CAAC,QAAgB,EAAE,MAAgB;QACvD,MAAM,aAAa,GAAG,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC;QACnD,MAAM,QAAQ,GAAG,IAAI,CAAC,uBAAuB,CAAC,aAAa,EAAE,IAAI,CAAC,CAAC;QACnE,IAAI,QAAQ,EAAE;YACZ,MAAM,aAAa,GAAG,QAAQ,CAAC,oCAAoC,CAAC,aAAa,CAAC,CAAC;YACnF,OAAO,QAAQ,CAAC,UAAU,CAAC,eAAe,CAAC,aAAa,EAAE,MAAM,CAAC,CAAC;SACnE;QACD,wCAAwC;QACxC,mEAAmE;QACnE,OAAO,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,eAAe,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;IACpE,CAAC;IAED;;;;;;;OAOG;IACI,4BAA4B,CAAC,QAAgB,EAAE,MAAc;QAClE,MAAM,iBAAiB,GAAG,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC;QACvD,MAAM,QAAQ,GAAG,IAAI,CAAC,uBAAuB,CAAC,iBAAiB,EAAE,IAAI,CAAE,CAAC;QACxE,MAAM,aAAa,GAAG,QAAQ,CAAC,oCAAoC,CAAC,iBAAiB,CAAC,CAAC;QACvF,MAAM,GAAG,QAAQ,CAAC,UAAU,CAAC,4BAA4B,CAAC,aAAa,EAAE,MAAM,CAAC,CAAC;QACjF,MAAM,CAAC,GAAG,IAAI,CAAC,YAAY,GAAG,MAAM,CAAC,SAAS,CAAC,SAAS,EAAE,CAAC;QAC3D,MAAM,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QACjC,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;OAKG;IACa,6BAA6B,CAAC,QAAgB,EAAE,MAAc;QAC5E,MAAM,iBAAiB,GAAG,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC;QACvD,MAAM,QAAQ,GAAG,IAAI,CAAC,uBAAuB,CAAC,iBAAiB,EAAE,IAAI,CAAE,CAAC;QACxE,MAAM,aAAa,GAAG,QAAQ,CAAC,oCAAoC,CAAC,iBAAiB,CAAC,CAAC;QACvF,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;;;;;OAKG;IACI,8BAA8B,CAAC,QAAgB,EAAE,MAAkC;QACxF,MAAM,WAAW,GAAG,IAAI,CAAC,YAAY,CAAC;QACtC,MAAM,iBAAiB,GAAG,QAAQ,GAAG,WAAW,CAAC;QACjD,MAAM,QAAQ,GAAG,IAAI,CAAC,uBAAuB,CAAC,iBAAiB,EAAE,IAAI,CAAE,CAAC;QACxE,MAAM,aAAa,GAAG,QAAQ,CAAC,oCAAoC,CAAC,iBAAiB,CAAC,CAAC;QACvF,MAAM,GAAG,QAAQ,CAAC,UAAU,CAAC,8BAA8B,CAAC,aAAa,EAAE,MAAM,CAAC,CAAC;QACnF,IAAI,CAAC,MAAM;YACT,OAAO,SAAS,CAAC;QACnB,MAAM,KAAK,GAAG,MAAM,CAAC,OAAO,CAAC,gBAAgB,EAAE,CAAC;QAChD,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC9B,MAAM,KAAK,GAAG,MAAM,CAAC,OAAO,CAAC,UAAU,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QACxD,MAAM,IAAI,GAAG,GAAG,GAAG,IAAI,CAAC;QACxB,MAAM,CAAC,GAAG,IAAI,GAAG,IAAI,CAAC;QACtB,0BAAQ,CAAC,gBAAgB,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC,EAAE,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,GAAG,KAAK,GAAG,KAAK,EAAE,MAAM,CAAC,OAAO,CAAC,CAAC,CAAG,8BAA8B;QAClI,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAC3B,uCAAuC;QACvC,MAAM,CAAC,OAAO,CAAC,YAAY,CAAC,WAAW,CAAC,CAAC;QACzC,MAAM,CAAC,OAAO,CAAC,YAAY,CAAC,WAAW,GAAG,WAAW,CAAC,CAAC;QACvD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;OAEG;IACI,mBAAmB,CAAC,SAAoB;QAC7C,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE;YACnC,IAAI,CAAC,CAAC,CAAC,mBAAmB,CAAC,SAAS,CAAC;gBACnC,OAAO,EAAE,CAAC;SACb;QACD,OAAO,OAAO,KAAK,CAAC,CAAC;IACvB,CAAC;IACD,gGAAgG;IACzF,cAAc;QACnB,IAAI,CAAC,KAAK,CAAC,sBAAsB,EAAE,CAAC;QACpC,MAAM,WAAW,GAAG,IAAI,CAAC,YAAY,CAAC;QACtC,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,UAAU;YACpC,QAAQ,CAAC,4BAA4B,CAAC,WAAW,CAAC,CAAC;QACrD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE;YAC/D,MAAM,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YACpC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YACxC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC;SAC/B;IACH,CAAC;IACD;;;;;OAKG;IACa,aAAa,CAAC,KAAoB;QAChD,IAAI,KAAK,YAAY,2BAA2B,EAAE;YAChD,OAAO,mBAAQ,CAAC,gBAAgB,CAAC,IAAI,CAAC,YAAY,EAAE,KAAK,CAAC,YAAY,CAAC;mBAClE,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;SAC5C;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;OAGG;IACa,8BAA8B,CAAC,aAAqB,EAAE,cAAsB,EAAE,cAAuB,EAAE,MAA4B;QACjJ,MAAM,SAAS,GAAG,aAAa,GAAG,IAAI,CAAC,YAAY,CAAC;QACpD,MAAM,SAAS,GAAG,SAAS,GAAG,cAAc,CAAC;QAC7C,MAAM,SAAS,GAAG,IAAI,CAAC,uBAAuB,CAAC,SAAS,EAAE,IAAI,CAAE,CAAC;QACjE,MAAM,WAAW,GAAG,SAAS,CAAC,UAAU,CAAC,8BAA8B,CAAC,SAAS,CAAC,cAAc,EAAE,SAAS,GAAG,SAAS,CAAC,cAAc,EAAE,cAAc,EAAE,MAAM,CAAC,CAAC;QAChK,MAAM,WAAW,GAAG,aAAa,GAAG,CAAC,cAAc,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC;QACzE,MAAM,WAAW,GAAG,yCAAmB,CAAC,mCAAmC,CAAC,cAAc,EAAE,IAAI,EAAE,aAAa,EAAE,WAAW,EAAE,cAAc,EAAE,MAAM,CAAC,CAAC;QACtJ,WAAW,CAAC,WAAW,GAAG,WAAW,CAAC;QACtC,OAAO,WAAW,CAAC;IACrB,CAAC;IAEH;;;;;;;;;OASG;IACM,MAAM,CAAC,yBAAyB,CAAC,QAAiB,IAAI;QAE3D,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;SAAC,CAAC;QAEpC,IAAI,KAAK,EAAC;YACR,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,aAAa,GAAG,CAAC,CAAC;SAC9D;QACD,OAAO,CAAC,CAAC;IACX,CAAC;IAKD;;;;;;;OAOG;IACa,YAAY,CAAC,UAAmB,EAAE,MAAmC;QACnF,IAAI,WAA4C,CAAC;QACjD,IAAI,IAAI,GAAG,MAAM,CAAC,SAAS,CAAC;QAC5B,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;QAC9C,IAAI,WAAW,KAAK,CAAC,EAAE;YACrB,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,UAAU,EAAE,MAAM,CAAC,CAAC;SACtE;aAAM;YACL,MAAM,eAAe,GAAG,YAAY,CAAC,8BAA8B,CAAE,IAAI,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC;YAClG,MAAM,OAAO,GAAG,CAAC,oCAAkB,CAAC,mDAAmD,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,iCAAe,CAAC,IAAI,CAAC,CAAC;YAC1H,MAAM,OAAO,GAAG,CAAC,iCAAe,CAAC,IAAI,EAAE,oCAAkB,CAAC,mDAAmD,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC;YAC1H,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YACrC,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAC9D,2BAA2B,CAAC,SAAS,EAAE,CAAC;YACxC,2BAA2B,CAAC,aAAa,IAAG,eAAe,CAAC,MAAM,CAAC;YACnE,KAAK,MAAM,CAAC,IAAI,eAAe,EAAE;gBAC/B,IAAI,CAAC,CAAC,CAAC,GAAE,IAAI;oBACX,MAAM;gBACR,2BAA2B,CAAC,UAAU,EAAE,CAAC;gBACzC,MAAM,KAAK,GAAG,CAAC,CAAC,UAAU,CAAC;gBAC3B,MAAM,OAAO,GAAG,KAAK,CAAC,YAAY,CAAC,UAAU,EAC3C,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;gBACjE,IAAI,OAAO,IAAI,OAAO,CAAC,CAAC,GAAG,IAAI,EAAE;oBAC/B,IAAI,GAAG,OAAO,CAAC,CAAC,CAAC;oBACjB,WAAW,GAAG,yCAAmB,CAAC,wBAAwB,CAAC,OAAO,CAAC,KAAK,EAAE,OAAO,CAAC,QAAQ,EAAE,OAAO,CAAC,KAAK,EAAE,WAAW,CAAE,CAAC;oBACzH,WAAW,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC;oBAC1B,2BAA2B,CAAC,YAAY,EAAE,CAAC;iBAC5C;aACF;SAEF;QACD,IAAI,CAAC,WAAW;YACd,OAAO,SAAS,CAAC;QACnB,MAAM,QAAQ,GAAG,IAAI,CAAC,+BAA+B,CAAC,WAAW,CAAC,KAAM,EAAE,WAAW,CAAC,QAAQ,CAAC,CAAC;QAChG,IAAI,QAAQ,EAAE;YACZ,MAAM,aAAa,GAAG,QAAQ,CAAC,2BAA2B,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;YACjF,MAAM,aAAa,GAAG,IAAI,CAAC,4BAA4B,CAAC,aAAa,CAAC,CAAC;YACvE,MAAM,WAAW,GAAG,yCAAmB,CAAC,wBAAwB,CAAC,IAAI,EAAE,aAAa,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC;YACzG,WAAW,CAAC,WAAW,GAAG,WAAW,CAAC;YACtC,WAAW,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC;YAC9B,OAAO,WAAW,CAAC;SACpB;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;;OAIG;IACa,iBAAiB,CAAC,uBAA+C;QAC/E,MAAM,OAAO,GAAG,oCAAa,CAAC,MAAM,CAAC,uBAAuB,CAAC,CAAC;QAC9D,MAAM,OAAO,GAAqB,EAAE,CAAC;QACrC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,sBAAsB,CAAC,SAAS,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE;YACrE,MAAM,MAAM,GAAG,IAAI,CAAC,iBAAiB,CAAC,OAAO,CAAC,CAAC;YAC/C,IAAI,MAAM,KAAK,SAAS,EAAE;gBACxB,IAAI,MAAM,YAAY,+BAAc;oBAClC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;qBAClB,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC;oBAC5B,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;aAC5C;SACF;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;;AAlgBH,kEAmgBC;AA3EgB,qCAAS,GAAG,CAAC,CAAC;AACd,sCAAU,GAAG,CAAC,CAAC;AACf,wCAAY,GAAG,CAAC,CAAC;AACjB,yCAAa,GAAG,CAAC,CAAC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n\r\n/** @packageDocumentation\r\n * @module Curve\r\n */\r\n\r\nimport { CurvePrimitive } from \"../curve/CurvePrimitive\";\r\nimport { StrokeCountMap } from \"../curve/Query/StrokeCountMap\";\r\nimport { Geometry } from \"../Geometry\";\r\nimport { GeometryHandler, IStrokeHandler } from \"../geometry3d/GeometryHandler\";\r\nimport { Plane3dByOriginAndUnitNormal } from \"../geometry3d/Plane3dByOriginAndUnitNormal\";\r\nimport { Plane3dByOriginAndVectors } from \"../geometry3d/Plane3dByOriginAndVectors\";\r\nimport { Point3d, Vector3d } from \"../geometry3d/Point3dVector3d\";\r\nimport { Range3d } from \"../geometry3d/Range\";\r\nimport { Ray3d } from \"../geometry3d/Ray3d\";\r\nimport { Transform } from \"../geometry3d/Transform\";\r\nimport { CurveChain } from \"./CurveCollection\";\r\nimport { CurveExtendMode, CurveExtendOptions, VariantCurveExtendParameter } from \"./CurveExtendMode\";\r\nimport { CurveLocationDetail } from \"./CurveLocationDetail\";\r\nimport { GeometryQuery } from \"./GeometryQuery\";\r\nimport { OffsetOptions } from \"./internalContexts/PolygonOffsetContext\";\r\nimport { LineString3d } from \"./LineString3d\";\r\nimport { Path } from \"./Path\";\r\nimport { StrokeOptions } from \"./StrokeOptions\";\r\n\r\n/**\r\n * * Annotation of an interval of a curve.\r\n * * The interval is marked with two pairs of numbers:\r\n * * * fraction0, fraction1 = fraction parameters along the child curve\r\n * * * distance0,distance1 = distances within containing CurveChainWithDistanceIndex\r\n * @public\r\n */\r\nexport class PathFragment {\r\n /** distance along parent to this fragment start */\r\n public chainDistance0: number;\r\n /** distance along parent to this fragment end */\r\n public chainDistance1: number;\r\n /** Fractional position of this fragment start within its curve primitive. */\r\n public childFraction0: number;\r\n /** Fractional position of this fragment end within its curve primitive.. */\r\n public childFraction1: number;\r\n /** Curve primitive of this fragment, as presented in stroker. Note that his 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(childFraction0: number, childFraction1: number, distance0: number, distance1: number, childCurve: CurvePrimitive,\r\n range?: Range3d) {\r\n this.childFraction0 = childFraction0;\r\n this.childFraction1 = childFraction1;\r\n this.chainDistance0 = distance0;\r\n this.chainDistance1 = distance1;\r\n this.childCurve = childCurve;\r\n this.range = range;\r\n this.a = 0;\r\n }\r\n /**\r\n * Return true if the distance is within the distance limits of this fragment.\r\n * @param distance\r\n */\r\n public containsChainDistance(distance: number): boolean {\r\n return distance >= this.chainDistance0 && distance <= this.chainDistance1;\r\n }\r\n// Return a quick distance to the curve. This may be SMALLER than true distance but may\r\n// not be larger.\r\n public quickMinDistanceToChildCurve(spacePoint: Point3d): number {\r\n if (this.range){\r\n return this.range.distanceToPoint (spacePoint);\r\n }\r\n // ugh. have to do real computation ..\r\n const detail = this.childCurve.closestPoint (spacePoint, false);\r\n if (detail)\r\n return detail.a;\r\n return 0;\r\n }\r\n // Return an array with (references to) all the path fragments, sorted smallest to largest on\r\n // the \"a\" value equal to the quick min distance to the fragment\r\n public static collectSortedQuickMinDistances(fragments: PathFragment[], spacePoint: Point3d): PathFragment[]{\r\n const sortedFragments: PathFragment [] = [];\r\n for (const f of fragments){\r\n f.a = f.quickMinDistanceToChildCurve (spacePoint);\r\n sortedFragments.push (f);\r\n }\r\n sortedFragments.sort ((a: PathFragment, b: PathFragment) => a.a- b.a);\r\n return sortedFragments;\r\n }\r\n /**\r\n * Return true if this fragment addresses `curve` and brackets `fraction`\r\n * @param distance\r\n */\r\n public containsChildCurveAndChildFraction(curve: CurvePrimitive, fraction: number): boolean {\r\n return this.childCurve === curve && fraction >= this.childFraction0 && fraction <= this.childFraction1;\r\n }\r\n\r\n /** Convert distance to local fraction, and apply that to interpolate between the stored curve fractions.\r\n * Note that proportional calculation does NOT account for nonuniform parameterization in the child curve.\r\n */\r\n public chainDistanceToInterpolatedChildFraction(distance: number): number {\r\n return Geometry.inverseInterpolate(\r\n this.childFraction0, this.chainDistance0,\r\n this.childFraction1, this.chainDistance1,\r\n distance, this.childFraction0)!; // the interval \"must\" have nonzero length, division should be safe . ..\r\n }\r\n /** Convert chainDistance to true chidFraction, using detailed moveSignedDistanceFromFraction\r\n */\r\n public chainDistanceToAccurateChildFraction(chainDistance: number): number {\r\n // The fragments are really expected to do good mappings in their distance range ...\r\n const childDetail = this.childCurve.moveSignedDistanceFromFraction(\r\n this.childFraction0, chainDistance - this.chainDistance0, false);\r\n return childDetail.fraction;\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 /** Reverse the fraction and distance data.\r\n * * each child fraction `f` is replaced by `1-f`\r\n * * each `chainDistance` is replaced by `totalDistance-chainDistance`\r\n */\r\n public reverseFractionsAndDistances(totalDistance: number) {\r\n const f0 = this.childFraction0;\r\n const f1 = this.childFraction1;\r\n const d0 = this.chainDistance0;\r\n const d1 = this.chainDistance1;\r\n this.childFraction0 = 1.0 - f1;\r\n this.childFraction1 = 1.0 - f0;\r\n this.chainDistance0 = totalDistance - d1;\r\n this.chainDistance1 = totalDistance - d0;\r\n }\r\n /**\r\n * convert a fractional position on the childCurve to distance in the chain space.\r\n * * Return value is SIGNED -- will be negative when fraction < this.childFraction0.\r\n * @param fraction fraction along the curve within this fragment\r\n */\r\n public childFractionTChainDistance(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/** Non-instantiable class to build a distance index for a path. */\r\nclass DistanceIndexConstructionContext implements IStrokeHandler {\r\n private _fragments: PathFragment[];\r\n private _accumulatedDistance: number;\r\n private constructor() {\r\n this._accumulatedDistance = 0;\r\n this._fragments = [];\r\n }\r\n // ignore curve announcements -- they are repeated in stroke announcements\r\n public startParentCurvePrimitive(_cp: CurvePrimitive) { }\r\n public startCurvePrimitive(_cp: CurvePrimitive) { }\r\n public endParentCurvePrimitive(_cp: CurvePrimitive) { }\r\n public endCurvePrimitive(_cp: CurvePrimitive) { }\r\n // um .. we need to see curves? how to reject?\r\n public announcePointTangent(_xyz: Point3d, _fraction: number, _tangent: Vector3d) { }\r\n /** Announce numPoints interpolated between point0 and point1, with associated fractions */\r\n public announceSegmentInterval(\r\n cp: CurvePrimitive,\r\n point0: Point3d,\r\n point1: Point3d,\r\n numStrokes: number,\r\n fraction0: number,\r\n fraction1: number): 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 (fraction1, 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,\r\n numStrokes: number,\r\n fraction0: number,\r\n fraction1: number): void {\r\n let f1, d, d0;\r\n for (let i = 1, f0 = fraction0; i <= numStrokes; i++, f0 = f1) {\r\n f1 = Geometry.interpolate(fraction0, i / numStrokes, fraction1);\r\n d = cp.curveLengthBetweenFractions(f0, f1);\r\n d0 = this._accumulatedDistance;\r\n this._accumulatedDistance += d;\r\n const range = cp.rangeBetweenFractions (f0, f1);\r\n this._fragments.push(new PathFragment(f0, f1, d0, this._accumulatedDistance, cp, range));\r\n }\r\n }\r\n public needPrimaryGeometryForStrokes?(): boolean { return true;}\r\n public static createPathFragmentIndex(path: CurveChain, options?: StrokeOptions): PathFragment[] {\r\n const handler = new DistanceIndexConstructionContext();\r\n for (const curve of path.children) {\r\n curve.emitStrokableParts(handler, options);\r\n }\r\n const fragments = handler._fragments;\r\n return fragments;\r\n }\r\n}\r\n/**\r\n * `CurveChainWithDistanceIndex` is a CurvePrimitive whose fractional parameterization is proportional to true\r\n * distance along a CurveChain.\r\n * * The curve chain can be any type derived from CurveChain.\r\n * * * i.e. either a `Path` or a `Loop`\r\n * @public\r\n */\r\nexport class CurveChainWithDistanceIndex extends CurvePrimitive {\r\n /** String name for schema properties */\r\n public readonly curvePrimitiveType = \"curveChainWithDistanceIndex\";\r\n\r\n private _path: CurveChain;\r\n private _fragments: PathFragment[];\r\n private _totalLength: number; // matches final fragment distance1.\r\n /** Test if other is a `CurveChainWithDistanceIndex` */\r\n public isSameGeometryClass(other: GeometryQuery): boolean { return other instanceof CurveChainWithDistanceIndex; }\r\n // final assembly of CurveChainWithDistanceIndex -- caller must create valid fragment index.\r\n private constructor(path: CurveChain, fragments: PathFragment[]) {\r\n super();\r\n this._path = path;\r\n this._fragments = fragments;\r\n this._totalLength = fragments.length > 0 ? fragments[fragments.length - 1].chainDistance1 : 0;\r\n }\r\n /**\r\n * Create a clone, transformed and with its own distance index.\r\n * @param transform transform to apply in the clone.\r\n */\r\n public cloneTransformed(transform: Transform): CurveChainWithDistanceIndex | undefined {\r\n const c = this._path.clone();\r\n if (c instanceof CurveChain && c.tryTransformInPlace(transform))\r\n return CurveChainWithDistanceIndex.createCapture(c);\r\n return undefined;\r\n }\r\n /** Reference to the contained path.\r\n * * Do not modify the path. The distance index will be wrong.\r\n */\r\n public get path(): CurveChain { return this._path; }\r\n\r\n /** Return a deep clone */\r\n public clone(): CurveChainWithDistanceIndex {\r\n const c = this._path.clone() as CurveChain;\r\n return CurveChainWithDistanceIndex.createCapture(c);\r\n }\r\n\r\n /** Return a deep clone */\r\n public override clonePartialCurve(_fractionA: number, _fractionB: number): CurveChainWithDistanceIndex | undefined {\r\n if (_fractionA === _fractionB)\r\n return undefined;\r\n let fractionA = _fractionA;\r\n let fractionB = _fractionB;\r\n const reversed = _fractionA > _fractionB;\r\n if (reversed){\r\n fractionA = _fractionB;\r\n fractionB = _fractionA;\r\n }\r\n const chainDistanceA = fractionA * this._totalLength;\r\n const chainDistanceB = fractionB * this._totalLength;\r\n const newPath = Path.create ();\r\n const fragmentA = this.chainDistanceToFragment(chainDistanceA, true);\r\n const fragmentB = this.chainDistanceToFragment (chainDistanceB, true);\r\n if (!fragmentA || !fragmentB)\r\n return undefined;\r\n const childCurveIndexA = this._path.childIndex (fragmentA.childCurve);\r\n const childCurveIndexB = this._path.childIndex(fragmentB.childCurve);\r\n const childFractionA = fragmentA.chainDistanceToAccurateChildFraction (chainDistanceA);\r\n const childFractionB = fragmentB.chainDistanceToAccurateChildFraction (chainDistanceB);\r\n if (childCurveIndexA === undefined || childCurveIndexB === undefined)\r\n return undefined;\r\n // add a (possibly reversed) partial clone to newPath\r\n const addPartialChild = (childCurve: CurvePrimitive, childFraction0: number, childFraction1: number, reversedClone: boolean): boolean => {\r\n if (fractionA === fractionB)\r\n return false;\r\n let newCurve;\r\n if (fractionA === 0.0 && fractionB === 1.0){\r\n newCurve = childCurve.clone ();\r\n if (reversed)\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\r\n if (fragmentA.childCurve === fragmentB.childCurve){\r\n // the two distances are within the same curve.\r\n if (addPartialChild (fragmentA.childCurve, childFractionA, childFractionB, reversed))\r\n return CurveChainWithDistanceIndex.createCapture (newPath); // singleton -- children[] does not need to be reversed.\r\n return undefined;\r\n }\r\n addPartialChild (this._path.children[childCurveIndexA], childFractionA, 1.0, reversed);\r\n // at least two distinct children are impacted ....\r\n for (let childIndex = childCurveIndexA + 1; childIndex < childCurveIndexB; childIndex++){\r\n addPartialChild (this._path.children[childIndex], 0.0, 1.0, reversed);\r\n }\r\n addPartialChild (this._path.children[childCurveIndexB], 0.0, childFractionB, reversed);\r\n // This reverses array entries but not orientation within each curve ...\r\n if (reversed)\r\n newPath.children.reverse ();\r\n return CurveChainWithDistanceIndex.createCapture (newPath);\r\n }\r\n\r\n /** Ask if the curve is within tolerance of a plane.\r\n * @returns Returns true if the curve is completely within tolerance of the plane.\r\n */\r\n public isInPlane(plane: Plane3dByOriginAndUnitNormal): boolean {\r\n for (const c of this._path.children) {\r\n if (!c.isInPlane(plane))\r\n return false;\r\n }\r\n return true;\r\n }\r\n\r\n /** return the start point of the primitive. The default implementation returns fractionToPoint (0.0) */\r\n public override startPoint(result?: Point3d): Point3d {\r\n const c = this._path.cyclicCurvePrimitive(0);\r\n if (c)\r\n return c.startPoint(result);\r\n return Point3d.createZero(result);\r\n }\r\n /** Return the end point of the primitive. The default implementation returns fractionToPoint(1.0) */\r\n public override endPoint(result?: Point3d): Point3d {\r\n const c = this._path.cyclicCurvePrimitive(-1);\r\n if (c)\r\n return c.endPoint(result);\r\n return Point3d.createZero(result);\r\n }\r\n /** Add strokes to caller-supplied linestring */\r\n public emitStrokes(dest: LineString3d, options?: StrokeOptions): void {\r\n for (const c of this._path.children) {\r\n c.emitStrokes(dest, options);\r\n }\r\n }\r\n /** 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 * * This DEFAULT simply pushes `this` to the collectorArray.\r\n * * CurvePrimitiveWithDistanceIndex optionally collects its members.\r\n * @param collectorArray array to receive primitives (pushed -- the array is not cleared)\r\n * @param smallestPossiblePrimitives if false, CurvePrimitiveWithDistanceIndex returns only itself. If true, it recurses to its (otherwise hidden) children.\r\n */\r\n public override collectCurvePrimitivesGo(collectorArray: CurvePrimitive[], smallestPossiblePrimitives: boolean = false, explodeLineStrings: boolean = false) {\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 /**\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 /** Second step of double dispatch: call `this._path.dispatchToGeometryHandler (handler)`\r\n * * Note that this exposes the children individually to the handler.\r\n */\r\n public dispatchToGeometryHandler(handler: GeometryHandler): any {\r\n return this._path.dispatchToGeometryHandler(handler);\r\n }\r\n /** Extend (increase) `rangeToExtend` as needed to include these curves (optionally transformed)\r\n */\r\n public extendRange(rangeToExtend: Range3d, transform?: Transform): void {\r\n this._path.extendRange(rangeToExtend, transform);\r\n }\r\n /**\r\n *\r\n * * Curve length is always positive.\r\n * @returns Returns a (high accuracy) length of the curve between fractional positions\r\n * @returns Returns the length of the curve.\r\n */\r\n public override curveLengthBetweenFractions(fraction0: number, fraction1: number): number {\r\n return Math.abs(fraction1 - fraction0) * this._totalLength;\r\n }\r\n /**\r\n * Capture (not clone) a path into a new `CurveChainWithDistanceIndex`\r\n * @param primitives primitive array to be CAPTURED (not cloned)\r\n */\r\n public static createCapture(path: CurveChain, options?: StrokeOptions): CurveChainWithDistanceIndex {\r\n const fragments = DistanceIndexConstructionContext.createPathFragmentIndex(path, options);\r\n const result = new CurveChainWithDistanceIndex(path, fragments);\r\n return result;\r\n }\r\n\r\n /**\r\n * Resolve a fraction of the CurveChain to a PathFragment\r\n * @param distance\r\n * @param allowExtrapolation\r\n */\r\n protected chainDistanceToFragment(distance: number, allowExtrapolation: boolean = false): PathFragment | 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 ? fragments[0] : undefined;\r\n if (distance >= this._totalLength)\r\n return allowExtrapolation ? fragments[numFragments - 1] : undefined;\r\n // humbug, linear search\r\n for (const fragment of fragments) {\r\n if (fragment.containsChainDistance(distance)) return fragment;\r\n }\r\n }\r\n return undefined;\r\n }\r\n /**\r\n * Resolve a fraction of the CurveChain to a PathFragment index\r\n * @param distance\r\n * @param allowExtrapolation\r\n */\r\n protected chainDistanceToFragmentIndex(distance: number, allowExtrapolation: boolean = false): number | undefined {\r\n const numFragments = this._fragments.length;\r\n const fragments = this._fragments;\r\n if (numFragments > 0) {\r\n if (distance < 0.0)\r\n return allowExtrapolation ? 0 : undefined;\r\n if (distance > this._totalLength)\r\n return allowExtrapolation ? (numFragments - 1) : undefined;\r\n // humbug, linear search\r\n for (let i = 0; i < numFragments; i++) {\r\n if (fragments[i].containsChainDistance(distance)) return i;\r\n }\r\n }\r\n return undefined;\r\n }\r\n\r\n /**\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 { return distance / this._totalLength; }\r\n /**\r\n * Resolve a fraction within a specific curve to a fragment.\r\n * @param curve\r\n * @param fraction\r\n */\r\n protected curveAndChildFractionToFragment(curve: CurvePrimitive, fraction: number): PathFragment | undefined {\r\n const numFragments = this._fragments.length;\r\n const fragments = this._fragments;\r\n if (numFragments > 0) {\r\n // humbug, linear search\r\n for (const fragment of fragments) {\r\n if (fragment.containsChildCurveAndChildFraction(curve, fraction)) return fragment;\r\n }\r\n if (fraction <= 0)\r\n return fragments[0];\r\n if (fraction > 1.0)\r\n return fragments[numFragments - 1];\r\n }\r\n return undefined;\r\n }\r\n\r\n /**\r\n * Returns the total length of curves.\r\n */\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 /**\r\n * Return the point (x,y,z) on the curve at fractional position along the chain.\r\n * @param fraction fractional position along the geometry.\r\n * @returns Returns a point on the curve.\r\n */\r\n public fractionToPoint(fraction: number, result?: Point3d): Point3d {\r\n const chainDistance = fraction * this._totalLength;\r\n const fragment = this.chainDistanceToFragment(chainDistance, true);\r\n if (fragment) {\r\n const childFraction = fragment.chainDistanceToAccurateChildFraction(chainDistance);\r\n return fragment.childCurve.fractionToPoint(childFraction, result);\r\n }\r\n // no fragment found. Use _fragments[0]\r\n // fragment = this.chainDistanceToFragment(chainDistance, true);\r\n return this._fragments[0].childCurve.fractionToPoint(0.0, result);\r\n }\r\n\r\n /** Return the point (x,y,z) and derivative on the curve at fractional position.\r\n *\r\n * * Note that this derivative is \"derivative of xyz with respect to fraction.\"\r\n * * this derivative shows the speed of the \"fractional point\" moving along the curve.\r\n * * this is not generally a unit vector. use fractionToPointAndUnitTangent for a unit vector.\r\n * @param fraction fractional position along the geometry.\r\n * @returns Returns a ray whose origin is the curve point and direction is the derivative with respect to the fraction.\r\n */\r\n public fractionToPointAndDerivative(fraction: number, result?: Ray3d): Ray3d {\r\n const distanceAlongPath = fraction * this._totalLength;\r\n const fragment = this.chainDistanceToFragment(distanceAlongPath, true)!;\r\n const curveFraction = fragment.chainDistanceToAccurateChildFraction(distanceAlongPath);\r\n result = fragment.childCurve.fractionToPointAndDerivative(curveFraction, result);\r\n const a = this._totalLength / result.direction.magnitude();\r\n result.direction.scaleInPlace(a);\r\n return result;\r\n }\r\n\r\n /**\r\n * Returns a ray whose origin is the curve point and direction is the unit tangent.\r\n * @param fraction fractional position on the curve\r\n * @param result optional receiver for the result.\r\n * Returns a ray whose origin is the curve point and direction is the unit tangent.\r\n */\r\n public override fractionToPointAndUnitTangent(fraction: number, result?: Ray3d): Ray3d {\r\n const distanceAlongPath = fraction * this._totalLength;\r\n const fragment = this.chainDistanceToFragment(distanceAlongPath, true)!;\r\n const curveFraction = fragment.chainDistanceToAccurateChildFraction(distanceAlongPath);\r\n result = fragment.childCurve.fractionToPointAndDerivative(curveFraction, result);\r\n result.direction.normalizeInPlace();\r\n return result;\r\n }\r\n /** Return a plane with\r\n *\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 the fraction.\r\n * * vectorV is the second derivative, i.e.derivative of vectorU.\r\n */\r\n public fractionToPointAnd2Derivatives(fraction: number, result?: Plane3dByOriginAndVectors): Plane3dByOriginAndVectors | undefined {\r\n const totalLength = this._totalLength;\r\n const distanceAlongPath = fraction * totalLength;\r\n const fragment = this.chainDistanceToFragment(distanceAlongPath, true)!;\r\n const curveFraction = fragment.chainDistanceToAccurateChildFraction(distanceAlongPath);\r\n result = fragment.childCurve.fractionToPointAnd2Derivatives(curveFraction, result);\r\n if (!result)\r\n return undefined;\r\n const dotUU = result.vectorU.magnitudeSquared();\r\n const magU = Math.sqrt(dotUU);\r\n const dotUV = result.vectorU.dotProduct(result.vectorV);\r\n const duds = 1.0 / magU;\r\n const a = duds * duds;\r\n Vector3d.createAdd2Scaled(result.vectorV, a, result.vectorU, -a * dotUV / dotUU, result.vectorV); // IN PLACE update to vectorV.\r\n result.vectorU.scale(duds);\r\n // scale for 0..1 parameterization ....\r\n result.vectorU.scaleInPlace(totalLength);\r\n result.vectorV.scaleInPlace(totalLength * totalLength);\r\n return result;\r\n }\r\n /** Attempt to transform in place.\r\n * * Warning: If any child fails, this object becomes invalid. But that should never happen.\r\n */\r\n public tryTransformInPlace(transform: Transform): boolean {\r\n let numFail = 0;\r\n for (const c of this._path.children) {\r\n if (!c.tryTransformInPlace(transform))\r\n numFail++;\r\n }\r\n return numFail === 0;\r\n }\r\n /** Reverse the curve's data so that its fractional stroking moves in the opposite direction. */\r\n public reverseInPlace(): void {\r\n this._path.reverseChildrenInPlace();\r\n const totalLength = this._totalLength;\r\n for (const fragment of this._fragments)\r\n fragment.reverseFractionsAndDistances(totalLength);\r\n for (let i = 0, j = this._fragments.length - 1; i < j; i++, j--) {\r\n const fragment = this._fragments[i];\r\n this._fragments[i] = this._fragments[j];\r\n this._fragments[j] = fragment;\r\n }\r\n }\r\n /**\r\n * Test for equality conditions:\r\n * * Mismatched totalLength is a quick exit condition\r\n * * If totalLength matches, recurse to the path for matching primitives.\r\n * @param other\r\n */\r\n public override isAlmostEqual(other: GeometryQuery): boolean {\r\n if (other instanceof CurveChainWithDistanceIndex) {\r\n return Geometry.isSameCoordinate(this._totalLength, other._totalLength)\r\n && this._path.isAlmostEqual(other._path);\r\n }\r\n return false;\r\n }\r\n\r\n /** Implement moveSignedDistanceFromFraction.\r\n * * See `CurvePrimitive` for parameter details.\r\n * * The returned location directly identifies fractional position along the CurveChainWithDistanceIndex, and has pointer to an additional detail for the child curve.\r\n */\r\n public override moveSignedDistanceFromFraction(startFraction: number, signedDistance: number, allowExtension: boolean, result?: CurveLocationDetail): CurveLocationDetail {\r\n const distanceA = startFraction * this._totalLength;\r\n const distanceB = distanceA + signedDistance;\r\n const fragmentB = this.chainDistanceToFragment(distanceB, true)!;\r\n const childDetail = fragmentB.childCurve.moveSignedDistanceFromFraction(fragmentB.childFraction0, distanceB - fragmentB.chainDistance0, allowExtension, result);\r\n const endFraction = startFraction + (signedDistance / this._totalLength);\r\n const chainDetail = CurveLocationDetail.createConditionalMoveSignedDistance(allowExtension, this, startFraction, endFraction, signedDistance, result);\r\n chainDetail.childDetail = childDetail;\r\n return chainDetail;\r\n }\r\n\r\n/**\r\n *\r\n * The returned object has\r\n * * numCalls = number of times closestPoint was called.\r\n * * numCurvesTested = number of curves tested with full closestPoint\r\n * * numAssigned = number of times a new minimum value was recorded\r\n * * numCandidate = number of curves that would be tested in worst case.\r\n * return an object summarizing closest point test counts\r\n * @param clear if true, counts are cleared after the return object is formed.\r\n */\r\n public static getClosestPointTestCounts(clear: boolean = true):\r\n {numCalls: number, numTested: number, numAssigned: number, numCandidate: number}{\r\n const a = {\r\n numCalls: this._numCalls,\r\n numTested: this._numTested,\r\n numAssigned: this._numAssigned,\r\n numCandidate: this._numCandidate};\r\n\r\n if (clear){\r\n this._numTested = this._numAssigned = this._numCandidate = 0;\r\n }\r\n return a;\r\n }\r\n private static _numCalls = 0;\r\n private static _numTested = 0;\r\n private static _numAssigned = 0;\r\n private static _numCandidate = 0;\r\n /** Search for the curve point that is closest to the spacePoint.\r\n * * The CurveChainWithDistanceIndex invokes the base class CurvePrimitive method, which\r\n * (via a handler) determines a CurveLocation detail among the children.\r\n * * The returned detail directly identifies fractional position along the CurveChainWithDistanceIndex, and has pointer to an additional detail for the child curve.\r\n * @param spacePoint point in space\r\n * @param extend true to extend the curve\r\n * @returns Returns a CurveLocationDetail structure that holds the details of the close point.\r\n */\r\n public override closestPoint(spacePoint: Point3d, extend: VariantCurveExtendParameter): CurveLocationDetail | undefined {\r\n let childDetail: CurveLocationDetail | undefined;\r\n let aMin = Number.MAX_VALUE;\r\n const numChildren = this.path.children.length;\r\n if (numChildren === 1) {\r\n childDetail = this.path.children[0].closestPoint(spacePoint, extend);\r\n } else {\r\n const sortedFragments = PathFragment.collectSortedQuickMinDistances (this._fragments, spacePoint);\r\n const extend0 = [CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(extend, 0), CurveExtendMode.None];\r\n const extend1 = [CurveExtendMode.None, CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(extend, 1)];\r\n const fragment0 = this._fragments[0];\r\n const fragment1 = this._fragments[this._fragments.length - 1];\r\n CurveChainWithDistanceIndex._numCalls++;\r\n CurveChainWithDistanceIndex._numCandidate+= sortedFragments.length;\r\n for (const f of sortedFragments) {\r\n if (f.a >aMin)\r\n break;\r\n CurveChainWithDistanceIndex._numTested++;\r\n const child = f.childCurve;\r\n const detailA = child.closestPoint(spacePoint,\r\n f === fragment0 ? extend0 : f === fragment1 ? extend1 : false);\r\n if (detailA && detailA.a < aMin) {\r\n aMin = detailA.a;\r\n childDetail = CurveLocationDetail.createCurveFractionPoint(detailA.curve, detailA.fraction, detailA.point, childDetail)!;\r\n childDetail.a = detailA.a;\r\n CurveChainWithDistanceIndex._numAssigned++;\r\n }\r\n }\r\n\r\n }\r\n if (!childDetail)\r\n return undefined;\r\n const fragment = this.curveAndChildFractionToFragment(childDetail.curve!, childDetail.fraction);\r\n if (fragment) {\r\n const chainDistance = fragment.childFractionTChainDistance(childDetail.fraction);\r\n const chainFraction = this.chainDistanceToChainFraction(chainDistance);\r\n const chainDetail = CurveLocationDetail.createCurveFractionPoint(this, chainFraction, childDetail.point);\r\n chainDetail.childDetail = childDetail;\r\n chainDetail.a = childDetail.a;\r\n return chainDetail;\r\n }\r\n return undefined;\r\n }\r\n\r\n /**\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 joined offset.\r\n * @param offsetDistanceOrOptions offset distance (positive to left of the instance curve), or options object\r\n */\r\n public override constructOffsetXY(offsetDistanceOrOptions: number | OffsetOptions): 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"]}
|
|
1
|
+
{"version":3,"file":"CurveChainWithDistanceIndex.js","sourceRoot":"","sources":["../../../src/curve/CurveChainWithDistanceIndex.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F;;GAEG;AAEH,4DAAyD;AACzD,kEAA+D;AAC/D,0CAAuC;AAIvC,mEAAkE;AAClE,+CAAuD;AAGvD,uDAA+C;AAC/C,uDAAqG;AACrG,+DAA4D;AAE5D,4FAAyF;AACzF,kFAAwE;AAExE,iCAA8B;AAG9B;;;;;;GAMG;AACH,MAAa,YAAY;IAevB,yEAAyE;IACzE,YAAmB,cAAsB,EAAE,cAAsB,EAAE,SAAiB,EAAE,SAAiB,EAAE,UAA0B,EACjI,KAAe;QACf,IAAI,CAAC,cAAc,GAAG,cAAc,CAAC;QACrC,IAAI,CAAC,cAAc,GAAG,cAAc,CAAC;QACrC,IAAI,CAAC,cAAc,GAAG,SAAS,CAAC;QAChC,IAAI,CAAC,cAAc,GAAG,SAAS,CAAC;QAChC,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;QAC7B,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;IACb,CAAC;IACD;;;OAGG;IACI,qBAAqB,CAAC,QAAgB;QAC3C,OAAO,QAAQ,IAAI,IAAI,CAAC,cAAc,IAAI,QAAQ,IAAI,IAAI,CAAC,cAAc,CAAC;IAC5E,CAAC;IACH,yFAAyF;IACzF,iBAAiB;IACR,4BAA4B,CAAC,UAAmB;QACrD,IAAI,IAAI,CAAC,KAAK,EAAC;YACb,OAAO,IAAI,CAAC,KAAK,CAAC,eAAe,CAAE,UAAU,CAAC,CAAC;SAChD;QACD,uCAAuC;QACvC,MAAM,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC,YAAY,CAAE,UAAU,EAAE,KAAK,CAAC,CAAC;QAChE,IAAI,MAAM;YACR,OAAO,MAAM,CAAC,CAAC,CAAC;QAClB,OAAO,CAAC,CAAC;IACX,CAAC;IACD,6FAA6F;IAC7F,kEAAkE;IAC3D,MAAM,CAAC,8BAA8B,CAAC,SAAyB,EAAE,UAAmB;QACzF,MAAM,eAAe,GAAoB,EAAE,CAAC;QAC5C,KAAK,MAAM,CAAC,IAAI,SAAS,EAAC;YACxB,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,4BAA4B,CAAE,UAAU,CAAC,CAAC;YAClD,eAAe,CAAC,IAAI,CAAE,CAAC,CAAC,CAAC;SAC1B;QACH,eAAe,CAAC,IAAI,CAAE,CAAC,CAAe,EAAE,CAAe,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,GAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACtE,OAAO,eAAe,CAAC;IACvB,CAAC;IACD;;;OAGG;IACI,kCAAkC,CAAC,KAAqB,EAAE,QAAgB;QAC/E,OAAO,IAAI,CAAC,UAAU,KAAK,KAAK,IAAI,QAAQ,IAAI,IAAI,CAAC,cAAc,IAAI,QAAQ,IAAI,IAAI,CAAC,cAAc,CAAC;IACzG,CAAC;IAED;;OAEG;IACI,wCAAwC,CAAC,QAAgB;QAC9D,OAAO,mBAAQ,CAAC,kBAAkB,CAChC,IAAI,CAAC,cAAc,EAAE,IAAI,CAAC,cAAc,EACxC,IAAI,CAAC,cAAc,EAAE,IAAI,CAAC,cAAc,EACxC,QAAQ,EAAE,IAAI,CAAC,cAAc,CAAE,CAAC,CAAI,wEAAwE;IAChH,CAAC;IACD;OACG;IACI,oCAAoC,CAAC,aAAqB,EAAE,kBAA4B;QAC7F,oFAAoF;QACpF,MAAM,WAAW,GAAG,IAAI,CAAC,UAAU,CAAC,8BAA8B,CAChE,IAAI,CAAC,cAAc,EAAE,aAAa,GAAG,IAAI,CAAC,cAAc,EAAE,kBAAkB,aAAlB,kBAAkB,cAAlB,kBAAkB,GAAI,KAAK,CAAC,CAAC;QACzF,OAAO,WAAW,CAAC,QAAQ,CAAC;IAC9B,CAAC;IACD;;OAEG;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;;;OAGG;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,mDAAmD;IAC5C,2BAA2B,CAAC,QAAgB;QACjD,OAAO,IAAI,CAAC,4BAA4B,CAAC,QAAQ,CAAC,CAAC;IACrD,CAAC;IACD;;;;OAIG;IACI,4BAA4B,CAAC,QAAgB;QAClD,IAAI,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,2BAA2B,CAAC,IAAI,CAAC,cAAc,EAAE,QAAQ,CAAC,CAAC;QACnF,IAAI,QAAQ,GAAG,IAAI,CAAC,cAAc;YAChC,CAAC,GAAG,CAAC,CAAC,CAAC;QACT,OAAO,IAAI,CAAC,cAAc,GAAG,CAAC,CAAC;IACjC,CAAC;CACF;AApHD,oCAoHC;AACD,mEAAmE;AACnE,MAAM,gCAAgC;IAGpC;QACE,IAAI,CAAC,oBAAoB,GAAG,CAAC,CAAC;QAC9B,IAAI,CAAC,UAAU,GAAG,EAAE,CAAC;IACvB,CAAC;IACD,0EAA0E;IACnE,yBAAyB,CAAC,GAAmB,IAAI,CAAC;IAClD,mBAAmB,CAAC,GAAmB,IAAI,CAAC;IAC5C,uBAAuB,CAAC,GAAmB,IAAI,CAAC;IAChD,iBAAiB,CAAC,GAAmB,IAAI,CAAC;IACjD,8CAA8C;IACvC,oBAAoB,CAAC,IAAa,EAAE,SAAiB,EAAE,QAAkB,IAAI,CAAC;IACrF,2FAA2F;IACpF,uBAAuB,CAC5B,EAAkB,EAClB,MAAe,EACf,MAAe,EACf,UAAkB,EAClB,SAAiB,EACjB,SAAiB;QACf,MAAM,cAAc,GAAG,MAAM,CAAC,KAAK,EAAG,CAAC;QACvC,MAAM,cAAc,GAAG,MAAM,CAAC,KAAK,EAAG,CAAC;QACzC,IAAI,EAAE,GAAG,IAAI,CAAC,oBAAoB,CAAC;QACnC,IAAI,UAAU,IAAI,CAAC,EAAE;YACnB,IAAI,CAAC,oBAAoB,IAAI,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;YACrD,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,YAAY,CAAC,SAAS,EAAE,SAAS,EAAE,EAAE,EAAE,IAAI,CAAC,oBAAoB,EAAE,EAAE,EAC3F,eAAO,CAAC,MAAM,CAAE,cAAc,EAAE,cAAc,CAAC,CAAC,CAAC,CAAC;SACrD;aAAM;YACL,IAAI,EAAE,CAAC;YACP,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,SAAS,EAAE,CAAC,IAAI,UAAU,EAAE,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE;gBAC7D,EAAE,GAAG,mBAAQ,CAAC,WAAW,CAAC,SAAS,EAAE,CAAC,GAAG,UAAU,EAAE,SAAS,CAAC,CAAC;gBAChE,MAAM,CAAC,WAAW,CAAE,EAAE,EAAE,MAAM,EAAE,cAAc,CAAC,CAAC;gBAChD,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,CAAE,cAAc,EAAE,cAAc,CAAC,CAAC,CAAC,CAAC;gBACpD,cAAc,CAAC,OAAO,CAAE,cAAc,CAAC,CAAC;aACzC;SACF;IACH,CAAC;IACM,qCAAqC,CAC1C,EAAkB,EAClB,UAAkB,EAClB,SAAiB,EACjB,SAAiB;QACjB,IAAI,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;QACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,SAAS,EAAE,CAAC,IAAI,UAAU,EAAE,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE;YAC7D,EAAE,GAAG,mBAAQ,CAAC,WAAW,CAAC,SAAS,EAAE,CAAC,GAAG,UAAU,EAAE,SAAS,CAAC,CAAC;YAChE,CAAC,GAAG,EAAE,CAAC,2BAA2B,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YAC3C,EAAE,GAAG,IAAI,CAAC,oBAAoB,CAAC;YAC/B,IAAI,CAAC,oBAAoB,IAAI,CAAC,CAAC;YAC/B,MAAM,KAAK,GAAG,EAAE,CAAC,qBAAqB,CAAE,EAAE,EAAE,EAAE,CAAC,CAAC;YAChD,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,YAAY,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,oBAAoB,EAAE,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC;SAC1F;IACH,CAAC;IACM,6BAA6B,KAAe,OAAO,IAAI,CAAC,CAAA,CAAC;IACzD,MAAM,CAAC,uBAAuB,CAAC,IAAgB,EAAE,OAAuB;QAC7E,MAAM,OAAO,GAAG,IAAI,gCAAgC,EAAE,CAAC;QACvD,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE;YACjC,KAAK,CAAC,kBAAkB,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;SAC5C;QACD,MAAM,SAAS,GAAG,OAAO,CAAC,UAAU,CAAC;QACrC,OAAO,SAAS,CAAC;IACnB,CAAC;CACF;AACD;;;;;;GAMG;AACH,MAAa,2BAA4B,SAAQ,+BAAc;IAS7D,4FAA4F;IAC5F,YAAoB,IAAgB,EAAE,SAAyB;QAC7D,KAAK,EAAE,CAAC;QAVV,wCAAwC;QACxB,uBAAkB,GAAG,6BAA6B,CAAC;QAUjE,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;QAC5B,IAAI,CAAC,YAAY,GAAG,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC;IAChG,CAAC;IARD,uDAAuD;IAChD,mBAAmB,CAAC,KAAoB,IAAa,OAAO,KAAK,YAAY,2BAA2B,CAAC,CAAC,CAAC;IAQlH;;;OAGG;IACI,gBAAgB,CAAC,SAAoB;QAC1C,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QAC7B,IAAI,CAAC,YAAY,4BAAU,IAAI,CAAC,CAAC,mBAAmB,CAAC,SAAS,CAAC;YAC7D,OAAO,2BAA2B,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;QACtD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;OAEG;IACH,IAAW,IAAI,KAAiB,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;IAEpD,0BAA0B;IACnB,KAAK;QACV,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,EAAgB,CAAC;QAC3C,OAAO,2BAA2B,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;IACtD,CAAC;IAED,0BAA0B;IACV,iBAAiB,CAAC,SAAiB,EAAE,SAAiB;QACpE,IAAI,SAAS,KAAK,SAAS;YACzB,OAAO,SAAS,CAAC;QACnB,IAAI,KAAK,GAAG,SAAS,CAAC;QACtB,IAAI,KAAK,GAAG,SAAS,CAAC;QACtB,MAAM,QAAQ,GAAG,SAAS,GAAG,SAAS,CAAC;QACvC,IAAI,QAAQ,EAAC;YACX,KAAK,GAAG,SAAS,CAAC;YAClB,KAAK,GAAG,SAAS,CAAC;SACnB;QACD,MAAM,cAAc,GAAG,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC;QACjD,MAAM,cAAc,GAAG,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC;QACjD,MAAM,SAAS,GAAG,IAAI,CAAC,uBAAuB,CAAC,cAAc,EAAE,IAAI,CAAC,CAAC;QACrE,IAAI,SAAS,KAAK,SAAS;YACzB,OAAO,SAAS,CAAC;QACnB,MAAM,SAAS,GAAG,IAAI,CAAC,uBAAuB,CAAC,cAAc,EAAE,IAAI,CAAC,CAAC;QACrE,IAAI,SAAS,KAAK,SAAS;YACzB,OAAO,SAAS,CAAC;QACnB,MAAM,gBAAgB,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,SAAS,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;QAC3E,IAAI,SAAS,KAAK,gBAAgB;YAChC,OAAO,SAAS,CAAC;QACnB,MAAM,gBAAgB,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,SAAS,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;QAC3E,IAAI,SAAS,KAAK,gBAAgB;YAChC,OAAO,SAAS,CAAC;QACnB,MAAM,cAAc,GAAG,SAAS,CAAC,oCAAoC,CAAC,cAAc,EAAE,IAAI,CAAC,CAAC;QAC5F,MAAM,cAAc,GAAG,SAAS,CAAC,oCAAoC,CAAC,cAAc,EAAE,IAAI,CAAC,CAAC;QAE5F,qDAAqD;QACrD,MAAM,OAAO,GAAG,WAAI,CAAC,MAAM,EAAG,CAAC;QAC/B,MAAM,eAAe,GAAG,CAAC,UAA0B,EAAE,cAAsB,EAAE,cAAsB,EAAE,aAAsB,EAAW,EAAE;YACtI,IAAI,cAAc,KAAK,cAAc;gBACnC,OAAO,KAAK,CAAC;YACf,IAAI,QAAQ,CAAC;YACb,IAAI,cAAc,KAAK,GAAG,IAAI,cAAc,KAAK,GAAG,EAAG;gBACrD,QAAQ,GAAG,UAAU,CAAC,KAAK,EAAG,CAAC;gBAC/B,IAAI,aAAa;oBACf,QAAQ,CAAC,cAAc,EAAG,CAAC;aAC9B;iBAAM;gBACL,QAAQ,GAAG,aAAa,CAAA,CAAC;oBACX,UAAU,CAAC,iBAAiB,CAAE,cAAc,EAAE,cAAc,CAAC;oBAC/D,CAAC,CAAC,UAAU,CAAC,iBAAiB,CAAE,cAAc,EAAE,cAAc,CAAC,CAAC;aAC7E;YACD,IAAI,QAAQ,EAAE;gBACZ,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBAChC,OAAO,IAAI,CAAC;aACb;YACD,OAAO,KAAK,CAAC;QACf,CAAC,CAAC;QAEF,IAAI,SAAS,CAAC,UAAU,KAAK,SAAS,CAAC,UAAU,EAAC;YAChD,+CAA+C;YAC/C,IAAI,eAAe,CAAE,SAAS,CAAC,UAAU,EAAE,cAAc,EAAE,cAAc,EAAE,QAAQ,CAAC;gBAClF,OAAO,2BAA2B,CAAC,aAAa,CAAE,OAAO,CAAC,CAAC,CAAG,wDAAwD;YACxH,OAAO,SAAS,CAAC;SAClB;QACD,eAAe,CAAE,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,gBAAgB,CAAC,EAAE,cAAc,EAAE,GAAG,EAAE,QAAQ,CAAC,CAAC;QACvF,mDAAmD;QACnD,KAAK,IAAI,UAAU,GAAG,gBAAgB,GAAG,CAAC,EAAE,UAAU,GAAG,gBAAgB,EAAE,UAAU,EAAE,EAAC;YACtF,eAAe,CAAE,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,UAAU,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,QAAQ,CAAC,CAAC;SACvE;QACD,eAAe,CAAE,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,gBAAgB,CAAC,EAAE,GAAG,EAAE,cAAc,EAAE,QAAQ,CAAC,CAAC;QACzF,wEAAwE;QACtE,IAAI,QAAQ;YACV,OAAO,CAAC,QAAQ,CAAC,OAAO,EAAG,CAAC;QAC9B,OAAO,2BAA2B,CAAC,aAAa,CAAE,OAAO,CAAC,CAAC;IAC7D,CAAC;IAED;;OAEG;IACI,SAAS,CAAC,KAAmC;QAClD,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE;YACnC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC;gBACrB,OAAO,KAAK,CAAC;SAChB;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,yGAAyG;IACzF,UAAU,CAAC,MAAgB;QACzC,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC;QAC7C,IAAI,CAAC;YACH,OAAO,CAAC,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;QAC9B,OAAO,yBAAO,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;IACpC,CAAC;IACD,qGAAqG;IACrF,QAAQ,CAAC,MAAgB;QACvC,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9C,IAAI,CAAC;YACH,OAAO,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QAC5B,OAAO,yBAAO,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;IACpC,CAAC;IACD,gDAAgD;IACzC,WAAW,CAAC,IAAkB,EAAE,OAAuB;QAC5D,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE;YACnC,CAAC,CAAC,WAAW,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;SAC9B;IACH,CAAC;IACD;;OAEG;IACI,kBAAkB,CAAC,IAAoB,EAAE,OAAuB;QACrE,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE;YACnC,CAAC,CAAC,kBAAkB,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;SACrC;IACH,CAAC;IACD;;;OAGG;IACI,4BAA4B,CAAC,OAAuB;QACzD,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE;YACnC,SAAS,IAAI,CAAC,CAAC,4BAA4B,CAAC,OAAO,CAAC,CAAC;SACtD;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;OAMG;IACa,wBAAwB,CAAC,cAAgC,EAAE,6BAAsC,KAAK,EAAE,qBAA8B,KAAK;QACzJ,IAAI,0BAA0B,EAAE;YAC9B,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE;gBACnC,CAAC,CAAC,wBAAwB,CAAC,cAAc,EAAE,0BAA0B,EAAE,kBAAkB,CAAC,CAAC;aAC5F;SACF;aAAM;YACL,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;SAC3B;IACH,CAAC;IAED;;;;OAIG;IACa,qCAAqC,CAAC,OAAuB,EAAE,eAAgC;QAC7G,MAAM,KAAK,GAAG,+BAAc,CAAC,yCAAyC,CAAC,IAAI,EAAE,eAAe,CAAC,CAAC;QAC9F,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE;YACnC,CAAC,CAAC,qCAAqC,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;SACzD;QACD,+BAAc,CAAC,qBAAqB,CAAC,IAAI,EAAE,KAAK,EAAE,eAAe,CAAC,CAAC;IACrE,CAAC;IACD;;OAEG;IACI,yBAAyB,CAAC,OAAwB;QACvD,OAAO,IAAI,CAAC,KAAK,CAAC,yBAAyB,CAAC,OAAO,CAAC,CAAC;IACvD,CAAC;IACD;OACG;IACI,WAAW,CAAC,aAAsB,EAAE,SAAqB;QAC9D,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,aAAa,EAAE,SAAS,CAAC,CAAC;IACnD,CAAC;IACD;;;;;OAKG;IACa,2BAA2B,CAAC,SAAiB,EAAE,SAAiB;QAC9E,OAAO,IAAI,CAAC,GAAG,CAAC,SAAS,GAAG,SAAS,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC;IAC7D,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,aAAa,CAAC,IAAgB,EAAE,OAAuB;QACnE,MAAM,SAAS,GAAG,gCAAgC,CAAC,uBAAuB,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QAC1F,MAAM,MAAM,GAAG,IAAI,2BAA2B,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;QAChE,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;OAIG;IACO,uBAAuB,CAAC,QAAgB,EAAE,qBAA8B,KAAK;QACrF,MAAM,YAAY,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC;QAC5C,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC;QAClC,IAAI,YAAY,GAAG,CAAC,EAAE;YACpB,IAAI,QAAQ,GAAG,GAAG;gBAChB,OAAO,kBAAkB,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;YACvD,IAAI,QAAQ,IAAI,IAAI,CAAC,YAAY;gBAC/B,OAAO,kBAAkB,CAAC,CAAC,CAAC,SAAS,CAAC,YAAY,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;YACtE,wBAAwB;YACxB,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE;gBAChC,IAAI,QAAQ,CAAC,qBAAqB,CAAC,QAAQ,CAAC;oBAAE,OAAO,QAAQ,CAAC;aAC/D;SACF;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;OAIG;IACQ,4BAA4B,CAAC,QAAgB,EAAE,qBAA8B,KAAK;QAC3F,MAAM,YAAY,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC;QAC5C,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC;QAClC,IAAI,YAAY,GAAG,CAAC,EAAE;YACpB,IAAI,QAAQ,GAAG,GAAG;gBAChB,OAAO,kBAAkB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;YAC5C,IAAI,QAAQ,GAAG,IAAI,CAAC,YAAY;gBAC9B,OAAO,kBAAkB,CAAC,CAAC,CAAC,CAAC,YAAY,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;YAC7D,wBAAwB;YACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,EAAE,CAAC,EAAE,EAAE;gBACrC,IAAI,SAAS,CAAC,CAAC,CAAC,CAAC,qBAAqB,CAAC,QAAQ,CAAC;oBAAE,OAAO,CAAC,CAAC;aAC5D;SACF;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;OAGG;IACI,4BAA4B,CAAC,QAAgB,IAAY,OAAO,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC;IACtG;;;;OAIG;IACO,+BAA+B,CAAC,KAAqB,EAAE,QAAgB;QAC/E,MAAM,YAAY,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC;QAC5C,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC;QAClC,IAAI,YAAY,GAAG,CAAC,EAAE;YACpB,wBAAwB;YACxB,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE;gBAChC,IAAI,QAAQ,CAAC,kCAAkC,CAAC,KAAK,EAAE,QAAQ,CAAC;oBAC9D,OAAO,QAAQ,CAAC;aACnB;YACD,IAAI,QAAQ,IAAI,CAAC;gBACf,OAAO,SAAS,CAAC,CAAC,CAAC,CAAC;YACtB,IAAI,QAAQ,GAAG,GAAG;gBAChB,OAAO,SAAS,CAAC,YAAY,GAAG,CAAC,CAAC,CAAC;SACtC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;OAEG;IACa,WAAW;QACzB,OAAO,IAAI,CAAC,YAAY,CAAC;IAC3B,CAAC;IACD;;;OAGG;IACI,WAAW;QAChB,OAAO,IAAI,CAAC,YAAY,CAAC;IAC3B,CAAC;IAED;;;;OAIG;IACI,eAAe,CAAC,QAAgB,EAAE,MAAgB;QACvD,MAAM,aAAa,GAAG,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC;QACnD,MAAM,QAAQ,GAAG,IAAI,CAAC,uBAAuB,CAAC,aAAa,EAAE,IAAI,CAAC,CAAC;QACnE,IAAI,QAAQ,EAAE;YACZ,MAAM,aAAa,GAAG,QAAQ,CAAC,oCAAoC,CAAC,aAAa,EAAE,IAAI,CAAC,CAAC;YACzF,OAAO,QAAQ,CAAC,UAAU,CAAC,eAAe,CAAC,aAAa,EAAE,MAAM,CAAC,CAAC;SACnE;QACD,wCAAwC;QACxC,mEAAmE;QACnE,OAAO,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,eAAe,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;IACpE,CAAC;IAED;;;;;;;OAOG;IACI,4BAA4B,CAAC,QAAgB,EAAE,MAAc;QAClE,MAAM,iBAAiB,GAAG,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC;QACvD,MAAM,QAAQ,GAAG,IAAI,CAAC,uBAAuB,CAAC,iBAAiB,EAAE,IAAI,CAAE,CAAC;QACxE,MAAM,aAAa,GAAG,QAAQ,CAAC,oCAAoC,CAAC,iBAAiB,EAAE,IAAI,CAAC,CAAC;QAC7F,MAAM,GAAG,QAAQ,CAAC,UAAU,CAAC,4BAA4B,CAAC,aAAa,EAAE,MAAM,CAAC,CAAC;QACjF,MAAM,CAAC,GAAG,IAAI,CAAC,YAAY,GAAG,MAAM,CAAC,SAAS,CAAC,SAAS,EAAE,CAAC;QAC3D,MAAM,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QACjC,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;OAKG;IACa,6BAA6B,CAAC,QAAgB,EAAE,MAAc;QAC5E,MAAM,iBAAiB,GAAG,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC;QACvD,MAAM,QAAQ,GAAG,IAAI,CAAC,uBAAuB,CAAC,iBAAiB,EAAE,IAAI,CAAE,CAAC;QACxE,MAAM,aAAa,GAAG,QAAQ,CAAC,oCAAoC,CAAC,iBAAiB,EAAE,IAAI,CAAC,CAAC;QAC7F,MAAM,GAAG,QAAQ,CAAC,UAAU,CAAC,4BAA4B,CAAC,aAAa,EAAE,MAAM,CAAC,CAAC;QACjF,MAAM,CAAC,SAAS,CAAC,gBAAgB,EAAE,CAAC;QACpC,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;OAKG;IACI,8BAA8B,CAAC,QAAgB,EAAE,MAAkC;QACxF,MAAM,WAAW,GAAG,IAAI,CAAC,YAAY,CAAC;QACtC,MAAM,iBAAiB,GAAG,QAAQ,GAAG,WAAW,CAAC;QACjD,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,MAAM,KAAK,GAAG,MAAM,CAAC,OAAO,CAAC,gBAAgB,EAAE,CAAC;QAChD,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC9B,MAAM,KAAK,GAAG,MAAM,CAAC,OAAO,CAAC,UAAU,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QACxD,MAAM,IAAI,GAAG,GAAG,GAAG,IAAI,CAAC;QACxB,MAAM,CAAC,GAAG,IAAI,GAAG,IAAI,CAAC;QACtB,0BAAQ,CAAC,gBAAgB,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC,EAAE,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,GAAG,KAAK,GAAG,KAAK,EAAE,MAAM,CAAC,OAAO,CAAC,CAAC,CAAG,8BAA8B;QAClI,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAC3B,uCAAuC;QACvC,MAAM,CAAC,OAAO,CAAC,YAAY,CAAC,WAAW,CAAC,CAAC;QACzC,MAAM,CAAC,OAAO,CAAC,YAAY,CAAC,WAAW,GAAG,WAAW,CAAC,CAAC;QACvD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;OAEG;IACI,mBAAmB,CAAC,SAAoB;QAC7C,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE;YACnC,IAAI,CAAC,CAAC,CAAC,mBAAmB,CAAC,SAAS,CAAC;gBACnC,OAAO,EAAE,CAAC;SACb;QACD,OAAO,OAAO,KAAK,CAAC,CAAC;IACvB,CAAC;IACD,gGAAgG;IACzF,cAAc;QACnB,IAAI,CAAC,KAAK,CAAC,sBAAsB,EAAE,CAAC;QACpC,MAAM,WAAW,GAAG,IAAI,CAAC,YAAY,CAAC;QACtC,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,UAAU;YACpC,QAAQ,CAAC,4BAA4B,CAAC,WAAW,CAAC,CAAC;QACrD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE;YAC/D,MAAM,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YACpC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YACxC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC;SAC/B;IACH,CAAC;IACD;;;;;OAKG;IACa,aAAa,CAAC,KAAoB;QAChD,IAAI,KAAK,YAAY,2BAA2B,EAAE;YAChD,OAAO,mBAAQ,CAAC,gBAAgB,CAAC,IAAI,CAAC,YAAY,EAAE,KAAK,CAAC,YAAY,CAAC;mBAClE,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;SAC5C;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;OAGG;IACa,8BAA8B,CAAC,aAAqB,EAAE,cAAsB,EAAE,cAAuB,EAAE,MAA4B;QACjJ,MAAM,SAAS,GAAG,aAAa,GAAG,IAAI,CAAC,YAAY,CAAC;QACpD,MAAM,SAAS,GAAG,SAAS,GAAG,cAAc,CAAC;QAC7C,MAAM,SAAS,GAAG,IAAI,CAAC,uBAAuB,CAAC,SAAS,EAAE,IAAI,CAAE,CAAC;QACjE,MAAM,WAAW,GAAG,SAAS,CAAC,UAAU,CAAC,8BAA8B,CAAC,SAAS,CAAC,cAAc,EAAE,SAAS,GAAG,SAAS,CAAC,cAAc,EAAE,cAAc,EAAE,MAAM,CAAC,CAAC;QAChK,MAAM,WAAW,GAAG,aAAa,GAAG,CAAC,cAAc,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC;QACzE,MAAM,WAAW,GAAG,yCAAmB,CAAC,mCAAmC,CAAC,cAAc,EAAE,IAAI,EAAE,aAAa,EAAE,WAAW,EAAE,cAAc,EAAE,MAAM,CAAC,CAAC;QACtJ,WAAW,CAAC,WAAW,GAAG,WAAW,CAAC;QACtC,OAAO,WAAW,CAAC;IACrB,CAAC;IAEH;;;;;;;;;OASG;IACM,MAAM,CAAC,yBAAyB,CAAC,QAAiB,IAAI;QAE3D,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;SAAC,CAAC;QAEpC,IAAI,KAAK,EAAC;YACR,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,aAAa,GAAG,CAAC,CAAC;SAC9D;QACD,OAAO,CAAC,CAAC;IACX,CAAC;IAKD;;;;;;;OAOG;IACa,YAAY,CAAC,UAAmB,EAAE,MAAmC;QACnF,IAAI,WAA4C,CAAC;QACjD,IAAI,IAAI,GAAG,MAAM,CAAC,SAAS,CAAC;QAC5B,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;QAC9C,IAAI,WAAW,KAAK,CAAC,EAAE;YACrB,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,UAAU,EAAE,MAAM,CAAC,CAAC;SACtE;aAAM;YACL,MAAM,eAAe,GAAG,YAAY,CAAC,8BAA8B,CAAE,IAAI,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC;YAClG,MAAM,OAAO,GAAG,CAAC,oCAAkB,CAAC,mDAAmD,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,iCAAe,CAAC,IAAI,CAAC,CAAC;YAC1H,MAAM,OAAO,GAAG,CAAC,iCAAe,CAAC,IAAI,EAAE,oCAAkB,CAAC,mDAAmD,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC;YAC1H,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YACrC,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAC9D,2BAA2B,CAAC,SAAS,EAAE,CAAC;YACxC,2BAA2B,CAAC,aAAa,IAAG,eAAe,CAAC,MAAM,CAAC;YACnE,KAAK,MAAM,CAAC,IAAI,eAAe,EAAE;gBAC/B,IAAI,CAAC,CAAC,CAAC,GAAE,IAAI;oBACX,MAAM;gBACR,2BAA2B,CAAC,UAAU,EAAE,CAAC;gBACzC,MAAM,KAAK,GAAG,CAAC,CAAC,UAAU,CAAC;gBAC3B,MAAM,OAAO,GAAG,KAAK,CAAC,YAAY,CAAC,UAAU,EAC3C,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;gBACjE,IAAI,OAAO,IAAI,OAAO,CAAC,CAAC,GAAG,IAAI,EAAE;oBAC/B,IAAI,GAAG,OAAO,CAAC,CAAC,CAAC;oBACjB,WAAW,GAAG,yCAAmB,CAAC,wBAAwB,CAAC,OAAO,CAAC,KAAK,EAAE,OAAO,CAAC,QAAQ,EAAE,OAAO,CAAC,KAAK,EAAE,WAAW,CAAE,CAAC;oBACzH,WAAW,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC;oBAC1B,2BAA2B,CAAC,YAAY,EAAE,CAAC;iBAC5C;aACF;SAEF;QACD,IAAI,CAAC,WAAW;YACd,OAAO,SAAS,CAAC;QACnB,MAAM,QAAQ,GAAG,IAAI,CAAC,+BAA+B,CAAC,WAAW,CAAC,KAAM,EAAE,WAAW,CAAC,QAAQ,CAAC,CAAC;QAChG,IAAI,QAAQ,EAAE;YACZ,MAAM,aAAa,GAAG,QAAQ,CAAC,4BAA4B,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;YAClF,MAAM,aAAa,GAAG,IAAI,CAAC,4BAA4B,CAAC,aAAa,CAAC,CAAC;YACvE,MAAM,WAAW,GAAG,yCAAmB,CAAC,wBAAwB,CAAC,IAAI,EAAE,aAAa,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC;YACzG,WAAW,CAAC,WAAW,GAAG,WAAW,CAAC;YACtC,WAAW,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC;YAC9B,OAAO,WAAW,CAAC;SACpB;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;;OAIG;IACa,iBAAiB,CAAC,uBAA+C;QAC/E,MAAM,OAAO,GAAG,oCAAa,CAAC,MAAM,CAAC,uBAAuB,CAAC,CAAC;QAC9D,MAAM,OAAO,GAAqB,EAAE,CAAC;QACrC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,sBAAsB,CAAC,SAAS,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE;YACrE,MAAM,MAAM,GAAG,IAAI,CAAC,iBAAiB,CAAC,OAAO,CAAC,CAAC;YAC/C,IAAI,MAAM,KAAK,SAAS,EAAE;gBACxB,IAAI,MAAM,YAAY,+BAAc;oBAClC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;qBAClB,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC;oBAC5B,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;aAC5C;SACF;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;;;OAIG;IACa,uBAAuB,CAAC,GAAqB,EAAE,OAAiB;QAC9E,OAAO,qDAAyB,CAAC,kCAAkC,CAAC,IAAI,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;IAC1F,CAAC;;AAjhBH,kEAkhBC;AApFgB,qCAAS,GAAG,CAAC,CAAC;AACd,sCAAU,GAAG,CAAC,CAAC;AACf,wCAAY,GAAG,CAAC,CAAC;AACjB,yCAAa,GAAG,CAAC,CAAC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n\r\n/** @packageDocumentation\r\n * @module Curve\r\n */\r\n\r\nimport { CurvePrimitive } from \"../curve/CurvePrimitive\";\r\nimport { StrokeCountMap } from \"../curve/Query/StrokeCountMap\";\r\nimport { Geometry } from \"../Geometry\";\r\nimport { GeometryHandler, IStrokeHandler } from \"../geometry3d/GeometryHandler\";\r\nimport { Plane3dByOriginAndUnitNormal } from \"../geometry3d/Plane3dByOriginAndUnitNormal\";\r\nimport { Plane3dByOriginAndVectors } from \"../geometry3d/Plane3dByOriginAndVectors\";\r\nimport { Point3d, Vector3d } from \"../geometry3d/Point3dVector3d\";\r\nimport { Range1d, Range3d } from \"../geometry3d/Range\";\r\nimport { Ray3d } from \"../geometry3d/Ray3d\";\r\nimport { Transform } from \"../geometry3d/Transform\";\r\nimport { CurveChain } from \"./CurveCollection\";\r\nimport { CurveExtendMode, CurveExtendOptions, VariantCurveExtendParameter } from \"./CurveExtendMode\";\r\nimport { CurveLocationDetail } from \"./CurveLocationDetail\";\r\nimport { GeometryQuery } from \"./GeometryQuery\";\r\nimport { PlaneAltitudeRangeContext } from \"./internalContexts/PlaneAltitudeRangeContext\";\r\nimport { OffsetOptions } from \"./internalContexts/PolygonOffsetContext\";\r\nimport { LineString3d } from \"./LineString3d\";\r\nimport { Path } from \"./Path\";\r\nimport { StrokeOptions } from \"./StrokeOptions\";\r\n\r\n/**\r\n * * Annotation of an interval of a curve.\r\n * * The interval is marked with two pairs of numbers:\r\n * * * fraction0, fraction1 = fraction parameters along the child curve\r\n * * * distance0,distance1 = distances within containing CurveChainWithDistanceIndex\r\n * @public\r\n */\r\nexport class PathFragment {\r\n /** distance along parent to this fragment start */\r\n public chainDistance0: number;\r\n /** distance along parent to this fragment end */\r\n public chainDistance1: number;\r\n /** Fractional position of this fragment start within its curve primitive. */\r\n public childFraction0: number;\r\n /** Fractional position of this fragment end within its curve primitive.. */\r\n public childFraction1: number;\r\n /** Curve primitive of this fragment, as presented in stroker. Note that this might have become a proxy. */\r\n public childCurve: CurvePrimitive;\r\n /** optional range */\r\n public range?: Range3d;\r\n /** working var for use in searches. */\r\n public a: number;\r\n /** Create a fragment with complete fraction, distance and child data. */\r\n public constructor(childFraction0: number, childFraction1: number, distance0: number, distance1: number, childCurve: CurvePrimitive,\r\n range?: Range3d) {\r\n this.childFraction0 = childFraction0;\r\n this.childFraction1 = childFraction1;\r\n this.chainDistance0 = distance0;\r\n this.chainDistance1 = distance1;\r\n this.childCurve = childCurve;\r\n this.range = range;\r\n this.a = 0;\r\n }\r\n /**\r\n * Return true if the distance is within the distance limits of this fragment.\r\n * @param distance\r\n */\r\n public containsChainDistance(distance: number): boolean {\r\n return distance >= this.chainDistance0 && distance <= this.chainDistance1;\r\n }\r\n// Return a quick distance to the curve. This may be SMALLER than true distance but may\r\n// not be larger.\r\n public quickMinDistanceToChildCurve(spacePoint: Point3d): number {\r\n if (this.range){\r\n return this.range.distanceToPoint (spacePoint);\r\n }\r\n // ugh. have to do real computation ..\r\n const detail = this.childCurve.closestPoint (spacePoint, false);\r\n if (detail)\r\n return detail.a;\r\n return 0;\r\n }\r\n // Return an array with (references to) all the path fragments, sorted smallest to largest on\r\n // the \"a\" value equal to the quick min distance to the fragment\r\n public static collectSortedQuickMinDistances(fragments: PathFragment[], spacePoint: Point3d): PathFragment[]{\r\n const sortedFragments: PathFragment [] = [];\r\n for (const f of fragments){\r\n f.a = f.quickMinDistanceToChildCurve (spacePoint);\r\n sortedFragments.push (f);\r\n }\r\n sortedFragments.sort ((a: PathFragment, b: PathFragment) => a.a- b.a);\r\n return sortedFragments;\r\n }\r\n /**\r\n * Return true if this fragment addresses `curve` and brackets `fraction`\r\n * @param distance\r\n */\r\n public containsChildCurveAndChildFraction(curve: CurvePrimitive, fraction: number): boolean {\r\n return this.childCurve === curve && fraction >= this.childFraction0 && fraction <= this.childFraction1;\r\n }\r\n\r\n /** Convert distance to local fraction, and apply that to interpolate between the stored curve fractions.\r\n * Note that proportional calculation does NOT account for nonuniform parameterization in the child curve.\r\n */\r\n public chainDistanceToInterpolatedChildFraction(distance: number): number {\r\n return Geometry.inverseInterpolate(\r\n this.childFraction0, this.chainDistance0,\r\n this.childFraction1, this.chainDistance1,\r\n distance, this.childFraction0)!; // the interval \"must\" have nonzero length, division should be safe . ..\r\n }\r\n /** Convert chainDistance to true chidFraction, using detailed moveSignedDistanceFromFraction\r\n */\r\n public chainDistanceToAccurateChildFraction(chainDistance: number, allowExtrapolation?: boolean): number {\r\n // The fragments are really expected to do good mappings in their distance range ...\r\n const childDetail = this.childCurve.moveSignedDistanceFromFraction(\r\n this.childFraction0, chainDistance - this.chainDistance0, allowExtrapolation ?? false);\r\n return childDetail.fraction;\r\n }\r\n /** 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 /** Reverse the fraction and distance data.\r\n * * each child fraction `f` is replaced by `1-f`\r\n * * each `chainDistance` is replaced by `totalDistance-chainDistance`\r\n */\r\n public reverseFractionsAndDistances(totalDistance: number) {\r\n const f0 = this.childFraction0;\r\n const f1 = this.childFraction1;\r\n const d0 = this.chainDistance0;\r\n const d1 = this.chainDistance1;\r\n this.childFraction0 = 1.0 - f1;\r\n this.childFraction1 = 1.0 - f0;\r\n this.chainDistance0 = totalDistance - d1;\r\n this.chainDistance1 = totalDistance - d0;\r\n }\r\n /** @deprecated Use childFractionToChainDistance */\r\n public childFractionTChainDistance(fraction: number): number {\r\n return this.childFractionToChainDistance(fraction);\r\n }\r\n /**\r\n * convert a fractional position on the childCurve to distance in the chain space.\r\n * * Return value is SIGNED -- will be negative when fraction < this.childFraction0.\r\n * @param fraction fraction along the curve within this fragment\r\n */\r\n public childFractionToChainDistance(fraction: number): number {\r\n let d = this.childCurve.curveLengthBetweenFractions(this.childFraction0, fraction);\r\n if (fraction < this.childFraction0)\r\n d = -d;\r\n return this.chainDistance0 + d;\r\n }\r\n}\r\n/** Non-instantiable class to build a distance index for a path. */\r\nclass DistanceIndexConstructionContext implements IStrokeHandler {\r\n private _fragments: PathFragment[];\r\n private _accumulatedDistance: number;\r\n private constructor() {\r\n this._accumulatedDistance = 0;\r\n this._fragments = [];\r\n }\r\n // ignore curve announcements -- they are repeated in stroke announcements\r\n public startParentCurvePrimitive(_cp: CurvePrimitive) { }\r\n public startCurvePrimitive(_cp: CurvePrimitive) { }\r\n public endParentCurvePrimitive(_cp: CurvePrimitive) { }\r\n public endCurvePrimitive(_cp: CurvePrimitive) { }\r\n // um .. we need to see curves? how to reject?\r\n public announcePointTangent(_xyz: Point3d, _fraction: number, _tangent: Vector3d) { }\r\n /** Announce numPoints interpolated between point0 and point1, with associated fractions */\r\n public announceSegmentInterval(\r\n cp: CurvePrimitive,\r\n point0: Point3d,\r\n point1: Point3d,\r\n numStrokes: number,\r\n fraction0: number,\r\n fraction1: number): 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,\r\n numStrokes: number,\r\n fraction0: number,\r\n fraction1: number): void {\r\n let f1, d, d0;\r\n for (let i = 1, f0 = fraction0; i <= numStrokes; i++, f0 = f1) {\r\n f1 = Geometry.interpolate(fraction0, i / numStrokes, fraction1);\r\n d = cp.curveLengthBetweenFractions(f0, f1);\r\n d0 = this._accumulatedDistance;\r\n this._accumulatedDistance += d;\r\n const range = cp.rangeBetweenFractions (f0, f1);\r\n this._fragments.push(new PathFragment(f0, f1, d0, this._accumulatedDistance, cp, range));\r\n }\r\n }\r\n public needPrimaryGeometryForStrokes?(): boolean { return true;}\r\n public static createPathFragmentIndex(path: CurveChain, options?: StrokeOptions): PathFragment[] {\r\n const handler = new DistanceIndexConstructionContext();\r\n for (const curve of path.children) {\r\n curve.emitStrokableParts(handler, options);\r\n }\r\n const fragments = handler._fragments;\r\n return fragments;\r\n }\r\n}\r\n/**\r\n * `CurveChainWithDistanceIndex` is a CurvePrimitive whose fractional parameterization is proportional to true\r\n * distance along a CurveChain.\r\n * * The curve chain can be any type derived from CurveChain.\r\n * * * i.e. either a `Path` or a `Loop`\r\n * @public\r\n */\r\nexport class CurveChainWithDistanceIndex extends CurvePrimitive {\r\n /** String name for schema properties */\r\n public readonly curvePrimitiveType = \"curveChainWithDistanceIndex\";\r\n\r\n private _path: CurveChain;\r\n private _fragments: PathFragment[];\r\n private _totalLength: number; // matches final fragment distance1.\r\n /** Test if other is a `CurveChainWithDistanceIndex` */\r\n public isSameGeometryClass(other: GeometryQuery): boolean { return other instanceof CurveChainWithDistanceIndex; }\r\n // final assembly of CurveChainWithDistanceIndex -- caller must create valid fragment index.\r\n private constructor(path: CurveChain, fragments: PathFragment[]) {\r\n super();\r\n this._path = path;\r\n this._fragments = fragments;\r\n this._totalLength = fragments.length > 0 ? fragments[fragments.length - 1].chainDistance1 : 0;\r\n }\r\n /**\r\n * Create a clone, transformed and with its own distance index.\r\n * @param transform transform to apply in the clone.\r\n */\r\n public cloneTransformed(transform: Transform): CurveChainWithDistanceIndex | undefined {\r\n const c = this._path.clone();\r\n if (c instanceof CurveChain && c.tryTransformInPlace(transform))\r\n return CurveChainWithDistanceIndex.createCapture(c);\r\n return undefined;\r\n }\r\n /** Reference to the contained path.\r\n * * Do not modify the path. The distance index will be wrong.\r\n */\r\n public get path(): CurveChain { return this._path; }\r\n\r\n /** Return a deep clone */\r\n public clone(): CurveChainWithDistanceIndex {\r\n const c = this._path.clone() as CurveChain;\r\n return CurveChainWithDistanceIndex.createCapture(c);\r\n }\r\n\r\n /** Return a deep clone */\r\n public override clonePartialCurve(fractionA: number, fractionB: number): CurveChainWithDistanceIndex | undefined {\r\n if (fractionA === fractionB)\r\n return undefined;\r\n let fracA = fractionA;\r\n let fracB = fractionB;\r\n const reversed = fractionA > fractionB;\r\n if (reversed){\r\n fracA = fractionB;\r\n fracB = fractionA;\r\n }\r\n const chainDistanceA = fracA * this._totalLength;\r\n const chainDistanceB = fracB * this._totalLength;\r\n const fragmentA = this.chainDistanceToFragment(chainDistanceA, true);\r\n if (undefined === fragmentA)\r\n return undefined;\r\n const fragmentB = this.chainDistanceToFragment(chainDistanceB, true);\r\n if (undefined === fragmentB)\r\n return undefined;\r\n const childCurveIndexA = this._path.childIndex(fragmentA.childCurve, true);\r\n if (undefined === childCurveIndexA)\r\n return undefined;\r\n const childCurveIndexB = this._path.childIndex(fragmentB.childCurve, true);\r\n if (undefined === childCurveIndexB)\r\n return undefined;\r\n const childFractionA = fragmentA.chainDistanceToAccurateChildFraction(chainDistanceA, true);\r\n const childFractionB = fragmentB.chainDistanceToAccurateChildFraction(chainDistanceB, true);\r\n\r\n // add a (possibly reversed) partial clone to newPath\r\n const newPath = Path.create ();\r\n const addPartialChild = (childCurve: CurvePrimitive, childFraction0: number, childFraction1: number, reversedClone: boolean): 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\r\n if (fragmentA.childCurve === fragmentB.childCurve){\r\n // the two distances are within the same curve.\r\n if (addPartialChild (fragmentA.childCurve, childFractionA, childFractionB, reversed))\r\n return CurveChainWithDistanceIndex.createCapture (newPath); // singleton -- children[] does not need to be reversed.\r\n return undefined;\r\n }\r\n addPartialChild (this._path.children[childCurveIndexA], childFractionA, 1.0, reversed);\r\n // at least two distinct children are impacted ....\r\n for (let childIndex = childCurveIndexA + 1; childIndex < childCurveIndexB; childIndex++){\r\n addPartialChild (this._path.children[childIndex], 0.0, 1.0, reversed);\r\n }\r\n addPartialChild (this._path.children[childCurveIndexB], 0.0, childFractionB, reversed);\r\n // This reverses array entries but not orientation within each curve ...\r\n if (reversed)\r\n newPath.children.reverse ();\r\n return CurveChainWithDistanceIndex.createCapture (newPath);\r\n }\r\n\r\n /** Ask if the curve is within tolerance of a plane.\r\n * @returns Returns true if the curve is completely within tolerance of the plane.\r\n */\r\n public isInPlane(plane: Plane3dByOriginAndUnitNormal): boolean {\r\n for (const c of this._path.children) {\r\n if (!c.isInPlane(plane))\r\n return false;\r\n }\r\n return true;\r\n }\r\n\r\n /** return the start point of the primitive. The default implementation returns fractionToPoint (0.0) */\r\n public override startPoint(result?: Point3d): Point3d {\r\n const c = this._path.cyclicCurvePrimitive(0);\r\n if (c)\r\n return c.startPoint(result);\r\n return Point3d.createZero(result);\r\n }\r\n /** Return the end point of the primitive. The default implementation returns fractionToPoint(1.0) */\r\n public override endPoint(result?: Point3d): Point3d {\r\n const c = this._path.cyclicCurvePrimitive(-1);\r\n if (c)\r\n return c.endPoint(result);\r\n return Point3d.createZero(result);\r\n }\r\n /** Add strokes to caller-supplied linestring */\r\n public emitStrokes(dest: LineString3d, options?: StrokeOptions): void {\r\n for (const c of this._path.children) {\r\n c.emitStrokes(dest, options);\r\n }\r\n }\r\n /** 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 * * This DEFAULT simply pushes `this` to the collectorArray.\r\n * * CurvePrimitiveWithDistanceIndex optionally collects its members.\r\n * @param collectorArray array to receive primitives (pushed -- the array is not cleared)\r\n * @param smallestPossiblePrimitives if false, CurvePrimitiveWithDistanceIndex returns only itself. If true, it recurses to its (otherwise hidden) children.\r\n */\r\n public override collectCurvePrimitivesGo(collectorArray: CurvePrimitive[], smallestPossiblePrimitives: boolean = false, explodeLineStrings: boolean = false) {\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 /**\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 /** Second step of double dispatch: call `this._path.dispatchToGeometryHandler (handler)`\r\n * * Note that this exposes the children individually to the handler.\r\n */\r\n public dispatchToGeometryHandler(handler: GeometryHandler): any {\r\n return this._path.dispatchToGeometryHandler(handler);\r\n }\r\n /** Extend (increase) `rangeToExtend` as needed to include these curves (optionally transformed)\r\n */\r\n public extendRange(rangeToExtend: Range3d, transform?: Transform): void {\r\n this._path.extendRange(rangeToExtend, transform);\r\n }\r\n /**\r\n *\r\n * * Curve length is always positive.\r\n * @returns Returns a (high accuracy) length of the curve between fractional positions\r\n * @returns Returns the length of the curve.\r\n */\r\n public override curveLengthBetweenFractions(fraction0: number, fraction1: number): number {\r\n return Math.abs(fraction1 - fraction0) * this._totalLength;\r\n }\r\n /**\r\n * Capture (not clone) a path into a new `CurveChainWithDistanceIndex`\r\n * @param path primitive array to be CAPTURED (not cloned)\r\n */\r\n public static createCapture(path: CurveChain, options?: StrokeOptions): CurveChainWithDistanceIndex {\r\n const fragments = DistanceIndexConstructionContext.createPathFragmentIndex(path, options);\r\n const result = new CurveChainWithDistanceIndex(path, fragments);\r\n return result;\r\n }\r\n\r\n /**\r\n * Resolve a fraction of the CurveChain to a PathFragment\r\n * @param distance\r\n * @param allowExtrapolation\r\n */\r\n protected chainDistanceToFragment(distance: number, allowExtrapolation: boolean = false): PathFragment | 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 ? fragments[0] : undefined;\r\n if (distance >= this._totalLength)\r\n return allowExtrapolation ? fragments[numFragments - 1] : undefined;\r\n // humbug, linear search\r\n for (const fragment of fragments) {\r\n if (fragment.containsChainDistance(distance)) return fragment;\r\n }\r\n }\r\n return undefined;\r\n }\r\n /**\r\n * Resolve a fraction of the CurveChain to a PathFragment index\r\n * @param distance\r\n * @param allowExtrapolation\r\n */\r\n protected chainDistanceToFragmentIndex(distance: number, allowExtrapolation: boolean = false): number | undefined {\r\n const numFragments = this._fragments.length;\r\n const fragments = this._fragments;\r\n if (numFragments > 0) {\r\n if (distance < 0.0)\r\n return allowExtrapolation ? 0 : undefined;\r\n if (distance > this._totalLength)\r\n return allowExtrapolation ? (numFragments - 1) : undefined;\r\n // humbug, linear search\r\n for (let i = 0; i < numFragments; i++) {\r\n if (fragments[i].containsChainDistance(distance)) return i;\r\n }\r\n }\r\n return undefined;\r\n }\r\n\r\n /**\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 { return distance / this._totalLength; }\r\n /**\r\n * Resolve a fraction within a specific curve to a fragment.\r\n * @param curve\r\n * @param fraction\r\n */\r\n protected curveAndChildFractionToFragment(curve: CurvePrimitive, fraction: number): PathFragment | undefined {\r\n const numFragments = this._fragments.length;\r\n const fragments = this._fragments;\r\n if (numFragments > 0) {\r\n // humbug, linear search\r\n for (const fragment of fragments) {\r\n if (fragment.containsChildCurveAndChildFraction(curve, fraction))\r\n return fragment;\r\n }\r\n if (fraction <= 0)\r\n return fragments[0];\r\n if (fraction > 1.0)\r\n return fragments[numFragments - 1];\r\n }\r\n return undefined;\r\n }\r\n\r\n /**\r\n * Returns the total length of curves.\r\n */\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 /**\r\n * Return the point (x,y,z) on the curve at fractional position along the chain.\r\n * @param fraction fractional position along the geometry.\r\n * @returns Returns a point on the curve.\r\n */\r\n public fractionToPoint(fraction: number, result?: Point3d): Point3d {\r\n const chainDistance = fraction * this._totalLength;\r\n const fragment = this.chainDistanceToFragment(chainDistance, true);\r\n if (fragment) {\r\n const childFraction = fragment.chainDistanceToAccurateChildFraction(chainDistance, true);\r\n return fragment.childCurve.fractionToPoint(childFraction, result);\r\n }\r\n // no fragment found. Use _fragments[0]\r\n // fragment = this.chainDistanceToFragment(chainDistance, true);\r\n return this._fragments[0].childCurve.fractionToPoint(0.0, result);\r\n }\r\n\r\n /** Return the point (x,y,z) and derivative on the curve at fractional position.\r\n *\r\n * * Note that this derivative is \"derivative of xyz with respect to fraction.\"\r\n * * this derivative shows the speed of the \"fractional point\" moving along the curve.\r\n * * this is not generally a unit vector. use fractionToPointAndUnitTangent for a unit vector.\r\n * @param fraction fractional position along the geometry.\r\n * @returns Returns a ray whose origin is the curve point and direction is the derivative with respect to the fraction.\r\n */\r\n public fractionToPointAndDerivative(fraction: number, result?: Ray3d): Ray3d {\r\n const distanceAlongPath = fraction * this._totalLength;\r\n const fragment = this.chainDistanceToFragment(distanceAlongPath, true)!;\r\n const curveFraction = fragment.chainDistanceToAccurateChildFraction(distanceAlongPath, true);\r\n result = fragment.childCurve.fractionToPointAndDerivative(curveFraction, result);\r\n const a = this._totalLength / result.direction.magnitude();\r\n result.direction.scaleInPlace(a);\r\n return result;\r\n }\r\n\r\n /**\r\n * Returns a ray whose origin is the curve point and direction is the unit tangent.\r\n * @param fraction fractional position on the curve\r\n * @param result optional receiver for the result.\r\n * Returns a ray whose origin is the curve point and direction is the unit tangent.\r\n */\r\n public override fractionToPointAndUnitTangent(fraction: number, result?: Ray3d): Ray3d {\r\n const distanceAlongPath = fraction * this._totalLength;\r\n const fragment = this.chainDistanceToFragment(distanceAlongPath, true)!;\r\n const curveFraction = fragment.chainDistanceToAccurateChildFraction(distanceAlongPath, true);\r\n result = fragment.childCurve.fractionToPointAndDerivative(curveFraction, result);\r\n result.direction.normalizeInPlace();\r\n return result;\r\n }\r\n /** Return a plane with\r\n *\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 the fraction.\r\n * * vectorV is the second derivative, i.e.derivative of vectorU.\r\n */\r\n public fractionToPointAnd2Derivatives(fraction: number, result?: Plane3dByOriginAndVectors): Plane3dByOriginAndVectors | undefined {\r\n const totalLength = this._totalLength;\r\n const distanceAlongPath = fraction * totalLength;\r\n const fragment = this.chainDistanceToFragment(distanceAlongPath, true)!;\r\n const curveFraction = fragment.chainDistanceToAccurateChildFraction(distanceAlongPath, true);\r\n result = fragment.childCurve.fractionToPointAnd2Derivatives(curveFraction, result);\r\n if (!result)\r\n return undefined;\r\n const dotUU = result.vectorU.magnitudeSquared();\r\n const magU = Math.sqrt(dotUU);\r\n const dotUV = result.vectorU.dotProduct(result.vectorV);\r\n const duds = 1.0 / magU;\r\n const a = duds * duds;\r\n Vector3d.createAdd2Scaled(result.vectorV, a, result.vectorU, -a * dotUV / dotUU, result.vectorV); // IN PLACE update to vectorV.\r\n result.vectorU.scale(duds);\r\n // scale for 0..1 parameterization ....\r\n result.vectorU.scaleInPlace(totalLength);\r\n result.vectorV.scaleInPlace(totalLength * totalLength);\r\n return result;\r\n }\r\n /** Attempt to transform in place.\r\n * * Warning: If any child fails, this object becomes invalid. But that should never happen.\r\n */\r\n public tryTransformInPlace(transform: Transform): boolean {\r\n let numFail = 0;\r\n for (const c of this._path.children) {\r\n if (!c.tryTransformInPlace(transform))\r\n numFail++;\r\n }\r\n return numFail === 0;\r\n }\r\n /** Reverse the curve's data so that its fractional stroking moves in the opposite direction. */\r\n public reverseInPlace(): void {\r\n this._path.reverseChildrenInPlace();\r\n const totalLength = this._totalLength;\r\n for (const fragment of this._fragments)\r\n fragment.reverseFractionsAndDistances(totalLength);\r\n for (let i = 0, j = this._fragments.length - 1; i < j; i++, j--) {\r\n const fragment = this._fragments[i];\r\n this._fragments[i] = this._fragments[j];\r\n this._fragments[j] = fragment;\r\n }\r\n }\r\n /**\r\n * Test for equality conditions:\r\n * * Mismatched totalLength is a quick exit condition\r\n * * If totalLength matches, recurse to the path for matching primitives.\r\n * @param other\r\n */\r\n public override isAlmostEqual(other: GeometryQuery): boolean {\r\n if (other instanceof CurveChainWithDistanceIndex) {\r\n return Geometry.isSameCoordinate(this._totalLength, other._totalLength)\r\n && this._path.isAlmostEqual(other._path);\r\n }\r\n return false;\r\n }\r\n\r\n /** Implement moveSignedDistanceFromFraction.\r\n * * See `CurvePrimitive` for parameter details.\r\n * * The returned location directly identifies fractional position along the CurveChainWithDistanceIndex, and has pointer to an additional detail for the child curve.\r\n */\r\n public override moveSignedDistanceFromFraction(startFraction: number, signedDistance: number, allowExtension: boolean, result?: CurveLocationDetail): CurveLocationDetail {\r\n const distanceA = startFraction * this._totalLength;\r\n const distanceB = distanceA + signedDistance;\r\n const fragmentB = this.chainDistanceToFragment(distanceB, true)!;\r\n const childDetail = fragmentB.childCurve.moveSignedDistanceFromFraction(fragmentB.childFraction0, distanceB - fragmentB.chainDistance0, allowExtension, result);\r\n const endFraction = startFraction + (signedDistance / this._totalLength);\r\n const chainDetail = CurveLocationDetail.createConditionalMoveSignedDistance(allowExtension, this, startFraction, endFraction, signedDistance, result);\r\n chainDetail.childDetail = childDetail;\r\n return chainDetail;\r\n }\r\n\r\n/**\r\n *\r\n * The returned object has\r\n * * numCalls = number of times closestPoint was called.\r\n * * numCurvesTested = number of curves tested with full closestPoint\r\n * * numAssigned = number of times a new minimum value was recorded\r\n * * numCandidate = number of curves that would be tested in worst case.\r\n * return an object summarizing closest point test counts\r\n * @param clear if true, counts are cleared after the return object is formed.\r\n */\r\n public static getClosestPointTestCounts(clear: boolean = true):\r\n {numCalls: number, numTested: number, numAssigned: number, numCandidate: number}{\r\n const a = {\r\n numCalls: this._numCalls,\r\n numTested: this._numTested,\r\n numAssigned: this._numAssigned,\r\n numCandidate: this._numCandidate};\r\n\r\n if (clear){\r\n this._numTested = this._numAssigned = this._numCandidate = 0;\r\n }\r\n return a;\r\n }\r\n private static _numCalls = 0;\r\n private static _numTested = 0;\r\n private static _numAssigned = 0;\r\n private static _numCandidate = 0;\r\n /** Search for the curve point that is closest to the spacePoint.\r\n * * The CurveChainWithDistanceIndex invokes the base class CurvePrimitive method, which\r\n * (via a handler) determines a CurveLocation detail among the children.\r\n * * The returned detail directly identifies fractional position along the CurveChainWithDistanceIndex, and has pointer to an additional detail for the child curve.\r\n * @param spacePoint point in space\r\n * @param extend true to extend the curve\r\n * @returns Returns a CurveLocationDetail structure that holds the details of the close point.\r\n */\r\n public override closestPoint(spacePoint: Point3d, extend: VariantCurveExtendParameter): CurveLocationDetail | undefined {\r\n let childDetail: CurveLocationDetail | undefined;\r\n let aMin = Number.MAX_VALUE;\r\n const numChildren = this.path.children.length;\r\n if (numChildren === 1) {\r\n childDetail = this.path.children[0].closestPoint(spacePoint, extend);\r\n } else {\r\n const sortedFragments = PathFragment.collectSortedQuickMinDistances (this._fragments, spacePoint);\r\n const extend0 = [CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(extend, 0), CurveExtendMode.None];\r\n const extend1 = [CurveExtendMode.None, CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(extend, 1)];\r\n const fragment0 = this._fragments[0];\r\n const fragment1 = this._fragments[this._fragments.length - 1];\r\n CurveChainWithDistanceIndex._numCalls++;\r\n CurveChainWithDistanceIndex._numCandidate+= sortedFragments.length;\r\n for (const f of sortedFragments) {\r\n if (f.a >aMin)\r\n break;\r\n CurveChainWithDistanceIndex._numTested++;\r\n const child = f.childCurve;\r\n const detailA = child.closestPoint(spacePoint,\r\n f === fragment0 ? extend0 : f === fragment1 ? extend1 : false);\r\n if (detailA && detailA.a < aMin) {\r\n aMin = detailA.a;\r\n childDetail = CurveLocationDetail.createCurveFractionPoint(detailA.curve, detailA.fraction, detailA.point, childDetail)!;\r\n childDetail.a = detailA.a;\r\n CurveChainWithDistanceIndex._numAssigned++;\r\n }\r\n }\r\n\r\n }\r\n if (!childDetail)\r\n return undefined;\r\n const fragment = this.curveAndChildFractionToFragment(childDetail.curve!, childDetail.fraction);\r\n if (fragment) {\r\n const chainDistance = fragment.childFractionToChainDistance(childDetail.fraction);\r\n const chainFraction = this.chainDistanceToChainFraction(chainDistance);\r\n const chainDetail = CurveLocationDetail.createCurveFractionPoint(this, chainFraction, childDetail.point);\r\n chainDetail.childDetail = childDetail;\r\n chainDetail.a = childDetail.a;\r\n return chainDetail;\r\n }\r\n return undefined;\r\n }\r\n\r\n /**\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 joined offset.\r\n * @param offsetDistanceOrOptions offset distance (positive to left of the instance curve), or options object\r\n */\r\n public override constructOffsetXY(offsetDistanceOrOptions: number | OffsetOptions): 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 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 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"]}
|
|
@@ -1,7 +1,8 @@
|
|
|
1
1
|
import { GeometryHandler } from "../geometry3d/GeometryHandler";
|
|
2
2
|
import { GrowableXYZArray } from "../geometry3d/GrowableXYZArray";
|
|
3
|
-
import { Point3d } from "../geometry3d/Point3dVector3d";
|
|
4
|
-
import { Range3d } from "../geometry3d/Range";
|
|
3
|
+
import { Point3d, Vector3d } from "../geometry3d/Point3dVector3d";
|
|
4
|
+
import { Range1d, Range3d } from "../geometry3d/Range";
|
|
5
|
+
import { Ray3d } from "../geometry3d/Ray3d";
|
|
5
6
|
import { Transform } from "../geometry3d/Transform";
|
|
6
7
|
import { AnyCurve } from "./CurveChain";
|
|
7
8
|
import { CurveLocationDetail } from "./CurveLocationDetail";
|
|
@@ -106,6 +107,12 @@ export declare abstract class CurveCollection extends GeometryQuery {
|
|
|
106
107
|
* @param fraction fraction to use in `curve.fractionToPoint(fraction)`
|
|
107
108
|
*/
|
|
108
109
|
static createCurveLocationDetailOnAnyCurvePrimitive(source: GeometryQuery | undefined, fraction?: number): CurveLocationDetail | undefined;
|
|
110
|
+
/** Project instance geometry (via dispatch) onto the given ray, and return the extreme fractional parameters of projection.
|
|
111
|
+
* @param ray ray onto which the instance is projected. A `Vector3d` is treated as a `Ray3d` with zero origin.
|
|
112
|
+
* @param lowHigh optional receiver for output
|
|
113
|
+
* @returns range of fractional projection parameters onto the ray, where 0.0 is start of the ray and 1.0 is the end of the ray.
|
|
114
|
+
*/
|
|
115
|
+
projectedParameterRange(ray: Vector3d | Ray3d, lowHigh?: Range1d): Range1d | undefined;
|
|
109
116
|
}
|
|
110
117
|
/** Shared base class for use by both open and closed paths.
|
|
111
118
|
* - A `CurveChain` contains only curvePrimitives. No other paths, loops, or regions allowed.
|
|
@@ -148,8 +155,10 @@ export declare abstract class CurveChain extends CurveCollection {
|
|
|
148
155
|
* Reverse the order of the children in the CurveChain array.
|
|
149
156
|
*/
|
|
150
157
|
reverseChildrenInPlace(): void;
|
|
151
|
-
/** Return the index where target is found in the array of children
|
|
152
|
-
|
|
158
|
+
/** Return the index where target is found in the array of children
|
|
159
|
+
* @param alsoSearchProxies whether to also check proxy curves of the children
|
|
160
|
+
*/
|
|
161
|
+
childIndex(target: CurvePrimitive | undefined, alsoSearchProxies?: boolean): number | undefined;
|
|
153
162
|
/** Evaluate an indexed curve at a fraction. Return as a CurveLocationDetail that indicates the primitive.
|
|
154
163
|
*/
|
|
155
164
|
primitiveIndexAndFractionToCurveLocationDetailPointAndDerivative(index: number, fraction: number, cyclic?: boolean, result?: CurveLocationDetail): CurveLocationDetail | undefined;
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"CurveCollection.d.ts","sourceRoot":"","sources":["../../../src/curve/CurveCollection.ts"],"names":[],"mappings":"AASA,OAAO,EAAE,eAAe,EAAE,MAAM,+BAA+B,CAAC;AAChE,OAAO,EAAE,gBAAgB,EAAE,MAAM,gCAAgC,CAAC;AAClE,OAAO,EAAE,OAAO,EAAE,MAAM,+BAA+B,CAAC;
|
|
1
|
+
{"version":3,"file":"CurveCollection.d.ts","sourceRoot":"","sources":["../../../src/curve/CurveCollection.ts"],"names":[],"mappings":"AASA,OAAO,EAAE,eAAe,EAAE,MAAM,+BAA+B,CAAC;AAChE,OAAO,EAAE,gBAAgB,EAAE,MAAM,gCAAgC,CAAC;AAClE,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAClE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AACvD,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAC5C,OAAO,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AACpD,OAAO,EAAE,QAAQ,EAAE,MAAM,cAAc,CAAC;AACxC,OAAO,EAAE,mBAAmB,EAAE,MAAM,uBAAuB,CAAC;AAC5D,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAClD,OAAO,EAAE,uBAAuB,EAAE,MAAM,kBAAkB,CAAC;AAC3D,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAUhD,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAEhD;;;;;;;GAOG;AACH,oBAAY,mBAAmB,GAAG,MAAM,GAAG,MAAM,GAAG,aAAa,GAAG,cAAc,GAAG,aAAa,CAAC;AAEnG;;;;;;;;;;;GAWG;AACH,8BAAsB,eAAgB,SAAQ,aAAa;IACzD,wCAAwC;IACxC,SAAgB,gBAAgB,qBAAqB;IACrD,0BAA0B;IAC1B,kBAAyB,mBAAmB,EAAE,mBAAmB,CAAC;IAGlE,wDAAwD;IACjD,OAAO,EAAE,OAAO,CAAS;IAChC,6DAA6D;IACtD,UAAU,IAAI,MAAM;IAC3B,uDAAuD;IAChD,YAAY,CAAC,UAAU,EAAE,OAAO,GAAG,mBAAmB,GAAG,SAAS;IAgBzE;;;;;OAKG;IACI,MAAM,IAAI,MAAM;IACvB,wGAAwG;IACjG,2BAA2B,IAAI,OAAO;IAC7C,8CAA8C;IACvC,mBAAmB,CAAC,SAAS,EAAE,SAAS,GAAG,OAAO;IACzD,0BAA0B;IACV,KAAK,IAAI,eAAe;IAGxC,gDAAgD;IAChC,gBAAgB,CAAC,SAAS,EAAE,SAAS,GAAG,eAAe,GAAG,SAAS;IAGnF,kFAAkF;IAC3E,4BAA4B,IAAI,eAAe;IAGtD,0EAA0E;IAC1E,OAAO,CAAC,wBAAwB;IAWhC;;;;OAIG;IACI,sBAAsB,CAAC,cAAc,CAAC,EAAE,cAAc,EAAE,EAAE,0BAA0B,GAAE,OAAe,EAAE,kBAAkB,GAAE,OAAe,GAAG,cAAc,EAAE;IAMpK;;;;OAIG;IACH,IAAW,eAAe,IAAI,OAAO,CAEpC;IACD;OACG;IACH,IAAW,UAAU,IAAI,OAAO,CAE/B;IACD;;OAEG;IACH,IAAW,YAAY,IAAI,OAAO,CAEjC;IACD,2FAA2F;aAC3E,YAAY,CAAC,OAAO,CAAC,EAAE,aAAa,GAAG,QAAQ;IAE/D,2FAA2F;aAC3E,wBAAwB,CAAC,SAAS,EAAE,uBAAuB,GAAG,IAAI;IAClF,iCAAiC;aACjB,cAAc,IAAI,eAAe;IACjD;;OAEG;aACa,eAAe,IAAI,MAAM;IACzC;;;;OAIG;aACa,WAAW,CAAC,KAAK,EAAE,QAAQ,GAAG,SAAS,GAAG,OAAO;IACjE,4CAA4C;aAC5B,QAAQ,CAAC,CAAC,EAAE,MAAM,GAAG,QAAQ,GAAG,SAAS;IACzD,mGAAmG;IAC5F,WAAW,CAAC,aAAa,EAAE,OAAO,EAAE,SAAS,CAAC,EAAE,SAAS,GAAG,IAAI;IAQvE;;;;;OAKG;WACW,4CAA4C,CAAC,MAAM,EAAE,aAAa,GAAG,SAAS,EAAE,QAAQ,GAAE,MAAY,GAAG,mBAAmB,GAAG,SAAS;IAatJ;;;;OAIG;IACI,uBAAuB,CAAC,GAAG,EAAE,QAAQ,GAAG,KAAK,EAAE,OAAO,CAAC,EAAE,OAAO,GAAG,OAAO,GAAG,SAAS;CAG9F;AAED;;;;;;;;;GASG;AACH,8BAAsB,UAAW,SAAQ,eAAe;IACtD,yCAAyC;IACzC,SAAS,CAAC,OAAO,EAAE,cAAc,EAAE,CAAC;IACpC,SAAS;IACT,2CAA2C;IAC3C,IAAoB,QAAQ,IAAI,cAAc,EAAE,CAI/C;IACD;;;;OAIG;IACI,oBAAoB,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,GAAE,OAAc,GAAG,cAAc,GAAG,SAAS;IAa9F;;OAEG;IACI,gBAAgB,CAAC,OAAO,CAAC,EAAE,aAAa,GAAG,gBAAgB,GAAG,SAAS;IAY9E,sEAAsE;aAC7C,YAAY,CAAC,OAAO,CAAC,EAAE,aAAa,GAAG,QAAQ;IAWxE;;OAEG;IACI,WAAW,CAAC,KAAK,EAAE,QAAQ,GAAG,SAAS,GAAG,OAAO;IAOxD,8BAA8B;IACvB,QAAQ,CAAC,CAAC,EAAE,MAAM,GAAG,cAAc,GAAG,SAAS;IAItD,mEAAmE;IACnD,WAAW,CAAC,KAAK,EAAE,OAAO,EAAE,SAAS,CAAC,EAAE,SAAS,GAAG,IAAI;IAIxE;;;OAGG;IACI,sBAAsB;IAK7B;;MAEE;IACK,UAAU,CAAC,MAAM,EAAE,cAAc,GAAG,SAAS,EAAE,iBAAiB,CAAC,EAAE,OAAO,GAAG,MAAM,GAAG,SAAS;IAgBtG;OACG;IACI,gEAAgE,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,MAAM,GAAE,OAAe,EAAE,MAAM,CAAC,EAAE,mBAAmB,GAAG,mBAAmB,GAAG,SAAS;CAOjM;AAED;;;;GAIG;AACH,qBAAa,WAAY,SAAQ,eAAe;IAC9C,wCAAwC;IACxC,SAAgB,mBAAmB,iBAAiB;IAEpD,sDAAsD;IAC/C,mBAAmB,CAAC,KAAK,EAAE,aAAa,GAAG,OAAO;IACzD;;OAEG;IACH,SAAS,CAAC,SAAS,EAAE,QAAQ,EAAE,CAAC;IAChC,uCAAuC;;IAEvC,kDAAkD;IAClD,IAAoB,QAAQ,IAAI,QAAQ,EAAE,CAA2B;IACrE,gCAAgC;WAClB,MAAM,CAAC,GAAG,IAAI,EAAE,QAAQ,EAAE,GAAG,WAAW;IAOtD,gFAAgF;IACzE,eAAe,IAAI,MAAM;IAChC,mEAAmE;IAC5D,wBAAwB,CAAC,SAAS,EAAE,uBAAuB,EAAE,aAAa,GAAE,MAAW,GAAG,IAAI;IAGrG,0CAA0C;IACnC,YAAY,CAAC,OAAO,CAAC,EAAE,aAAa,GAAG,WAAW;IAiBzD,oCAAoC;IAC7B,cAAc,IAAI,WAAW;IACpC,mBAAmB;IACZ,WAAW,CAAC,KAAK,EAAE,QAAQ,GAAG,SAAS,GAAG,OAAO;IAKxD,2BAA2B;IACpB,QAAQ,CAAC,CAAC,EAAE,MAAM,GAAG,QAAQ,GAAG,SAAS;IAKhD,8EAA8E;IACvE,yBAAyB,CAAC,OAAO,EAAE,eAAe,GAAG,GAAG;CAGhE;AACD;;;GAGG;AACH,qBAAa,yCAAyC;IACpD,8GAA8G;IACvG,yBAAyB,EAAE,OAAO,CAAQ;IACjD,0CAA0C;IACnC,yBAAyB,EAAE,OAAO,CAAQ;IACjD,gDAAgD;IACzC,uBAAuB,SAAgC;IAC9D,uDAAuD;IAChD,sBAAsB,SAAgC;CAC9D"}
|
|
@@ -16,9 +16,11 @@ const CloneCurvesContext_1 = require("./internalContexts/CloneCurvesContext");
|
|
|
16
16
|
const CloneWithExpandedLineStrings_1 = require("./internalContexts/CloneWithExpandedLineStrings");
|
|
17
17
|
const CountLinearPartsSearchContext_1 = require("./internalContexts/CountLinearPartsSearchContext");
|
|
18
18
|
const GapSearchContext_1 = require("./internalContexts/GapSearchContext");
|
|
19
|
+
const PlaneAltitudeRangeContext_1 = require("./internalContexts/PlaneAltitudeRangeContext");
|
|
19
20
|
const SumLengthsContext_1 = require("./internalContexts/SumLengthsContext");
|
|
20
21
|
const TransformInPlaceContext_1 = require("./internalContexts/TransformInPlaceContext");
|
|
21
22
|
const LineString3d_1 = require("./LineString3d");
|
|
23
|
+
const ProxyCurve_1 = require("./ProxyCurve");
|
|
22
24
|
/**
|
|
23
25
|
* A `CurveCollection` is an abstract (non-instantiable) class for various sets of curves with particular structures:
|
|
24
26
|
* - `CurveChain` is a (non-instantiable) intermediate class for a sequence of `CurvePrimitive ` joining head-to-tail. The two instantiable forms of `CurveChain` are
|
|
@@ -151,6 +153,14 @@ class CurveCollection extends GeometryQuery_1.GeometryQuery {
|
|
|
151
153
|
}
|
|
152
154
|
return undefined;
|
|
153
155
|
}
|
|
156
|
+
/** Project instance geometry (via dispatch) onto the given ray, and return the extreme fractional parameters of projection.
|
|
157
|
+
* @param ray ray onto which the instance is projected. A `Vector3d` is treated as a `Ray3d` with zero origin.
|
|
158
|
+
* @param lowHigh optional receiver for output
|
|
159
|
+
* @returns range of fractional projection parameters onto the ray, where 0.0 is start of the ray and 1.0 is the end of the ray.
|
|
160
|
+
*/
|
|
161
|
+
projectedParameterRange(ray, lowHigh) {
|
|
162
|
+
return PlaneAltitudeRangeContext_1.PlaneAltitudeRangeContext.findExtremeFractionsAlongDirection(this, ray, lowHigh);
|
|
163
|
+
}
|
|
154
164
|
}
|
|
155
165
|
exports.CurveCollection = CurveCollection;
|
|
156
166
|
/** Shared base class for use by both open and closed paths.
|
|
@@ -244,12 +254,23 @@ class CurveChain extends CurveCollection {
|
|
|
244
254
|
curve.reverseInPlace();
|
|
245
255
|
this._curves.reverse();
|
|
246
256
|
}
|
|
247
|
-
/** Return the index where target is found in the array of children
|
|
248
|
-
|
|
257
|
+
/** Return the index where target is found in the array of children
|
|
258
|
+
* @param alsoSearchProxies whether to also check proxy curves of the children
|
|
259
|
+
*/
|
|
260
|
+
childIndex(target, alsoSearchProxies) {
|
|
249
261
|
for (let i = 0; i < this._curves.length; i++) {
|
|
250
262
|
if (this._curves[i] === target)
|
|
251
263
|
return i;
|
|
252
264
|
}
|
|
265
|
+
if (alsoSearchProxies !== null && alsoSearchProxies !== void 0 ? alsoSearchProxies : false) {
|
|
266
|
+
for (let i = 0; i < this._curves.length; i++) {
|
|
267
|
+
const childCurve = this._curves[i];
|
|
268
|
+
if (childCurve instanceof ProxyCurve_1.ProxyCurve) {
|
|
269
|
+
if (childCurve.proxyCurve === target)
|
|
270
|
+
return i;
|
|
271
|
+
}
|
|
272
|
+
}
|
|
273
|
+
}
|
|
253
274
|
return undefined;
|
|
254
275
|
}
|
|
255
276
|
/** Evaluate an indexed curve at a fraction. Return as a CurveLocationDetail that indicates the primitive.
|