43 karma · joined April 26, 2024
When I write, I now use LLMs as an alternative to Grammarly and explicitly instruct it to not to rewrite. Sometimes the choice of words are very intentional and LLMs dont "feel"/understand the emotional reason behind that.
Their status page shows everything is okay.
I was thinking of building an interactive visualization of mountain prominence, by progressing down the contour lines till the current contour line encircles a peak that is taller than the one that I started with.
I think Quadtrees will come handy in this visualization, if a precomputed list of all the peaks were available.
It is written in Go as well.
"Animation vs Physics"[1] was video which got started me with the channel. The presentation is beautiful there!
Sometimes, they interact with real world too!
I was thinking giving the LLM a tool `(query: string) => string[]` to retrieve a list of matching labels to check if they already exist.
But the above approach sounds similar to OP, where they use embeddings to achieve that.
If it happens next time, will check app logs (Profile Icon > Logs) to see if it contains anything useful
It is really amazing how much power and impact private company can have on public.
I've hit this with gemini-2.0-flash and changing the prompt ever so slightly seems to make things work, just to break it at other input.
In their FAQ[1], they mention that they have plans to expand to PyPI as well.
Not sure if that would be a viable option in Rust.
Or, should we resort to a method of `Either` that transforms its `Left` in that case?
I was going through a Scala codebase at work that uses `Future`s and `map`ing and `flatMap`ing them. Sometimes the callbacks went 5-6 levels deep. Is there a way to "linearlize" such code?
I come from JS/TS background and have not much experience with pufe functional languages. But I love how TS handles discriminated unions - if we handle a branch and `return` early, that branch is removed from the union for the subsequent scope, and I was wondering if something of that sort can be achieved in Haskell/Scala.
Overall a nice technique!