> Not sure I remember what is what: I'm looking for maps... I wrote a paper back in 2000-2001 discussing issues and ideas for how to do variable-length keys in libJudy. It might be worth a look if you can find it. Of course it focused on how to do them natively, whereas JudySL is an array of array of JudyL.
It's not hard now to create variable-length libJudy keys using JudyL arrays if you don't mind the first JudyL array being a sort-by-length, that is, everything in each subtree is a binary string of the same length (in bytes or bits, your choice). If you also want lexicographical or at least MSB to LSB sorting, that's a much harder problem. The paper discussed this at length. Cheers, Alan Silverstein ------------------------------------------------------------------------------ This SF.net email is sponsored by: SourcForge Community SourceForge wants to tell your story. http://p.sf.net/sfu/sf-spreadtheword _______________________________________________ Judy-devel mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/judy-devel
