Hacker GitHub

← All repos

armon/libart

View on GitHub ↗ ★ 838 C

Adaptive Radix Trees implemented in C

7 mentions on Hacker News by 5 people: 2 stories, 5 comments · first 2013-05-07 · latest 2023-04-28

Mentions per year 7 mentions · busiest year 2013 (2)
20082026
AllStoriesComments NewestTopOldest
  1. …with a vector of up to 16 sorted u8s: On x86_64, an SSE optimized vector scan like this: https://github.com/armon/libart/blob/master/src/art.c#L426 is slightly faster than linear scan, which is in turn slighty faster than binary search…
    comment by cmrdporcupine · 2023-04-28 · in Beautiful branchless binary search
  2. I'll plug a shout out to your C https://github.com/armon/libart as well. :-)
    comment by loeg · 2019-01-16 · in Demystifying Radix Trees: How Radix trees made blocking IPs 5000 times faster
  3. Or start here: https://github.com/armon/libart
    comment by loeg · 2019-01-16 · in Demystifying Radix Trees: How Radix trees made blocking IPs 5000 times faster
  4. more general, adaptive version: https://github.com/armon/libart
    comment by yjh0502 · 2015-10-04 · in Qp tries: smaller and faster than crit-bit tries
  5. Adaptive radix tree ( https://github.com/armon/libart ) is also an impressive data structure. It also supports ordered iterations while showing similar random read/write performance to hash tables. Crit-bit tree is memory efficient, but it…
    comment by yjh0502 · 2013-12-17 · in Crit-bit trees