newtype ByteString { } #
ByteString BS.ByteString
<> :: { } #
fromStrict :: BS.ByteString -> ByteString { } #
toStrict :: ByteString -> BS.ByteString { } #
fromChunks :: [BS.ByteString] -> ByteString { } #
toChunks :: ByteString -> [BS.ByteString] { } #
empty :: ByteString { } #
singleton :: Word8 -> ByteString { } #
pack :: [Word8] -> ByteString { } #
unpack :: ByteString -> [Word8] { } #
null :: ByteString -> Bool { } #
length :: ByteString -> Int { } #
cons :: Word8 -> ByteString -> ByteString { } #
snoc :: ByteString -> Word8 -> ByteString { } #
append :: ByteString -> ByteString -> ByteString { } #
head :: ByteString -> Word8 { } #
last :: ByteString -> Word8 { } #
tail :: ByteString -> ByteString { } #
init :: ByteString -> ByteString { } #
uncons :: ByteString -> Maybe (Word8, ByteString) { } #
unsnoc :: ByteString -> Maybe (ByteString, Word8) { } #
map :: (Word8 -> Word8) -> ByteString -> ByteString { } #
reverse :: ByteString -> ByteString { } #
intersperse :: Word8 -> ByteString -> ByteString { } #
intercalate :: ByteString -> [ByteString] -> ByteString { } #
foldl :: (a -> Word8 -> a) -> a -> ByteString -> a { } #
foldl' :: (a -> Word8 -> a) -> a -> ByteString -> a { } #
foldr :: (Word8 -> a -> a) -> a -> ByteString -> a { } #
concat :: [ByteString] -> ByteString { } #
concatMap :: (Word8 -> ByteString) -> ByteString -> ByteString { } #
any :: (Word8 -> Bool) -> ByteString -> Bool { } #
all :: (Word8 -> Bool) -> ByteString -> Bool { } #
maximum :: ByteString -> Word8 { } #
minimum :: ByteString -> Word8 { } #
take :: Int -> ByteString -> ByteString { } #
drop :: Int -> ByteString -> ByteString { } #
splitAt :: Int -> ByteString -> (ByteString, ByteString) { } #
takeWhile :: (Word8 -> Bool) -> ByteString -> ByteString { } #
dropWhile :: (Word8 -> Bool) -> ByteString -> ByteString { } #
span :: (Word8 -> Bool) -> ByteString -> (ByteString, ByteString) { } #
break :: (Word8 -> Bool) -> ByteString -> (ByteString, ByteString) { } #
isPrefixOf :: ByteString -> ByteString -> Bool { } #
isSuffixOf :: ByteString -> ByteString -> Bool { } #
elem :: Word8 -> ByteString -> Bool { } #
notElem :: Word8 -> ByteString -> Bool { } #
find :: (Word8 -> Bool) -> ByteString -> Maybe Word8 { } #
filter :: (Word8 -> Bool) -> ByteString -> ByteString { } #
partition :: (Word8 -> Bool) -> ByteString -> (ByteString, ByteString) { } #
index :: ByteString -> Int -> Word8 { } #
elemIndex :: Word8 -> ByteString -> Maybe Int { } #
findIndex :: (Word8 -> Bool) -> ByteString -> Maybe Int { } #
count :: Word8 -> ByteString -> Int { } #
zip :: ByteString -> ByteString -> [(Word8, Word8)] { } #
zipWith :: (Word8 -> Word8 -> a) -> ByteString -> ByteString -> [a] { } #
unzip :: [(Word8, Word8)] -> (ByteString, ByteString) { } #
getContents :: IO ByteString { } #
putStr :: ByteString -> IO () { } #
putStrLn :: ByteString -> IO () { } #
readFile :: FilePath -> IO ByteString { } #
writeFile :: FilePath -> ByteString -> IO () { } #
appendFile :: FilePath -> ByteString -> IO () { } #
hGetContents :: Handle -> IO ByteString { } #
hGet :: Handle -> Int -> IO ByteString { } #
hPut :: Handle -> ByteString -> IO () { } #
hPutStr :: Handle -> ByteString -> IO () { } #
hPutStrLn :: Handle -> ByteString -> IO () { } #
instance Show ByteString { }
instance Monoid ByteString { }