mirror of
https://github.com/ziglang/zig.git
synced 2025-12-06 14:23:09 +00:00
e4c053f047
- use Bit Twiddling Hacks: Compute parity in parallel - test cases derived from popcount.zig - tests: compare naive approach 10_000 times with random numbers created from naive seed 42 - compiler_rt.zig: sort by LLVM builtin order and add comments to improve structure See #1290
36 lines
1.1 KiB
Zig
36 lines
1.1 KiB
Zig
const parity = @import("parity.zig");
|
|
const testing = @import("std").testing;
|
|
|
|
fn parityti2Naive(a: i128) i32 {
|
|
var x = @bitCast(u128, a);
|
|
var has_parity: bool = false;
|
|
while (x > 0) {
|
|
has_parity = !has_parity;
|
|
x = x & (x - 1);
|
|
}
|
|
return @intCast(i32, @boolToInt(has_parity));
|
|
}
|
|
|
|
fn test__parityti2(a: i128) !void {
|
|
var x = parity.__parityti2(a);
|
|
var expected: i128 = parityti2Naive(a);
|
|
try testing.expectEqual(expected, x);
|
|
}
|
|
|
|
test "parityti2" {
|
|
try test__parityti2(0);
|
|
try test__parityti2(1);
|
|
try test__parityti2(2);
|
|
try test__parityti2(@bitCast(i128, @as(u128, 0xffffffff_ffffffff_ffffffff_fffffffd)));
|
|
try test__parityti2(@bitCast(i128, @as(u128, 0xffffffff_ffffffff_ffffffff_fffffffe)));
|
|
try test__parityti2(@bitCast(i128, @as(u128, 0xffffffff_ffffffff_ffffffff_ffffffff)));
|
|
|
|
const RndGen = @import("std").rand.DefaultPrng;
|
|
var rnd = RndGen.init(42);
|
|
var i: u32 = 0;
|
|
while (i < 10_000) : (i += 1) {
|
|
var rand_num = rnd.random().int(i128);
|
|
try test__parityti2(rand_num);
|
|
}
|
|
}
|