3 ms·
Since when are judy arrays synonymous with tries? Judy arrays were only invented and publicized in 2004 and the only public implementation is GPLed.
by codexon 17y ago
Since when are judy arrays synonymous with tries?
Judy arrays were only invented and publicized in 2004 and the only public implementation is GPLed.
- deleted 17y ago[deleted]
- weaksauce 17y agoFor the record, and I am sure it's what you meant, a more specific description of Judy arrays is that they are a specific type of trie(though a trie is a specialization of a tree a trie is more rigorous.)
- andreyf 17y agoJudy Arrays are all Tries are all Trees, but only some Trees are Tries, and only some Tries are Judy Arrays.
- pstuart 17y agoThis of i.e. as 'that is' and e.g. as "example given'.
- deleted 17y ago[deleted]
- ramchip 17y agothe only public implementation is GPLed Actually no. Here's a BSD one: http://hackage.haskell.org/package/judy http://hackage.haskell.org/package/judy
- codexon 17y agoActually no. That's only a binding if you look at the source code. The sole C source code is only about 2-3 lines long with a "#include <Judy.h>" which isn't even included while the haskell source is littered with foreign function calls. I discussed this issue with Don on my website a couple of months ago: http://www.codexon.com/posts/why-arent-functional-languages-like-haskell-and-ocaml-popular http://www.codexon.com/posts/why-arent-functional-languages-... and believe me, he would have told me if he really did have a completely reimplemented Judy array.