TommyDS v3.0 has been released at : http://www.tommyds.it/ TommyDS is a C library of array, hashtables and tries data structures, designed for high performance and providing an easy to use interface. This is the list of changes: * Added support for 64-bit platforms and 64-bit integers. When building on a 64-bit platform you can store more than $2^{32}$ objects in the containers. This doesn't apply to tries that are able to store only 32-bit integers, but you can change this with the TOMMY_TRIE_BIT...
gcc (Ubuntu 11.4.0-2ubuntu1~20.04) 11.4.0
Hi Jon, I checked the code and it's right. It looks like as a false positive warning from the compiler. What compiler and version is it ? Ciao, Andrea
I am seeing the following compiler warning: c_src/tommyds/src/tommyhashlin.c: In function ‘tommy_hashlin_done’: c_src/tommyds/src/tommytypes.h:102:20: warning: ‘free’ called on pointer ‘*(tommy_hashlin_node ***)((char *)hashlin+ ivtmp*8)’ with nonzero offset [512, 17179869184] [-Wfree-nonheap-object] 102 | #define tommy_free free c_src/tommyds/src/tommyhashlin.c:82:17: note: in expansion of macro ‘tommy_free’ 82 | tommy_free(&segment[((tommy_ptrdiff_t)1) << i]); | ^~~~~~~~~~
Hey, I know you dismisssed the idea twice (in 2011 and in 2014), but it's been 9 years :/ is there any way of using a tommy_trie with strings as keys, maintaining lexicographically sorted order?
TommyDS v2.1 has been released at : http://www.tommyds.it/ TommyDS is a C library...
Hi Fredrik, Thanks for the benchmark! But please take care that you are using tommy-hashdyn...
Hi Fredrick, Thanks for the benchmark! But please take care that you are using tommy-hashdyn...
Hi, FYI, I've done a hash table lookup benchmark, where I just included tommy_hashdyn....
TommyDS v2.0 has been released at : http://tommyds.sourceforge.net/ TommyDS is a...