Existence is simple: find the food, push the button, hit the treadmill.

But sometimes it gets much harder.

Cross over the cell bars, find a new maze, make the maze from it's path, find the cell bars, cross over the bars, find a maze, make the maze from its path, eat the food, eat the path.

i think it does :)

i've thought about the idea but i wasn't sure how good of an idea it was and i wasn't happy with the status of it yet so it's still private but yeah.

it's zig that you can call from clojure. it even has native dependencies as jars

for now at least i have to design around it myself

oh wait! i just remembered something!

F# has these things called computation expressions!

This enables you to have a DSL with typechecking and the accompanying tooling in F#. It's very wild and cool!

like for example, you can write one for inline assembly

blog.devgenius.io/inline-assem...

The first Mozilla TOS are a joke. They state that "use of Firefox must follow Mozilla’s Acceptable Use Policy" in which they state that "You may not use any of Mozilla’s services to:" even display sexual content. Watching porn is now illegal on firefox i guess. Who came up with this nonsense?

I have been wrongly accused of being unable to cook and would like to present evidence to the opposite.

I think those gloves turned out just fine 😌

currently losing the ability to write normal clojure code

have you ever thought "man i want name mangling for clojure functions?"

no?

great, here you go 😌

apparently garbage collection of short lived memory segments. i falsely banked on the jvm behaving well or jitting this nicely. with explicit confined arenas spread (and performance) is a lot better.

the surprising thing to me i guess is that heap memory segments hit way harder than heap objects.

something is *very* wrong here

First time in Hawaii! Exciting!