| jamesroutley/write-a-hash-table |
2,439 |
|
0 |
0 |
over 6 years ago |
0 |
|
19 |
mit |
|
| ✏️ Learn how to write a hash table in C |
| DavidLeeds/hashmap |
254 |
|
0 |
0 |
over 2 years ago |
0 |
|
2 |
mit |
C |
| Templated type-safe hashmap implementation in C using open addressing and linear probing for collision resolution. |
| ttvd/spatial-collision-datastructures |
94 |
|
0 |
0 |
about 8 years ago |
0 |
|
0 |
ms-rl |
C++ |
| Benchmark of various spatial data structures for collision detection. |
| elbywan/quadtree-lib |
45 |
|
4 |
10 |
over 2 years ago |
15 |
August 30, 2017 |
1 |
mit |
CoffeeScript |
| Efficient quadtrees library written in CoffeeScript. |
| vortext/clj-similar |
16 |
|
0 |
0 |
over 9 years ago |
7 |
July 20, 2016 |
0 |
epl-1.0 |
Java |
| Experimental library for similar set lookup using MinHash and k-d trees |
| krcools/CollisionDetection.jl |
6 |
|
0 |
0 |
over 3 years ago |
0 |
|
1 |
other |
Julia |
| Tree data structure for log(N) collision testing |
| rishiloyola/d-left |
5 |
|
0 |
0 |
about 9 years ago |
0 |
|
0 |
mit |
C |
| data structure to store data, rapidly, memory-efficiently and with less collision |