Open Hub
Open Hub
 

Contributions

  Analyzed 3 months ago
libslablist
Engineer Invented new data structure that is 3x - 5x more memory efficient than competing logarithmic-time data structures, such a AVL Trees, B-Trees, and Skip ... [More] Lists. Is usually just as fast, can be ~10% slower, and in some cases (vs Skip Lists) is quite a bit faster. [Less]

182 Commits in mostly C

Analyzed about 2 months ago. based on code collected 3 months ago.