@itwin/core-geometry 4.3.0-dev.9 → 4.3.1
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/CHANGELOG.md +62 -1
- package/lib/cjs/Geometry.d.ts +14 -2
- package/lib/cjs/Geometry.d.ts.map +1 -1
- package/lib/cjs/Geometry.js +20 -9
- package/lib/cjs/Geometry.js.map +1 -1
- package/lib/cjs/bspline/BSpline1dNd.d.ts +12 -2
- package/lib/cjs/bspline/BSpline1dNd.d.ts.map +1 -1
- package/lib/cjs/bspline/BSpline1dNd.js +27 -17
- package/lib/cjs/bspline/BSpline1dNd.js.map +1 -1
- package/lib/cjs/bspline/BSplineCurve.d.ts +30 -16
- package/lib/cjs/bspline/BSplineCurve.d.ts.map +1 -1
- package/lib/cjs/bspline/BSplineCurve.js +68 -44
- package/lib/cjs/bspline/BSplineCurve.js.map +1 -1
- package/lib/cjs/bspline/BSplineCurve3dH.d.ts +27 -20
- package/lib/cjs/bspline/BSplineCurve3dH.d.ts.map +1 -1
- package/lib/cjs/bspline/BSplineCurve3dH.js +136 -87
- package/lib/cjs/bspline/BSplineCurve3dH.js.map +1 -1
- package/lib/cjs/bspline/BSplineSurface.d.ts +138 -74
- package/lib/cjs/bspline/BSplineSurface.d.ts.map +1 -1
- package/lib/cjs/bspline/BSplineSurface.js +242 -119
- package/lib/cjs/bspline/BSplineSurface.js.map +1 -1
- package/lib/cjs/bspline/Bezier1dNd.d.ts +18 -4
- package/lib/cjs/bspline/Bezier1dNd.d.ts.map +1 -1
- package/lib/cjs/bspline/Bezier1dNd.js +19 -5
- package/lib/cjs/bspline/Bezier1dNd.js.map +1 -1
- package/lib/cjs/bspline/BezierCurve3dH.d.ts.map +1 -1
- package/lib/cjs/bspline/BezierCurve3dH.js +2 -1
- package/lib/cjs/bspline/BezierCurve3dH.js.map +1 -1
- package/lib/cjs/bspline/KnotVector.d.ts +30 -33
- package/lib/cjs/bspline/KnotVector.d.ts.map +1 -1
- package/lib/cjs/bspline/KnotVector.js +76 -69
- package/lib/cjs/bspline/KnotVector.js.map +1 -1
- package/lib/cjs/clipping/ClipUtils.d.ts +32 -5
- package/lib/cjs/clipping/ClipUtils.d.ts.map +1 -1
- package/lib/cjs/clipping/ClipUtils.js +92 -11
- package/lib/cjs/clipping/ClipUtils.js.map +1 -1
- package/lib/cjs/core-geometry.d.ts +0 -2
- package/lib/cjs/core-geometry.d.ts.map +1 -1
- package/lib/cjs/core-geometry.js +0 -2
- 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 +5 -5
- package/lib/cjs/curve/Arc3d.js.map +1 -1
- package/lib/cjs/curve/CurveLocationDetail.d.ts +1 -4
- package/lib/cjs/curve/CurveLocationDetail.d.ts.map +1 -1
- package/lib/cjs/curve/CurveLocationDetail.js +4 -10
- package/lib/cjs/curve/CurveLocationDetail.js.map +1 -1
- package/lib/cjs/curve/CurveOps.d.ts +4 -5
- package/lib/cjs/curve/CurveOps.d.ts.map +1 -1
- package/lib/cjs/curve/CurveOps.js +1 -1
- package/lib/cjs/curve/CurveOps.js.map +1 -1
- package/lib/cjs/curve/CurveTypes.d.ts +14 -2
- package/lib/cjs/curve/CurveTypes.d.ts.map +1 -1
- package/lib/cjs/curve/CurveTypes.js.map +1 -1
- package/lib/cjs/curve/LineString3d.d.ts +3 -2
- package/lib/cjs/curve/LineString3d.d.ts.map +1 -1
- package/lib/cjs/curve/LineString3d.js +1 -0
- package/lib/cjs/curve/LineString3d.js.map +1 -1
- package/lib/cjs/curve/PointString3d.d.ts +2 -1
- package/lib/cjs/curve/PointString3d.d.ts.map +1 -1
- package/lib/cjs/curve/PointString3d.js.map +1 -1
- package/lib/cjs/curve/RegionOps.d.ts +5 -11
- package/lib/cjs/curve/RegionOps.d.ts.map +1 -1
- package/lib/cjs/curve/RegionOps.js.map +1 -1
- package/lib/cjs/curve/internalContexts/CurveCurveCloseApproachXY.d.ts +15 -9
- package/lib/cjs/curve/internalContexts/CurveCurveCloseApproachXY.d.ts.map +1 -1
- package/lib/cjs/curve/internalContexts/CurveCurveCloseApproachXY.js +68 -56
- package/lib/cjs/curve/internalContexts/CurveCurveCloseApproachXY.js.map +1 -1
- package/lib/cjs/curve/internalContexts/CurveCurveIntersectXY.d.ts +14 -16
- package/lib/cjs/curve/internalContexts/CurveCurveIntersectXY.d.ts.map +1 -1
- package/lib/cjs/curve/internalContexts/CurveCurveIntersectXY.js +51 -69
- package/lib/cjs/curve/internalContexts/CurveCurveIntersectXY.js.map +1 -1
- package/lib/cjs/curve/internalContexts/CurveCurveIntersectXYZ.d.ts.map +1 -1
- package/lib/cjs/curve/internalContexts/CurveCurveIntersectXYZ.js +3 -2
- package/lib/cjs/curve/internalContexts/CurveCurveIntersectXYZ.js.map +1 -1
- package/lib/cjs/curve/internalContexts/MultiChainCollector.d.ts +2 -3
- package/lib/cjs/curve/internalContexts/MultiChainCollector.d.ts.map +1 -1
- package/lib/cjs/curve/internalContexts/MultiChainCollector.js.map +1 -1
- package/lib/cjs/curve/internalContexts/PolygonOffsetContext.d.ts +4 -4
- package/lib/cjs/curve/internalContexts/PolygonOffsetContext.d.ts.map +1 -1
- package/lib/cjs/curve/internalContexts/PolygonOffsetContext.js +38 -36
- package/lib/cjs/curve/internalContexts/PolygonOffsetContext.js.map +1 -1
- package/lib/cjs/geometry3d/Angle.d.ts +0 -1
- package/lib/cjs/geometry3d/Angle.d.ts.map +1 -1
- package/lib/cjs/geometry3d/Angle.js +0 -1
- package/lib/cjs/geometry3d/Angle.js.map +1 -1
- package/lib/cjs/geometry3d/CoincidentGeometryOps.d.ts +21 -5
- package/lib/cjs/geometry3d/CoincidentGeometryOps.d.ts.map +1 -1
- package/lib/cjs/geometry3d/CoincidentGeometryOps.js +71 -45
- package/lib/cjs/geometry3d/CoincidentGeometryOps.js.map +1 -1
- package/lib/cjs/geometry3d/Matrix3d.d.ts +20 -13
- package/lib/cjs/geometry3d/Matrix3d.d.ts.map +1 -1
- package/lib/cjs/geometry3d/Matrix3d.js +28 -21
- package/lib/cjs/geometry3d/Matrix3d.js.map +1 -1
- package/lib/cjs/geometry3d/Point3dVector3d.d.ts +11 -2
- package/lib/cjs/geometry3d/Point3dVector3d.d.ts.map +1 -1
- package/lib/cjs/geometry3d/Point3dVector3d.js +16 -5
- package/lib/cjs/geometry3d/Point3dVector3d.js.map +1 -1
- package/lib/cjs/geometry3d/PointHelpers.d.ts +58 -20
- package/lib/cjs/geometry3d/PointHelpers.d.ts.map +1 -1
- package/lib/cjs/geometry3d/PointHelpers.js +213 -62
- package/lib/cjs/geometry3d/PointHelpers.js.map +1 -1
- package/lib/cjs/geometry3d/Segment1d.d.ts +5 -1
- package/lib/cjs/geometry3d/Segment1d.d.ts.map +1 -1
- package/lib/cjs/geometry3d/Segment1d.js +11 -7
- package/lib/cjs/geometry3d/Segment1d.js.map +1 -1
- package/lib/cjs/geometry3d/Transform.d.ts +4 -5
- package/lib/cjs/geometry3d/Transform.d.ts.map +1 -1
- package/lib/cjs/geometry3d/Transform.js +4 -5
- package/lib/cjs/geometry3d/Transform.js.map +1 -1
- package/lib/cjs/geometry4d/Point4d.d.ts +13 -0
- package/lib/cjs/geometry4d/Point4d.d.ts.map +1 -1
- package/lib/cjs/geometry4d/Point4d.js +21 -0
- package/lib/cjs/geometry4d/Point4d.js.map +1 -1
- package/lib/cjs/numerics/BezierPolynomials.d.ts +88 -64
- package/lib/cjs/numerics/BezierPolynomials.d.ts.map +1 -1
- package/lib/cjs/numerics/BezierPolynomials.js +92 -73
- package/lib/cjs/numerics/BezierPolynomials.js.map +1 -1
- package/lib/cjs/numerics/Newton.d.ts +143 -61
- package/lib/cjs/numerics/Newton.d.ts.map +1 -1
- package/lib/cjs/numerics/Newton.js +233 -66
- package/lib/cjs/numerics/Newton.js.map +1 -1
- package/lib/cjs/numerics/PascalCoefficients.d.ts +8 -12
- package/lib/cjs/numerics/PascalCoefficients.d.ts.map +1 -1
- package/lib/cjs/numerics/PascalCoefficients.js +10 -12
- package/lib/cjs/numerics/PascalCoefficients.js.map +1 -1
- package/lib/cjs/numerics/Polynomials.d.ts +6 -10
- package/lib/cjs/numerics/Polynomials.d.ts.map +1 -1
- package/lib/cjs/numerics/Polynomials.js +6 -10
- package/lib/cjs/numerics/Polynomials.js.map +1 -1
- package/lib/cjs/polyface/PolyfaceBuilder.d.ts +3 -0
- package/lib/cjs/polyface/PolyfaceBuilder.d.ts.map +1 -1
- package/lib/cjs/polyface/PolyfaceBuilder.js +13 -2
- package/lib/cjs/polyface/PolyfaceBuilder.js.map +1 -1
- package/lib/cjs/polyface/PolyfaceData.d.ts +1 -1
- package/lib/cjs/polyface/PolyfaceData.js +1 -1
- package/lib/cjs/polyface/PolyfaceData.js.map +1 -1
- package/lib/cjs/polyface/PolyfaceQuery.d.ts +38 -11
- package/lib/cjs/polyface/PolyfaceQuery.d.ts.map +1 -1
- package/lib/cjs/polyface/PolyfaceQuery.js +93 -16
- package/lib/cjs/polyface/PolyfaceQuery.js.map +1 -1
- package/lib/cjs/serialization/BGFBReader.d.ts +10 -10
- package/lib/cjs/serialization/BGFBReader.d.ts.map +1 -1
- package/lib/cjs/serialization/BGFBReader.js +69 -42
- package/lib/cjs/serialization/BGFBReader.js.map +1 -1
- package/lib/cjs/serialization/BGFBWriter.d.ts +8 -8
- package/lib/cjs/serialization/BGFBWriter.d.ts.map +1 -1
- package/lib/cjs/serialization/BGFBWriter.js +80 -55
- package/lib/cjs/serialization/BGFBWriter.js.map +1 -1
- package/lib/cjs/serialization/GeometrySamples.d.ts.map +1 -1
- package/lib/cjs/serialization/GeometrySamples.js +6 -8
- package/lib/cjs/serialization/GeometrySamples.js.map +1 -1
- package/lib/cjs/serialization/IModelJsonSchema.d.ts +8 -14
- package/lib/cjs/serialization/IModelJsonSchema.d.ts.map +1 -1
- package/lib/cjs/serialization/IModelJsonSchema.js +85 -259
- package/lib/cjs/serialization/IModelJsonSchema.js.map +1 -1
- package/lib/cjs/serialization/SerializationHelpers.d.ts +109 -0
- package/lib/cjs/serialization/SerializationHelpers.d.ts.map +1 -0
- package/lib/cjs/serialization/SerializationHelpers.js +591 -0
- package/lib/cjs/serialization/SerializationHelpers.js.map +1 -0
- package/lib/cjs/topology/Graph.d.ts +399 -366
- package/lib/cjs/topology/Graph.d.ts.map +1 -1
- package/lib/cjs/topology/Graph.js +531 -464
- package/lib/cjs/topology/Graph.js.map +1 -1
- package/lib/cjs/topology/MaskManager.d.ts +8 -9
- package/lib/cjs/topology/MaskManager.d.ts.map +1 -1
- package/lib/cjs/topology/MaskManager.js +11 -12
- package/lib/cjs/topology/MaskManager.js.map +1 -1
- package/lib/esm/Geometry.d.ts +14 -2
- package/lib/esm/Geometry.d.ts.map +1 -1
- package/lib/esm/Geometry.js +20 -9
- package/lib/esm/Geometry.js.map +1 -1
- package/lib/esm/bspline/BSpline1dNd.d.ts +12 -2
- package/lib/esm/bspline/BSpline1dNd.d.ts.map +1 -1
- package/lib/esm/bspline/BSpline1dNd.js +27 -17
- package/lib/esm/bspline/BSpline1dNd.js.map +1 -1
- package/lib/esm/bspline/BSplineCurve.d.ts +30 -16
- package/lib/esm/bspline/BSplineCurve.d.ts.map +1 -1
- package/lib/esm/bspline/BSplineCurve.js +68 -44
- package/lib/esm/bspline/BSplineCurve.js.map +1 -1
- package/lib/esm/bspline/BSplineCurve3dH.d.ts +27 -20
- package/lib/esm/bspline/BSplineCurve3dH.d.ts.map +1 -1
- package/lib/esm/bspline/BSplineCurve3dH.js +137 -88
- package/lib/esm/bspline/BSplineCurve3dH.js.map +1 -1
- package/lib/esm/bspline/BSplineSurface.d.ts +138 -74
- package/lib/esm/bspline/BSplineSurface.d.ts.map +1 -1
- package/lib/esm/bspline/BSplineSurface.js +242 -119
- package/lib/esm/bspline/BSplineSurface.js.map +1 -1
- package/lib/esm/bspline/Bezier1dNd.d.ts +18 -4
- package/lib/esm/bspline/Bezier1dNd.d.ts.map +1 -1
- package/lib/esm/bspline/Bezier1dNd.js +19 -5
- package/lib/esm/bspline/Bezier1dNd.js.map +1 -1
- package/lib/esm/bspline/BezierCurve3dH.d.ts.map +1 -1
- package/lib/esm/bspline/BezierCurve3dH.js +2 -1
- package/lib/esm/bspline/BezierCurve3dH.js.map +1 -1
- package/lib/esm/bspline/KnotVector.d.ts +30 -33
- package/lib/esm/bspline/KnotVector.d.ts.map +1 -1
- package/lib/esm/bspline/KnotVector.js +76 -69
- package/lib/esm/bspline/KnotVector.js.map +1 -1
- package/lib/esm/clipping/ClipUtils.d.ts +32 -5
- package/lib/esm/clipping/ClipUtils.d.ts.map +1 -1
- package/lib/esm/clipping/ClipUtils.js +92 -11
- package/lib/esm/clipping/ClipUtils.js.map +1 -1
- package/lib/esm/core-geometry.d.ts +0 -2
- package/lib/esm/core-geometry.d.ts.map +1 -1
- package/lib/esm/core-geometry.js +0 -2
- 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 +5 -5
- package/lib/esm/curve/Arc3d.js.map +1 -1
- package/lib/esm/curve/CurveLocationDetail.d.ts +1 -4
- package/lib/esm/curve/CurveLocationDetail.d.ts.map +1 -1
- package/lib/esm/curve/CurveLocationDetail.js +4 -10
- package/lib/esm/curve/CurveLocationDetail.js.map +1 -1
- package/lib/esm/curve/CurveOps.d.ts +4 -5
- package/lib/esm/curve/CurveOps.d.ts.map +1 -1
- package/lib/esm/curve/CurveOps.js +1 -1
- package/lib/esm/curve/CurveOps.js.map +1 -1
- package/lib/esm/curve/CurveTypes.d.ts +14 -2
- package/lib/esm/curve/CurveTypes.d.ts.map +1 -1
- package/lib/esm/curve/CurveTypes.js.map +1 -1
- package/lib/esm/curve/LineString3d.d.ts +3 -2
- package/lib/esm/curve/LineString3d.d.ts.map +1 -1
- package/lib/esm/curve/LineString3d.js +1 -0
- package/lib/esm/curve/LineString3d.js.map +1 -1
- package/lib/esm/curve/PointString3d.d.ts +2 -1
- package/lib/esm/curve/PointString3d.d.ts.map +1 -1
- package/lib/esm/curve/PointString3d.js.map +1 -1
- package/lib/esm/curve/RegionOps.d.ts +5 -11
- package/lib/esm/curve/RegionOps.d.ts.map +1 -1
- package/lib/esm/curve/RegionOps.js.map +1 -1
- package/lib/esm/curve/internalContexts/CurveCurveCloseApproachXY.d.ts +15 -9
- package/lib/esm/curve/internalContexts/CurveCurveCloseApproachXY.d.ts.map +1 -1
- package/lib/esm/curve/internalContexts/CurveCurveCloseApproachXY.js +69 -57
- package/lib/esm/curve/internalContexts/CurveCurveCloseApproachXY.js.map +1 -1
- package/lib/esm/curve/internalContexts/CurveCurveIntersectXY.d.ts +14 -16
- package/lib/esm/curve/internalContexts/CurveCurveIntersectXY.d.ts.map +1 -1
- package/lib/esm/curve/internalContexts/CurveCurveIntersectXY.js +51 -68
- package/lib/esm/curve/internalContexts/CurveCurveIntersectXY.js.map +1 -1
- package/lib/esm/curve/internalContexts/CurveCurveIntersectXYZ.d.ts.map +1 -1
- package/lib/esm/curve/internalContexts/CurveCurveIntersectXYZ.js +3 -2
- package/lib/esm/curve/internalContexts/CurveCurveIntersectXYZ.js.map +1 -1
- package/lib/esm/curve/internalContexts/MultiChainCollector.d.ts +2 -3
- package/lib/esm/curve/internalContexts/MultiChainCollector.d.ts.map +1 -1
- package/lib/esm/curve/internalContexts/MultiChainCollector.js.map +1 -1
- package/lib/esm/curve/internalContexts/PolygonOffsetContext.d.ts +4 -4
- package/lib/esm/curve/internalContexts/PolygonOffsetContext.d.ts.map +1 -1
- package/lib/esm/curve/internalContexts/PolygonOffsetContext.js +38 -36
- package/lib/esm/curve/internalContexts/PolygonOffsetContext.js.map +1 -1
- package/lib/esm/geometry3d/Angle.d.ts +0 -1
- package/lib/esm/geometry3d/Angle.d.ts.map +1 -1
- package/lib/esm/geometry3d/Angle.js +0 -1
- package/lib/esm/geometry3d/Angle.js.map +1 -1
- package/lib/esm/geometry3d/CoincidentGeometryOps.d.ts +21 -5
- package/lib/esm/geometry3d/CoincidentGeometryOps.d.ts.map +1 -1
- package/lib/esm/geometry3d/CoincidentGeometryOps.js +71 -45
- package/lib/esm/geometry3d/CoincidentGeometryOps.js.map +1 -1
- package/lib/esm/geometry3d/Matrix3d.d.ts +20 -13
- package/lib/esm/geometry3d/Matrix3d.d.ts.map +1 -1
- package/lib/esm/geometry3d/Matrix3d.js +28 -21
- package/lib/esm/geometry3d/Matrix3d.js.map +1 -1
- package/lib/esm/geometry3d/Point3dVector3d.d.ts +11 -2
- package/lib/esm/geometry3d/Point3dVector3d.d.ts.map +1 -1
- package/lib/esm/geometry3d/Point3dVector3d.js +16 -5
- package/lib/esm/geometry3d/Point3dVector3d.js.map +1 -1
- package/lib/esm/geometry3d/PointHelpers.d.ts +58 -20
- package/lib/esm/geometry3d/PointHelpers.d.ts.map +1 -1
- package/lib/esm/geometry3d/PointHelpers.js +213 -62
- package/lib/esm/geometry3d/PointHelpers.js.map +1 -1
- package/lib/esm/geometry3d/Segment1d.d.ts +5 -1
- package/lib/esm/geometry3d/Segment1d.d.ts.map +1 -1
- package/lib/esm/geometry3d/Segment1d.js +11 -7
- package/lib/esm/geometry3d/Segment1d.js.map +1 -1
- package/lib/esm/geometry3d/Transform.d.ts +4 -5
- package/lib/esm/geometry3d/Transform.d.ts.map +1 -1
- package/lib/esm/geometry3d/Transform.js +4 -5
- package/lib/esm/geometry3d/Transform.js.map +1 -1
- package/lib/esm/geometry4d/Point4d.d.ts +13 -0
- package/lib/esm/geometry4d/Point4d.d.ts.map +1 -1
- package/lib/esm/geometry4d/Point4d.js +21 -0
- package/lib/esm/geometry4d/Point4d.js.map +1 -1
- package/lib/esm/numerics/BezierPolynomials.d.ts +88 -64
- package/lib/esm/numerics/BezierPolynomials.d.ts.map +1 -1
- package/lib/esm/numerics/BezierPolynomials.js +92 -73
- package/lib/esm/numerics/BezierPolynomials.js.map +1 -1
- package/lib/esm/numerics/Newton.d.ts +143 -61
- package/lib/esm/numerics/Newton.d.ts.map +1 -1
- package/lib/esm/numerics/Newton.js +229 -65
- package/lib/esm/numerics/Newton.js.map +1 -1
- package/lib/esm/numerics/PascalCoefficients.d.ts +8 -12
- package/lib/esm/numerics/PascalCoefficients.d.ts.map +1 -1
- package/lib/esm/numerics/PascalCoefficients.js +10 -12
- package/lib/esm/numerics/PascalCoefficients.js.map +1 -1
- package/lib/esm/numerics/Polynomials.d.ts +6 -10
- package/lib/esm/numerics/Polynomials.d.ts.map +1 -1
- package/lib/esm/numerics/Polynomials.js +6 -10
- package/lib/esm/numerics/Polynomials.js.map +1 -1
- package/lib/esm/polyface/PolyfaceBuilder.d.ts +3 -0
- package/lib/esm/polyface/PolyfaceBuilder.d.ts.map +1 -1
- package/lib/esm/polyface/PolyfaceBuilder.js +13 -2
- package/lib/esm/polyface/PolyfaceBuilder.js.map +1 -1
- package/lib/esm/polyface/PolyfaceData.d.ts +1 -1
- package/lib/esm/polyface/PolyfaceData.js +1 -1
- package/lib/esm/polyface/PolyfaceData.js.map +1 -1
- package/lib/esm/polyface/PolyfaceQuery.d.ts +38 -11
- package/lib/esm/polyface/PolyfaceQuery.d.ts.map +1 -1
- package/lib/esm/polyface/PolyfaceQuery.js +93 -16
- package/lib/esm/polyface/PolyfaceQuery.js.map +1 -1
- package/lib/esm/serialization/BGFBReader.d.ts +10 -10
- package/lib/esm/serialization/BGFBReader.d.ts.map +1 -1
- package/lib/esm/serialization/BGFBReader.js +69 -42
- package/lib/esm/serialization/BGFBReader.js.map +1 -1
- package/lib/esm/serialization/BGFBWriter.d.ts +8 -8
- package/lib/esm/serialization/BGFBWriter.d.ts.map +1 -1
- package/lib/esm/serialization/BGFBWriter.js +80 -55
- package/lib/esm/serialization/BGFBWriter.js.map +1 -1
- package/lib/esm/serialization/GeometrySamples.d.ts.map +1 -1
- package/lib/esm/serialization/GeometrySamples.js +7 -9
- package/lib/esm/serialization/GeometrySamples.js.map +1 -1
- package/lib/esm/serialization/IModelJsonSchema.d.ts +8 -14
- package/lib/esm/serialization/IModelJsonSchema.d.ts.map +1 -1
- package/lib/esm/serialization/IModelJsonSchema.js +86 -260
- package/lib/esm/serialization/IModelJsonSchema.js.map +1 -1
- package/lib/esm/serialization/SerializationHelpers.d.ts +109 -0
- package/lib/esm/serialization/SerializationHelpers.d.ts.map +1 -0
- package/lib/esm/serialization/SerializationHelpers.js +588 -0
- package/lib/esm/serialization/SerializationHelpers.js.map +1 -0
- package/lib/esm/topology/Graph.d.ts +399 -366
- package/lib/esm/topology/Graph.d.ts.map +1 -1
- package/lib/esm/topology/Graph.js +531 -464
- package/lib/esm/topology/Graph.js.map +1 -1
- package/lib/esm/topology/MaskManager.d.ts +8 -9
- package/lib/esm/topology/MaskManager.d.ts.map +1 -1
- package/lib/esm/topology/MaskManager.js +11 -12
- package/lib/esm/topology/MaskManager.js.map +1 -1
- package/package.json +3 -4
|
@@ -1,188 +1,270 @@
|
|
|
1
|
+
import { CurvePrimitive } from "../curve/CurvePrimitive";
|
|
1
2
|
import { Plane3dByOriginAndVectors } from "../geometry3d/Plane3dByOriginAndVectors";
|
|
2
|
-
|
|
3
|
-
|
|
4
|
-
*
|
|
3
|
+
import { Point3d } from "../geometry3d/Point3dVector3d";
|
|
4
|
+
/**
|
|
5
|
+
* Base class for Newton iterations in various dimensions.
|
|
6
|
+
* Dimension-specific classes carry all dimension-related data and answer generalized queries from this base class.
|
|
5
7
|
* @internal
|
|
6
8
|
*/
|
|
7
9
|
export declare abstract class AbstractNewtonIterator {
|
|
8
|
-
/** Compute a step.
|
|
10
|
+
/** Compute a step. The current x and function values must be retained for use in later method calls. */
|
|
9
11
|
abstract computeStep(): boolean;
|
|
10
|
-
/**
|
|
11
|
-
*
|
|
12
|
+
/**
|
|
13
|
+
* Return the current step size, scaled for use in tolerance tests.
|
|
14
|
+
* * This is a single number, typically the max of various per-dimension `dx/(1+x)` for the x and dx of that dimension.
|
|
12
15
|
*/
|
|
13
16
|
abstract currentStepSize(): number;
|
|
14
17
|
/**
|
|
15
|
-
* Apply the current step (in all dimensions)
|
|
18
|
+
* Apply the current step (in all dimensions).
|
|
16
19
|
* @param isFinalStep true if this is a final step.
|
|
17
20
|
*/
|
|
18
21
|
abstract applyCurrentStep(isFinalStep: boolean): boolean;
|
|
19
22
|
/**
|
|
23
|
+
* The constructor.
|
|
20
24
|
* @param stepSizeTarget tolerance to consider a single step converged.
|
|
21
|
-
* This number should be "moderately" strict.
|
|
25
|
+
* This number should be "moderately" strict. Because 2 successive convergences are required,
|
|
22
26
|
* it is expected that a first "accept" for (say) 10 to 14 digit step will be followed by another
|
|
23
|
-
* iteration.
|
|
24
|
-
* 20 to 28.
|
|
27
|
+
* iteration. A well behaved newton would then hypothetically double the number of digits to
|
|
28
|
+
* 20 to 28. Since the IEEE double only carries 16 digits, this second-convergence step will
|
|
25
29
|
* typically achieve full precision.
|
|
26
30
|
* @param successiveConvergenceTarget number of successive convergences required for acceptance.
|
|
27
|
-
* @param maxIterations max number of iterations.
|
|
28
|
-
*
|
|
31
|
+
* @param maxIterations max number of iterations. A typical newton step converges in 3 to 6 iterations.
|
|
32
|
+
* Allow 15 to 20 to catch difficult cases.
|
|
29
33
|
*/
|
|
30
34
|
protected constructor(stepSizeTolerance?: number, successiveConvergenceTarget?: number, maxIterations?: number);
|
|
31
|
-
/** Number of consecutive steps which passed convergence condition */
|
|
35
|
+
/** Number of consecutive steps which passed convergence condition. */
|
|
32
36
|
protected _numAccepted: number;
|
|
33
|
-
/** Target number of successive convergences */
|
|
37
|
+
/** Target number of successive convergences. */
|
|
34
38
|
protected _successiveConvergenceTarget: number;
|
|
35
|
-
/**
|
|
39
|
+
/** Convergence target (the implementation-specific currentStepSize is compared to this). */
|
|
36
40
|
protected _stepSizeTolerance: number;
|
|
37
|
-
/** Max iterations allowed */
|
|
41
|
+
/** Max iterations allowed. */
|
|
38
42
|
protected _maxIterations: number;
|
|
39
|
-
/**
|
|
43
|
+
/** Number of iterations (incremented at each step). */
|
|
40
44
|
numIterations: number;
|
|
41
45
|
/**
|
|
42
46
|
* Test if a step is converged.
|
|
43
|
-
* * Convergence is accepted with enough (_successiveConvergenceTarget) small steps (according to _stepSizeTolerance)
|
|
44
|
-
*
|
|
47
|
+
* * Convergence is accepted with enough (_successiveConvergenceTarget) small steps (according to _stepSizeTolerance)
|
|
48
|
+
* occur in succession.
|
|
49
|
+
* @param delta step size as reported by currentStepSize.
|
|
45
50
|
*/
|
|
46
51
|
testConvergence(delta: number): boolean;
|
|
47
52
|
/**
|
|
48
53
|
* Run iterations, calling various methods from base and derived classes:
|
|
49
54
|
* * computeStep -- typically evaluate derivatives and solve linear system.
|
|
50
|
-
* * currentStepSize -- return numeric measure of the step just computed by computeStep
|
|
55
|
+
* * currentStepSize -- return numeric measure of the step just computed by computeStep.
|
|
51
56
|
* * testConvergence -- test if the step from currentStepSize (along with recent steps) is converged.
|
|
52
|
-
* * applyCurrentStep -- apply the step to the independent variables
|
|
57
|
+
* * applyCurrentStep -- apply the step to the independent variables.
|
|
53
58
|
*/
|
|
54
59
|
runIterations(): boolean;
|
|
55
60
|
}
|
|
56
|
-
/**
|
|
61
|
+
/**
|
|
62
|
+
* Object to evaluate a newton function. The object must retain most-recent function and derivative
|
|
57
63
|
* values for immediate query.
|
|
58
64
|
* @internal
|
|
59
65
|
*/
|
|
60
66
|
export declare abstract class NewtonEvaluatorRtoRD {
|
|
61
|
-
/**
|
|
67
|
+
/** Evaluate the function and its derivative at x. */
|
|
62
68
|
abstract evaluate(x: number): boolean;
|
|
63
|
-
/**
|
|
69
|
+
/** Most recent function value, i.e., f(x_n). */
|
|
64
70
|
currentF: number;
|
|
65
|
-
/**
|
|
71
|
+
/** Most recent evaluated derivative, i.e., f'(x_n). */
|
|
66
72
|
currentdFdX: number;
|
|
67
73
|
}
|
|
68
74
|
/**
|
|
69
75
|
* Newton iterator for use when both function and derivative can be evaluated.
|
|
76
|
+
* To solve `f(x) = 0`, the Newton iteration is `x_{n+1} = x_n - dx = x_n - f(x_n)/f'(x_n)`.
|
|
77
|
+
* To solve `f(x) = target` which is equivalent to solving `g(x) = f(x) - target = 0`, the Newton iteration is
|
|
78
|
+
* `x_{n+1} = x_n - dx = x_n - g(x_n)/g'(x_n) = x_n - (f(x_n)-target)/f'(x_n)`.
|
|
70
79
|
* @internal
|
|
71
80
|
*/
|
|
72
81
|
export declare class Newton1dUnbounded extends AbstractNewtonIterator {
|
|
73
82
|
private _func;
|
|
83
|
+
/** Current step is dx. */
|
|
74
84
|
private _currentStep;
|
|
85
|
+
/** Current X is x_n. */
|
|
75
86
|
private _currentX;
|
|
87
|
+
/** The target */
|
|
76
88
|
private _target;
|
|
77
89
|
/**
|
|
78
|
-
* Constructor for 1D newton iteration with
|
|
79
|
-
* @param func function that returns both function and derivative.
|
|
90
|
+
* Constructor for 1D newton iteration with derivatives.
|
|
91
|
+
* @param func function that returns both function value and derivative.
|
|
80
92
|
*/
|
|
81
93
|
constructor(func: NewtonEvaluatorRtoRD);
|
|
82
|
-
/** Set the independent variable */
|
|
94
|
+
/** Set the independent variable, i.e., x_n. */
|
|
83
95
|
setX(x: number): boolean;
|
|
84
|
-
/** Get the independent variable */
|
|
96
|
+
/** Get the independent variable, i.e., x_n. */
|
|
85
97
|
getX(): number;
|
|
86
|
-
/** Set the target function value */
|
|
98
|
+
/** Set the target function value. */
|
|
87
99
|
setTarget(y: number): void;
|
|
88
|
-
/**
|
|
100
|
+
/** Move the current X by the just-computed step, i.e., `x_n - dx`. */
|
|
89
101
|
applyCurrentStep(): boolean;
|
|
90
|
-
/** Compute the univariate newton step. */
|
|
102
|
+
/** Compute the univariate newton step dx. */
|
|
91
103
|
computeStep(): boolean;
|
|
92
|
-
/** Return the current step size as a relative number. */
|
|
104
|
+
/** Return the current step size as a relative number, i.e., `|dx / (1 + |x_n|)|`. */
|
|
93
105
|
currentStepSize(): number;
|
|
94
106
|
}
|
|
95
|
-
/**
|
|
107
|
+
/**
|
|
108
|
+
* Object to evaluate a newton function (without derivative). The object must retain most-recent function value.
|
|
96
109
|
* @internal
|
|
97
110
|
*/
|
|
98
111
|
export declare abstract class NewtonEvaluatorRtoR {
|
|
99
112
|
/** Evaluate function value into member currentF */
|
|
100
113
|
abstract evaluate(x: number): boolean;
|
|
101
|
-
/** Most recent function evaluation. */
|
|
114
|
+
/** Most recent function evaluation, i.e., f(x_n). */
|
|
102
115
|
currentF: number;
|
|
103
116
|
}
|
|
104
|
-
/**
|
|
117
|
+
/**
|
|
118
|
+
* Newton iteration for a univariate function, using approximate derivatives.
|
|
119
|
+
* To approximate the derivatives we use a small step `h`, i.e., `f'(x_n) = (f(x_n + h) - f(x_n)) / h`.
|
|
120
|
+
* Therefore, to solve `f(x) = 0`, the iteration is
|
|
121
|
+
* `x_{n+1} = x_n - dx = x_n - f(x_n)/f'(x_n) = x_n - f(x_n) * h / (f(x_n + h) - f(x_n))`.
|
|
105
122
|
* @internal
|
|
106
123
|
*/
|
|
107
124
|
export declare class Newton1dUnboundedApproximateDerivative extends AbstractNewtonIterator {
|
|
108
125
|
private _func;
|
|
126
|
+
/** Current step is dx. */
|
|
109
127
|
private _currentStep;
|
|
128
|
+
/** Current X is x_n. */
|
|
110
129
|
private _currentX;
|
|
111
|
-
/**
|
|
130
|
+
/**
|
|
131
|
+
* Step size for approximate derivative for the iteration.
|
|
112
132
|
* * Initialized to 1e-8, which is appropriate for iteration in fraction space.
|
|
113
133
|
* * Should be larger for iteration with real distance as x.
|
|
114
134
|
*/
|
|
115
135
|
derivativeH: number;
|
|
116
136
|
/**
|
|
117
137
|
* Constructor for 1D newton iteration with approximate derivatives.
|
|
118
|
-
* @param func function that returns
|
|
138
|
+
* @param func function that only returns function value (and not derivative).
|
|
119
139
|
*/
|
|
120
140
|
constructor(func: NewtonEvaluatorRtoR);
|
|
121
|
-
/** Set the
|
|
141
|
+
/** Set the independent variable, i.e., x_n. */
|
|
122
142
|
setX(x: number): boolean;
|
|
123
|
-
/** Get the independent variable */
|
|
143
|
+
/** Get the independent variable, i.e., x_n. */
|
|
124
144
|
getX(): number;
|
|
125
|
-
/**
|
|
145
|
+
/** Move the current X by the just-computed step, i.e., `x_n - dx`. */
|
|
126
146
|
applyCurrentStep(): boolean;
|
|
127
|
-
/** Univariate newton step computed with
|
|
147
|
+
/** Univariate newton step dx, computed with approximate derivative. */
|
|
128
148
|
computeStep(): boolean;
|
|
129
|
-
/** Return the current step size as a relative number. */
|
|
149
|
+
/** Return the current step size as a relative number, i.e., `|dx / (1 + |x_n|)|`. */
|
|
130
150
|
currentStepSize(): number;
|
|
131
151
|
}
|
|
132
|
-
/**
|
|
152
|
+
/**
|
|
153
|
+
* Object to evaluate a 2-parameter newton function with derivatives.
|
|
133
154
|
* @internal
|
|
134
155
|
*/
|
|
135
156
|
export declare abstract class NewtonEvaluatorRRtoRRD {
|
|
136
|
-
/**
|
|
157
|
+
/**
|
|
158
|
+
* Iteration controller calls this to ask for evaluation of the function and its two partial derivatives.
|
|
137
159
|
* * The implementation returns true, it must set the currentF object.
|
|
138
160
|
*/
|
|
139
161
|
abstract evaluate(x: number, y: number): boolean;
|
|
140
|
-
/**
|
|
162
|
+
/**
|
|
163
|
+
* Most recent function evaluation as parts of the plane.
|
|
164
|
+
* * See doc of [[Newton2dUnboundedWithDerivative]] class for info on 2d newton method.
|
|
165
|
+
* * For `F(u,v) := (x(u,v), y(u,v))` the returned plane stores the following evaluations at current value `X := (u,v)`:
|
|
166
|
+
* * `origin` = F(X) = (x(X), y(X))
|
|
167
|
+
* * `vectorU` = F_u(X) = partial deriv of F wrt u at X = (x_u(X), y_u(X)) = 1st col of Jacobian matrix evaluated at X
|
|
168
|
+
* * `vectorV` = F_v(X) = partial deriv of F wrt v at X = (x_v(X), y_v(X)) = 2nd col of Jacobian matrix evaluated at X
|
|
169
|
+
*/
|
|
141
170
|
currentF: Plane3dByOriginAndVectors;
|
|
142
171
|
/**
|
|
143
|
-
*
|
|
172
|
+
* Constructor.
|
|
144
173
|
* * This creates a currentF object to (repeatedly) receive function and derivatives.
|
|
145
174
|
*/
|
|
146
175
|
constructor();
|
|
147
176
|
}
|
|
148
177
|
/**
|
|
149
178
|
* Implement evaluation steps for newton iteration in 2 dimensions, using caller supplied NewtonEvaluatorRRtoRRD object.
|
|
179
|
+
* * Suppose we want to find the roots of `F(u,v) := (x(u,v), y(u,v))`. Writing `X := (u,v)` and `F(X)` as column vectors,
|
|
180
|
+
* the 2D Newton's iteration to find a root of `F` is given by:
|
|
181
|
+
* `X_{n+1} = X_n - dX = X_n - JInv(X_n)F(X_n)`, where `JInv` is the inverse of the Jacobian matrix `J`, and `J` is
|
|
182
|
+
* defined by the partial derivatives of the component functions of F:
|
|
183
|
+
*
|
|
184
|
+
* `[dx/du dx/dv]`
|
|
185
|
+
*
|
|
186
|
+
* `[dy/du dy/dv]`
|
|
150
187
|
* @internal
|
|
151
188
|
*/
|
|
152
189
|
export declare class Newton2dUnboundedWithDerivative extends AbstractNewtonIterator {
|
|
153
190
|
private _func;
|
|
191
|
+
/** Current step, or dX = (du, dv). */
|
|
154
192
|
private _currentStep;
|
|
193
|
+
/** Current uv parameters, or X_n = (u_n, v_n). */
|
|
155
194
|
private _currentUV;
|
|
195
|
+
/**
|
|
196
|
+
* Constructor for 2D newton iteration with derivatives.
|
|
197
|
+
* @param func function that returns both function value and derivative.
|
|
198
|
+
*/
|
|
156
199
|
constructor(func: NewtonEvaluatorRRtoRRD);
|
|
157
|
-
/** Set the current uv
|
|
158
|
-
setUV(
|
|
159
|
-
/** Get the current u
|
|
200
|
+
/** Set the current uv parameters, i.e., `X_n = (u_n, v_n)`. */
|
|
201
|
+
setUV(u: number, v: number): boolean;
|
|
202
|
+
/** Get the current u parameter of X_n, i.e., u_n. */
|
|
160
203
|
getU(): number;
|
|
161
|
-
/** Get the current v
|
|
204
|
+
/** Get the current v parameter of X_n, i.e., v_n. */
|
|
162
205
|
getV(): number;
|
|
163
|
-
/**
|
|
206
|
+
/** Update the current uv parameter by currentStep, i.e., compute `X_{n+1} := X_n - dX = (u_n - du, v_n - dv)`. */
|
|
164
207
|
applyCurrentStep(): boolean;
|
|
165
|
-
/**
|
|
166
|
-
*
|
|
208
|
+
/**
|
|
209
|
+
* Evaluate the functions and derivatives at `X_n = (u_n, v_n)`, and solve the Jacobian matrix equation to
|
|
210
|
+
* compute `dX = (du, dv)`.
|
|
167
211
|
*/
|
|
168
212
|
computeStep(): boolean;
|
|
169
213
|
/**
|
|
170
|
-
* Return the
|
|
214
|
+
* Return the current relative step size, i.e., the larger absolute component of `dX / (1 + |X_n|)`
|
|
171
215
|
*/
|
|
172
216
|
currentStepSize(): number;
|
|
173
217
|
}
|
|
174
218
|
/**
|
|
175
|
-
* SimpleNewton has static methods for newton methods with evaluated functions presented as immediate arguments
|
|
219
|
+
* SimpleNewton has static methods for newton methods with evaluated functions presented as immediate arguments
|
|
220
|
+
* (not function object).
|
|
176
221
|
* @internal
|
|
177
222
|
*/
|
|
178
223
|
export declare class SimpleNewton {
|
|
179
|
-
/**
|
|
180
|
-
*
|
|
181
|
-
* *
|
|
182
|
-
*
|
|
183
|
-
*
|
|
224
|
+
/**
|
|
225
|
+
* Run a one-dimensional newton iteration with separate functions for function and derivative.
|
|
226
|
+
* * Completion is at 2 (TWO) successive passes at `absoluteTolerance + relTol * abs(x)`, where relTol is
|
|
227
|
+
* chosen internally.
|
|
228
|
+
* * `absoluteTolerance` is usually aggressively tight -- should come into play only for x near zero.
|
|
229
|
+
* * The `relTol` is fluffy (for instance around 1e-11) but in properly converging cases the extra pass after
|
|
230
|
+
* first success normally moves to full machine precision.
|
|
184
231
|
* * This is an open-loop newton -- it just runs, and returns undefined if anything bad happens.
|
|
185
232
|
*/
|
|
186
233
|
static runNewton1D(x: number, func: (x: number) => number | undefined, derivative: (x: number) => number | undefined, absoluteTolerance?: number): number | undefined;
|
|
187
234
|
}
|
|
235
|
+
/**
|
|
236
|
+
* Class to evaluate XY intersection between 2 curve primitives using the Newton method.
|
|
237
|
+
* @internal
|
|
238
|
+
*/
|
|
239
|
+
export declare class CurveCurveIntersectionXYRRToRRD extends NewtonEvaluatorRRtoRRD {
|
|
240
|
+
private _curveP;
|
|
241
|
+
private _curveQ;
|
|
242
|
+
private _rayP;
|
|
243
|
+
private _rayQ;
|
|
244
|
+
constructor(curveP: CurvePrimitive, curveQ: CurvePrimitive);
|
|
245
|
+
evaluate(fractionU: number, fractionV: number): boolean;
|
|
246
|
+
}
|
|
247
|
+
/**
|
|
248
|
+
* Class to evaluate XY close approach between a curve primitive and a point using the Newton method.
|
|
249
|
+
* @internal
|
|
250
|
+
*/
|
|
251
|
+
export declare class CurvePointCloseApproachXYRtoRD extends NewtonEvaluatorRtoRD {
|
|
252
|
+
private _curveP;
|
|
253
|
+
private _pointQ;
|
|
254
|
+
private _planeP;
|
|
255
|
+
constructor(curveP: CurvePrimitive, pointQ: Point3d);
|
|
256
|
+
evaluate(fractionU: number): boolean;
|
|
257
|
+
}
|
|
258
|
+
/**
|
|
259
|
+
* Class to evaluate XY close approach between 2 curve primitives using the Newton method.
|
|
260
|
+
* @internal
|
|
261
|
+
*/
|
|
262
|
+
export declare class CurveCurveCloseApproachXYRRtoRRD extends NewtonEvaluatorRRtoRRD {
|
|
263
|
+
private _curveP;
|
|
264
|
+
private _curveQ;
|
|
265
|
+
private _planeP;
|
|
266
|
+
private _planeQ;
|
|
267
|
+
constructor(curveP: CurvePrimitive, curveQ: CurvePrimitive);
|
|
268
|
+
evaluate(fractionU: number, fractionV: number): boolean;
|
|
269
|
+
}
|
|
188
270
|
//# sourceMappingURL=Newton.d.ts.map
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"Newton.d.ts","sourceRoot":"","sources":["../../../src/numerics/Newton.ts"],"names":[],"mappings":"AAUA,OAAO,EAAE,yBAAyB,EAAE,MAAM,yCAAyC,CAAC;
|
|
1
|
+
{"version":3,"file":"Newton.d.ts","sourceRoot":"","sources":["../../../src/numerics/Newton.ts"],"names":[],"mappings":"AAUA,OAAO,EAAE,cAAc,EAAE,MAAM,yBAAyB,CAAC;AACzD,OAAO,EAAE,yBAAyB,EAAE,MAAM,yCAAyC,CAAC;AAEpF,OAAO,EAAE,OAAO,EAAE,MAAM,+BAA+B,CAAC;AAMxD;;;;GAIG;AACH,8BAAsB,sBAAsB;IAC1C,wGAAwG;aACxF,WAAW,IAAI,OAAO;IACtC;;;OAGG;aACa,eAAe,IAAI,MAAM;IACzC;;;OAGG;aACa,gBAAgB,CAAC,WAAW,EAAE,OAAO,GAAG,OAAO;IAC/D;;;;;;;;;;;OAWG;IACH,SAAS,aACP,iBAAiB,GAAE,MAAgB,EACnC,2BAA2B,GAAE,MAAU,EACvC,aAAa,GAAE,MAAW;IAM5B,sEAAsE;IACtE,SAAS,CAAC,YAAY,EAAE,MAAM,CAAK;IACnC,gDAAgD;IAChD,SAAS,CAAC,4BAA4B,EAAE,MAAM,CAAC;IAC/C,4FAA4F;IAC5F,SAAS,CAAC,kBAAkB,EAAE,MAAM,CAAC;IACrC,8BAA8B;IAC9B,SAAS,CAAC,cAAc,EAAE,MAAM,CAAC;IACjC,uDAAuD;IAChD,aAAa,EAAE,MAAM,CAAK;IACjC;;;;;OAKG;IACI,eAAe,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO;IAQ9C;;;;;;OAMG;IACI,aAAa,IAAI,OAAO;CAYhC;AACD;;;;GAIG;AACH,8BAAsB,oBAAoB;IACxC,qDAAqD;aACrC,QAAQ,CAAC,CAAC,EAAE,MAAM,GAAG,OAAO;IAC5C,gDAAgD;IACzC,QAAQ,EAAG,MAAM,CAAC;IACzB,uDAAuD;IAChD,WAAW,EAAG,MAAM,CAAC;CAC7B;AACD;;;;;;GAMG;AACH,qBAAa,iBAAkB,SAAQ,sBAAsB;IAC3D,OAAO,CAAC,KAAK,CAAuB;IACpC,0BAA0B;IAC1B,OAAO,CAAC,YAAY,CAAU;IAC9B,wBAAwB;IACxB,OAAO,CAAC,SAAS,CAAU;IAC3B,iBAAiB;IACjB,OAAO,CAAC,OAAO,CAAU;IACzB;;;OAGG;gBACgB,IAAI,EAAE,oBAAoB;IAK7C,+CAA+C;IACxC,IAAI,CAAC,CAAC,EAAE,MAAM,GAAG,OAAO;IAI/B,+CAA+C;IACxC,IAAI,IAAI,MAAM;IAGrB,qCAAqC;IAC9B,SAAS,CAAC,CAAC,EAAE,MAAM,GAAG,IAAI;IAGjC,sEAAsE;IAC/D,gBAAgB,IAAI,OAAO;IAIlC,6CAA6C;IACtC,WAAW,IAAI,OAAO;IAU7B,qFAAqF;IAC9E,eAAe,IAAI,MAAM;CAGjC;AAED;;;GAGG;AACH,8BAAsB,mBAAmB;IACvC,mDAAmD;aACnC,QAAQ,CAAC,CAAC,EAAE,MAAM,GAAG,OAAO;IAC5C,qDAAqD;IAC9C,QAAQ,EAAG,MAAM,CAAC;CAC1B;AAED;;;;;;GAMG;AACH,qBAAa,sCAAuC,SAAQ,sBAAsB;IAChF,OAAO,CAAC,KAAK,CAAsB;IACnC,0BAA0B;IAC1B,OAAO,CAAC,YAAY,CAAU;IAC9B,wBAAwB;IACxB,OAAO,CAAC,SAAS,CAAU;IAC3B;;;;OAIG;IACI,WAAW,EAAE,MAAM,CAAC;IAE3B;;;OAGG;gBACgB,IAAI,EAAE,mBAAmB;IAK5C,+CAA+C;IACxC,IAAI,CAAC,CAAC,EAAE,MAAM,GAAG,OAAO;IAI/B,+CAA+C;IACxC,IAAI,IAAI,MAAM;IAGrB,sEAAsE;IAC/D,gBAAgB,IAAI,OAAO;IAIlC,uEAAuE;IAChE,WAAW,IAAI,OAAO;IAc7B,qFAAqF;IAC9E,eAAe,IAAI,MAAM;CAGjC;AAED;;;GAGG;AACH,8BAAsB,sBAAsB;IAC1C;;;OAGG;aACa,QAAQ,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,OAAO;IACvD;;;;;;;OAOG;IACI,QAAQ,EAAG,yBAAyB,CAAC;IAC5C;;;OAGG;;CAIJ;AAED;;;;;;;;;;;GAWG;AACH,qBAAa,+BAAgC,SAAQ,sBAAsB;IACzE,OAAO,CAAC,KAAK,CAAyB;IACtC,sCAAsC;IACtC,OAAO,CAAC,YAAY,CAAW;IAC/B,kDAAkD;IAClD,OAAO,CAAC,UAAU,CAAU;IAC5B;;;OAGG;gBACgB,IAAI,EAAE,sBAAsB;IAO/C,+DAA+D;IACxD,KAAK,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,OAAO;IAI3C,qDAAqD;IAC9C,IAAI,IAAI,MAAM;IAGrB,qDAAqD;IAC9C,IAAI,IAAI,MAAM;IAGrB,kHAAkH;IAC3G,gBAAgB,IAAI,OAAO;IAKlC;;;OAGG;IACI,WAAW,IAAI,OAAO;IAe7B;;OAEG;IACI,eAAe,IAAI,MAAM;CAMjC;AACD;;;;GAIG;AACH,qBAAa,YAAY;IACvB;;;;;;;;OAQG;WACW,WAAW,CACvB,CAAC,EAAE,MAAM,EACT,IAAI,EAAE,CAAC,CAAC,EAAE,MAAM,KAAK,MAAM,GAAG,SAAS,EACvC,UAAU,EAAE,CAAC,CAAC,EAAE,MAAM,KAAK,MAAM,GAAG,SAAS,EAC7C,iBAAiB,GAAE,MAAoC,GACtD,MAAM,GAAG,SAAS;CAyBtB;AAED;;;GAGG;AACH,qBAAa,+BAAgC,SAAQ,sBAAsB;IACzE,OAAO,CAAC,OAAO,CAAiB;IAChC,OAAO,CAAC,OAAO,CAAiB;IAChC,OAAO,CAAC,KAAK,CAAQ;IACrB,OAAO,CAAC,KAAK,CAAQ;gBACT,MAAM,EAAE,cAAc,EAAE,MAAM,EAAE,cAAc;IAOnD,QAAQ,CAAC,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,OAAO;CAmB/D;AAED;;;GAGG;AACH,qBAAa,8BAA+B,SAAQ,oBAAoB;IACtE,OAAO,CAAC,OAAO,CAAiB;IAChC,OAAO,CAAC,OAAO,CAAU;IACzB,OAAO,CAAC,OAAO,CAA4B;gBAC/B,MAAM,EAAE,cAAc,EAAE,MAAM,EAAE,OAAO;IAM5C,QAAQ,CAAC,SAAS,EAAE,MAAM,GAAG,OAAO;CAoB5C;AAED;;;GAGG;AACH,qBAAa,gCAAiC,SAAQ,sBAAsB;IAC1E,OAAO,CAAC,OAAO,CAAiB;IAChC,OAAO,CAAC,OAAO,CAAiB;IAChC,OAAO,CAAC,OAAO,CAA4B;IAC3C,OAAO,CAAC,OAAO,CAA4B;gBAC/B,MAAM,EAAE,cAAc,EAAE,MAAM,EAAE,cAAc;IAOnD,QAAQ,CAAC,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,OAAO;CAqC/D"}
|