quick refactor to add utils

1 files changed, 4 insertions, 25 deletions

diff --git a/day-1/main_1.zig b/day-1/main_1.zig
index 1a36e26..5e502d3 100644
--- a/day-1/main_1.zig
+++ b/day-1/main_1.zig
@@ -1,18 +1,12 @@
 const std = @import("std");
+const slurp = @import("util/file.zig").slurp;
+const min_idx = @import("util/mem.zig").min_idx;
 
 var gpa = std.heap.GeneralPurposeAllocator(.{}){};
 const allocator = gpa.allocator();
 
 pub fn main() !void {
-    var path_buffer: [std.fs.MAX_PATH_BYTES]u8 = undefined;
-    const path = try std.fs.realpath("./input", &path_buffer);
-
-    const file = try std.fs.openFileAbsolute(path, .{});
-    defer file.close();
-
-    const file_size = (try file.stat()).size;
-
-    const file_buffer = try file.readToEndAlloc(allocator, file_size);
+    const file_buffer = try slurp(allocator, "./input");
     defer allocator.free(file_buffer);
 
     var iter = std.mem.split(u8, file_buffer, "\n");
@@ -21,7 +15,7 @@ pub fn main() !void {
 
     while (iter.next()) |line| {
         if (line.len == 0) {
-            const lowest_u = lowest(i32, &max);
+            const lowest_u = min_idx(i32, &max);
             if (count > max[lowest_u]) {
                 max[lowest_u] = count;
             }
@@ -38,18 +32,3 @@ pub fn main() !void {
 
     std.debug.print("{d}\n", .{count});
 }
-
-fn lowest(comptime T: type, items: []const T) usize {
-    var lowest_u: usize = 0;
-    var previous: T = items[0];
-
-    for (items) |item, idx| {
-        if (item < previous) {
-            lowest_u = idx;
-        }
-
-        previous = item;
-    }
-
-    return lowest_u;
-}