sebastianmestre

8 ms·

31.
by sebastianmestre 1y ago
> Jevons’. Jevons’ paradox predicts that when something becomes cheaper, demand increases as the cheaper good is economically viable in a wider variety of cases. That's just the usual behavior of any market. When prices go down, dem
32.
by sebastianmestre 1y ago
They're fake internet points, it's no big deal
33.
by sebastianmestre 1y ago
Very cool! Something that always bugged me about palette generators I've used is how they end up not picking any colors intense enough for the deepest highlights/shadows, because they use colors close to the average of various set
34.
by sebastianmestre 1y ago
A while back I read a paper about downsampling normal maps and converting lost detail into roughness I can try to find it if you want
35.
by sebastianmestre 1y ago
Fyi; you can scroll the code blocks if you zoom out until there is no more horizontal scroll on the page Still sucky but at leas you can read the code
36.
by sebastianmestre 1y ago
Can you remake the stacked graphs with the variable of interest at the bottom? Its hard to see the percentage of Rust when it's all the way at the top with a lot of noise on the lower layers Edit: or make a non-stacked version?
37.
by sebastianmestre 2y ago
You have a nice ternary counter going in the version numbers :)
38.
by sebastianmestre 2y ago
Runs slow as hell on my phone. Around 10fps. My phone is not great but drawing some circles and some text should not take 100ms. On any device.
39.
by sebastianmestre 2y ago
Please tell me that, after noticing that the best interval length is 2, you simplified your implementation to something like this def perform_union_dnc(paths): if len(paths) == 0: return None if len(paths)
40.
by sebastianmestre 2y ago
The figure in the title expressed in normal units 5.6 * 10^15 kilograms
41.
by sebastianmestre 2y ago
I came across this store the other day while browsing LinkedIn. It's actually by the same guy who made the EspoTek Labrador electronics board (disclaimer: I contributed to the Labrador repo back in 2019)
42.
56bits – online retro games store(56bits.com.au)
1 points by sebastianmestre 2y ago|1 comments
43.
by sebastianmestre 2y ago
Yeah I got that, but it's really not as interesting as it seems. Let me explain why. Say we have an array p[1], p[2], ..., p[n] with all possible rubiks cube configurations Then this function will solve the cube: move(1) = p[1]^(
44.
by sebastianmestre 2y ago
Yes, you can solve a cube by this simple algorithm i = 0 while not solved apply move(i) Interestingly, there is no constant function `move(i) = x` that makes this algorithm correct. If there was, there would be a single
45.
by sebastianmestre 2y ago
This is also useful initializing empty circular linked lists node n = { .data = NULL, .prev = &n, .next = &n, };
46.
by sebastianmestre 2y ago
Is there a more direct or elegant solution than reducing it to a quadratic equation? By the way r=6 is also a solution, if we treat the diagram a bit more abstractly.
47.
by sebastianmestre 2y ago
Width in a flame graph is directly proportional to runtime. Optimizing a block that covers x% of the graph will only speed up the program by x% or less, so probably dont bother with blocks less than 0.5% wide. This by itself should already
48.
by sebastianmestre 2y ago
Yeah, Sean Barrett has a good writeup about them and optimizing them for branch-prediction, etc It's framed in the context of programming-language tokenization, but the principles are the same. https://nothings.org/comp
49.
by sebastianmestre 2y ago
They meant that different characters don't change the performance, unlike the Linux and MacOS versions, where different characters go through different code paths. But yes, a bigger file does take longer to process.
50.
by sebastianmestre 3y ago
Register allocation is not on the roadmap, I think it's too hard for this series... But maybe I just haven't figured out an easy enough way to do it yet :^) Memory allocation? You mean making a heap allocator? In the spirit of low
51.
by sebastianmestre 3y ago
In my experience, 3 passes of box blur looks good enough for small kernels (less than 50px). Is this faster than that?
52.
by sebastianmestre 3y ago
Parsing and symbol resolution on simple languages is kinda trivial in my opinion, but I'll probably write some articles about that stuff later Control flow and pointers are coming in the next part, and it's still surprisingly easy
53.
by sebastianmestre 3y ago
That's right!
54.
by sebastianmestre 3y ago
The article describes AST -> Assembly transformation, no?
55.
by sebastianmestre 3y ago
Author here. I wanted to get the bar for writing a compiler as low as possible, and emitting assembly code seemed better in that regard. Also I don't have time to learn x86 instruction encoding right now :(
56.
by sebastianmestre 3y ago
> There are push and pop instructions which are perfectly suited to this nested value use. In the past, lamenting how many compilers don't seem to realise that (and the fact that push/pop are specially optimised on x86 via hard
57.
by sebastianmestre 3y ago
Wow! My blog made the HN front page! I've been lurking for a while but only now made an account :^)