HN Explorer

orlp

↗ HN profile [ 4937 ms ] full profile
Karma
0
Created
()
Submissions
0
  1. Rust Is Perfectly Imperfect (0x80.pl)
    3 points 1
  2. Dyeing to get in (2014) (genuineideas.com)
    18 points 2
  3. Samply, a cross-platform command line CPU profiler (github.com)
    1 points 0
  4. The "Bear's Grip" hitch, a new kind of kamikaze knot [video] (youtube.com)
    1 points 0
  5. Tic-tac-toe implemented in a single call to printf (github.com)
    4 points 0
  6. When Random Isn't (orlp.net)
    376 points 151
  7. When Random Isn't (orlp.net)
    4 points 1
  8. Branchless Lomuto Partitioning (orlp.net)
    3 points 0
  9. Training AI to Play Pokemon with Reinforcement Learning [video] (youtube.com)
    3 points 0
  10. Subtraction is functionally complete (orlp.net)
    251 points 76
  11. Subtraction is functionally complete (orlp.net)
    3 points 0
  12. Show HN: PolymurHash, a fast hash with a mathematically proven collision rate (github.com)
    8 points 0
  13. Bitwise Binary Search: Elegant and Fast (orlp.net)
    3 points 3
  14. The World's Smallest Hash Table (orlp.net)
    8 points 1
  15. Show HN: Glidesort, a new stable sort in Rust up to ~4x faster for random data (github.com)

    Hi all, I've talked about glidesort a few times on HN already, but it's finally ready for release. If you have any questions, feel free to ask. An academic paper on glidesort that goes into a lot more detail than the…

    389 points 73
  16. Ordering Numbers, How Hard Can It Be? (orlp.net)
    7 points 2