fix: style

Author: tensorush

build.zig

@@ -35,10 +35,10 @@ pub fn build(b: *std.Build) !void {
     });
     docs_step.dependOn(&docs_install.step);
 
-    // Benchmarks
-    const benchs_step = b.step("bench", "Run benchmarks");
+    // Benchmark
+    const bench_step = b.step("bench", "Run benchmark");
 
-    const benchs = b.addExecutable(.{
+    const bench_exe = b.addExecutable(.{
         .name = "bench",
         .version = version,
         .root_module = b.createModule(.{
@@ -48,11 +48,11 @@ pub fn build(b: *std.Build) !void {
         }),
     });
 
-    const benchs_run = b.addRunArtifact(benchs);
+    const bench_exe_run = b.addRunArtifact(bench_exe);
     if (b.args) |args| {
-        benchs_run.addArgs(args);
+        bench_exe_run.addArgs(args);
     }
-    benchs_step.dependOn(&benchs_run.step);
+    bench_step.dependOn(&bench_exe_run.step);
 
     // Test suite
     const tests_step = b.step("test", "Run test suite");

src/bench.zig

@@ -54,7 +54,7 @@ fn benchmarkSequence(gpa: std.mem.Allocator, writer: anytype) !void {
         num = i % 100;
         node = try gpa.create(Cache.Node);
         node.* = .{ .key = num, .value = num };
-        _ = try cache.put(node);
+        _ = cache.put(node);
     }
 
     while (i < NUM_ITERS) : (i += 1) {
@@ -80,7 +80,7 @@ fn benchmarkComposite(gpa: std.mem.Allocator, random: std.Random, writer: anytyp
         num = random.uintLessThan(u64, 100);
         node = try gpa.create(Cache.Node);
         node.* = .{ .key = num, .value = .{ @splat(0), num } };
-        _ = try cache.put(node);
+        _ = cache.put(node);
     }
 
     while (i < NUM_ITERS) : (i += 1) {
@@ -107,7 +107,7 @@ fn benchmarkCompositeNormal(gpa: std.mem.Allocator, random: std.Random, writer:
         num %= 100;
         node = try gpa.create(Cache.Node);
         node.* = .{ .key = num, .value = .{ @splat(0), num } };
-        _ = try cache.put(node);
+        _ = cache.put(node);
     }
 
     while (i < NUM_ITERS) : (i += 1) {

src/sieve.zig

@@ -22,7 +22,7 @@ pub fn Cache(comptime K: type, comptime V: type) type {
         };
 
         /// Initialize cache with given capacity.
-        pub fn init(allocator: std.mem.Allocator, capacity: u32) !Self {
+        pub fn init(allocator: std.mem.Allocator, capacity: u32) std.mem.Allocator.Error!Self {
             var self: Self = .{};
             try self.map.ensureTotalCapacity(allocator, capacity);
             return self;
@@ -53,7 +53,7 @@ pub fn Cache(comptime K: type, comptime V: type) type {
 
         /// Put node pointer and return `true` if associated key is not already present.
         /// Otherwise, put node pointer, evicting old entry, and return `false`.
-        pub fn put(self: *Self, node: *Node) !bool {
+        pub fn put(self: *Self, node: *Node) bool {
             if (self.map.getPtr(node.key)) |old_node| {
                 node.is_visited = true;
                 old_node.* = node;
@@ -132,13 +132,13 @@ test Cache {
         var flipflop_node: StringCache.Node = .{ .key = "flip", .value = "flop" };
         var ticktock_node: StringCache.Node = .{ .key = "tick", .value = "tock" };
 
-        try std.testing.expect(try cache.put(&zigzag_node));
-        try std.testing.expect(try cache.put(&foobar_node));
+        try std.testing.expect(cache.put(&zigzag_node));
+        try std.testing.expect(cache.put(&foobar_node));
 
         try std.testing.expectEqualStrings("bar", cache.fetchRemove("foo").?);
 
-        try std.testing.expect(try cache.put(&flipflop_node));
-        try std.testing.expect(try cache.put(&ticktock_node));
+        try std.testing.expect(cache.put(&flipflop_node));
+        try std.testing.expect(cache.put(&ticktock_node));
 
         try std.testing.expectEqualStrings("zag", cache.get("zig").?);
         try std.testing.expectEqual(cache.get("foo"), null);
@@ -156,10 +156,10 @@ test Cache {
         var foobar_node: StringCache.Node = .{ .key = "foo", .value = "bar" };
         var flipflop_node: StringCache.Node = .{ .key = "flip", .value = "flop" };
 
-        try std.testing.expect(try cache.put(&zigzag_node));
-        try std.testing.expect(try cache.put(&foobar_node));
-        try std.testing.expect(!try cache.put(&zigupd_node));
-        try std.testing.expect(try cache.put(&flipflop_node));
+        try std.testing.expect(cache.put(&zigzag_node));
+        try std.testing.expect(cache.put(&foobar_node));
+        try std.testing.expect(!cache.put(&zigupd_node));
+        try std.testing.expect(cache.put(&flipflop_node));
 
         try std.testing.expectEqualStrings("upd", cache.get("zig").?);
     }