libart
libart copied to clipboard
armon
Adaptive Radix Trees implemented in C
We have an application where we store lots of URIs and map them to integer IDs. Since almost all URIs start with the same prefix, we decided to use the...
Hi, I'm currently thinking about using a Java based ART implementation as an in-memory index for my Open Source temporal data store (https://sirix.io), which uses an ART like trie for...
In the following example, I insert two keys and do a search, I expect get right value, but it will raising error. ``` #include "art.h" #include "assert.h" #include "stdio.h" void...
Hi! I am trying to use this implementation of ART for 64-bit unsigned integer keys. Since the interface accept unsigned char array, I would like to confirm that integer keys...
Hi, ``` cmp = _mm_cmplt_epi8(_mm_set1_epi8(c), _mm_loadu_si128((__m128i*)n->keys)); ``` isn't it comparing them as signed bytes? I found http://www.alfredklomp.com/programming/sse-intrinsics/ with nice tips how to do unsigned compares - I hope it helps...
https://github.com/armon/libart/issues/47
nice code thanks for sharing! Was wondering if you have considered using the low bits on each child pointer to indicate the node type. Would remove the need for a...
