|
|
|
| laziness, impatience, and hubris | |
| PerlMonks |
Re^2: Bidirectional lookup algorithm?by BrowserUk (Patriarch) |
| on Jan 08, 2015 at 15:26 UTC ( [id://1112653]=note: print w/replies, xml ) | Need Help?? |
|
Essentially, that is what I am doing. One array of structs contains the paired data. This is ordered by hashing one of the values. A parallel array of ints contains indexes into the first array and are ordered by hashing the second value, Once I've fixed a couple of edge cases I know about, tested it some more, and probably moved it from linear to hopscotch probing, I'll post the code in this thread. 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
|
|
||||||||||||||||||||||