@paraswap/dex-lib 4.1.21 → 4.1.22

package/build/dex/swaap-v1/libraries/LogExpMath.js

@@ -1,418 +0,0 @@
-"use strict";
-var _a;
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.LogExpMath = void 0;
-const bigint_constants_1 = require("../../../bigint-constants");
-const _require = (b, message) => {
-    if (!b)
-        throw new Error(message);
-};
-/* solhint-disable */
-/**
- * @dev Exponentiation and logarithm functions for 18 decimal fixed point numbers (both base and exponent/argument).
- *
- * Exponentiation and logarithm with arbitrary bases (x^y and log_x(y)) are implemented by conversion to natural
- * exponentiation and logarithm (where the base is Euler's number).
- *
- * @author Fernando Martinelli - @fernandomartinelli
- * @author Sergio Yuhjtman - @sergioyuhjtman
- * @author Daniel Fernandez - @dmf7z
- */
-class LogExpMath {
-    /**
-     * @dev Exponentiation (x^y) with unsigned 18 decimal fixed point base and exponent.
-     *
-     * Reverts if ln(x) * y is smaller than `MIN_NATURAL_EXPONENT`, or larger than `MAX_NATURAL_EXPONENT`.
-     */
-    static pow(x, y) {
-        if (y == 0n) {
-            // We solve the 0^0 indetermination by making it equal one.
-            return this.ONE_18;
-        }
-        if (x == 0n) {
-            return 0n;
-        }
-        // Instead of computing x^y directly, we instead rely on the properties of logarithms and exponentiation to
-        // arrive at that result. In particular, exp(ln(x)) = x, and ln(x^y) = y * ln(x). This means
-        // x^y = exp(y * ln(x)).
-        // The ln function takes a signed value, so we need to make sure x fits in the signed 256 bit range.
-        _require(x < 2n ** 255n, 'Err.X_OUT_OF_BOUNDS');
-        const x_int256 = x;
-        // We will compute y * ln(x) in a single step. Depending on the value of x, we can either use ln or ln_36. In
-        // both cases, we leave the division by ONE_18 (due to fixed point multiplication) to the end.
-        // This prevents y * ln(x) from overflowing, and at the same time guarantees y fits in the signed 256 bit range.
-        _require(y < this.MILD_EXPONENT_BOUND, 'Err.Y_OUT_OF_BOUNDS');
-        const y_int256 = y;
-        let logx_times_y;
-        if (this.LN_36_LOWER_BOUND < x_int256 &&
-            x_int256 < this.LN_36_UPPER_BOUND) {
-            const ln_36_x = this._ln_36(x_int256);
-            // ln_36_x has 36 decimal places, so multiplying by y_int256 isn't as straightforward, since we can't just
-            // bring y_int256 to 36 decimal places, as it might overflow. Instead, we perform two 18 decimal
-            // multiplications and add the results: one with the first 18 decimals of ln_36_x, and one with the
-            // (downscaled) last 18 decimals.
-            logx_times_y =
-                (ln_36_x / this.ONE_18) * y_int256 +
-                    ((ln_36_x % this.ONE_18) * y_int256) / this.ONE_18;
-        }
-        else {
-            logx_times_y = this._ln(x_int256) * y_int256;
-        }
-        logx_times_y /= this.ONE_18;
-        // Finally, we compute exp(y * ln(x)) to arrive at x^y
-        _require(this.MIN_NATURAL_EXPONENT <= logx_times_y &&
-            logx_times_y <= this.MAX_NATURAL_EXPONENT, 'Err.PRODUCT_OUT_OF_BOUNDS');
-        return this.exp(logx_times_y);
-    }
-    /**
-     * @dev Natural exponentiation (e^x) with signed 18 decimal fixed point exponent.
-     *
-     * Reverts if `x` is smaller than MIN_NATURAL_EXPONENT, or larger than `MAX_NATURAL_EXPONENT`.
-     */
-    static exp(x) {
-        _require(x >= this.MIN_NATURAL_EXPONENT && x <= this.MAX_NATURAL_EXPONENT, 'Err.INVALID_EXPONENT');
-        if (x < 0) {
-            // We only handle positive exponents: e^(-x) is computed as 1 / e^x. We can safely make x positive since it
-            // fits in the signed 256 bit range (as it is larger than MIN_NATURAL_EXPONENT).
-            // Fixed point division requires multiplying by ONE_18.
-            return (this.ONE_18 * this.ONE_18) / this.exp(-x);
-        }
-        // First, we use the fact that e^(x+y) = e^x * e^y to decompose x into a sum of powers of two, which we call x_n,
-        // where x_n == 2^(7 - n), and e^x_n = a_n has been precomputed. We choose the first x_n, x0, to equal 2^7
-        // because all larger powers are larger than MAX_NATURAL_EXPONENT, and therefore not present in the
-        // decomposition.
-        // At the end of this process we will have the product of all e^x_n = a_n that apply, and the remainder of this
-        // decomposition, which will be lower than the smallest x_n.
-        // exp(x) = k_0 * a_0 * k_1 * a_1 * ... + k_n * a_n * exp(remainder), where each k_n equals either 0 or 1.
-        // We mutate x by subtracting x_n, making it the remainder of the decomposition.
-        // The first two a_n (e^(2^7) and e^(2^6)) are too large if stored as 18 decimal numbers, and could cause
-        // intermediate overflows. Instead we store them as plain integers, with 0 decimals.
-        // Additionally, x0 + x1 is larger than MAX_NATURAL_EXPONENT, which means they will not both be present in the
-        // decomposition.
-        // For each x_n, we test if that term is present in the decomposition (if x is larger than it), and if so deduct
-        // it and compute the accumulated product.
-        let firstAN;
-        if (x >= this.x0) {
-            x -= this.x0;
-            firstAN = this.a0;
-        }
-        else if (x >= this.x1) {
-            x -= this.x1;
-            firstAN = this.a1;
-        }
-        else {
-            firstAN = 1n; // One with no decimal places
-        }
-        // We now transform x into a 20 decimal fixed point number, to have enhanced precision when computing the
-        // smaller terms.
-        x *= 100n;
-        // `product` is the accumulated product of all a_n (except a0 and a1), which starts at 20 decimal fixed point
-        // one. Recall that fixed point multiplication requires dividing by ONE_20.
-        let product = this.ONE_20;
-        if (x >= this.x2) {
-            x -= this.x2;
-            product = (product * this.a2) / this.ONE_20;
-        }
-        if (x >= this.x3) {
-            x -= this.x3;
-            product = (product * this.a3) / this.ONE_20;
-        }
-        if (x >= this.x4) {
-            x -= this.x4;
-            product = (product * this.a4) / this.ONE_20;
-        }
-        if (x >= this.x5) {
-            x -= this.x5;
-            product = (product * this.a5) / this.ONE_20;
-        }
-        if (x >= this.x6) {
-            x -= this.x6;
-            product = (product * this.a6) / this.ONE_20;
-        }
-        if (x >= this.x7) {
-            x -= this.x7;
-            product = (product * this.a7) / this.ONE_20;
-        }
-        if (x >= this.x8) {
-            x -= this.x8;
-            product = (product * this.a8) / this.ONE_20;
-        }
-        if (x >= this.x9) {
-            x -= this.x9;
-            product = (product * this.a9) / this.ONE_20;
-        }
-        // x10 and x11 are unnecessary here since we have high enough precision already.
-        // Now we need to compute e^x, where x is small (in particular, it is smaller than x9). We use the Taylor series
-        // expansion for e^x: 1 + x + (x^2 / 2!) + (x^3 / 3!) + ... + (x^n / n!).
-        let seriesSum = this.ONE_20; // The initial one in the sum, with 20 decimal places.
-        let term; // Each term in the sum, where the nth term is (x^n / n!).
-        // The first term is simply x.
-        term = x;
-        seriesSum += term;
-        // Each term (x^n / n!) equals the previous one times x, divided by n. Since x is a fixed point number,
-        // multiplying by it requires dividing by ONE_20, but dividing by the non-fixed point n values does not.
-        term = (term * x) / this.ONE_20 / 2n;
-        seriesSum += term;
-        term = (term * x) / this.ONE_20 / 3n;
-        seriesSum += term;
-        term = (term * x) / this.ONE_20 / 4n;
-        seriesSum += term;
-        term = (term * x) / this.ONE_20 / 5n;
-        seriesSum += term;
-        term = (term * x) / this.ONE_20 / 6n;
-        seriesSum += term;
-        term = (term * x) / this.ONE_20 / 7n;
-        seriesSum += term;
-        term = (term * x) / this.ONE_20 / 8n;
-        seriesSum += term;
-        term = (term * x) / this.ONE_20 / 9n;
-        seriesSum += term;
-        term = (term * x) / this.ONE_20 / 10n;
-        seriesSum += term;
-        term = (term * x) / this.ONE_20 / 11n;
-        seriesSum += term;
-        term = (term * x) / this.ONE_20 / 12n;
-        seriesSum += term;
-        // 12 Taylor terms are sufficient for 18 decimal precision.
-        // We now have the first a_n (with no decimals), and the product of all other a_n present, and the Taylor
-        // approximation of the exponentiation of the remainder (both with 20 decimals). All that remains is to multiply
-        // all three (one 20 decimal fixed point multiplication, dividing by ONE_20, and one integer multiplication),
-        // and then drop two digits to return an 18 decimal value.
-        return (((product * seriesSum) / this.ONE_20) * firstAN) / 100n;
-    }
-    /**
-     * @dev Logarithm (log(arg, base), with signed 18 decimal fixed point base and argument.
-     */
-    static log(arg, base) {
-        // This performs a simple base change: log(arg, base) = ln(arg) / ln(base).
-        // Both logBase and logArg are computed as 36 decimal fixed point numbers, either by using ln_36, or by
-        // upscaling.
-        let logBase;
-        if (this.LN_36_LOWER_BOUND < base && base < this.LN_36_UPPER_BOUND) {
-            logBase = this._ln_36(base);
-        }
-        else {
-            logBase = this._ln(base) * this.ONE_18;
-        }
-        let logArg;
-        if (this.LN_36_LOWER_BOUND < arg && arg < this.LN_36_UPPER_BOUND) {
-            logArg = this._ln_36(arg);
-        }
-        else {
-            logArg = this._ln(arg) * this.ONE_18;
-        }
-        // When dividing, we multiply by ONE_18 to arrive at a result with 18 decimal places
-        return (logArg * this.ONE_18) / logBase;
-    }
-    /**
-     * @dev Natural logarithm (ln(a)) with signed 18 decimal fixed point argument.
-     */
-    static ln(a) {
-        // The real natural logarithm is not defined for negative numbers or zero.
-        _require(a > 0, 'Err.OUT_OF_BOUNDS');
-        if (this.LN_36_LOWER_BOUND < a && a < this.LN_36_UPPER_BOUND) {
-            return this._ln_36(a) / this.ONE_18;
-        }
-        else {
-            return this._ln(a);
-        }
-    }
-    /**
-     * @dev Internal natural logarithm (ln(a)) with signed 18 decimal fixed point argument.
-     */
-    static _ln(a) {
-        if (a < this.ONE_18) {
-            // Since ln(a^k) = k * ln(a), we can compute ln(a) as ln(a) = ln((1/a)^(-1)) = - ln((1/a)). If a is less
-            // than one, 1/a will be greater than one, and this if statement will not be entered in the recursive call.
-            // Fixed point division requires multiplying by ONE_18.
-            return -this._ln((this.ONE_18 * this.ONE_18) / a);
-        }
-        // First, we use the fact that ln^(a * b) = ln(a) + ln(b) to decompose ln(a) into a sum of powers of two, which
-        // we call x_n, where x_n == 2^(7 - n), which are the natural logarithm of precomputed quantities a_n (that is,
-        // ln(a_n) = x_n). We choose the first x_n, x0, to equal 2^7 because the exponential of all larger powers cannot
-        // be represented as 18 fixed point decimal numbers in 256 bits, and are therefore larger than a.
-        // At the end of this process we will have the sum of all x_n = ln(a_n) that apply, and the remainder of this
-        // decomposition, which will be lower than the smallest a_n.
-        // ln(a) = k_0 * x_0 + k_1 * x_1 + ... + k_n * x_n + ln(remainder), where each k_n equals either 0 or 1.
-        // We mutate a by subtracting a_n, making it the remainder of the decomposition.
-        // For reasons related to how `exp` works, the first two a_n (e^(2^7) and e^(2^6)) are not stored as fixed point
-        // numbers with 18 decimals, but instead as plain integers with 0 decimals, so we need to multiply them by
-        // ONE_18 to convert them to fixed point.
-        // For each a_n, we test if that term is present in the decomposition (if a is larger than it), and if so divide
-        // by it and compute the accumulated sum.
-        let sum = 0n;
-        if (a >= this.a0 * this.ONE_18) {
-            a /= this.a0; // Integer, not fixed point division
-            sum += this.x0;
-        }
-        if (a >= this.a1 * this.ONE_18) {
-            a /= this.a1; // Integer, not fixed point division
-            sum += this.x1;
-        }
-        // All other a_n and x_n are stored as 20 digit fixed point numbers, so we convert the sum and a to this format.
-        sum *= 100n;
-        a *= 100n;
-        // Because further a_n are  20 digit fixed point numbers, we multiply by ONE_20 when dividing by them.
-        if (a >= this.a2) {
-            a = (a * this.ONE_20) / this.a2;
-            sum += this.x2;
-        }
-        if (a >= this.a3) {
-            a = (a * this.ONE_20) / this.a3;
-            sum += this.x3;
-        }
-        if (a >= this.a4) {
-            a = (a * this.ONE_20) / this.a4;
-            sum += this.x4;
-        }
-        if (a >= this.a5) {
-            a = (a * this.ONE_20) / this.a5;
-            sum += this.x5;
-        }
-        if (a >= this.a6) {
-            a = (a * this.ONE_20) / this.a6;
-            sum += this.x6;
-        }
-        if (a >= this.a7) {
-            a = (a * this.ONE_20) / this.a7;
-            sum += this.x7;
-        }
-        if (a >= this.a8) {
-            a = (a * this.ONE_20) / this.a8;
-            sum += this.x8;
-        }
-        if (a >= this.a9) {
-            a = (a * this.ONE_20) / this.a9;
-            sum += this.x9;
-        }
-        if (a >= this.a10) {
-            a = (a * this.ONE_20) / this.a10;
-            sum += this.x10;
-        }
-        if (a >= this.a11) {
-            a = (a * this.ONE_20) / this.a11;
-            sum += this.x11;
-        }
-        // a is now a small number (smaller than a_11, which roughly equals 1.06). This means we can use a Taylor series
-        // that converges rapidly for values of `a` close to one - the same one used in ln_36.
-        // Let z = (a - 1) / (a + 1).
-        // ln(a) = 2 * (z + z^3 / 3 + z^5 / 5 + z^7 / 7 + ... + z^(2 * n + 1) / (2 * n + 1))
-        // Recall that 20 digit fixed point division requires multiplying by ONE_20, and multiplication requires
-        // division by ONE_20.
-        const z = ((a - this.ONE_20) * this.ONE_20) / (a + this.ONE_20);
-        const z_squared = (z * z) / this.ONE_20;
-        // num is the numerator of the series: the z^(2 * n + 1) term
-        let num = z;
-        // seriesSum holds the accumulated sum of each term in the series, starting with the initial z
-        let seriesSum = num;
-        // In each step, the numerator is multiplied by z^2
-        num = (num * z_squared) / this.ONE_20;
-        seriesSum += num / 3n;
-        num = (num * z_squared) / this.ONE_20;
-        seriesSum += num / 5n;
-        num = (num * z_squared) / this.ONE_20;
-        seriesSum += num / 7n;
-        num = (num * z_squared) / this.ONE_20;
-        seriesSum += num / 9n;
-        num = (num * z_squared) / this.ONE_20;
-        seriesSum += num / 11n;
-        // 6 Taylor terms are sufficient for 36 decimal precision.
-        // Finally, we multiply by 2 (non fixed point) to compute ln(remainder)
-        seriesSum *= 2n;
-        // We now have the sum of all x_n present, and the Taylor approximation of the logarithm of the remainder (both
-        // with 20 decimals). All that remains is to sum these two, and then drop two digits to return a 18 decimal
-        // value.
-        return (sum + seriesSum) / 100n;
-    }
-    /**
-     * @dev Intrnal high precision (36 decimal places) natural logarithm (ln(x)) with signed 18 decimal fixed point argument,
-     * for x close to one.
-     *
-     * Should only be used if x is between LN_36_LOWER_BOUND and LN_36_UPPER_BOUND.
-     */
-    static _ln_36(x) {
-        // Since ln(1) = 0, a value of x close to one will yield a very small result, which makes using 36 digits
-        // worthwhile.
-        // First, we transform x to a 36 digit fixed point value.
-        x *= this.ONE_18;
-        // We will use the following Taylor expansion, which converges very rapidly. Let z = (x - 1) / (x + 1).
-        // ln(x) = 2 * (z + z^3 / 3 + z^5 / 5 + z^7 / 7 + ... + z^(2 * n + 1) / (2 * n + 1))
-        // Recall that 36 digit fixed point division requires multiplying by ONE_36, and multiplication requires
-        // division by ONE_36.
-        const z = ((x - this.ONE_36) * this.ONE_36) / (x + this.ONE_36);
-        const z_squared = (z * z) / this.ONE_36;
-        // num is the numerator of the series: the z^(2 * n + 1) term
-        let num = z;
-        // seriesSum holds the accumulated sum of each term in the series, starting with the initial z
-        let seriesSum = num;
-        // In each step, the numerator is multiplied by z^2
-        num = (num * z_squared) / this.ONE_36;
-        seriesSum += num / 3n;
-        num = (num * z_squared) / this.ONE_36;
-        seriesSum += num / 5n;
-        num = (num * z_squared) / this.ONE_36;
-        seriesSum += num / 7n;
-        num = (num * z_squared) / this.ONE_36;
-        seriesSum += num / 9n;
-        num = (num * z_squared) / this.ONE_36;
-        seriesSum += num / 11n;
-        num = (num * z_squared) / this.ONE_36;
-        seriesSum += num / 13n;
-        num = (num * z_squared) / this.ONE_36;
-        seriesSum += num / 15n;
-        // 8 Taylor terms are sufficient for 36 decimal precision.
-        // All that remains is multiplying by 2 (non fixed point).
-        return seriesSum * 2n;
-    }
-}
-exports.LogExpMath = LogExpMath;
-_a = LogExpMath;
-// All fixed point multiplications and divisions are inlined. This means we need to divide by ONE when multiplying
-// two numbers, and multiply by ONE when dividing them.
-// All arguments and return values are 18 decimal fixed point numbers.
-LogExpMath.ONE_18 = bigint_constants_1.BI_POWS[18];
-// Internally, intermediate values are computed with higher precision as 20 decimal fixed point numbers, and in the
-// case of ln36, 36 decimals.
-LogExpMath.ONE_20 = bigint_constants_1.BI_POWS[20];
-LogExpMath.ONE_36 = bigint_constants_1.BI_POWS[36];
-// The domain of natural exponentiation is bound by the word size and number of decimals used.
-//
-// Because internally the result will be stored using 20 decimals, the largest possible result is
-// (2^255 - 1) / 10^20, which makes the largest exponent ln((2^255 - 1) / 10^20) = 130.700829182905140221.
-// The smallest possible result is 10^(-18), which makes largest negative argument
-// ln(10^(-18)) = -41.446531673892822312.
-// We use 130.0 and -41.0 to have some safety margin.
-LogExpMath.MAX_NATURAL_EXPONENT = 130n * bigint_constants_1.BI_POWS[18];
-LogExpMath.MIN_NATURAL_EXPONENT = -41n * bigint_constants_1.BI_POWS[18];
-// Bounds for ln_36's argument. Both ln(0.9) and ln(1.1) can be represented with 36 decimal places in a fixed point
-// 256 bit integer.
-LogExpMath.LN_36_LOWER_BOUND = _a.ONE_18 - bigint_constants_1.BI_POWS[17];
-LogExpMath.LN_36_UPPER_BOUND = _a.ONE_18 + bigint_constants_1.BI_POWS[17];
-LogExpMath.MILD_EXPONENT_BOUND = 2n ** 254n / _a.ONE_20;
-// 18 decimalants
-LogExpMath.x0 = 128000000000000000000n; // 2ˆ7
-LogExpMath.a0 = 38877084059945950922200000000000000000000000000000000000n; // eˆ(x0) (no decimals)
-LogExpMath.x1 = 64000000000000000000n; // 2ˆ6
-LogExpMath.a1 = 6235149080811616882910000000n; // eˆ(x1) (no decimals)
-// 20 decimalants
-LogExpMath.x2 = 3200000000000000000000n; // 2ˆ5
-LogExpMath.a2 = 7896296018268069516100000000000000n; // eˆ(x2)
-LogExpMath.x3 = 1600000000000000000000n; // 2ˆ4
-LogExpMath.a3 = 888611052050787263676000000n; // eˆ(x3)
-LogExpMath.x4 = 800000000000000000000n; // 2ˆ3
-LogExpMath.a4 = 298095798704172827474000n; // eˆ(x4)
-LogExpMath.x5 = 400000000000000000000n; // 2ˆ2
-LogExpMath.a5 = 5459815003314423907810n; // eˆ(x5)
-LogExpMath.x6 = 200000000000000000000n; // 2ˆ1
-LogExpMath.a6 = 738905609893065022723n; // eˆ(x6)
-LogExpMath.x7 = 100000000000000000000n; // 2ˆ0
-LogExpMath.a7 = 271828182845904523536n; // eˆ(x7)
-LogExpMath.x8 = 50000000000000000000n; // 2ˆ-1
-LogExpMath.a8 = 164872127070012814685n; // eˆ(x8)
-LogExpMath.x9 = 25000000000000000000n; // 2ˆ-2
-LogExpMath.a9 = 128402541668774148407n; // eˆ(x9)
-LogExpMath.x10 = 12500000000000000000n; // 2ˆ-3
-LogExpMath.a10 = 113314845306682631683n; // eˆ(x10)
-LogExpMath.x11 = 6250000000000000000n; // 2ˆ-4
-LogExpMath.a11 = 106449445891785942956n; // eˆ(x11)
-//# sourceMappingURL=LogExpMath.js.map

package/build/dex/swaap-v1/libraries/LogExpMath.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"LogExpMath.js","sourceRoot":"","sources":["../../../../src/dex/swaap-v1/libraries/LogExpMath.ts"],"names":[],"mappings":";;;;AAAA,gEAAgE;AAEhE,MAAM,QAAQ,GAAG,CAAC,CAAU,EAAE,OAAe,EAAE,EAAE;IAC/C,IAAI,CAAC,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC;AACnC,CAAC,CAAC;AAEF,qBAAqB;AAErB;;;;;;;;;GASG;AACH,MAAa,UAAU;IAyDrB;;;;OAIG;IACH,MAAM,CAAC,GAAG,CAAC,CAAS,EAAE,CAAS;QAC7B,IAAI,CAAC,IAAI,EAAE,EAAE;YACX,2DAA2D;YAC3D,OAAO,IAAI,CAAC,MAAM,CAAC;SACpB;QAED,IAAI,CAAC,IAAI,EAAE,EAAE;YACX,OAAO,EAAE,CAAC;SACX;QAED,2GAA2G;QAC3G,4FAA4F;QAC5F,wBAAwB;QAExB,oGAAoG;QACpG,QAAQ,CAAC,CAAC,GAAG,EAAE,IAAI,IAAI,EAAE,qBAAqB,CAAC,CAAC;QAChD,MAAM,QAAQ,GAAG,CAAC,CAAC;QAEnB,6GAA6G;QAC7G,8FAA8F;QAE9F,gHAAgH;QAChH,QAAQ,CAAC,CAAC,GAAG,IAAI,CAAC,mBAAmB,EAAE,qBAAqB,CAAC,CAAC;QAC9D,MAAM,QAAQ,GAAG,CAAC,CAAC;QAEnB,IAAI,YAAY,CAAC;QACjB,IACE,IAAI,CAAC,iBAAiB,GAAG,QAAQ;YACjC,QAAQ,GAAG,IAAI,CAAC,iBAAiB,EACjC;YACA,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;YAEtC,0GAA0G;YAC1G,gGAAgG;YAChG,mGAAmG;YACnG,iCAAiC;YACjC,YAAY;gBACV,CAAC,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,QAAQ;oBAClC,CAAC,CAAC,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,QAAQ,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;SACtD;aAAM;YACL,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,QAAQ,CAAC;SAC9C;QACD,YAAY,IAAI,IAAI,CAAC,MAAM,CAAC;QAE5B,sDAAsD;QACtD,QAAQ,CACN,IAAI,CAAC,oBAAoB,IAAI,YAAY;YACvC,YAAY,IAAI,IAAI,CAAC,oBAAoB,EAC3C,2BAA2B,CAC5B,CAAC;QAEF,OAAO,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;IAChC,CAAC;IAED;;;;OAIG;IACH,MAAM,CAAC,GAAG,CAAC,CAAS;QAClB,QAAQ,CACN,CAAC,IAAI,IAAI,CAAC,oBAAoB,IAAI,CAAC,IAAI,IAAI,CAAC,oBAAoB,EAChE,sBAAsB,CACvB,CAAC;QAEF,IAAI,CAAC,GAAG,CAAC,EAAE;YACT,2GAA2G;YAC3G,gFAAgF;YAChF,uDAAuD;YACvD,OAAO,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;SACnD;QAED,iHAAiH;QACjH,0GAA0G;QAC1G,mGAAmG;QACnG,iBAAiB;QACjB,+GAA+G;QAC/G,4DAA4D;QAC5D,0GAA0G;QAC1G,gFAAgF;QAEhF,yGAAyG;QACzG,oFAAoF;QACpF,8GAA8G;QAC9G,iBAAiB;QAEjB,gHAAgH;QAChH,0CAA0C;QAE1C,IAAI,OAAO,CAAC;QACZ,IAAI,CAAC,IAAI,IAAI,CAAC,EAAE,EAAE;YAChB,CAAC,IAAI,IAAI,CAAC,EAAE,CAAC;YACb,OAAO,GAAG,IAAI,CAAC,EAAE,CAAC;SACnB;aAAM,IAAI,CAAC,IAAI,IAAI,CAAC,EAAE,EAAE;YACvB,CAAC,IAAI,IAAI,CAAC,EAAE,CAAC;YACb,OAAO,GAAG,IAAI,CAAC,EAAE,CAAC;SACnB;aAAM;YACL,OAAO,GAAG,EAAE,CAAC,CAAC,6BAA6B;SAC5C;QAED,yGAAyG;QACzG,iBAAiB;QACjB,CAAC,IAAI,IAAI,CAAC;QAEV,6GAA6G;QAC7G,2EAA2E;QAC3E,IAAI,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC;QAE1B,IAAI,CAAC,IAAI,IAAI,CAAC,EAAE,EAAE;YAChB,CAAC,IAAI,IAAI,CAAC,EAAE,CAAC;YACb,OAAO,GAAG,CAAC,OAAO,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;SAC7C;QACD,IAAI,CAAC,IAAI,IAAI,CAAC,EAAE,EAAE;YAChB,CAAC,IAAI,IAAI,CAAC,EAAE,CAAC;YACb,OAAO,GAAG,CAAC,OAAO,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;SAC7C;QACD,IAAI,CAAC,IAAI,IAAI,CAAC,EAAE,EAAE;YAChB,CAAC,IAAI,IAAI,CAAC,EAAE,CAAC;YACb,OAAO,GAAG,CAAC,OAAO,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;SAC7C;QACD,IAAI,CAAC,IAAI,IAAI,CAAC,EAAE,EAAE;YAChB,CAAC,IAAI,IAAI,CAAC,EAAE,CAAC;YACb,OAAO,GAAG,CAAC,OAAO,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;SAC7C;QACD,IAAI,CAAC,IAAI,IAAI,CAAC,EAAE,EAAE;YAChB,CAAC,IAAI,IAAI,CAAC,EAAE,CAAC;YACb,OAAO,GAAG,CAAC,OAAO,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;SAC7C;QACD,IAAI,CAAC,IAAI,IAAI,CAAC,EAAE,EAAE;YAChB,CAAC,IAAI,IAAI,CAAC,EAAE,CAAC;YACb,OAAO,GAAG,CAAC,OAAO,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;SAC7C;QACD,IAAI,CAAC,IAAI,IAAI,CAAC,EAAE,EAAE;YAChB,CAAC,IAAI,IAAI,CAAC,EAAE,CAAC;YACb,OAAO,GAAG,CAAC,OAAO,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;SAC7C;QACD,IAAI,CAAC,IAAI,IAAI,CAAC,EAAE,EAAE;YAChB,CAAC,IAAI,IAAI,CAAC,EAAE,CAAC;YACb,OAAO,GAAG,CAAC,OAAO,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;SAC7C;QAED,gFAAgF;QAEhF,gHAAgH;QAChH,yEAAyE;QAEzE,IAAI,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,sDAAsD;QACnF,IAAI,IAAI,CAAC,CAAC,0DAA0D;QAEpE,8BAA8B;QAC9B,IAAI,GAAG,CAAC,CAAC;QACT,SAAS,IAAI,IAAI,CAAC;QAElB,uGAAuG;QACvG,wGAAwG;QAExG,IAAI,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,EAAE,CAAC;QACrC,SAAS,IAAI,IAAI,CAAC;QAElB,IAAI,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,EAAE,CAAC;QACrC,SAAS,IAAI,IAAI,CAAC;QAElB,IAAI,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,EAAE,CAAC;QACrC,SAAS,IAAI,IAAI,CAAC;QAElB,IAAI,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,EAAE,CAAC;QACrC,SAAS,IAAI,IAAI,CAAC;QAElB,IAAI,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,EAAE,CAAC;QACrC,SAAS,IAAI,IAAI,CAAC;QAElB,IAAI,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,EAAE,CAAC;QACrC,SAAS,IAAI,IAAI,CAAC;QAElB,IAAI,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,EAAE,CAAC;QACrC,SAAS,IAAI,IAAI,CAAC;QAElB,IAAI,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,EAAE,CAAC;QACrC,SAAS,IAAI,IAAI,CAAC;QAElB,IAAI,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC;QACtC,SAAS,IAAI,IAAI,CAAC;QAElB,IAAI,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC;QACtC,SAAS,IAAI,IAAI,CAAC;QAElB,IAAI,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC;QACtC,SAAS,IAAI,IAAI,CAAC;QAElB,2DAA2D;QAE3D,yGAAyG;QACzG,gHAAgH;QAChH,6GAA6G;QAC7G,0DAA0D;QAE1D,OAAO,CAAC,CAAC,CAAC,OAAO,GAAG,SAAS,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,OAAO,CAAC,GAAG,IAAI,CAAC;IAClE,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,GAAG,CAAC,GAAW,EAAE,IAAY;QAClC,2EAA2E;QAE3E,uGAAuG;QACvG,aAAa;QAEb,IAAI,OAAO,CAAC;QACZ,IAAI,IAAI,CAAC,iBAAiB,GAAG,IAAI,IAAI,IAAI,GAAG,IAAI,CAAC,iBAAiB,EAAE;YAClE,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;SAC7B;aAAM;YACL,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;SACxC;QAED,IAAI,MAAM,CAAC;QACX,IAAI,IAAI,CAAC,iBAAiB,GAAG,GAAG,IAAI,GAAG,GAAG,IAAI,CAAC,iBAAiB,EAAE;YAChE,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;SAC3B;aAAM;YACL,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;SACtC;QAED,oFAAoF;QACpF,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,OAAO,CAAC;IAC1C,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,EAAE,CAAC,CAAS;QACjB,0EAA0E;QAC1E,QAAQ,CAAC,CAAC,GAAG,CAAC,EAAE,mBAAmB,CAAC,CAAC;QACrC,IAAI,IAAI,CAAC,iBAAiB,GAAG,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,iBAAiB,EAAE;YAC5D,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;SACrC;aAAM;YACL,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;SACpB;IACH,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,GAAG,CAAC,CAAS;QAClB,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE;YACnB,wGAAwG;YACxG,2GAA2G;YAC3G,uDAAuD;YACvD,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;SACnD;QAED,+GAA+G;QAC/G,+GAA+G;QAC/G,gHAAgH;QAChH,iGAAiG;QACjG,6GAA6G;QAC7G,4DAA4D;QAC5D,wGAAwG;QACxG,gFAAgF;QAEhF,gHAAgH;QAChH,0GAA0G;QAC1G,yCAAyC;QACzC,gHAAgH;QAChH,yCAAyC;QAEzC,IAAI,GAAG,GAAG,EAAE,CAAC;QACb,IAAI,CAAC,IAAI,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,MAAM,EAAE;YAC9B,CAAC,IAAI,IAAI,CAAC,EAAE,CAAC,CAAC,oCAAoC;YAClD,GAAG,IAAI,IAAI,CAAC,EAAE,CAAC;SAChB;QAED,IAAI,CAAC,IAAI,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,MAAM,EAAE;YAC9B,CAAC,IAAI,IAAI,CAAC,EAAE,CAAC,CAAC,oCAAoC;YAClD,GAAG,IAAI,IAAI,CAAC,EAAE,CAAC;SAChB;QAED,gHAAgH;QAChH,GAAG,IAAI,IAAI,CAAC;QACZ,CAAC,IAAI,IAAI,CAAC;QAEV,sGAAsG;QAEtG,IAAI,CAAC,IAAI,IAAI,CAAC,EAAE,EAAE;YAChB,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC;YAChC,GAAG,IAAI,IAAI,CAAC,EAAE,CAAC;SAChB;QAED,IAAI,CAAC,IAAI,IAAI,CAAC,EAAE,EAAE;YAChB,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC;YAChC,GAAG,IAAI,IAAI,CAAC,EAAE,CAAC;SAChB;QAED,IAAI,CAAC,IAAI,IAAI,CAAC,EAAE,EAAE;YAChB,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC;YAChC,GAAG,IAAI,IAAI,CAAC,EAAE,CAAC;SAChB;QAED,IAAI,CAAC,IAAI,IAAI,CAAC,EAAE,EAAE;YAChB,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC;YAChC,GAAG,IAAI,IAAI,CAAC,EAAE,CAAC;SAChB;QAED,IAAI,CAAC,IAAI,IAAI,CAAC,EAAE,EAAE;YAChB,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC;YAChC,GAAG,IAAI,IAAI,CAAC,EAAE,CAAC;SAChB;QAED,IAAI,CAAC,IAAI,IAAI,CAAC,EAAE,EAAE;YAChB,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC;YAChC,GAAG,IAAI,IAAI,CAAC,EAAE,CAAC;SAChB;QAED,IAAI,CAAC,IAAI,IAAI,CAAC,EAAE,EAAE;YAChB,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC;YAChC,GAAG,IAAI,IAAI,CAAC,EAAE,CAAC;SAChB;QAED,IAAI,CAAC,IAAI,IAAI,CAAC,EAAE,EAAE;YAChB,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC;YAChC,GAAG,IAAI,IAAI,CAAC,EAAE,CAAC;SAChB;QAED,IAAI,CAAC,IAAI,IAAI,CAAC,GAAG,EAAE;YACjB,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC;YACjC,GAAG,IAAI,IAAI,CAAC,GAAG,CAAC;SACjB;QAED,IAAI,CAAC,IAAI,IAAI,CAAC,GAAG,EAAE;YACjB,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC;YACjC,GAAG,IAAI,IAAI,CAAC,GAAG,CAAC;SACjB;QAED,gHAAgH;QAChH,sFAAsF;QACtF,6BAA6B;QAC7B,oFAAoF;QAEpF,wGAAwG;QACxG,sBAAsB;QACtB,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC;QAChE,MAAM,SAAS,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;QAExC,6DAA6D;QAC7D,IAAI,GAAG,GAAG,CAAC,CAAC;QAEZ,8FAA8F;QAC9F,IAAI,SAAS,GAAG,GAAG,CAAC;QAEpB,mDAAmD;QACnD,GAAG,GAAG,CAAC,GAAG,GAAG,SAAS,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;QACtC,SAAS,IAAI,GAAG,GAAG,EAAE,CAAC;QAEtB,GAAG,GAAG,CAAC,GAAG,GAAG,SAAS,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;QACtC,SAAS,IAAI,GAAG,GAAG,EAAE,CAAC;QAEtB,GAAG,GAAG,CAAC,GAAG,GAAG,SAAS,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;QACtC,SAAS,IAAI,GAAG,GAAG,EAAE,CAAC;QAEtB,GAAG,GAAG,CAAC,GAAG,GAAG,SAAS,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;QACtC,SAAS,IAAI,GAAG,GAAG,EAAE,CAAC;QAEtB,GAAG,GAAG,CAAC,GAAG,GAAG,SAAS,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;QACtC,SAAS,IAAI,GAAG,GAAG,GAAG,CAAC;QAEvB,0DAA0D;QAE1D,uEAAuE;QACvE,SAAS,IAAI,EAAE,CAAC;QAEhB,+GAA+G;QAC/G,2GAA2G;QAC3G,SAAS;QAET,OAAO,CAAC,GAAG,GAAG,SAAS,CAAC,GAAG,IAAI,CAAC;IAClC,CAAC;IAED;;;;;OAKG;IACH,MAAM,CAAC,MAAM,CAAC,CAAS;QACrB,yGAAyG;QACzG,cAAc;QAEd,yDAAyD;QACzD,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC;QAEjB,uGAAuG;QACvG,oFAAoF;QAEpF,wGAAwG;QACxG,sBAAsB;QACtB,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC;QAChE,MAAM,SAAS,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;QAExC,6DAA6D;QAC7D,IAAI,GAAG,GAAG,CAAC,CAAC;QAEZ,8FAA8F;QAC9F,IAAI,SAAS,GAAG,GAAG,CAAC;QAEpB,mDAAmD;QACnD,GAAG,GAAG,CAAC,GAAG,GAAG,SAAS,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;QACtC,SAAS,IAAI,GAAG,GAAG,EAAE,CAAC;QAEtB,GAAG,GAAG,CAAC,GAAG,GAAG,SAAS,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;QACtC,SAAS,IAAI,GAAG,GAAG,EAAE,CAAC;QAEtB,GAAG,GAAG,CAAC,GAAG,GAAG,SAAS,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;QACtC,SAAS,IAAI,GAAG,GAAG,EAAE,CAAC;QAEtB,GAAG,GAAG,CAAC,GAAG,GAAG,SAAS,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;QACtC,SAAS,IAAI,GAAG,GAAG,EAAE,CAAC;QAEtB,GAAG,GAAG,CAAC,GAAG,GAAG,SAAS,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;QACtC,SAAS,IAAI,GAAG,GAAG,GAAG,CAAC;QAEvB,GAAG,GAAG,CAAC,GAAG,GAAG,SAAS,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;QACtC,SAAS,IAAI,GAAG,GAAG,GAAG,CAAC;QAEvB,GAAG,GAAG,CAAC,GAAG,GAAG,SAAS,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;QACtC,SAAS,IAAI,GAAG,GAAG,GAAG,CAAC;QAEvB,0DAA0D;QAE1D,0DAA0D;QAC1D,OAAO,SAAS,GAAG,EAAE,CAAC;IACxB,CAAC;;AA3eH,gCA4eC;;AA3eC,kHAAkH;AAClH,uDAAuD;AAEvD,sEAAsE;AAC/D,iBAAM,GAAG,0BAAO,CAAC,EAAE,CAAC,CAAC;AAE5B,mHAAmH;AACnH,6BAA6B;AACtB,iBAAM,GAAG,0BAAO,CAAC,EAAE,CAAC,CAAC;AACrB,iBAAM,GAAG,0BAAO,CAAC,EAAE,CAAC,CAAC;AAE5B,8FAA8F;AAC9F,EAAE;AACF,iGAAiG;AACjG,0GAA0G;AAC1G,kFAAkF;AAClF,yCAAyC;AACzC,qDAAqD;AAC9C,+BAAoB,GAAG,IAAI,GAAG,0BAAO,CAAC,EAAE,CAAC,CAAC;AAC1C,+BAAoB,GAAG,CAAC,GAAG,GAAG,0BAAO,CAAC,EAAE,CAAC,CAAC;AAEjD,mHAAmH;AACnH,mBAAmB;AACZ,4BAAiB,GAAG,EAAI,CAAC,MAAM,GAAG,0BAAO,CAAC,EAAE,CAAC,CAAC;AAC9C,4BAAiB,GAAG,EAAI,CAAC,MAAM,GAAG,0BAAO,CAAC,EAAE,CAAC,CAAC;AAE9C,8BAAmB,GAAG,EAAE,IAAI,IAAI,GAAG,EAAI,CAAC,MAAM,CAAC;AAEtD,iBAAiB;AACV,aAAE,GAAG,sBAAsB,CAAC,CAAC,MAAM;AACnC,aAAE,GAAG,yDAAyD,CAAC,CAAC,uBAAuB;AACvF,aAAE,GAAG,qBAAqB,CAAC,CAAC,MAAM;AAClC,aAAE,GAAG,6BAA6B,CAAC,CAAC,uBAAuB;AAElE,iBAAiB;AACV,aAAE,GAAG,uBAAuB,CAAC,CAAC,MAAM;AACpC,aAAE,GAAG,mCAAmC,CAAC,CAAC,SAAS;AACnD,aAAE,GAAG,uBAAuB,CAAC,CAAC,MAAM;AACpC,aAAE,GAAG,4BAA4B,CAAC,CAAC,SAAS;AAC5C,aAAE,GAAG,sBAAsB,CAAC,CAAC,MAAM;AACnC,aAAE,GAAG,yBAAyB,CAAC,CAAC,SAAS;AACzC,aAAE,GAAG,sBAAsB,CAAC,CAAC,MAAM;AACnC,aAAE,GAAG,uBAAuB,CAAC,CAAC,SAAS;AACvC,aAAE,GAAG,sBAAsB,CAAC,CAAC,MAAM;AACnC,aAAE,GAAG,sBAAsB,CAAC,CAAC,SAAS;AACtC,aAAE,GAAG,sBAAsB,CAAC,CAAC,MAAM;AACnC,aAAE,GAAG,sBAAsB,CAAC,CAAC,SAAS;AACtC,aAAE,GAAG,qBAAqB,CAAC,CAAC,OAAO;AACnC,aAAE,GAAG,sBAAsB,CAAC,CAAC,SAAS;AACtC,aAAE,GAAG,qBAAqB,CAAC,CAAC,OAAO;AACnC,aAAE,GAAG,sBAAsB,CAAC,CAAC,SAAS;AACtC,cAAG,GAAG,qBAAqB,CAAC,CAAC,OAAO;AACpC,cAAG,GAAG,sBAAsB,CAAC,CAAC,UAAU;AACxC,cAAG,GAAG,oBAAoB,CAAC,CAAC,OAAO;AACnC,cAAG,GAAG,sBAAsB,CAAC,CAAC,UAAU"}

package/build/dex/swaap-v1/libraries/MathMMM.d.ts

@@ -1,185 +0,0 @@
-import * as Struct from './Struct';
-import { ChainLinkData } from '../types';
-export declare class MathMMM {
-    /**********************************************************************************************
-      // calcSpotPrice                                                                             //
-      // sP = spotPrice                                                                            //
-      // bI = tokenBalanceIn                      ( bI * w0 )                                      //
-      // bO = tokenBalanceOut         sP =  ------------------------                               //
-      // wI = tokenWeightIn                 ( bO * wI ) * ( 1 - sF )                               //
-      // wO = tokenWeightOut                                                                       //
-      // sF = swapFee                                                                              //
-      **********************************************************************************************/
-    static calcSpotPrice(tokenBalanceIn: bigint, tokenWeightIn: bigint, tokenBalanceOut: bigint, tokenWeightOut: bigint, swapFee: bigint): bigint;
-    /**********************************************************************************************
-      // calcOutGivenIn                                                                            //
-      // aO = tokenAmountOut                                                                       //
-      // bO = tokenBalanceOut                                                                      //
-      // bI = tokenBalanceIn              /      /            bI             \    (wI / wO) \      //
-      // aI = tokenAmountIn    aO = bO * |  1 - | --------------------------  | ^            |     //
-      // wI = tokenWeightIn               \      \ ( bI + ( aI * ( 1 - sF )) /              /      //
-      // wO = tokenWeightOut                                                                       //
-      // sF = swapFee                                                                              //
-      **********************************************************************************************/
-    static calcOutGivenIn(tokenBalanceIn: bigint, tokenWeightIn: bigint, tokenBalanceOut: bigint, tokenWeightOut: bigint, tokenAmountIn: bigint, swapFee: bigint): bigint;
-    /**********************************************************************************************
-      // calcInGivenOut                                                                            //
-      // aI = tokenAmountIn                                                                        //
-      // bO = tokenBalanceOut               /  /     bO      \    (wO / wI)      \                 //
-      // bI = tokenBalanceIn          bI * |  | ------------  | ^            - 1  |                //
-      // aO = tokenAmountOut    aI =        \  \ ( bO - aO ) /                   /                 //
-      // wI = tokenWeightIn           --------------------------------------------                 //
-      // wO = tokenWeightOut                          ( 1 - sF )                                   //
-      // sF = swapFee                                                                              //
-      **********************************************************************************************/
-    static calcInGivenOut(tokenBalanceIn: bigint, tokenWeightIn: bigint, tokenBalanceOut: bigint, tokenWeightOut: bigint, tokenAmountOut: bigint, swapFee: bigint): bigint;
-    /**
-     * @notice Computes the amount of tokenIn needed in order to receive a given amount of tokenOut
-     * @dev A spread is applied as soon as entering a "shortage of tokenOut" phase
-     * cf whitepaper: https://www.swaap.finance/whitepaper.pdf
-     * @param tokenGlobalIn The pool global information on tokenIn
-     * @param tokenGlobalOut The pool global information on tokenOut
-     * @param relativePrice The price of tokenOut in tokenIn terms
-     * @param swapParameters Amount of token out and swap fee
-     * @param gbmParameters The GBM forecast parameters (Z, horizon)
-     * @param hpParameters The parameters for historical prices retrieval
-     * @return swapResult The swap result (amount in, spread and tax base in)
-     */
-    static calcInGivenOutMMM(tokenGlobalIn: Struct.TokenGlobal, tokenGlobalOut: Struct.TokenGlobal, relativePrice: bigint, swapParameters: Struct.SwapParameters, gbmParameters: Struct.GBMParameters, hpParameters: Struct.HistoricalPricesParameters, historicalPricesIn: ChainLinkData, historicalPricesOut: ChainLinkData, currentTimestamp: bigint): Struct.SwapResult;
-    /**
-     * @notice Implements 'calcInGivenOutMMM' in the case of abundance of tokenOut
-     * @dev Two cases to consider:
-     * 1) amount of tokenIn won't drive the pool from abundance of tokenOut to shortage ==> 1 pricing (no spread)
-     * 2) amount of tokenIn will drive the pool from abundance of tokenOut to shortage ==> 2 pricing, one for each phase
-     * @param tokenGlobalIn The pool global information on tokenIn
-     * @param tokenGlobalOut The pool global information on tokenOut
-     * @param swapParameters The parameters of the swap
-     * @param relativePrice The price of tokenOut in tokenIn terms
-     * @param adjustedTokenWeightOut The spread-augmented tokenOut's weight
-     * @return tokenAmountIn The total amount of tokenIn needed for the swap
-     * @return taxBaseIn The amount of tokenIn swapped when in shortage of tokenOut
-     */
-    static _calcInGivenOutMMMMixed(tokenGlobalIn: Struct.TokenGlobal, tokenGlobalOut: Struct.TokenGlobal, swapParameters: Struct.SwapParameters, relativePrice: bigint, adjustedTokenWeightOut: bigint, balanceOutAtEquilibrium: bigint, currentTimestamp: bigint): [bigint, bigint];
-    /**
-     * @notice Implements calcOutGivenInMMM in the case of abundance of tokenOut
-     * @dev A spread is applied as soon as entering a "shortage of tokenOut" phase
-     * cf whitepaper: https://www.swaap.finance/whitepaper.pdf
-     * @param tokenGlobalIn The pool global information on tokenIn
-     * @param tokenGlobalOut The pool global information on tokenOut
-     * @param relativePrice The price of tokenOut in tokenIn terms
-     * @param tokenAmountOut The amount of tokenOut that will be received
-     * @param baseFee The base fee
-     * @param fallbackSpread The default spread in case the it couldn't be calculated using oracle prices
-     * @return tokenAmountIn The amount of tokenIn needed for the swap
-     */
-    static _calcInGivenOutMMMAbundance(tokenGlobalIn: Struct.TokenGlobal, tokenGlobalOut: Struct.TokenGlobal, tokenAmountOut: bigint, baseFee: bigint): bigint;
-    /**
-     * @notice Computes the net value of a given tokenIn amount in tokenOut terms
-     * @dev A spread is applied as soon as entering a "shortage of tokenOut" phase
-     * cf whitepaper: https://www.swaap.finance/whitepaper.pdf
-     * @param tokenGlobalIn The pool global information on tokenIn
-     * @param tokenGlobalOut The pool global information on tokenOut
-     * @param relativePrice The price of tokenOut in tokenIn terms
-     * @param swapParameters Amount of token in and swap fee
-     * @param gbmParameters The GBM forecast parameters (Z, horizon)
-     * @param hpParameters The parameters for historical prices retrieval
-     * @return swapResult The swap result (amount out, spread and tax base in)
-     */
-    static calcOutGivenInMMM(tokenGlobalIn: Struct.TokenGlobal, tokenGlobalOut: Struct.TokenGlobal, relativePrice: bigint, swapParameters: Struct.SwapParameters, gbmParameters: Struct.GBMParameters, hpParameters: Struct.HistoricalPricesParameters, historicalPricesIn: ChainLinkData, historicalPricesOut: ChainLinkData, currentTimestamp: bigint): Struct.SwapResult;
-    /**
-     * @notice Implements 'calcOutGivenInMMM' in the case of mixed regime of tokenOut (abundance then shortage)
-     * @param tokenGlobalIn The pool global information on tokenIn
-     * @param tokenGlobalOut The pool global information on tokenOut
-     * @param swapParameters The parameters of the swap
-     * @param relativePrice The price of tokenOut in tokenIn terms
-     * @param adjustedTokenWeightOut The spread-augmented tokenOut's weight
-     * @param balanceInAtEquilibrium TokenIn balance at equilibrium
-     * @return tokenAmountOut The total amount of token out
-     * @return taxBaseIn The amount of tokenIn swapped when in shortage of tokenOut
-     */
-    static _calcOutGivenInMMMMixed(tokenGlobalIn: Struct.TokenGlobal, tokenGlobalOut: Struct.TokenGlobal, swapParameters: Struct.SwapParameters, relativePrice: bigint, adjustedTokenWeightOut: bigint, balanceInAtEquilibrium: bigint, currentTimestamp: bigint): [bigint, bigint];
-    /**
-     * @notice Implements calcOutGivenInMMM in the case of abundance of tokenOut
-     * @dev A spread is applied as soon as entering a "shortage of tokenOut" phase
-     * cf whitepaper: https://www.swaap.finance/whitepaper.pdf
-     * @param tokenGlobalIn The pool global information on tokenIn
-     * @param tokenGlobalOut The pool global information on tokenOut
-     * @param relativePrice The price of tokenOut in tokenIn terms
-     * @param tokenAmountIn The amount of tokenIn that will be swaped
-     * @param baseFee The base fee
-     * @param fallbackSpread The default spread in case the it couldn't be calculated using oracle prices
-     * @return tokenAmountOut The tokenAmountOut when the tokenOut is in abundance
-     */
-    static _calcOutGivenInMMMAbundance(tokenGlobalIn: Struct.TokenGlobal, tokenGlobalOut: Struct.TokenGlobal, relativePrice: bigint, tokenAmountIn: bigint, baseFee: bigint, fallbackSpread: bigint, currentTimestamp: bigint): bigint;
-    /**
-     * @notice Computes the log spread factor
-     * @dev We define it as the log of the p-quantile of a GBM process (log-normal distribution),
-     * which is given by the following:
-     * mean * horizon + z * sqrt(2 * variance * horizon)
-     * where z = ierf(2p - 1), with ierf being the inverse error function.
-     * GBM: https://en.wikipedia.org/wiki/Geometric_Brownian_motion
-     * Log-normal distribution: https://en.wikipedia.org/wiki/Log-normal_distribution
-     * erf: https://en.wikipedia.org/wiki/Error_function
-     * @param mean The percentage drift
-     * @param variance The percentage volatility
-     * @param horizon The GBM forecast horizon parameter
-     * @param z The GBM forecast z parameter
-     * @return x The log spread factor
-     */
-    static getLogSpreadFactor(mean: bigint, variance: bigint, horizon: bigint, z: bigint): bigint;
-    /**
-      * @notice Apply to the tokenWeight a 'spread' factor
-      * @dev The spread factor is defined as the maximum between:
-      a) the expected relative tokenOut increase in tokenIn terms
-      b) 1
-      * The function multiplies the tokenWeight by the spread factor if
-      * the token is in shortage, or divides it by the spread factor if it is in abundance
-      * @param shortage true when the token is in shortage, false if in abundance
-      * @param fallbackSpread The default spread in case the it couldn't be calculated using oracle prices
-      * @param tokenWeight The token's weight
-      * @param gbmEstimation The GBM's 2 first moments estimation
-      * @param gbmParameters The GBM forecast parameters (Z, horizon)
-      * @return adjustedWeight The adjusted weight based on spread
-      * @return spread The spread
-      */
-    static getMMMWeight(shortage: boolean, fallbackSpread: bigint, tokenWeight: bigint, gbmEstimation: Struct.GBMEstimation, gbmParameters: Struct.GBMParameters): [adjustedWeight: bigint, spread: bigint];
-    /**
-     * @notice Computes the fee amount that will ensure we maintain the pool's value, according to oracle prices.
-     * @dev We apply this fee regime only if Out-In price increased in the same block as now.
-     * @param tokenGlobalIn The pool global information on tokenIn
-     * @param tokenAmountIn The swap desired amount for tokenIn
-     * @param tokenGlobalOut The pool global information on tokenOut
-     * @param tokenAmountOut The swap desired amount for tokenOut
-     * @param relativePrice The price of tokenOut in tokenIn terms
-     * @param baseFee The base fee amount
-     * @param fallbackSpread The default spread in case the it couldn't be calculated using oracle prices
-     * @return alpha The potentially augmented fee amount
-     */
-    /**
-     * @notice Computes the balance of token1 the pool must have in order to have token1/token2 at equilibrium
-     * while satisfying the pricing curve prod^k balance_k^w_k = K
-     * @dev We only rely on the following equations:
-     * a) priceTokenOutOutInTokenIn = balance_in / balance_out * w_out / w_in
-     * b) tokenBalanceOut = (K / prod_k!=in balance_k^w_k)^(1/w_out) = (localInvariant / balance_in^w_in)^(1/w_out)
-     * with localInvariant = balance_in^w_in * balance_out^w_out which can be computed with only In/Out
-     * @param tokenBalance1 The balance of token1 initially
-     * @param tokenWeight1 The weight of token1
-     * @param tokenBalance2 The balance of token2 initially
-     * @param tokenWeight2 The weight of token2
-     * @param relativePrice The price of tokenOut in tokenIn terms
-     * @return balance1AtEquilibrium The balance of token1 in order to have a token1/token2 at equilibrium
-     */
-    static getTokenBalanceAtEquilibrium(tokenBalance1: bigint, tokenWeight1: bigint, tokenBalance2: bigint, tokenWeight2: bigint, relativePrice: bigint): bigint;
-    /**
-     * @notice Computes the fee needed to maintain the pool's value constant
-     * @dev We use oracle to evaluate pool's value
-     * @param tokenBalanceIn The balance of tokenIn initially
-     * @param tokenAmountIn The amount of tokenIn to be added
-     * @param tokenWeightIn The weight of tokenIn
-     * @param tokenBalanceOut The balance of tokenOut initially
-     * @param tokenAmountOut The amount of tokenOut to be removed from the pool
-     * @param tokenWeightOut The weight of tokenOut
-     * @return adaptiveFee The computed adaptive fee to be added to the base fees
-     */
-    static calcAdaptiveFeeGivenInAndOut(tokenBalanceIn: bigint, tokenAmountIn: bigint, tokenWeightIn: bigint, tokenBalanceOut: bigint, tokenAmountOut: bigint, tokenWeightOut: bigint): bigint;
-}