Hoogle Search
Within LTS Haskell 24.36 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
fromListBE :: Bits b => [Bool] -> bbitwise Data.Bits.Bitwise Convert a big-endian list of bits to Bits.
fromListLE :: Bits b => [Bool] -> bbitwise Data.Bits.Bitwise Convert a little-endian list of bits to Bits.
toListBE :: FiniteBits b => b -> [Bool]bitwise Data.Bits.Bitwise Convert a FiniteBits to a list of bits, in big-endian order.
toListLE :: Bits b => b -> [Bool]bitwise Data.Bits.Bitwise Convert a Bits to a list of bits, in little-endian order.
fromList :: CryptHandle -> [(Bytes, v)] -> IO (Map v)bytehash Data.Bytes.HashMap Build a static hash map. This may be used on input that comes from an adversarial user. It always produces a perfect hash map.
fromListWith :: CryptHandle -> (v -> v -> v) -> [(Bytes, v)] -> IO (Map v)bytehash Data.Bytes.HashMap No documentation available.
fromTrustedList :: [(Bytes, v)] -> Map vbytehash Data.Bytes.HashMap 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.
fromList :: CryptHandle -> [(Bytes, Word)] -> IO Mapbytehash Data.Bytes.HashMap.Word No documentation available.
fromListWith :: CryptHandle -> (Word -> Word -> Word) -> [(Bytes, Word)] -> IO Mapbytehash Data.Bytes.HashMap.Word No documentation available.
fromTrustedList :: [(Bytes, Word)] -> Mapbytehash Data.Bytes.HashMap.Word 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.