Commit 085bde6889925b486291ddf1450b6bb6c8562a8f | zig

author	Andrew Kelley <andrew@ziglang.org> 2024-02-26 23:43:02-08:00
committer	GitHub <noreply@github.com> 2024-02-26 23:43:02-08:00
log	085bde6889925b486291ddf1450b6bb6c8562a8f
tree	02f7a49b4378dc2387b825bfc19825405f4502ca
parent	4e2570baafb587c679ee0fc5e113ddeb36522a5d
parent	726a1149e05669e5cc05a16ce877bbb2be787e39
signature	Signed by PGP key B5690EEEBB952194

Merge pull request #19087 from squeek502/redundant-test-naming

Remove redundant test name prefixes now that test names are fully qualified

116 files changed, 783 insertions(+), 782 deletions(-)

lib
- std

lib/std/Random/Isaac64.zig+2-2

...	@@ -173,7 +173,7 @@ pub fn fill(self: *Isaac64, buf: []u8) void {	...	@@ -173,7 +173,7 @@ pub fn fill(self: *Isaac64, buf: []u8) void {
173	}	173	}
174	}	174	}
175		175
176	test "isaac64 sequence" {	176	test "sequence" {
177	var r = Isaac64.init(0);	177	var r = Isaac64.init(0);
178		178
179	// from reference implementation	179	// from reference implementation
...	@@ -201,7 +201,7 @@ test "isaac64 sequence" {	...	@@ -201,7 +201,7 @@ test "isaac64 sequence" {
201	}	201	}
202	}	202	}
203		203
204	test "isaac64 fill" {	204	test fill {
205	var r = Isaac64.init(0);	205	var r = Isaac64.init(0);
206		206
207	// from reference implementation	207	// from reference implementation

lib/std/Random/Pcg.zig+2-2

...	@@ -72,7 +72,7 @@ pub fn fill(self: *Pcg, buf: []u8) void {	...	@@ -72,7 +72,7 @@ pub fn fill(self: *Pcg, buf: []u8) void {
72	}	72	}
73	}	73	}
74		74
75	test "pcg sequence" {	75	test "sequence" {
76	var r = Pcg.init(0);	76	var r = Pcg.init(0);
77	const s0: u64 = 0x9394bf54ce5d79de;	77	const s0: u64 = 0x9394bf54ce5d79de;
78	const s1: u64 = 0x84e9c579ef59bbf7;	78	const s1: u64 = 0x84e9c579ef59bbf7;
...	@@ -92,7 +92,7 @@ test "pcg sequence" {	...	@@ -92,7 +92,7 @@ test "pcg sequence" {
92	}	92	}
93	}	93	}
94		94
95	test "pcg fill" {	95	test fill {
96	var r = Pcg.init(0);	96	var r = Pcg.init(0);
97	const s0: u64 = 0x9394bf54ce5d79de;	97	const s0: u64 = 0x9394bf54ce5d79de;
98	const s1: u64 = 0x84e9c579ef59bbf7;	98	const s1: u64 = 0x84e9c579ef59bbf7;

lib/std/Random/RomuTrio.zig+3-3

...	@@ -72,7 +72,7 @@ pub fn fill(self: *RomuTrio, buf: []u8) void {	...	@@ -72,7 +72,7 @@ pub fn fill(self: *RomuTrio, buf: []u8) void {
72	}	72	}
73	}	73	}
74		74
75	test "RomuTrio sequence" {	75	test "sequence" {
76	// Unfortunately there does not seem to be an official test sequence.	76	// Unfortunately there does not seem to be an official test sequence.
77	var r = RomuTrio.init(0);	77	var r = RomuTrio.init(0);
78		78
...	@@ -94,7 +94,7 @@ test "RomuTrio sequence" {	...	@@ -94,7 +94,7 @@ test "RomuTrio sequence" {
94	}	94	}
95	}	95	}
96		96
97	test "RomuTrio fill" {	97	test fill {
98	// Unfortunately there does not seem to be an official test sequence.	98	// Unfortunately there does not seem to be an official test sequence.
99	var r = RomuTrio.init(0);	99	var r = RomuTrio.init(0);
100		100
...	@@ -120,7 +120,7 @@ test "RomuTrio fill" {	...	@@ -120,7 +120,7 @@ test "RomuTrio fill" {
120	}	120	}
121	}	121	}
122		122
123	test "RomuTrio buf seeding test" {	123	test "buf seeding test" {
124	const buf0 = @as([24]u8, @bitCast([3]u64{ 16294208416658607535, 13964609475759908645, 4703697494102998476 }));	124	const buf0 = @as([24]u8, @bitCast([3]u64{ 16294208416658607535, 13964609475759908645, 4703697494102998476 }));
125	const resulting_state = .{ .x = 16294208416658607535, .y = 13964609475759908645, .z = 4703697494102998476 };	125	const resulting_state = .{ .x = 16294208416658607535, .y = 13964609475759908645, .z = 4703697494102998476 };
126	var r = RomuTrio.init(0);	126	var r = RomuTrio.init(0);

lib/std/Random/Sfc64.zig+2-2

...	@@ -70,7 +70,7 @@ pub fn fill(self: *Sfc64, buf: []u8) void {	...	@@ -70,7 +70,7 @@ pub fn fill(self: *Sfc64, buf: []u8) void {
70	}	70	}
71	}	71	}
72		72
73	test "Sfc64 sequence" {	73	test "sequence" {
74	// Unfortunately there does not seem to be an official test sequence.	74	// Unfortunately there does not seem to be an official test sequence.
75	var r = Sfc64.init(0);	75	var r = Sfc64.init(0);
76		76
...	@@ -98,7 +98,7 @@ test "Sfc64 sequence" {	...	@@ -98,7 +98,7 @@ test "Sfc64 sequence" {
98	}	98	}
99	}	99	}
100		100
101	test "Sfc64 fill" {	101	test fill {
102	// Unfortunately there does not seem to be an official test sequence.	102	// Unfortunately there does not seem to be an official test sequence.
103	var r = Sfc64.init(0);	103	var r = Sfc64.init(0);
104		104

lib/std/Random/Xoroshiro128.zig+2-2

...	@@ -88,7 +88,7 @@ pub fn fill(self: *Xoroshiro128, buf: []u8) void {	...	@@ -88,7 +88,7 @@ pub fn fill(self: *Xoroshiro128, buf: []u8) void {
88	}	88	}
89	}	89	}
90		90
91	test "xoroshiro sequence" {	91	test "sequence" {
92	var r = Xoroshiro128.init(0);	92	var r = Xoroshiro128.init(0);
93	r.s[0] = 0xaeecf86f7878dd75;	93	r.s[0] = 0xaeecf86f7878dd75;
94	r.s[1] = 0x01cd153642e72622;	94	r.s[1] = 0x01cd153642e72622;
...	@@ -122,7 +122,7 @@ test "xoroshiro sequence" {	...	@@ -122,7 +122,7 @@ test "xoroshiro sequence" {
122	}	122	}
123	}	123	}
124		124
125	test "xoroshiro fill" {	125	test fill {
126	var r = Xoroshiro128.init(0);	126	var r = Xoroshiro128.init(0);
127	r.s[0] = 0xaeecf86f7878dd75;	127	r.s[0] = 0xaeecf86f7878dd75;
128	r.s[1] = 0x01cd153642e72622;	128	r.s[1] = 0x01cd153642e72622;

lib/std/Random/Xoshiro256.zig+2-2

...	@@ -88,7 +88,7 @@ pub fn fill(self: *Xoshiro256, buf: []u8) void {	...	@@ -88,7 +88,7 @@ pub fn fill(self: *Xoshiro256, buf: []u8) void {
88	}	88	}
89	}	89	}
90		90
91	test "xoroshiro sequence" {	91	test "sequence" {
92	if (@import("builtin").zig_backend == .stage2_c) return error.SkipZigTest;	92	if (@import("builtin").zig_backend == .stage2_c) return error.SkipZigTest;
93		93
94	var r = Xoshiro256.init(0);	94	var r = Xoshiro256.init(0);
...	@@ -122,7 +122,7 @@ test "xoroshiro sequence" {	...	@@ -122,7 +122,7 @@ test "xoroshiro sequence" {
122	}	122	}
123	}	123	}
124		124
125	test "xoroshiro fill" {	125	test fill {
126	var r = Xoshiro256.init(0);	126	var r = Xoshiro256.init(0);
127		127
128	const seq = [_]u64{	128	const seq = [_]u64{

lib/std/SemanticVersion.zig+2-2

...	@@ -166,7 +166,7 @@ pub fn format(	...	@@ -166,7 +166,7 @@ pub fn format(
166	const expect = std.testing.expect;	166	const expect = std.testing.expect;
167	const expectError = std.testing.expectError;	167	const expectError = std.testing.expectError;
168		168
169	test "SemanticVersion format" {	169	test format {
170	// Many of these test strings are from https://github.com/semver/semver.org/issues/59#issuecomment-390854010.	170	// Many of these test strings are from https://github.com/semver/semver.org/issues/59#issuecomment-390854010.
171		171
172	// Valid version strings should be accepted.	172	// Valid version strings should be accepted.
...	@@ -277,7 +277,7 @@ test "SemanticVersion format" {	...	@@ -277,7 +277,7 @@ test "SemanticVersion format" {
277	if (parse(big_invalid)) \|ver\| std.debug.panic("expected error, found {}", .{ver}) else \|_\| {}	277	if (parse(big_invalid)) \|ver\| std.debug.panic("expected error, found {}", .{ver}) else \|_\| {}
278	}	278	}
279		279
280	test "SemanticVersion precedence" {	280	test "precedence" {
281	// SemVer 2 spec 11.2 example: 1.0.0 < 2.0.0 < 2.1.0 < 2.1.1.	281	// SemVer 2 spec 11.2 example: 1.0.0 < 2.0.0 < 2.1.0 < 2.1.1.
282	try expect(order(try parse("1.0.0"), try parse("2.0.0")) == .lt);	282	try expect(order(try parse("1.0.0"), try parse("2.0.0")) == .lt);
283	try expect(order(try parse("2.0.0"), try parse("2.1.0")) == .lt);	283	try expect(order(try parse("2.0.0"), try parse("2.1.0")) == .lt);

lib/std/Thread.zig+2-2

...	@@ -1437,7 +1437,7 @@ fn testIncrementNotify(value: usize, event: ResetEvent) void {	...	@@ -1437,7 +1437,7 @@ fn testIncrementNotify(value: usize, event: ResetEvent) void {
1437	event.set();	1437	event.set();
1438	}	1438	}
1439		1439
1440	test "Thread.join" {	1440	test join {
1441	if (builtin.single_threaded) return error.SkipZigTest;	1441	if (builtin.single_threaded) return error.SkipZigTest;
1442		1442
1443	var value: usize = 0;	1443	var value: usize = 0;
...	@@ -1449,7 +1449,7 @@ test "Thread.join" {	...	@@ -1449,7 +1449,7 @@ test "Thread.join" {
1449	try std.testing.expectEqual(value, 1);	1449	try std.testing.expectEqual(value, 1);
1450	}	1450	}
1451		1451
1452	test "Thread.detach" {	1452	test detach {
1453	if (builtin.single_threaded) return error.SkipZigTest;	1453	if (builtin.single_threaded) return error.SkipZigTest;
1454		1454
1455	var value: usize = 0;	1455	var value: usize = 0;

lib/std/Thread/Condition.zig+6-6

...	@@ -296,7 +296,7 @@ const FutexImpl = struct {	...	@@ -296,7 +296,7 @@ const FutexImpl = struct {
296	}	296	}
297	};	297	};
298		298
299	test "Condition - smoke test" {	299	test "smoke test" {
300	var mutex = Mutex{};	300	var mutex = Mutex{};
301	var cond = Condition{};	301	var cond = Condition{};
302		302
...	@@ -317,7 +317,7 @@ test "Condition - smoke test" {	...	@@ -317,7 +317,7 @@ test "Condition - smoke test" {
317	}	317	}
318		318
319	// Inspired from: https://github.com/Amanieu/parking_lot/pull/129	319	// Inspired from: https://github.com/Amanieu/parking_lot/pull/129
320	test "Condition - wait and signal" {	320	test "wait and signal" {
321	// This test requires spawning threads	321	// This test requires spawning threads
322	if (builtin.single_threaded) {	322	if (builtin.single_threaded) {
323	return error.SkipZigTest;	323	return error.SkipZigTest;
...	@@ -362,7 +362,7 @@ test "Condition - wait and signal" {	...	@@ -362,7 +362,7 @@ test "Condition - wait and signal" {
362	}	362	}
363	}	363	}
364		364
365	test "Condition - signal" {	365	test signal {
366	// This test requires spawning threads	366	// This test requires spawning threads
367	if (builtin.single_threaded) {	367	if (builtin.single_threaded) {
368	return error.SkipZigTest;	368	return error.SkipZigTest;
...	@@ -429,7 +429,7 @@ test "Condition - signal" {	...	@@ -429,7 +429,7 @@ test "Condition - signal" {
429	}	429	}
430	}	430	}
431		431
432	test "Condition - multi signal" {	432	test "multi signal" {
433	// This test requires spawning threads	433	// This test requires spawning threads
434	if (builtin.single_threaded) {	434	if (builtin.single_threaded) {
435	return error.SkipZigTest;	435	return error.SkipZigTest;
...	@@ -491,7 +491,7 @@ test "Condition - multi signal" {	...	@@ -491,7 +491,7 @@ test "Condition - multi signal" {
491	}	491	}
492	}	492	}
493		493
494	test "Condition - broadcasting" {	494	test broadcast {
495	// This test requires spawning threads	495	// This test requires spawning threads
496	if (builtin.single_threaded) {	496	if (builtin.single_threaded) {
497	return error.SkipZigTest;	497	return error.SkipZigTest;
...	@@ -557,7 +557,7 @@ test "Condition - broadcasting" {	...	@@ -557,7 +557,7 @@ test "Condition - broadcasting" {
557	}	557	}
558	}	558	}
559		559
560	test "Condition - broadcasting - wake all threads" {	560	test "broadcasting - wake all threads" {
561	// Tests issue #12877	561	// Tests issue #12877
562	// This test requires spawning threads	562	// This test requires spawning threads
563	if (builtin.single_threaded) {	563	if (builtin.single_threaded) {

lib/std/Thread/Futex.zig+4-4

lib/std/Thread/Mutex.zig+3-3

lib/std/Thread/ResetEvent.zig+3-3

...	@@ -157,7 +157,7 @@ const FutexImpl = struct {	...	@@ -157,7 +157,7 @@ const FutexImpl = struct {
157	}	157	}
158	};	158	};
159		159
160	test "ResetEvent - smoke test" {	160	test "smoke test" {
161	// make sure the event is unset	161	// make sure the event is unset
162	var event = ResetEvent{};	162	var event = ResetEvent{};
163	try testing.expectEqual(false, event.isSet());	163	try testing.expectEqual(false, event.isSet());
...	@@ -181,7 +181,7 @@ test "ResetEvent - smoke test" {	...	@@ -181,7 +181,7 @@ test "ResetEvent - smoke test" {
181	try testing.expectEqual(true, event.isSet());	181	try testing.expectEqual(true, event.isSet());
182	}	182	}
183		183
184	test "ResetEvent - signaling" {	184	test "signaling" {
185	// This test requires spawning threads	185	// This test requires spawning threads
186	if (builtin.single_threaded) {	186	if (builtin.single_threaded) {
187	return error.SkipZigTest;	187	return error.SkipZigTest;
...	@@ -242,7 +242,7 @@ test "ResetEvent - signaling" {	...	@@ -242,7 +242,7 @@ test "ResetEvent - signaling" {
242	try ctx.input();	242	try ctx.input();
243	}	243	}
244		244
245	test "ResetEvent - broadcast" {	245	test "broadcast" {
246	// This test requires spawning threads	246	// This test requires spawning threads
247	if (builtin.single_threaded) {	247	if (builtin.single_threaded) {
248	return error.SkipZigTest;	248	return error.SkipZigTest;

lib/std/Thread/RwLock.zig+2-2

...	@@ -264,7 +264,7 @@ test "DefaultRwLock - internal state" {	...	@@ -264,7 +264,7 @@ test "DefaultRwLock - internal state" {
264	try testing.expectEqual(rwl, DefaultRwLock{});	264	try testing.expectEqual(rwl, DefaultRwLock{});
265	}	265	}
266		266
267	test "RwLock - smoke test" {	267	test "smoke test" {
268	var rwl = RwLock{};	268	var rwl = RwLock{};
269		269
270	rwl.lock();	270	rwl.lock();
...	@@ -293,7 +293,7 @@ test "RwLock - smoke test" {	...	@@ -293,7 +293,7 @@ test "RwLock - smoke test" {
293	rwl.unlock();	293	rwl.unlock();
294	}	294	}
295		295
296	test "RwLock - concurrent access" {	296	test "concurrent access" {
297	if (builtin.single_threaded)	297	if (builtin.single_threaded)
298	return;	298	return;
299		299

lib/std/Thread/Semaphore.zig+2-2

...	@@ -71,7 +71,7 @@ pub fn post(sem: *Semaphore) void {	...	@@ -71,7 +71,7 @@ pub fn post(sem: *Semaphore) void {
71	sem.cond.signal();	71	sem.cond.signal();
72	}	72	}
73		73
74	test "Thread.Semaphore" {	74	test Semaphore {
75	if (builtin.single_threaded) {	75	if (builtin.single_threaded) {
76	return error.SkipZigTest;	76	return error.SkipZigTest;
77	}	77	}
...	@@ -97,7 +97,7 @@ test "Thread.Semaphore" {	...	@@ -97,7 +97,7 @@ test "Thread.Semaphore" {
97	try testing.expect(n == num_threads);	97	try testing.expect(n == num_threads);
98	}	98	}
99		99
100	test "Thread.Semaphore - timedWait" {	100	test timedWait {
101	var sem = Semaphore{};	101	var sem = Semaphore{};
102	try testing.expectEqual(0, sem.permits);	102	try testing.expectEqual(0, sem.permits);
103		103

lib/std/array_list.zig+60-51

 @@ -1231,7 +1231,7 @@ fn addOrOom(a: usize, b: usize) error{OutOfMemory}!usize {
     return result;
 }
-test "std.ArrayList/ArrayListUnmanaged.init" {
+test "init" {
     {
         var list = ArrayList(i32).init(testing.allocator);
         defer list.deinit();
 @@ -1248,7 +1248,7 @@ test "std.ArrayList/ArrayListUnmanaged.init" {
     }
 }
-test "std.ArrayList/ArrayListUnmanaged.initCapacity" {
+test "initCapacity" {
     const a = testing.allocator;
     {
         var list = try ArrayList(i8).initCapacity(a, 200);
 @@ -1264,7 +1264,7 @@ test "std.ArrayList/ArrayListUnmanaged.initCapacity" {
     }
 }
-test "std.ArrayList/ArrayListUnmanaged.clone" {
+test "clone" {
     const a = testing.allocator;
     {
         var array = ArrayList(i32).init(a);
 @@ -1305,7 +1305,7 @@ test "std.ArrayList/ArrayListUnmanaged.clone" {
     }
 }
-test "std.ArrayList/ArrayListUnmanaged.basic" {
+test "basic" {
     const a = testing.allocator;
     {
         var list = ArrayList(i32).init(a);
 @@ -1409,7 +1409,7 @@ test "std.ArrayList/ArrayListUnmanaged.basic" {
     }
 }
-test "std.ArrayList/ArrayListUnmanaged.appendNTimes" {
+test "appendNTimes" {
     const a = testing.allocator;
     {
         var list = ArrayList(i32).init(a);
 @@ -1433,7 +1433,7 @@ test "std.ArrayList/ArrayListUnmanaged.appendNTimes" {
     }
 }
-test "std.ArrayList/ArrayListUnmanaged.appendNTimes with failing allocator" {
+test "appendNTimes with failing allocator" {
     const a = testing.failing_allocator;
     {
         var list = ArrayList(i32).init(a);
 @@ -1447,7 +1447,7 @@ test "std.ArrayList/ArrayListUnmanaged.appendNTimes with failing allocator" {
     }
 }
-test "std.ArrayList/ArrayListUnmanaged.orderedRemove" {
+test "orderedRemove" {
     const a = testing.allocator;
     {
         var list = ArrayList(i32).init(a);
 @@ -1519,7 +1519,7 @@ test "std.ArrayList/ArrayListUnmanaged.orderedRemove" {
     }
 }
-test "std.ArrayList/ArrayListUnmanaged.swapRemove" {
+test "swapRemove" {
     const a = testing.allocator;
     {
         var list = ArrayList(i32).init(a);
 @@ -1575,7 +1575,7 @@ test "std.ArrayList/ArrayListUnmanaged.swapRemove" {
     }
 }
-test "std.ArrayList/ArrayListUnmanaged.insert" {
+test "insert" {
     const a = testing.allocator;
     {
         var list = ArrayList(i32).init(a);
 @@ -1605,7 +1605,7 @@ test "std.ArrayList/ArrayListUnmanaged.insert" {
     }
 }
-test "std.ArrayList/ArrayListUnmanaged.insertSlice" {
+test "insertSlice" {
     const a = testing.allocator;
     {
         var list = ArrayList(i32).init(a);
 @@ -1651,7 +1651,7 @@ test "std.ArrayList/ArrayListUnmanaged.insertSlice" {
     }
 }
-test "std.ArrayList/ArrayListUnmanaged.replaceRange" {
+test "replaceRange" {
     var arena = std.heap.ArenaAllocator.init(testing.allocator);
     defer arena.deinit();
     const a = arena.allocator();
 @@ -1773,7 +1773,7 @@ const ItemUnmanaged = struct {
     sub_items: ArrayListUnmanaged(ItemUnmanaged),
 };
-test "std.ArrayList/ArrayListUnmanaged: ArrayList(T) of struct T" {
+test "ArrayList(T) of struct T" {
     const a = std.testing.allocator;
     {
         var root = Item{ .integer = 1, .sub_items = ArrayList(Item).init(a) };
 @@ -1789,7 +1789,7 @@ test "std.ArrayList/ArrayListUnmanaged: ArrayList(T) of struct T" {
     }
 }
-test "std.ArrayList(u8)/ArrayListAligned implements writer" {
+test "ArrayList(u8) implements writer" {
     const a = testing.allocator;
     {
 @@ -1816,7 +1816,7 @@ test "std.ArrayList(u8)/ArrayListAligned implements writer" {
     }
 }
-test "std.ArrayListUnmanaged(u8) implements writer" {
+test "ArrayListUnmanaged(u8) implements writer" {
     const a = testing.allocator;
     {
 @@ -1883,7 +1883,7 @@ test "shrinkAndFree with a copy" {
     try testing.expect(mem.eql(i32, list.items, &.{ 3, 3, 3, 3 }));
 }
-test "std.ArrayList/ArrayListUnmanaged.addManyAsArray" {
+test "addManyAsArray" {
     const a = std.testing.allocator;
     {
         var list = ArrayList(u8).init(a);
 @@ -1907,7 +1907,7 @@ test "std.ArrayList/ArrayListUnmanaged.addManyAsArray" {
     }
 }
-test "std.ArrayList/ArrayListUnmanaged growing memory preserves contents" {
+test "growing memory preserves contents" {
     // Shrink the list after every insertion to ensure that a memory growth
     // will be triggered in the next operation.
     const a = std.testing.allocator;
 @@ -1941,46 +1941,55 @@ test "std.ArrayList/ArrayListUnmanaged growing memory preserves contents" {
     }
 }
-test "std.ArrayList/ArrayList.fromOwnedSliceSentinel" {
+test "fromOwnedSlice" {
-    const a = testing.allocator;
-    var orig_list = ArrayList(u8).init(a);
-    defer orig_list.deinit();
-    try orig_list.appendSlice("foobar");
-    const sentinel_slice = try orig_list.toOwnedSliceSentinel(0);
-    var list = ArrayList(u8).fromOwnedSliceSentinel(a, 0, sentinel_slice);
-    defer list.deinit();
-    try testing.expectEqualStrings(list.items, "foobar");
-}
-test "std.ArrayList/ArrayListUnmanaged.fromOwnedSlice" {
     const a = testing.allocator;
+    {
+        var orig_list = ArrayList(u8).init(a);
+        defer orig_list.deinit();
+        try orig_list.appendSlice("foobar");
-    var list = ArrayList(u8).init(a);
+        const slice = try orig_list.toOwnedSlice();
-    defer list.deinit();
+        var list = ArrayList(u8).fromOwnedSlice(a, slice);
-    try list.appendSlice("foobar");
+        defer list.deinit();
+        try testing.expectEqualStrings(list.items, "foobar");
+    }
+    {
+        var list = ArrayList(u8).init(a);
+        defer list.deinit();
+        try list.appendSlice("foobar");
-    const slice = try list.toOwnedSlice();
+        const slice = try list.toOwnedSlice();
-    var unmanaged = ArrayListUnmanaged(u8).fromOwnedSlice(slice);
+        var unmanaged = ArrayListUnmanaged(u8).fromOwnedSlice(slice);
-    defer unmanaged.deinit(a);
+        defer unmanaged.deinit(a);
-    try testing.expectEqualStrings(unmanaged.items, "foobar");
+        try testing.expectEqualStrings(unmanaged.items, "foobar");
+    }
 }
-test "std.ArrayList/ArrayListUnmanaged.fromOwnedSliceSentinel" {
+test "fromOwnedSliceSentinel" {
     const a = testing.allocator;
+    {
+        var orig_list = ArrayList(u8).init(a);
+        defer orig_list.deinit();
+        try orig_list.appendSlice("foobar");
-    var list = ArrayList(u8).init(a);
+        const sentinel_slice = try orig_list.toOwnedSliceSentinel(0);
-    defer list.deinit();
+        var list = ArrayList(u8).fromOwnedSliceSentinel(a, 0, sentinel_slice);
-    try list.appendSlice("foobar");
+        defer list.deinit();
+        try testing.expectEqualStrings(list.items, "foobar");
+    }
+    {
+        var list = ArrayList(u8).init(a);
+        defer list.deinit();
+        try list.appendSlice("foobar");
-    const sentinel_slice = try list.toOwnedSliceSentinel(0);
+        const sentinel_slice = try list.toOwnedSliceSentinel(0);
-    var unmanaged = ArrayListUnmanaged(u8).fromOwnedSliceSentinel(0, sentinel_slice);
+        var unmanaged = ArrayListUnmanaged(u8).fromOwnedSliceSentinel(0, sentinel_slice);
-    defer unmanaged.deinit(a);
+        defer unmanaged.deinit(a);
-    try testing.expectEqualStrings(unmanaged.items, "foobar");
+        try testing.expectEqualStrings(unmanaged.items, "foobar");
+    }
 }
-test "std.ArrayList/ArrayListUnmanaged.toOwnedSliceSentinel" {
+test "toOwnedSliceSentinel" {
     const a = testing.allocator;
     {
         var list = ArrayList(u8).init(a);
 @@ -2004,7 +2013,7 @@ test "std.ArrayList/ArrayListUnmanaged.toOwnedSliceSentinel" {
     }
 }
-test "ArrayListAligned/ArrayListAlignedUnmanaged accepts unaligned slices" {
+test "accepts unaligned slices" {
     const a = testing.allocator;
     {
         var list = std.ArrayListAligned(u8, 8).init(a);
 @@ -2028,7 +2037,7 @@ test "ArrayListAligned/ArrayListAlignedUnmanaged accepts unaligned slices" {
     }
 }
-test "std.ArrayList(u0)" {
+test "ArrayList(u0)" {
     // An ArrayList on zero-sized types should not need to allocate
     const a = testing.failing_allocator;
 @@ -2048,7 +2057,7 @@ test "std.ArrayList(u0)" {
     try testing.expectEqual(count, 3);
 }
-test "std.ArrayList(?u32).popOrNull()" {
+test "ArrayList(?u32).popOrNull()" {
     const a = testing.allocator;
     var list = ArrayList(?u32).init(a);
 @@ -2065,7 +2074,7 @@ test "std.ArrayList(?u32).popOrNull()" {
     try testing.expect(list.popOrNull() == null);
 }
-test "std.ArrayList(u32).getLast()" {
+test "ArrayList(u32).getLast()" {
     const a = testing.allocator;
     var list = ArrayList(u32).init(a);
 @@ -2076,7 +2085,7 @@ test "std.ArrayList(u32).getLast()" {
     try testing.expectEqual(const_list.getLast(), 2);
 }
-test "std.ArrayList(u32).getLastOrNull()" {
+test "ArrayList(u32).getLastOrNull()" {
     const a = testing.allocator;
     var list = ArrayList(u32).init(a);

lib/std/buf_set.zig+19-19

 @@ -90,6 +90,23 @@ pub const BufSet = struct {
         return self.cloneWithAllocator(self.allocator());
     }
+    test clone {
+        var original = BufSet.init(testing.allocator);
+        defer original.deinit();
+        try original.insert("x");
+        var cloned = try original.clone();
+        defer cloned.deinit();
+        cloned.remove("x");
+        try testing.expect(original.count() == 1);
+        try testing.expect(cloned.count() == 0);
+        try testing.expectError(
+            error.OutOfMemory,
+            original.cloneWithAllocator(testing.failing_allocator),
+        );
+    }
     fn free(self: *const BufSet, value: []const u8) void {
         self.hash_map.allocator.free(value);
     }
 @@ -101,7 +118,7 @@ pub const BufSet = struct {
     }
 };
-test "BufSet" {
+test BufSet {
     var bufset = BufSet.init(std.testing.allocator);
     defer bufset.deinit();
 @@ -115,24 +132,7 @@ test "BufSet" {
     try bufset.insert("z");
 }
-test "BufSet clone" {
+test "clone with arena" {
-    var original = BufSet.init(testing.allocator);
-    defer original.deinit();
-    try original.insert("x");
-    var cloned = try original.clone();
-    defer cloned.deinit();
-    cloned.remove("x");
-    try testing.expect(original.count() == 1);
-    try testing.expect(cloned.count() == 0);
-    try testing.expectError(
-        error.OutOfMemory,
-        original.cloneWithAllocator(testing.failing_allocator),
-    );
-}
-test "BufSet.clone with arena" {
     const allocator = std.testing.allocator;
     var arena = std.heap.ArenaAllocator.init(allocator);
     defer arena.deinit();

lib/std/compress/flate.zig+5-5

...	@@ -84,7 +84,7 @@ test {	...	@@ -84,7 +84,7 @@ test {
84	_ = inflate;	84	_ = inflate;
85	}	85	}
86		86
87	test "flate compress/decompress" {	87	test "compress/decompress" {
88	if (builtin.target.cpu.arch == .wasm32) return error.SkipZigTest;	88	if (builtin.target.cpu.arch == .wasm32) return error.SkipZigTest;
89		89
90	var cmp_buf: [64 * 1024]u8 = undefined; // compressed data buffer	90	var cmp_buf: [64 * 1024]u8 = undefined; // compressed data buffer
...	@@ -252,7 +252,7 @@ fn testDecompress(comptime container: Container, compressed: []const u8, expecte	...	@@ -252,7 +252,7 @@ fn testDecompress(comptime container: Container, compressed: []const u8, expecte
252	try testing.expectEqualSlices(u8, expected_plain, out.items);	252	try testing.expectEqualSlices(u8, expected_plain, out.items);
253	}	253	}
254		254
255	test "flate don't read past deflate stream's end" {	255	test "don't read past deflate stream's end" {
256	try testDecompress(.zlib, &[_]u8{	256	try testDecompress(.zlib, &[_]u8{
257	0x08, 0xd7, 0x63, 0xf8, 0xcf, 0xc0, 0xc0, 0x00, 0xc1, 0xff,	257	0x08, 0xd7, 0x63, 0xf8, 0xcf, 0xc0, 0xc0, 0x00, 0xc1, 0xff,
258	0xff, 0x43, 0x30, 0x03, 0x03, 0xc3, 0xff, 0xff, 0xff, 0x01,	258	0xff, 0x43, 0x30, 0x03, 0x03, 0xc3, 0xff, 0xff, 0xff, 0x01,
...	@@ -264,7 +264,7 @@ test "flate don't read past deflate stream's end" {	...	@@ -264,7 +264,7 @@ test "flate don't read past deflate stream's end" {
264	});	264	});
265	}	265	}
266		266
267	test "flate zlib header" {	267	test "zlib header" {
268	// Truncated header	268	// Truncated header
269	try testing.expectError(	269	try testing.expectError(
270	error.EndOfStream,	270	error.EndOfStream,
...	@@ -292,7 +292,7 @@ test "flate zlib header" {	...	@@ -292,7 +292,7 @@ test "flate zlib header" {
292	);	292	);
293	}	293	}
294		294
295	test "flate gzip header" {	295	test "gzip header" {
296	// Truncated header	296	// Truncated header
297	try testing.expectError(	297	try testing.expectError(
298	error.EndOfStream,	298	error.EndOfStream,
...	@@ -353,7 +353,7 @@ test "flate gzip header" {	...	@@ -353,7 +353,7 @@ test "flate gzip header" {
353	}, "");	353	}, "");
354	}	354	}
355		355
356	test "flate public interface" {	356	test "public interface" {
357	if (builtin.target.cpu.arch == .wasm32) return error.SkipZigTest;	357	if (builtin.target.cpu.arch == .wasm32) return error.SkipZigTest;
358		358
359	const plain_data = [_]u8{ 'H', 'e', 'l', 'l', 'o', ' ', 'w', 'o', 'r', 'l', 'd', 0x0a };	359	const plain_data = [_]u8{ 'H', 'e', 'l', 'l', 'o', ' ', 'w', 'o', 'r', 'l', 'd', 0x0a };

lib/std/compress/flate/CircularBuffer.zig+6-6

...	@@ -130,7 +130,7 @@ pub fn full(self: *Self) bool {	...	@@ -130,7 +130,7 @@ pub fn full(self: *Self) bool {
130	}	130	}
131		131
132	// example from: https://youtu.be/SJPvNi4HrWQ?t=3558	132	// example from: https://youtu.be/SJPvNi4HrWQ?t=3558
133	test "flate.CircularBuffer writeMatch" {	133	test writeMatch {
134	var cb: Self = .{};	134	var cb: Self = .{};
135		135
136	cb.writeAll("a salad; ");	136	cb.writeAll("a salad; ");
...	@@ -140,7 +140,7 @@ test "flate.CircularBuffer writeMatch" {	...	@@ -140,7 +140,7 @@ test "flate.CircularBuffer writeMatch" {
140	try testing.expectEqualStrings("a salad; a salsal", cb.read());	140	try testing.expectEqualStrings("a salad; a salsal", cb.read());
141	}	141	}
142		142
143	test "flate.CircularBuffer writeMatch overlap" {	143	test "writeMatch overlap" {
144	var cb: Self = .{};	144	var cb: Self = .{};
145		145
146	cb.writeAll("a b c ");	146	cb.writeAll("a b c ");
...	@@ -150,7 +150,7 @@ test "flate.CircularBuffer writeMatch overlap" {	...	@@ -150,7 +150,7 @@ test "flate.CircularBuffer writeMatch overlap" {
150	try testing.expectEqualStrings("a b c b c b c d", cb.read());	150	try testing.expectEqualStrings("a b c b c b c d", cb.read());
151	}	151	}
152		152
153	test "flate.CircularBuffer readAtMost" {	153	test readAtMost {
154	var cb: Self = .{};	154	var cb: Self = .{};
155		155
156	cb.writeAll("0123456789");	156	cb.writeAll("0123456789");
...	@@ -165,7 +165,7 @@ test "flate.CircularBuffer readAtMost" {	...	@@ -165,7 +165,7 @@ test "flate.CircularBuffer readAtMost" {
165	try testing.expectEqualStrings("", cb.read());	165	try testing.expectEqualStrings("", cb.read());
166	}	166	}
167		167
168	test "flate.CircularBuffer" {	168	test Self {
169	var cb: Self = .{};	169	var cb: Self = .{};
170		170
171	const data = "0123456789abcdef" ** (1024 / 16);	171	const data = "0123456789abcdef" ** (1024 / 16);
...	@@ -201,7 +201,7 @@ test "flate.CircularBuffer" {	...	@@ -201,7 +201,7 @@ test "flate.CircularBuffer" {
201	try testing.expectEqual(@as(usize, 200), cb.read().len); // read the rest	201	try testing.expectEqual(@as(usize, 200), cb.read().len); // read the rest
202	}	202	}
203		203
204	test "flate.CircularBuffer write overlap" {	204	test "write overlap" {
205	var cb: Self = .{};	205	var cb: Self = .{};
206	cb.wp = cb.buffer.len - 15;	206	cb.wp = cb.buffer.len - 15;
207	cb.rp = cb.wp;	207	cb.rp = cb.wp;
...	@@ -218,7 +218,7 @@ test "flate.CircularBuffer write overlap" {	...	@@ -218,7 +218,7 @@ test "flate.CircularBuffer write overlap" {
218	try testing.expect(cb.wp == cb.rp);	218	try testing.expect(cb.wp == cb.rp);
219	}	219	}
220		220
221	test "flate.CircularBuffer writeMatch/read overlap" {	221	test "writeMatch/read overlap" {
222	var cb: Self = .{};	222	var cb: Self = .{};
223	cb.wp = cb.buffer.len - 15;	223	cb.wp = cb.buffer.len - 15;
224	cb.rp = cb.wp;	224	cb.rp = cb.wp;

lib/std/compress/flate/Lookup.zig+2-2

...	@@ -83,7 +83,7 @@ fn hashu(v: u32) u32 {	...	@@ -83,7 +83,7 @@ fn hashu(v: u32) u32 {
83	return @intCast((v *% prime4) >> consts.lookup.shift);	83	return @intCast((v *% prime4) >> consts.lookup.shift);
84	}	84	}
85		85
86	test "flate.Lookup add/prev" {	86	test add {
87	const data = [_]u8{	87	const data = [_]u8{
88	0x01, 0x02, 0x03, 0x04, 0x05, 0x06, 0x07, 0x08,	88	0x01, 0x02, 0x03, 0x04, 0x05, 0x06, 0x07, 0x08,
89	0x01, 0x02, 0x03, 0x04, 0x05, 0x06, 0x07, 0x08,	89	0x01, 0x02, 0x03, 0x04, 0x05, 0x06, 0x07, 0x08,
...	@@ -107,7 +107,7 @@ test "flate.Lookup add/prev" {	...	@@ -107,7 +107,7 @@ test "flate.Lookup add/prev" {
107	try expect(h.chain[2 + 8] == 2);	107	try expect(h.chain[2 + 8] == 2);
108	}	108	}
109		109
110	test "flate.Lookup bulkAdd" {	110	test bulkAdd {
111	const data = "Lorem ipsum dolor sit amet, consectetur adipiscing elit.";	111	const data = "Lorem ipsum dolor sit amet, consectetur adipiscing elit.";
112		112
113	// one by one	113	// one by one

lib/std/compress/flate/SlidingWindow.zig+2-2

...	@@ -122,7 +122,7 @@ pub fn tokensBuffer(self: *Self) ?[]const u8 {	...	@@ -122,7 +122,7 @@ pub fn tokensBuffer(self: *Self) ?[]const u8 {
122	return self.buffer[@intCast(self.fp)..self.rp];	122	return self.buffer[@intCast(self.fp)..self.rp];
123	}	123	}
124		124
125	test "flate.SlidingWindow match" {	125	test match {
126	const data = "Blah blah blah blah blah!";	126	const data = "Blah blah blah blah blah!";
127	var win: Self = .{};	127	var win: Self = .{};
128	try expect(win.write(data) == data.len);	128	try expect(win.write(data) == data.len);
...	@@ -142,7 +142,7 @@ test "flate.SlidingWindow match" {	...	@@ -142,7 +142,7 @@ test "flate.SlidingWindow match" {
142	try expect(win.match(15, 20, 4) == 0);	142	try expect(win.match(15, 20, 4) == 0);
143	}	143	}
144		144
145	test "flate.SlidingWindow slide" {	145	test slide {
146	var win: Self = .{};	146	var win: Self = .{};
147	win.wp = Self.buffer_len - 11;	147	win.wp = Self.buffer_len - 11;
148	win.rp = Self.buffer_len - 111;	148	win.rp = Self.buffer_len - 111;

lib/std/compress/flate/Token.zig+4-4

lib/std/compress/flate/bit_reader.zig+5-5

lib/std/compress/flate/block_writer.zig+3-3

...	@@ -596,20 +596,20 @@ const TestCase = @import("testdata/block_writer.zig").TestCase;	...	@@ -596,20 +596,20 @@ const TestCase = @import("testdata/block_writer.zig").TestCase;
596	const testCases = @import("testdata/block_writer.zig").testCases;	596	const testCases = @import("testdata/block_writer.zig").testCases;
597		597
598	// tests if the writeBlock encoding has changed.	598	// tests if the writeBlock encoding has changed.
599	test "flate.BlockWriter write" {	599	test "write" {
600	inline for (0..testCases.len) \|i\| {	600	inline for (0..testCases.len) \|i\| {
601	try testBlock(testCases[i], .write_block);	601	try testBlock(testCases[i], .write_block);
602	}	602	}
603	}	603	}
604		604
605	// tests if the writeBlockDynamic encoding has changed.	605	// tests if the writeBlockDynamic encoding has changed.
606	test "flate.BlockWriter dynamicBlock" {	606	test "dynamicBlock" {
607	inline for (0..testCases.len) \|i\| {	607	inline for (0..testCases.len) \|i\| {
608	try testBlock(testCases[i], .write_dyn_block);	608	try testBlock(testCases[i], .write_dyn_block);
609	}	609	}
610	}	610	}
611		611
612	test "flate.BlockWriter huffmanBlock" {	612	test "huffmanBlock" {
613	inline for (0..testCases.len) \|i\| {	613	inline for (0..testCases.len) \|i\| {
614	try testBlock(testCases[i], .write_huffman_block);	614	try testBlock(testCases[i], .write_huffman_block);
615	}	615	}

lib/std/compress/flate/huffman_decoder.zig+5-11

...	@@ -93,7 +93,6 @@ fn HuffmanDecoder(	...	@@ -93,7 +93,6 @@ fn HuffmanDecoder(
93	var code: u16 = 0;	93	var code: u16 = 0;
94	var idx: u16 = 0;	94	var idx: u16 = 0;
95	for (&self.symbols, 0..) \|*sym, pos\| {	95	for (&self.symbols, 0..) \|*sym, pos\| {
96	//print("sym: {}\n", .{sym});
97	if (sym.code_bits == 0) continue; // skip unused	96	if (sym.code_bits == 0) continue; // skip unused
98	sym.code = code;	97	sym.code = code;
99		98
...	@@ -116,7 +115,6 @@ fn HuffmanDecoder(	...	@@ -116,7 +115,6 @@ fn HuffmanDecoder(
116	idx = next_idx;	115	idx = next_idx;
117	code = next_code;	116	code = next_code;
118	}	117	}
119	//print("decoder generate, code: {d}, idx: {d}\n", .{ code, idx });
120	}	118	}
121		119
122	/// Given the list of code lengths check that it represents a canonical	120	/// Given the list of code lengths check that it represents a canonical
...	@@ -176,7 +174,7 @@ fn HuffmanDecoder(	...	@@ -176,7 +174,7 @@ fn HuffmanDecoder(
176	};	174	};
177	}	175	}
178		176
179	test "flate.HuffmanDecoder init/find" {	177	test "init/find" {
180	// example data from: https://youtu.be/SJPvNi4HrWQ?t=8423	178	// example data from: https://youtu.be/SJPvNi4HrWQ?t=8423
181	const code_lens = [_]u4{ 4, 3, 0, 2, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 3, 2 };	179	const code_lens = [_]u4{ 4, 3, 0, 2, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 3, 2 };
182	var h: CodegenDecoder = .{};	180	var h: CodegenDecoder = .{};
...	@@ -252,11 +250,7 @@ test "flate.HuffmanDecoder init/find" {	...	@@ -252,11 +250,7 @@ test "flate.HuffmanDecoder init/find" {
252	try testing.expectEqual(16, (try h.find(@intCast(c))).symbol);	250	try testing.expectEqual(16, (try h.find(@intCast(c))).symbol);
253	}	251	}
254		252
255	const print = std.debug.print;	253	test "encode/decode literals" {
256	const assert = std.debug.assert;
257	const expect = std.testing.expect;
258
259	test "flate.HuffmanDecoder encode/decode literals" {
260	const LiteralEncoder = @import("huffman_encoder.zig").LiteralEncoder;	254	const LiteralEncoder = @import("huffman_encoder.zig").LiteralEncoder;
261		255
262	for (1..286) \|j\| { // for all different number of codes	256	for (1..286) \|j\| { // for all different number of codes
...	@@ -292,7 +286,7 @@ test "flate.HuffmanDecoder encode/decode literals" {	...	@@ -292,7 +286,7 @@ test "flate.HuffmanDecoder encode/decode literals" {
292	};	286	};
293		287
294	const c = enc.codes[symbol];	288	const c = enc.codes[symbol];
295	try expect(c.code == c_code);	289	try testing.expect(c.code == c_code);
296	}	290	}
297		291
298	// find each symbol by code	292	// find each symbol by code
...	@@ -301,8 +295,8 @@ test "flate.HuffmanDecoder encode/decode literals" {	...	@@ -301,8 +295,8 @@ test "flate.HuffmanDecoder encode/decode literals" {
301		295
302	const s_code: u15 = @bitReverse(@as(u15, @intCast(c.code)));	296	const s_code: u15 = @bitReverse(@as(u15, @intCast(c.code)));
303	const s = try dec.find(s_code);	297	const s = try dec.find(s_code);
304	try expect(s.code == s_code);	298	try testing.expect(s.code == s_code);
305	try expect(s.code_bits == c.len);	299	try testing.expect(s.code_bits == c.len);
306	}	300	}
307	}	301	}
308	}	302	}

lib/std/compress/flate/huffman_encoder.zig+5-5

...	@@ -360,7 +360,7 @@ fn byFreq(context: void, a: LiteralNode, b: LiteralNode) bool {	...	@@ -360,7 +360,7 @@ fn byFreq(context: void, a: LiteralNode, b: LiteralNode) bool {
360	return a.freq < b.freq;	360	return a.freq < b.freq;
361	}	361	}
362		362
363	test "flate.HuffmanEncoder generate a Huffman code from an array of frequencies" {	363	test "generate a Huffman code from an array of frequencies" {
364	var freqs: [19]u16 = [_]u16{	364	var freqs: [19]u16 = [_]u16{
365	8, // 0	365	8, // 0
366	1, // 1	366	1, // 1
...	@@ -421,7 +421,7 @@ test "flate.HuffmanEncoder generate a Huffman code from an array of frequencies"	...	@@ -421,7 +421,7 @@ test "flate.HuffmanEncoder generate a Huffman code from an array of frequencies"
421	try testing.expectEqual(@as(u16, 0x3f), enc.codes[16].code);	421	try testing.expectEqual(@as(u16, 0x3f), enc.codes[16].code);
422	}	422	}
423		423
424	test "flate.HuffmanEncoder generate a Huffman code for the fixed literal table specific to Deflate" {	424	test "generate a Huffman code for the fixed literal table specific to Deflate" {
425	const enc = fixedLiteralEncoder();	425	const enc = fixedLiteralEncoder();
426	for (enc.codes) \|c\| {	426	for (enc.codes) \|c\| {
427	switch (c.len) {	427	switch (c.len) {
...	@@ -443,7 +443,7 @@ test "flate.HuffmanEncoder generate a Huffman code for the fixed literal table s	...	@@ -443,7 +443,7 @@ test "flate.HuffmanEncoder generate a Huffman code for the fixed literal table s
443	}	443	}
444	}	444	}
445		445
446	test "flate.HuffmanEncoder generate a Huffman code for the 30 possible relative distances (LZ77 distances) of Deflate" {	446	test "generate a Huffman code for the 30 possible relative distances (LZ77 distances) of Deflate" {
447	const enc = fixedDistanceEncoder();	447	const enc = fixedDistanceEncoder();
448	for (enc.codes) \|c\| {	448	for (enc.codes) \|c\| {
449	const v = @bitReverse(@as(u5, @intCast(c.code)));	449	const v = @bitReverse(@as(u5, @intCast(c.code)));
...	@@ -458,7 +458,7 @@ fn bitReverse(comptime T: type, value: T, n: usize) T {	...	@@ -458,7 +458,7 @@ fn bitReverse(comptime T: type, value: T, n: usize) T {
458	return r >> @as(math.Log2Int(T), @intCast(@typeInfo(T).Int.bits - n));	458	return r >> @as(math.Log2Int(T), @intCast(@typeInfo(T).Int.bits - n));
459	}	459	}
460		460
461	test "flate bitReverse" {	461	test bitReverse {
462	const ReverseBitsTest = struct {	462	const ReverseBitsTest = struct {
463	in: u16,	463	in: u16,
464	bit_count: u5,	464	bit_count: u5,
...	@@ -482,7 +482,7 @@ test "flate bitReverse" {	...	@@ -482,7 +482,7 @@ test "flate bitReverse" {
482	}	482	}
483	}	483	}
484		484
485	test "flate.HuffmanEncoder fixedLiteralEncoder codes" {	485	test "fixedLiteralEncoder codes" {
486	var al = std.ArrayList(u8).init(testing.allocator);	486	var al = std.ArrayList(u8).init(testing.allocator);
487	defer al.deinit();	487	defer al.deinit();
488	var bw = std.io.bitWriter(.little, al.writer());	488	var bw = std.io.bitWriter(.little, al.writer());

lib/std/compress/flate/inflate.zig+5-5

...	@@ -342,7 +342,7 @@ pub fn Inflate(comptime container: Container, comptime ReaderType: type) type {	...	@@ -342,7 +342,7 @@ pub fn Inflate(comptime container: Container, comptime ReaderType: type) type {
342	};	342	};
343	}	343	}
344		344
345	test "flate.Inflate decompress" {	345	test "decompress" {
346	const cases = [_]struct {	346	const cases = [_]struct {
347	in: []const u8,	347	in: []const u8,
348	out: []const u8,	348	out: []const u8,
...	@@ -383,7 +383,7 @@ test "flate.Inflate decompress" {	...	@@ -383,7 +383,7 @@ test "flate.Inflate decompress" {
383	}	383	}
384	}	384	}
385		385
386	test "flate.Inflate gzip decompress" {	386	test "gzip decompress" {
387	const cases = [_]struct {	387	const cases = [_]struct {
388	in: []const u8,	388	in: []const u8,
389	out: []const u8,	389	out: []const u8,
...	@@ -440,7 +440,7 @@ test "flate.Inflate gzip decompress" {	...	@@ -440,7 +440,7 @@ test "flate.Inflate gzip decompress" {
440	}	440	}
441	}	441	}
442		442
443	test "flate.Inflate zlib decompress" {	443	test "zlib decompress" {
444	const cases = [_]struct {	444	const cases = [_]struct {
445	in: []const u8,	445	in: []const u8,
446	out: []const u8,	446	out: []const u8,
...	@@ -466,7 +466,7 @@ test "flate.Inflate zlib decompress" {	...	@@ -466,7 +466,7 @@ test "flate.Inflate zlib decompress" {
466	}	466	}
467	}	467	}
468		468
469	test "flate.Inflate fuzzing tests" {	469	test "fuzzing tests" {
470	const cases = [_]struct {	470	const cases = [_]struct {
471	input: []const u8,	471	input: []const u8,
472	out: []const u8 = "",	472	out: []const u8 = "",
...	@@ -529,7 +529,7 @@ test "flate.Inflate fuzzing tests" {	...	@@ -529,7 +529,7 @@ test "flate.Inflate fuzzing tests" {
529	}	529	}
530	}	530	}
531		531
532	test "flate bug 18966" {	532	test "bug 18966" {
533	const input = @embedFile("testdata/fuzz/bug_18966.input");	533	const input = @embedFile("testdata/fuzz/bug_18966.input");
534	const expect = @embedFile("testdata/fuzz/bug_18966.expect");	534	const expect = @embedFile("testdata/fuzz/bug_18966.expect");
535		535

lib/std/compress/lzma/test.zig+8-8

...	@@ -21,7 +21,7 @@ fn testDecompressError(expected: anyerror, compressed: []const u8) !void {	...	@@ -21,7 +21,7 @@ fn testDecompressError(expected: anyerror, compressed: []const u8) !void {
21	return std.testing.expectError(expected, testDecompress(compressed));	21	return std.testing.expectError(expected, testDecompress(compressed));
22	}	22	}
23		23
24	test "LZMA: decompress empty world" {	24	test "decompress empty world" {
25	try testDecompressEqual(	25	try testDecompressEqual(
26	"",	26	"",
27	&[_]u8{	27	&[_]u8{
...	@@ -31,7 +31,7 @@ test "LZMA: decompress empty world" {	...	@@ -31,7 +31,7 @@ test "LZMA: decompress empty world" {
31	);	31	);
32	}	32	}
33		33
34	test "LZMA: decompress hello world" {	34	test "decompress hello world" {
35	try testDecompressEqual(	35	try testDecompressEqual(
36	"Hello world\n",	36	"Hello world\n",
37	&[_]u8{	37	&[_]u8{
...	@@ -42,7 +42,7 @@ test "LZMA: decompress hello world" {	...	@@ -42,7 +42,7 @@ test "LZMA: decompress hello world" {
42	);	42	);
43	}	43	}
44		44
45	test "LZMA: decompress huge dict" {	45	test "decompress huge dict" {
46	try testDecompressEqual(	46	try testDecompressEqual(
47	"Hello world\n",	47	"Hello world\n",
48	&[_]u8{	48	&[_]u8{
...	@@ -53,35 +53,35 @@ test "LZMA: decompress huge dict" {	...	@@ -53,35 +53,35 @@ test "LZMA: decompress huge dict" {
53	);	53	);
54	}	54	}
55		55
56	test "LZMA: unknown size with end of payload marker" {	56	test "unknown size with end of payload marker" {
57	try testDecompressEqual(	57	try testDecompressEqual(
58	"Hello\nWorld!\n",	58	"Hello\nWorld!\n",
59	@embedFile("testdata/good-unknown_size-with_eopm.lzma"),	59	@embedFile("testdata/good-unknown_size-with_eopm.lzma"),
60	);	60	);
61	}	61	}
62		62
63	test "LZMA: known size without end of payload marker" {	63	test "known size without end of payload marker" {
64	try testDecompressEqual(	64	try testDecompressEqual(
65	"Hello\nWorld!\n",	65	"Hello\nWorld!\n",
66	@embedFile("testdata/good-known_size-without_eopm.lzma"),	66	@embedFile("testdata/good-known_size-without_eopm.lzma"),
67	);	67	);
68	}	68	}
69		69
70	test "LZMA: known size with end of payload marker" {	70	test "known size with end of payload marker" {
71	try testDecompressEqual(	71	try testDecompressEqual(
72	"Hello\nWorld!\n",	72	"Hello\nWorld!\n",
73	@embedFile("testdata/good-known_size-with_eopm.lzma"),	73	@embedFile("testdata/good-known_size-with_eopm.lzma"),
74	);	74	);
75	}	75	}
76		76
77	test "LZMA: too big uncompressed size in header" {	77	test "too big uncompressed size in header" {
78	try testDecompressError(	78	try testDecompressError(
79	error.CorruptInput,	79	error.CorruptInput,
80	@embedFile("testdata/bad-too_big_size-with_eopm.lzma"),	80	@embedFile("testdata/bad-too_big_size-with_eopm.lzma"),
81	);	81	);
82	}	82	}
83		83
84	test "LZMA: too small uncompressed size in header" {	84	test "too small uncompressed size in header" {
85	try testDecompressError(	85	try testDecompressError(
86	error.CorruptInput,	86	error.CorruptInput,
87	@embedFile("testdata/bad-too_small_size-without_eopm-3.lzma"),	87	@embedFile("testdata/bad-too_small_size-without_eopm-3.lzma"),

lib/std/compress/lzma/vec2d.zig+7-7

lib/std/compress/zstandard.zig+2-2

...	@@ -222,7 +222,7 @@ fn testReader(data: []const u8, comptime expected: []const u8) !void {	...	@@ -222,7 +222,7 @@ fn testReader(data: []const u8, comptime expected: []const u8) !void {
222	try std.testing.expectEqualSlices(u8, expected, buf);	222	try std.testing.expectEqualSlices(u8, expected, buf);
223	}	223	}
224		224
225	test "zstandard decompression" {	225	test "decompression" {
226	const uncompressed = @embedFile("testdata/rfc8478.txt");	226	const uncompressed = @embedFile("testdata/rfc8478.txt");
227	const compressed3 = @embedFile("testdata/rfc8478.txt.zst.3");	227	const compressed3 = @embedFile("testdata/rfc8478.txt.zst.3");
228	const compressed19 = @embedFile("testdata/rfc8478.txt.zst.19");	228	const compressed19 = @embedFile("testdata/rfc8478.txt.zst.19");
...	@@ -239,7 +239,7 @@ test "zstandard decompression" {	...	@@ -239,7 +239,7 @@ test "zstandard decompression" {
239	try std.testing.expectEqualSlices(u8, uncompressed, buffer);	239	try std.testing.expectEqualSlices(u8, uncompressed, buffer);
240	}	240	}
241		241
242	test "zstandard streaming decompression" {	242	test "streaming decompression" {
243	// default stack size for wasm32 is too low for Decompressor - slightly	243	// default stack size for wasm32 is too low for Decompressor - slightly
244	// over 1MiB stack space is needed via the --stack CLI flag	244	// over 1MiB stack space is needed via the --stack CLI flag
245	if (@import("builtin").target.cpu.arch == .wasm32) return error.SkipZigTest;	245	if (@import("builtin").target.cpu.arch == .wasm32) return error.SkipZigTest;

lib/std/comptime_string_map.zig+9-9

...	@@ -142,7 +142,7 @@ const TestEnum = enum {	...	@@ -142,7 +142,7 @@ const TestEnum = enum {
142	E,	142	E,
143	};	143	};
144		144
145	test "ComptimeStringMap list literal of list literals" {	145	test "list literal of list literals" {
146	const map = ComptimeStringMap(TestEnum, .{	146	const map = ComptimeStringMap(TestEnum, .{
147	.{ "these", .D },	147	.{ "these", .D },
148	.{ "have", .A },	148	.{ "have", .A },
...	@@ -157,7 +157,7 @@ test "ComptimeStringMap list literal of list literals" {	...	@@ -157,7 +157,7 @@ test "ComptimeStringMap list literal of list literals" {
157	try std.testing.expect(null == map.get("NOTHING"));	157	try std.testing.expect(null == map.get("NOTHING"));
158	}	158	}
159		159
160	test "ComptimeStringMap array of structs" {	160	test "array of structs" {
161	const KV = struct { []const u8, TestEnum };	161	const KV = struct { []const u8, TestEnum };
162	const map = ComptimeStringMap(TestEnum, [_]KV{	162	const map = ComptimeStringMap(TestEnum, [_]KV{
163	.{ "these", .D },	163	.{ "these", .D },
...	@@ -170,7 +170,7 @@ test "ComptimeStringMap array of structs" {	...	@@ -170,7 +170,7 @@ test "ComptimeStringMap array of structs" {
170	try testMap(map);	170	try testMap(map);
171	}	171	}
172		172
173	test "ComptimeStringMap slice of structs" {	173	test "slice of structs" {
174	const KV = struct { []const u8, TestEnum };	174	const KV = struct { []const u8, TestEnum };
175	const slice: []const KV = &[_]KV{	175	const slice: []const KV = &[_]KV{
176	.{ "these", .D },	176	.{ "these", .D },
...	@@ -198,7 +198,7 @@ fn testMap(comptime map: anytype) !void {	...	@@ -198,7 +198,7 @@ fn testMap(comptime map: anytype) !void {
198	try std.testing.expect(null == map.get("averylongstringthathasnomatches"));	198	try std.testing.expect(null == map.get("averylongstringthathasnomatches"));
199	}	199	}
200		200
201	test "ComptimeStringMap void value type, slice of structs" {	201	test "void value type, slice of structs" {
202	const KV = struct { []const u8 };	202	const KV = struct { []const u8 };
203	const slice: []const KV = &[_]KV{	203	const slice: []const KV = &[_]KV{
204	.{"these"},	204	.{"these"},
...	@@ -215,7 +215,7 @@ test "ComptimeStringMap void value type, slice of structs" {	...	@@ -215,7 +215,7 @@ test "ComptimeStringMap void value type, slice of structs" {
215	try std.testing.expect(null == map.get("NOTHING"));	215	try std.testing.expect(null == map.get("NOTHING"));
216	}	216	}
217		217
218	test "ComptimeStringMap void value type, list literal of list literals" {	218	test "void value type, list literal of list literals" {
219	const map = ComptimeStringMap(void, .{	219	const map = ComptimeStringMap(void, .{
220	.{"these"},	220	.{"these"},
221	.{"have"},	221	.{"have"},
...	@@ -258,7 +258,7 @@ test "ComptimeStringMapWithEql" {	...	@@ -258,7 +258,7 @@ test "ComptimeStringMapWithEql" {
258	try std.testing.expect(map.has("ThESe"));	258	try std.testing.expect(map.has("ThESe"));
259	}	259	}
260		260
261	test "ComptimeStringMap empty" {	261	test "empty" {
262	const m1 = ComptimeStringMap(usize, .{});	262	const m1 = ComptimeStringMap(usize, .{});
263	try std.testing.expect(null == m1.get("anything"));	263	try std.testing.expect(null == m1.get("anything"));
264		264
...	@@ -266,7 +266,7 @@ test "ComptimeStringMap empty" {	...	@@ -266,7 +266,7 @@ test "ComptimeStringMap empty" {
266	try std.testing.expect(null == m2.get("anything"));	266	try std.testing.expect(null == m2.get("anything"));
267	}	267	}
268		268
269	test "ComptimeStringMap redundant entries" {	269	test "redundant entries" {
270	const map = ComptimeStringMap(TestEnum, .{	270	const map = ComptimeStringMap(TestEnum, .{
271	.{ "redundant", .D },	271	.{ "redundant", .D },
272	.{ "theNeedle", .A },	272	.{ "theNeedle", .A },
...	@@ -284,7 +284,7 @@ test "ComptimeStringMap redundant entries" {	...	@@ -284,7 +284,7 @@ test "ComptimeStringMap redundant entries" {
284	try std.testing.expectEqual(TestEnum.A, map.get("theNeedle").?);	284	try std.testing.expectEqual(TestEnum.A, map.get("theNeedle").?);
285	}	285	}
286		286
287	test "ComptimeStringMap redundant insensitive" {	287	test "redundant insensitive" {
288	const map = ComptimeStringMapWithEql(TestEnum, .{	288	const map = ComptimeStringMapWithEql(TestEnum, .{
289	.{ "redundant", .D },	289	.{ "redundant", .D },
290	.{ "theNeedle", .A },	290	.{ "theNeedle", .A },
...	@@ -300,7 +300,7 @@ test "ComptimeStringMap redundant insensitive" {	...	@@ -300,7 +300,7 @@ test "ComptimeStringMap redundant insensitive" {
300	try std.testing.expectEqual(TestEnum.A, map.get("theNeedle").?);	300	try std.testing.expectEqual(TestEnum.A, map.get("theNeedle").?);
301	}	301	}
302		302
303	test "ComptimeStringMap comptime-only value" {	303	test "comptime-only value" {
304	const map = std.ComptimeStringMap(type, .{	304	const map = std.ComptimeStringMap(type, .{
305	.{ "a", struct {	305	.{ "a", struct {
306	pub const foo = 1;	306	pub const foo = 1;

lib/std/crypto/25519/curve25519.zig+1-1

...	@@ -137,7 +137,7 @@ test "non-affine edwards25519 to curve25519 projection" {	...	@@ -137,7 +137,7 @@ test "non-affine edwards25519 to curve25519 projection" {
137	try std.testing.expectEqualSlices(u8, &xp.toBytes(), &expected);	137	try std.testing.expectEqualSlices(u8, &xp.toBytes(), &expected);
138	}	138	}
139		139
140	test "curve25519 small order check" {	140	test "small order check" {
141	var s: [32]u8 = [_]u8{1} ++ [_]u8{0} ** 31;	141	var s: [32]u8 = [_]u8{1} ++ [_]u8{0} ** 31;
142	const small_order_ss: [7][32]u8 = .{	142	const small_order_ss: [7][32]u8 = .{
143	.{	143	.{

lib/std/crypto/25519/ed25519.zig+7-7

lib/std/crypto/25519/edwards25519.zig+5-5

lib/std/crypto/25519/x25519.zig+6-6

lib/std/crypto/chacha20.zig+8-8

lib/std/crypto/ecdsa.zig+6-6

lib/std/crypto/hmac.zig+3-3

lib/std/crypto/md5.zig+3-3

lib/std/crypto/poly1305.zig+2-2

...	@@ -195,7 +195,7 @@ pub const Poly1305 = struct {	...	@@ -195,7 +195,7 @@ pub const Poly1305 = struct {
195	}	195	}
196	};	196	};
197		197
198	test "poly1305 rfc7439 vector1" {	198	test "rfc7439 vector1" {
199	const expected_mac = "\xa8\x06\x1d\xc1\x30\x51\x36\xc6\xc2\x2b\x8b\xaf\x0c\x01\x27\xa9";	199	const expected_mac = "\xa8\x06\x1d\xc1\x30\x51\x36\xc6\xc2\x2b\x8b\xaf\x0c\x01\x27\xa9";
200		200
201	const msg = "Cryptographic Forum Research Group";	201	const msg = "Cryptographic Forum Research Group";
...	@@ -208,7 +208,7 @@ test "poly1305 rfc7439 vector1" {	...	@@ -208,7 +208,7 @@ test "poly1305 rfc7439 vector1" {
208	try std.testing.expectEqualSlices(u8, expected_mac, &mac);	208	try std.testing.expectEqualSlices(u8, expected_mac, &mac);
209	}	209	}
210		210
211	test "poly1305 requiring a final reduction" {	211	test "requiring a final reduction" {
212	const expected_mac = [_]u8{ 25, 13, 249, 42, 164, 57, 99, 60, 149, 181, 74, 74, 13, 63, 121, 6 };	212	const expected_mac = [_]u8{ 25, 13, 249, 42, 164, 57, 99, 60, 149, 181, 74, 74, 13, 63, 121, 6 };
213	const msg = [_]u8{ 253, 193, 249, 146, 70, 6, 214, 226, 131, 213, 241, 116, 20, 24, 210, 224, 65, 151, 255, 104, 133 };	213	const msg = [_]u8{ 253, 193, 249, 146, 70, 6, 214, 226, 131, 213, 241, 116, 20, 24, 210, 224, 65, 151, 255, 104, 133 };
214	const key = [_]u8{ 190, 63, 95, 57, 155, 103, 77, 170, 7, 98, 106, 44, 117, 186, 90, 185, 109, 118, 184, 24, 69, 41, 166, 243, 119, 132, 151, 61, 52, 43, 64, 250 };	214	const key = [_]u8{ 190, 63, 95, 57, 155, 103, 77, 170, 7, 98, 106, 44, 117, 186, 90, 185, 109, 118, 184, 24, 69, 41, 166, 243, 119, 132, 151, 61, 52, 43, 64, 250 };

lib/std/crypto/utils.zig+5-5

...	@@ -138,7 +138,7 @@ pub inline fn secureZero(comptime T: type, s: []T) void {	...	@@ -138,7 +138,7 @@ pub inline fn secureZero(comptime T: type, s: []T) void {
138	@memset(@as([]volatile T, s), 0);	138	@memset(@as([]volatile T, s), 0);
139	}	139	}
140		140
141	test "crypto.utils.timingSafeEql" {	141	test "timingSafeEql" {
142	var a: [100]u8 = undefined;	142	var a: [100]u8 = undefined;
143	var b: [100]u8 = undefined;	143	var b: [100]u8 = undefined;
144	random.bytes(a[0..]);	144	random.bytes(a[0..]);
...	@@ -148,7 +148,7 @@ test "crypto.utils.timingSafeEql" {	...	@@ -148,7 +148,7 @@ test "crypto.utils.timingSafeEql" {
148	try testing.expect(timingSafeEql([100]u8, a, b));	148	try testing.expect(timingSafeEql([100]u8, a, b));
149	}	149	}
150		150
151	test "crypto.utils.timingSafeEql (vectors)" {	151	test "timingSafeEql (vectors)" {
152	if (@import("builtin").zig_backend == .stage2_x86_64) return error.SkipZigTest;	152	if (@import("builtin").zig_backend == .stage2_x86_64) return error.SkipZigTest;
153		153
154	var a: [100]u8 = undefined;	154	var a: [100]u8 = undefined;
...	@@ -162,7 +162,7 @@ test "crypto.utils.timingSafeEql (vectors)" {	...	@@ -162,7 +162,7 @@ test "crypto.utils.timingSafeEql (vectors)" {
162	try testing.expect(timingSafeEql(@Vector(100, u8), v1, v3));	162	try testing.expect(timingSafeEql(@Vector(100, u8), v1, v3));
163	}	163	}
164		164
165	test "crypto.utils.timingSafeCompare" {	165	test "timingSafeCompare" {
166	var a = [_]u8{10} ** 32;	166	var a = [_]u8{10} ** 32;
167	var b = [_]u8{10} ** 32;	167	var b = [_]u8{10} ** 32;
168	try testing.expectEqual(timingSafeCompare(u8, &a, &b, .big), .eq);	168	try testing.expectEqual(timingSafeCompare(u8, &a, &b, .big), .eq);
...	@@ -175,7 +175,7 @@ test "crypto.utils.timingSafeCompare" {	...	@@ -175,7 +175,7 @@ test "crypto.utils.timingSafeCompare" {
175	try testing.expectEqual(timingSafeCompare(u8, &a, &b, .little), .lt);	175	try testing.expectEqual(timingSafeCompare(u8, &a, &b, .little), .lt);
176	}	176	}
177		177
178	test "crypto.utils.timingSafe{Add,Sub}" {	178	test "timingSafe{Add,Sub}" {
179	const len = 32;	179	const len = 32;
180	var a: [len]u8 = undefined;	180	var a: [len]u8 = undefined;
181	var b: [len]u8 = undefined;	181	var b: [len]u8 = undefined;
...	@@ -195,7 +195,7 @@ test "crypto.utils.timingSafe{Add,Sub}" {	...	@@ -195,7 +195,7 @@ test "crypto.utils.timingSafe{Add,Sub}" {
195	}	195	}
196	}	196	}
197		197
198	test "crypto.utils.secureZero" {	198	test "secureZero" {
199	var a = [_]u8{0xfe} ** 8;	199	var a = [_]u8{0xfe} ** 8;
200	var b = [_]u8{0xfe} ** 8;	200	var b = [_]u8{0xfe} ** 8;
201		201

lib/std/enums.zig+14-14

lib/std/fmt/parse_float.zig+10-10

lib/std/hash_map.zig+23-23

...	@@ -1612,7 +1612,7 @@ const testing = std.testing;	...	@@ -1612,7 +1612,7 @@ const testing = std.testing;
1612	const expect = std.testing.expect;	1612	const expect = std.testing.expect;
1613	const expectEqual = std.testing.expectEqual;	1613	const expectEqual = std.testing.expectEqual;
1614		1614
1615	test "std.hash_map basic usage" {	1615	test "basic usage" {
1616	var map = AutoHashMap(u32, u32).init(std.testing.allocator);	1616	var map = AutoHashMap(u32, u32).init(std.testing.allocator);
1617	defer map.deinit();	1617	defer map.deinit();
1618		1618
...	@@ -1640,7 +1640,7 @@ test "std.hash_map basic usage" {	...	@@ -1640,7 +1640,7 @@ test "std.hash_map basic usage" {
1640	try expectEqual(total, sum);	1640	try expectEqual(total, sum);
1641	}	1641	}
1642		1642
1643	test "std.hash_map ensureTotalCapacity" {	1643	test "ensureTotalCapacity" {
1644	var map = AutoHashMap(i32, i32).init(std.testing.allocator);	1644	var map = AutoHashMap(i32, i32).init(std.testing.allocator);
1645	defer map.deinit();	1645	defer map.deinit();
1646		1646
...	@@ -1655,7 +1655,7 @@ test "std.hash_map ensureTotalCapacity" {	...	@@ -1655,7 +1655,7 @@ test "std.hash_map ensureTotalCapacity" {
1655	try testing.expect(initial_capacity == map.capacity());	1655	try testing.expect(initial_capacity == map.capacity());
1656	}	1656	}
1657		1657
1658	test "std.hash_map ensureUnusedCapacity with tombstones" {	1658	test "ensureUnusedCapacity with tombstones" {
1659	var map = AutoHashMap(i32, i32).init(std.testing.allocator);	1659	var map = AutoHashMap(i32, i32).init(std.testing.allocator);
1660	defer map.deinit();	1660	defer map.deinit();
1661		1661
...	@@ -1667,7 +1667,7 @@ test "std.hash_map ensureUnusedCapacity with tombstones" {	...	@@ -1667,7 +1667,7 @@ test "std.hash_map ensureUnusedCapacity with tombstones" {
1667	}	1667	}
1668	}	1668	}
1669		1669
1670	test "std.hash_map clearRetainingCapacity" {	1670	test "clearRetainingCapacity" {
1671	var map = AutoHashMap(u32, u32).init(std.testing.allocator);	1671	var map = AutoHashMap(u32, u32).init(std.testing.allocator);
1672	defer map.deinit();	1672	defer map.deinit();
1673		1673
...	@@ -1692,7 +1692,7 @@ test "std.hash_map clearRetainingCapacity" {	...	@@ -1692,7 +1692,7 @@ test "std.hash_map clearRetainingCapacity" {
1692	try expect(!map.contains(1));	1692	try expect(!map.contains(1));
1693	}	1693	}
1694		1694
1695	test "std.hash_map grow" {	1695	test "grow" {
1696	var map = AutoHashMap(u32, u32).init(std.testing.allocator);	1696	var map = AutoHashMap(u32, u32).init(std.testing.allocator);
1697	defer map.deinit();	1697	defer map.deinit();
1698		1698
...	@@ -1718,7 +1718,7 @@ test "std.hash_map grow" {	...	@@ -1718,7 +1718,7 @@ test "std.hash_map grow" {
1718	}	1718	}
1719	}	1719	}
1720		1720
1721	test "std.hash_map clone" {	1721	test "clone" {
1722	var map = AutoHashMap(u32, u32).init(std.testing.allocator);	1722	var map = AutoHashMap(u32, u32).init(std.testing.allocator);
1723	defer map.deinit();	1723	defer map.deinit();
1724		1724
...	@@ -1756,7 +1756,7 @@ test "std.hash_map clone" {	...	@@ -1756,7 +1756,7 @@ test "std.hash_map clone" {
1756	}	1756	}
1757	}	1757	}
1758		1758
1759	test "std.hash_map ensureTotalCapacity with existing elements" {	1759	test "ensureTotalCapacity with existing elements" {
1760	var map = AutoHashMap(u32, u32).init(std.testing.allocator);	1760	var map = AutoHashMap(u32, u32).init(std.testing.allocator);
1761	defer map.deinit();	1761	defer map.deinit();
1762		1762
...	@@ -1769,7 +1769,7 @@ test "std.hash_map ensureTotalCapacity with existing elements" {	...	@@ -1769,7 +1769,7 @@ test "std.hash_map ensureTotalCapacity with existing elements" {
1769	try expectEqual(map.capacity(), 128);	1769	try expectEqual(map.capacity(), 128);
1770	}	1770	}
1771		1771
1772	test "std.hash_map ensureTotalCapacity satisfies max load factor" {	1772	test "ensureTotalCapacity satisfies max load factor" {
1773	var map = AutoHashMap(u32, u32).init(std.testing.allocator);	1773	var map = AutoHashMap(u32, u32).init(std.testing.allocator);
1774	defer map.deinit();	1774	defer map.deinit();
1775		1775
...	@@ -1777,7 +1777,7 @@ test "std.hash_map ensureTotalCapacity satisfies max load factor" {	...	@@ -1777,7 +1777,7 @@ test "std.hash_map ensureTotalCapacity satisfies max load factor" {
1777	try expectEqual(map.capacity(), 256);	1777	try expectEqual(map.capacity(), 256);
1778	}	1778	}
1779		1779
1780	test "std.hash_map remove" {	1780	test "remove" {
1781	var map = AutoHashMap(u32, u32).init(std.testing.allocator);	1781	var map = AutoHashMap(u32, u32).init(std.testing.allocator);
1782	defer map.deinit();	1782	defer map.deinit();
1783		1783
...	@@ -1809,7 +1809,7 @@ test "std.hash_map remove" {	...	@@ -1809,7 +1809,7 @@ test "std.hash_map remove" {
1809	}	1809	}
1810	}	1810	}
1811		1811
1812	test "std.hash_map reverse removes" {	1812	test "reverse removes" {
1813	var map = AutoHashMap(u32, u32).init(std.testing.allocator);	1813	var map = AutoHashMap(u32, u32).init(std.testing.allocator);
1814	defer map.deinit();	1814	defer map.deinit();
1815		1815
...	@@ -1831,7 +1831,7 @@ test "std.hash_map reverse removes" {	...	@@ -1831,7 +1831,7 @@ test "std.hash_map reverse removes" {
1831	try expectEqual(map.count(), 0);	1831	try expectEqual(map.count(), 0);
1832	}	1832	}
1833		1833
1834	test "std.hash_map multiple removes on same metadata" {	1834	test "multiple removes on same metadata" {
1835	var map = AutoHashMap(u32, u32).init(std.testing.allocator);	1835	var map = AutoHashMap(u32, u32).init(std.testing.allocator);
1836	defer map.deinit();	1836	defer map.deinit();
1837		1837
...	@@ -1868,7 +1868,7 @@ test "std.hash_map multiple removes on same metadata" {	...	@@ -1868,7 +1868,7 @@ test "std.hash_map multiple removes on same metadata" {
1868	}	1868	}
1869	}	1869	}
1870		1870
1871	test "std.hash_map put and remove loop in random order" {	1871	test "put and remove loop in random order" {
1872	var map = AutoHashMap(u32, u32).init(std.testing.allocator);	1872	var map = AutoHashMap(u32, u32).init(std.testing.allocator);
1873	defer map.deinit();	1873	defer map.deinit();
1874		1874
...	@@ -1900,7 +1900,7 @@ test "std.hash_map put and remove loop in random order" {	...	@@ -1900,7 +1900,7 @@ test "std.hash_map put and remove loop in random order" {
1900	}	1900	}
1901	}	1901	}
1902		1902
1903	test "std.hash_map remove one million elements in random order" {	1903	test "remove one million elements in random order" {
1904	const Map = AutoHashMap(u32, u32);	1904	const Map = AutoHashMap(u32, u32);
1905	const n = 1000 * 1000;	1905	const n = 1000 * 1000;
1906	var map = Map.init(std.heap.page_allocator);	1906	var map = Map.init(std.heap.page_allocator);
...	@@ -1930,7 +1930,7 @@ test "std.hash_map remove one million elements in random order" {	...	@@ -1930,7 +1930,7 @@ test "std.hash_map remove one million elements in random order" {
1930	}	1930	}
1931	}	1931	}
1932		1932
1933	test "std.hash_map put" {	1933	test "put" {
1934	var map = AutoHashMap(u32, u32).init(std.testing.allocator);	1934	var map = AutoHashMap(u32, u32).init(std.testing.allocator);
1935	defer map.deinit();	1935	defer map.deinit();
1936		1936
...	@@ -1955,7 +1955,7 @@ test "std.hash_map put" {	...	@@ -1955,7 +1955,7 @@ test "std.hash_map put" {
1955	}	1955	}
1956	}	1956	}
1957		1957
1958	test "std.hash_map putAssumeCapacity" {	1958	test "putAssumeCapacity" {
1959	var map = AutoHashMap(u32, u32).init(std.testing.allocator);	1959	var map = AutoHashMap(u32, u32).init(std.testing.allocator);
1960	defer map.deinit();	1960	defer map.deinit();
1961		1961
...	@@ -1985,7 +1985,7 @@ test "std.hash_map putAssumeCapacity" {	...	@@ -1985,7 +1985,7 @@ test "std.hash_map putAssumeCapacity" {
1985	try expectEqual(sum, 20);	1985	try expectEqual(sum, 20);
1986	}	1986	}
1987		1987
1988	test "std.hash_map repeat putAssumeCapacity/remove" {	1988	test "repeat putAssumeCapacity/remove" {
1989	var map = AutoHashMap(u32, u32).init(std.testing.allocator);	1989	var map = AutoHashMap(u32, u32).init(std.testing.allocator);
1990	defer map.deinit();	1990	defer map.deinit();
1991		1991
...	@@ -2017,7 +2017,7 @@ test "std.hash_map repeat putAssumeCapacity/remove" {	...	@@ -2017,7 +2017,7 @@ test "std.hash_map repeat putAssumeCapacity/remove" {
2017	try expectEqual(map.unmanaged.count(), limit);	2017	try expectEqual(map.unmanaged.count(), limit);
2018	}	2018	}
2019		2019
2020	test "std.hash_map getOrPut" {	2020	test "getOrPut" {
2021	var map = AutoHashMap(u32, u32).init(std.testing.allocator);	2021	var map = AutoHashMap(u32, u32).init(std.testing.allocator);
2022	defer map.deinit();	2022	defer map.deinit();
2023		2023
...	@@ -2040,7 +2040,7 @@ test "std.hash_map getOrPut" {	...	@@ -2040,7 +2040,7 @@ test "std.hash_map getOrPut" {
2040	try expectEqual(sum, 30);	2040	try expectEqual(sum, 30);
2041	}	2041	}
2042		2042
2043	test "std.hash_map basic hash map usage" {	2043	test "basic hash map usage" {
2044	var map = AutoHashMap(i32, i32).init(std.testing.allocator);	2044	var map = AutoHashMap(i32, i32).init(std.testing.allocator);
2045	defer map.deinit();	2045	defer map.deinit();
2046		2046
...	@@ -2085,7 +2085,7 @@ test "std.hash_map basic hash map usage" {	...	@@ -2085,7 +2085,7 @@ test "std.hash_map basic hash map usage" {
2085	try testing.expect(map.remove(3) == true);	2085	try testing.expect(map.remove(3) == true);
2086	}	2086	}
2087		2087
2088	test "std.hash_map getOrPutAdapted" {	2088	test "getOrPutAdapted" {
2089	const AdaptedContext = struct {	2089	const AdaptedContext = struct {
2090	fn eql(self: @This(), adapted_key: []const u8, test_key: u64) bool {	2090	fn eql(self: @This(), adapted_key: []const u8, test_key: u64) bool {
2091	_ = self;	2091	_ = self;
...	@@ -2134,7 +2134,7 @@ test "std.hash_map getOrPutAdapted" {	...	@@ -2134,7 +2134,7 @@ test "std.hash_map getOrPutAdapted" {
2134	}	2134	}
2135	}	2135	}
2136		2136
2137	test "std.hash_map ensureUnusedCapacity" {	2137	test "ensureUnusedCapacity" {
2138	var map = AutoHashMap(u64, u64).init(testing.allocator);	2138	var map = AutoHashMap(u64, u64).init(testing.allocator);
2139	defer map.deinit();	2139	defer map.deinit();
2140		2140
...	@@ -2147,7 +2147,7 @@ test "std.hash_map ensureUnusedCapacity" {	...	@@ -2147,7 +2147,7 @@ test "std.hash_map ensureUnusedCapacity" {
2147	try testing.expectEqual(capacity, map.capacity());	2147	try testing.expectEqual(capacity, map.capacity());
2148	}	2148	}
2149		2149
2150	test "std.hash_map removeByPtr" {	2150	test "removeByPtr" {
2151	var map = AutoHashMap(i32, u64).init(testing.allocator);	2151	var map = AutoHashMap(i32, u64).init(testing.allocator);
2152	defer map.deinit();	2152	defer map.deinit();
2153		2153
...	@@ -2173,7 +2173,7 @@ test "std.hash_map removeByPtr" {	...	@@ -2173,7 +2173,7 @@ test "std.hash_map removeByPtr" {
2173	try testing.expect(map.count() == 0);	2173	try testing.expect(map.count() == 0);
2174	}	2174	}
2175		2175
2176	test "std.hash_map removeByPtr 0 sized key" {	2176	test "removeByPtr 0 sized key" {
2177	var map = AutoHashMap(u0, u64).init(testing.allocator);	2177	var map = AutoHashMap(u0, u64).init(testing.allocator);
2178	defer map.deinit();	2178	defer map.deinit();
2179		2179
...	@@ -2191,7 +2191,7 @@ test "std.hash_map removeByPtr 0 sized key" {	...	@@ -2191,7 +2191,7 @@ test "std.hash_map removeByPtr 0 sized key" {
2191	try testing.expect(map.count() == 0);	2191	try testing.expect(map.count() == 0);
2192	}	2192	}
2193		2193
2194	test "std.hash_map repeat fetchRemove" {	2194	test "repeat fetchRemove" {
2195	var map = AutoHashMapUnmanaged(u64, void){};	2195	var map = AutoHashMapUnmanaged(u64, void){};
2196	defer map.deinit(testing.allocator);	2196	defer map.deinit(testing.allocator);
2197		2197

lib/std/heap/arena_allocator.zig+2-2

...	@@ -246,7 +246,7 @@ pub const ArenaAllocator = struct {	...	@@ -246,7 +246,7 @@ pub const ArenaAllocator = struct {
246	}	246	}
247	};	247	};
248		248
249	test "ArenaAllocator (reset with preheating)" {	249	test "reset with preheating" {
250	var arena_allocator = ArenaAllocator.init(std.testing.allocator);	250	var arena_allocator = ArenaAllocator.init(std.testing.allocator);
251	defer arena_allocator.deinit();	251	defer arena_allocator.deinit();
252	// provides some variance in the allocated data	252	// provides some variance in the allocated data
...	@@ -269,7 +269,7 @@ test "ArenaAllocator (reset with preheating)" {	...	@@ -269,7 +269,7 @@ test "ArenaAllocator (reset with preheating)" {
269	}	269	}
270	}	270	}
271		271
272	test "ArenaAllocator (reset while retaining a buffer)" {	272	test "reset while retaining a buffer" {
273	var arena_allocator = ArenaAllocator.init(std.testing.allocator);	273	var arena_allocator = ArenaAllocator.init(std.testing.allocator);
274	defer arena_allocator.deinit();	274	defer arena_allocator.deinit();
275	const a = arena_allocator.allocator();	275	const a = arena_allocator.allocator();

lib/std/heap/memory_pool.zig+6-6

...	@@ -145,7 +145,7 @@ pub fn MemoryPoolExtra(comptime Item: type, comptime pool_options: Options) type	...	@@ -145,7 +145,7 @@ pub fn MemoryPoolExtra(comptime Item: type, comptime pool_options: Options) type
145	};	145	};
146	}	146	}
147		147
148	test "memory pool: basic" {	148	test "basic" {
149	var pool = MemoryPool(u32).init(std.testing.allocator);	149	var pool = MemoryPool(u32).init(std.testing.allocator);
150	defer pool.deinit();	150	defer pool.deinit();
151		151
...	@@ -165,7 +165,7 @@ test "memory pool: basic" {	...	@@ -165,7 +165,7 @@ test "memory pool: basic" {
165	try std.testing.expect(p2 == p4);	165	try std.testing.expect(p2 == p4);
166	}	166	}
167		167
168	test "memory pool: preheating (success)" {	168	test "preheating (success)" {
169	var pool = try MemoryPool(u32).initPreheated(std.testing.allocator, 4);	169	var pool = try MemoryPool(u32).initPreheated(std.testing.allocator, 4);
170	defer pool.deinit();	170	defer pool.deinit();
171		171
...	@@ -174,12 +174,12 @@ test "memory pool: preheating (success)" {	...	@@ -174,12 +174,12 @@ test "memory pool: preheating (success)" {
174	_ = try pool.create();	174	_ = try pool.create();
175	}	175	}
176		176
177	test "memory pool: preheating (failure)" {	177	test "preheating (failure)" {
178	const failer = std.testing.failing_allocator;	178	const failer = std.testing.failing_allocator;
179	try std.testing.expectError(error.OutOfMemory, MemoryPool(u32).initPreheated(failer, 5));	179	try std.testing.expectError(error.OutOfMemory, MemoryPool(u32).initPreheated(failer, 5));
180	}	180	}
181		181
182	test "memory pool: growable" {	182	test "growable" {
183	var pool = try MemoryPoolExtra(u32, .{ .growable = false }).initPreheated(std.testing.allocator, 4);	183	var pool = try MemoryPoolExtra(u32, .{ .growable = false }).initPreheated(std.testing.allocator, 4);
184	defer pool.deinit();	184	defer pool.deinit();
185		185
...	@@ -191,7 +191,7 @@ test "memory pool: growable" {	...	@@ -191,7 +191,7 @@ test "memory pool: growable" {
191	try std.testing.expectError(error.OutOfMemory, pool.create());	191	try std.testing.expectError(error.OutOfMemory, pool.create());
192	}	192	}
193		193
194	test "memory pool: greater than pointer default alignment" {	194	test "greater than pointer default alignment" {
195	const Foo = struct {	195	const Foo = struct {
196	data: u64 align(16),	196	data: u64 align(16),
197	};	197	};
...	@@ -203,7 +203,7 @@ test "memory pool: greater than pointer default alignment" {	...	@@ -203,7 +203,7 @@ test "memory pool: greater than pointer default alignment" {
203	_ = foo;	203	_ = foo;
204	}	204	}
205		205
206	test "memory pool: greater than pointer manual alignment" {	206	test "greater than pointer manual alignment" {
207	const Foo = struct {	207	const Foo = struct {
208	data: u64,	208	data: u64,
209	};	209	};

lib/std/io/Reader/test.zig+33-33

lib/std/io/buffered_reader.zig+2-2

...	@@ -53,7 +53,7 @@ pub fn bufferedReaderSize(comptime size: usize, reader: anytype) BufferedReader(	...	@@ -53,7 +53,7 @@ pub fn bufferedReaderSize(comptime size: usize, reader: anytype) BufferedReader(
53	return .{ .unbuffered_reader = reader };	53	return .{ .unbuffered_reader = reader };
54	}	54	}
55		55
56	test "io.BufferedReader OneByte" {	56	test "OneByte" {
57	const OneByteReadReader = struct {	57	const OneByteReadReader = struct {
58	str: []const u8,	58	str: []const u8,
59	curr: usize,	59	curr: usize,
...	@@ -96,7 +96,7 @@ test "io.BufferedReader OneByte" {	...	@@ -96,7 +96,7 @@ test "io.BufferedReader OneByte" {
96	fn smallBufferedReader(underlying_stream: anytype) BufferedReader(8, @TypeOf(underlying_stream)) {	96	fn smallBufferedReader(underlying_stream: anytype) BufferedReader(8, @TypeOf(underlying_stream)) {
97	return .{ .unbuffered_reader = underlying_stream };	97	return .{ .unbuffered_reader = underlying_stream };
98	}	98	}
99	test "io.BufferedReader Block" {	99	test "Block" {
100	const BlockReader = struct {	100	const BlockReader = struct {
101	block: []const u8,	101	block: []const u8,
102	reads_allowed: usize,	102	reads_allowed: usize,

lib/std/io/buffered_tee.zig+5-5

lib/std/io/counting_reader.zig+1-1

...	@@ -27,7 +27,7 @@ pub fn countingReader(reader: anytype) CountingReader(@TypeOf(reader)) {	...	@@ -27,7 +27,7 @@ pub fn countingReader(reader: anytype) CountingReader(@TypeOf(reader)) {
27	return .{ .child_reader = reader };	27	return .{ .child_reader = reader };
28	}	28	}
29		29
30	test "io.CountingReader" {	30	test CountingReader {
31	const bytes = "yay" ** 100;	31	const bytes = "yay" ** 100;
32	var fbs = io.fixedBufferStream(bytes);	32	var fbs = io.fixedBufferStream(bytes);
33		33

lib/std/io/counting_writer.zig+1-1

...	@@ -29,7 +29,7 @@ pub fn countingWriter(child_stream: anytype) CountingWriter(@TypeOf(child_stream	...	@@ -29,7 +29,7 @@ pub fn countingWriter(child_stream: anytype) CountingWriter(@TypeOf(child_stream
29	return .{ .bytes_written = 0, .child_stream = child_stream };	29	return .{ .bytes_written = 0, .child_stream = child_stream };
30	}	30	}
31		31
32	test "io.CountingWriter" {	32	test CountingWriter {
33	var counting_stream = countingWriter(std.io.null_writer);	33	var counting_stream = countingWriter(std.io.null_writer);
34	const stream = counting_stream.writer();	34	const stream = counting_stream.writer();
35		35

lib/std/io/fixed_buffer_stream.zig+4-4

lib/std/io/stream_source.zig+3-3

...	@@ -99,11 +99,11 @@ pub const StreamSource = union(enum) {	...	@@ -99,11 +99,11 @@ pub const StreamSource = union(enum) {
99	}	99	}
100	};	100	};
101		101
102	test "StreamSource (refs)" {	102	test "refs" {
103	std.testing.refAllDecls(StreamSource);	103	std.testing.refAllDecls(StreamSource);
104	}	104	}
105		105
106	test "StreamSource (mutable buffer)" {	106	test "mutable buffer" {
107	var buffer: [64]u8 = undefined;	107	var buffer: [64]u8 = undefined;
108	var source = StreamSource{ .buffer = std.io.fixedBufferStream(&buffer) };	108	var source = StreamSource{ .buffer = std.io.fixedBufferStream(&buffer) };
109		109
...	@@ -114,7 +114,7 @@ test "StreamSource (mutable buffer)" {	...	@@ -114,7 +114,7 @@ test "StreamSource (mutable buffer)" {
114	try std.testing.expectEqualStrings("Hello, World!", source.buffer.getWritten());	114	try std.testing.expectEqualStrings("Hello, World!", source.buffer.getWritten());
115	}	115	}
116		116
117	test "StreamSource (const buffer)" {	117	test "const buffer" {
118	const buffer: [64]u8 = "Hello, World!".* ++ ([1]u8{0xAA} ** 51);	118	const buffer: [64]u8 = "Hello, World!".* ++ ([1]u8{0xAA} ** 51);
119	var source = StreamSource{ .const_buffer = std.io.fixedBufferStream(&buffer) };	119	var source = StreamSource{ .const_buffer = std.io.fixedBufferStream(&buffer) };
120		120

lib/std/json/scanner_test.zig+4-4

lib/std/math.zig+1-1

...	@@ -1298,7 +1298,7 @@ pub fn log2_int_ceil(comptime T: type, x: T) Log2IntCeil(T) {	...	@@ -1298,7 +1298,7 @@ pub fn log2_int_ceil(comptime T: type, x: T) Log2IntCeil(T) {
1298	return log2_val + 1;	1298	return log2_val + 1;
1299	}	1299	}
1300		1300
1301	test "std.math.log2_int_ceil" {	1301	test log2_int_ceil {
1302	try testing.expect(log2_int_ceil(u32, 1) == 0);	1302	try testing.expect(log2_int_ceil(u32, 1) == 0);
1303	try testing.expect(log2_int_ceil(u32, 2) == 1);	1303	try testing.expect(log2_int_ceil(u32, 2) == 1);
1304	try testing.expect(log2_int_ceil(u32, 3) == 2);	1304	try testing.expect(log2_int_ceil(u32, 3) == 2);

lib/std/math/acos.zig+5-5

lib/std/math/acosh.zig+5-5

lib/std/math/asin.zig+5-5

lib/std/math/asinh.zig+5-5

lib/std/math/atan.zig+5-5

...	@@ -212,12 +212,12 @@ fn atan64(x_: f64) f64 {	...	@@ -212,12 +212,12 @@ fn atan64(x_: f64) f64 {
212	}	212	}
213	}	213	}
214		214
215	test "math.atan" {	215	test atan {
216	try expect(@as(u32, @bitCast(atan(@as(f32, 0.2)))) == @as(u32, @bitCast(atan32(0.2))));	216	try expect(@as(u32, @bitCast(atan(@as(f32, 0.2)))) == @as(u32, @bitCast(atan32(0.2))));
217	try expect(atan(@as(f64, 0.2)) == atan64(0.2));	217	try expect(atan(@as(f64, 0.2)) == atan64(0.2));
218	}	218	}
219		219
220	test "math.atan32" {	220	test atan32 {
221	const epsilon = 0.000001;	221	const epsilon = 0.000001;
222		222
223	try expect(math.approxEqAbs(f32, atan32(0.2), 0.197396, epsilon));	223	try expect(math.approxEqAbs(f32, atan32(0.2), 0.197396, epsilon));
...	@@ -227,7 +227,7 @@ test "math.atan32" {	...	@@ -227,7 +227,7 @@ test "math.atan32" {
227	try expect(math.approxEqAbs(f32, atan32(1.5), 0.982794, epsilon));	227	try expect(math.approxEqAbs(f32, atan32(1.5), 0.982794, epsilon));
228	}	228	}
229		229
230	test "math.atan64" {	230	test atan64 {
231	const epsilon = 0.000001;	231	const epsilon = 0.000001;
232		232
233	try expect(math.approxEqAbs(f64, atan64(0.2), 0.197396, epsilon));	233	try expect(math.approxEqAbs(f64, atan64(0.2), 0.197396, epsilon));
...	@@ -237,7 +237,7 @@ test "math.atan64" {	...	@@ -237,7 +237,7 @@ test "math.atan64" {
237	try expect(math.approxEqAbs(f64, atan64(1.5), 0.982794, epsilon));	237	try expect(math.approxEqAbs(f64, atan64(1.5), 0.982794, epsilon));
238	}	238	}
239		239
240	test "math.atan32.special" {	240	test "atan32.special" {
241	const epsilon = 0.000001;	241	const epsilon = 0.000001;
242		242
243	try expect(math.isPositiveZero(atan32(0.0)));	243	try expect(math.isPositiveZero(atan32(0.0)));
...	@@ -246,7 +246,7 @@ test "math.atan32.special" {	...	@@ -246,7 +246,7 @@ test "math.atan32.special" {
246	try expect(math.approxEqAbs(f32, atan32(-math.inf(f32)), -math.pi / 2.0, epsilon));	246	try expect(math.approxEqAbs(f32, atan32(-math.inf(f32)), -math.pi / 2.0, epsilon));
247	}	247	}
248		248
249	test "math.atan64.special" {	249	test "atan64.special" {
250	const epsilon = 0.000001;	250	const epsilon = 0.000001;
251		251
252	try expect(math.isPositiveZero(atan64(0.0)));	252	try expect(math.isPositiveZero(atan64(0.0)));

lib/std/math/atan2.zig+5-5

...	@@ -214,7 +214,7 @@ fn atan2_64(y: f64, x: f64) f64 {	...	@@ -214,7 +214,7 @@ fn atan2_64(y: f64, x: f64) f64 {
214	}	214	}
215	}	215	}
216		216
217	test "math.atan2" {	217	test atan2 {
218	const y32: f32 = 0.2;	218	const y32: f32 = 0.2;
219	const x32: f32 = 0.21;	219	const x32: f32 = 0.21;
220	const y64: f64 = 0.2;	220	const y64: f64 = 0.2;
...	@@ -223,7 +223,7 @@ test "math.atan2" {	...	@@ -223,7 +223,7 @@ test "math.atan2" {
223	try expect(atan2(y64, x64) == atan2_64(0.2, 0.21));	223	try expect(atan2(y64, x64) == atan2_64(0.2, 0.21));
224	}	224	}
225		225
226	test "math.atan2_32" {	226	test atan2_32 {
227	const epsilon = 0.000001;	227	const epsilon = 0.000001;
228		228
229	try expect(math.approxEqAbs(f32, atan2_32(0.0, 0.0), 0.0, epsilon));	229	try expect(math.approxEqAbs(f32, atan2_32(0.0, 0.0), 0.0, epsilon));
...	@@ -235,7 +235,7 @@ test "math.atan2_32" {	...	@@ -235,7 +235,7 @@ test "math.atan2_32" {
235	try expect(math.approxEqAbs(f32, atan2_32(0.34, 1.243), 0.267001, epsilon));	235	try expect(math.approxEqAbs(f32, atan2_32(0.34, 1.243), 0.267001, epsilon));
236	}	236	}
237		237
238	test "math.atan2_64" {	238	test atan2_64 {
239	const epsilon = 0.000001;	239	const epsilon = 0.000001;
240		240
241	try expect(math.approxEqAbs(f64, atan2_64(0.0, 0.0), 0.0, epsilon));	241	try expect(math.approxEqAbs(f64, atan2_64(0.0, 0.0), 0.0, epsilon));
...	@@ -247,7 +247,7 @@ test "math.atan2_64" {	...	@@ -247,7 +247,7 @@ test "math.atan2_64" {
247	try expect(math.approxEqAbs(f64, atan2_64(0.34, 1.243), 0.267001, epsilon));	247	try expect(math.approxEqAbs(f64, atan2_64(0.34, 1.243), 0.267001, epsilon));
248	}	248	}
249		249
250	test "math.atan2_32.special" {	250	test "atan2_32.special" {
251	const epsilon = 0.000001;	251	const epsilon = 0.000001;
252		252
253	try expect(math.isNan(atan2_32(1.0, math.nan(f32))));	253	try expect(math.isNan(atan2_32(1.0, math.nan(f32))));
...	@@ -271,7 +271,7 @@ test "math.atan2_32.special" {	...	@@ -271,7 +271,7 @@ test "math.atan2_32.special" {
271	try expect(math.approxEqAbs(f32, atan2_32(-math.inf(f32), 1.0), -math.pi / 2.0, epsilon));	271	try expect(math.approxEqAbs(f32, atan2_32(-math.inf(f32), 1.0), -math.pi / 2.0, epsilon));
272	}	272	}
273		273
274	test "math.atan2_64.special" {	274	test "atan2_64.special" {
275	const epsilon = 0.000001;	275	const epsilon = 0.000001;
276		276
277	try expect(math.isNan(atan2_64(1.0, math.nan(f64))));	277	try expect(math.isNan(atan2_64(1.0, math.nan(f64))));

lib/std/math/atanh.zig+5-5

lib/std/math/big/int_test.zig+195-195

lib/std/math/big/rational.zig+17-17

lib/std/math/cbrt.zig+5-5

lib/std/math/complex.zig+9-9

...	@@ -120,7 +120,7 @@ pub fn Complex(comptime T: type) type {	...	@@ -120,7 +120,7 @@ pub fn Complex(comptime T: type) type {
120		120
121	const epsilon = 0.0001;	121	const epsilon = 0.0001;
122		122
123	test "complex.add" {	123	test "add" {
124	const a = Complex(f32).init(5, 3);	124	const a = Complex(f32).init(5, 3);
125	const b = Complex(f32).init(2, 7);	125	const b = Complex(f32).init(2, 7);
126	const c = a.add(b);	126	const c = a.add(b);
...	@@ -128,7 +128,7 @@ test "complex.add" {	...	@@ -128,7 +128,7 @@ test "complex.add" {
128	try testing.expect(c.re == 7 and c.im == 10);	128	try testing.expect(c.re == 7 and c.im == 10);
129	}	129	}
130		130
131	test "complex.sub" {	131	test "sub" {
132	const a = Complex(f32).init(5, 3);	132	const a = Complex(f32).init(5, 3);
133	const b = Complex(f32).init(2, 7);	133	const b = Complex(f32).init(2, 7);
134	const c = a.sub(b);	134	const c = a.sub(b);
...	@@ -136,7 +136,7 @@ test "complex.sub" {	...	@@ -136,7 +136,7 @@ test "complex.sub" {
136	try testing.expect(c.re == 3 and c.im == -4);	136	try testing.expect(c.re == 3 and c.im == -4);
137	}	137	}
138		138
139	test "complex.mul" {	139	test "mul" {
140	const a = Complex(f32).init(5, 3);	140	const a = Complex(f32).init(5, 3);
141	const b = Complex(f32).init(2, 7);	141	const b = Complex(f32).init(2, 7);
142	const c = a.mul(b);	142	const c = a.mul(b);
...	@@ -144,7 +144,7 @@ test "complex.mul" {	...	@@ -144,7 +144,7 @@ test "complex.mul" {
144	try testing.expect(c.re == -11 and c.im == 41);	144	try testing.expect(c.re == -11 and c.im == 41);
145	}	145	}
146		146
147	test "complex.div" {	147	test "div" {
148	const a = Complex(f32).init(5, 3);	148	const a = Complex(f32).init(5, 3);
149	const b = Complex(f32).init(2, 7);	149	const b = Complex(f32).init(2, 7);
150	const c = a.div(b);	150	const c = a.div(b);
...	@@ -153,28 +153,28 @@ test "complex.div" {	...	@@ -153,28 +153,28 @@ test "complex.div" {
153	math.approxEqAbs(f32, c.im, @as(f32, -29) / 53, epsilon));	153	math.approxEqAbs(f32, c.im, @as(f32, -29) / 53, epsilon));
154	}	154	}
155		155
156	test "complex.conjugate" {	156	test "conjugate" {
157	const a = Complex(f32).init(5, 3);	157	const a = Complex(f32).init(5, 3);
158	const c = a.conjugate();	158	const c = a.conjugate();
159		159
160	try testing.expect(c.re == 5 and c.im == -3);	160	try testing.expect(c.re == 5 and c.im == -3);
161	}	161	}
162		162
163	test "complex.neg" {	163	test "neg" {
164	const a = Complex(f32).init(5, 3);	164	const a = Complex(f32).init(5, 3);
165	const c = a.neg();	165	const c = a.neg();
166		166
167	try testing.expect(c.re == -5 and c.im == -3);	167	try testing.expect(c.re == -5 and c.im == -3);
168	}	168	}
169		169
170	test "complex.mulbyi" {	170	test "mulbyi" {
171	const a = Complex(f32).init(5, 3);	171	const a = Complex(f32).init(5, 3);
172	const c = a.mulbyi();	172	const c = a.mulbyi();
173		173
174	try testing.expect(c.re == -3 and c.im == 5);	174	try testing.expect(c.re == -3 and c.im == 5);
175	}	175	}
176		176
177	test "complex.reciprocal" {	177	test "reciprocal" {
178	const a = Complex(f32).init(5, 3);	178	const a = Complex(f32).init(5, 3);
179	const c = a.reciprocal();	179	const c = a.reciprocal();
180		180
...	@@ -182,7 +182,7 @@ test "complex.reciprocal" {	...	@@ -182,7 +182,7 @@ test "complex.reciprocal" {
182	math.approxEqAbs(f32, c.im, @as(f32, -3) / 34, epsilon));	182	math.approxEqAbs(f32, c.im, @as(f32, -3) / 34, epsilon));
183	}	183	}
184		184
185	test "complex.magnitude" {	185	test "magnitude" {
186	const a = Complex(f32).init(5, 3);	186	const a = Complex(f32).init(5, 3);
187	const c = a.magnitude();	187	const c = a.magnitude();
188		188

lib/std/math/complex/abs.zig+1-1

...	@@ -11,7 +11,7 @@ pub fn abs(z: anytype) @TypeOf(z.re, z.im) {	...	@@ -11,7 +11,7 @@ pub fn abs(z: anytype) @TypeOf(z.re, z.im) {
11		11
12	const epsilon = 0.0001;	12	const epsilon = 0.0001;
13		13
14	test "complex.cabs" {	14	test abs {
15	const a = Complex(f32).init(5, 3);	15	const a = Complex(f32).init(5, 3);
16	const c = abs(a);	16	const c = abs(a);
17	try testing.expect(math.approxEqAbs(f32, c, 5.83095, epsilon));	17	try testing.expect(math.approxEqAbs(f32, c, 5.83095, epsilon));

lib/std/math/complex/acos.zig+1-1

...	@@ -13,7 +13,7 @@ pub fn acos(z: anytype) Complex(@TypeOf(z.re, z.im)) {	...	@@ -13,7 +13,7 @@ pub fn acos(z: anytype) Complex(@TypeOf(z.re, z.im)) {
13		13
14	const epsilon = 0.0001;	14	const epsilon = 0.0001;
15		15
16	test "complex.cacos" {	16	test acos {
17	const a = Complex(f32).init(5, 3);	17	const a = Complex(f32).init(5, 3);
18	const c = acos(a);	18	const c = acos(a);
19		19

lib/std/math/complex/acosh.zig+1-1

...	@@ -13,7 +13,7 @@ pub fn acosh(z: anytype) Complex(@TypeOf(z.re, z.im)) {	...	@@ -13,7 +13,7 @@ pub fn acosh(z: anytype) Complex(@TypeOf(z.re, z.im)) {
13		13
14	const epsilon = 0.0001;	14	const epsilon = 0.0001;
15		15
16	test "complex.cacosh" {	16	test acosh {
17	const a = Complex(f32).init(5, 3);	17	const a = Complex(f32).init(5, 3);
18	const c = acosh(a);	18	const c = acosh(a);
19		19

lib/std/math/complex/arg.zig+1-1

...	@@ -11,7 +11,7 @@ pub fn arg(z: anytype) @TypeOf(z.re, z.im) {	...	@@ -11,7 +11,7 @@ pub fn arg(z: anytype) @TypeOf(z.re, z.im) {
11		11
12	const epsilon = 0.0001;	12	const epsilon = 0.0001;
13		13
14	test "complex.carg" {	14	test arg {
15	const a = Complex(f32).init(5, 3);	15	const a = Complex(f32).init(5, 3);
16	const c = arg(a);	16	const c = arg(a);
17	try testing.expect(math.approxEqAbs(f32, c, 0.540420, epsilon));	17	try testing.expect(math.approxEqAbs(f32, c, 0.540420, epsilon));

lib/std/math/complex/asin.zig+1-1

...	@@ -19,7 +19,7 @@ pub fn asin(z: anytype) Complex(@TypeOf(z.re, z.im)) {	...	@@ -19,7 +19,7 @@ pub fn asin(z: anytype) Complex(@TypeOf(z.re, z.im)) {
19		19
20	const epsilon = 0.0001;	20	const epsilon = 0.0001;
21		21
22	test "complex.casin" {	22	test asin {
23	const a = Complex(f32).init(5, 3);	23	const a = Complex(f32).init(5, 3);
24	const c = asin(a);	24	const c = asin(a);
25		25

lib/std/math/complex/asinh.zig+1-1

...	@@ -14,7 +14,7 @@ pub fn asinh(z: anytype) Complex(@TypeOf(z.re, z.im)) {	...	@@ -14,7 +14,7 @@ pub fn asinh(z: anytype) Complex(@TypeOf(z.re, z.im)) {
14		14
15	const epsilon = 0.0001;	15	const epsilon = 0.0001;
16		16
17	test "complex.casinh" {	17	test asinh {
18	const a = Complex(f32).init(5, 3);	18	const a = Complex(f32).init(5, 3);
19	const c = asinh(a);	19	const c = asinh(a);
20		20

lib/std/math/complex/atan.zig+2-2

...	@@ -120,7 +120,7 @@ fn atan64(z: Complex(f64)) Complex(f64) {	...	@@ -120,7 +120,7 @@ fn atan64(z: Complex(f64)) Complex(f64) {
120		120
121	const epsilon = 0.0001;	121	const epsilon = 0.0001;
122		122
123	test "complex.catan32" {	123	test atan32 {
124	const a = Complex(f32).init(5, 3);	124	const a = Complex(f32).init(5, 3);
125	const c = atan(a);	125	const c = atan(a);
126		126
...	@@ -128,7 +128,7 @@ test "complex.catan32" {	...	@@ -128,7 +128,7 @@ test "complex.catan32" {
128	try testing.expect(math.approxEqAbs(f32, c.im, 0.086569, epsilon));	128	try testing.expect(math.approxEqAbs(f32, c.im, 0.086569, epsilon));
129	}	129	}
130		130
131	test "complex.catan64" {	131	test atan64 {
132	const a = Complex(f64).init(5, 3);	132	const a = Complex(f64).init(5, 3);
133	const c = atan(a);	133	const c = atan(a);
134		134

lib/std/math/complex/atanh.zig+1-1

...	@@ -14,7 +14,7 @@ pub fn atanh(z: anytype) Complex(@TypeOf(z.re, z.im)) {	...	@@ -14,7 +14,7 @@ pub fn atanh(z: anytype) Complex(@TypeOf(z.re, z.im)) {
14		14
15	const epsilon = 0.0001;	15	const epsilon = 0.0001;
16		16
17	test "complex.catanh" {	17	test atanh {
18	const a = Complex(f32).init(5, 3);	18	const a = Complex(f32).init(5, 3);
19	const c = atanh(a);	19	const c = atanh(a);
20		20

lib/std/math/complex/conj.zig+1-1

...	@@ -10,7 +10,7 @@ pub fn conj(z: anytype) Complex(@TypeOf(z.re, z.im)) {	...	@@ -10,7 +10,7 @@ pub fn conj(z: anytype) Complex(@TypeOf(z.re, z.im)) {
10	return Complex(T).init(z.re, -z.im);	10	return Complex(T).init(z.re, -z.im);
11	}	11	}
12		12
13	test "complex.conj" {	13	test conj {
14	const a = Complex(f32).init(5, 3);	14	const a = Complex(f32).init(5, 3);
15	const c = a.conjugate();	15	const c = a.conjugate();
16		16

lib/std/math/complex/cos.zig+1-1

...	@@ -13,7 +13,7 @@ pub fn cos(z: anytype) Complex(@TypeOf(z.re, z.im)) {	...	@@ -13,7 +13,7 @@ pub fn cos(z: anytype) Complex(@TypeOf(z.re, z.im)) {
13		13
14	const epsilon = 0.0001;	14	const epsilon = 0.0001;
15		15
16	test "complex.ccos" {	16	test cos {
17	const a = Complex(f32).init(5, 3);	17	const a = Complex(f32).init(5, 3);
18	const c = cos(a);	18	const c = cos(a);
19		19

lib/std/math/complex/cosh.zig+2-2

...	@@ -155,7 +155,7 @@ fn cosh64(z: Complex(f64)) Complex(f64) {	...	@@ -155,7 +155,7 @@ fn cosh64(z: Complex(f64)) Complex(f64) {
155		155
156	const epsilon = 0.0001;	156	const epsilon = 0.0001;
157		157
158	test "complex.ccosh32" {	158	test cosh32 {
159	const a = Complex(f32).init(5, 3);	159	const a = Complex(f32).init(5, 3);
160	const c = cosh(a);	160	const c = cosh(a);
161		161
...	@@ -163,7 +163,7 @@ test "complex.ccosh32" {	...	@@ -163,7 +163,7 @@ test "complex.ccosh32" {
163	try testing.expect(math.approxEqAbs(f32, c.im, 10.471557, epsilon));	163	try testing.expect(math.approxEqAbs(f32, c.im, 10.471557, epsilon));
164	}	164	}
165		165
166	test "complex.ccosh64" {	166	test cosh64 {
167	const a = Complex(f64).init(5, 3);	167	const a = Complex(f64).init(5, 3);
168	const c = cosh(a);	168	const c = cosh(a);
169		169

lib/std/math/complex/exp.zig+2-2

...	@@ -119,7 +119,7 @@ fn exp64(z: Complex(f64)) Complex(f64) {	...	@@ -119,7 +119,7 @@ fn exp64(z: Complex(f64)) Complex(f64) {
119	}	119	}
120	}	120	}
121		121
122	test "complex.cexp32" {	122	test exp32 {
123	const tolerance_f32 = @sqrt(math.floatEps(f32));	123	const tolerance_f32 = @sqrt(math.floatEps(f32));
124		124
125	{	125	{
...	@@ -139,7 +139,7 @@ test "complex.cexp32" {	...	@@ -139,7 +139,7 @@ test "complex.cexp32" {
139	}	139	}
140	}	140	}
141		141
142	test "complex.cexp64" {	142	test exp64 {
143	const tolerance_f64 = @sqrt(math.floatEps(f64));	143	const tolerance_f64 = @sqrt(math.floatEps(f64));
144		144
145	{	145	{

lib/std/math/complex/log.zig+1-1

...	@@ -15,7 +15,7 @@ pub fn log(z: anytype) Complex(@TypeOf(z.re, z.im)) {	...	@@ -15,7 +15,7 @@ pub fn log(z: anytype) Complex(@TypeOf(z.re, z.im)) {
15		15
16	const epsilon = 0.0001;	16	const epsilon = 0.0001;
17		17
18	test "complex.clog" {	18	test log {
19	const a = Complex(f32).init(5, 3);	19	const a = Complex(f32).init(5, 3);
20	const c = log(a);	20	const c = log(a);
21		21

lib/std/math/complex/pow.zig+1-1

...	@@ -11,7 +11,7 @@ pub fn pow(z: anytype, s: anytype) Complex(@TypeOf(z.re, z.im, s.re, s.im)) {	...	@@ -11,7 +11,7 @@ pub fn pow(z: anytype, s: anytype) Complex(@TypeOf(z.re, z.im, s.re, s.im)) {
11		11
12	const epsilon = 0.0001;	12	const epsilon = 0.0001;
13		13
14	test "complex.cpow" {	14	test pow {
15	const a = Complex(f32).init(5, 3);	15	const a = Complex(f32).init(5, 3);
16	const b = Complex(f32).init(2.3, -1.3);	16	const b = Complex(f32).init(2.3, -1.3);
17	const c = pow(a, b);	17	const c = pow(a, b);

lib/std/math/complex/proj.zig+1-3

...	@@ -15,9 +15,7 @@ pub fn proj(z: anytype) Complex(@TypeOf(z.re, z.im)) {	...	@@ -15,9 +15,7 @@ pub fn proj(z: anytype) Complex(@TypeOf(z.re, z.im)) {
15	return Complex(T).init(z.re, z.im);	15	return Complex(T).init(z.re, z.im);
16	}	16	}
17		17
18	const epsilon = 0.0001;	18	test proj {
19
20	test "complex.cproj" {
21	const a = Complex(f32).init(5, 3);	19	const a = Complex(f32).init(5, 3);
22	const c = proj(a);	20	const c = proj(a);
23		21

lib/std/math/complex/sin.zig+1-1

...	@@ -14,7 +14,7 @@ pub fn sin(z: anytype) Complex(@TypeOf(z.re, z.im)) {	...	@@ -14,7 +14,7 @@ pub fn sin(z: anytype) Complex(@TypeOf(z.re, z.im)) {
14		14
15	const epsilon = 0.0001;	15	const epsilon = 0.0001;
16		16
17	test "complex.csin" {	17	test sin {
18	const a = Complex(f32).init(5, 3);	18	const a = Complex(f32).init(5, 3);
19	const c = sin(a);	19	const c = sin(a);
20		20

lib/std/math/complex/sinh.zig+2-2

...	@@ -154,7 +154,7 @@ fn sinh64(z: Complex(f64)) Complex(f64) {	...	@@ -154,7 +154,7 @@ fn sinh64(z: Complex(f64)) Complex(f64) {
154		154
155	const epsilon = 0.0001;	155	const epsilon = 0.0001;
156		156
157	test "complex.csinh32" {	157	test sinh32 {
158	const a = Complex(f32).init(5, 3);	158	const a = Complex(f32).init(5, 3);
159	const c = sinh(a);	159	const c = sinh(a);
160		160
...	@@ -162,7 +162,7 @@ test "complex.csinh32" {	...	@@ -162,7 +162,7 @@ test "complex.csinh32" {
162	try testing.expect(math.approxEqAbs(f32, c.im, 10.472508, epsilon));	162	try testing.expect(math.approxEqAbs(f32, c.im, 10.472508, epsilon));
163	}	163	}
164		164
165	test "complex.csinh64" {	165	test sinh64 {
166	const a = Complex(f64).init(5, 3);	166	const a = Complex(f64).init(5, 3);
167	const c = sinh(a);	167	const c = sinh(a);
168		168

lib/std/math/complex/sqrt.zig+2-2

...	@@ -129,7 +129,7 @@ fn sqrt64(z: Complex(f64)) Complex(f64) {	...	@@ -129,7 +129,7 @@ fn sqrt64(z: Complex(f64)) Complex(f64) {
129		129
130	const epsilon = 0.0001;	130	const epsilon = 0.0001;
131		131
132	test "complex.csqrt32" {	132	test sqrt32 {
133	const a = Complex(f32).init(5, 3);	133	const a = Complex(f32).init(5, 3);
134	const c = sqrt(a);	134	const c = sqrt(a);
135		135
...	@@ -137,7 +137,7 @@ test "complex.csqrt32" {	...	@@ -137,7 +137,7 @@ test "complex.csqrt32" {
137	try testing.expect(math.approxEqAbs(f32, c.im, 0.644574, epsilon));	137	try testing.expect(math.approxEqAbs(f32, c.im, 0.644574, epsilon));
138	}	138	}
139		139
140	test "complex.csqrt64" {	140	test sqrt64 {
141	const a = Complex(f64).init(5, 3);	141	const a = Complex(f64).init(5, 3);
142	const c = sqrt(a);	142	const c = sqrt(a);
143		143

lib/std/math/complex/tan.zig+1-1

...	@@ -14,7 +14,7 @@ pub fn tan(z: anytype) Complex(@TypeOf(z.re, z.im)) {	...	@@ -14,7 +14,7 @@ pub fn tan(z: anytype) Complex(@TypeOf(z.re, z.im)) {
14		14
15	const epsilon = 0.0001;	15	const epsilon = 0.0001;
16		16
17	test "complex.ctan" {	17	test tan {
18	const a = Complex(f32).init(5, 3);	18	const a = Complex(f32).init(5, 3);
19	const c = tan(a);	19	const c = tan(a);
20		20

lib/std/math/complex/tanh.zig+2-2

...	@@ -103,7 +103,7 @@ fn tanh64(z: Complex(f64)) Complex(f64) {	...	@@ -103,7 +103,7 @@ fn tanh64(z: Complex(f64)) Complex(f64) {
103		103
104	const epsilon = 0.0001;	104	const epsilon = 0.0001;
105		105
106	test "complex.ctanh32" {	106	test tanh32 {
107	const a = Complex(f32).init(5, 3);	107	const a = Complex(f32).init(5, 3);
108	const c = tanh(a);	108	const c = tanh(a);
109		109
...	@@ -111,7 +111,7 @@ test "complex.ctanh32" {	...	@@ -111,7 +111,7 @@ test "complex.ctanh32" {
111	try testing.expect(math.approxEqAbs(f32, c.im, -0.000025, epsilon));	111	try testing.expect(math.approxEqAbs(f32, c.im, -0.000025, epsilon));
112	}	112	}
113		113
114	test "complex.ctanh64" {	114	test tanh64 {
115	const a = Complex(f64).init(5, 3);	115	const a = Complex(f64).init(5, 3);
116	const c = tanh(a);	116	const c = tanh(a);
117		117

lib/std/math/copysign.zig+1-1

...	@@ -12,7 +12,7 @@ pub fn copysign(magnitude: anytype, sign: @TypeOf(magnitude)) @TypeOf(magnitude)	...	@@ -12,7 +12,7 @@ pub fn copysign(magnitude: anytype, sign: @TypeOf(magnitude)) @TypeOf(magnitude)
12	return @as(T, @bitCast(mag \| sgn));	12	return @as(T, @bitCast(mag \| sgn));
13	}	13	}
14		14
15	test "math.copysign" {	15	test copysign {
16	inline for ([_]type{ f16, f32, f64, f80, f128 }) \|T\| {	16	inline for ([_]type{ f16, f32, f64, f80, f128 }) \|T\| {
17	try expect(copysign(@as(T, 1.0), @as(T, 1.0)) == 1.0);	17	try expect(copysign(@as(T, 1.0), @as(T, 1.0)) == 1.0);
18	try expect(copysign(@as(T, 2.0), @as(T, -2.0)) == -2.0);	18	try expect(copysign(@as(T, 2.0), @as(T, -2.0)) == -2.0);

lib/std/math/cosh.zig+5-5

lib/std/math/expm1.zig+5-5

lib/std/math/float.zig+3-3

lib/std/math/gamma.zig+4-4

lib/std/math/hypot.zig+5-5

lib/std/math/isfinite.zig+1-1

...	@@ -10,7 +10,7 @@ pub fn isFinite(x: anytype) bool {	...	@@ -10,7 +10,7 @@ pub fn isFinite(x: anytype) bool {
10	return @as(TBits, @bitCast(x)) & remove_sign < @as(TBits, @bitCast(math.inf(T)));	10	return @as(TBits, @bitCast(x)) & remove_sign < @as(TBits, @bitCast(math.inf(T)));
11	}	11	}
12		12
13	test "math.isFinite" {	13	test isFinite {
14	inline for ([_]type{ f16, f32, f64, f80, f128 }) \|T\| {	14	inline for ([_]type{ f16, f32, f64, f80, f128 }) \|T\| {
15	// normals	15	// normals
16	try expect(isFinite(@as(T, 1.0)));	16	try expect(isFinite(@as(T, 1.0)));

lib/std/math/isinf.zig+3-3

lib/std/math/isnan.zig+2-2

...	@@ -17,7 +17,7 @@ pub fn isSignalNan(x: anytype) bool {	...	@@ -17,7 +17,7 @@ pub fn isSignalNan(x: anytype) bool {
17	return isNan(x) and (@as(U, @bitCast(x)) & quiet_signal_bit_mask == 0);	17	return isNan(x) and (@as(U, @bitCast(x)) & quiet_signal_bit_mask == 0);
18	}	18	}
19		19
20	test "math.isNan" {	20	test isNan {
21	inline for ([_]type{ f16, f32, f64, f80, f128, c_longdouble }) \|T\| {	21	inline for ([_]type{ f16, f32, f64, f80, f128, c_longdouble }) \|T\| {
22	try expect(isNan(math.nan(T)));	22	try expect(isNan(math.nan(T)));
23	try expect(isNan(-math.nan(T)));	23	try expect(isNan(-math.nan(T)));
...	@@ -27,7 +27,7 @@ test "math.isNan" {	...	@@ -27,7 +27,7 @@ test "math.isNan" {
27	}	27	}
28	}	28	}
29		29
30	test "math.isSignalNan" {	30	test isSignalNan {
31	inline for ([_]type{ f16, f32, f64, f80, f128, c_longdouble }) \|T\| {	31	inline for ([_]type{ f16, f32, f64, f80, f128, c_longdouble }) \|T\| {
32	// TODO: Signalling NaN values get converted to quiet NaN values in	32	// TODO: Signalling NaN values get converted to quiet NaN values in
33	// some cases where they shouldn't such that this can fail.	33	// some cases where they shouldn't such that this can fail.

lib/std/math/isnormal.zig+1-1

...	@@ -19,7 +19,7 @@ pub fn isNormal(x: anytype) bool {	...	@@ -19,7 +19,7 @@ pub fn isNormal(x: anytype) bool {
19	return value & remove_sign >= (increment_exp << 1);	19	return value & remove_sign >= (increment_exp << 1);
20	}	20	}
21		21
22	test "math.isNormal" {	22	test isNormal {
23	// TODO add `c_longdouble' when math.inf(T) supports it	23	// TODO add `c_longdouble' when math.inf(T) supports it
24	inline for ([_]type{ f16, f32, f64, f80, f128 }) \|T\| {	24	inline for ([_]type{ f16, f32, f64, f80, f128 }) \|T\| {
25	const TBits = std.meta.Int(.unsigned, @bitSizeOf(T));	25	const TBits = std.meta.Int(.unsigned, @bitSizeOf(T));

lib/std/math/ldexp.zig+1-1

...	@@ -66,7 +66,7 @@ pub fn ldexp(x: anytype, n: i32) @TypeOf(x) {	...	@@ -66,7 +66,7 @@ pub fn ldexp(x: anytype, n: i32) @TypeOf(x) {
66	}	66	}
67	}	67	}
68		68
69	test "math.ldexp" {	69	test ldexp {
70	// subnormals	70	// subnormals
71	try expect(ldexp(@as(f16, 0x1.1FFp14), -14 - 9 - 15) == math.floatTrueMin(f16));	71	try expect(ldexp(@as(f16, 0x1.1FFp14), -14 - 9 - 15) == math.floatTrueMin(f16));
72	try expect(ldexp(@as(f32, 0x1.3FFFFFp-1), -126 - 22) == math.floatTrueMin(f32));	72	try expect(ldexp(@as(f32, 0x1.3FFFFFp-1), -126 - 22) == math.floatTrueMin(f32));

lib/std/math/log.zig+3-3

lib/std/math/log1p.zig+5-5

lib/std/math/log2.zig+1-1

...	@@ -42,7 +42,7 @@ pub fn log2(x: anytype) @TypeOf(x) {	...	@@ -42,7 +42,7 @@ pub fn log2(x: anytype) @TypeOf(x) {
42	}	42	}
43	}	43	}
44		44
45	test "log2" {	45	test log2 {
46	// https://github.com/ziglang/zig/issues/13703	46	// https://github.com/ziglang/zig/issues/13703
47	if (builtin.cpu.arch == .aarch64 and builtin.os.tag == .windows) return error.SkipZigTest;	47	if (builtin.cpu.arch == .aarch64 and builtin.os.tag == .windows) return error.SkipZigTest;
48		48

lib/std/math/log_int.zig+4-4

...	@@ -60,7 +60,7 @@ pub fn log_int(comptime T: type, base: T, x: T) Log2Int(T) {	...	@@ -60,7 +60,7 @@ pub fn log_int(comptime T: type, base: T, x: T) Log2Int(T) {
60	return exponent;	60	return exponent;
61	}	61	}
62		62
63	test "math.log_int" {	63	test "log_int" {
64	// Test all unsigned integers with 2, 3, ..., 64 bits.	64	// Test all unsigned integers with 2, 3, ..., 64 bits.
65	// We cannot test 0 or 1 bits since base must be > 1.	65	// We cannot test 0 or 1 bits since base must be > 1.
66	inline for (2..64 + 1) \|bits\| {	66	inline for (2..64 + 1) \|bits\| {
...	@@ -92,7 +92,7 @@ test "math.log_int" {	...	@@ -92,7 +92,7 @@ test "math.log_int" {
92	}	92	}
93	}	93	}
94		94
95	test "math.log_int vs math.log2" {	95	test "log_int vs math.log2" {
96	const types = [_]type{ u2, u3, u4, u8, u16 };	96	const types = [_]type{ u2, u3, u4, u8, u16 };
97	inline for (types) \|T\| {	97	inline for (types) \|T\| {
98	var n: T = 0;	98	var n: T = 0;
...	@@ -105,7 +105,7 @@ test "math.log_int vs math.log2" {	...	@@ -105,7 +105,7 @@ test "math.log_int vs math.log2" {
105	}	105	}
106	}	106	}
107		107
108	test "math.log_int vs math.log10" {	108	test "log_int vs math.log10" {
109	const types = [_]type{ u4, u5, u6, u8, u16 };	109	const types = [_]type{ u4, u5, u6, u8, u16 };
110	inline for (types) \|T\| {	110	inline for (types) \|T\| {
111	var n: T = 0;	111	var n: T = 0;
...	@@ -118,7 +118,7 @@ test "math.log_int vs math.log10" {	...	@@ -118,7 +118,7 @@ test "math.log_int vs math.log10" {
118	}	118	}
119	}	119	}
120		120
121	test "math.log_int at comptime" {	121	test "log_int at comptime" {
122	const x = 59049; // 9 ** 5;	122	const x = 59049; // 9 ** 5;
123	comptime {	123	comptime {
124	if (math.log_int(comptime_int, 9, x) != 5) {	124	if (math.log_int(comptime_int, 9, x) != 5) {

lib/std/math/modf.zig+5-5

...	@@ -123,14 +123,14 @@ fn modf64(x: f64) modf64_result {	...	@@ -123,14 +123,14 @@ fn modf64(x: f64) modf64_result {
123	return result;	123	return result;
124	}	124	}
125		125
126	test "math.modf" {	126	test modf {
127	const a = modf(@as(f32, 1.0));	127	const a = modf(@as(f32, 1.0));
128	const b = modf32(1.0);	128	const b = modf32(1.0);
129	// NOTE: No struct comparison on generic return type function? non-named, makes sense, but still.	129	// NOTE: No struct comparison on generic return type function? non-named, makes sense, but still.
130	try expectEqual(a, b);	130	try expectEqual(a, b);
131	}	131	}
132		132
133	test "math.modf32" {	133	test modf32 {
134	const epsilon = 0.000001;	134	const epsilon = 0.000001;
135	var r: modf32_result = undefined;	135	var r: modf32_result = undefined;
136		136
...	@@ -155,7 +155,7 @@ test "math.modf32" {	...	@@ -155,7 +155,7 @@ test "math.modf32" {
155	try expect(math.approxEqAbs(f32, r.fpart, 0.340820, epsilon));	155	try expect(math.approxEqAbs(f32, r.fpart, 0.340820, epsilon));
156	}	156	}
157		157
158	test "math.modf64" {	158	test modf64 {
159	const epsilon = 0.000001;	159	const epsilon = 0.000001;
160	var r: modf64_result = undefined;	160	var r: modf64_result = undefined;
161		161
...	@@ -180,7 +180,7 @@ test "math.modf64" {	...	@@ -180,7 +180,7 @@ test "math.modf64" {
180	try expect(math.approxEqAbs(f64, r.fpart, 0.340780, epsilon));	180	try expect(math.approxEqAbs(f64, r.fpart, 0.340780, epsilon));
181	}	181	}
182		182
183	test "math.modf32.special" {	183	test "modf32.special" {
184	var r: modf32_result = undefined;	184	var r: modf32_result = undefined;
185		185
186	r = modf32(math.inf(f32));	186	r = modf32(math.inf(f32));
...	@@ -193,7 +193,7 @@ test "math.modf32.special" {	...	@@ -193,7 +193,7 @@ test "math.modf32.special" {
193	try expect(math.isNan(r.ipart) and math.isNan(r.fpart));	193	try expect(math.isNan(r.ipart) and math.isNan(r.fpart));
194	}	194	}
195		195
196	test "math.modf64.special" {	196	test "modf64.special" {
197	var r: modf64_result = undefined;	197	var r: modf64_result = undefined;
198		198
199	r = modf64(math.inf(f64));	199	r = modf64(math.inf(f64));

lib/std/math/nextafter.zig+2-2

...	@@ -101,7 +101,7 @@ fn nextAfterFloat(comptime T: type, x: T, y: T) T {	...	@@ -101,7 +101,7 @@ fn nextAfterFloat(comptime T: type, x: T, y: T) T {
101	}	101	}
102	}	102	}
103		103
104	test "math.nextAfter.int" {	104	test "int" {
105	try expect(nextAfter(i0, 0, 0) == 0);	105	try expect(nextAfter(i0, 0, 0) == 0);
106	try expect(nextAfter(u0, 0, 0) == 0);	106	try expect(nextAfter(u0, 0, 0) == 0);
107	try expect(nextAfter(i1, 0, 0) == 0);	107	try expect(nextAfter(i1, 0, 0) == 0);
...	@@ -143,7 +143,7 @@ test "math.nextAfter.int" {	...	@@ -143,7 +143,7 @@ test "math.nextAfter.int" {
143	}	143	}
144	}	144	}
145		145
146	test "math.nextAfter.float" {	146	test "float" {
147	@setEvalBranchQuota(2000);	147	@setEvalBranchQuota(2000);
148		148
149	// normal -> normal	149	// normal -> normal

lib/std/math/pow.zig+4-4

lib/std/math/powi.zig+3-3

lib/std/math/scalbn.zig+1-1

...	@@ -6,7 +6,7 @@ const expect = std.testing.expect;	...	@@ -6,7 +6,7 @@ const expect = std.testing.expect;
6	/// Zig only supports binary base IEEE-754 floats. Hence FLT_RADIX=2, and this is an alias for ldexp.	6	/// Zig only supports binary base IEEE-754 floats. Hence FLT_RADIX=2, and this is an alias for ldexp.
7	pub const scalbn = @import("ldexp.zig").ldexp;	7	pub const scalbn = @import("ldexp.zig").ldexp;
8		8
9	test "math.scalbn" {	9	test scalbn {
10	// Verify we are using base 2.	10	// Verify we are using base 2.
11	try expect(scalbn(@as(f16, 1.5), 4) == 24.0);	11	try expect(scalbn(@as(f16, 1.5), 4) == 24.0);
12	try expect(scalbn(@as(f32, 1.5), 4) == 24.0);	12	try expect(scalbn(@as(f32, 1.5), 4) == 24.0);

lib/std/math/signbit.zig+1-1

...	@@ -9,7 +9,7 @@ pub fn signbit(x: anytype) bool {	...	@@ -9,7 +9,7 @@ pub fn signbit(x: anytype) bool {
9	return @as(TBits, @bitCast(x)) >> (@bitSizeOf(T) - 1) != 0;	9	return @as(TBits, @bitCast(x)) >> (@bitSizeOf(T) - 1) != 0;
10	}	10	}
11		11
12	test "math.signbit" {	12	test signbit {
13	inline for ([_]type{ f16, f32, f64, f80, f128 }) \|T\| {	13	inline for ([_]type{ f16, f32, f64, f80, f128 }) \|T\| {
14	try expect(!signbit(@as(T, 0.0)));	14	try expect(!signbit(@as(T, 0.0)));
15	try expect(!signbit(@as(T, 1.0)));	15	try expect(!signbit(@as(T, 1.0)));

lib/std/math/sinh.zig+5-5

lib/std/math/sqrt.zig+1-1

...	@@ -61,7 +61,7 @@ fn sqrt_int(comptime T: type, value: T) Sqrt(T) {	...	@@ -61,7 +61,7 @@ fn sqrt_int(comptime T: type, value: T) Sqrt(T) {
61	}	61	}
62	}	62	}
63		63
64	test "math.sqrt_int" {	64	test sqrt_int {
65	try expect(sqrt_int(u32, 3) == 1);	65	try expect(sqrt_int(u32, 3) == 1);
66	try expect(sqrt_int(u32, 4) == 2);	66	try expect(sqrt_int(u32, 4) == 2);
67	try expect(sqrt_int(u32, 5) == 2);	67	try expect(sqrt_int(u32, 5) == 2);

lib/std/math/tanh.zig+5-5

lib/std/meta.zig+26-26

...	@@ -46,7 +46,7 @@ pub fn stringToEnum(comptime T: type, str: []const u8) ?T {	...	@@ -46,7 +46,7 @@ pub fn stringToEnum(comptime T: type, str: []const u8) ?T {
46	}	46	}
47	}	47	}
48		48
49	test "std.meta.stringToEnum" {	49	test stringToEnum {
50	const E1 = enum {	50	const E1 = enum {
51	A,	51	A,
52	B,	52	B,
...	@@ -73,7 +73,7 @@ pub fn alignment(comptime T: type) comptime_int {	...	@@ -73,7 +73,7 @@ pub fn alignment(comptime T: type) comptime_int {
73	};	73	};
74	}	74	}
75		75
76	test "std.meta.alignment" {	76	test alignment {
77	try testing.expect(alignment(u8) == 1);	77	try testing.expect(alignment(u8) == 1);
78	try testing.expect(alignment(*align(1) u8) == 1);	78	try testing.expect(alignment(*align(1) u8) == 1);
79	try testing.expect(alignment(*align(2) u8) == 2);	79	try testing.expect(alignment(*align(2) u8) == 2);
...	@@ -94,7 +94,7 @@ pub fn Child(comptime T: type) type {	...	@@ -94,7 +94,7 @@ pub fn Child(comptime T: type) type {
94	};	94	};
95	}	95	}
96		96
97	test "std.meta.Child" {	97	test Child {
98	try testing.expect(Child([1]u8) == u8);	98	try testing.expect(Child([1]u8) == u8);
99	try testing.expect(Child(*u8) == u8);	99	try testing.expect(Child(*u8) == u8);
100	try testing.expect(Child([]u8) == u8);	100	try testing.expect(Child([]u8) == u8);
...	@@ -121,7 +121,7 @@ pub fn Elem(comptime T: type) type {	...	@@ -121,7 +121,7 @@ pub fn Elem(comptime T: type) type {
121	@compileError("Expected pointer, slice, array or vector type, found '" ++ @typeName(T) ++ "'");	121	@compileError("Expected pointer, slice, array or vector type, found '" ++ @typeName(T) ++ "'");
122	}	122	}
123		123
124	test "std.meta.Elem" {	124	test Elem {
125	try testing.expect(Elem([1]u8) == u8);	125	try testing.expect(Elem([1]u8) == u8);
126	try testing.expect(Elem([*]u8) == u8);	126	try testing.expect(Elem([*]u8) == u8);
127	try testing.expect(Elem([]u8) == u8);	127	try testing.expect(Elem([]u8) == u8);
...	@@ -255,7 +255,7 @@ pub fn containerLayout(comptime T: type) Type.ContainerLayout {	...	@@ -255,7 +255,7 @@ pub fn containerLayout(comptime T: type) Type.ContainerLayout {
255	};	255	};
256	}	256	}
257		257
258	test "std.meta.containerLayout" {	258	test containerLayout {
259	const S1 = struct {};	259	const S1 = struct {};
260	const S2 = packed struct {};	260	const S2 = packed struct {};
261	const S3 = extern struct {};	261	const S3 = extern struct {};
...	@@ -289,7 +289,7 @@ pub fn declarations(comptime T: type) []const Type.Declaration {	...	@@ -289,7 +289,7 @@ pub fn declarations(comptime T: type) []const Type.Declaration {
289	};	289	};
290	}	290	}
291		291
292	test "std.meta.declarations" {	292	test declarations {
293	const E1 = enum {	293	const E1 = enum {
294	A,	294	A,
295		295
...	@@ -329,7 +329,7 @@ pub fn declarationInfo(comptime T: type, comptime decl_name: []const u8) Type.De	...	@@ -329,7 +329,7 @@ pub fn declarationInfo(comptime T: type, comptime decl_name: []const u8) Type.De
329	@compileError("'" ++ @typeName(T) ++ "' has no declaration '" ++ decl_name ++ "'");	329	@compileError("'" ++ @typeName(T) ++ "' has no declaration '" ++ decl_name ++ "'");
330	}	330	}
331		331
332	test "std.meta.declarationInfo" {	332	test declarationInfo {
333	const E1 = enum {	333	const E1 = enum {
334	A,	334	A,
335		335
...	@@ -370,7 +370,7 @@ pub fn fields(comptime T: type) switch (@typeInfo(T)) {	...	@@ -370,7 +370,7 @@ pub fn fields(comptime T: type) switch (@typeInfo(T)) {
370	};	370	};
371	}	371	}
372		372
373	test "std.meta.fields" {	373	test fields {
374	const E1 = enum {	374	const E1 = enum {
375	A,	375	A,
376	};	376	};
...	@@ -409,7 +409,7 @@ pub fn fieldInfo(comptime T: type, comptime field: FieldEnum(T)) switch (@typeIn	...	@@ -409,7 +409,7 @@ pub fn fieldInfo(comptime T: type, comptime field: FieldEnum(T)) switch (@typeIn
409	return fields(T)[@intFromEnum(field)];	409	return fields(T)[@intFromEnum(field)];
410	}	410	}
411		411
412	test "std.meta.fieldInfo" {	412	test fieldInfo {
413	const E1 = enum {	413	const E1 = enum {
414	A,	414	A,
415	};	415	};
...	@@ -442,7 +442,7 @@ pub fn FieldType(comptime T: type, comptime field: FieldEnum(T)) type {	...	@@ -442,7 +442,7 @@ pub fn FieldType(comptime T: type, comptime field: FieldEnum(T)) type {
442	return fieldInfo(T, field).type;	442	return fieldInfo(T, field).type;
443	}	443	}
444		444
445	test "std.meta.FieldType" {	445	test FieldType {
446	const S = struct {	446	const S = struct {
447	a: u8,	447	a: u8,
448	b: u16,	448	b: u16,
...	@@ -470,7 +470,7 @@ pub fn fieldNames(comptime T: type) *const [fields(T).len][:0]const u8 {	...	@@ -470,7 +470,7 @@ pub fn fieldNames(comptime T: type) *const [fields(T).len][:0]const u8 {
470	};	470	};
471	}	471	}
472		472
473	test "std.meta.fieldNames" {	473	test fieldNames {
474	const E1 = enum { A, B };	474	const E1 = enum { A, B };
475	const E2 = error{A};	475	const E2 = error{A};
476	const S1 = struct {	476	const S1 = struct {
...	@@ -511,7 +511,7 @@ pub fn tags(comptime T: type) *const [fields(T).len]T {	...	@@ -511,7 +511,7 @@ pub fn tags(comptime T: type) *const [fields(T).len]T {
511	};	511	};
512	}	512	}
513		513
514	test "std.meta.tags" {	514	test tags {
515	const E1 = enum { A, B };	515	const E1 = enum { A, B };
516	const E2 = error{A};	516	const E2 = error{A};
517		517
...	@@ -604,7 +604,7 @@ fn expectEqualEnum(expected: anytype, actual: @TypeOf(expected)) !void {	...	@@ -604,7 +604,7 @@ fn expectEqualEnum(expected: anytype, actual: @TypeOf(expected)) !void {
604	);	604	);
605	}	605	}
606		606
607	test "std.meta.FieldEnum" {	607	test FieldEnum {
608	try expectEqualEnum(enum {}, FieldEnum(struct {}));	608	try expectEqualEnum(enum {}, FieldEnum(struct {}));
609	try expectEqualEnum(enum { a }, FieldEnum(struct { a: u8 }));	609	try expectEqualEnum(enum { a }, FieldEnum(struct { a: u8 }));
610	try expectEqualEnum(enum { a, b, c }, FieldEnum(struct { a: u8, b: void, c: f32 }));	610	try expectEqualEnum(enum { a, b, c }, FieldEnum(struct { a: u8, b: void, c: f32 }));
...	@@ -639,7 +639,7 @@ pub fn DeclEnum(comptime T: type) type {	...	@@ -639,7 +639,7 @@ pub fn DeclEnum(comptime T: type) type {
639	});	639	});
640	}	640	}
641		641
642	test "std.meta.DeclEnum" {	642	test DeclEnum {
643	const A = struct {	643	const A = struct {
644	pub const a: u8 = 0;	644	pub const a: u8 = 0;
645	};	645	};
...	@@ -670,7 +670,7 @@ pub fn Tag(comptime T: type) type {	...	@@ -670,7 +670,7 @@ pub fn Tag(comptime T: type) type {
670	};	670	};
671	}	671	}
672		672
673	test "std.meta.Tag" {	673	test Tag {
674	const E = enum(u8) {	674	const E = enum(u8) {
675	C = 33,	675	C = 33,
676	D,	676	D,
...	@@ -690,7 +690,7 @@ pub fn activeTag(u: anytype) Tag(@TypeOf(u)) {	...	@@ -690,7 +690,7 @@ pub fn activeTag(u: anytype) Tag(@TypeOf(u)) {
690	return @as(Tag(T), u);	690	return @as(Tag(T), u);
691	}	691	}
692		692
693	test "std.meta.activeTag" {	693	test activeTag {
694	const UE = enum {	694	const UE = enum {
695	Int,	695	Int,
696	Float,	696	Float,
...	@@ -727,7 +727,7 @@ pub fn TagPayload(comptime U: type, comptime tag: Tag(U)) type {	...	@@ -727,7 +727,7 @@ pub fn TagPayload(comptime U: type, comptime tag: Tag(U)) type {
727	return TagPayloadByName(U, @tagName(tag));	727	return TagPayloadByName(U, @tagName(tag));
728	}	728	}
729		729
730	test "std.meta.TagPayload" {	730	test TagPayload {
731	const Event = union(enum) {	731	const Event = union(enum) {
732	Moved: struct {	732	Moved: struct {
733	from: i32,	733	from: i32,
...	@@ -802,7 +802,7 @@ pub fn eql(a: anytype, b: @TypeOf(a)) bool {	...	@@ -802,7 +802,7 @@ pub fn eql(a: anytype, b: @TypeOf(a)) bool {
802	}	802	}
803	}	803	}
804		804
805	test "std.meta.eql" {	805	test eql {
806	const S = struct {	806	const S = struct {
807	a: u32,	807	a: u32,
808	b: f64,	808	b: f64,
...	@@ -863,7 +863,7 @@ test "std.meta.eql" {	...	@@ -863,7 +863,7 @@ test "std.meta.eql" {
863	try testing.expect(!eql(v1, v3));	863	try testing.expect(!eql(v1, v3));
864	}	864	}
865		865
866	test "intToEnum with error return" {	866	test intToEnum {
867	const E1 = enum {	867	const E1 = enum {
868	A,	868	A,
869	};	869	};
...	@@ -965,7 +965,7 @@ pub fn Float(comptime bit_count: u8) type {	...	@@ -965,7 +965,7 @@ pub fn Float(comptime bit_count: u8) type {
965	});	965	});
966	}	966	}
967		967
968	test "std.meta.Float" {	968	test Float {
969	try testing.expectEqual(f16, Float(16));	969	try testing.expectEqual(f16, Float(16));
970	try testing.expectEqual(f32, Float(32));	970	try testing.expectEqual(f32, Float(32));
971	try testing.expectEqual(f64, Float(64));	971	try testing.expectEqual(f64, Float(64));
...	@@ -1057,7 +1057,7 @@ const TupleTester = struct {	...	@@ -1057,7 +1057,7 @@ const TupleTester = struct {
1057	}	1057	}
1058	};	1058	};
1059		1059
1060	test "ArgsTuple" {	1060	test ArgsTuple {
1061	TupleTester.assertTuple(.{}, ArgsTuple(fn () void));	1061	TupleTester.assertTuple(.{}, ArgsTuple(fn () void));
1062	TupleTester.assertTuple(.{u32}, ArgsTuple(fn (a: u32) []const u8));	1062	TupleTester.assertTuple(.{u32}, ArgsTuple(fn (a: u32) []const u8));
1063	TupleTester.assertTuple(.{ u32, f16 }, ArgsTuple(fn (a: u32, b: f16) noreturn));	1063	TupleTester.assertTuple(.{ u32, f16 }, ArgsTuple(fn (a: u32, b: f16) noreturn));
...	@@ -1065,7 +1065,7 @@ test "ArgsTuple" {	...	@@ -1065,7 +1065,7 @@ test "ArgsTuple" {
1065	TupleTester.assertTuple(.{u32}, ArgsTuple(fn (comptime a: u32) []const u8));	1065	TupleTester.assertTuple(.{u32}, ArgsTuple(fn (comptime a: u32) []const u8));
1066	}	1066	}
1067		1067
1068	test "Tuple" {	1068	test Tuple {
1069	TupleTester.assertTuple(.{}, Tuple(&[_]type{}));	1069	TupleTester.assertTuple(.{}, Tuple(&[_]type{}));
1070	TupleTester.assertTuple(.{u32}, Tuple(&[_]type{u32}));	1070	TupleTester.assertTuple(.{u32}, Tuple(&[_]type{u32}));
1071	TupleTester.assertTuple(.{ u32, f16 }, Tuple(&[_]type{ u32, f16 }));	1071	TupleTester.assertTuple(.{ u32, f16 }, Tuple(&[_]type{ u32, f16 }));
...	@@ -1103,7 +1103,7 @@ pub fn isError(error_union: anytype) bool {	...	@@ -1103,7 +1103,7 @@ pub fn isError(error_union: anytype) bool {
1103	return if (error_union) \|_\| false else \|_\| true;	1103	return if (error_union) \|_\| false else \|_\| true;
1104	}	1104	}
1105		1105
1106	test "isError" {	1106	test isError {
1107	try std.testing.expect(isError(math.divTrunc(u8, 5, 0)));	1107	try std.testing.expect(isError(math.divTrunc(u8, 5, 0)));
1108	try std.testing.expect(!isError(math.divTrunc(u8, 5, 5)));	1108	try std.testing.expect(!isError(math.divTrunc(u8, 5, 5)));
1109	}	1109	}
...	@@ -1121,7 +1121,7 @@ pub inline fn hasFn(comptime T: type, comptime name: []const u8) bool {	...	@@ -1121,7 +1121,7 @@ pub inline fn hasFn(comptime T: type, comptime name: []const u8) bool {
1121	return @typeInfo(@TypeOf(@field(T, name))) == .Fn;	1121	return @typeInfo(@TypeOf(@field(T, name))) == .Fn;
1122	}	1122	}
1123		1123
1124	test "hasFn" {	1124	test hasFn {
1125	const S1 = struct {	1125	const S1 = struct {
1126	pub fn foo() void {}	1126	pub fn foo() void {}
1127	};	1127	};
...	@@ -1149,7 +1149,7 @@ pub inline fn hasMethod(comptime T: type, comptime name: []const u8) bool {	...	@@ -1149,7 +1149,7 @@ pub inline fn hasMethod(comptime T: type, comptime name: []const u8) bool {
1149	};	1149	};
1150	}	1150	}
1151		1151
1152	test "hasMethod" {	1152	test hasMethod {
1153	try std.testing.expect(!hasMethod(u32, "foo"));	1153	try std.testing.expect(!hasMethod(u32, "foo"));
1154	try std.testing.expect(!hasMethod([]u32, "len"));	1154	try std.testing.expect(!hasMethod([]u32, "len"));
1155	try std.testing.expect(!hasMethod(struct { u32, u64 }, "len"));	1155	try std.testing.expect(!hasMethod(struct { u32, u64 }, "len"));
...	@@ -1218,7 +1218,7 @@ pub inline fn hasUniqueRepresentation(comptime T: type) bool {	...	@@ -1218,7 +1218,7 @@ pub inline fn hasUniqueRepresentation(comptime T: type) bool {
1218	};	1218	};
1219	}	1219	}
1220		1220
1221	test "hasUniqueRepresentation" {	1221	test hasUniqueRepresentation {
1222	const TestStruct1 = struct {	1222	const TestStruct1 = struct {
1223	a: u32,	1223	a: u32,
1224	b: u32,	1224	b: u32,

lib/std/os/test.zig+1-1

...	@@ -393,7 +393,7 @@ fn testThreadIdFn(thread_id: *Thread.Id) void {	...	@@ -393,7 +393,7 @@ fn testThreadIdFn(thread_id: *Thread.Id) void {
393	thread_id.* = Thread.getCurrentId();	393	thread_id.* = Thread.getCurrentId();
394	}	394	}
395		395
396	test "std.Thread.getCurrentId" {	396	test "Thread.getCurrentId" {
397	if (builtin.single_threaded) return error.SkipZigTest;	397	if (builtin.single_threaded) return error.SkipZigTest;
398		398
399	var thread_current_id: Thread.Id = undefined;	399	var thread_current_id: Thread.Id = undefined;

lib/std/priority_dequeue.zig+31-31

lib/std/priority_queue.zig+23-23

lib/std/segmented_list.zig+2-2

...	@@ -408,7 +408,7 @@ pub fn SegmentedList(comptime T: type, comptime prealloc_item_count: usize) type	...	@@ -408,7 +408,7 @@ pub fn SegmentedList(comptime T: type, comptime prealloc_item_count: usize) type
408	};	408	};
409	}	409	}
410		410
411	test "SegmentedList basic usage" {	411	test "basic usage" {
412	try testSegmentedList(0);	412	try testSegmentedList(0);
413	try testSegmentedList(1);	413	try testSegmentedList(1);
414	try testSegmentedList(2);	414	try testSegmentedList(2);
...	@@ -507,7 +507,7 @@ fn testSegmentedList(comptime prealloc: usize) !void {	...	@@ -507,7 +507,7 @@ fn testSegmentedList(comptime prealloc: usize) !void {
507	try list.setCapacity(testing.allocator, 0);	507	try list.setCapacity(testing.allocator, 0);
508	}	508	}
509		509
510	test "std.segmented_list clearRetainingCapacity" {	510	test "clearRetainingCapacity" {
511	var list = SegmentedList(i32, 1){};	511	var list = SegmentedList(i32, 1){};
512	defer list.deinit(testing.allocator);	512	defer list.deinit(testing.allocator);
513		513

lib/std/treap.zig+1-1

...	@@ -349,7 +349,7 @@ fn SliceIterRandomOrder(comptime T: type) type {	...	@@ -349,7 +349,7 @@ fn SliceIterRandomOrder(comptime T: type) type {
349	const TestTreap = Treap(u64, std.math.order);	349	const TestTreap = Treap(u64, std.math.order);
350	const TestNode = TestTreap.Node;	350	const TestNode = TestTreap.Node;
351		351
352	test "std.Treap: insert, find, replace, remove" {	352	test "insert, find, replace, remove" {
353	var treap = TestTreap{};	353	var treap = TestTreap{};
354	var nodes: [10]TestNode = undefined;	354	var nodes: [10]TestNode = undefined;
355		355

lib/std/wasm.zig+2-2

...	@@ -201,7 +201,7 @@ pub fn opcode(op: Opcode) u8 {	...	@@ -201,7 +201,7 @@ pub fn opcode(op: Opcode) u8 {
201	return @intFromEnum(op);	201	return @intFromEnum(op);
202	}	202	}
203		203
204	test "Wasm - opcodes" {	204	test "opcodes" {
205	// Ensure our opcodes values remain intact as certain values are skipped due to them being reserved	205	// Ensure our opcodes values remain intact as certain values are skipped due to them being reserved
206	const i32_const = opcode(.i32_const);	206	const i32_const = opcode(.i32_const);
207	const end = opcode(.end);	207	const end = opcode(.end);
...	@@ -625,7 +625,7 @@ pub fn reftype(value: RefType) u8 {	...	@@ -625,7 +625,7 @@ pub fn reftype(value: RefType) u8 {
625	return @intFromEnum(value);	625	return @intFromEnum(value);
626	}	626	}
627		627
628	test "Wasm - valtypes" {	628	test "valtypes" {
629	const _i32 = valtype(.i32);	629	const _i32 = valtype(.i32);
630	const _i64 = valtype(.i64);	630	const _i64 = valtype(.i64);
631	const _f32 = valtype(.f32);	631	const _f32 = valtype(.f32);

...	@@ -881,7 +881,7 @@ const PosixImpl = struct {	...	@@ -881,7 +881,7 @@ const PosixImpl = struct {
881	}	881	}
882	};	882	};
883		883
884	test "Futex - smoke test" {	884	test "smoke test" {
885	var value = atomic.Value(u32).init(0);	885	var value = atomic.Value(u32).init(0);
886		886
887	// Try waits with invalid values.	887	// Try waits with invalid values.
...	@@ -898,7 +898,7 @@ test "Futex - smoke test" {	...	@@ -898,7 +898,7 @@ test "Futex - smoke test" {
898	Futex.wake(&value, std.math.maxInt(u32));	898	Futex.wake(&value, std.math.maxInt(u32));
899	}	899	}
900		900
901	test "Futex - signaling" {	901	test "signaling" {
902	// This test requires spawning threads	902	// This test requires spawning threads
903	if (builtin.single_threaded) {	903	if (builtin.single_threaded) {
904	return error.SkipZigTest;	904	return error.SkipZigTest;
...	@@ -952,7 +952,7 @@ test "Futex - signaling" {	...	@@ -952,7 +952,7 @@ test "Futex - signaling" {
952	for (paddles) \|p\| try testing.expectEqual(p.current, num_iterations);	952	for (paddles) \|p\| try testing.expectEqual(p.current, num_iterations);
953	}	953	}
954		954
955	test "Futex - broadcasting" {	955	test "broadcasting" {
956	// This test requires spawning threads	956	// This test requires spawning threads
957	if (builtin.single_threaded) {	957	if (builtin.single_threaded) {
958	return error.SkipZigTest;	958	return error.SkipZigTest;
...	@@ -1054,7 +1054,7 @@ pub const Deadline = struct {	...	@@ -1054,7 +1054,7 @@ pub const Deadline = struct {
1054	}	1054	}
1055	};	1055	};
1056		1056
1057	test "Futex - Deadline" {	1057	test "Deadline" {
1058	var deadline = Deadline.init(100 * std.time.ns_per_ms);	1058	var deadline = Deadline.init(100 * std.time.ns_per_ms);
1059	var futex_word = atomic.Value(u32).init(0);	1059	var futex_word = atomic.Value(u32).init(0);
1060		1060

...	@@ -215,7 +215,7 @@ const FutexImpl = struct {	...	@@ -215,7 +215,7 @@ const FutexImpl = struct {
215	}	215	}
216	};	216	};
217		217
218	test "Mutex - smoke test" {	218	test "smoke test" {
219	var mutex = Mutex{};	219	var mutex = Mutex{};
220		220
221	try testing.expect(mutex.tryLock());	221	try testing.expect(mutex.tryLock());
...	@@ -243,7 +243,7 @@ const NonAtomicCounter = struct {	...	@@ -243,7 +243,7 @@ const NonAtomicCounter = struct {
243	}	243	}
244	};	244	};
245		245
246	test "Mutex - many uncontended" {	246	test "many uncontended" {
247	// This test requires spawning threads.	247	// This test requires spawning threads.
248	if (builtin.single_threaded) {	248	if (builtin.single_threaded) {
249	return error.SkipZigTest;	249	return error.SkipZigTest;
...	@@ -274,7 +274,7 @@ test "Mutex - many uncontended" {	...	@@ -274,7 +274,7 @@ test "Mutex - many uncontended" {
274	for (runners) \|r\| try testing.expectEqual(r.counter.get(), num_increments);	274	for (runners) \|r\| try testing.expectEqual(r.counter.get(), num_increments);
275	}	275	}
276		276
277	test "Mutex - many contended" {	277	test "many contended" {
278	// This test requires spawning threads.	278	// This test requires spawning threads.
279	if (builtin.single_threaded) {	279	if (builtin.single_threaded) {
280	return error.SkipZigTest;	280	return error.SkipZigTest;

...	@@ -275,12 +275,12 @@ const match_distances = [_]MatchDistance{	...	@@ -275,12 +275,12 @@ const match_distances = [_]MatchDistance{
275	.{ .extra_bits = 13, .base_scaled = 0x6000, .code = 29, .base = 24577 },	275	.{ .extra_bits = 13, .base_scaled = 0x6000, .code = 29, .base = 24577 },
276	};	276	};
277		277
278	test "flate.Token size" {	278	test "size" {
279	try expect(@sizeOf(Token) == 4);	279	try expect(@sizeOf(Token) == 4);
280	}	280	}
281		281
282	// testing table https://datatracker.ietf.org/doc/html/rfc1951#page-12	282	// testing table https://datatracker.ietf.org/doc/html/rfc1951#page-12
283	test "flate.Token MatchLength" {	283	test "MatchLength" {
284	var c = Token.initMatch(1, 4).lengthEncoding();	284	var c = Token.initMatch(1, 4).lengthEncoding();
285	try expect(c.code == 258);	285	try expect(c.code == 258);
286	try expect(c.extra_bits == 0);	286	try expect(c.extra_bits == 0);
...	@@ -302,7 +302,7 @@ test "flate.Token MatchLength" {	...	@@ -302,7 +302,7 @@ test "flate.Token MatchLength" {
302	try expect(c.extra_length == 130 - 115);	302	try expect(c.extra_length == 130 - 115);
303	}	303	}
304		304
305	test "flate.Token MatchDistance" {	305	test "MatchDistance" {
306	var c = Token.initMatch(1, 4).distanceEncoding();	306	var c = Token.initMatch(1, 4).distanceEncoding();
307	try expect(c.code == 0);	307	try expect(c.code == 0);
308	try expect(c.extra_bits == 0);	308	try expect(c.extra_bits == 0);
...	@@ -314,7 +314,7 @@ test "flate.Token MatchDistance" {	...	@@ -314,7 +314,7 @@ test "flate.Token MatchDistance" {
314	try expect(c.extra_distance == 192 - 129);	314	try expect(c.extra_distance == 192 - 129);
315	}	315	}
316		316
317	test "flate.Token match_lengths" {	317	test "match_lengths" {
318	for (match_lengths, 0..) \|ml, i\| {	318	for (match_lengths, 0..) \|ml, i\| {
319	try expect(@as(u16, ml.base_scaled) + 3 == ml.base);	319	try expect(@as(u16, ml.base_scaled) + 3 == ml.base);
320	try expect(i + 257 == ml.code);	320	try expect(i + 257 == ml.code);

...	@@ -218,7 +218,7 @@ pub fn BitReader(comptime ReaderType: type) type {	...	@@ -218,7 +218,7 @@ pub fn BitReader(comptime ReaderType: type) type {
218	};	218	};
219	}	219	}
220		220
221	test "flate.BitReader" {	221	test "BitReader" {
222	var fbs = std.io.fixedBufferStream(&[_]u8{ 0xf3, 0x48, 0xcd, 0xc9, 0x00, 0x00 });	222	var fbs = std.io.fixedBufferStream(&[_]u8{ 0xf3, 0x48, 0xcd, 0xc9, 0x00, 0x00 });
223	var br = bitReader(fbs.reader());	223	var br = bitReader(fbs.reader());
224	const F = BitReader(@TypeOf(fbs.reader())).flag;	224	const F = BitReader(@TypeOf(fbs.reader())).flag;
...	@@ -253,7 +253,7 @@ test "flate.BitReader" {	...	@@ -253,7 +253,7 @@ test "flate.BitReader" {
253	try testing.expectEqual(@as(u16, 0xc), try br.readN(4, 0));	253	try testing.expectEqual(@as(u16, 0xc), try br.readN(4, 0));
254	}	254	}
255		255
256	test "flate.BitReader read block type 1 data" {	256	test "read block type 1 data" {
257	const data = [_]u8{	257	const data = [_]u8{
258	0xf3, 0x48, 0xcd, 0xc9, 0xc9, 0x57, 0x28, 0xcf, // deflate data block type 1	258	0xf3, 0x48, 0xcd, 0xc9, 0xc9, 0x57, 0x28, 0xcf, // deflate data block type 1
259	0x2f, 0xca, 0x49, 0xe1, 0x02, 0x00,	259	0x2f, 0xca, 0x49, 0xe1, 0x02, 0x00,
...	@@ -277,7 +277,7 @@ test "flate.BitReader read block type 1 data" {	...	@@ -277,7 +277,7 @@ test "flate.BitReader read block type 1 data" {
277	try testing.expectEqual(@as(u16, 0xddcc), try br.readF(u16, 0));	277	try testing.expectEqual(@as(u16, 0xddcc), try br.readF(u16, 0));
278	}	278	}
279		279
280	test "flate.BitReader init" {	280	test "init" {
281	const data = [_]u8{	281	const data = [_]u8{
282	0x01, 0x02, 0x03, 0x04, 0x05, 0x06, 0x07, 0x08,	282	0x01, 0x02, 0x03, 0x04, 0x05, 0x06, 0x07, 0x08,
283	0x01, 0x02, 0x03, 0x04, 0x05, 0x06, 0x07, 0x08,	283	0x01, 0x02, 0x03, 0x04, 0x05, 0x06, 0x07, 0x08,
...	@@ -302,7 +302,7 @@ test "flate.BitReader init" {	...	@@ -302,7 +302,7 @@ test "flate.BitReader init" {
302	try testing.expectEqual(@as(u64, 0x00_00_00_00_00_08_07_06), br.bits);	302	try testing.expectEqual(@as(u64, 0x00_00_00_00_00_08_07_06), br.bits);
303	}	303	}
304		304
305	test "flate.BitReader readAll" {	305	test "readAll" {
306	const data = [_]u8{	306	const data = [_]u8{
307	0x01, 0x02, 0x03, 0x04, 0x05, 0x06, 0x07, 0x08,	307	0x01, 0x02, 0x03, 0x04, 0x05, 0x06, 0x07, 0x08,
308	0x01, 0x02, 0x03, 0x04, 0x05, 0x06, 0x07, 0x08,	308	0x01, 0x02, 0x03, 0x04, 0x05, 0x06, 0x07, 0x08,
...	@@ -320,7 +320,7 @@ test "flate.BitReader readAll" {	...	@@ -320,7 +320,7 @@ test "flate.BitReader readAll" {
320	try testing.expectEqualSlices(u8, data[0..16], &out);	320	try testing.expectEqualSlices(u8, data[0..16], &out);
321	}	321	}
322		322
323	test "flate.BitReader readFixedCode" {	323	test "readFixedCode" {
324	const fixed_codes = @import("huffman_encoder.zig").fixed_codes;	324	const fixed_codes = @import("huffman_encoder.zig").fixed_codes;
325		325
326	var fbs = std.io.fixedBufferStream(&fixed_codes);	326	var fbs = std.io.fixedBufferStream(&fixed_codes);

...	@@ -49,7 +49,7 @@ const testing = std.testing;	...	@@ -49,7 +49,7 @@ const testing = std.testing;
49	const expectEqualSlices = std.testing.expectEqualSlices;	49	const expectEqualSlices = std.testing.expectEqualSlices;
50	const expectError = std.testing.expectError;	50	const expectError = std.testing.expectError;
51		51
52	test "Vec2D.init" {	52	test "init" {
53	const allocator = testing.allocator;	53	const allocator = testing.allocator;
54	var vec2d = try Vec2D(i32).init(allocator, 1, .{ 2, 3 });	54	var vec2d = try Vec2D(i32).init(allocator, 1, .{ 2, 3 });
55	defer vec2d.deinit(allocator);	55	defer vec2d.deinit(allocator);
...	@@ -58,7 +58,7 @@ test "Vec2D.init" {	...	@@ -58,7 +58,7 @@ test "Vec2D.init" {
58	try expectEqualSlices(i32, &.{ 1, 1, 1 }, try vec2d.get(1));	58	try expectEqualSlices(i32, &.{ 1, 1, 1 }, try vec2d.get(1));
59	}	59	}
60		60
61	test "Vec2D.init overflow" {	61	test "init overflow" {
62	const allocator = testing.allocator;	62	const allocator = testing.allocator;
63	try expectError(	63	try expectError(
64	error.Overflow,	64	error.Overflow,
...	@@ -66,7 +66,7 @@ test "Vec2D.init overflow" {	...	@@ -66,7 +66,7 @@ test "Vec2D.init overflow" {
66	);	66	);
67	}	67	}
68		68
69	test "Vec2D.fill" {	69	test "fill" {
70	const allocator = testing.allocator;	70	const allocator = testing.allocator;
71	var vec2d = try Vec2D(i32).init(allocator, 0, .{ 2, 3 });	71	var vec2d = try Vec2D(i32).init(allocator, 0, .{ 2, 3 });
72	defer vec2d.deinit(allocator);	72	defer vec2d.deinit(allocator);
...	@@ -77,7 +77,7 @@ test "Vec2D.fill" {	...	@@ -77,7 +77,7 @@ test "Vec2D.fill" {
77	try expectEqualSlices(i32, &.{ 7, 7, 7 }, try vec2d.get(1));	77	try expectEqualSlices(i32, &.{ 7, 7, 7 }, try vec2d.get(1));
78	}	78	}
79		79
80	test "Vec2D.get" {	80	test "get" {
81	var data = [_]i32{ 0, 1, 2, 3, 4, 5, 6, 7 };	81	var data = [_]i32{ 0, 1, 2, 3, 4, 5, 6, 7 };
82	const vec2d = Vec2D(i32){	82	const vec2d = Vec2D(i32){
83	.data = &data,	83	.data = &data,
...	@@ -90,7 +90,7 @@ test "Vec2D.get" {	...	@@ -90,7 +90,7 @@ test "Vec2D.get" {
90	try expectEqualSlices(i32, &.{ 6, 7 }, try vec2d.get(3));	90	try expectEqualSlices(i32, &.{ 6, 7 }, try vec2d.get(3));
91	}	91	}
92		92
93	test "Vec2D.getMut" {	93	test "getMut" {
94	var data = [_]i32{ 0, 1, 2, 3, 4, 5, 6, 7 };	94	var data = [_]i32{ 0, 1, 2, 3, 4, 5, 6, 7 };
95	var vec2d = Vec2D(i32){	95	var vec2d = Vec2D(i32){
96	.data = &data,	96	.data = &data,
...	@@ -107,7 +107,7 @@ test "Vec2D.getMut" {	...	@@ -107,7 +107,7 @@ test "Vec2D.getMut" {
107	try expectEqualSlices(i32, &.{ 6, 7 }, try vec2d.get(3));	107	try expectEqualSlices(i32, &.{ 6, 7 }, try vec2d.get(3));
108	}	108	}
109		109
110	test "Vec2D.get multiplication overflow" {	110	test "get multiplication overflow" {
111	const allocator = testing.allocator;	111	const allocator = testing.allocator;
112	var matrix = try Vec2D(i32).init(allocator, 0, .{ 3, 4 });	112	var matrix = try Vec2D(i32).init(allocator, 0, .{ 3, 4 });
113	defer matrix.deinit(allocator);	113	defer matrix.deinit(allocator);
...	@@ -117,7 +117,7 @@ test "Vec2D.get multiplication overflow" {	...	@@ -117,7 +117,7 @@ test "Vec2D.get multiplication overflow" {
117	try expectError(error.Overflow, matrix.getMut(row));	117	try expectError(error.Overflow, matrix.getMut(row));
118	}	118	}
119		119
120	test "Vec2D.get addition overflow" {	120	test "get addition overflow" {
121	const allocator = testing.allocator;	121	const allocator = testing.allocator;
122	var matrix = try Vec2D(i32).init(allocator, 0, .{ 3, 5 });	122	var matrix = try Vec2D(i32).init(allocator, 0, .{ 3, 5 });
123	defer matrix.deinit(allocator);	123	defer matrix.deinit(allocator);

...	@@ -482,7 +482,7 @@ pub const Ed25519 = struct {	...	@@ -482,7 +482,7 @@ pub const Ed25519 = struct {
482	};	482	};
483	};	483	};
484		484
485	test "ed25519 key pair creation" {	485	test "key pair creation" {
486	var seed: [32]u8 = undefined;	486	var seed: [32]u8 = undefined;
487	_ = try fmt.hexToBytes(seed[0..], "8052030376d47112be7f73ed7a019293dd12ad910b654455798b4667d73de166");	487	_ = try fmt.hexToBytes(seed[0..], "8052030376d47112be7f73ed7a019293dd12ad910b654455798b4667d73de166");
488	const key_pair = try Ed25519.KeyPair.create(seed);	488	const key_pair = try Ed25519.KeyPair.create(seed);
...	@@ -491,7 +491,7 @@ test "ed25519 key pair creation" {	...	@@ -491,7 +491,7 @@ test "ed25519 key pair creation" {
491	try std.testing.expectEqualStrings(try std.fmt.bufPrint(&buf, "{s}", .{std.fmt.fmtSliceHexUpper(&key_pair.public_key.toBytes())}), "2D6F7455D97B4A3A10D7293909D1A4F2058CB9A370E43FA8154BB280DB839083");	491	try std.testing.expectEqualStrings(try std.fmt.bufPrint(&buf, "{s}", .{std.fmt.fmtSliceHexUpper(&key_pair.public_key.toBytes())}), "2D6F7455D97B4A3A10D7293909D1A4F2058CB9A370E43FA8154BB280DB839083");
492	}	492	}
493		493
494	test "ed25519 signature" {	494	test "signature" {
495	var seed: [32]u8 = undefined;	495	var seed: [32]u8 = undefined;
496	_ = try fmt.hexToBytes(seed[0..], "8052030376d47112be7f73ed7a019293dd12ad910b654455798b4667d73de166");	496	_ = try fmt.hexToBytes(seed[0..], "8052030376d47112be7f73ed7a019293dd12ad910b654455798b4667d73de166");
497	const key_pair = try Ed25519.KeyPair.create(seed);	497	const key_pair = try Ed25519.KeyPair.create(seed);
...	@@ -503,7 +503,7 @@ test "ed25519 signature" {	...	@@ -503,7 +503,7 @@ test "ed25519 signature" {
503	try std.testing.expectError(error.SignatureVerificationFailed, sig.verify("TEST", key_pair.public_key));	503	try std.testing.expectError(error.SignatureVerificationFailed, sig.verify("TEST", key_pair.public_key));
504	}	504	}
505		505
506	test "ed25519 batch verification" {	506	test "batch verification" {
507	var i: usize = 0;	507	var i: usize = 0;
508	while (i < 100) : (i += 1) {	508	while (i < 100) : (i += 1) {
509	const key_pair = try Ed25519.KeyPair.create(null);	509	const key_pair = try Ed25519.KeyPair.create(null);
...	@@ -532,7 +532,7 @@ test "ed25519 batch verification" {	...	@@ -532,7 +532,7 @@ test "ed25519 batch verification" {
532	}	532	}
533	}	533	}
534		534
535	test "ed25519 test vectors" {	535	test "test vectors" {
536	const Vec = struct {	536	const Vec = struct {
537	msg_hex: *const [64:0]u8,	537	msg_hex: *const [64:0]u8,
538	public_key_hex: *const [64:0]u8,	538	public_key_hex: *const [64:0]u8,
...	@@ -634,7 +634,7 @@ test "ed25519 test vectors" {	...	@@ -634,7 +634,7 @@ test "ed25519 test vectors" {
634	}	634	}
635	}	635	}
636		636
637	test "ed25519 with blind keys" {	637	test "with blind keys" {
638	const BlindKeyPair = Ed25519.key_blinding.BlindKeyPair;	638	const BlindKeyPair = Ed25519.key_blinding.BlindKeyPair;
639		639
640	// Create a standard Ed25519 key pair	640	// Create a standard Ed25519 key pair
...	@@ -657,7 +657,7 @@ test "ed25519 with blind keys" {	...	@@ -657,7 +657,7 @@ test "ed25519 with blind keys" {
657	try std.testing.expectEqualSlices(u8, &pk.toBytes(), &kp.public_key.toBytes());	657	try std.testing.expectEqualSlices(u8, &pk.toBytes(), &kp.public_key.toBytes());
658	}	658	}
659		659
660	test "ed25519 signatures with streaming" {	660	test "signatures with streaming" {
661	const kp = try Ed25519.KeyPair.create(null);	661	const kp = try Ed25519.KeyPair.create(null);
662		662
663	var signer = try kp.signer(null);	663	var signer = try kp.signer(null);
...	@@ -673,7 +673,7 @@ test "ed25519 signatures with streaming" {	...	@@ -673,7 +673,7 @@ test "ed25519 signatures with streaming" {
673	try verifier.verify();	673	try verifier.verify();
674	}	674	}
675		675
676	test "ed25519 key pair from secret key" {	676	test "key pair from secret key" {
677	const kp = try Ed25519.KeyPair.create(null);	677	const kp = try Ed25519.KeyPair.create(null);
678	const kp2 = try Ed25519.KeyPair.fromSecretKey(kp.secret_key);	678	const kp2 = try Ed25519.KeyPair.fromSecretKey(kp.secret_key);
679	try std.testing.expectEqualSlices(u8, &kp.secret_key.toBytes(), &kp2.secret_key.toBytes());	679	try std.testing.expectEqualSlices(u8, &kp.secret_key.toBytes(), &kp2.secret_key.toBytes());

...	@@ -493,7 +493,7 @@ pub const Edwards25519 = struct {	...	@@ -493,7 +493,7 @@ pub const Edwards25519 = struct {
493		493
494	const htest = @import("../test.zig");	494	const htest = @import("../test.zig");
495		495
496	test "edwards25519 packing/unpacking" {	496	test "packing/unpacking" {
497	const s = [_]u8{170} ++ [_]u8{0} ** 31;	497	const s = [_]u8{170} ++ [_]u8{0} ** 31;
498	var b = Edwards25519.basePoint;	498	var b = Edwards25519.basePoint;
499	const pk = try b.mul(s);	499	const pk = try b.mul(s);
...	@@ -529,7 +529,7 @@ test "edwards25519 packing/unpacking" {	...	@@ -529,7 +529,7 @@ test "edwards25519 packing/unpacking" {
529	}	529	}
530	}	530	}
531		531
532	test "edwards25519 point addition/subtraction" {	532	test "point addition/subtraction" {
533	var s1: [32]u8 = undefined;	533	var s1: [32]u8 = undefined;
534	var s2: [32]u8 = undefined;	534	var s2: [32]u8 = undefined;
535	crypto.random.bytes(&s1);	535	crypto.random.bytes(&s1);
...	@@ -543,7 +543,7 @@ test "edwards25519 point addition/subtraction" {	...	@@ -543,7 +543,7 @@ test "edwards25519 point addition/subtraction" {
543	try std.testing.expectError(error.IdentityElement, p.sub(q).add(q).sub(p).rejectIdentity());	543	try std.testing.expectError(error.IdentityElement, p.sub(q).add(q).sub(p).rejectIdentity());
544	}	544	}
545		545
546	test "edwards25519 uniform-to-point" {	546	test "uniform-to-point" {
547	var r = [32]u8{ 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31 };	547	var r = [32]u8{ 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31 };
548	var p = Edwards25519.fromUniform(r);	548	var p = Edwards25519.fromUniform(r);
549	try htest.assertEqual("0691eee3cf70a0056df6bfa03120635636581b5c4ea571dfc680f78c7e0b4137", p.toBytes()[0..]);	549	try htest.assertEqual("0691eee3cf70a0056df6bfa03120635636581b5c4ea571dfc680f78c7e0b4137", p.toBytes()[0..]);
...	@@ -554,7 +554,7 @@ test "edwards25519 uniform-to-point" {	...	@@ -554,7 +554,7 @@ test "edwards25519 uniform-to-point" {
554	}	554	}
555		555
556	// Test vectors from draft-irtf-cfrg-hash-to-curve-12	556	// Test vectors from draft-irtf-cfrg-hash-to-curve-12
557	test "edwards25519 hash-to-curve operation" {	557	test "hash-to-curve operation" {
558	var p = Edwards25519.fromString(true, "QUUX-V01-CS02-with-edwards25519_XMD:SHA-512_ELL2_RO_", "abc");	558	var p = Edwards25519.fromString(true, "QUUX-V01-CS02-with-edwards25519_XMD:SHA-512_ELL2_RO_", "abc");
559	try htest.assertEqual("31558a26887f23fb8218f143e69d5f0af2e7831130bd5b432ef23883b895839a", p.toBytes()[0..]);	559	try htest.assertEqual("31558a26887f23fb8218f143e69d5f0af2e7831130bd5b432ef23883b895839a", p.toBytes()[0..]);
560		560
...	@@ -562,7 +562,7 @@ test "edwards25519 hash-to-curve operation" {	...	@@ -562,7 +562,7 @@ test "edwards25519 hash-to-curve operation" {
562	try htest.assertEqual("42fa27c8f5a1ae0aa38bb59d5938e5145622ba5dedd11d11736fa2f9502d7367", p.toBytes()[0..]);	562	try htest.assertEqual("42fa27c8f5a1ae0aa38bb59d5938e5145622ba5dedd11d11736fa2f9502d7367", p.toBytes()[0..]);
563	}	563	}
564		564
565	test "edwards25519 implicit reduction of invalid scalars" {	565	test "implicit reduction of invalid scalars" {
566	const s = [_]u8{0} ** 31 ++ [_]u8{255};	566	const s = [_]u8{0} ** 31 ++ [_]u8{255};
567	const p1 = try Edwards25519.basePoint.mulPublic(s);	567	const p1 = try Edwards25519.basePoint.mulPublic(s);
568	const p2 = try Edwards25519.basePoint.mul(s);	568	const p2 = try Edwards25519.basePoint.mul(s);

...	@@ -81,7 +81,7 @@ pub const X25519 = struct {	...	@@ -81,7 +81,7 @@ pub const X25519 = struct {
81		81
82	const htest = @import("../test.zig");	82	const htest = @import("../test.zig");
83		83
84	test "x25519 public key calculation from secret key" {	84	test "public key calculation from secret key" {
85	var sk: [32]u8 = undefined;	85	var sk: [32]u8 = undefined;
86	var pk_expected: [32]u8 = undefined;	86	var pk_expected: [32]u8 = undefined;
87	_ = try fmt.hexToBytes(sk[0..], "8052030376d47112be7f73ed7a019293dd12ad910b654455798b4667d73de166");	87	_ = try fmt.hexToBytes(sk[0..], "8052030376d47112be7f73ed7a019293dd12ad910b654455798b4667d73de166");
...	@@ -90,7 +90,7 @@ test "x25519 public key calculation from secret key" {	...	@@ -90,7 +90,7 @@ test "x25519 public key calculation from secret key" {
90	try std.testing.expectEqual(pk_calculated, pk_expected);	90	try std.testing.expectEqual(pk_calculated, pk_expected);
91	}	91	}
92		92
93	test "x25519 rfc7748 vector1" {	93	test "rfc7748 vector1" {
94	const secret_key = [32]u8{ 0xa5, 0x46, 0xe3, 0x6b, 0xf0, 0x52, 0x7c, 0x9d, 0x3b, 0x16, 0x15, 0x4b, 0x82, 0x46, 0x5e, 0xdd, 0x62, 0x14, 0x4c, 0x0a, 0xc1, 0xfc, 0x5a, 0x18, 0x50, 0x6a, 0x22, 0x44, 0xba, 0x44, 0x9a, 0xc4 };	94	const secret_key = [32]u8{ 0xa5, 0x46, 0xe3, 0x6b, 0xf0, 0x52, 0x7c, 0x9d, 0x3b, 0x16, 0x15, 0x4b, 0x82, 0x46, 0x5e, 0xdd, 0x62, 0x14, 0x4c, 0x0a, 0xc1, 0xfc, 0x5a, 0x18, 0x50, 0x6a, 0x22, 0x44, 0xba, 0x44, 0x9a, 0xc4 };
95	const public_key = [32]u8{ 0xe6, 0xdb, 0x68, 0x67, 0x58, 0x30, 0x30, 0xdb, 0x35, 0x94, 0xc1, 0xa4, 0x24, 0xb1, 0x5f, 0x7c, 0x72, 0x66, 0x24, 0xec, 0x26, 0xb3, 0x35, 0x3b, 0x10, 0xa9, 0x03, 0xa6, 0xd0, 0xab, 0x1c, 0x4c };	95	const public_key = [32]u8{ 0xe6, 0xdb, 0x68, 0x67, 0x58, 0x30, 0x30, 0xdb, 0x35, 0x94, 0xc1, 0xa4, 0x24, 0xb1, 0x5f, 0x7c, 0x72, 0x66, 0x24, 0xec, 0x26, 0xb3, 0x35, 0x3b, 0x10, 0xa9, 0x03, 0xa6, 0xd0, 0xab, 0x1c, 0x4c };
96		96
...	@@ -100,7 +100,7 @@ test "x25519 rfc7748 vector1" {	...	@@ -100,7 +100,7 @@ test "x25519 rfc7748 vector1" {
100	try std.testing.expectEqual(output, expected_output);	100	try std.testing.expectEqual(output, expected_output);
101	}	101	}
102		102
103	test "x25519 rfc7748 vector2" {	103	test "rfc7748 vector2" {
104	const secret_key = [32]u8{ 0x4b, 0x66, 0xe9, 0xd4, 0xd1, 0xb4, 0x67, 0x3c, 0x5a, 0xd2, 0x26, 0x91, 0x95, 0x7d, 0x6a, 0xf5, 0xc1, 0x1b, 0x64, 0x21, 0xe0, 0xea, 0x01, 0xd4, 0x2c, 0xa4, 0x16, 0x9e, 0x79, 0x18, 0xba, 0x0d };	104	const secret_key = [32]u8{ 0x4b, 0x66, 0xe9, 0xd4, 0xd1, 0xb4, 0x67, 0x3c, 0x5a, 0xd2, 0x26, 0x91, 0x95, 0x7d, 0x6a, 0xf5, 0xc1, 0x1b, 0x64, 0x21, 0xe0, 0xea, 0x01, 0xd4, 0x2c, 0xa4, 0x16, 0x9e, 0x79, 0x18, 0xba, 0x0d };
105	const public_key = [32]u8{ 0xe5, 0x21, 0x0f, 0x12, 0x78, 0x68, 0x11, 0xd3, 0xf4, 0xb7, 0x95, 0x9d, 0x05, 0x38, 0xae, 0x2c, 0x31, 0xdb, 0xe7, 0x10, 0x6f, 0xc0, 0x3c, 0x3e, 0xfc, 0x4c, 0xd5, 0x49, 0xc7, 0x15, 0xa4, 0x93 };	105	const public_key = [32]u8{ 0xe5, 0x21, 0x0f, 0x12, 0x78, 0x68, 0x11, 0xd3, 0xf4, 0xb7, 0x95, 0x9d, 0x05, 0x38, 0xae, 0x2c, 0x31, 0xdb, 0xe7, 0x10, 0x6f, 0xc0, 0x3c, 0x3e, 0xfc, 0x4c, 0xd5, 0x49, 0xc7, 0x15, 0xa4, 0x93 };
106		106
...	@@ -110,7 +110,7 @@ test "x25519 rfc7748 vector2" {	...	@@ -110,7 +110,7 @@ test "x25519 rfc7748 vector2" {
110	try std.testing.expectEqual(output, expected_output);	110	try std.testing.expectEqual(output, expected_output);
111	}	111	}
112		112
113	test "x25519 rfc7748 one iteration" {	113	test "rfc7748 one iteration" {
114	const initial_value = [32]u8{ 0x09, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00 };	114	const initial_value = [32]u8{ 0x09, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00 };
115	const expected_output = [32]u8{ 0x42, 0x2c, 0x8e, 0x7a, 0x62, 0x27, 0xd7, 0xbc, 0xa1, 0x35, 0x0b, 0x3e, 0x2b, 0xb7, 0x27, 0x9f, 0x78, 0x97, 0xb8, 0x7b, 0xb6, 0x85, 0x4b, 0x78, 0x3c, 0x60, 0xe8, 0x03, 0x11, 0xae, 0x30, 0x79 };	115	const expected_output = [32]u8{ 0x42, 0x2c, 0x8e, 0x7a, 0x62, 0x27, 0xd7, 0xbc, 0xa1, 0x35, 0x0b, 0x3e, 0x2b, 0xb7, 0x27, 0x9f, 0x78, 0x97, 0xb8, 0x7b, 0xb6, 0x85, 0x4b, 0x78, 0x3c, 0x60, 0xe8, 0x03, 0x11, 0xae, 0x30, 0x79 };
116		116
...	@@ -127,7 +127,7 @@ test "x25519 rfc7748 one iteration" {	...	@@ -127,7 +127,7 @@ test "x25519 rfc7748 one iteration" {
127	try std.testing.expectEqual(k, expected_output);	127	try std.testing.expectEqual(k, expected_output);
128	}	128	}
129		129
130	test "x25519 rfc7748 1,000 iterations" {	130	test "rfc7748 1,000 iterations" {
131	// These iteration tests are slow so we always skip them. Results have been verified.	131	// These iteration tests are slow so we always skip them. Results have been verified.
132	if (true) {	132	if (true) {
133	return error.SkipZigTest;	133	return error.SkipZigTest;
...	@@ -149,7 +149,7 @@ test "x25519 rfc7748 1,000 iterations" {	...	@@ -149,7 +149,7 @@ test "x25519 rfc7748 1,000 iterations" {
149	try std.testing.expectEqual(k, expected_output);	149	try std.testing.expectEqual(k, expected_output);
150	}	150	}
151		151
152	test "x25519 rfc7748 1,000,000 iterations" {	152	test "rfc7748 1,000,000 iterations" {
153	if (true) {	153	if (true) {
154	return error.SkipZigTest;	154	return error.SkipZigTest;
155	}	155	}

...	@@ -758,7 +758,7 @@ fn XChaChaPoly1305(comptime rounds_nb: usize) type {	...	@@ -758,7 +758,7 @@ fn XChaChaPoly1305(comptime rounds_nb: usize) type {
758	};	758	};
759	}	759	}
760		760
761	test "chacha20 AEAD API" {	761	test "AEAD API" {
762	const aeads = [_]type{ ChaCha20Poly1305, XChaCha20Poly1305 };	762	const aeads = [_]type{ ChaCha20Poly1305, XChaCha20Poly1305 };
763	const m = "Ladies and Gentlemen of the class of '99: If I could offer you only one tip for the future, sunscreen would be it.";	763	const m = "Ladies and Gentlemen of the class of '99: If I could offer you only one tip for the future, sunscreen would be it.";
764	const ad = "Additional data";	764	const ad = "Additional data";
...	@@ -779,7 +779,7 @@ test "chacha20 AEAD API" {	...	@@ -779,7 +779,7 @@ test "chacha20 AEAD API" {
779	}	779	}
780		780
781	// https://tools.ietf.org/html/rfc7539#section-2.4.2	781	// https://tools.ietf.org/html/rfc7539#section-2.4.2
782	test "crypto.chacha20 test vector sunscreen" {	782	test "test vector sunscreen" {
783	const expected_result = [_]u8{	783	const expected_result = [_]u8{
784	0x6e, 0x2e, 0x35, 0x9a, 0x25, 0x68, 0xf9, 0x80,	784	0x6e, 0x2e, 0x35, 0x9a, 0x25, 0x68, 0xf9, 0x80,
785	0x41, 0xba, 0x07, 0x28, 0xdd, 0x0d, 0x69, 0x81,	785	0x41, 0xba, 0x07, 0x28, 0xdd, 0x0d, 0x69, 0x81,
...	@@ -820,7 +820,7 @@ test "crypto.chacha20 test vector sunscreen" {	...	@@ -820,7 +820,7 @@ test "crypto.chacha20 test vector sunscreen" {
820	}	820	}
821		821
822	// https://tools.ietf.org/html/draft-agl-tls-chacha20poly1305-04#section-7	822	// https://tools.ietf.org/html/draft-agl-tls-chacha20poly1305-04#section-7
823	test "crypto.chacha20 test vector 1" {	823	test "test vector 1" {
824	const expected_result = [_]u8{	824	const expected_result = [_]u8{
825	0x76, 0xb8, 0xe0, 0xad, 0xa0, 0xf1, 0x3d, 0x90,	825	0x76, 0xb8, 0xe0, 0xad, 0xa0, 0xf1, 0x3d, 0x90,
826	0x40, 0x5d, 0x6a, 0xe5, 0x53, 0x86, 0xbd, 0x28,	826	0x40, 0x5d, 0x6a, 0xe5, 0x53, 0x86, 0xbd, 0x28,
...	@@ -854,7 +854,7 @@ test "crypto.chacha20 test vector 1" {	...	@@ -854,7 +854,7 @@ test "crypto.chacha20 test vector 1" {
854	try testing.expectEqualSlices(u8, &expected_result, &result);	854	try testing.expectEqualSlices(u8, &expected_result, &result);
855	}	855	}
856		856
857	test "crypto.chacha20 test vector 2" {	857	test "test vector 2" {
858	const expected_result = [_]u8{	858	const expected_result = [_]u8{
859	0x45, 0x40, 0xf0, 0x5a, 0x9f, 0x1f, 0xb2, 0x96,	859	0x45, 0x40, 0xf0, 0x5a, 0x9f, 0x1f, 0xb2, 0x96,
860	0xd7, 0x73, 0x6e, 0x7b, 0x20, 0x8e, 0x3c, 0x96,	860	0xd7, 0x73, 0x6e, 0x7b, 0x20, 0x8e, 0x3c, 0x96,
...	@@ -888,7 +888,7 @@ test "crypto.chacha20 test vector 2" {	...	@@ -888,7 +888,7 @@ test "crypto.chacha20 test vector 2" {
888	try testing.expectEqualSlices(u8, &expected_result, &result);	888	try testing.expectEqualSlices(u8, &expected_result, &result);
889	}	889	}
890		890
891	test "crypto.chacha20 test vector 3" {	891	test "test vector 3" {
892	const expected_result = [_]u8{	892	const expected_result = [_]u8{
893	0xde, 0x9c, 0xba, 0x7b, 0xf3, 0xd6, 0x9e, 0xf5,	893	0xde, 0x9c, 0xba, 0x7b, 0xf3, 0xd6, 0x9e, 0xf5,
894	0xe7, 0x86, 0xdc, 0x63, 0x97, 0x3f, 0x65, 0x3a,	894	0xe7, 0x86, 0xdc, 0x63, 0x97, 0x3f, 0x65, 0x3a,
...	@@ -922,7 +922,7 @@ test "crypto.chacha20 test vector 3" {	...	@@ -922,7 +922,7 @@ test "crypto.chacha20 test vector 3" {
922	try testing.expectEqualSlices(u8, &expected_result, &result);	922	try testing.expectEqualSlices(u8, &expected_result, &result);
923	}	923	}
924		924
925	test "crypto.chacha20 test vector 4" {	925	test "test vector 4" {
926	const expected_result = [_]u8{	926	const expected_result = [_]u8{
927	0xef, 0x3f, 0xdf, 0xd6, 0xc6, 0x15, 0x78, 0xfb,	927	0xef, 0x3f, 0xdf, 0xd6, 0xc6, 0x15, 0x78, 0xfb,
928	0xf5, 0xcf, 0x35, 0xbd, 0x3d, 0xd3, 0x3b, 0x80,	928	0xf5, 0xcf, 0x35, 0xbd, 0x3d, 0xd3, 0x3b, 0x80,
...	@@ -956,7 +956,7 @@ test "crypto.chacha20 test vector 4" {	...	@@ -956,7 +956,7 @@ test "crypto.chacha20 test vector 4" {
956	try testing.expectEqualSlices(u8, &expected_result, &result);	956	try testing.expectEqualSlices(u8, &expected_result, &result);
957	}	957	}
958		958
959	test "crypto.chacha20 test vector 5" {	959	test "test vector 5" {
960	const expected_result = [_]u8{	960	const expected_result = [_]u8{
961	0xf7, 0x98, 0xa1, 0x89, 0xf1, 0x95, 0xe6, 0x69,	961	0xf7, 0x98, 0xa1, 0x89, 0xf1, 0x95, 0xe6, 0x69,
962	0x82, 0x10, 0x5f, 0xfb, 0x64, 0x0b, 0xb7, 0x75,	962	0x82, 0x10, 0x5f, 0xfb, 0x64, 0x0b, 0xb7, 0x75,
...	@@ -1142,7 +1142,7 @@ test "open" {	...	@@ -1142,7 +1142,7 @@ test "open" {
1142	}	1142	}
1143	}	1143	}
1144		1144
1145	test "crypto.xchacha20" {	1145	test "xchacha20" {
1146	const key = [_]u8{69} ** 32;	1146	const key = [_]u8{69} ** 32;
1147	const nonce = [_]u8{42} ** 24;	1147	const nonce = [_]u8{42} ** 24;
1148	const m = "Ladies and Gentlemen of the class of '99: If I could offer you only one tip for the future, sunscreen would be it.";	1148	const m = "Ladies and Gentlemen of the class of '99: If I could offer you only one tip for the future, sunscreen would be it.";

...	@@ -371,7 +371,7 @@ pub fn Ecdsa(comptime Curve: type, comptime Hash: type) type {	...	@@ -371,7 +371,7 @@ pub fn Ecdsa(comptime Curve: type, comptime Hash: type) type {
371	};	371	};
372	}	372	}
373		373
374	test "ECDSA - Basic operations over EcdsaP384Sha384" {	374	test "Basic operations over EcdsaP384Sha384" {
375	if (builtin.zig_backend == .stage2_c) return error.SkipZigTest;	375	if (builtin.zig_backend == .stage2_c) return error.SkipZigTest;
376		376
377	const Scheme = EcdsaP384Sha384;	377	const Scheme = EcdsaP384Sha384;
...	@@ -387,7 +387,7 @@ test "ECDSA - Basic operations over EcdsaP384Sha384" {	...	@@ -387,7 +387,7 @@ test "ECDSA - Basic operations over EcdsaP384Sha384" {
387	try sig2.verify(msg, kp.public_key);	387	try sig2.verify(msg, kp.public_key);
388	}	388	}
389		389
390	test "ECDSA - Basic operations over Secp256k1" {	390	test "Basic operations over Secp256k1" {
391	if (builtin.zig_backend == .stage2_c) return error.SkipZigTest;	391	if (builtin.zig_backend == .stage2_c) return error.SkipZigTest;
392		392
393	const Scheme = EcdsaSecp256k1Sha256oSha256;	393	const Scheme = EcdsaSecp256k1Sha256oSha256;
...	@@ -403,7 +403,7 @@ test "ECDSA - Basic operations over Secp256k1" {	...	@@ -403,7 +403,7 @@ test "ECDSA - Basic operations over Secp256k1" {
403	try sig2.verify(msg, kp.public_key);	403	try sig2.verify(msg, kp.public_key);
404	}	404	}
405		405
406	test "ECDSA - Basic operations over EcdsaP384Sha256" {	406	test "Basic operations over EcdsaP384Sha256" {
407	if (builtin.zig_backend == .stage2_c) return error.SkipZigTest;	407	if (builtin.zig_backend == .stage2_c) return error.SkipZigTest;
408		408
409	const Scheme = Ecdsa(crypto.ecc.P384, crypto.hash.sha2.Sha256);	409	const Scheme = Ecdsa(crypto.ecc.P384, crypto.hash.sha2.Sha256);
...	@@ -419,7 +419,7 @@ test "ECDSA - Basic operations over EcdsaP384Sha256" {	...	@@ -419,7 +419,7 @@ test "ECDSA - Basic operations over EcdsaP384Sha256" {
419	try sig2.verify(msg, kp.public_key);	419	try sig2.verify(msg, kp.public_key);
420	}	420	}
421		421
422	test "ECDSA - Verifying a existing signature with EcdsaP384Sha256" {	422	test "Verifying a existing signature with EcdsaP384Sha256" {
423	if (builtin.zig_backend == .stage2_c) return error.SkipZigTest;	423	if (builtin.zig_backend == .stage2_c) return error.SkipZigTest;
424		424
425	const Scheme = Ecdsa(crypto.ecc.P384, crypto.hash.sha2.Sha256);	425	const Scheme = Ecdsa(crypto.ecc.P384, crypto.hash.sha2.Sha256);
...	@@ -463,7 +463,7 @@ const TestVector = struct {	...	@@ -463,7 +463,7 @@ const TestVector = struct {
463	result: enum { valid, invalid, acceptable },	463	result: enum { valid, invalid, acceptable },
464	};	464	};
465		465
466	test "ECDSA - Test vectors from Project Wycheproof" {	466	test "Test vectors from Project Wycheproof" {
467	if (builtin.zig_backend == .stage2_c) return error.SkipZigTest;	467	if (builtin.zig_backend == .stage2_c) return error.SkipZigTest;
468		468
469	const vectors = [_]TestVector{	469	const vectors = [_]TestVector{
...	@@ -877,7 +877,7 @@ fn tvTry(vector: TestVector) !void {	...	@@ -877,7 +877,7 @@ fn tvTry(vector: TestVector) !void {
877	try sig.verify(msg, pk);	877	try sig.verify(msg, pk);
878	}	878	}
879		879
880	test "ECDSA - Sec1 encoding/decoding" {	880	test "Sec1 encoding/decoding" {
881	if (builtin.zig_backend == .stage2_c) return error.SkipZigTest;	881	if (builtin.zig_backend == .stage2_c) return error.SkipZigTest;
882		882
883	const Scheme = EcdsaP384Sha384;	883	const Scheme = EcdsaP384Sha384;

...	@@ -76,7 +76,7 @@ pub fn Hmac(comptime Hash: type) type {	...	@@ -76,7 +76,7 @@ pub fn Hmac(comptime Hash: type) type {
76		76
77	const htest = @import("test.zig");	77	const htest = @import("test.zig");
78		78
79	test "hmac md5" {	79	test "md5" {
80	var out: [HmacMd5.mac_length]u8 = undefined;	80	var out: [HmacMd5.mac_length]u8 = undefined;
81	HmacMd5.create(out[0..], "", "");	81	HmacMd5.create(out[0..], "", "");
82	try htest.assertEqual("74e6f7298a9c2d168935f58c001bad88", out[0..]);	82	try htest.assertEqual("74e6f7298a9c2d168935f58c001bad88", out[0..]);
...	@@ -85,7 +85,7 @@ test "hmac md5" {	...	@@ -85,7 +85,7 @@ test "hmac md5" {
85	try htest.assertEqual("80070713463e7749b90c2dc24911e275", out[0..]);	85	try htest.assertEqual("80070713463e7749b90c2dc24911e275", out[0..]);
86	}	86	}
87		87
88	test "hmac sha1" {	88	test "sha1" {
89	var out: [HmacSha1.mac_length]u8 = undefined;	89	var out: [HmacSha1.mac_length]u8 = undefined;
90	HmacSha1.create(out[0..], "", "");	90	HmacSha1.create(out[0..], "", "");
91	try htest.assertEqual("fbdb1d1b18aa6c08324b7d64b71fb76370690e1d", out[0..]);	91	try htest.assertEqual("fbdb1d1b18aa6c08324b7d64b71fb76370690e1d", out[0..]);
...	@@ -94,7 +94,7 @@ test "hmac sha1" {	...	@@ -94,7 +94,7 @@ test "hmac sha1" {
94	try htest.assertEqual("de7c9b85b8b78aa6bc8a7a36f70a90701c9db4d9", out[0..]);	94	try htest.assertEqual("de7c9b85b8b78aa6bc8a7a36f70a90701c9db4d9", out[0..]);
95	}	95	}
96		96
97	test "hmac sha256" {	97	test "sha256" {
98	var out: [sha2.HmacSha256.mac_length]u8 = undefined;	98	var out: [sha2.HmacSha256.mac_length]u8 = undefined;
99	sha2.HmacSha256.create(out[0..], "", "");	99	sha2.HmacSha256.create(out[0..], "", "");
100	try htest.assertEqual("b613679a0814d9ec772f95d778c35fc5ff1697c493715653c6c712144292c5ad", out[0..]);	100	try htest.assertEqual("b613679a0814d9ec772f95d778c35fc5ff1697c493715653c6c712144292c5ad", out[0..]);

...	@@ -232,7 +232,7 @@ pub const Md5 = struct {	...	@@ -232,7 +232,7 @@ pub const Md5 = struct {
232		232
233	const htest = @import("test.zig");	233	const htest = @import("test.zig");
234		234
235	test "md5 single" {	235	test "single" {
236	try htest.assertEqualHash(Md5, "d41d8cd98f00b204e9800998ecf8427e", "");	236	try htest.assertEqualHash(Md5, "d41d8cd98f00b204e9800998ecf8427e", "");
237	try htest.assertEqualHash(Md5, "0cc175b9c0f1b6a831c399e269772661", "a");	237	try htest.assertEqualHash(Md5, "0cc175b9c0f1b6a831c399e269772661", "a");
238	try htest.assertEqualHash(Md5, "900150983cd24fb0d6963f7d28e17f72", "abc");	238	try htest.assertEqualHash(Md5, "900150983cd24fb0d6963f7d28e17f72", "abc");
...	@@ -242,7 +242,7 @@ test "md5 single" {	...	@@ -242,7 +242,7 @@ test "md5 single" {
242	try htest.assertEqualHash(Md5, "57edf4a22be3c955ac49da2e2107b67a", "12345678901234567890123456789012345678901234567890123456789012345678901234567890");	242	try htest.assertEqualHash(Md5, "57edf4a22be3c955ac49da2e2107b67a", "12345678901234567890123456789012345678901234567890123456789012345678901234567890");
243	}	243	}
244		244
245	test "md5 streaming" {	245	test "streaming" {
246	var h = Md5.init(.{});	246	var h = Md5.init(.{});
247	var out: [16]u8 = undefined;	247	var out: [16]u8 = undefined;
248		248
...	@@ -263,7 +263,7 @@ test "md5 streaming" {	...	@@ -263,7 +263,7 @@ test "md5 streaming" {
263	try htest.assertEqual("900150983cd24fb0d6963f7d28e17f72", out[0..]);	263	try htest.assertEqual("900150983cd24fb0d6963f7d28e17f72", out[0..]);
264	}	264	}
265		265
266	test "md5 aligned final" {	266	test "aligned final" {
267	var block = [_]u8{0} ** Md5.block_length;	267	var block = [_]u8{0} ** Md5.block_length;
268	var out: [Md5.digest_length]u8 = undefined;	268	var out: [Md5.digest_length]u8 = undefined;
269		269

...	@@ -120,7 +120,7 @@ pub fn directEnumArray(	...	@@ -120,7 +120,7 @@ pub fn directEnumArray(
120	return directEnumArrayDefault(E, Data, null, max_unused_slots, init_values);	120	return directEnumArrayDefault(E, Data, null, max_unused_slots, init_values);
121	}	121	}
122		122
123	test "std.enums.directEnumArray" {	123	test directEnumArray {
124	const E = enum(i4) { a = 4, b = 6, c = 2 };	124	const E = enum(i4) { a = 4, b = 6, c = 2 };
125	var runtime_false: bool = false;	125	var runtime_false: bool = false;
126	_ = &runtime_false;	126	_ = &runtime_false;
...	@@ -163,7 +163,7 @@ pub fn directEnumArrayDefault(	...	@@ -163,7 +163,7 @@ pub fn directEnumArrayDefault(
163	return result;	163	return result;
164	}	164	}
165		165
166	test "std.enums.directEnumArrayDefault" {	166	test directEnumArrayDefault {
167	const E = enum(i4) { a = 4, b = 6, c = 2 };	167	const E = enum(i4) { a = 4, b = 6, c = 2 };
168	var runtime_false: bool = false;	168	var runtime_false: bool = false;
169	_ = &runtime_false;	169	_ = &runtime_false;
...	@@ -178,7 +178,7 @@ test "std.enums.directEnumArrayDefault" {	...	@@ -178,7 +178,7 @@ test "std.enums.directEnumArrayDefault" {
178	try testing.expectEqual(false, array[2]);	178	try testing.expectEqual(false, array[2]);
179	}	179	}
180		180
181	test "std.enums.directEnumArrayDefault slice" {	181	test "directEnumArrayDefault slice" {
182	const E = enum(i4) { a = 4, b = 6, c = 2 };	182	const E = enum(i4) { a = 4, b = 6, c = 2 };
183	var runtime_b = "b";	183	var runtime_b = "b";
184	_ = &runtime_b;	184	_ = &runtime_b;
...	@@ -214,7 +214,7 @@ pub fn nameCast(comptime E: type, comptime value: anytype) E {	...	@@ -214,7 +214,7 @@ pub fn nameCast(comptime E: type, comptime value: anytype) E {
214	};	214	};
215	}	215	}
216		216
217	test "std.enums.nameCast" {	217	test nameCast {
218	const A = enum(u1) { a = 0, b = 1 };	218	const A = enum(u1) { a = 0, b = 1 };
219	const B = enum(u1) { a = 1, b = 0 };	219	const B = enum(u1) { a = 1, b = 0 };
220	try testing.expectEqual(A.a, nameCast(A, .a));	220	try testing.expectEqual(A.a, nameCast(A, .a));
...	@@ -515,7 +515,7 @@ pub fn BoundedEnumMultiset(comptime E: type, comptime CountSize: type) type {	...	@@ -515,7 +515,7 @@ pub fn BoundedEnumMultiset(comptime E: type, comptime CountSize: type) type {
515	};	515	};
516	}	516	}
517		517
518	test "EnumMultiset" {	518	test EnumMultiset {
519	const Ball = enum { red, green, blue };	519	const Ball = enum { red, green, blue };
520		520
521	const empty = EnumMultiset(Ball).initEmpty();	521	const empty = EnumMultiset(Ball).initEmpty();
...	@@ -983,7 +983,7 @@ test "pure EnumSet fns" {	...	@@ -983,7 +983,7 @@ test "pure EnumSet fns" {
983	try testing.expect(full.differenceWith(black).eql(red));	983	try testing.expect(full.differenceWith(black).eql(red));
984	}	984	}
985		985
986	test "std.enums.EnumSet empty" {	986	test "EnumSet empty" {
987	const E = enum {};	987	const E = enum {};
988	const empty = EnumSet(E).initEmpty();	988	const empty = EnumSet(E).initEmpty();
989	const full = EnumSet(E).initFull();	989	const full = EnumSet(E).initFull();
...	@@ -994,7 +994,7 @@ test "std.enums.EnumSet empty" {	...	@@ -994,7 +994,7 @@ test "std.enums.EnumSet empty" {
994	try std.testing.expect(empty.eql(full.complement()));	994	try std.testing.expect(empty.eql(full.complement()));
995	}	995	}
996		996
997	test "std.enums.EnumSet const iterator" {	997	test "EnumSet const iterator" {
998	const Direction = enum { up, down, left, right };	998	const Direction = enum { up, down, left, right };
999	const diag_move = init: {	999	const diag_move = init: {
1000	var move = EnumSet(Direction).initEmpty();	1000	var move = EnumSet(Direction).initEmpty();
...	@@ -1298,7 +1298,7 @@ pub fn ensureIndexer(comptime T: type) void {	...	@@ -1298,7 +1298,7 @@ pub fn ensureIndexer(comptime T: type) void {
1298	}	1298	}
1299	}	1299	}
1300		1300
1301	test "std.enums.ensureIndexer" {	1301	test ensureIndexer {
1302	ensureIndexer(struct {	1302	ensureIndexer(struct {
1303	pub const Key = u32;	1303	pub const Key = u32;
1304	pub const count: comptime_int = 8;	1304	pub const count: comptime_int = 8;
...	@@ -1463,7 +1463,7 @@ test "EnumIndexer non-exhaustive" {	...	@@ -1463,7 +1463,7 @@ test "EnumIndexer non-exhaustive" {
1463	}	1463	}
1464	}	1464	}
1465		1465
1466	test "std.enums.EnumIndexer dense zeroed" {	1466	test "EnumIndexer dense zeroed" {
1467	const E = enum(u2) { b = 1, a = 0, c = 2 };	1467	const E = enum(u2) { b = 1, a = 0, c = 2 };
1468	const Indexer = EnumIndexer(E);	1468	const Indexer = EnumIndexer(E);
1469	ensureIndexer(Indexer);	1469	ensureIndexer(Indexer);
...	@@ -1479,7 +1479,7 @@ test "std.enums.EnumIndexer dense zeroed" {	...	@@ -1479,7 +1479,7 @@ test "std.enums.EnumIndexer dense zeroed" {
1479	try testing.expectEqual(E.c, Indexer.keyForIndex(2));	1479	try testing.expectEqual(E.c, Indexer.keyForIndex(2));
1480	}	1480	}
1481		1481
1482	test "std.enums.EnumIndexer dense positive" {	1482	test "EnumIndexer dense positive" {
1483	const E = enum(u4) { c = 6, a = 4, b = 5 };	1483	const E = enum(u4) { c = 6, a = 4, b = 5 };
1484	const Indexer = EnumIndexer(E);	1484	const Indexer = EnumIndexer(E);
1485	ensureIndexer(Indexer);	1485	ensureIndexer(Indexer);
...	@@ -1495,7 +1495,7 @@ test "std.enums.EnumIndexer dense positive" {	...	@@ -1495,7 +1495,7 @@ test "std.enums.EnumIndexer dense positive" {
1495	try testing.expectEqual(E.c, Indexer.keyForIndex(2));	1495	try testing.expectEqual(E.c, Indexer.keyForIndex(2));
1496	}	1496	}
1497		1497
1498	test "std.enums.EnumIndexer dense negative" {	1498	test "EnumIndexer dense negative" {
1499	const E = enum(i4) { a = -6, c = -4, b = -5 };	1499	const E = enum(i4) { a = -6, c = -4, b = -5 };
1500	const Indexer = EnumIndexer(E);	1500	const Indexer = EnumIndexer(E);
1501	ensureIndexer(Indexer);	1501	ensureIndexer(Indexer);
...	@@ -1511,7 +1511,7 @@ test "std.enums.EnumIndexer dense negative" {	...	@@ -1511,7 +1511,7 @@ test "std.enums.EnumIndexer dense negative" {
1511	try testing.expectEqual(E.c, Indexer.keyForIndex(2));	1511	try testing.expectEqual(E.c, Indexer.keyForIndex(2));
1512	}	1512	}
1513		1513
1514	test "std.enums.EnumIndexer sparse" {	1514	test "EnumIndexer sparse" {
1515	const E = enum(i4) { a = -2, c = 6, b = 4 };	1515	const E = enum(i4) { a = -2, c = 6, b = 4 };
1516	const Indexer = EnumIndexer(E);	1516	const Indexer = EnumIndexer(E);
1517	ensureIndexer(Indexer);	1517	ensureIndexer(Indexer);
...	@@ -1527,7 +1527,7 @@ test "std.enums.EnumIndexer sparse" {	...	@@ -1527,7 +1527,7 @@ test "std.enums.EnumIndexer sparse" {
1527	try testing.expectEqual(E.c, Indexer.keyForIndex(2));	1527	try testing.expectEqual(E.c, Indexer.keyForIndex(2));
1528	}	1528	}
1529		1529
1530	test "std.enums.EnumIndexer empty" {	1530	test "EnumIndexer empty" {
1531	const E = enum {};	1531	const E = enum {};
1532	const Indexer = EnumIndexer(E);	1532	const Indexer = EnumIndexer(E);
1533	ensureIndexer(Indexer);	1533	ensureIndexer(Indexer);
...	@@ -1535,7 +1535,7 @@ test "std.enums.EnumIndexer empty" {	...	@@ -1535,7 +1535,7 @@ test "std.enums.EnumIndexer empty" {
1535	try testing.expectEqual(0, Indexer.count);	1535	try testing.expectEqual(0, Indexer.count);
1536	}	1536	}
1537		1537
1538	test "enumValues" {	1538	test values {
1539	const E = enum {	1539	const E = enum {
1540	X,	1540	X,
1541	Y,	1541	Y,

...	@@ -12,7 +12,7 @@ const epsilon = 1e-7;	...	@@ -12,7 +12,7 @@ const epsilon = 1e-7;
12		12
13	// See https://github.com/tiehuis/parse-number-fxx-test-data for a wider-selection of test-data.	13	// See https://github.com/tiehuis/parse-number-fxx-test-data for a wider-selection of test-data.
14		14
15	test "fmt.parseFloat" {	15	test "parseFloat" {
16	inline for ([_]type{ f16, f32, f64, f128 }) \|T\| {	16	inline for ([_]type{ f16, f32, f64, f128 }) \|T\| {
17	try testing.expectError(error.InvalidCharacter, parseFloat(T, ""));	17	try testing.expectError(error.InvalidCharacter, parseFloat(T, ""));
18	try testing.expectError(error.InvalidCharacter, parseFloat(T, " 1"));	18	try testing.expectError(error.InvalidCharacter, parseFloat(T, " 1"));
...	@@ -68,7 +68,7 @@ test "fmt.parseFloat" {	...	@@ -68,7 +68,7 @@ test "fmt.parseFloat" {
68	}	68	}
69	}	69	}
70		70
71	test "fmt.parseFloat nan and inf" {	71	test "nan and inf" {
72	inline for ([_]type{ f16, f32, f64, f128 }) \|T\| {	72	inline for ([_]type{ f16, f32, f64, f128 }) \|T\| {
73	const Z = std.meta.Int(.unsigned, @typeInfo(T).Float.bits);	73	const Z = std.meta.Int(.unsigned, @typeInfo(T).Float.bits);
74		74
...	@@ -78,24 +78,24 @@ test "fmt.parseFloat nan and inf" {	...	@@ -78,24 +78,24 @@ test "fmt.parseFloat nan and inf" {
78	}	78	}
79	}	79	}
80		80
81	test "fmt.parseFloat largest normals" {	81	test "largest normals" {
82	try expectEqual(@as(u16, @bitCast(try parseFloat(f16, "65504"))), 0x7bff);	82	try expectEqual(@as(u16, @bitCast(try parseFloat(f16, "65504"))), 0x7bff);
83	try expectEqual(@as(u32, @bitCast(try parseFloat(f32, "3.4028234664E38"))), 0x7f7f_ffff);	83	try expectEqual(@as(u32, @bitCast(try parseFloat(f32, "3.4028234664E38"))), 0x7f7f_ffff);
84	try expectEqual(@as(u64, @bitCast(try parseFloat(f64, "1.7976931348623157E308"))), 0x7fef_ffff_ffff_ffff);	84	try expectEqual(@as(u64, @bitCast(try parseFloat(f64, "1.7976931348623157E308"))), 0x7fef_ffff_ffff_ffff);
85	try expectEqual(@as(u128, @bitCast(try parseFloat(f128, "1.1897314953572317650857593266280070162E4932"))), 0x7ffe_ffff_ffff_ffff_ffff_ffff_ffff_ffff);	85	try expectEqual(@as(u128, @bitCast(try parseFloat(f128, "1.1897314953572317650857593266280070162E4932"))), 0x7ffe_ffff_ffff_ffff_ffff_ffff_ffff_ffff);
86	}	86	}
87		87
88	test "fmt.parseFloat #11169" {	88	test "#11169" {
89	try expectEqual(try parseFloat(f128, "9007199254740993.0"), 9007199254740993.0);	89	try expectEqual(try parseFloat(f128, "9007199254740993.0"), 9007199254740993.0);
90	}	90	}
91		91
92	test "fmt.parseFloat hex.special" {	92	test "hex.special" {
93	try testing.expect(math.isNan(try parseFloat(f32, "nAn")));	93	try testing.expect(math.isNan(try parseFloat(f32, "nAn")));
94	try testing.expect(math.isPositiveInf(try parseFloat(f32, "iNf")));	94	try testing.expect(math.isPositiveInf(try parseFloat(f32, "iNf")));
95	try testing.expect(math.isPositiveInf(try parseFloat(f32, "+Inf")));	95	try testing.expect(math.isPositiveInf(try parseFloat(f32, "+Inf")));
96	try testing.expect(math.isNegativeInf(try parseFloat(f32, "-iNf")));	96	try testing.expect(math.isNegativeInf(try parseFloat(f32, "-iNf")));
97	}	97	}
98	test "fmt.parseFloat hex.zero" {	98	test "hex.zero" {
99	try testing.expectEqual(@as(f32, 0.0), try parseFloat(f32, "0x0"));	99	try testing.expectEqual(@as(f32, 0.0), try parseFloat(f32, "0x0"));
100	try testing.expectEqual(@as(f32, 0.0), try parseFloat(f32, "-0x0"));	100	try testing.expectEqual(@as(f32, 0.0), try parseFloat(f32, "-0x0"));
101	try testing.expectEqual(@as(f32, 0.0), try parseFloat(f32, "0x0p42"));	101	try testing.expectEqual(@as(f32, 0.0), try parseFloat(f32, "0x0p42"));
...	@@ -103,7 +103,7 @@ test "fmt.parseFloat hex.zero" {	...	@@ -103,7 +103,7 @@ test "fmt.parseFloat hex.zero" {
103	try testing.expectEqual(@as(f32, 0.0), try parseFloat(f32, "0x0.00000p666"));	103	try testing.expectEqual(@as(f32, 0.0), try parseFloat(f32, "0x0.00000p666"));
104	}	104	}
105		105
106	test "fmt.parseFloat hex.f16" {	106	test "hex.f16" {
107	try testing.expectEqual(try parseFloat(f16, "0x1p0"), 1.0);	107	try testing.expectEqual(try parseFloat(f16, "0x1p0"), 1.0);
108	try testing.expectEqual(try parseFloat(f16, "-0x1p-1"), -0.5);	108	try testing.expectEqual(try parseFloat(f16, "-0x1p-1"), -0.5);
109	try testing.expectEqual(try parseFloat(f16, "0x10p+10"), 16384.0);	109	try testing.expectEqual(try parseFloat(f16, "0x10p+10"), 16384.0);
...	@@ -119,7 +119,7 @@ test "fmt.parseFloat hex.f16" {	...	@@ -119,7 +119,7 @@ test "fmt.parseFloat hex.f16" {
119	try testing.expectEqual(try parseFloat(f16, "-0x1p-24"), -math.floatTrueMin(f16));	119	try testing.expectEqual(try parseFloat(f16, "-0x1p-24"), -math.floatTrueMin(f16));
120	}	120	}
121		121
122	test "fmt.parseFloat hex.f32" {	122	test "hex.f32" {
123	try testing.expectError(error.InvalidCharacter, parseFloat(f32, "0x"));	123	try testing.expectError(error.InvalidCharacter, parseFloat(f32, "0x"));
124	try testing.expectEqual(try parseFloat(f32, "0x1p0"), 1.0);	124	try testing.expectEqual(try parseFloat(f32, "0x1p0"), 1.0);
125	try testing.expectEqual(try parseFloat(f32, "-0x1p-1"), -0.5);	125	try testing.expectEqual(try parseFloat(f32, "-0x1p-1"), -0.5);
...	@@ -138,7 +138,7 @@ test "fmt.parseFloat hex.f32" {	...	@@ -138,7 +138,7 @@ test "fmt.parseFloat hex.f32" {
138	try testing.expectEqual(try parseFloat(f32, "-0x1P-149"), -math.floatTrueMin(f32));	138	try testing.expectEqual(try parseFloat(f32, "-0x1P-149"), -math.floatTrueMin(f32));
139	}	139	}
140		140
141	test "fmt.parseFloat hex.f64" {	141	test "hex.f64" {
142	try testing.expectEqual(try parseFloat(f64, "0x1p0"), 1.0);	142	try testing.expectEqual(try parseFloat(f64, "0x1p0"), 1.0);
143	try testing.expectEqual(try parseFloat(f64, "-0x1p-1"), -0.5);	143	try testing.expectEqual(try parseFloat(f64, "-0x1p-1"), -0.5);
144	try testing.expectEqual(try parseFloat(f64, "0x10p+10"), 16384.0);	144	try testing.expectEqual(try parseFloat(f64, "0x10p+10"), 16384.0);
...	@@ -153,7 +153,7 @@ test "fmt.parseFloat hex.f64" {	...	@@ -153,7 +153,7 @@ test "fmt.parseFloat hex.f64" {
153	try testing.expectEqual(try parseFloat(f64, "0x1p-1074"), math.floatTrueMin(f64));	153	try testing.expectEqual(try parseFloat(f64, "0x1p-1074"), math.floatTrueMin(f64));
154	try testing.expectEqual(try parseFloat(f64, "-0x1p-1074"), -math.floatTrueMin(f64));	154	try testing.expectEqual(try parseFloat(f64, "-0x1p-1074"), -math.floatTrueMin(f64));
155	}	155	}
156	test "fmt.parseFloat hex.f128" {	156	test "hex.f128" {
157	try testing.expectEqual(try parseFloat(f128, "0x1p0"), 1.0);	157	try testing.expectEqual(try parseFloat(f128, "0x1p0"), 1.0);
158	try testing.expectEqual(try parseFloat(f128, "-0x1p-1"), -0.5);	158	try testing.expectEqual(try parseFloat(f128, "-0x1p-1"), -0.5);
159	try testing.expectEqual(try parseFloat(f128, "0x10p+10"), 16384.0);	159	try testing.expectEqual(try parseFloat(f128, "0x10p+10"), 16384.0);

...	@@ -146,7 +146,7 @@ fn bufferedReader(reader: anytype) BufferedReader(4096, @TypeOf(reader)) {	...	@@ -146,7 +146,7 @@ fn bufferedReader(reader: anytype) BufferedReader(4096, @TypeOf(reader)) {
146	};	146	};
147	}	147	}
148		148
149	test "io.BufferedTee io.BufferedReader OneByte" {	149	test "OneByte" {
150	const OneByteReadReader = struct {	150	const OneByteReadReader = struct {
151	str: []const u8,	151	str: []const u8,
152	curr: usize,	152	curr: usize,
...	@@ -186,7 +186,7 @@ test "io.BufferedTee io.BufferedReader OneByte" {	...	@@ -186,7 +186,7 @@ test "io.BufferedTee io.BufferedReader OneByte" {
186	try testing.expectEqualSlices(u8, str, res);	186	try testing.expectEqualSlices(u8, str, res);
187	}	187	}
188		188
189	test "io.BufferedTee io.BufferedReader Block" {	189	test "Block" {
190	const BlockReader = struct {	190	const BlockReader = struct {
191	block: []const u8,	191	block: []const u8,
192	reads_allowed: usize,	192	reads_allowed: usize,
...	@@ -289,7 +289,7 @@ test "io.BufferedTee io.BufferedReader Block" {	...	@@ -289,7 +289,7 @@ test "io.BufferedTee io.BufferedReader Block" {
289	}	289	}
290	}	290	}
291		291
292	test "io.BufferedTee with zero lookahead" {	292	test "with zero lookahead" {
293	// output has same bytes as consumer	293	// output has same bytes as consumer
294	const data = [_]u8{ 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 } ** 12;	294	const data = [_]u8{ 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 } ** 12;
295	var in = io.fixedBufferStream(&data);	295	var in = io.fixedBufferStream(&data);
...	@@ -308,7 +308,7 @@ test "io.BufferedTee with zero lookahead" {	...	@@ -308,7 +308,7 @@ test "io.BufferedTee with zero lookahead" {
308	}	308	}
309	}	309	}
310		310
311	test "io.BufferedTee with lookahead" {	311	test "with lookahead" {
312	// output is lookahead bytes behind consumer	312	// output is lookahead bytes behind consumer
313	inline for (1..8) \|lookahead\| {	313	inline for (1..8) \|lookahead\| {
314	const data = [_]u8{ 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 } ** 12;	314	const data = [_]u8{ 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 } ** 12;
...	@@ -333,7 +333,7 @@ test "io.BufferedTee with lookahead" {	...	@@ -333,7 +333,7 @@ test "io.BufferedTee with lookahead" {
333	}	333	}
334	}	334	}
335		335
336	test "io.BufferedTee internal state" {	336	test "internal state" {
337	const data = [_]u8{ 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 } ** 2;	337	const data = [_]u8{ 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 } ** 2;
338	var in = io.fixedBufferStream(&data);	338	var in = io.fixedBufferStream(&data);
339	var out = std.ArrayList(u8).init(testing.allocator);	339	var out = std.ArrayList(u8).init(testing.allocator);

...	@@ -132,7 +132,7 @@ fn Slice(comptime T: type) type {	...	@@ -132,7 +132,7 @@ fn Slice(comptime T: type) type {
132	}	132	}
133	}	133	}
134		134
135	test "FixedBufferStream output" {	135	test "output" {
136	var buf: [255]u8 = undefined;	136	var buf: [255]u8 = undefined;
137	var fbs = fixedBufferStream(&buf);	137	var fbs = fixedBufferStream(&buf);
138	const stream = fbs.writer();	138	const stream = fbs.writer();
...	@@ -141,7 +141,7 @@ test "FixedBufferStream output" {	...	@@ -141,7 +141,7 @@ test "FixedBufferStream output" {
141	try testing.expectEqualSlices(u8, "HelloWorld!", fbs.getWritten());	141	try testing.expectEqualSlices(u8, "HelloWorld!", fbs.getWritten());
142	}	142	}
143		143
144	test "FixedBufferStream output at comptime" {	144	test "output at comptime" {
145	comptime {	145	comptime {
146	var buf: [255]u8 = undefined;	146	var buf: [255]u8 = undefined;
147	var fbs = fixedBufferStream(&buf);	147	var fbs = fixedBufferStream(&buf);
...	@@ -152,7 +152,7 @@ test "FixedBufferStream output at comptime" {	...	@@ -152,7 +152,7 @@ test "FixedBufferStream output at comptime" {
152	}	152	}
153	}	153	}
154		154
155	test "FixedBufferStream output 2" {	155	test "output 2" {
156	var buffer: [10]u8 = undefined;	156	var buffer: [10]u8 = undefined;
157	var fbs = fixedBufferStream(&buffer);	157	var fbs = fixedBufferStream(&buffer);
158		158
...	@@ -175,7 +175,7 @@ test "FixedBufferStream output 2" {	...	@@ -175,7 +175,7 @@ test "FixedBufferStream output 2" {
175	try testing.expectError(error.NoSpaceLeft, fbs.writer().writeAll("H"));	175	try testing.expectError(error.NoSpaceLeft, fbs.writer().writeAll("H"));
176	}	176	}
177		177
178	test "FixedBufferStream input" {	178	test "input" {
179	const bytes = [_]u8{ 1, 2, 3, 4, 5, 6, 7 };	179	const bytes = [_]u8{ 1, 2, 3, 4, 5, 6, 7 };
180	var fbs = fixedBufferStream(&bytes);	180	var fbs = fixedBufferStream(&bytes);
181		181

...	@@ -35,7 +35,7 @@ fn expectPeekNext(scanner_or_reader: anytype, expected_token_type: TokenType, ex	...	@@ -35,7 +35,7 @@ fn expectPeekNext(scanner_or_reader: anytype, expected_token_type: TokenType, ex
35	try expectEqualTokens(expected_token, try scanner_or_reader.next());	35	try expectEqualTokens(expected_token, try scanner_or_reader.next());
36	}	36	}
37		37
38	test "json.token" {	38	test "token" {
39	var scanner = JsonScanner.initCompleteInput(std.testing.allocator, example_document_str);	39	var scanner = JsonScanner.initCompleteInput(std.testing.allocator, example_document_str);
40	defer scanner.deinit();	40	defer scanner.deinit();
41		41
...	@@ -153,7 +153,7 @@ test "peek all types" {	...	@@ -153,7 +153,7 @@ test "peek all types" {
153	try testAllTypes(&tiny_json_reader, false);	153	try testAllTypes(&tiny_json_reader, false);
154	}	154	}
155		155
156	test "json.token mismatched close" {	156	test "token mismatched close" {
157	var scanner = JsonScanner.initCompleteInput(std.testing.allocator, "[102, 111, 111 }");	157	var scanner = JsonScanner.initCompleteInput(std.testing.allocator, "[102, 111, 111 }");
158	defer scanner.deinit();	158	defer scanner.deinit();
159	try expectNext(&scanner, .array_begin);	159	try expectNext(&scanner, .array_begin);
...	@@ -163,7 +163,7 @@ test "json.token mismatched close" {	...	@@ -163,7 +163,7 @@ test "json.token mismatched close" {
163	try std.testing.expectError(error.SyntaxError, scanner.next());	163	try std.testing.expectError(error.SyntaxError, scanner.next());
164	}	164	}
165		165
166	test "json.token premature object close" {	166	test "token premature object close" {
167	var scanner = JsonScanner.initCompleteInput(std.testing.allocator, "{ \"key\": }");	167	var scanner = JsonScanner.initCompleteInput(std.testing.allocator, "{ \"key\": }");
168	defer scanner.deinit();	168	defer scanner.deinit();
169	try expectNext(&scanner, .object_begin);	169	try expectNext(&scanner, .object_begin);
...	@@ -353,7 +353,7 @@ test "BufferUnderrun" {	...	@@ -353,7 +353,7 @@ test "BufferUnderrun" {
353	}	353	}
354	}	354	}
355		355
356	test "json.validate" {	356	test "validate" {
357	try std.testing.expectEqual(true, try validate(std.testing.allocator, "{}"));	357	try std.testing.expectEqual(true, try validate(std.testing.allocator, "{}"));
358	try std.testing.expectEqual(true, try validate(std.testing.allocator, "[]"));	358	try std.testing.expectEqual(true, try validate(std.testing.allocator, "[]"));
359	try std.testing.expectEqual(false, try validate(std.testing.allocator, "[{[[[[{}]]]]}]"));	359	try std.testing.expectEqual(false, try validate(std.testing.allocator, "[{[[[[{}]]]]}]"));

...	@@ -148,12 +148,12 @@ fn acos64(x: f64) f64 {	...	@@ -148,12 +148,12 @@ fn acos64(x: f64) f64 {
148	return 2 * (df + w);	148	return 2 * (df + w);
149	}	149	}
150		150
151	test "math.acos" {	151	test acos {
152	try expect(acos(@as(f32, 0.0)) == acos32(0.0));	152	try expect(acos(@as(f32, 0.0)) == acos32(0.0));
153	try expect(acos(@as(f64, 0.0)) == acos64(0.0));	153	try expect(acos(@as(f64, 0.0)) == acos64(0.0));
154	}	154	}
155		155
156	test "math.acos32" {	156	test acos32 {
157	const epsilon = 0.000001;	157	const epsilon = 0.000001;
158		158
159	try expect(math.approxEqAbs(f32, acos32(0.0), 1.570796, epsilon));	159	try expect(math.approxEqAbs(f32, acos32(0.0), 1.570796, epsilon));
...	@@ -164,7 +164,7 @@ test "math.acos32" {	...	@@ -164,7 +164,7 @@ test "math.acos32" {
164	try expect(math.approxEqAbs(f32, acos32(-0.2), 1.772154, epsilon));	164	try expect(math.approxEqAbs(f32, acos32(-0.2), 1.772154, epsilon));
165	}	165	}
166		166
167	test "math.acos64" {	167	test acos64 {
168	const epsilon = 0.000001;	168	const epsilon = 0.000001;
169		169
170	try expect(math.approxEqAbs(f64, acos64(0.0), 1.570796, epsilon));	170	try expect(math.approxEqAbs(f64, acos64(0.0), 1.570796, epsilon));
...	@@ -175,12 +175,12 @@ test "math.acos64" {	...	@@ -175,12 +175,12 @@ test "math.acos64" {
175	try expect(math.approxEqAbs(f64, acos64(-0.2), 1.772154, epsilon));	175	try expect(math.approxEqAbs(f64, acos64(-0.2), 1.772154, epsilon));
176	}	176	}
177		177
178	test "math.acos32.special" {	178	test "acos32.special" {
179	try expect(math.isNan(acos32(-2)));	179	try expect(math.isNan(acos32(-2)));
180	try expect(math.isNan(acos32(1.5)));	180	try expect(math.isNan(acos32(1.5)));
181	}	181	}
182		182
183	test "math.acos64.special" {	183	test "acos64.special" {
184	try expect(math.isNan(acos64(-2)));	184	try expect(math.isNan(acos64(-2)));
185	try expect(math.isNan(acos64(1.5)));	185	try expect(math.isNan(acos64(1.5)));
186	}	186	}

...	@@ -59,12 +59,12 @@ fn acosh64(x: f64) f64 {	...	@@ -59,12 +59,12 @@ fn acosh64(x: f64) f64 {
59	}	59	}
60	}	60	}
61		61
62	test "math.acosh" {	62	test acosh {
63	try expect(acosh(@as(f32, 1.5)) == acosh32(1.5));	63	try expect(acosh(@as(f32, 1.5)) == acosh32(1.5));
64	try expect(acosh(@as(f64, 1.5)) == acosh64(1.5));	64	try expect(acosh(@as(f64, 1.5)) == acosh64(1.5));
65	}	65	}
66		66
67	test "math.acosh32" {	67	test acosh32 {
68	const epsilon = 0.000001;	68	const epsilon = 0.000001;
69		69
70	try expect(math.approxEqAbs(f32, acosh32(1.5), 0.962424, epsilon));	70	try expect(math.approxEqAbs(f32, acosh32(1.5), 0.962424, epsilon));
...	@@ -73,7 +73,7 @@ test "math.acosh32" {	...	@@ -73,7 +73,7 @@ test "math.acosh32" {
73	try expect(math.approxEqAbs(f32, acosh32(123123.234375), 12.414088, epsilon));	73	try expect(math.approxEqAbs(f32, acosh32(123123.234375), 12.414088, epsilon));
74	}	74	}
75		75
76	test "math.acosh64" {	76	test acosh64 {
77	const epsilon = 0.000001;	77	const epsilon = 0.000001;
78		78
79	try expect(math.approxEqAbs(f64, acosh64(1.5), 0.962424, epsilon));	79	try expect(math.approxEqAbs(f64, acosh64(1.5), 0.962424, epsilon));
...	@@ -82,12 +82,12 @@ test "math.acosh64" {	...	@@ -82,12 +82,12 @@ test "math.acosh64" {
82	try expect(math.approxEqAbs(f64, acosh64(123123.234375), 12.414088, epsilon));	82	try expect(math.approxEqAbs(f64, acosh64(123123.234375), 12.414088, epsilon));
83	}	83	}
84		84
85	test "math.acosh32.special" {	85	test "acosh32.special" {
86	try expect(math.isNan(acosh32(math.nan(f32))));	86	try expect(math.isNan(acosh32(math.nan(f32))));
87	try expect(math.isNan(acosh32(0.5)));	87	try expect(math.isNan(acosh32(0.5)));
88	}	88	}
89		89
90	test "math.acosh64.special" {	90	test "acosh64.special" {
91	try expect(math.isNan(acosh64(math.nan(f64))));	91	try expect(math.isNan(acosh64(math.nan(f64))));
92	try expect(math.isNan(acosh64(0.5)));	92	try expect(math.isNan(acosh64(0.5)));
93	}	93	}

...	@@ -141,12 +141,12 @@ fn asin64(x: f64) f64 {	...	@@ -141,12 +141,12 @@ fn asin64(x: f64) f64 {
141	}	141	}
142	}	142	}
143		143
144	test "math.asin" {	144	test asin {
145	try expect(asin(@as(f32, 0.0)) == asin32(0.0));	145	try expect(asin(@as(f32, 0.0)) == asin32(0.0));
146	try expect(asin(@as(f64, 0.0)) == asin64(0.0));	146	try expect(asin(@as(f64, 0.0)) == asin64(0.0));
147	}	147	}
148		148
149	test "math.asin32" {	149	test asin32 {
150	const epsilon = 0.000001;	150	const epsilon = 0.000001;
151		151
152	try expect(math.approxEqAbs(f32, asin32(0.0), 0.0, epsilon));	152	try expect(math.approxEqAbs(f32, asin32(0.0), 0.0, epsilon));
...	@@ -157,7 +157,7 @@ test "math.asin32" {	...	@@ -157,7 +157,7 @@ test "math.asin32" {
157	try expect(math.approxEqAbs(f32, asin32(0.8923), 1.102415, epsilon));	157	try expect(math.approxEqAbs(f32, asin32(0.8923), 1.102415, epsilon));
158	}	158	}
159		159
160	test "math.asin64" {	160	test asin64 {
161	const epsilon = 0.000001;	161	const epsilon = 0.000001;
162		162
163	try expect(math.approxEqAbs(f64, asin64(0.0), 0.0, epsilon));	163	try expect(math.approxEqAbs(f64, asin64(0.0), 0.0, epsilon));
...	@@ -168,14 +168,14 @@ test "math.asin64" {	...	@@ -168,14 +168,14 @@ test "math.asin64" {
168	try expect(math.approxEqAbs(f64, asin64(0.8923), 1.102415, epsilon));	168	try expect(math.approxEqAbs(f64, asin64(0.8923), 1.102415, epsilon));
169	}	169	}
170		170
171	test "math.asin32.special" {	171	test "asin32.special" {
172	try expect(math.isPositiveZero(asin32(0.0)));	172	try expect(math.isPositiveZero(asin32(0.0)));
173	try expect(math.isNegativeZero(asin32(-0.0)));	173	try expect(math.isNegativeZero(asin32(-0.0)));
174	try expect(math.isNan(asin32(-2)));	174	try expect(math.isNan(asin32(-2)));
175	try expect(math.isNan(asin32(1.5)));	175	try expect(math.isNan(asin32(1.5)));
176	}	176	}
177		177
178	test "math.asin64.special" {	178	test "asin64.special" {
179	try expect(math.isPositiveZero(asin64(0.0)));	179	try expect(math.isPositiveZero(asin64(0.0)));
180	try expect(math.isNegativeZero(asin64(-0.0)));	180	try expect(math.isNegativeZero(asin64(-0.0)));
181	try expect(math.isNan(asin64(-2)));	181	try expect(math.isNan(asin64(-2)));

...	@@ -80,12 +80,12 @@ fn asinh64(x: f64) f64 {	...	@@ -80,12 +80,12 @@ fn asinh64(x: f64) f64 {
80	return if (s != 0) -rx else rx;	80	return if (s != 0) -rx else rx;
81	}	81	}
82		82
83	test "math.asinh" {	83	test asinh {
84	try expect(asinh(@as(f32, 0.0)) == asinh32(0.0));	84	try expect(asinh(@as(f32, 0.0)) == asinh32(0.0));
85	try expect(asinh(@as(f64, 0.0)) == asinh64(0.0));	85	try expect(asinh(@as(f64, 0.0)) == asinh64(0.0));
86	}	86	}
87		87
88	test "math.asinh32" {	88	test asinh32 {
89	const epsilon = 0.000001;	89	const epsilon = 0.000001;
90		90
91	try expect(math.approxEqAbs(f32, asinh32(0.0), 0.0, epsilon));	91	try expect(math.approxEqAbs(f32, asinh32(0.0), 0.0, epsilon));
...	@@ -98,7 +98,7 @@ test "math.asinh32" {	...	@@ -98,7 +98,7 @@ test "math.asinh32" {
98	try expect(math.approxEqAbs(f32, asinh32(123123.234375), 12.414088, epsilon));	98	try expect(math.approxEqAbs(f32, asinh32(123123.234375), 12.414088, epsilon));
99	}	99	}
100		100
101	test "math.asinh64" {	101	test asinh64 {
102	const epsilon = 0.000001;	102	const epsilon = 0.000001;
103		103
104	try expect(math.approxEqAbs(f64, asinh64(0.0), 0.0, epsilon));	104	try expect(math.approxEqAbs(f64, asinh64(0.0), 0.0, epsilon));
...	@@ -111,7 +111,7 @@ test "math.asinh64" {	...	@@ -111,7 +111,7 @@ test "math.asinh64" {
111	try expect(math.approxEqAbs(f64, asinh64(123123.234375), 12.414088, epsilon));	111	try expect(math.approxEqAbs(f64, asinh64(123123.234375), 12.414088, epsilon));
112	}	112	}
113		113
114	test "math.asinh32.special" {	114	test "asinh32.special" {
115	try expect(math.isPositiveZero(asinh32(0.0)));	115	try expect(math.isPositiveZero(asinh32(0.0)));
116	try expect(math.isNegativeZero(asinh32(-0.0)));	116	try expect(math.isNegativeZero(asinh32(-0.0)));
117	try expect(math.isPositiveInf(asinh32(math.inf(f32))));	117	try expect(math.isPositiveInf(asinh32(math.inf(f32))));
...	@@ -119,7 +119,7 @@ test "math.asinh32.special" {	...	@@ -119,7 +119,7 @@ test "math.asinh32.special" {
119	try expect(math.isNan(asinh32(math.nan(f32))));	119	try expect(math.isNan(asinh32(math.nan(f32))));
120	}	120	}
121		121
122	test "math.asinh64.special" {	122	test "asinh64.special" {
123	try expect(math.isPositiveZero(asinh64(0.0)));	123	try expect(math.isPositiveZero(asinh64(0.0)));
124	try expect(math.isNegativeZero(asinh64(-0.0)));	124	try expect(math.isNegativeZero(asinh64(-0.0)));
125	try expect(math.isPositiveInf(asinh64(math.inf(f64))));	125	try expect(math.isPositiveInf(asinh64(math.inf(f64))));

...	@@ -84,12 +84,12 @@ fn atanh_64(x: f64) f64 {	...	@@ -84,12 +84,12 @@ fn atanh_64(x: f64) f64 {
84	return if (s != 0) -y else y;	84	return if (s != 0) -y else y;
85	}	85	}
86		86
87	test "math.atanh" {	87	test atanh {
88	try expect(atanh(@as(f32, 0.0)) == atanh_32(0.0));	88	try expect(atanh(@as(f32, 0.0)) == atanh_32(0.0));
89	try expect(atanh(@as(f64, 0.0)) == atanh_64(0.0));	89	try expect(atanh(@as(f64, 0.0)) == atanh_64(0.0));
90	}	90	}
91		91
92	test "math.atanh_32" {	92	test atanh_32 {
93	const epsilon = 0.000001;	93	const epsilon = 0.000001;
94		94
95	try expect(math.approxEqAbs(f32, atanh_32(0.0), 0.0, epsilon));	95	try expect(math.approxEqAbs(f32, atanh_32(0.0), 0.0, epsilon));
...	@@ -97,7 +97,7 @@ test "math.atanh_32" {	...	@@ -97,7 +97,7 @@ test "math.atanh_32" {
97	try expect(math.approxEqAbs(f32, atanh_32(0.8923), 1.433099, epsilon));	97	try expect(math.approxEqAbs(f32, atanh_32(0.8923), 1.433099, epsilon));
98	}	98	}
99		99
100	test "math.atanh_64" {	100	test atanh_64 {
101	const epsilon = 0.000001;	101	const epsilon = 0.000001;
102		102
103	try expect(math.approxEqAbs(f64, atanh_64(0.0), 0.0, epsilon));	103	try expect(math.approxEqAbs(f64, atanh_64(0.0), 0.0, epsilon));
...	@@ -105,7 +105,7 @@ test "math.atanh_64" {	...	@@ -105,7 +105,7 @@ test "math.atanh_64" {
105	try expect(math.approxEqAbs(f64, atanh_64(0.8923), 1.433099, epsilon));	105	try expect(math.approxEqAbs(f64, atanh_64(0.8923), 1.433099, epsilon));
106	}	106	}
107		107
108	test "math.atanh32.special" {	108	test "atanh32.special" {
109	try expect(math.isPositiveInf(atanh_32(1)));	109	try expect(math.isPositiveInf(atanh_32(1)));
110	try expect(math.isNegativeInf(atanh_32(-1)));	110	try expect(math.isNegativeInf(atanh_32(-1)));
111	try expect(math.isNan(atanh_32(1.5)));	111	try expect(math.isNan(atanh_32(1.5)));
...	@@ -113,7 +113,7 @@ test "math.atanh32.special" {	...	@@ -113,7 +113,7 @@ test "math.atanh32.special" {
113	try expect(math.isNan(atanh_32(math.nan(f32))));	113	try expect(math.isNan(atanh_32(math.nan(f32))));
114	}	114	}
115		115
116	test "math.atanh64.special" {	116	test "atanh64.special" {
117	try expect(math.isPositiveInf(atanh_64(1)));	117	try expect(math.isPositiveInf(atanh_64(1)));
118	try expect(math.isNegativeInf(atanh_64(-1)));	118	try expect(math.isNegativeInf(atanh_64(-1)));
119	try expect(math.isNan(atanh_64(1.5)));	119	try expect(math.isNan(atanh_64(1.5)));

...	@@ -493,7 +493,7 @@ fn extractLowBits(a: Int, comptime T: type) T {	...	@@ -493,7 +493,7 @@ fn extractLowBits(a: Int, comptime T: type) T {
493	}	493	}
494	}	494	}
495		495
496	test "big.rational extractLowBits" {	496	test extractLowBits {
497	var a = try Int.initSet(testing.allocator, 0x11112222333344441234567887654321);	497	var a = try Int.initSet(testing.allocator, 0x11112222333344441234567887654321);
498	defer a.deinit();	498	defer a.deinit();
499		499
...	@@ -513,7 +513,7 @@ test "big.rational extractLowBits" {	...	@@ -513,7 +513,7 @@ test "big.rational extractLowBits" {
513	try testing.expect(a5 == 0x11112222333344441234567887654321);	513	try testing.expect(a5 == 0x11112222333344441234567887654321);
514	}	514	}
515		515
516	test "big.rational set" {	516	test "set" {
517	var a = try Rational.init(testing.allocator);	517	var a = try Rational.init(testing.allocator);
518	defer a.deinit();	518	defer a.deinit();
519		519
...	@@ -542,7 +542,7 @@ test "big.rational set" {	...	@@ -542,7 +542,7 @@ test "big.rational set" {
542	try testing.expect((try a.q.to(i32)) == 1);	542	try testing.expect((try a.q.to(i32)) == 1);
543	}	543	}
544		544
545	test "big.rational setFloat" {	545	test "setFloat" {
546	var a = try Rational.init(testing.allocator);	546	var a = try Rational.init(testing.allocator);
547	defer a.deinit();	547	defer a.deinit();
548		548
...	@@ -567,7 +567,7 @@ test "big.rational setFloat" {	...	@@ -567,7 +567,7 @@ test "big.rational setFloat" {
567	try testing.expect((try a.q.to(u128)) == 70368744177664);	567	try testing.expect((try a.q.to(u128)) == 70368744177664);
568	}	568	}
569		569
570	test "big.rational setFloatString" {	570	test "setFloatString" {
571	var a = try Rational.init(testing.allocator);	571	var a = try Rational.init(testing.allocator);
572	defer a.deinit();	572	defer a.deinit();
573		573
...	@@ -578,7 +578,7 @@ test "big.rational setFloatString" {	...	@@ -578,7 +578,7 @@ test "big.rational setFloatString" {
578	try testing.expect((try a.q.to(u128)) == 100000000000000000000000000000000000);	578	try testing.expect((try a.q.to(u128)) == 100000000000000000000000000000000000);
579	}	579	}
580		580
581	test "big.rational toFloat" {	581	test "toFloat" {
582	var a = try Rational.init(testing.allocator);	582	var a = try Rational.init(testing.allocator);
583	defer a.deinit();	583	defer a.deinit();
584		584
...	@@ -591,7 +591,7 @@ test "big.rational toFloat" {	...	@@ -591,7 +591,7 @@ test "big.rational toFloat" {
591	try testing.expect((try a.toFloat(f64)) == 72.141593120712409172417410926841290461290467124);	591	try testing.expect((try a.toFloat(f64)) == 72.141593120712409172417410926841290461290467124);
592	}	592	}
593		593
594	test "big.rational set/to Float round-trip" {	594	test "set/to Float round-trip" {
595	var a = try Rational.init(testing.allocator);	595	var a = try Rational.init(testing.allocator);
596	defer a.deinit();	596	defer a.deinit();
597	var prng = std.Random.DefaultPrng.init(0x5EED);	597	var prng = std.Random.DefaultPrng.init(0x5EED);
...	@@ -604,7 +604,7 @@ test "big.rational set/to Float round-trip" {	...	@@ -604,7 +604,7 @@ test "big.rational set/to Float round-trip" {
604	}	604	}
605	}	605	}
606		606
607	test "big.rational copy" {	607	test "copy" {
608	var a = try Rational.init(testing.allocator);	608	var a = try Rational.init(testing.allocator);
609	defer a.deinit();	609	defer a.deinit();
610		610
...	@@ -634,7 +634,7 @@ test "big.rational copy" {	...	@@ -634,7 +634,7 @@ test "big.rational copy" {
634	try testing.expect((try a.q.to(u32)) == 1);	634	try testing.expect((try a.q.to(u32)) == 1);
635	}	635	}
636		636
637	test "big.rational negate" {	637	test "negate" {
638	var a = try Rational.init(testing.allocator);	638	var a = try Rational.init(testing.allocator);
639	defer a.deinit();	639	defer a.deinit();
640		640
...	@@ -651,7 +651,7 @@ test "big.rational negate" {	...	@@ -651,7 +651,7 @@ test "big.rational negate" {
651	try testing.expect((try a.q.to(i32)) == 1);	651	try testing.expect((try a.q.to(i32)) == 1);
652	}	652	}
653		653
654	test "big.rational abs" {	654	test "abs" {
655	var a = try Rational.init(testing.allocator);	655	var a = try Rational.init(testing.allocator);
656	defer a.deinit();	656	defer a.deinit();
657		657
...	@@ -668,7 +668,7 @@ test "big.rational abs" {	...	@@ -668,7 +668,7 @@ test "big.rational abs" {
668	try testing.expect((try a.q.to(i32)) == 1);	668	try testing.expect((try a.q.to(i32)) == 1);
669	}	669	}
670		670
671	test "big.rational swap" {	671	test "swap" {
672	var a = try Rational.init(testing.allocator);	672	var a = try Rational.init(testing.allocator);
673	defer a.deinit();	673	defer a.deinit();
674	var b = try Rational.init(testing.allocator);	674	var b = try Rational.init(testing.allocator);
...	@@ -692,7 +692,7 @@ test "big.rational swap" {	...	@@ -692,7 +692,7 @@ test "big.rational swap" {
692	try testing.expect((try b.q.to(u32)) == 23);	692	try testing.expect((try b.q.to(u32)) == 23);
693	}	693	}
694		694
695	test "big.rational order" {	695	test "order" {
696	var a = try Rational.init(testing.allocator);	696	var a = try Rational.init(testing.allocator);
697	defer a.deinit();	697	defer a.deinit();
698	var b = try Rational.init(testing.allocator);	698	var b = try Rational.init(testing.allocator);
...	@@ -707,7 +707,7 @@ test "big.rational order" {	...	@@ -707,7 +707,7 @@ test "big.rational order" {
707	try testing.expect((try a.order(b)) == .eq);	707	try testing.expect((try a.order(b)) == .eq);
708	}	708	}
709		709
710	test "big.rational order/orderAbs with negative" {	710	test "order/orderAbs with negative" {
711	var a = try Rational.init(testing.allocator);	711	var a = try Rational.init(testing.allocator);
712	defer a.deinit();	712	defer a.deinit();
713	var b = try Rational.init(testing.allocator);	713	var b = try Rational.init(testing.allocator);
...	@@ -719,7 +719,7 @@ test "big.rational order/orderAbs with negative" {	...	@@ -719,7 +719,7 @@ test "big.rational order/orderAbs with negative" {
719	try testing.expect((try a.orderAbs(b)) == .lt);	719	try testing.expect((try a.orderAbs(b)) == .lt);
720	}	720	}
721		721
722	test "big.rational add single-limb" {	722	test "add single-limb" {
723	var a = try Rational.init(testing.allocator);	723	var a = try Rational.init(testing.allocator);
724	defer a.deinit();	724	defer a.deinit();
725	var b = try Rational.init(testing.allocator);	725	var b = try Rational.init(testing.allocator);
...	@@ -734,7 +734,7 @@ test "big.rational add single-limb" {	...	@@ -734,7 +734,7 @@ test "big.rational add single-limb" {
734	try testing.expect((try a.order(b)) == .eq);	734	try testing.expect((try a.order(b)) == .eq);
735	}	735	}
736		736
737	test "big.rational add" {	737	test "add" {
738	var a = try Rational.init(testing.allocator);	738	var a = try Rational.init(testing.allocator);
739	defer a.deinit();	739	defer a.deinit();
740	var b = try Rational.init(testing.allocator);	740	var b = try Rational.init(testing.allocator);
...	@@ -750,7 +750,7 @@ test "big.rational add" {	...	@@ -750,7 +750,7 @@ test "big.rational add" {
750	try testing.expect((try a.order(r)) == .eq);	750	try testing.expect((try a.order(r)) == .eq);
751	}	751	}
752		752
753	test "big.rational sub" {	753	test "sub" {
754	var a = try Rational.init(testing.allocator);	754	var a = try Rational.init(testing.allocator);
755	defer a.deinit();	755	defer a.deinit();
756	var b = try Rational.init(testing.allocator);	756	var b = try Rational.init(testing.allocator);
...	@@ -766,7 +766,7 @@ test "big.rational sub" {	...	@@ -766,7 +766,7 @@ test "big.rational sub" {
766	try testing.expect((try a.order(r)) == .eq);	766	try testing.expect((try a.order(r)) == .eq);
767	}	767	}
768		768
769	test "big.rational mul" {	769	test "mul" {
770	var a = try Rational.init(testing.allocator);	770	var a = try Rational.init(testing.allocator);
771	defer a.deinit();	771	defer a.deinit();
772	var b = try Rational.init(testing.allocator);	772	var b = try Rational.init(testing.allocator);
...	@@ -782,7 +782,7 @@ test "big.rational mul" {	...	@@ -782,7 +782,7 @@ test "big.rational mul" {
782	try testing.expect((try a.order(r)) == .eq);	782	try testing.expect((try a.order(r)) == .eq);
783	}	783	}
784		784
785	test "big.rational div" {	785	test "div" {
786	{	786	{
787	var a = try Rational.init(testing.allocator);	787	var a = try Rational.init(testing.allocator);
788	defer a.deinit();	788	defer a.deinit();

...	@@ -119,12 +119,12 @@ fn cbrt64(x: f64) f64 {	...	@@ -119,12 +119,12 @@ fn cbrt64(x: f64) f64 {
119	return t + t * q;	119	return t + t * q;
120	}	120	}
121		121
122	test "math.cbrt" {	122	test cbrt {
123	try expect(cbrt(@as(f32, 0.0)) == cbrt32(0.0));	123	try expect(cbrt(@as(f32, 0.0)) == cbrt32(0.0));
124	try expect(cbrt(@as(f64, 0.0)) == cbrt64(0.0));	124	try expect(cbrt(@as(f64, 0.0)) == cbrt64(0.0));
125	}	125	}
126		126
127	test "math.cbrt32" {	127	test cbrt32 {
128	const epsilon = 0.000001;	128	const epsilon = 0.000001;
129		129
130	try expect(math.isPositiveZero(cbrt32(0.0)));	130	try expect(math.isPositiveZero(cbrt32(0.0)));
...	@@ -135,7 +135,7 @@ test "math.cbrt32" {	...	@@ -135,7 +135,7 @@ test "math.cbrt32" {
135	try expect(math.approxEqAbs(f32, cbrt32(123123.234375), 49.748501, epsilon));	135	try expect(math.approxEqAbs(f32, cbrt32(123123.234375), 49.748501, epsilon));
136	}	136	}
137		137
138	test "math.cbrt64" {	138	test cbrt64 {
139	const epsilon = 0.000001;	139	const epsilon = 0.000001;
140		140
141	try expect(math.isPositiveZero(cbrt64(0.0)));	141	try expect(math.isPositiveZero(cbrt64(0.0)));
...	@@ -146,7 +146,7 @@ test "math.cbrt64" {	...	@@ -146,7 +146,7 @@ test "math.cbrt64" {
146	try expect(math.approxEqAbs(f64, cbrt64(123123.234375), 49.748501, epsilon));	146	try expect(math.approxEqAbs(f64, cbrt64(123123.234375), 49.748501, epsilon));
147	}	147	}
148		148
149	test "math.cbrt.special" {	149	test "cbrt.special" {
150	try expect(math.isPositiveZero(cbrt32(0.0)));	150	try expect(math.isPositiveZero(cbrt32(0.0)));
151	try expect(@as(u32, @bitCast(cbrt32(-0.0))) == @as(u32, 0x80000000));	151	try expect(@as(u32, @bitCast(cbrt32(-0.0))) == @as(u32, 0x80000000));
152	try expect(math.isPositiveInf(cbrt32(math.inf(f32))));	152	try expect(math.isPositiveInf(cbrt32(math.inf(f32))));
...	@@ -154,7 +154,7 @@ test "math.cbrt.special" {	...	@@ -154,7 +154,7 @@ test "math.cbrt.special" {
154	try expect(math.isNan(cbrt32(math.nan(f32))));	154	try expect(math.isNan(cbrt32(math.nan(f32))));
155	}	155	}
156		156
157	test "math.cbrt64.special" {	157	test "cbrt64.special" {
158	try expect(math.isPositiveZero(cbrt64(0.0)));	158	try expect(math.isPositiveZero(cbrt64(0.0)));
159	try expect(math.isNegativeZero(cbrt64(-0.0)));	159	try expect(math.isNegativeZero(cbrt64(-0.0)));
160	try expect(math.isPositiveInf(cbrt64(math.inf(f64))));	160	try expect(math.isPositiveInf(cbrt64(math.inf(f64))));

...	@@ -86,12 +86,12 @@ fn cosh64(x: f64) f64 {	...	@@ -86,12 +86,12 @@ fn cosh64(x: f64) f64 {
86	return expo2(ax);	86	return expo2(ax);
87	}	87	}
88		88
89	test "math.cosh" {	89	test cosh {
90	try expect(cosh(@as(f32, 1.5)) == cosh32(1.5));	90	try expect(cosh(@as(f32, 1.5)) == cosh32(1.5));
91	try expect(cosh(@as(f64, 1.5)) == cosh64(1.5));	91	try expect(cosh(@as(f64, 1.5)) == cosh64(1.5));
92	}	92	}
93		93
94	test "math.cosh32" {	94	test cosh32 {
95	const epsilon = 0.000001;	95	const epsilon = 0.000001;
96		96
97	try expect(math.approxEqAbs(f32, cosh32(0.0), 1.0, epsilon));	97	try expect(math.approxEqAbs(f32, cosh32(0.0), 1.0, epsilon));
...	@@ -104,7 +104,7 @@ test "math.cosh32" {	...	@@ -104,7 +104,7 @@ test "math.cosh32" {
104	try expect(math.approxEqAbs(f32, cosh32(-1.5), 2.352410, epsilon));	104	try expect(math.approxEqAbs(f32, cosh32(-1.5), 2.352410, epsilon));
105	}	105	}
106		106
107	test "math.cosh64" {	107	test cosh64 {
108	const epsilon = 0.000001;	108	const epsilon = 0.000001;
109		109
110	try expect(math.approxEqAbs(f64, cosh64(0.0), 1.0, epsilon));	110	try expect(math.approxEqAbs(f64, cosh64(0.0), 1.0, epsilon));
...	@@ -117,7 +117,7 @@ test "math.cosh64" {	...	@@ -117,7 +117,7 @@ test "math.cosh64" {
117	try expect(math.approxEqAbs(f64, cosh64(-1.5), 2.352410, epsilon));	117	try expect(math.approxEqAbs(f64, cosh64(-1.5), 2.352410, epsilon));
118	}	118	}
119		119
120	test "math.cosh32.special" {	120	test "cosh32.special" {
121	try expect(cosh32(0.0) == 1.0);	121	try expect(cosh32(0.0) == 1.0);
122	try expect(cosh32(-0.0) == 1.0);	122	try expect(cosh32(-0.0) == 1.0);
123	try expect(math.isPositiveInf(cosh32(math.inf(f32))));	123	try expect(math.isPositiveInf(cosh32(math.inf(f32))));
...	@@ -125,7 +125,7 @@ test "math.cosh32.special" {	...	@@ -125,7 +125,7 @@ test "math.cosh32.special" {
125	try expect(math.isNan(cosh32(math.nan(f32))));	125	try expect(math.isNan(cosh32(math.nan(f32))));
126	}	126	}
127		127
128	test "math.cosh64.special" {	128	test "cosh64.special" {
129	try expect(cosh64(0.0) == 1.0);	129	try expect(cosh64(0.0) == 1.0);
130	try expect(cosh64(-0.0) == 1.0);	130	try expect(cosh64(-0.0) == 1.0);
131	try expect(math.isPositiveInf(cosh64(math.inf(f64))));	131	try expect(math.isPositiveInf(cosh64(math.inf(f64))));

...	@@ -286,12 +286,12 @@ fn expm1_64(x_: f64) f64 {	...	@@ -286,12 +286,12 @@ fn expm1_64(x_: f64) f64 {
286	}	286	}
287	}	287	}
288		288
289	test "math.exp1m" {	289	test expm1 {
290	try expect(expm1(@as(f32, 0.0)) == expm1_32(0.0));	290	try expect(expm1(@as(f32, 0.0)) == expm1_32(0.0));
291	try expect(expm1(@as(f64, 0.0)) == expm1_64(0.0));	291	try expect(expm1(@as(f64, 0.0)) == expm1_64(0.0));
292	}	292	}
293		293
294	test "math.expm1_32" {	294	test expm1_32 {
295	const epsilon = 0.000001;	295	const epsilon = 0.000001;
296		296
297	try expect(math.isPositiveZero(expm1_32(0.0)));	297	try expect(math.isPositiveZero(expm1_32(0.0)));
...	@@ -301,7 +301,7 @@ test "math.expm1_32" {	...	@@ -301,7 +301,7 @@ test "math.expm1_32" {
301	try expect(math.approxEqAbs(f32, expm1_32(1.5), 3.481689, epsilon));	301	try expect(math.approxEqAbs(f32, expm1_32(1.5), 3.481689, epsilon));
302	}	302	}
303		303
304	test "math.expm1_64" {	304	test expm1_64 {
305	const epsilon = 0.000001;	305	const epsilon = 0.000001;
306		306
307	try expect(math.isPositiveZero(expm1_64(0.0)));	307	try expect(math.isPositiveZero(expm1_64(0.0)));
...	@@ -311,13 +311,13 @@ test "math.expm1_64" {	...	@@ -311,13 +311,13 @@ test "math.expm1_64" {
311	try expect(math.approxEqAbs(f64, expm1_64(1.5), 3.481689, epsilon));	311	try expect(math.approxEqAbs(f64, expm1_64(1.5), 3.481689, epsilon));
312	}	312	}
313		313
314	test "math.expm1_32.special" {	314	test "expm1_32.special" {
315	try expect(math.isPositiveInf(expm1_32(math.inf(f32))));	315	try expect(math.isPositiveInf(expm1_32(math.inf(f32))));
316	try expect(expm1_32(-math.inf(f32)) == -1.0);	316	try expect(expm1_32(-math.inf(f32)) == -1.0);
317	try expect(math.isNan(expm1_32(math.nan(f32))));	317	try expect(math.isNan(expm1_32(math.nan(f32))));
318	}	318	}
319		319
320	test "math.expm1_64.special" {	320	test "expm1_64.special" {
321	try expect(math.isPositiveInf(expm1_64(math.inf(f64))));	321	try expect(math.isPositiveInf(expm1_64(math.inf(f64))));
322	try expect(expm1_64(-math.inf(f64)) == -1.0);	322	try expect(expm1_64(-math.inf(f64)) == -1.0);
323	try expect(math.isNan(expm1_64(math.nan(f64))));	323	try expect(math.isNan(expm1_64(math.nan(f64))));

...	@@ -132,7 +132,7 @@ test "float bits" {	...	@@ -132,7 +132,7 @@ test "float bits" {
132	}	132	}
133	}	133	}
134		134
135	test "math.inf" {	135	test inf {
136	const inf_u16: u16 = 0x7C00;	136	const inf_u16: u16 = 0x7C00;
137	const inf_u32: u32 = 0x7F800000;	137	const inf_u32: u32 = 0x7F800000;
138	const inf_u64: u64 = 0x7FF0000000000000;	138	const inf_u64: u64 = 0x7FF0000000000000;
...	@@ -145,7 +145,7 @@ test "math.inf" {	...	@@ -145,7 +145,7 @@ test "math.inf" {
145	try expectEqual(inf_u128, @as(u128, @bitCast(inf(f128))));	145	try expectEqual(inf_u128, @as(u128, @bitCast(inf(f128))));
146	}	146	}
147		147
148	test "math.nan" {	148	test nan {
149	const qnan_u16: u16 = 0x7E00;	149	const qnan_u16: u16 = 0x7E00;
150	const qnan_u32: u32 = 0x7FC00000;	150	const qnan_u32: u32 = 0x7FC00000;
151	const qnan_u64: u64 = 0x7FF8000000000000;	151	const qnan_u64: u64 = 0x7FF8000000000000;
...	@@ -158,7 +158,7 @@ test "math.nan" {	...	@@ -158,7 +158,7 @@ test "math.nan" {
158	try expectEqual(qnan_u128, @as(u128, @bitCast(nan(f128))));	158	try expectEqual(qnan_u128, @as(u128, @bitCast(nan(f128))));
159	}	159	}
160		160
161	test "math.snan" {	161	test snan {
162	// TODO: https://github.com/ziglang/zig/issues/14366	162	// TODO: https://github.com/ziglang/zig/issues/14366
163	if (builtin.zig_backend == .stage2_llvm and comptime builtin.cpu.arch.isArmOrThumb()) return error.SkipZigTest;	163	if (builtin.zig_backend == .stage2_llvm and comptime builtin.cpu.arch.isArmOrThumb()) return error.SkipZigTest;
164		164

...	@@ -240,7 +240,7 @@ const expect = std.testing.expect;	...	@@ -240,7 +240,7 @@ const expect = std.testing.expect;
240	const expectEqual = std.testing.expectEqual;	240	const expectEqual = std.testing.expectEqual;
241	const expectApproxEqRel = std.testing.expectApproxEqRel;	241	const expectApproxEqRel = std.testing.expectApproxEqRel;
242		242
243	test "math.gamma" {	243	test gamma {
244	inline for (&.{ f32, f64 }) \|T\| {	244	inline for (&.{ f32, f64 }) \|T\| {
245	const eps = @sqrt(std.math.floatEps(T));	245	const eps = @sqrt(std.math.floatEps(T));
246	try expectApproxEqRel(@as(T, 120), gamma(T, 6), eps);	246	try expectApproxEqRel(@as(T, 120), gamma(T, 6), eps);
...	@@ -261,7 +261,7 @@ test "math.gamma" {	...	@@ -261,7 +261,7 @@ test "math.gamma" {
261	}	261	}
262	}	262	}
263		263
264	test "math.gamma.special" {	264	test "gamma.special" {
265	inline for (&.{ f32, f64 }) \|T\| {	265	inline for (&.{ f32, f64 }) \|T\| {
266	try expect(std.math.isNan(gamma(T, -std.math.nan(T))));	266	try expect(std.math.isNan(gamma(T, -std.math.nan(T))));
267	try expect(std.math.isNan(gamma(T, std.math.nan(T))));	267	try expect(std.math.isNan(gamma(T, std.math.nan(T))));
...	@@ -286,7 +286,7 @@ test "math.gamma.special" {	...	@@ -286,7 +286,7 @@ test "math.gamma.special" {
286	}	286	}
287	}	287	}
288		288
289	test "math.lgamma" {	289	test lgamma {
290	inline for (&.{ f32, f64 }) \|T\| {	290	inline for (&.{ f32, f64 }) \|T\| {
291	const eps = @sqrt(std.math.floatEps(T));	291	const eps = @sqrt(std.math.floatEps(T));
292	try expectApproxEqRel(@as(T, @log(24.0)), lgamma(T, 5), eps);	292	try expectApproxEqRel(@as(T, @log(24.0)), lgamma(T, 5), eps);
...	@@ -307,7 +307,7 @@ test "math.lgamma" {	...	@@ -307,7 +307,7 @@ test "math.lgamma" {
307	}	307	}
308	}	308	}
309		309
310	test "math.lgamma.special" {	310	test "lgamma.special" {
311	inline for (&.{ f32, f64 }) \|T\| {	311	inline for (&.{ f32, f64 }) \|T\| {
312	try expect(std.math.isNan(lgamma(T, -std.math.nan(T))));	312	try expect(std.math.isNan(lgamma(T, -std.math.nan(T))));
313	try expect(std.math.isNan(lgamma(T, std.math.nan(T))));	313	try expect(std.math.isNan(lgamma(T, std.math.nan(T))));

...	@@ -124,7 +124,7 @@ fn hypot64(x: f64, y: f64) f64 {	...	@@ -124,7 +124,7 @@ fn hypot64(x: f64, y: f64) f64 {
124	return z * @sqrt(ly + lx + hy + hx);	124	return z * @sqrt(ly + lx + hy + hx);
125	}	125	}
126		126
127	test "math.hypot" {	127	test hypot {
128	const x32: f32 = 0.0;	128	const x32: f32 = 0.0;
129	const y32: f32 = -1.2;	129	const y32: f32 = -1.2;
130	const x64: f64 = 0.0;	130	const x64: f64 = 0.0;
...	@@ -133,7 +133,7 @@ test "math.hypot" {	...	@@ -133,7 +133,7 @@ test "math.hypot" {
133	try expect(hypot(x64, y64) == hypot64(0.0, -1.2));	133	try expect(hypot(x64, y64) == hypot64(0.0, -1.2));
134	}	134	}
135		135
136	test "math.hypot32" {	136	test hypot32 {
137	const epsilon = 0.000001;	137	const epsilon = 0.000001;
138		138
139	try expect(math.approxEqAbs(f32, hypot32(0.0, -1.2), 1.2, epsilon));	139	try expect(math.approxEqAbs(f32, hypot32(0.0, -1.2), 1.2, epsilon));
...	@@ -145,7 +145,7 @@ test "math.hypot32" {	...	@@ -145,7 +145,7 @@ test "math.hypot32" {
145	try expect(math.approxEqAbs(f32, hypot32(123123.234375, 529428.707813), 543556.875, epsilon));	145	try expect(math.approxEqAbs(f32, hypot32(123123.234375, 529428.707813), 543556.875, epsilon));
146	}	146	}
147		147
148	test "math.hypot64" {	148	test hypot64 {
149	const epsilon = 0.000001;	149	const epsilon = 0.000001;
150		150
151	try expect(math.approxEqAbs(f64, hypot64(0.0, -1.2), 1.2, epsilon));	151	try expect(math.approxEqAbs(f64, hypot64(0.0, -1.2), 1.2, epsilon));
...	@@ -157,7 +157,7 @@ test "math.hypot64" {	...	@@ -157,7 +157,7 @@ test "math.hypot64" {
157	try expect(math.approxEqAbs(f64, hypot64(123123.234375, 529428.707813), 543556.885247, epsilon));	157	try expect(math.approxEqAbs(f64, hypot64(123123.234375, 529428.707813), 543556.885247, epsilon));
158	}	158	}
159		159
160	test "math.hypot32.special" {	160	test "hypot32.special" {
161	try expect(math.isPositiveInf(hypot32(math.inf(f32), 0.0)));	161	try expect(math.isPositiveInf(hypot32(math.inf(f32), 0.0)));
162	try expect(math.isPositiveInf(hypot32(-math.inf(f32), 0.0)));	162	try expect(math.isPositiveInf(hypot32(-math.inf(f32), 0.0)));
163	try expect(math.isPositiveInf(hypot32(0.0, math.inf(f32))));	163	try expect(math.isPositiveInf(hypot32(0.0, math.inf(f32))));
...	@@ -166,7 +166,7 @@ test "math.hypot32.special" {	...	@@ -166,7 +166,7 @@ test "math.hypot32.special" {
166	try expect(math.isNan(hypot32(0.0, math.nan(f32))));	166	try expect(math.isNan(hypot32(0.0, math.nan(f32))));
167	}	167	}
168		168
169	test "math.hypot64.special" {	169	test "hypot64.special" {
170	try expect(math.isPositiveInf(hypot64(math.inf(f64), 0.0)));	170	try expect(math.isPositiveInf(hypot64(math.inf(f64), 0.0)));
171	try expect(math.isPositiveInf(hypot64(-math.inf(f64), 0.0)));	171	try expect(math.isPositiveInf(hypot64(-math.inf(f64), 0.0)));
172	try expect(math.isPositiveInf(hypot64(0.0, math.inf(f64))));	172	try expect(math.isPositiveInf(hypot64(0.0, math.inf(f64))));

...	@@ -20,7 +20,7 @@ pub inline fn isNegativeInf(x: anytype) bool {	...	@@ -20,7 +20,7 @@ pub inline fn isNegativeInf(x: anytype) bool {
20	return x == -math.inf(@TypeOf(x));	20	return x == -math.inf(@TypeOf(x));
21	}	21	}
22		22
23	test "math.isInf" {	23	test isInf {
24	inline for ([_]type{ f16, f32, f64, f80, f128 }) \|T\| {	24	inline for ([_]type{ f16, f32, f64, f80, f128 }) \|T\| {
25	try expect(!isInf(@as(T, 0.0)));	25	try expect(!isInf(@as(T, 0.0)));
26	try expect(!isInf(@as(T, -0.0)));	26	try expect(!isInf(@as(T, -0.0)));
...	@@ -31,7 +31,7 @@ test "math.isInf" {	...	@@ -31,7 +31,7 @@ test "math.isInf" {
31	}	31	}
32	}	32	}
33		33
34	test "math.isPositiveInf" {	34	test isPositiveInf {
35	inline for ([_]type{ f16, f32, f64, f80, f128 }) \|T\| {	35	inline for ([_]type{ f16, f32, f64, f80, f128 }) \|T\| {
36	try expect(!isPositiveInf(@as(T, 0.0)));	36	try expect(!isPositiveInf(@as(T, 0.0)));
37	try expect(!isPositiveInf(@as(T, -0.0)));	37	try expect(!isPositiveInf(@as(T, -0.0)));
...	@@ -42,7 +42,7 @@ test "math.isPositiveInf" {	...	@@ -42,7 +42,7 @@ test "math.isPositiveInf" {
42	}	42	}
43	}	43	}
44		44
45	test "math.isNegativeInf" {	45	test isNegativeInf {
46	inline for ([_]type{ f16, f32, f64, f80, f128 }) \|T\| {	46	inline for ([_]type{ f16, f32, f64, f80, f128 }) \|T\| {
47	try expect(!isNegativeInf(@as(T, 0.0)));	47	try expect(!isNegativeInf(@as(T, 0.0)));
48	try expect(!isNegativeInf(@as(T, -0.0)));	48	try expect(!isNegativeInf(@as(T, -0.0)));