Once the ints have been read in

They're actually generated earlier in the algorithm and will be different from run to run.

how many lookups of them will be performed relative to the number of ints?

That depends upon how long is a (DNA) string. For the whole human genome, circa 3e9 loopkups.

Is there any structure to the ints - e.g. do they cluster together or are they random 64-bit values?

Effectively random and distributed across the full 2^64 range.

The other thought I'm having is to mod the values and use that direct as a hash for inserting into a pre-allocated array -- I can calculate how many values will be generated in advance.

Then the problem becomes how to deal with collisions.

My thinking currently is that presize the array to the next large prime number and the use (hash+prime)%prime to step around the array until an empty slot is found.

For any given starting point that should take me through every single slot before returning to the first, by which time I will have found an empty slot.

What I don't have a feel for is how many collisions I'm going to get as I approach full? And how much bigger do I have to make the array to reduce that to a reasonable number? (I'm coding up a test now.)

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 reply to Re^2: Heap structure for lookup? by BrowserUk
in thread Heap structure for lookup? by BrowserUk

Title:
Use:  <p> text here (a paragraph) </p>
and:  <code> code here </code>
to format your post, it's "PerlMonks-approved HTML":


  • Posts are HTML formatted. Put <p> </p> tags around your paragraphs. Put <code> </code> tags around your code and data!
  • Titles consisting of a single word are discouraged, and in most cases are disallowed outright.
  • Read Where should I post X? if you're not absolutely sure you're posting in the right place.
  • Please read these before you post! —
  • Posts may use any of the Perl Monks Approved HTML tags:
    a, abbr, b, big, blockquote, br, caption, center, col, colgroup, dd, del, details, div, dl, dt, em, font, h1, h2, h3, h4, h5, h6, hr, i, ins, li, ol, p, pre, readmore, small, span, spoiler, strike, strong, sub, summary, sup, table, tbody, td, tfoot, th, thead, tr, tt, u, ul, wbr
  • You may need to use entities for some characters, as follows. (Exception: Within code tags, you can put the characters literally.)
            For:     Use:
    & &amp;
    < &lt;
    > &gt;
    [ &#91;
    ] &#93;
  • Link using PerlMonks shortcuts! What shortcuts can I use for linking?
  • See Writeup Formatting Tips and other pages linked from there for more info.