Safe Haskell | Safe-Inferred |
---|
Various utilities used in the network protocol stack modules
- class Functor f => Container f where
- contents :: f a -> a
- replace :: Functor f => f a -> b -> f b
- emap :: (Functor f, Container f1) => (a1 -> f a) -> f1 a1 -> f (f1 a)
- emap2 :: (Functor f, Container f1, Container f2) => (a1 -> f a) -> f1 (f2 a1) -> f (f1 (f2 a))
- lift :: (Functor f, Container f1) => f1 (f a) -> f (f1 a)
- lift2 :: (Functor f, Container f1, Container f2) => f1 (f2 (f a)) -> f (f1 (f2 a))
- doReq :: (MVarIO v m, MVarIO v io, ChannelIO c m) => c a -> ((b -> io ()) -> a) -> m b
- foldlArray :: (IArray arr elem, Ix ix, Enum ix) => arr ix elem -> (elem -> a -> a) -> a -> a
- arraySize :: (Num a1, Ix a1, IArray a e) => a a1 e -> a1
- checksum :: [Word16] -> Word16
- pairs :: a -> [a] -> [[a]]
- bytes_to_words_big :: [Word8] -> [Word16]
- bytes_to_words_lil :: [Word8] -> [Word16]
- words_to_bytes_big :: [Word16] -> [Word8]
- words_to_bytes_lil :: [Word16] -> [Word8]
Documentation
emap2 :: (Functor f, Container f1, Container f2) => (a1 -> f a) -> f1 (f2 a1) -> f (f1 (f2 a))Source
foldlArray :: (IArray arr elem, Ix ix, Enum ix) => arr ix elem -> (elem -> a -> a) -> a -> aSource
pairs :: a -> [a] -> [[a]]Source
Split a list into subcomponents of length 2. The first argument is what to append in case the list is of odd length.
bytes_to_words_big :: [Word8] -> [Word16]Source
bytes_to_words_lil :: [Word8] -> [Word16]Source
words_to_bytes_big :: [Word16] -> [Word8]Source
words_to_bytes_lil :: [Word16] -> [Word8]Source