HN user

me_vinayakakv

41 karma
Posts2
Comments31
View on HN

Yeah, nowadays I'm finding more and more of such things and not wanting to read the article further. Sometimes I feel we ignore some good pieces because of LLMification!

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.

Nice visualizations, thank you!

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.

Yeah. But I think one problem could be if this list is very large and overflows the context.

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.

That happened to me yesterday and got solved on its own automatically.

If it happens next time, will check app logs (Profile Icon > Logs) to see if it contains anything useful

What is the way out in such cases?

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.

Why Haskell? 2 years ago

Nice! Would it be possible to transform an error to something else using this syntax?

Or, should we resort to a method of `Either` that transforms its `Left` in that case?

Why Haskell? 2 years ago

I was looking into the pattern matching example in the article with `Either` type. If we need to unwrap and check for all the cases one by one would it become a callback hell?

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.