home.social

#day4 — Public Fediverse posts

Live and recent posts from across the Fediverse tagged #day4, aggregated by home.social.

  1. Day 4 of the : Slope 📊

    ⛷️ Slope chart made with looking at how people interpret the phrases "may happen" and "might happen"

  2. Playing Majora’s Mask on Day 4: What and How
    The gameplay of The Legend of Zelda: Majora's Mask is famously limited to three days. After three days the moon crashes into the town, destroying it. You have to go back in time before then (which also saves the game) and continue completing subquests in a non-linear, atemporal kind of way.

    But as it turns out, t
    setsideb.com/playing-majoras-m
    #niche #bugs #Day4 #glitches #majorasmask #niche #Skawo #zelda

  3. Playing Majora’s Mask on Day 4: What and How
    The gameplay of The Legend of Zelda: Majora's Mask is famously limited to three days. After three days the moon crashes into the town, destroying it. You have to go back in time before then (which also saves the game) and continue completing subquests in a non-linear, atemporal kind of way.

    But as it turns out, t
    setsideb.com/playing-majoras-m
    #niche #bugs #Day4 #glitches #majorasmask #niche #Skawo #zelda

  4. Playing Majora’s Mask on Day 4: What and How
    The gameplay of The Legend of Zelda: Majora's Mask is famously limited to three days. After three days the moon crashes into the town, destroying it. You have to go back in time before then (which also saves the game) and continue completing subquests in a non-linear, atemporal kind of way.

    But as it turns out, t
    setsideb.com/playing-majoras-m
    #niche #bugs #Day4 #glitches #majorasmask #niche #Skawo #zelda

  5. This is my sharkposting station. I use it to spread fluff across the Internet. And occasionally use a software called Wireshark. I don't understand it. But I like the colourful lines it shows. And its name.

    #shonkweek #day4

  6. This is my sharkposting station. I use it to spread fluff across the Internet. And occasionally use a software called Wireshark. I don't understand it. But I like the colourful lines it shows. And its name.

    #shonkweek #day4

  7. This is my sharkposting station. I use it to spread fluff across the Internet. And occasionally use a software called Wireshark. I don't understand it. But I like the colourful lines it shows. And its name.

    #shonkweek #day4

  8. This is my sharkposting station. I use it to spread fluff across the Internet. And occasionally use a software called Wireshark. I don't understand it. But I like the colourful lines it shows. And its name.

    #shonkweek #day4

  9. Being dissatisfied with and not understanding the fact of what we are, we create the idea of what we should be, so there is a division, a contradiction. Throughout the world, this process is going on, this escape from ‘what is’ through the ideational pursuit of ‘what should be’. And surely, as long as we struggle to bring about an approximation between the fact and the idea, conflict is inevitable.
    #krishnamurti
    #phylosophy
    #meditation
    #day4
    #life
  10. Just got home, watching the English wickets fall, with a tune floating though my head again:

    Aussies got the Poms on the run
    Do dar, do darrr
    Aussies got the Poms on the run
    Oh do dar day

    #Cricket #Ashes #Adelaide #Day4

  11. Inside the #4 drawer of the Whisky Advent calendar was Douglas Laing's bottling of a 30-year-old lowland Cameronbridge single grain at 49.6% ABV, which spent 30 years in a refill hogshead starting the year I finished my undergrad.

    1/3

    #photography #drinks #whisky #whiskyadvent2025 #day4

  12. A break from dystopian healthcare choices to whinge on about #Day4 of #Diamine #Inkvent2025:

    Full disclosure: I believe I grew out of scented ink being interesting at 11 or 12 (current age: Moon Landing Years Old).

    Seriously though, who is the person that said, “I know what the world wants in an advent calendar, the scent of tobacco! That’s festive AF, that is!”

    While #SmokyTobacco thankfully doesn’t smell like a club I might have frequented in my youth, it also fails to smell like quality pipe tobacco. It unfortunately smells rather like the aftershave a young human, new to shaving and wearing scent, would enthusiastically select.

    #FountainPenInk #Ink #InkSwatching #FountainPenNerd

  13. A break from dystopian healthcare choices to whinge on about #Day4 of #Diamine #Inkvent2025:

    Full disclosure: I believe I grew out of scented ink being interesting at 11 or 12 (current age: Moon Landing Years Old).

    Seriously though, who is the person that said, “I know what the world wants in an advent calendar, the scent of tobacco! That’s festive AF, that is!”

    While #SmokyTobacco thankfully doesn’t smell like a club I might have frequented in my youth, it also fails to smell like quality pipe tobacco. It unfortunately smells rather like the aftershave a young human, new to shaving and wearing scent, would enthusiastically select.

    #FountainPenInk #Ink #InkSwatching #FountainPenNerd

  14. #AdventOfCode #Day4 with #rust

    I'm no sure I need all the usize/isize casts.
    Also, I don't get why I need a move since the value is going to be copied anyway 🤔
    I think I still don't understand how the iterations, closures, and ownership interact.
    I did learn I can use into_iter to consume a collection :)

    gist.github.com/riffraff/8dc01

    #programming

  15. CW: Advent of Code 2025 Day 4 solution

    Day 4 done. This was probably the easiest one so far, but it might be because I'm so used to the grid problems from previous years.

    I felt like just doing the count for part 1 would end up forcing me to rewrite something, so I returned the coordinates, hoping they'd come in handy for part 2. Fortunately, they did, and my part 2 was a 10-second addition, just adding a loop around the part 1 function. The whole thing runs in about 86 milliseconds. I could probably optimize it by storing a neighbor count in each live cell, decrementing those in accessible neighbors on each removal, and maybe keeping them in a sorted vector via Rc<RefCell> or an internal Cell, but I'm happy with this right now.

    Edit: I ended up doing the optimization anyway

    This runs in 10ms now. It might even run a bit faster if I make the rolls keep track of their neighbors with weak refs too, to prevent lots of extra neighbor lookups in the HashSet. I'll experiment with that a tiny bit, but I'm not going to spend all too much effort on it, and probably won't add an update unless it is a big speed boost.

    #AdventOfCode #AdventOfCode2025 #AdventOfCode2025Day4 #AdventOfCode2025Day04 #Day4 #Day04 #Rust #RustLang #Programming #codingchallenges

  16. CW: Advent of Code 2025 Day 4 solution

    Day 4 done. This was probably the easiest one so far, but it might be because I'm so used to the grid problems from previous years.

    I felt like just doing the count for part 1 would end up forcing me to rewrite something, so I returned the coordinates, hoping they'd come in handy for part 2. Fortunately, they did, and my part 2 was a 10-second addition, just adding a loop around the part 1 function. The whole thing runs in about 86 milliseconds. I could probably optimize it by storing a neighbor count in each live cell, decrementing those in accessible neighbors on each removal, and maybe keeping them in a sorted vector via Rc<RefCell> or an internal Cell, but I'm happy with this right now.

    Edit: I ended up doing the optimization anyway

    This runs in 10ms now. It might even run a bit faster if I make the rolls keep track of their neighbors with weak refs too, to prevent lots of extra neighbor lookups in the HashSet. I'll experiment with that a tiny bit, but I'm not going to spend all too much effort on it, and probably won't add an update unless it is a big speed boost.

    #AdventOfCode #AdventOfCode2025 #AdventOfCode2025Day4 #AdventOfCode2025Day04 #Day4 #Day04 #Rust #RustLang #Programming #codingchallenges

  17. CW: Advent of Code 2025 Day 4 solution

    Day 4 done. This was probably the easiest one so far, but it might be because I'm so used to the grid problems from previous years.

    I felt like just doing the count for part 1 would end up forcing me to rewrite something, so I returned the coordinates, hoping they'd come in handy for part 2. Fortunately, they did, and my part 2 was a 10-second addition, just adding a loop around the part 1 function. The whole thing runs in about 86 milliseconds. I could probably optimize it by storing a neighbor count in each live cell, decrementing those in accessible neighbors on each removal, and maybe keeping them in a sorted vector via Rc<RefCell> or an internal Cell, but I'm happy with this right now.

    Edit: I ended up doing the optimization anyway

    This runs in 10ms now. It might even run a bit faster if I make the rolls keep track of their neighbors with weak refs too, to prevent lots of extra neighbor lookups in the HashSet. I'll experiment with that a tiny bit, but I'm not going to spend all too much effort on it, and probably won't add an update unless it is a big speed boost.

    #AdventOfCode #AdventOfCode2025 #AdventOfCode2025Day4 #AdventOfCode2025Day04 #Day4 #Day04 #Rust #RustLang #Programming #codingchallenges

  18. CW: Advent of Code 2025 Day 4 solution

    Day 4 done. This was probably the easiest one so far, but it might be because I'm so used to the grid problems from previous years.

    I felt like just doing the count for part 1 would end up forcing me to rewrite something, so I returned the coordinates, hoping they'd come in handy for part 2. Fortunately, they did, and my part 2 was a 10-second addition, just adding a loop around the part 1 function. The whole thing runs in about 86 milliseconds. I could probably optimize it by storing a neighbor count in each live cell, decrementing those in accessible neighbors on each removal, and maybe keeping them in a sorted vector via Rc<RefCell> or an internal Cell, but I'm happy with this right now.

    Edit: I ended up doing the optimization anyway

    This runs in 10ms now. It might even run a bit faster if I make the rolls keep track of their neighbors with weak refs too, to prevent lots of extra neighbor lookups in the HashSet. I'll experiment with that a tiny bit, but I'm not going to spend all too much effort on it, and probably won't add an update unless it is a big speed boost.

    #AdventOfCode #AdventOfCode2025 #AdventOfCode2025Day4 #AdventOfCode2025Day04 #Day4 #Day04 #Rust #RustLang #Programming #codingchallenges

  19. CW: Advent of Code 2025 Day 4 solution

    Day 4 done. This was probably the easiest one so far, but it might be because I'm so used to the grid problems from previous years.

    I felt like just doing the count for part 1 would end up forcing me to rewrite something, so I returned the coordinates, hoping they'd come in handy for part 2. Fortunately, they did, and my part 2 was a 10-second addition, just adding a loop around the part 1 function. The whole thing runs in about 86 milliseconds. I could probably optimize it by storing a neighbor count in each live cell, decrementing those in accessible neighbors on each removal, and maybe keeping them in a sorted vector via Rc<RefCell> or an internal Cell, but I'm happy with this right now.

    Edit: I ended up doing the optimization anyway

    This runs in 10ms now. It might even run a bit faster if I make the rolls keep track of their neighbors with weak refs too, to prevent lots of extra neighbor lookups in the HashSet. I'll experiment with that a tiny bit, but I'm not going to spend all too much effort on it, and probably won't add an update unless it is a big speed boost.

    #AdventOfCode #AdventOfCode2025 #AdventOfCode2025Day4 #AdventOfCode2025Day04 #Day4 #Day04 #Rust #RustLang #Programming #codingchallenges

  20. #Inktober #Inktober2025 #LineaSketch #Day4 #murky

    As one who’s never enjoyed drinking coffee, I can honestly say the beverage never looks to me like anything other than dirty murky water.

  21. [Day 4 – BashCore Stress Test Update]
    Running live from an old Acer Aspire One D160 (2009, 2 GB RAM, USB 2.0 boot, no battery).
    Uptime: 4d 5h
    RAM: 944 MB / 1.91 GB
    Load avg: 0.22 0.14 0.25
    stress-ng still working at ~23% CPU
    msfconsole and NordVPN also running.
    No crashes, no slowdowns. Holding strong 💪

    Still 3 days to go!

    #BashCore #LinuxMinimal #PentestLiveOS #USBboot #NetbookLife #Day4 #Stability