Îõ³h* ; ¸     0.1.1.2 Safe-InferredËðrbytehashHash a byte sequence of length n.bytehashHash a byte array of length ná. This takes advantage of the machine-word alignment guarantee that GHC provides for byte arrays.bytehash:Statically defined source of entropy. Exactly 16384 bytes.bytehashEntropy, must be at least  (W + 1) * 8 bytesbytehash Bytes to hashbytehashEntropy, must be at least  (W + 1) * 8 bytesbytehash Bytes to hash Safe-Inferred9:;À²bytehashÿA static perfect hash table where the keys are byte arrays. This table cannot be updated after its creation, but all lookups have guaranteed O(1) worst-case cost. It consumes linear space. This is an excellent candidate for use with compact regions. Safe-Inferred9:;>ÀËØÝäåæðÔbytehashÉRecover the elements of the hashmap. These are ordered lexicographically by their corresponding keys. That is, this function returns the same output regardless of the entropy used to build the hashmap.bytehashþBuild a static hash map. This may be used on input that comes from an adversarial user. It always produces a perfect hash map.bytehashƒBuild a map from keys that are known at compile time. All keys must be 64 bytes or less. This uses a built-in source of entropy and is entirely deterministic. An adversarial user could feed this function keys that cause it to error out rather than completing. bytehash An empty Map. bytehash5Returns the value associated with the key in the map. bytehashçFor each slot, gives the number of keys that hash to it after the first hash function has been applied. bytehash0The number of non-matching entropies being used.bytehashSource of randomness bytehashSource of randomness        Safe-Inferred ËØÝäæð ¦bytehashÿA static perfect hash table where the keys are byte arrays. This table cannot be updated after its creation, but all lookups have guaranteed O(1) worst-case cost. It consumes linear space. This is an excellent candidate for use with compact regions.bytehashƒBuild a map from keys that are known at compile time. All keys must be 64 bytes or less. This uses a built-in source of entropy and is entirely deterministic. An adversarial user could feed this function keys that cause it to error out rather than completing.bytehash0The number of non-matching entropies being used.bytehashSource of randomness          'bytehash-0.1.1.2-9KimRXRxqOvIponfVo5pmzData.Bytes.HashData.Bytes.HashMapData.Bytes.HashMap.WordbytehashData.Bytes.HashMap.Internalbytes byteArrayentropyMapHashMapExceptionelementsfromListfromTrustedListemptylookup fromListWith distributiondistinctEntropies$fShowHashMapException$fEqHashMapException$fExceptionHashMapExceptionfromListWithGen