goscript 0.0.34 → 0.0.36

package/dist/gs/math/jn.gs.js

@@ -0,0 +1,412 @@
+import { Abs } from "./abs.gs.js";
+import { Inf, IsInf, IsNaN, NaN } from "./bits.gs.js";
+import { J0, Y0 } from "./j0.gs.js";
+import { J1, Y1 } from "./j1.gs.js";
+import { Log } from "./log.gs.js";
+import { Sincos } from "./sincos.gs.js";
+import { Sqrt } from "./sqrt.gs.js";
+// Jn returns the order-n Bessel function of the first kind.
+//
+// Special cases are:
+//
+//	Jn(n, ±Inf) = 0
+//	Jn(n, NaN) = NaN
+export function Jn(n, x) {
+    // special cases
+    // J(-n, x) = (-1)**n * J(n, x), J(n, -x) = (-1)**n * J(n, x)
+    // Thus, J(-n, x) = J(n, -x)
+    switch (true) {
+        case IsNaN(x):
+            return x;
+        case IsInf(x, 0):
+            return 0;
+    }
+    if (n == 0) {
+        return J0(x);
+    }
+    if (x == 0) {
+        return 0;
+    }
+    if (n < 0) {
+        [n, x] = [-n, -x];
+    }
+    if (n == 1) {
+        return J1(x);
+    }
+    let sign = false;
+    // odd n and negative x
+    if (x < 0) {
+        x = -x;
+        // odd n and negative x
+        if ((n & 1) == 1) {
+            sign = true; // odd n and negative x
+        }
+    }
+    let b = 0;
+    // Safe to use J(n+1,x)=2n/x *J(n,x)-J(n-1,x)
+    // x > 2**302
+    // (x >> n**2)
+    //          Jn(x) = cos(x-(2n+1)*pi/4)*sqrt(2/x*pi)
+    //          Yn(x) = sin(x-(2n+1)*pi/4)*sqrt(2/x*pi)
+    //          Let s=sin(x), c=cos(x),
+    //              xn=x-(2n+1)*pi/4, sqt2 = sqrt(2),then
+    //
+    //                 n    sin(xn)*sqt2    cos(xn)*sqt2
+    //              ----------------------------------
+    //                 0     s-c             c+s
+    //                 1    -s-c            -c+s
+    //                 2    -s+c            -c-s
+    //                 3     s+c             c-s
+    // avoid underflow
+    // x < 2**-29
+    // x is tiny, return the first Taylor expansion of J(n,x)
+    // J(n,x) = 1/n!*(x/2)**n  - ...
+    // underflow
+    // a = n!
+    // b = (x/2)**n
+    // use backward recurrence
+    //                      x      x**2      x**2
+    //  J(n,x)/J(n-1,x) =  ----   ------   ------   .....
+    //                      2n  - 2(n+1) - 2(n+2)
+    //
+    //                      1      1        1
+    //  (for large x)   =  ----  ------   ------   .....
+    //                      2n   2(n+1)   2(n+2)
+    //                      -- - ------ - ------ -
+    //                       x     x         x
+    //
+    // Let w = 2n/x and h=2/x, then the above quotient
+    // is equal to the continued fraction:
+    //                  1
+    //      = -----------------------
+    //                     1
+    //         w - -----------------
+    //                        1
+    //              w+h - ---------
+    //                     w+2h - ...
+    //
+    // To determine how many terms needed, let
+    // Q(0) = w, Q(1) = w(w+h) - 1,
+    // Q(k) = (w+k*h)*Q(k-1) - Q(k-2),
+    // When Q(k) > 1e4	good for single
+    // When Q(k) > 1e9	good for double
+    // When Q(k) > 1e17	good for quadruple
+    // determine k
+    //  estimate log((2/x)**n*n!) = n*log(2/x)+n*ln(n)
+    //  Hence, if n*(log(2n/x)) > ...
+    //  single 8.8722839355e+01
+    //  double 7.09782712893383973096e+02
+    //  long double 1.1356523406294143949491931077970765006170e+04
+    //  then recurrent value may overflow and the result is
+    //  likely underflow to zero
+    // scale b to avoid spurious overflow
+    if (n <= x) {
+        // Safe to use J(n+1,x)=2n/x *J(n,x)-J(n-1,x)
+        // x > 2**302
+        // (x >> n**2)
+        //          Jn(x) = cos(x-(2n+1)*pi/4)*sqrt(2/x*pi)
+        //          Yn(x) = sin(x-(2n+1)*pi/4)*sqrt(2/x*pi)
+        //          Let s=sin(x), c=cos(x),
+        //              xn=x-(2n+1)*pi/4, sqt2 = sqrt(2),then
+        //
+        //                 n    sin(xn)*sqt2    cos(xn)*sqt2
+        //              ----------------------------------
+        //                 0     s-c             c+s
+        //                 1    -s-c            -c+s
+        //                 2    -s+c            -c-s
+        //                 3     s+c             c-s
+        // avoid underflow
+        if (x >= 8148143905337944345073782753637512644205873574663745002544561797417525199053346824733589504) {
+            // x > 2**302
+            // (x >> n**2)
+            //          Jn(x) = cos(x-(2n+1)*pi/4)*sqrt(2/x*pi)
+            //          Yn(x) = sin(x-(2n+1)*pi/4)*sqrt(2/x*pi)
+            //          Let s=sin(x), c=cos(x),
+            //              xn=x-(2n+1)*pi/4, sqt2 = sqrt(2),then
+            //
+            //                 n    sin(xn)*sqt2    cos(xn)*sqt2
+            //              ----------------------------------
+            //                 0     s-c             c+s
+            //                 1    -s-c            -c+s
+            //                 2    -s+c            -c-s
+            //                 3     s+c             c-s
+            let temp = 0;
+            const [s, c] = Sincos(x);
+            switch ((n & 3)) {
+                case 0:
+                    temp = c + s;
+                    break;
+                case 1:
+                    temp = -c + s;
+                    break;
+                case 2:
+                    temp = -c - s;
+                    break;
+                case 3:
+                    temp = c - s;
+                    break;
+            }
+            b = (1 / 1.77245) * temp / Sqrt(x);
+        }
+        else {
+            b = J1(x);
+            // avoid underflow
+            for (let i = 1, a = J0(x); i < n; i++) {
+                [a, b] = [b, b * ((i + i) / x) - a]; // avoid underflow
+            }
+        }
+    }
+    else {
+        // x < 2**-29
+        // x is tiny, return the first Taylor expansion of J(n,x)
+        // J(n,x) = 1/n!*(x/2)**n  - ...
+        // underflow
+        // a = n!
+        // b = (x/2)**n
+        // use backward recurrence
+        //                      x      x**2      x**2
+        //  J(n,x)/J(n-1,x) =  ----   ------   ------   .....
+        //                      2n  - 2(n+1) - 2(n+2)
+        //
+        //                      1      1        1
+        //  (for large x)   =  ----  ------   ------   .....
+        //                      2n   2(n+1)   2(n+2)
+        //                      -- - ------ - ------ -
+        //                       x     x         x
+        //
+        // Let w = 2n/x and h=2/x, then the above quotient
+        // is equal to the continued fraction:
+        //                  1
+        //      = -----------------------
+        //                     1
+        //         w - -----------------
+        //                        1
+        //              w+h - ---------
+        //                     w+2h - ...
+        //
+        // To determine how many terms needed, let
+        // Q(0) = w, Q(1) = w(w+h) - 1,
+        // Q(k) = (w+k*h)*Q(k-1) - Q(k-2),
+        // When Q(k) > 1e4	good for single
+        // When Q(k) > 1e9	good for double
+        // When Q(k) > 1e17	good for quadruple
+        // determine k
+        //  estimate log((2/x)**n*n!) = n*log(2/x)+n*ln(n)
+        //  Hence, if n*(log(2n/x)) > ...
+        //  single 8.8722839355e+01
+        //  double 7.09782712893383973096e+02
+        //  long double 1.1356523406294143949491931077970765006170e+04
+        //  then recurrent value may overflow and the result is
+        //  likely underflow to zero
+        // scale b to avoid spurious overflow
+        if (x < 1.86265e-09) {
+            // x < 2**-29
+            // x is tiny, return the first Taylor expansion of J(n,x)
+            // J(n,x) = 1/n!*(x/2)**n  - ...
+            // underflow
+            // a = n!
+            // b = (x/2)**n
+            if (n > 33) {
+                // underflow
+                b = 0;
+            }
+            else {
+                let temp = x * 0.5;
+                b = temp;
+                let a = 1.0;
+                // a = n!
+                // b = (x/2)**n
+                for (let i = 2; i <= n; i++) {
+                    a *= i; // a = n!
+                    b *= temp; // b = (x/2)**n
+                }
+                b /= a;
+            }
+        }
+        else {
+            // use backward recurrence
+            //                      x      x**2      x**2
+            //  J(n,x)/J(n-1,x) =  ----   ------   ------   .....
+            //                      2n  - 2(n+1) - 2(n+2)
+            //
+            //                      1      1        1
+            //  (for large x)   =  ----  ------   ------   .....
+            //                      2n   2(n+1)   2(n+2)
+            //                      -- - ------ - ------ -
+            //                       x     x         x
+            //
+            // Let w = 2n/x and h=2/x, then the above quotient
+            // is equal to the continued fraction:
+            //                  1
+            //      = -----------------------
+            //                     1
+            //         w - -----------------
+            //                        1
+            //              w+h - ---------
+            //                     w+2h - ...
+            //
+            // To determine how many terms needed, let
+            // Q(0) = w, Q(1) = w(w+h) - 1,
+            // Q(k) = (w+k*h)*Q(k-1) - Q(k-2),
+            // When Q(k) > 1e4	good for single
+            // When Q(k) > 1e9	good for double
+            // When Q(k) > 1e17	good for quadruple
+            // determine k
+            let w = (n + n) / x;
+            let h = 2 / x;
+            let q0 = w;
+            let z = w + h;
+            let q1 = w * z - 1;
+            let k = 1;
+            for (; q1 < 1e9;) {
+                k++;
+                z += h;
+                [q0, q1] = [q1, z * q1 - q0];
+            }
+            let m = n + n;
+            let t = 0.0;
+            for (let i = 2 * (n + k); i >= m; i -= 2) {
+                t = 1 / (i / x - t);
+            }
+            let a = t;
+            //  estimate log((2/x)**n*n!) = n*log(2/x)+n*ln(n)
+            //  Hence, if n*(log(2n/x)) > ...
+            //  single 8.8722839355e+01
+            //  double 7.09782712893383973096e+02
+            //  long double 1.1356523406294143949491931077970765006170e+04
+            //  then recurrent value may overflow and the result is
+            //  likely underflow to zero
+            b = 1;
+            let tmp = n;
+            let v = 2 / x;
+            tmp = tmp * Log(Abs(v * tmp));
+            // scale b to avoid spurious overflow
+            if (tmp < 7.09782712893383973096e+02) {
+                for (let i = n - 1; i > 0; i--) {
+                    let di = (i + i);
+                    [a, b] = [b, b * di / x - a];
+                }
+            }
+            else {
+                // scale b to avoid spurious overflow
+                for (let i = n - 1; i > 0; i--) {
+                    let di = (i + i);
+                    [a, b] = [b, b * di / x - a];
+                    // scale b to avoid spurious overflow
+                    if (b > 1e100) {
+                        a /= b;
+                        t /= b;
+                        b = 1;
+                    }
+                }
+            }
+            b = t * J0(x) / b;
+        }
+    }
+    if (sign) {
+        return -b;
+    }
+    return b;
+}
+// Yn returns the order-n Bessel function of the second kind.
+//
+// Special cases are:
+//
+//	Yn(n, +Inf) = 0
+//	Yn(n ≥ 0, 0) = -Inf
+//	Yn(n < 0, 0) = +Inf if n is odd, -Inf if n is even
+//	Yn(n, x < 0) = NaN
+//	Yn(n, NaN) = NaN
+export function Yn(n, x) {
+    // special cases
+    switch (true) {
+        case x < 0 || IsNaN(x):
+            return NaN();
+        case IsInf(x, 1):
+            return 0;
+    }
+    if (n == 0) {
+        return Y0(x);
+    }
+    if (x == 0) {
+        if (n < 0 && (n & 1) == 1) {
+            return Inf(1);
+        }
+        return Inf(-1);
+    }
+    let sign = false;
+    // sign true if n < 0 && |n| odd
+    if (n < 0) {
+        n = -n;
+        // sign true if n < 0 && |n| odd
+        if ((n & 1) == 1) {
+            sign = true; // sign true if n < 0 && |n| odd
+        }
+    }
+    if (n == 1) {
+        if (sign) {
+            return -Y1(x);
+        }
+        return Y1(x);
+    }
+    let b = 0;
+    // x > 2**302
+    // (x >> n**2)
+    //	    Jn(x) = cos(x-(2n+1)*pi/4)*sqrt(2/x*pi)
+    //	    Yn(x) = sin(x-(2n+1)*pi/4)*sqrt(2/x*pi)
+    //	    Let s=sin(x), c=cos(x),
+    //		xn=x-(2n+1)*pi/4, sqt2 = sqrt(2),then
+    //
+    //		   n	sin(xn)*sqt2	cos(xn)*sqt2
+    //		----------------------------------
+    //		   0	 s-c		 c+s
+    //		   1	-s-c 		-c+s
+    //		   2	-s+c		-c-s
+    //		   3	 s+c		 c-s
+    // quit if b is -inf
+    if (x >= 8148143905337944345073782753637512644205873574663745002544561797417525199053346824733589504) {
+        // x > 2**302
+        // (x >> n**2)
+        //	    Jn(x) = cos(x-(2n+1)*pi/4)*sqrt(2/x*pi)
+        //	    Yn(x) = sin(x-(2n+1)*pi/4)*sqrt(2/x*pi)
+        //	    Let s=sin(x), c=cos(x),
+        //		xn=x-(2n+1)*pi/4, sqt2 = sqrt(2),then
+        //
+        //		   n	sin(xn)*sqt2	cos(xn)*sqt2
+        //		----------------------------------
+        //		   0	 s-c		 c+s
+        //		   1	-s-c 		-c+s
+        //		   2	-s+c		-c-s
+        //		   3	 s+c		 c-s
+        let temp = 0;
+        const [s, c] = Sincos(x);
+        switch ((n & 3)) {
+            case 0:
+                temp = s - c;
+                break;
+            case 1:
+                temp = -s - c;
+                break;
+            case 2:
+                temp = -s + c;
+                break;
+            case 3:
+                temp = s + c;
+                break;
+        }
+        b = (1 / 1.77245) * temp / Sqrt(x);
+    }
+    else {
+        let a = Y0(x);
+        b = Y1(x);
+        // quit if b is -inf
+        for (let i = 1; i < n && !IsInf(b, -1); i++) {
+            [a, b] = [b, ((i + i) / x) * b - a];
+        }
+    }
+    if (sign) {
+        return -b;
+    }
+    return b;
+}
+//# sourceMappingURL=jn.gs.js.map

package/dist/gs/math/jn.gs.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"jn.gs.js","sourceRoot":"","sources":["../../../gs/math/jn.gs.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,GAAG,EAAE,MAAM,aAAa,CAAC;AAClC,OAAO,EAAE,GAAG,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,cAAc,CAAC;AACtD,OAAO,EAAE,EAAE,EAAE,EAAE,EAAE,MAAM,YAAY,CAAC;AACpC,OAAO,EAAE,EAAE,EAAE,EAAE,EAAE,MAAM,YAAY,CAAC;AACpC,OAAO,EAAE,GAAG,EAAE,MAAM,aAAa,CAAC;AAClC,OAAO,EAAE,MAAM,EAAE,MAAM,gBAAgB,CAAC;AACxC,OAAO,EAAE,IAAI,EAAE,MAAM,cAAc,CAAC;AAEpC,4DAA4D;AAC5D,EAAE;AACF,qBAAqB;AACrB,EAAE;AACF,kBAAkB;AAClB,mBAAmB;AACnB,MAAM,UAAU,EAAE,CAAC,CAAS,EAAE,CAAS;IACtC,gBAAgB;IAEhB,6DAA6D;IAC7D,4BAA4B;IAC5B,QAAQ,IAAI,EAAE,CAAC;QACd,KAAK,KAAK,CAAC,CAAC,CAAC;YACZ,OAAO,CAAC,CAAC;QACV,KAAK,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;YACf,OAAO,CAAC,CAAC;IACX,CAAC;IAED,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;QACZ,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC;IACd,CAAC;IACD,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;QACZ,OAAO,CAAC,CAAC;IACV,CAAC;IACD,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QACX,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACnB,CAAC;IACD,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;QACZ,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC;IACd,CAAC;IACD,IAAI,IAAI,GAAG,KAAK,CAAC;IAEjB,uBAAuB;IACvB,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QACX,CAAC,GAAG,CAAC,CAAC,CAAC;QAEP,uBAAuB;QACvB,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;YAClB,IAAI,GAAG,IAAI,CAAC,CAAC,uBAAuB;QACrC,CAAC;IACF,CAAC;IACD,IAAI,CAAC,GAAW,CAAC,CAAC;IAElB,6CAA6C;IAC7C,aAAa;IAEb,cAAc;IACd,mDAAmD;IACnD,mDAAmD;IACnD,mCAAmC;IACnC,qDAAqD;IACrD,EAAE;IACF,oDAAoD;IACpD,kDAAkD;IAClD,4CAA4C;IAC5C,4CAA4C;IAC5C,4CAA4C;IAC5C,4CAA4C;IAE5C,kBAAkB;IAElB,aAAa;IACb,yDAAyD;IACzD,gCAAgC;IAEhC,YAAY;IAEZ,SAAS;IACT,eAAe;IAEf,0BAA0B;IAC1B,6CAA6C;IAC7C,qDAAqD;IACrD,6CAA6C;IAC7C,EAAE;IACF,yCAAyC;IACzC,oDAAoD;IACpD,4CAA4C;IAC5C,8CAA8C;IAC9C,0CAA0C;IAC1C,EAAE;IACF,kDAAkD;IAClD,sCAAsC;IACtC,qBAAqB;IACrB,iCAAiC;IACjC,wBAAwB;IACxB,gCAAgC;IAChC,2BAA2B;IAC3B,+BAA+B;IAC/B,iCAAiC;IACjC,EAAE;IACF,0CAA0C;IAC1C,+BAA+B;IAC/B,kCAAkC;IAClC,kCAAkC;IAClC,kCAAkC;IAClC,sCAAsC;IAEtC,cAAc;IAEd,kDAAkD;IAClD,iCAAiC;IACjC,2BAA2B;IAC3B,qCAAqC;IACrC,8DAA8D;IAC9D,uDAAuD;IACvD,4BAA4B;IAE5B,qCAAqC;IACrC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;QACZ,6CAA6C;QAC7C,aAAa;QAEb,cAAc;QACd,mDAAmD;QACnD,mDAAmD;QACnD,mCAAmC;QACnC,qDAAqD;QACrD,EAAE;QACF,oDAAoD;QACpD,kDAAkD;QAClD,4CAA4C;QAC5C,4CAA4C;QAC5C,4CAA4C;QAC5C,4CAA4C;QAE5C,kBAAkB;QAClB,IAAI,CAAC,IAAI,2FAA2F,EAAE,CAAC;YACtG,aAAa;YAEb,cAAc;YACd,mDAAmD;YACnD,mDAAmD;YACnD,mCAAmC;YACnC,qDAAqD;YACrD,EAAE;YACF,oDAAoD;YACpD,kDAAkD;YAClD,4CAA4C;YAC5C,4CAA4C;YAC5C,4CAA4C;YAC5C,4CAA4C;YAE5C,IAAI,IAAI,GAAW,CAAC,CAAC;YACrB,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YACzB,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;gBACjB,KAAK,CAAC;oBACL,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC;oBACb,MAAM;gBACP,KAAK,CAAC;oBACL,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;oBACd,MAAM;gBACP,KAAK,CAAC;oBACL,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;oBACd,MAAM;gBACP,KAAK,CAAC;oBACL,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC;oBACb,MAAM;YACR,CAAC;YACD,CAAC,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,GAAG,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACpC,CAAC;aAAM,CAAC;YACP,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;YAEV,kBAAkB;YAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBACvC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,kBAAkB;YACxD,CAAC;QACF,CAAC;IACF,CAAC;SAAM,CAAC;QACP,aAAa;QACb,yDAAyD;QACzD,gCAAgC;QAEhC,YAAY;QAEZ,SAAS;QACT,eAAe;QAEf,0BAA0B;QAC1B,6CAA6C;QAC7C,qDAAqD;QACrD,6CAA6C;QAC7C,EAAE;QACF,yCAAyC;QACzC,oDAAoD;QACpD,4CAA4C;QAC5C,8CAA8C;QAC9C,0CAA0C;QAC1C,EAAE;QACF,kDAAkD;QAClD,sCAAsC;QACtC,qBAAqB;QACrB,iCAAiC;QACjC,wBAAwB;QACxB,gCAAgC;QAChC,2BAA2B;QAC3B,+BAA+B;QAC/B,iCAAiC;QACjC,EAAE;QACF,0CAA0C;QAC1C,+BAA+B;QAC/B,kCAAkC;QAClC,kCAAkC;QAClC,kCAAkC;QAClC,sCAAsC;QAEtC,cAAc;QAEd,kDAAkD;QAClD,iCAAiC;QACjC,2BAA2B;QAC3B,qCAAqC;QACrC,8DAA8D;QAC9D,uDAAuD;QACvD,4BAA4B;QAE5B,qCAAqC;QACrC,IAAI,CAAC,GAAG,WAAW,EAAE,CAAC;YACrB,aAAa;YACb,yDAAyD;YACzD,gCAAgC;YAEhC,YAAY;YAEZ,SAAS;YACT,eAAe;YACf,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC;gBACZ,YAAY;gBACZ,CAAC,GAAG,CAAC,CAAC;YACP,CAAC;iBAAM,CAAC;gBACP,IAAI,IAAI,GAAG,CAAC,GAAG,GAAG,CAAC;gBACnB,CAAC,GAAG,IAAI,CAAC;gBACT,IAAI,CAAC,GAAG,GAAG,CAAC;gBAEZ,SAAS;gBACT,eAAe;gBACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC7B,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS;oBACjB,CAAC,IAAI,IAAI,CAAC,CAAC,eAAe;gBAC3B,CAAC;gBACD,CAAC,IAAI,CAAC,CAAC;YACR,CAAC;QACF,CAAC;aAAM,CAAC;YACP,0BAA0B;YAC1B,6CAA6C;YAC7C,qDAAqD;YACrD,6CAA6C;YAC7C,EAAE;YACF,yCAAyC;YACzC,oDAAoD;YACpD,4CAA4C;YAC5C,8CAA8C;YAC9C,0CAA0C;YAC1C,EAAE;YACF,kDAAkD;YAClD,sCAAsC;YACtC,qBAAqB;YACrB,iCAAiC;YACjC,wBAAwB;YACxB,gCAAgC;YAChC,2BAA2B;YAC3B,+BAA+B;YAC/B,iCAAiC;YACjC,EAAE;YACF,0CAA0C;YAC1C,+BAA+B;YAC/B,kCAAkC;YAClC,kCAAkC;YAClC,kCAAkC;YAClC,sCAAsC;YAEtC,cAAc;YACd,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;YACpB,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACd,IAAI,EAAE,GAAG,CAAC,CAAC;YACX,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACd,IAAI,EAAE,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACnB,IAAI,CAAC,GAAG,CAAC,CAAC;YACV,OAAO,EAAE,GAAG,GAAG,GAAI,CAAC;gBACnB,CAAC,EAAE,CAAC;gBACJ,CAAC,IAAI,CAAC,CAAC;gBACP,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;YAC9B,CAAC;YACD,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACd,IAAI,CAAC,GAAG,GAAG,CAAC;YACZ,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC1C,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;YACrB,CAAC;YACD,IAAI,CAAC,GAAG,CAAC,CAAC;YAEV,kDAAkD;YAClD,iCAAiC;YACjC,2BAA2B;YAC3B,qCAAqC;YACrC,8DAA8D;YAC9D,uDAAuD;YACvD,4BAA4B;YAC5B,CAAC,GAAG,CAAC,CAAC;YAEN,IAAI,GAAG,GAAG,CAAC,CAAC;YACZ,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACd,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;YAE9B,qCAAqC;YACrC,IAAI,GAAG,GAAG,0BAA0B,EAAE,CAAC;gBACtC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;oBAChC,IAAI,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;oBACjB,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;gBAC9B,CAAC;YACF,CAAC;iBAAM,CAAC;gBAEP,qCAAqC;gBACrC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;oBAChC,IAAI,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;oBACjB,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;oBAC7B,qCAAqC;oBACrC,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC;wBACf,CAAC,IAAI,CAAC,CAAC;wBACP,CAAC,IAAI,CAAC,CAAC;wBACP,CAAC,GAAG,CAAC,CAAC;oBACP,CAAC;gBACF,CAAC;YACF,CAAC;YACD,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACnB,CAAC;IACF,CAAC;IACD,IAAI,IAAI,EAAE,CAAC;QACV,OAAO,CAAC,CAAC,CAAC;IACX,CAAC;IACD,OAAO,CAAC,CAAC;AACV,CAAC;AAED,6DAA6D;AAC7D,EAAE;AACF,qBAAqB;AACrB,EAAE;AACF,kBAAkB;AAClB,sBAAsB;AACtB,qDAAqD;AACrD,qBAAqB;AACrB,mBAAmB;AACnB,MAAM,UAAU,EAAE,CAAC,CAAS,EAAE,CAAS;IACtC,gBAAgB;IAChB,QAAQ,IAAI,EAAE,CAAC;QACd,KAAK,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC;YACrB,OAAO,GAAG,EAAE,CAAC;QACd,KAAK,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;YACf,OAAO,CAAC,CAAC;IACX,CAAC;IAED,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;QACZ,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC;IACd,CAAC;IACD,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;QACZ,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;YAC3B,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC;QACf,CAAC;QACD,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAChB,CAAC;IACD,IAAI,IAAI,GAAG,KAAK,CAAC;IAEjB,gCAAgC;IAChC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QACX,CAAC,GAAG,CAAC,CAAC,CAAC;QAEP,gCAAgC;QAChC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;YAClB,IAAI,GAAG,IAAI,CAAC,CAAC,gCAAgC;QAC9C,CAAC;IACF,CAAC;IACD,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;QACZ,IAAI,IAAI,EAAE,CAAC;YACV,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACf,CAAC;QACD,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC;IACd,CAAC;IACD,IAAI,CAAC,GAAW,CAAC,CAAC;IAClB,aAAa;IACb,cAAc;IACd,8CAA8C;IAC9C,8CAA8C;IAC9C,8BAA8B;IAC9B,yCAAyC;IACzC,EAAE;IACF,kCAAkC;IAClC,sCAAsC;IACtC,mBAAmB;IACnB,oBAAoB;IACpB,mBAAmB;IACnB,mBAAmB;IAEnB,oBAAoB;IACpB,IAAI,CAAC,IAAI,2FAA2F,EAAE,CAAC;QACtG,aAAa;QACb,cAAc;QACd,8CAA8C;QAC9C,8CAA8C;QAC9C,8BAA8B;QAC9B,yCAAyC;QACzC,EAAE;QACF,kCAAkC;QAClC,sCAAsC;QACtC,mBAAmB;QACnB,oBAAoB;QACpB,mBAAmB;QACnB,mBAAmB;QAEnB,IAAI,IAAI,GAAW,CAAC,CAAC;QACrB,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACzB,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;YACjB,KAAK,CAAC;gBACL,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC;gBACb,MAAM;YACP,KAAK,CAAC;gBACL,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;gBACd,MAAM;YACP,KAAK,CAAC;gBACL,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;gBACd,MAAM;YACP,KAAK,CAAC;gBACL,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC;gBACb,MAAM;QACR,CAAC;QACD,CAAC,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,GAAG,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;IACpC,CAAC;SAAM,CAAC;QACP,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;QACd,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;QACV,oBAAoB;QACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7C,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QACrC,CAAC;IACF,CAAC;IACD,IAAI,IAAI,EAAE,CAAC;QACV,OAAO,CAAC,CAAC,CAAC;IACX,CAAC;IACD,OAAO,CAAC,CAAC;AACV,CAAC"}

package/dist/gs/math/ldexp.gs.d.ts

@@ -0,0 +1,2 @@
+export declare function Ldexp(frac: number, exp: number): number;
+export declare function ldexp(frac: number, exp: number): number;

package/dist/gs/math/ldexp.gs.js

@@ -0,0 +1,20 @@
+// Ldexp is the inverse of [Frexp].
+// It returns frac × 2**exp.
+//
+// Special cases are:
+//
+//	Ldexp(±0, exp) = ±0
+//	Ldexp(±Inf, exp) = ±Inf
+//	Ldexp(NaN, exp) = NaN
+export function Ldexp(frac, exp) {
+    return ldexp(frac, exp);
+}
+export function ldexp(frac, exp) {
+    // Handle special cases
+    if (frac === 0 || !Number.isFinite(frac) || Number.isNaN(frac)) {
+        return frac;
+    }
+    // Return frac × 2**exp
+    return frac * Math.pow(2, exp);
+}
+//# sourceMappingURL=ldexp.gs.js.map

package/dist/gs/math/ldexp.gs.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ldexp.gs.js","sourceRoot":"","sources":["../../../gs/math/ldexp.gs.ts"],"names":[],"mappings":"AAMA,mCAAmC;AACnC,4BAA4B;AAC5B,EAAE;AACF,qBAAqB;AACrB,EAAE;AACF,sBAAsB;AACtB,0BAA0B;AAC1B,wBAAwB;AACxB,MAAM,UAAU,KAAK,CAAC,IAAY,EAAE,GAAW;IAC9C,OAAO,KAAK,CAAC,IAAI,EAAE,GAAG,CAAC,CAAA;AACxB,CAAC;AAED,MAAM,UAAU,KAAK,CAAC,IAAY,EAAE,GAAW;IAC9C,uBAAuB;IACvB,IAAI,IAAI,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;QAChE,OAAO,IAAI,CAAA;IACZ,CAAC;IAED,uBAAuB;IACvB,OAAO,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAA;AAC/B,CAAC"}

package/dist/gs/math/lgamma.gs.d.ts

@@ -0,0 +1,2 @@
+export declare function Lgamma(x: number): [number, number];
+export declare function sinPi(x: number): number;