Maxime, > I need a Map (associative array) with a string as the key to do fast > lookup in ram. I dont need insertion deletion .. to be fast.
You should find that JudySL is fine for your purposes, so long as you don't mind using null-terminated C strings. Even if you don't care about insert/delete, you should find them fast. Now, what values are you looking to store? Just the existence of the string? Even simpler. Otherwise you must save something in the *Pvalue (Word_t *) that you get back. Could be a single word, or a malloc()'d pointer to something else you create. > How judy compare to a burst-trie , HAT-trie and HashTrie. No idea what those are, other than they mention "trie". So they are probably reasonably fast, but not as memory-efficient. If you want to explain further and get some technical help, feel free to write to me or the list, as you prefer. Doing stuff like JudySL array of JudySL array of Judy1 array can be very powerful, and the resulting code is still not very big, but pointer manipulation is trickier... I can help you understand that. Alan Silverstein ------------------------------------------------------------------------- This SF.net email is sponsored by: Microsoft Defy all challenges. Microsoft(R) Visual Studio 2008. http://clk.atdmt.com/MRT/go/vse0120000070mrt/direct/01/ _______________________________________________ Judy-devel mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/judy-devel
