XP is just a number | |
PerlMonks |
Re^4: Heap structure for lookup?by BrowserUk (Patriarch) |
on May 27, 2015 at 09:28 UTC ( [id://1127955]=note: print w/replies, xml ) | Need Help?? |
This means (binary) trees generally are out question, correct? Certainly any CPAN modules that store generic perl scalars. A custom implementation that stored just a U64 value; giving 24 * 150e6 ~ 3.5GB would be possible. But it's the need for 2 64-bit pointers that is the main problem, hence my mind drifting to heaps. They self order as you insert, and avoid the pointers. But are any of the variations O(logN) searchable? is there any structure on your values that might be leveraged? Or are they more or less random 64bit integers? No. They can take on any of the 2^64 values and are likely to be distributed right across the range. 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".
I'm with torvalds on this
In the absence of evidence, opinion is indistinguishable from prejudice. Agile (and TDD) debunked
In Section
Seekers of Perl Wisdom
|
|