chiroptical.dev
PhD Theoretical Chemistry. Haskell/Typescript full stack engineer at Mercury. Aspiring Erlang programmer. Occasional content creator youtube.com/chiroptical twitch.tv/chiroptical. Fencing enjoyer.
859 posts
1,054 followers
189 following
Regular Contributor
Active Commenter
comment in response to
post
I was just happy to get some exercise.
comment in response to
post
Finished my pgo PR but need a bump on pg_types before it could be merged. Next thing on the list: Erlang bits episode 4 with the gun library.
comment in response to
post
Thank you! 🤞
comment in response to
post
Takeaway: do not screw around with flimsy tennis shoes after you’ve used real fencing shoes. They are specifically designed to help you not roll your ankle.
comment in response to
post
Should start with spatial text and build up to the AI maybe.
comment in response to
post
You should totally try stabbing people (with proper gear!).
comment in response to
post
This understanding also makes being a referee a lot easier.
comment in response to
post
Realistically, I need to stop playing video games in the morning and start streaming again. However, mental health exists.
comment in response to
post
Maybe I should say, "Thank you for all the cool programming languages!"
comment in response to
post
This is effectively what `OSet` currently does! So, probably not a bad model to follow.
comment in response to
post
My idea was the NonEmpty would handle the order and non-empty nature while the Set maintained the uniqueness. The OSet uses two Maps to handle this so I thought it would be easiest to also use two structures.
comment in response to
post
It’s a really hard skill but we get a lot of practice
comment in response to
post
Well, not with a map operation but…
comment in response to
post
The Set.map function handles the uniqueness but it would also need to handle emptiness.
comment in response to
post
Oh, you’re right. I am really only folding this into a single structure.
comment in response to
post
Correct! Right now I am using OSet (hackage.haskell.org/package/orde...) but I have to check if it is empty a bunch.
comment in response to
post
Nearly all the operations are just folds or maps/traverse. There is already ordered set but I have to check that it is empty over and over again.
comment in response to
post
Ordered means the insertion order matters in this case.
comment in response to
post
I start HEMA in two weeks. It’ll be interesting to see if any skills translate.
comment in response to
post
Not sure how I feel about this yet. On one hand, this is powerful because I have access to the input values. On the other, now my code **and** contract has to be correct. More opportunities to make mistakes. Unsure if the compiler will help me here.
comment in response to
post
I need a little bit more knowledge before reading this. I especially want to learn about contracts and concurrency/parallelism.