in reply to Re^2: fast lookups in files
in thread fast lookups in files

Right, but again it requires the size of the index to be known in advance - in which case you can use the binary data much more efficient.

Replies are listed 'Best First'.
Re^4: fast lookups in files
by bart (Canon) on Feb 05, 2008 at 15:58 UTC
    If you plan to store the numbers as binary data in the file: note that positive big endian integers also sort properly asciibetically. Use the "N" template for pack.
[reply]

In Section Seekers of Perl Wisdom