vaibhavsagar

Joined 12 years ago

Karma
160
Submissions
67
Member since
Apr 11
[ my public key: https://keybase.io/vaibhavsagar; my proof: https://keybase.io/vaibhavsagar/sigs/XsHYsQTU6Pv2DruoRse8bvZ1HRoU-6XcUMAIHrdBkdM ]

You can reach me at vaibhavsagar(at)gmail.com

View on Hacker News

Recent submissions

Comment · 6 months ago
Resolve also has a premium Studio offering with some features that are particularly appealing to professional users. I assume that helps cover some of their costs.
Comment · 2 years ago
I got one so that I could make copies of my apartment keyfob; I live alone and having a spare keycard that goes inside my phone case has saved me from locking myself out of my building multiple times. For me it's already paid for itself by ensuring my peace of mind. I've also used it to copy my gym tag (NFC), my parents' apartment keyfob (also NFC surprisingly), and multiple office access cards.
Comment · 2 years ago
This article doesn't touch on what I consider to be the central feature of Haskell: it is lazily (more precisely non-strictly) evaluated. A lot of the other aspects of it, such as monadic IO, follow from that decision.
Comment · 2 years ago
Have you worked with Nix much?
Comment · 2 years ago
Why not `git clone --bare`?
Comment · 2 years ago
I hope there's at least one chapter on compact data structures!
Comment · 3 years ago
I wrote about these too: https://vaibhavsagar.com/blog/2018/07/29/hamts-from-scratch/! Unfortunately it's in Haskell which probably makes it less approachable than it would be otherwise.
Comment · 3 years ago
I personally use Vim, but Emacs alone is IMO the strongest counterexample to your claim about Lisp interpreters (followed by all the programs scriptable with Guile).
Comment · 4 years ago
Comment · 4 years ago
What if Haskell is my favourite language?
Comment · 4 years ago
This is why I do all of mine in Haskell.
Comment · 4 years ago
Doing a hashmap lookup is already very much like using a bloom filter: for any addressing scheme, if an element exists at a particular location, then either the key exists or it's a false positive. If no element exists, then there's no way the key exists. Adding an extra bloom filter would then come down to trading off space usage against a different probability of false positives, in addition to an extra lookup, and I think one would have to contrive an extremely unlikely scenario for it to make sense.

Live from the official Hacker News API

A modern reader for Hacker News · SvelteKit + Skeleton