@itwin/core-geometry 3.0.0-dev.76 → 3.0.0-dev.80

package/lib/esm/bspline/BSplineCurve3dH.js

@@ -0,0 +1,421 @@
+/*---------------------------------------------------------------------------------------------
+* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+* See LICENSE.md in the project root for license terms and full copyright notice.
+*--------------------------------------------------------------------------------------------*/
+/** @packageDocumentation
+ * @module Serialization
+ */
+// import { Point2d } from "../Geometry2d";
+import { CurvePrimitive } from "../curve/CurvePrimitive";
+import { StrokeCountMap } from "../curve/Query/StrokeCountMap";
+import { Geometry } from "../Geometry";
+/* eslint-disable @typescript-eslint/naming-convention, no-empty, no-console*/
+import { Point3d } from "../geometry3d/Point3dVector3d";
+import { Point3dArray, Point4dArray } from "../geometry3d/PointHelpers";
+import { Point4d } from "../geometry4d/Point4d";
+import { BezierCurve3dH } from "./BezierCurve3dH";
+import { BSplineCurve3dBase } from "./BSplineCurve";
+import { KnotVector } from "./KnotVector";
+/**
+ * Weighted (Homogeneous) BSplineCurve in 3d
+ * @public
+ */
+export class BSplineCurve3dH extends BSplineCurve3dBase {
+    constructor(numPoles, order, knots) {
+        super(4, numPoles, order, knots);
+    }
+    initializeWorkBezier() {
+        if (this._workBezier === undefined)
+            this._workBezier = BezierCurve3dH.createOrder(this.order);
+        return this._workBezier;
+    }
+    /** Test if `other` is an instance of `BSplineCurve3dH` */
+    isSameGeometryClass(other) { return other instanceof BSplineCurve3dH; }
+    /** Apply `transform` to the curve */
+    tryTransformInPlace(transform) { Point4dArray.multiplyInPlace(transform, this._bcurve.packedData); return true; }
+    /** Get a pole, normalized to Point3d. */
+    getPolePoint3d(poleIndex, result) {
+        const k = this.poleIndexToDataIndex(poleIndex);
+        if (k !== undefined) {
+            const data = this._bcurve.packedData;
+            const divW = Geometry.conditionalDivideFraction(1.0, data[k + 3]);
+            if (divW !== undefined)
+                return Point3d.create(data[k] * divW, data[k + 1] * divW, data[k + 2] * divW, result);
+        }
+        return undefined;
+    }
+    /** Get a pole as Point4d */
+    getPolePoint4d(poleIndex, result) {
+        const k = this.poleIndexToDataIndex(poleIndex);
+        if (k !== undefined) {
+            const data = this._bcurve.packedData;
+            return Point4d.create(data[k], data[k + 1], data[k + 2], data[k + 3], result);
+        }
+        return undefined;
+    }
+    /** map a spanIndex and fraction to a knot value. */
+    spanFractionToKnot(span, localFraction) {
+        return this._bcurve.spanFractionToKnot(span, localFraction);
+    }
+    /** Return a simple array of arrays with the control points as `[[x,y,z,w],[x,y,z,w],..]` */
+    copyPoints() { return Point3dArray.unpackNumbersToNestedArrays(this._bcurve.packedData, 4); }
+    /** Return a simple array of the control points coordinates */
+    copyPointsFloat64Array() { return this._bcurve.packedData.slice(); }
+    /** Return a simple array of the control points xyz coordinates.  */
+    copyXYZFloat64Array(deweighted) {
+        const numValue = this.numPoles * 3;
+        const result = new Float64Array(numValue);
+        let k = 0;
+        for (let poleIndex = 0; poleIndex < this.numPoles; poleIndex++) {
+            let i = poleIndex * 4;
+            if (deweighted) {
+                const w = this._bcurve.packedData[i + 3];
+                const dw = w === 0.0 ? 1.0 : 1.0 / w;
+                result[k++] = this._bcurve.packedData[i++] * dw;
+                result[k++] = this._bcurve.packedData[i++] * dw;
+                result[k++] = this._bcurve.packedData[i++] * dw;
+            }
+            else {
+                result[k++] = this._bcurve.packedData[i++];
+                result[k++] = this._bcurve.packedData[i++];
+                result[k++] = this._bcurve.packedData[i++];
+            }
+        }
+        return result;
+    }
+    copyWeightsFloat64Array() {
+        const result = new Float64Array(this.numPoles);
+        for (let poleIndex = 0; poleIndex < this.numPoles; poleIndex++) {
+            result[poleIndex] = this._bcurve.packedData[4 * poleIndex + 3];
+        }
+        return result;
+    }
+    /** Create a bspline with uniform knots.
+     * * Control points may be supplied as:
+     *   * array of Point4d, with weight already multiplied into the `[wx,wy,wz,w]`
+     *   * array of Point3d, with implied weight 1.
+     *   * Float64Array, blocked as xyzw, i.e. 4 doubles per control point.
+     * @param controlPoints pole data in array form as noted above.
+     * @param order  curve order (1 more than degree)
+     */
+    static createUniformKnots(controlPoints, order) {
+        const numPoles = (controlPoints instanceof Float64Array) ? controlPoints.length / 4 : controlPoints.length;
+        if (order < 1 || numPoles < order)
+            return undefined;
+        const knots = KnotVector.createUniformClamped(controlPoints.length, order - 1, 0.0, 1.0);
+        const curve = new BSplineCurve3dH(numPoles, order, knots);
+        let i = 0;
+        if (controlPoints[0] instanceof Point3d) {
+            for (const p of controlPoints) {
+                curve._bcurve.packedData[i++] = p.x;
+                curve._bcurve.packedData[i++] = p.y;
+                curve._bcurve.packedData[i++] = p.z;
+                curve._bcurve.packedData[i++] = 1.0;
+            }
+        }
+        else if (controlPoints[0] instanceof Point4d) {
+            for (const p of controlPoints) {
+                curve._bcurve.packedData[i++] = p.x;
+                curve._bcurve.packedData[i++] = p.y;
+                curve._bcurve.packedData[i++] = p.z;
+                curve._bcurve.packedData[i++] = p.w;
+            }
+        }
+        else if (controlPoints instanceof Float64Array) {
+            const numQ = controlPoints.length;
+            for (let k = 0; k < numQ; k++) {
+                curve._bcurve.packedData[k] = controlPoints[k];
+            }
+        }
+        else {
+            return undefined;
+        }
+        return curve;
+    }
+    /**
+     * Assemble a variously structured control points into packed array of [xyzw].
+     * @param controlPoints
+     */
+    static assemblePackedXYZW(controlPoints) {
+        if (controlPoints instanceof Float64Array) {
+            return controlPoints.slice();
+        }
+        else if (Array.isArray(controlPoints)) {
+            const cpArray = controlPoints; // This should not be necessary -- but the predicate controlPoints[0] is not recognized even though Array.isArray(controlPoints) was just passed.
+            if (cpArray[0] instanceof Point4d) {
+                const numPoints = cpArray.length;
+                const packedPoints = new Float64Array(4 * numPoints);
+                let i = 0;
+                for (const p of controlPoints) {
+                    packedPoints[i++] = p.x;
+                    packedPoints[i++] = p.y;
+                    packedPoints[i++] = p.z;
+                    packedPoints[i++] = p.w;
+                }
+                return packedPoints;
+            }
+            else if (cpArray[0] instanceof Point3d) {
+                const numPoints = cpArray.length;
+                const packedPoints = new Float64Array(4 * numPoints);
+                let i = 0;
+                for (const p of controlPoints) {
+                    packedPoints[i++] = p.x;
+                    packedPoints[i++] = p.y;
+                    packedPoints[i++] = p.z;
+                    packedPoints[i++] = 1.0;
+                }
+                return packedPoints;
+            }
+        }
+        else {
+            const obj = controlPoints;
+            if (obj.xyz instanceof Float64Array && obj.weights instanceof Float64Array && obj.xyz.length === 3 * obj.weights.length) {
+                const numPoints = obj.weights.length;
+                const packedPoints = new Float64Array(4 * numPoints);
+                let m = 0;
+                for (let i = 0; i < obj.weights.length; i++) {
+                    const k = 3 * i;
+                    packedPoints[m++] = obj.xyz[k];
+                    packedPoints[m++] = obj.xyz[k + 1];
+                    packedPoints[m++] = obj.xyz[k + 2];
+                    packedPoints[m++] = obj.weights[i];
+                }
+                return packedPoints;
+            }
+        }
+        return undefined;
+    }
+    /** Create a bspline with given knots.
+     * * The poles have several variants:
+     *   * Float64Array(4 * numPoles) in blocks of [wx,xy,wz,w]
+     *   * Point4d[numPoles]
+     *   * Point3d[], with implied unit weight to be added.
+     *   * {xyz: Float64Array(3 * numPoles), weights: Float64Array (numPoles)}
+     *
+     * *  Two count conditions are recognized:
+     *
+     * ** If poleArray.length + order == knotArray.length, the first and last are assumed to be the
+     *      extraneous knots of classic clamping.
+     * ** If poleArray.length + order == knotArray.length + 2, the knots are in modern form.
+     *
+     */
+    static create(controlPointData, knotArray, order) {
+        if (order < 2)
+            return undefined;
+        const controlPoints = this.assemblePackedXYZW(controlPointData);
+        if (controlPoints instanceof Float64Array) {
+            const numPoles = Math.floor(controlPoints.length / 4);
+            const numKnots = knotArray.length;
+            // shift knots-of-interest limits for overclamped case ...
+            const skipFirstAndLast = (numPoles + order === numKnots);
+            const knots = KnotVector.create(knotArray, order - 1, skipFirstAndLast);
+            if (numPoles < order)
+                return undefined;
+            const curve = new BSplineCurve3dH(numPoles, order, knots);
+            let i = 0;
+            for (const coordinate of controlPoints) {
+                curve._bcurve.packedData[i++] = coordinate;
+            }
+            return curve;
+        }
+        return undefined;
+    }
+    /** Return a deep clone of this curve. */
+    clone() {
+        const knotVector1 = this._bcurve.knots.clone();
+        const curve1 = new BSplineCurve3dH(this.numPoles, this.order, knotVector1);
+        curve1._bcurve.packedData = this._bcurve.packedData.slice();
+        return curve1;
+    }
+    /** Clone the curve and apply a transform to the clone. */
+    cloneTransformed(transform) {
+        const curve1 = this.clone();
+        curve1.tryTransformInPlace(transform);
+        return curve1;
+    }
+    /** Evaluate at a position given by fractional position within a span. */
+    evaluatePointInSpan(spanIndex, spanFraction, result) {
+        this._bcurve.evaluateBuffersInSpan(spanIndex, spanFraction);
+        const xyzw = this._bcurve.poleBuffer;
+        return Point4d.createRealPoint3dDefault000(xyzw[0], xyzw[1], xyzw[2], xyzw[3], result);
+    }
+    /** Evaluate at a position given by fractional position within a span. */
+    evaluatePointAndDerivativeInSpan(spanIndex, spanFraction, result) {
+        this._bcurve.evaluateBuffersInSpan1(spanIndex, spanFraction);
+        const xyzw = this._bcurve.poleBuffer;
+        const dXYZW = this._bcurve.poleBuffer1;
+        return Point4d.createRealDerivativeRay3dDefault000(xyzw[0], xyzw[1], xyzw[2], xyzw[3], dXYZW[0], dXYZW[1], dXYZW[2], dXYZW[3], result);
+    }
+    /** Evaluate at a position given by a knot value. */
+    knotToPoint(u, result) {
+        this._bcurve.evaluateBuffersAtKnot(u);
+        const xyzw = this._bcurve.poleBuffer;
+        return Point4d.createRealPoint3dDefault000(xyzw[0], xyzw[1], xyzw[2], xyzw[3], result);
+    }
+    /** Evaluate at a position given by a knot value.  */
+    knotToPointAndDerivative(u, result) {
+        this._bcurve.evaluateBuffersAtKnot(u, 1);
+        const xyzw = this._bcurve.poleBuffer;
+        const dXYZW = this._bcurve.poleBuffer1;
+        return Point4d.createRealDerivativeRay3dDefault000(xyzw[0], xyzw[1], xyzw[2], xyzw[3], dXYZW[0], dXYZW[1], dXYZW[2], dXYZW[3], result);
+    }
+    /** Evaluate at a position given by a knot value.  Return point with 2 derivatives. */
+    knotToPointAnd2Derivatives(u, result) {
+        this._bcurve.evaluateBuffersAtKnot(u, 2);
+        const xyzw = this._bcurve.poleBuffer;
+        const dXYZW = this._bcurve.poleBuffer1;
+        const ddXYZW = this._bcurve.poleBuffer2;
+        return Point4d.createRealDerivativePlane3dByOriginAndVectorsDefault000(xyzw[0], xyzw[1], xyzw[2], xyzw[3], dXYZW[0], dXYZW[1], dXYZW[2], dXYZW[3], ddXYZW[0], ddXYZW[1], ddXYZW[2], ddXYZW[3], result);
+    }
+    /** test if the curve is almost equal to `other` */
+    isAlmostEqual(other) {
+        if (other instanceof BSplineCurve3dH) {
+            return this._bcurve.knots.isAlmostEqual(other._bcurve.knots)
+                && Point4dArray.isAlmostEqual(this._bcurve.packedData, other._bcurve.packedData);
+        }
+        return false;
+    }
+    /** Test if the curve is entirely within a plane. */
+    isInPlane(plane) {
+        return Point4dArray.isCloseToPlane(this._bcurve.packedData, plane);
+    }
+    /** Return the control polygon length as quick approximation to the curve length. */
+    quickLength() { return Point3dArray.sumEdgeLengths(this._bcurve.packedData); }
+    /** call a handler with interval data for stroking. */
+    emitStrokableParts(handler, options) {
+        const needBeziers = handler.announceBezierCurve;
+        const workBezier = this.initializeWorkBezier();
+        const numSpan = this.numSpan;
+        let numStrokes;
+        for (let spanIndex = 0; spanIndex < numSpan; spanIndex++) {
+            const bezier = this.getSaturatedBezierSpan3dOr3dH(spanIndex, false, workBezier);
+            if (bezier) {
+                numStrokes = bezier.computeStrokeCountForOptions(options);
+                if (needBeziers) {
+                    handler.announceBezierCurve(bezier, numStrokes, this, spanIndex, this._bcurve.knots.spanFractionToFraction(spanIndex, 0.0), this._bcurve.knots.spanFractionToFraction(spanIndex, 1.0));
+                }
+                else {
+                    handler.announceIntervalForUniformStepStrokes(this, numStrokes, this._bcurve.knots.spanFractionToFraction(spanIndex, 0.0), this._bcurve.knots.spanFractionToFraction(spanIndex, 1.0));
+                }
+            }
+        }
+    }
+    /**  Append stroked approximation of this curve to the linestring. */
+    emitStrokes(dest, options) {
+        const workBezier = this.initializeWorkBezier();
+        const numSpan = this.numSpan;
+        for (let spanIndex = 0; spanIndex < numSpan; spanIndex++) {
+            const bezier = this.getSaturatedBezierSpan3dH(spanIndex, workBezier);
+            if (bezier)
+                bezier.emitStrokes(dest, options);
+        }
+    }
+    /**
+     * Assess length and turn to determine a stroke count.
+     * @param options stroke options structure.
+     */
+    computeStrokeCountForOptions(options) {
+        const workBezier = this.initializeWorkBezier();
+        const numSpan = this.numSpan;
+        let numStroke = 0;
+        for (let spanIndex = 0; spanIndex < numSpan; spanIndex++) {
+            const bezier = this.getSaturatedBezierSpan3dH(spanIndex, workBezier);
+            if (bezier)
+                numStroke += bezier.computeStrokeCountForOptions(options);
+        }
+        return numStroke;
+    }
+    /**
+     * Compute individual segment stroke counts.  Attach in a StrokeCountMap.
+     * @param options StrokeOptions that determine count
+     * @param parentStrokeMap evolving parent map.
+     */
+    computeAndAttachRecursiveStrokeCounts(options, parentStrokeMap) {
+        const workBezier = this.initializeWorkBezier();
+        const numSpan = this.numSpan;
+        const myData = StrokeCountMap.createWithCurvePrimitiveAndOptionalParent(this, parentStrokeMap, []);
+        for (let spanIndex = 0; spanIndex < numSpan; spanIndex++) {
+            const bezier = this.getSaturatedBezierSpan3dH(spanIndex, workBezier);
+            if (bezier) {
+                const segmentLength = workBezier.curveLength();
+                const numStrokeOnSegment = workBezier.computeStrokeCountForOptions(options);
+                myData.addToCountAndLength(numStrokeOnSegment, segmentLength);
+            }
+        }
+        CurvePrimitive.installStrokeCountMap(this, myData, parentStrokeMap);
+    }
+    /**
+     * return true if the spline is (a) unclamped with (degree-1) matching knot intervals,
+     * (b) (degree-1) wrapped points,
+     * (c) marked wrappable from construction time.
+     */
+    get isClosable() {
+        if (!this._bcurve.knots.wrappable)
+            return false;
+        const degree = this.degree;
+        const leftKnotIndex = this._bcurve.knots.leftKnotIndex;
+        const rightKnotIndex = this._bcurve.knots.rightKnotIndex;
+        const period = this._bcurve.knots.rightKnot - this._bcurve.knots.leftKnot;
+        const indexDelta = rightKnotIndex - leftKnotIndex;
+        for (let k0 = leftKnotIndex - degree + 1; k0 < leftKnotIndex + degree - 1; k0++) {
+            const k1 = k0 + indexDelta;
+            if (!Geometry.isSameCoordinate(this._bcurve.knots.knots[k0] + period, this._bcurve.knots.knots[k1]))
+                return false;
+        }
+        const poleIndexDelta = this.numPoles - this.degree;
+        for (let p0 = 0; p0 < degree; p0++) {
+            const p1 = p0 + poleIndexDelta;
+            if (!Geometry.isSamePoint3d(this.getPolePoint3d(p0), this.getPolePoint3d(p1)))
+                return false;
+        }
+        return true;
+    }
+    /**
+     * Return a CurvePrimitive (which is a BezierCurve3dH) for a specified span of this curve.
+     * @param spanIndex
+     * @param result optional reusable curve.  This will only be reused if it is a BezierCurve3d with matching order.
+     */
+    getSaturatedBezierSpan3dH(spanIndex, result) {
+        if (spanIndex < 0 || spanIndex >= this.numSpan)
+            return undefined;
+        const order = this.order;
+        if (result === undefined || !(result instanceof BezierCurve3dH) || result.order !== order)
+            result = BezierCurve3dH.createOrder(order);
+        const bezier = result;
+        bezier.loadSpan4dPoles(this._bcurve.packedData, spanIndex);
+        if (bezier.saturateInPlace(this._bcurve.knots, spanIndex))
+            return result;
+        return undefined;
+    }
+    /**
+     * Return a BezierCurveBase for this curve.  Because BSplineCurve3dH is homogeneous, the returned BezierCurveBase is always homogeneous.
+     * @param spanIndex
+     * @param result optional reusable curve.  This will only be reused if it is a BezierCurve3dH with matching order.
+     */
+    getSaturatedBezierSpan3dOr3dH(spanIndex, _prefer3dH, result) {
+        return this.getSaturatedBezierSpan3dH(spanIndex, result);
+    }
+    /** Second step of double dispatch:  call `handler.handleBSplineCurve3dH(this)` */
+    dispatchToGeometryHandler(handler) {
+        return handler.handleBSplineCurve3dH(this);
+    }
+    /**
+     * Extend a range so in includes the range of this curve
+     * * REMARK: this is based on the poles, not the exact curve.  This is generally larger than the true curve range.
+     * @param rangeToExtend
+     * @param transform transform to apply to points as they are entered into the range.
+     */
+    extendRange(rangeToExtend, transform) {
+        const buffer = this._bcurve.packedData;
+        const n = buffer.length - 3;
+        if (transform) {
+            for (let i0 = 0; i0 < n; i0 += 4)
+                rangeToExtend.extendTransformedXYZW(transform, buffer[i0], buffer[i0 + 1], buffer[i0 + 2], buffer[i0 + 3]);
+        }
+        else {
+            for (let i0 = 0; i0 < n; i0 += 4)
+                rangeToExtend.extendXYZW(buffer[i0], buffer[i0 + 1], buffer[i0 + 2], buffer[i0 + 3]);
+        }
+    }
+}
+//# sourceMappingURL=BSplineCurve3dH.js.map

package/lib/esm/bspline/BSplineCurve3dH.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"BSplineCurve3dH.js","sourceRoot":"","sources":["../../../src/bspline/BSplineCurve3dH.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAEH,2CAA2C;AAC3C,OAAO,EAAE,cAAc,EAAE,MAAM,yBAAyB,CAAC;AAEzD,OAAO,EAAE,cAAc,EAAE,MAAM,+BAA+B,CAAC;AAE/D,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AAIvC,8EAA8E;AAC9E,OAAO,EAAE,OAAO,EAAE,MAAM,+BAA+B,CAAC;AACxD,OAAO,EAAE,YAAY,EAAE,YAAY,EAAE,MAAM,4BAA4B,CAAC;AAIxE,OAAO,EAAE,OAAO,EAAE,MAAM,uBAAuB,CAAC;AAChD,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAElD,OAAO,EAAE,kBAAkB,EAAE,MAAM,gBAAgB,CAAC;AACpD,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAE1C;;;GAGG;AACH,MAAM,OAAO,eAAgB,SAAQ,kBAAkB;IAmCrD,YAAoB,QAAgB,EAAE,KAAa,EAAE,KAAiB;QACpE,KAAK,CAAC,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;IACnC,CAAC;IAnCO,oBAAoB;QAC1B,IAAI,IAAI,CAAC,WAAW,KAAK,SAAS;YAChC,IAAI,CAAC,WAAW,GAAG,cAAc,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC5D,OAAO,IAAI,CAAC,WAAW,CAAC;IAC1B,CAAC;IACD,0DAA0D;IACnD,mBAAmB,CAAC,KAAU,IAAa,OAAO,KAAK,YAAY,eAAe,CAAC,CAAC,CAAC;IAC5F,qCAAqC;IAC9B,mBAAmB,CAAC,SAAoB,IAAa,YAAY,CAAC,eAAe,CAAC,SAAS,EAAE,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,CAAC;IAC5I,yCAAyC;IAClC,cAAc,CAAC,SAAiB,EAAE,MAAgB;QACvD,MAAM,CAAC,GAAG,IAAI,CAAC,oBAAoB,CAAC,SAAS,CAAC,CAAC;QAC/C,IAAI,CAAC,KAAK,SAAS,EAAE;YACnB,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC;YACrC,MAAM,IAAI,GAAG,QAAQ,CAAC,yBAAyB,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAClE,IAAI,IAAI,KAAK,SAAS;gBACpB,OAAO,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,EAAE,MAAM,CAAC,CAAC;SACzF;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,4BAA4B;IACrB,cAAc,CAAC,SAAiB,EAAE,MAAgB;QACvD,MAAM,CAAC,GAAG,IAAI,CAAC,oBAAoB,CAAC,SAAS,CAAC,CAAC;QAC/C,IAAI,CAAC,KAAK,SAAS,EAAE;YACnB,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC;YACrC,OAAO,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;SAC/E;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,oDAAoD;IAC7C,kBAAkB,CAAC,IAAY,EAAE,aAAqB;QAC3D,OAAO,IAAI,CAAC,OAAO,CAAC,kBAAkB,CAAC,IAAI,EAAE,aAAa,CAAC,CAAC;IAC9D,CAAC;IAID,4FAA4F;IACrF,UAAU,KAAY,OAAO,YAAY,CAAC,2BAA2B,CAAC,IAAI,CAAC,OAAO,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3G,8DAA8D;IACvD,sBAAsB,KAAmB,OAAO,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;IACzF,oEAAoE;IAC7D,mBAAmB,CAAC,UAAmB;QAC5C,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC;QACnC,MAAM,MAAM,GAAG,IAAI,YAAY,CAAC,QAAQ,CAAC,CAAC;QAC1C,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,KAAK,IAAI,SAAS,GAAG,CAAC,EAAE,SAAS,GAAG,IAAI,CAAC,QAAQ,EAAE,SAAS,EAAE,EAAE;YAC9D,IAAI,CAAC,GAAG,SAAS,GAAG,CAAC,CAAC;YACtB,IAAI,UAAU,EAAE;gBACd,MAAM,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBACzC,MAAM,EAAE,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;gBACrC,MAAM,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC;gBAChD,MAAM,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC;gBAChD,MAAM,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC;aAEjD;iBAAM;gBACL,MAAM,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC;gBAC3C,MAAM,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC;gBAC3C,MAAM,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC;aAC5C;SACF;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACM,uBAAuB;QAC5B,MAAM,MAAM,GAAG,IAAI,YAAY,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC/C,KAAK,IAAI,SAAS,GAAG,CAAC,EAAE,SAAS,GAAG,IAAI,CAAC,QAAQ,EAAE,SAAS,EAAE,EAAE;YAC9D,MAAM,CAAC,SAAS,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,GAAG,SAAS,GAAG,CAAC,CAAC,CAAC;SAChE;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;;;OAOG;IACI,MAAM,CAAC,kBAAkB,CAAC,aAAmD,EAAE,KAAa;QACjG,MAAM,QAAQ,GAAG,CAAC,aAAa,YAAY,YAAY,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,MAAM,CAAC;QAC3G,IAAI,KAAK,GAAG,CAAC,IAAI,QAAQ,GAAG,KAAK;YAC/B,OAAO,SAAS,CAAC;QACnB,MAAM,KAAK,GAAG,UAAU,CAAC,oBAAoB,CAAC,aAAa,CAAC,MAAM,EAAE,KAAK,GAAG,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACzF,MAAM,KAAK,GAAG,IAAI,eAAe,CAAC,QAAQ,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;QAC1D,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,IAAI,aAAa,CAAC,CAAC,CAAC,YAAY,OAAO,EAAE;YACvC,KAAK,MAAM,CAAC,IAAK,aAA2B,EAAE;gBAAE,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBAAC,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBAAC,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBAAC,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC;aAAE;SACtM;aAAM,IAAI,aAAa,CAAC,CAAC,CAAC,YAAY,OAAO,EAAE;YAC9C,KAAK,MAAM,CAAC,IAAK,aAA2B,EAAE;gBAAE,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBAAC,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBAAC,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBAAC,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;aAAE;SACtM;aAAM,IAAI,aAAa,YAAY,YAAY,EAAE;YAChD,MAAM,IAAI,GAAG,aAAa,CAAC,MAAM,CAAC;YAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE;gBAC7B,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;aAChD;SACF;aAAM;YACL,OAAO,SAAS,CAAC;SAClB;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;OAGG;IACI,MAAM,CAAC,kBAAkB,CAAC,aAAkG;QACjI,IAAI,aAAa,YAAY,YAAY,EAAE;YACzC,OAAO,aAAa,CAAC,KAAK,EAAE,CAAC;SAC9B;aAAM,IAAI,KAAK,CAAC,OAAO,CAAC,aAAa,CAAC,EAAE;YACvC,MAAM,OAAO,GAAG,aAAsB,CAAC,CAAG,iJAAiJ;YAC3L,IAAI,OAAO,CAAC,CAAC,CAAC,YAAY,OAAO,EAAE;gBACjC,MAAM,SAAS,GAAG,OAAO,CAAC,MAAM,CAAC;gBACjC,MAAM,YAAY,GAAG,IAAI,YAAY,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC;gBACrD,IAAI,CAAC,GAAG,CAAC,CAAC;gBACV,KAAK,MAAM,CAAC,IAAK,aAA2B,EAAE;oBAC5C,YAAY,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oBACxB,YAAY,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oBACxB,YAAY,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oBACxB,YAAY,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;iBACzB;gBACD,OAAO,YAAY,CAAC;aACrB;iBAAM,IAAI,OAAO,CAAC,CAAC,CAAC,YAAY,OAAO,EAAE;gBACxC,MAAM,SAAS,GAAG,OAAO,CAAC,MAAM,CAAC;gBACjC,MAAM,YAAY,GAAG,IAAI,YAAY,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC;gBACrD,IAAI,CAAC,GAAG,CAAC,CAAC;gBACV,KAAK,MAAM,CAAC,IAAK,aAA2B,EAAE;oBAC5C,YAAY,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oBACxB,YAAY,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oBACxB,YAAY,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oBACxB,YAAY,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC;iBACzB;gBACD,OAAO,YAAY,CAAC;aACrB;SACF;aAAM;YACL,MAAM,GAAG,GAAG,aAAoB,CAAC;YACjC,IAAI,GAAG,CAAC,GAAG,YAAY,YAAY,IAAI,GAAG,CAAC,OAAO,YAAY,YAAY,IAAI,GAAG,CAAC,GAAG,CAAC,MAAM,KAAK,CAAC,GAAG,GAAG,CAAC,OAAO,CAAC,MAAM,EAAE;gBACvH,MAAM,SAAS,GAAG,GAAG,CAAC,OAAO,CAAC,MAAM,CAAC;gBACrC,MAAM,YAAY,GAAG,IAAI,YAAY,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC;gBAErD,IAAI,CAAC,GAAG,CAAC,CAAC;gBACV,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;oBAC3C,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;oBAChB,YAAY,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oBAC/B,YAAY,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;oBACnC,YAAY,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;oBACnC,YAAY,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;iBACpC;gBACD,OAAO,YAAY,CAAC;aACrB;SACF;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;;;;;;;;OAaG;IACI,MAAM,CAAC,MAAM,CAAC,gBAAqG,EAAE,SAAkC,EAAE,KAAa;QAC3K,IAAI,KAAK,GAAG,CAAC;YACX,OAAO,SAAS,CAAC;QACnB,MAAM,aAAa,GAAG,IAAI,CAAC,kBAAkB,CAAC,gBAAgB,CAAC,CAAC;QAChE,IAAI,aAAa,YAAY,YAAY,EAAE;YACzC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YACtD,MAAM,QAAQ,GAAG,SAAS,CAAC,MAAM,CAAC;YAClC,0DAA0D;YAC1D,MAAM,gBAAgB,GAAG,CAAC,QAAQ,GAAG,KAAK,KAAK,QAAQ,CAAC,CAAC;YACzD,MAAM,KAAK,GAAG,UAAU,CAAC,MAAM,CAAC,SAAS,EAAE,KAAK,GAAG,CAAC,EAAE,gBAAgB,CAAC,CAAC;YACxE,IAAI,QAAQ,GAAG,KAAK;gBAClB,OAAO,SAAS,CAAC;YACnB,MAAM,KAAK,GAAG,IAAI,eAAe,CAAC,QAAQ,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;YAC1D,IAAI,CAAC,GAAG,CAAC,CAAC;YACV,KAAK,MAAM,UAAU,IAAI,aAAa,EAAE;gBAAE,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC;aAAE;YACvF,OAAO,KAAK,CAAC;SACd;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,yCAAyC;IAClC,KAAK;QACV,MAAM,WAAW,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QAC/C,MAAM,MAAM,GAAG,IAAI,eAAe,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC;QAC3E,MAAM,CAAC,OAAO,CAAC,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC;QAC5D,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,0DAA0D;IACnD,gBAAgB,CAAC,SAAoB;QAC1C,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;QAC5B,MAAM,CAAC,mBAAmB,CAAC,SAAS,CAAC,CAAC;QACtC,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,yEAAyE;IAClE,mBAAmB,CAAC,SAAiB,EAAE,YAAoB,EAAE,MAAgB;QAClF,IAAI,CAAC,OAAO,CAAC,qBAAqB,CAAC,SAAS,EAAE,YAAY,CAAC,CAAC;QAC5D,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC;QACrC,OAAO,OAAO,CAAC,2BAA2B,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;IACzF,CAAC;IAED,yEAAyE;IAClE,gCAAgC,CAAC,SAAiB,EAAE,YAAoB,EAAE,MAAc;QAC7F,IAAI,CAAC,OAAO,CAAC,sBAAsB,CAAC,SAAS,EAAE,YAAY,CAAC,CAAC;QAC7D,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC;QACrC,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC;QACvC,OAAO,OAAO,CAAC,mCAAmC,CAChD,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,EAClC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;IACpD,CAAC;IAED,oDAAoD;IAC7C,WAAW,CAAC,CAAS,EAAE,MAAgB;QAC5C,IAAI,CAAC,OAAO,CAAC,qBAAqB,CAAC,CAAC,CAAC,CAAC;QACtC,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC;QACrC,OAAO,OAAO,CAAC,2BAA2B,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;IACzF,CAAC;IACD,qDAAqD;IAC9C,wBAAwB,CAAC,CAAS,EAAE,MAAc;QACvD,IAAI,CAAC,OAAO,CAAC,qBAAqB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACzC,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC;QACrC,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC;QACvC,OAAO,OAAO,CAAC,mCAAmC,CAChD,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,EAClC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;IACpD,CAAC;IAED,sFAAsF;IAC/E,0BAA0B,CAAC,CAAS,EAAE,MAAkC;QAC7E,IAAI,CAAC,OAAO,CAAC,qBAAqB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACzC,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC;QACrC,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC;QACvC,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC;QACxC,OAAO,OAAO,CAAC,uDAAuD,CACpE,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,EAClC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,EACtC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAC1C,MAAM,CAAC,CAAC;IACZ,CAAC;IACD,mDAAmD;IACnC,aAAa,CAAC,KAAU;QACtC,IAAI,KAAK,YAAY,eAAe,EAAE;YACpC,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,aAAa,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;mBACvD,YAAY,CAAC,aAAa,CAAC,IAAI,CAAC,OAAO,CAAC,UAAU,EAAE,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;SACpF;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,oDAAoD;IAC7C,SAAS,CAAC,KAAmC;QAClD,OAAO,YAAY,CAAC,cAAc,CAAC,IAAI,CAAC,OAAO,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;IACrE,CAAC;IACD,oFAAoF;IAC7E,WAAW,KAAa,OAAO,YAAY,CAAC,cAAc,CAAC,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;IAC7F,sDAAsD;IAC/C,kBAAkB,CAAC,OAAuB,EAAE,OAAuB;QACxE,MAAM,WAAW,GAAI,OAAe,CAAC,mBAAmB,CAAC;QACzD,MAAM,UAAU,GAAG,IAAI,CAAC,oBAAoB,EAAE,CAAC;QAC/C,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC;QAC7B,IAAI,UAAU,CAAC;QACf,KAAK,IAAI,SAAS,GAAG,CAAC,EAAE,SAAS,GAAG,OAAO,EAAE,SAAS,EAAE,EAAE;YACxD,MAAM,MAAM,GAAG,IAAI,CAAC,6BAA6B,CAAC,SAAS,EAAE,KAAK,EAAE,UAAU,CAAC,CAAC;YAChF,IAAI,MAAM,EAAE;gBACV,UAAU,GAAG,MAAM,CAAC,4BAA4B,CAAC,OAAO,CAAC,CAAC;gBAC1D,IAAI,WAAW,EAAE;oBACd,OAAe,CAAC,mBAAmB,CAAC,MAAM,EAAE,UAAU,EAAE,IAAI,EAC3D,SAAS,EACT,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,sBAAsB,CAAC,SAAS,EAAE,GAAG,CAAC,EACzD,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,sBAAsB,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC,CAAC;iBAE9D;qBAAM;oBACL,OAAO,CAAC,qCAAqC,CAAC,IAAI,EAAE,UAAU,EAC5D,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,sBAAsB,CAAC,SAAS,EAAE,GAAG,CAAC,EACzD,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,sBAAsB,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC,CAAC;iBAC9D;aACF;SACF;IACH,CAAC;IACD,qEAAqE;IAC9D,WAAW,CAAC,IAAkB,EAAE,OAAuB;QAC5D,MAAM,UAAU,GAAG,IAAI,CAAC,oBAAoB,EAAE,CAAC;QAC/C,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC;QAC7B,KAAK,IAAI,SAAS,GAAG,CAAC,EAAE,SAAS,GAAG,OAAO,EAAE,SAAS,EAAE,EAAE;YACxD,MAAM,MAAM,GAAG,IAAI,CAAC,yBAAyB,CAAC,SAAS,EAAE,UAAU,CAAC,CAAC;YACrE,IAAI,MAAM;gBACR,MAAM,CAAC,WAAW,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;SACrC;IACH,CAAC;IACD;;;OAGG;IACI,4BAA4B,CAAC,OAAuB;QACzD,MAAM,UAAU,GAAG,IAAI,CAAC,oBAAoB,EAAE,CAAC;QAC/C,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC;QAC7B,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,KAAK,IAAI,SAAS,GAAG,CAAC,EAAE,SAAS,GAAG,OAAO,EAAE,SAAS,EAAE,EAAE;YACxD,MAAM,MAAM,GAAG,IAAI,CAAC,yBAAyB,CAAC,SAAS,EAAE,UAAU,CAAC,CAAC;YACrE,IAAI,MAAM;gBACR,SAAS,IAAI,MAAM,CAAC,4BAA4B,CAAC,OAAO,CAAC,CAAC;SAC7D;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;OAIG;IACa,qCAAqC,CAAC,OAAuB,EAAE,eAAgC;QAC7G,MAAM,UAAU,GAAG,IAAI,CAAC,oBAAoB,EAAE,CAAC;QAC/C,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC;QAC7B,MAAM,MAAM,GAAG,cAAc,CAAC,yCAAyC,CAAC,IAAI,EAAE,eAAe,EAAE,EAAE,CAAC,CAAC;QAEnG,KAAK,IAAI,SAAS,GAAG,CAAC,EAAE,SAAS,GAAG,OAAO,EAAE,SAAS,EAAE,EAAE;YACxD,MAAM,MAAM,GAAG,IAAI,CAAC,yBAAyB,CAAC,SAAS,EAAE,UAAU,CAAC,CAAC;YACrE,IAAI,MAAM,EAAE;gBACV,MAAM,aAAa,GAAG,UAAU,CAAC,WAAW,EAAE,CAAC;gBAC/C,MAAM,kBAAkB,GAAG,UAAU,CAAC,4BAA4B,CAAC,OAAO,CAAC,CAAC;gBAC5E,MAAM,CAAC,mBAAmB,CAAC,kBAAkB,EAAE,aAAa,CAAC,CAAC;aAC/D;SACF;QACD,cAAc,CAAC,qBAAqB,CAAC,IAAI,EAAE,MAAM,EAAE,eAAe,CAAC,CAAC;IACtE,CAAC;IACD;;;;OAIG;IACH,IAAW,UAAU;QACnB,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,SAAS;YAC/B,OAAO,KAAK,CAAC;QACf,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;QAC3B,MAAM,aAAa,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,aAAa,CAAC;QACvD,MAAM,cAAc,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,cAAc,CAAC;QACzD,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,SAAS,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,QAAQ,CAAC;QAC1E,MAAM,UAAU,GAAG,cAAc,GAAG,aAAa,CAAC;QAClD,KAAK,IAAI,EAAE,GAAG,aAAa,GAAG,MAAM,GAAG,CAAC,EAAE,EAAE,GAAG,aAAa,GAAG,MAAM,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE;YAC/E,MAAM,EAAE,GAAG,EAAE,GAAG,UAAU,CAAC;YAC3B,IAAI,CAAC,QAAQ,CAAC,gBAAgB,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;gBACjG,OAAO,KAAK,CAAC;SAChB;QACD,MAAM,cAAc,GAAG,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC;QACnD,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,MAAM,EAAE,EAAE,EAAE,EAAE;YAClC,MAAM,EAAE,GAAG,EAAE,GAAG,cAAc,CAAC;YAC/B,IAAI,CAAC,QAAQ,CAAC,aAAa,CAAC,IAAI,CAAC,cAAc,CAAC,EAAE,CAAY,EAAE,IAAI,CAAC,cAAc,CAAC,EAAE,CAAY,CAAC;gBACjG,OAAO,KAAK,CAAC;SAChB;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IACD;;;;OAIG;IACI,yBAAyB,CAAC,SAAiB,EAAE,MAAwB;QAC1E,IAAI,SAAS,GAAG,CAAC,IAAI,SAAS,IAAI,IAAI,CAAC,OAAO;YAC5C,OAAO,SAAS,CAAC;QAEnB,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;QACzB,IAAI,MAAM,KAAK,SAAS,IAAI,CAAC,CAAC,MAAM,YAAY,cAAc,CAAC,IAAI,MAAM,CAAC,KAAK,KAAK,KAAK;YACvF,MAAM,GAAG,cAAc,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;QAC7C,MAAM,MAAM,GAAG,MAAwB,CAAC;QACxC,MAAM,CAAC,eAAe,CAAC,IAAI,CAAC,OAAO,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC;QAC3D,IAAI,MAAM,CAAC,eAAe,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,SAAS,CAAC;YACvD,OAAO,MAAM,CAAC;QAChB,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;;OAIG;IACI,6BAA6B,CAAC,SAAiB,EAAE,UAAmB,EAAE,MAAwB;QACnG,OAAO,IAAI,CAAC,yBAAyB,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;IAC3D,CAAC;IACD,kFAAkF;IAC3E,yBAAyB,CAAC,OAAwB;QACvD,OAAO,OAAO,CAAC,qBAAqB,CAAC,IAAI,CAAC,CAAC;IAC7C,CAAC;IACD;;;;;OAKG;IACI,WAAW,CAAC,aAAsB,EAAE,SAAqB;QAC9D,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC;QACvC,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;QAC5B,IAAI,SAAS,EAAE;YACb,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC;gBAC9B,aAAa,CAAC,qBAAqB,CAAC,SAAS,EAAE,MAAM,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;SAC9G;aAAM;YACL,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC;gBAC9B,aAAa,CAAC,UAAU,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;SACxF;IACH,CAAC;CACF","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n/** @packageDocumentation\r\n * @module Serialization\r\n */\r\n\r\n// import { Point2d } from \"../Geometry2d\";\r\nimport { CurvePrimitive } from \"../curve/CurvePrimitive\";\r\nimport { LineString3d } from \"../curve/LineString3d\";\r\nimport { StrokeCountMap } from \"../curve/Query/StrokeCountMap\";\r\nimport { StrokeOptions } from \"../curve/StrokeOptions\";\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\n/* eslint-disable @typescript-eslint/naming-convention, no-empty, no-console*/\r\nimport { Point3d } from \"../geometry3d/Point3dVector3d\";\r\nimport { Point3dArray, Point4dArray } from \"../geometry3d/PointHelpers\";\r\nimport { Range3d } from \"../geometry3d/Range\";\r\nimport { Ray3d } from \"../geometry3d/Ray3d\";\r\nimport { Transform } from \"../geometry3d/Transform\";\r\nimport { Point4d } from \"../geometry4d/Point4d\";\r\nimport { BezierCurve3dH } from \"./BezierCurve3dH\";\r\nimport { BezierCurveBase } from \"./BezierCurveBase\";\r\nimport { BSplineCurve3dBase } from \"./BSplineCurve\";\r\nimport { KnotVector } from \"./KnotVector\";\r\n\r\n/**\r\n * Weighted (Homogeneous) BSplineCurve in 3d\r\n * @public\r\n */\r\nexport class BSplineCurve3dH extends BSplineCurve3dBase {\r\n  private _workBezier?: BezierCurve3dH;\r\n  private initializeWorkBezier(): BezierCurve3dH {\r\n    if (this._workBezier === undefined)\r\n      this._workBezier = BezierCurve3dH.createOrder(this.order);\r\n    return this._workBezier;\r\n  }\r\n  /** Test if `other` is an instance of `BSplineCurve3dH` */\r\n  public isSameGeometryClass(other: any): boolean { return other instanceof BSplineCurve3dH; }\r\n  /** Apply `transform` to the curve */\r\n  public tryTransformInPlace(transform: Transform): boolean { Point4dArray.multiplyInPlace(transform, this._bcurve.packedData); return true; }\r\n  /** Get a pole, normalized to Point3d. */\r\n  public getPolePoint3d(poleIndex: number, result?: Point3d): Point3d | undefined {\r\n    const k = this.poleIndexToDataIndex(poleIndex);\r\n    if (k !== undefined) {\r\n      const data = this._bcurve.packedData;\r\n      const divW = Geometry.conditionalDivideFraction(1.0, data[k + 3]);\r\n      if (divW !== undefined)\r\n        return Point3d.create(data[k] * divW, data[k + 1] * divW, data[k + 2] * divW, result);\r\n    }\r\n    return undefined;\r\n  }\r\n  /** Get a pole as Point4d */\r\n  public getPolePoint4d(poleIndex: number, result?: Point4d): Point4d | undefined {\r\n    const k = this.poleIndexToDataIndex(poleIndex);\r\n    if (k !== undefined) {\r\n      const data = this._bcurve.packedData;\r\n      return Point4d.create(data[k], data[k + 1], data[k + 2], data[k + 3], result);\r\n    }\r\n    return undefined;\r\n  }\r\n  /** map a spanIndex and fraction to a knot value. */\r\n  public spanFractionToKnot(span: number, localFraction: number): number {\r\n    return this._bcurve.spanFractionToKnot(span, localFraction);\r\n  }\r\n  private constructor(numPoles: number, order: number, knots: KnotVector) {\r\n    super(4, numPoles, order, knots);\r\n  }\r\n  /** Return a simple array of arrays with the control points as `[[x,y,z,w],[x,y,z,w],..]` */\r\n  public copyPoints(): any[] { return Point3dArray.unpackNumbersToNestedArrays(this._bcurve.packedData, 4); }\r\n  /** Return a simple array of the control points coordinates */\r\n  public copyPointsFloat64Array(): Float64Array { return this._bcurve.packedData.slice(); }\r\n  /** Return a simple array of the control points xyz coordinates.  */\r\n  public copyXYZFloat64Array(deweighted: boolean): Float64Array {\r\n    const numValue = this.numPoles * 3;\r\n    const result = new Float64Array(numValue);\r\n    let k = 0;\r\n    for (let poleIndex = 0; poleIndex < this.numPoles; poleIndex++) {\r\n      let i = poleIndex * 4;\r\n      if (deweighted) {\r\n        const w = this._bcurve.packedData[i + 3];\r\n        const dw = w === 0.0 ? 1.0 : 1.0 / w;\r\n        result[k++] = this._bcurve.packedData[i++] * dw;\r\n        result[k++] = this._bcurve.packedData[i++] * dw;\r\n        result[k++] = this._bcurve.packedData[i++] * dw;\r\n\r\n      } else {\r\n        result[k++] = this._bcurve.packedData[i++];\r\n        result[k++] = this._bcurve.packedData[i++];\r\n        result[k++] = this._bcurve.packedData[i++];\r\n      }\r\n    }\r\n    return result;\r\n  }\r\n  public copyWeightsFloat64Array(): Float64Array {\r\n    const result = new Float64Array(this.numPoles);\r\n    for (let poleIndex = 0; poleIndex < this.numPoles; poleIndex++) {\r\n      result[poleIndex] = this._bcurve.packedData[4 * poleIndex + 3];\r\n    }\r\n    return result;\r\n  }\r\n\r\n  /** Create a bspline with uniform knots.\r\n   * * Control points may be supplied as:\r\n   *   * array of Point4d, with weight already multiplied into the `[wx,wy,wz,w]`\r\n   *   * array of Point3d, with implied weight 1.\r\n   *   * Float64Array, blocked as xyzw, i.e. 4 doubles per control point.\r\n   * @param controlPoints pole data in array form as noted above.\r\n   * @param order  curve order (1 more than degree)\r\n   */\r\n  public static createUniformKnots(controlPoints: Point3d[] | Point4d[] | Float64Array, order: number): BSplineCurve3dH | undefined {\r\n    const numPoles = (controlPoints instanceof Float64Array) ? controlPoints.length / 4 : controlPoints.length;\r\n    if (order < 1 || numPoles < order)\r\n      return undefined;\r\n    const knots = KnotVector.createUniformClamped(controlPoints.length, order - 1, 0.0, 1.0);\r\n    const curve = new BSplineCurve3dH(numPoles, order, knots);\r\n    let i = 0;\r\n    if (controlPoints[0] instanceof Point3d) {\r\n      for (const p of (controlPoints as Point3d[])) { curve._bcurve.packedData[i++] = p.x; curve._bcurve.packedData[i++] = p.y; curve._bcurve.packedData[i++] = p.z; curve._bcurve.packedData[i++] = 1.0; }\r\n    } else if (controlPoints[0] instanceof Point4d) {\r\n      for (const p of (controlPoints as Point4d[])) { curve._bcurve.packedData[i++] = p.x; curve._bcurve.packedData[i++] = p.y; curve._bcurve.packedData[i++] = p.z; curve._bcurve.packedData[i++] = p.w; }\r\n    } else if (controlPoints instanceof Float64Array) {\r\n      const numQ = controlPoints.length;\r\n      for (let k = 0; k < numQ; k++) {\r\n        curve._bcurve.packedData[k] = controlPoints[k];\r\n      }\r\n    } else {\r\n      return undefined;\r\n    }\r\n    return curve;\r\n  }\r\n\r\n  /**\r\n   * Assemble a variously structured control points into packed array of [xyzw].\r\n   * @param controlPoints\r\n   */\r\n  public static assemblePackedXYZW(controlPoints: Float64Array | Point4d[] | { xyz: Float64Array, weights: Float64Array } | Point3d[]): Float64Array | undefined {\r\n    if (controlPoints instanceof Float64Array) {\r\n      return controlPoints.slice();\r\n    } else if (Array.isArray(controlPoints)) {\r\n      const cpArray = controlPoints as any[];   // This should not be necessary -- but the predicate controlPoints[0] is not recognized even though Array.isArray(controlPoints) was just passed.\r\n      if (cpArray[0] instanceof Point4d) {\r\n        const numPoints = cpArray.length;\r\n        const packedPoints = new Float64Array(4 * numPoints);\r\n        let i = 0;\r\n        for (const p of (controlPoints as Point4d[])) {\r\n          packedPoints[i++] = p.x;\r\n          packedPoints[i++] = p.y;\r\n          packedPoints[i++] = p.z;\r\n          packedPoints[i++] = p.w;\r\n        }\r\n        return packedPoints;\r\n      } else if (cpArray[0] instanceof Point3d) {\r\n        const numPoints = cpArray.length;\r\n        const packedPoints = new Float64Array(4 * numPoints);\r\n        let i = 0;\r\n        for (const p of (controlPoints as Point3d[])) {\r\n          packedPoints[i++] = p.x;\r\n          packedPoints[i++] = p.y;\r\n          packedPoints[i++] = p.z;\r\n          packedPoints[i++] = 1.0;\r\n        }\r\n        return packedPoints;\r\n      }\r\n    } else {\r\n      const obj = controlPoints as any;\r\n      if (obj.xyz instanceof Float64Array && obj.weights instanceof Float64Array && obj.xyz.length === 3 * obj.weights.length) {\r\n        const numPoints = obj.weights.length;\r\n        const packedPoints = new Float64Array(4 * numPoints);\r\n\r\n        let m = 0;\r\n        for (let i = 0; i < obj.weights.length; i++) {\r\n          const k = 3 * i;\r\n          packedPoints[m++] = obj.xyz[k];\r\n          packedPoints[m++] = obj.xyz[k + 1];\r\n          packedPoints[m++] = obj.xyz[k + 2];\r\n          packedPoints[m++] = obj.weights[i];\r\n        }\r\n        return packedPoints;\r\n      }\r\n    }\r\n    return undefined;\r\n  }\r\n  /** Create a bspline with given knots.\r\n   * * The poles have several variants:\r\n   *   * Float64Array(4 * numPoles) in blocks of [wx,xy,wz,w]\r\n   *   * Point4d[numPoles]\r\n   *   * Point3d[], with implied unit weight to be added.\r\n   *   * {xyz: Float64Array(3 * numPoles), weights: Float64Array (numPoles)}\r\n   *\r\n   * *  Two count conditions are recognized:\r\n   *\r\n   * ** If poleArray.length + order == knotArray.length, the first and last are assumed to be the\r\n   *      extraneous knots of classic clamping.\r\n   * ** If poleArray.length + order == knotArray.length + 2, the knots are in modern form.\r\n   *\r\n   */\r\n  public static create(controlPointData: Float64Array | Point4d[] | { xyz: Float64Array, weights: Float64Array } | Point3d[], knotArray: Float64Array | number[], order: number): BSplineCurve3dH | undefined {\r\n    if (order < 2)\r\n      return undefined;\r\n    const controlPoints = this.assemblePackedXYZW(controlPointData);\r\n    if (controlPoints instanceof Float64Array) {\r\n      const numPoles = Math.floor(controlPoints.length / 4);\r\n      const numKnots = knotArray.length;\r\n      // shift knots-of-interest limits for overclamped case ...\r\n      const skipFirstAndLast = (numPoles + order === numKnots);\r\n      const knots = KnotVector.create(knotArray, order - 1, skipFirstAndLast);\r\n      if (numPoles < order)\r\n        return undefined;\r\n      const curve = new BSplineCurve3dH(numPoles, order, knots);\r\n      let i = 0;\r\n      for (const coordinate of controlPoints) { curve._bcurve.packedData[i++] = coordinate; }\r\n      return curve;\r\n    }\r\n    return undefined;\r\n  }\r\n  /** Return a deep clone of this curve. */\r\n  public clone(): BSplineCurve3dH {\r\n    const knotVector1 = this._bcurve.knots.clone();\r\n    const curve1 = new BSplineCurve3dH(this.numPoles, this.order, knotVector1);\r\n    curve1._bcurve.packedData = this._bcurve.packedData.slice();\r\n    return curve1;\r\n  }\r\n  /** Clone the curve and apply a transform to the clone. */\r\n  public cloneTransformed(transform: Transform): BSplineCurve3dH {\r\n    const curve1 = this.clone();\r\n    curve1.tryTransformInPlace(transform);\r\n    return curve1;\r\n  }\r\n  /** Evaluate at a position given by fractional position within a span. */\r\n  public evaluatePointInSpan(spanIndex: number, spanFraction: number, result?: Point3d): Point3d {\r\n    this._bcurve.evaluateBuffersInSpan(spanIndex, spanFraction);\r\n    const xyzw = this._bcurve.poleBuffer;\r\n    return Point4d.createRealPoint3dDefault000(xyzw[0], xyzw[1], xyzw[2], xyzw[3], result);\r\n  }\r\n\r\n  /** Evaluate at a position given by fractional position within a span. */\r\n  public evaluatePointAndDerivativeInSpan(spanIndex: number, spanFraction: number, result?: Ray3d): Ray3d {\r\n    this._bcurve.evaluateBuffersInSpan1(spanIndex, spanFraction);\r\n    const xyzw = this._bcurve.poleBuffer;\r\n    const dXYZW = this._bcurve.poleBuffer1;\r\n    return Point4d.createRealDerivativeRay3dDefault000(\r\n      xyzw[0], xyzw[1], xyzw[2], xyzw[3],\r\n      dXYZW[0], dXYZW[1], dXYZW[2], dXYZW[3], result);\r\n  }\r\n\r\n  /** Evaluate at a position given by a knot value. */\r\n  public knotToPoint(u: number, result?: Point3d): Point3d {\r\n    this._bcurve.evaluateBuffersAtKnot(u);\r\n    const xyzw = this._bcurve.poleBuffer;\r\n    return Point4d.createRealPoint3dDefault000(xyzw[0], xyzw[1], xyzw[2], xyzw[3], result);\r\n  }\r\n  /** Evaluate at a position given by a knot value.  */\r\n  public knotToPointAndDerivative(u: number, result?: Ray3d): Ray3d {\r\n    this._bcurve.evaluateBuffersAtKnot(u, 1);\r\n    const xyzw = this._bcurve.poleBuffer;\r\n    const dXYZW = this._bcurve.poleBuffer1;\r\n    return Point4d.createRealDerivativeRay3dDefault000(\r\n      xyzw[0], xyzw[1], xyzw[2], xyzw[3],\r\n      dXYZW[0], dXYZW[1], dXYZW[2], dXYZW[3], result);\r\n  }\r\n\r\n  /** Evaluate at a position given by a knot value.  Return point with 2 derivatives. */\r\n  public knotToPointAnd2Derivatives(u: number, result?: Plane3dByOriginAndVectors): Plane3dByOriginAndVectors {\r\n    this._bcurve.evaluateBuffersAtKnot(u, 2);\r\n    const xyzw = this._bcurve.poleBuffer;\r\n    const dXYZW = this._bcurve.poleBuffer1;\r\n    const ddXYZW = this._bcurve.poleBuffer2;\r\n    return Point4d.createRealDerivativePlane3dByOriginAndVectorsDefault000(\r\n      xyzw[0], xyzw[1], xyzw[2], xyzw[3],\r\n      dXYZW[0], dXYZW[1], dXYZW[2], dXYZW[3],\r\n      ddXYZW[0], ddXYZW[1], ddXYZW[2], ddXYZW[3],\r\n      result);\r\n  }\r\n  /** test if the curve is almost equal to `other` */\r\n  public override isAlmostEqual(other: any): boolean {\r\n    if (other instanceof BSplineCurve3dH) {\r\n      return this._bcurve.knots.isAlmostEqual(other._bcurve.knots)\r\n        && Point4dArray.isAlmostEqual(this._bcurve.packedData, other._bcurve.packedData);\r\n    }\r\n    return false;\r\n  }\r\n  /** Test if the curve is entirely within a plane. */\r\n  public isInPlane(plane: Plane3dByOriginAndUnitNormal): boolean {\r\n    return Point4dArray.isCloseToPlane(this._bcurve.packedData, plane);\r\n  }\r\n  /** Return the control polygon length as quick approximation to the curve length. */\r\n  public quickLength(): number { return Point3dArray.sumEdgeLengths(this._bcurve.packedData); }\r\n  /** call a handler with interval data for stroking. */\r\n  public emitStrokableParts(handler: IStrokeHandler, options?: StrokeOptions): void {\r\n    const needBeziers = (handler as any).announceBezierCurve;\r\n    const workBezier = this.initializeWorkBezier();\r\n    const numSpan = this.numSpan;\r\n    let numStrokes;\r\n    for (let spanIndex = 0; spanIndex < numSpan; spanIndex++) {\r\n      const bezier = this.getSaturatedBezierSpan3dOr3dH(spanIndex, false, workBezier);\r\n      if (bezier) {\r\n        numStrokes = bezier.computeStrokeCountForOptions(options);\r\n        if (needBeziers) {\r\n          (handler as any).announceBezierCurve(bezier, numStrokes, this,\r\n            spanIndex,\r\n            this._bcurve.knots.spanFractionToFraction(spanIndex, 0.0),\r\n            this._bcurve.knots.spanFractionToFraction(spanIndex, 1.0));\r\n\r\n        } else {\r\n          handler.announceIntervalForUniformStepStrokes(this, numStrokes,\r\n            this._bcurve.knots.spanFractionToFraction(spanIndex, 0.0),\r\n            this._bcurve.knots.spanFractionToFraction(spanIndex, 1.0));\r\n        }\r\n      }\r\n    }\r\n  }\r\n  /**  Append stroked approximation of this curve to the linestring. */\r\n  public emitStrokes(dest: LineString3d, options?: StrokeOptions): void {\r\n    const workBezier = this.initializeWorkBezier();\r\n    const numSpan = this.numSpan;\r\n    for (let spanIndex = 0; spanIndex < numSpan; spanIndex++) {\r\n      const bezier = this.getSaturatedBezierSpan3dH(spanIndex, workBezier);\r\n      if (bezier)\r\n        bezier.emitStrokes(dest, options);\r\n    }\r\n  }\r\n  /**\r\n   * Assess length and turn to determine a stroke count.\r\n   * @param options stroke options structure.\r\n   */\r\n  public computeStrokeCountForOptions(options?: StrokeOptions): number {\r\n    const workBezier = this.initializeWorkBezier();\r\n    const numSpan = this.numSpan;\r\n    let numStroke = 0;\r\n    for (let spanIndex = 0; spanIndex < numSpan; spanIndex++) {\r\n      const bezier = this.getSaturatedBezierSpan3dH(spanIndex, workBezier);\r\n      if (bezier)\r\n        numStroke += bezier.computeStrokeCountForOptions(options);\r\n    }\r\n    return numStroke;\r\n  }\r\n  /**\r\n   * Compute individual segment stroke counts.  Attach in a StrokeCountMap.\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 workBezier = this.initializeWorkBezier();\r\n    const numSpan = this.numSpan;\r\n    const myData = StrokeCountMap.createWithCurvePrimitiveAndOptionalParent(this, parentStrokeMap, []);\r\n\r\n    for (let spanIndex = 0; spanIndex < numSpan; spanIndex++) {\r\n      const bezier = this.getSaturatedBezierSpan3dH(spanIndex, workBezier);\r\n      if (bezier) {\r\n        const segmentLength = workBezier.curveLength();\r\n        const numStrokeOnSegment = workBezier.computeStrokeCountForOptions(options);\r\n        myData.addToCountAndLength(numStrokeOnSegment, segmentLength);\r\n      }\r\n    }\r\n    CurvePrimitive.installStrokeCountMap(this, myData, parentStrokeMap);\r\n  }\r\n  /**\r\n   * return true if the spline is (a) unclamped with (degree-1) matching knot intervals,\r\n   * (b) (degree-1) wrapped points,\r\n   * (c) marked wrappable from construction time.\r\n   */\r\n  public get isClosable(): boolean {\r\n    if (!this._bcurve.knots.wrappable)\r\n      return false;\r\n    const degree = this.degree;\r\n    const leftKnotIndex = this._bcurve.knots.leftKnotIndex;\r\n    const rightKnotIndex = this._bcurve.knots.rightKnotIndex;\r\n    const period = this._bcurve.knots.rightKnot - this._bcurve.knots.leftKnot;\r\n    const indexDelta = rightKnotIndex - leftKnotIndex;\r\n    for (let k0 = leftKnotIndex - degree + 1; k0 < leftKnotIndex + degree - 1; k0++) {\r\n      const k1 = k0 + indexDelta;\r\n      if (!Geometry.isSameCoordinate(this._bcurve.knots.knots[k0] + period, this._bcurve.knots.knots[k1]))\r\n        return false;\r\n    }\r\n    const poleIndexDelta = this.numPoles - this.degree;\r\n    for (let p0 = 0; p0 < degree; p0++) {\r\n      const p1 = p0 + poleIndexDelta;\r\n      if (!Geometry.isSamePoint3d(this.getPolePoint3d(p0) as Point3d, this.getPolePoint3d(p1) as Point3d))\r\n        return false;\r\n    }\r\n    return true;\r\n  }\r\n  /**\r\n   * Return a CurvePrimitive (which is a BezierCurve3dH) for a specified span of this curve.\r\n   * @param spanIndex\r\n   * @param result optional reusable curve.  This will only be reused if it is a BezierCurve3d with matching order.\r\n   */\r\n  public getSaturatedBezierSpan3dH(spanIndex: number, result?: BezierCurveBase): BezierCurveBase | undefined {\r\n    if (spanIndex < 0 || spanIndex >= this.numSpan)\r\n      return undefined;\r\n\r\n    const order = this.order;\r\n    if (result === undefined || !(result instanceof BezierCurve3dH) || result.order !== order)\r\n      result = BezierCurve3dH.createOrder(order);\r\n    const bezier = result as BezierCurve3dH;\r\n    bezier.loadSpan4dPoles(this._bcurve.packedData, spanIndex);\r\n    if (bezier.saturateInPlace(this._bcurve.knots, spanIndex))\r\n      return result;\r\n    return undefined;\r\n  }\r\n\r\n  /**\r\n   * Return a BezierCurveBase for this curve.  Because BSplineCurve3dH is homogeneous, the returned BezierCurveBase is always homogeneous.\r\n   * @param spanIndex\r\n   * @param result optional reusable curve.  This will only be reused if it is a BezierCurve3dH with matching order.\r\n   */\r\n  public getSaturatedBezierSpan3dOr3dH(spanIndex: number, _prefer3dH: boolean, result?: BezierCurveBase): BezierCurveBase | undefined {\r\n    return this.getSaturatedBezierSpan3dH(spanIndex, result);\r\n  }\r\n  /** Second step of double dispatch:  call `handler.handleBSplineCurve3dH(this)` */\r\n  public dispatchToGeometryHandler(handler: GeometryHandler): any {\r\n    return handler.handleBSplineCurve3dH(this);\r\n  }\r\n  /**\r\n   * Extend a range so in includes the range of this curve\r\n   * * REMARK: this is based on the poles, not the exact curve.  This is generally larger than the true curve range.\r\n   * @param rangeToExtend\r\n   * @param transform transform to apply to points as they are entered into the range.\r\n   */\r\n  public extendRange(rangeToExtend: Range3d, transform?: Transform): void {\r\n    const buffer = this._bcurve.packedData;\r\n    const n = buffer.length - 3;\r\n    if (transform) {\r\n      for (let i0 = 0; i0 < n; i0 += 4)\r\n        rangeToExtend.extendTransformedXYZW(transform, buffer[i0], buffer[i0 + 1], buffer[i0 + 2], buffer[i0 + 3]);\r\n    } else {\r\n      for (let i0 = 0; i0 < n; i0 += 4)\r\n        rangeToExtend.extendXYZW(buffer[i0], buffer[i0 + 1], buffer[i0 + 2], buffer[i0 + 3]);\r\n    }\r\n  }\r\n}\r\n"]}

package/lib/esm/bspline/BSplineCurveOps.d.ts

@@ -0,0 +1,159 @@
+/** @packageDocumentation
+ * @module Bspline
+ */
+import { IndexedXYZCollection } from "../geometry3d/IndexedXYZCollection";
+import { Point3d } from "../geometry3d/Point3dVector3d";
+import { BSplineCurve3d } from "./BSplineCurve";
+import { InterpolationCurve3dOptions, InterpolationCurve3dProps } from "./InterpolationCurve3d";
+/**
+ * A class with static methods for creating B-spline curves.
+ * @public
+ */
+export declare class BSplineCurveOps {
+    /**
+     * Greville knot algorithm: alternative to traditional c2 cubic algorithm allowing for any order, but no end conditions or periodicity.
+     * @param points pass-through points.
+     * @param order bspline order (1 more than degree)
+     */
+    static createThroughPoints(points: IndexedXYZCollection | Point3d[], order: number): BSplineCurve3d | undefined;
+    /**
+     * Construct BSplineCurve3d that fit points using the C2 cubic algorithm.
+     * @param options curve definition, unmodified
+     */
+    static createThroughPointsC2Cubic(options: InterpolationCurve3dOptions): BSplineCurve3d | undefined;
+}
+/**
+ * Namespace for collecting curve fit API
+ * @public
+ */
+export declare namespace BSplineCurveOps {
+    /**
+     * A helper class for creating C2 cubic fit curves.
+     * Knots herein are understood to be *interior* knots (including the start/end knot),
+     * so that there is one knot per fit point. In other words, the knots are fit parameters.
+     * @private
+     */
+    class C2CubicFit {
+        /** Transform fit parameters to span [0,1]
+         * @param knots fit parameters, normalized in place
+         */
+        private static normalizeKnots;
+        /** Compute chord-length fit parameters for C2 cubic fit algorithm */
+        private static constructChordLengthParameters;
+        /** Compute uniform fit parameters for C2 cubic fit algorithm */
+        private static constructUniformParameters;
+        /** Remove duplicate fit points, and their given knots in parallel */
+        private static removeDuplicateFitPoints;
+        /** Construct fit parameters for the c2 cubic fit algorithm, if they are missing.
+         * @param options validated as per validateOptions, possibly modified
+         * @return whether fit parameters are valid
+         */
+        static constructFitParameters(options: InterpolationCurve3dOptions): boolean;
+        /** Compute a row of the tridiagonal system matrix from Farin.
+         * @param alpha sub-diagonal, length = # fit points
+         * @param beta diagonal, length = # fit points
+         * @param gamma super-diagonal, length = # fit points
+         * @param index 0-based row index to set
+         */
+        private static computeAlphaBetaGamma;
+        /** Setup tridiagonal system for 2 fit points
+         * @param alpha sub-diagonal, length = 2
+         * @param beta diagonal, length = 2
+         * @param gamma super-diagonal, length = 2
+         */
+        private static setUpSystem2Points;
+        /** Setup tridiagonal system for 3 fit points
+         * @param alpha sub-diagonal, length = 3
+         * @param beta diagonal, length = 3
+         * @param gamma super-diagonal, length = 3
+         * @param options validated as per validateOptions, unmodified
+         * @param useNaturalStartTangent whether to bake the natural end condition into the first row
+         * @param useNaturalEndTangent whether to bake the natural end condition into the last row
+         */
+        private static setUpSystem3Points;
+        /** Setup tridiagonal system for 4 fit points or more
+         * @param alpha sub-diagonal, length = # fit points
+         * @param beta diagonal, length = # fit points
+         * @param gamma super-diagonal, length = # fit points
+         * @param options validated as per validateOptions, unmodified
+         * @param useNaturalStartTangent whether to bake the natural end condition into the first row
+         * @param useNaturalEndTangent whether to bake the natural end condition into the last row
+         */
+        private static setUpSystem4PointsOrMore;
+        /** Setup tridiagonal system
+         * @param alpha sub-diagonal, length = # fitPoints
+         * @param beta diagonal, length = # fitPoints
+         * @param gamma super-diagonal, length = # fitPoints
+         * @param options validated as per validateOptions, unmodified
+         */
+        private static setUpSystem;
+        /** Set the Bessel end condition for the linear system.
+         * @param dataPts array whose middle is the system rhs (augmented with first/last fitPoint at beginning/end);
+         *                2nd or penultimate point is set by this function.
+         * @param options validated as per validateOptions, unmodified
+         * @param atStart whether end condition is for start of curve (false: end of curve)
+         */
+        private static setBesselEndCondition;
+        /** Set the natural end condition for the linear system.
+         *  This is the end condition used by ADSK for fit-splines with a given zero tangent.
+         * @param dataPts array whose middle is the system rhs (augmented with first/last fitPoint at beginning/end);
+         *                2nd or penultimate point is set by this function.
+         * @param options validated as per validateOptions, unmodified
+         * @param atStart whether end condition is for start of curve (false: end of curve)
+         */
+        private static setNaturalEndCondition;
+        /** Set the end condition for the linear system to the given tangent, scaled by chord length.
+         *  This is the end condition used by ADSK for fit-splines with a given nonzero tangent.
+         * @param dataPts array whose middle is the system rhs (augmented with first/last fitPoint at beginning/end);
+         *                2nd or penultimate point is set by this function.
+         * @param options validated as per validateOptions, unmodified
+         * @param atStart whether end condition is for start of curve (false: end of curve)
+         */
+        private static setChordLengthScaledEndCondition;
+        /** Set the end condition for the linear system to the given tangent, scaled by bessel length.
+         * @param dataPts array whose middle is the system rhs (augmented with first/last fitPoint at beginning/end);
+         *                2nd or penultimate point is set by this function.
+         * @param options validated as per validateOptions, unmodified
+         * @param atStart whether end condition is for start of curve (false: end of curve)
+         */
+        private static setBesselLengthScaledEndCondition;
+        /** Set the end condition for a physically closed (non-periodic) interpolant.
+         * @param dataPts array whose middle is the system rhs (augmented with first/last fitPoint at beginning/end);
+         *                2nd or penultimate point is set by this function.
+         * @param options validated as per validateOptions, unmodified
+         */
+        private static setPhysicallyClosedEndCondition;
+        /** Set end conditions for the linear system to solve for the poles of the open interpolant, as per Farin 3e/4e.
+         * @param dataPts array whose interior is the system rhs and whose first/last entries are the first/last fitPoints;
+         *                points are inserted to become the 2nd and penultimate dataPts, the first/last rows of the system rhs.
+         * @param options validated as per validateOptions, unmodified
+         */
+        private static setEndConditions;
+        /** Solve the near tridiagonal system for a periodic C2 cubic interpolant.
+         * Alpha, beta, gamma are computed by setUpSystem, have same length as fitPts, and are overwritten.
+         */
+        private static solveNearTridiagonal;
+        /** Adjust options by correcting invalid combinations
+         * @param options curve definition, possibly modified
+         */
+        static validateOptions(options: InterpolationCurve3dOptions): boolean;
+        /** Converts a full cubic knot vector of expected length into fit parameters, by removing extraneous exterior knots.
+         * @param knots cubic knot vector, unmodified
+         * @param numFitPoints number of fit points
+         * @return fit parameters, or undefined if unexpected input
+         **/
+        static convertCubicKnotVectorToFitParams(knots: number[] | undefined, numFitPoints: number, normalize?: boolean): number[] | undefined;
+        /** Return fit parameters augmented to a full cubic knot vector.
+         * @param params fit parameters, unmodified
+         * @param legacy whether to create a legacy (DGN) full knot vector, or modern vector with two less knots
+         **/
+        static convertFitParamsToCubicKnotVector(params: number[] | undefined, closed?: boolean, legacy?: boolean): number[] | undefined;
+        /** Ensure full legacy knot vector for JSON export **/
+        static convertToJsonKnots(props: InterpolationCurve3dProps): void;
+        /** Construct the control points for the c2 cubic fit algorithm
+         * @param options validated as per validateOptions, possibly modified
+         */
+        static constructPoles(options: InterpolationCurve3dOptions): Point3d[] | Float64Array | undefined;
+    }
+}
+//# sourceMappingURL=BSplineCurveOps.d.ts.map