From 52fefc9ba5b28649c0bfeb926cef4e8d0b77fa27 Mon Sep 17 00:00:00 2001
From: mitteneer <swebbguy@gmail.com>
Date: Thu, 15 May 2025 20:22:09 -0400
Subject: [PATCH] Create dateCompare function

Will eventually try to move away from zeit. Don't need all of it's functionality as long as SQL can format dates
---
 src/date_fmt.zig | 27 +++++++++++++++++++++++++++
 1 file changed, 27 insertions(+)

diff --git a/src/date_fmt.zig b/src/date_fmt.zig
index 603a209..00fe93b 100644
--- a/src/date_fmt.zig
+++ b/src/date_fmt.zig
@@ -1,8 +1,35 @@
 const std = @import("std");
 const zeit = @import("zeit");
+const Data = @import("types.zig");
 
 pub fn dateFmt(allocator: std.mem.Allocator, epoch: i64) ![]const u8 {
     var date = std.ArrayList(u8).init(allocator);
     try (try zeit.instant(.{ .source = .{ .unix_timestamp = @divFloor(epoch, 1_000) } })).time().strftime(date.writer(), "%d %b %Y, %H:%M");
     return date.items;
 }
+
+pub fn dateCompare(self: *[]const u8, earliest: []const u8, latest: []const u8) bool {
+    const range = if (self.len == 19) 4 else 2;
+    const time = std.fmt.parseInt(u32, self[0..range], 10) catch 0;
+    const etime = std.fmt.parseInt(u32, earliest[0..range], 10) catch 0;
+    const ltime = std.fmt.parseInt(u32, latest[0..range], 10) catch 0;
+
+    if (time != etime and time != ltime) {
+        return (time > etime and time < ltime);
+    } else {
+        return dateCompare(self[range + 1 ..], earliest[range + 1 ..], latest[range + 1 ..]);
+    }
+}
+
+pub fn scrobbleToRow(allocator: std.mem.Allocator, scrobble: Data.Scrobble) !Data.TableRow {
+    var artistlist = std.ArrayList(Data.HyperlinkData).init(allocator);
+    for (scrobble.artists_track) |a| {
+        try artistlist.append(Data.HyperlinkData{ .name = a, .id = 0 });
+    }
+    return Data.TableRow{
+        .song = .{ .name = scrobble.track, .id = 0 },
+        .artistlist = artistlist.items,
+        .album = .{ .name = scrobble.album, .id = 0 },
+        .date = try dateFmt(allocator, scrobble.date),
+    };
+}