don_shadaman

4 ms·

1. 1.▲
   Show HN: C (+ Rust) memory allocator outperforming dlmalloc by up to x4(github.com)

   3 points by don_shadaman 2y ago|1 comments
2. 2.▲
   by don_shadaman 2y ago

   Refer to the repository Markdown files as well as comments in the C source and header files for details. Note that speed may vary on the environment, workload, and loads of other factors.
3. 3.▲
   Show HN: A non-recursive C Quadtree(github.com)

   2 points by don_shadaman 3y ago|0 comments
4. 4.▲
   by don_shadaman 4y ago

   https://stackoverflow.com/questions/41946007/efficient-and-w...
5. 5.▲
   by don_shadaman 4y ago

   The engine simply divides the space into parts to decrease the number of checks necessary. It doesn't constrain you in any way regarding to what shapes you want to insert, however the broad "hitbox" must be a hypercube, and l
6. 6.▲
   by don_shadaman 4y ago

   You can define "HSHG_D" before including "hshg.h" to get the definitions for the dimension you want to use. Throughout the documentation I'm talking about 2D, because I think it's relatively the easiest to unde
7. 7.▲
   Show HN: Detecting collision between 500k circles below 5ms(github.com)

   59 points by don_shadaman 4y ago|9 comments