If you are simply looking for existence, you could use a bit string, but that would be .5GB of memory if you did a single level.
Perhaps you could build a sparse array using each byte as one of a four-level index. On Mon, Aug 23, 2010 at 10:45 AM, Patrick Roehl <[email protected]>wrote: > I’m looking for advice on how to handle a potentially large list of data. > The list is comprised of 4-byte entries... >
