Live data from Hacker News

Viewing profile — binarycoffee

binarycoffee

HN member
Joined
Mon, Sep 26, 2016, 10:02 PM UTC
HN karma
308
Public activity
54 items

About binarycoffee

No profile information was provided.

Recent public activity

  1. comment
    Comment #46291521

    I hope you won't mind my picking your brain: which MPSC ring buffer implementations did you find that does drop old items when full? I could only found implementations that are bas…

  2. comment
    Comment #43117468

    LOX is apparently MPL, so a bit easier to work with than Nyx' AGPL, but still at odd with the MIT/Apache2 combo that has become the norm in the Rust world.

  3. comment
    Comment #43117418

    Just curious, what kind of simulations do you work on (mission design?) and what libraries would you use in C++?

  4. comment
    Comment #42920557

    Asynchronics | Rust developer | ONSITE or hybrid (2+days/week) | Full time | Warsaw, PL We are a young startup building digital twinning solutions for spacecraft validation & verif…

  5. comment
    Comment #42272607

    I can see why someone would prefer Typst over LaTeX when the source is written in Typst or LaTeX, but what are the advantages if your source document is in Markdown? Is there anyth…

  6. comment
    Comment #42173597

    Not a solution. Verification emails alone got a small web site I set up to be blacklisted within days. Most of the unwilling recipients presumably couldn't understand the language …

  7. comment
    Comment #42056410

    The producers of an MPSC queue may use an AtomicWaker::wake to signal to the consumer that a new item is ready. In this case all wake-ups are necessary (not spurious).

  8. comment
    Comment #42055649

    Another offender is AtomicWaker [1] which does the same on contention. [1] https://docs.rs/atomic-waker/latest/atomic_waker/

  9. comment
    Comment #41924003

    https://crates.io/crates/x

  10. comment
    Comment #41254022

    I needed to reflect Rust enums and went a bit further with that approach. All variants are wrapped in a decorated class, where the decorator automatically computes the union type a…

  11. comment
    Comment #41034706

    TBH I consider the C++ `std::chrono` as the worse possible design. `tai_clock::now` does not actually take into account leap seconds. Unless it does, who knows ("Implementations ma…

  12. comment
    Comment #39848469

    Oh yes, absolutely, GP got it backward and I went along with it...

  13. comment
    Comment #39844912

    While this doesn't change the essence of your claim, the problem is not with UTC timestamps but with Unix timestamps. UTC timestamps (HH:MM:SS) are actually unique because the extr…

  14. comment
    Comment #37788663

    I have always wondered about that. If optimizing repeated atomic loads is indeed allowed, waiting for a signal by spinning on an atomic load could loop forever. Yet I have the feel…

  15. comment
    Comment #37374830

    While I have frequently seen LabView used for instrument/hardware control, I admit I have never seen people use Simulink for that purpose. Is there a popular Simulink/Matlab add-on…

  16. comment
    Comment #36669102

    Sabine Hossenfelder apparently does this [1, 2] for $50/20min. [1] http://backreaction.blogspot.com/p/talk-to-physicist_27.html [2] https://aeon.co/ideas/what-i-learned-as-a-hired-…

  17. comment
    Comment #35575504

    One may count electric propulsion as a "better" propulsion system, but sadly it was a poor fit for Juice due to the very tight power budget. Even with those gigantic solar arrays, …

  18. comment
    Comment #35079683

    Not only is the instruction set simple, but the clock-per-instruction cost is deterministic, so assembly code is ideal for real-time I/O. Just like GP, we found that we could often…

  19. comment
    Comment #34832730

    I you think the NASA Open Source License is bad, look at the default license for non-commercial, ESA-funded software [1]. The territorial limitations effectively prevents any form …

  20. comment
    Comment #34439589

    As others wrote, Pandoc is Haskell so it compiles to a fairly efficient binary. But more importantly, unlike the various Markdown flavors or AsciiDoc, it is incredibly extensible t…

  21. comment
    Comment #33482031

    > Two things can be true at the same time Yes, but it is not possible to assert that both are true at the same time with full certainty.

  22. comment
    Comment #32371892

    You are right of course, but I would contend that generating as well sub-normal floats is in 99.9% of the cases a needless cost. The reason is that, more often than not, all this e…

  23. comment
    Comment #32369261

    This is a widely used method to map random integers to floating point numbers, but it has the disadvantage of wasting 1 bit of float mantissa precision. On modern CPUs, its computa…

  24. comment
    Comment #31388565

    To be clear, as mentioned in another thread [0] there is no need to ensure consistency between head and tail for a SPSC so storing them in different cache lines would be much bette…

  25. comment
    Comment #31387522

    Note that the second variant does not claim to be MPMC, only SPMC. Many lock-free structures use CAS loops. It would not be lock-free if a consumer pre-empted at the wrong time cou…