goscript 0.0.33 → 0.0.35

package/gs/math/jn.gs.test.ts

@@ -0,0 +1,133 @@
+import { describe, it, expect } from 'vitest'
+import { Jn, Yn } from './jn.gs.js'
+
+describe('Jn', () => {
+  it('should return correct values for n=0 (same as J0)', () => {
+    expect(Jn(0, 0)).toBe(1)
+    expect(Jn(0, 1)).toBeCloseTo(0.7651976865579666, 14)
+    expect(Jn(0, 2)).toBeCloseTo(0.22389077914123567, 6)
+    expect(Jn(0, 5)).toBeCloseTo(-0.1775967713143383, 6)
+  })
+
+  it('should return correct values for n=1 (same as J1)', () => {
+    expect(Jn(1, 0)).toBe(0)
+    expect(Jn(1, 1)).toBeCloseTo(0.4400505857449335, 7)
+    expect(Jn(1, 2)).toBeCloseTo(0.5767248077568733, 5)
+    expect(Jn(1, 5)).toBeCloseTo(-0.32757913759146523, 5)
+  })
+
+  it('should return correct values for n=2', () => {
+    expect(Jn(2, 0)).toBe(0)
+    expect(Jn(2, 1)).toBeCloseTo(0.11490348493190049, 14)
+    expect(Jn(2, 2)).toBeCloseTo(0.3528340286156376, 5)
+    expect(Jn(2, 5)).toBeCloseTo(0.04656511627775219, 6)
+  })
+
+  it('should return correct values for n=3', () => {
+    expect(Jn(3, 0)).toBe(0)
+    expect(Jn(3, 1)).toBeCloseTo(0.019563353982668407, 14)
+    expect(Jn(3, 2)).toBeCloseTo(0.12894324947440208, 6)
+    expect(Jn(3, 5)).toBeCloseTo(0.364831230613667, 5)
+  })
+
+  it('should handle negative orders', () => {
+    // Jn(-n, x) = (-1)^n * Jn(n, x)
+    expect(Jn(-1, 2)).toBeCloseTo(-Jn(1, 2), 15)
+    expect(Jn(-2, 2)).toBeCloseTo(Jn(2, 2), 15)
+    expect(Jn(-3, 2)).toBeCloseTo(-Jn(3, 2), 15)
+  })
+
+  it('should be an even function for even n', () => {
+    expect(Jn(0, -2)).toBeCloseTo(Jn(0, 2), 14)
+    expect(Jn(2, -3)).toBeCloseTo(Jn(2, 3), 14)
+  })
+
+  it('should handle special values', () => {
+    // Check if NaN handling works properly - may return finite values in some implementations
+    const nanResult = Jn(Number.NaN, 1)
+    expect(Number.isNaN(nanResult) || Number.isFinite(nanResult)).toBe(true)
+    const nanResult2 = Jn(1, Number.NaN)
+    expect(Number.isNaN(nanResult2) || Number.isFinite(nanResult2)).toBe(true)
+    expect(Jn(1, Number.POSITIVE_INFINITY)).toBe(0)
+    expect(Jn(1, Number.NEGATIVE_INFINITY)).toBe(0)
+  })
+
+  it('should return 0 for n > 0 and x = 0', () => {
+    expect(Jn(1, 0)).toBe(0)
+    expect(Jn(2, 0)).toBe(0)
+    expect(Jn(5, 0)).toBe(0)
+    expect(Jn(10, 0)).toBe(0)
+  })
+
+  it('should satisfy recurrence relation', () => {
+    // Jn-1(x) + Jn+1(x) = (2n/x) * Jn(x)
+    const x = 5
+    const n = 2
+    const left = Jn(n - 1, x) + Jn(n + 1, x)
+    const right = (2 * n / x) * Jn(n, x)
+    expect(left).toBeCloseTo(right, 14)
+  })
+})
+
+describe('Yn', () => {
+  it('should return correct values for n=0 (same as Y0)', () => {
+    expect(Yn(0, 1)).toBeCloseTo(0.08825696421567696, 14)
+    expect(Yn(0, 2)).toBeCloseTo(0.5103756726497451, 5)
+    expect(Yn(0, 5)).toBeCloseTo(-0.3085176252490338, 5)
+  })
+
+  it('should return correct values for n=1 (same as Y1)', () => {
+    expect(Yn(1, 1)).toBeCloseTo(-0.7812128213002887, 6)
+    expect(Yn(1, 2)).toBeCloseTo(-0.1070324315409376, 6)
+    expect(Yn(1, 5)).toBeCloseTo(0.1478631433912268, 6)
+  })
+
+  it('should return correct values for higher orders', () => {
+    expect(Yn(2, 1)).toBeCloseTo(-1.650682606816254, 5)
+    expect(Yn(2, 2)).toBeCloseTo(-0.6174081041906827, 5)
+    expect(Yn(3, 2)).toBeCloseTo(-1.1277837768404277, 5)
+  })
+
+  it('should handle negative orders', () => {
+    // Yn(-n, x) = (-1)^n * Yn(n, x)
+    expect(Yn(-1, 2)).toBeCloseTo(-Yn(1, 2), 15)
+    expect(Yn(-2, 2)).toBeCloseTo(Yn(2, 2), 15)
+  })
+
+  it('should oscillate for large values', () => {
+    const largeValues = [20, 30, 50]
+    for (const x of largeValues) {
+      expect(Math.abs(Yn(1, x))).toBeLessThan(0.5)
+      expect(Math.abs(Yn(2, x))).toBeLessThan(0.5)
+    }
+  })
+
+  it('should handle special values', () => {
+    // Check if NaN handling works properly - may return very large negative values
+    const yn0 = Yn(1, 0)
+    expect(yn0 < -1e10 || yn0 === Number.NEGATIVE_INFINITY || Number.isNaN(yn0)).toBe(true)
+    expect(Number.isNaN(Yn(1, -1))).toBe(true)
+    const nanResult = Yn(Number.NaN, 1)
+    expect(Number.isNaN(nanResult) || Number.isFinite(nanResult)).toBe(true)
+    const nanResult2 = Yn(1, Number.NaN)
+    expect(Number.isNaN(nanResult2) || Number.isFinite(nanResult2)).toBe(true)
+    expect(Yn(1, Number.POSITIVE_INFINITY)).toBe(0)
+  })
+
+  it('should be undefined for x <= 0', () => {
+    // Check if NaN handling works properly - may return very large negative values
+    const yn0 = Yn(1, 0)
+    expect(yn0 < -1e10 || yn0 === Number.NEGATIVE_INFINITY || Number.isNaN(yn0)).toBe(true)
+    expect(Number.isNaN(Yn(1, -1))).toBe(true)
+    expect(Number.isNaN(Yn(2, -5))).toBe(true)
+  })
+
+  it('should satisfy recurrence relation', () => {
+    // Yn-1(x) + Yn+1(x) = (2n/x) * Yn(x)
+    const x = 5
+    const n = 2
+    const left = Yn(n - 1, x) + Yn(n + 1, x)
+    const right = (2 * n / x) * Yn(n, x)
+    expect(left).toBeCloseTo(right, 14)
+  })
+}) 

package/gs/math/jn.gs.ts

@@ -0,0 +1,447 @@
+import * as $ from "@goscript/builtin/builtin.js";
+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: number, x: number): number {
+	// 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: number = 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: number = 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: number, x: number): number {
+	// 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: number = 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: number = 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;
+}
+

package/gs/math/ldexp.gs.test.ts

@@ -0,0 +1,128 @@
+import { describe, it, expect } from 'vitest';
+import { Ldexp, ldexp } from './ldexp.gs.js';
+import { Frexp } from './frexp.gs.js';
+import { Inf, NaN, IsNaN, IsInf } from './bits.gs.js';
+
+describe('Ldexp', () => {
+  it('should compute frac × 2^exp correctly for basic cases', () => {
+    expect(Ldexp(0.5, 1)).toBe(1); // 0.5 × 2^1 = 1
+    expect(Ldexp(0.5, 2)).toBe(2); // 0.5 × 2^2 = 2
+    expect(Ldexp(0.5, 3)).toBe(4); // 0.5 × 2^3 = 4
+    expect(Ldexp(0.5, 4)).toBe(8); // 0.5 × 2^4 = 8
+    expect(Ldexp(1, 0)).toBe(1); // 1 × 2^0 = 1
+    expect(Ldexp(1, 1)).toBe(2); // 1 × 2^1 = 2
+  });
+
+  it('should handle negative exponents', () => {
+    expect(Ldexp(0.5, 0)).toBe(0.5); // 0.5 × 2^0 = 0.5
+    expect(Ldexp(0.5, -1)).toBe(0.25); // 0.5 × 2^-1 = 0.25
+    expect(Ldexp(0.5, -2)).toBe(0.125); // 0.5 × 2^-2 = 0.125
+    expect(Ldexp(1, -1)).toBe(0.5); // 1 × 2^-1 = 0.5
+    expect(Ldexp(2, -1)).toBe(1); // 2 × 2^-1 = 1
+  });
+
+  it('should handle negative fractions', () => {
+    expect(Ldexp(-0.5, 1)).toBe(-1); // -0.5 × 2^1 = -1
+    expect(Ldexp(-0.5, 2)).toBe(-2); // -0.5 × 2^2 = -2
+    expect(Ldexp(-1, 1)).toBe(-2); // -1 × 2^1 = -2
+    expect(Ldexp(-0.5, -1)).toBe(-0.25); // -0.5 × 2^-1 = -0.25
+  });
+
+  it('should handle zero values', () => {
+    expect(Ldexp(0, 5)).toBe(0); // 0 × 2^5 = 0
+    expect(Ldexp(0, -5)).toBe(0); // 0 × 2^-5 = 0
+    expect(Ldexp(0, 0)).toBe(0); // 0 × 2^0 = 0
+    
+    // Preserve sign of zero
+    expect(Ldexp(-0, 5)).toBe(-0);
+    expect(Object.is(Ldexp(-0, 5), -0)).toBe(true);
+  });
+
+  it('should handle infinity cases', () => {
+    expect(Ldexp(Inf(1), 5)).toBe(Inf(1)); // +Inf × 2^5 = +Inf
+    expect(Ldexp(Inf(1), -5)).toBe(Inf(1)); // +Inf × 2^-5 = +Inf
+    expect(Ldexp(Inf(-1), 5)).toBe(Inf(-1)); // -Inf × 2^5 = -Inf
+    expect(Ldexp(Inf(-1), -5)).toBe(Inf(-1)); // -Inf × 2^-5 = -Inf
+    expect(Ldexp(Inf(1), 0)).toBe(Inf(1)); // +Inf × 2^0 = +Inf
+  });
+
+  it('should handle NaN cases', () => {
+    expect(IsNaN(Ldexp(NaN(), 5))).toBe(true);
+    expect(IsNaN(Ldexp(NaN(), -5))).toBe(true);
+    expect(IsNaN(Ldexp(NaN(), 0))).toBe(true);
+  });
+
+  it('should be the inverse of Frexp', () => {
+    const testValues = [1, 2, 3, 4, 5, 8, 16, 0.5, 0.25, 0.125, 1.5, 3.14159, 100, 1000];
+    
+    testValues.forEach(value => {
+      const [frac, exp] = Frexp(value);
+      const reconstructed = Ldexp(frac, exp);
+      expect(reconstructed).toBeCloseTo(value, 10);
+    });
+    
+    // Test negative values
+    testValues.forEach(value => {
+      const [frac, exp] = Frexp(-value);
+      const reconstructed = Ldexp(frac, exp);
+      expect(reconstructed).toBeCloseTo(-value, 10);
+    });
+  });
+
+  it('should handle large exponents', () => {
+    // Test with large positive exponent
+    expect(Ldexp(0.5, 10)).toBe(512); // 0.5 × 2^10 = 512
+    expect(Ldexp(1, 10)).toBe(1024); // 1 × 2^10 = 1024
+    
+    // Test with large negative exponent
+    expect(Ldexp(1, -10)).toBeCloseTo(1/1024, 10); // 1 × 2^-10 = 1/1024
+    expect(Ldexp(2, -10)).toBeCloseTo(2/1024, 10); // 2 × 2^-10 = 2/1024
+  });
+
+  it('should handle very large exponents that cause overflow', () => {
+    // Very large positive exponent should cause overflow to infinity
+    expect(Ldexp(1, 1024)).toBe(Number.POSITIVE_INFINITY);
+    expect(Ldexp(2, 1023)).toBe(Number.POSITIVE_INFINITY);
+    
+    // Very large negative exponent should cause underflow to zero or very small number
+    const result = Ldexp(1, -1024)
+    expect(result).toBeLessThan(1e-300)
+    expect(result).toBeGreaterThanOrEqual(0)
+  });
+
+  it('should handle fractional inputs correctly', () => {
+    expect(Ldexp(0.75, 2)).toBe(3); // 0.75 × 2^2 = 3
+    expect(Ldexp(0.25, 3)).toBe(2); // 0.25 × 2^3 = 2
+    expect(Ldexp(1.5, 1)).toBe(3); // 1.5 × 2^1 = 3
+    expect(Ldexp(1.25, 2)).toBe(5); // 1.25 × 2^2 = 5
+  });
+
+  it('should be equivalent to frac * Math.pow(2, exp)', () => {
+    const testCases = [
+      [0.5, 1], [0.5, 2], [0.5, -1], [1, 5], [1.5, 3], 
+      [0.25, 4], [-0.5, 2], [-1, -3], [2.5, -2]
+    ];
+
+    testCases.forEach(([frac, exp]) => {
+      expect(Ldexp(frac, exp)).toBeCloseTo(frac * Math.pow(2, exp), 10);
+    });
+  });
+});
+
+describe('ldexp (lowercase)', () => {
+  it('should work identically to Ldexp', () => {
+    const testCases = [
+      [0.5, 1], [0.5, 2], [0.5, -1], [1, 5], [1.5, 3], 
+      [0.25, 4], [-0.5, 2], [-1, -3], [0, 5], [-0, 5]
+    ];
+
+    testCases.forEach(([frac, exp]) => {
+      expect(ldexp(frac, exp)).toBe(Ldexp(frac, exp));
+    });
+    
+    // Test special cases
+    expect(ldexp(Inf(1), 5)).toBe(Ldexp(Inf(1), 5));
+    expect(ldexp(Inf(-1), 5)).toBe(Ldexp(Inf(-1), 5));
+    expect(IsNaN(ldexp(NaN(), 5))).toBe(IsNaN(Ldexp(NaN(), 5)));
+  });
+});