On Wed, 2 Nov 2005 13:55:10 +0100, "Tor Erik Sønvisen" <[EMAIL PROTECTED]> wrote:
>Hi > >I need a time and space efficient way of storing up to 6 million bits. Time >efficency is more important then space efficency as I'm going to do searches >through the bit-set. > Very dependent on what kind of "searches" -- e.g., 1024*1024 suggests the possibility of two dimensions. Quad-trees? How sparse is the data? Etc. What kinds of patterns are you going to search for? Regards, Bengt Richter
-- http://mail.python.org/mailman/listinfo/python-list
