I would definitely implement a bloom filter with an array of booleans, and will not use bit operations to modify the cells. Whether I use array access or a bit

I would definitely implement a bloom filter with an array of booleans, and will not use bit operations to modify the cells. Whether I use array access or a bitmask will mean nothing performance-wise, since the bloom filter itself is likely already speeds up a different algorithm by an order of magnitude.