leeoniya
Joined 15 years ago
Karma
9,719
Submissions
2,904
Member since
Jun 9
Recent submissions
Comment · 2 months ago
i also tapped out quickly. how many times can you describe the same thing?
Claude: "Hold my beer."
Comment · 2 months ago
> The one shown in Wikipedia is mine.
neat!
https://upload.wikimedia.org/wikipedia/commons/e/e3/Pen_Regi...
assuming you still have it, it wouldn't be the worst idea to update the pic to something without chromatic aberration and motion blur. the wiki pic is probably the worst of the bunch compared to others on google image search :)
Comment · 2 months ago
It's possible to do a large amount of AI-assisted work, then do a second/third/fourth pass to break it up into a reviewable stack of self-contained PRs. But it takes time, and there's no such thing as one-shotting it. And it's basically impossible to continuously rebase manually without burning tokens. The way to merge the stack is more-or-less "stop the world".
However, I have yet to see how this will play out with upstream contribs:
https://github.com/moment/luxon/discussions/1796
https://github.com/leeoniya/luxon/tree/leeoniya/perf-patches...
Comment · 2 months ago
i've always been impressed by NBA*: https://github.com/anvaka/ngraph.path
Comment · 4 months ago
so, Your Attention is All They Need?
Comment · 5 months ago
or was it Windows hiding file extensions by default and you downloaded a .mp3.exe file?
Comment · 5 months ago
surprised not to see http://phpsadness.com/ here
Comment · 5 months ago
the term "Americans" always bothered me, though it's commonly used to refer to US
Comment · 5 months ago
> "no no, it has full test coverage"
i don't have enough fingers (and toes) to count how many times i've demonstrated that "100% coverage" is almost universally bullshit.
Comment · 5 months ago
if you want to do image diffing, use https://github.com/dmtrKovalenko/odiff
however, if you have SVGs already, compare those without rasterizing them first, then if that fails rasterize & odiff the baseline and new on-demand. this way you dont waste a ton of space storing a bunch of binary [possibly evolving] pngs in git.
Comment · 6 months ago
Levenshtein distance is often a poor way to fuzzy match or rank. i suspect that in js, even the trie approach would incur significant GC/alloc thrashing or cost of building a huge trie index.
i tried fuzzy matching using a cleverly-assembled regexp approach which works surprisingly well: https://github.com/leeoniya/uFuzzy
Comment · 6 months ago
> Sen. Sheldon Whitehouse
ok, i was confused for a minute.
> And, given that the gas breaks down relatively quickly, this would have been one of the fastest ways to reduce global warming.
s/quickly/slowly?
Comment · 7 months ago
> for a 2–3% performance gain
this is highly workload-dependent. there are plenty of APIs that are multiple-factor faster and 10x more memory efficient due to native implementation.
L6 @ Grafana
https://github.com/leeoniya
leeoniya_at_gmail