dalvrosa

4 ms·

1. 61.▲
   by dalvrosa 6mo ago

   Very. Very nice
2. 62.▲
   by dalvrosa 6mo ago

   Thanks for bringing some intuition!
3. 63.▲
   by dalvrosa 6mo ago

   Fair, sorry about that
4. 64.▲
   by dalvrosa 6mo ago

   Great example
5. 65.▲
   by dalvrosa 6mo ago

   Here is used in the Lebesgue measure theory sense
6. 66.▲
   by dalvrosa 6mo ago

   Already replied :) The source code of the website is open if you wanna check it out!
7. 67.▲
   by dalvrosa 6mo ago

   There is some geometric intuition in wikipedia page for this theorem you may like :)
8. 68.▲
   Fundamental Theorem of Calculus(david.alvarezrosa.com)

   62 points by dalvrosa 6mo ago|66 comments
9. 69.▲
   Jury finds Meta, YouTube liable for social media addiction: What we know(aljazeera.com)

   3 points by dalvrosa 7mo ago|0 comments
10. 70.▲
    by dalvrosa 7mo ago

    Fair
11. 71.▲
    by dalvrosa 7mo ago

    Fair, but agentic tooling can benefit quite a lot from this Opencode, ClaudeCode, etc, feel slow. Whatever make them faster is a win :)
12. 72.▲
    by dalvrosa 7mo ago

    Lol. Funny story :)
13. 73.▲
    by dalvrosa 7mo ago

    Thanks for the explanation :)
14. 74.▲
    by dalvrosa 7mo ago

    Thanks!
15. 75.▲
    by dalvrosa 7mo ago

    I'm not sure about the single-core scenario, but would love to learn if someone else wants to add something In reality multiple threads for single core doesn't make much sense right?
16. 76.▲
    by dalvrosa 7mo ago

    Thanks. Do you happen to know why hyperthreading should be disabled? In prod most trading companies do disable it, not sure about generic benchmarks best practices
17. 77.▲
    by dalvrosa 7mo ago

    Nice one!
18. 78.▲
    by dalvrosa 7mo ago

    Codeberg vs selfhosted Gitlab. What do you think?
19. 79.▲
    by dalvrosa 7mo ago

    Agreed. For benchmarking I used this < https://github.com/david-alvarez-rosa/CppPlayground/blob/mai... > which relies on GoogleBenchmark and pins producer/consumer threads to dedicated CPU cores What
20. 80.▲
    by dalvrosa 7mo ago

    Exactly, that's right
21. 81.▲
    by dalvrosa 7mo ago

    Thanks! That's not ensured, optimizations are only valid due to the constraints - One single producer thread - One single consumer thread - Fixed buffer capacity So to answer > Are they ensuring two threads can't push to the sa
22. 82.▲
    by dalvrosa 7mo ago

    Thanks for the feedback <3
23. 83.▲
    by dalvrosa 7mo ago

    100% agree +1
24. 84.▲
    by dalvrosa 7mo ago

    Interesting, I've never heard about anybody using this. Maybe a bit unreadable? But yeah, should work :)
25. 85.▲
    by dalvrosa 7mo ago

    Indeed that's true. That extra constraint enables further optimization It's mentioned in the post, but worth reiterating!
26. 86.▲
    by dalvrosa 7mo ago

    Glad that it helps :)
27. 87.▲
    by dalvrosa 7mo ago

    Actually I'm not sure. GPL was for source code of the website itself I guess the code samples inside post are under https://david.alvarezrosa.com/LICENSE But feel free to ping me if you need different license, quite op
28. 88.▲
    by dalvrosa 7mo ago

    Yeah, different languages will have different syntaxes and ways of using atomics But at the hardware level all are kindof the same
29. 89.▲
    by dalvrosa 7mo ago

    Sorry, but that's not actually true. There are no data races, the atomics prevent that (note that there are only one consumer and one producer) Regarding the style, it follows the "almost always auto" idea from Herb Sutter
30. 90.▲
    by dalvrosa 7mo ago

    Nice one, thanks for sharing. Do you wanna share the ring buffer code itself?