úÎÿ‹      Safe-Inferred0Set of bytes (>). Note that NF and WHNF are equivalent for values of type .O(1). Cardinality of the byteset.O(1). Is the byteset empty?O(1)'. Is the value a member of the byteset?O(1) . Is the element not in the set?O(1). The empty byteset.O(1). Add a value to the byteset.O(1). A byteset of one element. O(1)[. Delete a byte in the byteset. Returns the original byteset when the byte was not present. O(1). The union of two bytesets. AThe union of a list of bytesets. Just a fold over the list using  . O(1)". Difference between two bytesets. O(1)#. The intersection of two bytesets.O(n)2. Filter all elements that satisfy some predicate.O(n)U. Fold the elements in the byteset using the given right-associative binary operator.O(n) . Map a function over a byteset.O(n)/. The elements of a byteset in ascending order.O(n). An alias of .O(n)(. Create a byteset from a list of bytes.         byteset-0.1.1.0 Data.ByteSetbaseGHC.WordWord8ByteSetsizenullmember notMemberemptyinsert singletondeleteunionunions difference intersectionfilterfoldrmapelemstoListfromList generalGet generalSet generalOp generalFunbits$fBinaryByteSet $fShowByteSet