PEP 218 Re: ANN: set-0.1 module available

[Michael Gilfix]

  This may sound like a dumb idea or a good idea (depending on your
opinion) but why not use large integers to represent sets and set
members using bit vectors. A hash table can then map the bit vector
back to the original object. The nice thing about this is that
operations are done using bitwise & (yeah on longs, but it should
provide decent performance), and the hash table will allow quick
lookups. That should definitely speed things up some. Or perhaps
someone else is suggesting exactly this and I'm misreading someone
else's post?

                  -- Mike

-- 
Michael Gilfix
mgilfix at eecs.tufts.edu

For my gpg public key:
http://www.eecs.tufts.edu/~mgilfix/contact.html