in reply to Re^4: Fastest way to test membership in a constant set (Why not?)
in thread Fastest way to test membership in a constant set

Bitsets are often used for representation of sets. That is the reason I was curious to see how they compare with hashes.

I agree with you that for this and probably most of the cases, hash is a better representation for a set. In case of a lottery, for example, bitsets might be better.
  • Comment on Re^5: Fastest way to test membership in a constant set (Why not?)

In Section Seekers of Perl Wisdom