@itwin/core-geometry 4.2.0-dev.3 → 4.2.0-dev.31
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 +69 -1
- package/lib/cjs/Geometry.d.ts +2 -2
- package/lib/cjs/Geometry.d.ts.map +1 -1
- package/lib/cjs/Geometry.js.map +1 -1
- package/lib/cjs/clipping/AlternatingConvexClipTree.d.ts +4 -3
- package/lib/cjs/clipping/AlternatingConvexClipTree.d.ts.map +1 -1
- package/lib/cjs/clipping/AlternatingConvexClipTree.js +1 -1
- package/lib/cjs/clipping/AlternatingConvexClipTree.js.map +1 -1
- package/lib/cjs/clipping/BooleanClipNode.d.ts +4 -3
- package/lib/cjs/clipping/BooleanClipNode.d.ts.map +1 -1
- package/lib/cjs/clipping/BooleanClipNode.js.map +1 -1
- package/lib/cjs/clipping/ClipPlane.d.ts +12 -8
- package/lib/cjs/clipping/ClipPlane.d.ts.map +1 -1
- package/lib/cjs/clipping/ClipPlane.js +5 -3
- package/lib/cjs/clipping/ClipPlane.js.map +1 -1
- package/lib/cjs/clipping/ClipUtils.d.ts +27 -9
- package/lib/cjs/clipping/ClipUtils.d.ts.map +1 -1
- package/lib/cjs/clipping/ClipUtils.js +84 -3
- package/lib/cjs/clipping/ClipUtils.js.map +1 -1
- package/lib/cjs/clipping/ClipVector.d.ts +6 -5
- package/lib/cjs/clipping/ClipVector.d.ts.map +1 -1
- package/lib/cjs/clipping/ClipVector.js +1 -1
- package/lib/cjs/clipping/ClipVector.js.map +1 -1
- package/lib/cjs/clipping/ConvexClipPlaneSet.d.ts +6 -4
- package/lib/cjs/clipping/ConvexClipPlaneSet.d.ts.map +1 -1
- package/lib/cjs/clipping/ConvexClipPlaneSet.js +3 -2
- package/lib/cjs/clipping/ConvexClipPlaneSet.js.map +1 -1
- package/lib/cjs/clipping/UnionOfConvexClipPlaneSets.d.ts +4 -3
- package/lib/cjs/clipping/UnionOfConvexClipPlaneSets.d.ts.map +1 -1
- package/lib/cjs/clipping/UnionOfConvexClipPlaneSets.js +2 -2
- package/lib/cjs/clipping/UnionOfConvexClipPlaneSets.js.map +1 -1
- package/lib/cjs/core-geometry.d.ts +1 -3
- package/lib/cjs/core-geometry.d.ts.map +1 -1
- package/lib/cjs/core-geometry.js +1 -3
- package/lib/cjs/core-geometry.js.map +1 -1
- package/lib/cjs/curve/Arc3d.d.ts.map +1 -1
- package/lib/cjs/curve/Arc3d.js +4 -4
- package/lib/cjs/curve/Arc3d.js.map +1 -1
- package/lib/cjs/curve/CoordinateXYZ.d.ts +15 -15
- package/lib/cjs/curve/CoordinateXYZ.d.ts.map +1 -1
- package/lib/cjs/curve/CoordinateXYZ.js +15 -15
- package/lib/cjs/curve/CoordinateXYZ.js.map +1 -1
- package/lib/cjs/curve/CurveChainWithDistanceIndex.js +1 -1
- package/lib/cjs/curve/CurveChainWithDistanceIndex.js.map +1 -1
- package/lib/cjs/curve/CurveCollection.d.ts +20 -20
- package/lib/cjs/curve/CurveCollection.d.ts.map +1 -1
- package/lib/cjs/curve/CurveCollection.js +21 -23
- package/lib/cjs/curve/CurveCollection.js.map +1 -1
- package/lib/cjs/curve/CurveCurve.d.ts +41 -26
- package/lib/cjs/curve/CurveCurve.d.ts.map +1 -1
- package/lib/cjs/curve/CurveCurve.js +73 -40
- package/lib/cjs/curve/CurveCurve.js.map +1 -1
- package/lib/cjs/curve/CurveFactory.d.ts +1 -1
- package/lib/cjs/curve/CurveFactory.js.map +1 -1
- package/lib/cjs/curve/CurveLocationDetail.d.ts +12 -1
- package/lib/cjs/curve/CurveLocationDetail.d.ts.map +1 -1
- package/lib/cjs/curve/CurveLocationDetail.js +13 -2
- package/lib/cjs/curve/CurveLocationDetail.js.map +1 -1
- package/lib/cjs/curve/CurveOps.d.ts +1 -1
- package/lib/cjs/curve/CurveOps.js.map +1 -1
- package/lib/cjs/curve/CurveProcessor.d.ts +1 -1
- package/lib/cjs/curve/CurveProcessor.js.map +1 -1
- package/lib/cjs/curve/CurveTypes.d.ts +19 -0
- package/lib/cjs/curve/CurveTypes.d.ts.map +1 -0
- package/lib/cjs/curve/{CurveChain.js → CurveTypes.js} +1 -1
- package/lib/cjs/curve/CurveTypes.js.map +1 -0
- package/lib/cjs/curve/CurveWireMomentsXYZ.d.ts +1 -1
- package/lib/cjs/curve/CurveWireMomentsXYZ.js.map +1 -1
- package/lib/cjs/curve/ParityRegion.d.ts +3 -3
- package/lib/cjs/curve/ParityRegion.d.ts.map +1 -1
- package/lib/cjs/curve/ParityRegion.js +2 -2
- package/lib/cjs/curve/ParityRegion.js.map +1 -1
- package/lib/cjs/curve/Path.d.ts +1 -1
- package/lib/cjs/curve/Path.d.ts.map +1 -1
- package/lib/cjs/curve/Path.js +1 -1
- package/lib/cjs/curve/Path.js.map +1 -1
- package/lib/cjs/curve/Query/ConsolidateAdjacentPrimitivesContext.d.ts +3 -2
- package/lib/cjs/curve/Query/ConsolidateAdjacentPrimitivesContext.d.ts.map +1 -1
- package/lib/cjs/curve/Query/ConsolidateAdjacentPrimitivesContext.js +2 -2
- package/lib/cjs/curve/Query/ConsolidateAdjacentPrimitivesContext.js.map +1 -1
- package/lib/cjs/curve/Query/CurveSplitContext.d.ts +1 -1
- package/lib/cjs/curve/Query/CurveSplitContext.js.map +1 -1
- package/lib/cjs/curve/Query/CylindricalRange.d.ts +1 -1
- package/lib/cjs/curve/Query/CylindricalRange.js.map +1 -1
- package/lib/cjs/curve/Query/InOutTests.d.ts +1 -1
- package/lib/cjs/curve/Query/InOutTests.js.map +1 -1
- package/lib/cjs/curve/Query/StrokeCountChain.d.ts +1 -1
- package/lib/cjs/curve/Query/StrokeCountChain.js.map +1 -1
- package/lib/cjs/curve/RegionOps.d.ts +54 -5
- package/lib/cjs/curve/RegionOps.d.ts.map +1 -1
- package/lib/cjs/curve/RegionOps.js +154 -3
- package/lib/cjs/curve/RegionOps.js.map +1 -1
- package/lib/cjs/curve/RegionOpsClassificationSweeps.d.ts +1 -1
- package/lib/cjs/curve/RegionOpsClassificationSweeps.js.map +1 -1
- package/lib/cjs/curve/StrokeOptions.d.ts +20 -11
- package/lib/cjs/curve/StrokeOptions.d.ts.map +1 -1
- package/lib/cjs/curve/StrokeOptions.js +22 -11
- package/lib/cjs/curve/StrokeOptions.js.map +1 -1
- package/lib/cjs/curve/UnionRegion.d.ts +3 -3
- package/lib/cjs/curve/UnionRegion.d.ts.map +1 -1
- package/lib/cjs/curve/UnionRegion.js +3 -3
- package/lib/cjs/curve/UnionRegion.js.map +1 -1
- package/lib/cjs/curve/internalContexts/CurveCurveCloseApproachXY.d.ts +225 -0
- package/lib/cjs/curve/internalContexts/CurveCurveCloseApproachXY.d.ts.map +1 -0
- package/lib/cjs/curve/{CurveCurveCloseApproachXY.js → internalContexts/CurveCurveCloseApproachXY.js} +249 -189
- package/lib/cjs/curve/internalContexts/CurveCurveCloseApproachXY.js.map +1 -0
- package/lib/{esm/curve → cjs/curve/internalContexts}/CurveCurveIntersectXY.d.ts +14 -27
- package/lib/cjs/curve/internalContexts/CurveCurveIntersectXY.d.ts.map +1 -0
- package/lib/cjs/curve/{CurveCurveIntersectXY.js → internalContexts/CurveCurveIntersectXY.js} +31 -42
- package/lib/cjs/curve/internalContexts/CurveCurveIntersectXY.js.map +1 -0
- package/lib/cjs/curve/{CurveCurveIntersectXYZ.d.ts → internalContexts/CurveCurveIntersectXYZ.d.ts} +11 -12
- package/lib/cjs/curve/internalContexts/CurveCurveIntersectXYZ.d.ts.map +1 -0
- package/lib/cjs/curve/{CurveCurveIntersectXYZ.js → internalContexts/CurveCurveIntersectXYZ.js} +12 -14
- package/lib/cjs/curve/internalContexts/CurveCurveIntersectXYZ.js.map +1 -0
- package/lib/cjs/curve/internalContexts/MultiChainCollector.d.ts +1 -1
- package/lib/cjs/curve/internalContexts/MultiChainCollector.js.map +1 -1
- package/lib/cjs/geometry3d/BarycentricTriangle.d.ts +1 -0
- package/lib/cjs/geometry3d/BarycentricTriangle.d.ts.map +1 -1
- package/lib/cjs/geometry3d/BarycentricTriangle.js +1 -0
- package/lib/cjs/geometry3d/BarycentricTriangle.js.map +1 -1
- package/lib/cjs/geometry3d/FrameBuilder.d.ts +57 -36
- package/lib/cjs/geometry3d/FrameBuilder.d.ts.map +1 -1
- package/lib/cjs/geometry3d/FrameBuilder.js +99 -74
- package/lib/cjs/geometry3d/FrameBuilder.js.map +1 -1
- package/lib/cjs/geometry3d/GeometryHandler.d.ts +3 -10
- package/lib/cjs/geometry3d/GeometryHandler.d.ts.map +1 -1
- package/lib/cjs/geometry3d/GeometryHandler.js +2 -6
- package/lib/cjs/geometry3d/GeometryHandler.js.map +1 -1
- package/lib/cjs/geometry3d/GrowableXYZArray.d.ts +0 -8
- package/lib/cjs/geometry3d/GrowableXYZArray.d.ts.map +1 -1
- package/lib/cjs/geometry3d/GrowableXYZArray.js +0 -16
- package/lib/cjs/geometry3d/GrowableXYZArray.js.map +1 -1
- package/lib/cjs/geometry3d/IndexedXYZCollection.d.ts +4 -4
- package/lib/cjs/geometry3d/IndexedXYZCollection.d.ts.map +1 -1
- package/lib/cjs/geometry3d/IndexedXYZCollection.js +12 -0
- package/lib/cjs/geometry3d/IndexedXYZCollection.js.map +1 -1
- package/lib/cjs/geometry3d/Matrix3d.d.ts.map +1 -1
- package/lib/cjs/geometry3d/Matrix3d.js +3 -6
- package/lib/cjs/geometry3d/Matrix3d.js.map +1 -1
- package/lib/cjs/geometry3d/Point3dArrayCarrier.d.ts.map +1 -1
- package/lib/cjs/geometry3d/Point3dArrayCarrier.js.map +1 -1
- package/lib/cjs/geometry3d/Point3dVector3d.d.ts +1 -2
- package/lib/cjs/geometry3d/Point3dVector3d.d.ts.map +1 -1
- package/lib/cjs/geometry3d/Point3dVector3d.js +0 -1
- package/lib/cjs/geometry3d/Point3dVector3d.js.map +1 -1
- package/lib/cjs/geometry3d/PolygonOps.d.ts +2 -2
- package/lib/cjs/geometry3d/PolygonOps.d.ts.map +1 -1
- package/lib/cjs/geometry3d/PolygonOps.js +2 -3
- package/lib/cjs/geometry3d/PolygonOps.js.map +1 -1
- package/lib/cjs/geometry3d/Range.d.ts +1 -1
- package/lib/cjs/geometry3d/Range.js +1 -1
- package/lib/cjs/geometry3d/Range.js.map +1 -1
- package/lib/cjs/geometry3d/Ray3d.d.ts +3 -1
- package/lib/cjs/geometry3d/Ray3d.d.ts.map +1 -1
- package/lib/cjs/geometry3d/Ray3d.js +4 -3
- package/lib/cjs/geometry3d/Ray3d.js.map +1 -1
- package/lib/cjs/geometry3d/ReusableObjectCache.d.ts +2 -1
- package/lib/cjs/geometry3d/ReusableObjectCache.d.ts.map +1 -1
- package/lib/cjs/geometry3d/ReusableObjectCache.js +1 -1
- package/lib/cjs/geometry3d/ReusableObjectCache.js.map +1 -1
- package/lib/cjs/geometry3d/SortablePolygon.d.ts +1 -1
- package/lib/cjs/geometry3d/SortablePolygon.js.map +1 -1
- package/lib/cjs/geometry3d/Transform.d.ts.map +1 -1
- package/lib/cjs/geometry3d/Transform.js +4 -6
- package/lib/cjs/geometry3d/Transform.js.map +1 -1
- package/lib/cjs/geometry3d/YawPitchRollAngles.js +1 -1
- package/lib/cjs/geometry3d/YawPitchRollAngles.js.map +1 -1
- package/lib/cjs/geometry4d/Matrix4d.d.ts.map +1 -1
- package/lib/cjs/geometry4d/Matrix4d.js +4 -2
- package/lib/cjs/geometry4d/Matrix4d.js.map +1 -1
- package/lib/cjs/geometry4d/Point4d.js.map +1 -1
- package/lib/cjs/numerics/Polynomials.d.ts +2 -2
- package/lib/cjs/numerics/Polynomials.d.ts.map +1 -1
- package/lib/cjs/numerics/Polynomials.js +2 -2
- package/lib/cjs/numerics/Polynomials.js.map +1 -1
- package/lib/cjs/polyface/PolyfaceBuilder.d.ts +18 -6
- package/lib/cjs/polyface/PolyfaceBuilder.d.ts.map +1 -1
- package/lib/cjs/polyface/PolyfaceBuilder.js +48 -15
- package/lib/cjs/polyface/PolyfaceBuilder.js.map +1 -1
- package/lib/cjs/polyface/PolyfaceClip.d.ts +16 -7
- package/lib/cjs/polyface/PolyfaceClip.d.ts.map +1 -1
- package/lib/cjs/polyface/PolyfaceClip.js +38 -7
- package/lib/cjs/polyface/PolyfaceClip.js.map +1 -1
- package/lib/cjs/polyface/PolyfaceData.d.ts +5 -39
- package/lib/cjs/polyface/PolyfaceData.d.ts.map +1 -1
- package/lib/cjs/polyface/PolyfaceData.js +7 -41
- package/lib/cjs/polyface/PolyfaceData.js.map +1 -1
- package/lib/cjs/polyface/PolyfaceQuery.d.ts +10 -8
- package/lib/cjs/polyface/PolyfaceQuery.d.ts.map +1 -1
- package/lib/cjs/polyface/PolyfaceQuery.js +64 -18
- package/lib/cjs/polyface/PolyfaceQuery.js.map +1 -1
- package/lib/cjs/serialization/GeometrySamples.d.ts +6 -0
- package/lib/cjs/serialization/GeometrySamples.d.ts.map +1 -1
- package/lib/cjs/serialization/GeometrySamples.js +61 -1
- package/lib/cjs/serialization/GeometrySamples.js.map +1 -1
- package/lib/cjs/solid/LinearSweep.d.ts +1 -1
- package/lib/cjs/solid/LinearSweep.js.map +1 -1
- package/lib/cjs/solid/RotationalSweep.d.ts +1 -1
- package/lib/cjs/solid/RotationalSweep.js.map +1 -1
- package/lib/cjs/solid/RuledSweep.d.ts +1 -1
- package/lib/cjs/solid/RuledSweep.js.map +1 -1
- package/lib/cjs/solid/SweepContour.d.ts +35 -26
- package/lib/cjs/solid/SweepContour.d.ts.map +1 -1
- package/lib/cjs/solid/SweepContour.js +84 -100
- package/lib/cjs/solid/SweepContour.js.map +1 -1
- package/lib/cjs/topology/Graph.d.ts +29 -11
- package/lib/cjs/topology/Graph.d.ts.map +1 -1
- package/lib/cjs/topology/Graph.js +45 -26
- package/lib/cjs/topology/Graph.js.map +1 -1
- package/lib/cjs/topology/HalfEdgeMarkSet.d.ts +2 -2
- package/lib/cjs/topology/HalfEdgeMarkSet.d.ts.map +1 -1
- package/lib/cjs/topology/HalfEdgeMarkSet.js +4 -4
- package/lib/cjs/topology/HalfEdgeMarkSet.js.map +1 -1
- package/lib/cjs/topology/Merging.d.ts +3 -0
- package/lib/cjs/topology/Merging.d.ts.map +1 -1
- package/lib/cjs/topology/Merging.js +19 -5
- package/lib/cjs/topology/Merging.js.map +1 -1
- package/lib/cjs/topology/Triangulation.d.ts +15 -7
- package/lib/cjs/topology/Triangulation.d.ts.map +1 -1
- package/lib/cjs/topology/Triangulation.js +89 -47
- package/lib/cjs/topology/Triangulation.js.map +1 -1
- package/lib/esm/Geometry.d.ts +2 -2
- package/lib/esm/Geometry.d.ts.map +1 -1
- package/lib/esm/Geometry.js.map +1 -1
- package/lib/esm/clipping/AlternatingConvexClipTree.d.ts +4 -3
- package/lib/esm/clipping/AlternatingConvexClipTree.d.ts.map +1 -1
- package/lib/esm/clipping/AlternatingConvexClipTree.js +1 -1
- package/lib/esm/clipping/AlternatingConvexClipTree.js.map +1 -1
- package/lib/esm/clipping/BooleanClipNode.d.ts +4 -3
- package/lib/esm/clipping/BooleanClipNode.d.ts.map +1 -1
- package/lib/esm/clipping/BooleanClipNode.js.map +1 -1
- package/lib/esm/clipping/ClipPlane.d.ts +12 -8
- package/lib/esm/clipping/ClipPlane.d.ts.map +1 -1
- package/lib/esm/clipping/ClipPlane.js +5 -3
- package/lib/esm/clipping/ClipPlane.js.map +1 -1
- package/lib/esm/clipping/ClipUtils.d.ts +27 -9
- package/lib/esm/clipping/ClipUtils.d.ts.map +1 -1
- package/lib/esm/clipping/ClipUtils.js +84 -3
- package/lib/esm/clipping/ClipUtils.js.map +1 -1
- package/lib/esm/clipping/ClipVector.d.ts +6 -5
- package/lib/esm/clipping/ClipVector.d.ts.map +1 -1
- package/lib/esm/clipping/ClipVector.js +1 -1
- package/lib/esm/clipping/ClipVector.js.map +1 -1
- package/lib/esm/clipping/ConvexClipPlaneSet.d.ts +6 -4
- package/lib/esm/clipping/ConvexClipPlaneSet.d.ts.map +1 -1
- package/lib/esm/clipping/ConvexClipPlaneSet.js +3 -2
- package/lib/esm/clipping/ConvexClipPlaneSet.js.map +1 -1
- package/lib/esm/clipping/UnionOfConvexClipPlaneSets.d.ts +4 -3
- package/lib/esm/clipping/UnionOfConvexClipPlaneSets.d.ts.map +1 -1
- package/lib/esm/clipping/UnionOfConvexClipPlaneSets.js +2 -2
- package/lib/esm/clipping/UnionOfConvexClipPlaneSets.js.map +1 -1
- package/lib/esm/core-geometry.d.ts +1 -3
- package/lib/esm/core-geometry.d.ts.map +1 -1
- package/lib/esm/core-geometry.js +1 -3
- package/lib/esm/core-geometry.js.map +1 -1
- package/lib/esm/curve/Arc3d.d.ts.map +1 -1
- package/lib/esm/curve/Arc3d.js +4 -4
- package/lib/esm/curve/Arc3d.js.map +1 -1
- package/lib/esm/curve/CoordinateXYZ.d.ts +15 -15
- package/lib/esm/curve/CoordinateXYZ.d.ts.map +1 -1
- package/lib/esm/curve/CoordinateXYZ.js +15 -15
- package/lib/esm/curve/CoordinateXYZ.js.map +1 -1
- package/lib/esm/curve/CurveChainWithDistanceIndex.js +1 -1
- package/lib/esm/curve/CurveChainWithDistanceIndex.js.map +1 -1
- package/lib/esm/curve/CurveCollection.d.ts +20 -20
- package/lib/esm/curve/CurveCollection.d.ts.map +1 -1
- package/lib/esm/curve/CurveCollection.js +20 -21
- package/lib/esm/curve/CurveCollection.js.map +1 -1
- package/lib/esm/curve/CurveCurve.d.ts +41 -26
- package/lib/esm/curve/CurveCurve.d.ts.map +1 -1
- package/lib/esm/curve/CurveCurve.js +73 -40
- package/lib/esm/curve/CurveCurve.js.map +1 -1
- package/lib/esm/curve/CurveFactory.d.ts +1 -1
- package/lib/esm/curve/CurveFactory.js.map +1 -1
- package/lib/esm/curve/CurveLocationDetail.d.ts +12 -1
- package/lib/esm/curve/CurveLocationDetail.d.ts.map +1 -1
- package/lib/esm/curve/CurveLocationDetail.js +11 -1
- package/lib/esm/curve/CurveLocationDetail.js.map +1 -1
- package/lib/esm/curve/CurveOps.d.ts +1 -1
- package/lib/esm/curve/CurveOps.js.map +1 -1
- package/lib/esm/curve/CurveProcessor.d.ts +1 -1
- package/lib/esm/curve/CurveProcessor.js.map +1 -1
- package/lib/esm/curve/CurveTypes.d.ts +19 -0
- package/lib/esm/curve/CurveTypes.d.ts.map +1 -0
- package/lib/esm/curve/{CurveChain.js → CurveTypes.js} +1 -1
- package/lib/esm/curve/CurveTypes.js.map +1 -0
- package/lib/esm/curve/CurveWireMomentsXYZ.d.ts +1 -1
- package/lib/esm/curve/CurveWireMomentsXYZ.js.map +1 -1
- package/lib/esm/curve/ParityRegion.d.ts +3 -3
- package/lib/esm/curve/ParityRegion.d.ts.map +1 -1
- package/lib/esm/curve/ParityRegion.js +2 -2
- package/lib/esm/curve/ParityRegion.js.map +1 -1
- package/lib/esm/curve/Path.d.ts +1 -1
- package/lib/esm/curve/Path.d.ts.map +1 -1
- package/lib/esm/curve/Path.js +1 -1
- package/lib/esm/curve/Path.js.map +1 -1
- package/lib/esm/curve/Query/ConsolidateAdjacentPrimitivesContext.d.ts +3 -2
- package/lib/esm/curve/Query/ConsolidateAdjacentPrimitivesContext.d.ts.map +1 -1
- package/lib/esm/curve/Query/ConsolidateAdjacentPrimitivesContext.js +1 -1
- package/lib/esm/curve/Query/ConsolidateAdjacentPrimitivesContext.js.map +1 -1
- package/lib/esm/curve/Query/CurveSplitContext.d.ts +1 -1
- package/lib/esm/curve/Query/CurveSplitContext.js.map +1 -1
- package/lib/esm/curve/Query/CylindricalRange.d.ts +1 -1
- package/lib/esm/curve/Query/CylindricalRange.js.map +1 -1
- package/lib/esm/curve/Query/InOutTests.d.ts +1 -1
- package/lib/esm/curve/Query/InOutTests.js.map +1 -1
- package/lib/esm/curve/Query/StrokeCountChain.d.ts +1 -1
- package/lib/esm/curve/Query/StrokeCountChain.js.map +1 -1
- package/lib/esm/curve/RegionOps.d.ts +54 -5
- package/lib/esm/curve/RegionOps.d.ts.map +1 -1
- package/lib/esm/curve/RegionOps.js +153 -3
- package/lib/esm/curve/RegionOps.js.map +1 -1
- package/lib/esm/curve/RegionOpsClassificationSweeps.d.ts +1 -1
- package/lib/esm/curve/RegionOpsClassificationSweeps.js.map +1 -1
- package/lib/esm/curve/StrokeOptions.d.ts +20 -11
- package/lib/esm/curve/StrokeOptions.d.ts.map +1 -1
- package/lib/esm/curve/StrokeOptions.js +22 -11
- package/lib/esm/curve/StrokeOptions.js.map +1 -1
- package/lib/esm/curve/UnionRegion.d.ts +3 -3
- package/lib/esm/curve/UnionRegion.d.ts.map +1 -1
- package/lib/esm/curve/UnionRegion.js +3 -3
- package/lib/esm/curve/UnionRegion.js.map +1 -1
- package/lib/esm/curve/internalContexts/CurveCurveCloseApproachXY.d.ts +225 -0
- package/lib/esm/curve/internalContexts/CurveCurveCloseApproachXY.d.ts.map +1 -0
- package/lib/esm/curve/{CurveCurveCloseApproachXY.js → internalContexts/CurveCurveCloseApproachXY.js} +249 -189
- package/lib/esm/curve/internalContexts/CurveCurveCloseApproachXY.js.map +1 -0
- package/lib/{cjs/curve → esm/curve/internalContexts}/CurveCurveIntersectXY.d.ts +14 -27
- package/lib/esm/curve/internalContexts/CurveCurveIntersectXY.d.ts.map +1 -0
- package/lib/esm/curve/{CurveCurveIntersectXY.js → internalContexts/CurveCurveIntersectXY.js} +30 -40
- package/lib/esm/curve/internalContexts/CurveCurveIntersectXY.js.map +1 -0
- package/lib/esm/curve/{CurveCurveIntersectXYZ.d.ts → internalContexts/CurveCurveIntersectXYZ.d.ts} +11 -12
- package/lib/esm/curve/internalContexts/CurveCurveIntersectXYZ.d.ts.map +1 -0
- package/lib/esm/curve/{CurveCurveIntersectXYZ.js → internalContexts/CurveCurveIntersectXYZ.js} +11 -13
- package/lib/esm/curve/internalContexts/CurveCurveIntersectXYZ.js.map +1 -0
- package/lib/esm/curve/internalContexts/MultiChainCollector.d.ts +1 -1
- package/lib/esm/curve/internalContexts/MultiChainCollector.js.map +1 -1
- package/lib/esm/geometry3d/BarycentricTriangle.d.ts +1 -0
- package/lib/esm/geometry3d/BarycentricTriangle.d.ts.map +1 -1
- package/lib/esm/geometry3d/BarycentricTriangle.js +1 -0
- package/lib/esm/geometry3d/BarycentricTriangle.js.map +1 -1
- package/lib/esm/geometry3d/FrameBuilder.d.ts +57 -36
- package/lib/esm/geometry3d/FrameBuilder.d.ts.map +1 -1
- package/lib/esm/geometry3d/FrameBuilder.js +99 -74
- package/lib/esm/geometry3d/FrameBuilder.js.map +1 -1
- package/lib/esm/geometry3d/GeometryHandler.d.ts +3 -10
- package/lib/esm/geometry3d/GeometryHandler.d.ts.map +1 -1
- package/lib/esm/geometry3d/GeometryHandler.js +2 -6
- package/lib/esm/geometry3d/GeometryHandler.js.map +1 -1
- package/lib/esm/geometry3d/GrowableXYZArray.d.ts +0 -8
- package/lib/esm/geometry3d/GrowableXYZArray.d.ts.map +1 -1
- package/lib/esm/geometry3d/GrowableXYZArray.js +0 -16
- package/lib/esm/geometry3d/GrowableXYZArray.js.map +1 -1
- package/lib/esm/geometry3d/IndexedXYZCollection.d.ts +4 -4
- package/lib/esm/geometry3d/IndexedXYZCollection.d.ts.map +1 -1
- package/lib/esm/geometry3d/IndexedXYZCollection.js +12 -0
- package/lib/esm/geometry3d/IndexedXYZCollection.js.map +1 -1
- package/lib/esm/geometry3d/Matrix3d.d.ts.map +1 -1
- package/lib/esm/geometry3d/Matrix3d.js +3 -6
- package/lib/esm/geometry3d/Matrix3d.js.map +1 -1
- package/lib/esm/geometry3d/Point3dArrayCarrier.d.ts.map +1 -1
- package/lib/esm/geometry3d/Point3dArrayCarrier.js.map +1 -1
- package/lib/esm/geometry3d/Point3dVector3d.d.ts +1 -2
- package/lib/esm/geometry3d/Point3dVector3d.d.ts.map +1 -1
- package/lib/esm/geometry3d/Point3dVector3d.js +0 -1
- package/lib/esm/geometry3d/Point3dVector3d.js.map +1 -1
- package/lib/esm/geometry3d/PolygonOps.d.ts +2 -2
- package/lib/esm/geometry3d/PolygonOps.d.ts.map +1 -1
- package/lib/esm/geometry3d/PolygonOps.js +2 -3
- package/lib/esm/geometry3d/PolygonOps.js.map +1 -1
- package/lib/esm/geometry3d/Range.d.ts +1 -1
- package/lib/esm/geometry3d/Range.js +1 -1
- package/lib/esm/geometry3d/Range.js.map +1 -1
- package/lib/esm/geometry3d/Ray3d.d.ts +3 -1
- package/lib/esm/geometry3d/Ray3d.d.ts.map +1 -1
- package/lib/esm/geometry3d/Ray3d.js +4 -3
- package/lib/esm/geometry3d/Ray3d.js.map +1 -1
- package/lib/esm/geometry3d/ReusableObjectCache.d.ts +2 -1
- package/lib/esm/geometry3d/ReusableObjectCache.d.ts.map +1 -1
- package/lib/esm/geometry3d/ReusableObjectCache.js +1 -1
- package/lib/esm/geometry3d/ReusableObjectCache.js.map +1 -1
- package/lib/esm/geometry3d/SortablePolygon.d.ts +1 -1
- package/lib/esm/geometry3d/SortablePolygon.js.map +1 -1
- package/lib/esm/geometry3d/Transform.d.ts.map +1 -1
- package/lib/esm/geometry3d/Transform.js +4 -6
- package/lib/esm/geometry3d/Transform.js.map +1 -1
- package/lib/esm/geometry3d/YawPitchRollAngles.js +1 -1
- package/lib/esm/geometry3d/YawPitchRollAngles.js.map +1 -1
- package/lib/esm/geometry4d/Matrix4d.d.ts.map +1 -1
- package/lib/esm/geometry4d/Matrix4d.js +4 -2
- package/lib/esm/geometry4d/Matrix4d.js.map +1 -1
- package/lib/esm/geometry4d/Point4d.js.map +1 -1
- package/lib/esm/numerics/Polynomials.d.ts +2 -2
- package/lib/esm/numerics/Polynomials.d.ts.map +1 -1
- package/lib/esm/numerics/Polynomials.js +2 -2
- package/lib/esm/numerics/Polynomials.js.map +1 -1
- package/lib/esm/polyface/PolyfaceBuilder.d.ts +18 -6
- package/lib/esm/polyface/PolyfaceBuilder.d.ts.map +1 -1
- package/lib/esm/polyface/PolyfaceBuilder.js +48 -15
- package/lib/esm/polyface/PolyfaceBuilder.js.map +1 -1
- package/lib/esm/polyface/PolyfaceClip.d.ts +16 -7
- package/lib/esm/polyface/PolyfaceClip.d.ts.map +1 -1
- package/lib/esm/polyface/PolyfaceClip.js +38 -7
- package/lib/esm/polyface/PolyfaceClip.js.map +1 -1
- package/lib/esm/polyface/PolyfaceData.d.ts +5 -39
- package/lib/esm/polyface/PolyfaceData.d.ts.map +1 -1
- package/lib/esm/polyface/PolyfaceData.js +7 -41
- package/lib/esm/polyface/PolyfaceData.js.map +1 -1
- package/lib/esm/polyface/PolyfaceQuery.d.ts +10 -8
- package/lib/esm/polyface/PolyfaceQuery.d.ts.map +1 -1
- package/lib/esm/polyface/PolyfaceQuery.js +64 -18
- package/lib/esm/polyface/PolyfaceQuery.js.map +1 -1
- package/lib/esm/serialization/GeometrySamples.d.ts +6 -0
- package/lib/esm/serialization/GeometrySamples.d.ts.map +1 -1
- package/lib/esm/serialization/GeometrySamples.js +61 -1
- package/lib/esm/serialization/GeometrySamples.js.map +1 -1
- package/lib/esm/solid/LinearSweep.d.ts +1 -1
- package/lib/esm/solid/LinearSweep.js.map +1 -1
- package/lib/esm/solid/RotationalSweep.d.ts +1 -1
- package/lib/esm/solid/RotationalSweep.js.map +1 -1
- package/lib/esm/solid/RuledSweep.d.ts +1 -1
- package/lib/esm/solid/RuledSweep.js.map +1 -1
- package/lib/esm/solid/SweepContour.d.ts +35 -26
- package/lib/esm/solid/SweepContour.d.ts.map +1 -1
- package/lib/esm/solid/SweepContour.js +84 -100
- package/lib/esm/solid/SweepContour.js.map +1 -1
- package/lib/esm/topology/Graph.d.ts +29 -11
- package/lib/esm/topology/Graph.d.ts.map +1 -1
- package/lib/esm/topology/Graph.js +45 -26
- package/lib/esm/topology/Graph.js.map +1 -1
- package/lib/esm/topology/HalfEdgeMarkSet.d.ts +2 -2
- package/lib/esm/topology/HalfEdgeMarkSet.d.ts.map +1 -1
- package/lib/esm/topology/HalfEdgeMarkSet.js +2 -2
- package/lib/esm/topology/HalfEdgeMarkSet.js.map +1 -1
- package/lib/esm/topology/Merging.d.ts +3 -0
- package/lib/esm/topology/Merging.d.ts.map +1 -1
- package/lib/esm/topology/Merging.js +19 -5
- package/lib/esm/topology/Merging.js.map +1 -1
- package/lib/esm/topology/Triangulation.d.ts +15 -7
- package/lib/esm/topology/Triangulation.d.ts.map +1 -1
- package/lib/esm/topology/Triangulation.js +89 -47
- package/lib/esm/topology/Triangulation.js.map +1 -1
- package/package.json +4 -4
- package/lib/cjs/curve/CurveChain.d.ts +0 -17
- package/lib/cjs/curve/CurveChain.d.ts.map +0 -1
- package/lib/cjs/curve/CurveChain.js.map +0 -1
- package/lib/cjs/curve/CurveCurveCloseApproachXY.d.ts +0 -164
- package/lib/cjs/curve/CurveCurveCloseApproachXY.d.ts.map +0 -1
- package/lib/cjs/curve/CurveCurveCloseApproachXY.js.map +0 -1
- package/lib/cjs/curve/CurveCurveIntersectXY.d.ts.map +0 -1
- package/lib/cjs/curve/CurveCurveIntersectXY.js.map +0 -1
- package/lib/cjs/curve/CurveCurveIntersectXYZ.d.ts.map +0 -1
- package/lib/cjs/curve/CurveCurveIntersectXYZ.js.map +0 -1
- package/lib/esm/curve/CurveChain.d.ts +0 -17
- package/lib/esm/curve/CurveChain.d.ts.map +0 -1
- package/lib/esm/curve/CurveChain.js.map +0 -1
- package/lib/esm/curve/CurveCurveCloseApproachXY.d.ts +0 -164
- package/lib/esm/curve/CurveCurveCloseApproachXY.d.ts.map +0 -1
- package/lib/esm/curve/CurveCurveCloseApproachXY.js.map +0 -1
- package/lib/esm/curve/CurveCurveIntersectXY.d.ts.map +0 -1
- package/lib/esm/curve/CurveCurveIntersectXY.js.map +0 -1
- package/lib/esm/curve/CurveCurveIntersectXYZ.d.ts.map +0 -1
- package/lib/esm/curve/CurveCurveIntersectXYZ.js.map +0 -1
|
@@ -6,7 +6,8 @@ import { Point3d } from "../geometry3d/Point3dVector3d";
|
|
|
6
6
|
import { Range3d } from "../geometry3d/Range";
|
|
7
7
|
import { Transform } from "../geometry3d/Transform";
|
|
8
8
|
import { GeometryQuery } from "./GeometryQuery";
|
|
9
|
-
/**
|
|
9
|
+
/**
|
|
10
|
+
* A Coordinate is a Point3d with supporting methods from the GeometryQuery abstraction.
|
|
10
11
|
* @public
|
|
11
12
|
*/
|
|
12
13
|
export declare class CoordinateXYZ extends GeometryQuery {
|
|
@@ -23,29 +24,28 @@ export declare class CoordinateXYZ extends GeometryQuery {
|
|
|
23
24
|
static create(point: Point3d): CoordinateXYZ;
|
|
24
25
|
/** Create a new CoordinateXYZ */
|
|
25
26
|
static createXYZ(x?: number, y?: number, z?: number): CoordinateXYZ;
|
|
26
|
-
/**
|
|
27
|
+
/** Return the range of the point */
|
|
27
28
|
range(): Range3d;
|
|
28
|
-
/**
|
|
29
|
+
/** Extend `rangeToExtend` to include this point (optionally transformed) */
|
|
29
30
|
extendRange(rangeToExtend: Range3d, transform?: Transform): void;
|
|
30
31
|
/** Apply transform to the Coordinate's point. */
|
|
31
32
|
tryTransformInPlace(transform: Transform): boolean;
|
|
32
|
-
/**
|
|
33
|
-
*/
|
|
33
|
+
/** Return a transformed clone */
|
|
34
34
|
cloneTransformed(transform: Transform): GeometryQuery | undefined;
|
|
35
|
-
/**
|
|
35
|
+
/** Return a clone */
|
|
36
36
|
clone(): GeometryQuery | undefined;
|
|
37
|
-
/**
|
|
38
|
-
*
|
|
39
|
-
* *
|
|
37
|
+
/**
|
|
38
|
+
* Return GeometryQuery children for recursive queries.
|
|
39
|
+
* * Leaf classes do not need to implement.
|
|
40
40
|
*/
|
|
41
|
-
/**
|
|
41
|
+
/** Test if (other instanceof Coordinate). */
|
|
42
42
|
isSameGeometryClass(other: GeometryQuery): boolean;
|
|
43
|
-
/**
|
|
44
|
-
*
|
|
43
|
+
/**
|
|
44
|
+
* Test for exact structure and nearly identical geometry.
|
|
45
45
|
* * Leaf classes must implement !!!
|
|
46
|
-
* *
|
|
47
|
-
* *
|
|
48
|
-
* *
|
|
46
|
+
* * Base class implementation recurses through children.
|
|
47
|
+
* * Base implementation is complete for classes with children and no properties.
|
|
48
|
+
* * Classes with both children and properties must implement for properties, call super for children.
|
|
49
49
|
*/
|
|
50
50
|
isAlmostEqual(other: GeometryQuery): boolean;
|
|
51
51
|
/** Second step of double dispatch: call `handler.handleCoordinateXYZ(this)` */
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"CoordinateXYZ.d.ts","sourceRoot":"","sources":["../../../src/curve/CoordinateXYZ.ts"],"names":[],"mappings":"AAIA;;GAEG;AACH,OAAO,EAAE,eAAe,EAAE,MAAM,+BAA+B,CAAC;AAChE,OAAO,EAAE,OAAO,EAAE,MAAM,+BAA+B,CAAC;AACxD,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AAC9C,OAAO,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AACpD,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAEhD
|
|
1
|
+
{"version":3,"file":"CoordinateXYZ.d.ts","sourceRoot":"","sources":["../../../src/curve/CoordinateXYZ.ts"],"names":[],"mappings":"AAIA;;GAEG;AACH,OAAO,EAAE,eAAe,EAAE,MAAM,+BAA+B,CAAC;AAChE,OAAO,EAAE,OAAO,EAAE,MAAM,+BAA+B,CAAC;AACxD,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AAC9C,OAAO,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AACpD,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAEhD;;;GAGG;AACH,qBAAa,aAAc,SAAQ,aAAa;IAC9C,2CAA2C;IAC3C,SAAgB,gBAAgB,WAAW;IAE3C,OAAO,CAAC,IAAI,CAAU;IACtB,mDAAmD;IACnD,IAAW,KAAK,YAAwB;IACxC;;OAEG;IACH,OAAO;IAIP,6DAA6D;WAC/C,MAAM,CAAC,KAAK,EAAE,OAAO,GAAG,aAAa;IAGnD,iCAAiC;WACnB,SAAS,CAAC,CAAC,GAAE,MAAU,EAAE,CAAC,GAAE,MAAU,EAAE,CAAC,GAAE,MAAU,GAAG,aAAa;IAInF,oCAAoC;IACpB,KAAK,IAAI,OAAO;IAEhC,4EAA4E;IACrE,WAAW,CAAC,aAAa,EAAE,OAAO,EAAE,SAAS,CAAC,EAAE,SAAS,GAAG,IAAI;IAMvE,iDAAiD;IAC1C,mBAAmB,CAAC,SAAS,EAAE,SAAS,GAAG,OAAO;IAIzD,iCAAiC;IAC1B,gBAAgB,CAAC,SAAS,EAAE,SAAS,GAAG,aAAa,GAAG,SAAS;IAKxE,qBAAqB;IACd,KAAK,IAAI,aAAa,GAAG,SAAS;IAGzC;;;OAGG;IAEH,8CAA8C;IACvC,mBAAmB,CAAC,KAAK,EAAE,aAAa,GAAG,OAAO;IAGzD;;;;;;OAMG;IACa,aAAa,CAAC,KAAK,EAAE,aAAa,GAAG,OAAO;IAG5D,gFAAgF;IACzE,yBAAyB,CAAC,OAAO,EAAE,eAAe,GAAG,GAAG;CAGhE"}
|
|
@@ -4,7 +4,8 @@ exports.CoordinateXYZ = void 0;
|
|
|
4
4
|
const Point3dVector3d_1 = require("../geometry3d/Point3dVector3d");
|
|
5
5
|
const Range_1 = require("../geometry3d/Range");
|
|
6
6
|
const GeometryQuery_1 = require("./GeometryQuery");
|
|
7
|
-
/**
|
|
7
|
+
/**
|
|
8
|
+
* A Coordinate is a Point3d with supporting methods from the GeometryQuery abstraction.
|
|
8
9
|
* @public
|
|
9
10
|
*/
|
|
10
11
|
class CoordinateXYZ extends GeometryQuery_1.GeometryQuery {
|
|
@@ -27,9 +28,9 @@ class CoordinateXYZ extends GeometryQuery_1.GeometryQuery {
|
|
|
27
28
|
static createXYZ(x = 0, y = 0, z = 0) {
|
|
28
29
|
return new CoordinateXYZ(Point3dVector3d_1.Point3d.create(x, y, z));
|
|
29
30
|
}
|
|
30
|
-
/**
|
|
31
|
+
/** Return the range of the point */
|
|
31
32
|
range() { return Range_1.Range3d.create(this._xyz); }
|
|
32
|
-
/**
|
|
33
|
+
/** Extend `rangeToExtend` to include this point (optionally transformed) */
|
|
33
34
|
extendRange(rangeToExtend, transform) {
|
|
34
35
|
if (transform)
|
|
35
36
|
rangeToExtend.extendTransformedXYZ(transform, this._xyz.x, this._xyz.y, this._xyz.z);
|
|
@@ -41,31 +42,30 @@ class CoordinateXYZ extends GeometryQuery_1.GeometryQuery {
|
|
|
41
42
|
transform.multiplyPoint3d(this._xyz, this._xyz);
|
|
42
43
|
return true;
|
|
43
44
|
}
|
|
44
|
-
/**
|
|
45
|
-
*/
|
|
45
|
+
/** Return a transformed clone */
|
|
46
46
|
cloneTransformed(transform) {
|
|
47
47
|
const result = new CoordinateXYZ(this._xyz.clone());
|
|
48
48
|
result.tryTransformInPlace(transform);
|
|
49
49
|
return result;
|
|
50
50
|
}
|
|
51
|
-
/**
|
|
51
|
+
/** Return a clone */
|
|
52
52
|
clone() {
|
|
53
53
|
return new CoordinateXYZ(this._xyz.clone());
|
|
54
54
|
}
|
|
55
|
-
/**
|
|
56
|
-
*
|
|
57
|
-
* *
|
|
55
|
+
/**
|
|
56
|
+
* Return GeometryQuery children for recursive queries.
|
|
57
|
+
* * Leaf classes do not need to implement.
|
|
58
58
|
*/
|
|
59
|
-
/**
|
|
59
|
+
/** Test if (other instanceof Coordinate). */
|
|
60
60
|
isSameGeometryClass(other) {
|
|
61
61
|
return other instanceof CoordinateXYZ;
|
|
62
62
|
}
|
|
63
|
-
/**
|
|
64
|
-
*
|
|
63
|
+
/**
|
|
64
|
+
* Test for exact structure and nearly identical geometry.
|
|
65
65
|
* * Leaf classes must implement !!!
|
|
66
|
-
* *
|
|
67
|
-
* *
|
|
68
|
-
* *
|
|
66
|
+
* * Base class implementation recurses through children.
|
|
67
|
+
* * Base implementation is complete for classes with children and no properties.
|
|
68
|
+
* * Classes with both children and properties must implement for properties, call super for children.
|
|
69
69
|
*/
|
|
70
70
|
isAlmostEqual(other) {
|
|
71
71
|
return (other instanceof CoordinateXYZ) && this._xyz.isAlmostEqual(other._xyz);
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"CoordinateXYZ.js","sourceRoot":"","sources":["../../../src/curve/CoordinateXYZ.ts"],"names":[],"mappings":";;;AAQA,mEAAwD;AACxD,+CAA8C;AAE9C,mDAAgD;AAEhD
|
|
1
|
+
{"version":3,"file":"CoordinateXYZ.js","sourceRoot":"","sources":["../../../src/curve/CoordinateXYZ.ts"],"names":[],"mappings":";;;AAQA,mEAAwD;AACxD,+CAA8C;AAE9C,mDAAgD;AAEhD;;;GAGG;AACH,MAAa,aAAc,SAAQ,6BAAa;IAK9C,mDAAmD;IACnD,IAAW,KAAK,KAAK,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;IACxC;;OAEG;IACH,YAAoB,GAAY;QAC9B,KAAK,EAAE,CAAC;QAVV,2CAA2C;QAC3B,qBAAgB,GAAG,OAAO,CAAC;QAUzC,IAAI,CAAC,IAAI,GAAG,GAAG,CAAC;IAClB,CAAC;IACD,6DAA6D;IACtD,MAAM,CAAC,MAAM,CAAC,KAAc;QACjC,OAAO,IAAI,aAAa,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC;IAC1C,CAAC;IACD,iCAAiC;IAC1B,MAAM,CAAC,SAAS,CAAC,IAAY,CAAC,EAAE,IAAY,CAAC,EAAE,IAAY,CAAC;QACjE,OAAO,IAAI,aAAa,CAAC,yBAAO,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACpD,CAAC;IAED,oCAAoC;IACpB,KAAK,KAAc,OAAO,eAAO,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAEtE,4EAA4E;IACrE,WAAW,CAAC,aAAsB,EAAE,SAAqB;QAC9D,IAAI,SAAS;YACX,aAAa,CAAC,oBAAoB,CAAC,SAAS,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;;YAErF,aAAa,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACpC,CAAC;IACD,iDAAiD;IAC1C,mBAAmB,CAAC,SAAoB;QAC7C,SAAS,CAAC,eAAe,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;QAChD,OAAO,IAAI,CAAC;IACd,CAAC;IACD,iCAAiC;IAC1B,gBAAgB,CAAC,SAAoB;QAC1C,MAAM,MAAM,GAAG,IAAI,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC;QACpD,MAAM,CAAC,mBAAmB,CAAC,SAAS,CAAC,CAAC;QACtC,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,qBAAqB;IACd,KAAK;QACV,OAAO,IAAI,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC;IAC9C,CAAC;IACD;;;OAGG;IAEH,8CAA8C;IACvC,mBAAmB,CAAC,KAAoB;QAC7C,OAAO,KAAK,YAAY,aAAa,CAAC;IACxC,CAAC;IACD;;;;;;OAMG;IACa,aAAa,CAAC,KAAoB;QAChD,OAAO,CAAC,KAAK,YAAY,aAAa,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IACjF,CAAC;IACD,gFAAgF;IACzE,yBAAyB,CAAC,OAAwB;QACvD,OAAO,OAAO,CAAC,mBAAmB,CAAC,IAAI,CAAC,CAAC;IAC3C,CAAC;CACF;AAvED,sCAuEC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n/** @packageDocumentation\r\n * @module Curve\r\n */\r\nimport { GeometryHandler } from \"../geometry3d/GeometryHandler\";\r\nimport { Point3d } from \"../geometry3d/Point3dVector3d\";\r\nimport { Range3d } from \"../geometry3d/Range\";\r\nimport { Transform } from \"../geometry3d/Transform\";\r\nimport { GeometryQuery } from \"./GeometryQuery\";\r\n\r\n/**\r\n * A Coordinate is a Point3d with supporting methods from the GeometryQuery abstraction.\r\n * @public\r\n */\r\nexport class CoordinateXYZ extends GeometryQuery {\r\n /** String name for interface properties */\r\n public readonly geometryCategory = \"point\";\r\n\r\n private _xyz: Point3d;\r\n /** Return a (REFERENCE TO) the coordinate data. */\r\n public get point() { return this._xyz; }\r\n /**\r\n * @param xyz point to be CAPTURED.\r\n */\r\n private constructor(xyz: Point3d) {\r\n super();\r\n this._xyz = xyz;\r\n }\r\n /** Create a new CoordinateXYZ containing a CLONE of point */\r\n public static create(point: Point3d): CoordinateXYZ {\r\n return new CoordinateXYZ(point.clone());\r\n }\r\n /** Create a new CoordinateXYZ */\r\n public static createXYZ(x: number = 0, y: number = 0, z: number = 0): CoordinateXYZ {\r\n return new CoordinateXYZ(Point3d.create(x, y, z));\r\n }\r\n\r\n /** Return the range of the point */\r\n public override range(): Range3d { return Range3d.create(this._xyz); }\r\n\r\n /** Extend `rangeToExtend` to include this point (optionally transformed) */\r\n public extendRange(rangeToExtend: Range3d, transform?: Transform): void {\r\n if (transform)\r\n rangeToExtend.extendTransformedXYZ(transform, this._xyz.x, this._xyz.y, this._xyz.z);\r\n else\r\n rangeToExtend.extend(this._xyz);\r\n }\r\n /** Apply transform to the Coordinate's point. */\r\n public tryTransformInPlace(transform: Transform): boolean {\r\n transform.multiplyPoint3d(this._xyz, this._xyz);\r\n return true;\r\n }\r\n /** Return a transformed clone */\r\n public cloneTransformed(transform: Transform): GeometryQuery | undefined {\r\n const result = new CoordinateXYZ(this._xyz.clone());\r\n result.tryTransformInPlace(transform);\r\n return result;\r\n }\r\n /** Return a clone */\r\n public clone(): GeometryQuery | undefined {\r\n return new CoordinateXYZ(this._xyz.clone());\r\n }\r\n /**\r\n * Return GeometryQuery children for recursive queries.\r\n * * Leaf classes do not need to implement.\r\n */\r\n\r\n /** Test if (other instanceof Coordinate). */\r\n public isSameGeometryClass(other: GeometryQuery): boolean {\r\n return other instanceof CoordinateXYZ;\r\n }\r\n /**\r\n * Test for exact structure and nearly identical geometry.\r\n * * Leaf classes must implement !!!\r\n * * Base class implementation recurses through children.\r\n * * Base implementation is complete for classes with children and no properties.\r\n * * Classes with both children and properties must implement for properties, call super for children.\r\n */\r\n public override isAlmostEqual(other: GeometryQuery): boolean {\r\n return (other instanceof CoordinateXYZ) && this._xyz.isAlmostEqual(other._xyz);\r\n }\r\n /** Second step of double dispatch: call `handler.handleCoordinateXYZ(this)` */\r\n public dispatchToGeometryHandler(handler: GeometryHandler): any {\r\n return handler.handleCoordinateXYZ(this);\r\n }\r\n}\r\n"]}
|
|
@@ -545,7 +545,7 @@ class CurveChainWithDistanceIndex extends CurvePrimitive_1.CurvePrimitive {
|
|
|
545
545
|
return undefined;
|
|
546
546
|
// See fractionToPointAndDerivative for derivation of d/df(C(t(f)))=L C'/||C'||.
|
|
547
547
|
// For the 2nd deriv, use quotient rule, d/dt||x(t)||=x.x'/||x|| and ||x||^2=x.x :
|
|
548
|
-
//
|
|
548
|
+
// d2/df2(C(t(f))) = L d/df(C'/||C'||)
|
|
549
549
|
// = L (||C'|| d/df(C') - C' d/df||C'||) / ||C'||^2
|
|
550
550
|
// = L (||C'|| C" L/||C'|| - C' C'.C"/||C'|| L/||C'||) / ||C'||^2
|
|
551
551
|
// = (L/||C'||)^2 (C" - C' C'.C"/C'.C' )
|
|
@@ -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,+CAAuD;AAGvD,uDAA+C;AAC/C,uDAAqG;AACrG,+DAA4D;AAE5D,4FAAyF;AAEzF,mDAAgD;AAChD,iCAA8B;AAG9B;;;;;;GAMG;AACH,MAAa,YAAY;IAevB,yEAAyE;IACzE,YACE,cAAsB,EAAE,cAAsB,EAC9C,SAAiB,EAAE,SAAiB,EACpC,UAA0B,EAAE,KAAe;QAE3C,IAAI,CAAC,cAAc,GAAG,cAAc,CAAC;QACrC,IAAI,CAAC,cAAc,GAAG,cAAc,CAAC;QACrC,IAAI,CAAC,cAAc,GAAG,SAAS,CAAC;QAChC,IAAI,CAAC,cAAc,GAAG,SAAS,CAAC;QAChC,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;QAC7B,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;IACb,CAAC;IACD;;;OAGG;IACI,qBAAqB,CAAC,QAAgB;QAC3C,OAAO,QAAQ,IAAI,IAAI,CAAC,cAAc,IAAI,QAAQ,IAAI,IAAI,CAAC,cAAc,CAAC;IAC5E,CAAC;IACD,0GAA0G;IACnG,4BAA4B,CAAC,UAAmB;QACrD,IAAI,IAAI,CAAC,KAAK,EAAE;YACd,OAAO,IAAI,CAAC,KAAK,CAAC,eAAe,CAAC,UAAU,CAAC,CAAC;SAC/C;QACD,uCAAuC;QACvC,MAAM,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC,YAAY,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;QAC/D,IAAI,MAAM;YACR,OAAO,MAAM,CAAC,CAAC,CAAC;QAClB,OAAO,CAAC,CAAC;IACX,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,8BAA8B,CAAC,SAAyB,EAAE,UAAmB;QACzF,MAAM,eAAe,GAAmB,EAAE,CAAC;QAC3C,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE;YACzB,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,4BAA4B,CAAC,UAAU,CAAC,CAAC;YACjD,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;SACzB;QACD,eAAe,CAAC,IAAI,CAAC,CAAC,CAAe,EAAE,CAAe,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACtE,OAAO,eAAe,CAAC;IACzB,CAAC;IACD;;;OAGG;IACI,kCAAkC,CAAC,KAAqB,EAAE,QAAgB;QAC/E,OAAO,IAAI,CAAC,UAAU,KAAK,KAAK,IAAI,QAAQ,IAAI,IAAI,CAAC,cAAc,IAAI,QAAQ,IAAI,IAAI,CAAC,cAAc,CAAC;IACzG,CAAC;IACD;;;OAGG;IACI,wCAAwC,CAAC,QAAgB;QAC9D,OAAO,mBAAQ,CAAC,kBAAkB,CAChC,IAAI,CAAC,cAAc,EAAE,IAAI,CAAC,cAAc,EACxC,IAAI,CAAC,cAAc,EAAE,IAAI,CAAC,cAAc,EACxC,QAAQ,EAAE,IAAI,CAAC,cAAc,CAAE,CAAC,CAAC,wEAAwE;IAC7G,CAAC;IACD,gGAAgG;IACzF,oCAAoC,CAAC,aAAqB,EAAE,kBAA4B;QAC7F,oFAAoF;QACpF,MAAM,WAAW,GAAG,IAAI,CAAC,UAAU,CAAC,8BAA8B,CAChE,IAAI,CAAC,cAAc,EAAE,aAAa,GAAG,IAAI,CAAC,cAAc,EAAE,kBAAkB,IAAI,KAAK,CAAC,CAAC;QACzF,OAAO,WAAW,CAAC,QAAQ,CAAC;IAC9B,CAAC;IACD;;;OAGG;IACI,mBAAmB,CAAC,cAAsB;QAC/C,OAAO,cAAc,GAAG,CAAC,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC,cAAc,CAAC,CAAC;IACpH,CAAC;IACD;;;;OAIG;IACI,4BAA4B,CAAC,aAAqB;QACvD,MAAM,EAAE,GAAG,IAAI,CAAC,cAAc,CAAC;QAC/B,MAAM,EAAE,GAAG,IAAI,CAAC,cAAc,CAAC;QAC/B,MAAM,EAAE,GAAG,IAAI,CAAC,cAAc,CAAC;QAC/B,MAAM,EAAE,GAAG,IAAI,CAAC,cAAc,CAAC;QAC/B,IAAI,CAAC,cAAc,GAAG,GAAG,GAAG,EAAE,CAAC;QAC/B,IAAI,CAAC,cAAc,GAAG,GAAG,GAAG,EAAE,CAAC;QAC/B,IAAI,CAAC,cAAc,GAAG,aAAa,GAAG,EAAE,CAAC;QACzC,IAAI,CAAC,cAAc,GAAG,aAAa,GAAG,EAAE,CAAC;IAC3C,CAAC;IACD,2DAA2D;IACpD,2BAA2B,CAAC,QAAgB;QACjD,OAAO,IAAI,CAAC,4BAA4B,CAAC,QAAQ,CAAC,CAAC;IACrD,CAAC;IACD;;;;OAIG;IACI,4BAA4B,CAAC,QAAgB;QAClD,IAAI,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,2BAA2B,CAAC,IAAI,CAAC,cAAc,EAAE,QAAQ,CAAC,CAAC;QACnF,IAAI,QAAQ,GAAG,IAAI,CAAC,cAAc;YAChC,CAAC,GAAG,CAAC,CAAC,CAAC;QACT,OAAO,IAAI,CAAC,cAAc,GAAG,CAAC,CAAC;IACjC,CAAC;CACF;AAzHD,oCAyHC;AAED,mEAAmE;AACnE,MAAM,gCAAgC;IAGpC;QACE,IAAI,CAAC,oBAAoB,GAAG,CAAC,CAAC;QAC9B,IAAI,CAAC,UAAU,GAAG,EAAE,CAAC;IACvB,CAAC;IACD,0EAA0E;IACnE,yBAAyB,CAAC,GAAmB,IAAI,CAAC;IAClD,mBAAmB,CAAC,GAAmB,IAAI,CAAC;IAC5C,uBAAuB,CAAC,GAAmB,IAAI,CAAC;IAChD,iBAAiB,CAAC,GAAmB,IAAI,CAAC;IAC1C,oBAAoB,CAAC,IAAa,EAAE,SAAiB,EAAE,QAAkB,IAAI,CAAC;IACrF,2FAA2F;IACpF,uBAAuB,CAC5B,EAAkB,EAAE,MAAe,EAAE,MAAe,EAAE,UAAkB,EAAE,SAAiB,EAAE,SAAiB;QAE9G,MAAM,cAAc,GAAG,MAAM,CAAC,KAAK,EAAE,CAAC;QACtC,MAAM,cAAc,GAAG,MAAM,CAAC,KAAK,EAAE,CAAC;QACtC,IAAI,EAAE,GAAG,IAAI,CAAC,oBAAoB,CAAC;QACnC,IAAI,UAAU,IAAI,CAAC,EAAE;YACnB,IAAI,CAAC,oBAAoB,IAAI,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;YACrD,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,YAAY,CAAC,SAAS,EAAE,SAAS,EAAE,EAAE,EAAE,IAAI,CAAC,oBAAoB,EAAE,EAAE,EAC3F,eAAO,CAAC,MAAM,CAAC,cAAc,EAAE,cAAc,CAAC,CAAC,CAAC,CAAC;SACpD;aAAM;YACL,IAAI,EAAE,CAAC;YACP,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,SAAS,EAAE,CAAC,IAAI,UAAU,EAAE,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE;gBAC7D,EAAE,GAAG,mBAAQ,CAAC,WAAW,CAAC,SAAS,EAAE,CAAC,GAAG,UAAU,EAAE,SAAS,CAAC,CAAC;gBAChE,MAAM,CAAC,WAAW,CAAC,EAAE,EAAE,MAAM,EAAE,cAAc,CAAC,CAAC;gBAC/C,EAAE,GAAG,IAAI,CAAC,oBAAoB,CAAC;gBAC/B,IAAI,CAAC,oBAAoB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC;gBAC3E,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,YAAY,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,oBAAoB,EAAE,EAAE,EAC7E,eAAO,CAAC,MAAM,CAAC,cAAc,EAAE,cAAc,CAAC,CAAC,CAAC,CAAC;gBACnD,cAAc,CAAC,OAAO,CAAC,cAAc,CAAC,CAAC;aACxC;SACF;IACH,CAAC;IACM,qCAAqC,CAC1C,EAAkB,EAAE,UAAkB,EAAE,SAAiB,EAAE,SAAiB;QAE5E,IAAI,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;QACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,SAAS,EAAE,CAAC,IAAI,UAAU,EAAE,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE;YAC7D,EAAE,GAAG,mBAAQ,CAAC,WAAW,CAAC,SAAS,EAAE,CAAC,GAAG,UAAU,EAAE,SAAS,CAAC,CAAC;YAChE,CAAC,GAAG,EAAE,CAAC,2BAA2B,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YAC3C,EAAE,GAAG,IAAI,CAAC,oBAAoB,CAAC;YAC/B,IAAI,CAAC,oBAAoB,IAAI,CAAC,CAAC;YAC/B,MAAM,KAAK,GAAG,EAAE,CAAC,qBAAqB,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YAC/C,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,YAAY,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,oBAAoB,EAAE,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC;SAC1F;IACH,CAAC;IACM,6BAA6B,KAAe,OAAO,IAAI,CAAC,CAAC,CAAC;IAC1D,MAAM,CAAC,uBAAuB,CAAC,IAAgB,EAAE,OAAuB;QAC7E,MAAM,OAAO,GAAG,IAAI,gCAAgC,EAAE,CAAC;QACvD,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE;YACjC,KAAK,CAAC,kBAAkB,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;SAC5C;QACD,MAAM,SAAS,GAAG,OAAO,CAAC,UAAU,CAAC;QACrC,OAAO,SAAS,CAAC;IACnB,CAAC;CACF;AACD;;;;;;;;GAQG;AACH,MAAa,2BAA4B,SAAQ,+BAAc;IAM7D,uDAAuD;IAChD,mBAAmB,CAAC,KAAoB;QAC7C,OAAO,KAAK,YAAY,2BAA2B,CAAC;IACtD,CAAC;IACD,4FAA4F;IAC5F,YAAoB,IAAgB,EAAE,SAAyB;QAC7D,KAAK,EAAE,CAAC;QAXV,wCAAwC;QACxB,uBAAkB,GAAG,6BAA6B,CAAC;QAWjE,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;QAC5B,IAAI,CAAC,YAAY,GAAG,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC;IAChG,CAAC;IACD;;;OAGG;IACI,gBAAgB,CAAC,SAAoB;QAC1C,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QAC7B,IAAI,CAAC,YAAY,4BAAU,IAAI,CAAC,CAAC,mBAAmB,CAAC,SAAS,CAAC;YAC7D,OAAO,2BAA2B,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;QACtD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;OAGG;IACH,IAAW,IAAI;QACb,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IACD;;;OAGG;IACH,IAAW,SAAS;QAClB,OAAO,IAAI,CAAC,UAAU,CAAC;IACzB,CAAC;IACD,0BAA0B;IACnB,KAAK;QACV,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,EAAgB,CAAC;QAC3C,OAAO,2BAA2B,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;IACtD,CAAC;IACD,0BAA0B;IACV,iBAAiB,CAAC,SAAiB,EAAE,SAAiB;QACpE,IAAI,SAAS,KAAK,SAAS;YACzB,OAAO,SAAS,CAAC;QACnB,IAAI,KAAK,GAAG,SAAS,CAAC;QACtB,IAAI,KAAK,GAAG,SAAS,CAAC;QACtB,MAAM,QAAQ,GAAG,SAAS,GAAG,SAAS,CAAC;QACvC,IAAI,QAAQ,EAAE;YACZ,KAAK,GAAG,SAAS,CAAC;YAClB,KAAK,GAAG,SAAS,CAAC;SACnB;QACD,MAAM,cAAc,GAAG,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC;QACjD,MAAM,cAAc,GAAG,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC;QACjD,MAAM,SAAS,GAAG,IAAI,CAAC,uBAAuB,CAAC,cAAc,EAAE,IAAI,CAAC,CAAC;QACrE,IAAI,SAAS,KAAK,SAAS;YACzB,OAAO,SAAS,CAAC;QACnB,MAAM,SAAS,GAAG,IAAI,CAAC,uBAAuB,CAAC,cAAc,EAAE,IAAI,CAAC,CAAC;QACrE,IAAI,SAAS,KAAK,SAAS;YACzB,OAAO,SAAS,CAAC;QACnB,MAAM,gBAAgB,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,SAAS,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;QAC3E,IAAI,SAAS,KAAK,gBAAgB;YAChC,OAAO,SAAS,CAAC;QACnB,MAAM,gBAAgB,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,SAAS,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;QAC3E,IAAI,SAAS,KAAK,gBAAgB;YAChC,OAAO,SAAS,CAAC;QACnB,MAAM,cAAc,GAAG,SAAS,CAAC,oCAAoC,CAAC,cAAc,EAAE,IAAI,CAAC,CAAC;QAC5F,MAAM,cAAc,GAAG,SAAS,CAAC,oCAAoC,CAAC,cAAc,EAAE,IAAI,CAAC,CAAC;QAE5F,qDAAqD;QACrD,MAAM,OAAO,GAAG,WAAI,CAAC,MAAM,EAAE,CAAC;QAC9B,MAAM,eAAe,GAAG,CACtB,UAA0B,EAAE,cAAsB,EAAE,cAAsB,EAAE,aAAsB,EACzF,EAAE;YACX,IAAI,cAAc,KAAK,cAAc;gBACnC,OAAO,KAAK,CAAC;YACf,IAAI,QAAQ,CAAC;YACb,IAAI,cAAc,KAAK,GAAG,IAAI,cAAc,KAAK,GAAG,EAAE;gBACpD,QAAQ,GAAG,UAAU,CAAC,KAAK,EAAE,CAAC;gBAC9B,IAAI,aAAa;oBACf,QAAQ,CAAC,cAAc,EAAE,CAAC;aAC7B;iBAAM;gBACL,QAAQ,GAAG,aAAa,CAAC,CAAC;oBACxB,UAAU,CAAC,iBAAiB,CAAC,cAAc,EAAE,cAAc,CAAC;oBAC5D,CAAC,CAAC,UAAU,CAAC,iBAAiB,CAAC,cAAc,EAAE,cAAc,CAAC,CAAC;aAClE;YACD,IAAI,QAAQ,EAAE;gBACZ,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBAChC,OAAO,IAAI,CAAC;aACb;YACD,OAAO,KAAK,CAAC;QACf,CAAC,CAAC;QACF,IAAI,SAAS,CAAC,UAAU,KAAK,SAAS,CAAC,UAAU,EAAE;YACjD,+CAA+C;YAC/C,IAAI,eAAe,CAAC,SAAS,CAAC,UAAU,EAAE,cAAc,EAAE,cAAc,EAAE,QAAQ,CAAC;gBACjF,OAAO,2BAA2B,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC,wDAAwD;YACrH,OAAO,SAAS,CAAC;SAClB;QACD,eAAe,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,gBAAgB,CAAC,EAAE,cAAc,EAAE,GAAG,EAAE,QAAQ,CAAC,CAAC;QACtF,mDAAmD;QACnD,KAAK,IAAI,UAAU,GAAG,gBAAgB,GAAG,CAAC,EAAE,UAAU,GAAG,gBAAgB,EAAE,UAAU,EAAE,EAAE;YACvF,eAAe,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,UAAU,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,QAAQ,CAAC,CAAC;SACtE;QACD,eAAe,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,gBAAgB,CAAC,EAAE,GAAG,EAAE,cAAc,EAAE,QAAQ,CAAC,CAAC;QACtF,wEAAwE;QACxE,IAAI,QAAQ;YACV,OAAO,CAAC,QAAQ,CAAC,OAAO,EAAE,CAAC;QAC7B,OAAO,2BAA2B,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;IAC5D,CAAC;IACD;;;OAGG;IACI,SAAS,CAAC,KAAmC;QAClD,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE;YACnC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC;gBACrB,OAAO,KAAK,CAAC;SAChB;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IACD,yGAAyG;IACzF,UAAU,CAAC,MAAgB;QACzC,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC;QAC7C,IAAI,CAAC;YACH,OAAO,CAAC,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;QAC9B,OAAO,yBAAO,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;IACpC,CAAC;IACD,qGAAqG;IACrF,QAAQ,CAAC,MAAgB;QACvC,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9C,IAAI,CAAC;YACH,OAAO,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QAC5B,OAAO,yBAAO,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;IACpC,CAAC;IACD,gDAAgD;IACzC,WAAW,CAAC,IAAkB,EAAE,OAAuB;QAC5D,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE;YACnC,CAAC,CAAC,WAAW,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;SAC9B;IACH,CAAC;IACD;;;OAGG;IACI,kBAAkB,CAAC,IAAoB,EAAE,OAAuB;QACrE,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE;YACnC,CAAC,CAAC,kBAAkB,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;SACrC;IACH,CAAC;IACD;;;OAGG;IACI,4BAA4B,CAAC,OAAuB;QACzD,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE;YACnC,SAAS,IAAI,CAAC,CAAC,4BAA4B,CAAC,OAAO,CAAC,CAAC;SACtD;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;OAMG;IACa,wBAAwB,CACtC,cAAgC,EAAE,6BAAsC,KAAK,EAAE,qBAA8B,KAAK;QAElH,IAAI,0BAA0B,EAAE;YAC9B,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE;gBACnC,CAAC,CAAC,wBAAwB,CAAC,cAAc,EAAE,0BAA0B,EAAE,kBAAkB,CAAC,CAAC;aAC5F;SACF;aAAM;YACL,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;SAC3B;IACH,CAAC;IACD;;;;OAIG;IACa,qCAAqC,CAAC,OAAuB,EAAE,eAAgC;QAC7G,MAAM,KAAK,GAAG,+BAAc,CAAC,yCAAyC,CAAC,IAAI,EAAE,eAAe,CAAC,CAAC;QAC9F,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE;YACnC,CAAC,CAAC,qCAAqC,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;SACzD;QACD,+BAAc,CAAC,qBAAqB,CAAC,IAAI,EAAE,KAAK,EAAE,eAAe,CAAC,CAAC;IACrE,CAAC;IACD;;;OAGG;IACI,yBAAyB,CAAC,OAAwB;QACvD,OAAO,IAAI,CAAC,KAAK,CAAC,yBAAyB,CAAC,OAAO,CAAC,CAAC;IACvD,CAAC;IACD,mGAAmG;IAC5F,WAAW,CAAC,aAAsB,EAAE,SAAqB;QAC9D,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,aAAa,EAAE,SAAS,CAAC,CAAC;IACnD,CAAC;IACD;;;;OAIG;IACa,2BAA2B,CAAC,SAAiB,EAAE,SAAiB;QAC9E,OAAO,IAAI,CAAC,GAAG,CAAC,SAAS,GAAG,SAAS,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC;IAC7D,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,aAAa,CAAC,IAAgB,EAAE,OAAuB;QACnE,MAAM,SAAS,GAAG,gCAAgC,CAAC,uBAAuB,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QAC1F,MAAM,MAAM,GAAG,IAAI,2BAA2B,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;QAChE,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;OAIG;IACI,uBAAuB,CAAC,QAAgB,EAAE,qBAA8B,KAAK;QAClF,MAAM,CAAC,GAAG,IAAI,CAAC,4BAA4B,CAAC,QAAQ,EAAE,kBAAkB,CAAC,CAAC;QAC1E,IAAI,SAAS,KAAK,CAAC;YACjB,OAAO,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QAC5B,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;OAIG;IACO,4BAA4B,CAAC,QAAgB,EAAE,qBAA8B,KAAK;QAC1F,MAAM,YAAY,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC;QAC5C,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC;QAClC,IAAI,YAAY,GAAG,CAAC,EAAE;YACpB,IAAI,QAAQ,GAAG,GAAG;gBAChB,OAAO,kBAAkB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;YAC5C,IAAI,QAAQ,GAAG,IAAI,CAAC,YAAY;gBAC9B,OAAO,kBAAkB,CAAC,CAAC,CAAC,CAAC,YAAY,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;YAC7D,wBAAwB;YACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,EAAE,CAAC,EAAE,EAAE;gBACrC,IAAI,SAAS,CAAC,CAAC,CAAC,CAAC,qBAAqB,CAAC,QAAQ,CAAC;oBAAE,OAAO,CAAC,CAAC;aAC5D;SACF;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;OAGG;IACI,4BAA4B,CAAC,QAAgB;QAClD,OAAO,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC;IACtC,CAAC;IACD;;;;OAIG;IACI,+BAA+B,CAAC,KAAqB,EAAE,QAAgB;QAC5E,MAAM,YAAY,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC;QAC5C,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC;QAClC,IAAI,YAAY,GAAG,CAAC,EAAE;YACpB,wBAAwB;YACxB,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE;gBAChC,IAAI,QAAQ,CAAC,kCAAkC,CAAC,KAAK,EAAE,QAAQ,CAAC;oBAC9D,OAAO,QAAQ,CAAC;aACnB;YACD,IAAI,QAAQ,IAAI,CAAC;gBACf,OAAO,SAAS,CAAC,CAAC,CAAC,CAAC;YACtB,IAAI,QAAQ,GAAG,GAAG;gBAChB,OAAO,SAAS,CAAC,YAAY,GAAG,CAAC,CAAC,CAAC;SACtC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,0CAA0C;IAC1B,WAAW;QACzB,OAAO,IAAI,CAAC,YAAY,CAAC;IAC3B,CAAC;IACD;;;OAGG;IACI,WAAW;QAChB,OAAO,IAAI,CAAC,YAAY,CAAC;IAC3B,CAAC;IACD;;;;OAIG;IACI,eAAe,CAAC,QAAgB,EAAE,MAAgB;QACvD,MAAM,aAAa,GAAG,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC;QACnD,MAAM,QAAQ,GAAG,IAAI,CAAC,uBAAuB,CAAC,aAAa,EAAE,IAAI,CAAC,CAAC;QACnE,IAAI,QAAQ,EAAE;YACZ,MAAM,aAAa,GAAG,QAAQ,CAAC,oCAAoC,CAAC,aAAa,EAAE,IAAI,CAAC,CAAC;YACzF,OAAO,QAAQ,CAAC,UAAU,CAAC,eAAe,CAAC,aAAa,EAAE,MAAM,CAAC,CAAC;SACnE;QACD,wCAAwC;QACxC,mEAAmE;QACnE,OAAO,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,eAAe,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;IACpE,CAAC;IACD;;;;;;;OAOG;IACI,4BAA4B,CAAC,QAAgB,EAAE,MAAc;QAClE,MAAM,iBAAiB,GAAG,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC;QACvD,MAAM,QAAQ,GAAG,IAAI,CAAC,uBAAuB,CAAC,iBAAiB,EAAE,IAAI,CAAE,CAAC;QACxE,MAAM,aAAa,GAAG,QAAQ,CAAC,oCAAoC,CAAC,iBAAiB,EAAE,IAAI,CAAC,CAAC;QAC7F,MAAM,GAAG,QAAQ,CAAC,UAAU,CAAC,4BAA4B,CAAC,aAAa,EAAE,MAAM,CAAC,CAAC;QACjF,iFAAiF;QACjF,6EAA6E;QAC7E,sEAAsE;QACtE,2CAA2C;QAC3C,MAAM,CAAC,GAAG,IAAI,CAAC,YAAY,GAAG,MAAM,CAAC,SAAS,CAAC,SAAS,EAAE,CAAC;QAC3D,MAAM,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QACjC,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;OAKG;IACa,6BAA6B,CAAC,QAAgB,EAAE,MAAc;QAC5E,MAAM,iBAAiB,GAAG,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC;QACvD,MAAM,QAAQ,GAAG,IAAI,CAAC,uBAAuB,CAAC,iBAAiB,EAAE,IAAI,CAAE,CAAC;QACxE,MAAM,aAAa,GAAG,QAAQ,CAAC,oCAAoC,CAAC,iBAAiB,EAAE,IAAI,CAAC,CAAC;QAC7F,MAAM,GAAG,QAAQ,CAAC,UAAU,CAAC,4BAA4B,CAAC,aAAa,EAAE,MAAM,CAAC,CAAC;QACjF,MAAM,CAAC,SAAS,CAAC,gBAAgB,EAAE,CAAC;QACpC,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;;OAMG;IACI,8BAA8B,CACnC,QAAgB,EAAE,MAAkC;QAEpD,MAAM,iBAAiB,GAAG,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC;QACvD,MAAM,QAAQ,GAAG,IAAI,CAAC,uBAAuB,CAAC,iBAAiB,EAAE,IAAI,CAAE,CAAC;QACxE,MAAM,aAAa,GAAG,QAAQ,CAAC,oCAAoC,CAAC,iBAAiB,EAAE,IAAI,CAAC,CAAC;QAC7F,MAAM,GAAG,QAAQ,CAAC,UAAU,CAAC,8BAA8B,CAAC,aAAa,EAAE,MAAM,CAAC,CAAC;QACnF,IAAI,CAAC,MAAM;YACT,OAAO,SAAS,CAAC;QACnB,gFAAgF;QAChF,kFAAkF;QAClF,qCAAqC;QACrC,oDAAoD;QACpD,kEAAkE;QAClE,yCAAyC;QACzC,uCAAuC;QACvC,MAAM,IAAI,GAAG,MAAM,CAAC,OAAO,CAAC,SAAS,EAAE,CAAC;QACxC,MAAM,KAAK,GAAG,IAAI,GAAG,IAAI,CAAC;QAC1B,MAAM,KAAK,GAAG,MAAM,CAAC,OAAO,CAAC,UAAU,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QACxD,MAAM,CAAC,OAAO,CAAC,gBAAgB,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC;QAChE,MAAM,KAAK,GAAG,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC;QACvC,MAAM,CAAC,OAAO,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;QACnC,MAAM,CAAC,OAAO,CAAC,YAAY,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC;QAC3C,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;OAGG;IACI,mBAAmB,CAAC,SAAoB;QAC7C,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE;YACnC,IAAI,CAAC,CAAC,CAAC,mBAAmB,CAAC,SAAS,CAAC;gBACnC,OAAO,EAAE,CAAC;SACb;QACD,OAAO,OAAO,KAAK,CAAC,CAAC;IACvB,CAAC;IACD,gGAAgG;IACzF,cAAc;QACnB,IAAI,CAAC,KAAK,CAAC,sBAAsB,EAAE,CAAC;QACpC,MAAM,WAAW,GAAG,IAAI,CAAC,YAAY,CAAC;QACtC,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,UAAU,EAAE;YACtC,QAAQ,CAAC,4BAA4B,CAAC,WAAW,CAAC,CAAC;SACpD;QACD,IAAI,CAAC,UAAU,CAAC,OAAO,EAAE,CAAC;IAC5B,CAAC;IACD;;;;;OAKG;IACa,aAAa,CAAC,KAAoB;QAChD,IAAI,KAAK,YAAY,2BAA2B,EAAE;YAChD,OAAO,mBAAQ,CAAC,gBAAgB,CAAC,IAAI,CAAC,YAAY,EAAE,KAAK,CAAC,YAAY,CAAC;mBAClE,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;SAC5C;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;OAKG;IACa,8BAA8B,CAC5C,aAAqB,EAAE,cAAsB,EAAE,cAAuB,EAAE,MAA4B;QAEpG,MAAM,SAAS,GAAG,aAAa,GAAG,IAAI,CAAC,YAAY,CAAC;QACpD,MAAM,SAAS,GAAG,SAAS,GAAG,cAAc,CAAC;QAC7C,MAAM,SAAS,GAAG,IAAI,CAAC,uBAAuB,CAAC,SAAS,EAAE,IAAI,CAAE,CAAC;QACjE,MAAM,WAAW,GAAG,SAAS,CAAC,UAAU,CAAC,8BAA8B,CAAC,SAAS,CAAC,cAAc,EAAE,SAAS,GAAG,SAAS,CAAC,cAAc,EAAE,cAAc,EAAE,MAAM,CAAC,CAAC;QAChK,MAAM,WAAW,GAAG,aAAa,GAAG,CAAC,cAAc,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC;QACzE,MAAM,WAAW,GAAG,yCAAmB,CAAC,mCAAmC,CAAC,cAAc,EAAE,IAAI,EAAE,aAAa,EAAE,WAAW,EAAE,cAAc,EAAE,MAAM,CAAC,CAAC;QACtJ,WAAW,CAAC,WAAW,GAAG,WAAW,CAAC;QACtC,OAAO,WAAW,CAAC;IACrB,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,yBAAyB,CACrC,QAAiB,IAAI;QAErB,MAAM,CAAC,GAAG;YACR,QAAQ,EAAE,IAAI,CAAC,SAAS;YACxB,SAAS,EAAE,IAAI,CAAC,UAAU;YAC1B,WAAW,EAAE,IAAI,CAAC,YAAY;YAC9B,YAAY,EAAE,IAAI,CAAC,aAAa;SACjC,CAAC;QACF,IAAI,KAAK,EAAE;YACT,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,aAAa,GAAG,CAAC,CAAC;SAC9D;QACD,OAAO,CAAC,CAAC;IACX,CAAC;IAKD;;;;;;;;;OASG;IACa,YAAY,CAC1B,UAAmB,EAAE,MAAmC;QAExD,IAAI,WAA4C,CAAC;QACjD,IAAI,IAAI,GAAG,MAAM,CAAC,SAAS,CAAC;QAC5B,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;QAC9C,IAAI,WAAW,KAAK,CAAC,EAAE;YACrB,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,UAAU,EAAE,MAAM,CAAC,CAAC;SACtE;aAAM;YACL,MAAM,eAAe,GAAG,YAAY,CAAC,8BAA8B,CAAC,IAAI,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC;YACjG,MAAM,OAAO,GAAG,CAAC,oCAAkB,CAAC,mDAAmD,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,iCAAe,CAAC,IAAI,CAAC,CAAC;YAC1H,MAAM,OAAO,GAAG,CAAC,iCAAe,CAAC,IAAI,EAAE,oCAAkB,CAAC,mDAAmD,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC;YAC1H,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YACrC,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAC9D,2BAA2B,CAAC,SAAS,EAAE,CAAC;YACxC,2BAA2B,CAAC,aAAa,IAAI,eAAe,CAAC,MAAM,CAAC;YACpE,KAAK,MAAM,CAAC,IAAI,eAAe,EAAE;gBAC/B,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI;oBACZ,MAAM;gBACR,2BAA2B,CAAC,UAAU,EAAE,CAAC;gBACzC,MAAM,KAAK,GAAG,CAAC,CAAC,UAAU,CAAC;gBAC3B,MAAM,OAAO,GAAG,KAAK,CAAC,YAAY,CAAC,UAAU,EAC3C,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;gBACjE,IAAI,OAAO,IAAI,OAAO,CAAC,CAAC,GAAG,IAAI,EAAE;oBAC/B,IAAI,GAAG,OAAO,CAAC,CAAC,CAAC;oBACjB,WAAW,GAAG,yCAAmB,CAAC,wBAAwB,CAAC,OAAO,CAAC,KAAK,EAAE,OAAO,CAAC,QAAQ,EAAE,OAAO,CAAC,KAAK,EAAE,WAAW,CAAE,CAAC;oBACzH,WAAW,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC;oBAC1B,2BAA2B,CAAC,YAAY,EAAE,CAAC;iBAC5C;aACF;SACF;QACD,IAAI,CAAC,WAAW;YACd,OAAO,SAAS,CAAC;QACnB,MAAM,QAAQ,GAAG,IAAI,CAAC,+BAA+B,CAAC,WAAW,CAAC,KAAM,EAAE,WAAW,CAAC,QAAQ,CAAC,CAAC;QAChG,IAAI,QAAQ,EAAE;YACZ,MAAM,aAAa,GAAG,QAAQ,CAAC,4BAA4B,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;YAClF,MAAM,aAAa,GAAG,IAAI,CAAC,4BAA4B,CAAC,aAAa,CAAC,CAAC;YACvE,MAAM,WAAW,GAAG,yCAAmB,CAAC,wBAAwB,CAAC,IAAI,EAAE,aAAa,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC;YACzG,WAAW,CAAC,WAAW,GAAG,WAAW,CAAC;YACtC,WAAW,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC;YAC9B,OAAO,WAAW,CAAC;SACpB;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;OAKG;IACa,iBAAiB,CAC/B,uBAA+C;QAE/C,MAAM,OAAO,GAAG,6BAAa,CAAC,MAAM,CAAC,uBAAuB,CAAC,CAAC;QAC9D,MAAM,OAAO,GAAqB,EAAE,CAAC;QACrC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,sBAAsB,CAAC,SAAS,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE;YACrE,MAAM,MAAM,GAAG,IAAI,CAAC,iBAAiB,CAAC,OAAO,CAAC,CAAC;YAC/C,IAAI,MAAM,KAAK,SAAS,EAAE;gBACxB,IAAI,MAAM,YAAY,+BAAc;oBAClC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;qBAClB,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC;oBAC5B,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;aAC5C;SACF;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IACD;;;;;;;OAOG;IACa,uBAAuB,CAAC,GAAqB,EAAE,OAAiB;QAC9E,OAAO,qDAAyB,CAAC,kCAAkC,CAAC,IAAI,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;IAC1F,CAAC;;AA1Fc,qCAAS,GAAG,CAAC,AAAJ,CAAK;AACd,sCAAU,GAAG,CAAC,AAAJ,CAAK;AACf,wCAAY,GAAG,CAAC,AAAJ,CAAK;AACjB,yCAAa,GAAG,CAAC,AAAJ,CAAK;AAtctB,kEAA2B","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n\r\n/** @packageDocumentation\r\n * @module Curve\r\n */\r\n\r\nimport { CurvePrimitive } from \"../curve/CurvePrimitive\";\r\nimport { StrokeCountMap } from \"../curve/Query/StrokeCountMap\";\r\nimport { Geometry } from \"../Geometry\";\r\nimport { GeometryHandler, IStrokeHandler } from \"../geometry3d/GeometryHandler\";\r\nimport { Plane3dByOriginAndUnitNormal } from \"../geometry3d/Plane3dByOriginAndUnitNormal\";\r\nimport { Plane3dByOriginAndVectors } from \"../geometry3d/Plane3dByOriginAndVectors\";\r\nimport { Point3d, Vector3d } from \"../geometry3d/Point3dVector3d\";\r\nimport { Range1d, Range3d } from \"../geometry3d/Range\";\r\nimport { Ray3d } from \"../geometry3d/Ray3d\";\r\nimport { Transform } from \"../geometry3d/Transform\";\r\nimport { CurveChain } from \"./CurveCollection\";\r\nimport { CurveExtendMode, CurveExtendOptions, VariantCurveExtendParameter } from \"./CurveExtendMode\";\r\nimport { CurveLocationDetail } from \"./CurveLocationDetail\";\r\nimport { GeometryQuery } from \"./GeometryQuery\";\r\nimport { PlaneAltitudeRangeContext } from \"./internalContexts/PlaneAltitudeRangeContext\";\r\nimport { LineString3d } from \"./LineString3d\";\r\nimport { OffsetOptions } from \"./OffsetOptions\";\r\nimport { Path } from \"./Path\";\r\nimport { StrokeOptions } from \"./StrokeOptions\";\r\n\r\n/**\r\n * Annotation of an interval of a curve.\r\n * * The interval is marked with two pairs of numbers:\r\n * * * fraction0, fraction1 = fraction parameters along the child curve\r\n * * * distance0,distance1 = distances within containing CurveChainWithDistanceIndex\r\n * @public\r\n */\r\nexport class PathFragment {\r\n /** Distance along parent to this fragment start */\r\n public chainDistance0: number;\r\n /** Distance along parent to this fragment end */\r\n public chainDistance1: number;\r\n /** Fractional position of this fragment start within its curve primitive. */\r\n public childFraction0: number;\r\n /** Fractional position of this fragment end within its curve primitive.. */\r\n public childFraction1: number;\r\n /** Curve primitive of this fragment, as presented in stroker. Note that this might have become a proxy. */\r\n public childCurve: CurvePrimitive;\r\n /** Optional range */\r\n public range?: Range3d;\r\n /** Working var for use in searches. */\r\n public a: number;\r\n /** Create a fragment with complete fraction, distance and child data. */\r\n public constructor(\r\n childFraction0: number, childFraction1: number,\r\n distance0: number, distance1: number,\r\n childCurve: CurvePrimitive, range?: Range3d,\r\n ) {\r\n this.childFraction0 = childFraction0;\r\n this.childFraction1 = childFraction1;\r\n this.chainDistance0 = distance0;\r\n this.chainDistance1 = distance1;\r\n this.childCurve = childCurve;\r\n this.range = range;\r\n this.a = 0;\r\n }\r\n /**\r\n * Return true if the distance is within the distance limits of this fragment.\r\n * @param distance\r\n */\r\n public containsChainDistance(distance: number): boolean {\r\n return distance >= this.chainDistance0 && distance <= this.chainDistance1;\r\n }\r\n /** Return a quick distance to the curve. This may be SMALLER than true distance but may not be larger */\r\n public quickMinDistanceToChildCurve(spacePoint: Point3d): number {\r\n if (this.range) {\r\n return this.range.distanceToPoint(spacePoint);\r\n }\r\n // ugh. have to do real computation ..\r\n const detail = this.childCurve.closestPoint(spacePoint, false);\r\n if (detail)\r\n return detail.a;\r\n return 0;\r\n }\r\n /**\r\n * Return an array with (references to) all the path fragments, sorted smallest to largest on the \"a\" value\r\n * equal to the quick min distance to the fragment\r\n */\r\n public static collectSortedQuickMinDistances(fragments: PathFragment[], spacePoint: Point3d): PathFragment[] {\r\n const sortedFragments: PathFragment[] = [];\r\n for (const f of fragments) {\r\n f.a = f.quickMinDistanceToChildCurve(spacePoint);\r\n sortedFragments.push(f);\r\n }\r\n sortedFragments.sort((a: PathFragment, b: PathFragment) => a.a - b.a);\r\n return sortedFragments;\r\n }\r\n /**\r\n * Return true if this fragment addresses `curve` and brackets `fraction`\r\n * @param distance\r\n */\r\n public containsChildCurveAndChildFraction(curve: CurvePrimitive, fraction: number): boolean {\r\n return this.childCurve === curve && fraction >= this.childFraction0 && fraction <= this.childFraction1;\r\n }\r\n /**\r\n * Convert distance to local fraction, and apply that to interpolate between the stored curve fractions.\r\n * Note that proportional calculation does NOT account for nonuniform parameterization in the child curve.\r\n */\r\n public chainDistanceToInterpolatedChildFraction(distance: number): number {\r\n return Geometry.inverseInterpolate(\r\n this.childFraction0, this.chainDistance0,\r\n this.childFraction1, this.chainDistance1,\r\n distance, this.childFraction0)!; // the interval \"must\" have nonzero length, division should be safe . ..\r\n }\r\n /** Convert chainDistance to true chidFraction, using detailed moveSignedDistanceFromFraction */\r\n public chainDistanceToAccurateChildFraction(chainDistance: number, allowExtrapolation?: boolean): number {\r\n // The fragments are really expected to do good mappings in their distance range ...\r\n const childDetail = this.childCurve.moveSignedDistanceFromFraction(\r\n this.childFraction0, chainDistance - this.chainDistance0, allowExtrapolation ?? false);\r\n return childDetail.fraction;\r\n }\r\n /**\r\n * Return the scale factor to map childCurve fraction derivatives to chain fraction derivatives\r\n * @param globalDistance total length of the global curve.\r\n */\r\n public fractionScaleFactor(globalDistance: number): number {\r\n return globalDistance * (this.childFraction1 - this.childFraction0) / (this.chainDistance1 - this.chainDistance0);\r\n }\r\n /**\r\n * Reverse the fraction and distance data.\r\n * * each child fraction `f` is replaced by `1-f`\r\n * * each `chainDistance` is replaced by `totalDistance-chainDistance`\r\n */\r\n public reverseFractionsAndDistances(totalDistance: number) {\r\n const f0 = this.childFraction0;\r\n const f1 = this.childFraction1;\r\n const d0 = this.chainDistance0;\r\n const d1 = this.chainDistance1;\r\n this.childFraction0 = 1.0 - f1;\r\n this.childFraction1 = 1.0 - f0;\r\n this.chainDistance0 = totalDistance - d1;\r\n this.chainDistance1 = totalDistance - d0;\r\n }\r\n /** @deprecated in 3.x. Use childFractionToChainDistance */\r\n public childFractionTChainDistance(fraction: number): number {\r\n return this.childFractionToChainDistance(fraction);\r\n }\r\n /**\r\n * Convert a fractional position on the childCurve to distance in the chain space.\r\n * * Return value is SIGNED -- will be negative when fraction < this.childFraction0.\r\n * @param fraction fraction along the curve within this fragment\r\n */\r\n public childFractionToChainDistance(fraction: number): number {\r\n let d = this.childCurve.curveLengthBetweenFractions(this.childFraction0, fraction);\r\n if (fraction < this.childFraction0)\r\n d = -d;\r\n return this.chainDistance0 + d;\r\n }\r\n}\r\n\r\n/** Non-instantiable class to build a distance index for a path. */\r\nclass DistanceIndexConstructionContext implements IStrokeHandler {\r\n private _fragments: PathFragment[];\r\n private _accumulatedDistance: number;\r\n private constructor() {\r\n this._accumulatedDistance = 0;\r\n this._fragments = [];\r\n }\r\n // ignore curve announcements -- they are repeated in stroke announcements\r\n public startParentCurvePrimitive(_cp: CurvePrimitive) { }\r\n public startCurvePrimitive(_cp: CurvePrimitive) { }\r\n public endParentCurvePrimitive(_cp: CurvePrimitive) { }\r\n public endCurvePrimitive(_cp: CurvePrimitive) { }\r\n public announcePointTangent(_xyz: Point3d, _fraction: number, _tangent: Vector3d) { }\r\n /** Announce numPoints interpolated between point0 and point1, with associated fractions */\r\n public announceSegmentInterval(\r\n cp: CurvePrimitive, point0: Point3d, point1: Point3d, numStrokes: number, fraction0: number, fraction1: number,\r\n ): void {\r\n const fragmentPoint0 = point0.clone();\r\n const fragmentPoint1 = point1.clone();\r\n let d0 = this._accumulatedDistance;\r\n if (numStrokes <= 1) {\r\n this._accumulatedDistance += point0.distance(point1);\r\n this._fragments.push(new PathFragment(fraction0, fraction1, d0, this._accumulatedDistance, cp,\r\n Range3d.create(fragmentPoint0, fragmentPoint1)));\r\n } else {\r\n let f1;\r\n for (let i = 1, f0 = fraction0; i <= numStrokes; i++, f0 = f1) {\r\n f1 = Geometry.interpolate(fraction0, i / numStrokes, fraction1);\r\n point0.interpolate(f1, point1, fragmentPoint1);\r\n d0 = this._accumulatedDistance;\r\n this._accumulatedDistance += (Math.abs(f1 - f0) * point0.distance(point1));\r\n this._fragments.push(new PathFragment(f0, f1, d0, this._accumulatedDistance, cp,\r\n Range3d.create(fragmentPoint0, fragmentPoint1)));\r\n fragmentPoint0.setFrom(fragmentPoint1);\r\n }\r\n }\r\n }\r\n public announceIntervalForUniformStepStrokes(\r\n cp: CurvePrimitive, numStrokes: number, fraction0: number, fraction1: number,\r\n ): void {\r\n let f1, d, d0;\r\n for (let i = 1, f0 = fraction0; i <= numStrokes; i++, f0 = f1) {\r\n f1 = Geometry.interpolate(fraction0, i / numStrokes, fraction1);\r\n d = cp.curveLengthBetweenFractions(f0, f1);\r\n d0 = this._accumulatedDistance;\r\n this._accumulatedDistance += d;\r\n const range = cp.rangeBetweenFractions(f0, f1);\r\n this._fragments.push(new PathFragment(f0, f1, d0, this._accumulatedDistance, cp, range));\r\n }\r\n }\r\n public needPrimaryGeometryForStrokes?(): boolean { return true; }\r\n public static createPathFragmentIndex(path: CurveChain, options?: StrokeOptions): PathFragment[] {\r\n const handler = new DistanceIndexConstructionContext();\r\n for (const curve of path.children) {\r\n curve.emitStrokableParts(handler, options);\r\n }\r\n const fragments = handler._fragments;\r\n return fragments;\r\n }\r\n}\r\n/**\r\n * `CurveChainWithDistanceIndex` is a CurvePrimitive whose fractional parameterization is proportional to true\r\n * distance along a CurveChain.\r\n * * For example if the total length of the chain is `L`, then the distance along the chain from parameters `t0`\r\n * to `t1` is easily computed as `L*(t1-t0)`.\r\n * * The curve chain can be any type derived from CurveChain.\r\n * * * i.e. either a `Path` or a `Loop`\r\n * @public\r\n */\r\nexport class CurveChainWithDistanceIndex extends CurvePrimitive {\r\n /** String name for schema properties */\r\n public readonly curvePrimitiveType = \"curveChainWithDistanceIndex\";\r\n private readonly _path: CurveChain;\r\n private readonly _fragments: PathFragment[];\r\n private readonly _totalLength: number; // matches final fragment distance1.\r\n /** Test if other is a `CurveChainWithDistanceIndex` */\r\n public isSameGeometryClass(other: GeometryQuery): boolean {\r\n return other instanceof CurveChainWithDistanceIndex;\r\n }\r\n // final assembly of CurveChainWithDistanceIndex -- caller must create valid fragment index.\r\n private constructor(path: CurveChain, fragments: PathFragment[]) {\r\n super();\r\n this._path = path;\r\n this._fragments = fragments;\r\n this._totalLength = fragments.length > 0 ? fragments[fragments.length - 1].chainDistance1 : 0;\r\n }\r\n /**\r\n * Create a clone, transformed and with its own distance index.\r\n * @param transform transform to apply in the clone.\r\n */\r\n public cloneTransformed(transform: Transform): CurveChainWithDistanceIndex | undefined {\r\n const c = this._path.clone();\r\n if (c instanceof CurveChain && c.tryTransformInPlace(transform))\r\n return CurveChainWithDistanceIndex.createCapture(c);\r\n return undefined;\r\n }\r\n /**\r\n * Reference to the contained path.\r\n * * Do not modify the path. The distance index will be wrong.\r\n */\r\n public get path(): CurveChain {\r\n return this._path;\r\n }\r\n /**\r\n * Reference to the fragments array.\r\n * * Do not modify.\r\n */\r\n public get fragments(): PathFragment[] {\r\n return this._fragments;\r\n }\r\n /** Return a deep clone */\r\n public clone(): CurveChainWithDistanceIndex {\r\n const c = this._path.clone() as CurveChain;\r\n return CurveChainWithDistanceIndex.createCapture(c);\r\n }\r\n /** Return a deep clone */\r\n public override clonePartialCurve(fractionA: number, fractionB: number): CurveChainWithDistanceIndex | undefined {\r\n if (fractionA === fractionB)\r\n return undefined;\r\n let fracA = fractionA;\r\n let fracB = fractionB;\r\n const reversed = fractionA > fractionB;\r\n if (reversed) {\r\n fracA = fractionB;\r\n fracB = fractionA;\r\n }\r\n const chainDistanceA = fracA * this._totalLength;\r\n const chainDistanceB = fracB * this._totalLength;\r\n const fragmentA = this.chainDistanceToFragment(chainDistanceA, true);\r\n if (undefined === fragmentA)\r\n return undefined;\r\n const fragmentB = this.chainDistanceToFragment(chainDistanceB, true);\r\n if (undefined === fragmentB)\r\n return undefined;\r\n const childCurveIndexA = this._path.childIndex(fragmentA.childCurve, true);\r\n if (undefined === childCurveIndexA)\r\n return undefined;\r\n const childCurveIndexB = this._path.childIndex(fragmentB.childCurve, true);\r\n if (undefined === childCurveIndexB)\r\n return undefined;\r\n const childFractionA = fragmentA.chainDistanceToAccurateChildFraction(chainDistanceA, true);\r\n const childFractionB = fragmentB.chainDistanceToAccurateChildFraction(chainDistanceB, true);\r\n\r\n // add a (possibly reversed) partial clone to newPath\r\n const newPath = Path.create();\r\n const addPartialChild = (\r\n childCurve: CurvePrimitive, childFraction0: number, childFraction1: number, reversedClone: boolean,\r\n ): boolean => {\r\n if (childFraction0 === childFraction1)\r\n return false;\r\n let newCurve;\r\n if (childFraction0 === 0.0 && childFraction1 === 1.0) {\r\n newCurve = childCurve.clone();\r\n if (reversedClone)\r\n newCurve.reverseInPlace();\r\n } else {\r\n newCurve = reversedClone ?\r\n childCurve.clonePartialCurve(childFraction1, childFraction0)\r\n : childCurve.clonePartialCurve(childFraction0, childFraction1);\r\n }\r\n if (newCurve) {\r\n newPath.children.push(newCurve);\r\n return true;\r\n }\r\n return false;\r\n };\r\n if (fragmentA.childCurve === fragmentB.childCurve) {\r\n // the two distances are within the same curve.\r\n if (addPartialChild(fragmentA.childCurve, childFractionA, childFractionB, reversed))\r\n return CurveChainWithDistanceIndex.createCapture(newPath); // singleton -- children[] does not need to be reversed.\r\n return undefined;\r\n }\r\n addPartialChild(this._path.children[childCurveIndexA], childFractionA, 1.0, reversed);\r\n // at least two distinct children are impacted ....\r\n for (let childIndex = childCurveIndexA + 1; childIndex < childCurveIndexB; childIndex++) {\r\n addPartialChild(this._path.children[childIndex], 0.0, 1.0, reversed);\r\n }\r\n addPartialChild(this._path.children[childCurveIndexB], 0.0, childFractionB, reversed);\r\n // This reverses array entries but not orientation within each curve ...\r\n if (reversed)\r\n newPath.children.reverse();\r\n return CurveChainWithDistanceIndex.createCapture(newPath);\r\n }\r\n /**\r\n * Ask if the curve is within tolerance of a plane.\r\n * @returns Returns true if the curve is completely within tolerance of the plane.\r\n */\r\n public isInPlane(plane: Plane3dByOriginAndUnitNormal): boolean {\r\n for (const c of this._path.children) {\r\n if (!c.isInPlane(plane))\r\n return false;\r\n }\r\n return true;\r\n }\r\n /** Return the start point of the primitive. The default implementation returns fractionToPoint (0.0) */\r\n public override startPoint(result?: Point3d): Point3d {\r\n const c = this._path.cyclicCurvePrimitive(0);\r\n if (c)\r\n return c.startPoint(result);\r\n return Point3d.createZero(result);\r\n }\r\n /** Return the end point of the primitive. The default implementation returns fractionToPoint(1.0) */\r\n public override endPoint(result?: Point3d): Point3d {\r\n const c = this._path.cyclicCurvePrimitive(-1);\r\n if (c)\r\n return c.endPoint(result);\r\n return Point3d.createZero(result);\r\n }\r\n /** Add strokes to caller-supplied linestring */\r\n public emitStrokes(dest: LineString3d, options?: StrokeOptions): void {\r\n for (const c of this._path.children) {\r\n c.emitStrokes(dest, options);\r\n }\r\n }\r\n /**\r\n * Ask the curve to announce points and simple subcurve fragments for stroking.\r\n * See IStrokeHandler for description of the sequence of the method calls.\r\n */\r\n public emitStrokableParts(dest: IStrokeHandler, options?: StrokeOptions): void {\r\n for (const c of this._path.children) {\r\n c.emitStrokableParts(dest, options);\r\n }\r\n }\r\n /**\r\n * Return the stroke count required for given options.\r\n * @param options StrokeOptions that determine count\r\n */\r\n public computeStrokeCountForOptions(options?: StrokeOptions): number {\r\n let numStroke = 0;\r\n for (const c of this._path.children) {\r\n numStroke += c.computeStrokeCountForOptions(options);\r\n }\r\n return numStroke;\r\n }\r\n /**\r\n * Return an array containing only the curve primitives.\r\n * @param collectorArray array to receive primitives (pushed -- the array is not cleared)\r\n * @param smallestPossiblePrimitives if true, recurse on the (otherwise hidden) children. If false, only push `this`.\r\n * @param explodeLinestrings (if smallestPossiblePrimitives is true) whether to push a [[LineSegment3d]] for each\r\n * segment of a [[LineString3d]] child. If false, push only the [[LineString3d]].\r\n */\r\n public override collectCurvePrimitivesGo(\r\n collectorArray: CurvePrimitive[], smallestPossiblePrimitives: boolean = false, explodeLineStrings: boolean = false,\r\n ): void {\r\n if (smallestPossiblePrimitives) {\r\n for (const c of this._path.children) {\r\n c.collectCurvePrimitivesGo(collectorArray, smallestPossiblePrimitives, explodeLineStrings);\r\n }\r\n } else {\r\n collectorArray.push(this);\r\n }\r\n }\r\n /**\r\n * Construct StrokeCountMap for each child, accumulating data to stroke count map for this primitive.\r\n * @param options StrokeOptions that determine count\r\n * @param parentStrokeMap evolving parent map.\r\n */\r\n public override computeAndAttachRecursiveStrokeCounts(options?: StrokeOptions, parentStrokeMap?: StrokeCountMap) {\r\n const myMap = StrokeCountMap.createWithCurvePrimitiveAndOptionalParent(this, parentStrokeMap);\r\n for (const c of this._path.children) {\r\n c.computeAndAttachRecursiveStrokeCounts(options, myMap);\r\n }\r\n CurvePrimitive.installStrokeCountMap(this, myMap, parentStrokeMap);\r\n }\r\n /**\r\n * Second step of double dispatch: call `this._path.dispatchToGeometryHandler (handler)`\r\n * * Note that this exposes the children individually to the handler.\r\n */\r\n public dispatchToGeometryHandler(handler: GeometryHandler): any {\r\n return this._path.dispatchToGeometryHandler(handler);\r\n }\r\n /** Extend (increase) `rangeToExtend` as needed to include these curves (optionally transformed) */\r\n public extendRange(rangeToExtend: Range3d, transform?: Transform): void {\r\n this._path.extendRange(rangeToExtend, transform);\r\n }\r\n /**\r\n * Curve length is always positive.\r\n * @returns Returns a (high accuracy) length of the curve between fractional positions\r\n * @returns Returns the length of the curve.\r\n */\r\n public override curveLengthBetweenFractions(fraction0: number, fraction1: number): number {\r\n return Math.abs(fraction1 - fraction0) * this._totalLength;\r\n }\r\n /**\r\n * Capture (not clone) a path into a new `CurveChainWithDistanceIndex`\r\n * @param path primitive array to be CAPTURED (not cloned)\r\n */\r\n public static createCapture(path: CurveChain, options?: StrokeOptions): CurveChainWithDistanceIndex {\r\n const fragments = DistanceIndexConstructionContext.createPathFragmentIndex(path, options);\r\n const result = new CurveChainWithDistanceIndex(path, fragments);\r\n return result;\r\n }\r\n /**\r\n * Resolve a fraction of the CurveChain to a PathFragment\r\n * @param distance\r\n * @param allowExtrapolation\r\n */\r\n public chainDistanceToFragment(distance: number, allowExtrapolation: boolean = false): PathFragment | undefined {\r\n const i = this.chainDistanceToFragmentIndex(distance, allowExtrapolation);\r\n if (undefined !== i)\r\n return this._fragments[i];\r\n return undefined;\r\n }\r\n /**\r\n * Resolve a fraction of the CurveChain to a PathFragment index\r\n * @param distance\r\n * @param allowExtrapolation\r\n */\r\n protected chainDistanceToFragmentIndex(distance: number, allowExtrapolation: boolean = false): number | undefined {\r\n const numFragments = this._fragments.length;\r\n const fragments = this._fragments;\r\n if (numFragments > 0) {\r\n if (distance < 0.0)\r\n return allowExtrapolation ? 0 : undefined;\r\n if (distance > this._totalLength)\r\n return allowExtrapolation ? (numFragments - 1) : undefined;\r\n // humbug, linear search\r\n for (let i = 0; i < numFragments; i++) {\r\n if (fragments[i].containsChainDistance(distance)) return i;\r\n }\r\n }\r\n return undefined;\r\n }\r\n /**\r\n * Convert distance along the chain to fraction along the chain.\r\n * @param distance distance along the chain\r\n */\r\n public chainDistanceToChainFraction(distance: number): number {\r\n return distance / this._totalLength;\r\n }\r\n /**\r\n * Resolve a fraction within a specific curve to a fragment.\r\n * @param curve\r\n * @param fraction\r\n */\r\n public curveAndChildFractionToFragment(curve: CurvePrimitive, fraction: number): PathFragment | undefined {\r\n const numFragments = this._fragments.length;\r\n const fragments = this._fragments;\r\n if (numFragments > 0) {\r\n // humbug, linear search\r\n for (const fragment of fragments) {\r\n if (fragment.containsChildCurveAndChildFraction(curve, fraction))\r\n return fragment;\r\n }\r\n if (fraction <= 0)\r\n return fragments[0];\r\n if (fraction > 1.0)\r\n return fragments[numFragments - 1];\r\n }\r\n return undefined;\r\n }\r\n /** Returns the total length of curves. */\r\n public override curveLength(): number {\r\n return this._totalLength;\r\n }\r\n /**\r\n * Returns the total length of the path.\r\n * * This is exact (and simple property lookup) because the true lengths were summed at construction time.\r\n */\r\n public quickLength(): number {\r\n return this._totalLength;\r\n }\r\n /**\r\n * Return the point (x,y,z) on the curve at fractional position along the chain.\r\n * @param fraction fractional position along the geometry.\r\n * @returns Returns a point on the curve.\r\n */\r\n public fractionToPoint(fraction: number, result?: Point3d): Point3d {\r\n const chainDistance = fraction * this._totalLength;\r\n const fragment = this.chainDistanceToFragment(chainDistance, true);\r\n if (fragment) {\r\n const childFraction = fragment.chainDistanceToAccurateChildFraction(chainDistance, true);\r\n return fragment.childCurve.fractionToPoint(childFraction, result);\r\n }\r\n // no fragment found. Use _fragments[0]\r\n // fragment = this.chainDistanceToFragment(chainDistance, true);\r\n return this._fragments[0].childCurve.fractionToPoint(0.0, result);\r\n }\r\n /**\r\n * Return the point (x,y,z) and derivative on the curve at fractional position.\r\n * * Note that this derivative is \"derivative of xyz with respect to fraction.\"\r\n * * this derivative shows the speed of the \"fractional point\" moving along the curve.\r\n * * this is not generally a unit vector. use fractionToPointAndUnitTangent for a unit vector.\r\n * @param fraction fractional position along the geometry.\r\n * @returns Returns a ray whose origin is the curve point and direction is the derivative with respect to the fraction.\r\n */\r\n public fractionToPointAndDerivative(fraction: number, result?: Ray3d): Ray3d {\r\n const distanceAlongPath = fraction * this._totalLength;\r\n const fragment = this.chainDistanceToFragment(distanceAlongPath, true)!;\r\n const curveFraction = fragment.chainDistanceToAccurateChildFraction(distanceAlongPath, true);\r\n result = fragment.childCurve.fractionToPointAndDerivative(curveFraction, result);\r\n // Fractional arc length parameterization for the curve C is f=f(t)=s(t)/L, where\r\n // L is total length of C, f'=||C'||/L, and inverse t=t(f), t'=1/f'=L/||C'||.\r\n // Then d/df(C(t(f)))=C't'=C'L/||C'||. The fragment gave us C', so the\r\n // derivative we seek is just a scale away.\r\n const a = this._totalLength / result.direction.magnitude();\r\n result.direction.scaleInPlace(a);\r\n return result;\r\n }\r\n /**\r\n * Returns a ray whose origin is the curve point and direction is the unit tangent.\r\n * @param fraction fractional position on the curve\r\n * @param result optional receiver for the result.\r\n * Returns a ray whose origin is the curve point and direction is the unit tangent.\r\n */\r\n public override fractionToPointAndUnitTangent(fraction: number, result?: Ray3d): Ray3d {\r\n const distanceAlongPath = fraction * this._totalLength;\r\n const fragment = this.chainDistanceToFragment(distanceAlongPath, true)!;\r\n const curveFraction = fragment.chainDistanceToAccurateChildFraction(distanceAlongPath, true);\r\n result = fragment.childCurve.fractionToPointAndDerivative(curveFraction, result);\r\n result.direction.normalizeInPlace();\r\n return result;\r\n }\r\n /**\r\n * Return a plane with\r\n * * origin at fractional position along the curve\r\n * * vectorU is the first derivative, i.e. tangent vector with length equal to the rate of change with respect to\r\n * the fraction.\r\n * * vectorV is the second derivative, i.e.derivative of vectorU.\r\n */\r\n public fractionToPointAnd2Derivatives(\r\n fraction: number, result?: Plane3dByOriginAndVectors,\r\n ): Plane3dByOriginAndVectors | undefined {\r\n const distanceAlongPath = fraction * this._totalLength;\r\n const fragment = this.chainDistanceToFragment(distanceAlongPath, true)!;\r\n const curveFraction = fragment.chainDistanceToAccurateChildFraction(distanceAlongPath, true);\r\n result = fragment.childCurve.fractionToPointAnd2Derivatives(curveFraction, result);\r\n if (!result)\r\n return undefined;\r\n // See fractionToPointAndDerivative for derivation of d/df(C(t(f)))=L C'/||C'||.\r\n // For the 2nd deriv, use quotient rule, d/dt||x(t)||=x.x'/||x|| and ||x||^2=x.x :\r\n // d/df(C'(t(f))) = L d/df(C'/||C'||)\r\n // = L (||C'|| d/df(C') - C' d/df||C'||) / ||C'||^2\r\n // = L (||C'|| C\" L/||C'|| - C' C'.C\"/||C'|| L/||C'||) / ||C'||^2\r\n // = (L/||C'||)^2 (C\" - C' C'.C\"/C'.C' )\r\n // We have C' and C\" from the fragment.\r\n const magU = result.vectorU.magnitude();\r\n const dotUU = magU * magU;\r\n const dotUV = result.vectorU.dotProduct(result.vectorV);\r\n result.vectorV.addScaledInPlace(result.vectorU, -dotUV / dotUU);\r\n const scale = this._totalLength / magU;\r\n result.vectorU.scaleInPlace(scale);\r\n result.vectorV.scaleInPlace(scale * scale);\r\n return result;\r\n }\r\n /**\r\n * Attempt to transform in place.\r\n * * Warning: If any child fails, this object becomes invalid. But that should never happen.\r\n */\r\n public tryTransformInPlace(transform: Transform): boolean {\r\n let numFail = 0;\r\n for (const c of this._path.children) {\r\n if (!c.tryTransformInPlace(transform))\r\n numFail++;\r\n }\r\n return numFail === 0;\r\n }\r\n /** Reverse the curve's data so that its fractional stroking moves in the opposite direction. */\r\n public reverseInPlace(): void {\r\n this._path.reverseChildrenInPlace();\r\n const totalLength = this._totalLength;\r\n for (const fragment of this._fragments) {\r\n fragment.reverseFractionsAndDistances(totalLength);\r\n }\r\n this._fragments.reverse();\r\n }\r\n /**\r\n * Test for equality conditions:\r\n * * Mismatched totalLength is a quick exit condition\r\n * * If totalLength matches, recurse to the path for matching primitives.\r\n * @param other\r\n */\r\n public override isAlmostEqual(other: GeometryQuery): boolean {\r\n if (other instanceof CurveChainWithDistanceIndex) {\r\n return Geometry.isSameCoordinate(this._totalLength, other._totalLength)\r\n && this._path.isAlmostEqual(other._path);\r\n }\r\n return false;\r\n }\r\n /**\r\n * Implement moveSignedDistanceFromFraction.\r\n * * See `CurvePrimitive` for parameter details.\r\n * * The returned location directly identifies fractional position along the CurveChainWithDistanceIndex, and\r\n * has pointer to an additional detail for the child curve.\r\n */\r\n public override moveSignedDistanceFromFraction(\r\n startFraction: number, signedDistance: number, allowExtension: boolean, result?: CurveLocationDetail,\r\n ): CurveLocationDetail {\r\n const distanceA = startFraction * this._totalLength;\r\n const distanceB = distanceA + signedDistance;\r\n const fragmentB = this.chainDistanceToFragment(distanceB, true)!;\r\n const childDetail = fragmentB.childCurve.moveSignedDistanceFromFraction(fragmentB.childFraction0, distanceB - fragmentB.chainDistance0, allowExtension, result);\r\n const endFraction = startFraction + (signedDistance / this._totalLength);\r\n const chainDetail = CurveLocationDetail.createConditionalMoveSignedDistance(allowExtension, this, startFraction, endFraction, signedDistance, result);\r\n chainDetail.childDetail = childDetail;\r\n return chainDetail;\r\n }\r\n /**\r\n * The returned object has\r\n * * numCalls = number of times closestPoint was called.\r\n * * numCurvesTested = number of curves tested with full closestPoint\r\n * * numAssigned = number of times a new minimum value was recorded\r\n * * numCandidate = number of curves that would be tested in worst case.\r\n * return an object summarizing closest point test counts\r\n * @param clear if true, counts are cleared after the return object is formed.\r\n */\r\n public static getClosestPointTestCounts(\r\n clear: boolean = true,\r\n ): { numCalls: number, numTested: number, numAssigned: number, numCandidate: number } {\r\n const a = {\r\n numCalls: this._numCalls,\r\n numTested: this._numTested,\r\n numAssigned: this._numAssigned,\r\n numCandidate: this._numCandidate,\r\n };\r\n if (clear) {\r\n this._numTested = this._numAssigned = this._numCandidate = 0;\r\n }\r\n return a;\r\n }\r\n private static _numCalls = 0;\r\n private static _numTested = 0;\r\n private static _numAssigned = 0;\r\n private static _numCandidate = 0;\r\n /**\r\n * Search for the curve point that is closest to the spacePoint.\r\n * * The CurveChainWithDistanceIndex invokes the base class CurvePrimitive method, which\r\n * (via a handler) determines a CurveLocation detail among the children.\r\n * * The returned detail directly identifies fractional position along the CurveChainWithDistanceIndex, and\r\n * has pointer to an additional detail for the child curve.\r\n * @param spacePoint point in space\r\n * @param extend true to extend the curve\r\n * @returns Returns a CurveLocationDetail structure that holds the details of the close point.\r\n */\r\n public override closestPoint(\r\n spacePoint: Point3d, extend: VariantCurveExtendParameter,\r\n ): CurveLocationDetail | undefined {\r\n let childDetail: CurveLocationDetail | undefined;\r\n let aMin = Number.MAX_VALUE;\r\n const numChildren = this.path.children.length;\r\n if (numChildren === 1) {\r\n childDetail = this.path.children[0].closestPoint(spacePoint, extend);\r\n } else {\r\n const sortedFragments = PathFragment.collectSortedQuickMinDistances(this._fragments, spacePoint);\r\n const extend0 = [CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(extend, 0), CurveExtendMode.None];\r\n const extend1 = [CurveExtendMode.None, CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(extend, 1)];\r\n const fragment0 = this._fragments[0];\r\n const fragment1 = this._fragments[this._fragments.length - 1];\r\n CurveChainWithDistanceIndex._numCalls++;\r\n CurveChainWithDistanceIndex._numCandidate += sortedFragments.length;\r\n for (const f of sortedFragments) {\r\n if (f.a > aMin)\r\n break;\r\n CurveChainWithDistanceIndex._numTested++;\r\n const child = f.childCurve;\r\n const detailA = child.closestPoint(spacePoint,\r\n f === fragment0 ? extend0 : f === fragment1 ? extend1 : false);\r\n if (detailA && detailA.a < aMin) {\r\n aMin = detailA.a;\r\n childDetail = CurveLocationDetail.createCurveFractionPoint(detailA.curve, detailA.fraction, detailA.point, childDetail)!;\r\n childDetail.a = detailA.a;\r\n CurveChainWithDistanceIndex._numAssigned++;\r\n }\r\n }\r\n }\r\n if (!childDetail)\r\n return undefined;\r\n const fragment = this.curveAndChildFractionToFragment(childDetail.curve!, childDetail.fraction);\r\n if (fragment) {\r\n const chainDistance = fragment.childFractionToChainDistance(childDetail.fraction);\r\n const chainFraction = this.chainDistanceToChainFraction(chainDistance);\r\n const chainDetail = CurveLocationDetail.createCurveFractionPoint(this, chainFraction, childDetail.point);\r\n chainDetail.childDetail = childDetail;\r\n chainDetail.a = childDetail.a;\r\n return chainDetail;\r\n }\r\n return undefined;\r\n }\r\n /**\r\n * Construct an offset of each child as viewed in the xy-plane (ignoring z).\r\n * * No attempt is made to join the offset children. Use RegionOps.constructCurveXYOffset() to return a fully\r\n * joined offset.\r\n * @param offsetDistanceOrOptions offset distance (positive to left of the instance curve), or options object\r\n */\r\n public override constructOffsetXY(\r\n offsetDistanceOrOptions: number | OffsetOptions,\r\n ): CurvePrimitive | CurvePrimitive[] | undefined {\r\n const options = OffsetOptions.create(offsetDistanceOrOptions);\r\n const offsets: CurvePrimitive[] = [];\r\n for (const prim of this.collectCurvePrimitives(undefined, true, true)) {\r\n const offset = prim.constructOffsetXY(options);\r\n if (offset !== undefined) {\r\n if (offset instanceof CurvePrimitive)\r\n offsets.push(offset);\r\n else if (Array.isArray(offset))\r\n offset.forEach((cp) => offsets.push(cp));\r\n }\r\n }\r\n return offsets;\r\n }\r\n /**\r\n * Project instance geometry (via dispatch) onto the given ray, and return the extreme fractional parameters of\r\n * projection.\r\n * @param ray ray onto which the instance is projected. A `Vector3d` is treated as a `Ray3d` with zero origin.\r\n * @param lowHigh optional receiver for output\r\n * @returns range of fractional projection parameters onto the ray, where 0.0 is start of the ray and 1.0 is the\r\n * end of the ray.\r\n */\r\n public override projectedParameterRange(ray: Vector3d | Ray3d, lowHigh?: Range1d): Range1d | undefined {\r\n return PlaneAltitudeRangeContext.findExtremeFractionsAlongDirection(this, ray, lowHigh);\r\n }\r\n}\r\n"]}
|
|
1
|
+
{"version":3,"file":"CurveChainWithDistanceIndex.js","sourceRoot":"","sources":["../../../src/curve/CurveChainWithDistanceIndex.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F;;GAEG;AAEH,4DAAyD;AACzD,kEAA+D;AAC/D,0CAAuC;AAIvC,mEAAkE;AAClE,+CAAuD;AAGvD,uDAA+C;AAC/C,uDAAqG;AACrG,+DAA4D;AAE5D,4FAAyF;AAEzF,mDAAgD;AAChD,iCAA8B;AAG9B;;;;;;GAMG;AACH,MAAa,YAAY;IAevB,yEAAyE;IACzE,YACE,cAAsB,EAAE,cAAsB,EAC9C,SAAiB,EAAE,SAAiB,EACpC,UAA0B,EAAE,KAAe;QAE3C,IAAI,CAAC,cAAc,GAAG,cAAc,CAAC;QACrC,IAAI,CAAC,cAAc,GAAG,cAAc,CAAC;QACrC,IAAI,CAAC,cAAc,GAAG,SAAS,CAAC;QAChC,IAAI,CAAC,cAAc,GAAG,SAAS,CAAC;QAChC,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;QAC7B,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;IACb,CAAC;IACD;;;OAGG;IACI,qBAAqB,CAAC,QAAgB;QAC3C,OAAO,QAAQ,IAAI,IAAI,CAAC,cAAc,IAAI,QAAQ,IAAI,IAAI,CAAC,cAAc,CAAC;IAC5E,CAAC;IACD,0GAA0G;IACnG,4BAA4B,CAAC,UAAmB;QACrD,IAAI,IAAI,CAAC,KAAK,EAAE;YACd,OAAO,IAAI,CAAC,KAAK,CAAC,eAAe,CAAC,UAAU,CAAC,CAAC;SAC/C;QACD,uCAAuC;QACvC,MAAM,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC,YAAY,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;QAC/D,IAAI,MAAM;YACR,OAAO,MAAM,CAAC,CAAC,CAAC;QAClB,OAAO,CAAC,CAAC;IACX,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,8BAA8B,CAAC,SAAyB,EAAE,UAAmB;QACzF,MAAM,eAAe,GAAmB,EAAE,CAAC;QAC3C,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE;YACzB,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,4BAA4B,CAAC,UAAU,CAAC,CAAC;YACjD,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;SACzB;QACD,eAAe,CAAC,IAAI,CAAC,CAAC,CAAe,EAAE,CAAe,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACtE,OAAO,eAAe,CAAC;IACzB,CAAC;IACD;;;OAGG;IACI,kCAAkC,CAAC,KAAqB,EAAE,QAAgB;QAC/E,OAAO,IAAI,CAAC,UAAU,KAAK,KAAK,IAAI,QAAQ,IAAI,IAAI,CAAC,cAAc,IAAI,QAAQ,IAAI,IAAI,CAAC,cAAc,CAAC;IACzG,CAAC;IACD;;;OAGG;IACI,wCAAwC,CAAC,QAAgB;QAC9D,OAAO,mBAAQ,CAAC,kBAAkB,CAChC,IAAI,CAAC,cAAc,EAAE,IAAI,CAAC,cAAc,EACxC,IAAI,CAAC,cAAc,EAAE,IAAI,CAAC,cAAc,EACxC,QAAQ,EAAE,IAAI,CAAC,cAAc,CAAE,CAAC,CAAC,wEAAwE;IAC7G,CAAC;IACD,gGAAgG;IACzF,oCAAoC,CAAC,aAAqB,EAAE,kBAA4B;QAC7F,oFAAoF;QACpF,MAAM,WAAW,GAAG,IAAI,CAAC,UAAU,CAAC,8BAA8B,CAChE,IAAI,CAAC,cAAc,EAAE,aAAa,GAAG,IAAI,CAAC,cAAc,EAAE,kBAAkB,IAAI,KAAK,CAAC,CAAC;QACzF,OAAO,WAAW,CAAC,QAAQ,CAAC;IAC9B,CAAC;IACD;;;OAGG;IACI,mBAAmB,CAAC,cAAsB;QAC/C,OAAO,cAAc,GAAG,CAAC,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC,cAAc,CAAC,CAAC;IACpH,CAAC;IACD;;;;OAIG;IACI,4BAA4B,CAAC,aAAqB;QACvD,MAAM,EAAE,GAAG,IAAI,CAAC,cAAc,CAAC;QAC/B,MAAM,EAAE,GAAG,IAAI,CAAC,cAAc,CAAC;QAC/B,MAAM,EAAE,GAAG,IAAI,CAAC,cAAc,CAAC;QAC/B,MAAM,EAAE,GAAG,IAAI,CAAC,cAAc,CAAC;QAC/B,IAAI,CAAC,cAAc,GAAG,GAAG,GAAG,EAAE,CAAC;QAC/B,IAAI,CAAC,cAAc,GAAG,GAAG,GAAG,EAAE,CAAC;QAC/B,IAAI,CAAC,cAAc,GAAG,aAAa,GAAG,EAAE,CAAC;QACzC,IAAI,CAAC,cAAc,GAAG,aAAa,GAAG,EAAE,CAAC;IAC3C,CAAC;IACD,2DAA2D;IACpD,2BAA2B,CAAC,QAAgB;QACjD,OAAO,IAAI,CAAC,4BAA4B,CAAC,QAAQ,CAAC,CAAC;IACrD,CAAC;IACD;;;;OAIG;IACI,4BAA4B,CAAC,QAAgB;QAClD,IAAI,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,2BAA2B,CAAC,IAAI,CAAC,cAAc,EAAE,QAAQ,CAAC,CAAC;QACnF,IAAI,QAAQ,GAAG,IAAI,CAAC,cAAc;YAChC,CAAC,GAAG,CAAC,CAAC,CAAC;QACT,OAAO,IAAI,CAAC,cAAc,GAAG,CAAC,CAAC;IACjC,CAAC;CACF;AAzHD,oCAyHC;AAED,mEAAmE;AACnE,MAAM,gCAAgC;IAGpC;QACE,IAAI,CAAC,oBAAoB,GAAG,CAAC,CAAC;QAC9B,IAAI,CAAC,UAAU,GAAG,EAAE,CAAC;IACvB,CAAC;IACD,0EAA0E;IACnE,yBAAyB,CAAC,GAAmB,IAAI,CAAC;IAClD,mBAAmB,CAAC,GAAmB,IAAI,CAAC;IAC5C,uBAAuB,CAAC,GAAmB,IAAI,CAAC;IAChD,iBAAiB,CAAC,GAAmB,IAAI,CAAC;IAC1C,oBAAoB,CAAC,IAAa,EAAE,SAAiB,EAAE,QAAkB,IAAI,CAAC;IACrF,2FAA2F;IACpF,uBAAuB,CAC5B,EAAkB,EAAE,MAAe,EAAE,MAAe,EAAE,UAAkB,EAAE,SAAiB,EAAE,SAAiB;QAE9G,MAAM,cAAc,GAAG,MAAM,CAAC,KAAK,EAAE,CAAC;QACtC,MAAM,cAAc,GAAG,MAAM,CAAC,KAAK,EAAE,CAAC;QACtC,IAAI,EAAE,GAAG,IAAI,CAAC,oBAAoB,CAAC;QACnC,IAAI,UAAU,IAAI,CAAC,EAAE;YACnB,IAAI,CAAC,oBAAoB,IAAI,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;YACrD,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,YAAY,CAAC,SAAS,EAAE,SAAS,EAAE,EAAE,EAAE,IAAI,CAAC,oBAAoB,EAAE,EAAE,EAC3F,eAAO,CAAC,MAAM,CAAC,cAAc,EAAE,cAAc,CAAC,CAAC,CAAC,CAAC;SACpD;aAAM;YACL,IAAI,EAAE,CAAC;YACP,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,SAAS,EAAE,CAAC,IAAI,UAAU,EAAE,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE;gBAC7D,EAAE,GAAG,mBAAQ,CAAC,WAAW,CAAC,SAAS,EAAE,CAAC,GAAG,UAAU,EAAE,SAAS,CAAC,CAAC;gBAChE,MAAM,CAAC,WAAW,CAAC,EAAE,EAAE,MAAM,EAAE,cAAc,CAAC,CAAC;gBAC/C,EAAE,GAAG,IAAI,CAAC,oBAAoB,CAAC;gBAC/B,IAAI,CAAC,oBAAoB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC;gBAC3E,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,YAAY,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,oBAAoB,EAAE,EAAE,EAC7E,eAAO,CAAC,MAAM,CAAC,cAAc,EAAE,cAAc,CAAC,CAAC,CAAC,CAAC;gBACnD,cAAc,CAAC,OAAO,CAAC,cAAc,CAAC,CAAC;aACxC;SACF;IACH,CAAC;IACM,qCAAqC,CAC1C,EAAkB,EAAE,UAAkB,EAAE,SAAiB,EAAE,SAAiB;QAE5E,IAAI,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;QACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,SAAS,EAAE,CAAC,IAAI,UAAU,EAAE,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE;YAC7D,EAAE,GAAG,mBAAQ,CAAC,WAAW,CAAC,SAAS,EAAE,CAAC,GAAG,UAAU,EAAE,SAAS,CAAC,CAAC;YAChE,CAAC,GAAG,EAAE,CAAC,2BAA2B,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YAC3C,EAAE,GAAG,IAAI,CAAC,oBAAoB,CAAC;YAC/B,IAAI,CAAC,oBAAoB,IAAI,CAAC,CAAC;YAC/B,MAAM,KAAK,GAAG,EAAE,CAAC,qBAAqB,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YAC/C,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,YAAY,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,oBAAoB,EAAE,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC;SAC1F;IACH,CAAC;IACM,6BAA6B,KAAe,OAAO,IAAI,CAAC,CAAC,CAAC;IAC1D,MAAM,CAAC,uBAAuB,CAAC,IAAgB,EAAE,OAAuB;QAC7E,MAAM,OAAO,GAAG,IAAI,gCAAgC,EAAE,CAAC;QACvD,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE;YACjC,KAAK,CAAC,kBAAkB,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;SAC5C;QACD,MAAM,SAAS,GAAG,OAAO,CAAC,UAAU,CAAC;QACrC,OAAO,SAAS,CAAC;IACnB,CAAC;CACF;AACD;;;;;;;;GAQG;AACH,MAAa,2BAA4B,SAAQ,+BAAc;IAM7D,uDAAuD;IAChD,mBAAmB,CAAC,KAAoB;QAC7C,OAAO,KAAK,YAAY,2BAA2B,CAAC;IACtD,CAAC;IACD,4FAA4F;IAC5F,YAAoB,IAAgB,EAAE,SAAyB;QAC7D,KAAK,EAAE,CAAC;QAXV,wCAAwC;QACxB,uBAAkB,GAAG,6BAA6B,CAAC;QAWjE,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;QAC5B,IAAI,CAAC,YAAY,GAAG,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC;IAChG,CAAC;IACD;;;OAGG;IACI,gBAAgB,CAAC,SAAoB;QAC1C,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QAC7B,IAAI,CAAC,YAAY,4BAAU,IAAI,CAAC,CAAC,mBAAmB,CAAC,SAAS,CAAC;YAC7D,OAAO,2BAA2B,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;QACtD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;OAGG;IACH,IAAW,IAAI;QACb,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IACD;;;OAGG;IACH,IAAW,SAAS;QAClB,OAAO,IAAI,CAAC,UAAU,CAAC;IACzB,CAAC;IACD,0BAA0B;IACnB,KAAK;QACV,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,EAAgB,CAAC;QAC3C,OAAO,2BAA2B,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;IACtD,CAAC;IACD,0BAA0B;IACV,iBAAiB,CAAC,SAAiB,EAAE,SAAiB;QACpE,IAAI,SAAS,KAAK,SAAS;YACzB,OAAO,SAAS,CAAC;QACnB,IAAI,KAAK,GAAG,SAAS,CAAC;QACtB,IAAI,KAAK,GAAG,SAAS,CAAC;QACtB,MAAM,QAAQ,GAAG,SAAS,GAAG,SAAS,CAAC;QACvC,IAAI,QAAQ,EAAE;YACZ,KAAK,GAAG,SAAS,CAAC;YAClB,KAAK,GAAG,SAAS,CAAC;SACnB;QACD,MAAM,cAAc,GAAG,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC;QACjD,MAAM,cAAc,GAAG,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC;QACjD,MAAM,SAAS,GAAG,IAAI,CAAC,uBAAuB,CAAC,cAAc,EAAE,IAAI,CAAC,CAAC;QACrE,IAAI,SAAS,KAAK,SAAS;YACzB,OAAO,SAAS,CAAC;QACnB,MAAM,SAAS,GAAG,IAAI,CAAC,uBAAuB,CAAC,cAAc,EAAE,IAAI,CAAC,CAAC;QACrE,IAAI,SAAS,KAAK,SAAS;YACzB,OAAO,SAAS,CAAC;QACnB,MAAM,gBAAgB,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,SAAS,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;QAC3E,IAAI,SAAS,KAAK,gBAAgB;YAChC,OAAO,SAAS,CAAC;QACnB,MAAM,gBAAgB,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,SAAS,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;QAC3E,IAAI,SAAS,KAAK,gBAAgB;YAChC,OAAO,SAAS,CAAC;QACnB,MAAM,cAAc,GAAG,SAAS,CAAC,oCAAoC,CAAC,cAAc,EAAE,IAAI,CAAC,CAAC;QAC5F,MAAM,cAAc,GAAG,SAAS,CAAC,oCAAoC,CAAC,cAAc,EAAE,IAAI,CAAC,CAAC;QAE5F,qDAAqD;QACrD,MAAM,OAAO,GAAG,WAAI,CAAC,MAAM,EAAE,CAAC;QAC9B,MAAM,eAAe,GAAG,CACtB,UAA0B,EAAE,cAAsB,EAAE,cAAsB,EAAE,aAAsB,EACzF,EAAE;YACX,IAAI,cAAc,KAAK,cAAc;gBACnC,OAAO,KAAK,CAAC;YACf,IAAI,QAAQ,CAAC;YACb,IAAI,cAAc,KAAK,GAAG,IAAI,cAAc,KAAK,GAAG,EAAE;gBACpD,QAAQ,GAAG,UAAU,CAAC,KAAK,EAAE,CAAC;gBAC9B,IAAI,aAAa;oBACf,QAAQ,CAAC,cAAc,EAAE,CAAC;aAC7B;iBAAM;gBACL,QAAQ,GAAG,aAAa,CAAC,CAAC;oBACxB,UAAU,CAAC,iBAAiB,CAAC,cAAc,EAAE,cAAc,CAAC;oBAC5D,CAAC,CAAC,UAAU,CAAC,iBAAiB,CAAC,cAAc,EAAE,cAAc,CAAC,CAAC;aAClE;YACD,IAAI,QAAQ,EAAE;gBACZ,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBAChC,OAAO,IAAI,CAAC;aACb;YACD,OAAO,KAAK,CAAC;QACf,CAAC,CAAC;QACF,IAAI,SAAS,CAAC,UAAU,KAAK,SAAS,CAAC,UAAU,EAAE;YACjD,+CAA+C;YAC/C,IAAI,eAAe,CAAC,SAAS,CAAC,UAAU,EAAE,cAAc,EAAE,cAAc,EAAE,QAAQ,CAAC;gBACjF,OAAO,2BAA2B,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC,wDAAwD;YACrH,OAAO,SAAS,CAAC;SAClB;QACD,eAAe,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,gBAAgB,CAAC,EAAE,cAAc,EAAE,GAAG,EAAE,QAAQ,CAAC,CAAC;QACtF,mDAAmD;QACnD,KAAK,IAAI,UAAU,GAAG,gBAAgB,GAAG,CAAC,EAAE,UAAU,GAAG,gBAAgB,EAAE,UAAU,EAAE,EAAE;YACvF,eAAe,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,UAAU,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,QAAQ,CAAC,CAAC;SACtE;QACD,eAAe,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,gBAAgB,CAAC,EAAE,GAAG,EAAE,cAAc,EAAE,QAAQ,CAAC,CAAC;QACtF,wEAAwE;QACxE,IAAI,QAAQ;YACV,OAAO,CAAC,QAAQ,CAAC,OAAO,EAAE,CAAC;QAC7B,OAAO,2BAA2B,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;IAC5D,CAAC;IACD;;;OAGG;IACI,SAAS,CAAC,KAAmC;QAClD,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE;YACnC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC;gBACrB,OAAO,KAAK,CAAC;SAChB;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IACD,yGAAyG;IACzF,UAAU,CAAC,MAAgB;QACzC,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC;QAC7C,IAAI,CAAC;YACH,OAAO,CAAC,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;QAC9B,OAAO,yBAAO,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;IACpC,CAAC;IACD,qGAAqG;IACrF,QAAQ,CAAC,MAAgB;QACvC,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9C,IAAI,CAAC;YACH,OAAO,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QAC5B,OAAO,yBAAO,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;IACpC,CAAC;IACD,gDAAgD;IACzC,WAAW,CAAC,IAAkB,EAAE,OAAuB;QAC5D,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE;YACnC,CAAC,CAAC,WAAW,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;SAC9B;IACH,CAAC;IACD;;;OAGG;IACI,kBAAkB,CAAC,IAAoB,EAAE,OAAuB;QACrE,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE;YACnC,CAAC,CAAC,kBAAkB,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;SACrC;IACH,CAAC;IACD;;;OAGG;IACI,4BAA4B,CAAC,OAAuB;QACzD,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE;YACnC,SAAS,IAAI,CAAC,CAAC,4BAA4B,CAAC,OAAO,CAAC,CAAC;SACtD;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;OAMG;IACa,wBAAwB,CACtC,cAAgC,EAAE,6BAAsC,KAAK,EAAE,qBAA8B,KAAK;QAElH,IAAI,0BAA0B,EAAE;YAC9B,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE;gBACnC,CAAC,CAAC,wBAAwB,CAAC,cAAc,EAAE,0BAA0B,EAAE,kBAAkB,CAAC,CAAC;aAC5F;SACF;aAAM;YACL,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;SAC3B;IACH,CAAC;IACD;;;;OAIG;IACa,qCAAqC,CAAC,OAAuB,EAAE,eAAgC;QAC7G,MAAM,KAAK,GAAG,+BAAc,CAAC,yCAAyC,CAAC,IAAI,EAAE,eAAe,CAAC,CAAC;QAC9F,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE;YACnC,CAAC,CAAC,qCAAqC,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;SACzD;QACD,+BAAc,CAAC,qBAAqB,CAAC,IAAI,EAAE,KAAK,EAAE,eAAe,CAAC,CAAC;IACrE,CAAC;IACD;;;OAGG;IACI,yBAAyB,CAAC,OAAwB;QACvD,OAAO,IAAI,CAAC,KAAK,CAAC,yBAAyB,CAAC,OAAO,CAAC,CAAC;IACvD,CAAC;IACD,mGAAmG;IAC5F,WAAW,CAAC,aAAsB,EAAE,SAAqB;QAC9D,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,aAAa,EAAE,SAAS,CAAC,CAAC;IACnD,CAAC;IACD;;;;OAIG;IACa,2BAA2B,CAAC,SAAiB,EAAE,SAAiB;QAC9E,OAAO,IAAI,CAAC,GAAG,CAAC,SAAS,GAAG,SAAS,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC;IAC7D,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,aAAa,CAAC,IAAgB,EAAE,OAAuB;QACnE,MAAM,SAAS,GAAG,gCAAgC,CAAC,uBAAuB,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QAC1F,MAAM,MAAM,GAAG,IAAI,2BAA2B,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;QAChE,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;OAIG;IACI,uBAAuB,CAAC,QAAgB,EAAE,qBAA8B,KAAK;QAClF,MAAM,CAAC,GAAG,IAAI,CAAC,4BAA4B,CAAC,QAAQ,EAAE,kBAAkB,CAAC,CAAC;QAC1E,IAAI,SAAS,KAAK,CAAC;YACjB,OAAO,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QAC5B,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;OAIG;IACO,4BAA4B,CAAC,QAAgB,EAAE,qBAA8B,KAAK;QAC1F,MAAM,YAAY,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC;QAC5C,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC;QAClC,IAAI,YAAY,GAAG,CAAC,EAAE;YACpB,IAAI,QAAQ,GAAG,GAAG;gBAChB,OAAO,kBAAkB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;YAC5C,IAAI,QAAQ,GAAG,IAAI,CAAC,YAAY;gBAC9B,OAAO,kBAAkB,CAAC,CAAC,CAAC,CAAC,YAAY,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;YAC7D,wBAAwB;YACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,EAAE,CAAC,EAAE,EAAE;gBACrC,IAAI,SAAS,CAAC,CAAC,CAAC,CAAC,qBAAqB,CAAC,QAAQ,CAAC;oBAAE,OAAO,CAAC,CAAC;aAC5D;SACF;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;OAGG;IACI,4BAA4B,CAAC,QAAgB;QAClD,OAAO,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC;IACtC,CAAC;IACD;;;;OAIG;IACI,+BAA+B,CAAC,KAAqB,EAAE,QAAgB;QAC5E,MAAM,YAAY,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC;QAC5C,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC;QAClC,IAAI,YAAY,GAAG,CAAC,EAAE;YACpB,wBAAwB;YACxB,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE;gBAChC,IAAI,QAAQ,CAAC,kCAAkC,CAAC,KAAK,EAAE,QAAQ,CAAC;oBAC9D,OAAO,QAAQ,CAAC;aACnB;YACD,IAAI,QAAQ,IAAI,CAAC;gBACf,OAAO,SAAS,CAAC,CAAC,CAAC,CAAC;YACtB,IAAI,QAAQ,GAAG,GAAG;gBAChB,OAAO,SAAS,CAAC,YAAY,GAAG,CAAC,CAAC,CAAC;SACtC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,0CAA0C;IAC1B,WAAW;QACzB,OAAO,IAAI,CAAC,YAAY,CAAC;IAC3B,CAAC;IACD;;;OAGG;IACI,WAAW;QAChB,OAAO,IAAI,CAAC,YAAY,CAAC;IAC3B,CAAC;IACD;;;;OAIG;IACI,eAAe,CAAC,QAAgB,EAAE,MAAgB;QACvD,MAAM,aAAa,GAAG,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC;QACnD,MAAM,QAAQ,GAAG,IAAI,CAAC,uBAAuB,CAAC,aAAa,EAAE,IAAI,CAAC,CAAC;QACnE,IAAI,QAAQ,EAAE;YACZ,MAAM,aAAa,GAAG,QAAQ,CAAC,oCAAoC,CAAC,aAAa,EAAE,IAAI,CAAC,CAAC;YACzF,OAAO,QAAQ,CAAC,UAAU,CAAC,eAAe,CAAC,aAAa,EAAE,MAAM,CAAC,CAAC;SACnE;QACD,wCAAwC;QACxC,mEAAmE;QACnE,OAAO,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,eAAe,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;IACpE,CAAC;IACD;;;;;;;OAOG;IACI,4BAA4B,CAAC,QAAgB,EAAE,MAAc;QAClE,MAAM,iBAAiB,GAAG,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC;QACvD,MAAM,QAAQ,GAAG,IAAI,CAAC,uBAAuB,CAAC,iBAAiB,EAAE,IAAI,CAAE,CAAC;QACxE,MAAM,aAAa,GAAG,QAAQ,CAAC,oCAAoC,CAAC,iBAAiB,EAAE,IAAI,CAAC,CAAC;QAC7F,MAAM,GAAG,QAAQ,CAAC,UAAU,CAAC,4BAA4B,CAAC,aAAa,EAAE,MAAM,CAAC,CAAC;QACjF,iFAAiF;QACjF,6EAA6E;QAC7E,sEAAsE;QACtE,2CAA2C;QAC3C,MAAM,CAAC,GAAG,IAAI,CAAC,YAAY,GAAG,MAAM,CAAC,SAAS,CAAC,SAAS,EAAE,CAAC;QAC3D,MAAM,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QACjC,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;OAKG;IACa,6BAA6B,CAAC,QAAgB,EAAE,MAAc;QAC5E,MAAM,iBAAiB,GAAG,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC;QACvD,MAAM,QAAQ,GAAG,IAAI,CAAC,uBAAuB,CAAC,iBAAiB,EAAE,IAAI,CAAE,CAAC;QACxE,MAAM,aAAa,GAAG,QAAQ,CAAC,oCAAoC,CAAC,iBAAiB,EAAE,IAAI,CAAC,CAAC;QAC7F,MAAM,GAAG,QAAQ,CAAC,UAAU,CAAC,4BAA4B,CAAC,aAAa,EAAE,MAAM,CAAC,CAAC;QACjF,MAAM,CAAC,SAAS,CAAC,gBAAgB,EAAE,CAAC;QACpC,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;;OAMG;IACI,8BAA8B,CACnC,QAAgB,EAAE,MAAkC;QAEpD,MAAM,iBAAiB,GAAG,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC;QACvD,MAAM,QAAQ,GAAG,IAAI,CAAC,uBAAuB,CAAC,iBAAiB,EAAE,IAAI,CAAE,CAAC;QACxE,MAAM,aAAa,GAAG,QAAQ,CAAC,oCAAoC,CAAC,iBAAiB,EAAE,IAAI,CAAC,CAAC;QAC7F,MAAM,GAAG,QAAQ,CAAC,UAAU,CAAC,8BAA8B,CAAC,aAAa,EAAE,MAAM,CAAC,CAAC;QACnF,IAAI,CAAC,MAAM;YACT,OAAO,SAAS,CAAC;QACnB,gFAAgF;QAChF,kFAAkF;QAClF,sCAAsC;QACtC,oDAAoD;QACpD,kEAAkE;QAClE,yCAAyC;QACzC,uCAAuC;QACvC,MAAM,IAAI,GAAG,MAAM,CAAC,OAAO,CAAC,SAAS,EAAE,CAAC;QACxC,MAAM,KAAK,GAAG,IAAI,GAAG,IAAI,CAAC;QAC1B,MAAM,KAAK,GAAG,MAAM,CAAC,OAAO,CAAC,UAAU,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QACxD,MAAM,CAAC,OAAO,CAAC,gBAAgB,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC;QAChE,MAAM,KAAK,GAAG,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC;QACvC,MAAM,CAAC,OAAO,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;QACnC,MAAM,CAAC,OAAO,CAAC,YAAY,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC;QAC3C,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;OAGG;IACI,mBAAmB,CAAC,SAAoB;QAC7C,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE;YACnC,IAAI,CAAC,CAAC,CAAC,mBAAmB,CAAC,SAAS,CAAC;gBACnC,OAAO,EAAE,CAAC;SACb;QACD,OAAO,OAAO,KAAK,CAAC,CAAC;IACvB,CAAC;IACD,gGAAgG;IACzF,cAAc;QACnB,IAAI,CAAC,KAAK,CAAC,sBAAsB,EAAE,CAAC;QACpC,MAAM,WAAW,GAAG,IAAI,CAAC,YAAY,CAAC;QACtC,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,UAAU,EAAE;YACtC,QAAQ,CAAC,4BAA4B,CAAC,WAAW,CAAC,CAAC;SACpD;QACD,IAAI,CAAC,UAAU,CAAC,OAAO,EAAE,CAAC;IAC5B,CAAC;IACD;;;;;OAKG;IACa,aAAa,CAAC,KAAoB;QAChD,IAAI,KAAK,YAAY,2BAA2B,EAAE;YAChD,OAAO,mBAAQ,CAAC,gBAAgB,CAAC,IAAI,CAAC,YAAY,EAAE,KAAK,CAAC,YAAY,CAAC;mBAClE,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;SAC5C;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;OAKG;IACa,8BAA8B,CAC5C,aAAqB,EAAE,cAAsB,EAAE,cAAuB,EAAE,MAA4B;QAEpG,MAAM,SAAS,GAAG,aAAa,GAAG,IAAI,CAAC,YAAY,CAAC;QACpD,MAAM,SAAS,GAAG,SAAS,GAAG,cAAc,CAAC;QAC7C,MAAM,SAAS,GAAG,IAAI,CAAC,uBAAuB,CAAC,SAAS,EAAE,IAAI,CAAE,CAAC;QACjE,MAAM,WAAW,GAAG,SAAS,CAAC,UAAU,CAAC,8BAA8B,CAAC,SAAS,CAAC,cAAc,EAAE,SAAS,GAAG,SAAS,CAAC,cAAc,EAAE,cAAc,EAAE,MAAM,CAAC,CAAC;QAChK,MAAM,WAAW,GAAG,aAAa,GAAG,CAAC,cAAc,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC;QACzE,MAAM,WAAW,GAAG,yCAAmB,CAAC,mCAAmC,CAAC,cAAc,EAAE,IAAI,EAAE,aAAa,EAAE,WAAW,EAAE,cAAc,EAAE,MAAM,CAAC,CAAC;QACtJ,WAAW,CAAC,WAAW,GAAG,WAAW,CAAC;QACtC,OAAO,WAAW,CAAC;IACrB,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,yBAAyB,CACrC,QAAiB,IAAI;QAErB,MAAM,CAAC,GAAG;YACR,QAAQ,EAAE,IAAI,CAAC,SAAS;YACxB,SAAS,EAAE,IAAI,CAAC,UAAU;YAC1B,WAAW,EAAE,IAAI,CAAC,YAAY;YAC9B,YAAY,EAAE,IAAI,CAAC,aAAa;SACjC,CAAC;QACF,IAAI,KAAK,EAAE;YACT,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,aAAa,GAAG,CAAC,CAAC;SAC9D;QACD,OAAO,CAAC,CAAC;IACX,CAAC;IAKD;;;;;;;;;OASG;IACa,YAAY,CAC1B,UAAmB,EAAE,MAAmC;QAExD,IAAI,WAA4C,CAAC;QACjD,IAAI,IAAI,GAAG,MAAM,CAAC,SAAS,CAAC;QAC5B,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;QAC9C,IAAI,WAAW,KAAK,CAAC,EAAE;YACrB,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,UAAU,EAAE,MAAM,CAAC,CAAC;SACtE;aAAM;YACL,MAAM,eAAe,GAAG,YAAY,CAAC,8BAA8B,CAAC,IAAI,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC;YACjG,MAAM,OAAO,GAAG,CAAC,oCAAkB,CAAC,mDAAmD,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,iCAAe,CAAC,IAAI,CAAC,CAAC;YAC1H,MAAM,OAAO,GAAG,CAAC,iCAAe,CAAC,IAAI,EAAE,oCAAkB,CAAC,mDAAmD,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC;YAC1H,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YACrC,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAC9D,2BAA2B,CAAC,SAAS,EAAE,CAAC;YACxC,2BAA2B,CAAC,aAAa,IAAI,eAAe,CAAC,MAAM,CAAC;YACpE,KAAK,MAAM,CAAC,IAAI,eAAe,EAAE;gBAC/B,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI;oBACZ,MAAM;gBACR,2BAA2B,CAAC,UAAU,EAAE,CAAC;gBACzC,MAAM,KAAK,GAAG,CAAC,CAAC,UAAU,CAAC;gBAC3B,MAAM,OAAO,GAAG,KAAK,CAAC,YAAY,CAAC,UAAU,EAC3C,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;gBACjE,IAAI,OAAO,IAAI,OAAO,CAAC,CAAC,GAAG,IAAI,EAAE;oBAC/B,IAAI,GAAG,OAAO,CAAC,CAAC,CAAC;oBACjB,WAAW,GAAG,yCAAmB,CAAC,wBAAwB,CAAC,OAAO,CAAC,KAAK,EAAE,OAAO,CAAC,QAAQ,EAAE,OAAO,CAAC,KAAK,EAAE,WAAW,CAAE,CAAC;oBACzH,WAAW,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC;oBAC1B,2BAA2B,CAAC,YAAY,EAAE,CAAC;iBAC5C;aACF;SACF;QACD,IAAI,CAAC,WAAW;YACd,OAAO,SAAS,CAAC;QACnB,MAAM,QAAQ,GAAG,IAAI,CAAC,+BAA+B,CAAC,WAAW,CAAC,KAAM,EAAE,WAAW,CAAC,QAAQ,CAAC,CAAC;QAChG,IAAI,QAAQ,EAAE;YACZ,MAAM,aAAa,GAAG,QAAQ,CAAC,4BAA4B,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;YAClF,MAAM,aAAa,GAAG,IAAI,CAAC,4BAA4B,CAAC,aAAa,CAAC,CAAC;YACvE,MAAM,WAAW,GAAG,yCAAmB,CAAC,wBAAwB,CAAC,IAAI,EAAE,aAAa,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC;YACzG,WAAW,CAAC,WAAW,GAAG,WAAW,CAAC;YACtC,WAAW,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC;YAC9B,OAAO,WAAW,CAAC;SACpB;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;OAKG;IACa,iBAAiB,CAC/B,uBAA+C;QAE/C,MAAM,OAAO,GAAG,6BAAa,CAAC,MAAM,CAAC,uBAAuB,CAAC,CAAC;QAC9D,MAAM,OAAO,GAAqB,EAAE,CAAC;QACrC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,sBAAsB,CAAC,SAAS,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE;YACrE,MAAM,MAAM,GAAG,IAAI,CAAC,iBAAiB,CAAC,OAAO,CAAC,CAAC;YAC/C,IAAI,MAAM,KAAK,SAAS,EAAE;gBACxB,IAAI,MAAM,YAAY,+BAAc;oBAClC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;qBAClB,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC;oBAC5B,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;aAC5C;SACF;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IACD;;;;;;;OAOG;IACa,uBAAuB,CAAC,GAAqB,EAAE,OAAiB;QAC9E,OAAO,qDAAyB,CAAC,kCAAkC,CAAC,IAAI,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;IAC1F,CAAC;;AA1Fc,qCAAS,GAAG,CAAC,AAAJ,CAAK;AACd,sCAAU,GAAG,CAAC,AAAJ,CAAK;AACf,wCAAY,GAAG,CAAC,AAAJ,CAAK;AACjB,yCAAa,GAAG,CAAC,AAAJ,CAAK;AAtctB,kEAA2B","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n\r\n/** @packageDocumentation\r\n * @module Curve\r\n */\r\n\r\nimport { CurvePrimitive } from \"../curve/CurvePrimitive\";\r\nimport { StrokeCountMap } from \"../curve/Query/StrokeCountMap\";\r\nimport { Geometry } from \"../Geometry\";\r\nimport { GeometryHandler, IStrokeHandler } from \"../geometry3d/GeometryHandler\";\r\nimport { Plane3dByOriginAndUnitNormal } from \"../geometry3d/Plane3dByOriginAndUnitNormal\";\r\nimport { Plane3dByOriginAndVectors } from \"../geometry3d/Plane3dByOriginAndVectors\";\r\nimport { Point3d, Vector3d } from \"../geometry3d/Point3dVector3d\";\r\nimport { Range1d, Range3d } from \"../geometry3d/Range\";\r\nimport { Ray3d } from \"../geometry3d/Ray3d\";\r\nimport { Transform } from \"../geometry3d/Transform\";\r\nimport { CurveChain } from \"./CurveCollection\";\r\nimport { CurveExtendMode, CurveExtendOptions, VariantCurveExtendParameter } from \"./CurveExtendMode\";\r\nimport { CurveLocationDetail } from \"./CurveLocationDetail\";\r\nimport { GeometryQuery } from \"./GeometryQuery\";\r\nimport { PlaneAltitudeRangeContext } from \"./internalContexts/PlaneAltitudeRangeContext\";\r\nimport { LineString3d } from \"./LineString3d\";\r\nimport { OffsetOptions } from \"./OffsetOptions\";\r\nimport { Path } from \"./Path\";\r\nimport { StrokeOptions } from \"./StrokeOptions\";\r\n\r\n/**\r\n * Annotation of an interval of a curve.\r\n * * The interval is marked with two pairs of numbers:\r\n * * * fraction0, fraction1 = fraction parameters along the child curve\r\n * * * distance0,distance1 = distances within containing CurveChainWithDistanceIndex\r\n * @public\r\n */\r\nexport class PathFragment {\r\n /** Distance along parent to this fragment start */\r\n public chainDistance0: number;\r\n /** Distance along parent to this fragment end */\r\n public chainDistance1: number;\r\n /** Fractional position of this fragment start within its curve primitive. */\r\n public childFraction0: number;\r\n /** Fractional position of this fragment end within its curve primitive.. */\r\n public childFraction1: number;\r\n /** Curve primitive of this fragment, as presented in stroker. Note that this might have become a proxy. */\r\n public childCurve: CurvePrimitive;\r\n /** Optional range */\r\n public range?: Range3d;\r\n /** Working var for use in searches. */\r\n public a: number;\r\n /** Create a fragment with complete fraction, distance and child data. */\r\n public constructor(\r\n childFraction0: number, childFraction1: number,\r\n distance0: number, distance1: number,\r\n childCurve: CurvePrimitive, range?: Range3d,\r\n ) {\r\n this.childFraction0 = childFraction0;\r\n this.childFraction1 = childFraction1;\r\n this.chainDistance0 = distance0;\r\n this.chainDistance1 = distance1;\r\n this.childCurve = childCurve;\r\n this.range = range;\r\n this.a = 0;\r\n }\r\n /**\r\n * Return true if the distance is within the distance limits of this fragment.\r\n * @param distance\r\n */\r\n public containsChainDistance(distance: number): boolean {\r\n return distance >= this.chainDistance0 && distance <= this.chainDistance1;\r\n }\r\n /** Return a quick distance to the curve. This may be SMALLER than true distance but may not be larger */\r\n public quickMinDistanceToChildCurve(spacePoint: Point3d): number {\r\n if (this.range) {\r\n return this.range.distanceToPoint(spacePoint);\r\n }\r\n // ugh. have to do real computation ..\r\n const detail = this.childCurve.closestPoint(spacePoint, false);\r\n if (detail)\r\n return detail.a;\r\n return 0;\r\n }\r\n /**\r\n * Return an array with (references to) all the path fragments, sorted smallest to largest on the \"a\" value\r\n * equal to the quick min distance to the fragment\r\n */\r\n public static collectSortedQuickMinDistances(fragments: PathFragment[], spacePoint: Point3d): PathFragment[] {\r\n const sortedFragments: PathFragment[] = [];\r\n for (const f of fragments) {\r\n f.a = f.quickMinDistanceToChildCurve(spacePoint);\r\n sortedFragments.push(f);\r\n }\r\n sortedFragments.sort((a: PathFragment, b: PathFragment) => a.a - b.a);\r\n return sortedFragments;\r\n }\r\n /**\r\n * Return true if this fragment addresses `curve` and brackets `fraction`\r\n * @param distance\r\n */\r\n public containsChildCurveAndChildFraction(curve: CurvePrimitive, fraction: number): boolean {\r\n return this.childCurve === curve && fraction >= this.childFraction0 && fraction <= this.childFraction1;\r\n }\r\n /**\r\n * Convert distance to local fraction, and apply that to interpolate between the stored curve fractions.\r\n * Note that proportional calculation does NOT account for nonuniform parameterization in the child curve.\r\n */\r\n public chainDistanceToInterpolatedChildFraction(distance: number): number {\r\n return Geometry.inverseInterpolate(\r\n this.childFraction0, this.chainDistance0,\r\n this.childFraction1, this.chainDistance1,\r\n distance, this.childFraction0)!; // the interval \"must\" have nonzero length, division should be safe . ..\r\n }\r\n /** Convert chainDistance to true chidFraction, using detailed moveSignedDistanceFromFraction */\r\n public chainDistanceToAccurateChildFraction(chainDistance: number, allowExtrapolation?: boolean): number {\r\n // The fragments are really expected to do good mappings in their distance range ...\r\n const childDetail = this.childCurve.moveSignedDistanceFromFraction(\r\n this.childFraction0, chainDistance - this.chainDistance0, allowExtrapolation ?? false);\r\n return childDetail.fraction;\r\n }\r\n /**\r\n * Return the scale factor to map childCurve fraction derivatives to chain fraction derivatives\r\n * @param globalDistance total length of the global curve.\r\n */\r\n public fractionScaleFactor(globalDistance: number): number {\r\n return globalDistance * (this.childFraction1 - this.childFraction0) / (this.chainDistance1 - this.chainDistance0);\r\n }\r\n /**\r\n * Reverse the fraction and distance data.\r\n * * each child fraction `f` is replaced by `1-f`\r\n * * each `chainDistance` is replaced by `totalDistance-chainDistance`\r\n */\r\n public reverseFractionsAndDistances(totalDistance: number) {\r\n const f0 = this.childFraction0;\r\n const f1 = this.childFraction1;\r\n const d0 = this.chainDistance0;\r\n const d1 = this.chainDistance1;\r\n this.childFraction0 = 1.0 - f1;\r\n this.childFraction1 = 1.0 - f0;\r\n this.chainDistance0 = totalDistance - d1;\r\n this.chainDistance1 = totalDistance - d0;\r\n }\r\n /** @deprecated in 3.x. Use childFractionToChainDistance */\r\n public childFractionTChainDistance(fraction: number): number {\r\n return this.childFractionToChainDistance(fraction);\r\n }\r\n /**\r\n * Convert a fractional position on the childCurve to distance in the chain space.\r\n * * Return value is SIGNED -- will be negative when fraction < this.childFraction0.\r\n * @param fraction fraction along the curve within this fragment\r\n */\r\n public childFractionToChainDistance(fraction: number): number {\r\n let d = this.childCurve.curveLengthBetweenFractions(this.childFraction0, fraction);\r\n if (fraction < this.childFraction0)\r\n d = -d;\r\n return this.chainDistance0 + d;\r\n }\r\n}\r\n\r\n/** Non-instantiable class to build a distance index for a path. */\r\nclass DistanceIndexConstructionContext implements IStrokeHandler {\r\n private _fragments: PathFragment[];\r\n private _accumulatedDistance: number;\r\n private constructor() {\r\n this._accumulatedDistance = 0;\r\n this._fragments = [];\r\n }\r\n // ignore curve announcements -- they are repeated in stroke announcements\r\n public startParentCurvePrimitive(_cp: CurvePrimitive) { }\r\n public startCurvePrimitive(_cp: CurvePrimitive) { }\r\n public endParentCurvePrimitive(_cp: CurvePrimitive) { }\r\n public endCurvePrimitive(_cp: CurvePrimitive) { }\r\n public announcePointTangent(_xyz: Point3d, _fraction: number, _tangent: Vector3d) { }\r\n /** Announce numPoints interpolated between point0 and point1, with associated fractions */\r\n public announceSegmentInterval(\r\n cp: CurvePrimitive, point0: Point3d, point1: Point3d, numStrokes: number, fraction0: number, fraction1: number,\r\n ): void {\r\n const fragmentPoint0 = point0.clone();\r\n const fragmentPoint1 = point1.clone();\r\n let d0 = this._accumulatedDistance;\r\n if (numStrokes <= 1) {\r\n this._accumulatedDistance += point0.distance(point1);\r\n this._fragments.push(new PathFragment(fraction0, fraction1, d0, this._accumulatedDistance, cp,\r\n Range3d.create(fragmentPoint0, fragmentPoint1)));\r\n } else {\r\n let f1;\r\n for (let i = 1, f0 = fraction0; i <= numStrokes; i++, f0 = f1) {\r\n f1 = Geometry.interpolate(fraction0, i / numStrokes, fraction1);\r\n point0.interpolate(f1, point1, fragmentPoint1);\r\n d0 = this._accumulatedDistance;\r\n this._accumulatedDistance += (Math.abs(f1 - f0) * point0.distance(point1));\r\n this._fragments.push(new PathFragment(f0, f1, d0, this._accumulatedDistance, cp,\r\n Range3d.create(fragmentPoint0, fragmentPoint1)));\r\n fragmentPoint0.setFrom(fragmentPoint1);\r\n }\r\n }\r\n }\r\n public announceIntervalForUniformStepStrokes(\r\n cp: CurvePrimitive, numStrokes: number, fraction0: number, fraction1: number,\r\n ): void {\r\n let f1, d, d0;\r\n for (let i = 1, f0 = fraction0; i <= numStrokes; i++, f0 = f1) {\r\n f1 = Geometry.interpolate(fraction0, i / numStrokes, fraction1);\r\n d = cp.curveLengthBetweenFractions(f0, f1);\r\n d0 = this._accumulatedDistance;\r\n this._accumulatedDistance += d;\r\n const range = cp.rangeBetweenFractions(f0, f1);\r\n this._fragments.push(new PathFragment(f0, f1, d0, this._accumulatedDistance, cp, range));\r\n }\r\n }\r\n public needPrimaryGeometryForStrokes?(): boolean { return true; }\r\n public static createPathFragmentIndex(path: CurveChain, options?: StrokeOptions): PathFragment[] {\r\n const handler = new DistanceIndexConstructionContext();\r\n for (const curve of path.children) {\r\n curve.emitStrokableParts(handler, options);\r\n }\r\n const fragments = handler._fragments;\r\n return fragments;\r\n }\r\n}\r\n/**\r\n * `CurveChainWithDistanceIndex` is a CurvePrimitive whose fractional parameterization is proportional to true\r\n * distance along a CurveChain.\r\n * * For example if the total length of the chain is `L`, then the distance along the chain from parameters `t0`\r\n * to `t1` is easily computed as `L*(t1-t0)`.\r\n * * The curve chain can be any type derived from CurveChain.\r\n * * * i.e. either a `Path` or a `Loop`\r\n * @public\r\n */\r\nexport class CurveChainWithDistanceIndex extends CurvePrimitive {\r\n /** String name for schema properties */\r\n public readonly curvePrimitiveType = \"curveChainWithDistanceIndex\";\r\n private readonly _path: CurveChain;\r\n private readonly _fragments: PathFragment[];\r\n private readonly _totalLength: number; // matches final fragment distance1.\r\n /** Test if other is a `CurveChainWithDistanceIndex` */\r\n public isSameGeometryClass(other: GeometryQuery): boolean {\r\n return other instanceof CurveChainWithDistanceIndex;\r\n }\r\n // final assembly of CurveChainWithDistanceIndex -- caller must create valid fragment index.\r\n private constructor(path: CurveChain, fragments: PathFragment[]) {\r\n super();\r\n this._path = path;\r\n this._fragments = fragments;\r\n this._totalLength = fragments.length > 0 ? fragments[fragments.length - 1].chainDistance1 : 0;\r\n }\r\n /**\r\n * Create a clone, transformed and with its own distance index.\r\n * @param transform transform to apply in the clone.\r\n */\r\n public cloneTransformed(transform: Transform): CurveChainWithDistanceIndex | undefined {\r\n const c = this._path.clone();\r\n if (c instanceof CurveChain && c.tryTransformInPlace(transform))\r\n return CurveChainWithDistanceIndex.createCapture(c);\r\n return undefined;\r\n }\r\n /**\r\n * Reference to the contained path.\r\n * * Do not modify the path. The distance index will be wrong.\r\n */\r\n public get path(): CurveChain {\r\n return this._path;\r\n }\r\n /**\r\n * Reference to the fragments array.\r\n * * Do not modify.\r\n */\r\n public get fragments(): PathFragment[] {\r\n return this._fragments;\r\n }\r\n /** Return a deep clone */\r\n public clone(): CurveChainWithDistanceIndex {\r\n const c = this._path.clone() as CurveChain;\r\n return CurveChainWithDistanceIndex.createCapture(c);\r\n }\r\n /** Return a deep clone */\r\n public override clonePartialCurve(fractionA: number, fractionB: number): CurveChainWithDistanceIndex | undefined {\r\n if (fractionA === fractionB)\r\n return undefined;\r\n let fracA = fractionA;\r\n let fracB = fractionB;\r\n const reversed = fractionA > fractionB;\r\n if (reversed) {\r\n fracA = fractionB;\r\n fracB = fractionA;\r\n }\r\n const chainDistanceA = fracA * this._totalLength;\r\n const chainDistanceB = fracB * this._totalLength;\r\n const fragmentA = this.chainDistanceToFragment(chainDistanceA, true);\r\n if (undefined === fragmentA)\r\n return undefined;\r\n const fragmentB = this.chainDistanceToFragment(chainDistanceB, true);\r\n if (undefined === fragmentB)\r\n return undefined;\r\n const childCurveIndexA = this._path.childIndex(fragmentA.childCurve, true);\r\n if (undefined === childCurveIndexA)\r\n return undefined;\r\n const childCurveIndexB = this._path.childIndex(fragmentB.childCurve, true);\r\n if (undefined === childCurveIndexB)\r\n return undefined;\r\n const childFractionA = fragmentA.chainDistanceToAccurateChildFraction(chainDistanceA, true);\r\n const childFractionB = fragmentB.chainDistanceToAccurateChildFraction(chainDistanceB, true);\r\n\r\n // add a (possibly reversed) partial clone to newPath\r\n const newPath = Path.create();\r\n const addPartialChild = (\r\n childCurve: CurvePrimitive, childFraction0: number, childFraction1: number, reversedClone: boolean,\r\n ): boolean => {\r\n if (childFraction0 === childFraction1)\r\n return false;\r\n let newCurve;\r\n if (childFraction0 === 0.0 && childFraction1 === 1.0) {\r\n newCurve = childCurve.clone();\r\n if (reversedClone)\r\n newCurve.reverseInPlace();\r\n } else {\r\n newCurve = reversedClone ?\r\n childCurve.clonePartialCurve(childFraction1, childFraction0)\r\n : childCurve.clonePartialCurve(childFraction0, childFraction1);\r\n }\r\n if (newCurve) {\r\n newPath.children.push(newCurve);\r\n return true;\r\n }\r\n return false;\r\n };\r\n if (fragmentA.childCurve === fragmentB.childCurve) {\r\n // the two distances are within the same curve.\r\n if (addPartialChild(fragmentA.childCurve, childFractionA, childFractionB, reversed))\r\n return CurveChainWithDistanceIndex.createCapture(newPath); // singleton -- children[] does not need to be reversed.\r\n return undefined;\r\n }\r\n addPartialChild(this._path.children[childCurveIndexA], childFractionA, 1.0, reversed);\r\n // at least two distinct children are impacted ....\r\n for (let childIndex = childCurveIndexA + 1; childIndex < childCurveIndexB; childIndex++) {\r\n addPartialChild(this._path.children[childIndex], 0.0, 1.0, reversed);\r\n }\r\n addPartialChild(this._path.children[childCurveIndexB], 0.0, childFractionB, reversed);\r\n // This reverses array entries but not orientation within each curve ...\r\n if (reversed)\r\n newPath.children.reverse();\r\n return CurveChainWithDistanceIndex.createCapture(newPath);\r\n }\r\n /**\r\n * Ask if the curve is within tolerance of a plane.\r\n * @returns Returns true if the curve is completely within tolerance of the plane.\r\n */\r\n public isInPlane(plane: Plane3dByOriginAndUnitNormal): boolean {\r\n for (const c of this._path.children) {\r\n if (!c.isInPlane(plane))\r\n return false;\r\n }\r\n return true;\r\n }\r\n /** Return the start point of the primitive. The default implementation returns fractionToPoint (0.0) */\r\n public override startPoint(result?: Point3d): Point3d {\r\n const c = this._path.cyclicCurvePrimitive(0);\r\n if (c)\r\n return c.startPoint(result);\r\n return Point3d.createZero(result);\r\n }\r\n /** Return the end point of the primitive. The default implementation returns fractionToPoint(1.0) */\r\n public override endPoint(result?: Point3d): Point3d {\r\n const c = this._path.cyclicCurvePrimitive(-1);\r\n if (c)\r\n return c.endPoint(result);\r\n return Point3d.createZero(result);\r\n }\r\n /** Add strokes to caller-supplied linestring */\r\n public emitStrokes(dest: LineString3d, options?: StrokeOptions): void {\r\n for (const c of this._path.children) {\r\n c.emitStrokes(dest, options);\r\n }\r\n }\r\n /**\r\n * Ask the curve to announce points and simple subcurve fragments for stroking.\r\n * See IStrokeHandler for description of the sequence of the method calls.\r\n */\r\n public emitStrokableParts(dest: IStrokeHandler, options?: StrokeOptions): void {\r\n for (const c of this._path.children) {\r\n c.emitStrokableParts(dest, options);\r\n }\r\n }\r\n /**\r\n * Return the stroke count required for given options.\r\n * @param options StrokeOptions that determine count\r\n */\r\n public computeStrokeCountForOptions(options?: StrokeOptions): number {\r\n let numStroke = 0;\r\n for (const c of this._path.children) {\r\n numStroke += c.computeStrokeCountForOptions(options);\r\n }\r\n return numStroke;\r\n }\r\n /**\r\n * Return an array containing only the curve primitives.\r\n * @param collectorArray array to receive primitives (pushed -- the array is not cleared)\r\n * @param smallestPossiblePrimitives if true, recurse on the (otherwise hidden) children. If false, only push `this`.\r\n * @param explodeLinestrings (if smallestPossiblePrimitives is true) whether to push a [[LineSegment3d]] for each\r\n * segment of a [[LineString3d]] child. If false, push only the [[LineString3d]].\r\n */\r\n public override collectCurvePrimitivesGo(\r\n collectorArray: CurvePrimitive[], smallestPossiblePrimitives: boolean = false, explodeLineStrings: boolean = false,\r\n ): void {\r\n if (smallestPossiblePrimitives) {\r\n for (const c of this._path.children) {\r\n c.collectCurvePrimitivesGo(collectorArray, smallestPossiblePrimitives, explodeLineStrings);\r\n }\r\n } else {\r\n collectorArray.push(this);\r\n }\r\n }\r\n /**\r\n * Construct StrokeCountMap for each child, accumulating data to stroke count map for this primitive.\r\n * @param options StrokeOptions that determine count\r\n * @param parentStrokeMap evolving parent map.\r\n */\r\n public override computeAndAttachRecursiveStrokeCounts(options?: StrokeOptions, parentStrokeMap?: StrokeCountMap) {\r\n const myMap = StrokeCountMap.createWithCurvePrimitiveAndOptionalParent(this, parentStrokeMap);\r\n for (const c of this._path.children) {\r\n c.computeAndAttachRecursiveStrokeCounts(options, myMap);\r\n }\r\n CurvePrimitive.installStrokeCountMap(this, myMap, parentStrokeMap);\r\n }\r\n /**\r\n * Second step of double dispatch: call `this._path.dispatchToGeometryHandler (handler)`\r\n * * Note that this exposes the children individually to the handler.\r\n */\r\n public dispatchToGeometryHandler(handler: GeometryHandler): any {\r\n return this._path.dispatchToGeometryHandler(handler);\r\n }\r\n /** Extend (increase) `rangeToExtend` as needed to include these curves (optionally transformed) */\r\n public extendRange(rangeToExtend: Range3d, transform?: Transform): void {\r\n this._path.extendRange(rangeToExtend, transform);\r\n }\r\n /**\r\n * Curve length is always positive.\r\n * @returns Returns a (high accuracy) length of the curve between fractional positions\r\n * @returns Returns the length of the curve.\r\n */\r\n public override curveLengthBetweenFractions(fraction0: number, fraction1: number): number {\r\n return Math.abs(fraction1 - fraction0) * this._totalLength;\r\n }\r\n /**\r\n * Capture (not clone) a path into a new `CurveChainWithDistanceIndex`\r\n * @param path primitive array to be CAPTURED (not cloned)\r\n */\r\n public static createCapture(path: CurveChain, options?: StrokeOptions): CurveChainWithDistanceIndex {\r\n const fragments = DistanceIndexConstructionContext.createPathFragmentIndex(path, options);\r\n const result = new CurveChainWithDistanceIndex(path, fragments);\r\n return result;\r\n }\r\n /**\r\n * Resolve a fraction of the CurveChain to a PathFragment\r\n * @param distance\r\n * @param allowExtrapolation\r\n */\r\n public chainDistanceToFragment(distance: number, allowExtrapolation: boolean = false): PathFragment | undefined {\r\n const i = this.chainDistanceToFragmentIndex(distance, allowExtrapolation);\r\n if (undefined !== i)\r\n return this._fragments[i];\r\n return undefined;\r\n }\r\n /**\r\n * Resolve a fraction of the CurveChain to a PathFragment index\r\n * @param distance\r\n * @param allowExtrapolation\r\n */\r\n protected chainDistanceToFragmentIndex(distance: number, allowExtrapolation: boolean = false): number | undefined {\r\n const numFragments = this._fragments.length;\r\n const fragments = this._fragments;\r\n if (numFragments > 0) {\r\n if (distance < 0.0)\r\n return allowExtrapolation ? 0 : undefined;\r\n if (distance > this._totalLength)\r\n return allowExtrapolation ? (numFragments - 1) : undefined;\r\n // humbug, linear search\r\n for (let i = 0; i < numFragments; i++) {\r\n if (fragments[i].containsChainDistance(distance)) return i;\r\n }\r\n }\r\n return undefined;\r\n }\r\n /**\r\n * Convert distance along the chain to fraction along the chain.\r\n * @param distance distance along the chain\r\n */\r\n public chainDistanceToChainFraction(distance: number): number {\r\n return distance / this._totalLength;\r\n }\r\n /**\r\n * Resolve a fraction within a specific curve to a fragment.\r\n * @param curve\r\n * @param fraction\r\n */\r\n public curveAndChildFractionToFragment(curve: CurvePrimitive, fraction: number): PathFragment | undefined {\r\n const numFragments = this._fragments.length;\r\n const fragments = this._fragments;\r\n if (numFragments > 0) {\r\n // humbug, linear search\r\n for (const fragment of fragments) {\r\n if (fragment.containsChildCurveAndChildFraction(curve, fraction))\r\n return fragment;\r\n }\r\n if (fraction <= 0)\r\n return fragments[0];\r\n if (fraction > 1.0)\r\n return fragments[numFragments - 1];\r\n }\r\n return undefined;\r\n }\r\n /** Returns the total length of curves. */\r\n public override curveLength(): number {\r\n return this._totalLength;\r\n }\r\n /**\r\n * Returns the total length of the path.\r\n * * This is exact (and simple property lookup) because the true lengths were summed at construction time.\r\n */\r\n public quickLength(): number {\r\n return this._totalLength;\r\n }\r\n /**\r\n * Return the point (x,y,z) on the curve at fractional position along the chain.\r\n * @param fraction fractional position along the geometry.\r\n * @returns Returns a point on the curve.\r\n */\r\n public fractionToPoint(fraction: number, result?: Point3d): Point3d {\r\n const chainDistance = fraction * this._totalLength;\r\n const fragment = this.chainDistanceToFragment(chainDistance, true);\r\n if (fragment) {\r\n const childFraction = fragment.chainDistanceToAccurateChildFraction(chainDistance, true);\r\n return fragment.childCurve.fractionToPoint(childFraction, result);\r\n }\r\n // no fragment found. Use _fragments[0]\r\n // fragment = this.chainDistanceToFragment(chainDistance, true);\r\n return this._fragments[0].childCurve.fractionToPoint(0.0, result);\r\n }\r\n /**\r\n * Return the point (x,y,z) and derivative on the curve at fractional position.\r\n * * Note that this derivative is \"derivative of xyz with respect to fraction.\"\r\n * * this derivative shows the speed of the \"fractional point\" moving along the curve.\r\n * * this is not generally a unit vector. use fractionToPointAndUnitTangent for a unit vector.\r\n * @param fraction fractional position along the geometry.\r\n * @returns Returns a ray whose origin is the curve point and direction is the derivative with respect to the fraction.\r\n */\r\n public fractionToPointAndDerivative(fraction: number, result?: Ray3d): Ray3d {\r\n const distanceAlongPath = fraction * this._totalLength;\r\n const fragment = this.chainDistanceToFragment(distanceAlongPath, true)!;\r\n const curveFraction = fragment.chainDistanceToAccurateChildFraction(distanceAlongPath, true);\r\n result = fragment.childCurve.fractionToPointAndDerivative(curveFraction, result);\r\n // Fractional arc length parameterization for the curve C is f=f(t)=s(t)/L, where\r\n // L is total length of C, f'=||C'||/L, and inverse t=t(f), t'=1/f'=L/||C'||.\r\n // Then d/df(C(t(f)))=C't'=C'L/||C'||. The fragment gave us C', so the\r\n // derivative we seek is just a scale away.\r\n const a = this._totalLength / result.direction.magnitude();\r\n result.direction.scaleInPlace(a);\r\n return result;\r\n }\r\n /**\r\n * Returns a ray whose origin is the curve point and direction is the unit tangent.\r\n * @param fraction fractional position on the curve\r\n * @param result optional receiver for the result.\r\n * Returns a ray whose origin is the curve point and direction is the unit tangent.\r\n */\r\n public override fractionToPointAndUnitTangent(fraction: number, result?: Ray3d): Ray3d {\r\n const distanceAlongPath = fraction * this._totalLength;\r\n const fragment = this.chainDistanceToFragment(distanceAlongPath, true)!;\r\n const curveFraction = fragment.chainDistanceToAccurateChildFraction(distanceAlongPath, true);\r\n result = fragment.childCurve.fractionToPointAndDerivative(curveFraction, result);\r\n result.direction.normalizeInPlace();\r\n return result;\r\n }\r\n /**\r\n * Return a plane with\r\n * * origin at fractional position along the curve\r\n * * vectorU is the first derivative, i.e. tangent vector with length equal to the rate of change with respect to\r\n * the fraction.\r\n * * vectorV is the second derivative, i.e.derivative of vectorU.\r\n */\r\n public fractionToPointAnd2Derivatives(\r\n fraction: number, result?: Plane3dByOriginAndVectors,\r\n ): Plane3dByOriginAndVectors | undefined {\r\n const distanceAlongPath = fraction * this._totalLength;\r\n const fragment = this.chainDistanceToFragment(distanceAlongPath, true)!;\r\n const curveFraction = fragment.chainDistanceToAccurateChildFraction(distanceAlongPath, true);\r\n result = fragment.childCurve.fractionToPointAnd2Derivatives(curveFraction, result);\r\n if (!result)\r\n return undefined;\r\n // See fractionToPointAndDerivative for derivation of d/df(C(t(f)))=L C'/||C'||.\r\n // For the 2nd deriv, use quotient rule, d/dt||x(t)||=x.x'/||x|| and ||x||^2=x.x :\r\n // d2/df2(C(t(f))) = L d/df(C'/||C'||)\r\n // = L (||C'|| d/df(C') - C' d/df||C'||) / ||C'||^2\r\n // = L (||C'|| C\" L/||C'|| - C' C'.C\"/||C'|| L/||C'||) / ||C'||^2\r\n // = (L/||C'||)^2 (C\" - C' C'.C\"/C'.C' )\r\n // We have C' and C\" from the fragment.\r\n const magU = result.vectorU.magnitude();\r\n const dotUU = magU * magU;\r\n const dotUV = result.vectorU.dotProduct(result.vectorV);\r\n result.vectorV.addScaledInPlace(result.vectorU, -dotUV / dotUU);\r\n const scale = this._totalLength / magU;\r\n result.vectorU.scaleInPlace(scale);\r\n result.vectorV.scaleInPlace(scale * scale);\r\n return result;\r\n }\r\n /**\r\n * Attempt to transform in place.\r\n * * Warning: If any child fails, this object becomes invalid. But that should never happen.\r\n */\r\n public tryTransformInPlace(transform: Transform): boolean {\r\n let numFail = 0;\r\n for (const c of this._path.children) {\r\n if (!c.tryTransformInPlace(transform))\r\n numFail++;\r\n }\r\n return numFail === 0;\r\n }\r\n /** Reverse the curve's data so that its fractional stroking moves in the opposite direction. */\r\n public reverseInPlace(): void {\r\n this._path.reverseChildrenInPlace();\r\n const totalLength = this._totalLength;\r\n for (const fragment of this._fragments) {\r\n fragment.reverseFractionsAndDistances(totalLength);\r\n }\r\n this._fragments.reverse();\r\n }\r\n /**\r\n * Test for equality conditions:\r\n * * Mismatched totalLength is a quick exit condition\r\n * * If totalLength matches, recurse to the path for matching primitives.\r\n * @param other\r\n */\r\n public override isAlmostEqual(other: GeometryQuery): boolean {\r\n if (other instanceof CurveChainWithDistanceIndex) {\r\n return Geometry.isSameCoordinate(this._totalLength, other._totalLength)\r\n && this._path.isAlmostEqual(other._path);\r\n }\r\n return false;\r\n }\r\n /**\r\n * Implement moveSignedDistanceFromFraction.\r\n * * See `CurvePrimitive` for parameter details.\r\n * * The returned location directly identifies fractional position along the CurveChainWithDistanceIndex, and\r\n * has pointer to an additional detail for the child curve.\r\n */\r\n public override moveSignedDistanceFromFraction(\r\n startFraction: number, signedDistance: number, allowExtension: boolean, result?: CurveLocationDetail,\r\n ): CurveLocationDetail {\r\n const distanceA = startFraction * this._totalLength;\r\n const distanceB = distanceA + signedDistance;\r\n const fragmentB = this.chainDistanceToFragment(distanceB, true)!;\r\n const childDetail = fragmentB.childCurve.moveSignedDistanceFromFraction(fragmentB.childFraction0, distanceB - fragmentB.chainDistance0, allowExtension, result);\r\n const endFraction = startFraction + (signedDistance / this._totalLength);\r\n const chainDetail = CurveLocationDetail.createConditionalMoveSignedDistance(allowExtension, this, startFraction, endFraction, signedDistance, result);\r\n chainDetail.childDetail = childDetail;\r\n return chainDetail;\r\n }\r\n /**\r\n * The returned object has\r\n * * numCalls = number of times closestPoint was called.\r\n * * numCurvesTested = number of curves tested with full closestPoint\r\n * * numAssigned = number of times a new minimum value was recorded\r\n * * numCandidate = number of curves that would be tested in worst case.\r\n * return an object summarizing closest point test counts\r\n * @param clear if true, counts are cleared after the return object is formed.\r\n */\r\n public static getClosestPointTestCounts(\r\n clear: boolean = true,\r\n ): { numCalls: number, numTested: number, numAssigned: number, numCandidate: number } {\r\n const a = {\r\n numCalls: this._numCalls,\r\n numTested: this._numTested,\r\n numAssigned: this._numAssigned,\r\n numCandidate: this._numCandidate,\r\n };\r\n if (clear) {\r\n this._numTested = this._numAssigned = this._numCandidate = 0;\r\n }\r\n return a;\r\n }\r\n private static _numCalls = 0;\r\n private static _numTested = 0;\r\n private static _numAssigned = 0;\r\n private static _numCandidate = 0;\r\n /**\r\n * Search for the curve point that is closest to the spacePoint.\r\n * * The CurveChainWithDistanceIndex invokes the base class CurvePrimitive method, which\r\n * (via a handler) determines a CurveLocation detail among the children.\r\n * * The returned detail directly identifies fractional position along the CurveChainWithDistanceIndex, and\r\n * has pointer to an additional detail for the child curve.\r\n * @param spacePoint point in space\r\n * @param extend true to extend the curve\r\n * @returns Returns a CurveLocationDetail structure that holds the details of the close point.\r\n */\r\n public override closestPoint(\r\n spacePoint: Point3d, extend: VariantCurveExtendParameter,\r\n ): CurveLocationDetail | undefined {\r\n let childDetail: CurveLocationDetail | undefined;\r\n let aMin = Number.MAX_VALUE;\r\n const numChildren = this.path.children.length;\r\n if (numChildren === 1) {\r\n childDetail = this.path.children[0].closestPoint(spacePoint, extend);\r\n } else {\r\n const sortedFragments = PathFragment.collectSortedQuickMinDistances(this._fragments, spacePoint);\r\n const extend0 = [CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(extend, 0), CurveExtendMode.None];\r\n const extend1 = [CurveExtendMode.None, CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(extend, 1)];\r\n const fragment0 = this._fragments[0];\r\n const fragment1 = this._fragments[this._fragments.length - 1];\r\n CurveChainWithDistanceIndex._numCalls++;\r\n CurveChainWithDistanceIndex._numCandidate += sortedFragments.length;\r\n for (const f of sortedFragments) {\r\n if (f.a > aMin)\r\n break;\r\n CurveChainWithDistanceIndex._numTested++;\r\n const child = f.childCurve;\r\n const detailA = child.closestPoint(spacePoint,\r\n f === fragment0 ? extend0 : f === fragment1 ? extend1 : false);\r\n if (detailA && detailA.a < aMin) {\r\n aMin = detailA.a;\r\n childDetail = CurveLocationDetail.createCurveFractionPoint(detailA.curve, detailA.fraction, detailA.point, childDetail)!;\r\n childDetail.a = detailA.a;\r\n CurveChainWithDistanceIndex._numAssigned++;\r\n }\r\n }\r\n }\r\n if (!childDetail)\r\n return undefined;\r\n const fragment = this.curveAndChildFractionToFragment(childDetail.curve!, childDetail.fraction);\r\n if (fragment) {\r\n const chainDistance = fragment.childFractionToChainDistance(childDetail.fraction);\r\n const chainFraction = this.chainDistanceToChainFraction(chainDistance);\r\n const chainDetail = CurveLocationDetail.createCurveFractionPoint(this, chainFraction, childDetail.point);\r\n chainDetail.childDetail = childDetail;\r\n chainDetail.a = childDetail.a;\r\n return chainDetail;\r\n }\r\n return undefined;\r\n }\r\n /**\r\n * Construct an offset of each child as viewed in the xy-plane (ignoring z).\r\n * * No attempt is made to join the offset children. Use RegionOps.constructCurveXYOffset() to return a fully\r\n * joined offset.\r\n * @param offsetDistanceOrOptions offset distance (positive to left of the instance curve), or options object\r\n */\r\n public override constructOffsetXY(\r\n offsetDistanceOrOptions: number | OffsetOptions,\r\n ): CurvePrimitive | CurvePrimitive[] | undefined {\r\n const options = OffsetOptions.create(offsetDistanceOrOptions);\r\n const offsets: CurvePrimitive[] = [];\r\n for (const prim of this.collectCurvePrimitives(undefined, true, true)) {\r\n const offset = prim.constructOffsetXY(options);\r\n if (offset !== undefined) {\r\n if (offset instanceof CurvePrimitive)\r\n offsets.push(offset);\r\n else if (Array.isArray(offset))\r\n offset.forEach((cp) => offsets.push(cp));\r\n }\r\n }\r\n return offsets;\r\n }\r\n /**\r\n * Project instance geometry (via dispatch) onto the given ray, and return the extreme fractional parameters of\r\n * projection.\r\n * @param ray ray onto which the instance is projected. A `Vector3d` is treated as a `Ray3d` with zero origin.\r\n * @param lowHigh optional receiver for output\r\n * @returns range of fractional projection parameters onto the ray, where 0.0 is start of the ray and 1.0 is the\r\n * end of the ray.\r\n */\r\n public override projectedParameterRange(ray: Vector3d | Ray3d, lowHigh?: Range1d): Range1d | undefined {\r\n return PlaneAltitudeRangeContext.findExtremeFractionsAlongDirection(this, ray, lowHigh);\r\n }\r\n}\r\n"]}
|
|
@@ -4,12 +4,15 @@ import { Point3d, Vector3d } from "../geometry3d/Point3dVector3d";
|
|
|
4
4
|
import { Range1d, Range3d } from "../geometry3d/Range";
|
|
5
5
|
import { Ray3d } from "../geometry3d/Ray3d";
|
|
6
6
|
import { Transform } from "../geometry3d/Transform";
|
|
7
|
-
import { AnyCurve } from "./CurveChain";
|
|
8
7
|
import { CurveLocationDetail } from "./CurveLocationDetail";
|
|
9
8
|
import { CurvePrimitive } from "./CurvePrimitive";
|
|
10
9
|
import { RecursiveCurveProcessor } from "./CurveProcessor";
|
|
10
|
+
import { AnyCurve, type AnyRegion } from "./CurveTypes";
|
|
11
11
|
import { GeometryQuery } from "./GeometryQuery";
|
|
12
12
|
import { StrokeOptions } from "./StrokeOptions";
|
|
13
|
+
import type { Path } from "./Path";
|
|
14
|
+
import type { Loop } from "./Loop";
|
|
15
|
+
/** Note: CurveChain and BagOfCurves classes are located in this file to prevent circular dependency. */
|
|
13
16
|
/**
|
|
14
17
|
* Describes the concrete type of a [[CurveCollection]]. Each type name maps to a specific subclass and can be
|
|
15
18
|
* used in conditional statements for type-switching.
|
|
@@ -86,17 +89,28 @@ export declare abstract class CurveCollection extends GeometryQuery {
|
|
|
86
89
|
* * `Loop`
|
|
87
90
|
* * `ParityRegion`
|
|
88
91
|
* * `UnionRegion`
|
|
92
|
+
* @see isAnyRegion
|
|
89
93
|
*/
|
|
90
94
|
get isAnyRegionType(): boolean;
|
|
91
|
-
/**
|
|
95
|
+
/** Type guard for AnyRegion */
|
|
96
|
+
isAnyRegion(): this is AnyRegion;
|
|
97
|
+
/**
|
|
98
|
+
* Return true for a `Path`, i.e. a chain of curves joined head-to-tail
|
|
99
|
+
* @see isPath
|
|
100
|
+
*/
|
|
92
101
|
get isOpenPath(): boolean;
|
|
102
|
+
/** Type guard for Path */
|
|
103
|
+
isPath(): this is Path;
|
|
93
104
|
/**
|
|
94
105
|
* Return true for a single-loop planar region type, i.e. `Loop`.
|
|
95
106
|
* * This is NOT a test for physical closure of a `Path`.
|
|
107
|
+
* @see isLoop
|
|
96
108
|
*/
|
|
97
109
|
get isClosedPath(): boolean;
|
|
110
|
+
/** Type guard for Loop */
|
|
111
|
+
isLoop(): this is Loop;
|
|
98
112
|
/** Return a CurveCollection with the same structure but all curves replaced by strokes. */
|
|
99
|
-
abstract cloneStroked(options?: StrokeOptions):
|
|
113
|
+
abstract cloneStroked(options?: StrokeOptions): CurveCollection;
|
|
100
114
|
/** Support method for ICurvePrimitive ... one line call to specific announce method . . */
|
|
101
115
|
abstract announceToCurveProcessor(processor: RecursiveCurveProcessor): void;
|
|
102
116
|
/** Clone an empty collection. */
|
|
@@ -140,7 +154,7 @@ export declare abstract class CurveCollection extends GeometryQuery {
|
|
|
140
154
|
/**
|
|
141
155
|
* Shared base class for use by both open and closed paths.
|
|
142
156
|
* * A `CurveChain` contains only CurvePrimitives. No other paths, loops, or regions allowed.
|
|
143
|
-
* * The specific derived classes are `Path` and `Loop
|
|
157
|
+
* * The specific derived classes are `Path` and `Loop`.
|
|
144
158
|
* * `CurveChain` is an intermediate class. It is not instantiable on its own.
|
|
145
159
|
* * The related class `CurveChainWithDistanceIndex` is a `CurvePrimitive` whose API presents well-defined mappings
|
|
146
160
|
* from fraction to xyz over the entire chain, but in fact does all the calculations over multiple primitives.
|
|
@@ -166,7 +180,7 @@ export declare abstract class CurveChain extends CurveCollection {
|
|
|
166
180
|
*/
|
|
167
181
|
getPackedStrokes(options?: StrokeOptions): GrowableXYZArray | undefined;
|
|
168
182
|
/** Return a structural clone, with CurvePrimitive objects stroked. */
|
|
169
|
-
abstract cloneStroked(options?: StrokeOptions):
|
|
183
|
+
abstract cloneStroked(options?: StrokeOptions): CurveChain;
|
|
170
184
|
/**
|
|
171
185
|
* Add a child curve.
|
|
172
186
|
* * Returns false if the given child is not a CurvePrimitive.
|
|
@@ -184,7 +198,7 @@ export declare abstract class CurveChain extends CurveCollection {
|
|
|
184
198
|
/**
|
|
185
199
|
* Return the index where target is found in the array of children.
|
|
186
200
|
* @param alsoSearchProxies whether to also check proxy curves of the children
|
|
187
|
-
|
|
201
|
+
*/
|
|
188
202
|
childIndex(target: CurvePrimitive | undefined, alsoSearchProxies?: boolean): number | undefined;
|
|
189
203
|
/** Evaluate an indexed curve at a fraction. Return as a CurveLocationDetail that indicates the primitive. */
|
|
190
204
|
primitiveIndexAndFractionToCurveLocationDetailPointAndDerivative(index: number, fraction: number, cyclic?: boolean, result?: CurveLocationDetail): CurveLocationDetail | undefined;
|
|
@@ -225,18 +239,4 @@ export declare class BagOfCurves extends CurveCollection {
|
|
|
225
239
|
/** Second step of double dispatch: call `handler.handleBagOfCurves(this)` */
|
|
226
240
|
dispatchToGeometryHandler(handler: GeometryHandler): any;
|
|
227
241
|
}
|
|
228
|
-
/**
|
|
229
|
-
* * Options to control method `RegionOps.consolidateAdjacentPrimitives`
|
|
230
|
-
* @public
|
|
231
|
-
*/
|
|
232
|
-
export declare class ConsolidateAdjacentCurvePrimitivesOptions {
|
|
233
|
-
/** True to consolidated linear geometry (e.g. separate LineSegment3d and LineString3d) into LineString3d */
|
|
234
|
-
consolidateLinearGeometry: boolean;
|
|
235
|
-
/** True to consolidate contiguous arcs */
|
|
236
|
-
consolidateCompatibleArcs: boolean;
|
|
237
|
-
/** Tolerance for collapsing identical points */
|
|
238
|
-
duplicatePointTolerance: number;
|
|
239
|
-
/** Tolerance for removing interior colinear points. */
|
|
240
|
-
colinearPointTolerance: number;
|
|
241
|
-
}
|
|
242
242
|
//# sourceMappingURL=CurveCollection.d.ts.map
|
|
@@ -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,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,
|
|
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,mBAAmB,EAAE,MAAM,uBAAuB,CAAC;AAC5D,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAClD,OAAO,EAAE,uBAAuB,EAAE,MAAM,kBAAkB,CAAC;AAC3D,OAAO,EAAE,QAAQ,EAAE,KAAK,SAAS,EAAE,MAAM,cAAc,CAAC;AACxD,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAUhD,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAEhD,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AACnC,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAEnC,wGAAwG;AAExG;;;;;;;;;GASG;AACH,MAAM,MAAM,mBAAmB,GAAG,MAAM,GAAG,MAAM,GAAG,aAAa,GAAG,cAAc,GAAG,aAAa,CAAC;AAEnG;;;;;;;;;;;;;;GAcG;AACH,8BAAsB,eAAgB,SAAQ,aAAa;IACzD,wCAAwC;IACxC,SAAgB,gBAAgB,qBAAqB;IACrD,0BAA0B;IAC1B,kBAAyB,mBAAmB,EAAE,mBAAmB,CAAC;IAElE,uDAAuD;IAChD,OAAO,EAAE,OAAO,CAAS;IAChC,6DAA6D;IACtD,UAAU,IAAI,MAAM;IAG3B,uDAAuD;IAChD,YAAY,CAAC,UAAU,EAAE,OAAO,GAAG,mBAAmB,GAAG,SAAS;IAezE;;;;;;OAMG;IACI,MAAM,IAAI,MAAM;IAGvB,wGAAwG;IACjG,2BAA2B,IAAI,OAAO;IAG7C,8CAA8C;IACvC,mBAAmB,CAAC,SAAS,EAAE,SAAS,GAAG,OAAO;IAGzD,0BAA0B;IACV,KAAK,IAAI,eAAe;IAGxC,gDAAgD;IAChC,gBAAgB,CAAC,SAAS,EAAE,SAAS,GAAG,eAAe,GAAG,SAAS;IAGnF,uFAAuF;IAChF,4BAA4B,IAAI,eAAe;IAGtD;;;;OAIG;IACH,OAAO,CAAC,wBAAwB;IAYhC;;;;;;;;OAQG;IACI,sBAAsB,CAC3B,cAAc,CAAC,EAAE,cAAc,EAAE,EAAE,0BAA0B,GAAE,OAAe,EAAE,kBAAkB,GAAE,OAAe,GAClH,cAAc,EAAE;IAKnB;;;;;;OAMG;IACH,IAAW,eAAe,IAAI,OAAO,CAEpC;IACD,+BAA+B;IACxB,WAAW,IAAI,IAAI,IAAI,SAAS;IAGvC;;;OAGG;IACH,IAAW,UAAU,IAAI,OAAO,CAE/B;IACD,0BAA0B;IACnB,MAAM,IAAI,IAAI,IAAI,IAAI;IAG7B;;;;OAIG;IACH,IAAW,YAAY,IAAI,OAAO,CAEjC;IACD,0BAA0B;IACnB,MAAM,IAAI,IAAI,IAAI,IAAI;IAI7B,2FAA2F;aAC3E,YAAY,CAAC,OAAO,CAAC,EAAE,aAAa,GAAG,eAAe;IACtE,2FAA2F;aAC3E,wBAAwB,CAAC,SAAS,EAAE,uBAAuB,GAAG,IAAI;IAClF,iCAAiC;aACjB,cAAc,IAAI,eAAe;IACjD;;;OAGG;aACa,eAAe,IAAI,MAAM;IACzC;;;;OAIG;aACa,WAAW,CAAC,KAAK,EAAE,QAAQ,GAAG,SAAS,GAAG,OAAO;IACjE,4CAA4C;aAC5B,QAAQ,CAAC,CAAC,EAAE,MAAM,GAAG,QAAQ,GAAG,SAAS;IACzD;;;;OAIG;IACI,WAAW,CAAC,aAAa,EAAE,OAAO,EAAE,SAAS,CAAC,EAAE,SAAS,GAAG,IAAI;IAQvE;;;;;OAKG;WACW,4CAA4C,CACxD,MAAM,EAAE,aAAa,GAAG,SAAS,EAAE,QAAQ,GAAE,MAAY,GACxD,mBAAmB,GAAG,SAAS;IAalC;;;;;;;OAOG;IACI,uBAAuB,CAAC,GAAG,EAAE,QAAQ,GAAG,KAAK,EAAE,OAAO,CAAC,EAAE,OAAO,GAAG,OAAO,GAAG,SAAS;CAG9F;AAED;;;;;;;;;GASG;AACH,8BAAsB,UAAW,SAAQ,eAAe;IACtD,yCAAyC;IACzC,SAAS,CAAC,OAAO,EAAE,cAAc,EAAE,CAAC;IACpC,kBAAkB;IAClB,SAAS;IAIT,2CAA2C;IAC3C,IAAoB,QAAQ,IAAI,cAAc,EAAE,CAE/C;IACD;;;;OAIG;IACI,oBAAoB,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,GAAE,OAAc,GAAG,cAAc,GAAG,SAAS;IAY9F;;;OAGG;IACI,gBAAgB,CAAC,OAAO,CAAC,EAAE,aAAa,GAAG,gBAAgB,GAAG,SAAS;IAiB9E,sEAAsE;aAC7C,YAAY,CAAC,OAAO,CAAC,EAAE,aAAa,GAAG,UAAU;IAC1E;;;OAGG;IACI,WAAW,CAAC,KAAK,EAAE,QAAQ,GAAG,SAAS,GAAG,OAAO;IAOxD,8BAA8B;IACvB,QAAQ,CAAC,CAAC,EAAE,MAAM,GAAG,cAAc,GAAG,SAAS;IAItD,mEAAmE;IACnD,WAAW,CAAC,KAAK,EAAE,OAAO,EAAE,SAAS,CAAC,EAAE,SAAS,GAAG,IAAI;IAIxE;;;OAGG;IACI,sBAAsB,IAAI,IAAI;IAKrC;;;OAGG;IACI,UAAU,CAAC,MAAM,EAAE,cAAc,GAAG,SAAS,EAAE,iBAAiB,CAAC,EAAE,OAAO,GAAG,MAAM,GAAG,SAAS;IAgBtG,6GAA6G;IACtG,gEAAgE,CACrE,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,MAAM,GAAE,OAAe,EAAE,MAAM,CAAC,EAAE,mBAAmB,GACrF,mBAAmB,GAAG,SAAS;CAOnC;AAED;;;;GAIG;AACH,qBAAa,WAAY,SAAQ,eAAe;IAC9C,wCAAwC;IACxC,SAAgB,mBAAmB,iBAAiB;IACpD,sDAAsD;IAC/C,mBAAmB,CAAC,KAAK,EAAE,aAAa,GAAG,OAAO;IAGzD;;;OAGG;IACH,SAAS,CAAC,SAAS,EAAE,QAAQ,EAAE,CAAC;IAChC,uCAAuC;;IAKvC,kDAAkD;IAClD,IAAoB,QAAQ,IAAI,QAAQ,EAAE,CAEzC;IACD,gCAAgC;WAClB,MAAM,CAAC,GAAG,IAAI,EAAE,QAAQ,EAAE,GAAG,WAAW;IAOtD,gFAAgF;IACzE,eAAe,IAAI,MAAM;IAGhC,mEAAmE;IAC5D,wBAAwB,CAAC,SAAS,EAAE,uBAAuB,EAAE,aAAa,GAAE,MAAW,GAAG,IAAI;IAGrG,0CAA0C;IACnC,YAAY,CAAC,OAAO,CAAC,EAAE,aAAa,GAAG,WAAW;IAiBzD,oCAAoC;IAC7B,cAAc,IAAI,WAAW;IAGpC,mBAAmB;IACZ,WAAW,CAAC,KAAK,EAAE,QAAQ,GAAG,SAAS,GAAG,OAAO;IAKxD,2BAA2B;IACpB,QAAQ,CAAC,CAAC,EAAE,MAAM,GAAG,QAAQ,GAAG,SAAS;IAKhD,8EAA8E;IACvE,yBAAyB,CAAC,OAAO,EAAE,eAAe,GAAG,GAAG;CAGhE"}
|