@itwin/core-geometry 5.0.0-dev.7 → 5.0.0-dev.72

package/lib/cjs/numerics/Quadrature.js.map

@@ -1 +1 @@
-{"version":3,"file":"Quadrature.js","sourceRoot":"","sources":["../../../src/numerics/Quadrature.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F,0CAAuC;AAEvC;;GAEG;AAEH;;;;;;;;GAQG;AACH,MAAa,UAAU;IA0BrB;;;;;;;;;;;;;OAaG;IACI,MAAM,CAAC,UAAU,CAAC,EAAU,EAAE,CAAS,EAAE,IAAkB,EAAE,IAAkB,EAAE,OAAqB,EAAE,OAAqB;QAClI,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;QACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,OAAO,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YAC9B,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QAC3B,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC;IAED,wEAAwE;IACjE,MAAM,CAAC,WAAW,CAAC,EAAU,EAAE,EAAU,EAAE,OAAqB,EAAE,OAAqB;QAC5F,OAAO,UAAU,CAAC,UAAU,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,UAAU,CAAC,iBAAiB,EAAE,UAAU,CAAC,iBAAiB,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;IAC1H,CAAC;IAED,wEAAwE;IACjE,MAAM,CAAC,WAAW,CAAC,EAAU,EAAE,EAAU,EAAE,OAAqB,EAAE,OAAqB;QAC5F,OAAO,UAAU,CAAC,UAAU,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,UAAU,CAAC,iBAAiB,EAAE,UAAU,CAAC,iBAAiB,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;QACxH;;;;;;kBAMU;IACZ,CAAC;IACD,0EAA0E;IACnE,MAAM,CAAC,WAAW,CAAC,EAAU,EAAE,EAAU,EAAE,OAAqB,EAAE,OAAqB;QAC5F,OAAO,UAAU,CAAC,UAAU,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,UAAU,CAAC,iBAAiB,EAAE,UAAU,CAAC,iBAAiB,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;QACxH;;;;;;;;;;UAUE;IACJ,CAAC;IAED,yEAAyE;IAClE,MAAM,CAAC,WAAW,CAAC,EAAU,EAAE,EAAU,EAAE,OAAqB,EAAE,OAAqB;QAC5F,OAAO,UAAU,CAAC,UAAU,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,UAAU,CAAC,iBAAiB,EAAE,UAAU,CAAC,iBAAiB,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;QACxH;;;;;;;;;;;;;UAaE;IACJ,CAAC;IAED,yEAAyE;IAClE,MAAM,CAAC,WAAW,CAAC,EAAU,EAAE,EAAU,EAAE,OAAqB,EAAE,OAAqB;QAC5F,OAAO,UAAU,CAAC,UAAU,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,UAAU,CAAC,iBAAiB,EAAE,UAAU,CAAC,iBAAiB,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;QACxH;;;;;;;;;;;;MAYF;IACA,CAAC;IACD,2DAA2D;IACpD,MAAM,CAAC,IAAI,CAChB,EAAgB,EAChB,EAAgB,EAChB,CAAS,EACT,CAAwB;QACxB,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YAAC,GAAG,IAAI,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACnD,OAAO,GAAG,CAAC;IACb,CAAC;IACD;;;;;;;OAOG;IACI,MAAM,CAAC,eAAe,CAAC,EAAU,EAAE,EAAU,EAAE,CAAwB,EAAE,WAAmB,EAAE,WAAmB,CAAC;QACvH,MAAM,MAAM,GAAG,IAAI,WAAW,CAAC,QAAQ,CAAC,CAAC;QACzC,IAAI,WAAW,GAAG,CAAC;YACjB,WAAW,GAAG,CAAC,CAAC;QAClB,MAAM,EAAE,GAAG,GAAG,GAAG,WAAW,CAAC;QAC7B,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,WAAW,EAAE,CAAC,EAAE,EAAE,CAAC;YACtC,MAAM,EAAE,GAAG,mBAAQ,CAAC,WAAW,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,EAAE,CAAC,CAAC;YACtD,MAAM,EAAE,GAAG,CAAC,KAAK,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,mBAAQ,CAAC,WAAW,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,EAAE,EAAE,CAAC,CAAC;YAC3E,MAAM,CAAC,GAAG,MAAM,CAAC,QAAQ,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,GAAG,IAAI,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YAChD,CAAC;QACH,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;;AAtJH,gCAuJC;AAtJC,sDAAsD;AAC/B,4BAAiB,GAAG,IAAI,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;AACnE,qDAAqD;AAC9B,4BAAiB,GAAG,IAAI,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;AAEnE,sDAAsD;AAC/B,4BAAiB,GAAG,IAAI,YAAY,CAAC,CAAC,mBAAmB,EAAE,kBAAkB,CAAC,CAAC,CAAC;AACvG,qDAAqD;AAC9B,4BAAiB,GAAG,IAAI,YAAY,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;AAExE,sDAAsD;AAC/B,4BAAiB,GAAG,IAAI,YAAY,CAAC,CAAC,kBAAkB,EAAE,GAAG,EAAE,kBAAkB,CAAC,CAAC,CAAC;AAC3G,qDAAqD;AAC9B,4BAAiB,GAAG,IAAI,YAAY,CAAC,CAAC,kBAAkB,EAAE,kBAAkB,EAAE,kBAAkB,CAAC,CAAC,CAAC;AAE1H,sDAAsD;AAC/B,4BAAiB,GAAG,IAAI,YAAY,CAAC,CAAC,mBAAmB,EAAE,mBAAmB,EAAE,kBAAkB,EAAE,kBAAkB,CAAC,CAAC,CAAC;AAChJ,qDAAqD;AAC9B,4BAAiB,GAAG,IAAI,YAAY,CAAC,CAAC,mBAAmB,EAAE,kBAAkB,EAAE,kBAAkB,EAAE,mBAAmB,CAAC,CAAC,CAAC;AAEhJ,sDAAsD;AAC/B,4BAAiB,GAAG,IAAI,YAAY,CAAC,CAAC,mBAAmB,EAAE,mBAAmB,EAAE,GAAG,EAAE,kBAAkB,EAAE,kBAAkB,CAAC,CAAC,CAAC;AACrJ,qDAAqD;AAC9B,4BAAiB,GAAG,IAAI,YAAY,CAAC,CAAC,mBAAmB,EAAE,mBAAmB,EAAE,mBAAmB,EAAE,mBAAmB,EAAE,mBAAmB,CAAC,CAAC,CAAC;AAiIzK;;;;GAIG;AACH,MAAa,WAAW;IAOtB,kFAAkF;IAC3E,QAAQ,CAAC,EAAU,EAAE,EAAU;QACpC,OAAO,IAAI,CAAC,gBAAgB,CAAC,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;IACjE,CAAC;IACD;;;OAGG;IACH,YAAmB,cAAsB;QACvC,MAAM,QAAQ,GAAG,CAAC,CAAC,CAAE,iGAAiG;QACtH,IAAI,CAAC,MAAM,GAAG,IAAI,YAAY,CAAC,QAAQ,CAAC,CAAC;QACzC,IAAI,CAAC,MAAM,GAAG,IAAI,YAAY,CAAC,QAAQ,CAAC,CAAC;QACzC,6GAA6G;QAC7G,IAAI,cAAc,GAAG,CAAC,IAAI,cAAc,GAAG,CAAC;YAC1C,cAAc,GAAG,CAAC,CAAC;QACrB,QAAQ,cAAc,EAAE,CAAC;YACvB,KAAK,CAAC;gBAAE,IAAI,CAAC,gBAAgB,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,OAAO,EAAE,OAAO,EAAE,EAAE,CAAC,UAAU,CAAC,WAAW,CAAC,EAAE,EAAE,EAAE,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;gBAAC,MAAM;YACtH,KAAK,CAAC;gBAAE,IAAI,CAAC,gBAAgB,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,OAAO,EAAE,OAAO,EAAE,EAAE,CAAC,UAAU,CAAC,WAAW,CAAC,EAAE,EAAE,EAAE,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;gBAAC,MAAM;YACtH,KAAK,CAAC;gBAAE,IAAI,CAAC,gBAAgB,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,OAAO,EAAE,OAAO,EAAE,EAAE,CAAC,UAAU,CAAC,WAAW,CAAC,EAAE,EAAE,EAAE,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;gBAAC,MAAM;YACtH,KAAK,CAAC;gBAAE,IAAI,CAAC,gBAAgB,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,OAAO,EAAE,OAAO,EAAE,EAAE,CAAC,UAAU,CAAC,WAAW,CAAC,EAAE,EAAE,EAAE,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;gBAAC,MAAM;YACtH;gBAAS,IAAI,CAAC,gBAAgB,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,OAAO,EAAE,OAAO,EAAE,EAAE,CAAC,UAAU,CAAC,WAAW,CAAC,EAAE,EAAE,EAAE,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;gBAAC,MAAM;QACzH,CAAC;IAEH,CAAC;CACF;AA/BD,kCA+BC;AACD,6HAA6H","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n\r\nimport { Geometry } from \"../Geometry\";\r\n\r\n/** @packageDocumentation\r\n * @module Numerics\r\n */\r\n\r\n/** Support class for quadrature -- approximate integrals by summing weighted function values.\r\n * These are filled with x and weight for quadrature between xA and xB\r\n *\r\n * Since quadrature is done in side tight loops, these methods are structured for minimum object\r\n * allocation.\r\n * For methods names setupGauss<N> (where N is a smallish integer), the CALLER creates arrays xMapped and wMapped\r\n * The method installs particular x and weight values.\r\n * @internal\r\n */\r\nexport class Quadrature {\r\n  /** x value for 1 point gauss rule in 0..1 interval */\r\n  public static readonly gaussX1Interval01 = new Float64Array([0.5]);\r\n  /** weight for 1 point gauss rule in 0..1 interval */\r\n  public static readonly gaussW1Interval01 = new Float64Array([1.0]);\r\n\r\n  /** x value for 2 point gauss rule in 0..1 interval */\r\n  public static readonly gaussX2Interval01 = new Float64Array([0.21132486540518708, 0.7886751345948129]);\r\n  /** weight for 2 point gauss rule in 0..1 interval */\r\n  public static readonly gaussW2Interval01 = new Float64Array([0.5, 0.5]);\r\n\r\n  /** x value for 3 point gauss rule in 0..1 interval */\r\n  public static readonly gaussX3Interval01 = new Float64Array([0.1127016653792583, 0.5, 0.8872983346207417]);\r\n  /** weight for 3 point gauss rule in 0..1 interval */\r\n  public static readonly gaussW3Interval01 = new Float64Array([0.2777777777777778, 0.4444444444444444, 0.2777777777777778]);\r\n\r\n  /** x value for 4 point gauss rule in 0..1 interval */\r\n  public static readonly gaussX4Interval01 = new Float64Array([0.06943184420297371, 0.33000947820757187, 0.6699905217924281, 0.9305681557970262]);\r\n  /** weight for 4 point gauss rule in 0..1 interval */\r\n  public static readonly gaussW4Interval01 = new Float64Array([0.17392742256872692, 0.3260725774312731, 0.3260725774312731, 0.17392742256872692]);\r\n\r\n  /** x value for 5 point gauss rule in 0..1 interval */\r\n  public static readonly gaussX5Interval01 = new Float64Array([0.04691007703066802, 0.23076534494715845, 0.5, 0.7692346550528415, 0.9530899229693319]);\r\n  /** weight for 5 point gauss rule in 0..1 interval */\r\n  public static readonly gaussW5Interval01 = new Float64Array([0.11846344252809454, 0.23931433524968324, 0.28444444444444444, 0.23931433524968324, 0.11846344252809454]);\r\n\r\n  /**\r\n   * Given points and weights in a reference interval (usually 0 to 1):\r\n   *\r\n   * * map each xRef[i] to xA + h * xRef[i];\r\n   * * scale each weight wRef[i] to h * wRef[i]\r\n   * * all arrays are assumed to have xRef.length entries.\r\n   * * the return value is xRef.length\r\n   * @param xA beginning of target interval\r\n   * @param h length of target interval\r\n   * @param xRef x coordinates in reference interval\r\n   * @param wRef weights for integration in the reference interval\r\n   * @param xMapped x coordinates to evaluate integrands\r\n   * @param wMapped weights for evaluated integrands\r\n   */\r\n  public static mapWeights(xA: number, h: number, xRef: Float64Array, wRef: Float64Array, xMapped: Float64Array, wMapped: Float64Array): number {\r\n    const n = xRef.length;\r\n    for (let i = 0; i < n; i++) {\r\n      xMapped[i] = xA + h * xRef[i];\r\n      wMapped[i] = h * wRef[i];\r\n    }\r\n    return n;\r\n  }\r\n\r\n  /** Install 1 (ONE) x and weight values for quadrature from xA to xB. */\r\n  public static setupGauss1(xA: number, xB: number, xMapped: Float64Array, wMapped: Float64Array): number {\r\n    return Quadrature.mapWeights(xA, xB - xA, Quadrature.gaussX1Interval01, Quadrature.gaussW1Interval01, xMapped, wMapped);\r\n  }\r\n\r\n  /** Install 2 (TWO) x and weight values for quadrature from xA to xB. */\r\n  public static setupGauss2(xA: number, xB: number, xMapped: Float64Array, wMapped: Float64Array): number {\r\n    return Quadrature.mapWeights(xA, xB - xA, Quadrature.gaussX2Interval01, Quadrature.gaussW2Interval01, xMapped, wMapped);\r\n    /*  // exact formulas for interval xA..xB:\r\n        const x0 = 0.5 * (xA + xB);\r\n            const h = 0.5 * (xB - xA);\r\n            const dx = h / Math.sqrt(3);\r\n            xMapped[0] = x0 - dx; xMapped[1] = x0 + dx;\r\n            wMapped[0] = wMapped[1] = h;\r\n            */\r\n  }\r\n  /** Install 3 (THREE) x and weight values for quadrature from xA to xB. */\r\n  public static setupGauss3(xA: number, xB: number, xMapped: Float64Array, wMapped: Float64Array): number {\r\n    return Quadrature.mapWeights(xA, xB - xA, Quadrature.gaussX3Interval01, Quadrature.gaussW3Interval01, xMapped, wMapped);\r\n    /*  // exact formulas for interval xA..xB:\r\n    const x0 = 0.5 * (xA + xB);\r\n    const h = 0.5 * (xB - xA);\r\n    const a = Math.sqrt(0.6);\r\n    const b = h * 5.0 / 9.0;\r\n    const dx = a * h;\r\n    xMapped[0] = x0 - dx; xMapped[1] = x0; xMapped[2] = x0 + dx;\r\n    wMapped[0] = wMapped[2] = b;\r\n    wMapped[1] = h * 8.0 / 9.0;\r\n    return 3;\r\n    */\r\n  }\r\n\r\n  /** Install 5 (FIVE) x and weight values for quadrature from xA to xB. */\r\n  public static setupGauss5(xA: number, xB: number, xMapped: Float64Array, wMapped: Float64Array): number {\r\n    return Quadrature.mapWeights(xA, xB - xA, Quadrature.gaussX5Interval01, Quadrature.gaussW5Interval01, xMapped, wMapped);\r\n    /*  // exact formulas for interval xA..xB:\r\n    const x0 = 0.5 * (xA + xB);\r\n    const h = 0.5 * (xB - xA);\r\n    const q = 2.0 * Math.sqrt(10.0 / 7.0);\r\n    const b = 13.0 * Math.sqrt(70.0);\r\n    const a1 = h * Math.sqrt(5.0 - q) / 3.0;\r\n    const a2 = h * Math.sqrt(5.0 + q) / 3.0;\r\n    const w1 = h * (322.0 + b) / 900.0;\r\n    const w2 = h * (322.0 - b) / 900;\r\n    const w0 = h * 128.0 / 225.0;\r\n    xMapped[0] = x0 - a2; xMapped[1] = x0 - a1; xMapped[2] = x0; xMapped[3] = x0 + a1; xMapped[4] = x0 + a2;\r\n    wMapped[0] = w2; wMapped[1] = w1; wMapped[2] = w0; wMapped[3] = w1; wMapped[4] = w2;\r\n    return 5;\r\n    */\r\n  }\r\n\r\n  /** Install 4 (FOUR) x and weight values for quadrature from xA to xB. */\r\n  public static setupGauss4(xA: number, xB: number, xMapped: Float64Array, wMapped: Float64Array): number {\r\n    return Quadrature.mapWeights(xA, xB - xA, Quadrature.gaussX4Interval01, Quadrature.gaussW4Interval01, xMapped, wMapped);\r\n    /*  // exact formulas for interval xA..xB:\r\nconst x0 = 0.5 * (xA + xB);\r\nconst h = 0.5 * (xB - xA);\r\nconst q = 2.0 * Math.sqrt(6.0 / 5.0);\r\nconst r = Math.sqrt(30.0);\r\nconst a1 = h * Math.sqrt((3 - q) / 7.0);\r\nconst w1 = h * (18.0 + r) / 36.0;\r\nconst a2 = h * Math.sqrt((3 + q) / 7.0);\r\nconst w2 = h * (18.0 - r) / 36.0;\r\nxMapped[0] = x0 - a2; xMapped[1] = x0 - a1; xMapped[2] = x0 + a1; xMapped[3] = x0 + a2;\r\nwMapped[0] = w2; wMapped[1] = w1; wMapped[2] = w1; wMapped[3] = w2;\r\nreturn 4;\r\n*/\r\n  }\r\n  /** Sum function values with given weights and x values. */\r\n  public static sum1(\r\n    xx: Float64Array,\r\n    ww: Float64Array,\r\n    n: number,\r\n    f: (x: number) => number): number {\r\n    let sum = 0;\r\n    for (let i = 0; i < n; i++)sum += ww[i] * f(xx[i]);\r\n    return sum;\r\n  }\r\n  /**\r\n   * Do a Guass quadrature integral for a (number)=>number function over an interval, with caller specified sub-interval count and\r\n   * @param x0 start of overall interval\r\n   * @param x1 end of overall interval\r\n   * @param f function to evaluate\r\n   * @param numInterval number of internal intervals\r\n   * @param numGauss number of gauss points.    must be supported by GaussMapper, i.e. 1,2,3,4,5\r\n   */\r\n  public static doGaussIntegral(x0: number, x1: number, f: (x: number) => number, numInterval: number, numGauss: number = 5) {\r\n    const mapper = new GaussMapper(numGauss);\r\n    if (numInterval < 1)\r\n      numInterval = 1;\r\n    const df = 1.0 / numInterval;\r\n    let sum = 0;\r\n    for (let i = 1; i <= numInterval; i++) {\r\n      const xA = Geometry.interpolate(x0, (i - 1) * df, x1);\r\n      const xB = i === numInterval ? x1 : Geometry.interpolate(x0, (i) * df, x1);\r\n      const n = mapper.mapXAndW(xA, xB);\r\n      for (let k = 0; k < n; k++) {\r\n        sum += mapper.gaussW[k] * f(mapper.gaussX[k]);\r\n      }\r\n    }\r\n    return sum;\r\n  }\r\n}\r\n\r\n/**\r\n * This class carries public members as needed for users to have gauss points that are used\r\n * in the callers loops.\r\n * @internal\r\n */\r\nexport class GaussMapper {\r\n  /** x values for integration */\r\n  public gaussX: Float64Array;\r\n  /** weights for integration */\r\n  public gaussW: Float64Array;\r\n  /** function to be called (at each interval) to map integration values */\r\n  public mapXAndWFunction: (xA: number, xB: number, xx: Float64Array, ww: Float64Array) => number;\r\n  /** Execute the mapXAndWFunction to set up arrays for integration from xA to xB */\r\n  public mapXAndW(xA: number, xB: number): number {\r\n    return this.mapXAndWFunction(xA, xB, this.gaussX, this.gaussW);\r\n  }\r\n  /** setup gauss arrays.\r\n   * * Number of gauss points must be 1 to 5 (inclusive)\r\n   * @param numGauss requested number of gauss points.\r\n   */\r\n  public constructor(numGaussPoints: number) {\r\n    const maxGauss = 7;  // (As of Nov 2 2018, 7 is a fluffy over-allocation-- the quadrature class only handles up to 5.)\r\n    this.gaussX = new Float64Array(maxGauss);\r\n    this.gaussW = new Float64Array(maxGauss);\r\n    // This sets the number of gauss points.  This integrates exactly for polynomials of (degree 2*numGauss - 1).\r\n    if (numGaussPoints > 5 || numGaussPoints < 1)\r\n      numGaussPoints = 5;\r\n    switch (numGaussPoints) {\r\n      case 1: this.mapXAndWFunction = (xA, xB, xMapped, wMapped) => Quadrature.setupGauss1(xA, xB, xMapped, wMapped); break;\r\n      case 2: this.mapXAndWFunction = (xA, xB, xMapped, wMapped) => Quadrature.setupGauss2(xA, xB, xMapped, wMapped); break;\r\n      case 3: this.mapXAndWFunction = (xA, xB, xMapped, wMapped) => Quadrature.setupGauss3(xA, xB, xMapped, wMapped); break;\r\n      case 4: this.mapXAndWFunction = (xA, xB, xMapped, wMapped) => Quadrature.setupGauss4(xA, xB, xMapped, wMapped); break;\r\n      default: this.mapXAndWFunction = (xA, xB, xMapped, wMapped) => Quadrature.setupGauss5(xA, xB, xMapped, wMapped); break;\r\n    }\r\n\r\n  }\r\n}\r\n// someday .... http://www.holoborodko.com/pavel/numerical-methods/numerical-integration/overlapped-newton-cotes-quadratures/\r\n"]}
+{"version":3,"file":"Quadrature.js","sourceRoot":"","sources":["../../../src/numerics/Quadrature.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F,0CAAuC;AAEvC;;GAEG;AAEH;;;;;;;;GAQG;AACH,MAAa,UAAU;IACrB,sDAAsD;IAC/C,MAAM,CAAU,iBAAiB,GAAG,IAAI,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACnE,qDAAqD;IAC9C,MAAM,CAAU,iBAAiB,GAAG,IAAI,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAEnE,sDAAsD;IAC/C,MAAM,CAAU,iBAAiB,GAAG,IAAI,YAAY,CAAC,CAAC,mBAAmB,EAAE,kBAAkB,CAAC,CAAC,CAAC;IACvG,qDAAqD;IAC9C,MAAM,CAAU,iBAAiB,GAAG,IAAI,YAAY,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;IAExE,sDAAsD;IAC/C,MAAM,CAAU,iBAAiB,GAAG,IAAI,YAAY,CAAC,CAAC,kBAAkB,EAAE,GAAG,EAAE,kBAAkB,CAAC,CAAC,CAAC;IAC3G,qDAAqD;IAC9C,MAAM,CAAU,iBAAiB,GAAG,IAAI,YAAY,CAAC,CAAC,kBAAkB,EAAE,kBAAkB,EAAE,kBAAkB,CAAC,CAAC,CAAC;IAE1H,sDAAsD;IAC/C,MAAM,CAAU,iBAAiB,GAAG,IAAI,YAAY,CAAC,CAAC,mBAAmB,EAAE,mBAAmB,EAAE,kBAAkB,EAAE,kBAAkB,CAAC,CAAC,CAAC;IAChJ,qDAAqD;IAC9C,MAAM,CAAU,iBAAiB,GAAG,IAAI,YAAY,CAAC,CAAC,mBAAmB,EAAE,kBAAkB,EAAE,kBAAkB,EAAE,mBAAmB,CAAC,CAAC,CAAC;IAEhJ,sDAAsD;IAC/C,MAAM,CAAU,iBAAiB,GAAG,IAAI,YAAY,CAAC,CAAC,mBAAmB,EAAE,mBAAmB,EAAE,GAAG,EAAE,kBAAkB,EAAE,kBAAkB,CAAC,CAAC,CAAC;IACrJ,qDAAqD;IAC9C,MAAM,CAAU,iBAAiB,GAAG,IAAI,YAAY,CAAC,CAAC,mBAAmB,EAAE,mBAAmB,EAAE,mBAAmB,EAAE,mBAAmB,EAAE,mBAAmB,CAAC,CAAC,CAAC;IAEvK;;;;;;;;;;;;;OAaG;IACI,MAAM,CAAC,UAAU,CAAC,EAAU,EAAE,CAAS,EAAE,IAAkB,EAAE,IAAkB,EAAE,OAAqB,EAAE,OAAqB;QAClI,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;QACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,OAAO,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YAC9B,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QAC3B,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC;IAED,wEAAwE;IACjE,MAAM,CAAC,WAAW,CAAC,EAAU,EAAE,EAAU,EAAE,OAAqB,EAAE,OAAqB;QAC5F,OAAO,UAAU,CAAC,UAAU,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,UAAU,CAAC,iBAAiB,EAAE,UAAU,CAAC,iBAAiB,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;IAC1H,CAAC;IAED,wEAAwE;IACjE,MAAM,CAAC,WAAW,CAAC,EAAU,EAAE,EAAU,EAAE,OAAqB,EAAE,OAAqB;QAC5F,OAAO,UAAU,CAAC,UAAU,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,UAAU,CAAC,iBAAiB,EAAE,UAAU,CAAC,iBAAiB,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;QACxH;;;;;;kBAMU;IACZ,CAAC;IACD,0EAA0E;IACnE,MAAM,CAAC,WAAW,CAAC,EAAU,EAAE,EAAU,EAAE,OAAqB,EAAE,OAAqB;QAC5F,OAAO,UAAU,CAAC,UAAU,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,UAAU,CAAC,iBAAiB,EAAE,UAAU,CAAC,iBAAiB,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;QACxH;;;;;;;;;;UAUE;IACJ,CAAC;IAED,yEAAyE;IAClE,MAAM,CAAC,WAAW,CAAC,EAAU,EAAE,EAAU,EAAE,OAAqB,EAAE,OAAqB;QAC5F,OAAO,UAAU,CAAC,UAAU,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,UAAU,CAAC,iBAAiB,EAAE,UAAU,CAAC,iBAAiB,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;QACxH;;;;;;;;;;;;;UAaE;IACJ,CAAC;IAED,yEAAyE;IAClE,MAAM,CAAC,WAAW,CAAC,EAAU,EAAE,EAAU,EAAE,OAAqB,EAAE,OAAqB;QAC5F,OAAO,UAAU,CAAC,UAAU,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,UAAU,CAAC,iBAAiB,EAAE,UAAU,CAAC,iBAAiB,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;QACxH;;;;;;;;;;;;MAYF;IACA,CAAC;IACD,2DAA2D;IACpD,MAAM,CAAC,IAAI,CAChB,EAAgB,EAChB,EAAgB,EAChB,CAAS,EACT,CAAwB;QACxB,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YAAC,GAAG,IAAI,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACnD,OAAO,GAAG,CAAC;IACb,CAAC;IACD;;;;;;;OAOG;IACI,MAAM,CAAC,eAAe,CAAC,EAAU,EAAE,EAAU,EAAE,CAAwB,EAAE,WAAmB,EAAE,WAAmB,CAAC;QACvH,MAAM,MAAM,GAAG,IAAI,WAAW,CAAC,QAAQ,CAAC,CAAC;QACzC,IAAI,WAAW,GAAG,CAAC;YACjB,WAAW,GAAG,CAAC,CAAC;QAClB,MAAM,EAAE,GAAG,GAAG,GAAG,WAAW,CAAC;QAC7B,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,WAAW,EAAE,CAAC,EAAE,EAAE,CAAC;YACtC,MAAM,EAAE,GAAG,mBAAQ,CAAC,WAAW,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,EAAE,CAAC,CAAC;YACtD,MAAM,EAAE,GAAG,CAAC,KAAK,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,mBAAQ,CAAC,WAAW,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,EAAE,EAAE,CAAC,CAAC;YAC3E,MAAM,CAAC,GAAG,MAAM,CAAC,QAAQ,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,GAAG,IAAI,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YAChD,CAAC;QACH,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;;AAtJH,gCAuJC;AAED;;;;GAIG;AACH,MAAa,WAAW;IACtB,+BAA+B;IACxB,MAAM,CAAe;IAC5B,8BAA8B;IACvB,MAAM,CAAe;IAC5B,yEAAyE;IAClE,gBAAgB,CAAyE;IAChG,kFAAkF;IAC3E,QAAQ,CAAC,EAAU,EAAE,EAAU;QACpC,OAAO,IAAI,CAAC,gBAAgB,CAAC,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;IACjE,CAAC;IACD;;;OAGG;IACH,YAAmB,cAAsB;QACvC,MAAM,QAAQ,GAAG,CAAC,CAAC,CAAE,iGAAiG;QACtH,IAAI,CAAC,MAAM,GAAG,IAAI,YAAY,CAAC,QAAQ,CAAC,CAAC;QACzC,IAAI,CAAC,MAAM,GAAG,IAAI,YAAY,CAAC,QAAQ,CAAC,CAAC;QACzC,6GAA6G;QAC7G,IAAI,cAAc,GAAG,CAAC,IAAI,cAAc,GAAG,CAAC;YAC1C,cAAc,GAAG,CAAC,CAAC;QACrB,QAAQ,cAAc,EAAE,CAAC;YACvB,KAAK,CAAC;gBAAE,IAAI,CAAC,gBAAgB,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,OAAO,EAAE,OAAO,EAAE,EAAE,CAAC,UAAU,CAAC,WAAW,CAAC,EAAE,EAAE,EAAE,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;gBAAC,MAAM;YACtH,KAAK,CAAC;gBAAE,IAAI,CAAC,gBAAgB,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,OAAO,EAAE,OAAO,EAAE,EAAE,CAAC,UAAU,CAAC,WAAW,CAAC,EAAE,EAAE,EAAE,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;gBAAC,MAAM;YACtH,KAAK,CAAC;gBAAE,IAAI,CAAC,gBAAgB,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,OAAO,EAAE,OAAO,EAAE,EAAE,CAAC,UAAU,CAAC,WAAW,CAAC,EAAE,EAAE,EAAE,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;gBAAC,MAAM;YACtH,KAAK,CAAC;gBAAE,IAAI,CAAC,gBAAgB,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,OAAO,EAAE,OAAO,EAAE,EAAE,CAAC,UAAU,CAAC,WAAW,CAAC,EAAE,EAAE,EAAE,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;gBAAC,MAAM;YACtH;gBAAS,IAAI,CAAC,gBAAgB,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,OAAO,EAAE,OAAO,EAAE,EAAE,CAAC,UAAU,CAAC,WAAW,CAAC,EAAE,EAAE,EAAE,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;gBAAC,MAAM;QACzH,CAAC;IAEH,CAAC;CACF;AA/BD,kCA+BC;AACD,6HAA6H","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n\r\nimport { Geometry } from \"../Geometry\";\r\n\r\n/** @packageDocumentation\r\n * @module Numerics\r\n */\r\n\r\n/** Support class for quadrature -- approximate integrals by summing weighted function values.\r\n * These are filled with x and weight for quadrature between xA and xB\r\n *\r\n * Since quadrature is done in side tight loops, these methods are structured for minimum object\r\n * allocation.\r\n * For methods names setupGauss<N> (where N is a smallish integer), the CALLER creates arrays xMapped and wMapped\r\n * The method installs particular x and weight values.\r\n * @internal\r\n */\r\nexport class Quadrature {\r\n  /** x value for 1 point gauss rule in 0..1 interval */\r\n  public static readonly gaussX1Interval01 = new Float64Array([0.5]);\r\n  /** weight for 1 point gauss rule in 0..1 interval */\r\n  public static readonly gaussW1Interval01 = new Float64Array([1.0]);\r\n\r\n  /** x value for 2 point gauss rule in 0..1 interval */\r\n  public static readonly gaussX2Interval01 = new Float64Array([0.21132486540518708, 0.7886751345948129]);\r\n  /** weight for 2 point gauss rule in 0..1 interval */\r\n  public static readonly gaussW2Interval01 = new Float64Array([0.5, 0.5]);\r\n\r\n  /** x value for 3 point gauss rule in 0..1 interval */\r\n  public static readonly gaussX3Interval01 = new Float64Array([0.1127016653792583, 0.5, 0.8872983346207417]);\r\n  /** weight for 3 point gauss rule in 0..1 interval */\r\n  public static readonly gaussW3Interval01 = new Float64Array([0.2777777777777778, 0.4444444444444444, 0.2777777777777778]);\r\n\r\n  /** x value for 4 point gauss rule in 0..1 interval */\r\n  public static readonly gaussX4Interval01 = new Float64Array([0.06943184420297371, 0.33000947820757187, 0.6699905217924281, 0.9305681557970262]);\r\n  /** weight for 4 point gauss rule in 0..1 interval */\r\n  public static readonly gaussW4Interval01 = new Float64Array([0.17392742256872692, 0.3260725774312731, 0.3260725774312731, 0.17392742256872692]);\r\n\r\n  /** x value for 5 point gauss rule in 0..1 interval */\r\n  public static readonly gaussX5Interval01 = new Float64Array([0.04691007703066802, 0.23076534494715845, 0.5, 0.7692346550528415, 0.9530899229693319]);\r\n  /** weight for 5 point gauss rule in 0..1 interval */\r\n  public static readonly gaussW5Interval01 = new Float64Array([0.11846344252809454, 0.23931433524968324, 0.28444444444444444, 0.23931433524968324, 0.11846344252809454]);\r\n\r\n  /**\r\n   * Given points and weights in a reference interval (usually 0 to 1):\r\n   *\r\n   * * map each xRef[i] to xA + h * xRef[i];\r\n   * * scale each weight wRef[i] to h * wRef[i]\r\n   * * all arrays are assumed to have xRef.length entries.\r\n   * * the return value is xRef.length\r\n   * @param xA beginning of target interval\r\n   * @param h length of target interval\r\n   * @param xRef x coordinates in reference interval\r\n   * @param wRef weights for integration in the reference interval\r\n   * @param xMapped x coordinates to evaluate integrands\r\n   * @param wMapped weights for evaluated integrands\r\n   */\r\n  public static mapWeights(xA: number, h: number, xRef: Float64Array, wRef: Float64Array, xMapped: Float64Array, wMapped: Float64Array): number {\r\n    const n = xRef.length;\r\n    for (let i = 0; i < n; i++) {\r\n      xMapped[i] = xA + h * xRef[i];\r\n      wMapped[i] = h * wRef[i];\r\n    }\r\n    return n;\r\n  }\r\n\r\n  /** Install 1 (ONE) x and weight values for quadrature from xA to xB. */\r\n  public static setupGauss1(xA: number, xB: number, xMapped: Float64Array, wMapped: Float64Array): number {\r\n    return Quadrature.mapWeights(xA, xB - xA, Quadrature.gaussX1Interval01, Quadrature.gaussW1Interval01, xMapped, wMapped);\r\n  }\r\n\r\n  /** Install 2 (TWO) x and weight values for quadrature from xA to xB. */\r\n  public static setupGauss2(xA: number, xB: number, xMapped: Float64Array, wMapped: Float64Array): number {\r\n    return Quadrature.mapWeights(xA, xB - xA, Quadrature.gaussX2Interval01, Quadrature.gaussW2Interval01, xMapped, wMapped);\r\n    /*  // exact formulas for interval xA..xB:\r\n        const x0 = 0.5 * (xA + xB);\r\n            const h = 0.5 * (xB - xA);\r\n            const dx = h / Math.sqrt(3);\r\n            xMapped[0] = x0 - dx; xMapped[1] = x0 + dx;\r\n            wMapped[0] = wMapped[1] = h;\r\n            */\r\n  }\r\n  /** Install 3 (THREE) x and weight values for quadrature from xA to xB. */\r\n  public static setupGauss3(xA: number, xB: number, xMapped: Float64Array, wMapped: Float64Array): number {\r\n    return Quadrature.mapWeights(xA, xB - xA, Quadrature.gaussX3Interval01, Quadrature.gaussW3Interval01, xMapped, wMapped);\r\n    /*  // exact formulas for interval xA..xB:\r\n    const x0 = 0.5 * (xA + xB);\r\n    const h = 0.5 * (xB - xA);\r\n    const a = Math.sqrt(0.6);\r\n    const b = h * 5.0 / 9.0;\r\n    const dx = a * h;\r\n    xMapped[0] = x0 - dx; xMapped[1] = x0; xMapped[2] = x0 + dx;\r\n    wMapped[0] = wMapped[2] = b;\r\n    wMapped[1] = h * 8.0 / 9.0;\r\n    return 3;\r\n    */\r\n  }\r\n\r\n  /** Install 5 (FIVE) x and weight values for quadrature from xA to xB. */\r\n  public static setupGauss5(xA: number, xB: number, xMapped: Float64Array, wMapped: Float64Array): number {\r\n    return Quadrature.mapWeights(xA, xB - xA, Quadrature.gaussX5Interval01, Quadrature.gaussW5Interval01, xMapped, wMapped);\r\n    /*  // exact formulas for interval xA..xB:\r\n    const x0 = 0.5 * (xA + xB);\r\n    const h = 0.5 * (xB - xA);\r\n    const q = 2.0 * Math.sqrt(10.0 / 7.0);\r\n    const b = 13.0 * Math.sqrt(70.0);\r\n    const a1 = h * Math.sqrt(5.0 - q) / 3.0;\r\n    const a2 = h * Math.sqrt(5.0 + q) / 3.0;\r\n    const w1 = h * (322.0 + b) / 900.0;\r\n    const w2 = h * (322.0 - b) / 900;\r\n    const w0 = h * 128.0 / 225.0;\r\n    xMapped[0] = x0 - a2; xMapped[1] = x0 - a1; xMapped[2] = x0; xMapped[3] = x0 + a1; xMapped[4] = x0 + a2;\r\n    wMapped[0] = w2; wMapped[1] = w1; wMapped[2] = w0; wMapped[3] = w1; wMapped[4] = w2;\r\n    return 5;\r\n    */\r\n  }\r\n\r\n  /** Install 4 (FOUR) x and weight values for quadrature from xA to xB. */\r\n  public static setupGauss4(xA: number, xB: number, xMapped: Float64Array, wMapped: Float64Array): number {\r\n    return Quadrature.mapWeights(xA, xB - xA, Quadrature.gaussX4Interval01, Quadrature.gaussW4Interval01, xMapped, wMapped);\r\n    /*  // exact formulas for interval xA..xB:\r\nconst x0 = 0.5 * (xA + xB);\r\nconst h = 0.5 * (xB - xA);\r\nconst q = 2.0 * Math.sqrt(6.0 / 5.0);\r\nconst r = Math.sqrt(30.0);\r\nconst a1 = h * Math.sqrt((3 - q) / 7.0);\r\nconst w1 = h * (18.0 + r) / 36.0;\r\nconst a2 = h * Math.sqrt((3 + q) / 7.0);\r\nconst w2 = h * (18.0 - r) / 36.0;\r\nxMapped[0] = x0 - a2; xMapped[1] = x0 - a1; xMapped[2] = x0 + a1; xMapped[3] = x0 + a2;\r\nwMapped[0] = w2; wMapped[1] = w1; wMapped[2] = w1; wMapped[3] = w2;\r\nreturn 4;\r\n*/\r\n  }\r\n  /** Sum function values with given weights and x values. */\r\n  public static sum1(\r\n    xx: Float64Array,\r\n    ww: Float64Array,\r\n    n: number,\r\n    f: (x: number) => number): number {\r\n    let sum = 0;\r\n    for (let i = 0; i < n; i++)sum += ww[i] * f(xx[i]);\r\n    return sum;\r\n  }\r\n  /**\r\n   * Do a Guass quadrature integral for a (number)=>number function over an interval, with caller specified sub-interval count and\r\n   * @param x0 start of overall interval\r\n   * @param x1 end of overall interval\r\n   * @param f function to evaluate\r\n   * @param numInterval number of internal intervals\r\n   * @param numGauss number of gauss points.    must be supported by GaussMapper, i.e. 1,2,3,4,5\r\n   */\r\n  public static doGaussIntegral(x0: number, x1: number, f: (x: number) => number, numInterval: number, numGauss: number = 5) {\r\n    const mapper = new GaussMapper(numGauss);\r\n    if (numInterval < 1)\r\n      numInterval = 1;\r\n    const df = 1.0 / numInterval;\r\n    let sum = 0;\r\n    for (let i = 1; i <= numInterval; i++) {\r\n      const xA = Geometry.interpolate(x0, (i - 1) * df, x1);\r\n      const xB = i === numInterval ? x1 : Geometry.interpolate(x0, (i) * df, x1);\r\n      const n = mapper.mapXAndW(xA, xB);\r\n      for (let k = 0; k < n; k++) {\r\n        sum += mapper.gaussW[k] * f(mapper.gaussX[k]);\r\n      }\r\n    }\r\n    return sum;\r\n  }\r\n}\r\n\r\n/**\r\n * This class carries public members as needed for users to have gauss points that are used\r\n * in the callers loops.\r\n * @internal\r\n */\r\nexport class GaussMapper {\r\n  /** x values for integration */\r\n  public gaussX: Float64Array;\r\n  /** weights for integration */\r\n  public gaussW: Float64Array;\r\n  /** function to be called (at each interval) to map integration values */\r\n  public mapXAndWFunction: (xA: number, xB: number, xx: Float64Array, ww: Float64Array) => number;\r\n  /** Execute the mapXAndWFunction to set up arrays for integration from xA to xB */\r\n  public mapXAndW(xA: number, xB: number): number {\r\n    return this.mapXAndWFunction(xA, xB, this.gaussX, this.gaussW);\r\n  }\r\n  /** setup gauss arrays.\r\n   * * Number of gauss points must be 1 to 5 (inclusive)\r\n   * @param numGauss requested number of gauss points.\r\n   */\r\n  public constructor(numGaussPoints: number) {\r\n    const maxGauss = 7;  // (As of Nov 2 2018, 7 is a fluffy over-allocation-- the quadrature class only handles up to 5.)\r\n    this.gaussX = new Float64Array(maxGauss);\r\n    this.gaussW = new Float64Array(maxGauss);\r\n    // This sets the number of gauss points.  This integrates exactly for polynomials of (degree 2*numGauss - 1).\r\n    if (numGaussPoints > 5 || numGaussPoints < 1)\r\n      numGaussPoints = 5;\r\n    switch (numGaussPoints) {\r\n      case 1: this.mapXAndWFunction = (xA, xB, xMapped, wMapped) => Quadrature.setupGauss1(xA, xB, xMapped, wMapped); break;\r\n      case 2: this.mapXAndWFunction = (xA, xB, xMapped, wMapped) => Quadrature.setupGauss2(xA, xB, xMapped, wMapped); break;\r\n      case 3: this.mapXAndWFunction = (xA, xB, xMapped, wMapped) => Quadrature.setupGauss3(xA, xB, xMapped, wMapped); break;\r\n      case 4: this.mapXAndWFunction = (xA, xB, xMapped, wMapped) => Quadrature.setupGauss4(xA, xB, xMapped, wMapped); break;\r\n      default: this.mapXAndWFunction = (xA, xB, xMapped, wMapped) => Quadrature.setupGauss5(xA, xB, xMapped, wMapped); break;\r\n    }\r\n\r\n  }\r\n}\r\n// someday .... http://www.holoborodko.com/pavel/numerical-methods/numerical-integration/overlapped-newton-cotes-quadratures/\r\n"]}

package/lib/cjs/numerics/TriDiagonalSystem.js

@@ -22,6 +22,17 @@ var DataState;
  * @internal
  */
 class TriDiagonalSystem {
+    // Lower diagonal, indexed by rows
+    _aLeft;
+    // Upper diagonal, indexed by rows
+    _aRight;
+    // Main diagonal, indexed by rows
+    _aDiag;
+    // Right side vector
+    _b;
+    // Solution vector
+    _x;
+    _dataState;
     constructor(n) {
         this._aLeft = new Float64Array(n);
         this._aDiag = new Float64Array(n);

package/lib/cjs/numerics/TriDiagonalSystem.js.map

@@ -1 +1 @@
-{"version":3,"file":"TriDiagonalSystem.js","sourceRoot":"","sources":["../../../src/numerics/TriDiagonalSystem.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F;;GAEG;AAEH,0CAAuC;AACvC,mEAAwD;AAExD,kGAAkG;AAClG,IAAK,SAIJ;AAJD,WAAK,SAAS;IACZ,mDAAS,CAAA;IACT,iDAAQ,CAAA;IACR,yDAAY,CAAA;AACd,CAAC,EAJI,SAAS,KAAT,SAAS,QAIb;AACD;;;GAGG;AACH,MAAa,iBAAiB;IAe5B,YAAY,CAAS;QACnB,IAAI,CAAC,MAAM,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;QAClC,IAAI,CAAC,MAAM,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;QAClC,IAAI,CAAC,OAAO,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;QACnC,IAAI,CAAC,EAAE,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;QAC9B,IAAI,CAAC,EAAE,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;QAC9B,IAAI,CAAC,KAAK,EAAE,CAAC;IACf,CAAC;IAED,0DAA0D;IACnD,KAAK;QACV,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC,SAAS,CAAC;QACtC,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;QAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;QACpF,CAAC;IACH,CAAC;IACD,0CAA0C;IACnC,MAAM,CAAC,GAAW,EAAE,IAAY,EAAE,IAAY,EAAE,KAAa;QAClE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC;QACxB,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC;QACxB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;IAC5B,CAAC;IACD,2BAA2B;IACpB,QAAQ,CAAC,GAAW,EAAE,IAAY,EAAE,IAAY,EAAE,KAAa;QACpE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC;QACzB,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC;QACzB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC;IAC7B,CAAC;IACD,gDAAgD;IACzC,IAAI,CAAC,GAAW,EAAE,EAAU;QACjC,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC;IACpB,CAAC;IACD,mDAAmD;IAC5C,MAAM,CAAC,GAAW,EAAE,EAAU;QACnC,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;IACrB,CAAC;IACD,iDAAiD;IAC1C,IAAI,CAAC,GAAW;QACrB,OAAO,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;IACtB,CAAC;IACD,8CAA8C;IACvC,IAAI,CAAC,GAAW,EAAE,EAAU;QACjC,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC;IACpB,CAAC;IACD,+CAA+C;IACxC,IAAI,CAAC,GAAW;QACrB,OAAO,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;IACtB,CAAC;IACD,6CAA6C;IACtC,KAAK;QACV,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;IAC5B,CAAC;IACD,0CAA0C;IACnC,UAAU;QACf,IAAI,IAAI,CAAC,UAAU,KAAK,SAAS,CAAC,YAAY,EAAE,CAAC;YAC/C,OAAO,KAAK,CAAC;QACf,CAAC;aAAM,IAAI,IAAI,CAAC,UAAU,KAAK,SAAS,CAAC,QAAQ,EAAE,CAAC;YAClD,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;YAC7B,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;YAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC7B,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC9E,CAAC;YACD,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;YAE/C,KAAK,IAAI,CAAC,GAAG,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC7B,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAChD,CAAC;YAED,OAAO,IAAI,CAAC;QACd,CAAC;aAAM,CAAC;YACN,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;YAC7B,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;YAClB,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACxE,IAAI,CAAC,CAAC;YACN,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;gBACzB,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAChH,CAAC;YACD,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;YACjF,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;IAED,0CAA0C;IACnC,gBAAgB,CAAC,MAAiB,EAAE,MAAiB;QAC1D,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;QAClB,OAAO,MAAM,CAAC,MAAM,GAAG,MAAM,CAAC,MAAM;YAClC,MAAM,CAAC,IAAI,CAAC,yBAAO,CAAC,MAAM,EAAE,CAAC,CAAC;QAChC,MAAM,CAAC,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC;QAE9B,IAAI,IAAI,CAAC,UAAU,KAAK,SAAS,CAAC,YAAY,EAAE,CAAC;YAC/C,OAAO,KAAK,CAAC;QACf,CAAC;aAAM,IAAI,IAAI,CAAC,UAAU,KAAK,SAAS,CAAC,QAAQ,EAAE,CAAC;YAElD,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;YAC7B,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;YAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC7B,yBAAO,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YACjG,CAAC;YACD,yBAAO,CAAC,WAAW,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;YAEhE,KAAK,IAAI,CAAC,GAAG,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC7B,MAAM,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YACjE,CAAC;YAED,OAAO,IAAI,CAAC;QACd,CAAC;aAAM,CAAC;YACN,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;YAC7B,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;YAClB,yBAAO,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YAC3F,IAAI,CAAC,CAAC;YACN,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;gBACzB,yBAAO,CAAC,gBAAgB,CACtB,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EACxD,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAC9B,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YACf,CAAC;YACD,yBAAO,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;YACtG,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;IAED,0EAA0E;IACnE,QAAQ;QACb,IAAI,IAAI,CAAC,UAAU,KAAK,SAAS,CAAC,SAAS,EAAE,CAAC;YAC5C,OAAO,IAAI,CAAC;QACd,CAAC;QACD,IAAI,IAAI,CAAC,UAAU,KAAK,SAAS,CAAC,YAAY,EAAE,CAAC;YAC/C,OAAO,KAAK,CAAC;QACf,CAAC;QACD,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;QAC7B,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;QAElB,KAAK,IAAI,CAAC,GAAG,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACvD,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACvC,CAAC;QACD,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC,SAAS,CAAC;QACtC,OAAO,IAAI,CAAC;IACd,CAAC;IACD,mEAAmE;IAC5D,MAAM;QACX,IAAI,IAAI,CAAC,UAAU,KAAK,SAAS,CAAC,QAAQ,EAAE,CAAC;YAC3C,OAAO,IAAI,CAAC;QACd,CAAC;QACD,IAAI,IAAI,CAAC,UAAU,KAAK,SAAS,CAAC,SAAS,EAAE,CAAC;YAC5C,OAAO,KAAK,CAAC;QACf,CAAC;QACD,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC,YAAY,CAAC;QAEzC,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAI,mBAAmB;QACzD,4BAA4B;QAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5B,MAAM,CAAC,GAAG,mBAAQ,CAAC,yBAAyB,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YACjF,IAAI,CAAC,KAAK,SAAS;gBACjB,OAAO,KAAK,CAAC;YACf,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;YACvB,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QAC5C,CAAC;QACD,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC,QAAQ,CAAC;QACrC,OAAO,IAAI,CAAC;IACd,CAAC;IACD,4DAA4D;IACrD,uBAAuB;QAC5B,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;QAC7B,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;QACjB,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE;YAChB,OAAO,KAAK,CAAC;QAEf,wDAAwD;QACxD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC1B,CAAC;QACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAChD,CAAC;QAED,+BAA+B;QAC/B,iFAAiF;QACjF,4DAA4D;QAC5D,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QAE/B,KAAK,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACjC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAChF,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IACD,sGAAsG;IAC/F,kCAAkC,CAAC,OAAkB,EAAE,OAAkB;QAC9E,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;QAC7B,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC;YACpB,OAAO,KAAK,CAAC;QAEf,OAAO,OAAO,CAAC,MAAM,GAAG,CAAC;YACvB,OAAO,CAAC,IAAI,CAAC,yBAAO,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACxC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;QACnB,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;QACjB,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE;YAChB,OAAO,KAAK,CAAC;QAEf,wDAAwD;QACxD,IAAI,OAAO,KAAK,OAAO,EAAE,CAAC;YACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;YACjC,CAAC;QACH,CAAC;QAED,IAAI,CAAS,CAAC;QACd,IAAI,CAAS,CAAC;QACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACnB,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACrC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACrC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACvC,CAAC;QAED,6BAA6B;QAC7B,iFAAiF;QACjF,4DAA4D;QAC5D,CAAC,GAAG,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QAC1B,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACnB,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACnB,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAEnB,KAAK,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACjC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YACpB,CAAC,GAAG,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACzB,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACzD,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACzD,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAC3D,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IACD,+BAA+B;IACxB,IAAI;QACT,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;QAC7B,MAAM,CAAC,GAAG,IAAI,iBAAiB,CAAC,CAAC,CAAC,CAAC;QACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAC7B,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAC7B,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YAC/B,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACrB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACvB,CAAC;QACD,CAAC,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC;QAC/B,OAAO,CAAC,CAAC;IACX,CAAC;IAED,8DAA8D;IACvD,OAAO;QACZ,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;QAC7B,MAAM,IAAI,GAAG,EAAE,CAAC;QAEhB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,IAAI,CAAC,IAAI,CACP,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACpF,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,8DAA8D;IACvD,iBAAiB,CAAC,IAAe;QACtC,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;QAC7B,MAAM,IAAI,GAAG,EAAE,CAAC;QAEhB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,IAAI,CAAC,IAAI,CACP,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QAC1F,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;CACF;AAhSD,8CAgSC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n\r\n/** @packageDocumentation\r\n * @module Numerics\r\n */\r\n\r\nimport { Geometry } from \"../Geometry\";\r\nimport { Point3d } from \"../geometry3d/Point3dVector3d\";\r\n\r\n// Enumerated type lies outside of TriDiagonalSystem, as TSLint prevented declaration within class\r\nenum DataState {\r\n  RawMatrix,\r\n  FactorOK,\r\n  FactorFailed,\r\n}\r\n/**\r\n * Linear system operations on a matrix with data only on the diagonal and its immediate left and right neighbors\r\n * @internal\r\n */\r\nexport class TriDiagonalSystem {\r\n\r\n  // Lower diagonal, indexed by rows\r\n  private _aLeft: Float64Array;\r\n  // Upper diagonal, indexed by rows\r\n  private _aRight: Float64Array;\r\n  // Main diagonal, indexed by rows\r\n  private _aDiag: Float64Array;\r\n  // Right side vector\r\n  private _b: Float64Array;\r\n  // Solution vector\r\n  private _x: Float64Array;\r\n\r\n  private _dataState!: DataState;\r\n\r\n  constructor(n: number) {\r\n    this._aLeft = new Float64Array(n);\r\n    this._aDiag = new Float64Array(n);\r\n    this._aRight = new Float64Array(n);\r\n    this._b = new Float64Array(n);\r\n    this._x = new Float64Array(n);\r\n    this.reset();\r\n  }\r\n\r\n  /** Reset to RawMatrix state with all coefficients zero */\r\n  public reset() {\r\n    this._dataState = DataState.RawMatrix;\r\n    const n = this._aDiag.length;\r\n    for (let i = 0; i < n; i++) {\r\n      this._aLeft[i] = this._aRight[i] = this._aDiag[i] = this._b[i] = this._x[i] = 0.0;\r\n    }\r\n  }\r\n  /** Install data in a row of the matrix */\r\n  public setRow(row: number, left: number, diag: number, right: number) {\r\n    this._aLeft[row] = left;\r\n    this._aDiag[row] = diag;\r\n    this._aRight[row] = right;\r\n  }\r\n  /** Add to row of matrix */\r\n  public addToRow(row: number, left: number, diag: number, right: number) {\r\n    this._aLeft[row] += left;\r\n    this._aDiag[row] += diag;\r\n    this._aRight[row] += right;\r\n  }\r\n  /** Install data in the right side (B) vector */\r\n  public setB(row: number, bb: number) {\r\n    this._b[row] = bb;\r\n  }\r\n  /** Add to an entry in the right side (B) vector */\r\n  public addToB(row: number, bb: number) {\r\n    this._b[row] += bb;\r\n  }\r\n  /** Access data from the right side (B) vector */\r\n  public getB(row: number): number {\r\n    return this._b[row];\r\n  }\r\n  /** Install data in the solution (X) vector */\r\n  public setX(row: number, xx: number) {\r\n    this._x[row] = xx;\r\n  }\r\n  /** Access data from the solution (X) vector */\r\n  public getX(row: number): number {\r\n    return this._x[row];\r\n  }\r\n  /** Get method for matrix and vector order */\r\n  public order(): number {\r\n    return this._aDiag.length;\r\n  }\r\n  /** Compute product of AX and save as B */\r\n  public multiplyAX(): boolean {\r\n    if (this._dataState === DataState.FactorFailed) {\r\n      return false;\r\n    } else if (this._dataState === DataState.FactorOK) {\r\n      const n = this._aDiag.length;\r\n      const nm1 = n - 1;\r\n      for (let i = 0; i < nm1; i++) {\r\n        this._b[i] = this._aDiag[i] * this._x[i] + this._aRight[i] * this._x[i + 1];\r\n      }\r\n      this._b[nm1] = this._aDiag[nm1] * this._x[nm1];\r\n\r\n      for (let i = nm1; i > 0; i--) {\r\n        this._b[i] += this._aLeft[i] * this._b[i - 1];\r\n      }\r\n\r\n      return true;\r\n    } else {\r\n      const n = this._aDiag.length;\r\n      const nm1 = n - 1;\r\n      this._b[0] = this._aDiag[0] * this._x[0] + this._aRight[0] * this._x[1];\r\n      let i;\r\n      for (i = 1; i < nm1; i++) {\r\n        this._b[i] = this._aLeft[i] * this._x[i - 1] + this._aDiag[i] * this._x[i] + this._aRight[i] * this._x[i + 1];\r\n      }\r\n      this._b[nm1] = this._aLeft[nm1] * this._x[n - 2] + this._aDiag[i] * this._x[nm1];\r\n      return true;\r\n    }\r\n  }\r\n\r\n  /** Compute product of AX and save as B */\r\n  public multiplyAXPoints(pointX: Point3d[], pointB: Point3d[]): boolean {\r\n    pointB.length = 0;\r\n    while (pointB.length < pointX.length)\r\n      pointB.push(Point3d.create());\r\n    pointB.length = pointX.length;\r\n\r\n    if (this._dataState === DataState.FactorFailed) {\r\n      return false;\r\n    } else if (this._dataState === DataState.FactorOK) {\r\n\r\n      const n = this._aDiag.length;\r\n      const nm1 = n - 1;\r\n      for (let i = 0; i < nm1; i++) {\r\n        Point3d.createAdd2Scaled(pointX[i], this._aDiag[i], pointX[i + 1], this._aRight[i], pointB[i]);\r\n      }\r\n      Point3d.createScale(pointX[nm1], this._aDiag[nm1], pointB[nm1]);\r\n\r\n      for (let i = nm1; i > 0; i--) {\r\n        pointB[i].plusScaled(pointB[i - 1], this._aLeft[i], pointB[i]);\r\n      }\r\n\r\n      return true;\r\n    } else {\r\n      const n = this._aDiag.length;\r\n      const nm1 = n - 1;\r\n      Point3d.createAdd2Scaled(pointX[0], this._aDiag[0], pointX[1], this._aRight[0], pointB[0]);\r\n      let i;\r\n      for (i = 1; i < nm1; i++) {\r\n        Point3d.createAdd3Scaled(\r\n          pointX[i - 1], this._aLeft[i], pointX[i], this._aDiag[i],\r\n          pointX[i + 1], this._aRight[i],\r\n          pointB[i]);\r\n      }\r\n      Point3d.createAdd2Scaled(pointX[n - 2], this._aLeft[nm1], pointX[nm1], this._aDiag[nm1], pointB[nm1]);\r\n      return true;\r\n    }\r\n  }\r\n\r\n  /** Multiply the stored factors together to return to plain matrix form */\r\n  public defactor(): boolean {\r\n    if (this._dataState === DataState.RawMatrix) {\r\n      return true;\r\n    }\r\n    if (this._dataState === DataState.FactorFailed) {\r\n      return false;\r\n    }\r\n    const n = this._aDiag.length;\r\n    const nm1 = n - 1;\r\n\r\n    for (let i = nm1; i > 0; i--) {\r\n      this._aDiag[i] += this._aLeft[i] * this._aRight[i - 1];\r\n      this._aLeft[i] *= this._aDiag[i - 1];\r\n    }\r\n    this._dataState = DataState.RawMatrix;\r\n    return true;\r\n  }\r\n  /** Factor the tridiagonal matrix to LU parts. b, x, not altered */\r\n  public factor(): boolean {\r\n    if (this._dataState === DataState.FactorOK) {\r\n      return true;\r\n    }\r\n    if (this._dataState !== DataState.RawMatrix) {\r\n      return false;\r\n    }\r\n    this._dataState = DataState.FactorFailed;\r\n\r\n    const n1 = this._aDiag.length - 1;    // Last pivot index\r\n    // Eliminate in subdiagonal.\r\n    for (let i = 0; i < n1; i++) {\r\n      const r = Geometry.conditionalDivideFraction(this._aLeft[i + 1], this._aDiag[i]);\r\n      if (r === undefined)\r\n        return false;\r\n      this._aLeft[i + 1] = r;\r\n      this._aDiag[i + 1] -= r * this._aRight[i];\r\n    }\r\n    this._dataState = DataState.FactorOK;\r\n    return true;\r\n  }\r\n  /** Solve AX=B. A is left in factored state. B unchanged. */\r\n  public factorAndBackSubstitute(): boolean {\r\n    const n = this._aDiag.length;\r\n    const n1 = n - 1;\r\n    if (!this.factor())\r\n      return false;\r\n\r\n    // Apply L inverse to B, same sequence as was done to A:\r\n    for (let i = 0; i < n; i++) {\r\n      this._x[i] = this._b[i];\r\n    }\r\n    for (let i = 1; i < n; i++) {\r\n      this._x[i] -= this._aLeft[i] * this._x[i - 1];\r\n    }\r\n\r\n    // Print (\"LU  L Inverse B B\");\r\n    // overwrite X with solution of U * X = L inverse B, where RHS is already in X...\r\n    // All diagonals are known to be nonzero. Really.  Really???\r\n    this._x[n1] /= this._aDiag[n1];\r\n\r\n    for (let i = n1 - 1; i >= 0; i--) {\r\n      this._x[i] = (this._x[i] - this._aRight[i] * this._x[i + 1]) / this._aDiag[i];\r\n    }\r\n\r\n    return true;\r\n  }\r\n  /** Solve AX=B. A is left in factored state. B unchanged. vectorB and vectorX may be the same array */\r\n  public factorAndBackSubstitutePointArrays(vectorB: Point3d[], vectorX: Point3d[]): boolean {\r\n    const n = this._aDiag.length;\r\n    if (vectorB.length < n)\r\n      return false;\r\n\r\n    while (vectorX.length < n)\r\n      vectorX.push(Point3d.create(0, 0, 0));\r\n    vectorX.length = n;\r\n    const n1 = n - 1;\r\n    if (!this.factor())\r\n      return false;\r\n\r\n    // Apply L inverse to B, same sequence as was done to A:\r\n    if (vectorB !== vectorX) {\r\n      for (let i = 0; i < n; i++) {\r\n        vectorX[i].setFrom(vectorB[i]);\r\n      }\r\n    }\r\n\r\n    let a: number;\r\n    let b: number;\r\n    for (let i = 1; i < n; i++) {\r\n      a = this._aLeft[i];\r\n      vectorX[i].x -= a * vectorX[i - 1].x;\r\n      vectorX[i].y -= a * vectorX[i - 1].y;\r\n      vectorX[i].z -= a * vectorX[i - 1].z;\r\n    }\r\n\r\n    // Print (\"LU  L inverse B\");\r\n    // overwrite X with solution of U * X = L inverse B, where RHS is already in X...\r\n    // All diagonals are known to be nonzero. Really.  Really???\r\n    b = 1.0 / this._aDiag[n1];\r\n    vectorX[n1].x *= b;\r\n    vectorX[n1].y *= b;\r\n    vectorX[n1].z *= b;\r\n\r\n    for (let i = n1 - 1; i >= 0; i--) {\r\n      a = this._aRight[i];\r\n      b = 1.0 / this._aDiag[i];\r\n      vectorX[i].x = (vectorX[i].x - a * vectorX[i + 1].x) * b;\r\n      vectorX[i].y = (vectorX[i].y - a * vectorX[i + 1].y) * b;\r\n      vectorX[i].z = (vectorX[i].z - a * vectorX[i + 1].z) * b;\r\n    }\r\n\r\n    return true;\r\n  }\r\n  /** Allocate a complete copy */\r\n  public copy(): TriDiagonalSystem {\r\n    const n = this._aDiag.length;\r\n    const B = new TriDiagonalSystem(n);\r\n    for (let i = 0; i < n; i++) {\r\n      B._aLeft[i] = this._aLeft[i];\r\n      B._aDiag[i] = this._aDiag[i];\r\n      B._aRight[i] = this._aRight[i];\r\n      B._x[i] = this._x[i];\r\n      B._b[i] = this._b[i];\r\n    }\r\n    B._dataState = this._dataState;\r\n    return B;\r\n  }\r\n\r\n  /** return an array form that may be useful for display ... */\r\n  public flatten(): any {\r\n    const n = this._aDiag.length;\r\n    const data = [];\r\n\r\n    for (let i = 0; i < n; i++) {\r\n      data.push(\r\n        [i, [this._aLeft[i], this._aDiag[i], this._aRight[i]], this._x[i], this._b[i]]);\r\n    }\r\n    return data;\r\n  }\r\n\r\n  /** return an array form that may be useful for display ... */\r\n  public flattenWithPoints(xyzB: Point3d[]): any {\r\n    const n = this._aDiag.length;\r\n    const data = [];\r\n\r\n    for (let i = 0; i < n; i++) {\r\n      data.push(\r\n        [i, [this._aLeft[i], this._aDiag[i], this._aRight[i]], this._x[i], xyzB[i].toJSON()]);\r\n    }\r\n    return data;\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"TriDiagonalSystem.js","sourceRoot":"","sources":["../../../src/numerics/TriDiagonalSystem.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F;;GAEG;AAEH,0CAAuC;AACvC,mEAAwD;AAExD,kGAAkG;AAClG,IAAK,SAIJ;AAJD,WAAK,SAAS;IACZ,mDAAS,CAAA;IACT,iDAAQ,CAAA;IACR,yDAAY,CAAA;AACd,CAAC,EAJI,SAAS,KAAT,SAAS,QAIb;AACD;;;GAGG;AACH,MAAa,iBAAiB;IAE5B,kCAAkC;IAC1B,MAAM,CAAe;IAC7B,kCAAkC;IAC1B,OAAO,CAAe;IAC9B,iCAAiC;IACzB,MAAM,CAAe;IAC7B,oBAAoB;IACZ,EAAE,CAAe;IACzB,kBAAkB;IACV,EAAE,CAAe;IAEjB,UAAU,CAAa;IAE/B,YAAY,CAAS;QACnB,IAAI,CAAC,MAAM,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;QAClC,IAAI,CAAC,MAAM,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;QAClC,IAAI,CAAC,OAAO,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;QACnC,IAAI,CAAC,EAAE,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;QAC9B,IAAI,CAAC,EAAE,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;QAC9B,IAAI,CAAC,KAAK,EAAE,CAAC;IACf,CAAC;IAED,0DAA0D;IACnD,KAAK;QACV,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC,SAAS,CAAC;QACtC,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;QAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;QACpF,CAAC;IACH,CAAC;IACD,0CAA0C;IACnC,MAAM,CAAC,GAAW,EAAE,IAAY,EAAE,IAAY,EAAE,KAAa;QAClE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC;QACxB,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC;QACxB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;IAC5B,CAAC;IACD,2BAA2B;IACpB,QAAQ,CAAC,GAAW,EAAE,IAAY,EAAE,IAAY,EAAE,KAAa;QACpE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC;QACzB,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC;QACzB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC;IAC7B,CAAC;IACD,gDAAgD;IACzC,IAAI,CAAC,GAAW,EAAE,EAAU;QACjC,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC;IACpB,CAAC;IACD,mDAAmD;IAC5C,MAAM,CAAC,GAAW,EAAE,EAAU;QACnC,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;IACrB,CAAC;IACD,iDAAiD;IAC1C,IAAI,CAAC,GAAW;QACrB,OAAO,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;IACtB,CAAC;IACD,8CAA8C;IACvC,IAAI,CAAC,GAAW,EAAE,EAAU;QACjC,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC;IACpB,CAAC;IACD,+CAA+C;IACxC,IAAI,CAAC,GAAW;QACrB,OAAO,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;IACtB,CAAC;IACD,6CAA6C;IACtC,KAAK;QACV,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;IAC5B,CAAC;IACD,0CAA0C;IACnC,UAAU;QACf,IAAI,IAAI,CAAC,UAAU,KAAK,SAAS,CAAC,YAAY,EAAE,CAAC;YAC/C,OAAO,KAAK,CAAC;QACf,CAAC;aAAM,IAAI,IAAI,CAAC,UAAU,KAAK,SAAS,CAAC,QAAQ,EAAE,CAAC;YAClD,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;YAC7B,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;YAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC7B,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC9E,CAAC;YACD,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;YAE/C,KAAK,IAAI,CAAC,GAAG,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC7B,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAChD,CAAC;YAED,OAAO,IAAI,CAAC;QACd,CAAC;aAAM,CAAC;YACN,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;YAC7B,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;YAClB,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACxE,IAAI,CAAC,CAAC;YACN,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;gBACzB,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAChH,CAAC;YACD,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;YACjF,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;IAED,0CAA0C;IACnC,gBAAgB,CAAC,MAAiB,EAAE,MAAiB;QAC1D,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;QAClB,OAAO,MAAM,CAAC,MAAM,GAAG,MAAM,CAAC,MAAM;YAClC,MAAM,CAAC,IAAI,CAAC,yBAAO,CAAC,MAAM,EAAE,CAAC,CAAC;QAChC,MAAM,CAAC,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC;QAE9B,IAAI,IAAI,CAAC,UAAU,KAAK,SAAS,CAAC,YAAY,EAAE,CAAC;YAC/C,OAAO,KAAK,CAAC;QACf,CAAC;aAAM,IAAI,IAAI,CAAC,UAAU,KAAK,SAAS,CAAC,QAAQ,EAAE,CAAC;YAElD,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;YAC7B,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;YAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC7B,yBAAO,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YACjG,CAAC;YACD,yBAAO,CAAC,WAAW,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;YAEhE,KAAK,IAAI,CAAC,GAAG,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC7B,MAAM,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YACjE,CAAC;YAED,OAAO,IAAI,CAAC;QACd,CAAC;aAAM,CAAC;YACN,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;YAC7B,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;YAClB,yBAAO,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YAC3F,IAAI,CAAC,CAAC;YACN,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;gBACzB,yBAAO,CAAC,gBAAgB,CACtB,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EACxD,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAC9B,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YACf,CAAC;YACD,yBAAO,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;YACtG,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;IAED,0EAA0E;IACnE,QAAQ;QACb,IAAI,IAAI,CAAC,UAAU,KAAK,SAAS,CAAC,SAAS,EAAE,CAAC;YAC5C,OAAO,IAAI,CAAC;QACd,CAAC;QACD,IAAI,IAAI,CAAC,UAAU,KAAK,SAAS,CAAC,YAAY,EAAE,CAAC;YAC/C,OAAO,KAAK,CAAC;QACf,CAAC;QACD,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;QAC7B,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;QAElB,KAAK,IAAI,CAAC,GAAG,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACvD,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACvC,CAAC;QACD,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC,SAAS,CAAC;QACtC,OAAO,IAAI,CAAC;IACd,CAAC;IACD,mEAAmE;IAC5D,MAAM;QACX,IAAI,IAAI,CAAC,UAAU,KAAK,SAAS,CAAC,QAAQ,EAAE,CAAC;YAC3C,OAAO,IAAI,CAAC;QACd,CAAC;QACD,IAAI,IAAI,CAAC,UAAU,KAAK,SAAS,CAAC,SAAS,EAAE,CAAC;YAC5C,OAAO,KAAK,CAAC;QACf,CAAC;QACD,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC,YAAY,CAAC;QAEzC,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAI,mBAAmB;QACzD,4BAA4B;QAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5B,MAAM,CAAC,GAAG,mBAAQ,CAAC,yBAAyB,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YACjF,IAAI,CAAC,KAAK,SAAS;gBACjB,OAAO,KAAK,CAAC;YACf,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;YACvB,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QAC5C,CAAC;QACD,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC,QAAQ,CAAC;QACrC,OAAO,IAAI,CAAC;IACd,CAAC;IACD,4DAA4D;IACrD,uBAAuB;QAC5B,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;QAC7B,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;QACjB,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE;YAChB,OAAO,KAAK,CAAC;QAEf,wDAAwD;QACxD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC1B,CAAC;QACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAChD,CAAC;QAED,+BAA+B;QAC/B,iFAAiF;QACjF,4DAA4D;QAC5D,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QAE/B,KAAK,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACjC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAChF,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IACD,sGAAsG;IAC/F,kCAAkC,CAAC,OAAkB,EAAE,OAAkB;QAC9E,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;QAC7B,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC;YACpB,OAAO,KAAK,CAAC;QAEf,OAAO,OAAO,CAAC,MAAM,GAAG,CAAC;YACvB,OAAO,CAAC,IAAI,CAAC,yBAAO,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACxC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;QACnB,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;QACjB,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE;YAChB,OAAO,KAAK,CAAC;QAEf,wDAAwD;QACxD,IAAI,OAAO,KAAK,OAAO,EAAE,CAAC;YACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;YACjC,CAAC;QACH,CAAC;QAED,IAAI,CAAS,CAAC;QACd,IAAI,CAAS,CAAC;QACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACnB,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACrC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACrC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACvC,CAAC;QAED,6BAA6B;QAC7B,iFAAiF;QACjF,4DAA4D;QAC5D,CAAC,GAAG,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QAC1B,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACnB,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACnB,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAEnB,KAAK,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACjC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YACpB,CAAC,GAAG,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACzB,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACzD,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACzD,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAC3D,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IACD,+BAA+B;IACxB,IAAI;QACT,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;QAC7B,MAAM,CAAC,GAAG,IAAI,iBAAiB,CAAC,CAAC,CAAC,CAAC;QACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAC7B,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAC7B,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YAC/B,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACrB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACvB,CAAC;QACD,CAAC,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC;QAC/B,OAAO,CAAC,CAAC;IACX,CAAC;IAED,8DAA8D;IACvD,OAAO;QACZ,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;QAC7B,MAAM,IAAI,GAAG,EAAE,CAAC;QAEhB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,IAAI,CAAC,IAAI,CACP,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACpF,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,8DAA8D;IACvD,iBAAiB,CAAC,IAAe;QACtC,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;QAC7B,MAAM,IAAI,GAAG,EAAE,CAAC;QAEhB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,IAAI,CAAC,IAAI,CACP,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QAC1F,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;CACF;AAhSD,8CAgSC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n\r\n/** @packageDocumentation\r\n * @module Numerics\r\n */\r\n\r\nimport { Geometry } from \"../Geometry\";\r\nimport { Point3d } from \"../geometry3d/Point3dVector3d\";\r\n\r\n// Enumerated type lies outside of TriDiagonalSystem, as TSLint prevented declaration within class\r\nenum DataState {\r\n  RawMatrix,\r\n  FactorOK,\r\n  FactorFailed,\r\n}\r\n/**\r\n * Linear system operations on a matrix with data only on the diagonal and its immediate left and right neighbors\r\n * @internal\r\n */\r\nexport class TriDiagonalSystem {\r\n\r\n  // Lower diagonal, indexed by rows\r\n  private _aLeft: Float64Array;\r\n  // Upper diagonal, indexed by rows\r\n  private _aRight: Float64Array;\r\n  // Main diagonal, indexed by rows\r\n  private _aDiag: Float64Array;\r\n  // Right side vector\r\n  private _b: Float64Array;\r\n  // Solution vector\r\n  private _x: Float64Array;\r\n\r\n  private _dataState!: DataState;\r\n\r\n  constructor(n: number) {\r\n    this._aLeft = new Float64Array(n);\r\n    this._aDiag = new Float64Array(n);\r\n    this._aRight = new Float64Array(n);\r\n    this._b = new Float64Array(n);\r\n    this._x = new Float64Array(n);\r\n    this.reset();\r\n  }\r\n\r\n  /** Reset to RawMatrix state with all coefficients zero */\r\n  public reset() {\r\n    this._dataState = DataState.RawMatrix;\r\n    const n = this._aDiag.length;\r\n    for (let i = 0; i < n; i++) {\r\n      this._aLeft[i] = this._aRight[i] = this._aDiag[i] = this._b[i] = this._x[i] = 0.0;\r\n    }\r\n  }\r\n  /** Install data in a row of the matrix */\r\n  public setRow(row: number, left: number, diag: number, right: number) {\r\n    this._aLeft[row] = left;\r\n    this._aDiag[row] = diag;\r\n    this._aRight[row] = right;\r\n  }\r\n  /** Add to row of matrix */\r\n  public addToRow(row: number, left: number, diag: number, right: number) {\r\n    this._aLeft[row] += left;\r\n    this._aDiag[row] += diag;\r\n    this._aRight[row] += right;\r\n  }\r\n  /** Install data in the right side (B) vector */\r\n  public setB(row: number, bb: number) {\r\n    this._b[row] = bb;\r\n  }\r\n  /** Add to an entry in the right side (B) vector */\r\n  public addToB(row: number, bb: number) {\r\n    this._b[row] += bb;\r\n  }\r\n  /** Access data from the right side (B) vector */\r\n  public getB(row: number): number {\r\n    return this._b[row];\r\n  }\r\n  /** Install data in the solution (X) vector */\r\n  public setX(row: number, xx: number) {\r\n    this._x[row] = xx;\r\n  }\r\n  /** Access data from the solution (X) vector */\r\n  public getX(row: number): number {\r\n    return this._x[row];\r\n  }\r\n  /** Get method for matrix and vector order */\r\n  public order(): number {\r\n    return this._aDiag.length;\r\n  }\r\n  /** Compute product of AX and save as B */\r\n  public multiplyAX(): boolean {\r\n    if (this._dataState === DataState.FactorFailed) {\r\n      return false;\r\n    } else if (this._dataState === DataState.FactorOK) {\r\n      const n = this._aDiag.length;\r\n      const nm1 = n - 1;\r\n      for (let i = 0; i < nm1; i++) {\r\n        this._b[i] = this._aDiag[i] * this._x[i] + this._aRight[i] * this._x[i + 1];\r\n      }\r\n      this._b[nm1] = this._aDiag[nm1] * this._x[nm1];\r\n\r\n      for (let i = nm1; i > 0; i--) {\r\n        this._b[i] += this._aLeft[i] * this._b[i - 1];\r\n      }\r\n\r\n      return true;\r\n    } else {\r\n      const n = this._aDiag.length;\r\n      const nm1 = n - 1;\r\n      this._b[0] = this._aDiag[0] * this._x[0] + this._aRight[0] * this._x[1];\r\n      let i;\r\n      for (i = 1; i < nm1; i++) {\r\n        this._b[i] = this._aLeft[i] * this._x[i - 1] + this._aDiag[i] * this._x[i] + this._aRight[i] * this._x[i + 1];\r\n      }\r\n      this._b[nm1] = this._aLeft[nm1] * this._x[n - 2] + this._aDiag[i] * this._x[nm1];\r\n      return true;\r\n    }\r\n  }\r\n\r\n  /** Compute product of AX and save as B */\r\n  public multiplyAXPoints(pointX: Point3d[], pointB: Point3d[]): boolean {\r\n    pointB.length = 0;\r\n    while (pointB.length < pointX.length)\r\n      pointB.push(Point3d.create());\r\n    pointB.length = pointX.length;\r\n\r\n    if (this._dataState === DataState.FactorFailed) {\r\n      return false;\r\n    } else if (this._dataState === DataState.FactorOK) {\r\n\r\n      const n = this._aDiag.length;\r\n      const nm1 = n - 1;\r\n      for (let i = 0; i < nm1; i++) {\r\n        Point3d.createAdd2Scaled(pointX[i], this._aDiag[i], pointX[i + 1], this._aRight[i], pointB[i]);\r\n      }\r\n      Point3d.createScale(pointX[nm1], this._aDiag[nm1], pointB[nm1]);\r\n\r\n      for (let i = nm1; i > 0; i--) {\r\n        pointB[i].plusScaled(pointB[i - 1], this._aLeft[i], pointB[i]);\r\n      }\r\n\r\n      return true;\r\n    } else {\r\n      const n = this._aDiag.length;\r\n      const nm1 = n - 1;\r\n      Point3d.createAdd2Scaled(pointX[0], this._aDiag[0], pointX[1], this._aRight[0], pointB[0]);\r\n      let i;\r\n      for (i = 1; i < nm1; i++) {\r\n        Point3d.createAdd3Scaled(\r\n          pointX[i - 1], this._aLeft[i], pointX[i], this._aDiag[i],\r\n          pointX[i + 1], this._aRight[i],\r\n          pointB[i]);\r\n      }\r\n      Point3d.createAdd2Scaled(pointX[n - 2], this._aLeft[nm1], pointX[nm1], this._aDiag[nm1], pointB[nm1]);\r\n      return true;\r\n    }\r\n  }\r\n\r\n  /** Multiply the stored factors together to return to plain matrix form */\r\n  public defactor(): boolean {\r\n    if (this._dataState === DataState.RawMatrix) {\r\n      return true;\r\n    }\r\n    if (this._dataState === DataState.FactorFailed) {\r\n      return false;\r\n    }\r\n    const n = this._aDiag.length;\r\n    const nm1 = n - 1;\r\n\r\n    for (let i = nm1; i > 0; i--) {\r\n      this._aDiag[i] += this._aLeft[i] * this._aRight[i - 1];\r\n      this._aLeft[i] *= this._aDiag[i - 1];\r\n    }\r\n    this._dataState = DataState.RawMatrix;\r\n    return true;\r\n  }\r\n  /** Factor the tridiagonal matrix to LU parts. b, x, not altered */\r\n  public factor(): boolean {\r\n    if (this._dataState === DataState.FactorOK) {\r\n      return true;\r\n    }\r\n    if (this._dataState !== DataState.RawMatrix) {\r\n      return false;\r\n    }\r\n    this._dataState = DataState.FactorFailed;\r\n\r\n    const n1 = this._aDiag.length - 1;    // Last pivot index\r\n    // Eliminate in subdiagonal.\r\n    for (let i = 0; i < n1; i++) {\r\n      const r = Geometry.conditionalDivideFraction(this._aLeft[i + 1], this._aDiag[i]);\r\n      if (r === undefined)\r\n        return false;\r\n      this._aLeft[i + 1] = r;\r\n      this._aDiag[i + 1] -= r * this._aRight[i];\r\n    }\r\n    this._dataState = DataState.FactorOK;\r\n    return true;\r\n  }\r\n  /** Solve AX=B. A is left in factored state. B unchanged. */\r\n  public factorAndBackSubstitute(): boolean {\r\n    const n = this._aDiag.length;\r\n    const n1 = n - 1;\r\n    if (!this.factor())\r\n      return false;\r\n\r\n    // Apply L inverse to B, same sequence as was done to A:\r\n    for (let i = 0; i < n; i++) {\r\n      this._x[i] = this._b[i];\r\n    }\r\n    for (let i = 1; i < n; i++) {\r\n      this._x[i] -= this._aLeft[i] * this._x[i - 1];\r\n    }\r\n\r\n    // Print (\"LU  L Inverse B B\");\r\n    // overwrite X with solution of U * X = L inverse B, where RHS is already in X...\r\n    // All diagonals are known to be nonzero. Really.  Really???\r\n    this._x[n1] /= this._aDiag[n1];\r\n\r\n    for (let i = n1 - 1; i >= 0; i--) {\r\n      this._x[i] = (this._x[i] - this._aRight[i] * this._x[i + 1]) / this._aDiag[i];\r\n    }\r\n\r\n    return true;\r\n  }\r\n  /** Solve AX=B. A is left in factored state. B unchanged. vectorB and vectorX may be the same array */\r\n  public factorAndBackSubstitutePointArrays(vectorB: Point3d[], vectorX: Point3d[]): boolean {\r\n    const n = this._aDiag.length;\r\n    if (vectorB.length < n)\r\n      return false;\r\n\r\n    while (vectorX.length < n)\r\n      vectorX.push(Point3d.create(0, 0, 0));\r\n    vectorX.length = n;\r\n    const n1 = n - 1;\r\n    if (!this.factor())\r\n      return false;\r\n\r\n    // Apply L inverse to B, same sequence as was done to A:\r\n    if (vectorB !== vectorX) {\r\n      for (let i = 0; i < n; i++) {\r\n        vectorX[i].setFrom(vectorB[i]);\r\n      }\r\n    }\r\n\r\n    let a: number;\r\n    let b: number;\r\n    for (let i = 1; i < n; i++) {\r\n      a = this._aLeft[i];\r\n      vectorX[i].x -= a * vectorX[i - 1].x;\r\n      vectorX[i].y -= a * vectorX[i - 1].y;\r\n      vectorX[i].z -= a * vectorX[i - 1].z;\r\n    }\r\n\r\n    // Print (\"LU  L inverse B\");\r\n    // overwrite X with solution of U * X = L inverse B, where RHS is already in X...\r\n    // All diagonals are known to be nonzero. Really.  Really???\r\n    b = 1.0 / this._aDiag[n1];\r\n    vectorX[n1].x *= b;\r\n    vectorX[n1].y *= b;\r\n    vectorX[n1].z *= b;\r\n\r\n    for (let i = n1 - 1; i >= 0; i--) {\r\n      a = this._aRight[i];\r\n      b = 1.0 / this._aDiag[i];\r\n      vectorX[i].x = (vectorX[i].x - a * vectorX[i + 1].x) * b;\r\n      vectorX[i].y = (vectorX[i].y - a * vectorX[i + 1].y) * b;\r\n      vectorX[i].z = (vectorX[i].z - a * vectorX[i + 1].z) * b;\r\n    }\r\n\r\n    return true;\r\n  }\r\n  /** Allocate a complete copy */\r\n  public copy(): TriDiagonalSystem {\r\n    const n = this._aDiag.length;\r\n    const B = new TriDiagonalSystem(n);\r\n    for (let i = 0; i < n; i++) {\r\n      B._aLeft[i] = this._aLeft[i];\r\n      B._aDiag[i] = this._aDiag[i];\r\n      B._aRight[i] = this._aRight[i];\r\n      B._x[i] = this._x[i];\r\n      B._b[i] = this._b[i];\r\n    }\r\n    B._dataState = this._dataState;\r\n    return B;\r\n  }\r\n\r\n  /** return an array form that may be useful for display ... */\r\n  public flatten(): any {\r\n    const n = this._aDiag.length;\r\n    const data = [];\r\n\r\n    for (let i = 0; i < n; i++) {\r\n      data.push(\r\n        [i, [this._aLeft[i], this._aDiag[i], this._aRight[i]], this._x[i], this._b[i]]);\r\n    }\r\n    return data;\r\n  }\r\n\r\n  /** return an array form that may be useful for display ... */\r\n  public flattenWithPoints(xyzB: Point3d[]): any {\r\n    const n = this._aDiag.length;\r\n    const data = [];\r\n\r\n    for (let i = 0; i < n; i++) {\r\n      data.push(\r\n        [i, [this._aLeft[i], this._aDiag[i], this._aRight[i]], this._x[i], xyzB[i].toJSON()]);\r\n    }\r\n    return data;\r\n  }\r\n}\r\n"]}

package/lib/cjs/numerics/UnionFind.js

@@ -17,6 +17,7 @@ exports.UnionFindContext = void 0;
  * @internal
  */
 class UnionFindContext {
+    _parentArray;
     /** Create a set initialized with numLeaf singleton subsets */
     constructor(numLeaf = 0) {
         this._parentArray = [];

package/lib/cjs/numerics/UnionFind.js.map

@@ -1 +1 @@
-{"version":3,"file":"UnionFind.js","sourceRoot":"","sources":["../../../src/numerics/UnionFind.ts"],"names":[],"mappings":";;;AAAA;;;+FAG+F;AAC/F;;;;;;;;;;GAUG;AACH,MAAa,gBAAgB;IAE3B,8DAA8D;IAC9D,YAAmB,UAAkB,CAAC;QACpC,IAAI,CAAC,YAAY,GAAG,EAAE,CAAC;QACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE;YAC9B,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC9B,CAAC;IACD,mCAAmC;IACnC,IAAW,MAAM,KAAa,OAAO,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC;IAChE,qDAAqD;IAC9C,YAAY,CAAC,KAAa;QAC/B,OAAO,CAAC,IAAI,KAAK,IAAI,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC;IACxD,CAAC;IACD,8CAA8C;IACvC,OAAO;QACZ,MAAM,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC;QACvC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC9B,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;OAKG;IACI,QAAQ,CAAC,KAAa;QAC3B,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC;YAC3B,OAAO,KAAK,CAAC;QACf,IAAI,YAAY,GAAG,KAAK,CAAC;QACzB,IAAI,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;QACzC,OAAO,SAAS,KAAK,YAAY,EAAE,CAAC;YAClC,YAAY,GAAG,SAAS,CAAC;YACzB,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,YAAY,CAAC,CAAC;QAC9C,CAAC;QACD,MAAM,SAAS,GAAG,YAAY,CAAC;QAC/B,wCAAwC;QACxC,YAAY,GAAG,KAAK,CAAC;QACrB,OAAO,YAAY,KAAK,SAAS,EAAE,CAAC;YAClC,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,YAAY,CAAC,CAAC;YAC5C,IAAI,CAAC,YAAY,CAAC,YAAY,CAAC,GAAG,SAAS,CAAC;YAC5C,YAAY,GAAG,SAAS,CAAC;QAC3B,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;;;OAKG;IACI,YAAY,CAAC,CAAS,EAAE,CAAS;QACtC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC;YAChD,OAAO,CAAC,CAAC;QACX,MAAM,UAAU,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACpC,MAAM,UAAU,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACpC,IAAI,UAAU,KAAK,UAAU;YAC3B,IAAI,CAAC,YAAY,CAAC,UAAU,CAAC,GAAG,UAAU,CAAC;QAC7C,4BAA4B;QAC5B,OAAO,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IAC1B,CAAC;IACD;;OAEG;IACI,SAAS,CAAC,KAAa;QAC5B,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC;YAC3B,OAAO,KAAK,CAAC;QACf,OAAO,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;IAClC,CAAC;IACD,+DAA+D;IACxD,UAAU;QACf,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,MAAM,OAAO,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC;QACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE;YAC9B,IAAI,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,KAAK,CAAC;gBAC5B,OAAO,EAAE,CAAC;QACd,OAAO,OAAO,CAAC;IACjB,CAAC;IACD,+DAA+D;IACxD,oBAAoB;QACzB,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,MAAM,OAAO,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC;QACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC;YACjC,MAAM,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YAC/B,IAAI,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,KAAK,CAAC;gBACvC,OAAO,EAAE,CAAC;QACd,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IACD;;OAEG;IACI,kBAAkB;QACvB,MAAM,KAAK,GAAG,EAAE,CAAC;QACjB,MAAM,OAAO,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC;QACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC;YACjC,IAAI,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,KAAK,CAAC;gBAC5B,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAClB,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;CACF;AAtGD,4CAsGC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n/**\r\n * Implement the classic UnionFind algorithm, viz https://en.wikipedia.org/wiki/Disjoint-set_data_structure\r\n * * Each of the entities being merged exists as an entry in an array.\r\n * * The index in the array is the (only!) identification of the entity.\r\n * * The array entry is the index of a parent in the merge process.\r\n * * New entries are created as singletons pointing to themselves.\r\n * * Merge (i,j) merges the collections containing entries (i) and (j) into a single collection.\r\n * * The merge process updates the indices \"above\" (i) and (j)\r\n * * The whole process is extraordinarily efficient regardless of the order that the (i,j) merges are announced.\r\n * @internal\r\n */\r\nexport class UnionFindContext {\r\n  private _parentArray: number[];\r\n  /** Create a set initialized with numLeaf singleton subsets */\r\n  public constructor(numLeaf: number = 0) {\r\n    this._parentArray = [];\r\n    for (let i = 0; i < numLeaf; i++)\r\n      this._parentArray.push(i);\r\n  }\r\n  /** Return the number of leaves. */\r\n  public get length(): number { return this._parentArray.length; }\r\n  /** test if index is within the valid index range. */\r\n  public isValidIndex(index: number): boolean {\r\n    return 0 <= index && index < this._parentArray.length;\r\n  }\r\n  /** Return the index of a new singleton set */\r\n  public addLeaf(): number {\r\n    const index = this._parentArray.length;\r\n    this._parentArray.push(index);\r\n    return index;\r\n  }\r\n  /**\r\n   * * follow links to parent\r\n   * * after finding the parent, repeat the search and reset parents along the way.\r\n   * * If index is invalid, return index unchanged.\r\n   * @param index start of search\r\n   */\r\n  public findRoot(index: number): number {\r\n    if (!this.isValidIndex(index))\r\n      return index;\r\n    let currentIndex = index;\r\n    let nextIndex = this._parentArray[index];\r\n    while (nextIndex !== currentIndex) {\r\n      currentIndex = nextIndex;\r\n      nextIndex = this._parentArray[currentIndex];\r\n    }\r\n    const rootIndex = currentIndex;\r\n    // sweep up again and shorten the paths.\r\n    currentIndex = index;\r\n    while (currentIndex !== rootIndex) {\r\n      nextIndex = this._parentArray[currentIndex];\r\n      this._parentArray[currentIndex] = rootIndex;\r\n      currentIndex = nextIndex;\r\n    }\r\n    return rootIndex;\r\n  }\r\n\r\n  /** Merge the subsets containing index (i) and (j)\r\n   * * Look up the root of each.\r\n   * * Fix up the path to the root so it points to the root.\r\n   * * Return the root index of the merged set.\r\n   * * If either index is invalid return index i with no changes.\r\n   */\r\n  public mergeSubsets(i: number, j: number): number {\r\n    if (!this.isValidIndex(i) || !this.isValidIndex(j))\r\n      return i;\r\n    const rootIndexI = this.findRoot(i);\r\n    const rootIndexJ = this.findRoot(j);\r\n    if (rootIndexI !== rootIndexJ)\r\n      this._parentArray[rootIndexI] = rootIndexJ;\r\n    // cleanup a little more ...\r\n    return this.findRoot(i);\r\n  }\r\n  /** Return the immediate parent of index (i), with no fixups\r\n   * * If index is invalid, return it.\r\n   */\r\n  public askParent(index: number): number {\r\n    if (!this.isValidIndex(index))\r\n      return index;\r\n    return this._parentArray[index];\r\n  }\r\n  /** Return the number of entries which are their own parent. */\r\n  public countRoots(): number {\r\n    let numRoot = 0;\r\n    const numLeaf = this._parentArray.length;\r\n    for (let i = 0; i < numLeaf; i++)\r\n      if (this._parentArray[i] === i)\r\n        numRoot++;\r\n    return numRoot;\r\n  }\r\n  /** Return the number of entries whose parent is not a root. */\r\n  public countNonTrivialPaths(): number {\r\n    let numLong = 0;\r\n    const numLeaf = this._parentArray.length;\r\n    for (let i = 0; i < numLeaf; i++) {\r\n      const j = this._parentArray[i];\r\n      if (j !== i && this._parentArray[j] !== j)\r\n        numLong++;\r\n    }\r\n    return numLong;\r\n  }\r\n  /** Return an array of all root indices.\r\n   * * This array is sorted.\r\n   */\r\n  public collectRootIndices(): number[] {\r\n    const roots = [];\r\n    const numLeaf = this._parentArray.length;\r\n    for (let i = 0; i < numLeaf; i++) {\r\n      if (this._parentArray[i] === i)\r\n        roots.push(i);\r\n    }\r\n    return roots;\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"UnionFind.js","sourceRoot":"","sources":["../../../src/numerics/UnionFind.ts"],"names":[],"mappings":";;;AAAA;;;+FAG+F;AAC/F;;;;;;;;;;GAUG;AACH,MAAa,gBAAgB;IACnB,YAAY,CAAW;IAC/B,8DAA8D;IAC9D,YAAmB,UAAkB,CAAC;QACpC,IAAI,CAAC,YAAY,GAAG,EAAE,CAAC;QACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE;YAC9B,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC9B,CAAC;IACD,mCAAmC;IACnC,IAAW,MAAM,KAAa,OAAO,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC;IAChE,qDAAqD;IAC9C,YAAY,CAAC,KAAa;QAC/B,OAAO,CAAC,IAAI,KAAK,IAAI,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC;IACxD,CAAC;IACD,8CAA8C;IACvC,OAAO;QACZ,MAAM,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC;QACvC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC9B,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;OAKG;IACI,QAAQ,CAAC,KAAa;QAC3B,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC;YAC3B,OAAO,KAAK,CAAC;QACf,IAAI,YAAY,GAAG,KAAK,CAAC;QACzB,IAAI,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;QACzC,OAAO,SAAS,KAAK,YAAY,EAAE,CAAC;YAClC,YAAY,GAAG,SAAS,CAAC;YACzB,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,YAAY,CAAC,CAAC;QAC9C,CAAC;QACD,MAAM,SAAS,GAAG,YAAY,CAAC;QAC/B,wCAAwC;QACxC,YAAY,GAAG,KAAK,CAAC;QACrB,OAAO,YAAY,KAAK,SAAS,EAAE,CAAC;YAClC,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,YAAY,CAAC,CAAC;YAC5C,IAAI,CAAC,YAAY,CAAC,YAAY,CAAC,GAAG,SAAS,CAAC;YAC5C,YAAY,GAAG,SAAS,CAAC;QAC3B,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;;;OAKG;IACI,YAAY,CAAC,CAAS,EAAE,CAAS;QACtC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC;YAChD,OAAO,CAAC,CAAC;QACX,MAAM,UAAU,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACpC,MAAM,UAAU,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACpC,IAAI,UAAU,KAAK,UAAU;YAC3B,IAAI,CAAC,YAAY,CAAC,UAAU,CAAC,GAAG,UAAU,CAAC;QAC7C,4BAA4B;QAC5B,OAAO,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IAC1B,CAAC;IACD;;OAEG;IACI,SAAS,CAAC,KAAa;QAC5B,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC;YAC3B,OAAO,KAAK,CAAC;QACf,OAAO,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;IAClC,CAAC;IACD,+DAA+D;IACxD,UAAU;QACf,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,MAAM,OAAO,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC;QACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE;YAC9B,IAAI,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,KAAK,CAAC;gBAC5B,OAAO,EAAE,CAAC;QACd,OAAO,OAAO,CAAC;IACjB,CAAC;IACD,+DAA+D;IACxD,oBAAoB;QACzB,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,MAAM,OAAO,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC;QACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC;YACjC,MAAM,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YAC/B,IAAI,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,KAAK,CAAC;gBACvC,OAAO,EAAE,CAAC;QACd,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IACD;;OAEG;IACI,kBAAkB;QACvB,MAAM,KAAK,GAAG,EAAE,CAAC;QACjB,MAAM,OAAO,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC;QACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC;YACjC,IAAI,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,KAAK,CAAC;gBAC5B,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAClB,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;CACF;AAtGD,4CAsGC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n/**\r\n * Implement the classic UnionFind algorithm, viz https://en.wikipedia.org/wiki/Disjoint-set_data_structure\r\n * * Each of the entities being merged exists as an entry in an array.\r\n * * The index in the array is the (only!) identification of the entity.\r\n * * The array entry is the index of a parent in the merge process.\r\n * * New entries are created as singletons pointing to themselves.\r\n * * Merge (i,j) merges the collections containing entries (i) and (j) into a single collection.\r\n * * The merge process updates the indices \"above\" (i) and (j)\r\n * * The whole process is extraordinarily efficient regardless of the order that the (i,j) merges are announced.\r\n * @internal\r\n */\r\nexport class UnionFindContext {\r\n  private _parentArray: number[];\r\n  /** Create a set initialized with numLeaf singleton subsets */\r\n  public constructor(numLeaf: number = 0) {\r\n    this._parentArray = [];\r\n    for (let i = 0; i < numLeaf; i++)\r\n      this._parentArray.push(i);\r\n  }\r\n  /** Return the number of leaves. */\r\n  public get length(): number { return this._parentArray.length; }\r\n  /** test if index is within the valid index range. */\r\n  public isValidIndex(index: number): boolean {\r\n    return 0 <= index && index < this._parentArray.length;\r\n  }\r\n  /** Return the index of a new singleton set */\r\n  public addLeaf(): number {\r\n    const index = this._parentArray.length;\r\n    this._parentArray.push(index);\r\n    return index;\r\n  }\r\n  /**\r\n   * * follow links to parent\r\n   * * after finding the parent, repeat the search and reset parents along the way.\r\n   * * If index is invalid, return index unchanged.\r\n   * @param index start of search\r\n   */\r\n  public findRoot(index: number): number {\r\n    if (!this.isValidIndex(index))\r\n      return index;\r\n    let currentIndex = index;\r\n    let nextIndex = this._parentArray[index];\r\n    while (nextIndex !== currentIndex) {\r\n      currentIndex = nextIndex;\r\n      nextIndex = this._parentArray[currentIndex];\r\n    }\r\n    const rootIndex = currentIndex;\r\n    // sweep up again and shorten the paths.\r\n    currentIndex = index;\r\n    while (currentIndex !== rootIndex) {\r\n      nextIndex = this._parentArray[currentIndex];\r\n      this._parentArray[currentIndex] = rootIndex;\r\n      currentIndex = nextIndex;\r\n    }\r\n    return rootIndex;\r\n  }\r\n\r\n  /** Merge the subsets containing index (i) and (j)\r\n   * * Look up the root of each.\r\n   * * Fix up the path to the root so it points to the root.\r\n   * * Return the root index of the merged set.\r\n   * * If either index is invalid return index i with no changes.\r\n   */\r\n  public mergeSubsets(i: number, j: number): number {\r\n    if (!this.isValidIndex(i) || !this.isValidIndex(j))\r\n      return i;\r\n    const rootIndexI = this.findRoot(i);\r\n    const rootIndexJ = this.findRoot(j);\r\n    if (rootIndexI !== rootIndexJ)\r\n      this._parentArray[rootIndexI] = rootIndexJ;\r\n    // cleanup a little more ...\r\n    return this.findRoot(i);\r\n  }\r\n  /** Return the immediate parent of index (i), with no fixups\r\n   * * If index is invalid, return it.\r\n   */\r\n  public askParent(index: number): number {\r\n    if (!this.isValidIndex(index))\r\n      return index;\r\n    return this._parentArray[index];\r\n  }\r\n  /** Return the number of entries which are their own parent. */\r\n  public countRoots(): number {\r\n    let numRoot = 0;\r\n    const numLeaf = this._parentArray.length;\r\n    for (let i = 0; i < numLeaf; i++)\r\n      if (this._parentArray[i] === i)\r\n        numRoot++;\r\n    return numRoot;\r\n  }\r\n  /** Return the number of entries whose parent is not a root. */\r\n  public countNonTrivialPaths(): number {\r\n    let numLong = 0;\r\n    const numLeaf = this._parentArray.length;\r\n    for (let i = 0; i < numLeaf; i++) {\r\n      const j = this._parentArray[i];\r\n      if (j !== i && this._parentArray[j] !== j)\r\n        numLong++;\r\n    }\r\n    return numLong;\r\n  }\r\n  /** Return an array of all root indices.\r\n   * * This array is sorted.\r\n   */\r\n  public collectRootIndices(): number[] {\r\n    const roots = [];\r\n    const numLeaf = this._parentArray.length;\r\n    for (let i = 0; i < numLeaf; i++) {\r\n      if (this._parentArray[i] === i)\r\n        roots.push(i);\r\n    }\r\n    return roots;\r\n  }\r\n}\r\n"]}

package/lib/cjs/numerics/UsageSums.js

@@ -31,6 +31,16 @@ const Range_1 = require("../geometry3d/Range");
  * @internal
  */
 class UsageSums {
+    /** number of values accumulated. */
+    _count;
+    /** Sum of values sent to `accumulate` (with origin subtracted away) */
+    _sumX;
+    _sumXX;
+    _minMax;
+    /** working origin.
+     * * All other values -- sum0, sum1, sum2, min,max -- are "from this origin"
+     */
+    _origin;
     /** Constructor:
      * * All sums 0
      * * min and max set to extreme values.

package/lib/cjs/numerics/UsageSums.js.map

@@ -1 +1 @@
-{"version":3,"file":"UsageSums.js","sourceRoot":"","sources":["../../../src/numerics/UsageSums.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F,0CAAuC;AACvC,+CAA8C;AAE9C;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,MAAa,SAAS;IAYpB;;;;OAIG;IACH,YAAmB,SAAiB,CAAC;QACnC,IAAI,CAAC,OAAO,GAAG,eAAO,CAAC,UAAU,EAAE,CAAC;QACpC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;QAC3C,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC;IACxB,CAAC;IACD,wCAAwC;IACxC,IAAW,KAAK,KAAa,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IAClD;;OAEG;IACH,IAAW,IAAI,KAAa,OAAO,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACtF;;OAEG;IACH,IAAW,UAAU,KAAa,OAAO,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC7F,IAAW,MAAM,KAAc,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;IAE7D;;;OAGG;IACH,IAAW,iBAAiB;QAC1B,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC;YACjB,OAAO,GAAG,CAAC;QACb,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACvB,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QAC1B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QACxB,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,KAAK,GAAG,CAAC,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,CAAC,MAAM,GAAG,IAAI,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC;IACxF,CAAC;IACD;;OAEG;IACI,SAAS;QACd,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;QAC3C,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,CAAC;IACzB,CAAC;IACD;;OAEG;IACH,IAAW,MAAM,KAAa,OAAO,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;IACpD;;;;OAIG;IACI,SAAS,CAAC,MAAc;QAC7B,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC;IACxB,CAAC;IACD;;;OAGG;IACI,kBAAkB,CAAC,MAAc;QACtC,MAAM,KAAK,GAAG,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC;QACpC,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC;QACtB,kEAAkE;QAClE,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,GAAG,KAAK,GAAG,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,MAAM,GAAG,KAAK,GAAG,KAAK,CAAC;QACjF,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QAC9C,IAAI,CAAC,OAAO,CAAC,eAAe,CAAC,CAAC,KAAK,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;IACrD,CAAC;IACD,gCAAgC;IACzB,UAAU,CAAC,CAAS;QACzB,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC;QACrB,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC;QACjB,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC;QAChB,IAAI,CAAC,MAAM,IAAI,CAAC,GAAG,CAAC,CAAC;QACrB,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IAC1B,CAAC;IACD,gCAAgC;IACzB,eAAe,CAAC,MAAgB;QACrC,KAAK,MAAM,CAAC,IAAI,MAAM;YACpB,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;IACvB,CAAC;IACD,sDAAsD;IAC/C,KAAK,CAAC,MAAkB;QAC7B,IAAI,CAAC,MAAM;YACT,MAAM,GAAG,IAAI,SAAS,EAAE,CAAC;QAC3B,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QACnC,MAAM,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;QAC5B,MAAM,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC;QAC9B,MAAM,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;QAC1B,MAAM,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;QAC5B,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,2BAA2B;IACpB,aAAa,CAAC,KAAgB;QACnC,OAAO,mBAAQ,CAAC,mBAAmB,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC;eACvD,mBAAQ,CAAC,mBAAmB,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,MAAM,CAAC;eACvD,mBAAQ,CAAC,mBAAmB,CAAC,IAAI,CAAC,OAAO,EAAE,KAAK,CAAC,OAAO,CAAC;eACzD,IAAI,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM;eAC5B,IAAI,CAAC,OAAO,CAAC,aAAa,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;IACjD,CAAC;CACF;AA7GD,8BA6GC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n\r\nimport { Geometry } from \"../Geometry\";\r\nimport { Range1d } from \"../geometry3d/Range\";\r\n\r\n/**\r\n * Accumulator for computing average and standard deviations.\r\n * * Usual usage pattern:\r\n *   * create with `sums = new UsageSums ()`\r\n *   * announce data values with any combination of\r\n *      * `sums.accumulate (x: number)`\r\n *      * `sums.accumulateArray (data: numberArray)`\r\n *   * query properties at any time:\r\n *      * `sums.mean`\r\n *      * `sums.count`\r\n *      * `sums.meanSquare`\r\n *      * `sums.standardDeviation`\r\n *      * `sums.minMax`\r\n * * Optional `origin`\r\n *   * if `origin` is nonzero:\r\n *      * when a value `x` is announced to the `accumulate(x)` method, the value used for sums is `(x-origin)`\r\n *   * All queries (mean, minMax, meanSquare, standardDeviation) return values relative to the origin.\r\n *   * The origin can be reset in two different ways:\r\n *     * `setOrigin(a)` sets the saved origin value to `a`, but leaves sums unchanged.\r\n *       * This affects subsequence how sums are changed by `announce(x)`\r\n *     * `shiftOriginAndSums` sets the origin (like `sums.setOrigin (a))` and also corrects all sums and minMax so they appear that the new origin had been in effect during all prior `accumulate(x)` calls.\r\n * @internal\r\n */\r\nexport class UsageSums {\r\n  /** number of values accumulated. */\r\n  private _count: number;\r\n  /** Sum of values sent to `accumulate` (with origin subtracted away) */\r\n  private _sumX: number;\r\n  private _sumXX: number;\r\n  private _minMax: Range1d;\r\n  /** working origin.\r\n   * * All other values -- sum0, sum1, sum2, min,max -- are \"from this origin\"\r\n   */\r\n  private _origin: number;\r\n\r\n  /** Constructor:\r\n   * * All sums 0\r\n   * * min and max set to extreme values.\r\n   * * origin assigned.\r\n   */\r\n  public constructor(origin: number = 0) {\r\n    this._minMax = Range1d.createNull();\r\n    this._count = this._sumX = this._sumXX = 0;\r\n    this._origin = origin;\r\n  }\r\n  /** Return the number of samples seen */\r\n  public get count(): number { return this._count; }\r\n  /** return the mean of all samples.\r\n   * * Return 0 if no samples\r\n   */\r\n  public get mean(): number { return this._count > 0 ? this._sumX / this._count : 0.0; }\r\n  /** Return the mean of  squared samples.\r\n   * * Return 0 if no samples.\r\n   */\r\n  public get meanSquare(): number { return this._count > 0 ? this._sumXX / this._count : 0.0; }\r\n  public get minMax(): Range1d { return this._minMax.clone(); }\r\n\r\n  /**\r\n   * Return the \"biased standard deviation\" (https://en.wikipedia.org/wiki/Standard_deviation)\r\n   * * This is zero if count is zero.\r\n   */\r\n  public get standardDeviation(): number {\r\n    if (this._count < 1)\r\n      return 0.0;\r\n    const xBar = this.mean;\r\n    const sumXX = this._sumXX;\r\n    const sumX = this._sumX;\r\n    return Math.sqrt((sumXX - 2 * xBar * sumX + this._count * xBar * xBar) / this._count);\r\n  }\r\n  /** Reinitialize all sums.\r\n   * * origin is unchanged\r\n   */\r\n  public clearSums() {\r\n    this._count = this._sumX = this._sumXX = 0;\r\n    this._minMax.setNull();\r\n  }\r\n  /**\r\n   * return the origin being used in the `accumulate(x)` method.\r\n   */\r\n  public get origin(): number { return this._origin; }\r\n  /**\r\n   * Reset the origin.\r\n   * * Former sums are unchanged !!\r\n   * @param origin new origin\r\n   */\r\n  public setOrigin(origin: number) {\r\n    this._origin = origin;\r\n  }\r\n  /**\r\n   * * reset the origin\r\n   * * adjust all sums to what they would be if the new origin had been in effect.\r\n   */\r\n  public shiftOriginAndSums(origin: number) {\r\n    const delta = origin - this._origin;\r\n    this._origin = origin;\r\n    // adjust sumXX first to get old sumX value before it is modified.\r\n    this._sumXX = this._sumXX - 2 * delta * this._sumX + this._count * delta * delta;\r\n    this._sumX = this._sumX - this._count * delta;\r\n    this._minMax.cloneTranslated(-delta, this._minMax);\r\n  }\r\n  /** Accumulate a single value */\r\n  public accumulate(x: number) {\r\n    x = x - this._origin;\r\n    this._count += 1;\r\n    this._sumX += x;\r\n    this._sumXX += x * x;\r\n    this._minMax.extendX(x);\r\n  }\r\n  /** Accumulate a single value */\r\n  public accumulateArray(xArray: number[]) {\r\n    for (const x of xArray)\r\n      this.accumulate(x);\r\n  }\r\n  /** Clone all content (origin, count, sums, minMax) */\r\n  public clone(result?: UsageSums): UsageSums {\r\n    if (!result)\r\n      result = new UsageSums();\r\n    this._minMax.clone(result._minMax);\r\n    result._count = this._count;\r\n    result._origin = this._origin;\r\n    result._sumX = this._sumX;\r\n    result._sumXX = this._sumXX;\r\n    return result;\r\n  }\r\n  /** Compare all content. */\r\n  public isAlmostEqual(other: UsageSums): boolean {\r\n    return Geometry.isAlmostEqualNumber(this._sumX, other._sumX)\r\n      && Geometry.isAlmostEqualNumber(this._sumXX, other._sumXX)\r\n      && Geometry.isAlmostEqualNumber(this._origin, other._origin)\r\n      && this._count === other._count\r\n      && this._minMax.isAlmostEqual(other._minMax);\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"UsageSums.js","sourceRoot":"","sources":["../../../src/numerics/UsageSums.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F,0CAAuC;AACvC,+CAA8C;AAE9C;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,MAAa,SAAS;IACpB,oCAAoC;IAC5B,MAAM,CAAS;IACvB,uEAAuE;IAC/D,KAAK,CAAS;IACd,MAAM,CAAS;IACf,OAAO,CAAU;IACzB;;OAEG;IACK,OAAO,CAAS;IAExB;;;;OAIG;IACH,YAAmB,SAAiB,CAAC;QACnC,IAAI,CAAC,OAAO,GAAG,eAAO,CAAC,UAAU,EAAE,CAAC;QACpC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;QAC3C,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC;IACxB,CAAC;IACD,wCAAwC;IACxC,IAAW,KAAK,KAAa,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IAClD;;OAEG;IACH,IAAW,IAAI,KAAa,OAAO,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACtF;;OAEG;IACH,IAAW,UAAU,KAAa,OAAO,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC7F,IAAW,MAAM,KAAc,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;IAE7D;;;OAGG;IACH,IAAW,iBAAiB;QAC1B,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC;YACjB,OAAO,GAAG,CAAC;QACb,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACvB,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QAC1B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QACxB,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,KAAK,GAAG,CAAC,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,CAAC,MAAM,GAAG,IAAI,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC;IACxF,CAAC;IACD;;OAEG;IACI,SAAS;QACd,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;QAC3C,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,CAAC;IACzB,CAAC;IACD;;OAEG;IACH,IAAW,MAAM,KAAa,OAAO,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;IACpD;;;;OAIG;IACI,SAAS,CAAC,MAAc;QAC7B,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC;IACxB,CAAC;IACD;;;OAGG;IACI,kBAAkB,CAAC,MAAc;QACtC,MAAM,KAAK,GAAG,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC;QACpC,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC;QACtB,kEAAkE;QAClE,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,GAAG,KAAK,GAAG,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,MAAM,GAAG,KAAK,GAAG,KAAK,CAAC;QACjF,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QAC9C,IAAI,CAAC,OAAO,CAAC,eAAe,CAAC,CAAC,KAAK,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;IACrD,CAAC;IACD,gCAAgC;IACzB,UAAU,CAAC,CAAS;QACzB,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC;QACrB,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC;QACjB,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC;QAChB,IAAI,CAAC,MAAM,IAAI,CAAC,GAAG,CAAC,CAAC;QACrB,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IAC1B,CAAC;IACD,gCAAgC;IACzB,eAAe,CAAC,MAAgB;QACrC,KAAK,MAAM,CAAC,IAAI,MAAM;YACpB,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;IACvB,CAAC;IACD,sDAAsD;IAC/C,KAAK,CAAC,MAAkB;QAC7B,IAAI,CAAC,MAAM;YACT,MAAM,GAAG,IAAI,SAAS,EAAE,CAAC;QAC3B,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QACnC,MAAM,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;QAC5B,MAAM,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC;QAC9B,MAAM,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;QAC1B,MAAM,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;QAC5B,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,2BAA2B;IACpB,aAAa,CAAC,KAAgB;QACnC,OAAO,mBAAQ,CAAC,mBAAmB,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC;eACvD,mBAAQ,CAAC,mBAAmB,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,MAAM,CAAC;eACvD,mBAAQ,CAAC,mBAAmB,CAAC,IAAI,CAAC,OAAO,EAAE,KAAK,CAAC,OAAO,CAAC;eACzD,IAAI,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM;eAC5B,IAAI,CAAC,OAAO,CAAC,aAAa,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;IACjD,CAAC;CACF;AA7GD,8BA6GC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n\r\nimport { Geometry } from \"../Geometry\";\r\nimport { Range1d } from \"../geometry3d/Range\";\r\n\r\n/**\r\n * Accumulator for computing average and standard deviations.\r\n * * Usual usage pattern:\r\n *   * create with `sums = new UsageSums ()`\r\n *   * announce data values with any combination of\r\n *      * `sums.accumulate (x: number)`\r\n *      * `sums.accumulateArray (data: numberArray)`\r\n *   * query properties at any time:\r\n *      * `sums.mean`\r\n *      * `sums.count`\r\n *      * `sums.meanSquare`\r\n *      * `sums.standardDeviation`\r\n *      * `sums.minMax`\r\n * * Optional `origin`\r\n *   * if `origin` is nonzero:\r\n *      * when a value `x` is announced to the `accumulate(x)` method, the value used for sums is `(x-origin)`\r\n *   * All queries (mean, minMax, meanSquare, standardDeviation) return values relative to the origin.\r\n *   * The origin can be reset in two different ways:\r\n *     * `setOrigin(a)` sets the saved origin value to `a`, but leaves sums unchanged.\r\n *       * This affects subsequence how sums are changed by `announce(x)`\r\n *     * `shiftOriginAndSums` sets the origin (like `sums.setOrigin (a))` and also corrects all sums and minMax so they appear that the new origin had been in effect during all prior `accumulate(x)` calls.\r\n * @internal\r\n */\r\nexport class UsageSums {\r\n  /** number of values accumulated. */\r\n  private _count: number;\r\n  /** Sum of values sent to `accumulate` (with origin subtracted away) */\r\n  private _sumX: number;\r\n  private _sumXX: number;\r\n  private _minMax: Range1d;\r\n  /** working origin.\r\n   * * All other values -- sum0, sum1, sum2, min,max -- are \"from this origin\"\r\n   */\r\n  private _origin: number;\r\n\r\n  /** Constructor:\r\n   * * All sums 0\r\n   * * min and max set to extreme values.\r\n   * * origin assigned.\r\n   */\r\n  public constructor(origin: number = 0) {\r\n    this._minMax = Range1d.createNull();\r\n    this._count = this._sumX = this._sumXX = 0;\r\n    this._origin = origin;\r\n  }\r\n  /** Return the number of samples seen */\r\n  public get count(): number { return this._count; }\r\n  /** return the mean of all samples.\r\n   * * Return 0 if no samples\r\n   */\r\n  public get mean(): number { return this._count > 0 ? this._sumX / this._count : 0.0; }\r\n  /** Return the mean of  squared samples.\r\n   * * Return 0 if no samples.\r\n   */\r\n  public get meanSquare(): number { return this._count > 0 ? this._sumXX / this._count : 0.0; }\r\n  public get minMax(): Range1d { return this._minMax.clone(); }\r\n\r\n  /**\r\n   * Return the \"biased standard deviation\" (https://en.wikipedia.org/wiki/Standard_deviation)\r\n   * * This is zero if count is zero.\r\n   */\r\n  public get standardDeviation(): number {\r\n    if (this._count < 1)\r\n      return 0.0;\r\n    const xBar = this.mean;\r\n    const sumXX = this._sumXX;\r\n    const sumX = this._sumX;\r\n    return Math.sqrt((sumXX - 2 * xBar * sumX + this._count * xBar * xBar) / this._count);\r\n  }\r\n  /** Reinitialize all sums.\r\n   * * origin is unchanged\r\n   */\r\n  public clearSums() {\r\n    this._count = this._sumX = this._sumXX = 0;\r\n    this._minMax.setNull();\r\n  }\r\n  /**\r\n   * return the origin being used in the `accumulate(x)` method.\r\n   */\r\n  public get origin(): number { return this._origin; }\r\n  /**\r\n   * Reset the origin.\r\n   * * Former sums are unchanged !!\r\n   * @param origin new origin\r\n   */\r\n  public setOrigin(origin: number) {\r\n    this._origin = origin;\r\n  }\r\n  /**\r\n   * * reset the origin\r\n   * * adjust all sums to what they would be if the new origin had been in effect.\r\n   */\r\n  public shiftOriginAndSums(origin: number) {\r\n    const delta = origin - this._origin;\r\n    this._origin = origin;\r\n    // adjust sumXX first to get old sumX value before it is modified.\r\n    this._sumXX = this._sumXX - 2 * delta * this._sumX + this._count * delta * delta;\r\n    this._sumX = this._sumX - this._count * delta;\r\n    this._minMax.cloneTranslated(-delta, this._minMax);\r\n  }\r\n  /** Accumulate a single value */\r\n  public accumulate(x: number) {\r\n    x = x - this._origin;\r\n    this._count += 1;\r\n    this._sumX += x;\r\n    this._sumXX += x * x;\r\n    this._minMax.extendX(x);\r\n  }\r\n  /** Accumulate a single value */\r\n  public accumulateArray(xArray: number[]) {\r\n    for (const x of xArray)\r\n      this.accumulate(x);\r\n  }\r\n  /** Clone all content (origin, count, sums, minMax) */\r\n  public clone(result?: UsageSums): UsageSums {\r\n    if (!result)\r\n      result = new UsageSums();\r\n    this._minMax.clone(result._minMax);\r\n    result._count = this._count;\r\n    result._origin = this._origin;\r\n    result._sumX = this._sumX;\r\n    result._sumXX = this._sumXX;\r\n    return result;\r\n  }\r\n  /** Compare all content. */\r\n  public isAlmostEqual(other: UsageSums): boolean {\r\n    return Geometry.isAlmostEqualNumber(this._sumX, other._sumX)\r\n      && Geometry.isAlmostEqualNumber(this._sumXX, other._sumXX)\r\n      && Geometry.isAlmostEqualNumber(this._origin, other._origin)\r\n      && this._count === other._count\r\n      && this._minMax.isAlmostEqual(other._minMax);\r\n  }\r\n}\r\n"]}

package/lib/cjs/polyface/AuxData.js

@@ -36,6 +36,10 @@ var AuxChannelDataType;
  * @public
 */
 class AuxChannelData {
+    /** The input value for this data. */
+    input;
+    /** The vertex values for this data. A single value per vertex for scalar and distance types and 3 values (x,y,z) for normal or vector channels. */
+    values;
     /** Constructor. If `values` is a number array, it is captured.  */
     constructor(input, values) {
         this.input = input;
@@ -69,6 +73,14 @@ exports.AuxChannelData = AuxChannelData;
  * @public
 */
 class AuxChannel {
+    /** An array of [[AuxChannelData]] that represents the vertex data at one or more input values. */
+    data;
+    /** The type of data stored in this channel. */
+    dataType;
+    /** The channel name. This is used to present the [[AuxChannel]] to the user and also to select the [[AuxChannel]] for display from AnalysisStyle */
+    name;
+    /** The input name. */
+    inputName;
     /** Constructor with CAPTURED inputs. */
     constructor(data, dataType, name, inputName) {
         this.data = data;
@@ -155,6 +167,10 @@ exports.AuxChannel = AuxChannel;
  * @public
  */
 class PolyfaceAuxData {
+    /** Array with one or more channels of auxiliary data for the associated polyface. */
+    channels;
+    /** The indices (shared by all data in all channels) mapping the data to the mesh facets. */
+    indices;
     /** Constructor with CAPTURED inputs. */
     constructor(channels, indices) {
         this.channels = channels;

package/lib/cjs/polyface/AuxData.js.map

@@ -1 +1 @@
-{"version":3,"file":"AuxData.js","sourceRoot":"","sources":["../../../src/polyface/AuxData.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAS/F,mEAAwD;AACxD,6DAAyD;AACzD,yCAAyC;AACzC,+CAAuD;AAEvD;;;GAGG;AACH,IAAY,kBAiBX;AAjBD,WAAY,kBAAkB;IAC5B;;OAEG;IACH,+DAAU,CAAA;IACV;;OAEG;IACH,mEAAY,CAAA;IACZ;;OAEG;IACH,+DAAU,CAAA;IACV;;OAEG;IACH,+DAAU,CAAA;AACZ,CAAC,EAjBW,kBAAkB,kCAAlB,kBAAkB,QAiB7B;AAED;;EAEE;AACF,MAAa,cAAc;IAMzB,mEAAmE;IACnE,YAAY,KAAa,EAAE,MAA+B;QACxD,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,MAAM,YAAY,YAAY,EAAE,CAAC;YACnC,IAAI,CAAC,MAAM,GAAG,EAAE,CAAC;YACjB,KAAK,MAAM,CAAC,IAAI,MAAM;gBAAE,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9C,CAAC;;YACC,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;IACzB,CAAC;IAED,sIAAsI;IAC/H,UAAU,CAAC,KAAqB,EAAE,SAAiB,EAAE,UAAkB,EAAE,SAAiB;QAC/F,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE;YAChC,IAAI,CAAC,MAAM,CAAC,SAAS,GAAG,SAAS,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,UAAU,GAAG,SAAS,GAAG,CAAC,CAAC,CAAC;IACtF,CAAC;IAED,yBAAyB;IAClB,KAAK;QACV,OAAO,IAAI,cAAc,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC;IAC7D,CAAC;IAED;;OAEG;IACI,aAAa,CAAC,KAAqB,EAAE,GAAY;QACtD,MAAM,SAAS,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC;QACrC,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,SAAS,IAAI,0BAAW,CAAC,aAAa,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;IAC3H,CAAC;CACF;AAlCD,wCAkCC;AAED;;EAEE;AACF,MAAa,UAAU;IAUrB,wCAAwC;IACxC,YAAmB,IAAsB,EAAE,QAA4B,EAAE,IAAa,EAAE,SAAkB;QACxG,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;IAC7B,CAAC;IAED,0BAA0B;IACnB,KAAK;QACV,MAAM,UAAU,GAAG,EAAE,CAAC;QACtB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,IAAI;YAAE,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC;QAC5D,OAAO,IAAI,UAAU,CAAC,UAAU,EAAE,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;IAC9E,CAAC;IAED,yCAAyC;IAClC,aAAa,CAAC,KAAiB,EAAE,GAAY;QAClD,IAAI,IAAI,CAAC,QAAQ,KAAK,KAAK,CAAC,QAAQ;YAClC,IAAI,CAAC,IAAI,KAAK,KAAK,CAAC,IAAI;YACxB,IAAI,CAAC,SAAS,KAAK,KAAK,CAAC,SAAS;YAClC,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,KAAK,CAAC,IAAI,CAAC,MAAM;YACtC,OAAO,KAAK,CAAC;QAEf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE;YACvC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC;gBACjD,OAAO,KAAK,CAAC;QAEjB,OAAO,IAAI,CAAC;IACd,CAAC;IAED,8CAA8C;IACvC,MAAM,CAAC,QAAQ,CAAC,QAA4B;QACjD,OAAO,QAAQ,KAAK,kBAAkB,CAAC,QAAQ,IAAI,QAAQ,KAAK,kBAAkB,CAAC,MAAM,CAAC;IAC5F,CAAC;IAED,mEAAmE;IACnE,IAAW,QAAQ;QACjB,OAAO,UAAU,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IAC5C,CAAC;IAED,iFAAiF;IAC1E,MAAM,CAAC,eAAe,CAAC,QAA4B;QACxD,OAAO,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzC,CAAC;IAED,oFAAoF;IACpF,IAAW,eAAe;QACxB,OAAO,UAAU,CAAC,eAAe,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IACnD,CAAC;IAED,sIAAsI;IACtI,IAAW,UAAU;QACnB,OAAO,CAAC,KAAK,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,GAAG,IAAI,CAAC,eAAe,CAAC;IACxF,CAAC;IAED,gGAAgG;IAChG,IAAW,WAAW;QACpB,IAAI,CAAC,IAAI,CAAC,QAAQ;YAChB,OAAO,SAAS,CAAC;QAEnB,MAAM,KAAK,GAAG,eAAO,CAAC,UAAU,EAAE,CAAC;QACnC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,IAAI;YAC1B,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAEjC,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;OAIG;IACI,wBAAwB,CAAC,KAAK,GAAG,CAAC,EAAE,MAAgB;QACzD,MAAM,GAAG,eAAO,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;QAEpC,IAAI,kBAAkB,CAAC,MAAM,KAAK,IAAI,CAAC,QAAQ,EAAE,CAAC;YAChD,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;gBAC7B,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;gBACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC;oBAClC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC;YACvE,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;CACF;AA/FD,gCA+FC;AAED;;;;;;;;;;;GAWG;AACH,MAAa,eAAe;IAM1B,wCAAwC;IACxC,YAAmB,QAAsB,EAAE,OAAiB;QAC1D,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;IACzB,CAAC;IAED,0BAA0B;IACnB,KAAK;QACV,MAAM,cAAc,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC;QAC3D,OAAO,IAAI,eAAe,CAAC,cAAc,EAAE,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC,CAAC;IACnE,CAAC;IAED;;OAEG;IACI,aAAa,CAAC,KAAsB,EAAE,SAAkB;QAC7D,IAAI,CAAC,0BAAW,CAAC,YAAY,CAAC,IAAI,CAAC,OAAO,EAAE,KAAK,CAAC,OAAO,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,KAAK,KAAK,CAAC,QAAQ,CAAC,MAAM;YAC1G,OAAO,KAAK,CAAC;QAEf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE;YAC3C,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC;gBAC/D,OAAO,KAAK,CAAC;QAEjB,OAAO,IAAI,CAAC;IACd,CAAC;IAED,sIAAsI;IAC/H,MAAM,CAAC,aAAa,CAAC,IAAiC,EAAE,KAAkC,EAAE,GAAY;QAC7G,IAAI,IAAI,KAAK,KAAK,EAAE,oCAAoC;YACtD,OAAO,IAAI,CAAC;QACd,IAAI,IAAI,IAAI,KAAK;YACf,OAAO,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QACxC,OAAO,KAAK,CAAC;IACf,CAAC;IAED,kEAAkE;IAC3D,gBAAgB;QACrB,MAAM,eAAe,GAAiB,EAAE,CAAC;QAEzC,KAAK,MAAM,aAAa,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAC1C,MAAM,kBAAkB,GAAqB,EAAE,CAAC;YAChD,KAAK,MAAM,iBAAiB,IAAI,aAAa,CAAC,IAAI;gBAChD,kBAAkB,CAAC,IAAI,CAAC,IAAI,cAAc,CAAC,iBAAiB,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,CAAC;YAE3E,eAAe,CAAC,IAAI,CAAC,IAAI,UAAU,CAAC,kBAAkB,EAAE,aAAa,CAAC,QAAQ,EAAE,aAAa,CAAC,IAAI,EAAE,aAAa,CAAC,SAAS,CAAC,CAAC,CAAC;QAChI,CAAC;QAED,OAAO,IAAI,eAAe,CAAC,eAAe,EAAE,EAAE,CAAC,CAAC;IAClD,CAAC;IAED;;;;OAIG;IACI,mBAAmB,CAAC,SAAoB;QAC7C,IAAI,UAAgC,CAAC;QACrC,MAAM,GAAG,GAAG,SAAS,CAAC,MAAM,CAAC;QAC7B,MAAM,GAAG,GAAG,GAAG,CAAC,WAAW,EAAE,CAAC;QAC9B,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAEnE,KAAK,MAAM,OAAO,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YACpC,KAAK,MAAM,IAAI,IAAI,OAAO,CAAC,IAAI,EAAE,CAAC;gBAChC,QAAQ,OAAO,CAAC,QAAQ,EAAE,CAAC;oBACzB,KAAK,kBAAkB,CAAC,MAAM;wBAC5B,SAAS;oBACX,KAAK,kBAAkB,CAAC,QAAQ,CAAC,CAAC,CAAC;wBACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE;4BACzC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC;wBAE1B,MAAM;oBACR,CAAC;oBACD,KAAK,kBAAkB,CAAC,MAAM,CAAC,CAAC,CAAC;wBAC/B,UAAU,GAAG,UAAU,IAAI,GAAG,CAAC,OAAO,EAAE,CAAC;wBACzC,IAAI,CAAC,UAAU;4BACX,OAAO,KAAK,CAAC;wBAEjB,eAAe,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,KAAK,EAAE,EAAE;4BACrC,UAAW,CAAC,8BAA8B,CAAC,KAAK,CAAC,CAAC;4BAClD,MAAM,GAAG,GAAG,KAAK,CAAC,gBAAgB,EAAE,CAAC;4BACrC,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,6EAA6E;4BAClG,IAAI,GAAG,GAAG,GAAG,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,GAAG,EAAG,CAAC,CAAC,mDAAmD;gCAChG,MAAM,GAAG,GAAG,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gCACjC,KAAK,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC;4BAC1B,CAAC;wBACH,CAAC,CAAC,CAAC;wBACH,MAAM;oBACR,CAAC;oBACD,KAAK,kBAAkB,CAAC,MAAM,CAAC,CAAC,CAAC;wBAC/B,eAAe,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,GAAG,CAAC,qBAAqB,CAAC,KAAK,CAAC,CAAC,CAAC;wBAC1E,MAAM;oBACR,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;CACF;AAxGD,0CAwGC;AAED,SAAS,eAAe,CAAC,MAAgB,EAAE,SAAmC;IAC5E,MAAM,KAAK,GAAG,IAAI,yBAAO,EAAE,CAAC;IAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAC1C,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACnD,SAAS,CAAC,KAAK,CAAC,CAAC;QACjB,MAAM,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;QACpB,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;QACxB,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;IAC1B,CAAC;AACH,CAAC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n\r\n/** @packageDocumentation\r\n * @module Polyface\r\n */\r\n\r\n// import { Point2d } from \"./Geometry2d\";\r\nimport { Transform } from \"../geometry3d/Transform\";\r\nimport { Matrix3d } from \"../geometry3d/Matrix3d\";\r\nimport { Point3d } from \"../geometry3d/Point3dVector3d\";\r\nimport { NumberArray } from \"../geometry3d/PointHelpers\";\r\n// import { Geometry } from \"./Geometry\";\r\nimport { Range1d, Range3d } from \"../geometry3d/Range\";\r\n\r\n/** The types of data that can be represented by an [[AuxChannelData]]. Each type of data contributes differently to the\r\n * animation applied by an [AnalysisStyle]($common) and responds differently when the host [[PolyfaceAuxData]] is transformed.\r\n * @public\r\n */\r\nexport enum AuxChannelDataType {\r\n  /** General-purpose scalar values like stress, temperature, etc., used to recolor the [[Polyface]]'s vertices.\r\n   * When the host Polyface is transformed, scalar values remain unmodified.\r\n   */\r\n  Scalar = 0,\r\n  /** Distances in meters used to recolor the [[Polyface]]'s vertices.\r\n   * When the host [[Polyface]] is transformed the [[Transform]]'s scale is applied to the distances.\r\n   */\r\n  Distance = 1,\r\n  /** (X, Y, Z) displacement vectors added to the [[Polyface]]'s vertex positions resulting in deformation of the mesh.\r\n   * When the host Polyface is transformed the displacements are rotated and scaled accordingly.\r\n   */\r\n  Vector = 2,\r\n  /** (X, Y, Z) unit normal vectors that replace the host [[Polyface]]'s own normals.\r\n   * When the Polyface is transformed the normals are rotated and renormalized accordingly.\r\n   */\r\n  Normal = 3,\r\n}\r\n\r\n/**  Represents the [[AuxChannel]] data at a single input value.\r\n * @public\r\n*/\r\nexport class AuxChannelData {\r\n  /** The input value for this data. */\r\n  public input: number;\r\n  /** The vertex values for this data. A single value per vertex for scalar and distance types and 3 values (x,y,z) for normal or vector channels. */\r\n  public values: number[];\r\n\r\n  /** Constructor. If `values` is a number array, it is captured.  */\r\n  constructor(input: number, values: number[] | Float64Array) {\r\n    this.input = input;\r\n    if (values instanceof Float64Array) {\r\n      this.values = [];\r\n      for (const v of values) this.values.push(v);\r\n    } else\r\n      this.values = values;\r\n  }\r\n\r\n  /** Copy blocks of size `blockSize` from (blocked index) `thisIndex` in this AuxChannelData to (blockIndex) `otherIndex` of `other` */\r\n  public copyValues(other: AuxChannelData, thisIndex: number, otherIndex: number, blockSize: number): void {\r\n    for (let i = 0; i < blockSize; i++)\r\n      this.values[thisIndex * blockSize + i] = other.values[otherIndex * blockSize + i];\r\n  }\r\n\r\n  /** return a deep copy */\r\n  public clone(): AuxChannelData {\r\n    return new AuxChannelData(this.input, this.values.slice());\r\n  }\r\n\r\n  /** toleranced comparison of the `input` and `value` fields.\r\n   * * Default tolerance is 1.0e-8\r\n   */\r\n  public isAlmostEqual(other: AuxChannelData, tol?: number): boolean {\r\n    const tolerance = tol ? tol : 1.0E-8;\r\n    return Math.abs(this.input - other.input) < tolerance && NumberArray.isAlmostEqual(this.values, other.values, tolerance);\r\n  }\r\n}\r\n\r\n/**  Represents a single [[PolyfaceAuxData]] channel.\r\n * @public\r\n*/\r\nexport class AuxChannel {\r\n  /** An array of [[AuxChannelData]] that represents the vertex data at one or more input values. */\r\n  public data: AuxChannelData[];\r\n  /** The type of data stored in this channel. */\r\n  public dataType: AuxChannelDataType;\r\n  /** The channel name. This is used to present the [[AuxChannel]] to the user and also to select the [[AuxChannel]] for display from AnalysisStyle */\r\n  public name?: string;\r\n  /** The input name. */\r\n  public inputName?: string;\r\n\r\n  /** Constructor with CAPTURED inputs. */\r\n  public constructor(data: AuxChannelData[], dataType: AuxChannelDataType, name?: string, inputName?: string) {\r\n    this.data = data;\r\n    this.dataType = dataType;\r\n    this.name = name;\r\n    this.inputName = inputName;\r\n  }\r\n\r\n  /** Return a deep copy. */\r\n  public clone(): AuxChannel {\r\n    const clonedData = [];\r\n    for (const data of this.data) clonedData.push(data.clone());\r\n    return new AuxChannel(clonedData, this.dataType, this.name, this.inputName);\r\n  }\r\n\r\n  /** Toleranced comparison of contents. */\r\n  public isAlmostEqual(other: AuxChannel, tol?: number): boolean {\r\n    if (this.dataType !== other.dataType ||\r\n      this.name !== other.name ||\r\n      this.inputName !== other.inputName ||\r\n      this.data.length !== other.data.length)\r\n      return false;\r\n\r\n    for (let i = 0; i < this.data.length; i++)\r\n      if (!this.data[i].isAlmostEqual(other.data[i], tol))\r\n        return false;\r\n\r\n    return true;\r\n  }\r\n\r\n  /** True if the data type is 1-dimensional. */\r\n  public static isScalar(dataType: AuxChannelDataType): boolean {\r\n    return dataType === AuxChannelDataType.Distance || dataType === AuxChannelDataType.Scalar;\r\n  }\r\n\r\n  /** True if the data stored in this AuxChannel is 1-dimensional. */\r\n  public get isScalar(): boolean {\r\n    return AuxChannel.isScalar(this.dataType);\r\n  }\r\n\r\n  /** The dimension (1D or 3D) of each datum of an AuxChannel of the given type. */\r\n  public static entriesPerValue(dataType: AuxChannelDataType): number {\r\n    return this.isScalar(dataType) ? 1 : 3;\r\n  }\r\n\r\n  /** The dimension (1D or 3D) of each datum in the data arrays of this AuxChannel. */\r\n  public get entriesPerValue(): number {\r\n    return AuxChannel.entriesPerValue(this.dataType);\r\n  }\r\n\r\n  /** The number of data stored in each data array of this AuxChannel, equal to the length of the array divided by `entriesPerValue`. */\r\n  public get valueCount(): number {\r\n    return 0 === this.data.length ? 0 : this.data[0].values.length / this.entriesPerValue;\r\n  }\r\n\r\n  /** The minimum and maximum values in `data.values`, or `undefined` if [[isScalar]] is false. */\r\n  public get scalarRange(): Range1d | undefined {\r\n    if (!this.isScalar)\r\n      return undefined;\r\n\r\n    const range = Range1d.createNull();\r\n    for (const data of this.data)\r\n      range.extendArray(data.values);\r\n\r\n    return range;\r\n  }\r\n\r\n  /** Compute the range of this channel's displacement values, if [[dataType]] is [[AuxChannelDataType.Vector]].\r\n   * @param scale Scale by which to multiply each displacement.\r\n   * @param result Preallocated object in which to store result.\r\n   * @returns The range encompassing all this channel's displacements scaled by `scale`; or a null range if this channel does not contain displacements.\r\n   */\r\n  public computeDisplacementRange(scale = 1, result?: Range3d): Range3d {\r\n    result = Range3d.createNull(result);\r\n\r\n    if (AuxChannelDataType.Vector === this.dataType) {\r\n      for (const data of this.data) {\r\n        const v = data.values;\r\n        for (let i = 0; i < v.length; i += 3)\r\n          result.extendXYZ(v[i] * scale, v[i + 1] * scale, v[i + 2] * scale);\r\n      }\r\n    }\r\n\r\n    return result;\r\n  }\r\n}\r\n\r\n/**\r\n * The `PolyfaceAuxData` structure contains one or more analytical data channels for each vertex of a [[Polyface]], allowing the polyface to be styled\r\n * using an [AnalysisStyle]($common).\r\n * Typically a polyface will contain only vertex data required for its basic display: vertex position, normal, texture parameter, color.\r\n * `PolyfaceAuxData` provides supplemental per-vertex data that is generally computed in an analysis program or other external data source.\r\n * This supplemental data can be either 1D (e.g., height, override color) or 3D (e.g., displacement vector, override normal); see [[AuxChannel.entriesPerValue]], [[AuxChannel.dataType]].\r\n * All data channels are indexed by the same indices, which must have the same length and structure as the other Polyface indices.\r\n * This means that if a facet's face loop is found at index range [i0,i1] in the Polyface vertex index array, then the same index range [i0,i1]\r\n * locates the data for this facet in all the other Polyface index arrays, including the `PolyfaceAuxData` indices.\r\n * @see [[PolyfaceData.auxData]] to associate auxiliary data with a polyface.\r\n * @public\r\n */\r\nexport class PolyfaceAuxData {\r\n  /** Array with one or more channels of auxiliary data for the associated polyface. */\r\n  public channels: AuxChannel[];\r\n  /** The indices (shared by all data in all channels) mapping the data to the mesh facets. */\r\n  public indices: number[];\r\n\r\n  /** Constructor with CAPTURED inputs. */\r\n  public constructor(channels: AuxChannel[], indices: number[]) {\r\n    this.channels = channels;\r\n    this.indices = indices;\r\n  }\r\n\r\n  /** Return a deep copy. */\r\n  public clone(): PolyfaceAuxData {\r\n    const clonedChannels = this.channels.map((x) => x.clone());\r\n    return new PolyfaceAuxData(clonedChannels, this.indices.slice());\r\n  }\r\n\r\n  /** Returns true if `this` is equivalent to `other` within `tolerance`.\r\n   * The indices are compared for exact equality. The data in the channels are compared using `tolerance`, which defaults to 1.0e-8.\r\n   */\r\n  public isAlmostEqual(other: PolyfaceAuxData, tolerance?: number): boolean {\r\n    if (!NumberArray.isExactEqual(this.indices, other.indices) || this.channels.length !== other.channels.length)\r\n      return false;\r\n\r\n    for (let i = 0; i < this.channels.length; i++)\r\n      if (!this.channels[i].isAlmostEqual(other.channels[i], tolerance))\r\n        return false;\r\n\r\n    return true;\r\n  }\r\n\r\n  /** Returns true if both `left` and `right` are undefined, or both are defined and equivalent within `tolerance` (default: 1.0e-8). */\r\n  public static isAlmostEqual(left: PolyfaceAuxData | undefined, right: PolyfaceAuxData | undefined, tol?: number): boolean {\r\n    if (left === right) // This catches double undefined !!!\r\n      return true;\r\n    if (left && right)\r\n      return left.isAlmostEqual(right, tol);\r\n    return false;\r\n  }\r\n\r\n  /** Create a PolyfaceAuxData for use by a [[PolyfaceVisitor]].  */\r\n  public createForVisitor(): PolyfaceAuxData {\r\n    const visitorChannels: AuxChannel[] = [];\r\n\r\n    for (const parentChannel of this.channels) {\r\n      const visitorChannelData: AuxChannelData[] = [];\r\n      for (const parentChannelData of parentChannel.data)\r\n        visitorChannelData.push(new AuxChannelData(parentChannelData.input, []));\r\n\r\n      visitorChannels.push(new AuxChannel(visitorChannelData, parentChannel.dataType, parentChannel.name, parentChannel.inputName));\r\n    }\r\n\r\n    return new PolyfaceAuxData(visitorChannels, []);\r\n  }\r\n\r\n  /** Apply `transform` to the data in each channel.\r\n   * @see [[AuxChannelDataType]] for details regarding how each data type is affected by the transform.\r\n   * @note This method may fail if a channel of [[AuxChannelDataType.Normal]] exists and `transform.matrix` is non-invertible.\r\n   * @returns true if the channels were all successfully transformed.\r\n   */\r\n  public tryTransformInPlace(transform: Transform): boolean {\r\n    let inverseRot: Matrix3d | undefined;\r\n    const rot = transform.matrix;\r\n    const det = rot.determinant();\r\n    const scale = Math.pow(Math.abs(det), 1 / 3) * (det >= 0 ? 1 : -1);\r\n\r\n    for (const channel of this.channels) {\r\n      for (const data of channel.data) {\r\n        switch (channel.dataType) {\r\n          case AuxChannelDataType.Scalar:\r\n            continue;\r\n          case AuxChannelDataType.Distance: {\r\n            for (let i = 0; i < data.values.length; i++)\r\n              data.values[i] *= scale;\r\n\r\n            break;\r\n          }\r\n          case AuxChannelDataType.Normal: {\r\n            inverseRot = inverseRot ?? rot.inverse();\r\n            if (!inverseRot)\r\n                return false;\r\n\r\n            transformPoints(data.values, (point) => {\r\n              inverseRot!.multiplyTransposeVectorInPlace(point);\r\n              const dot = point.magnitudeSquared();\r\n              const tol = 1.0e-15; // cf. GrowableXYZArray.multiplyAndRenormalizeMatrix3dInverseTransposeInPlace\r\n              if (dot > tol && Math.abs(dot - 1.0) > tol ) { // only renormalize if magnitude is not near 0 or 1\r\n                const mag = 1.0 / Math.sqrt(dot);\r\n                point.scaleInPlace(mag);\r\n              }\r\n            });\r\n            break;\r\n          }\r\n          case AuxChannelDataType.Vector: {\r\n            transformPoints(data.values, (point) => rot.multiplyVectorInPlace(point));\r\n            break;\r\n          }\r\n        }\r\n      }\r\n    }\r\n\r\n    return true;\r\n  }\r\n}\r\n\r\nfunction transformPoints(coords: number[], transform: (point: Point3d) => void): void {\r\n  const point = new Point3d();\r\n  for (let i = 0; i < coords.length; i += 3) {\r\n    point.set(coords[i], coords[i + 1], coords[i + 2]);\r\n    transform(point);\r\n    coords[i] = point.x;\r\n    coords[i + 1] = point.y;\r\n    coords[i + 2] = point.z;\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"AuxData.js","sourceRoot":"","sources":["../../../src/polyface/AuxData.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAS/F,mEAAwD;AACxD,6DAAyD;AACzD,yCAAyC;AACzC,+CAAuD;AAEvD;;;GAGG;AACH,IAAY,kBAiBX;AAjBD,WAAY,kBAAkB;IAC5B;;OAEG;IACH,+DAAU,CAAA;IACV;;OAEG;IACH,mEAAY,CAAA;IACZ;;OAEG;IACH,+DAAU,CAAA;IACV;;OAEG;IACH,+DAAU,CAAA;AACZ,CAAC,EAjBW,kBAAkB,kCAAlB,kBAAkB,QAiB7B;AAED;;EAEE;AACF,MAAa,cAAc;IACzB,qCAAqC;IAC9B,KAAK,CAAS;IACrB,mJAAmJ;IAC5I,MAAM,CAAW;IAExB,mEAAmE;IACnE,YAAY,KAAa,EAAE,MAA+B;QACxD,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,MAAM,YAAY,YAAY,EAAE,CAAC;YACnC,IAAI,CAAC,MAAM,GAAG,EAAE,CAAC;YACjB,KAAK,MAAM,CAAC,IAAI,MAAM;gBAAE,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9C,CAAC;;YACC,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;IACzB,CAAC;IAED,sIAAsI;IAC/H,UAAU,CAAC,KAAqB,EAAE,SAAiB,EAAE,UAAkB,EAAE,SAAiB;QAC/F,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE;YAChC,IAAI,CAAC,MAAM,CAAC,SAAS,GAAG,SAAS,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,UAAU,GAAG,SAAS,GAAG,CAAC,CAAC,CAAC;IACtF,CAAC;IAED,yBAAyB;IAClB,KAAK;QACV,OAAO,IAAI,cAAc,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC;IAC7D,CAAC;IAED;;OAEG;IACI,aAAa,CAAC,KAAqB,EAAE,GAAY;QACtD,MAAM,SAAS,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC;QACrC,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,SAAS,IAAI,0BAAW,CAAC,aAAa,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;IAC3H,CAAC;CACF;AAlCD,wCAkCC;AAED;;EAEE;AACF,MAAa,UAAU;IACrB,kGAAkG;IAC3F,IAAI,CAAmB;IAC9B,+CAA+C;IACxC,QAAQ,CAAqB;IACpC,oJAAoJ;IAC7I,IAAI,CAAU;IACrB,sBAAsB;IACf,SAAS,CAAU;IAE1B,wCAAwC;IACxC,YAAmB,IAAsB,EAAE,QAA4B,EAAE,IAAa,EAAE,SAAkB;QACxG,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;IAC7B,CAAC;IAED,0BAA0B;IACnB,KAAK;QACV,MAAM,UAAU,GAAG,EAAE,CAAC;QACtB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,IAAI;YAAE,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC;QAC5D,OAAO,IAAI,UAAU,CAAC,UAAU,EAAE,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;IAC9E,CAAC;IAED,yCAAyC;IAClC,aAAa,CAAC,KAAiB,EAAE,GAAY;QAClD,IAAI,IAAI,CAAC,QAAQ,KAAK,KAAK,CAAC,QAAQ;YAClC,IAAI,CAAC,IAAI,KAAK,KAAK,CAAC,IAAI;YACxB,IAAI,CAAC,SAAS,KAAK,KAAK,CAAC,SAAS;YAClC,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,KAAK,CAAC,IAAI,CAAC,MAAM;YACtC,OAAO,KAAK,CAAC;QAEf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE;YACvC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC;gBACjD,OAAO,KAAK,CAAC;QAEjB,OAAO,IAAI,CAAC;IACd,CAAC;IAED,8CAA8C;IACvC,MAAM,CAAC,QAAQ,CAAC,QAA4B;QACjD,OAAO,QAAQ,KAAK,kBAAkB,CAAC,QAAQ,IAAI,QAAQ,KAAK,kBAAkB,CAAC,MAAM,CAAC;IAC5F,CAAC;IAED,mEAAmE;IACnE,IAAW,QAAQ;QACjB,OAAO,UAAU,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IAC5C,CAAC;IAED,iFAAiF;IAC1E,MAAM,CAAC,eAAe,CAAC,QAA4B;QACxD,OAAO,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzC,CAAC;IAED,oFAAoF;IACpF,IAAW,eAAe;QACxB,OAAO,UAAU,CAAC,eAAe,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IACnD,CAAC;IAED,sIAAsI;IACtI,IAAW,UAAU;QACnB,OAAO,CAAC,KAAK,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,GAAG,IAAI,CAAC,eAAe,CAAC;IACxF,CAAC;IAED,gGAAgG;IAChG,IAAW,WAAW;QACpB,IAAI,CAAC,IAAI,CAAC,QAAQ;YAChB,OAAO,SAAS,CAAC;QAEnB,MAAM,KAAK,GAAG,eAAO,CAAC,UAAU,EAAE,CAAC;QACnC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,IAAI;YAC1B,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAEjC,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;OAIG;IACI,wBAAwB,CAAC,KAAK,GAAG,CAAC,EAAE,MAAgB;QACzD,MAAM,GAAG,eAAO,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;QAEpC,IAAI,kBAAkB,CAAC,MAAM,KAAK,IAAI,CAAC,QAAQ,EAAE,CAAC;YAChD,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;gBAC7B,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;gBACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC;oBAClC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC;YACvE,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;CACF;AA/FD,gCA+FC;AAED;;;;;;;;;;;GAWG;AACH,MAAa,eAAe;IAC1B,qFAAqF;IAC9E,QAAQ,CAAe;IAC9B,4FAA4F;IACrF,OAAO,CAAW;IAEzB,wCAAwC;IACxC,YAAmB,QAAsB,EAAE,OAAiB;QAC1D,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;IACzB,CAAC;IAED,0BAA0B;IACnB,KAAK;QACV,MAAM,cAAc,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC;QAC3D,OAAO,IAAI,eAAe,CAAC,cAAc,EAAE,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC,CAAC;IACnE,CAAC;IAED;;OAEG;IACI,aAAa,CAAC,KAAsB,EAAE,SAAkB;QAC7D,IAAI,CAAC,0BAAW,CAAC,YAAY,CAAC,IAAI,CAAC,OAAO,EAAE,KAAK,CAAC,OAAO,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,KAAK,KAAK,CAAC,QAAQ,CAAC,MAAM;YAC1G,OAAO,KAAK,CAAC;QAEf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE;YAC3C,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC;gBAC/D,OAAO,KAAK,CAAC;QAEjB,OAAO,IAAI,CAAC;IACd,CAAC;IAED,sIAAsI;IAC/H,MAAM,CAAC,aAAa,CAAC,IAAiC,EAAE,KAAkC,EAAE,GAAY;QAC7G,IAAI,IAAI,KAAK,KAAK,EAAE,oCAAoC;YACtD,OAAO,IAAI,CAAC;QACd,IAAI,IAAI,IAAI,KAAK;YACf,OAAO,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QACxC,OAAO,KAAK,CAAC;IACf,CAAC;IAED,kEAAkE;IAC3D,gBAAgB;QACrB,MAAM,eAAe,GAAiB,EAAE,CAAC;QAEzC,KAAK,MAAM,aAAa,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAC1C,MAAM,kBAAkB,GAAqB,EAAE,CAAC;YAChD,KAAK,MAAM,iBAAiB,IAAI,aAAa,CAAC,IAAI;gBAChD,kBAAkB,CAAC,IAAI,CAAC,IAAI,cAAc,CAAC,iBAAiB,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,CAAC;YAE3E,eAAe,CAAC,IAAI,CAAC,IAAI,UAAU,CAAC,kBAAkB,EAAE,aAAa,CAAC,QAAQ,EAAE,aAAa,CAAC,IAAI,EAAE,aAAa,CAAC,SAAS,CAAC,CAAC,CAAC;QAChI,CAAC;QAED,OAAO,IAAI,eAAe,CAAC,eAAe,EAAE,EAAE,CAAC,CAAC;IAClD,CAAC;IAED;;;;OAIG;IACI,mBAAmB,CAAC,SAAoB;QAC7C,IAAI,UAAgC,CAAC;QACrC,MAAM,GAAG,GAAG,SAAS,CAAC,MAAM,CAAC;QAC7B,MAAM,GAAG,GAAG,GAAG,CAAC,WAAW,EAAE,CAAC;QAC9B,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAEnE,KAAK,MAAM,OAAO,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YACpC,KAAK,MAAM,IAAI,IAAI,OAAO,CAAC,IAAI,EAAE,CAAC;gBAChC,QAAQ,OAAO,CAAC,QAAQ,EAAE,CAAC;oBACzB,KAAK,kBAAkB,CAAC,MAAM;wBAC5B,SAAS;oBACX,KAAK,kBAAkB,CAAC,QAAQ,CAAC,CAAC,CAAC;wBACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE;4BACzC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC;wBAE1B,MAAM;oBACR,CAAC;oBACD,KAAK,kBAAkB,CAAC,MAAM,CAAC,CAAC,CAAC;wBAC/B,UAAU,GAAG,UAAU,IAAI,GAAG,CAAC,OAAO,EAAE,CAAC;wBACzC,IAAI,CAAC,UAAU;4BACX,OAAO,KAAK,CAAC;wBAEjB,eAAe,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,KAAK,EAAE,EAAE;4BACrC,UAAW,CAAC,8BAA8B,CAAC,KAAK,CAAC,CAAC;4BAClD,MAAM,GAAG,GAAG,KAAK,CAAC,gBAAgB,EAAE,CAAC;4BACrC,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,6EAA6E;4BAClG,IAAI,GAAG,GAAG,GAAG,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,GAAG,EAAG,CAAC,CAAC,mDAAmD;gCAChG,MAAM,GAAG,GAAG,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gCACjC,KAAK,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC;4BAC1B,CAAC;wBACH,CAAC,CAAC,CAAC;wBACH,MAAM;oBACR,CAAC;oBACD,KAAK,kBAAkB,CAAC,MAAM,CAAC,CAAC,CAAC;wBAC/B,eAAe,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,GAAG,CAAC,qBAAqB,CAAC,KAAK,CAAC,CAAC,CAAC;wBAC1E,MAAM;oBACR,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;CACF;AAxGD,0CAwGC;AAED,SAAS,eAAe,CAAC,MAAgB,EAAE,SAAmC;IAC5E,MAAM,KAAK,GAAG,IAAI,yBAAO,EAAE,CAAC;IAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAC1C,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACnD,SAAS,CAAC,KAAK,CAAC,CAAC;QACjB,MAAM,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;QACpB,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;QACxB,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;IAC1B,CAAC;AACH,CAAC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n\r\n/** @packageDocumentation\r\n * @module Polyface\r\n */\r\n\r\n// import { Point2d } from \"./Geometry2d\";\r\nimport { Transform } from \"../geometry3d/Transform\";\r\nimport { Matrix3d } from \"../geometry3d/Matrix3d\";\r\nimport { Point3d } from \"../geometry3d/Point3dVector3d\";\r\nimport { NumberArray } from \"../geometry3d/PointHelpers\";\r\n// import { Geometry } from \"./Geometry\";\r\nimport { Range1d, Range3d } from \"../geometry3d/Range\";\r\n\r\n/** The types of data that can be represented by an [[AuxChannelData]]. Each type of data contributes differently to the\r\n * animation applied by an [AnalysisStyle]($common) and responds differently when the host [[PolyfaceAuxData]] is transformed.\r\n * @public\r\n */\r\nexport enum AuxChannelDataType {\r\n  /** General-purpose scalar values like stress, temperature, etc., used to recolor the [[Polyface]]'s vertices.\r\n   * When the host Polyface is transformed, scalar values remain unmodified.\r\n   */\r\n  Scalar = 0,\r\n  /** Distances in meters used to recolor the [[Polyface]]'s vertices.\r\n   * When the host [[Polyface]] is transformed the [[Transform]]'s scale is applied to the distances.\r\n   */\r\n  Distance = 1,\r\n  /** (X, Y, Z) displacement vectors added to the [[Polyface]]'s vertex positions resulting in deformation of the mesh.\r\n   * When the host Polyface is transformed the displacements are rotated and scaled accordingly.\r\n   */\r\n  Vector = 2,\r\n  /** (X, Y, Z) unit normal vectors that replace the host [[Polyface]]'s own normals.\r\n   * When the Polyface is transformed the normals are rotated and renormalized accordingly.\r\n   */\r\n  Normal = 3,\r\n}\r\n\r\n/**  Represents the [[AuxChannel]] data at a single input value.\r\n * @public\r\n*/\r\nexport class AuxChannelData {\r\n  /** The input value for this data. */\r\n  public input: number;\r\n  /** The vertex values for this data. A single value per vertex for scalar and distance types and 3 values (x,y,z) for normal or vector channels. */\r\n  public values: number[];\r\n\r\n  /** Constructor. If `values` is a number array, it is captured.  */\r\n  constructor(input: number, values: number[] | Float64Array) {\r\n    this.input = input;\r\n    if (values instanceof Float64Array) {\r\n      this.values = [];\r\n      for (const v of values) this.values.push(v);\r\n    } else\r\n      this.values = values;\r\n  }\r\n\r\n  /** Copy blocks of size `blockSize` from (blocked index) `thisIndex` in this AuxChannelData to (blockIndex) `otherIndex` of `other` */\r\n  public copyValues(other: AuxChannelData, thisIndex: number, otherIndex: number, blockSize: number): void {\r\n    for (let i = 0; i < blockSize; i++)\r\n      this.values[thisIndex * blockSize + i] = other.values[otherIndex * blockSize + i];\r\n  }\r\n\r\n  /** return a deep copy */\r\n  public clone(): AuxChannelData {\r\n    return new AuxChannelData(this.input, this.values.slice());\r\n  }\r\n\r\n  /** toleranced comparison of the `input` and `value` fields.\r\n   * * Default tolerance is 1.0e-8\r\n   */\r\n  public isAlmostEqual(other: AuxChannelData, tol?: number): boolean {\r\n    const tolerance = tol ? tol : 1.0E-8;\r\n    return Math.abs(this.input - other.input) < tolerance && NumberArray.isAlmostEqual(this.values, other.values, tolerance);\r\n  }\r\n}\r\n\r\n/**  Represents a single [[PolyfaceAuxData]] channel.\r\n * @public\r\n*/\r\nexport class AuxChannel {\r\n  /** An array of [[AuxChannelData]] that represents the vertex data at one or more input values. */\r\n  public data: AuxChannelData[];\r\n  /** The type of data stored in this channel. */\r\n  public dataType: AuxChannelDataType;\r\n  /** The channel name. This is used to present the [[AuxChannel]] to the user and also to select the [[AuxChannel]] for display from AnalysisStyle */\r\n  public name?: string;\r\n  /** The input name. */\r\n  public inputName?: string;\r\n\r\n  /** Constructor with CAPTURED inputs. */\r\n  public constructor(data: AuxChannelData[], dataType: AuxChannelDataType, name?: string, inputName?: string) {\r\n    this.data = data;\r\n    this.dataType = dataType;\r\n    this.name = name;\r\n    this.inputName = inputName;\r\n  }\r\n\r\n  /** Return a deep copy. */\r\n  public clone(): AuxChannel {\r\n    const clonedData = [];\r\n    for (const data of this.data) clonedData.push(data.clone());\r\n    return new AuxChannel(clonedData, this.dataType, this.name, this.inputName);\r\n  }\r\n\r\n  /** Toleranced comparison of contents. */\r\n  public isAlmostEqual(other: AuxChannel, tol?: number): boolean {\r\n    if (this.dataType !== other.dataType ||\r\n      this.name !== other.name ||\r\n      this.inputName !== other.inputName ||\r\n      this.data.length !== other.data.length)\r\n      return false;\r\n\r\n    for (let i = 0; i < this.data.length; i++)\r\n      if (!this.data[i].isAlmostEqual(other.data[i], tol))\r\n        return false;\r\n\r\n    return true;\r\n  }\r\n\r\n  /** True if the data type is 1-dimensional. */\r\n  public static isScalar(dataType: AuxChannelDataType): boolean {\r\n    return dataType === AuxChannelDataType.Distance || dataType === AuxChannelDataType.Scalar;\r\n  }\r\n\r\n  /** True if the data stored in this AuxChannel is 1-dimensional. */\r\n  public get isScalar(): boolean {\r\n    return AuxChannel.isScalar(this.dataType);\r\n  }\r\n\r\n  /** The dimension (1D or 3D) of each datum of an AuxChannel of the given type. */\r\n  public static entriesPerValue(dataType: AuxChannelDataType): number {\r\n    return this.isScalar(dataType) ? 1 : 3;\r\n  }\r\n\r\n  /** The dimension (1D or 3D) of each datum in the data arrays of this AuxChannel. */\r\n  public get entriesPerValue(): number {\r\n    return AuxChannel.entriesPerValue(this.dataType);\r\n  }\r\n\r\n  /** The number of data stored in each data array of this AuxChannel, equal to the length of the array divided by `entriesPerValue`. */\r\n  public get valueCount(): number {\r\n    return 0 === this.data.length ? 0 : this.data[0].values.length / this.entriesPerValue;\r\n  }\r\n\r\n  /** The minimum and maximum values in `data.values`, or `undefined` if [[isScalar]] is false. */\r\n  public get scalarRange(): Range1d | undefined {\r\n    if (!this.isScalar)\r\n      return undefined;\r\n\r\n    const range = Range1d.createNull();\r\n    for (const data of this.data)\r\n      range.extendArray(data.values);\r\n\r\n    return range;\r\n  }\r\n\r\n  /** Compute the range of this channel's displacement values, if [[dataType]] is [[AuxChannelDataType.Vector]].\r\n   * @param scale Scale by which to multiply each displacement.\r\n   * @param result Preallocated object in which to store result.\r\n   * @returns The range encompassing all this channel's displacements scaled by `scale`; or a null range if this channel does not contain displacements.\r\n   */\r\n  public computeDisplacementRange(scale = 1, result?: Range3d): Range3d {\r\n    result = Range3d.createNull(result);\r\n\r\n    if (AuxChannelDataType.Vector === this.dataType) {\r\n      for (const data of this.data) {\r\n        const v = data.values;\r\n        for (let i = 0; i < v.length; i += 3)\r\n          result.extendXYZ(v[i] * scale, v[i + 1] * scale, v[i + 2] * scale);\r\n      }\r\n    }\r\n\r\n    return result;\r\n  }\r\n}\r\n\r\n/**\r\n * The `PolyfaceAuxData` structure contains one or more analytical data channels for each vertex of a [[Polyface]], allowing the polyface to be styled\r\n * using an [AnalysisStyle]($common).\r\n * Typically a polyface will contain only vertex data required for its basic display: vertex position, normal, texture parameter, color.\r\n * `PolyfaceAuxData` provides supplemental per-vertex data that is generally computed in an analysis program or other external data source.\r\n * This supplemental data can be either 1D (e.g., height, override color) or 3D (e.g., displacement vector, override normal); see [[AuxChannel.entriesPerValue]], [[AuxChannel.dataType]].\r\n * All data channels are indexed by the same indices, which must have the same length and structure as the other Polyface indices.\r\n * This means that if a facet's face loop is found at index range [i0,i1] in the Polyface vertex index array, then the same index range [i0,i1]\r\n * locates the data for this facet in all the other Polyface index arrays, including the `PolyfaceAuxData` indices.\r\n * @see [[PolyfaceData.auxData]] to associate auxiliary data with a polyface.\r\n * @public\r\n */\r\nexport class PolyfaceAuxData {\r\n  /** Array with one or more channels of auxiliary data for the associated polyface. */\r\n  public channels: AuxChannel[];\r\n  /** The indices (shared by all data in all channels) mapping the data to the mesh facets. */\r\n  public indices: number[];\r\n\r\n  /** Constructor with CAPTURED inputs. */\r\n  public constructor(channels: AuxChannel[], indices: number[]) {\r\n    this.channels = channels;\r\n    this.indices = indices;\r\n  }\r\n\r\n  /** Return a deep copy. */\r\n  public clone(): PolyfaceAuxData {\r\n    const clonedChannels = this.channels.map((x) => x.clone());\r\n    return new PolyfaceAuxData(clonedChannels, this.indices.slice());\r\n  }\r\n\r\n  /** Returns true if `this` is equivalent to `other` within `tolerance`.\r\n   * The indices are compared for exact equality. The data in the channels are compared using `tolerance`, which defaults to 1.0e-8.\r\n   */\r\n  public isAlmostEqual(other: PolyfaceAuxData, tolerance?: number): boolean {\r\n    if (!NumberArray.isExactEqual(this.indices, other.indices) || this.channels.length !== other.channels.length)\r\n      return false;\r\n\r\n    for (let i = 0; i < this.channels.length; i++)\r\n      if (!this.channels[i].isAlmostEqual(other.channels[i], tolerance))\r\n        return false;\r\n\r\n    return true;\r\n  }\r\n\r\n  /** Returns true if both `left` and `right` are undefined, or both are defined and equivalent within `tolerance` (default: 1.0e-8). */\r\n  public static isAlmostEqual(left: PolyfaceAuxData | undefined, right: PolyfaceAuxData | undefined, tol?: number): boolean {\r\n    if (left === right) // This catches double undefined !!!\r\n      return true;\r\n    if (left && right)\r\n      return left.isAlmostEqual(right, tol);\r\n    return false;\r\n  }\r\n\r\n  /** Create a PolyfaceAuxData for use by a [[PolyfaceVisitor]].  */\r\n  public createForVisitor(): PolyfaceAuxData {\r\n    const visitorChannels: AuxChannel[] = [];\r\n\r\n    for (const parentChannel of this.channels) {\r\n      const visitorChannelData: AuxChannelData[] = [];\r\n      for (const parentChannelData of parentChannel.data)\r\n        visitorChannelData.push(new AuxChannelData(parentChannelData.input, []));\r\n\r\n      visitorChannels.push(new AuxChannel(visitorChannelData, parentChannel.dataType, parentChannel.name, parentChannel.inputName));\r\n    }\r\n\r\n    return new PolyfaceAuxData(visitorChannels, []);\r\n  }\r\n\r\n  /** Apply `transform` to the data in each channel.\r\n   * @see [[AuxChannelDataType]] for details regarding how each data type is affected by the transform.\r\n   * @note This method may fail if a channel of [[AuxChannelDataType.Normal]] exists and `transform.matrix` is non-invertible.\r\n   * @returns true if the channels were all successfully transformed.\r\n   */\r\n  public tryTransformInPlace(transform: Transform): boolean {\r\n    let inverseRot: Matrix3d | undefined;\r\n    const rot = transform.matrix;\r\n    const det = rot.determinant();\r\n    const scale = Math.pow(Math.abs(det), 1 / 3) * (det >= 0 ? 1 : -1);\r\n\r\n    for (const channel of this.channels) {\r\n      for (const data of channel.data) {\r\n        switch (channel.dataType) {\r\n          case AuxChannelDataType.Scalar:\r\n            continue;\r\n          case AuxChannelDataType.Distance: {\r\n            for (let i = 0; i < data.values.length; i++)\r\n              data.values[i] *= scale;\r\n\r\n            break;\r\n          }\r\n          case AuxChannelDataType.Normal: {\r\n            inverseRot = inverseRot ?? rot.inverse();\r\n            if (!inverseRot)\r\n                return false;\r\n\r\n            transformPoints(data.values, (point) => {\r\n              inverseRot!.multiplyTransposeVectorInPlace(point);\r\n              const dot = point.magnitudeSquared();\r\n              const tol = 1.0e-15; // cf. GrowableXYZArray.multiplyAndRenormalizeMatrix3dInverseTransposeInPlace\r\n              if (dot > tol && Math.abs(dot - 1.0) > tol ) { // only renormalize if magnitude is not near 0 or 1\r\n                const mag = 1.0 / Math.sqrt(dot);\r\n                point.scaleInPlace(mag);\r\n              }\r\n            });\r\n            break;\r\n          }\r\n          case AuxChannelDataType.Vector: {\r\n            transformPoints(data.values, (point) => rot.multiplyVectorInPlace(point));\r\n            break;\r\n          }\r\n        }\r\n      }\r\n    }\r\n\r\n    return true;\r\n  }\r\n}\r\n\r\nfunction transformPoints(coords: number[], transform: (point: Point3d) => void): void {\r\n  const point = new Point3d();\r\n  for (let i = 0; i < coords.length; i += 3) {\r\n    point.set(coords[i], coords[i + 1], coords[i + 2]);\r\n    transform(point);\r\n    coords[i] = point.x;\r\n    coords[i + 1] = point.y;\r\n    coords[i + 2] = point.z;\r\n  }\r\n}\r\n"]}

package/lib/cjs/polyface/BoxTopology.js

@@ -25,79 +25,79 @@ const Point3dVector3d_1 = require("../geometry3d/Point3dVector3d");
  * @internal
  */
 class BoxTopology {
+    /**
+     * static readonly array with the coordinates of the 8 unit cube corners in standard order, which is:
+     * x varies fastest
+     * * The point indices for the x edges are (0 to 1), (2 to 3), (4 to 5), (6 to 7)
+     * * The point indices for the y edges are (0 to 2), (1 to 3), (4 to 6), (5 to 7)
+     * * The point indices for the z edges are (0 to 4), (1 to 5), (2 to 6), (3 to 7)
+     * * These indices are tabulated in the `axisEdgeVertex[axis][edge][vertex]` array
+     */
+    static points = [
+        Point3dVector3d_1.Point3d.create(0, 0, 0),
+        Point3dVector3d_1.Point3d.create(1, 0, 0),
+        Point3dVector3d_1.Point3d.create(0, 1, 0),
+        Point3dVector3d_1.Point3d.create(1, 1, 0),
+        Point3dVector3d_1.Point3d.create(0, 0, 1),
+        Point3dVector3d_1.Point3d.create(1, 0, 1),
+        Point3dVector3d_1.Point3d.create(0, 1, 1),
+        Point3dVector3d_1.Point3d.create(1, 1, 1),
+    ];
     static pointsClone() {
         const clones = [];
         for (const p of this.points)
             clones.push(p.clone());
         return clones;
     }
+    /** IN faceId pair, the first component for bottom and top caps is `primaryCapId` */
+    static primaryCapId = -1;
+    /** Indices of vertices around faces, in CCW from the outside. */
+    static cornerIndexCCW = [
+        [1, 0, 2, 3],
+        [4, 5, 7, 6],
+        [0, 1, 5, 4],
+        [1, 3, 7, 5],
+        [3, 2, 6, 7],
+        [2, 0, 4, 6]
+    ];
+    /**  // [partnerFace[faceIndex][k] = index of k'th adjacent face  */
+    static partnerFace = [
+        [5, 4, 3, 2],
+        [2, 3, 4, 5],
+        [0, 3, 1, 5],
+        [0, 4, 1, 2],
+        [0, 5, 1, 3],
+        [0, 2, 1, 4],
+    ];
+    /** face id as used in SolidPrimitive methods */
+    static faceId = [
+        [BoxTopology.primaryCapId, 0],
+        [BoxTopology.primaryCapId, 1],
+        [0, 0],
+        [0, 1],
+        [0, 2],
+        [0, 3]
+    ];
+    /**
+     * Table to look up axis indices of edges and normals in box faces.
+     * faceDirections[faceIndex] =[[edge0AxisIndex, edge1AxisIndex, normalAxisIndex],[direction sign for along the axis]
+     */
+    static faceDirections = [
+        [[0, 1, 2], [-1, 1, -1]],
+        [[0, 1, 2], [1, 1, 1]],
+        [[0, 2, 1], [1, -1, 1]],
+        [[1, 2, 0], [1, 1, 1]],
+        [[0, 2, 1], [-1, 1, 1]],
+        [[1, 2, 0], [-1, 1, -1]]
+    ];
+    /** There are 4 edges in each axis direction.
+     *  * axisEdgeVertex[axisIndex][edgeIndex 0..3][*] = vertex index at end of edge in axisIndex direction.
+     */
+    static axisEdgeVertex = [
+        [[0, 1], [2, 3], [4, 5], [6, 7]],
+        [[0, 2], [1, 3], [4, 6], [5, 7]],
+        [[0, 4], [1, 5], [2, 6], [3, 7]]
+    ];
 }
 exports.BoxTopology = BoxTopology;
-/**
- * static readonly array with the coordinates of the 8 unit cube corners in standard order, which is:
- * x varies fastest
- * * The point indices for the x edges are (0 to 1), (2 to 3), (4 to 5), (6 to 7)
- * * The point indices for the y edges are (0 to 2), (1 to 3), (4 to 6), (5 to 7)
- * * The point indices for the z edges are (0 to 4), (1 to 5), (2 to 6), (3 to 7)
- * * These indices are tabulated in the `axisEdgeVertex[axis][edge][vertex]` array
- */
-BoxTopology.points = [
-    Point3dVector3d_1.Point3d.create(0, 0, 0),
-    Point3dVector3d_1.Point3d.create(1, 0, 0),
-    Point3dVector3d_1.Point3d.create(0, 1, 0),
-    Point3dVector3d_1.Point3d.create(1, 1, 0),
-    Point3dVector3d_1.Point3d.create(0, 0, 1),
-    Point3dVector3d_1.Point3d.create(1, 0, 1),
-    Point3dVector3d_1.Point3d.create(0, 1, 1),
-    Point3dVector3d_1.Point3d.create(1, 1, 1),
-];
-/** IN faceId pair, the first component for bottom and top caps is `primaryCapId` */
-BoxTopology.primaryCapId = -1;
-/** Indices of vertices around faces, in CCW from the outside. */
-BoxTopology.cornerIndexCCW = [
-    [1, 0, 2, 3],
-    [4, 5, 7, 6],
-    [0, 1, 5, 4],
-    [1, 3, 7, 5],
-    [3, 2, 6, 7],
-    [2, 0, 4, 6]
-];
-/**  // [partnerFace[faceIndex][k] = index of k'th adjacent face  */
-BoxTopology.partnerFace = [
-    [5, 4, 3, 2],
-    [2, 3, 4, 5],
-    [0, 3, 1, 5],
-    [0, 4, 1, 2],
-    [0, 5, 1, 3],
-    [0, 2, 1, 4],
-];
-/** face id as used in SolidPrimitive methods */
-BoxTopology.faceId = [
-    [BoxTopology.primaryCapId, 0],
-    [BoxTopology.primaryCapId, 1],
-    [0, 0],
-    [0, 1],
-    [0, 2],
-    [0, 3]
-];
-/**
- * Table to look up axis indices of edges and normals in box faces.
- * faceDirections[faceIndex] =[[edge0AxisIndex, edge1AxisIndex, normalAxisIndex],[direction sign for along the axis]
- */
-BoxTopology.faceDirections = [
-    [[0, 1, 2], [-1, 1, -1]],
-    [[0, 1, 2], [1, 1, 1]],
-    [[0, 2, 1], [1, -1, 1]],
-    [[1, 2, 0], [1, 1, 1]],
-    [[0, 2, 1], [-1, 1, 1]],
-    [[1, 2, 0], [-1, 1, -1]]
-];
-/** There are 4 edges in each axis direction.
- *  * axisEdgeVertex[axisIndex][edgeIndex 0..3][*] = vertex index at end of edge in axisIndex direction.
- */
-BoxTopology.axisEdgeVertex = [
-    [[0, 1], [2, 3], [4, 5], [6, 7]],
-    [[0, 2], [1, 3], [4, 6], [5, 7]],
-    [[0, 4], [1, 5], [2, 6], [3, 7]]
-];
 //# sourceMappingURL=BoxTopology.js.map