Copyright	(c) Andrey Mulik 2019
License	BSD-style
Maintainer	work.a.mulik@gmail.com
Portability	non-portable (GHC Extensions)
Safe Haskell	Trustworthy
Language	Haskell2010

SDP.ByteString.Lazy

Contents

Exports
ByteString
Orphan instances

Description

SDP.ByteString.Lazy provides sdp instances for lazy ByteString.

Synopsis

module System.IO.Classes
module SDP.Indexed
module SDP.Sort
data ByteString
type LByteString = ByteString
fromStrict :: ByteString -> ByteString
toStrict :: ByteString -> ByteString
fromChunks :: [ByteString] -> ByteString
toChunks :: ByteString -> [ByteString]

Exports

module System.IO.Classes

module SDP.Indexed

module SDP.Sort

ByteString

data ByteString #

A space-efficient representation of a Word8 vector, supporting many efficient operations.

A lazy ByteString contains 8-bit bytes, or by using the operations from Data.ByteString.Lazy.Char8 it can be interpreted as containing 8-bit characters.

Instances

Instances details

Eq ByteString
Instance details Defined in Data.ByteString.Lazy.Internal Methods (==) :: ByteString -> ByteString -> Bool # (/=) :: ByteString -> ByteString -> Bool #
Data ByteString
Instance details Defined in Data.ByteString.Lazy.Internal Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> ByteString -> c ByteString # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c ByteString # toConstr :: ByteString -> Constr # dataTypeOf :: ByteString -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c ByteString) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c ByteString) # gmapT :: (forall b. Data b => b -> b) -> ByteString -> ByteString # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ByteString -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ByteString -> r # gmapQ :: (forall d. Data d => d -> u) -> ByteString -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> ByteString -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> ByteString -> m ByteString # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ByteString -> m ByteString # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ByteString -> m ByteString #
Ord ByteString
Instance details Defined in Data.ByteString.Lazy.Internal Methods compare :: ByteString -> ByteString -> Ordering # (<) :: ByteString -> ByteString -> Bool # (<=) :: ByteString -> ByteString -> Bool # (>) :: ByteString -> ByteString -> Bool # (>=) :: ByteString -> ByteString -> Bool # max :: ByteString -> ByteString -> ByteString # min :: ByteString -> ByteString -> ByteString #
Read ByteString
Instance details Defined in Data.ByteString.Lazy.Internal Methods readsPrec :: Int -> ReadS ByteString # readList :: ReadS [ByteString] # readPrec :: ReadPrec ByteString # readListPrec :: ReadPrec [ByteString] #
Show ByteString
Instance details Defined in Data.ByteString.Lazy.Internal Methods showsPrec :: Int -> ByteString -> ShowS # show :: ByteString -> String # showList :: [ByteString] -> ShowS #
IsString ByteString
Instance details Defined in Data.ByteString.Lazy.Internal Methods fromString :: String -> ByteString #
Semigroup ByteString
Instance details Defined in Data.ByteString.Lazy.Internal Methods (<>) :: ByteString -> ByteString -> ByteString # sconcat :: NonEmpty ByteString -> ByteString # stimes :: Integral b => b -> ByteString -> ByteString #
Monoid ByteString
Instance details Defined in Data.ByteString.Lazy.Internal Methods mempty :: ByteString # mappend :: ByteString -> ByteString -> ByteString # mconcat :: [ByteString] -> ByteString #
NFData ByteString
Instance details Defined in Data.ByteString.Lazy.Internal Methods rnf :: ByteString -> () #
Nullable ByteString Source #
Instance details Defined in SDP.ByteString.Lazy Methods lzero :: ByteString # isNull :: ByteString -> Bool #
Estimate ByteString Source #
Instance details Defined in SDP.ByteString.Lazy Methods (<.=>) :: ByteString -> Int -> Ordering # (<==>) :: Compare ByteString # (.==) :: ByteString -> Int -> Bool # (./=) :: ByteString -> Int -> Bool # (.<=) :: ByteString -> Int -> Bool # (.>=) :: ByteString -> Int -> Bool # (.<) :: ByteString -> Int -> Bool # (.>) :: ByteString -> Int -> Bool # (.<.) :: ByteString -> ByteString -> Bool # (.>.) :: ByteString -> ByteString -> Bool # (.<=.) :: ByteString -> ByteString -> Bool # (.>=.) :: ByteString -> ByteString -> Bool # (.==.) :: ByteString -> ByteString -> Bool # (./=.) :: ByteString -> ByteString -> Bool #
IsFile ByteString Source #
Instance details Defined in SDP.ByteString.Lazy Methods hGetContents :: MonadIO io => Handle -> io ByteString # hPutContents :: MonadIO io => Handle -> ByteString -> io () #
IsTextFile ByteString Source #
Instance details Defined in SDP.ByteString.Lazy Methods hGetLine :: MonadIO io => Handle -> io ByteString # hPutStr :: MonadIO io => Handle -> ByteString -> io () # hPutStrLn :: MonadIO io => Handle -> ByteString -> io () #
Bordered ByteString Int Source #
Instance details Defined in SDP.ByteString.Lazy Methods bounds :: ByteString -> (Int, Int) # lower :: ByteString -> Int # upper :: ByteString -> Int # sizeOf :: ByteString -> Int # sizesOf :: ByteString -> [Int] # indexIn :: ByteString -> Int -> Bool # indices :: ByteString -> [Int] # indexOf :: ByteString -> Int -> Int # offsetOf :: ByteString -> Int -> Int #
Linear ByteString Word8 Source #
Instance details Defined in SDP.ByteString.Lazy Methods uncons :: ByteString -> (Word8, ByteString) # uncons' :: ByteString -> Maybe (Word8, ByteString) # toHead :: Word8 -> ByteString -> ByteString # head :: ByteString -> Word8 # tail :: ByteString -> ByteString # unsnoc :: ByteString -> (ByteString, Word8) # unsnoc' :: ByteString -> Maybe (ByteString, Word8) # toLast :: ByteString -> Word8 -> ByteString # init :: ByteString -> ByteString # last :: ByteString -> Word8 # single :: Word8 -> ByteString # (++) :: ByteString -> ByteString -> ByteString # replicate :: Int -> Word8 -> ByteString # fromList :: [Word8] -> ByteString # fromListN :: Int -> [Word8] -> ByteString # listR :: ByteString -> [Word8] # listL :: ByteString -> [Word8] # fromFoldable :: Foldable f => f Word8 -> ByteString # (!^) :: ByteString -> Int -> Word8 # write :: ByteString -> Int -> Word8 -> ByteString # concat :: Foldable f => f ByteString -> ByteString # concatMap :: Foldable f => (a -> ByteString) -> f a -> ByteString # intersperse :: Word8 -> ByteString -> ByteString # filter :: (Word8 -> Bool) -> ByteString -> ByteString # except :: (Word8 -> Bool) -> ByteString -> ByteString # partition :: (Word8 -> Bool) -> ByteString -> (ByteString, ByteString) # partitions :: Foldable f => f (Word8 -> Bool) -> ByteString -> [ByteString] # select :: (Word8 -> Maybe a) -> ByteString -> [a] # select' :: (t Word8 ~ ByteString, Linear1 t a) => (Word8 -> Maybe a) -> ByteString -> t a # extract :: (Word8 -> Maybe a) -> ByteString -> ([a], ByteString) # extract' :: (t Word8 ~ ByteString, Linear1 t a) => (Word8 -> Maybe a) -> ByteString -> (t a, ByteString) # selects :: Foldable f => f (Word8 -> Maybe a) -> ByteString -> ([[a]], ByteString) # selects' :: (Foldable f, t Word8 ~ ByteString, Linear1 t a) => f (Word8 -> Maybe a) -> ByteString -> ([t a], ByteString) # isSubseqOf :: ByteString -> ByteString -> Bool # reverse :: ByteString -> ByteString # force :: ByteString -> ByteString # subsequences :: ByteString -> [ByteString] # iterate :: Int -> (Word8 -> Word8) -> Word8 -> ByteString # nub :: ByteString -> ByteString # nubBy :: Equal Word8 -> ByteString -> ByteString # ofoldr :: (Int -> Word8 -> b -> b) -> b -> ByteString -> b # ofoldl :: (Int -> b -> Word8 -> b) -> b -> ByteString -> b # ofoldr' :: (Int -> Word8 -> b -> b) -> b -> ByteString -> b # ofoldl' :: (Int -> b -> Word8 -> b) -> b -> ByteString -> b # o_foldr :: (Word8 -> b -> b) -> b -> ByteString -> b # o_foldl :: (b -> Word8 -> b) -> b -> ByteString -> b # o_foldr' :: (Word8 -> b -> b) -> b -> ByteString -> b # o_foldl' :: (b -> Word8 -> b) -> b -> ByteString -> b #
Split ByteString Word8 Source #
Instance details Defined in SDP.ByteString.Lazy Methods take :: Int -> ByteString -> ByteString # drop :: Int -> ByteString -> ByteString # keep :: Int -> ByteString -> ByteString # sans :: Int -> ByteString -> ByteString # save :: Int -> ByteString -> ByteString # skip :: Int -> ByteString -> ByteString # split :: Int -> ByteString -> (ByteString, ByteString) # divide :: Int -> ByteString -> (ByteString, ByteString) # splits :: Foldable f => f Int -> ByteString -> [ByteString] # divides :: Foldable f => f Int -> ByteString -> [ByteString] # parts :: Foldable f => f Int -> ByteString -> [ByteString] # chunks :: Int -> ByteString -> [ByteString] # splitBy :: (Word8 -> Bool) -> ByteString -> (ByteString, ByteString) # divideBy :: (Word8 -> Bool) -> ByteString -> (ByteString, ByteString) # splitsBy :: (Word8 -> Bool) -> ByteString -> [ByteString] # splitsOn :: ByteString -> ByteString -> [ByteString] # replaceBy :: ByteString -> ByteString -> ByteString -> ByteString # removeAll :: ByteString -> ByteString -> ByteString # combo :: Equal Word8 -> ByteString -> Int # justifyL :: Int -> Word8 -> ByteString -> ByteString # justifyR :: Int -> Word8 -> ByteString -> ByteString # each :: Int -> ByteString -> ByteString # eachFrom :: Int -> Int -> ByteString -> ByteString # isPrefixOf :: ByteString -> ByteString -> Bool # isSuffixOf :: ByteString -> ByteString -> Bool # isInfixOf :: ByteString -> ByteString -> Bool # prefix :: (Word8 -> Bool) -> ByteString -> Int # suffix :: (Word8 -> Bool) -> ByteString -> Int # infixes :: ByteString -> ByteString -> [Int] # dropSide :: (Word8 -> Bool) -> ByteString -> ByteString # takeWhile :: (Word8 -> Bool) -> ByteString -> ByteString # dropWhile :: (Word8 -> Bool) -> ByteString -> ByteString # takeEnd :: (Word8 -> Bool) -> ByteString -> ByteString # dropEnd :: (Word8 -> Bool) -> ByteString -> ByteString # spanl :: (Word8 -> Bool) -> ByteString -> (ByteString, ByteString) # breakl :: (Word8 -> Bool) -> ByteString -> (ByteString, ByteString) # spanr :: (Word8 -> Bool) -> ByteString -> (ByteString, ByteString) # breakr :: (Word8 -> Bool) -> ByteString -> (ByteString, ByteString) # selectWhile :: (Word8 -> Maybe a) -> ByteString -> [a] # selectEnd :: (Word8 -> Maybe a) -> ByteString -> [a] # extractWhile :: (Word8 -> Maybe a) -> ByteString -> ([a], ByteString) # extractEnd :: (Word8 -> Maybe a) -> ByteString -> (ByteString, [a]) # selectWhile' :: (t Word8 ~ l, Split1 t a) => (Word8 -> Maybe a) -> ByteString -> t a # selectEnd' :: (t Word8 ~ l, Split1 t a) => (Word8 -> Maybe a) -> ByteString -> t a # extractWhile' :: (t Word8 ~ l, Split1 t a) => (Word8 -> Maybe a) -> ByteString -> (t a, ByteString) # extractEnd' :: (t Word8 ~ l, Split1 t a) => (Word8 -> Maybe a) -> ByteString -> (ByteString, t a) #
Sort ByteString Word8 Source #
Instance details Defined in SDP.ByteString.Lazy Methods sortedBy :: (Word8 -> Word8 -> Bool) -> ByteString -> Bool # sortBy :: Compare Word8 -> ByteString -> ByteString #
Indexed ByteString Int Word8 Source #
Instance details Defined in SDP.ByteString.Lazy Methods assoc :: (Int, Int) -> [(Int, Word8)] -> ByteString # assoc' :: (Int, Int) -> Word8 -> [(Int, Word8)] -> ByteString # fromIndexed :: Indexed m j Word8 => m -> ByteString # write' :: ByteString -> Int -> Word8 -> ByteString # accum :: (Word8 -> e' -> Word8) -> ByteString -> [(Int, e')] -> ByteString # imap :: Map m j Word8 => (Int, Int) -> m -> (Int -> j) -> ByteString # update' :: ByteString -> (Word8 -> Word8) -> Int -> ByteString # updates' :: ByteString -> (Int -> Word8 -> Word8) -> ByteString #
Map ByteString Int Word8 Source #
Instance details Defined in SDP.ByteString.Lazy Methods assocs :: ByteString -> [(Int, Word8)] # toMap :: [(Int, Word8)] -> ByteString # toMap' :: Word8 -> [(Int, Word8)] -> ByteString # insert' :: Int -> Word8 -> ByteString -> ByteString # delete' :: Int -> ByteString -> ByteString # member' :: Int -> ByteString -> Bool # (//) :: ByteString -> [(Int, Word8)] -> ByteString # (.!) :: ByteString -> Int -> Word8 # (!) :: ByteString -> Int -> Word8 # (!?) :: ByteString -> Int -> Maybe Word8 # filter' :: (Int -> Word8 -> Bool) -> ByteString -> ByteString # union' :: (Word8 -> Word8 -> Word8) -> ByteString -> ByteString -> ByteString # difference' :: (Word8 -> Word8 -> Maybe Word8) -> ByteString -> ByteString -> ByteString # intersection' :: (Word8 -> Word8 -> Word8) -> ByteString -> ByteString -> ByteString # update :: ByteString -> (Int -> Word8 -> Word8) -> ByteString # lookupLT' :: Int -> ByteString -> Maybe (Int, Word8) # lookupGT' :: Int -> ByteString -> Maybe (Int, Word8) # lookupLE' :: Int -> ByteString -> Maybe (Int, Word8) # lookupGE' :: Int -> ByteString -> Maybe (Int, Word8) # keys :: ByteString -> [Int] # (.$) :: (Word8 -> Bool) -> ByteString -> Maybe Int # (*$) :: (Word8 -> Bool) -> ByteString -> [Int] # kfoldr :: (Int -> Word8 -> b -> b) -> b -> ByteString -> b # kfoldl :: (Int -> b -> Word8 -> b) -> b -> ByteString -> b # kfoldr' :: (Int -> Word8 -> b -> b) -> b -> ByteString -> b # kfoldl' :: (Int -> b -> Word8 -> b) -> b -> ByteString -> b #
MonadIO io => Thaw io ByteString (MIOUblist io Word8) Source #
Instance details Defined in SDP.ByteString.Lazy Methods thaw :: ByteString -> io (MIOUblist io Word8) # unsafeThaw :: ByteString -> io (MIOUblist io Word8) #
MonadIO io => Freeze io (MIOUblist io Word8) ByteString Source #
Instance details Defined in SDP.ByteString.Lazy Methods freeze :: MIOUblist io Word8 -> io ByteString # unsafeFreeze :: MIOUblist io Word8 -> io ByteString #
Thaw (ST s) ByteString (STUblist s Word8) Source #
Instance details Defined in SDP.ByteString.Lazy Methods thaw :: ByteString -> ST s (STUblist s Word8) # unsafeThaw :: ByteString -> ST s (STUblist s Word8) #
Freeze (ST s) (STUblist s Word8) ByteString Source #
Instance details Defined in SDP.ByteString.Lazy Methods freeze :: STUblist s Word8 -> ST s ByteString # unsafeFreeze :: STUblist s Word8 -> ST s ByteString #

type LByteString = ByteString Source #

Type synonym to avoid ambiguity.

fromStrict :: ByteString -> ByteString #

O(1) Convert a strict ByteString into a lazy ByteString.

toStrict :: ByteString -> ByteString #

O(n) Convert a lazy ByteString into a strict ByteString.

Note that this is an expensive operation that forces the whole lazy ByteString into memory and then copies all the data. If possible, try to avoid converting back and forth between strict and lazy bytestrings.

fromChunks :: [ByteString] -> ByteString #

O(c) Convert a list of strict ByteString into a lazy ByteString

toChunks :: ByteString -> [ByteString] #

O(c) Convert a lazy ByteString into a list of strict ByteString

Orphan instances

Nullable ByteString Source #
Instance details Methods lzero :: ByteString # isNull :: ByteString -> Bool #
Estimate ByteString Source #
Instance details Methods (<.=>) :: ByteString -> Int -> Ordering # (<==>) :: Compare ByteString # (.==) :: ByteString -> Int -> Bool # (./=) :: ByteString -> Int -> Bool # (.<=) :: ByteString -> Int -> Bool # (.>=) :: ByteString -> Int -> Bool # (.<) :: ByteString -> Int -> Bool # (.>) :: ByteString -> Int -> Bool # (.<.) :: ByteString -> ByteString -> Bool # (.>.) :: ByteString -> ByteString -> Bool # (.<=.) :: ByteString -> ByteString -> Bool # (.>=.) :: ByteString -> ByteString -> Bool # (.==.) :: ByteString -> ByteString -> Bool # (./=.) :: ByteString -> ByteString -> Bool #
IsFile ByteString Source #
Instance details Methods hGetContents :: MonadIO io => Handle -> io ByteString # hPutContents :: MonadIO io => Handle -> ByteString -> io () #
IsTextFile ByteString Source #
Instance details Methods hGetLine :: MonadIO io => Handle -> io ByteString # hPutStr :: MonadIO io => Handle -> ByteString -> io () # hPutStrLn :: MonadIO io => Handle -> ByteString -> io () #
Bordered ByteString Int Source #
Instance details Methods bounds :: ByteString -> (Int, Int) # lower :: ByteString -> Int # upper :: ByteString -> Int # sizeOf :: ByteString -> Int # sizesOf :: ByteString -> [Int] # indexIn :: ByteString -> Int -> Bool # indices :: ByteString -> [Int] # indexOf :: ByteString -> Int -> Int # offsetOf :: ByteString -> Int -> Int #
Linear ByteString Word8 Source #
Instance details Methods uncons :: ByteString -> (Word8, ByteString) # uncons' :: ByteString -> Maybe (Word8, ByteString) # toHead :: Word8 -> ByteString -> ByteString # head :: ByteString -> Word8 # tail :: ByteString -> ByteString # unsnoc :: ByteString -> (ByteString, Word8) # unsnoc' :: ByteString -> Maybe (ByteString, Word8) # toLast :: ByteString -> Word8 -> ByteString # init :: ByteString -> ByteString # last :: ByteString -> Word8 # single :: Word8 -> ByteString # (++) :: ByteString -> ByteString -> ByteString # replicate :: Int -> Word8 -> ByteString # fromList :: [Word8] -> ByteString # fromListN :: Int -> [Word8] -> ByteString # listR :: ByteString -> [Word8] # listL :: ByteString -> [Word8] # fromFoldable :: Foldable f => f Word8 -> ByteString # (!^) :: ByteString -> Int -> Word8 # write :: ByteString -> Int -> Word8 -> ByteString # concat :: Foldable f => f ByteString -> ByteString # concatMap :: Foldable f => (a -> ByteString) -> f a -> ByteString # intersperse :: Word8 -> ByteString -> ByteString # filter :: (Word8 -> Bool) -> ByteString -> ByteString # except :: (Word8 -> Bool) -> ByteString -> ByteString # partition :: (Word8 -> Bool) -> ByteString -> (ByteString, ByteString) # partitions :: Foldable f => f (Word8 -> Bool) -> ByteString -> [ByteString] # select :: (Word8 -> Maybe a) -> ByteString -> [a] # select' :: (t Word8 ~ ByteString, Linear1 t a) => (Word8 -> Maybe a) -> ByteString -> t a # extract :: (Word8 -> Maybe a) -> ByteString -> ([a], ByteString) # extract' :: (t Word8 ~ ByteString, Linear1 t a) => (Word8 -> Maybe a) -> ByteString -> (t a, ByteString) # selects :: Foldable f => f (Word8 -> Maybe a) -> ByteString -> ([[a]], ByteString) # selects' :: (Foldable f, t Word8 ~ ByteString, Linear1 t a) => f (Word8 -> Maybe a) -> ByteString -> ([t a], ByteString) # isSubseqOf :: ByteString -> ByteString -> Bool # reverse :: ByteString -> ByteString # force :: ByteString -> ByteString # subsequences :: ByteString -> [ByteString] # iterate :: Int -> (Word8 -> Word8) -> Word8 -> ByteString # nub :: ByteString -> ByteString # nubBy :: Equal Word8 -> ByteString -> ByteString # ofoldr :: (Int -> Word8 -> b -> b) -> b -> ByteString -> b # ofoldl :: (Int -> b -> Word8 -> b) -> b -> ByteString -> b # ofoldr' :: (Int -> Word8 -> b -> b) -> b -> ByteString -> b # ofoldl' :: (Int -> b -> Word8 -> b) -> b -> ByteString -> b # o_foldr :: (Word8 -> b -> b) -> b -> ByteString -> b # o_foldl :: (b -> Word8 -> b) -> b -> ByteString -> b # o_foldr' :: (Word8 -> b -> b) -> b -> ByteString -> b # o_foldl' :: (b -> Word8 -> b) -> b -> ByteString -> b #
Split ByteString Word8 Source #
Instance details Methods take :: Int -> ByteString -> ByteString # drop :: Int -> ByteString -> ByteString # keep :: Int -> ByteString -> ByteString # sans :: Int -> ByteString -> ByteString # save :: Int -> ByteString -> ByteString # skip :: Int -> ByteString -> ByteString # split :: Int -> ByteString -> (ByteString, ByteString) # divide :: Int -> ByteString -> (ByteString, ByteString) # splits :: Foldable f => f Int -> ByteString -> [ByteString] # divides :: Foldable f => f Int -> ByteString -> [ByteString] # parts :: Foldable f => f Int -> ByteString -> [ByteString] # chunks :: Int -> ByteString -> [ByteString] # splitBy :: (Word8 -> Bool) -> ByteString -> (ByteString, ByteString) # divideBy :: (Word8 -> Bool) -> ByteString -> (ByteString, ByteString) # splitsBy :: (Word8 -> Bool) -> ByteString -> [ByteString] # splitsOn :: ByteString -> ByteString -> [ByteString] # replaceBy :: ByteString -> ByteString -> ByteString -> ByteString # removeAll :: ByteString -> ByteString -> ByteString # combo :: Equal Word8 -> ByteString -> Int # justifyL :: Int -> Word8 -> ByteString -> ByteString # justifyR :: Int -> Word8 -> ByteString -> ByteString # each :: Int -> ByteString -> ByteString # eachFrom :: Int -> Int -> ByteString -> ByteString # isPrefixOf :: ByteString -> ByteString -> Bool # isSuffixOf :: ByteString -> ByteString -> Bool # isInfixOf :: ByteString -> ByteString -> Bool # prefix :: (Word8 -> Bool) -> ByteString -> Int # suffix :: (Word8 -> Bool) -> ByteString -> Int # infixes :: ByteString -> ByteString -> [Int] # dropSide :: (Word8 -> Bool) -> ByteString -> ByteString # takeWhile :: (Word8 -> Bool) -> ByteString -> ByteString # dropWhile :: (Word8 -> Bool) -> ByteString -> ByteString # takeEnd :: (Word8 -> Bool) -> ByteString -> ByteString # dropEnd :: (Word8 -> Bool) -> ByteString -> ByteString # spanl :: (Word8 -> Bool) -> ByteString -> (ByteString, ByteString) # breakl :: (Word8 -> Bool) -> ByteString -> (ByteString, ByteString) # spanr :: (Word8 -> Bool) -> ByteString -> (ByteString, ByteString) # breakr :: (Word8 -> Bool) -> ByteString -> (ByteString, ByteString) # selectWhile :: (Word8 -> Maybe a) -> ByteString -> [a] # selectEnd :: (Word8 -> Maybe a) -> ByteString -> [a] # extractWhile :: (Word8 -> Maybe a) -> ByteString -> ([a], ByteString) # extractEnd :: (Word8 -> Maybe a) -> ByteString -> (ByteString, [a]) # selectWhile' :: (t Word8 ~ l, Split1 t a) => (Word8 -> Maybe a) -> ByteString -> t a # selectEnd' :: (t Word8 ~ l, Split1 t a) => (Word8 -> Maybe a) -> ByteString -> t a # extractWhile' :: (t Word8 ~ l, Split1 t a) => (Word8 -> Maybe a) -> ByteString -> (t a, ByteString) # extractEnd' :: (t Word8 ~ l, Split1 t a) => (Word8 -> Maybe a) -> ByteString -> (ByteString, t a) #
Sort ByteString Word8 Source #
Instance details Methods sortedBy :: (Word8 -> Word8 -> Bool) -> ByteString -> Bool # sortBy :: Compare Word8 -> ByteString -> ByteString #
Indexed ByteString Int Word8 Source #
Instance details Methods assoc :: (Int, Int) -> [(Int, Word8)] -> ByteString # assoc' :: (Int, Int) -> Word8 -> [(Int, Word8)] -> ByteString # fromIndexed :: Indexed m j Word8 => m -> ByteString # write' :: ByteString -> Int -> Word8 -> ByteString # accum :: (Word8 -> e' -> Word8) -> ByteString -> [(Int, e')] -> ByteString # imap :: Map m j Word8 => (Int, Int) -> m -> (Int -> j) -> ByteString # update' :: ByteString -> (Word8 -> Word8) -> Int -> ByteString # updates' :: ByteString -> (Int -> Word8 -> Word8) -> ByteString #
Map ByteString Int Word8 Source #
Instance details Methods assocs :: ByteString -> [(Int, Word8)] # toMap :: [(Int, Word8)] -> ByteString # toMap' :: Word8 -> [(Int, Word8)] -> ByteString # insert' :: Int -> Word8 -> ByteString -> ByteString # delete' :: Int -> ByteString -> ByteString # member' :: Int -> ByteString -> Bool # (//) :: ByteString -> [(Int, Word8)] -> ByteString # (.!) :: ByteString -> Int -> Word8 # (!) :: ByteString -> Int -> Word8 # (!?) :: ByteString -> Int -> Maybe Word8 # filter' :: (Int -> Word8 -> Bool) -> ByteString -> ByteString # union' :: (Word8 -> Word8 -> Word8) -> ByteString -> ByteString -> ByteString # difference' :: (Word8 -> Word8 -> Maybe Word8) -> ByteString -> ByteString -> ByteString # intersection' :: (Word8 -> Word8 -> Word8) -> ByteString -> ByteString -> ByteString # update :: ByteString -> (Int -> Word8 -> Word8) -> ByteString # lookupLT' :: Int -> ByteString -> Maybe (Int, Word8) # lookupGT' :: Int -> ByteString -> Maybe (Int, Word8) # lookupLE' :: Int -> ByteString -> Maybe (Int, Word8) # lookupGE' :: Int -> ByteString -> Maybe (Int, Word8) # keys :: ByteString -> [Int] # (.$) :: (Word8 -> Bool) -> ByteString -> Maybe Int # (*$) :: (Word8 -> Bool) -> ByteString -> [Int] # kfoldr :: (Int -> Word8 -> b -> b) -> b -> ByteString -> b # kfoldl :: (Int -> b -> Word8 -> b) -> b -> ByteString -> b # kfoldr' :: (Int -> Word8 -> b -> b) -> b -> ByteString -> b # kfoldl' :: (Int -> b -> Word8 -> b) -> b -> ByteString -> b #
MonadIO io => Thaw io ByteString (MIOUblist io Word8) Source #
Instance details Methods thaw :: ByteString -> io (MIOUblist io Word8) # unsafeThaw :: ByteString -> io (MIOUblist io Word8) #
MonadIO io => Freeze io (MIOUblist io Word8) ByteString Source #
Instance details Methods freeze :: MIOUblist io Word8 -> io ByteString # unsafeFreeze :: MIOUblist io Word8 -> io ByteString #
Thaw (ST s) ByteString (STUblist s Word8) Source #
Instance details Methods thaw :: ByteString -> ST s (STUblist s Word8) # unsafeThaw :: ByteString -> ST s (STUblist s Word8) #
Freeze (ST s) (STUblist s Word8) ByteString Source #
Instance details Methods freeze :: STUblist s Word8 -> ST s ByteString # unsafeFreeze :: STUblist s Word8 -> ST s ByteString #