🤬 Safari is atrocious

How does Apple keep getting away with this?

🤯 The first successful AI pull request

Yesterday a person submitted a low-level optimization PR written 99% by DeepSeek-R1.

Is it over for software engineers, boys?

🔮 Counting days in a month

I was tired of lookup tables so I came up with this optimized algorithm counting days in a month. The operations seem simple enough, and the √3 can be replaced with a constant. To me it seems like the bottleneck of the algorithm is all the float operations. The rest can be very elegantly optimized with bitwise.

def days(y, m):
    if m == 1:
        return 28 + int(y % 4 == 0)

    p = m / sqrt(3)

    return 31 if p - floor(p) < 0.5 else 30

Super lenient on storage, but slightly more complex in computation. Developers, what do you think about this?

😔 The boring way

Well, for one, I fucked up the leap year check, because I didn't know they are skipped every century unless the year divisible by 400.

Float operations are obviously super slow, and even though my solution was mathematically elegant, I think basic comparisons are way to go for time optimization... Shame

int days(int y, int m) {
    if (m == 1)
        return 28 + ((y & 0b11) == 0 && (y % 100 != 0 || y % 400 == 0));

    if (m == 3 || m == 5 || m == 8 || m == 10)
        return 30;

    return 31;
}

I'd actually bet my money this approach is slightly more optimized than a lookup table, if we consider storage:

const int lookup[12] = { 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 };

int daysLookup(int y, int m) {
    return lookup[m] + (m == 1 && ((y & 0b11) == 0 && (y % 100 != 0 || y % 400 == 0)));
}

🖌 Drawing

I don't think I've said it publicly before, but I also enjoy drawing for fun. I'm a poor artist, but pixel art is my weakness, as much as long-haired girls are 😌

This is how she looks

The comments asked me to make the outline uniform, and that actually looks significantly better

🎵 Fade to Black

This one is super beautiful, I enjoy playing that a lot. The verse riff looks easy, but it's actually pretty challenging. The ending is the most difficult part.