|
|
|
| Come for the quick hacks, stay for the epiphanies. | |
| PerlMonks |
Re^2: Bidirectional lookup algorithm? (Updated: further info.)by BrowserUk (Patriarch) |
| on Jan 05, 2015 at 20:08 UTC ( [id://1112224]=note: print w/replies, xml ) | Need Help?? |
|
The current hash lookups are very fast -- possibly as fast as I could hope to get -- the problem I'm trying to address is the memory consumed by the duplication of keys & values. As I said in the OP: "so the priority is the lookup speed -- preferably O(1) though O(logN) might be acceptable if the memory reduction was sufficient." 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
|
|
|||||||||||||||||||||||||||