Perl-Sensitive Sunglasses | |
PerlMonks |
Re^2: Bidirectional lookup algorithm? (judy trie?)by BrowserUk (Patriarch) |
on Jan 05, 2015 at 00:18 UTC ( [id://1112139]=note: print w/replies, xml ) | Need Help?? |
Have you considered a Trie like a Judy array? specifically Judy::L (int to pointer) and Judy::HS (string to int/pointer) I hadn't. In the past; I've avoided Judy arrays for the simple reason that I hate to use stuff I don't understand. And whilst I 'understand' the principles behind Judy arrays, the code is so complex that I doubt my ability to maintain it; and hate to get stuck needing other people to do things for me. And I just rediscovered another reason I've not used them:
Recurse: see recurse! With the rise and rise of 'Social' network sites: 'Computers are making people easier to use everyday'
Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.
"Science is about questioning the status quo. Questioning authority".
In the absence of evidence, opinion is indistinguishable from prejudice.
In Section
Seekers of Perl Wisdom
|
|