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

package/lib/esm/bspline/KnotVector.js

@@ -0,0 +1,427 @@
+/*---------------------------------------------------------------------------------------------
+* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+* See LICENSE.md in the project root for license terms and full copyright notice.
+*--------------------------------------------------------------------------------------------*/
+/** @packageDocumentation
+ * @module Bspline
+ */
+// import { Point2d } from "../Geometry2d";
+/* eslint-disable @typescript-eslint/naming-convention, no-empty, no-console*/
+import { Geometry } from "../Geometry";
+import { NumberArray } from "../geometry3d/PointHelpers";
+/**
+ * Enumeration of the possible ways of converting a "periodic" knot vector to an open knot vector.
+ * None (0) ==> no wrap possible
+ * OpenByAddingControlPoints (1)  ==> wrapped by adding poles
+ * OpenByRemovingKnots (2)  ==> wrapped by deleting extreme knots.
+ * @public
+ */
+export var BSplineWrapMode;
+(function (BSplineWrapMode) {
+    /** No conversion to periodic */
+    BSplineWrapMode[BSplineWrapMode["None"] = 0] = "None";
+    /** Convert to periodic by removing control points.  This is typical for closed bcurve constructed by control points with maximum continuity.
+     * * Knots stay the same in open and periodic form.
+     * * Periodic form omits {degree} control points.
+     */
+    BSplineWrapMode[BSplineWrapMode["OpenByAddingControlPoints"] = 1] = "OpenByAddingControlPoints";
+    /** Convert to periodic by adding special knots.  This is typical of closed bcurve constructed as exact circular or elliptic arc
+     * * 2 knots on each end are omitted in open form
+     * * poles stay the same.
+     */
+    BSplineWrapMode[BSplineWrapMode["OpenByRemovingKnots"] = 2] = "OpenByRemovingKnots";
+})(BSplineWrapMode || (BSplineWrapMode = {}));
+/**
+ * Array of non-decreasing numbers acting as a knot array for bsplines.
+ *
+ * * Essential identity: numKnots = numPoles + order = numPoles + degree - 1
+ * * Various bspline libraries have confusion over how many "end knots" are needed. "Many" libraries (including MicroStation)
+ *     incorrectly demand "order" knots at each end for clamping.   But only "order - 1" are really needed.
+ * * This class uses the "order-1" convention.
+ * * This class provides queries to convert among spanIndex and knotIndex
+ * * A span is a single interval of the knots.
+ * * The left knot of span {k} is knot {k+degree-1}
+ * * This class provides queries to convert among spanFraction, fraction of knot range, and knot
+ * * core computations (evaluateBasisFunctions) have leftKnotIndex and global knot value as inputs.  Caller's need to
+ * know their primary values (global knot, spanFraction).
+ * @public
+ */
+export class KnotVector {
+    /**
+     *
+     * * If knots is a number array or Float64Array, the those values become the local knot array.
+     * * If knots is a simple number, the local knot array is allocated to that size but left as zeros.
+     * @param knots
+     * @param degree
+     */
+    constructor(knots, degree, wrapMode) {
+        this.degree = degree;
+        this._wrapMode = wrapMode;
+        // default values to satisfy compiler -- real values hapn setupFixedValues or final else defers to user
+        this._knot0 = 0.0;
+        this._knot1 = 1.0;
+        // satisfy the initialize checker ..
+        if (Array.isArray(knots)) { // remark:  This ctor is private.  The callers (as of April 2019) do not use this path.
+            this.knots = new Float64Array(knots.length);
+            this.setKnots(knots);
+            this.setupFixedValues();
+        }
+        else if (knots instanceof Float64Array) {
+            this.knots = knots.slice();
+            this.setupFixedValues();
+        }
+        else { // caller is responsible for filling array separately ...
+            this.knots = new Float64Array(knots);
+        }
+    }
+    /** Return the leftmost knot value (of the active interval, ignoring unclamped leading knots)*/
+    get leftKnot() { return this._knot0; }
+    /** Return the rightmost knot value (of the active interval, ignoring unclamped leading knots)*/
+    get rightKnot() { return this._knot1; }
+    /** Return the index of the leftmost knot of the active interval */
+    get leftKnotIndex() { return this.degree - 1; }
+    /** Return the index of the rightmost knot of the active interval */
+    get rightKnotIndex() { return this.knots.length - this.degree; }
+    /** Whether the bspline was created by adding poles into "closed" structure. This is used by serialize/deserialize to mark knotVector's that were converted from periodic style. */
+    get wrappable() { return this._wrapMode === undefined ? BSplineWrapMode.None : this._wrapMode; }
+    set wrappable(value) { this._wrapMode = value; }
+    /** Return the number of bezier spans.  Not that this includes zero-length spans if there are repeated knots. */
+    get numSpans() { return this.rightKnotIndex - this.leftKnotIndex; }
+    /** copy degree and knots to a new KnotVector. */
+    clone() { return new KnotVector(this.knots, this.degree, this.wrappable); }
+    setupFixedValues() {
+        // These should be read-only . ..
+        this._knot0 = this.knots[this.degree - 1];
+        this._knot1 = this.knots[this.knots.length - this.degree];
+    }
+    /** Return the total knot distance from beginning to end. */
+    get knotLength01() { return this._knot1 - this._knot0; }
+    /**
+     * Returns true if all numeric values have wraparound conditions for "closed" knotVector with specified wrap mode
+     * @param mode optional test mode.  If undefined, use the this.wrappable.
+     */
+    testClosable(mode) {
+        if (mode === undefined)
+            mode = this.wrappable;
+        const leftKnotIndex = this.leftKnotIndex;
+        const rightKnotIndex = this.rightKnotIndex;
+        const period = this.rightKnot - this.leftKnot;
+        const degree = this.degree;
+        const indexDelta = rightKnotIndex - leftKnotIndex;
+        // maximum continuity mode .  . .
+        if (mode === BSplineWrapMode.OpenByAddingControlPoints) {
+            for (let k0 = leftKnotIndex - degree + 1; k0 < leftKnotIndex + degree - 1; k0++) {
+                const k1 = k0 + indexDelta;
+                if (!Geometry.isSameCoordinate(this.knots[k0] + period, this.knots[k1]))
+                    return false;
+            }
+            return true;
+        }
+        // arc mode ...
+        if (mode === BSplineWrapMode.OpenByRemovingKnots) {
+            // we expect {degree} replicated knots at each end . . .
+            const numRepeated = degree - 1;
+            const leftKnot = this.knots[leftKnotIndex];
+            const rightKnot = this.knots[rightKnotIndex];
+            for (let i = 0; i < numRepeated; i++) {
+                if (!Geometry.isSameCoordinate(leftKnot, this.knots[leftKnotIndex - i - 1]))
+                    return false;
+                if (!Geometry.isSameCoordinate(rightKnot, this.knots[rightKnotIndex + i + 1]))
+                    return false;
+            }
+            return true;
+        }
+        return false;
+    }
+    /** Test matching degree and knot values */
+    isAlmostEqual(other) {
+        if (this.degree !== other.degree)
+            return false;
+        return NumberArray.isAlmostEqual(this.knots, other.knots, KnotVector.knotTolerance);
+    }
+    /** install knot values from an array, optionally ignoring first and last.
+     */
+    setKnots(knots, skipFirstAndLast) {
+        const numAllocate = skipFirstAndLast ? knots.length - 2 : knots.length;
+        if (numAllocate !== this.knots.length)
+            this.knots = new Float64Array(numAllocate);
+        if (skipFirstAndLast) {
+            for (let i = 1; i + 1 < knots.length; i++)
+                this.knots[i - 1] = knots[i];
+        }
+        else {
+            for (let i = 0; i < knots.length; i++)
+                this.knots[i] = knots[i];
+        }
+        this.setupFixedValues();
+    }
+    /**
+     * Create knot vector with {degree-1} replicated knots at start and end, and uniform knots between.
+     * @param numPoles Number of poles
+     * @param degree degree of polynomial
+     * @param a0 left knot value for active interval
+     * @param a1 right knot value for active interval
+     */
+    static createUniformClamped(numPoles, degree, a0, a1) {
+        const knots = new KnotVector(numPoles + degree - 1, degree);
+        let k = 0;
+        for (let m = 0; m < degree; m++)
+            knots.knots[k++] = a0;
+        const du = 1.0 / (numPoles - degree);
+        for (let i = 1; i + degree < numPoles; i++)
+            knots.knots[k++] = a0 + i * du * (a1 - a0);
+        for (let m = 0; m < degree; m++)
+            knots.knots[k++] = a1;
+        knots.setupFixedValues();
+        return knots;
+    }
+    /**
+     * Create knot vector with {degree-1} replicated knots at start and end, and uniform knots between.
+     * @param  numInterval number of intervals in knot space.  (NOT POLE COUNT)
+     * @param degree degree of polynomial
+     * @param a0 left knot value for active interval
+     * @param a1 right knot value for active interval
+     */
+    static createUniformWrapped(numInterval, degree, a0, a1) {
+        const knots = new KnotVector(numInterval + 2 * degree - 1, degree);
+        const du = 1.0 / numInterval;
+        for (let i = 1 - degree, k = 0; i < numInterval + degree; i++, k++) {
+            knots.knots[k] = Geometry.interpolate(a0, i * du, a1);
+        }
+        knots.setupFixedValues();
+        return knots;
+    }
+    /**
+     * Create knot vector with given knot values and degree.
+     * @param knotArray knot values
+     * @param degree degree of polynomial
+     * @param skipFirstAndLast true to skip class overclamped end knots.
+     */
+    static create(knotArray, degree, skipFirstAndLast) {
+        const numAllocate = skipFirstAndLast ? knotArray.length - 2 : knotArray.length;
+        const knots = new KnotVector(numAllocate, degree);
+        knots.setKnots(knotArray, skipFirstAndLast);
+        return knots;
+    }
+    /**
+     * Return the average of degree consecutive knots beginning at spanIndex.
+     */
+    grevilleKnot(spanIndex) {
+        if (spanIndex < 0)
+            return this.leftKnot;
+        if (spanIndex > this.rightKnotIndex)
+            return this.rightKnot;
+        let sum = 0.0;
+        for (let i = spanIndex; i < spanIndex + this.degree; i++)
+            sum += this.knots[i];
+        return sum / this.degree;
+    }
+    /** Return an array sized for a set of the basis function values. */
+    createBasisArray() { return new Float64Array(this.degree + 1); }
+    /** Convert localFraction within the interval following an indexed knot to a knot value. */
+    baseKnotFractionToKnot(knotIndex0, localFraction) {
+        const knot0 = this.knots[knotIndex0];
+        return knot0 + localFraction * (this.knots[knotIndex0 + 1] - knot0);
+    }
+    /** Convert localFraction within an indexed bezier span to a knot value. */
+    spanFractionToKnot(spanIndex, localFraction) {
+        const k = this.spanIndexToLeftKnotIndex(spanIndex);
+        return this.knots[k] + localFraction * (this.knots[k + 1] - this.knots[k]);
+    }
+    /** Convert localFraction within an indexed bezier span to fraction of active knot range. */
+    spanFractionToFraction(spanIndex, localFraction) {
+        const knot = this.spanFractionToKnot(spanIndex, localFraction);
+        return (knot - this.leftKnot) / (this.rightKnot - this.leftKnot);
+    }
+    /** Return fraction of active knot range to knot value. */
+    fractionToKnot(fraction) {
+        return Geometry.interpolate(this.knots[this.degree - 1], fraction, this.knots[this.knots.length - this.degree]);
+    }
+    /**
+     * Evaluate basis functions f[] at knot value u.
+     *
+     * @param u knot value for evaluation
+     * @param f array of basis values.  ASSUMED PROPER LENGTH
+     */
+    evaluateBasisFunctions(knotIndex0, u, f) {
+        f[0] = 1.0;
+        if (this.degree < 1)
+            return;
+        // direct compute for linear part ...
+        const u0 = this.knots[knotIndex0];
+        const u1 = this.knots[knotIndex0 + 1];
+        f[1] = (u - u0) / (u1 - u0);
+        f[0] = 1.0 - f[1];
+        if (this.degree < 2)
+            return;
+        for (let depth = 1; depth < this.degree; depth++) {
+            let kLeft = knotIndex0 - depth;
+            let kRight = kLeft + depth + 1;
+            let gCarry = 0.0;
+            for (let step = 0; step <= depth; step++) {
+                const tLeft = this.knots[kLeft++];
+                const tRight = this.knots[kRight++];
+                const fraction = (u - tLeft) / (tRight - tLeft);
+                const g1 = f[step] * fraction;
+                const g0 = f[step] * (1.0 - fraction);
+                f[step] = gCarry + g0;
+                gCarry = g1;
+            }
+            f[depth + 1] = gCarry;
+        }
+    }
+    /**
+     * Evaluate basis fucntions f[] at knot value u.
+     *
+     * @param u knot value for evaluation
+     * @param f array of basis values.  ASSUMED PROPER LENGTH
+     */
+    evaluateBasisFunctions1(knotIndex0, u, f, df, ddf) {
+        f[0] = 1.0;
+        df[0] = 0.0;
+        if (this.degree < 1)
+            return;
+        // direct compute for linear part ...
+        const u0 = this.knots[knotIndex0];
+        const u1 = this.knots[knotIndex0 + 1];
+        // ah = 1/(u1-u0)      is the derivative of fraction0
+        // (-ah) is the derivative of fraction1.
+        let ah = 1.0 / (u1 - u0);
+        f[1] = (u - u0) * ah;
+        f[0] = 1.0 - f[1];
+        df[0] = -ah;
+        df[1] = ah;
+        if (ddf) { // first derivative started constant, second derivative started zero.
+            ddf[0] = 0.0;
+            ddf[1] = 0.0;
+        }
+        if (this.degree < 2)
+            return;
+        for (let depth = 1; depth < this.degree; depth++) {
+            let kLeft = knotIndex0 - depth;
+            let kRight = kLeft + depth + 1;
+            let gCarry = 0.0;
+            let dgCarry = 0.0;
+            let ddgCarry = 0.0;
+            // f, df, ddf, are each row vectors with product of `step` linear terms.
+            // f is multiplied on the right by matrix V.  Each row has 2 nonzero entries (which sum to 1)  (0,0,1-fraction, fraction,0,0,0)
+            //    Each row of the derivative dV is two entries (0,0, -1/h, 1/h,0,0,0)
+            // Hence fnew = f * V
+            //      dfnew = df * V + f * dV
+            //      ddfnew = ddf * V + df*dV + df * dV + f * ddV
+            // but ddV is zero so
+            //      ddfnew = ddf * V + 2 * df * dV
+            for (let step = 0; step <= depth; step++) {
+                const tLeft = this.knots[kLeft++];
+                const tRight = this.knots[kRight++];
+                ah = 1.0 / (tRight - tLeft);
+                const fraction = (u - tLeft) * ah;
+                const fraction1 = 1.0 - fraction;
+                const g1 = f[step] * fraction;
+                const g0 = f[step] * fraction1;
+                const dg1 = df[step] * fraction + f[step] * ah;
+                const dg0 = df[step] * fraction1 - f[step] * ah;
+                const dfSave = 2.0 * df[step] * ah;
+                f[step] = gCarry + g0;
+                df[step] = dgCarry + dg0;
+                gCarry = g1;
+                dgCarry = dg1;
+                if (ddf) { // do the backward reference to df before rewriting df !!!
+                    const ddg1 = ddf[step] * fraction + dfSave;
+                    const ddg0 = ddf[step] * fraction1 - dfSave;
+                    ddf[step] = ddgCarry + ddg0;
+                    ddgCarry = ddg1;
+                }
+            }
+            f[depth + 1] = gCarry;
+            df[depth + 1] = dgCarry;
+            if (ddf)
+                ddf[depth + 1] = ddgCarry;
+        }
+    }
+    /** Return the (highest) index of the knot less than or equal to u */
+    knotToLeftKnotIndex(u) {
+        // Anything to left is in the first span . .
+        const firstLeftKnot = this.degree - 1;
+        if (u < this.knots[firstLeftKnot + 1])
+            return firstLeftKnot;
+        // Anything to right is in the last span ...
+        const lastLeftKnot = this.knots.length - this.degree - 1;
+        if (u >= this.knots.length - this.degree)
+            return this.knots[lastLeftKnot];
+        // ugh ... linear search ...
+        for (let i = firstLeftKnot + 1; i < lastLeftKnot; i++)
+            if (u < this.knots[i + 1])
+                return i; // testing against right side skips over multiple knot cases???
+        return lastLeftKnot;
+    }
+    /**
+     * Given a span index, return the index of the knot at its left.
+     * @param spanIndex index of span
+     */
+    spanIndexToLeftKnotIndex(spanIndex) {
+        const d = this.degree;
+        if (spanIndex <= 0.0)
+            return d - 1;
+        return Math.min(spanIndex + d - 1, this.knots.length - d);
+    }
+    /** Return the knot interval length of indexed bezier span. */
+    spanIndexToSpanLength(spanIndex) {
+        const k = this.spanIndexToLeftKnotIndex(spanIndex);
+        return this.knots[k + 1] - this.knots[k];
+    }
+    /**
+     * Given a span index, test if it is within range and has nonzero length.
+     * * note that a false return does not imply there are no more spans.  This may be a double knot (zero length span) followed by more real spans
+     * @param spanIndex index of span to test.
+     */
+    isIndexOfRealSpan(spanIndex) {
+        if (spanIndex >= 0 && spanIndex < this.knots.length - this.degree)
+            return !Geometry.isSmallMetricDistance(this.spanIndexToSpanLength(spanIndex));
+        return false;
+    }
+    /** Reflect all knots so `leftKnot` and `rightKnot` are maintained but interval lengths reverse. */
+    reflectKnots() {
+        const a = this.leftKnot;
+        const b = this.rightKnot;
+        const numKnots = this.knots.length;
+        for (let i = 0; i < numKnots; i++)
+            this.knots[i] = a + (b - this.knots[i]);
+        this.knots.reverse();
+    }
+    /**
+     * return a simple array form of the knots.  optionally replicate the first and last
+     * in classic over-clamped manner
+     */
+    copyKnots(includeExtraEndKnot) {
+        const wrap = this.wrappable === BSplineWrapMode.OpenByAddingControlPoints && this.testClosable();
+        const leftIndex = this.leftKnotIndex;
+        const rightIndex = this.rightKnotIndex;
+        const a0 = this.leftKnot;
+        const a1 = this.rightKnot;
+        const delta = a1 - a0;
+        const degree = this.degree;
+        const values = [];
+        if (includeExtraEndKnot) {
+            if (wrap) {
+                values.push(this.knots[rightIndex - degree] - delta);
+            }
+            else {
+                values.push(this.knots[0]);
+            }
+        }
+        for (const u of this.knots)
+            values.push(u);
+        if (includeExtraEndKnot) {
+            if (wrap) {
+                values.push(this.knots[leftIndex + degree] + delta);
+            }
+            else
+                values.push(values[values.length - 1]);
+        }
+        return values;
+    }
+}
+/** tolerance for considering two knots to be the same. */
+KnotVector.knotTolerance = 1.0e-9;
+//# sourceMappingURL=KnotVector.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"KnotVector.js","sourceRoot":"","sources":["../../../src/bspline/KnotVector.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAEH,2CAA2C;AAC3C,8EAA8E;AAC9E,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AACvC,OAAO,EAAE,WAAW,EAAE,MAAM,4BAA4B,CAAC;AAEzD;;;;;;GAMG;AACH,MAAM,CAAN,IAAY,eAaX;AAbD,WAAY,eAAe;IACzB,gCAAgC;IAChC,qDAAQ,CAAA;IACR;;;OAGG;IACH,+FAA6B,CAAA;IAC7B;;;OAGG;IACH,mFAAuB,CAAA;AACzB,CAAC,EAbW,eAAe,KAAf,eAAe,QAa1B;AACD;;;;;;;;;;;;;;GAcG;AACH,MAAM,OAAO,UAAU;IAwBrB;;;;;;OAMG;IACH,YAAoB,KAAuC,EAAE,MAAc,EAAE,QAA0B;QACrG,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAC;QAC1B,uGAAuG;QACvG,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC;QAClB,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC;QAClB,oCAAoC;QACpC,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,EAAE,uFAAuF;YACjH,IAAI,CAAC,KAAK,GAAG,IAAI,YAAY,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;YAC5C,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;YACrB,IAAI,CAAC,gBAAgB,EAAE,CAAC;SACzB;aAAM,IAAI,KAAK,YAAY,YAAY,EAAE;YACxC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;YAC3B,IAAI,CAAC,gBAAgB,EAAE,CAAC;SACzB;aAAM,EAAE,yDAAyD;YAChE,IAAI,CAAC,KAAK,GAAG,IAAI,YAAY,CAAC,KAAK,CAAC,CAAC;SACtC;IACH,CAAC;IArCD,+FAA+F;IAC/F,IAAW,QAAQ,KAAK,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IAC7C,gGAAgG;IAChG,IAAW,SAAS,KAAK,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IAC9C,mEAAmE;IACnE,IAAW,aAAa,KAAK,OAAO,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;IACtD,oEAAoE;IACpE,IAAW,cAAc,KAAK,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IACvE,mLAAmL;IACnL,IAAW,SAAS,KAAK,OAAO,IAAI,CAAC,SAAS,KAAK,SAAS,CAAC,CAAC,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC;IACvG,IAAW,SAAS,CAAC,KAAsB,IAAI,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC,CAAC,CAAC;IACxE,gHAAgH;IAChH,IAAW,QAAQ,KAAK,OAAO,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC;IA0B1E,iDAAiD;IAC1C,KAAK,KAAiB,OAAO,IAAI,UAAU,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IACtF,gBAAgB;QACtB,iCAAiC;QACjC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAC1C,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC;IAC5D,CAAC;IACD,4DAA4D;IAC5D,IAAW,YAAY,KAAa,OAAO,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IACvE;;;OAGG;IACI,YAAY,CAAC,IAAsB;QACxC,IAAI,IAAI,KAAK,SAAS;YACpB,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC;QACxB,MAAM,aAAa,GAAG,IAAI,CAAC,aAAa,CAAC;QACzC,MAAM,cAAc,GAAG,IAAI,CAAC,cAAc,CAAC;QAC3C,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC9C,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;QAC3B,MAAM,UAAU,GAAG,cAAc,GAAG,aAAa,CAAC;QAClD,iCAAiC;QACjC,IAAI,IAAI,KAAK,eAAe,CAAC,yBAAyB,EAAE;YACtD,KAAK,IAAI,EAAE,GAAG,aAAa,GAAG,MAAM,GAAG,CAAC,EAAE,EAAE,GAAG,aAAa,GAAG,MAAM,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE;gBAC/E,MAAM,EAAE,GAAG,EAAE,GAAG,UAAU,CAAC;gBAC3B,IAAI,CAAC,QAAQ,CAAC,gBAAgB,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;oBACrE,OAAO,KAAK,CAAC;aAChB;YACD,OAAO,IAAI,CAAC;SACb;QACD,eAAe;QACf,IAAI,IAAI,KAAK,eAAe,CAAC,mBAAmB,EAAE;YAChD,wDAAwD;YACxD,MAAM,WAAW,GAAG,MAAM,GAAG,CAAC,CAAC;YAC/B,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC;YAC3C,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC;YAC7C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,EAAE,CAAC,EAAE,EAAE;gBACpC,IAAI,CAAC,QAAQ,CAAC,gBAAgB,CAAC,QAAQ,EAAE,IAAI,CAAC,KAAK,CAAC,aAAa,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;oBACzE,OAAO,KAAK,CAAC;gBACf,IAAI,CAAC,QAAQ,CAAC,gBAAgB,CAAC,SAAS,EAAE,IAAI,CAAC,KAAK,CAAC,cAAc,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;oBAC3E,OAAO,KAAK,CAAC;aAChB;YACD,OAAO,IAAI,CAAC;SACb;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IACD,2CAA2C;IACpC,aAAa,CAAC,KAAiB;QACpC,IAAI,IAAI,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM;YAAE,OAAO,KAAK,CAAC;QAC/C,OAAO,WAAW,CAAC,aAAa,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,UAAU,CAAC,aAAa,CAAC,CAAC;IACtF,CAAC;IACD;OACG;IACI,QAAQ,CAAC,KAA8B,EAAE,gBAA0B;QACxE,MAAM,WAAW,GAAG,gBAAgB,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC;QACvE,IAAI,WAAW,KAAK,IAAI,CAAC,KAAK,CAAC,MAAM;YACnC,IAAI,CAAC,KAAK,GAAG,IAAI,YAAY,CAAC,WAAW,CAAC,CAAC;QAC7C,IAAI,gBAAgB,EAAE;YACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE;gBACvC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;SAEhC;aAAM;YACL,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE;gBACnC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;SAC5B;QACD,IAAI,CAAC,gBAAgB,EAAE,CAAC;IAC1B,CAAC;IACD;;;;;;OAMG;IACI,MAAM,CAAC,oBAAoB,CAAC,QAAgB,EAAE,MAAc,EAAE,EAAU,EAAE,EAAU;QACzF,MAAM,KAAK,GAAG,IAAI,UAAU,CAAC,QAAQ,GAAG,MAAM,GAAG,CAAC,EAAE,MAAM,CAAC,CAAC;QAC5D,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE;YAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC;QACtD,MAAM,EAAE,GAAG,GAAG,GAAG,CAAC,QAAQ,GAAG,MAAM,CAAC,CAAC;QACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,GAAG,QAAQ,EAAE,CAAC,EAAE;YACxC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;QAC7C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE;YAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC;QACtD,KAAK,CAAC,gBAAgB,EAAE,CAAC;QACzB,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;;OAMG;IACI,MAAM,CAAC,oBAAoB,CAAC,WAAmB,EAAE,MAAc,EAAE,EAAU,EAAE,EAAU;QAC5F,MAAM,KAAK,GAAG,IAAI,UAAU,CAAC,WAAW,GAAG,CAAC,GAAG,MAAM,GAAG,CAAC,EAAE,MAAM,CAAC,CAAC;QACnE,MAAM,EAAE,GAAG,GAAG,GAAG,WAAW,CAAC;QAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE;YAClE,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,WAAW,CAAC,EAAE,EAAE,CAAC,GAAG,EAAE,EAAE,EAAE,CAAC,CAAC;SACvD;QACD,KAAK,CAAC,gBAAgB,EAAE,CAAC;QACzB,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;;OAKG;IACI,MAAM,CAAC,MAAM,CAAC,SAAkC,EAAE,MAAc,EAAE,gBAA0B;QACjG,MAAM,WAAW,GAAG,gBAAgB,CAAC,CAAC,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,MAAM,CAAC;QAC/E,MAAM,KAAK,GAAG,IAAI,UAAU,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;QAClD,KAAK,CAAC,QAAQ,CAAC,SAAS,EAAE,gBAAgB,CAAC,CAAC;QAC5C,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACI,YAAY,CAAC,SAAiB;QACnC,IAAI,SAAS,GAAG,CAAC;YAAE,OAAO,IAAI,CAAC,QAAQ,CAAC;QACxC,IAAI,SAAS,GAAG,IAAI,CAAC,cAAc;YAAE,OAAO,IAAI,CAAC,SAAS,CAAC;QAC3D,IAAI,GAAG,GAAG,GAAG,CAAC;QACd,KAAK,IAAI,CAAC,GAAG,SAAS,EAAE,CAAC,GAAG,SAAS,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE;YACtD,GAAG,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACvB,OAAO,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC;IAC3B,CAAC;IACD,oEAAoE;IAC7D,gBAAgB,KAAmB,OAAO,IAAI,YAAY,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACrF,2FAA2F;IACpF,sBAAsB,CAAC,UAAkB,EAAE,aAAqB;QACrE,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;QACrC,OAAO,KAAK,GAAG,aAAa,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,UAAU,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC;IACtE,CAAC;IACD,2EAA2E;IACpE,kBAAkB,CAAC,SAAiB,EAAE,aAAqB;QAChE,MAAM,CAAC,GAAG,IAAI,CAAC,wBAAwB,CAAC,SAAS,CAAC,CAAC;QACnD,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,aAAa,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7E,CAAC;IACD,4FAA4F;IACrF,sBAAsB,CAAC,SAAiB,EAAE,aAAqB;QACpE,MAAM,IAAI,GAAG,IAAI,CAAC,kBAAkB,CAAC,SAAS,EAAE,aAAa,CAAC,CAAC;QAC/D,OAAO,CAAC,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC;IACnE,CAAC;IACD,0DAA0D;IACnD,cAAc,CAAC,QAAgB;QACpC,OAAO,QAAQ,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IAClH,CAAC;IACD;;;;;OAKG;IACI,sBAAsB,CAAC,UAAkB,EAAE,CAAS,EAAE,CAAe;QAC1E,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;QACX,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC;YAAE,OAAO;QAC5B,qCAAqC;QACrC,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;QAClC,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC;QACtC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;QAC5B,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAClB,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC;YAAE,OAAO;QAE5B,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,IAAI,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE;YAChD,IAAI,KAAK,GAAG,UAAU,GAAG,KAAK,CAAC;YAC/B,IAAI,MAAM,GAAG,KAAK,GAAG,KAAK,GAAG,CAAC,CAAC;YAC/B,IAAI,MAAM,GAAG,GAAG,CAAC;YACjB,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,IAAI,KAAK,EAAE,IAAI,EAAE,EAAE;gBACxC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC;gBAClC,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;gBACpC,MAAM,QAAQ,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,MAAM,GAAG,KAAK,CAAC,CAAC;gBAChD,MAAM,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC;gBAC9B,MAAM,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,QAAQ,CAAC,CAAC;gBACtC,CAAC,CAAC,IAAI,CAAC,GAAG,MAAM,GAAG,EAAE,CAAC;gBACtB,MAAM,GAAG,EAAE,CAAC;aACb;YACD,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC;SACvB;IACH,CAAC;IAED;;;;;OAKG;IACI,uBAAuB,CAAC,UAAkB,EAAE,CAAS,EAAE,CAAe,EAAE,EAAgB,EAAE,GAAkB;QACjH,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;QAAC,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;QACxB,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC;YAAE,OAAO;QAC5B,qCAAqC;QACrC,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;QAClC,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC;QACtC,qDAAqD;QACrD,wCAAwC;QACxC,IAAI,EAAE,GAAG,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;QACzB,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC;QACrB,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAClB,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;QAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;QACxB,IAAI,GAAG,EAAE,EAAG,qEAAqE;YAC/E,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;YAAC,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;SAC5B;QACD,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC;YAAE,OAAO;QAC5B,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,IAAI,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE;YAChD,IAAI,KAAK,GAAG,UAAU,GAAG,KAAK,CAAC;YAC/B,IAAI,MAAM,GAAG,KAAK,GAAG,KAAK,GAAG,CAAC,CAAC;YAC/B,IAAI,MAAM,GAAG,GAAG,CAAC;YACjB,IAAI,OAAO,GAAG,GAAG,CAAC;YAClB,IAAI,QAAQ,GAAG,GAAG,CAAC;YACnB,wEAAwE;YACxE,+HAA+H;YAC/H,yEAAyE;YACzE,qBAAqB;YACrB,+BAA+B;YAC/B,oDAAoD;YACpD,qBAAqB;YACrB,sCAAsC;YACtC,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,IAAI,KAAK,EAAE,IAAI,EAAE,EAAE;gBACxC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC;gBAClC,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;gBACpC,EAAE,GAAG,GAAG,GAAG,CAAC,MAAM,GAAG,KAAK,CAAC,CAAC;gBAC5B,MAAM,QAAQ,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC;gBAClC,MAAM,SAAS,GAAG,GAAG,GAAG,QAAQ,CAAC;gBACjC,MAAM,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC;gBAC9B,MAAM,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,SAAS,CAAC;gBAC/B,MAAM,GAAG,GAAG,EAAE,CAAC,IAAI,CAAC,GAAG,QAAQ,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC;gBAC/C,MAAM,GAAG,GAAG,EAAE,CAAC,IAAI,CAAC,GAAG,SAAS,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC;gBAChD,MAAM,MAAM,GAAG,GAAG,GAAG,EAAE,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC;gBACnC,CAAC,CAAC,IAAI,CAAC,GAAG,MAAM,GAAG,EAAE,CAAC;gBACtB,EAAE,CAAC,IAAI,CAAC,GAAG,OAAO,GAAG,GAAG,CAAC;gBACzB,MAAM,GAAG,EAAE,CAAC;gBACZ,OAAO,GAAG,GAAG,CAAC;gBACd,IAAI,GAAG,EAAE,EAAG,0DAA0D;oBACpE,MAAM,IAAI,GAAG,GAAG,CAAC,IAAI,CAAC,GAAG,QAAQ,GAAG,MAAM,CAAC;oBAC3C,MAAM,IAAI,GAAG,GAAG,CAAC,IAAI,CAAC,GAAG,SAAS,GAAG,MAAM,CAAC;oBAC5C,GAAG,CAAC,IAAI,CAAC,GAAG,QAAQ,GAAG,IAAI,CAAC;oBAC5B,QAAQ,GAAG,IAAI,CAAC;iBACjB;aACF;YACD,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC;YACtB,EAAE,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC;YACxB,IAAI,GAAG;gBACL,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC;SAC7B;IACH,CAAC;IACD,qEAAqE;IAC9D,mBAAmB,CAAC,CAAS;QAClC,4CAA4C;QAC5C,MAAM,aAAa,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;QACtC,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,aAAa,GAAG,CAAC,CAAC;YAAE,OAAO,aAAa,CAAC;QAC5D,4CAA4C;QAC5C,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;QACzD,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM;YAAE,OAAO,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC;QAC1E,4BAA4B;QAC5B,KAAK,IAAI,CAAC,GAAG,aAAa,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,EAAE,CAAC,EAAE;YACnD,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC;gBAAE,OAAO,CAAC,CAAC,CAAE,+DAA+D;QACvG,OAAO,YAAY,CAAC;IACtB,CAAC;IACD;;;OAGG;IACI,wBAAwB,CAAC,SAAiB;QAC/C,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;QACtB,IAAI,SAAS,IAAI,GAAG;YAAE,OAAO,CAAC,GAAG,CAAC,CAAC;QACnC,OAAO,IAAI,CAAC,GAAG,CAAC,SAAS,GAAG,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC5D,CAAC;IACD,8DAA8D;IACvD,qBAAqB,CAAC,SAAiB;QAC5C,MAAM,CAAC,GAAG,IAAI,CAAC,wBAAwB,CAAC,SAAS,CAAC,CAAC;QACnD,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAC3C,CAAC;IACD;;;;OAIG;IACI,iBAAiB,CAAC,SAAiB;QACxC,IAAI,SAAS,IAAI,CAAC,IAAI,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM;YAC/D,OAAO,CAAC,QAAQ,CAAC,qBAAqB,CAAC,IAAI,CAAC,qBAAqB,CAAC,SAAS,CAAC,CAAC,CAAC;QAChF,OAAO,KAAK,CAAC;IACf,CAAC;IACD,mGAAmG;IAC5F,YAAY;QACjB,MAAM,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC;QACxB,MAAM,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC;QACzB,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;QACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE;YAC/B,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1C,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC;IACvB,CAAC;IACD;;;OAGG;IACI,SAAS,CAAC,mBAA4B;QAC3C,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,KAAK,eAAe,CAAC,yBAAyB,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;QACjG,MAAM,SAAS,GAAG,IAAI,CAAC,aAAa,CAAC;QACrC,MAAM,UAAU,GAAG,IAAI,CAAC,cAAc,CAAC;QACvC,MAAM,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAC;QACzB,MAAM,EAAE,GAAG,IAAI,CAAC,SAAS,CAAC;QAC1B,MAAM,KAAK,GAAG,EAAE,GAAG,EAAE,CAAC;QACtB,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;QAC3B,MAAM,MAAM,GAAa,EAAE,CAAC;QAC5B,IAAI,mBAAmB,EAAE;YACvB,IAAI,IAAI,EAAE;gBACR,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,UAAU,GAAG,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC;aACtD;iBAAM;gBACL,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;aAC5B;SACF;QACD,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK;YAAE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC3C,IAAI,mBAAmB,EAAE;YACvB,IAAI,IAAI,EAAE;gBACR,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,GAAG,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC;aACrD;;gBACC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;SAC1C;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;;AAvWD,0DAA0D;AACnC,wBAAa,GAAG,MAAM,CAAC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n/** @packageDocumentation\r\n * @module Bspline\r\n */\r\n\r\n// import { Point2d } from \"../Geometry2d\";\r\n/* eslint-disable @typescript-eslint/naming-convention, no-empty, no-console*/\r\nimport { Geometry } from \"../Geometry\";\r\nimport { NumberArray } from \"../geometry3d/PointHelpers\";\r\n\r\n/**\r\n * Enumeration of the possible ways of converting a \"periodic\" knot vector to an open knot vector.\r\n * None (0) ==> no wrap possible\r\n * OpenByAddingControlPoints (1)  ==> wrapped by adding poles\r\n * OpenByRemovingKnots (2)  ==> wrapped by deleting extreme knots.\r\n * @public\r\n */\r\nexport enum BSplineWrapMode {\r\n  /** No conversion to periodic */\r\n  None = 0,\r\n  /** Convert to periodic by removing control points.  This is typical for closed bcurve constructed by control points with maximum continuity.\r\n   * * Knots stay the same in open and periodic form.\r\n   * * Periodic form omits {degree} control points.\r\n   */\r\n  OpenByAddingControlPoints = 1,\r\n  /** Convert to periodic by adding special knots.  This is typical of closed bcurve constructed as exact circular or elliptic arc\r\n   * * 2 knots on each end are omitted in open form\r\n   * * poles stay the same.\r\n   */\r\n  OpenByRemovingKnots = 2,\r\n}\r\n/**\r\n * Array of non-decreasing numbers acting as a knot array for bsplines.\r\n *\r\n * * Essential identity: numKnots = numPoles + order = numPoles + degree - 1\r\n * * Various bspline libraries have confusion over how many \"end knots\" are needed. \"Many\" libraries (including MicroStation)\r\n *     incorrectly demand \"order\" knots at each end for clamping.   But only \"order - 1\" are really needed.\r\n * * This class uses the \"order-1\" convention.\r\n * * This class provides queries to convert among spanIndex and knotIndex\r\n * * A span is a single interval of the knots.\r\n * * The left knot of span {k} is knot {k+degree-1}\r\n * * This class provides queries to convert among spanFraction, fraction of knot range, and knot\r\n * * core computations (evaluateBasisFunctions) have leftKnotIndex and global knot value as inputs.  Caller's need to\r\n * know their primary values (global knot, spanFraction).\r\n * @public\r\n */\r\nexport class KnotVector {\r\n  /** The simple array of knot values. */\r\n  public knots: Float64Array;\r\n  /** Return the degree of basis functions defined in these knots. */\r\n  public degree: number;\r\n  private _knot0: number;\r\n  private _knot1: number;\r\n\r\n  private _wrapMode?: BSplineWrapMode;\r\n  /** tolerance for considering two knots to be the same. */\r\n  public static readonly knotTolerance = 1.0e-9;\r\n  /** Return the leftmost knot value (of the active interval, ignoring unclamped leading knots)*/\r\n  public get leftKnot() { return this._knot0; }\r\n  /** Return the rightmost knot value (of the active interval, ignoring unclamped leading knots)*/\r\n  public get rightKnot() { return this._knot1; }\r\n  /** Return the index of the leftmost knot of the active interval */\r\n  public get leftKnotIndex() { return this.degree - 1; }\r\n  /** Return the index of the rightmost knot of the active interval */\r\n  public get rightKnotIndex() { return this.knots.length - this.degree; }\r\n  /** Whether the bspline was created by adding poles into \"closed\" structure. This is used by serialize/deserialize to mark knotVector's that were converted from periodic style. */\r\n  public get wrappable() { return this._wrapMode === undefined ? BSplineWrapMode.None : this._wrapMode; }\r\n  public set wrappable(value: BSplineWrapMode) { this._wrapMode = value; }\r\n  /** Return the number of bezier spans.  Not that this includes zero-length spans if there are repeated knots. */\r\n  public get numSpans() { return this.rightKnotIndex - this.leftKnotIndex; }\r\n  /**\r\n   *\r\n   * * If knots is a number array or Float64Array, the those values become the local knot array.\r\n   * * If knots is a simple number, the local knot array is allocated to that size but left as zeros.\r\n   * @param knots\r\n   * @param degree\r\n   */\r\n  private constructor(knots: number[] | Float64Array | number, degree: number, wrapMode?: BSplineWrapMode) {\r\n    this.degree = degree;\r\n    this._wrapMode = wrapMode;\r\n    // default values to satisfy compiler -- real values hapn setupFixedValues or final else defers to user\r\n    this._knot0 = 0.0;\r\n    this._knot1 = 1.0;\r\n    // satisfy the initialize checker ..\r\n    if (Array.isArray(knots)) { // remark:  This ctor is private.  The callers (as of April 2019) do not use this path.\r\n      this.knots = new Float64Array(knots.length);\r\n      this.setKnots(knots);\r\n      this.setupFixedValues();\r\n    } else if (knots instanceof Float64Array) {\r\n      this.knots = knots.slice();\r\n      this.setupFixedValues();\r\n    } else { // caller is responsible for filling array separately ...\r\n      this.knots = new Float64Array(knots);\r\n    }\r\n  }\r\n  /** copy degree and knots to a new KnotVector. */\r\n  public clone(): KnotVector { return new KnotVector(this.knots, this.degree, this.wrappable); }\r\n  private setupFixedValues() {\r\n    // These should be read-only . ..\r\n    this._knot0 = this.knots[this.degree - 1];\r\n    this._knot1 = this.knots[this.knots.length - this.degree];\r\n  }\r\n  /** Return the total knot distance from beginning to end. */\r\n  public get knotLength01(): number { return this._knot1 - this._knot0; }\r\n  /**\r\n   * Returns true if all numeric values have wraparound conditions for \"closed\" knotVector with specified wrap mode\r\n   * @param mode optional test mode.  If undefined, use the this.wrappable.\r\n   */\r\n  public testClosable(mode?: BSplineWrapMode): boolean {\r\n    if (mode === undefined)\r\n      mode = this.wrappable;\r\n    const leftKnotIndex = this.leftKnotIndex;\r\n    const rightKnotIndex = this.rightKnotIndex;\r\n    const period = this.rightKnot - this.leftKnot;\r\n    const degree = this.degree;\r\n    const indexDelta = rightKnotIndex - leftKnotIndex;\r\n    // maximum continuity mode .  . .\r\n    if (mode === BSplineWrapMode.OpenByAddingControlPoints) {\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.knots[k0] + period, this.knots[k1]))\r\n          return false;\r\n      }\r\n      return true;\r\n    }\r\n    // arc mode ...\r\n    if (mode === BSplineWrapMode.OpenByRemovingKnots) {\r\n      // we expect {degree} replicated knots at each end . . .\r\n      const numRepeated = degree - 1;\r\n      const leftKnot = this.knots[leftKnotIndex];\r\n      const rightKnot = this.knots[rightKnotIndex];\r\n      for (let i = 0; i < numRepeated; i++) {\r\n        if (!Geometry.isSameCoordinate(leftKnot, this.knots[leftKnotIndex - i - 1]))\r\n          return false;\r\n        if (!Geometry.isSameCoordinate(rightKnot, this.knots[rightKnotIndex + i + 1]))\r\n          return false;\r\n      }\r\n      return true;\r\n    }\r\n\r\n    return false;\r\n  }\r\n  /** Test matching degree and knot values */\r\n  public isAlmostEqual(other: KnotVector): boolean {\r\n    if (this.degree !== other.degree) return false;\r\n    return NumberArray.isAlmostEqual(this.knots, other.knots, KnotVector.knotTolerance);\r\n  }\r\n  /** install knot values from an array, optionally ignoring first and last.\r\n   */\r\n  public setKnots(knots: number[] | Float64Array, skipFirstAndLast?: boolean) {\r\n    const numAllocate = skipFirstAndLast ? knots.length - 2 : knots.length;\r\n    if (numAllocate !== this.knots.length)\r\n      this.knots = new Float64Array(numAllocate);\r\n    if (skipFirstAndLast) {\r\n      for (let i = 1; i + 1 < knots.length; i++)\r\n        this.knots[i - 1] = knots[i];\r\n\r\n    } else {\r\n      for (let i = 0; i < knots.length; i++)\r\n        this.knots[i] = knots[i];\r\n    }\r\n    this.setupFixedValues();\r\n  }\r\n  /**\r\n   * Create knot vector with {degree-1} replicated knots at start and end, and uniform knots between.\r\n   * @param numPoles Number of poles\r\n   * @param degree degree of polynomial\r\n   * @param a0 left knot value for active interval\r\n   * @param a1 right knot value for active interval\r\n   */\r\n  public static createUniformClamped(numPoles: number, degree: number, a0: number, a1: number): KnotVector {\r\n    const knots = new KnotVector(numPoles + degree - 1, degree);\r\n    let k = 0;\r\n    for (let m = 0; m < degree; m++)knots.knots[k++] = a0;\r\n    const du = 1.0 / (numPoles - degree);\r\n    for (let i = 1; i + degree < numPoles; i++)\r\n      knots.knots[k++] = a0 + i * du * (a1 - a0);\r\n    for (let m = 0; m < degree; m++)knots.knots[k++] = a1;\r\n    knots.setupFixedValues();\r\n    return knots;\r\n  }\r\n  /**\r\n   * Create knot vector with {degree-1} replicated knots at start and end, and uniform knots between.\r\n   * @param  numInterval number of intervals in knot space.  (NOT POLE COUNT)\r\n   * @param degree degree of polynomial\r\n   * @param a0 left knot value for active interval\r\n   * @param a1 right knot value for active interval\r\n   */\r\n  public static createUniformWrapped(numInterval: number, degree: number, a0: number, a1: number): KnotVector {\r\n    const knots = new KnotVector(numInterval + 2 * degree - 1, degree);\r\n    const du = 1.0 / numInterval;\r\n    for (let i = 1 - degree, k = 0; i < numInterval + degree; i++, k++) {\r\n      knots.knots[k] = Geometry.interpolate(a0, i * du, a1);\r\n    }\r\n    knots.setupFixedValues();\r\n    return knots;\r\n  }\r\n\r\n  /**\r\n   * Create knot vector with given knot values and degree.\r\n   * @param knotArray knot values\r\n   * @param degree degree of polynomial\r\n   * @param skipFirstAndLast true to skip class overclamped end knots.\r\n   */\r\n  public static create(knotArray: number[] | Float64Array, degree: number, skipFirstAndLast?: boolean): KnotVector {\r\n    const numAllocate = skipFirstAndLast ? knotArray.length - 2 : knotArray.length;\r\n    const knots = new KnotVector(numAllocate, degree);\r\n    knots.setKnots(knotArray, skipFirstAndLast);\r\n    return knots;\r\n  }\r\n\r\n  /**\r\n   * Return the average of degree consecutive knots beginning at spanIndex.\r\n   */\r\n  public grevilleKnot(spanIndex: number): number {\r\n    if (spanIndex < 0) return this.leftKnot;\r\n    if (spanIndex > this.rightKnotIndex) return this.rightKnot;\r\n    let sum = 0.0;\r\n    for (let i = spanIndex; i < spanIndex + this.degree; i++)\r\n      sum += this.knots[i];\r\n    return sum / this.degree;\r\n  }\r\n  /** Return an array sized for a set of the basis function values. */\r\n  public createBasisArray(): Float64Array { return new Float64Array(this.degree + 1); }\r\n  /** Convert localFraction within the interval following an indexed knot to a knot value. */\r\n  public baseKnotFractionToKnot(knotIndex0: number, localFraction: number): number {\r\n    const knot0 = this.knots[knotIndex0];\r\n    return knot0 + localFraction * (this.knots[knotIndex0 + 1] - knot0);\r\n  }\r\n  /** Convert localFraction within an indexed bezier span to a knot value. */\r\n  public spanFractionToKnot(spanIndex: number, localFraction: number): number {\r\n    const k = this.spanIndexToLeftKnotIndex(spanIndex);\r\n    return this.knots[k] + localFraction * (this.knots[k + 1] - this.knots[k]);\r\n  }\r\n  /** Convert localFraction within an indexed bezier span to fraction of active knot range. */\r\n  public spanFractionToFraction(spanIndex: number, localFraction: number): number {\r\n    const knot = this.spanFractionToKnot(spanIndex, localFraction);\r\n    return (knot - this.leftKnot) / (this.rightKnot - this.leftKnot);\r\n  }\r\n  /** Return fraction of active knot range to knot value. */\r\n  public fractionToKnot(fraction: number): number {\r\n    return Geometry.interpolate(this.knots[this.degree - 1], fraction, this.knots[this.knots.length - this.degree]);\r\n  }\r\n  /**\r\n   * Evaluate basis functions f[] at knot value u.\r\n   *\r\n   * @param u knot value for evaluation\r\n   * @param f array of basis values.  ASSUMED PROPER LENGTH\r\n   */\r\n  public evaluateBasisFunctions(knotIndex0: number, u: number, f: Float64Array) {\r\n    f[0] = 1.0;\r\n    if (this.degree < 1) return;\r\n    // direct compute for linear part ...\r\n    const u0 = this.knots[knotIndex0];\r\n    const u1 = this.knots[knotIndex0 + 1];\r\n    f[1] = (u - u0) / (u1 - u0);\r\n    f[0] = 1.0 - f[1];\r\n    if (this.degree < 2) return;\r\n\r\n    for (let depth = 1; depth < this.degree; depth++) {\r\n      let kLeft = knotIndex0 - depth;\r\n      let kRight = kLeft + depth + 1;\r\n      let gCarry = 0.0;\r\n      for (let step = 0; step <= depth; step++) {\r\n        const tLeft = this.knots[kLeft++];\r\n        const tRight = this.knots[kRight++];\r\n        const fraction = (u - tLeft) / (tRight - tLeft);\r\n        const g1 = f[step] * fraction;\r\n        const g0 = f[step] * (1.0 - fraction);\r\n        f[step] = gCarry + g0;\r\n        gCarry = g1;\r\n      }\r\n      f[depth + 1] = gCarry;\r\n    }\r\n  }\r\n\r\n  /**\r\n   * Evaluate basis fucntions f[] at knot value u.\r\n   *\r\n   * @param u knot value for evaluation\r\n   * @param f array of basis values.  ASSUMED PROPER LENGTH\r\n   */\r\n  public evaluateBasisFunctions1(knotIndex0: number, u: number, f: Float64Array, df: Float64Array, ddf?: Float64Array) {\r\n    f[0] = 1.0; df[0] = 0.0;\r\n    if (this.degree < 1) return;\r\n    // direct compute for linear part ...\r\n    const u0 = this.knots[knotIndex0];\r\n    const u1 = this.knots[knotIndex0 + 1];\r\n    // ah = 1/(u1-u0)      is the derivative of fraction0\r\n    // (-ah) is the derivative of fraction1.\r\n    let ah = 1.0 / (u1 - u0);\r\n    f[1] = (u - u0) * ah;\r\n    f[0] = 1.0 - f[1];\r\n    df[0] = -ah; df[1] = ah;\r\n    if (ddf) {  // first derivative started constant, second derivative started zero.\r\n      ddf[0] = 0.0; ddf[1] = 0.0;\r\n    }\r\n    if (this.degree < 2) return;\r\n    for (let depth = 1; depth < this.degree; depth++) {\r\n      let kLeft = knotIndex0 - depth;\r\n      let kRight = kLeft + depth + 1;\r\n      let gCarry = 0.0;\r\n      let dgCarry = 0.0;\r\n      let ddgCarry = 0.0;\r\n      // f, df, ddf, are each row vectors with product of `step` linear terms.\r\n      // f is multiplied on the right by matrix V.  Each row has 2 nonzero entries (which sum to 1)  (0,0,1-fraction, fraction,0,0,0)\r\n      //    Each row of the derivative dV is two entries (0,0, -1/h, 1/h,0,0,0)\r\n      // Hence fnew = f * V\r\n      //      dfnew = df * V + f * dV\r\n      //      ddfnew = ddf * V + df*dV + df * dV + f * ddV\r\n      // but ddV is zero so\r\n      //      ddfnew = ddf * V + 2 * df * dV\r\n      for (let step = 0; step <= depth; step++) {\r\n        const tLeft = this.knots[kLeft++];\r\n        const tRight = this.knots[kRight++];\r\n        ah = 1.0 / (tRight - tLeft);\r\n        const fraction = (u - tLeft) * ah;\r\n        const fraction1 = 1.0 - fraction;\r\n        const g1 = f[step] * fraction;\r\n        const g0 = f[step] * fraction1;\r\n        const dg1 = df[step] * fraction + f[step] * ah;\r\n        const dg0 = df[step] * fraction1 - f[step] * ah;\r\n        const dfSave = 2.0 * df[step] * ah;\r\n        f[step] = gCarry + g0;\r\n        df[step] = dgCarry + dg0;\r\n        gCarry = g1;\r\n        dgCarry = dg1;\r\n        if (ddf) {  // do the backward reference to df before rewriting df !!!\r\n          const ddg1 = ddf[step] * fraction + dfSave;\r\n          const ddg0 = ddf[step] * fraction1 - dfSave;\r\n          ddf[step] = ddgCarry + ddg0;\r\n          ddgCarry = ddg1;\r\n        }\r\n      }\r\n      f[depth + 1] = gCarry;\r\n      df[depth + 1] = dgCarry;\r\n      if (ddf)\r\n        ddf[depth + 1] = ddgCarry;\r\n    }\r\n  }\r\n  /** Return the (highest) index of the knot less than or equal to u */\r\n  public knotToLeftKnotIndex(u: number): number {\r\n    // Anything to left is in the first span . .\r\n    const firstLeftKnot = this.degree - 1;\r\n    if (u < this.knots[firstLeftKnot + 1]) return firstLeftKnot;\r\n    // Anything to right is in the last span ...\r\n    const lastLeftKnot = this.knots.length - this.degree - 1;\r\n    if (u >= this.knots.length - this.degree) return this.knots[lastLeftKnot];\r\n    // ugh ... linear search ...\r\n    for (let i = firstLeftKnot + 1; i < lastLeftKnot; i++)\r\n      if (u < this.knots[i + 1]) return i;  // testing against right side skips over multiple knot cases???\r\n    return lastLeftKnot;\r\n  }\r\n  /**\r\n   * Given a span index, return the index of the knot at its left.\r\n   * @param spanIndex index of span\r\n   */\r\n  public spanIndexToLeftKnotIndex(spanIndex: number): number {\r\n    const d = this.degree;\r\n    if (spanIndex <= 0.0) return d - 1;\r\n    return Math.min(spanIndex + d - 1, this.knots.length - d);\r\n  }\r\n  /** Return the knot interval length of indexed bezier span. */\r\n  public spanIndexToSpanLength(spanIndex: number): number {\r\n    const k = this.spanIndexToLeftKnotIndex(spanIndex);\r\n    return this.knots[k + 1] - this.knots[k];\r\n  }\r\n  /**\r\n   * Given a span index, test if it is within range and has nonzero length.\r\n   * * note that a false return does not imply there are no more spans.  This may be a double knot (zero length span) followed by more real spans\r\n   * @param spanIndex index of span to test.\r\n   */\r\n  public isIndexOfRealSpan(spanIndex: number): boolean {\r\n    if (spanIndex >= 0 && spanIndex < this.knots.length - this.degree)\r\n      return !Geometry.isSmallMetricDistance(this.spanIndexToSpanLength(spanIndex));\r\n    return false;\r\n  }\r\n  /** Reflect all knots so `leftKnot` and `rightKnot` are maintained but interval lengths reverse. */\r\n  public reflectKnots() {\r\n    const a = this.leftKnot;\r\n    const b = this.rightKnot;\r\n    const numKnots = this.knots.length;\r\n    for (let i = 0; i < numKnots; i++)\r\n      this.knots[i] = a + (b - this.knots[i]);\r\n    this.knots.reverse();\r\n  }\r\n  /**\r\n   * return a simple array form of the knots.  optionally replicate the first and last\r\n   * in classic over-clamped manner\r\n   */\r\n  public copyKnots(includeExtraEndKnot: boolean): number[] {\r\n    const wrap = this.wrappable === BSplineWrapMode.OpenByAddingControlPoints && this.testClosable();\r\n    const leftIndex = this.leftKnotIndex;\r\n    const rightIndex = this.rightKnotIndex;\r\n    const a0 = this.leftKnot;\r\n    const a1 = this.rightKnot;\r\n    const delta = a1 - a0;\r\n    const degree = this.degree;\r\n    const values: number[] = [];\r\n    if (includeExtraEndKnot) {\r\n      if (wrap) {\r\n        values.push(this.knots[rightIndex - degree] - delta);\r\n      } else {\r\n        values.push(this.knots[0]);\r\n      }\r\n    }\r\n    for (const u of this.knots) values.push(u);\r\n    if (includeExtraEndKnot) {\r\n      if (wrap) {\r\n        values.push(this.knots[leftIndex + degree] + delta);\r\n      } else\r\n        values.push(values[values.length - 1]);\r\n    }\r\n    return values;\r\n  }\r\n}\r\n"]}

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

@@ -0,0 +1,52 @@
+/** @packageDocumentation
+ * @module Curve
+ */
+import { CurveLocationDetail } from "../curve/CurveLocationDetail";
+import { UVSurface } from "../geometry3d/GeometryHandler";
+import { Point2d } from "../geometry3d/Point2dVector2d";
+import { Point3d } from "../geometry3d/Point3dVector3d";
+/**
+ * CurveLocationDetail carries point and paramter data about a point evaluated on a curve.
+ * * These are returned by a variety of queries.
+ * * Particular contents can vary among the queries.
+ * @public
+ */
+export declare class UVSurfaceLocationDetail {
+    /** The surface being evaluated */
+    surface?: UVSurface;
+    /** uv coordinates in the surface */
+    uv: Point2d;
+    /** The point on the surface */
+    point: Point3d;
+    /** A context-specific numeric value.  (E.g. a distance) */
+    a: number;
+    /** Construct with empty data. */
+    constructor(surface?: UVSurface, uv?: Point2d, point?: Point3d);
+    /**
+     * Create a new detail structure.
+     * @param surface
+     * @param uv coordinates to copy (not capture) into the `detail.uv`
+     * @param point coordinates to copy (not capture) into the `detail.point`
+     */
+    static createSurfaceUVPoint(surface: UVSurface | undefined, uv: Point2d, point: Point3d): UVSurfaceLocationDetail;
+    /**
+     * Create a new detail structure.
+     * @param surface
+     * @param uv coordinates to copy (not capture) into the `detail.uv`
+     * @param point coordinates to copy (not capture) into the `detail.point`
+     */
+    static createSurfaceUVNumbersPoint(surface: UVSurface | undefined, u: number, v: number, point: Point3d): UVSurfaceLocationDetail;
+}
+/**
+ * Carrier for both curve and surface data, e.g. from intersection calculations.
+ * @public
+ */
+export declare class CurveAndSurfaceLocationDetail {
+    /** detailed location on the curve */
+    curveDetail: CurveLocationDetail;
+    /** detailed location on the surface */
+    surfaceDetail: UVSurfaceLocationDetail;
+    /** CAPTURE both details . . */
+    constructor(curveDetail: CurveLocationDetail, surfaceDetail: UVSurfaceLocationDetail);
+}
+//# sourceMappingURL=SurfaceLocationDetail.d.ts.map

package/lib/esm/bspline/SurfaceLocationDetail.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"SurfaceLocationDetail.d.ts","sourceRoot":"","sources":["../../../src/bspline/SurfaceLocationDetail.ts"],"names":[],"mappings":"AAIA;;GAEG;AACH,OAAO,EAAE,mBAAmB,EAAE,MAAM,8BAA8B,CAAC;AACnE,OAAO,EAAE,SAAS,EAAE,MAAM,+BAA+B,CAAC;AAC1D,OAAO,EAAE,OAAO,EAAE,MAAM,+BAA+B,CAAC;AACxD,OAAO,EAAE,OAAO,EAAE,MAAM,+BAA+B,CAAC;AAExD;;;;;GAKG;AACH,qBAAa,uBAAuB;IAClC,kCAAkC;IAC3B,OAAO,CAAC,EAAE,SAAS,CAAC;IAC3B,oCAAoC;IAC7B,EAAE,EAAE,OAAO,CAAC;IACnB,+BAA+B;IACxB,KAAK,EAAE,OAAO,CAAC;IACtB,2DAA2D;IACpD,CAAC,EAAE,MAAM,CAAC;IACjB,iCAAiC;gBACd,OAAO,CAAC,EAAE,SAAS,EAAE,EAAE,CAAC,EAAE,OAAO,EAAE,KAAK,CAAC,EAAE,OAAO;IAMrE;;;;;OAKG;WACW,oBAAoB,CAAC,OAAO,EAAE,SAAS,GAAG,SAAS,EAAE,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,GAAG,uBAAuB;IAOxH;;;;;OAKG;WACW,2BAA2B,CAAC,OAAO,EAAE,SAAS,GAAG,SAAS,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,GAAG,uBAAuB;CAQzI;AACD;;;GAGG;AACH,qBAAa,6BAA6B;IACxC,qCAAqC;IAC9B,WAAW,EAAE,mBAAmB,CAAC;IACxC,uCAAuC;IAChC,aAAa,EAAE,uBAAuB,CAAC;IAC9C,+BAA+B;gBACZ,WAAW,EAAE,mBAAmB,EAAE,aAAa,EAAE,uBAAuB;CAI5F"}

package/lib/esm/bspline/SurfaceLocationDetail.js

@@ -0,0 +1,55 @@
+import { Point2d } from "../geometry3d/Point2dVector2d";
+import { Point3d } from "../geometry3d/Point3dVector3d";
+/**
+ * CurveLocationDetail carries point and paramter data about a point evaluated on a curve.
+ * * These are returned by a variety of queries.
+ * * Particular contents can vary among the queries.
+ * @public
+ */
+export class UVSurfaceLocationDetail {
+    /** Construct with empty data. */
+    constructor(surface, uv, point) {
+        this.surface = surface;
+        this.point = point ? point : Point3d.createZero();
+        this.uv = uv ? uv : Point2d.createZero();
+        this.a = 0.0;
+    }
+    /**
+     * Create a new detail structure.
+     * @param surface
+     * @param uv coordinates to copy (not capture) into the `detail.uv`
+     * @param point coordinates to copy (not capture) into the `detail.point`
+     */
+    static createSurfaceUVPoint(surface, uv, point) {
+        const detail = new UVSurfaceLocationDetail(surface);
+        if (uv)
+            detail.uv.setFrom(uv);
+        detail.point.setFromPoint3d(point);
+        return detail;
+    }
+    /**
+     * Create a new detail structure.
+     * @param surface
+     * @param uv coordinates to copy (not capture) into the `detail.uv`
+     * @param point coordinates to copy (not capture) into the `detail.point`
+     */
+    static createSurfaceUVNumbersPoint(surface, u, v, point) {
+        const detail = new UVSurfaceLocationDetail(surface);
+        detail.uv.x = u;
+        detail.uv.y = v;
+        detail.point.setFromPoint3d(point);
+        return detail;
+    }
+}
+/**
+ * Carrier for both curve and surface data, e.g. from intersection calculations.
+ * @public
+ */
+export class CurveAndSurfaceLocationDetail {
+    /** CAPTURE both details . . */
+    constructor(curveDetail, surfaceDetail) {
+        this.curveDetail = curveDetail;
+        this.surfaceDetail = surfaceDetail;
+    }
+}
+//# sourceMappingURL=SurfaceLocationDetail.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"SurfaceLocationDetail.js","sourceRoot":"","sources":["../../../src/bspline/SurfaceLocationDetail.ts"],"names":[],"mappings":"AASA,OAAO,EAAE,OAAO,EAAE,MAAM,+BAA+B,CAAC;AACxD,OAAO,EAAE,OAAO,EAAE,MAAM,+BAA+B,CAAC;AAExD;;;;;GAKG;AACH,MAAM,OAAO,uBAAuB;IASlC,iCAAiC;IACjC,YAAmB,OAAmB,EAAE,EAAY,EAAE,KAAe;QACnE,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACvB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,UAAU,EAAE,CAAC;QAClD,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,UAAU,EAAE,CAAC;QACzC,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC;IACf,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,oBAAoB,CAAC,OAA8B,EAAE,EAAW,EAAE,KAAc;QAC5F,MAAM,MAAM,GAAG,IAAI,uBAAuB,CAAC,OAAO,CAAC,CAAC;QACpD,IAAI,EAAE;YACJ,MAAM,CAAC,EAAE,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QACxB,MAAM,CAAC,KAAK,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC;QACnC,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,2BAA2B,CAAC,OAA8B,EAAE,CAAS,EAAE,CAAS,EAAE,KAAc;QAC5G,MAAM,MAAM,GAAG,IAAI,uBAAuB,CAAC,OAAO,CAAC,CAAC;QACpD,MAAM,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;QAChB,MAAM,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;QAChB,MAAM,CAAC,KAAK,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC;QACnC,OAAO,MAAM,CAAC;IAChB,CAAC;CAEF;AACD;;;GAGG;AACH,MAAM,OAAO,6BAA6B;IAKxC,+BAA+B;IAC/B,YAAmB,WAAgC,EAAE,aAAsC;QACzF,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC;QAC/B,IAAI,CAAC,aAAa,GAAG,aAAa,CAAC;IACrC,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 Curve\r\n */\r\nimport { CurveLocationDetail } from \"../curve/CurveLocationDetail\";\r\nimport { UVSurface } from \"../geometry3d/GeometryHandler\";\r\nimport { Point2d } from \"../geometry3d/Point2dVector2d\";\r\nimport { Point3d } from \"../geometry3d/Point3dVector3d\";\r\n\r\n/**\r\n * CurveLocationDetail carries point and paramter data about a point evaluated on a curve.\r\n * * These are returned by a variety of queries.\r\n * * Particular contents can vary among the queries.\r\n * @public\r\n */\r\nexport class UVSurfaceLocationDetail {\r\n  /** The surface being evaluated */\r\n  public surface?: UVSurface;\r\n  /** uv coordinates in the surface */\r\n  public uv: Point2d;\r\n  /** The point on the surface */\r\n  public point: Point3d;\r\n  /** A context-specific numeric value.  (E.g. a distance) */\r\n  public a: number;\r\n  /** Construct with empty data. */\r\n  public constructor(surface?: UVSurface, uv?: Point2d, point?: Point3d) {\r\n    this.surface = surface;\r\n    this.point = point ? point : Point3d.createZero();\r\n    this.uv = uv ? uv : Point2d.createZero();\r\n    this.a = 0.0;\r\n  }\r\n  /**\r\n   * Create a new detail structure.\r\n   * @param surface\r\n   * @param uv coordinates to copy (not capture) into the `detail.uv`\r\n   * @param point coordinates to copy (not capture) into the `detail.point`\r\n   */\r\n  public static createSurfaceUVPoint(surface: UVSurface | undefined, uv: Point2d, point: Point3d): UVSurfaceLocationDetail {\r\n    const detail = new UVSurfaceLocationDetail(surface);\r\n    if (uv)\r\n      detail.uv.setFrom(uv);\r\n    detail.point.setFromPoint3d(point);\r\n    return detail;\r\n  }\r\n  /**\r\n   * Create a new detail structure.\r\n   * @param surface\r\n   * @param uv coordinates to copy (not capture) into the `detail.uv`\r\n   * @param point coordinates to copy (not capture) into the `detail.point`\r\n   */\r\n  public static createSurfaceUVNumbersPoint(surface: UVSurface | undefined, u: number, v: number, point: Point3d): UVSurfaceLocationDetail {\r\n    const detail = new UVSurfaceLocationDetail(surface);\r\n    detail.uv.x = u;\r\n    detail.uv.y = v;\r\n    detail.point.setFromPoint3d(point);\r\n    return detail;\r\n  }\r\n\r\n}\r\n/**\r\n * Carrier for both curve and surface data, e.g. from intersection calculations.\r\n * @public\r\n */\r\nexport class CurveAndSurfaceLocationDetail {\r\n  /** detailed location on the curve */\r\n  public curveDetail: CurveLocationDetail;\r\n  /** detailed location on the surface */\r\n  public surfaceDetail: UVSurfaceLocationDetail;\r\n  /** CAPTURE both details . . */\r\n  public constructor(curveDetail: CurveLocationDetail, surfaceDetail: UVSurfaceLocationDetail) {\r\n    this.curveDetail = curveDetail;\r\n    this.surfaceDetail = surfaceDetail;\r\n  }\r\n}\r\n"]}