mirror of
https://github.com/LadybirdBrowser/ladybird.git
synced 2025-08-09 09:39:39 +00:00
Everywhere: Hoist the Libraries folder to the top-level
This commit is contained in:
parent
950e819ee7
commit
93712b24bf
Notes:
github-actions[bot]
2024-11-10 11:51:52 +00:00
Author: https://github.com/trflynn89
Commit: 93712b24bf
Pull-request: https://github.com/LadybirdBrowser/ladybird/pull/2256
Reviewed-by: https://github.com/sideshowbarker
4547 changed files with 104 additions and 113 deletions
219
Libraries/LibJS/Tests/builtins/BigInt/bigint-basic.js
Normal file
219
Libraries/LibJS/Tests/builtins/BigInt/bigint-basic.js
Normal file
|
@ -0,0 +1,219 @@
|
|||
describe("correct behavior", () => {
|
||||
test("typeof bigint", () => {
|
||||
expect(typeof 1n).toBe("bigint");
|
||||
});
|
||||
|
||||
test("bigint string coercion", () => {
|
||||
expect("" + 123n).toBe("123");
|
||||
});
|
||||
|
||||
test("hex literals", () => {
|
||||
expect(0xffn).toBe(255n);
|
||||
});
|
||||
|
||||
test("octal literals", () => {
|
||||
expect(0o10n).toBe(8n);
|
||||
});
|
||||
|
||||
test("binary literals", () => {
|
||||
expect(0b10n).toBe(2n);
|
||||
});
|
||||
|
||||
test("arithmetic operators", () => {
|
||||
let bigint = 123n;
|
||||
expect(-bigint).toBe(-123n);
|
||||
|
||||
expect(12n + 34n).toBe(46n);
|
||||
expect(12n - 34n).toBe(-22n);
|
||||
expect(8n * 12n).toBe(96n);
|
||||
expect(123n / 10n).toBe(12n);
|
||||
expect(2n ** 3n).toBe(8n);
|
||||
expect(5n % 3n).toBe(2n);
|
||||
expect(
|
||||
45977665298704210987n +
|
||||
(714320987142450987412098743217984576n / 4598741987421098765327980n) * 987498743n
|
||||
).toBe(199365500239020623962n);
|
||||
});
|
||||
|
||||
test("bitwise operators", () => {
|
||||
expect(12n & 5n).toBe(4n);
|
||||
expect(3n & -2n).toBe(2n);
|
||||
expect(-3n & -2n).toBe(-4n);
|
||||
expect(-3n & 2n).toBe(0n);
|
||||
expect(0xffff_ffffn & -1n).toBe(0xffff_ffffn);
|
||||
|
||||
expect(1n | 2n).toBe(3n);
|
||||
expect(0n | -1n).toBe(-1n);
|
||||
expect(0n | -2n).toBe(-2n);
|
||||
|
||||
expect(5n ^ 3n).toBe(6n);
|
||||
|
||||
expect(~1n).toBe(-2n);
|
||||
expect(~-1n).toBe(0n);
|
||||
|
||||
expect(5n << 2n).toBe(20n);
|
||||
expect(7n >> 1n).toBe(3n);
|
||||
});
|
||||
|
||||
test("increment operators", () => {
|
||||
let bigint = 1n;
|
||||
expect(bigint++).toBe(1n);
|
||||
expect(bigint).toBe(2n);
|
||||
expect(bigint--).toBe(2n);
|
||||
expect(bigint).toBe(1n);
|
||||
expect(++bigint).toBe(2n);
|
||||
expect(bigint).toBe(2n);
|
||||
expect(--bigint).toBe(1n);
|
||||
expect(bigint).toBe(1n);
|
||||
});
|
||||
|
||||
test("weak equality operators", () => {
|
||||
expect(1n == 1n).toBeTrue();
|
||||
expect(1n == 1).toBeTrue();
|
||||
expect(1 == 1n).toBeTrue();
|
||||
expect(1n == 1.23).toBeFalse();
|
||||
expect(1.23 == 1n).toBeFalse();
|
||||
|
||||
expect(1n != 1n).toBeFalse();
|
||||
expect(1n != 1).toBeFalse();
|
||||
expect(1 != 1n).toBeFalse();
|
||||
expect(1n != 1.23).toBeTrue();
|
||||
expect(1.23 != 1n).toBeTrue();
|
||||
|
||||
const a = 552141064586571465517761649840658n;
|
||||
const b = 704179908449526267977309288010258n;
|
||||
expect(a == a).toBeTrue();
|
||||
expect(a == b).toBeFalse();
|
||||
|
||||
expect(0n == Object(0n)).toBeTrue();
|
||||
expect(Object(0n) == 0n).toBeTrue();
|
||||
expect(0n != Object(0n)).toBeFalse();
|
||||
expect(Object(0n) != 0n).toBeFalse();
|
||||
|
||||
expect(1n == Object(1n)).toBeTrue();
|
||||
expect(Object(1n) == 1n).toBeTrue();
|
||||
expect(1n != Object(1n)).toBeFalse();
|
||||
expect(Object(1n) != 1n).toBeFalse();
|
||||
|
||||
expect(1n == Object(2n)).toBeFalse();
|
||||
expect(Object(2n) == 1n).toBeFalse();
|
||||
expect(1n != Object(2n)).toBeTrue();
|
||||
expect(Object(2n) != 1n).toBeTrue();
|
||||
|
||||
expect(2n == "2").toBeTrue();
|
||||
expect(2n == "0b10").toBeTrue();
|
||||
expect(2n == "0o2").toBeTrue();
|
||||
expect(2n == "0x2").toBeTrue();
|
||||
|
||||
expect(1n == "2").toBeFalse();
|
||||
expect(1n == "0b10").toBeFalse();
|
||||
expect(1n == "0o2").toBeFalse();
|
||||
expect(1n == "0x2").toBeFalse();
|
||||
});
|
||||
|
||||
test("strong equality operators", () => {
|
||||
expect(1n === 1n).toBeTrue();
|
||||
expect(1n === 1).toBeFalse();
|
||||
expect(1 === 1n).toBeFalse();
|
||||
expect(1n === 1.23).toBeFalse();
|
||||
expect(1.23 === 1n).toBeFalse();
|
||||
|
||||
expect(1n !== 1n).toBeFalse();
|
||||
expect(1n !== 1).toBeTrue();
|
||||
expect(1 !== 1n).toBeTrue();
|
||||
expect(1n !== 1.23).toBeTrue();
|
||||
expect(1.23 !== 1n).toBeTrue();
|
||||
|
||||
const a = 552141064586571465517761649840658n;
|
||||
const b = 704179908449526267977309288010258n;
|
||||
expect(a === a).toBeTrue();
|
||||
expect(a === b).toBeFalse();
|
||||
});
|
||||
|
||||
test("less-than operators", () => {
|
||||
expect(1n < 1n).toBeFalse();
|
||||
expect(1n < 1).toBeFalse();
|
||||
expect(1 < 1n).toBeFalse();
|
||||
expect(1n < 2n).toBeTrue();
|
||||
expect(1n < 2).toBeTrue();
|
||||
expect(1 < 2n).toBeTrue();
|
||||
expect(1n < 1.23).toBeTrue();
|
||||
expect(1.23 < 1n).toBeFalse();
|
||||
|
||||
expect(1n <= 1n).toBeTrue();
|
||||
expect(1n <= 1).toBeTrue();
|
||||
expect(1 <= 1n).toBeTrue();
|
||||
expect(1n <= 2n).toBeTrue();
|
||||
expect(1n <= 2).toBeTrue();
|
||||
expect(1 <= 2n).toBeTrue();
|
||||
expect(1n <= 1.23).toBeTrue();
|
||||
expect(1.23 <= 1n).toBeFalse();
|
||||
|
||||
expect(1n < "1").toBeFalse();
|
||||
expect(1n < "2").toBeTrue();
|
||||
expect(1n < "1.23").toBeFalse();
|
||||
|
||||
expect(1n <= "1").toBeTrue();
|
||||
expect(1n <= "2").toBeTrue();
|
||||
expect(1n <= "1.23").toBeFalse();
|
||||
|
||||
expect(1n < "0b1").toBeFalse();
|
||||
expect(1n < "0B10").toBeTrue();
|
||||
expect(1n < "0o1").toBeFalse();
|
||||
expect(1n < "0O2").toBeTrue();
|
||||
expect(1n < "0x1").toBeFalse();
|
||||
expect(1n < "0X2").toBeTrue();
|
||||
|
||||
expect(1n <= "0b1").toBeTrue();
|
||||
expect(1n <= "0B10").toBeTrue();
|
||||
expect(1n <= "0o1").toBeTrue();
|
||||
expect(1n <= "0O2").toBeTrue();
|
||||
expect(1n <= "0x1").toBeTrue();
|
||||
expect(1n <= "0X2").toBeTrue();
|
||||
|
||||
expect("1" < 1n).toBeFalse();
|
||||
expect("1" < 2n).toBeTrue();
|
||||
expect("1.23" < 1n).toBeFalse();
|
||||
|
||||
expect("1" <= 1n).toBeTrue();
|
||||
expect("1" <= 2n).toBeTrue();
|
||||
expect("1.23" <= 1n).toBeFalse();
|
||||
|
||||
expect("0b1" < 1n).toBeFalse();
|
||||
expect("0B1" < 2n).toBeTrue();
|
||||
expect("0o1" < 1n).toBeFalse();
|
||||
expect("0O1" < 2n).toBeTrue();
|
||||
expect("0x1" < 1n).toBeFalse();
|
||||
expect("0X1" < 2n).toBeTrue();
|
||||
|
||||
expect("0b1" <= 1n).toBeTrue();
|
||||
expect("0B10" <= 2n).toBeTrue();
|
||||
expect("0o1" <= 1n).toBeTrue();
|
||||
expect("0O2" <= 2n).toBeTrue();
|
||||
expect("0x1" <= 1n).toBeTrue();
|
||||
expect("0X2" <= 2n).toBeTrue();
|
||||
});
|
||||
});
|
||||
|
||||
describe("errors", () => {
|
||||
test("conversion to number", () => {
|
||||
expect(() => {
|
||||
+123n;
|
||||
}).toThrowWithMessage(TypeError, "Cannot convert BigInt to number");
|
||||
});
|
||||
|
||||
test("division by zero", () => {
|
||||
expect(() => {
|
||||
1n / 0n;
|
||||
}).toThrowWithMessage(RangeError, "Division by zero");
|
||||
expect(() => {
|
||||
1n % 0n;
|
||||
}).toThrowWithMessage(RangeError, "Division by zero");
|
||||
});
|
||||
|
||||
test("negative exponent", () => {
|
||||
expect(() => {
|
||||
1n ** -1n;
|
||||
}).toThrowWithMessage(RangeError, "Exponent must be positive");
|
||||
});
|
||||
});
|
Loading…
Add table
Add a link
Reference in a new issue