Live data from Hacker News

Viewing profile — budabudimir

budabudimir

HN member
Joined
Tue, Apr 22, 2014, 7:30 AM UTC
HN karma
15
Public activity
25 items

About budabudimir

No profile information was provided.

Recent public activity

  1. comment
    Comment #42917882

    A site where you can play against titled chess players. Games are played on Lichess.

  2. story
  3. comment
    Comment #37653871

    Substantiate please. Give me some links or statistics at least. Your claim is essentially that net-worth inequality is much worse than the income inequality. To me that is non-obvi…

  4. comment
    Comment #37653869

    Substantiate please. Give me some links or statistics at least. Your claim is essentially that net-worth inequality is much worse than the income inequality. To me that is non-obvi…

  5. comment
    Comment #29313595

    Does anybody actually care about the moderation team anyway? CoC is also just set of guidelines that people abide by anyway in most situations, but doesn't prevent anybody from bei…

  6. comment
    Comment #28071624

    Anyone can optimize a database for trivial queries. Would be nice to at least see TPCH results or any other more complex benchmark.

  7. comment
    Comment #27210685

    It does say something, one someone can become so overweight and being considered poor at the same time.

  8. comment
    Comment #24685446

    Hello everyone, I've built a small project in my spare time, an elo based rating system for MMA fighters. I looked for a bit and haven't find anything of a sort. Data is sourced fr…

  9. story
  10. comment
    Comment #24532824

    Indeed, I had the misfortune of using SCons on one project back in 2017-2019. It was ridiculous how slow it was. Even for the case when "Nothing to be done" was the result it took …

  11. comment
    Comment #22932263

    I would have said that for any statically typed language. It simply leads to more robust software because compiler rejects large set of incorrect programs that would otherwise end …

  12. comment
    Comment #22923183

    Definitely a much better choice

  13. comment
    Comment #22920780

    A database implemented in JS; very encouraging. I guess performance and robustness were not a priority.

  14. comment
    Comment #21841749

    It is skipping the buffer cache that is true, but, if I understand things correctly, it allows kernel to use user provided buffers directly, thus skipping the copying of the data f…

  15. comment
    Comment #21832455

    I get the point, but mmap is a syscall as well. Perhaps a better title would be, "Why using mmap is faster than using read and write syscalls". Would using O_DIRECT flag result in …

  16. comment
    Comment #21809573

    Exactly, never thought I'd say this, but true.

  17. comment
    Comment #21245345

    This pool seems to be completely out of touch with reality. Venezuela in the top 10 happiest countries?

  18. comment
  19. comment
    Comment #20465596

    What is the difference between each team owning a microservice and owning a part of the monolith? There is common release process, but with proper infra in place, that shouldn't be…

  20. comment
    Comment #20143025

    It's not slow? It takes it 30s, on a decent size codebase, just to tell you that there is "Nothing to do." There is order of magnitude difference between it and make. It's a comple…

  21. comment
    Comment #18939058

    You raise an interesting point, how are they going to prevent Amazon just taking their business with making SkyllaDB on demand? Confluent ( Kafka folks ) did it by adjusting the li…

  22. comment
  23. comment
    Comment #18293431

    That's true for array, that expected insert time is O(1), and it still holds for N inserts, because you double the size every time, which yields O(2N) time complexity. This is not …

  24. comment
    Comment #18292790

    Indeed, could you expand on that a bit? Even if what you meant is expected time complexity for the single insert operation is O(1), that surely cannot be the case. What would be ex…

  25. comment
    Comment #18292473

    I don't think a ordered data structure with O(1) insert time is even possible, as that would mean that you can do sort in O(n).