{"version":3,"file":"ml-gsd.esm.js","sources":["../node_modules/ml-savitzky-golay-generalized/node_modules/is-any-array/lib/index.js","../node_modules/ml-savitzky-golay-generalized/lib/index.js","../node_modules/ml-spectra-processing/node_modules/is-any-array/lib/index.js","../node_modules/ml-spectra-processing/lib/x/xMedian.js","../node_modules/ml-spectra-processing/lib/x/xCheck.js","../node_modules/ml-spectra-processing/lib/x/xFindClosestIndex.js","../node_modules/ml-spectra-processing/lib/x/xGetFromToIndex.js","../node_modules/ml-matrix/matrix.js","../node_modules/ml-matrix/matrix.mjs","../node_modules/ml-spectra-processing/lib/x/xMaxValue.js","../node_modules/ml-spectra-processing/lib/x/xMinValue.js","../node_modules/ml-spectra-processing/lib/x/xIsEquallySpaced.js","../node_modules/ml-spectra-processing/lib/x/xIsMonotonic.js","../node_modules/ml-spectra-processing/lib/x/xMaxAbsoluteValue.js","../node_modules/ml-spectra-processing/lib/x/xMedianAbsoluteDeviation.js","../node_modules/ml-spectra-processing/lib/x/xMinMaxValues.js","../node_modules/ml-spectra-processing/lib/x/xNoiseStandardDeviation.js","../node_modules/ml-spectra-processing/lib/x/xNorm.js","../lib/algorithms/getMinMaxIntervals.js","../lib/algorithms/tryMatchOneIntervalWithMinData.js","../lib/algorithms/autoAlgorithm.js","../lib/algorithms/getPeaksFromIntervals.js","../lib/algorithms/xGetCrossZeroPoints.js","../lib/algorithms/firstDerivative.js","../lib/algorithms/secondDerivative.js","../lib/utils/optimizeTop.js","../lib/gsd.js","../node_modules/ml-peak-shape-generator/lib/util/constants.js","../node_modules/ml-peak-shape-generator/lib/util/erfinv.js","../node_modules/ml-peak-shape-generator/lib/shapes/1d/gaussian/Gaussian.js","../node_modules/ml-peak-shape-generator/lib/shapes/1d/lorentzian/Lorentzian.js","../node_modules/ml-peak-shape-generator/lib/shapes/1d/lorentzianDispersive/LorentzianDispersive.js","../node_modules/ml-peak-shape-generator/lib/shapes/1d/pseudoVoigt/computeFactor.js","../node_modules/ml-peak-shape-generator/lib/shapes/1d/pseudoVoigt/PseudoVoigt.js","../node_modules/ml-peak-shape-generator/lib/shapes/1d/pseudoVoigtTCH/PseudoVoigtTCH.js","../node_modules/ml-peak-shape-generator/lib/shapes/1d/generalizedLorentzian/GeneralizedLorentzian.js","../node_modules/ml-peak-shape-generator/lib/shapes/1d/getShape1D.js","../node_modules/ml-spectra-fitting/lib/shapes/getSumOfShapes.js","../node_modules/ml-spectra-fitting/lib/util/getFixedParametersResult.js","../node_modules/ml-spectra-fitting/lib/util/getGlobalParameterVectors.js","../node_modules/ml-spectra-fitting/lib/util/assert.js","../node_modules/ml-spectra-fitting/lib/util/internalPeaks/DefaultParameters.js","../node_modules/ml-spectra-fitting/lib/util/internalPeaks/getInternalPeaks.js","../node_modules/ml-levenberg-marquardt/node_modules/is-any-array/lib/index.js","../node_modules/ml-levenberg-marquardt/lib/check_options.js","../node_modules/ml-levenberg-marquardt/lib/error_calculation.js","../node_modules/ml-levenberg-marquardt/lib/gradient_function.js","../node_modules/ml-levenberg-marquardt/lib/step.js","../node_modules/ml-levenberg-marquardt/lib/levenberg_marquardt.js","../node_modules/ml-direct/src/util/antiLowerConvexHull.js","../node_modules/ml-direct/src/index.js","../node_modules/ml-spectra-fitting/lib/util/wrappers/directOptimization.js","../node_modules/ml-spectra-fitting/lib/util/selectMethod.js","../node_modules/ml-spectra-fitting/lib/index.js","../lib/utils/addMissingShape.js","../lib/utils/groupPeaks.js","../lib/post/optimizePeaksWithLogs.js","../lib/post/optimizePeaks.js","../lib/utils/addMissingIDs.js","../lib/post/joinBroadPeaks.js","../lib/post/broadenPeaks.js","../lib/utils/setShape.js"],"sourcesContent":["// eslint-disable-next-line @typescript-eslint/unbound-method\nconst toString = Object.prototype.toString;\n/**\n * Checks if an object is an instance of an Array (array or typed array, except those that contain bigint values).\n * @param value - Object to check.\n * @returns True if the object is an array or a typed array.\n */\nexport function isAnyArray(value) {\n    const tag = toString.call(value);\n    return tag.endsWith('Array]') && !tag.includes('Big');\n}\n//# sourceMappingURL=index.js.map","import { isAnyArray } from 'is-any-array';\n/**\n * Apply Savitzky Golay algorithm.\n * @param ys - Array of y values.\n * @param xs - Array of X or deltaX.\n * @param options - Options controlling window size, derivative and polynomial order.\n * @returns Array containing the new ys (same length).\n */\nexport function sgg(ys, xs, options = {}) {\n    const { windowSize = 9, derivative = 0, polynomial = 3 } = options;\n    if (windowSize % 2 === 0 || windowSize < 5 || !Number.isInteger(windowSize)) {\n        throw new RangeError('Invalid window size (should be odd and at least 5 integer number)');\n    }\n    if (!isAnyArray(ys)) {\n        throw new TypeError('Y values must be an array');\n    }\n    if (xs === undefined) {\n        throw new TypeError('X must be defined');\n    }\n    if (windowSize > ys.length) {\n        throw new RangeError(`Window size is higher than the data length ${windowSize}>${ys.length}`);\n    }\n    if (derivative < 0 || !Number.isInteger(derivative)) {\n        throw new RangeError('Derivative should be a positive integer');\n    }\n    if (polynomial < 1 || !Number.isInteger(polynomial)) {\n        throw new RangeError('Polynomial should be a positive integer');\n    }\n    if (polynomial >= 6) {\n        // eslint-disable-next-line no-console\n        console.warn('You should not use polynomial grade higher than 5 if you are' +\n            ' not sure that your data arises from such a model. Possible polynomial oscillation problems');\n    }\n    const half = Math.floor(windowSize / 2);\n    const np = ys.length;\n    const ans = new Float64Array(np);\n    const weights = fullWeights(windowSize, polynomial, derivative);\n    let hs = 0;\n    let constantH = true;\n    if (isAnyArray(xs)) {\n        constantH = false;\n    }\n    else {\n        hs = xs ** derivative;\n    }\n    //For the borders\n    for (let i = 0; i < half; i++) {\n        const wg1 = weights[half - i - 1];\n        const wg2 = weights[half + i + 1];\n        let d1 = 0;\n        let d2 = 0;\n        for (let l = 0; l < windowSize; l++) {\n            d1 += wg1[l] * ys[l];\n            d2 += wg2[l] * ys[np - windowSize + l];\n        }\n        if (constantH) {\n            ans[half - i - 1] = d1 / hs;\n            ans[np - half + i] = d2 / hs;\n        }\n        else {\n            hs = getHs(xs, half - i - 1, half, derivative);\n            ans[half - i - 1] = d1 / hs;\n            hs = getHs(xs, np - half + i, half, derivative);\n            ans[np - half + i] = d2 / hs;\n        }\n    }\n    //For the internal points\n    const wg = weights[half];\n    for (let i = windowSize; i <= np; i++) {\n        let d = 0;\n        for (let l = 0; l < windowSize; l++)\n            d += wg[l] * ys[l + i - windowSize];\n        if (!constantH) {\n            hs = getHs(xs, i - half - 1, half, derivative);\n        }\n        ans[i - half - 1] = d / hs;\n    }\n    return ans;\n}\nfunction getHs(h, center, half, derivative) {\n    let hs = 0;\n    let count = 0;\n    for (let i = center - half; i < center + half; i++) {\n        if (i >= 0 && i < h.length - 1) {\n            hs += h[i + 1] - h[i];\n            count++;\n        }\n    }\n    return (hs / count) ** derivative;\n}\nfunction gramPoly(i, m, k, s) {\n    let Grampoly = 0;\n    if (k > 0) {\n        Grampoly =\n            ((4 * k - 2) / (k * (2 * m - k + 1))) *\n                (i * gramPoly(i, m, k - 1, s) + s * gramPoly(i, m, k - 1, s - 1)) -\n                (((k - 1) * (2 * m + k)) / (k * (2 * m - k + 1))) *\n                    gramPoly(i, m, k - 2, s);\n    }\n    else if (k === 0 && s === 0) {\n        Grampoly = 1;\n    }\n    else {\n        Grampoly = 0;\n    }\n    return Grampoly;\n}\nfunction genFact(a, b) {\n    let gf = 1;\n    if (a >= b) {\n        for (let j = a - b + 1; j <= a; j++) {\n            gf *= j;\n        }\n    }\n    return gf;\n}\nfunction weight(i, t, m, n, s) {\n    let sum = 0;\n    for (let k = 0; k <= n; k++) {\n        sum +=\n            (2 * k + 1) *\n                (genFact(2 * m, k) / genFact(2 * m + k + 1, k + 1)) *\n                gramPoly(i, m, k, 0) *\n                gramPoly(t, m, k, s);\n    }\n    return sum;\n}\n/**\n * Compute the full weights matrix for every position inside the window.\n * @param m - Number of points.\n * @param n - Polynomial grade.\n * @param s - Derivative.\n * @returns Array of Float64Array weight vectors, one per position in the window.\n */\nfunction fullWeights(m, n, s) {\n    const weights = new Array(m);\n    const np = Math.floor(m / 2);\n    for (let t = -np; t <= np; t++) {\n        weights[t + np] = new Float64Array(m);\n        for (let j = -np; j <= np; j++) {\n            weights[t + np][j + np] = weight(j, t, np, n, s);\n        }\n    }\n    return weights;\n}\n//# sourceMappingURL=index.js.map","// eslint-disable-next-line @typescript-eslint/unbound-method\nconst toString = Object.prototype.toString;\n/**\n * Checks if an object is an instance of an Array (array or typed array, except those that contain bigint values).\n * @param value - Object to check.\n * @returns True if the object is an array or a typed array.\n */\nexport function isAnyArray(value) {\n    const tag = toString.call(value);\n    return tag.endsWith('Array]') && !tag.includes('Big');\n}\n//# sourceMappingURL=index.js.map","import { isAnyArray } from 'is-any-array';\n/**\n * Calculates the median of an array.\n * @param input - Array containing values\n * @param options\n * @returns - median\n */\nexport function xMedian(input, options = {}) {\n    if (!isAnyArray(input)) {\n        throw new TypeError('input must be an array');\n    }\n    if (input.length === 0) {\n        throw new TypeError('input must not be empty');\n    }\n    const { exact = false } = options || {};\n    const array = input.slice();\n    const middleIndex = calcMiddle(0, array.length - 1);\n    const median = quickSelect(array, middleIndex);\n    if (array.length % 2 === 1 || !exact) {\n        return median;\n    }\n    const medianNext = quickSelect(array, middleIndex + 1);\n    return (median + medianNext) / 2;\n}\nfunction quickSelect(array, middleIndex) {\n    let low = 0;\n    let high = array.length - 1;\n    let middle = 0;\n    let currentLow = 0;\n    let currentHigh = 0;\n    while (true) {\n        if (high <= low) {\n            return array[middleIndex];\n        }\n        if (high === low + 1) {\n            if (array[low] > array[high]) {\n                swap(array, low, high);\n            }\n            return array[middleIndex];\n        }\n        // Find median of low, middle and high items; swap into position low\n        middle = calcMiddle(low, high);\n        if (array[middle] > array[high])\n            swap(array, middle, high);\n        if (array[low] > array[high])\n            swap(array, low, high);\n        if (array[middle] > array[low])\n            swap(array, middle, low);\n        // Swap low item (now in position middle) into position (low+1)\n        swap(array, middle, low + 1);\n        // Nibble from each end towards middle, swapping items when stuck\n        currentLow = low + 1;\n        currentHigh = high;\n        while (true) {\n            do\n                currentLow++;\n            while (array[low] > array[currentLow]);\n            do\n                currentHigh--;\n            while (array[currentHigh] > array[low]);\n            if (currentHigh < currentLow) {\n                break;\n            }\n            swap(array, currentLow, currentHigh);\n        }\n        // Swap middle item (in position low) back into correct position\n        swap(array, low, currentHigh);\n        // Re-set active partition\n        if (currentHigh <= middleIndex) {\n            low = currentLow;\n        }\n        if (currentHigh >= middleIndex) {\n            high = currentHigh - 1;\n        }\n    }\n}\nfunction swap(array, i, j) {\n    const temp = array[j];\n    array[j] = array[i];\n    array[i] = temp;\n}\nfunction calcMiddle(i, j) {\n    return Math.floor((i + j) / 2);\n}\n//# sourceMappingURL=xMedian.js.map","import { isAnyArray } from 'is-any-array';\n/**\n * Checks if the input is a non-empty array of numbers.\n * Only checks the first element.\n * @param input - Array to check.\n * @param options - Additional checks.\n */\nexport function xCheck(input, options = {}) {\n    const { minLength } = options;\n    if (!isAnyArray(input)) {\n        throw new TypeError('input must be an array');\n    }\n    if (input.length === 0) {\n        throw new TypeError('input must not be empty');\n    }\n    if (typeof input[0] !== 'number') {\n        throw new TypeError('input must contain numbers');\n    }\n    if (minLength && input.length < minLength) {\n        throw new Error(`input must have a length of at least ${minLength}`);\n    }\n}\n//# sourceMappingURL=xCheck.js.map","/**\n * Returns the closest index of a `target`\n * @param array - array of numbers\n * @param target - target\n * @param options\n * @returns - closest index\n */\nexport function xFindClosestIndex(array, target, options = {}) {\n    const { sorted = true } = options;\n    if (sorted) {\n        let low = 0;\n        let high = array.length - 1;\n        let middle = 0;\n        while (high - low > 1) {\n            middle = low + ((high - low) >> 1);\n            if (array[middle] < target) {\n                low = middle;\n            }\n            else if (array[middle] > target) {\n                high = middle;\n            }\n            else {\n                return middle;\n            }\n        }\n        if (low < array.length - 1) {\n            if (Math.abs(target - array[low]) < Math.abs(array[low + 1] - target)) {\n                return low;\n            }\n            else {\n                return low + 1;\n            }\n        }\n        else {\n            return low;\n        }\n    }\n    else {\n        let index = 0;\n        let diff = Number.POSITIVE_INFINITY;\n        for (let i = 0; i < array.length; i++) {\n            const currentDiff = Math.abs(array[i] - target);\n            if (currentDiff < diff) {\n                diff = currentDiff;\n                index = i;\n            }\n        }\n        return index;\n    }\n}\n//# sourceMappingURL=xFindClosestIndex.js.map","import { xFindClosestIndex } from \"./xFindClosestIndex.js\";\n/**\n * Returns an object with {fromIndex, toIndex} for a specific from / to\n * @param x - array of numbers\n * @param options - Options\n */\nexport function xGetFromToIndex(x, options = {}) {\n    let { fromIndex, toIndex } = options;\n    const { from, to } = options;\n    if (fromIndex === undefined) {\n        if (from !== undefined) {\n            fromIndex = xFindClosestIndex(x, from);\n        }\n        else {\n            fromIndex = 0;\n        }\n    }\n    if (toIndex === undefined) {\n        if (to !== undefined) {\n            toIndex = xFindClosestIndex(x, to);\n        }\n        else {\n            toIndex = x.length - 1;\n        }\n    }\n    if (fromIndex < 0)\n        fromIndex = 0;\n    if (toIndex < 0)\n        toIndex = 0;\n    if (fromIndex >= x.length)\n        fromIndex = x.length - 1;\n    if (toIndex >= x.length)\n        toIndex = x.length - 1;\n    if (fromIndex > toIndex)\n        [fromIndex, toIndex] = [toIndex, fromIndex];\n    return { fromIndex, toIndex };\n}\n//# sourceMappingURL=xGetFromToIndex.js.map","'use strict';\n\nObject.defineProperty(exports, '__esModule', { value: true });\n\n// eslint-disable-next-line @typescript-eslint/unbound-method\nconst toString = Object.prototype.toString;\n/**\n * Checks if an object is an instance of an Array (array or typed array, except those that contain bigint values).\n * @param value - Object to check.\n * @returns True if the object is an array or a typed array.\n */\nfunction isAnyArray(value) {\n    const tag = toString.call(value);\n    return tag.endsWith('Array]') && !tag.includes('Big');\n}\n\n/**\n * Computes the maximum of the given values.\n *\n * @param input\n * @param options\n */\nfunction max(input, options = {}) {\n    if (!isAnyArray(input)) {\n        throw new TypeError('input must be an array');\n    }\n    if (input.length === 0) {\n        throw new TypeError('input must not be empty');\n    }\n    const { fromIndex = 0, toIndex = input.length } = options;\n    if (fromIndex < 0 ||\n        fromIndex >= input.length ||\n        !Number.isInteger(fromIndex)) {\n        throw new Error('fromIndex must be a positive integer smaller than length');\n    }\n    if (toIndex <= fromIndex ||\n        toIndex > input.length ||\n        !Number.isInteger(toIndex)) {\n        throw new Error('toIndex must be an integer greater than fromIndex and at most equal to length');\n    }\n    let maxValue = input[fromIndex];\n    for (let i = fromIndex + 1; i < toIndex; i++) {\n        if (input[i] > maxValue)\n            maxValue = input[i];\n    }\n    return maxValue;\n}\n\n/**\n * Computes the minimum of the given values.\n */\nfunction min(input, options = {}) {\n    if (!isAnyArray(input)) {\n        throw new TypeError('input must be an array');\n    }\n    if (input.length === 0) {\n        throw new TypeError('input must not be empty');\n    }\n    const { fromIndex = 0, toIndex = input.length } = options;\n    if (fromIndex < 0 ||\n        fromIndex >= input.length ||\n        !Number.isInteger(fromIndex)) {\n        throw new Error('fromIndex must be a positive integer smaller than length');\n    }\n    if (toIndex <= fromIndex ||\n        toIndex > input.length ||\n        !Number.isInteger(toIndex)) {\n        throw new Error('toIndex must be an integer greater than fromIndex and at most equal to length');\n    }\n    let minValue = input[fromIndex];\n    for (let i = fromIndex + 1; i < toIndex; i++) {\n        if (input[i] < minValue)\n            minValue = input[i];\n    }\n    return minValue;\n}\n\n/**\n * Rescale an array into a range.\n */\nfunction rescale(input, options = {}) {\n    if (!isAnyArray(input)) {\n        throw new TypeError('input must be an array');\n    }\n    else if (input.length === 0) {\n        throw new TypeError('input must not be empty');\n    }\n    let output;\n    if (options.output !== undefined) {\n        if (!isAnyArray(options.output)) {\n            throw new TypeError('output option must be an array if specified');\n        }\n        output = options.output;\n    }\n    else {\n        output = new Array(input.length);\n    }\n    const currentMin = min(input);\n    const currentMax = max(input);\n    if (currentMin === currentMax) {\n        throw new RangeError('minimum and maximum input values are equal. Cannot rescale a constant array');\n    }\n    const { min: minValue = options.autoMinMax ? currentMin : 0, max: maxValue = options.autoMinMax ? currentMax : 1, } = options;\n    if (minValue >= maxValue) {\n        throw new RangeError('min option must be smaller than max option');\n    }\n    const factor = (maxValue - minValue) / (currentMax - currentMin);\n    for (let i = 0; i < input.length; i++) {\n        output[i] = (input[i] - currentMin) * factor + minValue;\n    }\n    return output;\n}\n\nconst indent = ' '.repeat(2);\nconst indentData = ' '.repeat(4);\n\n/**\n * @this {Matrix}\n * @returns {string}\n */\nfunction inspectMatrix() {\n  return inspectMatrixWithOptions(this);\n}\n\nfunction inspectMatrixWithOptions(matrix, options = {}) {\n  const {\n    maxRows = 15,\n    maxColumns = 10,\n    maxNumSize = 8,\n    padMinus = 'auto',\n  } = options;\n  return `${matrix.constructor.name} {\n${indent}[\n${indentData}${inspectData(matrix, maxRows, maxColumns, maxNumSize, padMinus)}\n${indent}]\n${indent}rows: ${matrix.rows}\n${indent}columns: ${matrix.columns}\n}`;\n}\n\nfunction inspectData(matrix, maxRows, maxColumns, maxNumSize, padMinus) {\n  const { rows, columns } = matrix;\n  const maxI = Math.min(rows, maxRows);\n  const maxJ = Math.min(columns, maxColumns);\n  const result = [];\n\n  if (padMinus === 'auto') {\n    padMinus = false;\n    loop: for (let i = 0; i < maxI; i++) {\n      for (let j = 0; j < maxJ; j++) {\n        if (matrix.get(i, j) < 0) {\n          padMinus = true;\n          break loop;\n        }\n      }\n    }\n  }\n\n  for (let i = 0; i < maxI; i++) {\n    let line = [];\n    for (let j = 0; j < maxJ; j++) {\n      line.push(formatNumber(matrix.get(i, j), maxNumSize, padMinus));\n    }\n    result.push(`${line.join(' ')}`);\n  }\n  if (maxJ !== columns) {\n    result[result.length - 1] += ` ... ${columns - maxColumns} more columns`;\n  }\n  if (maxI !== rows) {\n    result.push(`... ${rows - maxRows} more rows`);\n  }\n  return result.join(`\\n${indentData}`);\n}\n\nfunction formatNumber(num, maxNumSize, padMinus) {\n  return (\n    num >= 0 && padMinus\n      ? ` ${formatNumber2(num, maxNumSize - 1)}`\n      : formatNumber2(num, maxNumSize)\n  ).padEnd(maxNumSize);\n}\n\nfunction formatNumber2(num, len) {\n  // small.length numbers should be as is\n  let str = num.toString();\n  if (str.length <= len) return str;\n\n  // (7)'0.00123' is better then (7)'1.23e-2'\n  // (8)'0.000123' is worse then (7)'1.23e-3',\n  let fix = num.toFixed(len);\n  if (fix.length > len) {\n    fix = num.toFixed(Math.max(0, len - (fix.length - len)));\n  }\n  if (\n    fix.length <= len &&\n    !fix.startsWith('0.000') &&\n    !fix.startsWith('-0.000')\n  ) {\n    return fix;\n  }\n\n  // well, if it's still too long the user should've used longer numbers\n  let exp = num.toExponential(len);\n  if (exp.length > len) {\n    exp = num.toExponential(Math.max(0, len - (exp.length - len)));\n  }\n  return exp.slice(0);\n}\n\nfunction installMathOperations(AbstractMatrix, Matrix) {\n  AbstractMatrix.prototype.add = function add(value) {\n    if (typeof value === 'number') return this.addS(value);\n    return this.addM(value);\n  };\n\n  AbstractMatrix.prototype.addS = function addS(value) {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) + value);\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.prototype.addM = function addM(matrix) {\n    matrix = Matrix.checkMatrix(matrix);\n    if (this.rows !== matrix.rows ||\n      this.columns !== matrix.columns) {\n      throw new RangeError('Matrices dimensions must be equal');\n    }\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) + matrix.get(i, j));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.add = function add(matrix, value) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.add(value);\n  };\n\n  AbstractMatrix.prototype.sub = function sub(value) {\n    if (typeof value === 'number') return this.subS(value);\n    return this.subM(value);\n  };\n\n  AbstractMatrix.prototype.subS = function subS(value) {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) - value);\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.prototype.subM = function subM(matrix) {\n    matrix = Matrix.checkMatrix(matrix);\n    if (this.rows !== matrix.rows ||\n      this.columns !== matrix.columns) {\n      throw new RangeError('Matrices dimensions must be equal');\n    }\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) - matrix.get(i, j));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.sub = function sub(matrix, value) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.sub(value);\n  };\n  AbstractMatrix.prototype.subtract = AbstractMatrix.prototype.sub;\n  AbstractMatrix.prototype.subtractS = AbstractMatrix.prototype.subS;\n  AbstractMatrix.prototype.subtractM = AbstractMatrix.prototype.subM;\n  AbstractMatrix.subtract = AbstractMatrix.sub;\n\n  AbstractMatrix.prototype.mul = function mul(value) {\n    if (typeof value === 'number') return this.mulS(value);\n    return this.mulM(value);\n  };\n\n  AbstractMatrix.prototype.mulS = function mulS(value) {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) * value);\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.prototype.mulM = function mulM(matrix) {\n    matrix = Matrix.checkMatrix(matrix);\n    if (this.rows !== matrix.rows ||\n      this.columns !== matrix.columns) {\n      throw new RangeError('Matrices dimensions must be equal');\n    }\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) * matrix.get(i, j));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.mul = function mul(matrix, value) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.mul(value);\n  };\n  AbstractMatrix.prototype.multiply = AbstractMatrix.prototype.mul;\n  AbstractMatrix.prototype.multiplyS = AbstractMatrix.prototype.mulS;\n  AbstractMatrix.prototype.multiplyM = AbstractMatrix.prototype.mulM;\n  AbstractMatrix.multiply = AbstractMatrix.mul;\n\n  AbstractMatrix.prototype.div = function div(value) {\n    if (typeof value === 'number') return this.divS(value);\n    return this.divM(value);\n  };\n\n  AbstractMatrix.prototype.divS = function divS(value) {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) / value);\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.prototype.divM = function divM(matrix) {\n    matrix = Matrix.checkMatrix(matrix);\n    if (this.rows !== matrix.rows ||\n      this.columns !== matrix.columns) {\n      throw new RangeError('Matrices dimensions must be equal');\n    }\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) / matrix.get(i, j));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.div = function div(matrix, value) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.div(value);\n  };\n  AbstractMatrix.prototype.divide = AbstractMatrix.prototype.div;\n  AbstractMatrix.prototype.divideS = AbstractMatrix.prototype.divS;\n  AbstractMatrix.prototype.divideM = AbstractMatrix.prototype.divM;\n  AbstractMatrix.divide = AbstractMatrix.div;\n\n  AbstractMatrix.prototype.mod = function mod(value) {\n    if (typeof value === 'number') return this.modS(value);\n    return this.modM(value);\n  };\n\n  AbstractMatrix.prototype.modS = function modS(value) {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) % value);\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.prototype.modM = function modM(matrix) {\n    matrix = Matrix.checkMatrix(matrix);\n    if (this.rows !== matrix.rows ||\n      this.columns !== matrix.columns) {\n      throw new RangeError('Matrices dimensions must be equal');\n    }\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) % matrix.get(i, j));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.mod = function mod(matrix, value) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.mod(value);\n  };\n  AbstractMatrix.prototype.modulus = AbstractMatrix.prototype.mod;\n  AbstractMatrix.prototype.modulusS = AbstractMatrix.prototype.modS;\n  AbstractMatrix.prototype.modulusM = AbstractMatrix.prototype.modM;\n  AbstractMatrix.modulus = AbstractMatrix.mod;\n\n  AbstractMatrix.prototype.and = function and(value) {\n    if (typeof value === 'number') return this.andS(value);\n    return this.andM(value);\n  };\n\n  AbstractMatrix.prototype.andS = function andS(value) {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) & value);\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.prototype.andM = function andM(matrix) {\n    matrix = Matrix.checkMatrix(matrix);\n    if (this.rows !== matrix.rows ||\n      this.columns !== matrix.columns) {\n      throw new RangeError('Matrices dimensions must be equal');\n    }\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) & matrix.get(i, j));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.and = function and(matrix, value) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.and(value);\n  };\n\n  AbstractMatrix.prototype.or = function or(value) {\n    if (typeof value === 'number') return this.orS(value);\n    return this.orM(value);\n  };\n\n  AbstractMatrix.prototype.orS = function orS(value) {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) | value);\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.prototype.orM = function orM(matrix) {\n    matrix = Matrix.checkMatrix(matrix);\n    if (this.rows !== matrix.rows ||\n      this.columns !== matrix.columns) {\n      throw new RangeError('Matrices dimensions must be equal');\n    }\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) | matrix.get(i, j));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.or = function or(matrix, value) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.or(value);\n  };\n\n  AbstractMatrix.prototype.xor = function xor(value) {\n    if (typeof value === 'number') return this.xorS(value);\n    return this.xorM(value);\n  };\n\n  AbstractMatrix.prototype.xorS = function xorS(value) {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) ^ value);\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.prototype.xorM = function xorM(matrix) {\n    matrix = Matrix.checkMatrix(matrix);\n    if (this.rows !== matrix.rows ||\n      this.columns !== matrix.columns) {\n      throw new RangeError('Matrices dimensions must be equal');\n    }\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) ^ matrix.get(i, j));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.xor = function xor(matrix, value) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.xor(value);\n  };\n\n  AbstractMatrix.prototype.leftShift = function leftShift(value) {\n    if (typeof value === 'number') return this.leftShiftS(value);\n    return this.leftShiftM(value);\n  };\n\n  AbstractMatrix.prototype.leftShiftS = function leftShiftS(value) {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) << value);\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.prototype.leftShiftM = function leftShiftM(matrix) {\n    matrix = Matrix.checkMatrix(matrix);\n    if (this.rows !== matrix.rows ||\n      this.columns !== matrix.columns) {\n      throw new RangeError('Matrices dimensions must be equal');\n    }\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) << matrix.get(i, j));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.leftShift = function leftShift(matrix, value) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.leftShift(value);\n  };\n\n  AbstractMatrix.prototype.signPropagatingRightShift = function signPropagatingRightShift(value) {\n    if (typeof value === 'number') return this.signPropagatingRightShiftS(value);\n    return this.signPropagatingRightShiftM(value);\n  };\n\n  AbstractMatrix.prototype.signPropagatingRightShiftS = function signPropagatingRightShiftS(value) {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) >> value);\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.prototype.signPropagatingRightShiftM = function signPropagatingRightShiftM(matrix) {\n    matrix = Matrix.checkMatrix(matrix);\n    if (this.rows !== matrix.rows ||\n      this.columns !== matrix.columns) {\n      throw new RangeError('Matrices dimensions must be equal');\n    }\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) >> matrix.get(i, j));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.signPropagatingRightShift = function signPropagatingRightShift(matrix, value) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.signPropagatingRightShift(value);\n  };\n\n  AbstractMatrix.prototype.rightShift = function rightShift(value) {\n    if (typeof value === 'number') return this.rightShiftS(value);\n    return this.rightShiftM(value);\n  };\n\n  AbstractMatrix.prototype.rightShiftS = function rightShiftS(value) {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) >>> value);\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.prototype.rightShiftM = function rightShiftM(matrix) {\n    matrix = Matrix.checkMatrix(matrix);\n    if (this.rows !== matrix.rows ||\n      this.columns !== matrix.columns) {\n      throw new RangeError('Matrices dimensions must be equal');\n    }\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) >>> matrix.get(i, j));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.rightShift = function rightShift(matrix, value) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.rightShift(value);\n  };\n  AbstractMatrix.prototype.zeroFillRightShift = AbstractMatrix.prototype.rightShift;\n  AbstractMatrix.prototype.zeroFillRightShiftS = AbstractMatrix.prototype.rightShiftS;\n  AbstractMatrix.prototype.zeroFillRightShiftM = AbstractMatrix.prototype.rightShiftM;\n  AbstractMatrix.zeroFillRightShift = AbstractMatrix.rightShift;\n\n  AbstractMatrix.prototype.not = function not() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, ~(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.not = function not(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.not();\n  };\n\n  AbstractMatrix.prototype.abs = function abs() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.abs(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.abs = function abs(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.abs();\n  };\n\n  AbstractMatrix.prototype.acos = function acos() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.acos(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.acos = function acos(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.acos();\n  };\n\n  AbstractMatrix.prototype.acosh = function acosh() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.acosh(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.acosh = function acosh(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.acosh();\n  };\n\n  AbstractMatrix.prototype.asin = function asin() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.asin(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.asin = function asin(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.asin();\n  };\n\n  AbstractMatrix.prototype.asinh = function asinh() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.asinh(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.asinh = function asinh(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.asinh();\n  };\n\n  AbstractMatrix.prototype.atan = function atan() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.atan(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.atan = function atan(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.atan();\n  };\n\n  AbstractMatrix.prototype.atanh = function atanh() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.atanh(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.atanh = function atanh(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.atanh();\n  };\n\n  AbstractMatrix.prototype.cbrt = function cbrt() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.cbrt(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.cbrt = function cbrt(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.cbrt();\n  };\n\n  AbstractMatrix.prototype.ceil = function ceil() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.ceil(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.ceil = function ceil(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.ceil();\n  };\n\n  AbstractMatrix.prototype.clz32 = function clz32() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.clz32(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.clz32 = function clz32(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.clz32();\n  };\n\n  AbstractMatrix.prototype.cos = function cos() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.cos(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.cos = function cos(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.cos();\n  };\n\n  AbstractMatrix.prototype.cosh = function cosh() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.cosh(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.cosh = function cosh(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.cosh();\n  };\n\n  AbstractMatrix.prototype.exp = function exp() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.exp(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.exp = function exp(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.exp();\n  };\n\n  AbstractMatrix.prototype.expm1 = function expm1() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.expm1(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.expm1 = function expm1(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.expm1();\n  };\n\n  AbstractMatrix.prototype.floor = function floor() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.floor(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.floor = function floor(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.floor();\n  };\n\n  AbstractMatrix.prototype.fround = function fround() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.fround(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.fround = function fround(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.fround();\n  };\n\n  AbstractMatrix.prototype.log = function log() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.log(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.log = function log(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.log();\n  };\n\n  AbstractMatrix.prototype.log1p = function log1p() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.log1p(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.log1p = function log1p(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.log1p();\n  };\n\n  AbstractMatrix.prototype.log10 = function log10() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.log10(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.log10 = function log10(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.log10();\n  };\n\n  AbstractMatrix.prototype.log2 = function log2() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.log2(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.log2 = function log2(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.log2();\n  };\n\n  AbstractMatrix.prototype.round = function round() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.round(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.round = function round(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.round();\n  };\n\n  AbstractMatrix.prototype.sign = function sign() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.sign(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.sign = function sign(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.sign();\n  };\n\n  AbstractMatrix.prototype.sin = function sin() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.sin(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.sin = function sin(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.sin();\n  };\n\n  AbstractMatrix.prototype.sinh = function sinh() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.sinh(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.sinh = function sinh(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.sinh();\n  };\n\n  AbstractMatrix.prototype.sqrt = function sqrt() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.sqrt(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.sqrt = function sqrt(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.sqrt();\n  };\n\n  AbstractMatrix.prototype.tan = function tan() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.tan(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.tan = function tan(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.tan();\n  };\n\n  AbstractMatrix.prototype.tanh = function tanh() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.tanh(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.tanh = function tanh(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.tanh();\n  };\n\n  AbstractMatrix.prototype.trunc = function trunc() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.trunc(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.trunc = function trunc(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.trunc();\n  };\n\n  AbstractMatrix.pow = function pow(matrix, arg0) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.pow(arg0);\n  };\n\n  AbstractMatrix.prototype.pow = function pow(value) {\n    if (typeof value === 'number') return this.powS(value);\n    return this.powM(value);\n  };\n\n  AbstractMatrix.prototype.powS = function powS(value) {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) ** value);\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.prototype.powM = function powM(matrix) {\n    matrix = Matrix.checkMatrix(matrix);\n    if (this.rows !== matrix.rows ||\n      this.columns !== matrix.columns) {\n      throw new RangeError('Matrices dimensions must be equal');\n    }\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) ** matrix.get(i, j));\n      }\n    }\n    return this;\n  };\n}\n\n/**\n * @private\n * Check that a row index is not out of bounds\n * @param {Matrix} matrix\n * @param {number} index\n * @param {boolean} [outer]\n */\nfunction checkRowIndex(matrix, index, outer) {\n  let max = outer ? matrix.rows : matrix.rows - 1;\n  if (index < 0 || index > max) {\n    throw new RangeError('Row index out of range');\n  }\n}\n\n/**\n * @private\n * Check that a column index is not out of bounds\n * @param {Matrix} matrix\n * @param {number} index\n * @param {boolean} [outer]\n */\nfunction checkColumnIndex(matrix, index, outer) {\n  let max = outer ? matrix.columns : matrix.columns - 1;\n  if (index < 0 || index > max) {\n    throw new RangeError('Column index out of range');\n  }\n}\n\n/**\n * @private\n * Check that the provided vector is an array with the right length\n * @param {Matrix} matrix\n * @param {Array|Matrix} vector\n * @return {Array}\n * @throws {RangeError}\n */\nfunction checkRowVector(matrix, vector) {\n  if (vector.to1DArray) {\n    vector = vector.to1DArray();\n  }\n  if (vector.length !== matrix.columns) {\n    throw new RangeError(\n      'vector size must be the same as the number of columns',\n    );\n  }\n  return vector;\n}\n\n/**\n * @private\n * Check that the provided vector is an array with the right length\n * @param {Matrix} matrix\n * @param {Array|Matrix} vector\n * @return {Array}\n * @throws {RangeError}\n */\nfunction checkColumnVector(matrix, vector) {\n  if (vector.to1DArray) {\n    vector = vector.to1DArray();\n  }\n  if (vector.length !== matrix.rows) {\n    throw new RangeError('vector size must be the same as the number of rows');\n  }\n  return vector;\n}\n\nfunction checkRowIndices(matrix, rowIndices) {\n  if (!isAnyArray(rowIndices)) {\n    throw new TypeError('row indices must be an array');\n  }\n\n  for (let i = 0; i < rowIndices.length; i++) {\n    if (rowIndices[i] < 0 || rowIndices[i] >= matrix.rows) {\n      throw new RangeError('row indices are out of range');\n    }\n  }\n}\n\nfunction checkColumnIndices(matrix, columnIndices) {\n  if (!isAnyArray(columnIndices)) {\n    throw new TypeError('column indices must be an array');\n  }\n\n  for (let i = 0; i < columnIndices.length; i++) {\n    if (columnIndices[i] < 0 || columnIndices[i] >= matrix.columns) {\n      throw new RangeError('column indices are out of range');\n    }\n  }\n}\n\nfunction checkRange(matrix, startRow, endRow, startColumn, endColumn) {\n  if (arguments.length !== 5) {\n    throw new RangeError('expected 4 arguments');\n  }\n  checkNumber('startRow', startRow);\n  checkNumber('endRow', endRow);\n  checkNumber('startColumn', startColumn);\n  checkNumber('endColumn', endColumn);\n  if (\n    startRow > endRow ||\n    startColumn > endColumn ||\n    startRow < 0 ||\n    startRow >= matrix.rows ||\n    endRow < 0 ||\n    endRow >= matrix.rows ||\n    startColumn < 0 ||\n    startColumn >= matrix.columns ||\n    endColumn < 0 ||\n    endColumn >= matrix.columns\n  ) {\n    throw new RangeError('Submatrix indices are out of range');\n  }\n}\n\nfunction newArray(length, value = 0) {\n  let array = [];\n  for (let i = 0; i < length; i++) {\n    array.push(value);\n  }\n  return array;\n}\n\nfunction checkNumber(name, value) {\n  if (typeof value !== 'number') {\n    throw new TypeError(`${name} must be a number`);\n  }\n}\n\nfunction checkNonEmpty(matrix) {\n  if (matrix.isEmpty()) {\n    throw new Error('Empty matrix has no elements to index');\n  }\n}\n\nfunction sumByRow(matrix) {\n  let sum = newArray(matrix.rows);\n  for (let i = 0; i < matrix.rows; ++i) {\n    for (let j = 0; j < matrix.columns; ++j) {\n      sum[i] += matrix.get(i, j);\n    }\n  }\n  return sum;\n}\n\nfunction sumByColumn(matrix) {\n  let sum = newArray(matrix.columns);\n  for (let i = 0; i < matrix.rows; ++i) {\n    for (let j = 0; j < matrix.columns; ++j) {\n      sum[j] += matrix.get(i, j);\n    }\n  }\n  return sum;\n}\n\nfunction sumAll(matrix) {\n  let v = 0;\n  for (let i = 0; i < matrix.rows; i++) {\n    for (let j = 0; j < matrix.columns; j++) {\n      v += matrix.get(i, j);\n    }\n  }\n  return v;\n}\n\nfunction productByRow(matrix) {\n  let sum = newArray(matrix.rows, 1);\n  for (let i = 0; i < matrix.rows; ++i) {\n    for (let j = 0; j < matrix.columns; ++j) {\n      sum[i] *= matrix.get(i, j);\n    }\n  }\n  return sum;\n}\n\nfunction productByColumn(matrix) {\n  let sum = newArray(matrix.columns, 1);\n  for (let i = 0; i < matrix.rows; ++i) {\n    for (let j = 0; j < matrix.columns; ++j) {\n      sum[j] *= matrix.get(i, j);\n    }\n  }\n  return sum;\n}\n\nfunction productAll(matrix) {\n  let v = 1;\n  for (let i = 0; i < matrix.rows; i++) {\n    for (let j = 0; j < matrix.columns; j++) {\n      v *= matrix.get(i, j);\n    }\n  }\n  return v;\n}\n\nfunction varianceByRow(matrix, unbiased, mean) {\n  const rows = matrix.rows;\n  const cols = matrix.columns;\n  const variance = [];\n\n  for (let i = 0; i < rows; i++) {\n    let sum1 = 0;\n    let sum2 = 0;\n    let x = 0;\n    for (let j = 0; j < cols; j++) {\n      x = matrix.get(i, j) - mean[i];\n      sum1 += x;\n      sum2 += x * x;\n    }\n    if (unbiased) {\n      variance.push((sum2 - (sum1 * sum1) / cols) / (cols - 1));\n    } else {\n      variance.push((sum2 - (sum1 * sum1) / cols) / cols);\n    }\n  }\n  return variance;\n}\n\nfunction varianceByColumn(matrix, unbiased, mean) {\n  const rows = matrix.rows;\n  const cols = matrix.columns;\n  const variance = [];\n\n  for (let j = 0; j < cols; j++) {\n    let sum1 = 0;\n    let sum2 = 0;\n    let x = 0;\n    for (let i = 0; i < rows; i++) {\n      x = matrix.get(i, j) - mean[j];\n      sum1 += x;\n      sum2 += x * x;\n    }\n    if (unbiased) {\n      variance.push((sum2 - (sum1 * sum1) / rows) / (rows - 1));\n    } else {\n      variance.push((sum2 - (sum1 * sum1) / rows) / rows);\n    }\n  }\n  return variance;\n}\n\nfunction varianceAll(matrix, unbiased, mean) {\n  const rows = matrix.rows;\n  const cols = matrix.columns;\n  const size = rows * cols;\n\n  let sum1 = 0;\n  let sum2 = 0;\n  let x = 0;\n  for (let i = 0; i < rows; i++) {\n    for (let j = 0; j < cols; j++) {\n      x = matrix.get(i, j) - mean;\n      sum1 += x;\n      sum2 += x * x;\n    }\n  }\n  if (unbiased) {\n    return (sum2 - (sum1 * sum1) / size) / (size - 1);\n  } else {\n    return (sum2 - (sum1 * sum1) / size) / size;\n  }\n}\n\nfunction centerByRow(matrix, mean) {\n  for (let i = 0; i < matrix.rows; i++) {\n    for (let j = 0; j < matrix.columns; j++) {\n      matrix.set(i, j, matrix.get(i, j) - mean[i]);\n    }\n  }\n}\n\nfunction centerByColumn(matrix, mean) {\n  for (let i = 0; i < matrix.rows; i++) {\n    for (let j = 0; j < matrix.columns; j++) {\n      matrix.set(i, j, matrix.get(i, j) - mean[j]);\n    }\n  }\n}\n\nfunction centerAll(matrix, mean) {\n  for (let i = 0; i < matrix.rows; i++) {\n    for (let j = 0; j < matrix.columns; j++) {\n      matrix.set(i, j, matrix.get(i, j) - mean);\n    }\n  }\n}\n\nfunction getScaleByRow(matrix) {\n  const scale = [];\n  for (let i = 0; i < matrix.rows; i++) {\n    let sum = 0;\n    for (let j = 0; j < matrix.columns; j++) {\n      sum += matrix.get(i, j) ** 2 / (matrix.columns - 1);\n    }\n    scale.push(Math.sqrt(sum));\n  }\n  return scale;\n}\n\nfunction scaleByRow(matrix, scale) {\n  for (let i = 0; i < matrix.rows; i++) {\n    for (let j = 0; j < matrix.columns; j++) {\n      matrix.set(i, j, matrix.get(i, j) / scale[i]);\n    }\n  }\n}\n\nfunction getScaleByColumn(matrix) {\n  const scale = [];\n  for (let j = 0; j < matrix.columns; j++) {\n    let sum = 0;\n    for (let i = 0; i < matrix.rows; i++) {\n      sum += matrix.get(i, j) ** 2 / (matrix.rows - 1);\n    }\n    scale.push(Math.sqrt(sum));\n  }\n  return scale;\n}\n\nfunction scaleByColumn(matrix, scale) {\n  for (let i = 0; i < matrix.rows; i++) {\n    for (let j = 0; j < matrix.columns; j++) {\n      matrix.set(i, j, matrix.get(i, j) / scale[j]);\n    }\n  }\n}\n\nfunction getScaleAll(matrix) {\n  const divider = matrix.size - 1;\n  let sum = 0;\n  for (let j = 0; j < matrix.columns; j++) {\n    for (let i = 0; i < matrix.rows; i++) {\n      sum += matrix.get(i, j) ** 2 / divider;\n    }\n  }\n  return Math.sqrt(sum);\n}\n\nfunction scaleAll(matrix, scale) {\n  for (let i = 0; i < matrix.rows; i++) {\n    for (let j = 0; j < matrix.columns; j++) {\n      matrix.set(i, j, matrix.get(i, j) / scale);\n    }\n  }\n}\n\nclass AbstractMatrix {\n  static from1DArray(newRows, newColumns, newData) {\n    let length = newRows * newColumns;\n    if (length !== newData.length) {\n      throw new RangeError('data length does not match given dimensions');\n    }\n    let newMatrix = new Matrix(newRows, newColumns);\n    for (let row = 0; row < newRows; row++) {\n      for (let column = 0; column < newColumns; column++) {\n        newMatrix.set(row, column, newData[row * newColumns + column]);\n      }\n    }\n    return newMatrix;\n  }\n\n  static rowVector(newData) {\n    let vector = new Matrix(1, newData.length);\n    for (let i = 0; i < newData.length; i++) {\n      vector.set(0, i, newData[i]);\n    }\n    return vector;\n  }\n\n  static columnVector(newData) {\n    let vector = new Matrix(newData.length, 1);\n    for (let i = 0; i < newData.length; i++) {\n      vector.set(i, 0, newData[i]);\n    }\n    return vector;\n  }\n\n  static zeros(rows, columns) {\n    return new Matrix(rows, columns);\n  }\n\n  static ones(rows, columns) {\n    return new Matrix(rows, columns).fill(1);\n  }\n\n  static rand(rows, columns, options = {}) {\n    if (typeof options !== 'object') {\n      throw new TypeError('options must be an object');\n    }\n    const { random = Math.random } = options;\n    let matrix = new Matrix(rows, columns);\n    for (let i = 0; i < rows; i++) {\n      for (let j = 0; j < columns; j++) {\n        matrix.set(i, j, random());\n      }\n    }\n    return matrix;\n  }\n\n  static randInt(rows, columns, options = {}) {\n    if (typeof options !== 'object') {\n      throw new TypeError('options must be an object');\n    }\n    const { min = 0, max = 1000, random = Math.random } = options;\n    if (!Number.isInteger(min)) throw new TypeError('min must be an integer');\n    if (!Number.isInteger(max)) throw new TypeError('max must be an integer');\n    if (min >= max) throw new RangeError('min must be smaller than max');\n    let interval = max - min;\n    let matrix = new Matrix(rows, columns);\n    for (let i = 0; i < rows; i++) {\n      for (let j = 0; j < columns; j++) {\n        let value = min + Math.round(random() * interval);\n        matrix.set(i, j, value);\n      }\n    }\n    return matrix;\n  }\n\n  static eye(rows, columns, value) {\n    if (columns === undefined) columns = rows;\n    if (value === undefined) value = 1;\n    let min = Math.min(rows, columns);\n    let matrix = this.zeros(rows, columns);\n    for (let i = 0; i < min; i++) {\n      matrix.set(i, i, value);\n    }\n    return matrix;\n  }\n\n  static diag(data, rows, columns) {\n    let l = data.length;\n    if (rows === undefined) rows = l;\n    if (columns === undefined) columns = rows;\n    let min = Math.min(l, rows, columns);\n    let matrix = this.zeros(rows, columns);\n    for (let i = 0; i < min; i++) {\n      matrix.set(i, i, data[i]);\n    }\n    return matrix;\n  }\n\n  static min(matrix1, matrix2) {\n    matrix1 = this.checkMatrix(matrix1);\n    matrix2 = this.checkMatrix(matrix2);\n    let rows = matrix1.rows;\n    let columns = matrix1.columns;\n    let result = new Matrix(rows, columns);\n    for (let i = 0; i < rows; i++) {\n      for (let j = 0; j < columns; j++) {\n        result.set(i, j, Math.min(matrix1.get(i, j), matrix2.get(i, j)));\n      }\n    }\n    return result;\n  }\n\n  static max(matrix1, matrix2) {\n    matrix1 = this.checkMatrix(matrix1);\n    matrix2 = this.checkMatrix(matrix2);\n    let rows = matrix1.rows;\n    let columns = matrix1.columns;\n    let result = new this(rows, columns);\n    for (let i = 0; i < rows; i++) {\n      for (let j = 0; j < columns; j++) {\n        result.set(i, j, Math.max(matrix1.get(i, j), matrix2.get(i, j)));\n      }\n    }\n    return result;\n  }\n\n  static checkMatrix(value) {\n    return AbstractMatrix.isMatrix(value) ? value : new Matrix(value);\n  }\n\n  static isMatrix(value) {\n    return value != null && value.klass === 'Matrix';\n  }\n\n  get size() {\n    return this.rows * this.columns;\n  }\n\n  apply(callback) {\n    if (typeof callback !== 'function') {\n      throw new TypeError('callback must be a function');\n    }\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        callback.call(this, i, j);\n      }\n    }\n    return this;\n  }\n\n  to1DArray() {\n    let array = [];\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        array.push(this.get(i, j));\n      }\n    }\n    return array;\n  }\n\n  to2DArray() {\n    let copy = [];\n    for (let i = 0; i < this.rows; i++) {\n      copy.push([]);\n      for (let j = 0; j < this.columns; j++) {\n        copy[i].push(this.get(i, j));\n      }\n    }\n    return copy;\n  }\n\n  toJSON() {\n    return this.to2DArray();\n  }\n\n  isRowVector() {\n    return this.rows === 1;\n  }\n\n  isColumnVector() {\n    return this.columns === 1;\n  }\n\n  isVector() {\n    return this.rows === 1 || this.columns === 1;\n  }\n\n  isSquare() {\n    return this.rows === this.columns;\n  }\n\n  isEmpty() {\n    return this.rows === 0 || this.columns === 0;\n  }\n\n  isSymmetric() {\n    if (this.isSquare()) {\n      for (let i = 0; i < this.rows; i++) {\n        for (let j = 0; j <= i; j++) {\n          if (this.get(i, j) !== this.get(j, i)) {\n            return false;\n          }\n        }\n      }\n      return true;\n    }\n    return false;\n  }\n\n  isDistance() {\n    if (!this.isSymmetric()) return false;\n\n    for (let i = 0; i < this.rows; i++) {\n      if (this.get(i, i) !== 0) return false;\n    }\n\n    return true;\n  }\n\n  isEchelonForm() {\n    let i = 0;\n    let j = 0;\n    let previousColumn = -1;\n    let isEchelonForm = true;\n    let checked = false;\n    while (i < this.rows && isEchelonForm) {\n      j = 0;\n      checked = false;\n      while (j < this.columns && checked === false) {\n        if (this.get(i, j) === 0) {\n          j++;\n        } else if (this.get(i, j) === 1 && j > previousColumn) {\n          checked = true;\n          previousColumn = j;\n        } else {\n          isEchelonForm = false;\n          checked = true;\n        }\n      }\n      i++;\n    }\n    return isEchelonForm;\n  }\n\n  isReducedEchelonForm() {\n    let i = 0;\n    let j = 0;\n    let previousColumn = -1;\n    let isReducedEchelonForm = true;\n    let checked = false;\n    while (i < this.rows && isReducedEchelonForm) {\n      j = 0;\n      checked = false;\n      while (j < this.columns && checked === false) {\n        if (this.get(i, j) === 0) {\n          j++;\n        } else if (this.get(i, j) === 1 && j > previousColumn) {\n          checked = true;\n          previousColumn = j;\n        } else {\n          isReducedEchelonForm = false;\n          checked = true;\n        }\n      }\n      for (let k = j + 1; k < this.rows; k++) {\n        if (this.get(i, k) !== 0) {\n          isReducedEchelonForm = false;\n        }\n      }\n      i++;\n    }\n    return isReducedEchelonForm;\n  }\n\n  echelonForm() {\n    let result = this.clone();\n    let h = 0;\n    let k = 0;\n    while (h < result.rows && k < result.columns) {\n      let iMax = h;\n      for (let i = h; i < result.rows; i++) {\n        if (result.get(i, k) > result.get(iMax, k)) {\n          iMax = i;\n        }\n      }\n      if (result.get(iMax, k) === 0) {\n        k++;\n      } else {\n        result.swapRows(h, iMax);\n        let tmp = result.get(h, k);\n        for (let j = k; j < result.columns; j++) {\n          result.set(h, j, result.get(h, j) / tmp);\n        }\n        for (let i = h + 1; i < result.rows; i++) {\n          let factor = result.get(i, k) / result.get(h, k);\n          result.set(i, k, 0);\n          for (let j = k + 1; j < result.columns; j++) {\n            result.set(i, j, result.get(i, j) - result.get(h, j) * factor);\n          }\n        }\n        h++;\n        k++;\n      }\n    }\n    return result;\n  }\n\n  reducedEchelonForm() {\n    let result = this.echelonForm();\n    let m = result.columns;\n    let n = result.rows;\n    let h = n - 1;\n    while (h >= 0) {\n      if (result.maxRow(h) === 0) {\n        h--;\n      } else {\n        let p = 0;\n        let pivot = false;\n        while (p < n && pivot === false) {\n          if (result.get(h, p) === 1) {\n            pivot = true;\n          } else {\n            p++;\n          }\n        }\n        for (let i = 0; i < h; i++) {\n          let factor = result.get(i, p);\n          for (let j = p; j < m; j++) {\n            let tmp = result.get(i, j) - factor * result.get(h, j);\n            result.set(i, j, tmp);\n          }\n        }\n        h--;\n      }\n    }\n    return result;\n  }\n\n  set() {\n    throw new Error('set method is unimplemented');\n  }\n\n  get() {\n    throw new Error('get method is unimplemented');\n  }\n\n  repeat(options = {}) {\n    if (typeof options !== 'object') {\n      throw new TypeError('options must be an object');\n    }\n    const { rows = 1, columns = 1 } = options;\n    if (!Number.isInteger(rows) || rows <= 0) {\n      throw new TypeError('rows must be a positive integer');\n    }\n    if (!Number.isInteger(columns) || columns <= 0) {\n      throw new TypeError('columns must be a positive integer');\n    }\n    let matrix = new Matrix(this.rows * rows, this.columns * columns);\n    for (let i = 0; i < rows; i++) {\n      for (let j = 0; j < columns; j++) {\n        matrix.setSubMatrix(this, this.rows * i, this.columns * j);\n      }\n    }\n    return matrix;\n  }\n\n  fill(value) {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, value);\n      }\n    }\n    return this;\n  }\n\n  neg() {\n    return this.mulS(-1);\n  }\n\n  getRow(index) {\n    checkRowIndex(this, index);\n    let row = [];\n    for (let i = 0; i < this.columns; i++) {\n      row.push(this.get(index, i));\n    }\n    return row;\n  }\n\n  getRowVector(index) {\n    return Matrix.rowVector(this.getRow(index));\n  }\n\n  setRow(index, array) {\n    checkRowIndex(this, index);\n    array = checkRowVector(this, array);\n    for (let i = 0; i < this.columns; i++) {\n      this.set(index, i, array[i]);\n    }\n    return this;\n  }\n\n  swapRows(row1, row2) {\n    checkRowIndex(this, row1);\n    checkRowIndex(this, row2);\n    for (let i = 0; i < this.columns; i++) {\n      let temp = this.get(row1, i);\n      this.set(row1, i, this.get(row2, i));\n      this.set(row2, i, temp);\n    }\n    return this;\n  }\n\n  getColumn(index) {\n    checkColumnIndex(this, index);\n    let column = [];\n    for (let i = 0; i < this.rows; i++) {\n      column.push(this.get(i, index));\n    }\n    return column;\n  }\n\n  getColumnVector(index) {\n    return Matrix.columnVector(this.getColumn(index));\n  }\n\n  setColumn(index, array) {\n    checkColumnIndex(this, index);\n    array = checkColumnVector(this, array);\n    for (let i = 0; i < this.rows; i++) {\n      this.set(i, index, array[i]);\n    }\n    return this;\n  }\n\n  swapColumns(column1, column2) {\n    checkColumnIndex(this, column1);\n    checkColumnIndex(this, column2);\n    for (let i = 0; i < this.rows; i++) {\n      let temp = this.get(i, column1);\n      this.set(i, column1, this.get(i, column2));\n      this.set(i, column2, temp);\n    }\n    return this;\n  }\n\n  addRowVector(vector) {\n    vector = checkRowVector(this, vector);\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) + vector[j]);\n      }\n    }\n    return this;\n  }\n\n  subRowVector(vector) {\n    vector = checkRowVector(this, vector);\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) - vector[j]);\n      }\n    }\n    return this;\n  }\n\n  mulRowVector(vector) {\n    vector = checkRowVector(this, vector);\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) * vector[j]);\n      }\n    }\n    return this;\n  }\n\n  divRowVector(vector) {\n    vector = checkRowVector(this, vector);\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) / vector[j]);\n      }\n    }\n    return this;\n  }\n\n  addColumnVector(vector) {\n    vector = checkColumnVector(this, vector);\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) + vector[i]);\n      }\n    }\n    return this;\n  }\n\n  subColumnVector(vector) {\n    vector = checkColumnVector(this, vector);\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) - vector[i]);\n      }\n    }\n    return this;\n  }\n\n  mulColumnVector(vector) {\n    vector = checkColumnVector(this, vector);\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) * vector[i]);\n      }\n    }\n    return this;\n  }\n\n  divColumnVector(vector) {\n    vector = checkColumnVector(this, vector);\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) / vector[i]);\n      }\n    }\n    return this;\n  }\n\n  mulRow(index, value) {\n    checkRowIndex(this, index);\n    for (let i = 0; i < this.columns; i++) {\n      this.set(index, i, this.get(index, i) * value);\n    }\n    return this;\n  }\n\n  mulColumn(index, value) {\n    checkColumnIndex(this, index);\n    for (let i = 0; i < this.rows; i++) {\n      this.set(i, index, this.get(i, index) * value);\n    }\n    return this;\n  }\n\n  max(by) {\n    if (this.isEmpty()) {\n      return NaN;\n    }\n    switch (by) {\n      case 'row': {\n        const max = new Array(this.rows).fill(Number.NEGATIVE_INFINITY);\n        for (let row = 0; row < this.rows; row++) {\n          for (let column = 0; column < this.columns; column++) {\n            if (this.get(row, column) > max[row]) {\n              max[row] = this.get(row, column);\n            }\n          }\n        }\n        return max;\n      }\n      case 'column': {\n        const max = new Array(this.columns).fill(Number.NEGATIVE_INFINITY);\n        for (let row = 0; row < this.rows; row++) {\n          for (let column = 0; column < this.columns; column++) {\n            if (this.get(row, column) > max[column]) {\n              max[column] = this.get(row, column);\n            }\n          }\n        }\n        return max;\n      }\n      case undefined: {\n        let max = this.get(0, 0);\n        for (let row = 0; row < this.rows; row++) {\n          for (let column = 0; column < this.columns; column++) {\n            if (this.get(row, column) > max) {\n              max = this.get(row, column);\n            }\n          }\n        }\n        return max;\n      }\n      default:\n        throw new Error(`invalid option: ${by}`);\n    }\n  }\n\n  maxIndex() {\n    checkNonEmpty(this);\n    let v = this.get(0, 0);\n    let idx = [0, 0];\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        if (this.get(i, j) > v) {\n          v = this.get(i, j);\n          idx[0] = i;\n          idx[1] = j;\n        }\n      }\n    }\n    return idx;\n  }\n\n  min(by) {\n    if (this.isEmpty()) {\n      return NaN;\n    }\n\n    switch (by) {\n      case 'row': {\n        const min = new Array(this.rows).fill(Number.POSITIVE_INFINITY);\n        for (let row = 0; row < this.rows; row++) {\n          for (let column = 0; column < this.columns; column++) {\n            if (this.get(row, column) < min[row]) {\n              min[row] = this.get(row, column);\n            }\n          }\n        }\n        return min;\n      }\n      case 'column': {\n        const min = new Array(this.columns).fill(Number.POSITIVE_INFINITY);\n        for (let row = 0; row < this.rows; row++) {\n          for (let column = 0; column < this.columns; column++) {\n            if (this.get(row, column) < min[column]) {\n              min[column] = this.get(row, column);\n            }\n          }\n        }\n        return min;\n      }\n      case undefined: {\n        let min = this.get(0, 0);\n        for (let row = 0; row < this.rows; row++) {\n          for (let column = 0; column < this.columns; column++) {\n            if (this.get(row, column) < min) {\n              min = this.get(row, column);\n            }\n          }\n        }\n        return min;\n      }\n      default:\n        throw new Error(`invalid option: ${by}`);\n    }\n  }\n\n  minIndex() {\n    checkNonEmpty(this);\n    let v = this.get(0, 0);\n    let idx = [0, 0];\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        if (this.get(i, j) < v) {\n          v = this.get(i, j);\n          idx[0] = i;\n          idx[1] = j;\n        }\n      }\n    }\n    return idx;\n  }\n\n  maxRow(row) {\n    checkRowIndex(this, row);\n    if (this.isEmpty()) {\n      return NaN;\n    }\n    let v = this.get(row, 0);\n    for (let i = 1; i < this.columns; i++) {\n      if (this.get(row, i) > v) {\n        v = this.get(row, i);\n      }\n    }\n    return v;\n  }\n\n  maxRowIndex(row) {\n    checkRowIndex(this, row);\n    checkNonEmpty(this);\n    let v = this.get(row, 0);\n    let idx = [row, 0];\n    for (let i = 1; i < this.columns; i++) {\n      if (this.get(row, i) > v) {\n        v = this.get(row, i);\n        idx[1] = i;\n      }\n    }\n    return idx;\n  }\n\n  minRow(row) {\n    checkRowIndex(this, row);\n    if (this.isEmpty()) {\n      return NaN;\n    }\n    let v = this.get(row, 0);\n    for (let i = 1; i < this.columns; i++) {\n      if (this.get(row, i) < v) {\n        v = this.get(row, i);\n      }\n    }\n    return v;\n  }\n\n  minRowIndex(row) {\n    checkRowIndex(this, row);\n    checkNonEmpty(this);\n    let v = this.get(row, 0);\n    let idx = [row, 0];\n    for (let i = 1; i < this.columns; i++) {\n      if (this.get(row, i) < v) {\n        v = this.get(row, i);\n        idx[1] = i;\n      }\n    }\n    return idx;\n  }\n\n  maxColumn(column) {\n    checkColumnIndex(this, column);\n    if (this.isEmpty()) {\n      return NaN;\n    }\n    let v = this.get(0, column);\n    for (let i = 1; i < this.rows; i++) {\n      if (this.get(i, column) > v) {\n        v = this.get(i, column);\n      }\n    }\n    return v;\n  }\n\n  maxColumnIndex(column) {\n    checkColumnIndex(this, column);\n    checkNonEmpty(this);\n    let v = this.get(0, column);\n    let idx = [0, column];\n    for (let i = 1; i < this.rows; i++) {\n      if (this.get(i, column) > v) {\n        v = this.get(i, column);\n        idx[0] = i;\n      }\n    }\n    return idx;\n  }\n\n  minColumn(column) {\n    checkColumnIndex(this, column);\n    if (this.isEmpty()) {\n      return NaN;\n    }\n    let v = this.get(0, column);\n    for (let i = 1; i < this.rows; i++) {\n      if (this.get(i, column) < v) {\n        v = this.get(i, column);\n      }\n    }\n    return v;\n  }\n\n  minColumnIndex(column) {\n    checkColumnIndex(this, column);\n    checkNonEmpty(this);\n    let v = this.get(0, column);\n    let idx = [0, column];\n    for (let i = 1; i < this.rows; i++) {\n      if (this.get(i, column) < v) {\n        v = this.get(i, column);\n        idx[0] = i;\n      }\n    }\n    return idx;\n  }\n\n  diag() {\n    let min = Math.min(this.rows, this.columns);\n    let diag = [];\n    for (let i = 0; i < min; i++) {\n      diag.push(this.get(i, i));\n    }\n    return diag;\n  }\n\n  norm(type = 'frobenius') {\n    switch (type) {\n      case 'max':\n        return this.max();\n      case 'frobenius':\n        return Math.sqrt(this.dot(this));\n      default:\n        throw new RangeError(`unknown norm type: ${type}`);\n    }\n  }\n\n  cumulativeSum() {\n    let sum = 0;\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        sum += this.get(i, j);\n        this.set(i, j, sum);\n      }\n    }\n    return this;\n  }\n\n  dot(vector2) {\n    if (AbstractMatrix.isMatrix(vector2)) vector2 = vector2.to1DArray();\n    let vector1 = this.to1DArray();\n    if (vector1.length !== vector2.length) {\n      throw new RangeError('vectors do not have the same size');\n    }\n    let dot = 0;\n    for (let i = 0; i < vector1.length; i++) {\n      dot += vector1[i] * vector2[i];\n    }\n    return dot;\n  }\n\n  mmul(other) {\n    other = Matrix.checkMatrix(other);\n\n    let m = this.rows;\n    let n = this.columns;\n    let p = other.columns;\n\n    let result = new Matrix(m, p);\n\n    let Bcolj = new Float64Array(n);\n    for (let j = 0; j < p; j++) {\n      for (let k = 0; k < n; k++) {\n        Bcolj[k] = other.get(k, j);\n      }\n\n      for (let i = 0; i < m; i++) {\n        let s = 0;\n        for (let k = 0; k < n; k++) {\n          s += this.get(i, k) * Bcolj[k];\n        }\n\n        result.set(i, j, s);\n      }\n    }\n    return result;\n  }\n\n  mpow(scalar) {\n    if (!this.isSquare()) {\n      throw new RangeError('Matrix must be square');\n    }\n    if (!Number.isInteger(scalar) || scalar < 0) {\n      throw new RangeError('Exponent must be a non-negative integer');\n    }\n    // Russian Peasant exponentiation, i.e. exponentiation by squaring\n    let result = Matrix.eye(this.rows);\n    let bb = this;\n    // Note: Don't bit shift. In JS, that would truncate at 32 bits\n    for (let e = scalar; e >= 1; e /= 2) {\n      if ((e & 1) !== 0) {\n        result = result.mmul(bb);\n      }\n      bb = bb.mmul(bb);\n    }\n    return result;\n  }\n\n  strassen2x2(other) {\n    other = Matrix.checkMatrix(other);\n    let result = new Matrix(2, 2);\n    const a11 = this.get(0, 0);\n    const b11 = other.get(0, 0);\n    const a12 = this.get(0, 1);\n    const b12 = other.get(0, 1);\n    const a21 = this.get(1, 0);\n    const b21 = other.get(1, 0);\n    const a22 = this.get(1, 1);\n    const b22 = other.get(1, 1);\n\n    // Compute intermediate values.\n    const m1 = (a11 + a22) * (b11 + b22);\n    const m2 = (a21 + a22) * b11;\n    const m3 = a11 * (b12 - b22);\n    const m4 = a22 * (b21 - b11);\n    const m5 = (a11 + a12) * b22;\n    const m6 = (a21 - a11) * (b11 + b12);\n    const m7 = (a12 - a22) * (b21 + b22);\n\n    // Combine intermediate values into the output.\n    const c00 = m1 + m4 - m5 + m7;\n    const c01 = m3 + m5;\n    const c10 = m2 + m4;\n    const c11 = m1 - m2 + m3 + m6;\n\n    result.set(0, 0, c00);\n    result.set(0, 1, c01);\n    result.set(1, 0, c10);\n    result.set(1, 1, c11);\n    return result;\n  }\n\n  strassen3x3(other) {\n    other = Matrix.checkMatrix(other);\n    let result = new Matrix(3, 3);\n\n    const a00 = this.get(0, 0);\n    const a01 = this.get(0, 1);\n    const a02 = this.get(0, 2);\n    const a10 = this.get(1, 0);\n    const a11 = this.get(1, 1);\n    const a12 = this.get(1, 2);\n    const a20 = this.get(2, 0);\n    const a21 = this.get(2, 1);\n    const a22 = this.get(2, 2);\n\n    const b00 = other.get(0, 0);\n    const b01 = other.get(0, 1);\n    const b02 = other.get(0, 2);\n    const b10 = other.get(1, 0);\n    const b11 = other.get(1, 1);\n    const b12 = other.get(1, 2);\n    const b20 = other.get(2, 0);\n    const b21 = other.get(2, 1);\n    const b22 = other.get(2, 2);\n\n    const m1 = (a00 + a01 + a02 - a10 - a11 - a21 - a22) * b11;\n    const m2 = (a00 - a10) * (-b01 + b11);\n    const m3 = a11 * (-b00 + b01 + b10 - b11 - b12 - b20 + b22);\n    const m4 = (-a00 + a10 + a11) * (b00 - b01 + b11);\n    const m5 = (a10 + a11) * (-b00 + b01);\n    const m6 = a00 * b00;\n    const m7 = (-a00 + a20 + a21) * (b00 - b02 + b12);\n    const m8 = (-a00 + a20) * (b02 - b12);\n    const m9 = (a20 + a21) * (-b00 + b02);\n    const m10 = (a00 + a01 + a02 - a11 - a12 - a20 - a21) * b12;\n    const m11 = a21 * (-b00 + b02 + b10 - b11 - b12 - b20 + b21);\n    const m12 = (-a02 + a21 + a22) * (b11 + b20 - b21);\n    const m13 = (a02 - a22) * (b11 - b21);\n    const m14 = a02 * b20;\n    const m15 = (a21 + a22) * (-b20 + b21);\n    const m16 = (-a02 + a11 + a12) * (b12 + b20 - b22);\n    const m17 = (a02 - a12) * (b12 - b22);\n    const m18 = (a11 + a12) * (-b20 + b22);\n    const m19 = a01 * b10;\n    const m20 = a12 * b21;\n    const m21 = a10 * b02;\n    const m22 = a20 * b01;\n    const m23 = a22 * b22;\n\n    const c00 = m6 + m14 + m19;\n    const c01 = m1 + m4 + m5 + m6 + m12 + m14 + m15;\n    const c02 = m6 + m7 + m9 + m10 + m14 + m16 + m18;\n    const c10 = m2 + m3 + m4 + m6 + m14 + m16 + m17;\n    const c11 = m2 + m4 + m5 + m6 + m20;\n    const c12 = m14 + m16 + m17 + m18 + m21;\n    const c20 = m6 + m7 + m8 + m11 + m12 + m13 + m14;\n    const c21 = m12 + m13 + m14 + m15 + m22;\n    const c22 = m6 + m7 + m8 + m9 + m23;\n\n    result.set(0, 0, c00);\n    result.set(0, 1, c01);\n    result.set(0, 2, c02);\n    result.set(1, 0, c10);\n    result.set(1, 1, c11);\n    result.set(1, 2, c12);\n    result.set(2, 0, c20);\n    result.set(2, 1, c21);\n    result.set(2, 2, c22);\n    return result;\n  }\n\n  mmulStrassen(y) {\n    y = Matrix.checkMatrix(y);\n    let x = this.clone();\n    let r1 = x.rows;\n    let c1 = x.columns;\n    let r2 = y.rows;\n    let c2 = y.columns;\n    if (c1 !== r2) {\n      // eslint-disable-next-line no-console\n      console.warn(\n        `Multiplying ${r1} x ${c1} and ${r2} x ${c2} matrix: dimensions do not match.`,\n      );\n    }\n\n    // Put a matrix into the top left of a matrix of zeros.\n    // `rows` and `cols` are the dimensions of the output matrix.\n    function embed(mat, rows, cols) {\n      let r = mat.rows;\n      let c = mat.columns;\n      if (r === rows && c === cols) {\n        return mat;\n      } else {\n        let resultat = AbstractMatrix.zeros(rows, cols);\n        resultat = resultat.setSubMatrix(mat, 0, 0);\n        return resultat;\n      }\n    }\n\n    // Make sure both matrices are the same size.\n    // This is exclusively for simplicity:\n    // this algorithm can be implemented with matrices of different sizes.\n\n    let r = Math.max(r1, r2);\n    let c = Math.max(c1, c2);\n    x = embed(x, r, c);\n    y = embed(y, r, c);\n\n    // Our recursive multiplication function.\n    function blockMult(a, b, rows, cols) {\n      // For small matrices, resort to naive multiplication.\n      if (rows <= 512 || cols <= 512) {\n        return a.mmul(b); // a is equivalent to this\n      }\n\n      // Apply dynamic padding.\n      if (rows % 2 === 1 && cols % 2 === 1) {\n        a = embed(a, rows + 1, cols + 1);\n        b = embed(b, rows + 1, cols + 1);\n      } else if (rows % 2 === 1) {\n        a = embed(a, rows + 1, cols);\n        b = embed(b, rows + 1, cols);\n      } else if (cols % 2 === 1) {\n        a = embed(a, rows, cols + 1);\n        b = embed(b, rows, cols + 1);\n      }\n\n      let halfRows = parseInt(a.rows / 2, 10);\n      let halfCols = parseInt(a.columns / 2, 10);\n      // Subdivide input matrices.\n      let a11 = a.subMatrix(0, halfRows - 1, 0, halfCols - 1);\n      let b11 = b.subMatrix(0, halfRows - 1, 0, halfCols - 1);\n\n      let a12 = a.subMatrix(0, halfRows - 1, halfCols, a.columns - 1);\n      let b12 = b.subMatrix(0, halfRows - 1, halfCols, b.columns - 1);\n\n      let a21 = a.subMatrix(halfRows, a.rows - 1, 0, halfCols - 1);\n      let b21 = b.subMatrix(halfRows, b.rows - 1, 0, halfCols - 1);\n\n      let a22 = a.subMatrix(halfRows, a.rows - 1, halfCols, a.columns - 1);\n      let b22 = b.subMatrix(halfRows, b.rows - 1, halfCols, b.columns - 1);\n\n      // Compute intermediate values.\n      let m1 = blockMult(\n        AbstractMatrix.add(a11, a22),\n        AbstractMatrix.add(b11, b22),\n        halfRows,\n        halfCols,\n      );\n      let m2 = blockMult(AbstractMatrix.add(a21, a22), b11, halfRows, halfCols);\n      let m3 = blockMult(a11, AbstractMatrix.sub(b12, b22), halfRows, halfCols);\n      let m4 = blockMult(a22, AbstractMatrix.sub(b21, b11), halfRows, halfCols);\n      let m5 = blockMult(AbstractMatrix.add(a11, a12), b22, halfRows, halfCols);\n      let m6 = blockMult(\n        AbstractMatrix.sub(a21, a11),\n        AbstractMatrix.add(b11, b12),\n        halfRows,\n        halfCols,\n      );\n      let m7 = blockMult(\n        AbstractMatrix.sub(a12, a22),\n        AbstractMatrix.add(b21, b22),\n        halfRows,\n        halfCols,\n      );\n\n      // Combine intermediate values into the output.\n      let c11 = AbstractMatrix.add(m1, m4);\n      c11.sub(m5);\n      c11.add(m7);\n      let c12 = AbstractMatrix.add(m3, m5);\n      let c21 = AbstractMatrix.add(m2, m4);\n      let c22 = AbstractMatrix.sub(m1, m2);\n      c22.add(m3);\n      c22.add(m6);\n\n      // Crop output to the desired size (undo dynamic padding).\n      let result = AbstractMatrix.zeros(2 * c11.rows, 2 * c11.columns);\n      result = result.setSubMatrix(c11, 0, 0);\n      result = result.setSubMatrix(c12, c11.rows, 0);\n      result = result.setSubMatrix(c21, 0, c11.columns);\n      result = result.setSubMatrix(c22, c11.rows, c11.columns);\n      return result.subMatrix(0, rows - 1, 0, cols - 1);\n    }\n\n    return blockMult(x, y, r, c);\n  }\n\n  scaleRows(options = {}) {\n    if (typeof options !== 'object') {\n      throw new TypeError('options must be an object');\n    }\n    const { min = 0, max = 1 } = options;\n    if (!Number.isFinite(min)) throw new TypeError('min must be a number');\n    if (!Number.isFinite(max)) throw new TypeError('max must be a number');\n    if (min >= max) throw new RangeError('min must be smaller than max');\n    let newMatrix = new Matrix(this.rows, this.columns);\n    for (let i = 0; i < this.rows; i++) {\n      const row = this.getRow(i);\n      if (row.length > 0) {\n        rescale(row, { min, max, output: row });\n      }\n      newMatrix.setRow(i, row);\n    }\n    return newMatrix;\n  }\n\n  scaleColumns(options = {}) {\n    if (typeof options !== 'object') {\n      throw new TypeError('options must be an object');\n    }\n    const { min = 0, max = 1 } = options;\n    if (!Number.isFinite(min)) throw new TypeError('min must be a number');\n    if (!Number.isFinite(max)) throw new TypeError('max must be a number');\n    if (min >= max) throw new RangeError('min must be smaller than max');\n    let newMatrix = new Matrix(this.rows, this.columns);\n    for (let i = 0; i < this.columns; i++) {\n      const column = this.getColumn(i);\n      if (column.length) {\n        rescale(column, {\n          min,\n          max,\n          output: column,\n        });\n      }\n      newMatrix.setColumn(i, column);\n    }\n    return newMatrix;\n  }\n\n  flipRows() {\n    const middle = Math.ceil(this.columns / 2);\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < middle; j++) {\n        let first = this.get(i, j);\n        let last = this.get(i, this.columns - 1 - j);\n        this.set(i, j, last);\n        this.set(i, this.columns - 1 - j, first);\n      }\n    }\n    return this;\n  }\n\n  flipColumns() {\n    const middle = Math.ceil(this.rows / 2);\n    for (let j = 0; j < this.columns; j++) {\n      for (let i = 0; i < middle; i++) {\n        let first = this.get(i, j);\n        let last = this.get(this.rows - 1 - i, j);\n        this.set(i, j, last);\n        this.set(this.rows - 1 - i, j, first);\n      }\n    }\n    return this;\n  }\n\n  kroneckerProduct(other) {\n    other = Matrix.checkMatrix(other);\n\n    let m = this.rows;\n    let n = this.columns;\n    let p = other.rows;\n    let q = other.columns;\n\n    let result = new Matrix(m * p, n * q);\n    for (let i = 0; i < m; i++) {\n      for (let j = 0; j < n; j++) {\n        for (let k = 0; k < p; k++) {\n          for (let l = 0; l < q; l++) {\n            result.set(p * i + k, q * j + l, this.get(i, j) * other.get(k, l));\n          }\n        }\n      }\n    }\n    return result;\n  }\n\n  kroneckerSum(other) {\n    other = Matrix.checkMatrix(other);\n    if (!this.isSquare() || !other.isSquare()) {\n      throw new Error('Kronecker Sum needs two Square Matrices');\n    }\n    let m = this.rows;\n    let n = other.rows;\n    let AxI = this.kroneckerProduct(Matrix.eye(n, n));\n    let IxB = Matrix.eye(m, m).kroneckerProduct(other);\n    return AxI.add(IxB);\n  }\n\n  transpose() {\n    let result = new Matrix(this.columns, this.rows);\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        result.set(j, i, this.get(i, j));\n      }\n    }\n    return result;\n  }\n\n  sortRows(compareFunction = compareNumbers) {\n    for (let i = 0; i < this.rows; i++) {\n      this.setRow(i, this.getRow(i).sort(compareFunction));\n    }\n    return this;\n  }\n\n  sortColumns(compareFunction = compareNumbers) {\n    for (let i = 0; i < this.columns; i++) {\n      this.setColumn(i, this.getColumn(i).sort(compareFunction));\n    }\n    return this;\n  }\n\n  subMatrix(startRow, endRow, startColumn, endColumn) {\n    checkRange(this, startRow, endRow, startColumn, endColumn);\n    let newMatrix = new Matrix(\n      endRow - startRow + 1,\n      endColumn - startColumn + 1,\n    );\n    for (let i = startRow; i <= endRow; i++) {\n      for (let j = startColumn; j <= endColumn; j++) {\n        newMatrix.set(i - startRow, j - startColumn, this.get(i, j));\n      }\n    }\n    return newMatrix;\n  }\n\n  subMatrixRow(indices, startColumn, endColumn) {\n    if (startColumn === undefined) startColumn = 0;\n    if (endColumn === undefined) endColumn = this.columns - 1;\n    if (\n      startColumn > endColumn ||\n      startColumn < 0 ||\n      startColumn >= this.columns ||\n      endColumn < 0 ||\n      endColumn >= this.columns\n    ) {\n      throw new RangeError('Argument out of range');\n    }\n\n    let newMatrix = new Matrix(indices.length, endColumn - startColumn + 1);\n    for (let i = 0; i < indices.length; i++) {\n      for (let j = startColumn; j <= endColumn; j++) {\n        if (indices[i] < 0 || indices[i] >= this.rows) {\n          throw new RangeError(`Row index out of range: ${indices[i]}`);\n        }\n        newMatrix.set(i, j - startColumn, this.get(indices[i], j));\n      }\n    }\n    return newMatrix;\n  }\n\n  subMatrixColumn(indices, startRow, endRow) {\n    if (startRow === undefined) startRow = 0;\n    if (endRow === undefined) endRow = this.rows - 1;\n    if (\n      startRow > endRow ||\n      startRow < 0 ||\n      startRow >= this.rows ||\n      endRow < 0 ||\n      endRow >= this.rows\n    ) {\n      throw new RangeError('Argument out of range');\n    }\n\n    let newMatrix = new Matrix(endRow - startRow + 1, indices.length);\n    for (let i = 0; i < indices.length; i++) {\n      for (let j = startRow; j <= endRow; j++) {\n        if (indices[i] < 0 || indices[i] >= this.columns) {\n          throw new RangeError(`Column index out of range: ${indices[i]}`);\n        }\n        newMatrix.set(j - startRow, i, this.get(j, indices[i]));\n      }\n    }\n    return newMatrix;\n  }\n\n  setSubMatrix(matrix, startRow, startColumn) {\n    matrix = Matrix.checkMatrix(matrix);\n    if (matrix.isEmpty()) {\n      return this;\n    }\n    let endRow = startRow + matrix.rows - 1;\n    let endColumn = startColumn + matrix.columns - 1;\n    checkRange(this, startRow, endRow, startColumn, endColumn);\n    for (let i = 0; i < matrix.rows; i++) {\n      for (let j = 0; j < matrix.columns; j++) {\n        this.set(startRow + i, startColumn + j, matrix.get(i, j));\n      }\n    }\n    return this;\n  }\n\n  selection(rowIndices, columnIndices) {\n    checkRowIndices(this, rowIndices);\n    checkColumnIndices(this, columnIndices);\n    let newMatrix = new Matrix(rowIndices.length, columnIndices.length);\n    for (let i = 0; i < rowIndices.length; i++) {\n      let rowIndex = rowIndices[i];\n      for (let j = 0; j < columnIndices.length; j++) {\n        let columnIndex = columnIndices[j];\n        newMatrix.set(i, j, this.get(rowIndex, columnIndex));\n      }\n    }\n    return newMatrix;\n  }\n\n  trace() {\n    let min = Math.min(this.rows, this.columns);\n    let trace = 0;\n    for (let i = 0; i < min; i++) {\n      trace += this.get(i, i);\n    }\n    return trace;\n  }\n\n  clone() {\n    return this.constructor.copy(this, new Matrix(this.rows, this.columns));\n  }\n\n  /**\n   * @template {AbstractMatrix} M\n   * @param {AbstractMatrix} from\n   * @param {M} to\n   * @return {M}\n   */\n  static copy(from, to) {\n    for (const [row, column, value] of from.entries()) {\n      to.set(row, column, value);\n    }\n\n    return to;\n  }\n\n  sum(by) {\n    switch (by) {\n      case 'row':\n        return sumByRow(this);\n      case 'column':\n        return sumByColumn(this);\n      case undefined:\n        return sumAll(this);\n      default:\n        throw new Error(`invalid option: ${by}`);\n    }\n  }\n\n  product(by) {\n    switch (by) {\n      case 'row':\n        return productByRow(this);\n      case 'column':\n        return productByColumn(this);\n      case undefined:\n        return productAll(this);\n      default:\n        throw new Error(`invalid option: ${by}`);\n    }\n  }\n\n  mean(by) {\n    const sum = this.sum(by);\n    switch (by) {\n      case 'row': {\n        for (let i = 0; i < this.rows; i++) {\n          sum[i] /= this.columns;\n        }\n        return sum;\n      }\n      case 'column': {\n        for (let i = 0; i < this.columns; i++) {\n          sum[i] /= this.rows;\n        }\n        return sum;\n      }\n      case undefined:\n        return sum / this.size;\n      default:\n        throw new Error(`invalid option: ${by}`);\n    }\n  }\n\n  variance(by, options = {}) {\n    if (typeof by === 'object') {\n      options = by;\n      by = undefined;\n    }\n    if (typeof options !== 'object') {\n      throw new TypeError('options must be an object');\n    }\n    const { unbiased = true, mean = this.mean(by) } = options;\n    if (typeof unbiased !== 'boolean') {\n      throw new TypeError('unbiased must be a boolean');\n    }\n    switch (by) {\n      case 'row': {\n        if (!isAnyArray(mean)) {\n          throw new TypeError('mean must be an array');\n        }\n        return varianceByRow(this, unbiased, mean);\n      }\n      case 'column': {\n        if (!isAnyArray(mean)) {\n          throw new TypeError('mean must be an array');\n        }\n        return varianceByColumn(this, unbiased, mean);\n      }\n      case undefined: {\n        if (typeof mean !== 'number') {\n          throw new TypeError('mean must be a number');\n        }\n        return varianceAll(this, unbiased, mean);\n      }\n      default:\n        throw new Error(`invalid option: ${by}`);\n    }\n  }\n\n  standardDeviation(by, options) {\n    if (typeof by === 'object') {\n      options = by;\n      by = undefined;\n    }\n    const variance = this.variance(by, options);\n    if (by === undefined) {\n      return Math.sqrt(variance);\n    } else {\n      for (let i = 0; i < variance.length; i++) {\n        variance[i] = Math.sqrt(variance[i]);\n      }\n      return variance;\n    }\n  }\n\n  center(by, options = {}) {\n    if (typeof by === 'object') {\n      options = by;\n      by = undefined;\n    }\n    if (typeof options !== 'object') {\n      throw new TypeError('options must be an object');\n    }\n    const { center = this.mean(by) } = options;\n    switch (by) {\n      case 'row': {\n        if (!isAnyArray(center)) {\n          throw new TypeError('center must be an array');\n        }\n        centerByRow(this, center);\n        return this;\n      }\n      case 'column': {\n        if (!isAnyArray(center)) {\n          throw new TypeError('center must be an array');\n        }\n        centerByColumn(this, center);\n        return this;\n      }\n      case undefined: {\n        if (typeof center !== 'number') {\n          throw new TypeError('center must be a number');\n        }\n        centerAll(this, center);\n        return this;\n      }\n      default:\n        throw new Error(`invalid option: ${by}`);\n    }\n  }\n\n  scale(by, options = {}) {\n    if (typeof by === 'object') {\n      options = by;\n      by = undefined;\n    }\n    if (typeof options !== 'object') {\n      throw new TypeError('options must be an object');\n    }\n    let scale = options.scale;\n    switch (by) {\n      case 'row': {\n        if (scale === undefined) {\n          scale = getScaleByRow(this);\n        } else if (!isAnyArray(scale)) {\n          throw new TypeError('scale must be an array');\n        }\n        scaleByRow(this, scale);\n        return this;\n      }\n      case 'column': {\n        if (scale === undefined) {\n          scale = getScaleByColumn(this);\n        } else if (!isAnyArray(scale)) {\n          throw new TypeError('scale must be an array');\n        }\n        scaleByColumn(this, scale);\n        return this;\n      }\n      case undefined: {\n        if (scale === undefined) {\n          scale = getScaleAll(this);\n        } else if (typeof scale !== 'number') {\n          throw new TypeError('scale must be a number');\n        }\n        scaleAll(this, scale);\n        return this;\n      }\n      default:\n        throw new Error(`invalid option: ${by}`);\n    }\n  }\n\n  toString(options) {\n    return inspectMatrixWithOptions(this, options);\n  }\n\n  [Symbol.iterator]() {\n    return this.entries();\n  }\n\n  /**\n   * iterator from left to right, from top to bottom\n   * yield [row, column, value]\n   * @returns {Generator<[number, number, number], void, void>}\n   */\n  *entries() {\n    for (let row = 0; row < this.rows; row++) {\n      for (let col = 0; col < this.columns; col++) {\n        yield [row, col, this.get(row, col)];\n      }\n    }\n  }\n\n  /**\n   * iterator from left to right, from top to bottom\n   * yield value\n   * @returns {Generator<number, void, void>}\n   */\n  *values() {\n    for (let row = 0; row < this.rows; row++) {\n      for (let col = 0; col < this.columns; col++) {\n        yield this.get(row, col);\n      }\n    }\n  }\n}\n\nAbstractMatrix.prototype.klass = 'Matrix';\nif (typeof Symbol !== 'undefined') {\n  AbstractMatrix.prototype[Symbol.for('nodejs.util.inspect.custom')] =\n    inspectMatrix;\n}\n\nfunction compareNumbers(a, b) {\n  return a - b;\n}\n\nfunction isArrayOfNumbers(array) {\n  return array.every((element) => {\n    return typeof element === 'number';\n  });\n}\n\n// Synonyms\nAbstractMatrix.random = AbstractMatrix.rand;\nAbstractMatrix.randomInt = AbstractMatrix.randInt;\nAbstractMatrix.diagonal = AbstractMatrix.diag;\nAbstractMatrix.prototype.diagonal = AbstractMatrix.prototype.diag;\nAbstractMatrix.identity = AbstractMatrix.eye;\nAbstractMatrix.prototype.negate = AbstractMatrix.prototype.neg;\nAbstractMatrix.prototype.tensorProduct =\n  AbstractMatrix.prototype.kroneckerProduct;\n\nclass Matrix extends AbstractMatrix {\n  /**\n   * @type {Float64Array[]}\n   */\n  data;\n\n  /**\n   * Init an empty matrix\n   * @param {number} nRows\n   * @param {number} nColumns\n   */\n  #initData(nRows, nColumns) {\n    this.data = [];\n\n    if (Number.isInteger(nColumns) && nColumns >= 0) {\n      for (let i = 0; i < nRows; i++) {\n        this.data.push(new Float64Array(nColumns));\n      }\n    } else {\n      throw new TypeError('nColumns must be a positive integer');\n    }\n\n    this.rows = nRows;\n    this.columns = nColumns;\n  }\n\n  constructor(nRows, nColumns) {\n    super();\n    if (Matrix.isMatrix(nRows)) {\n      this.#initData(nRows.rows, nRows.columns);\n      Matrix.copy(nRows, this);\n    } else if (Number.isInteger(nRows) && nRows >= 0) {\n      this.#initData(nRows, nColumns);\n    } else if (isAnyArray(nRows)) {\n      // Copy the values from the 2D array\n      const arrayData = nRows;\n      nRows = arrayData.length;\n      nColumns = nRows ? arrayData[0].length : 0;\n      if (typeof nColumns !== 'number') {\n        throw new TypeError(\n          'Data must be a 2D array with at least one element',\n        );\n      }\n      this.data = [];\n\n      for (let i = 0; i < nRows; i++) {\n        if (arrayData[i].length !== nColumns) {\n          throw new RangeError('Inconsistent array dimensions');\n        }\n        if (!isArrayOfNumbers(arrayData[i])) {\n          throw new TypeError('Input data contains non-numeric values');\n        }\n        this.data.push(Float64Array.from(arrayData[i]));\n      }\n\n      this.rows = nRows;\n      this.columns = nColumns;\n    } else {\n      throw new TypeError(\n        'First argument must be a positive number or an array',\n      );\n    }\n  }\n\n  set(rowIndex, columnIndex, value) {\n    this.data[rowIndex][columnIndex] = value;\n    return this;\n  }\n\n  get(rowIndex, columnIndex) {\n    return this.data[rowIndex][columnIndex];\n  }\n\n  removeRow(index) {\n    checkRowIndex(this, index);\n    this.data.splice(index, 1);\n    this.rows -= 1;\n    return this;\n  }\n\n  addRow(index, array) {\n    if (array === undefined) {\n      array = index;\n      index = this.rows;\n    }\n    checkRowIndex(this, index, true);\n    array = Float64Array.from(checkRowVector(this, array));\n    this.data.splice(index, 0, array);\n    this.rows += 1;\n    return this;\n  }\n\n  removeColumn(index) {\n    checkColumnIndex(this, index);\n    for (let i = 0; i < this.rows; i++) {\n      const newRow = new Float64Array(this.columns - 1);\n      for (let j = 0; j < index; j++) {\n        newRow[j] = this.data[i][j];\n      }\n      for (let j = index + 1; j < this.columns; j++) {\n        newRow[j - 1] = this.data[i][j];\n      }\n      this.data[i] = newRow;\n    }\n    this.columns -= 1;\n    return this;\n  }\n\n  addColumn(index, array) {\n    if (typeof array === 'undefined') {\n      array = index;\n      index = this.columns;\n    }\n    checkColumnIndex(this, index, true);\n    array = checkColumnVector(this, array);\n    for (let i = 0; i < this.rows; i++) {\n      const newRow = new Float64Array(this.columns + 1);\n      let j = 0;\n      for (; j < index; j++) {\n        newRow[j] = this.data[i][j];\n      }\n      newRow[j++] = array[i];\n      for (; j < this.columns + 1; j++) {\n        newRow[j] = this.data[i][j - 1];\n      }\n      this.data[i] = newRow;\n    }\n    this.columns += 1;\n    return this;\n  }\n}\n\ninstallMathOperations(AbstractMatrix, Matrix);\n\n/**\n * @typedef {0 | 1 | number | boolean} Mask\n */\n\nclass SymmetricMatrix extends AbstractMatrix {\n  /** @type {Matrix} */\n  #matrix;\n\n  get size() {\n    return this.#matrix.size;\n  }\n\n  get rows() {\n    return this.#matrix.rows;\n  }\n\n  get columns() {\n    return this.#matrix.columns;\n  }\n\n  get diagonalSize() {\n    return this.rows;\n  }\n\n  /**\n   * not the same as matrix.isSymmetric()\n   * Here is to check if it's instanceof SymmetricMatrix without bundling issues\n   *\n   * @param value\n   * @returns {boolean}\n   */\n  static isSymmetricMatrix(value) {\n    return Matrix.isMatrix(value) && value.klassType === 'SymmetricMatrix';\n  }\n\n  /**\n   * @param diagonalSize\n   * @return {SymmetricMatrix}\n   */\n  static zeros(diagonalSize) {\n    return new this(diagonalSize);\n  }\n\n  /**\n   * @param diagonalSize\n   * @return {SymmetricMatrix}\n   */\n  static ones(diagonalSize) {\n    return new this(diagonalSize).fill(1);\n  }\n\n  /**\n   * @param {number | AbstractMatrix | ArrayLike<ArrayLike<number>>} diagonalSize\n   * @return {this}\n   */\n  constructor(diagonalSize) {\n    super();\n\n    if (Matrix.isMatrix(diagonalSize)) {\n      if (!diagonalSize.isSymmetric()) {\n        throw new TypeError('not symmetric data');\n      }\n\n      this.#matrix = Matrix.copy(\n        diagonalSize,\n        new Matrix(diagonalSize.rows, diagonalSize.rows),\n      );\n    } else if (Number.isInteger(diagonalSize) && diagonalSize >= 0) {\n      this.#matrix = new Matrix(diagonalSize, diagonalSize);\n    } else {\n      this.#matrix = new Matrix(diagonalSize);\n\n      if (!this.isSymmetric()) {\n        throw new TypeError('not symmetric data');\n      }\n    }\n  }\n\n  clone() {\n    const matrix = new SymmetricMatrix(this.diagonalSize);\n\n    for (const [row, col, value] of this.upperRightEntries()) {\n      matrix.set(row, col, value);\n    }\n\n    return matrix;\n  }\n\n  toMatrix() {\n    return new Matrix(this);\n  }\n\n  get(rowIndex, columnIndex) {\n    return this.#matrix.get(rowIndex, columnIndex);\n  }\n  set(rowIndex, columnIndex, value) {\n    // symmetric set\n    this.#matrix.set(rowIndex, columnIndex, value);\n    this.#matrix.set(columnIndex, rowIndex, value);\n\n    return this;\n  }\n\n  removeCross(index) {\n    // symmetric remove side\n    this.#matrix.removeRow(index);\n    this.#matrix.removeColumn(index);\n\n    return this;\n  }\n\n  addCross(index, array) {\n    if (array === undefined) {\n      array = index;\n      index = this.diagonalSize;\n    }\n\n    const row = array.slice();\n    row.splice(index, 1);\n\n    this.#matrix.addRow(index, row);\n    this.#matrix.addColumn(index, array);\n\n    return this;\n  }\n\n  /**\n   * @param {Mask[]} mask\n   */\n  applyMask(mask) {\n    if (mask.length !== this.diagonalSize) {\n      throw new RangeError('Mask size do not match with matrix size');\n    }\n\n    // prepare sides to remove from matrix from mask\n    /** @type {number[]} */\n    const sidesToRemove = [];\n    for (const [index, passthroughs] of mask.entries()) {\n      if (passthroughs) continue;\n      sidesToRemove.push(index);\n    }\n    // to remove from highest to lowest for no mutation shifting\n    sidesToRemove.reverse();\n\n    // remove sides\n    for (const sideIndex of sidesToRemove) {\n      this.removeCross(sideIndex);\n    }\n\n    return this;\n  }\n\n  /**\n   * Compact format upper-right corner of matrix\n   * iterate from left to right, from top to bottom.\n   *\n   * ```\n   *   A B C D\n   * A 1 2 3 4\n   * B 2 5 6 7\n   * C 3 6 8 9\n   * D 4 7 9 10\n   * ```\n   *\n   * will return compact 1D array `[1, 2, 3, 4, 5, 6, 7, 8, 9, 10]`\n   *\n   * length is S(i=0, n=sideSize) => 10 for a 4 sideSized matrix\n   *\n   * @returns {number[]}\n   */\n  toCompact() {\n    const { diagonalSize } = this;\n\n    /** @type {number[]} */\n    const compact = new Array((diagonalSize * (diagonalSize + 1)) / 2);\n    for (let col = 0, row = 0, index = 0; index < compact.length; index++) {\n      compact[index] = this.get(row, col);\n\n      if (++col >= diagonalSize) col = ++row;\n    }\n\n    return compact;\n  }\n\n  /**\n   * @param {number[]} compact\n   * @return {SymmetricMatrix}\n   */\n  static fromCompact(compact) {\n    const compactSize = compact.length;\n    // compactSize = (sideSize * (sideSize + 1)) / 2\n    // https://mathsolver.microsoft.com/fr/solve-problem/y%20%3D%20%20x%20%60cdot%20%20%20%60frac%7B%20%20%60left(%20x%2B1%20%20%60right)%20%20%20%20%7D%7B%202%20%20%7D\n    // sideSize = (Sqrt(8 × compactSize + 1) - 1) / 2\n    const diagonalSize = (Math.sqrt(8 * compactSize + 1) - 1) / 2;\n\n    if (!Number.isInteger(diagonalSize)) {\n      throw new TypeError(\n        `This array is not a compact representation of a Symmetric Matrix, ${JSON.stringify(\n          compact,\n        )}`,\n      );\n    }\n\n    const matrix = new SymmetricMatrix(diagonalSize);\n    for (let col = 0, row = 0, index = 0; index < compactSize; index++) {\n      matrix.set(col, row, compact[index]);\n      if (++col >= diagonalSize) col = ++row;\n    }\n\n    return matrix;\n  }\n\n  /**\n   * half iterator upper-right-corner from left to right, from top to bottom\n   * yield [row, column, value]\n   *\n   * @returns {Generator<[number, number, number], void, void>}\n   */\n  *upperRightEntries() {\n    for (let row = 0, col = 0; row < this.diagonalSize; void 0) {\n      const value = this.get(row, col);\n\n      yield [row, col, value];\n\n      // at the end of row, move cursor to next row at diagonal position\n      if (++col >= this.diagonalSize) col = ++row;\n    }\n  }\n\n  /**\n   * half iterator upper-right-corner from left to right, from top to bottom\n   * yield value\n   *\n   * @returns {Generator<[number, number, number], void, void>}\n   */\n  *upperRightValues() {\n    for (let row = 0, col = 0; row < this.diagonalSize; void 0) {\n      const value = this.get(row, col);\n\n      yield value;\n\n      // at the end of row, move cursor to next row at diagonal position\n      if (++col >= this.diagonalSize) col = ++row;\n    }\n  }\n}\nSymmetricMatrix.prototype.klassType = 'SymmetricMatrix';\n\nclass DistanceMatrix extends SymmetricMatrix {\n  /**\n   * not the same as matrix.isSymmetric()\n   * Here is to check if it's instanceof SymmetricMatrix without bundling issues\n   *\n   * @param value\n   * @returns {boolean}\n   */\n  static isDistanceMatrix(value) {\n    return (\n      SymmetricMatrix.isSymmetricMatrix(value) &&\n      value.klassSubType === 'DistanceMatrix'\n    );\n  }\n\n  constructor(sideSize) {\n    super(sideSize);\n\n    if (!this.isDistance()) {\n      throw new TypeError('Provided arguments do no produce a distance matrix');\n    }\n  }\n\n  set(rowIndex, columnIndex, value) {\n    // distance matrix diagonal is 0\n    if (rowIndex === columnIndex) value = 0;\n\n    return super.set(rowIndex, columnIndex, value);\n  }\n\n  addCross(index, array) {\n    if (array === undefined) {\n      array = index;\n      index = this.diagonalSize;\n    }\n\n    // ensure distance\n    array = array.slice();\n    array[index] = 0;\n\n    return super.addCross(index, array);\n  }\n\n  toSymmetricMatrix() {\n    return new SymmetricMatrix(this);\n  }\n\n  clone() {\n    const matrix = new DistanceMatrix(this.diagonalSize);\n\n    for (const [row, col, value] of this.upperRightEntries()) {\n      if (row === col) continue;\n      matrix.set(row, col, value);\n    }\n\n    return matrix;\n  }\n\n  /**\n   * Compact format upper-right corner of matrix\n   * no diagonal (only zeros)\n   * iterable from left to right, from top to bottom.\n   *\n   * ```\n   *   A B C D\n   * A 0 1 2 3\n   * B 1 0 4 5\n   * C 2 4 0 6\n   * D 3 5 6 0\n   * ```\n   *\n   * will return compact 1D array `[1, 2, 3, 4, 5, 6]`\n   *\n   * length is S(i=0, n=sideSize-1) => 6 for a 4 side sized matrix\n   *\n   * @returns {number[]}\n   */\n  toCompact() {\n    const { diagonalSize } = this;\n    const compactLength = ((diagonalSize - 1) * diagonalSize) / 2;\n\n    /** @type {number[]} */\n    const compact = new Array(compactLength);\n    for (let col = 1, row = 0, index = 0; index < compact.length; index++) {\n      compact[index] = this.get(row, col);\n\n      if (++col >= diagonalSize) col = ++row + 1;\n    }\n\n    return compact;\n  }\n\n  /**\n   * @param {number[]} compact\n   */\n  static fromCompact(compact) {\n    const compactSize = compact.length;\n\n    if (compactSize === 0) {\n      return new this(0);\n    }\n\n    // compactSize in Natural integer range ]0;∞]\n    // compactSize = (sideSize * (sideSize - 1)) / 2\n    // sideSize = (Sqrt(8 × compactSize + 1) + 1) / 2\n    const diagonalSize = (Math.sqrt(8 * compactSize + 1) + 1) / 2;\n\n    if (!Number.isInteger(diagonalSize)) {\n      throw new TypeError(\n        `This array is not a compact representation of a DistanceMatrix, ${JSON.stringify(\n          compact,\n        )}`,\n      );\n    }\n\n    const matrix = new this(diagonalSize);\n    for (let col = 1, row = 0, index = 0; index < compactSize; index++) {\n      matrix.set(col, row, compact[index]);\n      if (++col >= diagonalSize) col = ++row + 1;\n    }\n\n    return matrix;\n  }\n}\nDistanceMatrix.prototype.klassSubType = 'DistanceMatrix';\n\nclass BaseView extends AbstractMatrix {\n  constructor(matrix, rows, columns) {\n    super();\n    this.matrix = matrix;\n    this.rows = rows;\n    this.columns = columns;\n  }\n}\n\nclass MatrixColumnView extends BaseView {\n  constructor(matrix, column) {\n    checkColumnIndex(matrix, column);\n    super(matrix, matrix.rows, 1);\n    this.column = column;\n  }\n\n  set(rowIndex, columnIndex, value) {\n    this.matrix.set(rowIndex, this.column, value);\n    return this;\n  }\n\n  get(rowIndex) {\n    return this.matrix.get(rowIndex, this.column);\n  }\n}\n\nclass MatrixColumnSelectionView extends BaseView {\n  constructor(matrix, columnIndices) {\n    checkColumnIndices(matrix, columnIndices);\n    super(matrix, matrix.rows, columnIndices.length);\n    this.columnIndices = columnIndices;\n  }\n\n  set(rowIndex, columnIndex, value) {\n    this.matrix.set(rowIndex, this.columnIndices[columnIndex], value);\n    return this;\n  }\n\n  get(rowIndex, columnIndex) {\n    return this.matrix.get(rowIndex, this.columnIndices[columnIndex]);\n  }\n}\n\nclass MatrixFlipColumnView extends BaseView {\n  constructor(matrix) {\n    super(matrix, matrix.rows, matrix.columns);\n  }\n\n  set(rowIndex, columnIndex, value) {\n    this.matrix.set(rowIndex, this.columns - columnIndex - 1, value);\n    return this;\n  }\n\n  get(rowIndex, columnIndex) {\n    return this.matrix.get(rowIndex, this.columns - columnIndex - 1);\n  }\n}\n\nclass MatrixFlipRowView extends BaseView {\n  constructor(matrix) {\n    super(matrix, matrix.rows, matrix.columns);\n  }\n\n  set(rowIndex, columnIndex, value) {\n    this.matrix.set(this.rows - rowIndex - 1, columnIndex, value);\n    return this;\n  }\n\n  get(rowIndex, columnIndex) {\n    return this.matrix.get(this.rows - rowIndex - 1, columnIndex);\n  }\n}\n\nclass MatrixRowView extends BaseView {\n  constructor(matrix, row) {\n    checkRowIndex(matrix, row);\n    super(matrix, 1, matrix.columns);\n    this.row = row;\n  }\n\n  set(rowIndex, columnIndex, value) {\n    this.matrix.set(this.row, columnIndex, value);\n    return this;\n  }\n\n  get(rowIndex, columnIndex) {\n    return this.matrix.get(this.row, columnIndex);\n  }\n}\n\nclass MatrixRowSelectionView extends BaseView {\n  constructor(matrix, rowIndices) {\n    checkRowIndices(matrix, rowIndices);\n    super(matrix, rowIndices.length, matrix.columns);\n    this.rowIndices = rowIndices;\n  }\n\n  set(rowIndex, columnIndex, value) {\n    this.matrix.set(this.rowIndices[rowIndex], columnIndex, value);\n    return this;\n  }\n\n  get(rowIndex, columnIndex) {\n    return this.matrix.get(this.rowIndices[rowIndex], columnIndex);\n  }\n}\n\nclass MatrixSelectionView extends BaseView {\n  constructor(matrix, rowIndices, columnIndices) {\n    checkRowIndices(matrix, rowIndices);\n    checkColumnIndices(matrix, columnIndices);\n    super(matrix, rowIndices.length, columnIndices.length);\n    this.rowIndices = rowIndices;\n    this.columnIndices = columnIndices;\n  }\n\n  set(rowIndex, columnIndex, value) {\n    this.matrix.set(\n      this.rowIndices[rowIndex],\n      this.columnIndices[columnIndex],\n      value,\n    );\n    return this;\n  }\n\n  get(rowIndex, columnIndex) {\n    return this.matrix.get(\n      this.rowIndices[rowIndex],\n      this.columnIndices[columnIndex],\n    );\n  }\n}\n\nclass MatrixSubView extends BaseView {\n  constructor(matrix, startRow, endRow, startColumn, endColumn) {\n    checkRange(matrix, startRow, endRow, startColumn, endColumn);\n    super(matrix, endRow - startRow + 1, endColumn - startColumn + 1);\n    this.startRow = startRow;\n    this.startColumn = startColumn;\n  }\n\n  set(rowIndex, columnIndex, value) {\n    this.matrix.set(\n      this.startRow + rowIndex,\n      this.startColumn + columnIndex,\n      value,\n    );\n    return this;\n  }\n\n  get(rowIndex, columnIndex) {\n    return this.matrix.get(\n      this.startRow + rowIndex,\n      this.startColumn + columnIndex,\n    );\n  }\n}\n\nclass MatrixTransposeView extends BaseView {\n  constructor(matrix) {\n    super(matrix, matrix.columns, matrix.rows);\n  }\n\n  set(rowIndex, columnIndex, value) {\n    this.matrix.set(columnIndex, rowIndex, value);\n    return this;\n  }\n\n  get(rowIndex, columnIndex) {\n    return this.matrix.get(columnIndex, rowIndex);\n  }\n}\n\nclass WrapperMatrix1D extends AbstractMatrix {\n  constructor(data, options = {}) {\n    const { rows = 1 } = options;\n\n    if (data.length % rows !== 0) {\n      throw new Error('the data length is not divisible by the number of rows');\n    }\n    super();\n    this.rows = rows;\n    this.columns = data.length / rows;\n    this.data = data;\n  }\n\n  set(rowIndex, columnIndex, value) {\n    let index = this._calculateIndex(rowIndex, columnIndex);\n    this.data[index] = value;\n    return this;\n  }\n\n  get(rowIndex, columnIndex) {\n    let index = this._calculateIndex(rowIndex, columnIndex);\n    return this.data[index];\n  }\n\n  _calculateIndex(row, column) {\n    return row * this.columns + column;\n  }\n}\n\nclass WrapperMatrix2D extends AbstractMatrix {\n  constructor(data) {\n    super();\n    this.data = data;\n    this.rows = data.length;\n    this.columns = data[0].length;\n  }\n\n  set(rowIndex, columnIndex, value) {\n    this.data[rowIndex][columnIndex] = value;\n    return this;\n  }\n\n  get(rowIndex, columnIndex) {\n    return this.data[rowIndex][columnIndex];\n  }\n}\n\nfunction wrap(array, options) {\n  if (isAnyArray(array)) {\n    if (array[0] && isAnyArray(array[0])) {\n      return new WrapperMatrix2D(array);\n    } else {\n      return new WrapperMatrix1D(array, options);\n    }\n  } else {\n    throw new Error('the argument is not an array');\n  }\n}\n\nclass LuDecomposition {\n  constructor(matrix) {\n    matrix = WrapperMatrix2D.checkMatrix(matrix);\n\n    let lu = matrix.clone();\n    let rows = lu.rows;\n    let columns = lu.columns;\n    let pivotVector = new Float64Array(rows);\n    let pivotSign = 1;\n    let i, j, k, p, s, t, v;\n    let LUcolj, kmax;\n\n    for (i = 0; i < rows; i++) {\n      pivotVector[i] = i;\n    }\n\n    LUcolj = new Float64Array(rows);\n\n    for (j = 0; j < columns; j++) {\n      for (i = 0; i < rows; i++) {\n        LUcolj[i] = lu.get(i, j);\n      }\n\n      for (i = 0; i < rows; i++) {\n        kmax = Math.min(i, j);\n        s = 0;\n        for (k = 0; k < kmax; k++) {\n          s += lu.get(i, k) * LUcolj[k];\n        }\n        LUcolj[i] -= s;\n        lu.set(i, j, LUcolj[i]);\n      }\n\n      p = j;\n      for (i = j + 1; i < rows; i++) {\n        if (Math.abs(LUcolj[i]) > Math.abs(LUcolj[p])) {\n          p = i;\n        }\n      }\n\n      if (p !== j) {\n        for (k = 0; k < columns; k++) {\n          t = lu.get(p, k);\n          lu.set(p, k, lu.get(j, k));\n          lu.set(j, k, t);\n        }\n\n        v = pivotVector[p];\n        pivotVector[p] = pivotVector[j];\n        pivotVector[j] = v;\n\n        pivotSign = -pivotSign;\n      }\n\n      if (j < rows && lu.get(j, j) !== 0) {\n        for (i = j + 1; i < rows; i++) {\n          lu.set(i, j, lu.get(i, j) / lu.get(j, j));\n        }\n      }\n    }\n\n    this.LU = lu;\n    this.pivotVector = pivotVector;\n    this.pivotSign = pivotSign;\n  }\n\n  isSingular() {\n    let data = this.LU;\n    let col = data.columns;\n    for (let j = 0; j < col; j++) {\n      if (data.get(j, j) === 0) {\n        return true;\n      }\n    }\n    return false;\n  }\n\n  solve(value) {\n    value = Matrix.checkMatrix(value);\n\n    let lu = this.LU;\n    let rows = lu.rows;\n\n    if (rows !== value.rows) {\n      throw new Error('Invalid matrix dimensions');\n    }\n    if (this.isSingular()) {\n      throw new Error('LU matrix is singular');\n    }\n\n    let count = value.columns;\n    let X = value.subMatrixRow(this.pivotVector, 0, count - 1);\n    let columns = lu.columns;\n    let i, j, k;\n\n    for (k = 0; k < columns; k++) {\n      for (i = k + 1; i < columns; i++) {\n        for (j = 0; j < count; j++) {\n          X.set(i, j, X.get(i, j) - X.get(k, j) * lu.get(i, k));\n        }\n      }\n    }\n    for (k = columns - 1; k >= 0; k--) {\n      for (j = 0; j < count; j++) {\n        X.set(k, j, X.get(k, j) / lu.get(k, k));\n      }\n      for (i = 0; i < k; i++) {\n        for (j = 0; j < count; j++) {\n          X.set(i, j, X.get(i, j) - X.get(k, j) * lu.get(i, k));\n        }\n      }\n    }\n    return X;\n  }\n\n  get determinant() {\n    let data = this.LU;\n    if (!data.isSquare()) {\n      throw new Error('Matrix must be square');\n    }\n    let determinant = this.pivotSign;\n    let col = data.columns;\n    for (let j = 0; j < col; j++) {\n      determinant *= data.get(j, j);\n    }\n    return determinant;\n  }\n\n  get lowerTriangularMatrix() {\n    let data = this.LU;\n    let rows = data.rows;\n    let columns = data.columns;\n    let X = new Matrix(rows, columns);\n    for (let i = 0; i < rows; i++) {\n      for (let j = 0; j < columns; j++) {\n        if (i > j) {\n          X.set(i, j, data.get(i, j));\n        } else if (i === j) {\n          X.set(i, j, 1);\n        } else {\n          X.set(i, j, 0);\n        }\n      }\n    }\n    return X;\n  }\n\n  get upperTriangularMatrix() {\n    let data = this.LU;\n    let rows = data.rows;\n    let columns = data.columns;\n    let X = new Matrix(rows, columns);\n    for (let i = 0; i < rows; i++) {\n      for (let j = 0; j < columns; j++) {\n        if (i <= j) {\n          X.set(i, j, data.get(i, j));\n        } else {\n          X.set(i, j, 0);\n        }\n      }\n    }\n    return X;\n  }\n\n  get pivotPermutationVector() {\n    return Array.from(this.pivotVector);\n  }\n}\n\nfunction hypotenuse(a, b) {\n  let r = 0;\n  if (Math.abs(a) > Math.abs(b)) {\n    r = b / a;\n    return Math.abs(a) * Math.sqrt(1 + r * r);\n  }\n  if (b !== 0) {\n    r = a / b;\n    return Math.abs(b) * Math.sqrt(1 + r * r);\n  }\n  return 0;\n}\n\nclass QrDecomposition {\n  constructor(value) {\n    value = WrapperMatrix2D.checkMatrix(value);\n\n    let qr = value.clone();\n    let m = value.rows;\n    let n = value.columns;\n    let rdiag = new Float64Array(n);\n    let i, j, k, s;\n\n    for (k = 0; k < n; k++) {\n      let nrm = 0;\n      for (i = k; i < m; i++) {\n        nrm = hypotenuse(nrm, qr.get(i, k));\n      }\n      if (nrm !== 0) {\n        if (qr.get(k, k) < 0) {\n          nrm = -nrm;\n        }\n        for (i = k; i < m; i++) {\n          qr.set(i, k, qr.get(i, k) / nrm);\n        }\n        qr.set(k, k, qr.get(k, k) + 1);\n        for (j = k + 1; j < n; j++) {\n          s = 0;\n          for (i = k; i < m; i++) {\n            s += qr.get(i, k) * qr.get(i, j);\n          }\n          s = -s / qr.get(k, k);\n          for (i = k; i < m; i++) {\n            qr.set(i, j, qr.get(i, j) + s * qr.get(i, k));\n          }\n        }\n      }\n      rdiag[k] = -nrm;\n    }\n\n    this.QR = qr;\n    this.Rdiag = rdiag;\n  }\n\n  solve(value) {\n    value = Matrix.checkMatrix(value);\n\n    let qr = this.QR;\n    let m = qr.rows;\n\n    if (value.rows !== m) {\n      throw new Error('Matrix row dimensions must agree');\n    }\n    if (!this.isFullRank()) {\n      throw new Error('Matrix is rank deficient');\n    }\n\n    let count = value.columns;\n    let X = value.clone();\n    let n = qr.columns;\n    let i, j, k, s;\n\n    for (k = 0; k < n; k++) {\n      for (j = 0; j < count; j++) {\n        s = 0;\n        for (i = k; i < m; i++) {\n          s += qr.get(i, k) * X.get(i, j);\n        }\n        s = -s / qr.get(k, k);\n        for (i = k; i < m; i++) {\n          X.set(i, j, X.get(i, j) + s * qr.get(i, k));\n        }\n      }\n    }\n    for (k = n - 1; k >= 0; k--) {\n      for (j = 0; j < count; j++) {\n        X.set(k, j, X.get(k, j) / this.Rdiag[k]);\n      }\n      for (i = 0; i < k; i++) {\n        for (j = 0; j < count; j++) {\n          X.set(i, j, X.get(i, j) - X.get(k, j) * qr.get(i, k));\n        }\n      }\n    }\n\n    return X.subMatrix(0, n - 1, 0, count - 1);\n  }\n\n  isFullRank() {\n    let columns = this.QR.columns;\n    for (let i = 0; i < columns; i++) {\n      if (this.Rdiag[i] === 0) {\n        return false;\n      }\n    }\n    return true;\n  }\n\n  get upperTriangularMatrix() {\n    let qr = this.QR;\n    let n = qr.columns;\n    let X = new Matrix(n, n);\n    let i, j;\n    for (i = 0; i < n; i++) {\n      for (j = 0; j < n; j++) {\n        if (i < j) {\n          X.set(i, j, qr.get(i, j));\n        } else if (i === j) {\n          X.set(i, j, this.Rdiag[i]);\n        } else {\n          X.set(i, j, 0);\n        }\n      }\n    }\n    return X;\n  }\n\n  get orthogonalMatrix() {\n    let qr = this.QR;\n    let rows = qr.rows;\n    let columns = qr.columns;\n    let X = new Matrix(rows, columns);\n    let i, j, k, s;\n\n    for (k = columns - 1; k >= 0; k--) {\n      for (i = 0; i < rows; i++) {\n        X.set(i, k, 0);\n      }\n      X.set(k, k, 1);\n      for (j = k; j < columns; j++) {\n        if (qr.get(k, k) !== 0) {\n          s = 0;\n          for (i = k; i < rows; i++) {\n            s += qr.get(i, k) * X.get(i, j);\n          }\n\n          s = -s / qr.get(k, k);\n\n          for (i = k; i < rows; i++) {\n            X.set(i, j, X.get(i, j) + s * qr.get(i, k));\n          }\n        }\n      }\n    }\n    return X;\n  }\n}\n\nclass SingularValueDecomposition {\n  constructor(value, options = {}) {\n    value = WrapperMatrix2D.checkMatrix(value);\n\n    if (value.isEmpty()) {\n      throw new Error('Matrix must be non-empty');\n    }\n\n    let m = value.rows;\n    let n = value.columns;\n\n    const {\n      computeLeftSingularVectors = true,\n      computeRightSingularVectors = true,\n      autoTranspose = false,\n    } = options;\n\n    let wantu = Boolean(computeLeftSingularVectors);\n    let wantv = Boolean(computeRightSingularVectors);\n\n    let swapped = false;\n    let a;\n    if (m < n) {\n      if (!autoTranspose) {\n        a = value.clone();\n        // eslint-disable-next-line no-console\n        console.warn(\n          'Computing SVD on a matrix with more columns than rows. Consider enabling autoTranspose',\n        );\n      } else {\n        a = value.transpose();\n        m = a.rows;\n        n = a.columns;\n        swapped = true;\n        let aux = wantu;\n        wantu = wantv;\n        wantv = aux;\n      }\n    } else {\n      a = value.clone();\n    }\n\n    let nu = Math.min(m, n);\n    let ni = Math.min(m + 1, n);\n    let s = new Float64Array(ni);\n    let U = new Matrix(m, nu);\n    let V = new Matrix(n, n);\n\n    let e = new Float64Array(n);\n    let work = new Float64Array(m);\n\n    let si = new Float64Array(ni);\n    for (let i = 0; i < ni; i++) si[i] = i;\n\n    let nct = Math.min(m - 1, n);\n    let nrt = Math.max(0, Math.min(n - 2, m));\n    let mrc = Math.max(nct, nrt);\n\n    for (let k = 0; k < mrc; k++) {\n      if (k < nct) {\n        s[k] = 0;\n        for (let i = k; i < m; i++) {\n          s[k] = hypotenuse(s[k], a.get(i, k));\n        }\n        if (s[k] !== 0) {\n          if (a.get(k, k) < 0) {\n            s[k] = -s[k];\n          }\n          for (let i = k; i < m; i++) {\n            a.set(i, k, a.get(i, k) / s[k]);\n          }\n          a.set(k, k, a.get(k, k) + 1);\n        }\n        s[k] = -s[k];\n      }\n\n      for (let j = k + 1; j < n; j++) {\n        if (k < nct && s[k] !== 0) {\n          let t = 0;\n          for (let i = k; i < m; i++) {\n            t += a.get(i, k) * a.get(i, j);\n          }\n          t = -t / a.get(k, k);\n          for (let i = k; i < m; i++) {\n            a.set(i, j, a.get(i, j) + t * a.get(i, k));\n          }\n        }\n        e[j] = a.get(k, j);\n      }\n\n      if (wantu && k < nct) {\n        for (let i = k; i < m; i++) {\n          U.set(i, k, a.get(i, k));\n        }\n      }\n\n      if (k < nrt) {\n        e[k] = 0;\n        for (let i = k + 1; i < n; i++) {\n          e[k] = hypotenuse(e[k], e[i]);\n        }\n        if (e[k] !== 0) {\n          if (e[k + 1] < 0) {\n            e[k] = 0 - e[k];\n          }\n          for (let i = k + 1; i < n; i++) {\n            e[i] /= e[k];\n          }\n          e[k + 1] += 1;\n        }\n        e[k] = -e[k];\n        if (k + 1 < m && e[k] !== 0) {\n          for (let i = k + 1; i < m; i++) {\n            work[i] = 0;\n          }\n          for (let i = k + 1; i < m; i++) {\n            for (let j = k + 1; j < n; j++) {\n              work[i] += e[j] * a.get(i, j);\n            }\n          }\n          for (let j = k + 1; j < n; j++) {\n            let t = -e[j] / e[k + 1];\n            for (let i = k + 1; i < m; i++) {\n              a.set(i, j, a.get(i, j) + t * work[i]);\n            }\n          }\n        }\n        if (wantv) {\n          for (let i = k + 1; i < n; i++) {\n            V.set(i, k, e[i]);\n          }\n        }\n      }\n    }\n\n    let p = Math.min(n, m + 1);\n    if (nct < n) {\n      s[nct] = a.get(nct, nct);\n    }\n    if (m < p) {\n      s[p - 1] = 0;\n    }\n    if (nrt + 1 < p) {\n      e[nrt] = a.get(nrt, p - 1);\n    }\n    e[p - 1] = 0;\n\n    if (wantu) {\n      for (let j = nct; j < nu; j++) {\n        for (let i = 0; i < m; i++) {\n          U.set(i, j, 0);\n        }\n        U.set(j, j, 1);\n      }\n      for (let k = nct - 1; k >= 0; k--) {\n        if (s[k] !== 0) {\n          for (let j = k + 1; j < nu; j++) {\n            let t = 0;\n            for (let i = k; i < m; i++) {\n              t += U.get(i, k) * U.get(i, j);\n            }\n            t = -t / U.get(k, k);\n            for (let i = k; i < m; i++) {\n              U.set(i, j, U.get(i, j) + t * U.get(i, k));\n            }\n          }\n          for (let i = k; i < m; i++) {\n            U.set(i, k, -U.get(i, k));\n          }\n          U.set(k, k, 1 + U.get(k, k));\n          for (let i = 0; i < k - 1; i++) {\n            U.set(i, k, 0);\n          }\n        } else {\n          for (let i = 0; i < m; i++) {\n            U.set(i, k, 0);\n          }\n          U.set(k, k, 1);\n        }\n      }\n    }\n\n    if (wantv) {\n      for (let k = n - 1; k >= 0; k--) {\n        if (k < nrt && e[k] !== 0) {\n          for (let j = k + 1; j < n; j++) {\n            let t = 0;\n            for (let i = k + 1; i < n; i++) {\n              t += V.get(i, k) * V.get(i, j);\n            }\n            t = -t / V.get(k + 1, k);\n            for (let i = k + 1; i < n; i++) {\n              V.set(i, j, V.get(i, j) + t * V.get(i, k));\n            }\n          }\n        }\n        for (let i = 0; i < n; i++) {\n          V.set(i, k, 0);\n        }\n        V.set(k, k, 1);\n      }\n    }\n\n    let pp = p - 1;\n    let eps = Number.EPSILON;\n    while (p > 0) {\n      let k, kase;\n      for (k = p - 2; k >= -1; k--) {\n        if (k === -1) {\n          break;\n        }\n        const alpha =\n          Number.MIN_VALUE + eps * Math.abs(s[k] + Math.abs(s[k + 1]));\n        if (Math.abs(e[k]) <= alpha || Number.isNaN(e[k])) {\n          e[k] = 0;\n          break;\n        }\n      }\n      if (k === p - 2) {\n        kase = 4;\n      } else {\n        let ks;\n        for (ks = p - 1; ks >= k; ks--) {\n          if (ks === k) {\n            break;\n          }\n          let t =\n            (ks !== p ? Math.abs(e[ks]) : 0) +\n            (ks !== k + 1 ? Math.abs(e[ks - 1]) : 0);\n          if (Math.abs(s[ks]) <= eps * t) {\n            s[ks] = 0;\n            break;\n          }\n        }\n        if (ks === k) {\n          kase = 3;\n        } else if (ks === p - 1) {\n          kase = 1;\n        } else {\n          kase = 2;\n          k = ks;\n        }\n      }\n\n      k++;\n\n      switch (kase) {\n        case 1: {\n          let f = e[p - 2];\n          e[p - 2] = 0;\n          for (let j = p - 2; j >= k; j--) {\n            let t = hypotenuse(s[j], f);\n            let cs = s[j] / t;\n            let sn = f / t;\n            s[j] = t;\n            if (j !== k) {\n              f = -sn * e[j - 1];\n              e[j - 1] = cs * e[j - 1];\n            }\n            if (wantv) {\n              for (let i = 0; i < n; i++) {\n                t = cs * V.get(i, j) + sn * V.get(i, p - 1);\n                V.set(i, p - 1, -sn * V.get(i, j) + cs * V.get(i, p - 1));\n                V.set(i, j, t);\n              }\n            }\n          }\n          break;\n        }\n        case 2: {\n          let f = e[k - 1];\n          e[k - 1] = 0;\n          for (let j = k; j < p; j++) {\n            let t = hypotenuse(s[j], f);\n            let cs = s[j] / t;\n            let sn = f / t;\n            s[j] = t;\n            f = -sn * e[j];\n            e[j] = cs * e[j];\n            if (wantu) {\n              for (let i = 0; i < m; i++) {\n                t = cs * U.get(i, j) + sn * U.get(i, k - 1);\n                U.set(i, k - 1, -sn * U.get(i, j) + cs * U.get(i, k - 1));\n                U.set(i, j, t);\n              }\n            }\n          }\n          break;\n        }\n        case 3: {\n          const scale = Math.max(\n            Math.abs(s[p - 1]),\n            Math.abs(s[p - 2]),\n            Math.abs(e[p - 2]),\n            Math.abs(s[k]),\n            Math.abs(e[k]),\n          );\n          const sp = s[p - 1] / scale;\n          const spm1 = s[p - 2] / scale;\n          const epm1 = e[p - 2] / scale;\n          const sk = s[k] / scale;\n          const ek = e[k] / scale;\n          const b = ((spm1 + sp) * (spm1 - sp) + epm1 * epm1) / 2;\n          const c = sp * epm1 * (sp * epm1);\n          let shift = 0;\n          if (b !== 0 || c !== 0) {\n            if (b < 0) {\n              shift = 0 - Math.sqrt(b * b + c);\n            } else {\n              shift = Math.sqrt(b * b + c);\n            }\n            shift = c / (b + shift);\n          }\n          let f = (sk + sp) * (sk - sp) + shift;\n          let g = sk * ek;\n          for (let j = k; j < p - 1; j++) {\n            let t = hypotenuse(f, g);\n            if (t === 0) t = Number.MIN_VALUE;\n            let cs = f / t;\n            let sn = g / t;\n            if (j !== k) {\n              e[j - 1] = t;\n            }\n            f = cs * s[j] + sn * e[j];\n            e[j] = cs * e[j] - sn * s[j];\n            g = sn * s[j + 1];\n            s[j + 1] = cs * s[j + 1];\n            if (wantv) {\n              for (let i = 0; i < n; i++) {\n                t = cs * V.get(i, j) + sn * V.get(i, j + 1);\n                V.set(i, j + 1, -sn * V.get(i, j) + cs * V.get(i, j + 1));\n                V.set(i, j, t);\n              }\n            }\n            t = hypotenuse(f, g);\n            if (t === 0) t = Number.MIN_VALUE;\n            cs = f / t;\n            sn = g / t;\n            s[j] = t;\n            f = cs * e[j] + sn * s[j + 1];\n            s[j + 1] = -sn * e[j] + cs * s[j + 1];\n            g = sn * e[j + 1];\n            e[j + 1] = cs * e[j + 1];\n            if (wantu && j < m - 1) {\n              for (let i = 0; i < m; i++) {\n                t = cs * U.get(i, j) + sn * U.get(i, j + 1);\n                U.set(i, j + 1, -sn * U.get(i, j) + cs * U.get(i, j + 1));\n                U.set(i, j, t);\n              }\n            }\n          }\n          e[p - 2] = f;\n          break;\n        }\n        case 4: {\n          if (s[k] <= 0) {\n            s[k] = s[k] < 0 ? -s[k] : 0;\n            if (wantv) {\n              for (let i = 0; i <= pp; i++) {\n                V.set(i, k, -V.get(i, k));\n              }\n            }\n          }\n          while (k < pp) {\n            if (s[k] >= s[k + 1]) {\n              break;\n            }\n            let t = s[k];\n            s[k] = s[k + 1];\n            s[k + 1] = t;\n            if (wantv && k < n - 1) {\n              for (let i = 0; i < n; i++) {\n                t = V.get(i, k + 1);\n                V.set(i, k + 1, V.get(i, k));\n                V.set(i, k, t);\n              }\n            }\n            if (wantu && k < m - 1) {\n              for (let i = 0; i < m; i++) {\n                t = U.get(i, k + 1);\n                U.set(i, k + 1, U.get(i, k));\n                U.set(i, k, t);\n              }\n            }\n            k++;\n          }\n          p--;\n          break;\n        }\n        // no default\n      }\n    }\n\n    if (swapped) {\n      let tmp = V;\n      V = U;\n      U = tmp;\n    }\n\n    this.m = m;\n    this.n = n;\n    this.s = s;\n    this.U = U;\n    this.V = V;\n  }\n\n  solve(value) {\n    let Y = value;\n    let e = this.threshold;\n    let scols = this.s.length;\n    let Ls = Matrix.zeros(scols, scols);\n\n    for (let i = 0; i < scols; i++) {\n      if (Math.abs(this.s[i]) <= e) {\n        Ls.set(i, i, 0);\n      } else {\n        Ls.set(i, i, 1 / this.s[i]);\n      }\n    }\n\n    let U = this.U;\n    let V = this.rightSingularVectors;\n\n    let VL = V.mmul(Ls);\n    let vrows = V.rows;\n    let urows = U.rows;\n    let VLU = Matrix.zeros(vrows, urows);\n\n    for (let i = 0; i < vrows; i++) {\n      for (let j = 0; j < urows; j++) {\n        let sum = 0;\n        for (let k = 0; k < scols; k++) {\n          sum += VL.get(i, k) * U.get(j, k);\n        }\n        VLU.set(i, j, sum);\n      }\n    }\n\n    return VLU.mmul(Y);\n  }\n\n  solveForDiagonal(value) {\n    return this.solve(Matrix.diag(value));\n  }\n\n  inverse() {\n    let V = this.V;\n    let e = this.threshold;\n    let vrows = V.rows;\n    let vcols = V.columns;\n    let X = new Matrix(vrows, this.s.length);\n\n    for (let i = 0; i < vrows; i++) {\n      for (let j = 0; j < vcols; j++) {\n        if (Math.abs(this.s[j]) > e) {\n          X.set(i, j, V.get(i, j) / this.s[j]);\n        }\n      }\n    }\n\n    let U = this.U;\n\n    let urows = U.rows;\n    let ucols = U.columns;\n    let Y = new Matrix(vrows, urows);\n\n    for (let i = 0; i < vrows; i++) {\n      for (let j = 0; j < urows; j++) {\n        let sum = 0;\n        for (let k = 0; k < ucols; k++) {\n          sum += X.get(i, k) * U.get(j, k);\n        }\n        Y.set(i, j, sum);\n      }\n    }\n\n    return Y;\n  }\n\n  get condition() {\n    return this.s[0] / this.s[Math.min(this.m, this.n) - 1];\n  }\n\n  get norm2() {\n    return this.s[0];\n  }\n\n  get rank() {\n    let tol = Math.max(this.m, this.n) * this.s[0] * Number.EPSILON;\n    let r = 0;\n    let s = this.s;\n    for (let i = 0, ii = s.length; i < ii; i++) {\n      if (s[i] > tol) {\n        r++;\n      }\n    }\n    return r;\n  }\n\n  get diagonal() {\n    return Array.from(this.s);\n  }\n\n  get threshold() {\n    return (Number.EPSILON / 2) * Math.max(this.m, this.n) * this.s[0];\n  }\n\n  get leftSingularVectors() {\n    return this.U;\n  }\n\n  get rightSingularVectors() {\n    return this.V;\n  }\n\n  get diagonalMatrix() {\n    return Matrix.diag(this.s);\n  }\n}\n\nfunction inverse(matrix, useSVD = false) {\n  matrix = WrapperMatrix2D.checkMatrix(matrix);\n  if (useSVD) {\n    return new SingularValueDecomposition(matrix).inverse();\n  } else {\n    return solve(matrix, Matrix.eye(matrix.rows));\n  }\n}\n\nfunction solve(leftHandSide, rightHandSide, useSVD = false) {\n  leftHandSide = WrapperMatrix2D.checkMatrix(leftHandSide);\n  rightHandSide = WrapperMatrix2D.checkMatrix(rightHandSide);\n  if (useSVD) {\n    return new SingularValueDecomposition(leftHandSide).solve(rightHandSide);\n  } else {\n    return leftHandSide.isSquare()\n      ? new LuDecomposition(leftHandSide).solve(rightHandSide)\n      : new QrDecomposition(leftHandSide).solve(rightHandSide);\n  }\n}\n\nfunction determinant(matrix) {\n  matrix = Matrix.checkMatrix(matrix);\n  if (matrix.isSquare()) {\n    if (matrix.columns === 0) {\n      return 1;\n    }\n\n    let a, b, c, d;\n    if (matrix.columns === 2) {\n      // 2 x 2 matrix\n      a = matrix.get(0, 0);\n      b = matrix.get(0, 1);\n      c = matrix.get(1, 0);\n      d = matrix.get(1, 1);\n\n      return a * d - b * c;\n    } else if (matrix.columns === 3) {\n      // 3 x 3 matrix\n      let subMatrix0, subMatrix1, subMatrix2;\n      subMatrix0 = new MatrixSelectionView(matrix, [1, 2], [1, 2]);\n      subMatrix1 = new MatrixSelectionView(matrix, [1, 2], [0, 2]);\n      subMatrix2 = new MatrixSelectionView(matrix, [1, 2], [0, 1]);\n      a = matrix.get(0, 0);\n      b = matrix.get(0, 1);\n      c = matrix.get(0, 2);\n\n      return (\n        a * determinant(subMatrix0) -\n        b * determinant(subMatrix1) +\n        c * determinant(subMatrix2)\n      );\n    } else {\n      // general purpose determinant using the LU decomposition\n      return new LuDecomposition(matrix).determinant;\n    }\n  } else {\n    throw Error('determinant can only be calculated for a square matrix');\n  }\n}\n\nfunction xrange(n, exception) {\n  let range = [];\n  for (let i = 0; i < n; i++) {\n    if (i !== exception) {\n      range.push(i);\n    }\n  }\n  return range;\n}\n\nfunction dependenciesOneRow(\n  error,\n  matrix,\n  index,\n  thresholdValue = 10e-10,\n  thresholdError = 10e-10,\n) {\n  if (error > thresholdError) {\n    return new Array(matrix.rows + 1).fill(0);\n  } else {\n    let returnArray = matrix.addRow(index, [0]);\n    for (let i = 0; i < returnArray.rows; i++) {\n      if (Math.abs(returnArray.get(i, 0)) < thresholdValue) {\n        returnArray.set(i, 0, 0);\n      }\n    }\n    return returnArray.to1DArray();\n  }\n}\n\nfunction linearDependencies(matrix, options = {}) {\n  const { thresholdValue = 10e-10, thresholdError = 10e-10 } = options;\n  matrix = Matrix.checkMatrix(matrix);\n\n  let n = matrix.rows;\n  let results = new Matrix(n, n);\n\n  for (let i = 0; i < n; i++) {\n    let b = Matrix.columnVector(matrix.getRow(i));\n    let Abis = matrix.subMatrixRow(xrange(n, i)).transpose();\n    let svd = new SingularValueDecomposition(Abis);\n    let x = svd.solve(b);\n    let error = Matrix.sub(b, Abis.mmul(x)).abs().max();\n    results.setRow(\n      i,\n      dependenciesOneRow(error, x, i, thresholdValue, thresholdError),\n    );\n  }\n  return results;\n}\n\nfunction pseudoInverse(matrix, threshold = Number.EPSILON) {\n  matrix = Matrix.checkMatrix(matrix);\n  if (matrix.isEmpty()) {\n    // with a zero dimension, the pseudo-inverse is the transpose, since all 0xn and nx0 matrices are singular\n    // (0xn)*(nx0)*(0xn) = 0xn\n    // (nx0)*(0xn)*(nx0) = nx0\n    return matrix.transpose();\n  }\n  let svdSolution = new SingularValueDecomposition(matrix, { autoTranspose: true });\n\n  let U = svdSolution.leftSingularVectors;\n  let V = svdSolution.rightSingularVectors;\n  let s = svdSolution.diagonal;\n\n  for (let i = 0; i < s.length; i++) {\n    if (Math.abs(s[i]) > threshold) {\n      s[i] = 1.0 / s[i];\n    } else {\n      s[i] = 0.0;\n    }\n  }\n\n  return V.mmul(Matrix.diag(s).mmul(U.transpose()));\n}\n\nfunction covariance(xMatrix, yMatrix = xMatrix, options = {}) {\n  xMatrix = new Matrix(xMatrix);\n  let yIsSame = false;\n  if (\n    typeof yMatrix === 'object' &&\n    !Matrix.isMatrix(yMatrix) &&\n    !isAnyArray(yMatrix)\n  ) {\n    options = yMatrix;\n    yMatrix = xMatrix;\n    yIsSame = true;\n  } else {\n    yMatrix = new Matrix(yMatrix);\n  }\n  if (xMatrix.rows !== yMatrix.rows) {\n    throw new TypeError('Both matrices must have the same number of rows');\n  }\n  const { center = true } = options;\n  if (center) {\n    xMatrix = xMatrix.center('column');\n    if (!yIsSame) {\n      yMatrix = yMatrix.center('column');\n    }\n  }\n  const cov = xMatrix.transpose().mmul(yMatrix);\n  for (let i = 0; i < cov.rows; i++) {\n    for (let j = 0; j < cov.columns; j++) {\n      cov.set(i, j, cov.get(i, j) * (1 / (xMatrix.rows - 1)));\n    }\n  }\n  return cov;\n}\n\nfunction correlation(xMatrix, yMatrix = xMatrix, options = {}) {\n  xMatrix = new Matrix(xMatrix);\n  let yIsSame = false;\n  if (\n    typeof yMatrix === 'object' &&\n    !Matrix.isMatrix(yMatrix) &&\n    !isAnyArray(yMatrix)\n  ) {\n    options = yMatrix;\n    yMatrix = xMatrix;\n    yIsSame = true;\n  } else {\n    yMatrix = new Matrix(yMatrix);\n  }\n  if (xMatrix.rows !== yMatrix.rows) {\n    throw new TypeError('Both matrices must have the same number of rows');\n  }\n\n  const { center = true, scale = true } = options;\n  if (center) {\n    xMatrix.center('column');\n    if (!yIsSame) {\n      yMatrix.center('column');\n    }\n  }\n  if (scale) {\n    xMatrix.scale('column');\n    if (!yIsSame) {\n      yMatrix.scale('column');\n    }\n  }\n\n  const sdx = xMatrix.standardDeviation('column', { unbiased: true });\n  const sdy = yIsSame\n    ? sdx\n    : yMatrix.standardDeviation('column', { unbiased: true });\n\n  const corr = xMatrix.transpose().mmul(yMatrix);\n  for (let i = 0; i < corr.rows; i++) {\n    for (let j = 0; j < corr.columns; j++) {\n      corr.set(\n        i,\n        j,\n        corr.get(i, j) * (1 / (sdx[i] * sdy[j])) * (1 / (xMatrix.rows - 1)),\n      );\n    }\n  }\n  return corr;\n}\n\nclass EigenvalueDecomposition {\n  constructor(matrix, options = {}) {\n    const { assumeSymmetric = false } = options;\n\n    matrix = WrapperMatrix2D.checkMatrix(matrix);\n    if (!matrix.isSquare()) {\n      throw new Error('Matrix is not a square matrix');\n    }\n\n    if (matrix.isEmpty()) {\n      throw new Error('Matrix must be non-empty');\n    }\n\n    let n = matrix.columns;\n    let V = new Matrix(n, n);\n    let d = new Float64Array(n);\n    let e = new Float64Array(n);\n    let value = matrix;\n    let i, j;\n\n    let isSymmetric = false;\n    if (assumeSymmetric) {\n      isSymmetric = true;\n    } else {\n      isSymmetric = matrix.isSymmetric();\n    }\n\n    if (isSymmetric) {\n      for (i = 0; i < n; i++) {\n        for (j = 0; j < n; j++) {\n          V.set(i, j, value.get(i, j));\n        }\n      }\n      tred2(n, e, d, V);\n      tql2(n, e, d, V);\n    } else {\n      let H = new Matrix(n, n);\n      let ort = new Float64Array(n);\n      for (j = 0; j < n; j++) {\n        for (i = 0; i < n; i++) {\n          H.set(i, j, value.get(i, j));\n        }\n      }\n      orthes(n, H, ort, V);\n      hqr2(n, e, d, V, H);\n    }\n\n    this.n = n;\n    this.e = e;\n    this.d = d;\n    this.V = V;\n  }\n\n  get realEigenvalues() {\n    return Array.from(this.d);\n  }\n\n  get imaginaryEigenvalues() {\n    return Array.from(this.e);\n  }\n\n  get eigenvectorMatrix() {\n    return this.V;\n  }\n\n  get diagonalMatrix() {\n    let n = this.n;\n    let e = this.e;\n    let d = this.d;\n    let X = new Matrix(n, n);\n    let i, j;\n    for (i = 0; i < n; i++) {\n      for (j = 0; j < n; j++) {\n        X.set(i, j, 0);\n      }\n      X.set(i, i, d[i]);\n      if (e[i] > 0) {\n        X.set(i, i + 1, e[i]);\n      } else if (e[i] < 0) {\n        X.set(i, i - 1, e[i]);\n      }\n    }\n    return X;\n  }\n}\n\nfunction tred2(n, e, d, V) {\n  let f, g, h, i, j, k, hh, scale;\n\n  for (j = 0; j < n; j++) {\n    d[j] = V.get(n - 1, j);\n  }\n\n  for (i = n - 1; i > 0; i--) {\n    scale = 0;\n    h = 0;\n    for (k = 0; k < i; k++) {\n      scale = scale + Math.abs(d[k]);\n    }\n\n    if (scale === 0) {\n      e[i] = d[i - 1];\n      for (j = 0; j < i; j++) {\n        d[j] = V.get(i - 1, j);\n        V.set(i, j, 0);\n        V.set(j, i, 0);\n      }\n    } else {\n      for (k = 0; k < i; k++) {\n        d[k] /= scale;\n        h += d[k] * d[k];\n      }\n\n      f = d[i - 1];\n      g = Math.sqrt(h);\n      if (f > 0) {\n        g = -g;\n      }\n\n      e[i] = scale * g;\n      h = h - f * g;\n      d[i - 1] = f - g;\n      for (j = 0; j < i; j++) {\n        e[j] = 0;\n      }\n\n      for (j = 0; j < i; j++) {\n        f = d[j];\n        V.set(j, i, f);\n        g = e[j] + V.get(j, j) * f;\n        for (k = j + 1; k <= i - 1; k++) {\n          g += V.get(k, j) * d[k];\n          e[k] += V.get(k, j) * f;\n        }\n        e[j] = g;\n      }\n\n      f = 0;\n      for (j = 0; j < i; j++) {\n        e[j] /= h;\n        f += e[j] * d[j];\n      }\n\n      hh = f / (h + h);\n      for (j = 0; j < i; j++) {\n        e[j] -= hh * d[j];\n      }\n\n      for (j = 0; j < i; j++) {\n        f = d[j];\n        g = e[j];\n        for (k = j; k <= i - 1; k++) {\n          V.set(k, j, V.get(k, j) - (f * e[k] + g * d[k]));\n        }\n        d[j] = V.get(i - 1, j);\n        V.set(i, j, 0);\n      }\n    }\n    d[i] = h;\n  }\n\n  for (i = 0; i < n - 1; i++) {\n    V.set(n - 1, i, V.get(i, i));\n    V.set(i, i, 1);\n    h = d[i + 1];\n    if (h !== 0) {\n      for (k = 0; k <= i; k++) {\n        d[k] = V.get(k, i + 1) / h;\n      }\n\n      for (j = 0; j <= i; j++) {\n        g = 0;\n        for (k = 0; k <= i; k++) {\n          g += V.get(k, i + 1) * V.get(k, j);\n        }\n        for (k = 0; k <= i; k++) {\n          V.set(k, j, V.get(k, j) - g * d[k]);\n        }\n      }\n    }\n\n    for (k = 0; k <= i; k++) {\n      V.set(k, i + 1, 0);\n    }\n  }\n\n  for (j = 0; j < n; j++) {\n    d[j] = V.get(n - 1, j);\n    V.set(n - 1, j, 0);\n  }\n\n  V.set(n - 1, n - 1, 1);\n  e[0] = 0;\n}\n\nfunction tql2(n, e, d, V) {\n  let g, h, i, j, k, l, m, p, r, dl1, c, c2, c3, el1, s, s2;\n\n  for (i = 1; i < n; i++) {\n    e[i - 1] = e[i];\n  }\n\n  e[n - 1] = 0;\n\n  let f = 0;\n  let tst1 = 0;\n  let eps = Number.EPSILON;\n\n  for (l = 0; l < n; l++) {\n    tst1 = Math.max(tst1, Math.abs(d[l]) + Math.abs(e[l]));\n    m = l;\n    while (m < n) {\n      if (Math.abs(e[m]) <= eps * tst1) {\n        break;\n      }\n      m++;\n    }\n\n    if (m > l) {\n      do {\n\n        g = d[l];\n        p = (d[l + 1] - g) / (2 * e[l]);\n        r = hypotenuse(p, 1);\n        if (p < 0) {\n          r = -r;\n        }\n\n        d[l] = e[l] / (p + r);\n        d[l + 1] = e[l] * (p + r);\n        dl1 = d[l + 1];\n        h = g - d[l];\n        for (i = l + 2; i < n; i++) {\n          d[i] -= h;\n        }\n\n        f = f + h;\n\n        p = d[m];\n        c = 1;\n        c2 = c;\n        c3 = c;\n        el1 = e[l + 1];\n        s = 0;\n        s2 = 0;\n        for (i = m - 1; i >= l; i--) {\n          c3 = c2;\n          c2 = c;\n          s2 = s;\n          g = c * e[i];\n          h = c * p;\n          r = hypotenuse(p, e[i]);\n          e[i + 1] = s * r;\n          s = e[i] / r;\n          c = p / r;\n          p = c * d[i] - s * g;\n          d[i + 1] = h + s * (c * g + s * d[i]);\n\n          for (k = 0; k < n; k++) {\n            h = V.get(k, i + 1);\n            V.set(k, i + 1, s * V.get(k, i) + c * h);\n            V.set(k, i, c * V.get(k, i) - s * h);\n          }\n        }\n\n        p = (-s * s2 * c3 * el1 * e[l]) / dl1;\n        e[l] = s * p;\n        d[l] = c * p;\n      } while (Math.abs(e[l]) > eps * tst1);\n    }\n    d[l] = d[l] + f;\n    e[l] = 0;\n  }\n\n  for (i = 0; i < n - 1; i++) {\n    k = i;\n    p = d[i];\n    for (j = i + 1; j < n; j++) {\n      if (d[j] < p) {\n        k = j;\n        p = d[j];\n      }\n    }\n\n    if (k !== i) {\n      d[k] = d[i];\n      d[i] = p;\n      for (j = 0; j < n; j++) {\n        p = V.get(j, i);\n        V.set(j, i, V.get(j, k));\n        V.set(j, k, p);\n      }\n    }\n  }\n}\n\nfunction orthes(n, H, ort, V) {\n  let low = 0;\n  let high = n - 1;\n  let f, g, h, i, j, m;\n  let scale;\n\n  for (m = low + 1; m <= high - 1; m++) {\n    scale = 0;\n    for (i = m; i <= high; i++) {\n      scale = scale + Math.abs(H.get(i, m - 1));\n    }\n\n    if (scale !== 0) {\n      h = 0;\n      for (i = high; i >= m; i--) {\n        ort[i] = H.get(i, m - 1) / scale;\n        h += ort[i] * ort[i];\n      }\n\n      g = Math.sqrt(h);\n      if (ort[m] > 0) {\n        g = -g;\n      }\n\n      h = h - ort[m] * g;\n      ort[m] = ort[m] - g;\n\n      for (j = m; j < n; j++) {\n        f = 0;\n        for (i = high; i >= m; i--) {\n          f += ort[i] * H.get(i, j);\n        }\n\n        f = f / h;\n        for (i = m; i <= high; i++) {\n          H.set(i, j, H.get(i, j) - f * ort[i]);\n        }\n      }\n\n      for (i = 0; i <= high; i++) {\n        f = 0;\n        for (j = high; j >= m; j--) {\n          f += ort[j] * H.get(i, j);\n        }\n\n        f = f / h;\n        for (j = m; j <= high; j++) {\n          H.set(i, j, H.get(i, j) - f * ort[j]);\n        }\n      }\n\n      ort[m] = scale * ort[m];\n      H.set(m, m - 1, scale * g);\n    }\n  }\n\n  for (i = 0; i < n; i++) {\n    for (j = 0; j < n; j++) {\n      V.set(i, j, i === j ? 1 : 0);\n    }\n  }\n\n  for (m = high - 1; m >= low + 1; m--) {\n    if (H.get(m, m - 1) !== 0) {\n      for (i = m + 1; i <= high; i++) {\n        ort[i] = H.get(i, m - 1);\n      }\n\n      for (j = m; j <= high; j++) {\n        g = 0;\n        for (i = m; i <= high; i++) {\n          g += ort[i] * V.get(i, j);\n        }\n\n        g = g / ort[m] / H.get(m, m - 1);\n        for (i = m; i <= high; i++) {\n          V.set(i, j, V.get(i, j) + g * ort[i]);\n        }\n      }\n    }\n  }\n}\n\nfunction hqr2(nn, e, d, V, H) {\n  let n = nn - 1;\n  let low = 0;\n  let high = nn - 1;\n  let eps = Number.EPSILON;\n  let exshift = 0;\n  let norm = 0;\n  let p = 0;\n  let q = 0;\n  let r = 0;\n  let s = 0;\n  let z = 0;\n  let iter = 0;\n  let i, j, k, l, m, t, w, x, y;\n  let ra, sa, vr, vi;\n  let notlast, cdivres;\n\n  for (i = 0; i < nn; i++) {\n    if (i < low || i > high) {\n      d[i] = H.get(i, i);\n      e[i] = 0;\n    }\n\n    for (j = Math.max(i - 1, 0); j < nn; j++) {\n      norm = norm + Math.abs(H.get(i, j));\n    }\n  }\n\n  while (n >= low) {\n    l = n;\n    while (l > low) {\n      s = Math.abs(H.get(l - 1, l - 1)) + Math.abs(H.get(l, l));\n      if (s === 0) {\n        s = norm;\n      }\n      if (Math.abs(H.get(l, l - 1)) < eps * s) {\n        break;\n      }\n      l--;\n    }\n\n    if (l === n) {\n      H.set(n, n, H.get(n, n) + exshift);\n      d[n] = H.get(n, n);\n      e[n] = 0;\n      n--;\n      iter = 0;\n    } else if (l === n - 1) {\n      w = H.get(n, n - 1) * H.get(n - 1, n);\n      p = (H.get(n - 1, n - 1) - H.get(n, n)) / 2;\n      q = p * p + w;\n      z = Math.sqrt(Math.abs(q));\n      H.set(n, n, H.get(n, n) + exshift);\n      H.set(n - 1, n - 1, H.get(n - 1, n - 1) + exshift);\n      x = H.get(n, n);\n\n      if (q >= 0) {\n        z = p >= 0 ? p + z : p - z;\n        d[n - 1] = x + z;\n        d[n] = d[n - 1];\n        if (z !== 0) {\n          d[n] = x - w / z;\n        }\n        e[n - 1] = 0;\n        e[n] = 0;\n        x = H.get(n, n - 1);\n        s = Math.abs(x) + Math.abs(z);\n        p = x / s;\n        q = z / s;\n        r = Math.sqrt(p * p + q * q);\n        p = p / r;\n        q = q / r;\n\n        for (j = n - 1; j < nn; j++) {\n          z = H.get(n - 1, j);\n          H.set(n - 1, j, q * z + p * H.get(n, j));\n          H.set(n, j, q * H.get(n, j) - p * z);\n        }\n\n        for (i = 0; i <= n; i++) {\n          z = H.get(i, n - 1);\n          H.set(i, n - 1, q * z + p * H.get(i, n));\n          H.set(i, n, q * H.get(i, n) - p * z);\n        }\n\n        for (i = low; i <= high; i++) {\n          z = V.get(i, n - 1);\n          V.set(i, n - 1, q * z + p * V.get(i, n));\n          V.set(i, n, q * V.get(i, n) - p * z);\n        }\n      } else {\n        d[n - 1] = x + p;\n        d[n] = x + p;\n        e[n - 1] = z;\n        e[n] = -z;\n      }\n\n      n = n - 2;\n      iter = 0;\n    } else {\n      x = H.get(n, n);\n      y = 0;\n      w = 0;\n      if (l < n) {\n        y = H.get(n - 1, n - 1);\n        w = H.get(n, n - 1) * H.get(n - 1, n);\n      }\n\n      if (iter === 10) {\n        exshift += x;\n        for (i = low; i <= n; i++) {\n          H.set(i, i, H.get(i, i) - x);\n        }\n        s = Math.abs(H.get(n, n - 1)) + Math.abs(H.get(n - 1, n - 2));\n        // eslint-disable-next-line no-multi-assign\n        x = y = 0.75 * s;\n        w = -0.4375 * s * s;\n      }\n\n      if (iter === 30) {\n        s = (y - x) / 2;\n        s = s * s + w;\n        if (s > 0) {\n          s = Math.sqrt(s);\n          if (y < x) {\n            s = -s;\n          }\n          s = x - w / ((y - x) / 2 + s);\n          for (i = low; i <= n; i++) {\n            H.set(i, i, H.get(i, i) - s);\n          }\n          exshift += s;\n          // eslint-disable-next-line no-multi-assign\n          x = y = w = 0.964;\n        }\n      }\n\n      iter = iter + 1;\n\n      m = n - 2;\n      while (m >= l) {\n        z = H.get(m, m);\n        r = x - z;\n        s = y - z;\n        p = (r * s - w) / H.get(m + 1, m) + H.get(m, m + 1);\n        q = H.get(m + 1, m + 1) - z - r - s;\n        r = H.get(m + 2, m + 1);\n        s = Math.abs(p) + Math.abs(q) + Math.abs(r);\n        p = p / s;\n        q = q / s;\n        r = r / s;\n        if (m === l) {\n          break;\n        }\n        if (\n          Math.abs(H.get(m, m - 1)) * (Math.abs(q) + Math.abs(r)) <\n          eps *\n            (Math.abs(p) *\n              (Math.abs(H.get(m - 1, m - 1)) +\n                Math.abs(z) +\n                Math.abs(H.get(m + 1, m + 1))))\n        ) {\n          break;\n        }\n        m--;\n      }\n\n      for (i = m + 2; i <= n; i++) {\n        H.set(i, i - 2, 0);\n        if (i > m + 2) {\n          H.set(i, i - 3, 0);\n        }\n      }\n\n      for (k = m; k <= n - 1; k++) {\n        notlast = k !== n - 1;\n        if (k !== m) {\n          p = H.get(k, k - 1);\n          q = H.get(k + 1, k - 1);\n          r = notlast ? H.get(k + 2, k - 1) : 0;\n          x = Math.abs(p) + Math.abs(q) + Math.abs(r);\n          if (x !== 0) {\n            p = p / x;\n            q = q / x;\n            r = r / x;\n          }\n        }\n\n        if (x === 0) {\n          break;\n        }\n\n        s = Math.sqrt(p * p + q * q + r * r);\n        if (p < 0) {\n          s = -s;\n        }\n\n        if (s !== 0) {\n          if (k !== m) {\n            H.set(k, k - 1, -s * x);\n          } else if (l !== m) {\n            H.set(k, k - 1, -H.get(k, k - 1));\n          }\n\n          p = p + s;\n          x = p / s;\n          y = q / s;\n          z = r / s;\n          q = q / p;\n          r = r / p;\n\n          for (j = k; j < nn; j++) {\n            p = H.get(k, j) + q * H.get(k + 1, j);\n            if (notlast) {\n              p = p + r * H.get(k + 2, j);\n              H.set(k + 2, j, H.get(k + 2, j) - p * z);\n            }\n\n            H.set(k, j, H.get(k, j) - p * x);\n            H.set(k + 1, j, H.get(k + 1, j) - p * y);\n          }\n\n          for (i = 0; i <= Math.min(n, k + 3); i++) {\n            p = x * H.get(i, k) + y * H.get(i, k + 1);\n            if (notlast) {\n              p = p + z * H.get(i, k + 2);\n              H.set(i, k + 2, H.get(i, k + 2) - p * r);\n            }\n\n            H.set(i, k, H.get(i, k) - p);\n            H.set(i, k + 1, H.get(i, k + 1) - p * q);\n          }\n\n          for (i = low; i <= high; i++) {\n            p = x * V.get(i, k) + y * V.get(i, k + 1);\n            if (notlast) {\n              p = p + z * V.get(i, k + 2);\n              V.set(i, k + 2, V.get(i, k + 2) - p * r);\n            }\n\n            V.set(i, k, V.get(i, k) - p);\n            V.set(i, k + 1, V.get(i, k + 1) - p * q);\n          }\n        }\n      }\n    }\n  }\n\n  if (norm === 0) {\n    return;\n  }\n\n  for (n = nn - 1; n >= 0; n--) {\n    p = d[n];\n    q = e[n];\n\n    if (q === 0) {\n      l = n;\n      H.set(n, n, 1);\n      for (i = n - 1; i >= 0; i--) {\n        w = H.get(i, i) - p;\n        r = 0;\n        for (j = l; j <= n; j++) {\n          r = r + H.get(i, j) * H.get(j, n);\n        }\n\n        if (e[i] < 0) {\n          z = w;\n          s = r;\n        } else {\n          l = i;\n          if (e[i] === 0) {\n            H.set(i, n, w !== 0 ? -r / w : -r / (eps * norm));\n          } else {\n            x = H.get(i, i + 1);\n            y = H.get(i + 1, i);\n            q = (d[i] - p) * (d[i] - p) + e[i] * e[i];\n            t = (x * s - z * r) / q;\n            H.set(i, n, t);\n            H.set(\n              i + 1,\n              n,\n              Math.abs(x) > Math.abs(z) ? (-r - w * t) / x : (-s - y * t) / z,\n            );\n          }\n\n          t = Math.abs(H.get(i, n));\n          if (eps * t * t > 1) {\n            for (j = i; j <= n; j++) {\n              H.set(j, n, H.get(j, n) / t);\n            }\n          }\n        }\n      }\n    } else if (q < 0) {\n      l = n - 1;\n\n      if (Math.abs(H.get(n, n - 1)) > Math.abs(H.get(n - 1, n))) {\n        H.set(n - 1, n - 1, q / H.get(n, n - 1));\n        H.set(n - 1, n, -(H.get(n, n) - p) / H.get(n, n - 1));\n      } else {\n        cdivres = cdiv(0, -H.get(n - 1, n), H.get(n - 1, n - 1) - p, q);\n        H.set(n - 1, n - 1, cdivres[0]);\n        H.set(n - 1, n, cdivres[1]);\n      }\n\n      H.set(n, n - 1, 0);\n      H.set(n, n, 1);\n      for (i = n - 2; i >= 0; i--) {\n        ra = 0;\n        sa = 0;\n        for (j = l; j <= n; j++) {\n          ra = ra + H.get(i, j) * H.get(j, n - 1);\n          sa = sa + H.get(i, j) * H.get(j, n);\n        }\n\n        w = H.get(i, i) - p;\n\n        if (e[i] < 0) {\n          z = w;\n          r = ra;\n          s = sa;\n        } else {\n          l = i;\n          if (e[i] === 0) {\n            cdivres = cdiv(-ra, -sa, w, q);\n            H.set(i, n - 1, cdivres[0]);\n            H.set(i, n, cdivres[1]);\n          } else {\n            x = H.get(i, i + 1);\n            y = H.get(i + 1, i);\n            vr = (d[i] - p) * (d[i] - p) + e[i] * e[i] - q * q;\n            vi = (d[i] - p) * 2 * q;\n            if (vr === 0 && vi === 0) {\n              vr =\n                eps *\n                norm *\n                (Math.abs(w) +\n                  Math.abs(q) +\n                  Math.abs(x) +\n                  Math.abs(y) +\n                  Math.abs(z));\n            }\n            cdivres = cdiv(\n              x * r - z * ra + q * sa,\n              x * s - z * sa - q * ra,\n              vr,\n              vi,\n            );\n            H.set(i, n - 1, cdivres[0]);\n            H.set(i, n, cdivres[1]);\n            if (Math.abs(x) > Math.abs(z) + Math.abs(q)) {\n              H.set(\n                i + 1,\n                n - 1,\n                (-ra - w * H.get(i, n - 1) + q * H.get(i, n)) / x,\n              );\n              H.set(\n                i + 1,\n                n,\n                (-sa - w * H.get(i, n) - q * H.get(i, n - 1)) / x,\n              );\n            } else {\n              cdivres = cdiv(\n                -r - y * H.get(i, n - 1),\n                -s - y * H.get(i, n),\n                z,\n                q,\n              );\n              H.set(i + 1, n - 1, cdivres[0]);\n              H.set(i + 1, n, cdivres[1]);\n            }\n          }\n\n          t = Math.max(Math.abs(H.get(i, n - 1)), Math.abs(H.get(i, n)));\n          if (eps * t * t > 1) {\n            for (j = i; j <= n; j++) {\n              H.set(j, n - 1, H.get(j, n - 1) / t);\n              H.set(j, n, H.get(j, n) / t);\n            }\n          }\n        }\n      }\n    }\n  }\n\n  for (i = 0; i < nn; i++) {\n    if (i < low || i > high) {\n      for (j = i; j < nn; j++) {\n        V.set(i, j, H.get(i, j));\n      }\n    }\n  }\n\n  for (j = nn - 1; j >= low; j--) {\n    for (i = low; i <= high; i++) {\n      z = 0;\n      for (k = low; k <= Math.min(j, high); k++) {\n        z = z + V.get(i, k) * H.get(k, j);\n      }\n      V.set(i, j, z);\n    }\n  }\n}\n\nfunction cdiv(xr, xi, yr, yi) {\n  let r, d;\n  if (Math.abs(yr) > Math.abs(yi)) {\n    r = yi / yr;\n    d = yr + r * yi;\n    return [(xr + r * xi) / d, (xi - r * xr) / d];\n  } else {\n    r = yr / yi;\n    d = yi + r * yr;\n    return [(r * xr + xi) / d, (r * xi - xr) / d];\n  }\n}\n\nclass CholeskyDecomposition {\n  constructor(value) {\n    value = WrapperMatrix2D.checkMatrix(value);\n    if (!value.isSymmetric()) {\n      throw new Error('Matrix is not symmetric');\n    }\n\n    let a = value;\n    let dimension = a.rows;\n    let l = new Matrix(dimension, dimension);\n    let positiveDefinite = true;\n    let i, j, k;\n\n    for (j = 0; j < dimension; j++) {\n      let d = 0;\n      for (k = 0; k < j; k++) {\n        let s = 0;\n        for (i = 0; i < k; i++) {\n          s += l.get(k, i) * l.get(j, i);\n        }\n        s = (a.get(j, k) - s) / l.get(k, k);\n        l.set(j, k, s);\n        d = d + s * s;\n      }\n\n      d = a.get(j, j) - d;\n\n      positiveDefinite &&= d > 0;\n      l.set(j, j, Math.sqrt(Math.max(d, 0)));\n      for (k = j + 1; k < dimension; k++) {\n        l.set(j, k, 0);\n      }\n    }\n\n    this.L = l;\n    this.positiveDefinite = positiveDefinite;\n  }\n\n  isPositiveDefinite() {\n    return this.positiveDefinite;\n  }\n\n  solve(value) {\n    value = WrapperMatrix2D.checkMatrix(value);\n\n    let l = this.L;\n    let dimension = l.rows;\n\n    if (value.rows !== dimension) {\n      throw new Error('Matrix dimensions do not match');\n    }\n    if (this.isPositiveDefinite() === false) {\n      throw new Error('Matrix is not positive definite');\n    }\n\n    let count = value.columns;\n    let B = value.clone();\n    let i, j, k;\n\n    for (k = 0; k < dimension; k++) {\n      for (j = 0; j < count; j++) {\n        for (i = 0; i < k; i++) {\n          B.set(k, j, B.get(k, j) - B.get(i, j) * l.get(k, i));\n        }\n        B.set(k, j, B.get(k, j) / l.get(k, k));\n      }\n    }\n\n    for (k = dimension - 1; k >= 0; k--) {\n      for (j = 0; j < count; j++) {\n        for (i = k + 1; i < dimension; i++) {\n          B.set(k, j, B.get(k, j) - B.get(i, j) * l.get(i, k));\n        }\n        B.set(k, j, B.get(k, j) / l.get(k, k));\n      }\n    }\n\n    return B;\n  }\n\n  get lowerTriangularMatrix() {\n    return this.L;\n  }\n}\n\nclass nipals {\n  constructor(X, options = {}) {\n    X = WrapperMatrix2D.checkMatrix(X);\n    let { Y } = options;\n    const {\n      scaleScores = false,\n      maxIterations = 1000,\n      terminationCriteria = 1e-10,\n    } = options;\n\n    let u;\n    if (Y) {\n      if (isAnyArray(Y) && typeof Y[0] === 'number') {\n        Y = Matrix.columnVector(Y);\n      } else {\n        Y = WrapperMatrix2D.checkMatrix(Y);\n      }\n      if (Y.rows !== X.rows) {\n        throw new Error('Y should have the same number of rows as X');\n      }\n      u = Y.getColumnVector(0);\n    } else {\n      u = X.getColumnVector(0);\n    }\n\n    let diff = 1;\n    let t, q, w, tOld;\n\n    for (\n      let counter = 0;\n      counter < maxIterations && diff > terminationCriteria;\n      counter++\n    ) {\n      w = X.transpose().mmul(u).div(u.transpose().mmul(u).get(0, 0));\n      w = w.div(w.norm());\n\n      t = X.mmul(w).div(w.transpose().mmul(w).get(0, 0));\n\n      if (counter > 0) {\n        diff = t.clone().sub(tOld).pow(2).sum();\n      }\n      tOld = t.clone();\n\n      if (Y) {\n        q = Y.transpose().mmul(t).div(t.transpose().mmul(t).get(0, 0));\n        q = q.div(q.norm());\n\n        u = Y.mmul(q).div(q.transpose().mmul(q).get(0, 0));\n      } else {\n        u = t;\n      }\n    }\n\n    if (Y) {\n      let p = X.transpose().mmul(t).div(t.transpose().mmul(t).get(0, 0));\n      p = p.div(p.norm());\n      let xResidual = X.clone().sub(t.clone().mmul(p.transpose()));\n      let residual = u.transpose().mmul(t).div(t.transpose().mmul(t).get(0, 0));\n      let yResidual = Y.clone().sub(\n        t.clone().mulS(residual.get(0, 0)).mmul(q.transpose()),\n      );\n\n      this.t = t;\n      this.p = p.transpose();\n      this.w = w.transpose();\n      this.q = q;\n      this.u = u;\n      this.s = t.transpose().mmul(t);\n      this.xResidual = xResidual;\n      this.yResidual = yResidual;\n      this.betas = residual;\n    } else {\n      this.w = w.transpose();\n      this.s = t.transpose().mmul(t).sqrt();\n      if (scaleScores) {\n        this.t = t.clone().div(this.s.get(0, 0));\n      } else {\n        this.t = t;\n      }\n      this.xResidual = X.sub(t.mmul(w.transpose()));\n    }\n  }\n}\n\nexports.AbstractMatrix = AbstractMatrix;\nexports.CHO = CholeskyDecomposition;\nexports.CholeskyDecomposition = CholeskyDecomposition;\nexports.DistanceMatrix = DistanceMatrix;\nexports.EVD = EigenvalueDecomposition;\nexports.EigenvalueDecomposition = EigenvalueDecomposition;\nexports.LU = LuDecomposition;\nexports.LuDecomposition = LuDecomposition;\nexports.Matrix = Matrix;\nexports.MatrixColumnSelectionView = MatrixColumnSelectionView;\nexports.MatrixColumnView = MatrixColumnView;\nexports.MatrixFlipColumnView = MatrixFlipColumnView;\nexports.MatrixFlipRowView = MatrixFlipRowView;\nexports.MatrixRowSelectionView = MatrixRowSelectionView;\nexports.MatrixRowView = MatrixRowView;\nexports.MatrixSelectionView = MatrixSelectionView;\nexports.MatrixSubView = MatrixSubView;\nexports.MatrixTransposeView = MatrixTransposeView;\nexports.NIPALS = nipals;\nexports.Nipals = nipals;\nexports.QR = QrDecomposition;\nexports.QrDecomposition = QrDecomposition;\nexports.SVD = SingularValueDecomposition;\nexports.SingularValueDecomposition = SingularValueDecomposition;\nexports.SymmetricMatrix = SymmetricMatrix;\nexports.WrapperMatrix1D = WrapperMatrix1D;\nexports.WrapperMatrix2D = WrapperMatrix2D;\nexports.correlation = correlation;\nexports.covariance = covariance;\nexports.default = Matrix;\nexports.determinant = determinant;\nexports.inverse = inverse;\nexports.linearDependencies = linearDependencies;\nexports.pseudoInverse = pseudoInverse;\nexports.solve = solve;\nexports.wrap = wrap;\n//# sourceMappingURL=matrix.js.map\n","import * as matrix from './matrix.js';\n\nexport const AbstractMatrix = matrix.AbstractMatrix;\nexport const CHO = matrix.CHO;\nexport const CholeskyDecomposition = matrix.CholeskyDecomposition;\nexport const DistanceMatrix = matrix.DistanceMatrix;\nexport const EVD = matrix.EVD;\nexport const EigenvalueDecomposition = matrix.EigenvalueDecomposition;\nexport const LU = matrix.LU;\nexport const LuDecomposition = matrix.LuDecomposition;\nexport const Matrix = matrix.Matrix;\nexport const MatrixColumnSelectionView = matrix.MatrixColumnSelectionView;\nexport const MatrixColumnView = matrix.MatrixColumnView;\nexport const MatrixFlipColumnView = matrix.MatrixFlipColumnView;\nexport const MatrixFlipRowView = matrix.MatrixFlipRowView;\nexport const MatrixRowSelectionView = matrix.MatrixRowSelectionView;\nexport const MatrixRowView = matrix.MatrixRowView;\nexport const MatrixSelectionView = matrix.MatrixSelectionView;\nexport const MatrixSubView = matrix.MatrixSubView;\nexport const MatrixTransposeView = matrix.MatrixTransposeView;\nexport const NIPALS = matrix.NIPALS;\nexport const Nipals = matrix.Nipals;\nexport const QR = matrix.QR;\nexport const QrDecomposition = matrix.QrDecomposition;\nexport const SVD = matrix.SVD;\nexport const SingularValueDecomposition = matrix.SingularValueDecomposition;\nexport const SymmetricMatrix = matrix.SymmetricMatrix;\nexport const WrapperMatrix1D = matrix.WrapperMatrix1D;\nexport const WrapperMatrix2D = matrix.WrapperMatrix2D;\nexport const correlation = matrix.correlation;\nexport const covariance = matrix.covariance;\nexport default matrix.default.Matrix ? matrix.default.Matrix : matrix.Matrix;\nexport const determinant = matrix.determinant;\nexport const inverse = matrix.inverse;\nexport const linearDependencies = matrix.linearDependencies;\nexport const pseudoInverse = matrix.pseudoInverse;\nexport const solve = matrix.solve;\nexport const wrap = matrix.wrap;\n","import { xCheck } from \"./xCheck.js\";\nimport { xGetFromToIndex } from \"./xGetFromToIndex.js\";\n/**\n * Computes the maximal value of an array of values\n * @param array - array of numbers\n * @param options - options\n */\nexport function xMaxValue(array, options = {}) {\n    xCheck(array);\n    const { fromIndex, toIndex } = xGetFromToIndex(array, options);\n    let maxValue = array[fromIndex];\n    for (let i = fromIndex + 1; i <= toIndex; i++) {\n        if (array[i] > maxValue) {\n            maxValue = array[i];\n        }\n    }\n    return maxValue;\n}\n//# sourceMappingURL=xMaxValue.js.map","import { xCheck } from \"./xCheck.js\";\nimport { xGetFromToIndex } from \"./xGetFromToIndex.js\";\n/**\n * Computes the minimal value of an array of values.\n * @param array - array of numbers\n * @param options - options\n */\nexport function xMinValue(array, options = {}) {\n    xCheck(array);\n    const { fromIndex, toIndex } = xGetFromToIndex(array, options);\n    let minValue = array[fromIndex];\n    for (let i = fromIndex + 1; i <= toIndex; i++) {\n        if (array[i] < minValue) {\n            minValue = array[i];\n        }\n    }\n    return minValue;\n}\n//# sourceMappingURL=xMinValue.js.map","/**\n * Check if the values are separated always by the same difference\n * @param array - Monotone growing array of number\n * @param options\n */\nexport function xIsEquallySpaced(array, options = {}) {\n    if (array.length < 3)\n        return true;\n    const { tolerance = 0.05 } = options;\n    let maxDx = 0;\n    let minDx = Number.MAX_SAFE_INTEGER;\n    for (let i = 0; i < array.length - 1; ++i) {\n        const absoluteDifference = array[i + 1] - array[i];\n        if (absoluteDifference < minDx) {\n            minDx = absoluteDifference;\n        }\n        if (absoluteDifference > maxDx) {\n            maxDx = absoluteDifference;\n        }\n    }\n    return (maxDx - minDx) / maxDx < tolerance;\n}\n//# sourceMappingURL=xIsEquallySpaced.js.map","/**\n * Returns true if x is monotonic.\n * @param array - array of numbers.\n * @returns 1 if monotonic increasing, -1 if monotonic decreasing, 0 if not monotonic.\n */\nexport function xIsMonotonic(array) {\n    if (array.length <= 2) {\n        return 1;\n    }\n    if (array[0] === array[1]) {\n        // maybe a constant series\n        for (let i = 1; i < array.length - 1; i++) {\n            if (array[i] !== array[i + 1])\n                return 0;\n        }\n        return 1;\n    }\n    if (array[0] < array.at(-1)) {\n        for (let i = 0; i < array.length - 1; i++) {\n            if (array[i] >= array[i + 1])\n                return 0;\n        }\n        return 1;\n    }\n    else {\n        for (let i = 0; i < array.length - 1; i++) {\n            if (array[i] <= array[i + 1])\n                return 0;\n        }\n        return -1;\n    }\n}\n//# sourceMappingURL=xIsMonotonic.js.map","import { xCheck } from \"./xCheck.js\";\nimport { xGetFromToIndex } from \"./xGetFromToIndex.js\";\n/**\n * Computes the maximal value of an array of values\n * @param array - array of numbers\n * @param options - options\n */\nexport function xMaxAbsoluteValue(array, options = {}) {\n    xCheck(array);\n    const { fromIndex, toIndex } = xGetFromToIndex(array, options);\n    let maxValue = array[fromIndex];\n    for (let i = fromIndex + 1; i <= toIndex; i++) {\n        if (array[i] >= 0) {\n            if (array[i] > maxValue) {\n                maxValue = array[i];\n            }\n        }\n        else if (-array[i] > maxValue) {\n            maxValue = -array[i];\n        }\n    }\n    return maxValue;\n}\n//# sourceMappingURL=xMaxAbsoluteValue.js.map","import { xMedian } from \"./xMedian.js\";\n/**\n * This function calculates the median absolute deviation (MAD).\n * https://en.wikipedia.org/wiki/Median_absolute_deviation\n * @param array\n */\nexport function xMedianAbsoluteDeviation(array) {\n    const median = xMedian(array);\n    const averageDeviations = new Float64Array(array.length);\n    for (let i = 0; i < array.length; i++) {\n        averageDeviations[i] = Math.abs(array[i] - median);\n    }\n    return {\n        median,\n        mad: xMedian(averageDeviations),\n    };\n}\n//# sourceMappingURL=xMedianAbsoluteDeviation.js.map","import { xCheck } from \"./xCheck.js\";\n/**\n * Return min and max values of an array.\n * @param array - array of number\n * @returns - Object with 2 properties, min and max.\n */\nexport function xMinMaxValues(array) {\n    xCheck(array);\n    let min = array[0];\n    let max = array[0];\n    for (const value of array) {\n        if (value < min)\n            min = value;\n        if (value > max)\n            max = value;\n    }\n    return { min, max };\n}\n//# sourceMappingURL=xMinMaxValues.js.map","import { xMedianAbsoluteDeviation } from \"./xMedianAbsoluteDeviation.js\";\n/**\n * Determine noise level using MAD https://en.wikipedia.org/wiki/Median_absolute_deviation\n * Constant to convert mad to sd calculated using https://www.wolframalpha.com/input?i=sqrt%282%29+inverse+erf%280.5%29\n * This assumes a gaussian distribution of the noise\n * @param array\n * @returns noise level corresponding to one standard deviation\n */\nexport function xNoiseStandardDeviation(array) {\n    const { mad, median } = xMedianAbsoluteDeviation(array);\n    return { sd: mad / 0.6744897501960817, mad, median };\n}\n//# sourceMappingURL=xNoiseStandardDeviation.js.map","/**\n * This function calculate the norm of a vector.\n * @example xNorm([3, 4]) -> 5\n * @param array - array\n * @returns - calculated norm\n */\nexport function xNorm(array) {\n    let result = 0;\n    for (const element of array) {\n        result += element ** 2;\n    }\n    return Math.sqrt(result);\n}\n//# sourceMappingURL=xNorm.js.map","/**\n * Compute the `[left, right]` intervals around each peak by locating\n * consecutive extrema (minima / maxima) of the first derivative.\n * @param y - Spectrum y values.\n * @param x - Spectrum x values.\n * @param dY - First derivative of `y`.\n * @param dX - Sign of the x step (positive for increasing x, negative otherwise).\n * @returns `intervalL` / `intervalR` arrays defining each peak's inflection-point bounds.\n */\nexport function getMinMaxIntervalsDy(y, x, dY, dX) {\n    let lastMax = null;\n    let lastMin = null;\n    const intervalL = [];\n    const intervalR = [];\n    for (let i = 1; i < y.length - 1; ++i) {\n        if ((dY[i] < dY[i - 1] && dY[i] <= dY[i + 1]) ||\n            (dY[i] <= dY[i - 1] && dY[i] < dY[i + 1])) {\n            lastMin = {\n                x: x[i],\n                index: i,\n            };\n            if (dX > 0 && lastMax !== null) {\n                intervalL.push(lastMax);\n                intervalR.push(lastMin);\n            }\n        }\n        // Maximum in first derivative\n        if ((dY[i] >= dY[i - 1] && dY[i] > dY[i + 1]) ||\n            (dY[i] > dY[i - 1] && dY[i] >= dY[i + 1])) {\n            lastMax = {\n                x: x[i],\n                index: i,\n            };\n            if (dX < 0 && lastMin !== null) {\n                intervalL.push(lastMax);\n                intervalR.push(lastMin);\n            }\n        }\n    }\n    return { intervalL, intervalR };\n}\n//# sourceMappingURL=getMinMaxIntervals.js.map","/**\n * Find the `minData` index closest to the center of one interval,\n * above the intensity threshold and bounded by the half-width.\n * @param options - Interval, candidate indices and spectrum data.\n * @returns The picked candidate (`possible`) and the last visited index (`lastIndex`).\n */\nexport function tryMatchOneIntervalWithMinData(options) {\n    const { x, lastK, minData, yThreshold, intervalWidth, intervalCenter, yData, } = options;\n    let minDistance = Number.POSITIVE_INFINITY;\n    let possible = -1;\n    let newLastIndex = lastK;\n    for (let k = newLastIndex + 1; k < minData.length; k++) {\n        const centerIndex = minData[k];\n        if (yData[centerIndex] <= yThreshold) {\n            continue;\n        }\n        const deltaX = x[centerIndex];\n        const currentDistance = Math.abs(deltaX - intervalCenter);\n        if (currentDistance < intervalWidth) {\n            if (currentDistance < minDistance) {\n                possible = k;\n            }\n            newLastIndex = k;\n        }\n        if (currentDistance >= minDistance)\n            break;\n        minDistance = currentDistance;\n    }\n    return { lastIndex: newLastIndex, possible };\n}\n//# sourceMappingURL=tryMatchOneIntervalWithMinData.js.map","import { getMinMaxIntervalsDy } from \"./getMinMaxIntervals.js\";\nimport { tryMatchOneIntervalWithMinData } from \"./tryMatchOneIntervalWithMinData.js\";\n/**\n * Peak detection that combines first-derivative zero-crossings and\n * second-derivative local minima to find peaks inside each interval.\n * @param input - Spectrum values together with its first and second derivatives.\n * @returns The detected peaks.\n */\nexport function autoAlgorithm(input) {\n    const { x, y, yData, dY, ddY, dX, yThreshold } = input;\n    const minddY = [];\n    const crossDy = [];\n    const { intervalL, intervalR } = getMinMaxIntervalsDy(y, x, dY, dX);\n    for (let i = 1; i < y.length - 1; ++i) {\n        if ((dY[i] < 0 && dY[i + 1] > 0) || (dY[i] > 0 && dY[i + 1] < 0)) {\n            // push the index of the element closer to zero\n            crossDy.push(Math.abs(dY[i]) < Math.abs(dY[i + 1]) ? i : i + 1);\n        }\n        // Handle exact zero\n        if (dY[i] === 0 &&\n            dY[i] < Math.abs(dY[i + 1]) &&\n            dY[i] < Math.abs(dY[i - 1])) {\n            crossDy.push(i);\n        }\n        // Minimum in second derivative\n        if (ddY[i] < ddY[i - 1] && ddY[i] < ddY[i + 1]) {\n            minddY.push(i);\n        }\n    }\n    const peaks = [];\n    let lastK = -1;\n    let lastJ = -1;\n    for (let i = 0; i < intervalL.length; i++) {\n        const intervalWidth = (intervalR[i].x - intervalL[i].x) / 2;\n        const intervalCenter = (intervalR[i].x + intervalL[i].x) / 2;\n        let yIndex = -1;\n        let match = tryMatchOneIntervalWithMinData({\n            x,\n            yData,\n            lastK,\n            yThreshold,\n            intervalWidth,\n            intervalCenter,\n            minData: crossDy,\n        });\n        lastK = match.lastIndex;\n        if (match.possible !== -1) {\n            yIndex = crossDy[match.possible];\n        }\n        else {\n            match = tryMatchOneIntervalWithMinData({\n                x,\n                yData,\n                yThreshold,\n                lastK: lastJ,\n                intervalWidth,\n                intervalCenter,\n                minData: minddY,\n            });\n            if (match.possible !== -1) {\n                yIndex = minddY[match.possible];\n            }\n            lastJ = match.lastIndex;\n        }\n        if (yIndex !== -1) {\n            const width = Math.abs(intervalR[i].x - intervalL[i].x);\n            peaks.push({\n                id: crypto.randomUUID(),\n                x: x[yIndex],\n                y: y[yIndex],\n                width,\n                index: yIndex,\n                ddY: ddY[yIndex],\n                inflectionPoints: {\n                    from: intervalL[i],\n                    to: intervalR[i],\n                },\n            });\n        }\n    }\n    return peaks;\n}\n//# sourceMappingURL=autoAlgorithm.js.map","import { tryMatchOneIntervalWithMinData } from \"./tryMatchOneIntervalWithMinData.js\";\n/**\n * Build the list of detected peaks by matching each `[left, right]` interval\n * with the best candidate index from `minData`.\n * @param options - Intervals, candidate indices and spectrum data.\n * @returns The detected peaks.\n */\nexport function getPeakFromIntervals(options) {\n    let lastK = -1;\n    const peaks = [];\n    const { x, ddY, yData, yThreshold, intervalR, intervalL, minData } = options;\n    for (let i = 0; i < intervalL.length; i++) {\n        const intervalWidth = (intervalR[i].x - intervalL[i].x) / 2;\n        const intervalCenter = (intervalR[i].x + intervalL[i].x) / 2;\n        const { possible, lastIndex } = tryMatchOneIntervalWithMinData({\n            x,\n            lastK,\n            minData,\n            yThreshold,\n            intervalWidth,\n            intervalCenter,\n            yData,\n        });\n        if (possible !== -1) {\n            const centerIndex = minData[possible];\n            const width = Math.abs(intervalR[i].x - intervalL[i].x);\n            peaks.push({\n                id: crypto.randomUUID(),\n                x: x[centerIndex],\n                y: yData[centerIndex],\n                width,\n                index: centerIndex,\n                ddY: ddY[centerIndex],\n                inflectionPoints: {\n                    from: intervalL[i],\n                    to: intervalR[i],\n                },\n            });\n        }\n        lastK = lastIndex;\n    }\n    return peaks;\n}\n//# sourceMappingURL=getPeaksFromIntervals.js.map","/**\n * Finds the indices where the first derivative crosses zero (sign change),\n * which are potential peak positions. This function does not detect zero-crossings\n * in regions with consecutive zero values in the derivative (flat regions).\n * @param input - Object containing the y values and their first derivative (dY).\n * @returns Array of indices where the first derivative crosses zero (excluding consecutive zeros).\n */\nexport function xGetCrossZeroPoints(input) {\n    const { y, dY } = input;\n    const crossDy = [];\n    for (let i = 1; i < y.length - 1; ++i) {\n        if (isLessAndGreaterThanZero(dY[i], dY[i + 1])) {\n            // push the index of the element closer to zero\n            crossDy.push(Math.abs(dY[i]) < Math.abs(dY[i + 1]) ? i : i + 1);\n        }\n        else if (\n        // Handle exact zero\n        dY[i] === 0 &&\n            isLessAndGreaterThanZero(dY[i - 1], dY[i + 1])) {\n            crossDy.push(i);\n        }\n    }\n    return crossDy;\n}\nfunction isLessAndGreaterThanZero(back, next) {\n    return (back < 0 && next > 0) || (back > 0 && next < 0);\n}\n//# sourceMappingURL=xGetCrossZeroPoints.js.map","import { getMinMaxIntervalsDy } from \"./getMinMaxIntervals.js\";\nimport { getPeakFromIntervals } from \"./getPeaksFromIntervals.js\";\nimport { xGetCrossZeroPoints } from \"./xGetCrossZeroPoints.js\";\n/**\n * Detect peaks using zero-crossings of the first derivative.\n * @param input - Spectrum values and its first/second derivatives.\n * @returns The detected peaks.\n */\nexport function firstDerivative(input) {\n    const { y, x, dY, dX, yData, yThreshold, ddY } = input;\n    const crossDy = xGetCrossZeroPoints(input);\n    const { intervalL, intervalR } = getMinMaxIntervalsDy(y, x, dY, dX);\n    return getPeakFromIntervals({\n        minData: crossDy,\n        intervalL,\n        intervalR,\n        x,\n        yData,\n        yThreshold,\n        ddY,\n    });\n}\n//# sourceMappingURL=firstDerivative.js.map","import { getMinMaxIntervalsDy } from \"./getMinMaxIntervals.js\";\nimport { getPeakFromIntervals } from \"./getPeaksFromIntervals.js\";\n/**\n * Detect peaks using local minima of the second derivative (inflection points).\n * @param input - Spectrum values and its first/second derivatives.\n * @returns The detected peaks.\n */\nexport function secondDerivative(input) {\n    const { x, y, yData, dY, ddY, dX, yThreshold } = input;\n    const minddY = [];\n    const { intervalL, intervalR } = getMinMaxIntervalsDy(y, x, dY, dX);\n    // By the intermediate value theorem We cannot find 2 consecutive maximum or minimum\n    for (let i = 1; i < y.length - 1; ++i) {\n        // Minimum in second derivative\n        if (ddY[i] < ddY[i - 1] && ddY[i] < ddY[i + 1]) {\n            minddY.push(i);\n        }\n    }\n    return getPeakFromIntervals({\n        minData: minddY,\n        intervalL,\n        intervalR,\n        x,\n        yData,\n        yThreshold,\n        ddY,\n    });\n}\n//# sourceMappingURL=secondDerivative.js.map","/**\n * Refine the `x` and `y` coordinates of each peak by running a quadratic\n * interpolation over the peak and its 3 closest neighbors.\n * The correction is performed in place.\n * @param data - Object with `x` and `y` arrays.\n * @param peaks - Peaks to refine (mutated in place).\n */\nexport function optimizeTop(data, peaks) {\n    const { x, y } = data;\n    for (const peak of peaks) {\n        let currentIndex = peak.index;\n        // The detected peak could be moved 1 or 2 units to left or right.\n        if (y[currentIndex - 1] >= y[currentIndex - 2] &&\n            y[currentIndex - 1] >= y[currentIndex]) {\n            currentIndex--;\n        }\n        else if (y[currentIndex + 1] >= y[currentIndex] &&\n            y[currentIndex + 1] >= y[currentIndex + 2]) {\n            currentIndex++;\n        }\n        else if (y[currentIndex - 2] >= y[currentIndex - 3] &&\n            y[currentIndex - 2] >= y[currentIndex - 1]) {\n            currentIndex -= 2;\n        }\n        else if (y[currentIndex + 2] >= y[currentIndex + 1] &&\n            y[currentIndex + 2] >= y[currentIndex + 3]) {\n            currentIndex += 2;\n        }\n        // Quadratic interpolation on log-intensities to refine the peak top.\n        if (y[currentIndex - 1] > 0 &&\n            y[currentIndex + 1] > 0 &&\n            y[currentIndex] >= y[currentIndex - 1] &&\n            y[currentIndex] >= y[currentIndex + 1] &&\n            (y[currentIndex] !== y[currentIndex - 1] ||\n                y[currentIndex] !== y[currentIndex + 1])) {\n            const alpha = Math.log10(y[currentIndex - 1]);\n            const beta = Math.log10(y[currentIndex]);\n            const gamma = Math.log10(y[currentIndex + 1]);\n            const p = (0.5 * (alpha - gamma)) / (alpha - 2 * beta + gamma);\n            const xCurrent = x[currentIndex];\n            const xPrevious = x[currentIndex - 1];\n            peak.x = xCurrent + (xCurrent - xPrevious) * p;\n            peak.y =\n                y[currentIndex] -\n                    0.25 * (y[currentIndex - 1] - y[currentIndex + 1]) * p;\n        }\n    }\n}\n//# sourceMappingURL=optimizeTop.js.map","import { sgg } from 'ml-savitzky-golay-generalized';\nimport { xIsEquallySpaced, xIsMonotonic, xMaxAbsoluteValue, xMaxValue, xMinMaxValues, xNoiseStandardDeviation, } from 'ml-spectra-processing';\nimport { autoAlgorithm } from \"./algorithms/autoAlgorithm.js\";\nimport { firstDerivative } from \"./algorithms/firstDerivative.js\";\nimport { secondDerivative } from \"./algorithms/secondDerivative.js\";\nimport { optimizeTop } from \"./utils/optimizeTop.js\";\n/**\n * Global spectra deconvolution.\n * @param data - Object with `x` and `y` arrays. `x` must be monotone increasing.\n * @param options - Peak detection options.\n * @returns The detected peaks, sorted by ascending `x`.\n */\nexport function gsd(data, options = {}) {\n    let { noiseLevel } = options;\n    const { sgOptions = {\n        windowSize: 9,\n        polynomial: 3,\n    }, smoothY = false, maxCriteria = true, maxAbsoluteRatio = 0, minMaxRatio = 0.00025, realTopDetection = false, peakDetectionAlgorithm = 'second', } = options;\n    if (maxAbsoluteRatio < 0 || maxAbsoluteRatio > 1) {\n        throw new Error('maxAbsoluteRatio must be between 0 and 1');\n    }\n    const { x } = data;\n    let { y } = data;\n    if (xIsMonotonic(x) !== 1) {\n        throw new Error('GSD only accepts monotone increasing x values');\n    }\n    // Copy so the `maxCriteria` / clipping loops below don't mutate the caller's array.\n    y = y.slice();\n    // If the max difference between delta x is less than 5%, then,\n    // we can assume it to be equally spaced variable\n    const isEquallySpaced = xIsEquallySpaced(x);\n    if (noiseLevel === undefined) {\n        if (isEquallySpaced) {\n            const noiseInfo = xNoiseStandardDeviation(y);\n            if (maxCriteria) {\n                noiseLevel = noiseInfo.median + 1.5 * noiseInfo.sd;\n            }\n            else {\n                noiseLevel = -noiseInfo.median + 1.5 * noiseInfo.sd;\n            }\n        }\n        else {\n            noiseLevel = 0;\n        }\n    }\n    else if (!maxCriteria) {\n        noiseLevel *= -1;\n    }\n    if (!maxCriteria) {\n        for (let i = 0; i < y.length; i++) {\n            y[i] = -y[i];\n        }\n    }\n    const maxAbsoluteValue = maxAbsoluteRatio > 0 ? maxAbsoluteRatio * xMaxAbsoluteValue(y) : noiseLevel;\n    if (noiseLevel !== undefined) {\n        for (let i = 0; i < y.length; i++) {\n            if (y[i] < noiseLevel) {\n                y[i] = noiseLevel;\n            }\n        }\n    }\n    const xValue = isEquallySpaced ? x[1] - x[0] : x;\n    const yData = smoothY\n        ? sgg(y, xValue, {\n            ...sgOptions,\n            derivative: 0,\n        })\n        : y;\n    const { min: minY, max: maxY } = xMinMaxValues(yData);\n    if (minY > maxY || minY === maxY)\n        return [];\n    const dY = sgg(y, xValue, {\n        ...sgOptions,\n        derivative: 1,\n    });\n    const ddY = sgg(y, xValue, {\n        ...sgOptions,\n        derivative: 2,\n    });\n    const yThreshold = xMaxValue([\n        noiseLevel,\n        minY + (maxY - minY) * minMaxRatio,\n        maxAbsoluteValue,\n    ]);\n    const dX = x[1] - x[0];\n    const peakData = { x, y, yData, dY, ddY, dX, yThreshold };\n    let peaks = [];\n    if (peakDetectionAlgorithm === 'first') {\n        peaks = firstDerivative(peakData);\n    }\n    else if (peakDetectionAlgorithm === 'second') {\n        peaks = secondDerivative(peakData);\n    }\n    else {\n        peaks = autoAlgorithm(peakData);\n    }\n    if (realTopDetection) {\n        optimizeTop({ x, y: yData }, peaks);\n    }\n    for (const peak of peaks) {\n        if (!maxCriteria) {\n            peak.y *= -1;\n            peak.ddY = peak.ddY * -1;\n        }\n    }\n    peaks.sort((a, b) => {\n        return a.x - b.x;\n    });\n    return peaks;\n}\n//# sourceMappingURL=gsd.js.map","export const GAUSSIAN_EXP_FACTOR = -4 * Math.LN2;\nexport const ROOT_PI_OVER_LN2 = Math.sqrt(Math.PI / Math.LN2);\nexport const ROOT_THREE = Math.sqrt(3);\nexport const ROOT_2LN2 = Math.sqrt(2 * Math.LN2);\nexport const ROOT_2LN2_MINUS_ONE = Math.sqrt(2 * Math.LN2) - 1;\n//# sourceMappingURL=constants.js.map","// https://en.wikipedia.org/wiki/Error_function#Inverse_functions\n// This code yields to a good approximation\n// If needed a better implementation using polynomial can be found on https://en.wikipedia.org/wiki/Error_function#Inverse_functions\n/**\n * Approximate inverse error function.\n * @param x - value in the range (-1, 1).\n * @returns erfinv(x).\n * @see https://en.wikipedia.org/wiki/Error_function#Inverse_functions\n */\nexport default function erfinv(x) {\n    const a = 0.147;\n    if (x === 0)\n        return 0;\n    const ln1MinusXSqrd = Math.log(1 - x * x);\n    const lnEtcBy2Plus2 = ln1MinusXSqrd / 2 + 2 / (Math.PI * a);\n    const firstSqrt = Math.sqrt(lnEtcBy2Plus2 ** 2 - ln1MinusXSqrd / a);\n    const secondSqrt = Math.sqrt(firstSqrt - lnEtcBy2Plus2);\n    return secondSqrt * (x > 0 ? 1 : -1);\n}\n//# sourceMappingURL=erfinv.js.map","import { GAUSSIAN_EXP_FACTOR, ROOT_2LN2, ROOT_PI_OVER_LN2, } from \"../../../util/constants.js\";\nimport erfinv from \"../../../util/erfinv.js\";\nexport class Gaussian {\n    /**\n     * Full width at half maximum.\n     * @default 500\n     */\n    fwhm;\n    constructor(options = {}) {\n        const { fwhm = 500, sd } = options;\n        this.fwhm = sd ? gaussianWidthToFWHM(2 * sd) : fwhm;\n    }\n    fwhmToWidth(fwhm = this.fwhm) {\n        return gaussianFwhmToWidth(fwhm);\n    }\n    widthToFWHM(width) {\n        return gaussianWidthToFWHM(width);\n    }\n    fct(x) {\n        return gaussianFct(x, this.fwhm);\n    }\n    getArea(height = calculateGaussianHeight({ fwhm: this.fwhm })) {\n        return getGaussianArea({ fwhm: this.fwhm, height });\n    }\n    getFactor(area) {\n        return getGaussianFactor(area);\n    }\n    getData(options = {}) {\n        return getGaussianData(this, options);\n    }\n    calculateHeight(area = 1) {\n        return calculateGaussianHeight({ fwhm: this.fwhm, area });\n    }\n    getParameters() {\n        return ['fwhm'];\n    }\n}\n/**\n * Calculate the peak height for a given area and fwhm.\n * @param options - fwhm, area, and optional sd.\n * @returns the peak height.\n */\nexport function calculateGaussianHeight(options) {\n    const { area = 1, sd } = options;\n    let { fwhm = 500 } = options;\n    if (sd)\n        fwhm = gaussianWidthToFWHM(2 * sd);\n    return (2 * area) / ROOT_PI_OVER_LN2 / fwhm;\n}\n/**\n * Evaluate the gaussian function centered at x=0.\n * @param x - position at which to evaluate.\n * @param fwhm - full width at half maximum.\n * @returns the intensity at x.\n */\nexport function gaussianFct(x, fwhm) {\n    return Math.exp(GAUSSIAN_EXP_FACTOR * (x / fwhm) ** 2);\n}\n/**\n * Convert inflection-point width to full width at half maximum.\n * @param width - width between inflection points.\n * @returns full width at half maximum.\n */\nexport function gaussianWidthToFWHM(width) {\n    return width * ROOT_2LN2;\n}\n/**\n * Convert full width at half maximum to inflection-point width.\n * @param fwhm - full width at half maximum.\n * @returns width between inflection points.\n */\nexport function gaussianFwhmToWidth(fwhm) {\n    return fwhm / ROOT_2LN2;\n}\n/**\n * Calculate the area under a gaussian peak.\n * @param options - fwhm, height, and optional sd.\n * @returns the area.\n */\nexport function getGaussianArea(options) {\n    const { sd, height = 1 } = options;\n    let { fwhm = 500 } = options;\n    if (sd)\n        fwhm = gaussianWidthToFWHM(2 * sd);\n    return (height * ROOT_PI_OVER_LN2 * fwhm) / 2;\n}\n/**\n * Calculate the half-width factor corresponding to a given area coverage fraction.\n * @param area - target area fraction (0–1). Defaults to `0.9999`.\n * @returns the factor by which to multiply fwhm to cover the given area.\n */\nexport function getGaussianFactor(area = 0.9999) {\n    return Math.sqrt(2) * erfinv(area);\n}\n/**\n * Generate an intensity array for a gaussian shape.\n * @param shape - gaussian shape parameters (fwhm, sd).\n * @param options - sampling options (length, factor, height).\n * @returns Float64Array of intensity values.\n */\nexport function getGaussianData(shape = {}, options = {}) {\n    const { sd } = shape;\n    let { fwhm = 500 } = shape;\n    if (sd)\n        fwhm = gaussianWidthToFWHM(2 * sd);\n    const { factor = getGaussianFactor(), height = calculateGaussianHeight({ fwhm }), } = options;\n    let { length } = options;\n    if (!length) {\n        length = Math.min(Math.ceil(fwhm * factor), 2 ** 25 - 1);\n        if (length % 2 === 0)\n            length++;\n    }\n    const center = (length - 1) / 2;\n    const data = new Float64Array(length);\n    for (let i = 0; i <= center; i++) {\n        const value = gaussianFct(i - center, fwhm) * height;\n        data[i] = value;\n        data[length - 1 - i] = value;\n    }\n    return data;\n}\n//# sourceMappingURL=Gaussian.js.map","import { ROOT_THREE } from \"../../../util/constants.js\";\nexport class Lorentzian {\n    /**\n     * Full width at half maximum.\n     * @default 500\n     */\n    fwhm;\n    constructor(options = {}) {\n        const { fwhm = 500 } = options;\n        this.fwhm = fwhm;\n    }\n    fwhmToWidth(fwhm = this.fwhm) {\n        return lorentzianFwhmToWidth(fwhm);\n    }\n    widthToFWHM(width) {\n        return lorentzianWidthToFWHM(width);\n    }\n    fct(x) {\n        return lorentzianFct(x, this.fwhm);\n    }\n    getArea(height = 1) {\n        return getLorentzianArea({ fwhm: this.fwhm, height });\n    }\n    getFactor(area) {\n        return getLorentzianFactor(area);\n    }\n    getData(options = {}) {\n        return getLorentzianData(this, options);\n    }\n    calculateHeight(area = 1) {\n        return calculateLorentzianHeight({ fwhm: this.fwhm, area });\n    }\n    getParameters() {\n        return ['fwhm'];\n    }\n}\nexport const calculateLorentzianHeight = ({ fwhm = 1, area = 1 }) => {\n    return (2 * area) / Math.PI / fwhm;\n};\nexport const getLorentzianArea = (options) => {\n    const { fwhm = 500, height = 1 } = options;\n    return (height * Math.PI * fwhm) / 2;\n};\nexport const lorentzianFct = (x, fwhm) => {\n    return fwhm ** 2 / (4 * x ** 2 + fwhm ** 2);\n};\nexport const lorentzianWidthToFWHM = (width) => {\n    return width * ROOT_THREE;\n};\nexport const lorentzianFwhmToWidth = (fwhm) => {\n    return fwhm / ROOT_THREE;\n};\nconst lorentzianQuantile = (p) => Math.tan(Math.PI * (p - 0.5));\nexport const getLorentzianFactor = (area = 0.9999) => {\n    if (area >= 1) {\n        throw new Error('area should be (0 - 1)');\n    }\n    const halfResidual = (1 - area) * 0.5;\n    return ((lorentzianQuantile(1 - halfResidual) - lorentzianQuantile(halfResidual)) /\n        2);\n};\nexport const getLorentzianData = (shape = {}, options = {}) => {\n    const { fwhm = 500 } = shape;\n    const { factor = getLorentzianFactor(), height = calculateLorentzianHeight({ fwhm, area: 1 }), } = options;\n    let { length } = options;\n    if (!length) {\n        length = Math.min(Math.ceil(fwhm * factor), 2 ** 25 - 1);\n        if (length % 2 === 0)\n            length++;\n    }\n    const center = (length - 1) / 2;\n    const data = new Float64Array(length);\n    for (let i = 0; i <= center; i++) {\n        const value = lorentzianFct(i - center, fwhm) * height;\n        data[i] = value;\n        data[length - 1 - i] = value;\n    }\n    return data;\n};\n//# sourceMappingURL=Lorentzian.js.map","import { calculateLorentzianHeight, getLorentzianFactor, lorentzianFwhmToWidth, lorentzianWidthToFWHM, } from \"../lorentzian/Lorentzian.js\";\nexport class LorentzianDispersive {\n    /**\n     * Full width at half maximum.\n     * @default 500\n     */\n    fwhm;\n    constructor(options = {}) {\n        const { fwhm = 500 } = options;\n        this.fwhm = fwhm;\n    }\n    fwhmToWidth(fwhm = this.fwhm) {\n        return lorentzianFwhmToWidth(fwhm);\n    }\n    widthToFWHM(width) {\n        return lorentzianWidthToFWHM(width);\n    }\n    fct(x) {\n        return lorentzianDispersiveFct(x, this.fwhm);\n    }\n    getArea() {\n        return 0;\n    }\n    getFactor(area) {\n        return getLorentzianFactor(area);\n    }\n    getData(options = {}) {\n        return getLorentzianDispersiveData(this, options);\n    }\n    calculateHeight(area = 1) {\n        return calculateLorentzianHeight({ fwhm: this.fwhm, area });\n    }\n    getParameters() {\n        return ['fwhm'];\n    }\n}\nexport const lorentzianDispersiveFct = (x, fwhm) => {\n    return (2 * fwhm * x) / (4 * x ** 2 + fwhm ** 2);\n};\nexport const getLorentzianDispersiveData = (shape = {}, options = {}) => {\n    const { fwhm = 500 } = shape;\n    const { factor = getLorentzianFactor(), height = calculateLorentzianHeight({ fwhm, area: 1 }), } = options;\n    let { length } = options;\n    if (!length) {\n        length = Math.min(Math.ceil(fwhm * factor), 2 ** 25 - 1);\n        if (length % 2 === 0)\n            length++;\n    }\n    const center = (length - 1) / 2;\n    const data = new Float64Array(length);\n    for (let i = 0; i <= center; i++) {\n        const value = lorentzianDispersiveFct(i - center, fwhm) * height;\n        data[i] = value;\n        data[length - 1 - i] = -value;\n    }\n    return data;\n};\n//# sourceMappingURL=LorentzianDispersive.js.map","import { getGaussianFactor } from \"../gaussian/Gaussian.js\";\nimport { getLorentzianFactor } from \"../lorentzian/Lorentzian.js\";\n/**\n * Find the k factor for a pseudo-Voigt distribution such that the\n * cumulative probability pPseudoVoigt(k, mu) equals `pTarget`.\n *\n * Uses a simple bisection search (with exponential bracketing) to\n * invert the pseudo-Voigt cumulative function. Special cases:\n * - mu === 1 -> reduces to the gaussian case\n * - mu === 0 -> reduces to the lorentzian case\n * @param pTarget - Target cumulative probability in (0,1)\n * @param mu - Gaussian fraction in [0,1]\n * @param tol - Convergence tolerance\n * @param maxIter - Maximum number of bisection iterations\n * @returns the factor k such that pPseudoVoigt(k, mu) ~= pTarget\n */\nexport function pseudoVoigtFindFactor(pTarget, mu, tol = 1e-9, maxIter = 200) {\n    if (pTarget <= 0 || pTarget >= 1) {\n        throw new RangeError('pTarget must be in (0,1)');\n    }\n    if (mu === 1) {\n        return getGaussianFactor(pTarget);\n    }\n    else if (mu === 0) {\n        return getLorentzianFactor(pTarget);\n    }\n    // bisection\n    let lo = 0;\n    let hi = 10;\n    let it = 0;\n    while (pPseudoVoigt(hi, mu) < pTarget && it++ < 200)\n        hi *= 2;\n    for (let i = 0; i < maxIter; i++) {\n        const mid = 0.5 * (lo + hi);\n        const val = pPseudoVoigt(mid, mu);\n        if (Math.abs(val - pTarget) < tol)\n            return mid;\n        if (val < pTarget) {\n            lo = mid;\n        }\n        else {\n            hi = mid;\n        }\n    }\n    return 0.5 * (lo + hi);\n}\nfunction erf(x) {\n    const sign = x < 0 ? -1 : 1;\n    x = Math.abs(x);\n    const a1 = 0.254829592;\n    const a2 = -0.284496736;\n    const a3 = 1.421413741;\n    const a4 = -1.453152027;\n    const a5 = 1.061405429;\n    const p = 0.3275911;\n    const t = 1 / (1 + p * x);\n    const y = 1 - ((((a5 * t + a4) * t + a3) * t + a2) * t + a1) * t * Math.exp(-x * x);\n    return sign * y;\n}\nconst sqrtLn2 = Math.sqrt(Math.log(2));\nfunction pGaussian(k) {\n    return erf(k * sqrtLn2);\n}\nfunction pLorentz(k) {\n    return (2 / Math.PI) * Math.atan(k);\n}\nfunction pPseudoVoigt(k, mu) {\n    return (1 - mu) * pLorentz(k) + mu * pGaussian(k);\n}\n//# sourceMappingURL=computeFactor.js.map","import { GAUSSIAN_EXP_FACTOR, ROOT_2LN2_MINUS_ONE, ROOT_PI_OVER_LN2, } from \"../../../util/constants.js\";\nimport { gaussianFct } from \"../gaussian/Gaussian.js\";\nimport { lorentzianFct } from \"../lorentzian/Lorentzian.js\";\nimport { pseudoVoigtFindFactor } from \"./computeFactor.js\";\nexport class PseudoVoigt {\n    fwhm;\n    /**\n     * Ratio of gaussian contribution in the shape\n     * @default 0.5\n     */\n    mu;\n    constructor(options = {}) {\n        const { fwhm = 500, mu = 0.5 } = options;\n        this.mu = mu;\n        this.fwhm = fwhm;\n    }\n    fwhmToWidth(fwhm = this.fwhm, mu = this.mu) {\n        return pseudoVoigtFwhmToWidth(fwhm, mu);\n    }\n    widthToFWHM(width, mu = this.mu) {\n        return pseudoVoigtWidthToFWHM(width, mu);\n    }\n    fct(x) {\n        return pseudoVoigtFct(x, this.fwhm, this.mu);\n    }\n    getArea(height = 1) {\n        return getPseudoVoigtArea({ fwhm: this.fwhm, height, mu: this.mu });\n    }\n    getFactor(area) {\n        return getPseudoVoigtFactor(area, this.mu);\n    }\n    getData(options = {}) {\n        const { length, factor, height = calculatePseudoVoigtHeight({\n            fwhm: this.fwhm,\n            mu: this.mu,\n            area: 1,\n        }), } = options;\n        return getPseudoVoigtData(this, { factor, length, height });\n    }\n    calculateHeight(area = 1) {\n        return calculatePseudoVoigtHeight({ fwhm: this.fwhm, mu: this.mu, area });\n    }\n    getParameters() {\n        return ['fwhm', 'mu'];\n    }\n}\nexport const calculatePseudoVoigtHeight = (options = {}) => {\n    const { fwhm = 1, mu = 0.5, area = 1 } = options;\n    return (2 * area) / (fwhm * (mu * ROOT_PI_OVER_LN2 + (1 - mu) * Math.PI));\n};\nexport const pseudoVoigtFct = (x, fwhm, mu) => {\n    return (1 - mu) * lorentzianFct(x, fwhm) + mu * gaussianFct(x, fwhm);\n};\nexport const pseudoVoigtWidthToFWHM = (width, mu = 0.5) => {\n    return width * (mu * ROOT_2LN2_MINUS_ONE + 1);\n};\nexport const pseudoVoigtFwhmToWidth = (fwhm, mu = 0.5) => {\n    return fwhm / (mu * ROOT_2LN2_MINUS_ONE + 1);\n};\nexport const getPseudoVoigtArea = (options) => {\n    const { fwhm = 500, height = 1, mu = 0.5 } = options;\n    return (fwhm * height * (mu * ROOT_PI_OVER_LN2 + (1 - mu) * Math.PI)) / 2;\n};\nexport const getPseudoVoigtFactor = (area = 0.9999, mu = 0.5) => {\n    return pseudoVoigtFindFactor(area, mu);\n};\nexport const getPseudoVoigtData = (shape = {}, options = {}) => {\n    const { fwhm = 500, mu = 0.5 } = shape;\n    const { factor = getPseudoVoigtFactor(0.999, mu) } = options;\n    let { length, height = calculatePseudoVoigtHeight({ fwhm, mu, area: 1 }) } = options;\n    if (!height) {\n        height =\n            1 /\n                ((mu / Math.sqrt(-GAUSSIAN_EXP_FACTOR / Math.PI)) * fwhm +\n                    ((1 - mu) * fwhm * Math.PI) / 2);\n    }\n    if (!length) {\n        length = Math.min(Math.ceil(fwhm * factor), 2 ** 25 - 1);\n        if (length % 2 === 0)\n            length++;\n    }\n    const center = (length - 1) / 2;\n    const data = new Float64Array(length);\n    for (let i = 0; i <= center; i++) {\n        const value = pseudoVoigtFct(i - center, fwhm, mu) * height;\n        data[i] = value;\n        data[length - 1 - i] = value;\n    }\n    return data;\n};\n//# sourceMappingURL=PseudoVoigt.js.map","import { calculatePseudoVoigtHeight, getPseudoVoigtArea, getPseudoVoigtData, getPseudoVoigtFactor, pseudoVoigtFct, pseudoVoigtFwhmToWidth, pseudoVoigtWidthToFWHM, } from \"../pseudoVoigt/PseudoVoigt.js\";\n/**\n * TCH-style pseudo-Voigt where gaussian and lorentzian widths are independent.\n * The effective fwhm and mixing parameter mu are derived from fwhmG and fwhmL\n * via the Thompson–Cox–Hastings approximation.\n */\nexport class PseudoVoigtTCH {\n    _fwhmG;\n    _fwhmL;\n    _fwhm;\n    _mu;\n    _lorentzianWidthFraction;\n    constructor(options = {}) {\n        const { fwhmG, fwhmL, fwhm, mu = 0.5 } = options;\n        this._mu = mu;\n        this._fwhm = 0;\n        this._fwhmG = 0;\n        this._fwhmL = 0;\n        this._lorentzianWidthFraction = lorentzianWidthFraction(1 - mu);\n        if (fwhmG && fwhmL) {\n            this._fwhmG = fwhmG;\n            this.fwhmL = fwhmL;\n        }\n        else if (fwhm) {\n            this.fwhm = fwhm;\n        }\n    }\n    set fwhmG(value) {\n        const effectiveFwhm = computeEffectiveWidth(value, this._fwhmL);\n        const lorentzianFraction = this._fwhmL / effectiveFwhm;\n        this._fwhm = effectiveFwhm;\n        this._mu =\n            1 -\n                (1.36603 * lorentzianFraction -\n                    0.47719 * lorentzianFraction * lorentzianFraction +\n                    0.11116 * lorentzianFraction * lorentzianFraction * lorentzianFraction);\n        this._fwhmG = value;\n        this._lorentzianWidthFraction = lorentzianFraction;\n    }\n    get fwhmG() {\n        return this._fwhmG;\n    }\n    set fwhmL(value) {\n        const effectiveFwhm = computeEffectiveWidth(this._fwhmG, value);\n        const lorentzianFraction = value / effectiveFwhm;\n        this._fwhm = effectiveFwhm;\n        this._mu =\n            1 -\n                (1.36603 * lorentzianFraction -\n                    0.47719 * lorentzianFraction * lorentzianFraction +\n                    0.11116 * lorentzianFraction * lorentzianFraction * lorentzianFraction);\n        this._fwhmL = value;\n        this._lorentzianWidthFraction = lorentzianFraction;\n    }\n    get fwhmL() {\n        return this._fwhmL;\n    }\n    set mu(value) {\n        const lorentzianFraction = lorentzianWidthFraction(1 - value);\n        this._lorentzianWidthFraction = lorentzianFraction;\n        this._fwhmL = this._fwhm * lorentzianFraction;\n        this._fwhmG = this._fwhm * (1 - lorentzianFraction);\n        this._mu = value;\n    }\n    get mu() {\n        return this._mu;\n    }\n    set fwhm(value) {\n        const lorentzianFraction = this._lorentzianWidthFraction || lorentzianWidthFraction(1 - this._mu);\n        this._fwhmL = value * lorentzianFraction;\n        this._fwhmG = value * (1 - lorentzianFraction);\n        this._fwhm = value;\n    }\n    get fwhm() {\n        return this._fwhm;\n    }\n    fwhmToWidth(fwhm = this._fwhm, mu = this._mu) {\n        return pseudoVoigtFwhmToWidth(fwhm, mu);\n    }\n    widthToFWHM(width, mu = this._mu) {\n        return pseudoVoigtWidthToFWHM(width, mu);\n    }\n    fct(x) {\n        return pseudoVoigtFct(x, this._fwhm, this._mu);\n    }\n    getArea(height = 1) {\n        return getPseudoVoigtArea({ fwhm: this._fwhm, height, mu: this._mu });\n    }\n    getFactor(area) {\n        return getPseudoVoigtFactor(area, this._mu);\n    }\n    getData(options = {}) {\n        const { length, factor, height = calculatePseudoVoigtHeight({\n            fwhm: this._fwhm,\n            mu: this._mu,\n            area: 1,\n        }), } = options;\n        return getPseudoVoigtData(this, { factor, length, height });\n    }\n    calculateHeight(area = 1) {\n        return calculatePseudoVoigtHeight({\n            fwhm: this._fwhm,\n            mu: this._mu,\n            area,\n        });\n    }\n    getParameters() {\n        return ['fwhmG', 'fwhmL'];\n    }\n}\n/**\n * Compute the effective FWHM from gaussian and lorentzian component widths\n * using the Thompson–Cox–Hastings approximation.\n * @param fwhmG - gaussian component FWHM.\n * @param fwhmL - lorentzian component FWHM.\n * @returns effective combined FWHM.\n */\nfunction computeEffectiveWidth(fwhmG, fwhmL) {\n    return ((fwhmG ** 5 +\n        2.69269 * fwhmG ** 4 * fwhmL +\n        2.42843 * fwhmG ** 3 * fwhmL ** 2 +\n        4.47163 * fwhmG ** 2 * fwhmL ** 3 +\n        0.07842 * fwhmG * fwhmL ** 4 +\n        fwhmL ** 5) **\n        0.2);\n}\n/**\n * Solve for the lorentzian width fraction fwhmL/fwhm given lorentzianFraction = 1 - mu,\n * using Newton's method on: 1.36603·x - 0.47719·x² + 0.11116·x³ = lorentzianFraction.\n * @param lorentzianFraction - TCH lorentzian mixing parameter (= 1 - mu).\n * @returns the lorentzian width fraction fwhmL/fwhm.\n */\nfunction lorentzianWidthFraction(lorentzianFraction) {\n    let fraction = lorentzianFraction;\n    for (let i = 0; i < 6; i++) {\n        const f = 1.36603 * fraction -\n            0.47719 * fraction * fraction +\n            0.11116 * fraction * fraction * fraction -\n            lorentzianFraction;\n        const df = 1.36603 - 2 * 0.47719 * fraction + 3 * 0.11116 * fraction * fraction;\n        fraction -= f / df;\n    }\n    return fraction;\n}\n//# sourceMappingURL=PseudoVoigtTCH.js.map","import { ROOT_THREE } from \"../../../util/constants.js\";\n/**\n * This shape is a linear combination of rational function (n|n+2), for n = 0 (lorentzian function) and n = 2\n * the parameter that combines those two functions is `gamma` and it is called the kurtosis parameter, it is an\n * implementation of generalized lorentzian shape published by Stanislav Sykora in the SMASH 2010. DOI:10.3247/SL3nmr10.006\n * {@link http://www.ebyte.it/stan/Talk_ML_UserMeeting_SMASH_2010_GeneralizedLorentzian.html}\n */\nexport class GeneralizedLorentzian {\n    /**\n     * Full width at half maximum.\n     * @default 500\n     */\n    fwhm;\n    /**\n     * kurtosis parameter of the shape, between -1 to 2\n     * @default 1\n     */\n    gamma;\n    constructor(options = {}) {\n        const { fwhm = 500, gamma = 0.5 } = options;\n        this.fwhm = fwhm;\n        this.gamma = gamma;\n    }\n    fwhmToWidth(fwhm = this.fwhm) {\n        return generalizedLorentzianFwhmToWidth(fwhm);\n    }\n    widthToFWHM(width) {\n        return generalizedLorentzianWidthToFWHM(width);\n    }\n    fct(x) {\n        return generalizedLorentzianFct(x, this.fwhm, this.gamma);\n    }\n    getArea(height = 1) {\n        return getGeneralizedLorentzianArea({\n            fwhm: this.fwhm,\n            height,\n            gamma: this.gamma,\n        });\n    }\n    getFactor(area) {\n        return getGeneralizedLorentzianFactor(area);\n    }\n    getData(options = {}) {\n        return getGeneralizedLorentzianData(this, options);\n    }\n    calculateHeight(area = 1) {\n        const { gamma, fwhm } = this;\n        return calculateGeneralizedLorentzianHeight({ fwhm, area, gamma });\n    }\n    getParameters() {\n        return ['fwhm', 'gamma'];\n    }\n}\nexport const calculateGeneralizedLorentzianHeight = ({ fwhm = 1, gamma = 1, area = 1, }) => {\n    return (area / fwhm / (3.14159 - 0.420894 * gamma)) * 2;\n};\n/**\n * Calculate the area under a generalized Lorentzian peak (integral from Mathematica).\n * @param options - shape parameters including fwhm, height, and gamma.\n * @returns the area under the peak.\n */\nexport const getGeneralizedLorentzianArea = (options) => {\n    const { fwhm = 500, height = 1, gamma = 1 } = options;\n    return (height * fwhm * (3.14159 - 0.420894 * gamma)) / 2;\n};\nexport const generalizedLorentzianFct = (x, fwhm, gamma) => {\n    const u = ((2 * x) / fwhm) ** 2;\n    return (1 - gamma) / (1 + u) + (gamma * (1 + u / 2)) / (1 + u + u ** 2);\n};\nexport const generalizedLorentzianWidthToFWHM = (width) => {\n    return width * ROOT_THREE;\n};\nexport const generalizedLorentzianFwhmToWidth = (fwhm) => {\n    return fwhm / ROOT_THREE;\n};\nconst generalizedLorentzianQuantile = (p) => Math.tan(Math.PI * (p - 0.5));\nexport const getGeneralizedLorentzianFactor = (area = 0.9999) => {\n    if (area >= 1) {\n        throw new Error('area should be (0 - 1)');\n    }\n    const halfResidual = (1 - area) * 0.5;\n    return ((generalizedLorentzianQuantile(1 - halfResidual) -\n        generalizedLorentzianQuantile(halfResidual)) /\n        2);\n};\nexport const getGeneralizedLorentzianData = (shape = {}, options = {}) => {\n    const { fwhm = 500, gamma = 1 } = shape;\n    const { factor = getGeneralizedLorentzianFactor(), height = calculateGeneralizedLorentzianHeight({ fwhm, area: 1, gamma }), } = options;\n    let { length } = options;\n    if (!length) {\n        length = Math.min(Math.ceil(fwhm * factor), 2 ** 25 - 1);\n        if (length % 2 === 0)\n            length++;\n    }\n    const center = (length - 1) / 2;\n    const data = new Float64Array(length);\n    for (let i = 0; i <= center; i++) {\n        const value = generalizedLorentzianFct(i - center, fwhm, gamma) * height;\n        data[i] = value;\n        data[length - 1 - i] = value;\n    }\n    return data;\n};\n//# sourceMappingURL=GeneralizedLorentzian.js.map","import { Gaussian } from \"./gaussian/Gaussian.js\";\nimport { GeneralizedLorentzian } from \"./generalizedLorentzian/GeneralizedLorentzian.js\";\nimport { Lorentzian } from \"./lorentzian/Lorentzian.js\";\nimport { LorentzianDispersive } from \"./lorentzianDispersive/LorentzianDispersive.js\";\nimport { PseudoVoigt } from \"./pseudoVoigt/PseudoVoigt.js\";\nimport { PseudoVoigtTCH } from \"./pseudoVoigtTCH/PseudoVoigtTCH.js\";\n/**\n * Generate a instance of a specific kind of shape.\n * @param shape - shape descriptor specifying the kind and parameters.\n * @returns an instance of the requested shape class.\n */\nexport function getShape1D(shape) {\n    const { kind } = shape;\n    switch (kind) {\n        case 'gaussian':\n            return new Gaussian(shape);\n        case 'lorentzian':\n            return new Lorentzian(shape);\n        case 'pseudoVoigt':\n            return new PseudoVoigt(shape);\n        case 'pseudoVoigtTCH':\n            return new PseudoVoigtTCH(shape);\n        case 'lorentzianDispersive':\n            return new LorentzianDispersive(shape);\n        case 'generalizedLorentzian':\n            return new GeneralizedLorentzian(shape);\n        default: {\n            throw new Error(`Unknown distribution ${kind}`);\n        }\n    }\n}\n//# sourceMappingURL=getShape1D.js.map","/**\n * This function returns the sumOfShapes function\n * This function gives sumOfShapes access to the peak list and the associated data\n * @param internalPeaks\n */\nexport function getSumOfShapes(internalPeaks) {\n    return function sumOfShapes(parameters) {\n        for (const peak of internalPeaks) {\n            for (let i = 2; i < parameters.length; i++) {\n                const shapeFctKey = peak.parameters[i];\n                peak.shapeFct[shapeFctKey] = parameters[peak.fromIndex + i];\n            }\n        }\n        return (x) => {\n            let totalY = 0;\n            for (const peak of internalPeaks) {\n                const peakX = parameters[peak.fromIndex];\n                const y = parameters[peak.fromIndex + 1];\n                totalY += y * peak.shapeFct.fct(x - peakX);\n            }\n            return totalY;\n        };\n    };\n}\n//# sourceMappingURL=getSumOfShapes.js.map","export function getFixedParametersResult(internalPeaks, normalizedY, x, globalInit, baseSumOfShapes, yScale) {\n    const fittedValues = Array.from(globalInit);\n    const newPeaks = [];\n    for (const peak of internalPeaks) {\n        const { id, shape, parameters, fromIndex } = peak;\n        let newPeak = { x: 0, y: 0, shape };\n        if (id) {\n            //@ts-expect-error it is right step\n            newPeak = { ...newPeak, id };\n        }\n        newPeak.x = fittedValues[fromIndex];\n        newPeak.y = fittedValues[fromIndex + 1] * yScale;\n        for (let i = 2; i < parameters.length; i++) {\n            //@ts-expect-error it is right step\n            newPeak.shape[parameters[i]] = fittedValues[fromIndex + i];\n        }\n        newPeaks.push(newPeak);\n    }\n    const fct = baseSumOfShapes(fittedValues);\n    let error = 0;\n    for (let i = 0; i < normalizedY.length; i++) {\n        error += (normalizedY[i] - fct(x[i])) ** 2;\n    }\n    return {\n        error,\n        iterations: 0,\n        peaks: newPeaks,\n    };\n}\n//# sourceMappingURL=getFixedParametersResult.js.map","export function getGlobalParameterVectors(internalPeaks, peaks, options) {\n    const nbParams = internalPeaks[internalPeaks.length - 1].toIndex + 1;\n    const globalMin = new Float64Array(nbParams);\n    const globalMax = new Float64Array(nbParams);\n    const globalInit = new Float64Array(nbParams);\n    const globalGrad = new Float64Array(nbParams);\n    const isOptimizable = new Array(nbParams);\n    let index = 0;\n    for (let pIndex = 0; pIndex < internalPeaks.length; pIndex++) {\n        const peak = internalPeaks[pIndex];\n        for (let i = 0; i < peak.parameters.length; i++) {\n            const paramName = peak.parameters[i];\n            globalMin[index] = peak.propertiesValues.min[i];\n            globalMax[index] = peak.propertiesValues.max[i];\n            globalInit[index] = peak.propertiesValues.init[i];\n            globalGrad[index] = peak.propertiesValues.gradientDifference[i];\n            let optimizeFlag = true;\n            const perPeakParam = peaks[pIndex]?.parameters?.[paramName];\n            const globalParam = options.parameters?.[paramName];\n            if (perPeakParam?.optimize !== undefined) {\n                if (typeof perPeakParam.optimize === 'function') {\n                    optimizeFlag = perPeakParam.optimize(peaks[pIndex]);\n                }\n                else {\n                    const { optimize = true } = perPeakParam;\n                    optimizeFlag = optimize;\n                }\n            }\n            else if (globalParam?.optimize !== undefined) {\n                if (typeof globalParam.optimize === 'function') {\n                    optimizeFlag = globalParam.optimize(peaks[pIndex]);\n                }\n                else {\n                    const { optimize = true } = globalParam;\n                    optimizeFlag = optimize;\n                }\n            }\n            isOptimizable[index] = optimizeFlag;\n            index++;\n        }\n    }\n    const freeIndices = [];\n    for (let i = 0; i < nbParams; i++) {\n        if (isOptimizable[i])\n            freeIndices.push(i);\n    }\n    return { freeIndices, globalMin, globalMax, globalInit, globalGrad };\n}\n//# sourceMappingURL=getGlobalParameterVectors.js.map","/**\n * Asserts that value is truthy.\n *\n * @param value - Value to check.\n * @param message - Optional error message to throw.\n */\nexport function assert(value, message) {\n    if (!value) {\n        throw new Error(message ? message : 'unreachable');\n    }\n}\n//# sourceMappingURL=assert.js.map","export const DefaultParameters = {\n    x: {\n        init: (peak) => peak.x,\n        min: (peak, peakShape) => peak.x - peakShape.fwhm * 2,\n        max: (peak, peakShape) => peak.x + peakShape.fwhm * 2,\n        gradientDifference: (peak, peakShape) => peakShape.fwhm * 2e-3,\n    },\n    y: {\n        init: (peak) => peak.y,\n        min: (peak) => (peak.y < 0 ? -1.1 : 0),\n        max: (peak) => (peak.y < 0 ? 0 : 1.1),\n        gradientDifference: () => 1e-3,\n    },\n    fwhm: {\n        init: (peak, peakShape) => peakShape.fwhm,\n        min: (peak, peakShape) => peakShape.fwhm * 0.25,\n        max: (peak, peakShape) => peakShape.fwhm * 4,\n        gradientDifference: (peak, peakShape) => peakShape.fwhm * 2e-3,\n    },\n    fwhmG: {\n        init: (peak, peakShape) => peakShape.fwhm * 0.6,\n        min: (peak, peakShape) => peakShape.fwhm * 0.6 * 0.25,\n        max: (peak, peakShape) => peakShape.fwhm * 0.6 * 4,\n        gradientDifference: (peak, peakShape) => peakShape.fwhm * 0.6 * 2e-3,\n    },\n    fwhmL: {\n        init: (peak, peakShape) => peakShape.fwhm * 0.4,\n        min: (peak, peakShape) => peakShape.fwhm * 0.4 * 0.25,\n        max: (peak, peakShape) => peakShape.fwhm * 0.4 * 4,\n        gradientDifference: (peak, peakShape) => peakShape.fwhm * 0.4 * 2e-3,\n    },\n    mu: {\n        init: (peak, peakShape) => peakShape.mu,\n        min: () => 0,\n        max: () => 1,\n        gradientDifference: () => 0.01,\n    },\n    gamma: {\n        init: (peak, peakShape) => peakShape.gamma || 0.5,\n        min: () => -1,\n        max: () => 2,\n        gradientDifference: () => 0.01,\n    },\n};\n//# sourceMappingURL=DefaultParameters.js.map","import { getShape1D } from 'ml-peak-shape-generator';\nimport { assert } from \"../assert.js\";\nimport { DefaultParameters } from \"./DefaultParameters.js\";\nconst properties = ['init', 'min', 'max', 'gradientDifference'];\n/**\n * Return an array of internalPeaks that contains the exact init, min, max values based on the options\n * @param peaks\n * @param minMaxY\n * @param options\n * @returns\n */\nexport function getInternalPeaks(peaks, yScale, options = {}) {\n    let index = 0;\n    const internalPeaks = [];\n    const normalizedPeaks = peaks.map((peak) => {\n        return {\n            ...peak,\n            y: peak.y / yScale,\n        };\n    });\n    for (const peak of normalizedPeaks) {\n        const { id, shape = options.shape ? options.shape : { kind: 'gaussian' } } = peak;\n        const shapeFct = getShape1D(shape);\n        const parameters = ['x', 'y', ...shapeFct.getParameters()];\n        const propertiesValues = {\n            min: [],\n            max: [],\n            init: [],\n            gradientDifference: [],\n        };\n        for (const parameter of parameters) {\n            for (const property of properties) {\n                // check if the property is specified in the peak\n                let propertyValue = peak?.parameters?.[parameter]?.[property];\n                if (propertyValue !== undefined) {\n                    propertyValue = getNormalizedValue(propertyValue, parameter, property, yScale);\n                    propertiesValues[property].push(propertyValue);\n                    continue;\n                }\n                // check if there are some global option, it could be a number or a callback\n                let generalParameterValue = options?.parameters?.[parameter]?.[property];\n                if (generalParameterValue !== undefined) {\n                    if (typeof generalParameterValue === 'number') {\n                        generalParameterValue = getNormalizedValue(generalParameterValue, parameter, property, yScale);\n                        propertiesValues[property].push(generalParameterValue);\n                        continue;\n                    }\n                    else {\n                        let value = generalParameterValue(peak);\n                        value = getNormalizedValue(value, parameter, property, yScale);\n                        propertiesValues[property].push(value);\n                        continue;\n                    }\n                }\n                // we just need to take the default parameters\n                assert(DefaultParameters[parameter], `No default parameter for ${parameter}`);\n                const defaultParameterValues = DefaultParameters[parameter][property];\n                //@ts-expect-error should never happen\n                propertiesValues[property].push(defaultParameterValues(peak, shapeFct));\n            }\n        }\n        const fromIndex = index;\n        const toIndex = fromIndex + parameters.length - 1;\n        index += toIndex - fromIndex + 1;\n        internalPeaks.push({\n            id,\n            shape,\n            shapeFct,\n            parameters,\n            propertiesValues,\n            fromIndex,\n            toIndex,\n        });\n    }\n    return internalPeaks;\n}\nfunction getNormalizedValue(value, parameter, property, yScale) {\n    if (parameter === 'y') {\n        if (property === 'gradientDifference') {\n            return value;\n        }\n        else {\n            return value / yScale;\n        }\n    }\n    return value;\n}\n//# sourceMappingURL=getInternalPeaks.js.map","// eslint-disable-next-line @typescript-eslint/unbound-method\nconst toString = Object.prototype.toString;\n/**\n * Checks if an object is an instance of an Array (array or typed array, except those that contain bigint values).\n * @param value - Object to check.\n * @returns True if the object is an array or a typed array.\n */\nexport function isAnyArray(value) {\n    const tag = toString.call(value);\n    return tag.endsWith('Array]') && !tag.includes('Big');\n}\n//# sourceMappingURL=index.js.map","import { isAnyArray } from 'is-any-array';\nexport default function checkOptions(data, options) {\n    const { timeout, initialValues, weights = 1, damping = 1e-2, dampingStepUp = 11, dampingStepDown = 9, maxIterations = 100, errorTolerance = 1e-7, centralDifference = false, gradientDifference = 10e-2, improvementThreshold = 1e-3, } = options;\n    let { minValues, maxValues } = options;\n    if (damping <= 0) {\n        throw new Error('The damping option must be a positive number');\n    }\n    else if (!data.x || !data.y) {\n        throw new Error('The data parameter must have x and y elements');\n    }\n    else if (!isAnyArray(data.x) ||\n        data.x.length < 2 ||\n        !isAnyArray(data.y) ||\n        data.y.length < 2) {\n        throw new Error('The data parameter elements must be an array with more than 2 points');\n    }\n    else if (data.x.length !== data.y.length) {\n        throw new Error('The data parameter elements must have the same size');\n    }\n    if (!(initialValues && initialValues.length > 0)) {\n        throw new Error('The initialValues option is mandatory and must be an array');\n    }\n    const parameters = Array.from(initialValues);\n    const parLen = parameters.length;\n    maxValues = maxValues || new Array(parLen).fill(Number.MAX_SAFE_INTEGER);\n    minValues = minValues || new Array(parLen).fill(Number.MIN_SAFE_INTEGER);\n    if (maxValues.length !== minValues.length) {\n        throw new Error('minValues and maxValues must be the same size');\n    }\n    const gradientDifferenceArray = getGradientDifferenceArray(gradientDifference, parameters);\n    const filler = getFiller(weights, data.x.length);\n    const checkTimeout = getCheckTimeout(timeout);\n    const weightSquare = Array.from({ length: data.x.length }, (_, i) => filler(i));\n    return {\n        checkTimeout,\n        minValues,\n        maxValues,\n        parameters,\n        weightSquare,\n        damping,\n        dampingStepUp,\n        dampingStepDown,\n        maxIterations,\n        errorTolerance,\n        centralDifference,\n        gradientDifference: gradientDifferenceArray,\n        improvementThreshold,\n    };\n}\nfunction getGradientDifferenceArray(gradientDifference, parameters) {\n    if (typeof gradientDifference === 'number') {\n        return new Array(parameters.length).fill(gradientDifference);\n    }\n    else if (isAnyArray(gradientDifference)) {\n        const parLen = parameters.length;\n        if (gradientDifference.length !== parLen) {\n            return new Array(parLen).fill(gradientDifference[0]);\n        }\n        return Array.from(gradientDifference);\n    }\n    throw new Error('gradientDifference should be a number or array with length equal to the number of parameters');\n}\nfunction getFiller(weights, dataLength) {\n    if (typeof weights === 'number') {\n        const value = 1 / weights ** 2;\n        return () => value;\n    }\n    else if (isAnyArray(weights)) {\n        if (weights.length < dataLength) {\n            const value = 1 / weights[0] ** 2;\n            return () => value;\n        }\n        return (i) => 1 / weights[i] ** 2;\n    }\n    throw new Error('weights should be a number or array with length equal to the number of data points');\n}\nfunction getCheckTimeout(timeout) {\n    if (timeout !== undefined) {\n        if (typeof timeout !== 'number') {\n            throw new Error('timeout should be a number');\n        }\n        const endTime = Date.now() + timeout * 1000;\n        return () => Date.now() > endTime;\n    }\n    else {\n        return () => false;\n    }\n}\n//# sourceMappingURL=check_options.js.map","/**\n * the sum of the weighted squares of the errors (or weighted residuals) between the data.y\n * and the curve-fit function.\n *\n * @param data - Array of points to fit in the format [x1, x2, ... ], [y1, y2, ... ]\n * @param parameters - Array of current parameter values\n * @param parameterizedFunction - The parameters and returns a function with the independent variable as a parameter\n * @param weightSquare - Square of weights (must be same length as data.x)\n */\nexport default function errorCalculation(data, parameters, parameterizedFunction, weightSquare) {\n    let error = 0;\n    const func = parameterizedFunction(parameters);\n    for (let i = 0; i < data.x.length; i++) {\n        error += (data.y[i] - func(data.x[i])) ** 2 / weightSquare[i];\n    }\n    return error;\n}\n//# sourceMappingURL=error_calculation.js.map","import { Matrix } from 'ml-matrix';\n/**\n * Difference of the matrix function over the parameters\n * @param data Array of points to fit in the format [x1, x2, ... ], [y1, y2, ... ]\n * @param evaluatedData - Array of previous evaluated function values\n * @param params - Array of previous parameter values\n * @param gradientDifference - The step size to approximate the jacobian matrix\n * @param centralDifference - If true the jacobian matrix is approximated by central differences otherwise by forward differences\n * @param paramFunction - The parameters and returns a function with the independent variable as a parameter\n */\nexport default function gradientFunction(data, evaluatedData, params, gradientDifference, paramFunction, centralDifference) {\n    const nbParams = params.length;\n    const nbPoints = data.x.length;\n    const ans = Matrix.zeros(nbParams, nbPoints);\n    let rowIndex = 0;\n    for (let param = 0; param < nbParams; param++) {\n        if (gradientDifference[param] === 0)\n            continue;\n        let delta = gradientDifference[param];\n        let auxParams = params.slice();\n        auxParams[param] += delta;\n        const funcParam = paramFunction(auxParams);\n        if (!centralDifference) {\n            for (let point = 0; point < nbPoints; point++) {\n                ans.set(rowIndex, point, (evaluatedData[point] - funcParam(data.x[point])) / delta);\n            }\n        }\n        else {\n            auxParams = params.slice();\n            auxParams[param] -= delta;\n            delta *= 2;\n            const funcParam2 = paramFunction(auxParams);\n            for (let point = 0; point < nbPoints; point++) {\n                ans.set(rowIndex, point, (funcParam2(data.x[point]) - funcParam(data.x[point])) / delta);\n            }\n        }\n        rowIndex++;\n    }\n    return ans;\n}\n//# sourceMappingURL=gradient_function.js.map","import { inverse, Matrix } from 'ml-matrix';\nimport gradientFunction from \"./gradient_function.js\";\n/**\n * Matrix function over the samples\n *\n * @param data - Array of points to fit in the format [x1, x2, ... ], [y1, y2, ... ]\n * @param evaluatedData - Array of previous evaluated function values\n */\nfunction matrixFunction(data, evaluatedData) {\n    const m = data.x.length;\n    const ans = new Matrix(m, 1);\n    for (let point = 0; point < m; point++) {\n        ans.set(point, 0, data.y[point] - evaluatedData[point]);\n    }\n    return ans;\n}\n/**\n * Iteration for Levenberg-Marquardt\n *\n * @param data - Array of points to fit in the format [x1, x2, ... ], [y1, y2, ... ]\n * @param params - Array of previous parameter values\n * @param damping - Levenberg-Marquardt parameter\n * @param gradientDifference - The step size to approximate the jacobian matrix\n * @param centralDifference - If true the jacobian matrix is approximated by central differences otherwise by forward differences\n * @param parameterizedFunction - The parameters and returns a function with the independent variable as a parameter\n * @param weights - scale the gradient and residual error by weights\n */\nexport default function step(data, params, damping, gradientDifference, parameterizedFunction, centralDifference, weights) {\n    const identity = Matrix.eye(params.length, params.length, damping);\n    const func = parameterizedFunction(params);\n    const evaluatedData = new Float64Array(data.x.length);\n    for (let i = 0; i < data.x.length; i++) {\n        evaluatedData[i] = func(data.x[i]);\n    }\n    const gradientFunc = gradientFunction(data, evaluatedData, params, gradientDifference, parameterizedFunction, centralDifference);\n    const residualError = matrixFunction(data, evaluatedData);\n    const inverseMatrix = inverse(identity.add(gradientFunc.mmul(gradientFunc.transpose().scale('row', { scale: weights }))));\n    const jacobianWeightResidualError = gradientFunc.mmul(residualError.scale('row', { scale: weights }));\n    const perturbations = inverseMatrix.mmul(jacobianWeightResidualError);\n    return {\n        perturbations,\n        jacobianWeightResidualError,\n    };\n}\n//# sourceMappingURL=step.js.map","import checkOptions from \"./check_options.js\";\nimport errorCalculation from \"./error_calculation.js\";\nimport step from \"./step.js\";\n/**\n * Curve fitting algorithm\n * @param data - Array of points to fit in the format [x1, x2, ... ], [y1, y2, ... ]\n * @param parameterizedFunction - Takes an array of parameters and returns a function with the independent variable as its sole argument\n * @param options - Options object\n */\nexport function levenbergMarquardt(data, parameterizedFunction, options) {\n    const checkedOptions = checkOptions(data, options);\n    const { checkTimeout, minValues, maxValues, parameters, weightSquare, dampingStepUp, dampingStepDown, maxIterations, errorTolerance, centralDifference, gradientDifference, improvementThreshold, } = checkedOptions;\n    let damping = checkedOptions.damping;\n    let error = errorCalculation(data, parameters, parameterizedFunction, weightSquare);\n    let optimalError = error;\n    let optimalParameters = parameters.slice();\n    let converged = error <= errorTolerance;\n    let iteration = 0;\n    for (; iteration < maxIterations && !converged; iteration++) {\n        const previousError = error;\n        const { perturbations, jacobianWeightResidualError } = step(data, parameters, damping, gradientDifference, parameterizedFunction, centralDifference, weightSquare);\n        for (let k = 0; k < parameters.length; k++) {\n            parameters[k] = Math.min(Math.max(minValues[k], parameters[k] - perturbations.get(k, 0)), maxValues[k]);\n        }\n        error = errorCalculation(data, parameters, parameterizedFunction, weightSquare);\n        if (isNaN(error))\n            break;\n        if (error < optimalError - errorTolerance) {\n            optimalError = error;\n            optimalParameters = parameters.slice();\n        }\n        const improvementMetric = (previousError - error) /\n            perturbations\n                .transpose()\n                .mmul(perturbations.mul(damping).add(jacobianWeightResidualError))\n                .get(0, 0);\n        if (improvementMetric > improvementThreshold) {\n            damping = Math.max(damping / dampingStepDown, 1e-7);\n        }\n        else {\n            damping = Math.min(damping * dampingStepUp, 1e7);\n        }\n        if (checkTimeout()) {\n            throw new Error(`The execution time is over to ${options.timeout} seconds`);\n        }\n        converged = error <= errorTolerance;\n    }\n    return {\n        parameterValues: optimalParameters,\n        parameterError: optimalError,\n        iterations: iteration,\n    };\n}\n//# sourceMappingURL=levenberg_marquardt.js.map","/**\n * Preparata, F. P., & Shamos, M. I. (2012). Computational geometry: an introduction. Springer Science & Business Media.\n * @param {Array} x - The array with x coordinates of the points.\n * @param {Array} y - The array with y coordinates of the points.\n * @return {Array} The indices of the points of anticlockwise lower convex hull\n * @private\n */\nexport default function antiLowerConvexHull(x, y) {\n  if (x.length !== y.length) {\n    throw new RangeError('X and Y vectors has different dimensions');\n  }\n\n  const nbPoints = x.length - 1;\n  if (nbPoints === 0) return [0];\n  if (nbPoints === 1) return [0, 1];\n\n  let currentPoint = 0;\n  let result = new Array(x.length).fill(true);\n  while (true) {\n    const a = currentPoint;\n    const b = moveOn(currentPoint, nbPoints, result);\n    const c = moveOn(moveOn(currentPoint, nbPoints, result), nbPoints, result);\n\n    const det =\n      x[c] * (y[a] - y[b]) + x[a] * (y[b] - y[c]) + x[b] * (y[c] - y[a]);\n\n    const leftTurn = det >= 0;\n\n    if (leftTurn) {\n      currentPoint = b;\n    } else {\n      result[b] = false;\n      currentPoint = moveBack(currentPoint, nbPoints, result);\n    }\n    if (c === nbPoints) break;\n  }\n\n  return result\n    .map((item, index) => (item === false ? false : index))\n    .filter((item) => item !== false);\n}\n\n/**\n * @param {number} currentPoint - The index of the current point to make the move\n * @param {number} nbPoints - The total number of points in the array\n * @param {Array} vector - The array with the points\n * @return {number} the index of the point after the move\n * @private\n */\n\nfunction moveBack(currentPoint, nbPoints, vector) {\n  let counter = currentPoint - 1;\n  while (vector[counter] === false) counter--;\n  return currentPoint === 0 ? nbPoints : counter;\n}\n\nfunction moveOn(currentPoint, nbPoints, vector) {\n  let counter = currentPoint + 1;\n  while (vector[counter] === false) counter++;\n  return currentPoint === nbPoints ? 0 : counter;\n}\n","import { xNorm, xMaxValue, xMinValue } from 'ml-spectra-processing';\n\nimport antiLowerConvexHull from './util/antiLowerConvexHull';\n\n/**\n * Performs a global optimization of required parameters\n * It will return an object containing:\n * - `minFunctionValue`: The minimum value found for the objetive function\n * - `optima`: Array of Array of values for all the variables where the function reach its minimum value\n * - `iterations`: Number of iterations performed in the process\n * - `finalState`: Internal state allowing to continue optimization (initialState)\n * @param {function} objectiveFunction Function to evaluate. It should accept an array of variables\n * @param {Array} lowerBoundaries Array containing for each variable the lower boundary\n * @param {Array} upperBoundaries Array containing for each variable the higher boundary\n * @param {Object} [options={}]\n * @param {number} [options.iterations] - Number of iterations.\n * @param {number} [options.epsilon] - Tolerance to choose best current value.\n * @param {number} [options.tolerance] - Minimum tollerance of the function.\n * @param {number} [options.tolerance2] - Minimum tollerance of the function.\n * @param {Object} [options.initialState={}}] - finalState of previous optimization.\n * @return {Object} {finalState, iterations, minFunctionValue}\n * */\n\nexport default function direct(\n  objectiveFunction,\n  lowerBoundaries,\n  upperBoundaries,\n  options = {},\n) {\n  const {\n    iterations = 50,\n    epsilon = 1e-4,\n    tolerance = 1e-16,\n    tolerance2 = 1e-12,\n    initialState = {},\n  } = options;\n\n  if (\n    objectiveFunction === undefined ||\n    lowerBoundaries === undefined ||\n    upperBoundaries === undefined\n  ) {\n    throw new RangeError('There is something undefined');\n  }\n\n  lowerBoundaries = new Float64Array(lowerBoundaries);\n  upperBoundaries = new Float64Array(upperBoundaries);\n\n  if (lowerBoundaries.length !== upperBoundaries.length) {\n    throw new Error(\n      'Lower bounds and Upper bounds for x are not of the same length',\n    );\n  }\n\n  //-------------------------------------------------------------------------\n  //                        STEP 1. Initialization\n  //-------------------------------------------------------------------------\n  let n = lowerBoundaries.length;\n  let diffBorders = upperBoundaries.map((x, i) => x - lowerBoundaries[i]);\n\n  let {\n    numberOfRectangles = 0,\n    totalIterations = 0,\n    unitaryCoordinates = [new Float64Array(n).fill(0.5)],\n    middlePoint = new Float64Array(n).map((value, index) => {\n      return (\n        lowerBoundaries[index] +\n        unitaryCoordinates[0][index] * diffBorders[index]\n      );\n    }),\n    bestCurrentValue = objectiveFunction(middlePoint),\n    fCalls = 1,\n    smallerDistance = 0,\n    edgeSizes = [new Float64Array(n).fill(0.5)],\n    diagonalDistances = [Math.sqrt(n * 0.5 ** 2)],\n    functionValues = [bestCurrentValue],\n    differentDistances = diagonalDistances,\n    smallerValuesByDistance = [bestCurrentValue],\n    choiceLimit = undefined,\n  } = initialState;\n  if (\n    initialState.originalCoordinates &&\n    initialState.originalCoordinates.length > 0\n  ) {\n    bestCurrentValue = xMinValue(functionValues);\n    choiceLimit =\n      epsilon * Math.abs(bestCurrentValue) > 1e-8\n        ? epsilon * Math.abs(bestCurrentValue)\n        : 1e-8;\n\n    smallerDistance = getMinIndex(\n      functionValues,\n      diagonalDistances,\n      choiceLimit,\n      bestCurrentValue,\n    );\n\n    unitaryCoordinates = initialState.originalCoordinates.slice();\n    for (let j = 0; j < unitaryCoordinates.length; j++) {\n      for (let i = 0; i < lowerBoundaries.length; i++) {\n        unitaryCoordinates[j][i] =\n          (unitaryCoordinates[j][i] - lowerBoundaries[i]) / diffBorders[i];\n      }\n    }\n  }\n\n  let iteration = 0;\n  //-------------------------------------------------------------------------\n  //                          Iteration loop\n  //-------------------------------------------------------------------------\n\n  while (iteration < iterations) {\n    //----------------------------------------------------------------------\n    //  STEP 2. Identify the set S of all potentially optimal rectangles\n    //----------------------------------------------------------------------\n\n    let S1 = [];\n    let idx = differentDistances.findIndex(\n      // eslint-disable-next-line no-loop-func\n      (e) => e === diagonalDistances[smallerDistance],\n    );\n    let counter = 0;\n    for (let i = idx; i < differentDistances.length; i++) {\n      for (let f = 0; f < functionValues.length; f++) {\n        if (\n          (functionValues[f] === smallerValuesByDistance[i]) &\n          (diagonalDistances[f] === differentDistances[i])\n        ) {\n          S1[counter++] = f;\n        }\n      }\n    }\n\n    let optimumValuesIndex, S3;\n    if (differentDistances.length - idx > 1) {\n      let a1 = diagonalDistances[smallerDistance];\n      let b1 = functionValues[smallerDistance];\n      let a2 = differentDistances[differentDistances.length - 1];\n      let b2 = smallerValuesByDistance[differentDistances.length - 1];\n      let slope = (b2 - b1) / (a2 - a1);\n      let constant = b1 - slope * a1;\n      let S2 = new Uint32Array(counter);\n      counter = 0;\n      for (let i = 0; i < S2.length; i++) {\n        let j = S1[i];\n        if (\n          functionValues[j] <=\n          slope * diagonalDistances[j] + constant + tolerance2\n        ) {\n          S2[counter++] = j;\n        }\n      }\n\n      let xHull = [];\n      let yHull = [];\n      for (let i = 0; i < counter; i++) {\n        xHull.push(diagonalDistances[S2[i]]);\n        yHull.push(functionValues[S2[i]]);\n      }\n\n      let lowerIndexHull = antiLowerConvexHull(xHull, yHull);\n\n      S3 = [];\n      for (let i = 0; i < lowerIndexHull.length; i++) {\n        S3.push(S2[lowerIndexHull[i]]);\n      }\n    } else {\n      S3 = S1.slice(0, counter);\n    }\n    optimumValuesIndex = S3;\n    //--------------------------------------------------------------\n    // STEPS 3,5: Select any rectangle j in S\n    //--------------------------------------------------------------\n    for (let k = 0; k < optimumValuesIndex.length; k++) {\n      let j = optimumValuesIndex[k];\n      let largerSide = xMaxValue(edgeSizes[j]);\n      let largeSidesIndex = new Uint32Array(edgeSizes[j].length);\n      counter = 0;\n      for (let i = 0; i < edgeSizes[j].length; i++) {\n        if (Math.abs(edgeSizes[j][i] - largerSide) < tolerance) {\n          largeSidesIndex[counter++] = i;\n        }\n      }\n      let delta = (2 * largerSide) / 3;\n      let bestFunctionValues = [];\n      for (let r = 0; r < counter; r++) {\n        let i = largeSidesIndex[r];\n        let firstMiddleCenter = unitaryCoordinates[j].slice();\n        let secondMiddleCenter = unitaryCoordinates[j].slice();\n        firstMiddleCenter[i] += delta;\n        secondMiddleCenter[i] -= delta;\n        let firstMiddleValue = new Float64Array(firstMiddleCenter.length);\n        let secondMiddleValue = new Float64Array(secondMiddleCenter.length);\n        for (let i = 0; i < firstMiddleCenter.length; i++) {\n          firstMiddleValue[i] =\n            lowerBoundaries[i] + firstMiddleCenter[i] * diffBorders[i];\n          secondMiddleValue[i] =\n            lowerBoundaries[i] + secondMiddleCenter[i] * diffBorders[i];\n        }\n        let firstMinValue = objectiveFunction(firstMiddleValue);\n        let secondMinValue = objectiveFunction(secondMiddleValue);\n        fCalls += 2;\n        bestFunctionValues.push({\n          minValue: Math.min(firstMinValue, secondMinValue),\n          index: r,\n        });\n        // [Math.min(firstMinValue, secondMinValue), r];\n        unitaryCoordinates.push(firstMiddleCenter, secondMiddleCenter);\n        functionValues.push(firstMinValue, secondMinValue);\n      }\n\n      let b = bestFunctionValues.sort((a, b) => a.minValue - b.minValue);\n      for (let r = 0; r < counter; r++) {\n        let u = largeSidesIndex[b[r].index];\n        let ix1 = numberOfRectangles + 2 * (b[r].index + 1) - 1;\n        let ix2 = numberOfRectangles + 2 * (b[r].index + 1);\n        edgeSizes[j][u] = delta / 2;\n        edgeSizes[ix1] = edgeSizes[j].slice();\n        edgeSizes[ix2] = edgeSizes[j].slice();\n        diagonalDistances[j] = xNorm(edgeSizes[j]);\n        diagonalDistances[ix1] = diagonalDistances[j];\n        diagonalDistances[ix2] = diagonalDistances[j];\n      }\n      numberOfRectangles += 2 * counter;\n    }\n\n    //--------------------------------------------------------------\n    //                  Update\n    //--------------------------------------------------------------\n\n    bestCurrentValue = xMinValue(functionValues);\n\n    choiceLimit =\n      epsilon * Math.abs(bestCurrentValue) > 1e-8\n        ? epsilon * Math.abs(bestCurrentValue)\n        : 1e-8;\n\n    smallerDistance = getMinIndex(\n      functionValues,\n      diagonalDistances,\n      choiceLimit,\n      bestCurrentValue,\n      iteration,\n    );\n\n    differentDistances = Array.from(new Set(diagonalDistances));\n    differentDistances = differentDistances.sort((a, b) => a - b);\n\n    smallerValuesByDistance = [];\n    for (let i = 0; i < differentDistances.length; i++) {\n      let minIndex;\n      let minValue = Number.POSITIVE_INFINITY;\n      for (let k = 0; k < diagonalDistances.length; k++) {\n        if (diagonalDistances[k] === differentDistances[i]) {\n          if (functionValues[k] < minValue) {\n            minValue = functionValues[k];\n            minIndex = k;\n          }\n        }\n      }\n      smallerValuesByDistance.push(functionValues[minIndex]);\n    }\n\n    let currentMin = [];\n    for (let j = 0; j < functionValues.length; j++) {\n      if (functionValues[j] === bestCurrentValue) {\n        let temp = [];\n        for (let i = 0; i < lowerBoundaries.length; i++) {\n          temp.push(\n            lowerBoundaries[i] + unitaryCoordinates[j][i] * diffBorders[i],\n          );\n        }\n        currentMin.push(temp);\n      }\n    }\n    iteration += 1;\n  }\n  //--------------------------------------------------------------\n  //                  Saving results\n  //--------------------------------------------------------------\n\n  let result = {};\n  result.minFunctionValue = bestCurrentValue;\n  result.iterations = iteration;\n  let originalCoordinates = [];\n  for (let j = 0; j < numberOfRectangles + 1; j++) {\n    let pair = [];\n    for (let i = 0; i < lowerBoundaries.length; i++) {\n      pair.push(lowerBoundaries[i] + unitaryCoordinates[j][i] * diffBorders[i]);\n    }\n    originalCoordinates.push(pair);\n  }\n\n  result.finalState = {\n    numberOfRectangles,\n    totalIterations: (totalIterations += iterations),\n    originalCoordinates,\n    middlePoint,\n    fCalls,\n    smallerDistance,\n    edgeSizes,\n    diagonalDistances,\n    functionValues,\n    differentDistances,\n    smallerValuesByDistance,\n    choiceLimit,\n  };\n\n  let minimizer = [];\n  for (let i = 0; i < functionValues.length; i++) {\n    if (functionValues[i] === bestCurrentValue) {\n      minimizer.push(originalCoordinates[i]);\n    }\n  }\n\n  result.optima = minimizer;\n  return result;\n}\n\nfunction getMinIndex(\n  functionValues,\n  diagonalDistances,\n  choiceLimit,\n  bestCurrentValue,\n) {\n  let item = [];\n  for (let i = 0; i < functionValues.length; i++) {\n    item[i] =\n      Math.abs(functionValues[i] - (bestCurrentValue + choiceLimit)) /\n      diagonalDistances[i];\n  }\n  const min = xMinValue(item);\n  let result = item.findIndex((x) => x === min);\n  return result;\n}\n","import direct from 'ml-direct';\nexport function directOptimization(data, sumOfShapes, options) {\n    const { minValues, maxValues, maxIterations, epsilon, tolerance, tolerance2, initialState, } = options;\n    const objectiveFunction = getObjectiveFunction(data, sumOfShapes);\n    const result = direct(objectiveFunction, \n    // direct internally converts ArrayLike to Float64Array,\n    // so we can safely cast minValues and maxValues to number[]\n    minValues, maxValues, {\n        iterations: maxIterations,\n        epsilon,\n        tolerance,\n        tolerance2,\n        initialState,\n    });\n    const { optima } = result;\n    return {\n        parameterError: result.minFunctionValue,\n        iterations: result.iterations,\n        parameterValues: optima[0],\n    };\n}\nfunction getObjectiveFunction(data, sumOfShapes) {\n    const { x, y } = data;\n    const nbPoints = x.length;\n    return (parameters) => {\n        const fct = sumOfShapes(parameters);\n        let error = 0;\n        for (let i = 0; i < nbPoints; i++) {\n            error += (y[i] - fct(x[i])) ** 2;\n        }\n        return error;\n    };\n}\n//# sourceMappingURL=directOptimization.js.map","import { levenbergMarquardt } from 'ml-levenberg-marquardt';\nimport { directOptimization } from \"./wrappers/directOptimization.js\";\n/** Algorithm to select the method.\n * @param optimizationOptions - Optimization options\n * @returns - The algorithm and optimization options\n */\nexport function selectMethod(optimizationOptions = {}) {\n    const { kind = 'lm', options } = optimizationOptions;\n    switch (kind) {\n        case 'lm':\n        case 'levenbergMarquardt':\n            return {\n                algorithm: levenbergMarquardt,\n                optimizationOptions: {\n                    damping: 1.5,\n                    maxIterations: 100,\n                    errorTolerance: 1e-8,\n                    ...options,\n                },\n            };\n        case 'direct': {\n            return {\n                algorithm: directOptimization,\n                optimizationOptions: {\n                    iterations: 20,\n                    epsilon: 1e-4,\n                    tolerance: 1e-16,\n                    tolerance2: 1e-12,\n                    initialState: {},\n                    ...options,\n                },\n            };\n        }\n        default:\n            throw new Error(`Unknown fitting algorithm`);\n    }\n}\n//# sourceMappingURL=selectMethod.js.map","import { xMaxAbsoluteValue } from 'ml-spectra-processing';\nimport { getSumOfShapes } from \"./shapes/getSumOfShapes.js\";\nimport { getFixedParametersResult } from \"./util/getFixedParametersResult.js\";\nimport { getGlobalParameterVectors } from \"./util/getGlobalParameterVectors.js\";\nimport { getInternalPeaks } from \"./util/internalPeaks/getInternalPeaks.js\";\nimport { selectMethod } from \"./util/selectMethod.js\";\n/**\n * Fits a set of points to the sum of a set of bell functions.\n *\n * @param data - An object containing the x and y data to be fitted.\n * @param peaks - A list of initial parameters to be optimized. e.g. coming from a peak picking [{x, y, width}].\n * @param options - Options for optimize\n * @returns - An object with fitting error and the list of optimized parameters { parameters: [ {x, y, width} ], error } if the kind of shape is pseudoVoigt mu parameter is optimized.\n */\nexport function optimize(data, peaks, options = {}) {\n    // rescale data so the maximum Y value becomes 1\n    const max = xMaxAbsoluteValue(data.y);\n    const yScale = max === 0 ? 1 : max;\n    const internalPeaks = getInternalPeaks(peaks, yScale, options);\n    // need to rescale what is related to Y\n    const normalizedY = new Float64Array(data.y.length);\n    for (let i = 0; i < data.y.length; i++) {\n        normalizedY[i] = data.y[i] / yScale;\n    }\n    const { freeIndices, globalMin, globalMax, globalInit, globalGrad } = getGlobalParameterVectors(internalPeaks, peaks, options);\n    const nbParams = globalInit.length;\n    const { algorithm, optimizationOptions } = selectMethod(options.optimization);\n    const baseSumOfShapes = getSumOfShapes(internalPeaks);\n    if (freeIndices.length === 0) {\n        return getFixedParametersResult(internalPeaks, normalizedY, data.x, globalInit, baseSumOfShapes, yScale);\n    }\n    // prepare arrays to pass to the algorithm (reduced if needed)\n    let minValues;\n    let maxValues;\n    let initialValues;\n    let gradientDifferences;\n    let sumOfShapesToUse = baseSumOfShapes;\n    if (freeIndices.length === nbParams) {\n        // nothing to reduce\n        minValues = globalMin;\n        maxValues = globalMax;\n        initialValues = globalInit;\n        gradientDifferences = globalGrad;\n    }\n    else {\n        // wrapper that maps reduced (free) parameters into the full parameter vector\n        const sumOfShapesForReduced = (reducedParameters) => {\n            const full = new Float64Array(nbParams);\n            full.set(globalInit);\n            for (let k = 0; k < freeIndices.length; k++) {\n                full[freeIndices[k]] = reducedParameters[k];\n            }\n            return baseSumOfShapes(Array.from(full));\n        };\n        minValues = new Float64Array(freeIndices.length);\n        maxValues = new Float64Array(freeIndices.length);\n        initialValues = new Float64Array(freeIndices.length);\n        gradientDifferences = new Float64Array(freeIndices.length);\n        for (let j = 0; j < freeIndices.length; j++) {\n            const i = freeIndices[j];\n            minValues[j] = globalMin[i];\n            maxValues[j] = globalMax[i];\n            initialValues[j] = globalInit[i];\n            gradientDifferences[j] = globalGrad[i];\n        }\n        sumOfShapesToUse = sumOfShapesForReduced;\n    }\n    const fitted = algorithm({ x: data.x, y: normalizedY }, sumOfShapesToUse, {\n        minValues,\n        maxValues,\n        initialValues,\n        gradientDifference: gradientDifferences,\n        ...optimizationOptions,\n    });\n    // reconstruct full parameter vector\n    let fittedValues;\n    if (freeIndices.length === nbParams) {\n        fittedValues = fitted.parameterValues;\n    }\n    else {\n        const full = Array.from(globalInit);\n        for (let k = 0; k < freeIndices.length; k++) {\n            full[freeIndices[k]] = fitted.parameterValues[k];\n        }\n        fittedValues = full;\n    }\n    const newPeaks = [];\n    for (const peak of internalPeaks) {\n        const { id, shape, parameters, fromIndex } = peak;\n        let newPeak = { x: 0, y: 0, shape };\n        if (id) {\n            newPeak = { ...newPeak, id };\n        }\n        newPeak.x = fittedValues[fromIndex];\n        newPeak.y = fittedValues[fromIndex + 1] * yScale;\n        for (let i = 2; i < parameters.length; i++) {\n            //@ts-expect-error should be fixed once\n            newPeak.shape[parameters[i]] = fittedValues[fromIndex + i];\n        }\n        newPeaks.push(newPeak);\n    }\n    return {\n        error: fitted.parameterError,\n        iterations: fitted.iterations,\n        peaks: newPeaks,\n    };\n}\n//# sourceMappingURL=index.js.map","import { getShape1D } from 'ml-peak-shape-generator';\n/**\n * Add a `shape` property to peaks that do not have one.\n * If a peak already has a `shape` but no `fwhm`, the FWHM is computed from `peak.width`.\n * @param peaks - Peaks with a `width` property.\n * @param options - Shape options.\n * @returns A peak list where every peak has a `shape` property.\n */\nexport function addMissingShape(peaks, options = {}) {\n    const { shape = { kind: 'gaussian' }, output = structuredClone(peaks) } = options;\n    const defaultShapeInstance = getShape1D(shape);\n    return output.map((peak) => {\n        if (hasShape(peak)) {\n            if (!('fwhm' in peak.shape)) {\n                peak.shape.fwhm = getShape1D(peak.shape).widthToFWHM(peak.width);\n            }\n            return peak;\n        }\n        return {\n            ...peak,\n            shape: {\n                fwhm: defaultShapeInstance.widthToFWHM(peak.width),\n                ...shape,\n            },\n        };\n    });\n}\nfunction hasShape(peak) {\n    return 'shape' in peak;\n}\n//# sourceMappingURL=addMissingShape.js.map","/**\n * Group peaks based on a width-aware factor.\n * Only `x` and `width` are used, so the current implementation does not take\n * peak asymmetry into account.\n * @param peaks - Peaks with `x` and `width` properties.\n * @param options - Grouping options.\n * @returns Groups of peaks sorted by ascending `x`.\n */\nexport function groupPeaks(peaks, options = {}) {\n    if (peaks.length === 0)\n        return [];\n    const { factor = 1 } = options;\n    const sortedPeaks = peaks.toSorted((a, b) => a.x - b.x);\n    let previousPeak = sortedPeaks[0];\n    let currentGroup = [previousPeak];\n    const groups = [currentGroup];\n    for (let i = 1; i < sortedPeaks.length; i++) {\n        const peak = sortedPeaks[i];\n        if ((peak.x - previousPeak.x) / ((peak.width + previousPeak.width) / 2) <=\n            factor) {\n            currentGroup.push(peak);\n        }\n        else {\n            currentGroup = [peak];\n            groups.push(currentGroup);\n        }\n        previousPeak = peak;\n    }\n    return groups;\n}\n//# sourceMappingURL=groupPeaks.js.map","import { getShape1D } from 'ml-peak-shape-generator';\nimport { optimize } from 'ml-spectra-fitting';\nimport { xGetFromToIndex } from 'ml-spectra-processing';\nimport { addMissingShape } from \"../utils/addMissingShape.js\";\nimport { groupPeaks } from \"../utils/groupPeaks.js\";\n/**\n * Optimize the position (x), max intensity (y), full width at half maximum (fwhm)\n * and the ratio of gaussian contribution (mu) if it's required.\n * It currently supports three kind of shapes: gaussian, lorentzian and pseudovoigt.\n * Returns both the optimized peaks and per-group diagnostic logs.\n * @param data - An object containing the x and y data to be fitted.\n * @param peakList - A list of initial parameters to be optimized. e.g. coming from a peak picking [{x, y, width}].\n * @param options - Optimization options.\n * @returns An object with the optimized peaks and the per-group logs.\n */\nexport function optimizePeaksWithLogs(data, peakList, options = {}) {\n    const { fromTo = {}, shape = { kind: 'gaussian' }, groupingFactor = 1, factorLimits = 2, parameters, optimization = {\n        kind: 'lm',\n        options: {\n            timeout: 10,\n        },\n    }, } = options;\n    // Optimize peaks in groups: fitting everything at once would be too slow and\n    // have too many free parameters.\n    const groups = groupPeaks(peakList, { factor: groupingFactor });\n    const logs = [];\n    const results = [];\n    for (const peakGroup of groups) {\n        const start = Date.now();\n        const peaks = addMissingShape(peakGroup, { shape });\n        const firstPeak = peaks[0];\n        const lastPeak = peaks.at(-1);\n        const { from = firstPeak.x - firstPeak.width * factorLimits, to = lastPeak.x + lastPeak.width * factorLimits, } = fromTo;\n        const { fromIndex, toIndex } = xGetFromToIndex(data.x, { from, to });\n        const x = data.x instanceof Float64Array\n            ? data.x.subarray(fromIndex, toIndex)\n            : data.x.slice(fromIndex, toIndex);\n        const y = data.y instanceof Float64Array\n            ? data.y.subarray(fromIndex, toIndex)\n            : data.y.slice(fromIndex, toIndex);\n        const log = {\n            range: { from, to },\n            parameters: { optimization, parameters },\n            groupSize: peakGroup.length,\n            time: Date.now() - start,\n        };\n        if (x.length > 5) {\n            const { iterations, error, peaks: optimizedPeaks, } = optimize({ x, y }, peaks, {\n                shape,\n                parameters,\n                optimization,\n            });\n            for (let i = 0; i < peaks.length; i++) {\n                results.push({\n                    ...optimizedPeaks[i],\n                    width: getShape1D(peaks[i].shape).fwhmToWidth(optimizedPeaks[i].shape.fwhm),\n                });\n            }\n            logs.push({\n                ...log,\n                iterations,\n                error,\n                message: 'optimization successful',\n            });\n        }\n        else {\n            results.push(...peaks);\n            logs.push({\n                ...log,\n                iterations: 0,\n                message: 'x length too small for optimization',\n            });\n        }\n    }\n    return { logs, optimizedPeaks: results };\n}\n//# sourceMappingURL=optimizePeaksWithLogs.js.map","import { optimizePeaksWithLogs } from \"./optimizePeaksWithLogs.js\";\n/**\n * Optimize the position (x), max intensity (y), full width at half maximum (fwhm)\n * and the ratio of gaussian contribution (mu) if it's required.\n * @param data - An object containing the x and y data to be fitted.\n * @param peakList - A list of initial parameters to be optimized. e.g. coming from a peak picking [{x, y, width}].\n * @param options - Optimization options.\n * @returns The optimized peaks.\n */\nexport function optimizePeaks(data, peakList, options = {}) {\n    return optimizePeaksWithLogs(data, peakList, options).optimizedPeaks;\n}\n//# sourceMappingURL=optimizePeaks.js.map","/**\n * Assign a random UUID to every peak that does not already have an `id`.\n * @param peaks - Peaks possibly missing an `id`.\n * @param options - Options.\n * @param options.output - Destination array. Defaults to a deep clone of `peaks`.\n * @returns A peak list where every peak has an `id`.\n */\nexport function addMissingIDs(peaks, options = {}) {\n    const { output = structuredClone(peaks) } = options;\n    for (const peak of output) {\n        if (!('id' in peak)) {\n            peak.id = crypto.randomUUID();\n        }\n    }\n    return output;\n}\n//# sourceMappingURL=addMissingIDs.js.map","import { addMissingIDs } from \"../utils/addMissingIDs.js\";\nimport { addMissingShape } from \"../utils/addMissingShape.js\";\nimport { optimizePeaksWithLogs } from \"./optimizePeaksWithLogs.js\";\n/**\n * Join peaks that seem to belong to a broad signal into a single broad peak.\n * @param peakList - Detected peaks, possibly containing fragments of a broad signal.\n * @param options - Join options.\n * @returns The peak list with broad fragments fitted as a single peak.\n */\nexport function joinBroadPeaks(peakList, options = {}) {\n    const { shape = { kind: 'gaussian' }, optimization = { kind: 'lm', options: { timeout: 10 } }, broadWidth = 0.25, broadRatio = 0.0025, } = options;\n    let max = 0;\n    let maxI = 0;\n    let count = 1;\n    const broadLines = [];\n    if (peakList.length < 2) {\n        return addMissingIDs(addMissingShape(peakList.map(getGSDPeakOptimizedStructure), { shape }));\n    }\n    let maxDdy = Math.abs(peakList[0].ddY);\n    for (let i = 1; i < peakList.length; i++) {\n        const absDdy = Math.abs(peakList[i].ddY);\n        if (absDdy > maxDdy)\n            maxDdy = absDdy;\n    }\n    const newPeaks = [];\n    for (const peak of peakList) {\n        if (Math.abs(peak.ddY) <= broadRatio * maxDdy) {\n            broadLines.push(peak);\n        }\n        else {\n            newPeaks.push(getGSDPeakOptimizedStructure(peak));\n        }\n    }\n    // Sentinel: forces the final group to be flushed by the `else` branch below.\n    //@ts-expect-error Sentinel peak, x=+Infinity guarantees the distance check fails.\n    broadLines.push({ x: Number.MAX_VALUE, y: 0 });\n    let candidates = {\n        x: [broadLines[0].x],\n        y: [broadLines[0].y],\n    };\n    let indexes = [0];\n    for (let i = 1; i < broadLines.length; i++) {\n        if (Math.abs(broadLines[i - 1].x - broadLines[i].x) < broadWidth) {\n            candidates.x.push(broadLines[i].x);\n            candidates.y.push(broadLines[i].y);\n            if (broadLines[i].y > max) {\n                max = broadLines[i].y;\n                maxI = i;\n            }\n            indexes.push(i);\n            count++;\n        }\n        else {\n            if (count > 2) {\n                const initialWidth = Math.abs(candidates.x.at(-1) - candidates.x[0]);\n                const { logs, optimizedPeaks } = optimizePeaksWithLogs(candidates, [\n                    {\n                        id: crypto.randomUUID(),\n                        x: broadLines[maxI].x,\n                        y: max,\n                        width: initialWidth,\n                        parameters: {\n                            width: { max: initialWidth * 4, min: initialWidth * 0.8 },\n                        },\n                    },\n                ], { shape: { kind: 'pseudoVoigt' }, optimization });\n                max = 0;\n                maxI = 0;\n                const log = logs.find((l) => l.message === 'optimization successful');\n                if (log?.error !== undefined && log.error < 0.2) {\n                    newPeaks.push(optimizedPeaks[0]);\n                }\n                else {\n                    pushBackPeaks(broadLines, indexes, newPeaks);\n                }\n            }\n            else {\n                pushBackPeaks(broadLines, indexes, newPeaks);\n            }\n            candidates = { x: [broadLines[i].x], y: [broadLines[i].y] };\n            indexes = [i];\n            max = broadLines[i].y;\n            maxI = i;\n            count = 1;\n        }\n    }\n    newPeaks.sort((a, b) => a.x - b.x);\n    return addMissingIDs(newPeaks, { output: newPeaks });\n}\nfunction pushBackPeaks(broadLines, indexes, peaks) {\n    for (const index of indexes) {\n        peaks.push(getGSDPeakOptimizedStructure(broadLines[index]));\n    }\n}\nfunction getGSDPeakOptimizedStructure(peak) {\n    const { id, shape, x, y, width } = peak;\n    const newPeak = {\n        x,\n        y,\n        width,\n        shape,\n    };\n    if (id)\n        newPeak.id = id;\n    return newPeak;\n}\n//# sourceMappingURL=joinBroadPeaks.js.map","import { getShape1D } from 'ml-peak-shape-generator';\n/**\n * Enlarge peaks while preventing overlap between them.\n * A typical application is chromatography peak picking.\n * We should not make the hypothesis that `x` is equidistant, because peaks\n * may not be symmetric once we add the `from` and `to` properties.\n * @param peakList - Peaks to broaden.\n * @param options - Broadening options.\n * @returns The broadened peaks.\n */\nexport function broadenPeaks(peakList, options = {}) {\n    const { factor = 2, overlap = false } = options;\n    const peaks = mapPeaks(peakList, factor);\n    if (!overlap) {\n        for (let i = 0; i < peaks.length - 1; i++) {\n            const peak = peaks[i];\n            const nextPeak = peaks[i + 1];\n            if (peak.to.x > nextPeak.from.x) {\n                // we do it proportional to the width of the peaks\n                peak.to.x =\n                    (peak.width / (nextPeak.width + peak.width)) * (nextPeak.x - peak.x) +\n                        peak.x;\n                nextPeak.from.x = peak.to.x;\n            }\n        }\n    }\n    for (const peak of peaks) {\n        peak.width = peak.to.x - peak.from.x;\n        if (peak.shape) {\n            const { shape, width } = peak;\n            if (shape.fwhm !== undefined) {\n                const shapeFct = getShape1D(shape);\n                shape.fwhm = shapeFct.widthToFWHM(width);\n            }\n        }\n    }\n    return peaks;\n}\nfunction mapPeaks(peaks, factor) {\n    return peaks.map((peak) => {\n        const { id, shape, x, y, index, inflectionPoints } = peak;\n        const xFrom = x - (x - inflectionPoints.from.x) * factor;\n        const xTo = x + (inflectionPoints.to.x - x) * factor;\n        let result = {\n            x,\n            y,\n            index,\n            width: xTo - xFrom,\n            from: { x: xFrom },\n            to: { x: xTo },\n        };\n        if (id) {\n            result = { ...result, id };\n        }\n        if (shape) {\n            result = { ...result, shape };\n        }\n        return result;\n    });\n}\n//# sourceMappingURL=broadenPeaks.js.map","import { getShape1D } from 'ml-peak-shape-generator';\n/**\n * Append a `shape` property (including `fwhm`) to every peak.\n * @param peaks - Peaks with a `width` property.\n * @param options - Shape options.\n * @returns A peak list where every peak has a `shape` property.\n */\nexport function setShape(peaks, options = {}) {\n    const { shape = { kind: 'gaussian' }, output = structuredClone(peaks) } = options;\n    const shapeInstance = getShape1D(shape);\n    return output.map((peak) => ({\n        ...peak,\n        shape: { ...shape, fwhm: shapeInstance.widthToFWHM(peak.width) },\n    }));\n}\n//# sourceMappingURL=setShape.js.map"],"names":["toString","Object","prototype","isAnyArray","value","tag","call","endsWith","includes","sgg","ys","xs","options","windowSize","derivative","polynomial","Number","isInteger","RangeError","TypeError","undefined","length","console","warn","half","Math","floor","np","ans","Float64Array","weights","fullWeights","hs","constantH","i","wg1","wg2","d1","d2","l","getHs","wg","d","h","center","count","gramPoly","m","k","s","Grampoly","genFact","a","b","gf","j","weight","t","n","sum","Array","xMedian","input","exact","array","slice","middleIndex","calcMiddle","median","quickSelect","medianNext","low","high","middle","currentLow","currentHigh","swap","temp","xCheck","minLength","Error","xFindClosestIndex","target","sorted","abs","index","diff","POSITIVE_INFINITY","currentDiff","xGetFromToIndex","x","fromIndex","toIndex","from","to","Matrix","matrix","inverse","xMaxValue","maxValue","xMinValue","minValue","xIsEquallySpaced","tolerance","maxDx","minDx","MAX_SAFE_INTEGER","absoluteDifference","xIsMonotonic","at","xMaxAbsoluteValue","xMedianAbsoluteDeviation","averageDeviations","mad","xMinMaxValues","min","max","xNoiseStandardDeviation","sd","xNorm","result","element","sqrt","getMinMaxIntervalsDy","y","dY","dX","lastMax","lastMin","intervalL","intervalR","push","tryMatchOneIntervalWithMinData","lastK","minData","yThreshold","intervalWidth","intervalCenter","yData","minDistance","possible","newLastIndex","centerIndex","deltaX","currentDistance","lastIndex","autoAlgorithm","ddY","minddY","crossDy","peaks","lastJ","yIndex","match","width","id","crypto","randomUUID","inflectionPoints","getPeakFromIntervals","xGetCrossZeroPoints","isLessAndGreaterThanZero","back","next","firstDerivative","secondDerivative","optimizeTop","data","peak","currentIndex","alpha","log10","beta","gamma","p","xCurrent","xPrevious","gsd","noiseLevel","sgOptions","smoothY","maxCriteria","maxAbsoluteRatio","minMaxRatio","realTopDetection","peakDetectionAlgorithm","isEquallySpaced","noiseInfo","maxAbsoluteValue","xValue","minY","maxY","peakData","sort","GAUSSIAN_EXP_FACTOR","LN2","ROOT_PI_OVER_LN2","PI","ROOT_THREE","ROOT_2LN2","ROOT_2LN2_MINUS_ONE","erfinv","ln1MinusXSqrd","log","lnEtcBy2Plus2","firstSqrt","secondSqrt","Gaussian","fwhm","constructor","gaussianWidthToFWHM","fwhmToWidth","gaussianFwhmToWidth","widthToFWHM","fct","gaussianFct","getArea","height","calculateGaussianHeight","getGaussianArea","getFactor","area","getGaussianFactor","getData","getGaussianData","calculateHeight","getParameters","exp","shape","factor","ceil","Lorentzian","lorentzianFwhmToWidth","lorentzianWidthToFWHM","lorentzianFct","getLorentzianArea","getLorentzianFactor","getLorentzianData","calculateLorentzianHeight","lorentzianQuantile","tan","halfResidual","LorentzianDispersive","lorentzianDispersiveFct","getLorentzianDispersiveData","pseudoVoigtFindFactor","pTarget","mu","tol","maxIter","lo","hi","it","pPseudoVoigt","mid","val","erf","sign","a1","a2","a3","a4","a5","sqrtLn2","pGaussian","pLorentz","atan","PseudoVoigt","pseudoVoigtFwhmToWidth","pseudoVoigtWidthToFWHM","pseudoVoigtFct","getPseudoVoigtArea","getPseudoVoigtFactor","calculatePseudoVoigtHeight","getPseudoVoigtData","PseudoVoigtTCH","_fwhmG","_fwhmL","_fwhm","_mu","_lorentzianWidthFraction","fwhmG","fwhmL","lorentzianWidthFraction","effectiveFwhm","computeEffectiveWidth","lorentzianFraction","fraction","f","df","GeneralizedLorentzian","generalizedLorentzianFwhmToWidth","generalizedLorentzianWidthToFWHM","generalizedLorentzianFct","getGeneralizedLorentzianArea","getGeneralizedLorentzianFactor","getGeneralizedLorentzianData","calculateGeneralizedLorentzianHeight","u","generalizedLorentzianQuantile","getShape1D","kind","getSumOfShapes","internalPeaks","sumOfShapes","parameters","shapeFctKey","shapeFct","totalY","peakX","getFixedParametersResult","normalizedY","globalInit","baseSumOfShapes","yScale","fittedValues","newPeaks","newPeak","error","iterations","getGlobalParameterVectors","nbParams","globalMin","globalMax","globalGrad","isOptimizable","pIndex","paramName","propertiesValues","init","gradientDifference","optimizeFlag","perPeakParam","globalParam","optimize","freeIndices","assert","message","DefaultParameters","peakShape","properties","getInternalPeaks","normalizedPeaks","map","parameter","property","propertyValue","getNormalizedValue","generalParameterValue","defaultParameterValues","checkOptions","timeout","initialValues","damping","dampingStepUp","dampingStepDown","maxIterations","errorTolerance","centralDifference","improvementThreshold","minValues","maxValues","parLen","fill","MIN_SAFE_INTEGER","gradientDifferenceArray","getGradientDifferenceArray","filler","getFiller","checkTimeout","getCheckTimeout","weightSquare","_","dataLength","endTime","Date","now","errorCalculation","parameterizedFunction","func","gradientFunction","evaluatedData","params","paramFunction","nbPoints","zeros","rowIndex","param","delta","auxParams","funcParam","point","set","funcParam2","matrixFunction","step","identity","eye","gradientFunc","residualError","inverseMatrix","add","mmul","transpose","scale","jacobianWeightResidualError","perturbations","levenbergMarquardt","checkedOptions","optimalError","optimalParameters","converged","iteration","previousError","get","isNaN","improvementMetric","mul","parameterValues","parameterError","antiLowerConvexHull","currentPoint","moveOn","c","det","leftTurn","moveBack","item","filter","vector","counter","direct","objectiveFunction","lowerBoundaries","upperBoundaries","epsilon","tolerance2","initialState","diffBorders","numberOfRectangles","totalIterations","unitaryCoordinates","middlePoint","bestCurrentValue","fCalls","smallerDistance","edgeSizes","diagonalDistances","functionValues","differentDistances","smallerValuesByDistance","choiceLimit","originalCoordinates","getMinIndex","S1","idx","findIndex","e","optimumValuesIndex","S3","b1","b2","slope","constant","S2","Uint32Array","xHull","yHull","lowerIndexHull","largerSide","largeSidesIndex","bestFunctionValues","r","firstMiddleCenter","secondMiddleCenter","firstMiddleValue","secondMiddleValue","firstMinValue","secondMinValue","ix1","ix2","Set","minIndex","minFunctionValue","pair","finalState","minimizer","optima","directOptimization","getObjectiveFunction","selectMethod","optimizationOptions","algorithm","optimization","gradientDifferences","sumOfShapesToUse","sumOfShapesForReduced","reducedParameters","full","fitted","addMissingShape","output","structuredClone","defaultShapeInstance","hasShape","groupPeaks","sortedPeaks","toSorted","previousPeak","currentGroup","groups","optimizePeaksWithLogs","peakList","fromTo","groupingFactor","factorLimits","logs","results","peakGroup","start","firstPeak","lastPeak","subarray","range","groupSize","time","optimizedPeaks","optimizePeaks","addMissingIDs","joinBroadPeaks","broadWidth","broadRatio","maxI","broadLines","getGSDPeakOptimizedStructure","maxDdy","absDdy","MAX_VALUE","candidates","indexes","initialWidth","find","pushBackPeaks","broadenPeaks","overlap","mapPeaks","nextPeak","xFrom","xTo","setShape","shapeInstance"],"mappings":";;;;;;;AAAA;AACA,MAAMA,UAAQ,GAAGC,MAAM,CAACC,SAAS,CAACF,QAAQ;AAc1C;;;;;AAKM,SAAUG,YAAUA,CAACC,KAAc,EAAA;AACvC,EAAA,MAAMC,GAAG,GAAGL,UAAQ,CAACM,IAAI,CAACF,KAAK,CAAC;AAChC,EAAA,OAAOC,GAAG,CAACE,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAACF,GAAG,CAACG,QAAQ,CAAC,KAAK,CAAC;AACvD;;ACLA;;;;;;;AAOM,SAAUC,GAAGA,CACjBC,EAAe,EACfC,EAAwB,EACxBC,OAAA,GAAsB,EAAE,EAAA;EAExB,MAAM;AAAEC,IAAAA,UAAU,GAAG,CAAC;AAAEC,IAAAA,UAAU,GAAG,CAAC;AAAEC,IAAAA,UAAU,GAAG;AAAC,GAAE,GAAGH,OAAO;AAElE,EAAA,IAAIC,UAAU,GAAG,CAAC,KAAK,CAAC,IAAIA,UAAU,GAAG,CAAC,IAAI,CAACG,MAAM,CAACC,SAAS,CAACJ,UAAU,CAAC,EAAE;AAC3E,IAAA,MAAM,IAAIK,UAAU,CAClB,mEAAmE,CACpE;AACH,EAAA;AACA,EAAA,IAAI,CAACf,YAAU,CAACO,EAAE,CAAC,EAAE;AACnB,IAAA,MAAM,IAAIS,SAAS,CAAC,2BAA2B,CAAC;AAClD,EAAA;EACA,IAAIR,EAAE,KAAKS,SAAS,EAAE;AACpB,IAAA,MAAM,IAAID,SAAS,CAAC,mBAAmB,CAAC;AAC1C,EAAA;AACA,EAAA,IAAIN,UAAU,GAAGH,EAAE,CAACW,MAAM,EAAE;IAC1B,MAAM,IAAIH,UAAU,CAClB,CAAA,2CAAA,EAA8CL,UAAU,IAAIH,EAAE,CAACW,MAAM,CAAA,CAAE,CACxE;AACH,EAAA;EACA,IAAIP,UAAU,GAAG,CAAC,IAAI,CAACE,MAAM,CAACC,SAAS,CAACH,UAAU,CAAC,EAAE;AACnD,IAAA,MAAM,IAAII,UAAU,CAAC,yCAAyC,CAAC;AACjE,EAAA;EACA,IAAIH,UAAU,GAAG,CAAC,IAAI,CAACC,MAAM,CAACC,SAAS,CAACF,UAAU,CAAC,EAAE;AACnD,IAAA,MAAM,IAAIG,UAAU,CAAC,yCAAyC,CAAC;AACjE,EAAA;EACA,IAAIH,UAAU,IAAI,CAAC,EAAE;AACnB;AACAO,IAAAA,OAAO,CAACC,IAAI,CACV,8DAA8D,GAC5D,6FAA6F,CAChG;AACH,EAAA;EAEA,MAAMC,IAAI,GAAGC,IAAI,CAACC,KAAK,CAACb,UAAU,GAAG,CAAC,CAAC;AACvC,EAAA,MAAMc,EAAE,GAAGjB,EAAE,CAACW,MAAM;AACpB,EAAA,MAAMO,GAAG,GAAG,IAAIC,YAAY,CAACF,EAAE,CAAC;EAChC,MAAMG,OAAO,GAAGC,WAAW,CAAClB,UAAU,EAAEE,UAAU,EAAED,UAAU,CAAC;EAC/D,IAAIkB,EAAE,GAAG,CAAC;EACV,IAAIC,SAAS,GAAG,IAAI;AACpB,EAAA,IAAI9B,YAAU,CAACQ,EAAE,CAAC,EAAE;AAClBsB,IAAAA,SAAS,GAAG,KAAK;AACnB,EAAA,CAAC,MAAM;IACLD,EAAE,GAAGrB,EAAE,IAAIG,UAAU;AACvB,EAAA;AAEA;EACA,KAAK,IAAIoB,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGV,IAAI,EAAEU,CAAC,EAAE,EAAE;IAC7B,MAAMC,GAAG,GAAGL,OAAO,CAACN,IAAI,GAAGU,CAAC,GAAG,CAAC,CAAC;IACjC,MAAME,GAAG,GAAGN,OAAO,CAACN,IAAI,GAAGU,CAAC,GAAG,CAAC,CAAC;IACjC,IAAIG,EAAE,GAAG,CAAC;IACV,IAAIC,EAAE,GAAG,CAAC;IACV,KAAK,IAAIC,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG1B,UAAU,EAAE0B,CAAC,EAAE,EAAE;MACnCF,EAAE,IAAIF,GAAG,CAACI,CAAC,CAAC,GAAG7B,EAAE,CAAC6B,CAAC,CAAC;AACpBD,MAAAA,EAAE,IAAIF,GAAG,CAACG,CAAC,CAAC,GAAG7B,EAAE,CAACiB,EAAE,GAAGd,UAAU,GAAG0B,CAAC,CAAC;AACxC,IAAA;AACA,IAAA,IAAIN,SAAS,EAAE;MACbL,GAAG,CAACJ,IAAI,GAAGU,CAAC,GAAG,CAAC,CAAC,GAAGG,EAAE,GAAGL,EAAE;MAC3BJ,GAAG,CAACD,EAAE,GAAGH,IAAI,GAAGU,CAAC,CAAC,GAAGI,EAAE,GAAGN,EAAE;AAC9B,IAAA,CAAC,MAAM;AACLA,MAAAA,EAAE,GAAGQ,KAAK,CAAC7B,EAAiB,EAAEa,IAAI,GAAGU,CAAC,GAAG,CAAC,EAAEV,IAAI,EAAEV,UAAU,CAAC;MAC7Dc,GAAG,CAACJ,IAAI,GAAGU,CAAC,GAAG,CAAC,CAAC,GAAGG,EAAE,GAAGL,EAAE;AAC3BA,MAAAA,EAAE,GAAGQ,KAAK,CAAC7B,EAAiB,EAAEgB,EAAE,GAAGH,IAAI,GAAGU,CAAC,EAAEV,IAAI,EAAEV,UAAU,CAAC;MAC9Dc,GAAG,CAACD,EAAE,GAAGH,IAAI,GAAGU,CAAC,CAAC,GAAGI,EAAE,GAAGN,EAAE;AAC9B,IAAA;AACF,EAAA;AAEA;AACA,EAAA,MAAMS,EAAE,GAAGX,OAAO,CAACN,IAAI,CAAC;EACxB,KAAK,IAAIU,CAAC,GAAGrB,UAAU,EAAEqB,CAAC,IAAIP,EAAE,EAAEO,CAAC,EAAE,EAAE;IACrC,IAAIQ,CAAC,GAAG,CAAC;IACT,KAAK,IAAIH,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG1B,UAAU,EAAE0B,CAAC,EAAE,EAAEG,CAAC,IAAID,EAAE,CAACF,CAAC,CAAC,GAAG7B,EAAE,CAAC6B,CAAC,GAAGL,CAAC,GAAGrB,UAAU,CAAC;IACxE,IAAI,CAACoB,SAAS,EAAE;AACdD,MAAAA,EAAE,GAAGQ,KAAK,CAAC7B,EAAiB,EAAEuB,CAAC,GAAGV,IAAI,GAAG,CAAC,EAAEA,IAAI,EAAEV,UAAU,CAAC;AAC/D,IAAA;IACAc,GAAG,CAACM,CAAC,GAAGV,IAAI,GAAG,CAAC,CAAC,GAAGkB,CAAC,GAAGV,EAAE;AAC5B,EAAA;AACA,EAAA,OAAOJ,GAAG;AACZ;AAEA,SAASY,KAAKA,CACZG,CAAc,EACdC,MAAc,EACdpB,IAAY,EACZV,UAAkB,EAAA;EAElB,IAAIkB,EAAE,GAAG,CAAC;EACV,IAAIa,KAAK,GAAG,CAAC;AACb,EAAA,KAAK,IAAIX,CAAC,GAAGU,MAAM,GAAGpB,IAAI,EAAEU,CAAC,GAAGU,MAAM,GAAGpB,IAAI,EAAEU,CAAC,EAAE,EAAE;IAClD,IAAIA,CAAC,IAAI,CAAC,IAAIA,CAAC,GAAGS,CAAC,CAACtB,MAAM,GAAG,CAAC,EAAE;MAC9BW,EAAE,IAAIW,CAAC,CAACT,CAAC,GAAG,CAAC,CAAC,GAAGS,CAAC,CAACT,CAAC,CAAC;AACrBW,MAAAA,KAAK,EAAE;AACT,IAAA;AACF,EAAA;AACA,EAAA,OAAO,CAACb,EAAE,GAAGa,KAAK,KAAK/B,UAAU;AACnC;AAEA,SAASgC,QAAQA,CAACZ,CAAS,EAAEa,CAAS,EAAEC,CAAS,EAAEC,CAAS,EAAA;EAC1D,IAAIC,QAAQ,GAAG,CAAC;EAChB,IAAIF,CAAC,GAAG,CAAC,EAAE;AACTE,IAAAA,QAAQ,GACL,CAAC,CAAC,GAAGF,CAAC,GAAG,CAAC,KAAKA,CAAC,IAAI,CAAC,GAAGD,CAAC,GAAGC,CAAC,GAAG,CAAC,CAAC,CAAC,IACjCd,CAAC,GAAGY,QAAQ,CAACZ,CAAC,EAAEa,CAAC,EAAEC,CAAC,GAAG,CAAC,EAAEC,CAAC,CAAC,GAAGA,CAAC,GAAGH,QAAQ,CAACZ,CAAC,EAAEa,CAAC,EAAEC,CAAC,GAAG,CAAC,EAAEC,CAAC,GAAG,CAAC,CAAC,CAAC,GACjE,CAACD,CAAC,GAAG,CAAC,KAAK,CAAC,GAAGD,CAAC,GAAGC,CAAC,CAAC,IAAKA,CAAC,IAAI,CAAC,GAAGD,CAAC,GAAGC,CAAC,GAAG,CAAC,CAAC,CAAC,GAC9CF,QAAQ,CAACZ,CAAC,EAAEa,CAAC,EAAEC,CAAC,GAAG,CAAC,EAAEC,CAAC,CAAC;EAC9B,CAAC,MAAM,IAAID,CAAC,KAAK,CAAC,IAAIC,CAAC,KAAK,CAAC,EAAE;AAC7BC,IAAAA,QAAQ,GAAG,CAAC;AACd,EAAA,CAAC,MAAM;AACLA,IAAAA,QAAQ,GAAG,CAAC;AACd,EAAA;AACA,EAAA,OAAOA,QAAQ;AACjB;AAEA,SAASC,OAAOA,CAACC,CAAS,EAAEC,CAAS,EAAA;EACnC,IAAIC,EAAE,GAAG,CAAC;EACV,IAAIF,CAAC,IAAIC,CAAC,EAAE;AACV,IAAA,KAAK,IAAIE,CAAC,GAAGH,CAAC,GAAGC,CAAC,GAAG,CAAC,EAAEE,CAAC,IAAIH,CAAC,EAAEG,CAAC,EAAE,EAAE;AACnCD,MAAAA,EAAE,IAAIC,CAAC;AACT,IAAA;AACF,EAAA;AACA,EAAA,OAAOD,EAAE;AACX;AAEA,SAASE,MAAMA,CAACtB,CAAS,EAAEuB,CAAS,EAAEV,CAAS,EAAEW,CAAS,EAAET,CAAS,EAAA;EACnE,IAAIU,GAAG,GAAG,CAAC;EACX,KAAK,IAAIX,CAAC,GAAG,CAAC,EAAEA,CAAC,IAAIU,CAAC,EAAEV,CAAC,EAAE,EAAE;IAC3BW,GAAG,IACD,CAAC,CAAC,GAAGX,CAAC,GAAG,CAAC,KACTG,OAAO,CAAC,CAAC,GAAGJ,CAAC,EAAEC,CAAC,CAAC,GAAGG,OAAO,CAAC,CAAC,GAAGJ,CAAC,GAAGC,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG,CAAC,CAAC,CAAC,GACnDF,QAAQ,CAACZ,CAAC,EAAEa,CAAC,EAAEC,CAAC,EAAE,CAAC,CAAC,GACpBF,QAAQ,CAACW,CAAC,EAAEV,CAAC,EAAEC,CAAC,EAAEC,CAAC,CAAC;AACxB,EAAA;AACA,EAAA,OAAOU,GAAG;AACZ;AAEA;;;;;;;AAOA,SAAS5B,WAAWA,CAACgB,CAAS,EAAEW,CAAS,EAAET,CAAS,EAAA;AAClD,EAAA,MAAMnB,OAAO,GAAG,IAAI8B,KAAK,CAACb,CAAC,CAAC;EAC5B,MAAMpB,EAAE,GAAGF,IAAI,CAACC,KAAK,CAACqB,CAAC,GAAG,CAAC,CAAC;AAC5B,EAAA,KAAK,IAAIU,CAAC,GAAG,CAAC9B,EAAE,EAAE8B,CAAC,IAAI9B,EAAE,EAAE8B,CAAC,EAAE,EAAE;IAC9B3B,OAAO,CAAC2B,CAAC,GAAG9B,EAAE,CAAC,GAAG,IAAIE,YAAY,CAACkB,CAAC,CAAC;AACrC,IAAA,KAAK,IAAIQ,CAAC,GAAG,CAAC5B,EAAE,EAAE4B,CAAC,IAAI5B,EAAE,EAAE4B,CAAC,EAAE,EAAE;MAC9BzB,OAAO,CAAC2B,CAAC,GAAG9B,EAAE,CAAC,CAAC4B,CAAC,GAAG5B,EAAE,CAAC,GAAG6B,MAAM,CAACD,CAAC,EAAEE,CAAC,EAAE9B,EAAE,EAAE+B,CAAC,EAAET,CAAC,CAAC;AAClD,IAAA;AACF,EAAA;AACA,EAAA,OAAOnB,OAAO;AAChB;;ACpLA;AACA,MAAM9B,UAAQ,GAAGC,MAAM,CAACC,SAAS,CAACF,QAAQ;AAc1C;;;;;AAKM,SAAUG,YAAUA,CAACC,KAAc,EAAA;AACvC,EAAA,MAAMC,GAAG,GAAGL,UAAQ,CAACM,IAAI,CAACF,KAAK,CAAC;AAChC,EAAA,OAAOC,GAAG,CAACE,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAACF,GAAG,CAACG,QAAQ,CAAC,KAAK,CAAC;AACvD;;ACXA;;;;;;AAMM,SAAUqD,OAAOA,CACrBC,KAAkB,EAClBlD,OAAA,GAA0B,EAAE,EAAA;AAE5B,EAAA,IAAI,CAACT,YAAU,CAAC2D,KAAK,CAAC,EAAE;AACtB,IAAA,MAAM,IAAI3C,SAAS,CAAC,wBAAwB,CAAC;AAC/C,EAAA;AAEA,EAAA,IAAI2C,KAAK,CAACzC,MAAM,KAAK,CAAC,EAAE;AACtB,IAAA,MAAM,IAAIF,SAAS,CAAC,yBAAyB,CAAC;AAChD,EAAA;EAEA,MAAM;AAAE4C,IAAAA,KAAK,GAAG;GAAO,GAAGnD,OAAO,IAAI,EAAE;AACvC,EAAA,MAAMoD,KAAK,GAAGF,KAAK,CAACG,KAAK,EAAE;EAE3B,MAAMC,WAAW,GAAGC,UAAU,CAAC,CAAC,EAAEH,KAAK,CAAC3C,MAAM,GAAG,CAAC,CAAC;AAEnD,EAAA,MAAM+C,MAAM,GAAGC,WAAW,CAACL,KAAK,EAAEE,WAAW,CAAC;EAC9C,IAAIF,KAAK,CAAC3C,MAAM,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC0C,KAAK,EAAE;AACpC,IAAA,OAAOK,MAAM;AACf,EAAA;EACA,MAAME,UAAU,GAAGD,WAAW,CAACL,KAAK,EAAEE,WAAW,GAAG,CAAC,CAAC;AACtD,EAAA,OAAO,CAACE,MAAM,GAAGE,UAAU,IAAI,CAAC;AAClC;AAEA,SAASD,WAAWA,CAACL,KAAkB,EAAEE,WAAmB,EAAA;EAC1D,IAAIK,GAAG,GAAG,CAAC;AACX,EAAA,IAAIC,IAAI,GAAGR,KAAK,CAAC3C,MAAM,GAAG,CAAC;EAC3B,IAAIoD,MAAM,GAAG,CAAC;EACd,IAAIC,UAAU,GAAG,CAAC;EAClB,IAAIC,WAAW,GAAG,CAAC;AACnB,EAAA,OAAO,IAAI,EAAE;IACX,IAAIH,IAAI,IAAID,GAAG,EAAE;MACf,OAAOP,KAAK,CAACE,WAAW,CAAC;AAC3B,IAAA;AAEA,IAAA,IAAIM,IAAI,KAAKD,GAAG,GAAG,CAAC,EAAE;MACpB,IAAIP,KAAK,CAACO,GAAG,CAAC,GAAGP,KAAK,CAACQ,IAAI,CAAC,EAAE;AAC5BI,QAAAA,IAAI,CAACZ,KAAK,EAAEO,GAAG,EAAEC,IAAI,CAAC;AACxB,MAAA;MACA,OAAOR,KAAK,CAACE,WAAW,CAAC;AAC3B,IAAA;AAEA;AACAO,IAAAA,MAAM,GAAGN,UAAU,CAACI,GAAG,EAAEC,IAAI,CAAC;AAC9B,IAAA,IAAIR,KAAK,CAACS,MAAM,CAAC,GAAGT,KAAK,CAACQ,IAAI,CAAC,EAAEI,IAAI,CAACZ,KAAK,EAAES,MAAM,EAAED,IAAI,CAAC;AAC1D,IAAA,IAAIR,KAAK,CAACO,GAAG,CAAC,GAAGP,KAAK,CAACQ,IAAI,CAAC,EAAEI,IAAI,CAACZ,KAAK,EAAEO,GAAG,EAAEC,IAAI,CAAC;AACpD,IAAA,IAAIR,KAAK,CAACS,MAAM,CAAC,GAAGT,KAAK,CAACO,GAAG,CAAC,EAAEK,IAAI,CAACZ,KAAK,EAAES,MAAM,EAAEF,GAAG,CAAC;AAExD;IACAK,IAAI,CAACZ,KAAK,EAAES,MAAM,EAAEF,GAAG,GAAG,CAAC,CAAC;AAE5B;IACAG,UAAU,GAAGH,GAAG,GAAG,CAAC;AACpBI,IAAAA,WAAW,GAAGH,IAAI;AAClB,IAAA,OAAO,IAAI,EAAE;AACX,MAAA,GAAGE,UAAU,EAAE,CAAC,QACTV,KAAK,CAACO,GAAG,CAAC,GAAGP,KAAK,CAACU,UAAU,CAAC;AACrC,MAAA,GAAGC,WAAW,EAAE,CAAC,QACVX,KAAK,CAACW,WAAW,CAAC,GAAGX,KAAK,CAACO,GAAG,CAAC;MAEtC,IAAII,WAAW,GAAGD,UAAU,EAAE;AAC5B,QAAA;AACF,MAAA;AAEAE,MAAAA,IAAI,CAACZ,KAAK,EAAEU,UAAU,EAAEC,WAAW,CAAC;AACtC,IAAA;AAEA;AACAC,IAAAA,IAAI,CAACZ,KAAK,EAAEO,GAAG,EAAEI,WAAW,CAAC;AAE7B;IACA,IAAIA,WAAW,IAAIT,WAAW,EAAE;AAC9BK,MAAAA,GAAG,GAAGG,UAAU;AAClB,IAAA;IACA,IAAIC,WAAW,IAAIT,WAAW,EAAE;MAC9BM,IAAI,GAAGG,WAAW,GAAG,CAAC;AACxB,IAAA;AACF,EAAA;AACF;AAEA,SAASC,IAAIA,CAACZ,KAAkB,EAAE9B,CAAS,EAAEqB,CAAS,EAAA;AACpD,EAAA,MAAMsB,IAAI,GAAGb,KAAK,CAACT,CAAC,CAAC;AACrBS,EAAAA,KAAK,CAACT,CAAC,CAAC,GAAGS,KAAK,CAAC9B,CAAC,CAAC;AACnB8B,EAAAA,KAAK,CAAC9B,CAAC,CAAC,GAAG2C,IAAI;AACjB;AAEA,SAASV,UAAUA,CAACjC,CAAS,EAAEqB,CAAS,EAAA;EACtC,OAAO9B,IAAI,CAACC,KAAK,CAAC,CAACQ,CAAC,GAAGqB,CAAC,IAAI,CAAC,CAAC;AAChC;;AChGA;;;;;;AAMM,SAAUuB,MAAMA,CACpBhB,KAAmB,EACnBlD,OAAA,GAAyB,EAAE,EAAA;EAE3B,MAAM;AAAEmE,IAAAA;AAAS,GAAE,GAAGnE,OAAO;AAC7B,EAAA,IAAI,CAACT,YAAU,CAAC2D,KAAK,CAAC,EAAE;AACtB,IAAA,MAAM,IAAI3C,SAAS,CAAC,wBAAwB,CAAC;AAC/C,EAAA;AACA,EAAA,IAAI2C,KAAK,CAACzC,MAAM,KAAK,CAAC,EAAE;AACtB,IAAA,MAAM,IAAIF,SAAS,CAAC,yBAAyB,CAAC;AAChD,EAAA;AACA,EAAA,IAAI,OAAO2C,KAAK,CAAC,CAAC,CAAC,KAAK,QAAQ,EAAE;AAChC,IAAA,MAAM,IAAI3C,SAAS,CAAC,4BAA4B,CAAC;AACnD,EAAA;AACA,EAAA,IAAI4D,SAAS,IAAIjB,KAAK,CAACzC,MAAM,GAAG0D,SAAS,EAAE;AACzC,IAAA,MAAM,IAAIC,KAAK,CAAC,CAAA,qCAAA,EAAwCD,SAAS,EAAE,CAAC;AACtE,EAAA;AACF;;ACxBA;;;;;;;AAOM,SAAUE,iBAAiBA,CAC/BjB,KAAkB,EAClBkB,MAAc,EACdtE,OAAA,GAAoC,EAAE,EAAA;EAEtC,MAAM;AAAEuE,IAAAA,MAAM,GAAG;AAAI,GAAE,GAAGvE,OAAO;AACjC,EAAA,IAAIuE,MAAM,EAAE;IACV,IAAIZ,GAAG,GAAG,CAAC;AACX,IAAA,IAAIC,IAAI,GAAGR,KAAK,CAAC3C,MAAM,GAAG,CAAC;IAC3B,IAAIoD,MAAM,GAAG,CAAC;AACd,IAAA,OAAOD,IAAI,GAAGD,GAAG,GAAG,CAAC,EAAE;MACrBE,MAAM,GAAGF,GAAG,IAAKC,IAAI,GAAGD,GAAG,IAAK,CAAC,CAAC;AAClC,MAAA,IAAIP,KAAK,CAACS,MAAM,CAAC,GAAGS,MAAM,EAAE;AAC1BX,QAAAA,GAAG,GAAGE,MAAM;MACd,CAAC,MAAM,IAAIT,KAAK,CAACS,MAAM,CAAC,GAAGS,MAAM,EAAE;AACjCV,QAAAA,IAAI,GAAGC,MAAM;AACf,MAAA,CAAC,MAAM;AACL,QAAA,OAAOA,MAAM;AACf,MAAA;AACF,IAAA;AAEA,IAAA,IAAIF,GAAG,GAAGP,KAAK,CAAC3C,MAAM,GAAG,CAAC,EAAE;MAC1B,IAAII,IAAI,CAAC2D,GAAG,CAACF,MAAM,GAAGlB,KAAK,CAACO,GAAG,CAAC,CAAC,GAAG9C,IAAI,CAAC2D,GAAG,CAACpB,KAAK,CAACO,GAAG,GAAG,CAAC,CAAC,GAAGW,MAAM,CAAC,EAAE;AACrE,QAAA,OAAOX,GAAG;AACZ,MAAA,CAAC,MAAM;QACL,OAAOA,GAAG,GAAG,CAAC;AAChB,MAAA;AACF,IAAA,CAAC,MAAM;AACL,MAAA,OAAOA,GAAG;AACZ,IAAA;AACF,EAAA,CAAC,MAAM;IACL,IAAIc,KAAK,GAAG,CAAC;AACb,IAAA,IAAIC,IAAI,GAAGtE,MAAM,CAACuE,iBAAiB;AACnC,IAAA,KAAK,IAAIrD,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG8B,KAAK,CAAC3C,MAAM,EAAEa,CAAC,EAAE,EAAE;AACrC,MAAA,MAAMsD,WAAW,GAAG/D,IAAI,CAAC2D,GAAG,CAACpB,KAAK,CAAC9B,CAAC,CAAC,GAAGgD,MAAM,CAAC;MAC/C,IAAIM,WAAW,GAAGF,IAAI,EAAE;AACtBA,QAAAA,IAAI,GAAGE,WAAW;AAClBH,QAAAA,KAAK,GAAGnD,CAAC;AACX,MAAA;AACF,IAAA;AACA,IAAA,OAAOmD,KAAK;AACd,EAAA;AACF;;AC/BA;;;;;AAKM,SAAUI,eAAeA,CAC7BC,CAAc,EACd9E,OAAA,GAAkC,EAAE,EAAA;EAEpC,IAAI;IAAE+E,SAAS;AAAEC,IAAAA;AAAO,GAAE,GAAGhF,OAAO;EACpC,MAAM;IAAEiF,IAAI;AAAEC,IAAAA;AAAE,GAAE,GAAGlF,OAAO;EAE5B,IAAI+E,SAAS,KAAKvE,SAAS,EAAE;IAC3B,IAAIyE,IAAI,KAAKzE,SAAS,EAAE;AACtBuE,MAAAA,SAAS,GAAGV,iBAAiB,CAACS,CAAC,EAAEG,IAAI,CAAC;AACxC,IAAA,CAAC,MAAM;AACLF,MAAAA,SAAS,GAAG,CAAC;AACf,IAAA;AACF,EAAA;EACA,IAAIC,OAAO,KAAKxE,SAAS,EAAE;IACzB,IAAI0E,EAAE,KAAK1E,SAAS,EAAE;AACpBwE,MAAAA,OAAO,GAAGX,iBAAiB,CAACS,CAAC,EAAEI,EAAE,CAAC;AACpC,IAAA,CAAC,MAAM;AACLF,MAAAA,OAAO,GAAGF,CAAC,CAACrE,MAAM,GAAG,CAAC;AACxB,IAAA;AACF,EAAA;AACA,EAAA,IAAIsE,SAAS,GAAG,CAAC,EAAEA,SAAS,GAAG,CAAC;AAChC,EAAA,IAAIC,OAAO,GAAG,CAAC,EAAEA,OAAO,GAAG,CAAC;AAC5B,EAAA,IAAID,SAAS,IAAID,CAAC,CAACrE,MAAM,EAAEsE,SAAS,GAAGD,CAAC,CAACrE,MAAM,GAAG,CAAC;AACnD,EAAA,IAAIuE,OAAO,IAAIF,CAAC,CAACrE,MAAM,EAAEuE,OAAO,GAAGF,CAAC,CAACrE,MAAM,GAAG,CAAC;AAE/C,EAAA,IAAIsE,SAAS,GAAGC,OAAO,EAAE,CAACD,SAAS,EAAEC,OAAO,CAAC,GAAG,CAACA,OAAO,EAAED,SAAS,CAAC;EACpE,OAAO;IAAEA,SAAS;AAAEC,IAAAA;GAAS;AAC/B;;;;;;;;AC7DA;;AAEA;;AAEA;AACA;AACA;AACA,SAAAzF,aAAAC,KAAA,EAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACGO,MAAM2F,MAAM,GAAGC,QAAa;AAqBpBA,QAAc,CAACD,MAAM,GAAGC,QAAc,CAACD,MAAM,GAAGC,QAAa;AAErE,MAAMC,OAAO,GAAGD,SAAc;;AC3BrC;;;;;AAKM,SAAUE,SAASA,CACvBlC,KAAkB,EAClBpD,OAAA,GAAkC,EAAE,EAAA;EAEpCkE,MAAM,CAACd,KAAK,CAAC;EACb,MAAM;IAAE2B,SAAS;AAAEC,IAAAA;AAAO,GAAE,GAAGH,eAAe,CAACzB,KAAK,EAAEpD,OAAO,CAAC;AAC9D,EAAA,IAAIuF,QAAQ,GAAGnC,KAAK,CAAC2B,SAAS,CAAC;AAE/B,EAAA,KAAK,IAAIzD,CAAC,GAAGyD,SAAS,GAAG,CAAC,EAAEzD,CAAC,IAAI0D,OAAO,EAAE1D,CAAC,EAAE,EAAE;AAC7C,IAAA,IAAI8B,KAAK,CAAC9B,CAAC,CAAC,GAAGiE,QAAQ,EAAE;AACvBA,MAAAA,QAAQ,GAAGnC,KAAK,CAAC9B,CAAC,CAAC;AACrB,IAAA;AACF,EAAA;AACA,EAAA,OAAOiE,QAAQ;AACjB;;ACnBA;;;;;AAKM,SAAUC,SAASA,CACvBpC,KAAkB,EAClBpD,OAAA,GAAkC,EAAE,EAAA;EAEpCkE,MAAM,CAACd,KAAK,CAAC;EACb,MAAM;IAAE2B,SAAS;AAAEC,IAAAA;AAAO,GAAE,GAAGH,eAAe,CAACzB,KAAK,EAAEpD,OAAO,CAAC;AAC9D,EAAA,IAAIyF,QAAQ,GAAGrC,KAAK,CAAC2B,SAAS,CAAC;AAC/B,EAAA,KAAK,IAAIzD,CAAC,GAAGyD,SAAS,GAAG,CAAC,EAAEzD,CAAC,IAAI0D,OAAO,EAAE1D,CAAC,EAAE,EAAE;AAC7C,IAAA,IAAI8B,KAAK,CAAC9B,CAAC,CAAC,GAAGmE,QAAQ,EAAE;AACvBA,MAAAA,QAAQ,GAAGrC,KAAK,CAAC9B,CAAC,CAAC;AACrB,IAAA;AACF,EAAA;AACA,EAAA,OAAOmE,QAAQ;AACjB;;ACdA;;;;;AAKM,SAAUC,gBAAgBA,CAC9BtC,KAAkB,EAClBpD,OAAA,GAAmC,EAAE,EAAA;AAErC,EAAA,IAAIoD,KAAK,CAAC3C,MAAM,GAAG,CAAC,EAAE,OAAO,IAAI;EACjC,MAAM;AAAEkF,IAAAA,SAAS,GAAG;AAAI,GAAE,GAAG3F,OAAO;EACpC,IAAI4F,KAAK,GAAG,CAAC;AACb,EAAA,IAAIC,KAAK,GAAGzF,MAAM,CAAC0F,gBAAgB;AACnC,EAAA,KAAK,IAAIxE,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG8B,KAAK,CAAC3C,MAAM,GAAG,CAAC,EAAE,EAAEa,CAAC,EAAE;AACzC,IAAA,MAAMyE,kBAAkB,GAAG3C,KAAK,CAAC9B,CAAC,GAAG,CAAC,CAAC,GAAG8B,KAAK,CAAC9B,CAAC,CAAC;IAClD,IAAIyE,kBAAkB,GAAGF,KAAK,EAAE;AAC9BA,MAAAA,KAAK,GAAGE,kBAAkB;AAC5B,IAAA;IACA,IAAIA,kBAAkB,GAAGH,KAAK,EAAE;AAC9BA,MAAAA,KAAK,GAAGG,kBAAkB;AAC5B,IAAA;AACF,EAAA;AACA,EAAA,OAAO,CAACH,KAAK,GAAGC,KAAK,IAAID,KAAK,GAAGD,SAAS;AAC5C;;AC/BA;;;;;AAKM,SAAUK,YAAYA,CAAC5C,KAAkB,EAAA;AAC7C,EAAA,IAAIA,KAAK,CAAC3C,MAAM,IAAI,CAAC,EAAE;AACrB,IAAA,OAAO,CAAC;AACV,EAAA;EACA,IAAI2C,KAAK,CAAC,CAAC,CAAC,KAAKA,KAAK,CAAC,CAAC,CAAC,EAAE;AACzB;AACA,IAAA,KAAK,IAAI9B,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG8B,KAAK,CAAC3C,MAAM,GAAG,CAAC,EAAEa,CAAC,EAAE,EAAE;AACzC,MAAA,IAAI8B,KAAK,CAAC9B,CAAC,CAAC,KAAK8B,KAAK,CAAC9B,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC;AACzC,IAAA;AACA,IAAA,OAAO,CAAC;AACV,EAAA;AAEA,EAAA,IAAI8B,KAAK,CAAC,CAAC,CAAC,GAAIA,KAAK,CAAC6C,EAAE,CAAC,EAAE,CAAY,EAAE;AACvC,IAAA,KAAK,IAAI3E,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG8B,KAAK,CAAC3C,MAAM,GAAG,CAAC,EAAEa,CAAC,EAAE,EAAE;AACzC,MAAA,IAAI8B,KAAK,CAAC9B,CAAC,CAAC,IAAI8B,KAAK,CAAC9B,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC;AACxC,IAAA;AACA,IAAA,OAAO,CAAC;AACV,EAAA,CAAC,MAAM;AACL,IAAA,KAAK,IAAIA,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG8B,KAAK,CAAC3C,MAAM,GAAG,CAAC,EAAEa,CAAC,EAAE,EAAE;AACzC,MAAA,IAAI8B,KAAK,CAAC9B,CAAC,CAAC,IAAI8B,KAAK,CAAC9B,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC;AACxC,IAAA;AACA,IAAA,OAAO,EAAE;AACX,EAAA;AACF;;ACxBA;;;;;AAKM,SAAU4E,iBAAiBA,CAC/B9C,KAAkB,EAClBpD,OAAA,GAAkC,EAAE,EAAA;EAEpCkE,MAAM,CAACd,KAAK,CAAC;EACb,MAAM;IAAE2B,SAAS;AAAEC,IAAAA;AAAO,GAAE,GAAGH,eAAe,CAACzB,KAAK,EAAEpD,OAAO,CAAC;AAC9D,EAAA,IAAIuF,QAAQ,GAAGnC,KAAK,CAAC2B,SAAS,CAAC;AAE/B,EAAA,KAAK,IAAIzD,CAAC,GAAGyD,SAAS,GAAG,CAAC,EAAEzD,CAAC,IAAI0D,OAAO,EAAE1D,CAAC,EAAE,EAAE;AAC7C,IAAA,IAAI8B,KAAK,CAAC9B,CAAC,CAAC,IAAI,CAAC,EAAE;AACjB,MAAA,IAAI8B,KAAK,CAAC9B,CAAC,CAAC,GAAGiE,QAAQ,EAAE;AACvBA,QAAAA,QAAQ,GAAGnC,KAAK,CAAC9B,CAAC,CAAC;AACrB,MAAA;IACF,CAAC,MAAM,IAAI,CAAC8B,KAAK,CAAC9B,CAAC,CAAC,GAAGiE,QAAQ,EAAE;AAC/BA,MAAAA,QAAQ,GAAG,CAACnC,KAAK,CAAC9B,CAAC,CAAC;AACtB,IAAA;AACF,EAAA;AACA,EAAA,OAAOiE,QAAQ;AACjB;;ACbA;;;;;AAKM,SAAUY,wBAAwBA,CACtC/C,KAAkB,EAAA;AAElB,EAAA,MAAMI,MAAM,GAAGP,OAAO,CAACG,KAAK,CAAC;EAC7B,MAAMgD,iBAAiB,GAAG,IAAInF,YAAY,CAACmC,KAAK,CAAC3C,MAAM,CAAC;AACxD,EAAA,KAAK,IAAIa,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG8B,KAAK,CAAC3C,MAAM,EAAEa,CAAC,EAAE,EAAE;AACrC8E,IAAAA,iBAAiB,CAAC9E,CAAC,CAAC,GAAGT,IAAI,CAAC2D,GAAG,CAACpB,KAAK,CAAC9B,CAAC,CAAC,GAAGkC,MAAM,CAAC;AACpD,EAAA;EACA,OAAO;IACLA,MAAM;IACN6C,GAAG,EAAEpD,OAAO,CAACmD,iBAAiB;AAC/B,GAAA;AACH;;AC7BA;;;;;AAKM,SAAUE,aAAaA,CAAClD,KAAkB,EAAA;EAI9Cc,MAAM,CAACd,KAAK,CAAC;AAEb,EAAA,IAAImD,GAAG,GAAGnD,KAAK,CAAC,CAAC,CAAC;AAClB,EAAA,IAAIoD,GAAG,GAAGpD,KAAK,CAAC,CAAC,CAAC;AAElB,EAAA,KAAK,MAAM5D,KAAK,IAAI4D,KAAK,EAAE;AACzB,IAAA,IAAI5D,KAAK,GAAG+G,GAAG,EAAEA,GAAG,GAAG/G,KAAK;AAC5B,IAAA,IAAIA,KAAK,GAAGgH,GAAG,EAAEA,GAAG,GAAGhH,KAAK;AAC9B,EAAA;EAEA,OAAO;IAAE+G,GAAG;AAAEC,IAAAA;GAAK;AACrB;;ACHA;;;;;;;AAOM,SAAUC,uBAAuBA,CACrCrD,KAAkB,EAAA;EAElB,MAAM;IAAEiD,GAAG;AAAE7C,IAAAA;AAAM,GAAE,GAAG2C,wBAAwB,CAAC/C,KAAK,CAAC;EACvD,OAAO;IAAEsD,EAAE,EAAEL,GAAG,GAAG,kBAAkB;IAAEA,GAAG;AAAE7C,IAAAA;GAAQ;AACtD;;AC/BA;;;;;;AAMM,SAAUmD,KAAKA,CAACvD,KAAkB,EAAA;EACtC,IAAIwD,MAAM,GAAG,CAAC;AACd,EAAA,KAAK,MAAMC,OAAO,IAAIzD,KAAK,EAAE;IAC3BwD,MAAM,IAAIC,OAAO,IAAI,CAAC;AACxB,EAAA;AACA,EAAA,OAAOhG,IAAI,CAACiG,IAAI,CAACF,MAAM,CAAC;AAC1B;;ACVA;;;;;;;;;AASM,SAAUG,oBAAoBA,CAClCC,CAAc,EACdlC,CAAc,EACdmC,EAAe,EACfC,EAAU,EAAA;EAEV,IAAIC,OAAO,GAAkB,IAAI;EACjC,IAAIC,OAAO,GAAkB,IAAI;EACjC,MAAMC,SAAS,GAAa,EAAE;EAC9B,MAAMC,SAAS,GAAa,EAAE;AAC9B,EAAA,KAAK,IAAIhG,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG0F,CAAC,CAACvG,MAAM,GAAG,CAAC,EAAE,EAAEa,CAAC,EAAE;IACrC,IACG2F,EAAE,CAAC3F,CAAC,CAAC,GAAG2F,EAAE,CAAC3F,CAAC,GAAG,CAAC,CAAC,IAAI2F,EAAE,CAAC3F,CAAC,CAAC,IAAI2F,EAAE,CAAC3F,CAAC,GAAG,CAAC,CAAC,IACvC2F,EAAE,CAAC3F,CAAC,CAAC,IAAI2F,EAAE,CAAC3F,CAAC,GAAG,CAAC,CAAC,IAAI2F,EAAE,CAAC3F,CAAC,CAAC,GAAG2F,EAAE,CAAC3F,CAAC,GAAG,CAAC,CAAE,EACzC;AACA8F,MAAAA,OAAO,GAAG;AACRtC,QAAAA,CAAC,EAAEA,CAAC,CAACxD,CAAC,CAAC;AACPmD,QAAAA,KAAK,EAAEnD;AACR,OAAA;AACD,MAAA,IAAI4F,EAAE,GAAG,CAAC,IAAIC,OAAO,KAAK,IAAI,EAAE;AAC9BE,QAAAA,SAAS,CAACE,IAAI,CAACJ,OAAO,CAAC;AACvBG,QAAAA,SAAS,CAACC,IAAI,CAACH,OAAO,CAAC;AACzB,MAAA;AACF,IAAA;AAEA;IACA,IACGH,EAAE,CAAC3F,CAAC,CAAC,IAAI2F,EAAE,CAAC3F,CAAC,GAAG,CAAC,CAAC,IAAI2F,EAAE,CAAC3F,CAAC,CAAC,GAAG2F,EAAE,CAAC3F,CAAC,GAAG,CAAC,CAAC,IACvC2F,EAAE,CAAC3F,CAAC,CAAC,GAAG2F,EAAE,CAAC3F,CAAC,GAAG,CAAC,CAAC,IAAI2F,EAAE,CAAC3F,CAAC,CAAC,IAAI2F,EAAE,CAAC3F,CAAC,GAAG,CAAC,CAAE,EACzC;AACA6F,MAAAA,OAAO,GAAG;AACRrC,QAAAA,CAAC,EAAEA,CAAC,CAACxD,CAAC,CAAC;AACPmD,QAAAA,KAAK,EAAEnD;AACR,OAAA;AACD,MAAA,IAAI4F,EAAE,GAAG,CAAC,IAAIE,OAAO,KAAK,IAAI,EAAE;AAC9BC,QAAAA,SAAS,CAACE,IAAI,CAACJ,OAAO,CAAC;AACvBG,QAAAA,SAAS,CAACC,IAAI,CAACH,OAAO,CAAC;AACzB,MAAA;AACF,IAAA;AACF,EAAA;EAEA,OAAO;IAAEC,SAAS;AAAEC,IAAAA;GAAW;AACjC;;AC3CA;;;;;;AAMM,SAAUE,8BAA8BA,CAC5CxH,OAA8C,EAAA;EAE9C,MAAM;IACJ8E,CAAC;IACD2C,KAAK;IACLC,OAAO;IACPC,UAAU;IACVC,aAAa;IACbC,cAAc;AACdC,IAAAA;AAAK,GACN,GAAG9H,OAAO;AAEX,EAAA,IAAI+H,WAAW,GAAG3H,MAAM,CAACuE,iBAAiB;EAC1C,IAAIqD,QAAQ,GAAG,EAAE;EACjB,IAAIC,YAAY,GAAGR,KAAK;AACxB,EAAA,KAAK,IAAIrF,CAAC,GAAG6F,YAAY,GAAG,CAAC,EAAE7F,CAAC,GAAGsF,OAAO,CAACjH,MAAM,EAAE2B,CAAC,EAAE,EAAE;AACtD,IAAA,MAAM8F,WAAW,GAAGR,OAAO,CAACtF,CAAC,CAAC;AAC9B,IAAA,IAAI0F,KAAK,CAACI,WAAW,CAAC,IAAIP,UAAU,EAAE;AACpC,MAAA;AACF,IAAA;AAEA,IAAA,MAAMQ,MAAM,GAAGrD,CAAC,CAACoD,WAAW,CAAC;IAC7B,MAAME,eAAe,GAAGvH,IAAI,CAAC2D,GAAG,CAAC2D,MAAM,GAAGN,cAAc,CAAC;IAEzD,IAAIO,eAAe,GAAGR,aAAa,EAAE;MACnC,IAAIQ,eAAe,GAAGL,WAAW,EAAE;AACjCC,QAAAA,QAAQ,GAAG5F,CAAC;AACd,MAAA;AACA6F,MAAAA,YAAY,GAAG7F,CAAC;AAClB,IAAA;IAEA,IAAIgG,eAAe,IAAIL,WAAW,EAAE;AACpCA,IAAAA,WAAW,GAAGK,eAAe;AAC/B,EAAA;EAEA,OAAO;AAAEC,IAAAA,SAAS,EAAEJ,YAAY;AAAED,IAAAA;GAAU;AAC9C;;ACjDA;;;;;;AAMM,SAAUM,aAAaA,CAACpF,KAAe,EAAA;EAC3C,MAAM;IAAE4B,CAAC;IAAEkC,CAAC;IAAEc,KAAK;IAAEb,EAAE;IAAEsB,GAAG;IAAErB,EAAE;AAAES,IAAAA;AAAU,GAAE,GAAGzE,KAAK;EAEtD,MAAMsF,MAAM,GAAa,EAAE;EAC3B,MAAMC,OAAO,GAAa,EAAE;EAC5B,MAAM;IAAEpB,SAAS;AAAEC,IAAAA;GAAW,GAAGP,oBAAoB,CAACC,CAAC,EAAElC,CAAC,EAAEmC,EAAE,EAAEC,EAAE,CAAC;AAEnE,EAAA,KAAK,IAAI5F,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG0F,CAAC,CAACvG,MAAM,GAAG,CAAC,EAAE,EAAEa,CAAC,EAAE;AACrC,IAAA,IAAK2F,EAAE,CAAC3F,CAAC,CAAC,GAAG,CAAC,IAAI2F,EAAE,CAAC3F,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,IAAM2F,EAAE,CAAC3F,CAAC,CAAC,GAAG,CAAC,IAAI2F,EAAE,CAAC3F,CAAC,GAAG,CAAC,CAAC,GAAG,CAAE,EAAE;AAChE;AACAmH,MAAAA,OAAO,CAAClB,IAAI,CAAC1G,IAAI,CAAC2D,GAAG,CAACyC,EAAE,CAAC3F,CAAC,CAAC,CAAC,GAAGT,IAAI,CAAC2D,GAAG,CAACyC,EAAE,CAAC3F,CAAC,GAAG,CAAC,CAAC,CAAC,GAAGA,CAAC,GAAGA,CAAC,GAAG,CAAC,CAAC;AACjE,IAAA;AACA;AACA,IAAA,IACE2F,EAAE,CAAC3F,CAAC,CAAC,KAAK,CAAC,IACX2F,EAAE,CAAC3F,CAAC,CAAC,GAAGT,IAAI,CAAC2D,GAAG,CAACyC,EAAE,CAAC3F,CAAC,GAAG,CAAC,CAAC,CAAC,IAC3B2F,EAAE,CAAC3F,CAAC,CAAC,GAAGT,IAAI,CAAC2D,GAAG,CAACyC,EAAE,CAAC3F,CAAC,GAAG,CAAC,CAAC,CAAC,EAC3B;AACAmH,MAAAA,OAAO,CAAClB,IAAI,CAACjG,CAAC,CAAC;AACjB,IAAA;AAEA;IACA,IAAIiH,GAAG,CAACjH,CAAC,CAAC,GAAGiH,GAAG,CAACjH,CAAC,GAAG,CAAC,CAAC,IAAIiH,GAAG,CAACjH,CAAC,CAAC,GAAGiH,GAAG,CAACjH,CAAC,GAAG,CAAC,CAAC,EAAE;AAC9CkH,MAAAA,MAAM,CAACjB,IAAI,CAACjG,CAAC,CAAC;AAChB,IAAA;AACF,EAAA;EAEA,MAAMoH,KAAK,GAAgB,EAAE;EAC7B,IAAIjB,KAAK,GAAG,EAAE;EACd,IAAIkB,KAAK,GAAG,EAAE;AACd,EAAA,KAAK,IAAIrH,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG+F,SAAS,CAAC5G,MAAM,EAAEa,CAAC,EAAE,EAAE;AACzC,IAAA,MAAMsG,aAAa,GAAG,CAACN,SAAS,CAAChG,CAAC,CAAC,CAACwD,CAAC,GAAGuC,SAAS,CAAC/F,CAAC,CAAC,CAACwD,CAAC,IAAI,CAAC;AAC3D,IAAA,MAAM+C,cAAc,GAAG,CAACP,SAAS,CAAChG,CAAC,CAAC,CAACwD,CAAC,GAAGuC,SAAS,CAAC/F,CAAC,CAAC,CAACwD,CAAC,IAAI,CAAC;IAE5D,IAAI8D,MAAM,GAAG,EAAE;IACf,IAAIC,KAAK,GAAGrB,8BAA8B,CAAC;MACzC1C,CAAC;MACDgD,KAAK;MACLL,KAAK;MACLE,UAAU;MACVC,aAAa;MACbC,cAAc;AACdH,MAAAA,OAAO,EAAEe;KACV,CAAC;IACFhB,KAAK,GAAGoB,KAAK,CAACR,SAAS;AACvB,IAAA,IAAIQ,KAAK,CAACb,QAAQ,KAAK,EAAE,EAAE;AACzBY,MAAAA,MAAM,GAAGH,OAAO,CAACI,KAAK,CAACb,QAAQ,CAAC;AAClC,IAAA,CAAC,MAAM;MACLa,KAAK,GAAGrB,8BAA8B,CAAC;QACrC1C,CAAC;QACDgD,KAAK;QACLH,UAAU;AACVF,QAAAA,KAAK,EAAEkB,KAAK;QACZf,aAAa;QACbC,cAAc;AACdH,QAAAA,OAAO,EAAEc;OACV,CAAC;AACF,MAAA,IAAIK,KAAK,CAACb,QAAQ,KAAK,EAAE,EAAE;AACzBY,QAAAA,MAAM,GAAGJ,MAAM,CAACK,KAAK,CAACb,QAAQ,CAAC;AACjC,MAAA;MACAW,KAAK,GAAGE,KAAK,CAACR,SAAS;AACzB,IAAA;AAEA,IAAA,IAAIO,MAAM,KAAK,EAAE,EAAE;AACjB,MAAA,MAAME,KAAK,GAAGjI,IAAI,CAAC2D,GAAG,CAAC8C,SAAS,CAAChG,CAAC,CAAC,CAACwD,CAAC,GAAGuC,SAAS,CAAC/F,CAAC,CAAC,CAACwD,CAAC,CAAC;MACvD4D,KAAK,CAACnB,IAAI,CAAC;AACTwB,QAAAA,EAAE,EAAEC,MAAM,CAACC,UAAU,EAAE;AACvBnE,QAAAA,CAAC,EAAEA,CAAC,CAAC8D,MAAM,CAAC;AACZ5B,QAAAA,CAAC,EAAEA,CAAC,CAAC4B,MAAM,CAAC;QACZE,KAAK;AACLrE,QAAAA,KAAK,EAAEmE,MAAM;AACbL,QAAAA,GAAG,EAAEA,GAAG,CAACK,MAAM,CAAC;AAChBM,QAAAA,gBAAgB,EAAE;AAChBjE,UAAAA,IAAI,EAAEoC,SAAS,CAAC/F,CAAC,CAAC;UAClB4D,EAAE,EAAEoC,SAAS,CAAChG,CAAC;;OAElB,CAAC;AACJ,IAAA;AACF,EAAA;AAEA,EAAA,OAAOoH,KAAK;AACd;;AC3EA;;;;;;AAMM,SAAUS,oBAAoBA,CAACnJ,OAAoC,EAAA;EACvE,IAAIyH,KAAK,GAAG,EAAE;EACd,MAAMiB,KAAK,GAAgB,EAAE;EAC7B,MAAM;IAAE5D,CAAC;IAAEyD,GAAG;IAAET,KAAK;IAAEH,UAAU;IAAEL,SAAS;IAAED,SAAS;AAAEK,IAAAA;AAAO,GAAE,GAAG1H,OAAO;AAE5E,EAAA,KAAK,IAAIsB,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG+F,SAAS,CAAC5G,MAAM,EAAEa,CAAC,EAAE,EAAE;AACzC,IAAA,MAAMsG,aAAa,GAAG,CAACN,SAAS,CAAChG,CAAC,CAAC,CAACwD,CAAC,GAAGuC,SAAS,CAAC/F,CAAC,CAAC,CAACwD,CAAC,IAAI,CAAC;AAC3D,IAAA,MAAM+C,cAAc,GAAG,CAACP,SAAS,CAAChG,CAAC,CAAC,CAACwD,CAAC,GAAGuC,SAAS,CAAC/F,CAAC,CAAC,CAACwD,CAAC,IAAI,CAAC;IAC5D,MAAM;MAAEkD,QAAQ;AAAEK,MAAAA;KAAW,GAAGb,8BAA8B,CAAC;MAC7D1C,CAAC;MACD2C,KAAK;MACLC,OAAO;MACPC,UAAU;MACVC,aAAa;MACbC,cAAc;AACdC,MAAAA;KACD,CAAC;AAEF,IAAA,IAAIE,QAAQ,KAAK,EAAE,EAAE;AACnB,MAAA,MAAME,WAAW,GAAGR,OAAO,CAACM,QAAQ,CAAC;AACrC,MAAA,MAAMc,KAAK,GAAGjI,IAAI,CAAC2D,GAAG,CAAC8C,SAAS,CAAChG,CAAC,CAAC,CAACwD,CAAC,GAAGuC,SAAS,CAAC/F,CAAC,CAAC,CAACwD,CAAC,CAAC;MACvD4D,KAAK,CAACnB,IAAI,CAAC;AACTwB,QAAAA,EAAE,EAAEC,MAAM,CAACC,UAAU,EAAE;AACvBnE,QAAAA,CAAC,EAAEA,CAAC,CAACoD,WAAW,CAAC;AACjBlB,QAAAA,CAAC,EAAEc,KAAK,CAACI,WAAW,CAAC;QACrBY,KAAK;AACLrE,QAAAA,KAAK,EAAEyD,WAAW;AAClBK,QAAAA,GAAG,EAAEA,GAAG,CAACL,WAAW,CAAC;AACrBgB,QAAAA,gBAAgB,EAAE;AAChBjE,UAAAA,IAAI,EAAEoC,SAAS,CAAC/F,CAAC,CAAC;UAClB4D,EAAE,EAAEoC,SAAS,CAAChG,CAAC;;OAElB,CAAC;AACJ,IAAA;AACAmG,IAAAA,KAAK,GAAGY,SAAS;AACnB,EAAA;AAEA,EAAA,OAAOK,KAAK;AACd;;AC1DA;;;;;;;AAOM,SAAUU,mBAAmBA,CAAClG,KAA+B,EAAA;EACjE,MAAM;IAAE8D,CAAC;AAAEC,IAAAA;AAAE,GAAE,GAAG/D,KAAK;EAEvB,MAAMuF,OAAO,GAAa,EAAE;AAE5B,EAAA,KAAK,IAAInH,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG0F,CAAC,CAACvG,MAAM,GAAG,CAAC,EAAE,EAAEa,CAAC,EAAE;AACrC,IAAA,IAAI+H,wBAAwB,CAACpC,EAAE,CAAC3F,CAAC,CAAC,EAAE2F,EAAE,CAAC3F,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE;AAC9C;AACAmH,MAAAA,OAAO,CAAClB,IAAI,CAAC1G,IAAI,CAAC2D,GAAG,CAACyC,EAAE,CAAC3F,CAAC,CAAC,CAAC,GAAGT,IAAI,CAAC2D,GAAG,CAACyC,EAAE,CAAC3F,CAAC,GAAG,CAAC,CAAC,CAAC,GAAGA,CAAC,GAAGA,CAAC,GAAG,CAAC,CAAC;AACjE,IAAA,CAAC,MAAM;AACL;IACA2F,EAAE,CAAC3F,CAAC,CAAC,KAAK,CAAC,IACX+H,wBAAwB,CAACpC,EAAE,CAAC3F,CAAC,GAAG,CAAC,CAAC,EAAE2F,EAAE,CAAC3F,CAAC,GAAG,CAAC,CAAC,CAAC,EAC9C;AACAmH,MAAAA,OAAO,CAAClB,IAAI,CAACjG,CAAC,CAAC;AACjB,IAAA;AACF,EAAA;AACA,EAAA,OAAOmH,OAAO;AAChB;AAEA,SAASY,wBAAwBA,CAACC,IAAY,EAAEC,IAAY,EAAA;AAC1D,EAAA,OAAQD,IAAI,GAAG,CAAC,IAAIC,IAAI,GAAG,CAAC,IAAMD,IAAI,GAAG,CAAC,IAAIC,IAAI,GAAG,CAAE;AACzD;;AC5BA;;;;;AAKM,SAAUC,eAAeA,CAACtG,KAAe,EAAA;EAC7C,MAAM;IAAE8D,CAAC;IAAElC,CAAC;IAAEmC,EAAE;IAAEC,EAAE;IAAEY,KAAK;IAAEH,UAAU;AAAEY,IAAAA;AAAG,GAAE,GAAGrF,KAAK;AACtD,EAAA,MAAMuF,OAAO,GAAGW,mBAAmB,CAAClG,KAAK,CAAC;EAC1C,MAAM;IAAEmE,SAAS;AAAEC,IAAAA;GAAW,GAAGP,oBAAoB,CAACC,CAAC,EAAElC,CAAC,EAAEmC,EAAE,EAAEC,EAAE,CAAC;AAEnE,EAAA,OAAOiC,oBAAoB,CAAC;AAC1BzB,IAAAA,OAAO,EAAEe,OAAO;IAChBpB,SAAS;IACTC,SAAS;IACTxC,CAAC;IACDgD,KAAK;IACLH,UAAU;AACVY,IAAAA;GACD,CAAC;AACJ;;ACpBA;;;;;AAKM,SAAUkB,gBAAgBA,CAACvG,KAAe,EAAA;EAC9C,MAAM;IAAE4B,CAAC;IAAEkC,CAAC;IAAEc,KAAK;IAAEb,EAAE;IAAEsB,GAAG;IAAErB,EAAE;AAAES,IAAAA;AAAU,GAAE,GAAGzE,KAAK;EAEtD,MAAMsF,MAAM,GAAa,EAAE;EAC3B,MAAM;IAAEnB,SAAS;AAAEC,IAAAA;GAAW,GAAGP,oBAAoB,CAACC,CAAC,EAAElC,CAAC,EAAEmC,EAAE,EAAEC,EAAE,CAAC;AAEnE;AACA,EAAA,KAAK,IAAI5F,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG0F,CAAC,CAACvG,MAAM,GAAG,CAAC,EAAE,EAAEa,CAAC,EAAE;AACrC;IACA,IAAIiH,GAAG,CAACjH,CAAC,CAAC,GAAGiH,GAAG,CAACjH,CAAC,GAAG,CAAC,CAAC,IAAIiH,GAAG,CAACjH,CAAC,CAAC,GAAGiH,GAAG,CAACjH,CAAC,GAAG,CAAC,CAAC,EAAE;AAC9CkH,MAAAA,MAAM,CAACjB,IAAI,CAACjG,CAAC,CAAC;AAChB,IAAA;AACF,EAAA;AAEA,EAAA,OAAO6H,oBAAoB,CAAC;AAC1BzB,IAAAA,OAAO,EAAEc,MAAM;IACfnB,SAAS;IACTC,SAAS;IACTxC,CAAC;IACDgD,KAAK;IACLH,UAAU;AACVY,IAAAA;GACD,CAAC;AACJ;;AC9BA;;;;;;;AAOM,SAAUmB,WAAWA,CACzBC,IAAY,EACZjB,KAAqD,EAAA;EAErD,MAAM;IAAE5D,CAAC;AAAEkC,IAAAA;AAAC,GAAE,GAAG2C,IAAI;AAErB,EAAA,KAAK,MAAMC,IAAI,IAAIlB,KAAK,EAAE;AACxB,IAAA,IAAImB,YAAY,GAAGD,IAAI,CAACnF,KAAK;AAC7B;IACA,IACEuC,CAAC,CAAC6C,YAAY,GAAG,CAAC,CAAC,IAAI7C,CAAC,CAAC6C,YAAY,GAAG,CAAC,CAAC,IAC1C7C,CAAC,CAAC6C,YAAY,GAAG,CAAC,CAAC,IAAI7C,CAAC,CAAC6C,YAAY,CAAC,EACtC;AACAA,MAAAA,YAAY,EAAE;IAChB,CAAC,MAAM,IACL7C,CAAC,CAAC6C,YAAY,GAAG,CAAC,CAAC,IAAI7C,CAAC,CAAC6C,YAAY,CAAC,IACtC7C,CAAC,CAAC6C,YAAY,GAAG,CAAC,CAAC,IAAI7C,CAAC,CAAC6C,YAAY,GAAG,CAAC,CAAC,EAC1C;AACAA,MAAAA,YAAY,EAAE;AAChB,IAAA,CAAC,MAAM,IACL7C,CAAC,CAAC6C,YAAY,GAAG,CAAC,CAAC,IAAI7C,CAAC,CAAC6C,YAAY,GAAG,CAAC,CAAC,IAC1C7C,CAAC,CAAC6C,YAAY,GAAG,CAAC,CAAC,IAAI7C,CAAC,CAAC6C,YAAY,GAAG,CAAC,CAAC,EAC1C;AACAA,MAAAA,YAAY,IAAI,CAAC;AACnB,IAAA,CAAC,MAAM,IACL7C,CAAC,CAAC6C,YAAY,GAAG,CAAC,CAAC,IAAI7C,CAAC,CAAC6C,YAAY,GAAG,CAAC,CAAC,IAC1C7C,CAAC,CAAC6C,YAAY,GAAG,CAAC,CAAC,IAAI7C,CAAC,CAAC6C,YAAY,GAAG,CAAC,CAAC,EAC1C;AACAA,MAAAA,YAAY,IAAI,CAAC;AACnB,IAAA;AACA;AACA,IAAA,IACE7C,CAAC,CAAC6C,YAAY,GAAG,CAAC,CAAC,GAAG,CAAC,IACvB7C,CAAC,CAAC6C,YAAY,GAAG,CAAC,CAAC,GAAG,CAAC,IACvB7C,CAAC,CAAC6C,YAAY,CAAC,IAAI7C,CAAC,CAAC6C,YAAY,GAAG,CAAC,CAAC,IACtC7C,CAAC,CAAC6C,YAAY,CAAC,IAAI7C,CAAC,CAAC6C,YAAY,GAAG,CAAC,CAAC,KACrC7C,CAAC,CAAC6C,YAAY,CAAC,KAAK7C,CAAC,CAAC6C,YAAY,GAAG,CAAC,CAAC,IACtC7C,CAAC,CAAC6C,YAAY,CAAC,KAAK7C,CAAC,CAAC6C,YAAY,GAAG,CAAC,CAAC,CAAC,EAC1C;AACA,MAAA,MAAMC,KAAK,GAAGjJ,IAAI,CAACkJ,KAAK,CAAC/C,CAAC,CAAC6C,YAAY,GAAG,CAAC,CAAC,CAAC;MAC7C,MAAMG,IAAI,GAAGnJ,IAAI,CAACkJ,KAAK,CAAC/C,CAAC,CAAC6C,YAAY,CAAC,CAAC;AACxC,MAAA,MAAMI,KAAK,GAAGpJ,IAAI,CAACkJ,KAAK,CAAC/C,CAAC,CAAC6C,YAAY,GAAG,CAAC,CAAC,CAAC;AAC7C,MAAA,MAAMK,CAAC,GAAI,GAAG,IAAIJ,KAAK,GAAGG,KAAK,CAAC,IAAKH,KAAK,GAAG,CAAC,GAAGE,IAAI,GAAGC,KAAK,CAAC;AAC9D,MAAA,MAAME,QAAQ,GAAWrF,CAAC,CAAC+E,YAAY,CAAC;AACxC,MAAA,MAAMO,SAAS,GAAWtF,CAAC,CAAC+E,YAAY,GAAG,CAAC,CAAC;MAC7CD,IAAI,CAAC9E,CAAC,GAAGqF,QAAQ,GAAG,CAACA,QAAQ,GAAGC,SAAS,IAAIF,CAAC;MAC9CN,IAAI,CAAC5C,CAAC,GACJA,CAAC,CAAC6C,YAAY,CAAC,GACf,IAAI,IAAI7C,CAAC,CAAC6C,YAAY,GAAG,CAAC,CAAC,GAAG7C,CAAC,CAAC6C,YAAY,GAAG,CAAC,CAAC,CAAC,GAAGK,CAAC;AAC1D,IAAA;AACF,EAAA;AACF;;ACgBA;;;;;;AAMM,SAAUG,GAAGA,CAACV,IAAY,EAAE3J,OAAA,GAAsB,EAAE,EAAA;EACxD,IAAI;AAAEsK,IAAAA;AAAU,GAAE,GAAGtK,OAAO;EAC5B,MAAM;AACJuK,IAAAA,SAAS,GAAG;AACVtK,MAAAA,UAAU,EAAE,CAAC;AACbE,MAAAA,UAAU,EAAE;AACb,KAAA;AACDqK,IAAAA,OAAO,GAAG,KAAK;AACfC,IAAAA,WAAW,GAAG,IAAI;AAClBC,IAAAA,gBAAgB,GAAG,CAAC;AACpBC,IAAAA,WAAW,GAAG,OAAO;AACrBC,IAAAA,gBAAgB,GAAG,KAAK;AACxBC,IAAAA,sBAAsB,GAAG;AAAQ,GAClC,GAAG7K,OAAO;AACX,EAAA,IAAI0K,gBAAgB,GAAG,CAAC,IAAIA,gBAAgB,GAAG,CAAC,EAAE;AAChD,IAAA,MAAM,IAAItG,KAAK,CAAC,0CAA0C,CAAC;AAC7D,EAAA;EACA,MAAM;AAAEU,IAAAA;AAAC,GAAE,GAAG6E,IAAI;EAClB,IAAI;AAAE3C,IAAAA;AAAC,GAAE,GAAG2C,IAAI;AAChB,EAAA,IAAI3D,YAAY,CAAClB,CAAC,CAAC,KAAK,CAAC,EAAE;AACzB,IAAA,MAAM,IAAIV,KAAK,CAAC,+CAA+C,CAAC;AAClE,EAAA;AACA;AACA4C,EAAAA,CAAC,GAAGA,CAAC,CAAC3D,KAAK,EAAE;AAEb;AACA;AACA,EAAA,MAAMyH,eAAe,GAAGpF,gBAAgB,CAACZ,CAAC,CAAC;EAE3C,IAAIwF,UAAU,KAAK9J,SAAS,EAAE;AAC5B,IAAA,IAAIsK,eAAe,EAAE;AACnB,MAAA,MAAMC,SAAS,GAAGtE,uBAAuB,CAACO,CAAC,CAAC;AAC5C,MAAA,IAAIyD,WAAW,EAAE;QACfH,UAAU,GAAGS,SAAS,CAACvH,MAAM,GAAG,GAAG,GAAGuH,SAAS,CAACrE,EAAE;AACpD,MAAA,CAAC,MAAM;QACL4D,UAAU,GAAG,CAACS,SAAS,CAACvH,MAAM,GAAG,GAAG,GAAGuH,SAAS,CAACrE,EAAE;AACrD,MAAA;AACF,IAAA,CAAC,MAAM;AACL4D,MAAAA,UAAU,GAAG,CAAC;AAChB,IAAA;AACF,EAAA,CAAC,MAAM,IAAI,CAACG,WAAW,EAAE;IACvBH,UAAU,IAAI,EAAE;AAClB,EAAA;EAEA,IAAI,CAACG,WAAW,EAAE;AAChB,IAAA,KAAK,IAAInJ,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG0F,CAAC,CAACvG,MAAM,EAAEa,CAAC,EAAE,EAAE;MACjC0F,CAAC,CAAC1F,CAAC,CAAC,GAAG,CAAC0F,CAAC,CAAC1F,CAAC,CAAC;AACd,IAAA;AACF,EAAA;AAEA,EAAA,MAAM0J,gBAAgB,GACpBN,gBAAgB,GAAG,CAAC,GAAGA,gBAAgB,GAAGxE,iBAAiB,CAACc,CAAC,CAAC,GAAGsD,UAAU;EAE7E,IAAIA,UAAU,KAAK9J,SAAS,EAAE;AAC5B,IAAA,KAAK,IAAIc,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG0F,CAAC,CAACvG,MAAM,EAAEa,CAAC,EAAE,EAAE;AACjC,MAAA,IAAI0F,CAAC,CAAC1F,CAAC,CAAC,GAAGgJ,UAAU,EAAE;AACrBtD,QAAAA,CAAC,CAAC1F,CAAC,CAAC,GAAGgJ,UAAU;AACnB,MAAA;AACF,IAAA;AACF,EAAA;AAEA,EAAA,MAAMW,MAAM,GAAGH,eAAe,GAAGhG,CAAC,CAAC,CAAC,CAAC,GAAGA,CAAC,CAAC,CAAC,CAAC,GAAGA,CAAC;EAEhD,MAAMgD,KAAK,GAAG0C,OAAO,GACjB3K,GAAG,CAACmH,CAAC,EAAEiE,MAAM,EAAE;AACb,IAAA,GAAGV,SAAS;AACZrK,IAAAA,UAAU,EAAE;AACb,GAAA,CAAC,GACF8G,CAAC;EACL,MAAM;AAAET,IAAAA,GAAG,EAAE2E,IAAI;AAAE1E,IAAAA,GAAG,EAAE2E;AAAI,GAAE,GAAG7E,aAAa,CAACwB,KAAK,CAAC;EAErD,IAAIoD,IAAI,GAAGC,IAAI,IAAID,IAAI,KAAKC,IAAI,EAAE,OAAO,EAAE;AAE3C,EAAA,MAAMlE,EAAE,GAAGpH,GAAG,CAACmH,CAAC,EAAEiE,MAAM,EAAE;AACxB,IAAA,GAAGV,SAAS;AACZrK,IAAAA,UAAU,EAAE;GACb,CAAC;AAEF,EAAA,MAAMqI,GAAG,GAAG1I,GAAG,CAACmH,CAAC,EAAEiE,MAAM,EAAE;AACzB,IAAA,GAAGV,SAAS;AACZrK,IAAAA,UAAU,EAAE;GACb,CAAC;AAEF,EAAA,MAAMyH,UAAU,GAAGrC,SAAS,CAAC,CAC3BgF,UAAU,EACVY,IAAI,GAAG,CAACC,IAAI,GAAGD,IAAI,IAAIP,WAAW,EAClCK,gBAAgB,CACjB,CAAC;EAEF,MAAM9D,EAAE,GAAGpC,CAAC,CAAC,CAAC,CAAC,GAAGA,CAAC,CAAC,CAAC,CAAC;AACtB,EAAA,MAAMsG,QAAQ,GAAG;IAAEtG,CAAC;IAAEkC,CAAC;IAAEc,KAAK;IAAEb,EAAE;IAAEsB,GAAG;IAAErB,EAAE;AAAES,IAAAA;GAAY;EACzD,IAAIe,KAAK,GAAgB,EAAE;EAC3B,IAAImC,sBAAsB,KAAK,OAAO,EAAE;AACtCnC,IAAAA,KAAK,GAAGc,eAAe,CAAC4B,QAAQ,CAAC;AACnC,EAAA,CAAC,MAAM,IAAIP,sBAAsB,KAAK,QAAQ,EAAE;AAC9CnC,IAAAA,KAAK,GAAGe,gBAAgB,CAAC2B,QAAQ,CAAC;AACpC,EAAA,CAAC,MAAM;AACL1C,IAAAA,KAAK,GAAGJ,aAAa,CAAC8C,QAAQ,CAAC;AACjC,EAAA;AAEA,EAAA,IAAIR,gBAAgB,EAAE;AACpBlB,IAAAA,WAAW,CAAC;MAAE5E,CAAC;AAAEkC,MAAAA,CAAC,EAAEc;KAAO,EAAEY,KAAK,CAAC;AACrC,EAAA;AAEA,EAAA,KAAK,MAAMkB,IAAI,IAAIlB,KAAK,EAAE;IACxB,IAAI,CAAC+B,WAAW,EAAE;AAChBb,MAAAA,IAAI,CAAC5C,CAAC,IAAI,EAAE;MACZ4C,IAAI,CAACrB,GAAG,GAAGqB,IAAI,CAACrB,GAAG,GAAG,EAAE;AAC1B,IAAA;AACF,EAAA;AAEAG,EAAAA,KAAK,CAAC2C,IAAI,CAAC,CAAC7I,CAAC,EAAEC,CAAC,KAAI;AAClB,IAAA,OAAOD,CAAC,CAACsC,CAAC,GAAGrC,CAAC,CAACqC,CAAC;AAClB,EAAA,CAAC,CAAC;AAEF,EAAA,OAAO4D,KAAK;AACd;;ACtMO,MAAM4C,mBAAmB,GAAG,EAAE,GAAGzK,IAAI,CAAC0K,GAAG;AACzC,MAAMC,gBAAgB,GAAG3K,IAAI,CAACiG,IAAI,CAACjG,IAAI,CAAC4K,EAAE,GAAG5K,IAAI,CAAC0K,GAAG,CAAC;AACtD,MAAMG,UAAU,GAAG7K,IAAI,CAACiG,IAAI,CAAC,CAAC,CAAC;AAC/B,MAAM6E,SAAS,GAAG9K,IAAI,CAACiG,IAAI,CAAC,CAAC,GAAGjG,IAAI,CAAC0K,GAAG,CAAC;AACzC,MAAMK,mBAAmB,GAAG/K,IAAI,CAACiG,IAAI,CAAC,CAAC,GAAGjG,IAAI,CAAC0K,GAAG,CAAC,GAAG,CAAC;;ACJ9D;AACA;AAEA;AAEA;;;;;;AAMc,SAAUM,MAAMA,CAAC/G,CAAS,EAAA;EACtC,MAAMtC,CAAC,GAAG,KAAK;AACf,EAAA,IAAIsC,CAAC,KAAK,CAAC,EAAE,OAAO,CAAC;EACrB,MAAMgH,aAAa,GAAGjL,IAAI,CAACkL,GAAG,CAAC,CAAC,GAAGjH,CAAC,GAAGA,CAAC,CAAC;AACzC,EAAA,MAAMkH,aAAa,GAAGF,aAAa,GAAG,CAAC,GAAG,CAAC,IAAIjL,IAAI,CAAC4K,EAAE,GAAGjJ,CAAC,CAAC;AAC3D,EAAA,MAAMyJ,SAAS,GAAGpL,IAAI,CAACiG,IAAI,CAACkF,aAAa,IAAI,CAAC,GAAGF,aAAa,GAAGtJ,CAAC,CAAC;EACnE,MAAM0J,UAAU,GAAGrL,IAAI,CAACiG,IAAI,CAACmF,SAAS,GAAGD,aAAa,CAAC;EACvD,OAAOE,UAAU,IAAIpH,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC;AACtC;;ACiCM,MAAOqH,QAAQ,CAAA;AACnB;;;;EAIOC,IAAI;EAEXC,WAAAA,CAAmBrM,OAAA,GAAgC,EAAE,EAAA;IACnD,MAAM;AAAEoM,MAAAA,IAAI,GAAG,GAAG;AAAE1F,MAAAA;AAAE,KAAE,GAAG1G,OAAO;AAElC,IAAA,IAAI,CAACoM,IAAI,GAAG1F,EAAE,GAAG4F,mBAAmB,CAAC,CAAC,GAAG5F,EAAE,CAAC,GAAG0F,IAAI;AACrD,EAAA;AAEOG,EAAAA,WAAWA,CAACH,IAAI,GAAG,IAAI,CAACA,IAAI,EAAA;IACjC,OAAOI,mBAAmB,CAACJ,IAAI,CAAC;AAClC,EAAA;AAEOK,EAAAA,WAAWA,CAAC3D,KAAa,EAAA;IAC9B,OAAOwD,mBAAmB,CAACxD,KAAK,CAAC;AACnC,EAAA;AAEO4D,EAAAA,GAAGA,CAAC5H,CAAS,EAAA;AAClB,IAAA,OAAO6H,WAAW,CAAC7H,CAAC,EAAE,IAAI,CAACsH,IAAI,CAAC;AAClC,EAAA;AAEOQ,EAAAA,OAAOA,CAACC,MAAM,GAAGC,uBAAuB,CAAC;IAAEV,IAAI,EAAE,IAAI,CAACA;AAAI,GAAE,CAAC,EAAA;AAClE,IAAA,OAAOW,eAAe,CAAC;MAAEX,IAAI,EAAE,IAAI,CAACA,IAAI;AAAES,MAAAA;AAAM,KAAE,CAAC;AACrD,EAAA;AAEOG,EAAAA,SAASA,CAACC,IAAa,EAAA;IAC5B,OAAOC,iBAAiB,CAACD,IAAI,CAAC;AAChC,EAAA;EAEOE,OAAOA,CAACnN,OAAA,GAA4B,EAAE,EAAA;AAC3C,IAAA,OAAOoN,eAAe,CAAC,IAAI,EAAEpN,OAAO,CAAC;AACvC,EAAA;EAEOqN,eAAeA,CAACJ,IAAI,GAAG,CAAC,EAAA;AAC7B,IAAA,OAAOH,uBAAuB,CAAC;MAAEV,IAAI,EAAE,IAAI,CAACA,IAAI;AAAEa,MAAAA;AAAI,KAAE,CAAC;AAC3D,EAAA;AAEOK,EAAAA,aAAaA,GAAA;IAClB,OAAO,CAAC,MAAM,CAAC;AACjB,EAAA;;AAGF;;;;;AAKM,SAAUR,uBAAuBA,CACrC9M,OAAuC,EAAA;EAEvC,MAAM;AAAEiN,IAAAA,IAAI,GAAG,CAAC;AAAEvG,IAAAA;AAAE,GAAE,GAAG1G,OAAO;EAChC,IAAI;AAAEoM,IAAAA,IAAI,GAAG;AAAG,GAAE,GAAGpM,OAAO;EAE5B,IAAI0G,EAAE,EAAE0F,IAAI,GAAGE,mBAAmB,CAAC,CAAC,GAAG5F,EAAE,CAAC;AAE1C,EAAA,OAAQ,CAAC,GAAGuG,IAAI,GAAIzB,gBAAgB,GAAGY,IAAI;AAC7C;AAEA;;;;;;AAMM,SAAUO,WAAWA,CAAC7H,CAAS,EAAEsH,IAAY,EAAA;AACjD,EAAA,OAAOvL,IAAI,CAAC0M,GAAG,CAACjC,mBAAmB,GAAG,CAACxG,CAAC,GAAGsH,IAAI,KAAK,CAAC,CAAC;AACxD;AAEA;;;;;AAKM,SAAUE,mBAAmBA,CAACxD,KAAa,EAAA;EAC/C,OAAOA,KAAK,GAAG6C,SAAS;AAC1B;AAEA;;;;;AAKM,SAAUa,mBAAmBA,CAACJ,IAAY,EAAA;EAC9C,OAAOA,IAAI,GAAGT,SAAS;AACzB;AAEA;;;;;AAKM,SAAUoB,eAAeA,CAAC/M,OAA+B,EAAA;EAC7D,MAAM;IAAE0G,EAAE;AAAEmG,IAAAA,MAAM,GAAG;AAAC,GAAE,GAAG7M,OAAO;EAClC,IAAI;AAAEoM,IAAAA,IAAI,GAAG;AAAG,GAAE,GAAGpM,OAAO;EAE5B,IAAI0G,EAAE,EAAE0F,IAAI,GAAGE,mBAAmB,CAAC,CAAC,GAAG5F,EAAE,CAAC;AAE1C,EAAA,OAAQmG,MAAM,GAAGrB,gBAAgB,GAAGY,IAAI,GAAI,CAAC;AAC/C;AAEA;;;;;AAKM,SAAUc,iBAAiBA,CAACD,IAAI,GAAG,MAAM,EAAA;EAC7C,OAAOpM,IAAI,CAACiG,IAAI,CAAC,CAAC,CAAC,GAAG+E,MAAM,CAACoB,IAAI,CAAC;AACpC;AAEA;;;;;;AAMM,SAAUG,eAAeA,CAC7BI,KAAA,GAA8B,EAAE,EAChCxN,OAAA,GAA4B,EAAE,EAAA;EAE9B,MAAM;AAAE0G,IAAAA;AAAE,GAAE,GAAG8G,KAAK;EACpB,IAAI;AAAEpB,IAAAA,IAAI,GAAG;AAAG,GAAE,GAAGoB,KAAK;EAC1B,IAAI9G,EAAE,EAAE0F,IAAI,GAAGE,mBAAmB,CAAC,CAAC,GAAG5F,EAAE,CAAC;EAE1C,MAAM;IACJ+G,MAAM,GAAGP,iBAAiB,EAAE;IAC5BL,MAAM,GAAGC,uBAAuB,CAAC;AAAEV,MAAAA;KAAM;AAAC,GAC3C,GAAGpM,OAAO;EACX,IAAI;AAAES,IAAAA;AAAM,GAAE,GAAGT,OAAO;EAExB,IAAI,CAACS,MAAM,EAAE;AACXA,IAAAA,MAAM,GAAGI,IAAI,CAAC0F,GAAG,CAAC1F,IAAI,CAAC6M,IAAI,CAACtB,IAAI,GAAGqB,MAAM,CAAC,EAAE,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;AACxD,IAAA,IAAIhN,MAAM,GAAG,CAAC,KAAK,CAAC,EAAEA,MAAM,EAAE;AAChC,EAAA;AAEA,EAAA,MAAMuB,MAAM,GAAG,CAACvB,MAAM,GAAG,CAAC,IAAI,CAAC;AAC/B,EAAA,MAAMkJ,IAAI,GAAG,IAAI1I,YAAY,CAACR,MAAM,CAAC;EACrC,KAAK,IAAIa,CAAC,GAAG,CAAC,EAAEA,CAAC,IAAIU,MAAM,EAAEV,CAAC,EAAE,EAAE;IAChC,MAAM9B,KAAK,GAAGmN,WAAW,CAACrL,CAAC,GAAGU,MAAM,EAAEoK,IAAI,CAAC,GAAGS,MAAM;AACpDlD,IAAAA,IAAI,CAACrI,CAAC,CAAC,GAAG9B,KAAK;IACfmK,IAAI,CAAClJ,MAAM,GAAG,CAAC,GAAGa,CAAC,CAAC,GAAG9B,KAAK;AAC9B,EAAA;AAEA,EAAA,OAAOmK,IAAI;AACb;;AC9KM,MAAOgE,UAAU,CAAA;AACrB;;;;EAIOvB,IAAI;EAEXC,WAAAA,CAAmBrM,OAAA,GAAkC,EAAE,EAAA;IACrD,MAAM;AAAEoM,MAAAA,IAAI,GAAG;AAAG,KAAE,GAAGpM,OAAO;IAE9B,IAAI,CAACoM,IAAI,GAAGA,IAAI;AAClB,EAAA;AAEOG,EAAAA,WAAWA,CAACH,IAAI,GAAG,IAAI,CAACA,IAAI,EAAA;IACjC,OAAOwB,qBAAqB,CAACxB,IAAI,CAAC;AACpC,EAAA;AAEOK,EAAAA,WAAWA,CAAC3D,KAAa,EAAA;IAC9B,OAAO+E,qBAAqB,CAAC/E,KAAK,CAAC;AACrC,EAAA;AAEO4D,EAAAA,GAAGA,CAAC5H,CAAS,EAAA;AAClB,IAAA,OAAOgJ,aAAa,CAAChJ,CAAC,EAAE,IAAI,CAACsH,IAAI,CAAC;AACpC,EAAA;EAEOQ,OAAOA,CAACC,MAAM,GAAG,CAAC,EAAA;AACvB,IAAA,OAAOkB,iBAAiB,CAAC;MAAE3B,IAAI,EAAE,IAAI,CAACA,IAAI;AAAES,MAAAA;AAAM,KAAE,CAAC;AACvD,EAAA;AAEOG,EAAAA,SAASA,CAACC,IAAa,EAAA;IAC5B,OAAOe,mBAAmB,CAACf,IAAI,CAAC;AAClC,EAAA;EAEOE,OAAOA,CAACnN,OAAA,GAA4B,EAAE,EAAA;AAC3C,IAAA,OAAOiO,iBAAiB,CAAC,IAAI,EAAEjO,OAAO,CAAC;AACzC,EAAA;EAEOqN,eAAeA,CAACJ,IAAI,GAAG,CAAC,EAAA;AAC7B,IAAA,OAAOiB,yBAAyB,CAAC;MAAE9B,IAAI,EAAE,IAAI,CAACA,IAAI;AAAEa,MAAAA;AAAI,KAAE,CAAC;AAC7D,EAAA;AAEOK,EAAAA,aAAaA,GAAA;IAClB,OAAO,CAAC,MAAM,CAAC;AACjB,EAAA;;AAGK,MAAMY,yBAAyB,GAAGA,CAAC;AAAE9B,EAAAA,IAAI,GAAG,CAAC;AAAEa,EAAAA,IAAI,GAAG;AAAC,CAAE,KAAI;EAClE,OAAQ,CAAC,GAAGA,IAAI,GAAIpM,IAAI,CAAC4K,EAAE,GAAGW,IAAI;AACpC,CAAC;AAEM,MAAM2B,iBAAiB,GAAI/N,OAAiC,IAAI;EACrE,MAAM;AAAEoM,IAAAA,IAAI,GAAG,GAAG;AAAES,IAAAA,MAAM,GAAG;AAAC,GAAE,GAAG7M,OAAO;EAC1C,OAAQ6M,MAAM,GAAGhM,IAAI,CAAC4K,EAAE,GAAGW,IAAI,GAAI,CAAC;AACtC,CAAC;AAEM,MAAM0B,aAAa,GAAGA,CAAChJ,CAAS,EAAEsH,IAAY,KAAI;AACvD,EAAA,OAAOA,IAAI,IAAI,CAAC,IAAI,CAAC,GAAGtH,CAAC,IAAI,CAAC,GAAGsH,IAAI,IAAI,CAAC,CAAC;AAC7C,CAAC;AAEM,MAAMyB,qBAAqB,GAAI/E,KAAa,IAAI;EACrD,OAAOA,KAAK,GAAG4C,UAAU;AAC3B,CAAC;AAEM,MAAMkC,qBAAqB,GAAIxB,IAAY,IAAI;EACpD,OAAOA,IAAI,GAAGV,UAAU;AAC1B,CAAC;AAED,MAAMyC,kBAAkB,GAAIjE,CAAS,IAAKrJ,IAAI,CAACuN,GAAG,CAACvN,IAAI,CAAC4K,EAAE,IAAIvB,CAAC,GAAG,GAAG,CAAC,CAAC;AAEhE,MAAM8D,mBAAmB,GAAGA,CAACf,IAAI,GAAG,MAAM,KAAI;EACnD,IAAIA,IAAI,IAAI,CAAC,EAAE;AACb,IAAA,MAAM,IAAI7I,KAAK,CAAC,wBAAwB,CAAC;AAC3C,EAAA;AACA,EAAA,MAAMiK,YAAY,GAAG,CAAC,CAAC,GAAGpB,IAAI,IAAI,GAAG;AACrC,EAAA,OACE,CAACkB,kBAAkB,CAAC,CAAC,GAAGE,YAAY,CAAC,GAAGF,kBAAkB,CAACE,YAAY,CAAC,IACxE,CAAC;AAEL,CAAC;AAEM,MAAMJ,iBAAiB,GAAGA,CAC/BT,KAAA,GAAgC,EAAE,EAClCxN,OAAA,GAA4B,EAAE,KAC5B;EACF,MAAM;AAAEoM,IAAAA,IAAI,GAAG;AAAG,GAAE,GAAGoB,KAAK;EAC5B,MAAM;IACJC,MAAM,GAAGO,mBAAmB,EAAE;IAC9BnB,MAAM,GAAGqB,yBAAyB,CAAC;MAAE9B,IAAI;AAAEa,MAAAA,IAAI,EAAE;KAAG;AAAC,GACtD,GAAGjN,OAAO;EACX,IAAI;AAAES,IAAAA;AAAM,GAAE,GAAGT,OAAO;EAExB,IAAI,CAACS,MAAM,EAAE;AACXA,IAAAA,MAAM,GAAGI,IAAI,CAAC0F,GAAG,CAAC1F,IAAI,CAAC6M,IAAI,CAACtB,IAAI,GAAGqB,MAAM,CAAC,EAAE,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;AACxD,IAAA,IAAIhN,MAAM,GAAG,CAAC,KAAK,CAAC,EAAEA,MAAM,EAAE;AAChC,EAAA;AAEA,EAAA,MAAMuB,MAAM,GAAG,CAACvB,MAAM,GAAG,CAAC,IAAI,CAAC;AAC/B,EAAA,MAAMkJ,IAAI,GAAG,IAAI1I,YAAY,CAACR,MAAM,CAAC;EACrC,KAAK,IAAIa,CAAC,GAAG,CAAC,EAAEA,CAAC,IAAIU,MAAM,EAAEV,CAAC,EAAE,EAAE;IAChC,MAAM9B,KAAK,GAAGsO,aAAa,CAACxM,CAAC,GAAGU,MAAM,EAAEoK,IAAI,CAAC,GAAGS,MAAM;AACtDlD,IAAAA,IAAI,CAACrI,CAAC,CAAC,GAAG9B,KAAK;IACfmK,IAAI,CAAClJ,MAAM,GAAG,CAAC,GAAGa,CAAC,CAAC,GAAG9B,KAAK;AAC9B,EAAA;AAEA,EAAA,OAAOmK,IAAI;AACb,CAAC;;ACxHK,MAAO2E,oBAAoB,CAAA;AAC/B;;;;EAIOlC,IAAI;EAEXC,WAAAA,CAAmBrM,OAAA,GAAkC,EAAE,EAAA;IACrD,MAAM;AAAEoM,MAAAA,IAAI,GAAG;AAAG,KAAE,GAAGpM,OAAO;IAE9B,IAAI,CAACoM,IAAI,GAAGA,IAAI;AAClB,EAAA;AAEOG,EAAAA,WAAWA,CAACH,IAAI,GAAG,IAAI,CAACA,IAAI,EAAA;IACjC,OAAOwB,qBAAqB,CAACxB,IAAI,CAAC;AACpC,EAAA;AAEOK,EAAAA,WAAWA,CAAC3D,KAAa,EAAA;IAC9B,OAAO+E,qBAAqB,CAAC/E,KAAK,CAAC;AACrC,EAAA;AAEO4D,EAAAA,GAAGA,CAAC5H,CAAS,EAAA;AAClB,IAAA,OAAOyJ,uBAAuB,CAACzJ,CAAC,EAAE,IAAI,CAACsH,IAAI,CAAC;AAC9C,EAAA;AAEOQ,EAAAA,OAAOA,GAAA;AACZ,IAAA,OAAO,CAAC;AACV,EAAA;AAEOI,EAAAA,SAASA,CAACC,IAAa,EAAA;IAC5B,OAAOe,mBAAmB,CAACf,IAAI,CAAC;AAClC,EAAA;EAEOE,OAAOA,CAACnN,OAAA,GAA4B,EAAE,EAAA;AAC3C,IAAA,OAAOwO,2BAA2B,CAAC,IAAI,EAAExO,OAAO,CAAC;AACnD,EAAA;EAEOqN,eAAeA,CAACJ,IAAI,GAAG,CAAC,EAAA;AAC7B,IAAA,OAAOiB,yBAAyB,CAAC;MAAE9B,IAAI,EAAE,IAAI,CAACA,IAAI;AAAEa,MAAAA;AAAI,KAAE,CAAC;AAC7D,EAAA;AAEOK,EAAAA,aAAaA,GAAA;IAClB,OAAO,CAAC,MAAM,CAAC;AACjB,EAAA;;AAGK,MAAMiB,uBAAuB,GAAGA,CAACzJ,CAAS,EAAEsH,IAAY,KAAI;AACjE,EAAA,OAAQ,CAAC,GAAGA,IAAI,GAAGtH,CAAC,IAAK,CAAC,GAAGA,CAAC,IAAI,CAAC,GAAGsH,IAAI,IAAI,CAAC,CAAC;AAClD,CAAC;AAEM,MAAMoC,2BAA2B,GAAGA,CACzChB,KAAA,GAAgC,EAAE,EAClCxN,OAAA,GAA4B,EAAE,KAC5B;EACF,MAAM;AAAEoM,IAAAA,IAAI,GAAG;AAAG,GAAE,GAAGoB,KAAK;EAC5B,MAAM;IACJC,MAAM,GAAGO,mBAAmB,EAAE;IAC9BnB,MAAM,GAAGqB,yBAAyB,CAAC;MAAE9B,IAAI;AAAEa,MAAAA,IAAI,EAAE;KAAG;AAAC,GACtD,GAAGjN,OAAO;EACX,IAAI;AAAES,IAAAA;AAAM,GAAE,GAAGT,OAAO;EAExB,IAAI,CAACS,MAAM,EAAE;AACXA,IAAAA,MAAM,GAAGI,IAAI,CAAC0F,GAAG,CAAC1F,IAAI,CAAC6M,IAAI,CAACtB,IAAI,GAAGqB,MAAM,CAAC,EAAE,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;AACxD,IAAA,IAAIhN,MAAM,GAAG,CAAC,KAAK,CAAC,EAAEA,MAAM,EAAE;AAChC,EAAA;AAEA,EAAA,MAAMuB,MAAM,GAAG,CAACvB,MAAM,GAAG,CAAC,IAAI,CAAC;AAC/B,EAAA,MAAMkJ,IAAI,GAAG,IAAI1I,YAAY,CAACR,MAAM,CAAC;EACrC,KAAK,IAAIa,CAAC,GAAG,CAAC,EAAEA,CAAC,IAAIU,MAAM,EAAEV,CAAC,EAAE,EAAE;IAChC,MAAM9B,KAAK,GAAG+O,uBAAuB,CAACjN,CAAC,GAAGU,MAAM,EAAEoK,IAAI,CAAC,GAAGS,MAAM;AAChElD,IAAAA,IAAI,CAACrI,CAAC,CAAC,GAAG9B,KAAK;IACfmK,IAAI,CAAClJ,MAAM,GAAG,CAAC,GAAGa,CAAC,CAAC,GAAG,CAAC9B,KAAK;AAC/B,EAAA;AAEA,EAAA,OAAOmK,IAAI;AACb,CAAC;;AClFD;;;;;;;;;;;;;;AAcM,SAAU8E,qBAAqBA,CACnCC,OAAe,EACfC,EAAU,EACVC,GAAG,GAAG,IAAI,EACVC,OAAO,GAAG,GAAG,EAAA;AAEb,EAAA,IAAIH,OAAO,IAAI,CAAC,IAAIA,OAAO,IAAI,CAAC,EAAE;AAChC,IAAA,MAAM,IAAIpO,UAAU,CAAC,0BAA0B,CAAC;AAClD,EAAA;EAEA,IAAIqO,EAAE,KAAK,CAAC,EAAE;IACZ,OAAOzB,iBAAiB,CAACwB,OAAO,CAAC;AACnC,EAAA,CAAC,MAAM,IAAIC,EAAE,KAAK,CAAC,EAAE;IACnB,OAAOX,mBAAmB,CAACU,OAAO,CAAC;AACrC,EAAA;AAEA;EACA,IAAII,EAAE,GAAG,CAAC;EACV,IAAIC,EAAE,GAAG,EAAE;EACX,IAAIC,EAAE,GAAG,CAAC;AACV,EAAA,OAAOC,YAAY,CAACF,EAAE,EAAEJ,EAAE,CAAC,GAAGD,OAAO,IAAIM,EAAE,EAAE,GAAG,GAAG,EAAED,EAAE,IAAI,CAAC;EAC5D,KAAK,IAAIzN,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGuN,OAAO,EAAEvN,CAAC,EAAE,EAAE;AAChC,IAAA,MAAM4N,GAAG,GAAG,GAAG,IAAIJ,EAAE,GAAGC,EAAE,CAAC;AAC3B,IAAA,MAAMI,GAAG,GAAGF,YAAY,CAACC,GAAG,EAAEP,EAAE,CAAC;AACjC,IAAA,IAAI9N,IAAI,CAAC2D,GAAG,CAAC2K,GAAG,GAAGT,OAAO,CAAC,GAAGE,GAAG,EAAE,OAAOM,GAAG;IAC7C,IAAIC,GAAG,GAAGT,OAAO,EAAE;AACjBI,MAAAA,EAAE,GAAGI,GAAG;AACV,IAAA,CAAC,MAAM;AACLH,MAAAA,EAAE,GAAGG,GAAG;AACV,IAAA;AACF,EAAA;AACA,EAAA,OAAO,GAAG,IAAIJ,EAAE,GAAGC,EAAE,CAAC;AACxB;AAEA,SAASK,GAAGA,CAACtK,CAAS,EAAA;EACpB,MAAMuK,IAAI,GAAGvK,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC;AAC3BA,EAAAA,CAAC,GAAGjE,IAAI,CAAC2D,GAAG,CAACM,CAAC,CAAC;EACf,MAAMwK,EAAE,GAAG,WAAW;EACtB,MAAMC,EAAE,GAAG,YAAY;EACvB,MAAMC,EAAE,GAAG,WAAW;EACtB,MAAMC,EAAE,GAAG,YAAY;EACvB,MAAMC,EAAE,GAAG,WAAW;EACtB,MAAMxF,CAAC,GAAG,SAAS;EACnB,MAAMrH,CAAC,GAAG,CAAC,IAAI,CAAC,GAAGqH,CAAC,GAAGpF,CAAC,CAAC;AACzB,EAAA,MAAMkC,CAAC,GACL,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC0I,EAAE,GAAG7M,CAAC,GAAG4M,EAAE,IAAI5M,CAAC,GAAG2M,EAAE,IAAI3M,CAAC,GAAG0M,EAAE,IAAI1M,CAAC,GAAGyM,EAAE,IAAIzM,CAAC,GAAGhC,IAAI,CAAC0M,GAAG,CAAC,CAACzI,CAAC,GAAGA,CAAC,CAAC;EAC3E,OAAOuK,IAAI,GAAGrI,CAAC;AACjB;AAEA,MAAM2I,OAAO,GAAG9O,IAAI,CAACiG,IAAI,CAACjG,IAAI,CAACkL,GAAG,CAAC,CAAC,CAAC,CAAC;AACtC,SAAS6D,SAASA,CAACxN,CAAS,EAAA;AAC1B,EAAA,OAAOgN,GAAG,CAAChN,CAAC,GAAGuN,OAAO,CAAC;AACzB;AACA,SAASE,QAAQA,CAACzN,CAAS,EAAA;EACzB,OAAQ,CAAC,GAAGvB,IAAI,CAAC4K,EAAE,GAAI5K,IAAI,CAACiP,IAAI,CAAC1N,CAAC,CAAC;AACrC;AACA,SAAS6M,YAAYA,CAAC7M,CAAS,EAAEuM,EAAU,EAAA;AACzC,EAAA,OAAO,CAAC,CAAC,GAAGA,EAAE,IAAIkB,QAAQ,CAACzN,CAAC,CAAC,GAAGuM,EAAE,GAAGiB,SAAS,CAACxN,CAAC,CAAC;AACnD;;ACjBM,MAAO2N,WAAW,CAAA;EACf3D,IAAI;AACX;;;;EAIOuC,EAAE;EAETtC,WAAAA,CAAmBrM,OAAA,GAAmC,EAAE,EAAA;IACtD,MAAM;AAAEoM,MAAAA,IAAI,GAAG,GAAG;AAAEuC,MAAAA,EAAE,GAAG;AAAG,KAAE,GAAG3O,OAAO;IAExC,IAAI,CAAC2O,EAAE,GAAGA,EAAE;IACZ,IAAI,CAACvC,IAAI,GAAGA,IAAI;AAClB,EAAA;EAEOG,WAAWA,CAACH,IAAI,GAAG,IAAI,CAACA,IAAI,EAAEuC,EAAE,GAAG,IAAI,CAACA,EAAE,EAAA;AAC/C,IAAA,OAAOqB,sBAAsB,CAAC5D,IAAI,EAAEuC,EAAE,CAAC;AACzC,EAAA;AAEOlC,EAAAA,WAAWA,CAAC3D,KAAa,EAAE6F,EAAA,GAAa,IAAI,CAACA,EAAE,EAAA;AACpD,IAAA,OAAOsB,sBAAsB,CAACnH,KAAK,EAAE6F,EAAE,CAAC;AAC1C,EAAA;AAEOjC,EAAAA,GAAGA,CAAC5H,CAAS,EAAA;IAClB,OAAOoL,cAAc,CAACpL,CAAC,EAAE,IAAI,CAACsH,IAAI,EAAE,IAAI,CAACuC,EAAE,CAAC;AAC9C,EAAA;EAEO/B,OAAOA,CAACC,MAAM,GAAG,CAAC,EAAA;AACvB,IAAA,OAAOsD,kBAAkB,CAAC;MAAE/D,IAAI,EAAE,IAAI,CAACA,IAAI;MAAES,MAAM;MAAE8B,EAAE,EAAE,IAAI,CAACA;AAAE,KAAE,CAAC;AACrE,EAAA;AAEO3B,EAAAA,SAASA,CAACC,IAAa,EAAA;AAC5B,IAAA,OAAOmD,oBAAoB,CAACnD,IAAI,EAAE,IAAI,CAAC0B,EAAE,CAAC;AAC5C,EAAA;EAEOxB,OAAOA,CAACnN,OAAA,GAA4B,EAAE,EAAA;IAC3C,MAAM;MACJS,MAAM;MACNgN,MAAM;MACNZ,MAAM,GAAGwD,0BAA0B,CAAC;QAClCjE,IAAI,EAAE,IAAI,CAACA,IAAI;QACfuC,EAAE,EAAE,IAAI,CAACA,EAAE;AACX1B,QAAAA,IAAI,EAAE;AACP,OAAA;AAAC,KACH,GAAGjN,OAAO;IACX,OAAOsQ,kBAAkB,CAAC,IAAI,EAAE;MAAE7C,MAAM;MAAEhN,MAAM;AAAEoM,MAAAA;AAAM,KAAE,CAAC;AAC7D,EAAA;EAEOQ,eAAeA,CAACJ,IAAI,GAAG,CAAC,EAAA;AAC7B,IAAA,OAAOoD,0BAA0B,CAAC;MAAEjE,IAAI,EAAE,IAAI,CAACA,IAAI;MAAEuC,EAAE,EAAE,IAAI,CAACA,EAAE;AAAE1B,MAAAA;AAAI,KAAE,CAAC;AAC3E,EAAA;AAEOK,EAAAA,aAAaA,GAAA;AAClB,IAAA,OAAO,CAAC,MAAM,EAAE,IAAI,CAAC;AACvB,EAAA;;AAGK,MAAM+C,0BAA0B,GAAGA,CACxCrQ,OAAA,GAA8C,EAAE,KAC9C;EACF,MAAM;AAAEoM,IAAAA,IAAI,GAAG,CAAC;AAAEuC,IAAAA,EAAE,GAAG,GAAG;AAAE1B,IAAAA,IAAI,GAAG;AAAC,GAAE,GAAGjN,OAAO;AAChD,EAAA,OAAQ,CAAC,GAAGiN,IAAI,IAAKb,IAAI,IAAIuC,EAAE,GAAGnD,gBAAgB,GAAG,CAAC,CAAC,GAAGmD,EAAE,IAAI9N,IAAI,CAAC4K,EAAE,CAAC,CAAC;AAC3E,CAAC;AAEM,MAAMyE,cAAc,GAAGA,CAACpL,CAAS,EAAEsH,IAAY,EAAEuC,EAAU,KAAI;AACpE,EAAA,OAAO,CAAC,CAAC,GAAGA,EAAE,IAAIb,aAAa,CAAChJ,CAAC,EAAEsH,IAAI,CAAC,GAAGuC,EAAE,GAAGhC,WAAW,CAAC7H,CAAC,EAAEsH,IAAI,CAAC;AACtE,CAAC;AAEM,MAAM6D,sBAAsB,GAAGA,CAACnH,KAAa,EAAE6F,EAAE,GAAG,GAAG,KAAI;AAChE,EAAA,OAAO7F,KAAK,IAAI6F,EAAE,GAAG/C,mBAAmB,GAAG,CAAC,CAAC;AAC/C,CAAC;AAEM,MAAMoE,sBAAsB,GAAGA,CAAC5D,IAAY,EAAEuC,EAAE,GAAG,GAAG,KAAI;AAC/D,EAAA,OAAOvC,IAAI,IAAIuC,EAAE,GAAG/C,mBAAmB,GAAG,CAAC,CAAC;AAC9C,CAAC;AAEM,MAAMuE,kBAAkB,GAAInQ,OAAkC,IAAI;EACvE,MAAM;AAAEoM,IAAAA,IAAI,GAAG,GAAG;AAAES,IAAAA,MAAM,GAAG,CAAC;AAAE8B,IAAAA,EAAE,GAAG;AAAG,GAAE,GAAG3O,OAAO;AACpD,EAAA,OAAQoM,IAAI,GAAGS,MAAM,IAAI8B,EAAE,GAAGnD,gBAAgB,GAAG,CAAC,CAAC,GAAGmD,EAAE,IAAI9N,IAAI,CAAC4K,EAAE,CAAC,GAAI,CAAC;AAC3E,CAAC;AAEM,MAAM2E,oBAAoB,GAAGA,CAACnD,IAAI,GAAG,MAAM,EAAE0B,EAAE,GAAG,GAAG,KAAI;AAC9D,EAAA,OAAOF,qBAAqB,CAACxB,IAAI,EAAE0B,EAAE,CAAC;AACxC,CAAC;AAEM,MAAM2B,kBAAkB,GAAGA,CAChC9C,KAAA,GAAiC,EAAE,EACnCxN,OAAA,GAA4B,EAAE,KAC5B;EACF,MAAM;AAAEoM,IAAAA,IAAI,GAAG,GAAG;AAAEuC,IAAAA,EAAE,GAAG;AAAG,GAAE,GAAGnB,KAAK;EACtC,MAAM;AAAEC,IAAAA,MAAM,GAAG2C,oBAAoB,CAAC,KAAK,EAAEzB,EAAE;AAAC,GAAE,GAAG3O,OAAO;EAC5D,IAAI;IAAES,MAAM;IAAEoM,MAAM,GAAGwD,0BAA0B,CAAC;MAAEjE,IAAI;MAAEuC,EAAE;AAAE1B,MAAAA,IAAI,EAAE;KAAG;AAAC,GAAE,GACxEjN,OAAO;EAET,IAAI,CAAC6M,MAAM,EAAE;AACXA,IAAAA,MAAM,GACJ,CAAC,IACC8B,EAAE,GAAG9N,IAAI,CAACiG,IAAI,CAAC,CAACwE,mBAAmB,GAAGzK,IAAI,CAAC4K,EAAE,CAAC,GAAIW,IAAI,GACrD,CAAC,CAAC,GAAGuC,EAAE,IAAIvC,IAAI,GAAGvL,IAAI,CAAC4K,EAAE,GAAI,CAAC,CAAC;AACtC,EAAA;EAEA,IAAI,CAAChL,MAAM,EAAE;AACXA,IAAAA,MAAM,GAAGI,IAAI,CAAC0F,GAAG,CAAC1F,IAAI,CAAC6M,IAAI,CAACtB,IAAI,GAAGqB,MAAM,CAAC,EAAE,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;AACxD,IAAA,IAAIhN,MAAM,GAAG,CAAC,KAAK,CAAC,EAAEA,MAAM,EAAE;AAChC,EAAA;AAEA,EAAA,MAAMuB,MAAM,GAAG,CAACvB,MAAM,GAAG,CAAC,IAAI,CAAC;AAC/B,EAAA,MAAMkJ,IAAI,GAAG,IAAI1I,YAAY,CAACR,MAAM,CAAC;EACrC,KAAK,IAAIa,CAAC,GAAG,CAAC,EAAEA,CAAC,IAAIU,MAAM,EAAEV,CAAC,EAAE,EAAE;AAChC,IAAA,MAAM9B,KAAK,GAAG0Q,cAAc,CAAC5O,CAAC,GAAGU,MAAM,EAAEoK,IAAI,EAAEuC,EAAE,CAAC,GAAG9B,MAAM;AAC3DlD,IAAAA,IAAI,CAACrI,CAAC,CAAC,GAAG9B,KAAK;IACfmK,IAAI,CAAClJ,MAAM,GAAG,CAAC,GAAGa,CAAC,CAAC,GAAG9B,KAAK;AAC9B,EAAA;AAEA,EAAA,OAAOmK,IAAI;AACb,CAAC;;AC1ID;;;;;AAKM,MAAO4G,cAAc,CAAA;EACjBC,MAAM;EACNC,MAAM;EACNC,KAAK;EACLC,GAAG;EACHC,wBAAwB;EAEhCvE,WAAAA,CAAmBrM,OAAA,GAAsC,EAAE,EAAA;IACzD,MAAM;MAAE6Q,KAAK;MAAEC,KAAK;MAAE1E,IAAI;AAAEuC,MAAAA,EAAE,GAAG;AAAG,KAAE,GAAG3O,OAAO;IAEhD,IAAI,CAAC2Q,GAAG,GAAGhC,EAAE;IACb,IAAI,CAAC+B,KAAK,GAAG,CAAC;IACd,IAAI,CAACF,MAAM,GAAG,CAAC;IACf,IAAI,CAACC,MAAM,GAAG,CAAC;IACf,IAAI,CAACG,wBAAwB,GAAGG,uBAAuB,CAAC,CAAC,GAAGpC,EAAE,CAAC;IAE/D,IAAIkC,KAAK,IAAIC,KAAK,EAAE;MAClB,IAAI,CAACN,MAAM,GAAGK,KAAK;MACnB,IAAI,CAACC,KAAK,GAAGA,KAAK;IACpB,CAAC,MAAM,IAAI1E,IAAI,EAAE;MACf,IAAI,CAACA,IAAI,GAAGA,IAAI;AAClB,IAAA;AACF,EAAA;EAEA,IAAWyE,KAAKA,CAACrR,KAAa,EAAA;IAC5B,MAAMwR,aAAa,GAAGC,qBAAqB,CAACzR,KAAK,EAAE,IAAI,CAACiR,MAAM,CAAC;AAC/D,IAAA,MAAMS,kBAAkB,GAAG,IAAI,CAACT,MAAM,GAAGO,aAAa;IACtD,IAAI,CAACN,KAAK,GAAGM,aAAa;IAC1B,IAAI,CAACL,GAAG,GACN,CAAC,IACA,OAAO,GAAGO,kBAAkB,GAC3B,OAAO,GAAGA,kBAAkB,GAAGA,kBAAkB,GACjD,OAAO,GAAGA,kBAAkB,GAAGA,kBAAkB,GAAGA,kBAAkB,CAAC;IAC3E,IAAI,CAACV,MAAM,GAAGhR,KAAK;IACnB,IAAI,CAACoR,wBAAwB,GAAGM,kBAAkB;AACpD,EAAA;AAEA,EAAA,IAAWL,KAAKA,GAAA;IACd,OAAO,IAAI,CAACL,MAAM;AACpB,EAAA;EAEA,IAAWM,KAAKA,CAACtR,KAAa,EAAA;IAC5B,MAAMwR,aAAa,GAAGC,qBAAqB,CAAC,IAAI,CAACT,MAAM,EAAEhR,KAAK,CAAC;AAC/D,IAAA,MAAM0R,kBAAkB,GAAG1R,KAAK,GAAGwR,aAAa;IAChD,IAAI,CAACN,KAAK,GAAGM,aAAa;IAC1B,IAAI,CAACL,GAAG,GACN,CAAC,IACA,OAAO,GAAGO,kBAAkB,GAC3B,OAAO,GAAGA,kBAAkB,GAAGA,kBAAkB,GACjD,OAAO,GAAGA,kBAAkB,GAAGA,kBAAkB,GAAGA,kBAAkB,CAAC;IAC3E,IAAI,CAACT,MAAM,GAAGjR,KAAK;IACnB,IAAI,CAACoR,wBAAwB,GAAGM,kBAAkB;AACpD,EAAA;AAEA,EAAA,IAAWJ,KAAKA,GAAA;IACd,OAAO,IAAI,CAACL,MAAM;AACpB,EAAA;EAEA,IAAW9B,EAAEA,CAACnP,KAAa,EAAA;AACzB,IAAA,MAAM0R,kBAAkB,GAAGH,uBAAuB,CAAC,CAAC,GAAGvR,KAAK,CAAC;IAC7D,IAAI,CAACoR,wBAAwB,GAAGM,kBAAkB;AAClD,IAAA,IAAI,CAACT,MAAM,GAAG,IAAI,CAACC,KAAK,GAAGQ,kBAAkB;IAC7C,IAAI,CAACV,MAAM,GAAG,IAAI,CAACE,KAAK,IAAI,CAAC,GAAGQ,kBAAkB,CAAC;IACnD,IAAI,CAACP,GAAG,GAAGnR,KAAK;AAClB,EAAA;AAEA,EAAA,IAAWmP,EAAEA,GAAA;IACX,OAAO,IAAI,CAACgC,GAAG;AACjB,EAAA;EAEA,IAAWvE,IAAIA,CAAC5M,KAAa,EAAA;AAC3B,IAAA,MAAM0R,kBAAkB,GACtB,IAAI,CAACN,wBAAwB,IAAIG,uBAAuB,CAAC,CAAC,GAAG,IAAI,CAACJ,GAAG,CAAC;AACxE,IAAA,IAAI,CAACF,MAAM,GAAGjR,KAAK,GAAG0R,kBAAkB;IACxC,IAAI,CAACV,MAAM,GAAGhR,KAAK,IAAI,CAAC,GAAG0R,kBAAkB,CAAC;IAC9C,IAAI,CAACR,KAAK,GAAGlR,KAAK;AACpB,EAAA;AAEA,EAAA,IAAW4M,IAAIA,GAAA;IACb,OAAO,IAAI,CAACsE,KAAK;AACnB,EAAA;EAEOnE,WAAWA,CAACH,IAAI,GAAG,IAAI,CAACsE,KAAK,EAAE/B,EAAE,GAAG,IAAI,CAACgC,GAAG,EAAA;AACjD,IAAA,OAAOX,sBAAsB,CAAC5D,IAAI,EAAEuC,EAAE,CAAC;AACzC,EAAA;AAEOlC,EAAAA,WAAWA,CAAC3D,KAAa,EAAE6F,EAAA,GAAa,IAAI,CAACgC,GAAG,EAAA;AACrD,IAAA,OAAOV,sBAAsB,CAACnH,KAAK,EAAE6F,EAAE,CAAC;AAC1C,EAAA;AAEOjC,EAAAA,GAAGA,CAAC5H,CAAS,EAAA;IAClB,OAAOoL,cAAc,CAACpL,CAAC,EAAE,IAAI,CAAC4L,KAAK,EAAE,IAAI,CAACC,GAAG,CAAC;AAChD,EAAA;EAEO/D,OAAOA,CAACC,MAAM,GAAG,CAAC,EAAA;AACvB,IAAA,OAAOsD,kBAAkB,CAAC;MAAE/D,IAAI,EAAE,IAAI,CAACsE,KAAK;MAAE7D,MAAM;MAAE8B,EAAE,EAAE,IAAI,CAACgC;AAAG,KAAE,CAAC;AACvE,EAAA;AAEO3D,EAAAA,SAASA,CAACC,IAAa,EAAA;AAC5B,IAAA,OAAOmD,oBAAoB,CAACnD,IAAI,EAAE,IAAI,CAAC0D,GAAG,CAAC;AAC7C,EAAA;EAEOxD,OAAOA,CAACnN,OAAA,GAA4B,EAAE,EAAA;IAC3C,MAAM;MACJS,MAAM;MACNgN,MAAM;MACNZ,MAAM,GAAGwD,0BAA0B,CAAC;QAClCjE,IAAI,EAAE,IAAI,CAACsE,KAAK;QAChB/B,EAAE,EAAE,IAAI,CAACgC,GAAG;AACZ1D,QAAAA,IAAI,EAAE;AACP,OAAA;AAAC,KACH,GAAGjN,OAAO;IACX,OAAOsQ,kBAAkB,CAAC,IAAI,EAAE;MAAE7C,MAAM;MAAEhN,MAAM;AAAEoM,MAAAA;AAAM,KAAE,CAAC;AAC7D,EAAA;EAEOQ,eAAeA,CAACJ,IAAI,GAAG,CAAC,EAAA;AAC7B,IAAA,OAAOoD,0BAA0B,CAAC;MAChCjE,IAAI,EAAE,IAAI,CAACsE,KAAK;MAChB/B,EAAE,EAAE,IAAI,CAACgC,GAAG;AACZ1D,MAAAA;KACD,CAAC;AACJ,EAAA;AAEOK,EAAAA,aAAaA,GAAA;AAClB,IAAA,OAAO,CAAC,OAAO,EAAE,OAAO,CAAC;AAC3B,EAAA;;AAGF;;;;;;;AAOA,SAAS2D,qBAAqBA,CAACJ,KAAa,EAAEC,KAAa,EAAA;EACzD,OACE,CAACD,KAAK,IAAI,CAAC,GACT,OAAO,GAAGA,KAAK,IAAI,CAAC,GAAGC,KAAK,GAC5B,OAAO,GAAGD,KAAK,IAAI,CAAC,GAAGC,KAAK,IAAI,CAAC,GACjC,OAAO,GAAGD,KAAK,IAAI,CAAC,GAAGC,KAAK,IAAI,CAAC,GACjC,OAAO,GAAGD,KAAK,GAAGC,KAAK,IAAI,CAAC,GAC5BA,KAAK,IAAI,CAAC,KACZ,GAAG;AAEP;AAEA;;;;;;AAMA,SAASC,uBAAuBA,CAACG,kBAA0B,EAAA;EACzD,IAAIC,QAAQ,GAAGD,kBAAkB;EACjC,KAAK,IAAI5P,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG,CAAC,EAAEA,CAAC,EAAE,EAAE;IAC1B,MAAM8P,CAAC,GACL,OAAO,GAAGD,QAAQ,GAClB,OAAO,GAAGA,QAAQ,GAAGA,QAAQ,GAC7B,OAAO,GAAGA,QAAQ,GAAGA,QAAQ,GAAGA,QAAQ,GACxCD,kBAAkB;AACpB,IAAA,MAAMG,EAAE,GACN,OAAO,GAAG,CAAC,GAAG,OAAO,GAAGF,QAAQ,GAAG,CAAC,GAAG,OAAO,GAAGA,QAAQ,GAAGA,QAAQ;IACtEA,QAAQ,IAAIC,CAAC,GAAGC,EAAE;AACpB,EAAA;AACA,EAAA,OAAOF,QAAQ;AACjB;;AC9KA;;;;;;AAMM,MAAOG,qBAAqB,CAAA;AAChC;;;;EAIOlF,IAAI;AACX;;;;EAIOnC,KAAK;EAEZoC,WAAAA,CAAmBrM,OAAA,GAA6C,EAAE,EAAA;IAChE,MAAM;AAAEoM,MAAAA,IAAI,GAAG,GAAG;AAAEnC,MAAAA,KAAK,GAAG;AAAG,KAAE,GAAGjK,OAAO;IAE3C,IAAI,CAACoM,IAAI,GAAGA,IAAI;IAChB,IAAI,CAACnC,KAAK,GAAGA,KAAK;AACpB,EAAA;AAEOsC,EAAAA,WAAWA,CAACH,IAAI,GAAG,IAAI,CAACA,IAAI,EAAA;IACjC,OAAOmF,gCAAgC,CAACnF,IAAI,CAAC;AAC/C,EAAA;AAEOK,EAAAA,WAAWA,CAAC3D,KAAa,EAAA;IAC9B,OAAO0I,gCAAgC,CAAC1I,KAAK,CAAC;AAChD,EAAA;AAEO4D,EAAAA,GAAGA,CAAC5H,CAAS,EAAA;IAClB,OAAO2M,wBAAwB,CAAC3M,CAAC,EAAE,IAAI,CAACsH,IAAI,EAAE,IAAI,CAACnC,KAAK,CAAC;AAC3D,EAAA;EAEO2C,OAAOA,CAACC,MAAM,GAAG,CAAC,EAAA;AACvB,IAAA,OAAO6E,4BAA4B,CAAC;MAClCtF,IAAI,EAAE,IAAI,CAACA,IAAI;MACfS,MAAM;MACN5C,KAAK,EAAE,IAAI,CAACA;KACb,CAAC;AACJ,EAAA;AAEO+C,EAAAA,SAASA,CAACC,IAAa,EAAA;IAC5B,OAAO0E,8BAA8B,CAAC1E,IAAI,CAAC;AAC7C,EAAA;EAEOE,OAAOA,CAACnN,OAAA,GAA4B,EAAE,EAAA;AAC3C,IAAA,OAAO4R,4BAA4B,CAAC,IAAI,EAAE5R,OAAO,CAAC;AACpD,EAAA;EAEOqN,eAAeA,CAACJ,IAAI,GAAG,CAAC,EAAA;IAC7B,MAAM;MAAEhD,KAAK;AAAEmC,MAAAA;AAAI,KAAE,GAAG,IAAI;AAC5B,IAAA,OAAOyF,oCAAoC,CAAC;MAAEzF,IAAI;MAAEa,IAAI;AAAEhD,MAAAA;AAAK,KAAE,CAAC;AACpE,EAAA;AAEOqD,EAAAA,aAAaA,GAAA;AAClB,IAAA,OAAO,CAAC,MAAM,EAAE,OAAO,CAAC;AAC1B,EAAA;;AAGK,MAAMuE,oCAAoC,GAAGA,CAAC;AACnDzF,EAAAA,IAAI,GAAG,CAAC;AACRnC,EAAAA,KAAK,GAAG,CAAC;AACTgD,EAAAA,IAAI,GAAG;AAAC,CACT,KAAI;EACH,OAAQA,IAAI,GAAGb,IAAI,IAAI,OAAO,GAAG,QAAQ,GAAGnC,KAAK,CAAC,GAAI,CAAC;AACzD,CAAC;AAED;;;;;AAKO,MAAMyH,4BAA4B,GACvC1R,OAA4C,IAC1C;EACF,MAAM;AAAEoM,IAAAA,IAAI,GAAG,GAAG;AAAES,IAAAA,MAAM,GAAG,CAAC;AAAE5C,IAAAA,KAAK,GAAG;AAAC,GAAE,GAAGjK,OAAO;EACrD,OAAQ6M,MAAM,GAAGT,IAAI,IAAI,OAAO,GAAG,QAAQ,GAAGnC,KAAK,CAAC,GAAI,CAAC;AAC3D,CAAC;AAEM,MAAMwH,wBAAwB,GAAGA,CACtC3M,CAAS,EACTsH,IAAY,EACZnC,KAAa,KACX;EACF,MAAM6H,CAAC,GAAG,CAAE,CAAC,GAAGhN,CAAC,GAAIsH,IAAI,KAAK,CAAC;EAC/B,OAAO,CAAC,CAAC,GAAGnC,KAAK,KAAK,CAAC,GAAG6H,CAAC,CAAC,GAAI7H,KAAK,IAAI,CAAC,GAAG6H,CAAC,GAAG,CAAC,CAAC,IAAK,CAAC,GAAGA,CAAC,GAAGA,CAAC,IAAI,CAAC,CAAC;AACzE,CAAC;AAEM,MAAMN,gCAAgC,GAAI1I,KAAa,IAAI;EAChE,OAAOA,KAAK,GAAG4C,UAAU;AAC3B,CAAC;AAEM,MAAM6F,gCAAgC,GAAInF,IAAY,IAAI;EAC/D,OAAOA,IAAI,GAAGV,UAAU;AAC1B,CAAC;AAED,MAAMqG,6BAA6B,GAAI7H,CAAS,IAC9CrJ,IAAI,CAACuN,GAAG,CAACvN,IAAI,CAAC4K,EAAE,IAAIvB,CAAC,GAAG,GAAG,CAAC,CAAC;AAExB,MAAMyH,8BAA8B,GAAGA,CAAC1E,IAAI,GAAG,MAAM,KAAI;EAC9D,IAAIA,IAAI,IAAI,CAAC,EAAE;AACb,IAAA,MAAM,IAAI7I,KAAK,CAAC,wBAAwB,CAAC;AAC3C,EAAA;AACA,EAAA,MAAMiK,YAAY,GAAG,CAAC,CAAC,GAAGpB,IAAI,IAAI,GAAG;AACrC,EAAA,OACE,CAAC8E,6BAA6B,CAAC,CAAC,GAAG1D,YAAY,CAAC,GAC9C0D,6BAA6B,CAAC1D,YAAY,CAAC,IAC7C,CAAC;AAEL,CAAC;AAMM,MAAMuD,4BAA4B,GAAGA,CAC1CpE,KAAA,GAA2C,EAAE,EAC7CxN,OAAA,GAAwC,EAAE,KACxC;EACF,MAAM;AAAEoM,IAAAA,IAAI,GAAG,GAAG;AAAEnC,IAAAA,KAAK,GAAG;AAAC,GAAE,GAAGuD,KAAK;EACvC,MAAM;IACJC,MAAM,GAAGkE,8BAA8B,EAAE;IACzC9E,MAAM,GAAGgF,oCAAoC,CAAC;MAAEzF,IAAI;AAAEa,MAAAA,IAAI,EAAE,CAAC;AAAEhD,MAAAA;KAAO;AAAC,GACxE,GAAGjK,OAAO;EACX,IAAI;AAAES,IAAAA;AAAM,GAAE,GAAGT,OAAO;EAExB,IAAI,CAACS,MAAM,EAAE;AACXA,IAAAA,MAAM,GAAGI,IAAI,CAAC0F,GAAG,CAAC1F,IAAI,CAAC6M,IAAI,CAACtB,IAAI,GAAGqB,MAAM,CAAC,EAAE,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;AACxD,IAAA,IAAIhN,MAAM,GAAG,CAAC,KAAK,CAAC,EAAEA,MAAM,EAAE;AAChC,EAAA;AAEA,EAAA,MAAMuB,MAAM,GAAG,CAACvB,MAAM,GAAG,CAAC,IAAI,CAAC;AAC/B,EAAA,MAAMkJ,IAAI,GAAG,IAAI1I,YAAY,CAACR,MAAM,CAAC;EACrC,KAAK,IAAIa,CAAC,GAAG,CAAC,EAAEA,CAAC,IAAIU,MAAM,EAAEV,CAAC,EAAE,EAAE;AAChC,IAAA,MAAM9B,KAAK,GAAGiS,wBAAwB,CAACnQ,CAAC,GAAGU,MAAM,EAAEoK,IAAI,EAAEnC,KAAK,CAAC,GAAG4C,MAAM;AACxElD,IAAAA,IAAI,CAACrI,CAAC,CAAC,GAAG9B,KAAK;IACfmK,IAAI,CAAClJ,MAAM,GAAG,CAAC,GAAGa,CAAC,CAAC,GAAG9B,KAAK;AAC9B,EAAA;AAEA,EAAA,OAAOmK,IAAI;AACb,CAAC;;ACvKD;;;;;AAKM,SAAUqI,UAAUA,CAACxE,KAAc,EAAA;EACvC,MAAM;AAAEyE,IAAAA;AAAI,GAAE,GAAGzE,KAAK;AAEtB,EAAA,QAAQyE,IAAI;AACV,IAAA,KAAK,UAAU;AACb,MAAA,OAAO,IAAI9F,QAAQ,CAACqB,KAAK,CAAC;AAC5B,IAAA,KAAK,YAAY;AACf,MAAA,OAAO,IAAIG,UAAU,CAACH,KAAK,CAAC;AAC9B,IAAA,KAAK,aAAa;AAChB,MAAA,OAAO,IAAIuC,WAAW,CAACvC,KAAK,CAAC;AAC/B,IAAA,KAAK,gBAAgB;AACnB,MAAA,OAAO,IAAI+C,cAAc,CAAC/C,KAAK,CAAC;AAClC,IAAA,KAAK,sBAAsB;AACzB,MAAA,OAAO,IAAIc,oBAAoB,CAACd,KAAK,CAAC;AACxC,IAAA,KAAK,uBAAuB;AAC1B,MAAA,OAAO,IAAI8D,qBAAqB,CAAC9D,KAAK,CAAC;AACzC,IAAA;AAAS,MAAA;AACP,QAAA,MAAM,IAAIpJ,KAAK,CAAC,CAAA,qBAAA,EAAwB6N,IAAc,EAAE,CAAC;AAC3D,MAAA;AACF;AACF;;AChCA;;;;;AAMM,SAAUC,cAAcA,CAACC,aAA6B,EAAA;EAC1D,OAAO,SAASC,WAAWA,CAACC,UAAoB,EAAA;AAC9C,IAAA,KAAK,MAAMzI,IAAI,IAAIuI,aAAa,EAAE;AAChC,MAAA,KAAK,IAAI7Q,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG+Q,UAAU,CAAC5R,MAAM,EAAEa,CAAC,EAAE,EAAE;AAE1C,QAAA,MAAMgR,WAAW,GAAG1I,IAAI,CAACyI,UAAU,CAAC/Q,CAAC,CAGpC;AACDsI,QAAAA,IAAI,CAAC2I,QAAQ,CAACD,WAAW,CAAC,GAAGD,UAAU,CAACzI,IAAI,CAAC7E,SAAS,GAAGzD,CAAC,CAAC;AAC7D,MAAA;AACF,IAAA;AACA,IAAA,OAAQwD,CAAS,IAAI;MACnB,IAAI0N,MAAM,GAAG,CAAC;AACd,MAAA,KAAK,MAAM5I,IAAI,IAAIuI,aAAa,EAAE;AAChC,QAAA,MAAMM,KAAK,GAAGJ,UAAU,CAACzI,IAAI,CAAC7E,SAAS,CAAC;QACxC,MAAMiC,CAAC,GAAGqL,UAAU,CAACzI,IAAI,CAAC7E,SAAS,GAAG,CAAC,CAAC;AACxCyN,QAAAA,MAAM,IAAIxL,CAAC,GAAG4C,IAAI,CAAC2I,QAAQ,CAAC7F,GAAG,CAAC5H,CAAC,GAAG2N,KAAK,CAAC;AAC5C,MAAA;AACA,MAAA,OAAOD,MAAM;IACf,CAAC;EACH,CAAC;AACH;;ACxBM,SAAUE,wBAAwBA,CACtCP,aAA6B,EAC7BQ,WAAyB,EACzB7N,CAAc,EACd8N,UAAwB,EACxBC,eAAgE,EAChEC,MAAc,EAAA;AAMd,EAAA,MAAMC,YAAY,GAAG/P,KAAK,CAACiC,IAAI,CAAC2N,UAAU,CAAC;EAC3C,MAAMI,QAAQ,GAAW,EAAE;AAC3B,EAAA,KAAK,MAAMpJ,IAAI,IAAIuI,aAAa,EAAE;IAChC,MAAM;MAAEpJ,EAAE;MAAEyE,KAAK;MAAE6E,UAAU;AAAEtN,MAAAA;AAAS,KAAE,GAAG6E,IAAI;AACjD,IAAA,IAAIqJ,OAAO,GAAG;AAAEnO,MAAAA,CAAC,EAAE,CAAC;AAAEkC,MAAAA,CAAC,EAAE,CAAC;AAAEwG,MAAAA;KAAO;AACnC,IAAA,IAAIzE,EAAE,EAAE;AACN;AACAkK,MAAAA,OAAO,GAAG;AAAE,QAAA,GAAGA,OAAO;AAAElK,QAAAA;OAAI;AAC9B,IAAA;AACAkK,IAAAA,OAAO,CAACnO,CAAC,GAAGiO,YAAY,CAAChO,SAAS,CAAC;IACnCkO,OAAO,CAACjM,CAAC,GAAG+L,YAAY,CAAChO,SAAS,GAAG,CAAC,CAAC,GAAG+N,MAAM;AAChD,IAAA,KAAK,IAAIxR,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG+Q,UAAU,CAAC5R,MAAM,EAAEa,CAAC,EAAE,EAAE;AAC1C;AACA2R,MAAAA,OAAO,CAACzF,KAAK,CAAC6E,UAAU,CAAC/Q,CAAC,CAAC,CAAC,GAAGyR,YAAY,CAAChO,SAAS,GAAGzD,CAAC,CAAC;AAC5D,IAAA;AACA0R,IAAAA,QAAQ,CAACzL,IAAI,CAAC0L,OAAO,CAAC;AACxB,EAAA;AAEA,EAAA,MAAMvG,GAAG,GAAGmG,eAAe,CAACE,YAAY,CAAC;EACzC,IAAIG,KAAK,GAAG,CAAC;AACb,EAAA,KAAK,IAAI5R,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGqR,WAAW,CAAClS,MAAM,EAAEa,CAAC,EAAE,EAAE;AAC3C4R,IAAAA,KAAK,IAAI,CAACP,WAAW,CAACrR,CAAC,CAAC,GAAGoL,GAAG,CAAC5H,CAAC,CAACxD,CAAC,CAAC,CAAC,KAAK,CAAC;AAC5C,EAAA;EAEA,OAAO;IACL4R,KAAK;AACLC,IAAAA,UAAU,EAAE,CAAC;AACbzK,IAAAA,KAAK,EAAEsK;AACR,GAAA;AACH;;ACnCM,SAAUI,yBAAyBA,CACvCjB,aAA6B,EAC7BzJ,KAAa,EACb1I,OAAwB,EAAA;AAExB,EAAA,MAAMqT,QAAQ,GAAGlB,aAAa,CAACA,aAAa,CAAC1R,MAAM,GAAG,CAAC,CAAC,CAACuE,OAAO,GAAG,CAAC;AACpE,EAAA,MAAMsO,SAAS,GAAG,IAAIrS,YAAY,CAACoS,QAAQ,CAAC;AAC5C,EAAA,MAAME,SAAS,GAAG,IAAItS,YAAY,CAACoS,QAAQ,CAAC;AAC5C,EAAA,MAAMT,UAAU,GAAG,IAAI3R,YAAY,CAACoS,QAAQ,CAAC;AAC7C,EAAA,MAAMG,UAAU,GAAG,IAAIvS,YAAY,CAACoS,QAAQ,CAAC;AAC7C,EAAA,MAAMI,aAAa,GAAG,IAAIzQ,KAAK,CAAUqQ,QAAQ,CAAC;EAElD,IAAI5O,KAAK,GAAG,CAAC;AACb,EAAA,KAAK,IAAIiP,MAAM,GAAG,CAAC,EAAEA,MAAM,GAAGvB,aAAa,CAAC1R,MAAM,EAAEiT,MAAM,EAAE,EAAE;AAC5D,IAAA,MAAM9J,IAAI,GAAGuI,aAAa,CAACuB,MAAM,CAAC;AAClC,IAAA,KAAK,IAAIpS,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGsI,IAAI,CAACyI,UAAU,CAAC5R,MAAM,EAAEa,CAAC,EAAE,EAAE;AAC/C,MAAA,MAAMqS,SAAS,GAAG/J,IAAI,CAACyI,UAAU,CAAC/Q,CAAC,CAAC;MACpCgS,SAAS,CAAC7O,KAAK,CAAC,GAAGmF,IAAI,CAACgK,gBAAgB,CAACrN,GAAG,CAACjF,CAAC,CAAC;MAC/CiS,SAAS,CAAC9O,KAAK,CAAC,GAAGmF,IAAI,CAACgK,gBAAgB,CAACpN,GAAG,CAAClF,CAAC,CAAC;MAC/CsR,UAAU,CAACnO,KAAK,CAAC,GAAGmF,IAAI,CAACgK,gBAAgB,CAACC,IAAI,CAACvS,CAAC,CAAC;MACjDkS,UAAU,CAAC/O,KAAK,CAAC,GAAGmF,IAAI,CAACgK,gBAAgB,CAACE,kBAAkB,CAACxS,CAAC,CAAC;MAE/D,IAAIyS,YAAY,GAAG,IAAI;MACvB,MAAMC,YAAY,GAAGtL,KAAK,CAACgL,MAAM,CAAC,EAAErB,UAAU,GAAGsB,SAAS,CAAC;AAC3D,MAAA,MAAMM,WAAW,GAAGjU,OAAO,CAACqS,UAAU,GAAGsB,SAAS,CAAC;AAEnD,MAAA,IAAIK,YAAY,EAAEE,QAAQ,KAAK1T,SAAS,EAAE;AACxC,QAAA,IAAI,OAAOwT,YAAY,CAACE,QAAQ,KAAK,UAAU,EAAE;UAC/CH,YAAY,GAAGC,YAAY,CAACE,QAAQ,CAACxL,KAAK,CAACgL,MAAM,CAAC,CAAC;AACrD,QAAA,CAAC,MAAM;UACL,MAAM;AAAEQ,YAAAA,QAAQ,GAAG;AAAI,WAAE,GAAGF,YAAY;AACxCD,UAAAA,YAAY,GAAGG,QAAQ;AACzB,QAAA;AACF,MAAA,CAAC,MAAM,IAAID,WAAW,EAAEC,QAAQ,KAAK1T,SAAS,EAAE;AAC9C,QAAA,IAAI,OAAOyT,WAAW,CAACC,QAAQ,KAAK,UAAU,EAAE;UAC9CH,YAAY,GAAGE,WAAW,CAACC,QAAQ,CAACxL,KAAK,CAACgL,MAAM,CAAC,CAAC;AACpD,QAAA,CAAC,MAAM;UACL,MAAM;AAAEQ,YAAAA,QAAQ,GAAG;AAAI,WAAE,GAAGD,WAAW;AACvCF,UAAAA,YAAY,GAAGG,QAAQ;AACzB,QAAA;AACF,MAAA;AAEAT,MAAAA,aAAa,CAAChP,KAAK,CAAC,GAAGsP,YAAY;AACnCtP,MAAAA,KAAK,EAAE;AACT,IAAA;AACF,EAAA;EAEA,MAAM0P,WAAW,GAAa,EAAE;EAChC,KAAK,IAAI7S,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG+R,QAAQ,EAAE/R,CAAC,EAAE,EAAE;IACjC,IAAImS,aAAa,CAACnS,CAAC,CAAC,EAAE6S,WAAW,CAAC5M,IAAI,CAACjG,CAAC,CAAC;AAC3C,EAAA;EAEA,OAAO;IAAE6S,WAAW;IAAEb,SAAS;IAAEC,SAAS;IAAEX,UAAU;AAAEY,IAAAA;GAAY;AACtE;;ACjEA;;;;;;AAMM,SAAUY,MAAMA,CAAC5U,KAAc,EAAE6U,OAAgB,EAAA;EACrD,IAAI,CAAC7U,KAAK,EAAE;IACV,MAAM,IAAI4E,KAAK,CAACiQ,OAAO,GAAGA,OAAO,GAAG,aAAa,CAAC;AACpD,EAAA;AACF;;ACFO,MAAMC,iBAAiB,GAAG;AAC/BxP,EAAAA,CAAC,EAAE;AACD+O,IAAAA,IAAI,EAAGjK,IAAU,IAAKA,IAAI,CAAC9E,CAAC;AAC5ByB,IAAAA,GAAG,EAAEA,CAACqD,IAAU,EAAE2K,SAA0B,KAC1C3K,IAAI,CAAC9E,CAAC,GAAGyP,SAAS,CAACnI,IAAI,GAAG,CAAC;AAC7B5F,IAAAA,GAAG,EAAEA,CAACoD,IAAU,EAAE2K,SAA0B,KAC1C3K,IAAI,CAAC9E,CAAC,GAAGyP,SAAS,CAACnI,IAAI,GAAG,CAAC;IAC7B0H,kBAAkB,EAAEA,CAAClK,IAAU,EAAE2K,SAA0B,KACzDA,SAAS,CAACnI,IAAI,GAAG;AACpB,GAAA;AACDpF,EAAAA,CAAC,EAAE;AACD6M,IAAAA,IAAI,EAAGjK,IAAU,IAAKA,IAAI,CAAC5C,CAAC;AAC5BT,IAAAA,GAAG,EAAGqD,IAAU,IAAMA,IAAI,CAAC5C,CAAC,GAAG,CAAC,GAAG,IAAI,GAAG,CAAE;IAC5CR,GAAG,EAAGoD,IAAU,IAAMA,IAAI,CAAC5C,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,GAAI;IAC3C8M,kBAAkB,EAAEA,MAAM;AAC3B,GAAA;AACD1H,EAAAA,IAAI,EAAE;IACJyH,IAAI,EAAEA,CAACjK,IAAU,EAAE2K,SAA0B,KAAKA,SAAS,CAACnI,IAAI;IAChE7F,GAAG,EAAEA,CAACqD,IAAU,EAAE2K,SAA0B,KAAKA,SAAS,CAACnI,IAAI,GAAG,IAAI;IACtE5F,GAAG,EAAEA,CAACoD,IAAU,EAAE2K,SAA0B,KAAKA,SAAS,CAACnI,IAAI,GAAG,CAAC;IACnE0H,kBAAkB,EAAEA,CAAClK,IAAU,EAAE2K,SAA0B,KACzDA,SAAS,CAACnI,IAAI,GAAG;AACpB,GAAA;AACDyE,EAAAA,KAAK,EAAE;IACLgD,IAAI,EAAEA,CAACjK,IAAU,EAAE2K,SAA0B,KAAKA,SAAS,CAACnI,IAAI,GAAG,GAAG;AACtE7F,IAAAA,GAAG,EAAEA,CAACqD,IAAU,EAAE2K,SAA0B,KAC1CA,SAAS,CAACnI,IAAI,GAAG,GAAG,GAAG,IAAI;AAC7B5F,IAAAA,GAAG,EAAEA,CAACoD,IAAU,EAAE2K,SAA0B,KAAKA,SAAS,CAACnI,IAAI,GAAG,GAAG,GAAG,CAAC;IACzE0H,kBAAkB,EAAEA,CAAClK,IAAU,EAAE2K,SAA0B,KACzDA,SAAS,CAACnI,IAAI,GAAG,GAAG,GAAG;AAC1B,GAAA;AACD0E,EAAAA,KAAK,EAAE;IACL+C,IAAI,EAAEA,CAACjK,IAAU,EAAE2K,SAA0B,KAAKA,SAAS,CAACnI,IAAI,GAAG,GAAG;AACtE7F,IAAAA,GAAG,EAAEA,CAACqD,IAAU,EAAE2K,SAA0B,KAC1CA,SAAS,CAACnI,IAAI,GAAG,GAAG,GAAG,IAAI;AAC7B5F,IAAAA,GAAG,EAAEA,CAACoD,IAAU,EAAE2K,SAA0B,KAAKA,SAAS,CAACnI,IAAI,GAAG,GAAG,GAAG,CAAC;IACzE0H,kBAAkB,EAAEA,CAAClK,IAAU,EAAE2K,SAA0B,KACzDA,SAAS,CAACnI,IAAI,GAAG,GAAG,GAAG;AAC1B,GAAA;AACDuC,EAAAA,EAAE,EAAE;IACFkF,IAAI,EAAEA,CAACjK,IAAU,EAAE2K,SAAsB,KAAKA,SAAS,CAAC5F,EAAE;IAC1DpI,GAAG,EAAEA,MAAM,CAAC;IACZC,GAAG,EAAEA,MAAM,CAAC;IACZsN,kBAAkB,EAAEA,MAAM;AAC3B,GAAA;AACD7J,EAAAA,KAAK,EAAE;IACL4J,IAAI,EAAEA,CAACjK,IAAU,EAAE2K,SAAgC,KACjDA,SAAS,CAACtK,KAAK,IAAI,GAAG;AACxB1D,IAAAA,GAAG,EAAEA,MAAM,EAAE;IACbC,GAAG,EAAEA,MAAM,CAAC;IACZsN,kBAAkB,EAAEA,MAAM;;AAE7B,CAAA;;ACjDD,MAAMU,UAAU,GAAe,CAAC,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,oBAAoB,CAAC;AAW3E;;;;;;;AAOM,SAAUC,gBAAgBA,CAC9B/L,KAAa,EACboK,MAAc,EACd9S,OAAA,GAA2B,EAAE,EAAA;EAE7B,IAAIyE,KAAK,GAAG,CAAC;EACb,MAAM0N,aAAa,GAAmB,EAAE;AAExC,EAAA,MAAMuC,eAAe,GAAGhM,KAAK,CAACiM,GAAG,CAAE/K,IAAI,IAAI;IACzC,OAAO;AACL,MAAA,GAAGA,IAAI;AACP5C,MAAAA,CAAC,EAAE4C,IAAI,CAAC5C,CAAC,GAAG8L;AACb,KAAA;AACH,EAAA,CAAC,CAAC;AAEF,EAAA,KAAK,MAAMlJ,IAAI,IAAI8K,eAAe,EAAE;IAClC,MAAM;MAAE3L,EAAE;MAAEyE,KAAK,GAAGxN,OAAO,CAACwN,KAAK,GAAGxN,OAAO,CAACwN,KAAK,GAAG;AAAEyE,QAAAA,IAAI,EAAE;AAAU;AAAE,KAAE,GACxErI,IAAI;AAEN,IAAA,MAAM2I,QAAQ,GAAoBP,UAAU,CAACxE,KAAK,CAAC;AAEnD,IAAA,MAAM6E,UAAU,GAAgB,CAAC,GAAG,EAAE,GAAG,EAAE,GAAGE,QAAQ,CAACjF,aAAa,EAAE,CAAC;AAEvE,IAAA,MAAMsG,gBAAgB,GAA+B;AACnDrN,MAAAA,GAAG,EAAE,EAAE;AACPC,MAAAA,GAAG,EAAE,EAAE;AACPqN,MAAAA,IAAI,EAAE,EAAE;AACRC,MAAAA,kBAAkB,EAAE;AACrB,KAAA;AAED,IAAA,KAAK,MAAMc,SAAS,IAAIvC,UAAU,EAAE;AAClC,MAAA,KAAK,MAAMwC,QAAQ,IAAIL,UAAU,EAAE;AACjC;QACA,IAAIM,aAAa,GAAGlL,IAAI,EAAEyI,UAAU,GAAGuC,SAAS,CAAC,GAAGC,QAAQ,CAAC;QAC7D,IAAIC,aAAa,KAAKtU,SAAS,EAAE;UAC/BsU,aAAa,GAAGC,kBAAkB,CAChCD,aAAa,EACbF,SAAS,EACTC,QAAQ,EACR/B,MAAM,CACP;AAEDc,UAAAA,gBAAgB,CAACiB,QAAQ,CAAC,CAACtN,IAAI,CAACuN,aAAa,CAAC;AAC9C,UAAA;AACF,QAAA;AACA;QAEA,IAAIE,qBAAqB,GACvBhV,OAAO,EAAEqS,UAAU,GAAGuC,SAAS,CAAC,GAAGC,QAAQ,CAAC;QAC9C,IAAIG,qBAAqB,KAAKxU,SAAS,EAAE;AACvC,UAAA,IAAI,OAAOwU,qBAAqB,KAAK,QAAQ,EAAE;YAC7CA,qBAAqB,GAAGD,kBAAkB,CACxCC,qBAAqB,EACrBJ,SAAS,EACTC,QAAQ,EACR/B,MAAM,CACP;AACDc,YAAAA,gBAAgB,CAACiB,QAAQ,CAAC,CAACtN,IAAI,CAACyN,qBAAqB,CAAC;AACtD,YAAA;AACF,UAAA,CAAC,MAAM;AACL,YAAA,IAAIxV,KAAK,GAAGwV,qBAAqB,CAACpL,IAAI,CAAC;YACvCpK,KAAK,GAAGuV,kBAAkB,CAACvV,KAAK,EAAEoV,SAAS,EAAEC,QAAQ,EAAE/B,MAAM,CAAC;AAC9Dc,YAAAA,gBAAgB,CAACiB,QAAQ,CAAC,CAACtN,IAAI,CAAC/H,KAAK,CAAC;AACtC,YAAA;AACF,UAAA;AACF,QAAA;AAEA;QACA4U,MAAM,CACJE,iBAAiB,CAACM,SAAS,CAAC,EAC5B,CAAA,yBAAA,EAA4BA,SAAS,CAAA,CAAE,CACxC;QACD,MAAMK,sBAAsB,GAAGX,iBAAiB,CAACM,SAAS,CAAC,CAACC,QAAQ,CAAC;AACrE;AACAjB,QAAAA,gBAAgB,CAACiB,QAAQ,CAAC,CAACtN,IAAI,CAAC0N,sBAAsB,CAACrL,IAAI,EAAE2I,QAAQ,CAAC,CAAC;AACzE,MAAA;AACF,IAAA;IAEA,MAAMxN,SAAS,GAAGN,KAAK;IACvB,MAAMO,OAAO,GAAGD,SAAS,GAAGsN,UAAU,CAAC5R,MAAM,GAAG,CAAC;AACjDgE,IAAAA,KAAK,IAAIO,OAAO,GAAGD,SAAS,GAAG,CAAC;IAEhCoN,aAAa,CAAC5K,IAAI,CAAC;MACjBwB,EAAE;MACFyE,KAAK;MACL+E,QAAQ;MACRF,UAAU;MACVuB,gBAAgB;MAChB7O,SAAS;AACTC,MAAAA;KACD,CAAC;AACJ,EAAA;AACA,EAAA,OAAOmN,aAAa;AACtB;AAEA,SAAS4C,kBAAkBA,CACzBvV,KAAa,EACboV,SAAiB,EACjBC,QAAgB,EAChB/B,MAAc,EAAA;EAEd,IAAI8B,SAAS,KAAK,GAAG,EAAE;IACrB,IAAIC,QAAQ,KAAK,oBAAoB,EAAE;AACrC,MAAA,OAAOrV,KAAK;AACd,IAAA,CAAC,MAAM;MACL,OAAOA,KAAK,GAAGsT,MAAM;AACvB,IAAA;AACF,EAAA;AACA,EAAA,OAAOtT,KAAK;AACd;;AC1IA;AACA,MAAMJ,QAAQ,GAAGC,MAAM,CAACC,SAAS,CAACF,QAAQ;AAc1C;;;;;AAKM,SAAUG,UAAUA,CAACC,KAAc,EAAA;AACvC,EAAA,MAAMC,GAAG,GAAGL,QAAQ,CAACM,IAAI,CAACF,KAAK,CAAC;AAChC,EAAA,OAAOC,GAAG,CAACE,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAACF,GAAG,CAACG,QAAQ,CAAC,KAAK,CAAC;AACvD;;ACHc,SAAUsV,YAAYA,CAClCvL,IAAY,EACZ3J,OAAkC,EAAA;EAElC,MAAM;IACJmV,OAAO;IACPC,aAAa;AACblU,IAAAA,OAAO,GAAG,CAAC;AACXmU,IAAAA,OAAO,GAAG,IAAI;AACdC,IAAAA,aAAa,GAAG,EAAE;AAClBC,IAAAA,eAAe,GAAG,CAAC;AACnBC,IAAAA,aAAa,GAAG,GAAG;AACnBC,IAAAA,cAAc,GAAG,IAAI;AACrBC,IAAAA,iBAAiB,GAAG,KAAK;AACzB5B,IAAAA,kBAAkB,GAAG,KAAK;AAC1B6B,IAAAA,oBAAoB,GAAG;AAAI,GAC5B,GAAG3V,OAAO;EACX,IAAI;IAAE4V,SAAS;AAAEC,IAAAA;AAAS,GAAE,GAAG7V,OAAO;EAEtC,IAAIqV,OAAO,IAAI,CAAC,EAAE;AAChB,IAAA,MAAM,IAAIjR,KAAK,CAAC,8CAA8C,CAAC;EACjE,CAAC,MAAM,IAAI,CAACuF,IAAI,CAAC7E,CAAC,IAAI,CAAC6E,IAAI,CAAC3C,CAAC,EAAE;AAC7B,IAAA,MAAM,IAAI5C,KAAK,CAAC,+CAA+C,CAAC;AAClE,EAAA,CAAC,MAAM,IACL,CAAC7E,UAAU,CAACoK,IAAI,CAAC7E,CAAC,CAAC,IACnB6E,IAAI,CAAC7E,CAAC,CAACrE,MAAM,GAAG,CAAC,IACjB,CAAClB,UAAU,CAACoK,IAAI,CAAC3C,CAAC,CAAC,IACnB2C,IAAI,CAAC3C,CAAC,CAACvG,MAAM,GAAG,CAAC,EACjB;AACA,IAAA,MAAM,IAAI2D,KAAK,CACb,sEAAsE,CACvE;AACH,EAAA,CAAC,MAAM,IAAIuF,IAAI,CAAC7E,CAAC,CAACrE,MAAM,KAAKkJ,IAAI,CAAC3C,CAAC,CAACvG,MAAM,EAAE;AAC1C,IAAA,MAAM,IAAI2D,KAAK,CAAC,qDAAqD,CAAC;AACxE,EAAA;EAEA,IAAI,EAAEgR,aAAa,IAAIA,aAAa,CAAC3U,MAAM,GAAG,CAAC,CAAC,EAAE;AAChD,IAAA,MAAM,IAAI2D,KAAK,CACb,4DAA4D,CAC7D;AACH,EAAA;AACA,EAAA,MAAMiO,UAAU,GAAGrP,KAAK,CAACiC,IAAI,CAACmQ,aAAa,CAAC;AAE5C,EAAA,MAAMU,MAAM,GAAGzD,UAAU,CAAC5R,MAAM;AAChCoV,EAAAA,SAAS,GAAGA,SAAS,IAAI,IAAI7S,KAAK,CAAC8S,MAAM,CAAC,CAACC,IAAI,CAAC3V,MAAM,CAAC0F,gBAAgB,CAAC;AACxE8P,EAAAA,SAAS,GAAGA,SAAS,IAAI,IAAI5S,KAAK,CAAC8S,MAAM,CAAC,CAACC,IAAI,CAAC3V,MAAM,CAAC4V,gBAAgB,CAAC;AAExE,EAAA,IAAIH,SAAS,CAACpV,MAAM,KAAKmV,SAAS,CAACnV,MAAM,EAAE;AACzC,IAAA,MAAM,IAAI2D,KAAK,CAAC,+CAA+C,CAAC;AAClE,EAAA;AAEA,EAAA,MAAM6R,uBAAuB,GAAGC,0BAA0B,CACxDpC,kBAAkB,EAClBzB,UAAU,CACX;EAED,MAAM8D,MAAM,GAAGC,SAAS,CAAClV,OAAO,EAAEyI,IAAI,CAAC7E,CAAC,CAACrE,MAAM,CAAC;AAChD,EAAA,MAAM4V,YAAY,GAAGC,eAAe,CAACnB,OAAO,CAAC;AAE7C,EAAA,MAAMoB,YAAY,GAAGvT,KAAK,CAACiC,IAAI,CAAC;AAAExE,IAAAA,MAAM,EAAEkJ,IAAI,CAAC7E,CAAC,CAACrE;GAAQ,EAAE,CAAC+V,CAAC,EAAElV,CAAC,KAC9D6U,MAAM,CAAC7U,CAAC,CAAC,CACV;EAED,OAAO;IACL+U,YAAY;IACZT,SAAS;IACTC,SAAS;IACTxD,UAAU;IACVkE,YAAY;IACZlB,OAAO;IACPC,aAAa;IACbC,eAAe;IACfC,aAAa;IACbC,cAAc;IACdC,iBAAiB;AACjB5B,IAAAA,kBAAkB,EAAEmC,uBAAuB;AAC3CN,IAAAA;AACD,GAAA;AACH;AAEA,SAASO,0BAA0BA,CACjCpC,kBAA8C,EAC9CzB,UAAoB,EAAA;AAEpB,EAAA,IAAI,OAAOyB,kBAAkB,KAAK,QAAQ,EAAE;IAC1C,OAAO,IAAI9Q,KAAK,CAACqP,UAAU,CAAC5R,MAAM,CAAC,CAACsV,IAAI,CAACjC,kBAAkB,CAAC;AAC9D,EAAA,CAAC,MAAM,IAAIvU,UAAU,CAACuU,kBAAkB,CAAC,EAAE;AACzC,IAAA,MAAMgC,MAAM,GAAGzD,UAAU,CAAC5R,MAAM;AAChC,IAAA,IAAIqT,kBAAkB,CAACrT,MAAM,KAAKqV,MAAM,EAAE;AACxC,MAAA,OAAO,IAAI9S,KAAK,CAAC8S,MAAM,CAAC,CAACC,IAAI,CAACjC,kBAAkB,CAAC,CAAC,CAAC,CAAC;AACtD,IAAA;AACA,IAAA,OAAO9Q,KAAK,CAACiC,IAAI,CAAC6O,kBAAkB,CAAC;AACvC,EAAA;AAEA,EAAA,MAAM,IAAI1P,KAAK,CACb,8FAA8F,CAC/F;AACH;AAEA,SAASgS,SAASA,CAChBlV,OAAmC,EACnCuV,UAAkB,EAAA;AAElB,EAAA,IAAI,OAAOvV,OAAO,KAAK,QAAQ,EAAE;AAC/B,IAAA,MAAM1B,KAAK,GAAG,CAAC,GAAG0B,OAAO,IAAI,CAAC;AAC9B,IAAA,OAAO,MAAM1B,KAAK;AACpB,EAAA,CAAC,MAAM,IAAID,UAAU,CAAC2B,OAAO,CAAC,EAAE;AAC9B,IAAA,IAAIA,OAAO,CAACT,MAAM,GAAGgW,UAAU,EAAE;MAC/B,MAAMjX,KAAK,GAAG,CAAC,GAAG0B,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC;AACjC,MAAA,OAAO,MAAM1B,KAAK;AACpB,IAAA;IAEA,OAAQ8B,CAAS,IAAK,CAAC,GAAGJ,OAAO,CAACI,CAAC,CAAC,IAAI,CAAC;AAC3C,EAAA;AAEA,EAAA,MAAM,IAAI8C,KAAK,CACb,oFAAoF,CACrF;AACH;AAEA,SAASkS,eAAeA,CAACnB,OAA2B,EAAA;EAClD,IAAIA,OAAO,KAAK3U,SAAS,EAAE;AACzB,IAAA,IAAI,OAAO2U,OAAO,KAAK,QAAQ,EAAE;AAC/B,MAAA,MAAM,IAAI/Q,KAAK,CAAC,4BAA4B,CAAC;AAC/C,IAAA;IACA,MAAMsS,OAAO,GAAGC,IAAI,CAACC,GAAG,EAAE,GAAGzB,OAAO,GAAG,IAAI;AAC3C,IAAA,OAAO,MAAMwB,IAAI,CAACC,GAAG,EAAE,GAAGF,OAAO;AACnC,EAAA,CAAC,MAAM;AACL,IAAA,OAAO,MAAM,KAAK;AACpB,EAAA;AACF;;ACpJA;;;;;;;;;AASc,SAAUG,gBAAgBA,CACtClN,IAAY,EACZ0I,UAAoB,EACpByE,qBAA4C,EAC5CP,YAAsB,EAAA;EAEtB,IAAIrD,KAAK,GAAG,CAAC;AACb,EAAA,MAAM6D,IAAI,GAAGD,qBAAqB,CAACzE,UAAU,CAAC;AAC9C,EAAA,KAAK,IAAI/Q,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGqI,IAAI,CAAC7E,CAAC,CAACrE,MAAM,EAAEa,CAAC,EAAE,EAAE;IACtC4R,KAAK,IAAI,CAACvJ,IAAI,CAAC3C,CAAC,CAAC1F,CAAC,CAAC,GAAGyV,IAAI,CAACpN,IAAI,CAAC7E,CAAC,CAACxD,CAAC,CAAC,CAAC,KAAK,CAAC,GAAGiV,YAAY,CAACjV,CAAC,CAAC;AAC/D,EAAA;AAEA,EAAA,OAAO4R,KAAK;AACd;;ACpBA;;;;;;;;;AASc,SAAU8D,gBAAgBA,CACtCrN,IAAY,EACZsN,aAA2B,EAC3BC,MAAgB,EAChBpD,kBAA4B,EAC5BqD,aAAoC,EACpCzB,iBAA0B,EAAA;AAE1B,EAAA,MAAMrC,QAAQ,GAAG6D,MAAM,CAACzW,MAAM;AAC9B,EAAA,MAAM2W,QAAQ,GAAGzN,IAAI,CAAC7E,CAAC,CAACrE,MAAM;EAC9B,MAAMO,GAAG,GAAGmE,MAAM,CAACkS,KAAK,CAAChE,QAAQ,EAAE+D,QAAQ,CAAC;EAE5C,IAAIE,QAAQ,GAAG,CAAC;EAChB,KAAK,IAAIC,KAAK,GAAG,CAAC,EAAEA,KAAK,GAAGlE,QAAQ,EAAEkE,KAAK,EAAE,EAAE;AAC7C,IAAA,IAAIzD,kBAAkB,CAACyD,KAAK,CAAC,KAAK,CAAC,EAAE;AACrC,IAAA,IAAIC,KAAK,GAAG1D,kBAAkB,CAACyD,KAAK,CAAC;AACrC,IAAA,IAAIE,SAAS,GAAGP,MAAM,CAAC7T,KAAK,EAAE;AAC9BoU,IAAAA,SAAS,CAACF,KAAK,CAAC,IAAIC,KAAK;AACzB,IAAA,MAAME,SAAS,GAAGP,aAAa,CAACM,SAAS,CAAC;IAC1C,IAAI,CAAC/B,iBAAiB,EAAE;MACtB,KAAK,IAAIiC,KAAK,GAAG,CAAC,EAAEA,KAAK,GAAGP,QAAQ,EAAEO,KAAK,EAAE,EAAE;QAC7C3W,GAAG,CAAC4W,GAAG,CACLN,QAAQ,EACRK,KAAK,EACL,CAACV,aAAa,CAACU,KAAK,CAAC,GAAGD,SAAS,CAAC/N,IAAI,CAAC7E,CAAC,CAAC6S,KAAK,CAAC,CAAC,IAAIH,KAAK,CAC1D;AACH,MAAA;AACF,IAAA,CAAC,MAAM;AACLC,MAAAA,SAAS,GAAGP,MAAM,CAAC7T,KAAK,EAAE;AAC1BoU,MAAAA,SAAS,CAACF,KAAK,CAAC,IAAIC,KAAK;AACzBA,MAAAA,KAAK,IAAI,CAAC;AACV,MAAA,MAAMK,UAAU,GAAGV,aAAa,CAACM,SAAS,CAAC;MAC3C,KAAK,IAAIE,KAAK,GAAG,CAAC,EAAEA,KAAK,GAAGP,QAAQ,EAAEO,KAAK,EAAE,EAAE;AAC7C3W,QAAAA,GAAG,CAAC4W,GAAG,CACLN,QAAQ,EACRK,KAAK,EACL,CAACE,UAAU,CAAClO,IAAI,CAAC7E,CAAC,CAAC6S,KAAK,CAAC,CAAC,GAAGD,SAAS,CAAC/N,IAAI,CAAC7E,CAAC,CAAC6S,KAAK,CAAC,CAAC,IAAIH,KAAK,CAC/D;AACH,MAAA;AACF,IAAA;AACAF,IAAAA,QAAQ,EAAE;AACZ,EAAA;AAEA,EAAA,OAAOtW,GAAG;AACZ;;ACpDA;;;;;;AAMA,SAAS8W,cAAcA,CAACnO,IAAY,EAAEsN,aAA2B,EAAA;AAC/D,EAAA,MAAM9U,CAAC,GAAGwH,IAAI,CAAC7E,CAAC,CAACrE,MAAM;EAEvB,MAAMO,GAAG,GAAG,IAAImE,MAAM,CAAChD,CAAC,EAAE,CAAC,CAAC;EAE5B,KAAK,IAAIwV,KAAK,GAAG,CAAC,EAAEA,KAAK,GAAGxV,CAAC,EAAEwV,KAAK,EAAE,EAAE;AACtC3W,IAAAA,GAAG,CAAC4W,GAAG,CAACD,KAAK,EAAE,CAAC,EAAEhO,IAAI,CAAC3C,CAAC,CAAC2Q,KAAK,CAAC,GAAGV,aAAa,CAACU,KAAK,CAAC,CAAC;AACzD,EAAA;AACA,EAAA,OAAO3W,GAAG;AACZ;AAEA;;;;;;;;;;;AAWc,SAAU+W,IAAIA,CAC1BpO,IAAY,EACZuN,MAAgB,EAChB7B,OAAe,EACfvB,kBAA4B,EAC5BgD,qBAA4C,EAC5CpB,iBAA0B,EAC1BxU,OAA2B,EAAA;AAE3B,EAAA,MAAM8W,QAAQ,GAAG7S,MAAM,CAAC8S,GAAG,CAACf,MAAM,CAACzW,MAAM,EAAEyW,MAAM,CAACzW,MAAM,EAAE4U,OAAO,CAAC;AAElE,EAAA,MAAM0B,IAAI,GAAGD,qBAAqB,CAACI,MAAM,CAAC;EAE1C,MAAMD,aAAa,GAAG,IAAIhW,YAAY,CAAC0I,IAAI,CAAC7E,CAAC,CAACrE,MAAM,CAAC;AACrD,EAAA,KAAK,IAAIa,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGqI,IAAI,CAAC7E,CAAC,CAACrE,MAAM,EAAEa,CAAC,EAAE,EAAE;AACtC2V,IAAAA,aAAa,CAAC3V,CAAC,CAAC,GAAGyV,IAAI,CAACpN,IAAI,CAAC7E,CAAC,CAACxD,CAAC,CAAC,CAAC;AACpC,EAAA;AAEA,EAAA,MAAM4W,YAAY,GAAGlB,gBAAgB,CACnCrN,IAAI,EACJsN,aAAa,EACbC,MAAM,EACNpD,kBAAkB,EAClBgD,qBAAqB,EACrBpB,iBAAiB,CAClB;AACD,EAAA,MAAMyC,aAAa,GAAGL,cAAc,CAACnO,IAAI,EAAEsN,aAAa,CAAC;EAEzD,MAAMmB,aAAa,GAAG/S,OAAO,CAC3B2S,QAAQ,CAACK,GAAG,CACVH,YAAY,CAACI,IAAI,CACfJ,YAAY,CAACK,SAAS,EAAE,CAACC,KAAK,CAAC,KAAK,EAAE;AAAEA,IAAAA,KAAK,EAAEtX;GAAS,CAAC,CAC1D,CACF,CACF;EAED,MAAMuX,2BAA2B,GAAGP,YAAY,CAACI,IAAI,CACnDH,aAAa,CAACK,KAAK,CAAC,KAAK,EAAE;AAAEA,IAAAA,KAAK,EAAEtX;AAAO,GAAE,CAAC,CAC/C;AAED,EAAA,MAAMwX,aAAa,GAAGN,aAAa,CAACE,IAAI,CAACG,2BAA2B,CAAC;EAErE,OAAO;IACLC,aAAa;AACbD,IAAAA;AACD,GAAA;AACH;;ACrEA;;;;;;AAMM,SAAUE,kBAAkBA,CAChChP,IAAY,EACZmN,qBAA4C,EAC5C9W,OAAkC,EAAA;AAElC,EAAA,MAAM4Y,cAAc,GAAG1D,YAAY,CAACvL,IAAI,EAAE3J,OAAO,CAAC;EAClD,MAAM;IACJqW,YAAY;IACZT,SAAS;IACTC,SAAS;IACTxD,UAAU;IACVkE,YAAY;IACZjB,aAAa;IACbC,eAAe;IACfC,aAAa;IACbC,cAAc;IACdC,iBAAiB;IACjB5B,kBAAkB;AAClB6B,IAAAA;AAAoB,GACrB,GAAGiD,cAAc;AAClB,EAAA,IAAIvD,OAAO,GAAGuD,cAAc,CAACvD,OAAO;EAEpC,IAAInC,KAAK,GAAG2D,gBAAgB,CAC1BlN,IAAI,EACJ0I,UAAU,EACVyE,qBAAqB,EACrBP,YAAY,CACb;EACD,IAAIsC,YAAY,GAAG3F,KAAK;AACxB,EAAA,IAAI4F,iBAAiB,GAAGzG,UAAU,CAAChP,KAAK,EAAE;AAE1C,EAAA,IAAI0V,SAAS,GAAG7F,KAAK,IAAIuC,cAAc;EAEvC,IAAIuD,SAAS,GAAG,CAAC;EACjB,OAAOA,SAAS,GAAGxD,aAAa,IAAI,CAACuD,SAAS,EAAEC,SAAS,EAAE,EAAE;IAC3D,MAAMC,aAAa,GAAG/F,KAAK;IAE3B,MAAM;MAAEwF,aAAa;AAAED,MAAAA;AAA2B,KAAE,GAAGV,IAAI,CACzDpO,IAAI,EACJ0I,UAAU,EACVgD,OAAO,EACPvB,kBAAkB,EAClBgD,qBAAqB,EACrBpB,iBAAiB,EACjBa,YAAY,CACb;AAED,IAAA,KAAK,IAAInU,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGiQ,UAAU,CAAC5R,MAAM,EAAE2B,CAAC,EAAE,EAAE;AAC1CiQ,MAAAA,UAAU,CAACjQ,CAAC,CAAC,GAAGvB,IAAI,CAAC0F,GAAG,CACtB1F,IAAI,CAAC2F,GAAG,CAACoP,SAAS,CAACxT,CAAC,CAAC,EAAEiQ,UAAU,CAACjQ,CAAC,CAAC,GAAGsW,aAAa,CAACQ,GAAG,CAAC9W,CAAC,EAAE,CAAC,CAAC,CAAC,EAC/DyT,SAAS,CAACzT,CAAC,CAAC,CACb;AACH,IAAA;IAEA8Q,KAAK,GAAG2D,gBAAgB,CACtBlN,IAAI,EACJ0I,UAAU,EACVyE,qBAAqB,EACrBP,YAAY,CACb;AAED,IAAA,IAAI4C,KAAK,CAACjG,KAAK,CAAC,EAAE;AAElB,IAAA,IAAIA,KAAK,GAAG2F,YAAY,GAAGpD,cAAc,EAAE;AACzCoD,MAAAA,YAAY,GAAG3F,KAAK;AACpB4F,MAAAA,iBAAiB,GAAGzG,UAAU,CAAChP,KAAK,EAAE;AACxC,IAAA;AAEA,IAAA,MAAM+V,iBAAiB,GACrB,CAACH,aAAa,GAAG/F,KAAK,IACtBwF,aAAa,CACVH,SAAS,EAAE,CACXD,IAAI,CAACI,aAAa,CAACW,GAAG,CAAChE,OAAO,CAAC,CAACgD,GAAG,CAACI,2BAA2B,CAAC,CAAC,CACjES,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;IAEd,IAAIE,iBAAiB,GAAGzD,oBAAoB,EAAE;MAC5CN,OAAO,GAAGxU,IAAI,CAAC2F,GAAG,CAAC6O,OAAO,GAAGE,eAAe,EAAE,IAAI,CAAC;AACrD,IAAA,CAAC,MAAM;MACLF,OAAO,GAAGxU,IAAI,CAAC0F,GAAG,CAAC8O,OAAO,GAAGC,aAAa,EAAE,GAAG,CAAC;AAClD,IAAA;IAEA,IAAIe,YAAY,EAAE,EAAE;MAClB,MAAM,IAAIjS,KAAK,CACb,CAAA,8BAAA,EAAiCpE,OAAO,CAACmV,OAAO,UAAU,CAC3D;AACH,IAAA;IAEA4D,SAAS,GAAG7F,KAAK,IAAIuC,cAAc;AACrC,EAAA;EAEA,OAAO;AACL6D,IAAAA,eAAe,EAAER,iBAAiB;AAClCS,IAAAA,cAAc,EAAEV,YAAY;AAC5B1F,IAAAA,UAAU,EAAE6F;AACb,GAAA;AACH;;AC/GA;AACA;AACA;AACA;AACA;AACA;AACA;AACe,SAASQ,mBAAmBA,CAAC1U,CAAC,EAAEkC,CAAC,EAAE;AAChD,EAAA,IAAIlC,CAAC,CAACrE,MAAM,KAAKuG,CAAC,CAACvG,MAAM,EAAE;AACzB,IAAA,MAAM,IAAIH,UAAU,CAAC,0CAA0C,CAAC;AAClE,EAAA;AAEA,EAAA,MAAM8W,QAAQ,GAAGtS,CAAC,CAACrE,MAAM,GAAG,CAAC;AAC7B,EAAA,IAAI2W,QAAQ,KAAK,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC;EAC9B,IAAIA,QAAQ,KAAK,CAAC,EAAE,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC;EAEjC,IAAIqC,YAAY,GAAG,CAAC;AACpB,EAAA,IAAI7S,MAAM,GAAG,IAAI5D,KAAK,CAAC8B,CAAC,CAACrE,MAAM,CAAC,CAACsV,IAAI,CAAC,IAAI,CAAC;AAC3C,EAAA,OAAO,IAAI,EAAE;IACX,MAAMvT,CAAC,GAAGiX,YAAY;IACtB,MAAMhX,CAAC,GAAGiX,MAAM,CAACD,YAAY,EAAErC,QAAQ,EAAExQ,MAAM,CAAC;AAChD,IAAA,MAAM+S,CAAC,GAAGD,MAAM,CAACA,MAAM,CAACD,YAAY,EAAErC,QAAQ,EAAExQ,MAAM,CAAC,EAAEwQ,QAAQ,EAAExQ,MAAM,CAAC;IAE1E,MAAMgT,GAAG,GACP9U,CAAC,CAAC6U,CAAC,CAAC,IAAI3S,CAAC,CAACxE,CAAC,CAAC,GAAGwE,CAAC,CAACvE,CAAC,CAAC,CAAC,GAAGqC,CAAC,CAACtC,CAAC,CAAC,IAAIwE,CAAC,CAACvE,CAAC,CAAC,GAAGuE,CAAC,CAAC2S,CAAC,CAAC,CAAC,GAAG7U,CAAC,CAACrC,CAAC,CAAC,IAAIuE,CAAC,CAAC2S,CAAC,CAAC,GAAG3S,CAAC,CAACxE,CAAC,CAAC,CAAC;AAEpE,IAAA,MAAMqX,QAAQ,GAAGD,GAAG,IAAI,CAAC;AAEzB,IAAA,IAAIC,QAAQ,EAAE;AACZJ,MAAAA,YAAY,GAAGhX,CAAC;AAClB,IAAA,CAAC,MAAM;AACLmE,MAAAA,MAAM,CAACnE,CAAC,CAAC,GAAG,KAAK;MACjBgX,YAAY,GAAGK,QAAQ,CAACL,YAAY,EAAErC,QAAQ,EAAExQ,MAAM,CAAC;AACzD,IAAA;IACA,IAAI+S,CAAC,KAAKvC,QAAQ,EAAE;AACtB,EAAA;EAEA,OAAOxQ,MAAM,CACV+N,GAAG,CAAC,CAACoF,IAAI,EAAEtV,KAAK,KAAMsV,IAAI,KAAK,KAAK,GAAG,KAAK,GAAGtV,KAAM,CAAC,CACtDuV,MAAM,CAAED,IAAI,IAAKA,IAAI,KAAK,KAAK,CAAC;AACrC;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,SAASD,QAAQA,CAACL,YAAY,EAAErC,QAAQ,EAAE6C,MAAM,EAAE;AAChD,EAAA,IAAIC,OAAO,GAAGT,YAAY,GAAG,CAAC;EAC9B,OAAOQ,MAAM,CAACC,OAAO,CAAC,KAAK,KAAK,EAAEA,OAAO,EAAE;AAC3C,EAAA,OAAOT,YAAY,KAAK,CAAC,GAAGrC,QAAQ,GAAG8C,OAAO;AAChD;AAEA,SAASR,MAAMA,CAACD,YAAY,EAAErC,QAAQ,EAAE6C,MAAM,EAAE;AAC9C,EAAA,IAAIC,OAAO,GAAGT,YAAY,GAAG,CAAC;EAC9B,OAAOQ,MAAM,CAACC,OAAO,CAAC,KAAK,KAAK,EAAEA,OAAO,EAAE;AAC3C,EAAA,OAAOT,YAAY,KAAKrC,QAAQ,GAAG,CAAC,GAAG8C,OAAO;AAChD;;ACxDA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEe,SAASC,MAAMA,CAC5BC,iBAAiB,EACjBC,eAAe,EACfC,eAAe,EACfta,OAAO,GAAG,EAAE,EACZ;EACA,MAAM;AACJmT,IAAAA,UAAU,GAAG,EAAE;AACfoH,IAAAA,OAAO,GAAG,IAAI;AACd5U,IAAAA,SAAS,GAAG,KAAK;AACjB6U,IAAAA,UAAU,GAAG,KAAK;AAClBC,IAAAA,YAAY,GAAG;AACjB,GAAC,GAAGza,OAAO;EAEX,IACEoa,iBAAiB,KAAK5Z,SAAS,IAC/B6Z,eAAe,KAAK7Z,SAAS,IAC7B8Z,eAAe,KAAK9Z,SAAS,EAC7B;AACA,IAAA,MAAM,IAAIF,UAAU,CAAC,8BAA8B,CAAC;AACtD,EAAA;AAEA+Z,EAAAA,eAAe,GAAG,IAAIpZ,YAAY,CAACoZ,eAAe,CAAC;AACnDC,EAAAA,eAAe,GAAG,IAAIrZ,YAAY,CAACqZ,eAAe,CAAC;AAEnD,EAAA,IAAID,eAAe,CAAC5Z,MAAM,KAAK6Z,eAAe,CAAC7Z,MAAM,EAAE;AACrD,IAAA,MAAM,IAAI2D,KAAK,CACb,gEACF,CAAC;AACH,EAAA;;AAEA;AACA;AACA;AACA,EAAA,IAAItB,CAAC,GAAGuX,eAAe,CAAC5Z,MAAM;AAC9B,EAAA,IAAIia,WAAW,GAAGJ,eAAe,CAAC3F,GAAG,CAAC,CAAC7P,CAAC,EAAExD,CAAC,KAAKwD,CAAC,GAAGuV,eAAe,CAAC/Y,CAAC,CAAC,CAAC;EAEvE,IAAI;AACFqZ,IAAAA,kBAAkB,GAAG,CAAC;AACtBC,IAAAA,eAAe,GAAG,CAAC;AACnBC,IAAAA,kBAAkB,GAAG,CAAC,IAAI5Z,YAAY,CAAC6B,CAAC,CAAC,CAACiT,IAAI,CAAC,GAAG,CAAC,CAAC;AACpD+E,IAAAA,WAAW,GAAG,IAAI7Z,YAAY,CAAC6B,CAAC,CAAC,CAAC6R,GAAG,CAAC,CAACnV,KAAK,EAAEiF,KAAK,KAAK;AACtD,MAAA,OACE4V,eAAe,CAAC5V,KAAK,CAAC,GACtBoW,kBAAkB,CAAC,CAAC,CAAC,CAACpW,KAAK,CAAC,GAAGiW,WAAW,CAACjW,KAAK,CAAC;AAErD,IAAA,CAAC,CAAC;AACFsW,IAAAA,gBAAgB,GAAGX,iBAAiB,CAACU,WAAW,CAAC;AACjDE,IAAAA,MAAM,GAAG,CAAC;AACVC,IAAAA,eAAe,GAAG,CAAC;AACnBC,IAAAA,SAAS,GAAG,CAAC,IAAIja,YAAY,CAAC6B,CAAC,CAAC,CAACiT,IAAI,CAAC,GAAG,CAAC,CAAC;AAC3CoF,IAAAA,iBAAiB,GAAG,CAACta,IAAI,CAACiG,IAAI,CAAChE,CAAC,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC;IAC7CsY,cAAc,GAAG,CAACL,gBAAgB,CAAC;AACnCM,IAAAA,kBAAkB,GAAGF,iBAAiB;IACtCG,uBAAuB,GAAG,CAACP,gBAAgB,CAAC;AAC5CQ,IAAAA,WAAW,GAAG/a;AAChB,GAAC,GAAGia,YAAY;EAChB,IACEA,YAAY,CAACe,mBAAmB,IAChCf,YAAY,CAACe,mBAAmB,CAAC/a,MAAM,GAAG,CAAC,EAC3C;AACAsa,IAAAA,gBAAgB,GAAGvV,SAAS,CAAC4V,cAAc,CAAC;IAC5CG,WAAW,GACThB,OAAO,GAAG1Z,IAAI,CAAC2D,GAAG,CAACuW,gBAAgB,CAAC,GAAG,IAAI,GACvCR,OAAO,GAAG1Z,IAAI,CAAC2D,GAAG,CAACuW,gBAAgB,CAAC,GACpC,IAAI;IAEVE,eAAe,GAAGQ,WAAW,CAC3BL,cAAc,EACdD,iBAAiB,EACjBI,WAAW,EACXR,gBACF,CAAC;AAEDF,IAAAA,kBAAkB,GAAGJ,YAAY,CAACe,mBAAmB,CAACnY,KAAK,EAAE;AAC7D,IAAA,KAAK,IAAIV,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGkY,kBAAkB,CAACpa,MAAM,EAAEkC,CAAC,EAAE,EAAE;AAClD,MAAA,KAAK,IAAIrB,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG+Y,eAAe,CAAC5Z,MAAM,EAAEa,CAAC,EAAE,EAAE;QAC/CuZ,kBAAkB,CAAClY,CAAC,CAAC,CAACrB,CAAC,CAAC,GACtB,CAACuZ,kBAAkB,CAAClY,CAAC,CAAC,CAACrB,CAAC,CAAC,GAAG+Y,eAAe,CAAC/Y,CAAC,CAAC,IAAIoZ,WAAW,CAACpZ,CAAC,CAAC;AACpE,MAAA;AACF,IAAA;AACF,EAAA;EAEA,IAAI0X,SAAS,GAAG,CAAC;AACjB;AACA;AACA;;EAEA,OAAOA,SAAS,GAAG7F,UAAU,EAAE;AAC7B;AACA;AACA;;IAEA,IAAIuI,EAAE,GAAG,EAAE;AACX,IAAA,IAAIC,GAAG,GAAGN,kBAAkB,CAACO,SAAS;AACpC;AACCC,IAAAA,CAAC,IAAKA,CAAC,KAAKV,iBAAiB,CAACF,eAAe,CAChD,CAAC;IACD,IAAIf,OAAO,GAAG,CAAC;AACf,IAAA,KAAK,IAAI5Y,CAAC,GAAGqa,GAAG,EAAEra,CAAC,GAAG+Z,kBAAkB,CAAC5a,MAAM,EAAEa,CAAC,EAAE,EAAE;AACpD,MAAA,KAAK,IAAI8P,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGgK,cAAc,CAAC3a,MAAM,EAAE2Q,CAAC,EAAE,EAAE;AAC9C,QAAA,IACGgK,cAAc,CAAChK,CAAC,CAAC,KAAKkK,uBAAuB,CAACha,CAAC,CAAC,GAChD6Z,iBAAiB,CAAC/J,CAAC,CAAC,KAAKiK,kBAAkB,CAAC/Z,CAAC,CAAE,EAChD;AACAoa,UAAAA,EAAE,CAACxB,OAAO,EAAE,CAAC,GAAG9I,CAAC;AACnB,QAAA;AACF,MAAA;AACF,IAAA;IAEA,IAAI0K,kBAAkB,EAAEC,EAAE;AAC1B,IAAA,IAAIV,kBAAkB,CAAC5a,MAAM,GAAGkb,GAAG,GAAG,CAAC,EAAE;AACvC,MAAA,IAAIrM,EAAE,GAAG6L,iBAAiB,CAACF,eAAe,CAAC;AAC3C,MAAA,IAAIe,EAAE,GAAGZ,cAAc,CAACH,eAAe,CAAC;MACxC,IAAI1L,EAAE,GAAG8L,kBAAkB,CAACA,kBAAkB,CAAC5a,MAAM,GAAG,CAAC,CAAC;MAC1D,IAAIwb,EAAE,GAAGX,uBAAuB,CAACD,kBAAkB,CAAC5a,MAAM,GAAG,CAAC,CAAC;MAC/D,IAAIyb,KAAK,GAAG,CAACD,EAAE,GAAGD,EAAE,KAAKzM,EAAE,GAAGD,EAAE,CAAC;AACjC,MAAA,IAAI6M,QAAQ,GAAGH,EAAE,GAAGE,KAAK,GAAG5M,EAAE;AAC9B,MAAA,IAAI8M,EAAE,GAAG,IAAIC,WAAW,CAACnC,OAAO,CAAC;AACjCA,MAAAA,OAAO,GAAG,CAAC;AACX,MAAA,KAAK,IAAI5Y,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG8a,EAAE,CAAC3b,MAAM,EAAEa,CAAC,EAAE,EAAE;AAClC,QAAA,IAAIqB,CAAC,GAAG+Y,EAAE,CAACpa,CAAC,CAAC;AACb,QAAA,IACE8Z,cAAc,CAACzY,CAAC,CAAC,IACjBuZ,KAAK,GAAGf,iBAAiB,CAACxY,CAAC,CAAC,GAAGwZ,QAAQ,GAAG3B,UAAU,EACpD;AACA4B,UAAAA,EAAE,CAAClC,OAAO,EAAE,CAAC,GAAGvX,CAAC;AACnB,QAAA;AACF,MAAA;MAEA,IAAI2Z,KAAK,GAAG,EAAE;MACd,IAAIC,KAAK,GAAG,EAAE;MACd,KAAK,IAAIjb,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG4Y,OAAO,EAAE5Y,CAAC,EAAE,EAAE;QAChCgb,KAAK,CAAC/U,IAAI,CAAC4T,iBAAiB,CAACiB,EAAE,CAAC9a,CAAC,CAAC,CAAC,CAAC;QACpCib,KAAK,CAAChV,IAAI,CAAC6T,cAAc,CAACgB,EAAE,CAAC9a,CAAC,CAAC,CAAC,CAAC;AACnC,MAAA;AAEA,MAAA,IAAIkb,cAAc,GAAGhD,mBAAmB,CAAC8C,KAAK,EAAEC,KAAK,CAAC;AAEtDR,MAAAA,EAAE,GAAG,EAAE;AACP,MAAA,KAAK,IAAIza,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGkb,cAAc,CAAC/b,MAAM,EAAEa,CAAC,EAAE,EAAE;QAC9Cya,EAAE,CAACxU,IAAI,CAAC6U,EAAE,CAACI,cAAc,CAAClb,CAAC,CAAC,CAAC,CAAC;AAChC,MAAA;AACF,IAAA,CAAC,MAAM;MACLya,EAAE,GAAGL,EAAE,CAACrY,KAAK,CAAC,CAAC,EAAE6W,OAAO,CAAC;AAC3B,IAAA;AACA4B,IAAAA,kBAAkB,GAAGC,EAAE;AACvB;AACA;AACA;AACA,IAAA,KAAK,IAAI3Z,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG0Z,kBAAkB,CAACrb,MAAM,EAAE2B,CAAC,EAAE,EAAE;AAClD,MAAA,IAAIO,CAAC,GAAGmZ,kBAAkB,CAAC1Z,CAAC,CAAC;MAC7B,IAAIqa,UAAU,GAAGnX,SAAS,CAAC4V,SAAS,CAACvY,CAAC,CAAC,CAAC;MACxC,IAAI+Z,eAAe,GAAG,IAAIL,WAAW,CAACnB,SAAS,CAACvY,CAAC,CAAC,CAAClC,MAAM,CAAC;AAC1DyZ,MAAAA,OAAO,GAAG,CAAC;AACX,MAAA,KAAK,IAAI5Y,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG4Z,SAAS,CAACvY,CAAC,CAAC,CAAClC,MAAM,EAAEa,CAAC,EAAE,EAAE;AAC5C,QAAA,IAAIT,IAAI,CAAC2D,GAAG,CAAC0W,SAAS,CAACvY,CAAC,CAAC,CAACrB,CAAC,CAAC,GAAGmb,UAAU,CAAC,GAAG9W,SAAS,EAAE;AACtD+W,UAAAA,eAAe,CAACxC,OAAO,EAAE,CAAC,GAAG5Y,CAAC;AAChC,QAAA;AACF,MAAA;AACA,MAAA,IAAIkW,KAAK,GAAI,CAAC,GAAGiF,UAAU,GAAI,CAAC;MAChC,IAAIE,kBAAkB,GAAG,EAAE;MAC3B,KAAK,IAAIC,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG1C,OAAO,EAAE0C,CAAC,EAAE,EAAE;AAChC,QAAA,IAAItb,CAAC,GAAGob,eAAe,CAACE,CAAC,CAAC;QAC1B,IAAIC,iBAAiB,GAAGhC,kBAAkB,CAAClY,CAAC,CAAC,CAACU,KAAK,EAAE;QACrD,IAAIyZ,kBAAkB,GAAGjC,kBAAkB,CAAClY,CAAC,CAAC,CAACU,KAAK,EAAE;AACtDwZ,QAAAA,iBAAiB,CAACvb,CAAC,CAAC,IAAIkW,KAAK;AAC7BsF,QAAAA,kBAAkB,CAACxb,CAAC,CAAC,IAAIkW,KAAK;QAC9B,IAAIuF,gBAAgB,GAAG,IAAI9b,YAAY,CAAC4b,iBAAiB,CAACpc,MAAM,CAAC;QACjE,IAAIuc,iBAAiB,GAAG,IAAI/b,YAAY,CAAC6b,kBAAkB,CAACrc,MAAM,CAAC;AACnE,QAAA,KAAK,IAAIa,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGub,iBAAiB,CAACpc,MAAM,EAAEa,CAAC,EAAE,EAAE;AACjDyb,UAAAA,gBAAgB,CAACzb,CAAC,CAAC,GACjB+Y,eAAe,CAAC/Y,CAAC,CAAC,GAAGub,iBAAiB,CAACvb,CAAC,CAAC,GAAGoZ,WAAW,CAACpZ,CAAC,CAAC;AAC5D0b,UAAAA,iBAAiB,CAAC1b,CAAC,CAAC,GAClB+Y,eAAe,CAAC/Y,CAAC,CAAC,GAAGwb,kBAAkB,CAACxb,CAAC,CAAC,GAAGoZ,WAAW,CAACpZ,CAAC,CAAC;AAC/D,QAAA;AACA,QAAA,IAAI2b,aAAa,GAAG7C,iBAAiB,CAAC2C,gBAAgB,CAAC;AACvD,QAAA,IAAIG,cAAc,GAAG9C,iBAAiB,CAAC4C,iBAAiB,CAAC;AACzDhC,QAAAA,MAAM,IAAI,CAAC;QACX2B,kBAAkB,CAACpV,IAAI,CAAC;UACtB9B,QAAQ,EAAE5E,IAAI,CAAC0F,GAAG,CAAC0W,aAAa,EAAEC,cAAc,CAAC;AACjDzY,UAAAA,KAAK,EAAEmY;AACT,SAAC,CAAC;AACF;AACA/B,QAAAA,kBAAkB,CAACtT,IAAI,CAACsV,iBAAiB,EAAEC,kBAAkB,CAAC;AAC9D1B,QAAAA,cAAc,CAAC7T,IAAI,CAAC0V,aAAa,EAAEC,cAAc,CAAC;AACpD,MAAA;AAEA,MAAA,IAAIza,CAAC,GAAGka,kBAAkB,CAACtR,IAAI,CAAC,CAAC7I,CAAC,EAAEC,CAAC,KAAKD,CAAC,CAACiD,QAAQ,GAAGhD,CAAC,CAACgD,QAAQ,CAAC;MAClE,KAAK,IAAImX,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG1C,OAAO,EAAE0C,CAAC,EAAE,EAAE;QAChC,IAAI9K,CAAC,GAAG4K,eAAe,CAACja,CAAC,CAACma,CAAC,CAAC,CAACnY,KAAK,CAAC;AACnC,QAAA,IAAI0Y,GAAG,GAAGxC,kBAAkB,GAAG,CAAC,IAAIlY,CAAC,CAACma,CAAC,CAAC,CAACnY,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC;AACvD,QAAA,IAAI2Y,GAAG,GAAGzC,kBAAkB,GAAG,CAAC,IAAIlY,CAAC,CAACma,CAAC,CAAC,CAACnY,KAAK,GAAG,CAAC,CAAC;QACnDyW,SAAS,CAACvY,CAAC,CAAC,CAACmP,CAAC,CAAC,GAAG0F,KAAK,GAAG,CAAC;QAC3B0D,SAAS,CAACiC,GAAG,CAAC,GAAGjC,SAAS,CAACvY,CAAC,CAAC,CAACU,KAAK,EAAE;QACrC6X,SAAS,CAACkC,GAAG,CAAC,GAAGlC,SAAS,CAACvY,CAAC,CAAC,CAACU,KAAK,EAAE;QACrC8X,iBAAiB,CAACxY,CAAC,CAAC,GAAGgE,KAAK,CAACuU,SAAS,CAACvY,CAAC,CAAC,CAAC;AAC1CwY,QAAAA,iBAAiB,CAACgC,GAAG,CAAC,GAAGhC,iBAAiB,CAACxY,CAAC,CAAC;AAC7CwY,QAAAA,iBAAiB,CAACiC,GAAG,CAAC,GAAGjC,iBAAiB,CAACxY,CAAC,CAAC;AAC/C,MAAA;MACAgY,kBAAkB,IAAI,CAAC,GAAGT,OAAO;AACnC,IAAA;;AAEA;AACA;AACA;;AAEAa,IAAAA,gBAAgB,GAAGvV,SAAS,CAAC4V,cAAc,CAAC;IAE5CG,WAAW,GACThB,OAAO,GAAG1Z,IAAI,CAAC2D,GAAG,CAACuW,gBAAgB,CAAC,GAAG,IAAI,GACvCR,OAAO,GAAG1Z,IAAI,CAAC2D,GAAG,CAACuW,gBAAgB,CAAC,GACpC,IAAI;AAEVE,IAAAA,eAAe,GAAGQ,WAAW,CAC3BL,cAAc,EACdD,iBAAiB,EACjBI,WAAW,EACXR,gBAEF,CAAC;IAEDM,kBAAkB,GAAGrY,KAAK,CAACiC,IAAI,CAAC,IAAIoY,GAAG,CAAClC,iBAAiB,CAAC,CAAC;AAC3DE,IAAAA,kBAAkB,GAAGA,kBAAkB,CAAChQ,IAAI,CAAC,CAAC7I,CAAC,EAAEC,CAAC,KAAKD,CAAC,GAAGC,CAAC,CAAC;AAE7D6Y,IAAAA,uBAAuB,GAAG,EAAE;AAC5B,IAAA,KAAK,IAAIha,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG+Z,kBAAkB,CAAC5a,MAAM,EAAEa,CAAC,EAAE,EAAE;AAClD,MAAA,IAAIgc,QAAQ;AACZ,MAAA,IAAI7X,QAAQ,GAAGrF,MAAM,CAACuE,iBAAiB;AACvC,MAAA,KAAK,IAAIvC,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG+Y,iBAAiB,CAAC1a,MAAM,EAAE2B,CAAC,EAAE,EAAE;QACjD,IAAI+Y,iBAAiB,CAAC/Y,CAAC,CAAC,KAAKiZ,kBAAkB,CAAC/Z,CAAC,CAAC,EAAE;AAClD,UAAA,IAAI8Z,cAAc,CAAChZ,CAAC,CAAC,GAAGqD,QAAQ,EAAE;AAChCA,YAAAA,QAAQ,GAAG2V,cAAc,CAAChZ,CAAC,CAAC;AAC5Bkb,YAAAA,QAAQ,GAAGlb,CAAC;AACd,UAAA;AACF,QAAA;AACF,MAAA;AACAkZ,MAAAA,uBAAuB,CAAC/T,IAAI,CAAC6T,cAAc,CAACkC,QAAQ,CAAC,CAAC;AACxD,IAAA;AAGA,IAAA,KAAK,IAAI3a,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGyY,cAAc,CAAC3a,MAAM,EAAEkC,CAAC,EAAE,EAAE;AAC9C,MAAA,IAAIyY,cAAc,CAACzY,CAAC,CAAC,KAAKoY,gBAAgB,EAAE;QAC1C,IAAI9W,IAAI,GAAG,EAAE;AACb,QAAA,KAAK,IAAI3C,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG+Y,eAAe,CAAC5Z,MAAM,EAAEa,CAAC,EAAE,EAAE;UAC/C2C,IAAI,CAACsD,IAAI,CACP8S,eAAe,CAAC/Y,CAAC,CAAC,GAAGuZ,kBAAkB,CAAClY,CAAC,CAAC,CAACrB,CAAC,CAAC,GAAGoZ,WAAW,CAACpZ,CAAC,CAC/D,CAAC;AACH,QAAA;AAEF,MAAA;AACF,IAAA;AACA0X,IAAAA,SAAS,IAAI,CAAC;AAChB,EAAA;AACA;AACA;AACA;;EAEA,IAAIpS,MAAM,GAAG,EAAE;EACfA,MAAM,CAAC2W,gBAAgB,GAAGxC,gBAAgB;EAC1CnU,MAAM,CAACuM,UAAU,GAAG6F,SAAS;EAC7B,IAAIwC,mBAAmB,GAAG,EAAE;AAC5B,EAAA,KAAK,IAAI7Y,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGgY,kBAAkB,GAAG,CAAC,EAAEhY,CAAC,EAAE,EAAE;IAC/C,IAAI6a,IAAI,GAAG,EAAE;AACb,IAAA,KAAK,IAAIlc,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG+Y,eAAe,CAAC5Z,MAAM,EAAEa,CAAC,EAAE,EAAE;MAC/Ckc,IAAI,CAACjW,IAAI,CAAC8S,eAAe,CAAC/Y,CAAC,CAAC,GAAGuZ,kBAAkB,CAAClY,CAAC,CAAC,CAACrB,CAAC,CAAC,GAAGoZ,WAAW,CAACpZ,CAAC,CAAC,CAAC;AAC3E,IAAA;AACAka,IAAAA,mBAAmB,CAACjU,IAAI,CAACiW,IAAI,CAAC;AAChC,EAAA;EAEA5W,MAAM,CAAC6W,UAAU,GAAG;IAClB9C,kBAAkB;IAClBC,eAAe,EAAGA,eAAe,IAAIzH,UAAW;IAChDqI,mBAAmB;IACnBV,WAAW;IACXE,MAAM;IACNC,eAAe;IACfC,SAAS;IACTC,iBAAiB;IACjBC,cAAc;IACdC,kBAAkB;IAClBC,uBAAuB;AACvBC,IAAAA;GACD;EAED,IAAImC,SAAS,GAAG,EAAE;AAClB,EAAA,KAAK,IAAIpc,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG8Z,cAAc,CAAC3a,MAAM,EAAEa,CAAC,EAAE,EAAE;AAC9C,IAAA,IAAI8Z,cAAc,CAAC9Z,CAAC,CAAC,KAAKyZ,gBAAgB,EAAE;AAC1C2C,MAAAA,SAAS,CAACnW,IAAI,CAACiU,mBAAmB,CAACla,CAAC,CAAC,CAAC;AACxC,IAAA;AACF,EAAA;EAEAsF,MAAM,CAAC+W,MAAM,GAAGD,SAAS;AACzB,EAAA,OAAO9W,MAAM;AACf;AAEA,SAAS6U,WAAWA,CAClBL,cAAc,EACdD,iBAAiB,EACjBI,WAAW,EACXR,gBAAgB,EAChB;EACA,IAAIhB,IAAI,GAAG,EAAE;AACb,EAAA,KAAK,IAAIzY,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG8Z,cAAc,CAAC3a,MAAM,EAAEa,CAAC,EAAE,EAAE;IAC9CyY,IAAI,CAACzY,CAAC,CAAC,GACLT,IAAI,CAAC2D,GAAG,CAAC4W,cAAc,CAAC9Z,CAAC,CAAC,IAAIyZ,gBAAgB,GAAGQ,WAAW,CAAC,CAAC,GAC9DJ,iBAAiB,CAAC7Z,CAAC,CAAC;AACxB,EAAA;AACA,EAAA,MAAMiF,GAAG,GAAGf,SAAS,CAACuU,IAAI,CAAC;EAC3B,IAAInT,MAAM,GAAGmT,IAAI,CAAC6B,SAAS,CAAE9W,CAAC,IAAKA,CAAC,KAAKyB,GAAG,CAAC;AAC7C,EAAA,OAAOK,MAAM;AACf;;ACjUM,SAAUgX,kBAAkBA,CAChCjU,IAAY,EACZyI,WAA4D,EAC5DpS,OAA0C,EAAA;EAE1C,MAAM;IACJ4V,SAAS;IACTC,SAAS;IACTL,aAAa;IACb+E,OAAO;IACP5U,SAAS;IACT6U,UAAU;AACVC,IAAAA;AAAY,GACb,GAAGza,OAAO;AACX,EAAA,MAAMoa,iBAAiB,GAAGyD,oBAAoB,CAAClU,IAAI,EAAEyI,WAAW,CAAC;AACjE,EAAA,MAAMxL,MAAM,GAAGuT,MAAM,CACnBC,iBAAiB;AACjB;AACA;EACAxE,SAAqB,EACrBC,SAAqB,EACrB;AACE1C,IAAAA,UAAU,EAAEqC,aAAa;IACzB+E,OAAO;IACP5U,SAAS;IACT6U,UAAU;AACVC,IAAAA;GACD,CACF;EAED,MAAM;AAAEkD,IAAAA;AAAM,GAAE,GAAG/W,MAAM;EAEzB,OAAO;IACL2S,cAAc,EAAE3S,MAAM,CAAC2W,gBAAgB;IACvCpK,UAAU,EAAEvM,MAAM,CAACuM,UAAU;IAC7BmG,eAAe,EAAEqE,MAAM,CAAC,CAAC;AAC1B,GAAA;AACH;AAEA,SAASE,oBAAoBA,CAC3BlU,IAAY,EACZyI,WAA4D,EAAA;EAE5D,MAAM;IAAEtN,CAAC;AAAEkC,IAAAA;AAAC,GAAE,GAAG2C,IAAI;AACrB,EAAA,MAAMyN,QAAQ,GAAGtS,CAAC,CAACrE,MAAM;AACzB,EAAA,OAAQ4R,UAAoB,IAAI;AAC9B,IAAA,MAAM3F,GAAG,GAAG0F,WAAW,CAACC,UAAU,CAAC;IACnC,IAAIa,KAAK,GAAG,CAAC;IACb,KAAK,IAAI5R,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG8V,QAAQ,EAAE9V,CAAC,EAAE,EAAE;AACjC4R,MAAAA,KAAK,IAAI,CAAClM,CAAC,CAAC1F,CAAC,CAAC,GAAGoL,GAAG,CAAC5H,CAAC,CAACxD,CAAC,CAAC,CAAC,KAAK,CAAC;AAClC,IAAA;AACA,IAAA,OAAO4R,KAAK;EACd,CAAC;AACH;;AC5DA;;;;AAIM,SAAU4K,YAAYA,CAACC,mBAAA,GAA2C,EAAE,EAAA;EACxE,MAAM;AAAE9L,IAAAA,IAAI,GAAG,IAAI;AAAEjS,IAAAA;AAAO,GAAE,GAAG+d,mBAAmB;AAEpD,EAAA,QAAQ9L,IAAI;AACV,IAAA,KAAK,IAAI;AACT,IAAA,KAAK,oBAAoB;MACvB,OAAO;AACL+L,QAAAA,SAAS,EAAErF,kBAAkB;AAC7BoF,QAAAA,mBAAmB,EAAE;AACnB1I,UAAAA,OAAO,EAAE,GAAG;AACZG,UAAAA,aAAa,EAAE,GAAG;AAClBC,UAAAA,cAAc,EAAE,IAAI;UACpB,GAAGzV;;AAEN,OAAA;AACH,IAAA,KAAK,QAAQ;AAAE,MAAA;QACb,OAAO;AACLge,UAAAA,SAAS,EAAEJ,kBAAkB;AAC7BG,UAAAA,mBAAmB,EAAE;AACnB5K,YAAAA,UAAU,EAAE,EAAE;AACdoH,YAAAA,OAAO,EAAE,IAAI;AACb5U,YAAAA,SAAS,EAAE,KAAK;AAChB6U,YAAAA,UAAU,EAAE,KAAK;AACjBC,YAAAA,YAAY,EAAE,EAAE;YAChB,GAAGza;;AAEN,SAAA;AACH,MAAA;AACA,IAAA;AACE,MAAA,MAAM,IAAIoE,KAAK,CAAC,CAAA,yBAAA,CAA2B,CAAC;AAChD;AACF;;ACkEA;;;;;;;;AAQM,SAAU8P,QAAQA,CACtBvK,IAAY,EACZjB,KAAU,EACV1I,OAAA,GAA2B,EAAE,EAAA;AAM7B;AACA,EAAA,MAAMwG,GAAG,GAAGN,iBAAiB,CAACyD,IAAI,CAAC3C,CAAC,CAAC;EACrC,MAAM8L,MAAM,GAAGtM,GAAG,KAAK,CAAC,GAAG,CAAC,GAAGA,GAAG;EAElC,MAAM2L,aAAa,GAAGsC,gBAAgB,CAAC/L,KAAK,EAAEoK,MAAM,EAAE9S,OAAO,CAAC;AAE9D;EACA,MAAM2S,WAAW,GAAG,IAAI1R,YAAY,CAAC0I,IAAI,CAAC3C,CAAC,CAACvG,MAAM,CAAC;AACnD,EAAA,KAAK,IAAIa,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGqI,IAAI,CAAC3C,CAAC,CAACvG,MAAM,EAAEa,CAAC,EAAE,EAAE;IACtCqR,WAAW,CAACrR,CAAC,CAAC,GAAGqI,IAAI,CAAC3C,CAAC,CAAC1F,CAAC,CAAC,GAAGwR,MAAM;AACrC,EAAA;EAEA,MAAM;IAAEqB,WAAW;IAAEb,SAAS;IAAEC,SAAS;IAAEX,UAAU;AAAEY,IAAAA;GAAY,GACjEJ,yBAAyB,CAACjB,aAAa,EAAEzJ,KAAK,EAAE1I,OAAO,CAAC;AAC1D,EAAA,MAAMqT,QAAQ,GAAGT,UAAU,CAACnS,MAAM;EAElC,MAAM;IAAEud,SAAS;AAAED,IAAAA;AAAmB,GAAE,GAAGD,YAAY,CAAC9d,OAAO,CAACie,YAAY,CAAC;AAE7E,EAAA,MAAMpL,eAAe,GAAGX,cAAc,CAACC,aAAa,CAAC;AAErD,EAAA,IAAIgC,WAAW,CAAC1T,MAAM,KAAK,CAAC,EAAE;AAC5B,IAAA,OAAOiS,wBAAwB,CAC7BP,aAAa,EACbQ,WAAW,EACXhJ,IAAI,CAAC7E,CAAC,EACN8N,UAAU,EACVC,eAAe,EACfC,MAAM,CACP;AACH,EAAA;AAEA;AACA,EAAA,IAAI8C,SAAuB;AAC3B,EAAA,IAAIC,SAAuB;AAC3B,EAAA,IAAIT,aAA2B;AAC/B,EAAA,IAAI8I,mBAAiC;EACrC,IAAIC,gBAAgB,GAAGtL,eAAe;AAEtC,EAAA,IAAIsB,WAAW,CAAC1T,MAAM,KAAK4S,QAAQ,EAAE;AACnC;AACAuC,IAAAA,SAAS,GAAGtC,SAAS;AACrBuC,IAAAA,SAAS,GAAGtC,SAAS;AACrB6B,IAAAA,aAAa,GAAGxC,UAAU;AAC1BsL,IAAAA,mBAAmB,GAAG1K,UAAU;AAClC,EAAA,CAAC,MAAM;AACL;IACA,MAAM4K,qBAAqB,GAAIC,iBAA2B,IAAI;AAC5D,MAAA,MAAMC,IAAI,GAAG,IAAIrd,YAAY,CAACoS,QAAQ,CAAC;AACvCiL,MAAAA,IAAI,CAAC1G,GAAG,CAAChF,UAAU,CAAC;AACpB,MAAA,KAAK,IAAIxQ,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG+R,WAAW,CAAC1T,MAAM,EAAE2B,CAAC,EAAE,EAAE;QAC3Ckc,IAAI,CAACnK,WAAW,CAAC/R,CAAC,CAAC,CAAC,GAAGic,iBAAiB,CAACjc,CAAC,CAAC;AAC7C,MAAA;MACA,OAAOyQ,eAAe,CAAC7P,KAAK,CAACiC,IAAI,CAACqZ,IAAI,CAAC,CAAC;IAC1C,CAAC;AAED1I,IAAAA,SAAS,GAAG,IAAI3U,YAAY,CAACkT,WAAW,CAAC1T,MAAM,CAAC;AAChDoV,IAAAA,SAAS,GAAG,IAAI5U,YAAY,CAACkT,WAAW,CAAC1T,MAAM,CAAC;AAChD2U,IAAAA,aAAa,GAAG,IAAInU,YAAY,CAACkT,WAAW,CAAC1T,MAAM,CAAC;AACpDyd,IAAAA,mBAAmB,GAAG,IAAIjd,YAAY,CAACkT,WAAW,CAAC1T,MAAM,CAAC;AAC1D,IAAA,KAAK,IAAIkC,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGwR,WAAW,CAAC1T,MAAM,EAAEkC,CAAC,EAAE,EAAE;AAC3C,MAAA,MAAMrB,CAAC,GAAG6S,WAAW,CAACxR,CAAC,CAAC;AACxBiT,MAAAA,SAAS,CAACjT,CAAC,CAAC,GAAG2Q,SAAS,CAAChS,CAAC,CAAC;AAC3BuU,MAAAA,SAAS,CAAClT,CAAC,CAAC,GAAG4Q,SAAS,CAACjS,CAAC,CAAC;AAC3B8T,MAAAA,aAAa,CAACzS,CAAC,CAAC,GAAGiQ,UAAU,CAACtR,CAAC,CAAC;AAChC4c,MAAAA,mBAAmB,CAACvb,CAAC,CAAC,GAAG6Q,UAAU,CAAClS,CAAC,CAAC;AACxC,IAAA;AACA6c,IAAAA,gBAAgB,GAAGC,qBAAqB;AAC1C,EAAA;EAEA,MAAMG,MAAM,GAAGP,SAAS,CAAC;IAAElZ,CAAC,EAAE6E,IAAI,CAAC7E,CAAC;AAAEkC,IAAAA,CAAC,EAAE2L;GAAa,EAAEwL,gBAAgB,EAAE;IACxEvI,SAAS;IACTC,SAAS;IACTT,aAAa;AACbtB,IAAAA,kBAAkB,EAAEoK,mBAAmB;IACvC,GAAGH;GACJ,CAAC;AAEF;AACA,EAAA,IAAIhL,YAAsB;AAC1B,EAAA,IAAIoB,WAAW,CAAC1T,MAAM,KAAK4S,QAAQ,EAAE;IACnCN,YAAY,GAAGwL,MAAM,CAACjF,eAAe;AACvC,EAAA,CAAC,MAAM;AACL,IAAA,MAAMgF,IAAI,GAAGtb,KAAK,CAACiC,IAAI,CAAC2N,UAAU,CAAC;AACnC,IAAA,KAAK,IAAIxQ,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG+R,WAAW,CAAC1T,MAAM,EAAE2B,CAAC,EAAE,EAAE;AAC3Ckc,MAAAA,IAAI,CAACnK,WAAW,CAAC/R,CAAC,CAAC,CAAC,GAAGmc,MAAM,CAACjF,eAAe,CAAClX,CAAC,CAAC;AAClD,IAAA;AACA2Q,IAAAA,YAAY,GAAGuL,IAAI;AACrB,EAAA;EAEA,MAAMtL,QAAQ,GAAG,EAAE;AACnB,EAAA,KAAK,MAAMpJ,IAAI,IAAIuI,aAAa,EAAE;IAChC,MAAM;MAAEpJ,EAAE;MAAEyE,KAAK;MAAE6E,UAAU;AAAEtN,MAAAA;AAAS,KAAE,GAAG6E,IAAI;AAEjD,IAAA,IAAIqJ,OAAO,GAAG;AAAEnO,MAAAA,CAAC,EAAE,CAAC;AAAEkC,MAAAA,CAAC,EAAE,CAAC;AAAEwG,MAAAA;KAAkC;AAE9D,IAAA,IAAIzE,EAAE,EAAE;AACNkK,MAAAA,OAAO,GAAG;AAAE,QAAA,GAAGA,OAAO;AAAElK,QAAAA;OAAI;AAC9B,IAAA;AAEAkK,IAAAA,OAAO,CAACnO,CAAC,GAAGiO,YAAY,CAAChO,SAAS,CAAC;IACnCkO,OAAO,CAACjM,CAAC,GAAG+L,YAAY,CAAChO,SAAS,GAAG,CAAC,CAAC,GAAG+N,MAAM;AAChD,IAAA,KAAK,IAAIxR,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG+Q,UAAU,CAAC5R,MAAM,EAAEa,CAAC,EAAE,EAAE;AAC1C;AACA2R,MAAAA,OAAO,CAACzF,KAAK,CAAC6E,UAAU,CAAC/Q,CAAC,CAAC,CAAC,GAAGyR,YAAY,CAAChO,SAAS,GAAGzD,CAAC,CAAC;AAC5D,IAAA;AACA0R,IAAAA,QAAQ,CAACzL,IAAI,CAAC0L,OAAO,CAAC;AACxB,EAAA;EAEA,OAAO;IACLC,KAAK,EAAEqL,MAAM,CAAChF,cAAc;IAC5BpG,UAAU,EAAEoL,MAAM,CAACpL,UAAU;AAC7BzK,IAAAA,KAAK,EAAEsK;AACR,GAAA;AACH;;AC7NA;;;;;;;AAOM,SAAUwL,eAAeA,CAC7B9V,KAAU,EACV1I,OAAA,GAAqC,EAAE,EAAA;EAEvC,MAAM;AAAEwN,IAAAA,KAAK,GAAG;AAAEyE,MAAAA,IAAI,EAAE;KAAY;IAAEwM,MAAM,GAAGC,eAAe,CAAChW,KAAK;AAAC,GAAE,GACrE1I,OAAO;AACT,EAAA,MAAM2e,oBAAoB,GAAG3M,UAAU,CAACxE,KAAK,CAAC;AAC9C,EAAA,OAAOiR,MAAM,CAAC9J,GAAG,CAAE/K,IAAI,IAAI;AACzB,IAAA,IAAIgV,QAAQ,CAAChV,IAAI,CAAC,EAAE;AAClB,MAAA,IAAI,EAAE,MAAM,IAAIA,IAAI,CAAC4D,KAAK,CAAC,EAAE;AAC3B5D,QAAAA,IAAI,CAAC4D,KAAK,CAACpB,IAAI,GAAG4F,UAAU,CAACpI,IAAI,CAAC4D,KAAK,CAAC,CAACf,WAAW,CAAC7C,IAAI,CAACd,KAAK,CAAC;AAClE,MAAA;AACA,MAAA,OAAOc,IAAI;AACb,IAAA;IACA,OAAO;AACL,MAAA,GAAGA,IAAI;AACP4D,MAAAA,KAAK,EAAE;QACLpB,IAAI,EAAEuS,oBAAoB,CAAClS,WAAW,CAAC7C,IAAI,CAACd,KAAK,CAAC;QAClD,GAAG0E;;AAEN,KAAA;AACH,EAAA,CAAC,CAAC;AACJ;AAEA,SAASoR,QAAQA,CACfhV,IAAO,EAAA;EAEP,OAAO,OAAO,IAAIA,IAAI;AACxB;;AC1CA;;;;;;;;AAQM,SAAUiV,UAAUA,CACxBnW,KAAU,EACV1I,OAAA,GAA6B,EAAE,EAAA;AAE/B,EAAA,IAAI0I,KAAK,CAACjI,MAAM,KAAK,CAAC,EAAE,OAAO,EAAE;EAEjC,MAAM;AAAEgN,IAAAA,MAAM,GAAG;AAAC,GAAE,GAAGzN,OAAO;AAE9B,EAAA,MAAM8e,WAAW,GAAGpW,KAAK,CAACqW,QAAQ,CAAC,CAACvc,CAAC,EAAEC,CAAC,KAAKD,CAAC,CAACsC,CAAC,GAAGrC,CAAC,CAACqC,CAAC,CAAC;AAEvD,EAAA,IAAIka,YAAY,GAAGF,WAAW,CAAC,CAAC,CAAC;AACjC,EAAA,IAAIG,YAAY,GAAQ,CAACD,YAAY,CAAC;AACtC,EAAA,MAAME,MAAM,GAAU,CAACD,YAAY,CAAC;AAEpC,EAAA,KAAK,IAAI3d,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGwd,WAAW,CAACre,MAAM,EAAEa,CAAC,EAAE,EAAE;AAC3C,IAAA,MAAMsI,IAAI,GAAGkV,WAAW,CAACxd,CAAC,CAAC;IAC3B,IACE,CAACsI,IAAI,CAAC9E,CAAC,GAAGka,YAAY,CAACla,CAAC,KAAK,CAAC8E,IAAI,CAACd,KAAK,GAAGkW,YAAY,CAAClW,KAAK,IAAI,CAAC,CAAC,IACnE2E,MAAM,EACN;AACAwR,MAAAA,YAAY,CAAC1X,IAAI,CAACqC,IAAI,CAAC;AACzB,IAAA,CAAC,MAAM;MACLqV,YAAY,GAAG,CAACrV,IAAI,CAAC;AACrBsV,MAAAA,MAAM,CAAC3X,IAAI,CAAC0X,YAAY,CAAC;AAC3B,IAAA;AACAD,IAAAA,YAAY,GAAGpV,IAAI;AACrB,EAAA;AAEA,EAAA,OAAOsV,MAAM;AACf;;ACDA;;;;;;;;;;AAUM,SAAUC,qBAAqBA,CACnCxV,IAAY,EACZyV,QAAa,EACbpf,OAAA,GAAgC,EAAE,EAAA;EAKlC,MAAM;AACJqf,IAAAA,MAAM,GAAG,EAAE;AACX7R,IAAAA,KAAK,GAAG;AAAEyE,MAAAA,IAAI,EAAE;KAAY;AAC5BqN,IAAAA,cAAc,GAAG,CAAC;AAClBC,IAAAA,YAAY,GAAG,CAAC;IAChBlN,UAAU;AACV4L,IAAAA,YAAY,GAAG;AACbhM,MAAAA,IAAI,EAAE,IAAI;AACVjS,MAAAA,OAAO,EAAE;AACPmV,QAAAA,OAAO,EAAE;;;AAEZ,GACF,GAAGnV,OAAO;AAEX;AACA;AACA,EAAA,MAAMkf,MAAM,GAAGL,UAAU,CAACO,QAAQ,EAAE;AAAE3R,IAAAA,MAAM,EAAE6R;AAAc,GAAE,CAAC;EAC/D,MAAME,IAAI,GAAuB,EAAE;EACnC,MAAMC,OAAO,GAAsC,EAAE;AACrD,EAAA,KAAK,MAAMC,SAAS,IAAIR,MAAM,EAAE;AAC9B,IAAA,MAAMS,KAAK,GAAGhJ,IAAI,CAACC,GAAG,EAAE;AACxB,IAAA,MAAMlO,KAAK,GAAG8V,eAAe,CAACkB,SAAS,EAAE;AAAElS,MAAAA;AAAK,KAAE,CAAC;AAEnD,IAAA,MAAMoS,SAAS,GAAGlX,KAAK,CAAC,CAAC,CAAC;IAC1B,MAAMmX,QAAQ,GAAGnX,KAAK,CAACzC,EAAE,CAAC,EAAE,CAA2B;IAEvD,MAAM;MACJhB,IAAI,GAAG2a,SAAS,CAAC9a,CAAC,GAAG8a,SAAS,CAAC9W,KAAK,GAAGyW,YAAY;MACnDra,EAAE,GAAG2a,QAAQ,CAAC/a,CAAC,GAAG+a,QAAQ,CAAC/W,KAAK,GAAGyW;AAAY,KAChD,GAAGF,MAAM;IACV,MAAM;MAAEta,SAAS;AAAEC,MAAAA;AAAO,KAAE,GAAGH,eAAe,CAAC8E,IAAI,CAAC7E,CAAC,EAAE;MAAEG,IAAI;AAAEC,MAAAA;AAAE,KAAE,CAAC;AAEpE,IAAA,MAAMJ,CAAC,GACL6E,IAAI,CAAC7E,CAAC,YAAY7D,YAAY,GAC1B0I,IAAI,CAAC7E,CAAC,CAACgb,QAAQ,CAAC/a,SAAS,EAAEC,OAAO,CAAC,GACnC2E,IAAI,CAAC7E,CAAC,CAACzB,KAAK,CAAC0B,SAAS,EAAEC,OAAO,CAAC;AACtC,IAAA,MAAMgC,CAAC,GACL2C,IAAI,CAAC3C,CAAC,YAAY/F,YAAY,GAC1B0I,IAAI,CAAC3C,CAAC,CAAC8Y,QAAQ,CAAC/a,SAAS,EAAEC,OAAO,CAAC,GACnC2E,IAAI,CAAC3C,CAAC,CAAC3D,KAAK,CAAC0B,SAAS,EAAEC,OAAO,CAAC;AAEtC,IAAA,MAAM+G,GAAG,GAAG;AACVgU,MAAAA,KAAK,EAAE;QAAE9a,IAAI;AAAEC,QAAAA;OAAI;AACnBmN,MAAAA,UAAU,EAAE;QAAE4L,YAAY;AAAE5L,QAAAA;OAAY;MACxC2N,SAAS,EAAEN,SAAS,CAACjf,MAAM;AAC3Bwf,MAAAA,IAAI,EAAEtJ,IAAI,CAACC,GAAG,EAAE,GAAG+I;AACpB,KAAA;AAED,IAAA,IAAI7a,CAAC,CAACrE,MAAM,GAAG,CAAC,EAAE;MAChB,MAAM;QACJ0S,UAAU;QACVD,KAAK;AACLxK,QAAAA,KAAK,EAAEwX;OACR,GAAGhM,QAAQ,CAAC;QAAEpP,CAAC;AAAEkC,QAAAA;OAAG,EAAE0B,KAAK,EAAE;QAC5B8E,KAAK;QACL6E,UAAU;AACV4L,QAAAA;OACD,CAAC;AAEF,MAAA,KAAK,IAAI3c,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGoH,KAAK,CAACjI,MAAM,EAAEa,CAAC,EAAE,EAAE;QACrCme,OAAO,CAAClY,IAAI,CAAC;UACX,GAAG2Y,cAAc,CAAC5e,CAAC,CAAC;UACpBwH,KAAK,EAAEkJ,UAAU,CAACtJ,KAAK,CAACpH,CAAC,CAAC,CAACkM,KAAK,CAAC,CAACjB,WAAW,CAC3C2T,cAAc,CAAC5e,CAAC,CAAC,CAACkM,KAAK,CAACpB,IAAI;SAED,CAAC;AAClC,MAAA;MACAoT,IAAI,CAACjY,IAAI,CAAC;AACR,QAAA,GAAGwE,GAAG;QACNoH,UAAU;QACVD,KAAK;AACLmB,QAAAA,OAAO,EAAE;OACV,CAAC;AACJ,IAAA,CAAC,MAAM;AACLoL,MAAAA,OAAO,CAAClY,IAAI,CAAC,GAAImB,KAA2C,CAAC;MAC7D8W,IAAI,CAACjY,IAAI,CAAC;AACR,QAAA,GAAGwE,GAAG;AACNoH,QAAAA,UAAU,EAAE,CAAC;AACbkB,QAAAA,OAAO,EAAE;OACV,CAAC;AACJ,IAAA;AACF,EAAA;EAEA,OAAO;IAAEmL,IAAI;AAAEU,IAAAA,cAAc,EAAET;GAAS;AAC1C;;ACrGA;;;;;;;;AAQM,SAAUU,aAAaA,CAC3BxW,IAAY,EACZyV,QAAa,EACbpf,OAAA,GAAgC,EAAE,EAAA;EAElC,OAAOmf,qBAAqB,CAACxV,IAAI,EAAEyV,QAAQ,EAAEpf,OAAO,CAAC,CAACkgB,cAAc;AACtE;;AC5DA;;;;;;;AAOM,SAAUE,aAAaA,CAC3B1X,KAAU,EACV1I,OAAA,GAA4B,EAAE,EAAA;EAE9B,MAAM;IAAEye,MAAM,GAAGC,eAAe,CAAChW,KAAK;AAAC,GAAE,GAAG1I,OAAO;AACnD,EAAA,KAAK,MAAM4J,IAAI,IAAI6U,MAAM,EAAE;AACzB,IAAA,IAAI,EAAE,IAAI,IAAI7U,IAAI,CAAC,EAAE;AACnBA,MAAAA,IAAI,CAACb,EAAE,GAAGC,MAAM,CAACC,UAAU,EAAE;AAC/B,IAAA;AACF,EAAA;AAEA,EAAA,OAAOwV,MAAmC;AAC5C;;ACmBA;;;;;;AAMM,SAAU4B,cAAcA,CAC5BjB,QAAgC,EAChCpf,OAAA,GAAiC,EAAE,EAAA;EAEnC,MAAM;AACJwN,IAAAA,KAAK,GAAG;AAAEyE,MAAAA,IAAI,EAAE;KAAY;AAC5BgM,IAAAA,YAAY,GAAG;AAAEhM,MAAAA,IAAI,EAAE,IAAI;AAAEjS,MAAAA,OAAO,EAAE;AAAEmV,QAAAA,OAAO,EAAE;AAAE;KAAI;AACvDmL,IAAAA,UAAU,GAAG,IAAI;AACjBC,IAAAA,UAAU,GAAG;AAAM,GACpB,GAAGvgB,OAAO;EAEX,IAAIwG,GAAG,GAAG,CAAC;EACX,IAAIga,IAAI,GAAG,CAAC;EACZ,IAAIve,KAAK,GAAG,CAAC;EACb,MAAMwe,UAAU,GAA2B,EAAE;AAE7C,EAAA,IAAIrB,QAAQ,CAAC3e,MAAM,GAAG,CAAC,EAAE;IACvB,OAAO2f,aAAa,CAClB5B,eAAe,CAACY,QAAQ,CAACzK,GAAG,CAAC+L,4BAA4B,CAAC,EAAE;AAAElT,MAAAA;AAAK,KAAE,CAAC,CACvE;AACH,EAAA;AAEA,EAAA,IAAImT,MAAM,GAAG9f,IAAI,CAAC2D,GAAG,CAAC4a,QAAQ,CAAC,CAAC,CAAC,CAAC7W,GAAG,CAAC;AACtC,EAAA,KAAK,IAAIjH,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG8d,QAAQ,CAAC3e,MAAM,EAAEa,CAAC,EAAE,EAAE;AACxC,IAAA,MAAMsf,MAAM,GAAG/f,IAAI,CAAC2D,GAAG,CAAC4a,QAAQ,CAAC9d,CAAC,CAAC,CAACiH,GAAG,CAAC;AACxC,IAAA,IAAIqY,MAAM,GAAGD,MAAM,EAAEA,MAAM,GAAGC,MAAM;AACtC,EAAA;EAEA,MAAM5N,QAAQ,GAAuB,EAAE;AACvC,EAAA,KAAK,MAAMpJ,IAAI,IAAIwV,QAAQ,EAAE;AAC3B,IAAA,IAAIve,IAAI,CAAC2D,GAAG,CAACoF,IAAI,CAACrB,GAAG,CAAC,IAAIgY,UAAU,GAAGI,MAAM,EAAE;AAC7CF,MAAAA,UAAU,CAAClZ,IAAI,CAACqC,IAAI,CAAC;AACvB,IAAA,CAAC,MAAM;AACLoJ,MAAAA,QAAQ,CAACzL,IAAI,CAACmZ,4BAA4B,CAAC9W,IAAI,CAAC,CAAC;AACnD,IAAA;AACF,EAAA;AAEA;AACA;EACA6W,UAAU,CAAClZ,IAAI,CAAC;IAAEzC,CAAC,EAAE1E,MAAM,CAACygB,SAAS;AAAE7Z,IAAAA,CAAC,EAAE;AAAC,GAAE,CAAC;AAC9C,EAAA,IAAI8Z,UAAU,GAAiC;IAC7Chc,CAAC,EAAE,CAAC2b,UAAU,CAAC,CAAC,CAAC,CAAC3b,CAAC,CAAC;AACpBkC,IAAAA,CAAC,EAAE,CAACyZ,UAAU,CAAC,CAAC,CAAC,CAACzZ,CAAC;AACpB,GAAA;AACD,EAAA,IAAI+Z,OAAO,GAAa,CAAC,CAAC,CAAC;AAC3B,EAAA,KAAK,IAAIzf,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGmf,UAAU,CAAChgB,MAAM,EAAEa,CAAC,EAAE,EAAE;IAC1C,IAAIT,IAAI,CAAC2D,GAAG,CAACic,UAAU,CAACnf,CAAC,GAAG,CAAC,CAAC,CAACwD,CAAC,GAAG2b,UAAU,CAACnf,CAAC,CAAC,CAACwD,CAAC,CAAC,GAAGwb,UAAU,EAAE;MAChEQ,UAAU,CAAChc,CAAC,CAACyC,IAAI,CAACkZ,UAAU,CAACnf,CAAC,CAAC,CAACwD,CAAC,CAAC;MAClCgc,UAAU,CAAC9Z,CAAC,CAACO,IAAI,CAACkZ,UAAU,CAACnf,CAAC,CAAC,CAAC0F,CAAC,CAAC;MAClC,IAAIyZ,UAAU,CAACnf,CAAC,CAAC,CAAC0F,CAAC,GAAGR,GAAG,EAAE;AACzBA,QAAAA,GAAG,GAAGia,UAAU,CAACnf,CAAC,CAAC,CAAC0F,CAAC;AACrBwZ,QAAAA,IAAI,GAAGlf,CAAC;AACV,MAAA;AACAyf,MAAAA,OAAO,CAACxZ,IAAI,CAACjG,CAAC,CAAC;AACfW,MAAAA,KAAK,EAAE;AACT,IAAA,CAAC,MAAM;MACL,IAAIA,KAAK,GAAG,CAAC,EAAE;QACb,MAAM+e,YAAY,GAAGngB,IAAI,CAAC2D,GAAG,CAC1Bsc,UAAU,CAAChc,CAAC,CAACmB,EAAE,CAAC,EAAE,CAAY,GAAG6a,UAAU,CAAChc,CAAC,CAAC,CAAC,CAAC,CAClD;QACD,MAAM;UAAE0a,IAAI;AAAEU,UAAAA;AAAc,SAAE,GAAGf,qBAAqB,CACpD2B,UAAU,EACV,CACE;AACE/X,UAAAA,EAAE,EAAEC,MAAM,CAACC,UAAU,EAAE;AACvBnE,UAAAA,CAAC,EAAE2b,UAAU,CAACD,IAAI,CAAC,CAAC1b,CAAC;AACrBkC,UAAAA,CAAC,EAAER,GAAG;AACNsC,UAAAA,KAAK,EAAEkY,YAAY;AACnB3O,UAAAA,UAAU,EAAE;AACVvJ,YAAAA,KAAK,EAAE;cAAEtC,GAAG,EAAEwa,YAAY,GAAG,CAAC;cAAEza,GAAG,EAAEya,YAAY,GAAG;AAAG;;AAE1D,SAAA,CACF,EACD;AAAExT,UAAAA,KAAK,EAAE;AAAEyE,YAAAA,IAAI,EAAE;WAAe;AAAEgM,UAAAA;AAAY,SAAE,CACjD;AACDzX,QAAAA,GAAG,GAAG,CAAC;AACPga,QAAAA,IAAI,GAAG,CAAC;AACR,QAAA,MAAMzU,GAAG,GAAGyT,IAAI,CAACyB,IAAI,CAAEtf,CAAC,IAAKA,CAAC,CAAC0S,OAAO,KAAK,yBAAyB,CAAC;QACrE,IAAItI,GAAG,EAAEmH,KAAK,KAAK1S,SAAS,IAAIuL,GAAG,CAACmH,KAAK,GAAG,GAAG,EAAE;AAC/CF,UAAAA,QAAQ,CAACzL,IAAI,CAAC2Y,cAAc,CAAC,CAAC,CAAC,CAAC;AAClC,QAAA,CAAC,MAAM;AACLgB,UAAAA,aAAa,CAACT,UAAU,EAAEM,OAAO,EAAE/N,QAAQ,CAAC;AAC9C,QAAA;AACF,MAAA,CAAC,MAAM;AACLkO,QAAAA,aAAa,CAACT,UAAU,EAAEM,OAAO,EAAE/N,QAAQ,CAAC;AAC9C,MAAA;AAEA8N,MAAAA,UAAU,GAAG;QAAEhc,CAAC,EAAE,CAAC2b,UAAU,CAACnf,CAAC,CAAC,CAACwD,CAAC,CAAC;AAAEkC,QAAAA,CAAC,EAAE,CAACyZ,UAAU,CAACnf,CAAC,CAAC,CAAC0F,CAAC;OAAG;MAC3D+Z,OAAO,GAAG,CAACzf,CAAC,CAAC;AACbkF,MAAAA,GAAG,GAAGia,UAAU,CAACnf,CAAC,CAAC,CAAC0F,CAAC;AACrBwZ,MAAAA,IAAI,GAAGlf,CAAC;AACRW,MAAAA,KAAK,GAAG,CAAC;AACX,IAAA;AACF,EAAA;AACA+Q,EAAAA,QAAQ,CAAC3H,IAAI,CAAC,CAAC7I,CAAC,EAAEC,CAAC,KAAKD,CAAC,CAACsC,CAAC,GAAGrC,CAAC,CAACqC,CAAC,CAAC;EAElC,OAAOsb,aAAa,CAACpN,QAAQ,EAAE;AAAEyL,IAAAA,MAAM,EAAEzL;AAAQ,GAAE,CAAC;AACtD;AAEA,SAASkO,aAAaA,CACpBT,UAAkC,EAClCM,OAAiB,EACjBrY,KAAyB,EAAA;AAEzB,EAAA,KAAK,MAAMjE,KAAK,IAAIsc,OAAO,EAAE;IAC3BrY,KAAK,CAACnB,IAAI,CAACmZ,4BAA4B,CAACD,UAAU,CAAChc,KAAK,CAAC,CAAC,CAAC;AAC7D,EAAA;AACF;AACA,SAASic,4BAA4BA,CAAC9W,IAA0B,EAAA;EAC9D,MAAM;IAAEb,EAAE;IAAEyE,KAAK;IAAE1I,CAAC;IAAEkC,CAAC;AAAE8B,IAAAA;AAAK,GAAE,GAAGc,IAAI;AAEvC,EAAA,MAAMqJ,OAAO,GAAG;IACdnO,CAAC;IACDkC,CAAC;IACD8B,KAAK;AACL0E,IAAAA;AACmB,GAAA;AAErB,EAAA,IAAIzE,EAAE,EAAEkK,OAAO,CAAClK,EAAE,GAAGA,EAAE;AAEvB,EAAA,OAAOkK,OAAO;AAChB;;ACrIA;;;;;;;;;AASM,SAAUkO,YAAYA,CAC1B/B,QAAa,EACbpf,OAAA,GAA+B,EAAE,EAAA;EAEjC,MAAM;AAAEyN,IAAAA,MAAM,GAAG,CAAC;AAAE2T,IAAAA,OAAO,GAAG;AAAK,GAAE,GAAGphB,OAAO;AAE/C,EAAA,MAAM0I,KAAK,GAAG2Y,QAAQ,CAACjC,QAAQ,EAAE3R,MAAM,CAAC;EAExC,IAAI,CAAC2T,OAAO,EAAE;AACZ,IAAA,KAAK,IAAI9f,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGoH,KAAK,CAACjI,MAAM,GAAG,CAAC,EAAEa,CAAC,EAAE,EAAE;AACzC,MAAA,MAAMsI,IAAI,GAAGlB,KAAK,CAACpH,CAAC,CAAC;AACrB,MAAA,MAAMggB,QAAQ,GAAG5Y,KAAK,CAACpH,CAAC,GAAG,CAAC,CAAC;MAC7B,IAAIsI,IAAI,CAAC1E,EAAE,CAACJ,CAAC,GAAGwc,QAAQ,CAACrc,IAAI,CAACH,CAAC,EAAE;AAC/B;AACA8E,QAAAA,IAAI,CAAC1E,EAAE,CAACJ,CAAC,GACN8E,IAAI,CAACd,KAAK,IAAIwY,QAAQ,CAACxY,KAAK,GAAGc,IAAI,CAACd,KAAK,CAAC,IAAKwY,QAAQ,CAACxc,CAAC,GAAG8E,IAAI,CAAC9E,CAAC,CAAC,GACpE8E,IAAI,CAAC9E,CAAC;QACRwc,QAAQ,CAACrc,IAAI,CAACH,CAAC,GAAG8E,IAAI,CAAC1E,EAAE,CAACJ,CAAC;AAC7B,MAAA;AACF,IAAA;AACF,EAAA;AAEA,EAAA,KAAK,MAAM8E,IAAI,IAAIlB,KAAK,EAAE;AACxBkB,IAAAA,IAAI,CAACd,KAAK,GAAGc,IAAI,CAAC1E,EAAE,CAACJ,CAAC,GAAG8E,IAAI,CAAC3E,IAAI,CAACH,CAAC;IACpC,IAAI8E,IAAI,CAAC4D,KAAK,EAAE;MACd,MAAM;QAAEA,KAAK;AAAE1E,QAAAA;AAAK,OAAE,GAAGc,IAAI;AAC7B,MAAA,IAAI4D,KAAK,CAACpB,IAAI,KAAK5L,SAAS,EAAE;AAC5B,QAAA,MAAM+R,QAAQ,GAAGP,UAAU,CAACxE,KAAK,CAAC;QAClCA,KAAK,CAACpB,IAAI,GAAGmG,QAAQ,CAAC9F,WAAW,CAAC3D,KAAK,CAAC;AAC1C,MAAA;AACF,IAAA;AACF,EAAA;AAEA,EAAA,OAAOJ,KAAK;AACd;AAEA,SAAS2Y,QAAQA,CACf3Y,KAAU,EACV+E,MAAc,EAAA;AAEd,EAAA,OAAO/E,KAAK,CAACiM,GAAG,CAAE/K,IAAI,IAAI;IACxB,MAAM;MAAEb,EAAE;MAAEyE,KAAK;MAAE1I,CAAC;MAAEkC,CAAC;MAAEvC,KAAK;AAAEyE,MAAAA;AAAgB,KAAE,GAAGU,IAAI;AACzD,IAAA,MAAM2X,KAAK,GAAGzc,CAAC,GAAG,CAACA,CAAC,GAAGoE,gBAAgB,CAACjE,IAAI,CAACH,CAAC,IAAI2I,MAAM;AACxD,IAAA,MAAM+T,GAAG,GAAG1c,CAAC,GAAG,CAACoE,gBAAgB,CAAChE,EAAE,CAACJ,CAAC,GAAGA,CAAC,IAAI2I,MAAM;AAEpD,IAAA,IAAI7G,MAAM,GAAG;MACX9B,CAAC;MACDkC,CAAC;MACDvC,KAAK;MACLqE,KAAK,EAAE0Y,GAAG,GAAGD,KAAK;AAClBtc,MAAAA,IAAI,EAAE;AAAEH,QAAAA,CAAC,EAAEyc;OAAO;AAClBrc,MAAAA,EAAE,EAAE;AAAEJ,QAAAA,CAAC,EAAE0c;AAAG;AACK,KAAA;AAEnB,IAAA,IAAIzY,EAAE,EAAE;AACNnC,MAAAA,MAAM,GAAG;AAAE,QAAA,GAAGA,MAAM;AAAEmC,QAAAA;OAAI;AAC5B,IAAA;AAEA,IAAA,IAAIyE,KAAK,EAAE;AACT5G,MAAAA,MAAM,GAAG;AAAE,QAAA,GAAGA,MAAM;AAAE4G,QAAAA;OAAO;AAC/B,IAAA;AAEA,IAAA,OAAO5G,MAA0B;AACnC,EAAA,CAAC,CAAC;AACJ;;ACzFA;;;;;;AAMM,SAAU6a,QAAQA,CACtB/Y,KAAU,EACV1I,OAAA,GAA8B,EAAE,EAAA;EAEhC,MAAM;AAAEwN,IAAAA,KAAK,GAAG;AAAEyE,MAAAA,IAAI,EAAE;KAAY;IAAEwM,MAAM,GAAGC,eAAe,CAAChW,KAAK;AAAC,GAAE,GACrE1I,OAAO;AACT,EAAA,MAAM0hB,aAAa,GAAG1P,UAAU,CAACxE,KAAK,CAAC;AACvC,EAAA,OAAOiR,MAAM,CAAC9J,GAAG,CAAE/K,IAAI,KAAM;AAC3B,IAAA,GAAGA,IAAI;AACP4D,IAAAA,KAAK,EAAE;AAAE,MAAA,GAAGA,KAAK;AAAEpB,MAAAA,IAAI,EAAEsV,aAAa,CAACjV,WAAW,CAAC7C,IAAI,CAACd,KAAK;AAAC;AAC/D,GAAA,CAAC,CAAC;AACL;;;;","x_google_ignoreList":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53]}