qsantos

7 ms·

31.
The Dirty Pipe Vulnerability (2022)(dirtypipe.cm4all.com)
8 points by qsantos 2y ago|1 comments
32.
How to Shrink Rust(theincredibleholk.org)
3 points by qsantos 2y ago|0 comments
33.
Performance Roulette: The Luck of Code Alignment(bazhenov.me)
1 points by qsantos 2y ago|0 comments
34.
Processing 6B Chess Games in Less Than 2 Hours(mbuffett.com)
2 points by qsantos 2y ago|0 comments
35.
How to build a plugin system in Rust(arroyo.dev)
3 points by qsantos 2y ago|0 comments
36.
Rust Is for the Engine, Not the Game(barretts.club)
75 points by qsantos 2y ago|65 comments
37.
Performance of Rust's match vs. lookup tables(kevinlynagh.com)
3 points by qsantos 2y ago|0 comments
38.
Model-Based RL (1/?)(cruxponent.com)
1 points by qsantos 2y ago|0 comments
39.
Rust's iterators optimize nicely–and contain a footgun(ntietz.com)
1 points by qsantos 2y ago|0 comments
40.
Resistance Against Git Merge Hell (2015)(tugberkugurlu.com)
56 points by qsantos 2y ago|111 comments
41.
The Assist(qntm.org)
3 points by qsantos 3y ago|1 comments
42.
by qsantos 3y ago
I did not know of Haxplore, thanks!
43.
by qsantos 3y ago
Thanks! And I agreed that this is not “pure” Vim. But I did need to find a compromise. There is little point in having an “insert” mode, like Vimium does, since I am targeting a very specific website and not overriding any existing shortcut
44.
by qsantos 3y ago
I do! I use Vimium C for general browsing. But, considering the time I spend on Hacker News, I needed something to optimize my procrastination even further!
45.
by qsantos 3y ago
I use Vimium as well! It's very frustrating when I need to reach for the mouse to navigate a website.
46.
by qsantos 3y ago
tl;dr: I made ViHN [1] to read Hacker News without having to move my hands away from the keyboard. It’s freely available on Firefox [2] and Chrome [3]. [1] https://github.com/qsantos/ViHN/ [2] https://a
47.
ViHN: Vim for Hacker News(qsantos.fr)
124 points by qsantos 3y ago|57 comments
48.
by qsantos 3y ago
Coincidently, I have written a browser extension to navigate Hacker News comments using Vi-style key bindings [1]. It has no compilation steps, no npm. It is mostly a 1kLoC file of vanilla JavaScript. Modern frameworks are definitely needed
49.
Show HN: Vi-style key bindings for browsing Hacker News (Firefox/Chrome addon)(github.com)
1 points by qsantos 3y ago|0 comments
50.
Rewriting NHK Easier in Rust(qsantos.fr)
2 points by qsantos 3y ago|0 comments
51.
A Review of Self-Help as a Genre, and Atomic Habits in Particular(thecodedmessage.com)
2 points by qsantos 3y ago|0 comments
52.
by qsantos 3y ago
From the Mastodon thread: > Turns out, they found out an even more innovative time sync mechanism. When you open the UI in the browser, they quickly redirect you to "/set-time/" + Date.now(). This sets a global variab
53.
by qsantos 3y ago
I am not saying to not explain the theory. I am saying that using a concrete concept makes it easier to build the mental model needed to understand the theory.
54.
by qsantos 3y ago
That's why I phrased it that way. But since you mentioned working modulo 2^64, I thought that would count :-). It's useful to make it explicit anyway for people who might miss that, so thanks!
55.
by qsantos 3y ago
I never heard of these, thanks for the links!
56.
by qsantos 3y ago
I understand! I do not think there is a magic formula for this. This only comes with a lot of practice.
57.
by qsantos 3y ago
Regarding Fibonacci, the recursive formula is much more efficient anyway! Oh, not _that_ recursive formula. That one: [1], from [2]. Basically, it allows you to implement in O(log n) arithmetic operations. [1] https://wikimedia.o
58.
by qsantos 3y ago
That's a very good question. I think the simplest approach to prove it would be to show that both computations yield the global minimum. Since there is only one global minimum, then they must be equal.
59.
by qsantos 3y ago
I think my own education followed the “traditional” way of learning computer science, albeit after years of tinkering with computers and programming as a kid. But I often felt that some concepts were much simpler when you made the connectio
60.
by qsantos 3y ago
Thanks! If I understand correctly, you would use that method, while substituting tail recursion in place of the look. However, I feel there is a lot of magic in https://gist.github.com/tmoertel/5798134#file-gistfile1-py

More ›