> ?
@eapl.me@eapl.me this is interesting. Is the square bracket something used in the wild for multilingual twts?
@prologic@twtxt.net what are your thoughts? Should we extend the parser to handle [lang] and [boost] ? Or a generic attribute spec. Single word is a boolean attribute. And one with an = is a string key/value.
@eapl.me@eapl.me kinda like the format for markdown images?  ?
What? You are still using chrome? Firefox is where its at. But if you need WebKit there is always chromium which strips out all the google nonsense.
When I built I had a blue conduit installed from outside in to the util room.
Laser all the way. Inkjets are cheaper to replace the printer than to buy the ink for a reason.
Are they doing fiber to outside with ether in? Or will it make it inside the house?
It would help for UX for sure. emoji keyboards are hard to come by on the desktop.
:waves:
@prologic@twtxt.net nope.
@prologic@twtxt.net what?
@lyse@lyse.isobeef.org I have read the white papers for MLS before. I have put a lot of thought on how to do it with salty/ratchet. Its a very good tech for ensuring multiple devices can be joined to an encrypted chat. But it is bloody complicated to implement.
@lyse@lyse.isobeef.org i first learned about it from this vid https://www.youtube.com/watch?v=6JxvKfSV9Ns&pp=ygUOZmlib25hY2NpIGhlYXA%3D
and this site: https://www.programiz.com/dsa/fibonacci-heap
So, I finally got day 17 to under a second on my machine. (in the test runner it takes 10)
I implemented a Fibonacci Heap to replace the priority queue to great success.
https://git.sour.is/xuu/advent-of-code/src/branch/main/search.go#L168-L268
@prologic@twtxt.net What I did as a work around for mattermost was hijack the gitlab oauth login with my own auth server.
OH MY FREAKING HECK. So.. I made my pather able to run as Dijkstra or A* if the interface includes a heuristic.. when i tried without the heuristic it finished faster :|
So now to figure out why its not working right.
i am wondering if maybe i need a better heap like a btree backed one instead of just list sort on Dequeue.
I found a bug where i didnt include an open/closed list that seemed to shave off a little. right now it runs in about 70 seconds on my machine.. it takes over the 300s limit when it runs on the testrunner on the same box.. docker must be restricting resources for it.
I might come back to it after i work through improving my code for day 23. Its similar but looking for the longest path instead of shortest.
man… day17 has been a struggle for me.. i have managed to implement A* but the solve still takes about 2 minutes for me.. not sure how some are able to get it under 10 seconds.
Solution: https://git.sour.is/xuu/advent-of-code/src/branch/main/day17/main.go
A* PathFind: https://git.sour.is/xuu/advent-of-code/src/branch/main/search.go
some seem to simplify the seen check to only be horizontal/vertical instead of each direction.. but it doesn’t give me the right answer
I have been doing interview prep for next year. The problems have been great to get practice and make it fun when compared to the dry solve this you get on hacker rank or code scene.
That and so many great write-ups to explain the problems.
@lyse@lyse.isobeef.org I think there is a problem related to the fitting around a corner that is unsolved. I watched a video about it a little while back.
I found these write-ups for advent of code. They are quite well done and a great learning resouce for algorithms!
My linux installs all have TPM enabled. …
@movq@www.uninformativ.de So.. i eventually made it to the end on this one.. was able to reuse code from days 8 and 9!
SSBzdGlsbCBkbyBub3QgdW5kZXJzdGFuZCB3aHkgdXNpbmcgdGhlIHJhdGUgb2YgY2hhbmdlIGlu
IHRoZSBwdXNoZXMgZ2l2ZXMgbWUgdGhlIGFuc3dlci4uIGJ1dCB5ZWFoLi4K
Spent some time getting my air sensors tied together into a dashboard. :-D 
@movq@www.uninformativ.de so the pathfinding puzzle has arrived?
@movq@www.uninformativ.de you are probably right.. there seems to be a final 10 trend found over on Reddit.
@movq@www.uninformativ.de tossing around inline ASM for the AoC..
In the holiday spirit i have donned my Santa hat. (shamelessly stolen from @movq@www.uninformativ.de)
@movq@www.uninformativ.de I wish they just muted them out instead of making it an awfully loud meep sound.
Around and around you go. When we sync up? Nobody knows!
With the global ordering for our private leader board we are all 1st place winners!!
I have been really impressed with the cool visualizations in pygame that @gereleth over on Twitter has been making. #AdventOfCode
@prologic@twtxt.net day 6 is super easy if you have int64 and some binomial theory. Skip ahead for the easy stars and catch up!
Oh.. Right. Need subtract and divide too for the binomial
@movq@www.uninformativ.de it shouldn’t need a full bignum implementation right? Just some left and right shifts for the sq/sqrt and carry for the addition right?
So today’s #adventofcode was solved with no programming. Just a bit o maths and wolfram/alpha
The word forms is part two. In this one you want to find the first digit and last digit. Think searching ‘1’ - ‘9’
Its the latest ryzen 7 chipset for laptop/mini form factor.
I am very surprised about the times others are getting. I guess that’s the difference between interpreted and compiled showing.
took a few attempts.. but i managed to do it in half the time!
@movq@www.uninformativ.de It took a little over a minute on my machine.. i should try to make it multi threaded.. 🤔
Executed in 68.96 secs fish external
usr time 60.84 secs 242.00 micros 60.84 secs
sys time 12.52 secs 252.00 micros 12.52 secs
How did so many get the first star within the first 3 mins? 
@eapl.me@eapl.me I have many fond memories of Turbo pascal and Turbo C(++). They really did have a great help system. And debug tools! Its rare for language docs to be as approachable. QBasic was great. As was PHP docs when I first came into web.
@jason@jasonsanta.xyz if you do see this.. Welcome back! 👋🏼
This day one advantage of code was pretty neat looking.
https://twitter.com/gereleth/status/1730495736070938786?s=09
Code here: https://github.com/gereleth/aoc_python/blob/main/src/year2023/day01vis.py
Ahh I see how someone did it.
https://github.com/immannino/advent-of-go/blob/master/cmd/2023.go#L30-L40
I could have made my search smarter using a prefix search rather than scanning the full buffer for each iteration.
@movq@www.uninformativ.de haha! I’m sure they had fun working around stuff like nineight
@movq@www.uninformativ.de Dang. Really going overboard with this!
@prologic@twtxt.net I didn’t have to do much backtracking. I parsed into an AST-ish table and then just needed some lookups.
The part 2 was pretty easy to work into the AST after.
https://git.sour.is/xuu/advent-of-code-2023/commit/c894853cbd08d5e5733dfa14f22b249d0fb7b06c
My code is here. https://git.sour.is/xuu/advent-of-code-2023
Day 2 used lots of Cut and Split.
Oof. Its quite everywhere here in my area. Hope its not too bad there.