úÎú} The Show, instance kind of sucks. It just shows the Integer J representation. A good show would probably show all the present hashes. Map a value to an non-negative Int. DFor the implementation to give reliable results, it must be that if hash x  == hash y, x and y4 are equivalent under the relevant relation used in  the client code. (We don'/t depend on equality, but the client code will 5 certainly want to use the above sort of inference.) )In fact, if your equivalence relation is ==, the following quickcheck ! test should pass, for arbitrary x and y: prop_hash x y = % if hash x == hash y then x == y  else x /= y  &&! if x == y then hash x == hash y  else hash x /= hash yThe empty bit set. O(setBit on Integer)" Insert an item into the bit set. O(clearBit on Integer)" Delete an item from the bit set. O(testBit on Integer)) Ask whether the item is in the bit set.    bitset-0.5 Data.BitSetBitSetHashhashemptyinsertdeletememberBSunBS