Safe Haskell	Safe
Language	Haskell2010

Data.ByteString.Arbitrary

Synopsis

newtype ArbByteString = ABS {
- fromABS :: ByteString
}
newtype ArbByteString1M = ABS1M {
- fromABS1M :: ByteString
}
newtype ArbByteString10M = ABS10M {
- fromABS10M :: ByteString
}
fastRandBs :: Int -> Gen ByteString
slowRandBs :: Int -> Gen ByteString

Documentation

newtype ArbByteString Source #

A ByteString wrapper so we can implement Arbitrary for ByteString. This will currently generate random ByteStrings of length 0 to 100KB.

Constructors

ABS
Fields fromABS :: ByteString

Instances

Eq ArbByteString Source #
Instance details Defined in Data.ByteString.Arbitrary Methods (==) :: ArbByteString -> ArbByteString -> Bool # (/=) :: ArbByteString -> ArbByteString -> Bool #
Ord ArbByteString Source #
Instance details Defined in Data.ByteString.Arbitrary Methods compare :: ArbByteString -> ArbByteString -> Ordering # (<) :: ArbByteString -> ArbByteString -> Bool # (<=) :: ArbByteString -> ArbByteString -> Bool # (>) :: ArbByteString -> ArbByteString -> Bool # (>=) :: ArbByteString -> ArbByteString -> Bool # max :: ArbByteString -> ArbByteString -> ArbByteString # min :: ArbByteString -> ArbByteString -> ArbByteString #
Read ArbByteString Source #
Instance details Defined in Data.ByteString.Arbitrary Methods readsPrec :: Int -> ReadS ArbByteString # readList :: ReadS [ArbByteString] # readPrec :: ReadPrec ArbByteString # readListPrec :: ReadPrec [ArbByteString] #
Show ArbByteString Source #
Instance details Defined in Data.ByteString.Arbitrary Methods showsPrec :: Int -> ArbByteString -> ShowS # show :: ArbByteString -> String # showList :: [ArbByteString] -> ShowS #
Arbitrary ArbByteString Source #
Instance details Defined in Data.ByteString.Arbitrary Methods arbitrary :: Gen ArbByteString # shrink :: ArbByteString -> [ArbByteString] #

newtype ArbByteString1M Source #

A wrapper to generate 1MB bytestrings. The shrink implementation still returns ArbByteString1M instances, of course, but they're smaller than 1MB.

Constructors

ABS1M
Fields fromABS1M :: ByteString

Instances

Eq ArbByteString1M Source #
Instance details Defined in Data.ByteString.Arbitrary Methods (==) :: ArbByteString1M -> ArbByteString1M -> Bool # (/=) :: ArbByteString1M -> ArbByteString1M -> Bool #
Ord ArbByteString1M Source #
Instance details Defined in Data.ByteString.Arbitrary Methods compare :: ArbByteString1M -> ArbByteString1M -> Ordering # (<) :: ArbByteString1M -> ArbByteString1M -> Bool # (<=) :: ArbByteString1M -> ArbByteString1M -> Bool # (>) :: ArbByteString1M -> ArbByteString1M -> Bool # (>=) :: ArbByteString1M -> ArbByteString1M -> Bool # max :: ArbByteString1M -> ArbByteString1M -> ArbByteString1M # min :: ArbByteString1M -> ArbByteString1M -> ArbByteString1M #
Read ArbByteString1M Source #
Instance details Defined in Data.ByteString.Arbitrary Methods readsPrec :: Int -> ReadS ArbByteString1M # readList :: ReadS [ArbByteString1M] # readPrec :: ReadPrec ArbByteString1M # readListPrec :: ReadPrec [ArbByteString1M] #
Show ArbByteString1M Source #
Instance details Defined in Data.ByteString.Arbitrary Methods showsPrec :: Int -> ArbByteString1M -> ShowS # show :: ArbByteString1M -> String # showList :: [ArbByteString1M] -> ShowS #
Arbitrary ArbByteString1M Source #
Instance details Defined in Data.ByteString.Arbitrary Methods arbitrary :: Gen ArbByteString1M # shrink :: ArbByteString1M -> [ArbByteString1M] #

newtype ArbByteString10M Source #

A wrapper to generate 10MB bytestrings. I should really figure out how type-level Nats work, so one can just do (ArbByteStringN 10000000) and have selectable sizes, but I don't see how to do that yet, so 10MB is as big as this library goes. As with the 1MB version, shrink here will generate ArbByteString10M instances that wrap ByteStrings smaller than 10MB.

Constructors

ABS10M
Fields fromABS10M :: ByteString

Instances

Eq ArbByteString10M Source #
Instance details Defined in Data.ByteString.Arbitrary Methods (==) :: ArbByteString10M -> ArbByteString10M -> Bool # (/=) :: ArbByteString10M -> ArbByteString10M -> Bool #
Ord ArbByteString10M Source #
Instance details Defined in Data.ByteString.Arbitrary Methods compare :: ArbByteString10M -> ArbByteString10M -> Ordering # (<) :: ArbByteString10M -> ArbByteString10M -> Bool # (<=) :: ArbByteString10M -> ArbByteString10M -> Bool # (>) :: ArbByteString10M -> ArbByteString10M -> Bool # (>=) :: ArbByteString10M -> ArbByteString10M -> Bool # max :: ArbByteString10M -> ArbByteString10M -> ArbByteString10M # min :: ArbByteString10M -> ArbByteString10M -> ArbByteString10M #
Read ArbByteString10M Source #
Instance details Defined in Data.ByteString.Arbitrary Methods readsPrec :: Int -> ReadS ArbByteString10M # readList :: ReadS [ArbByteString10M] # readPrec :: ReadPrec ArbByteString10M # readListPrec :: ReadPrec [ArbByteString10M] #
Show ArbByteString10M Source #
Instance details Defined in Data.ByteString.Arbitrary Methods showsPrec :: Int -> ArbByteString10M -> ShowS # show :: ArbByteString10M -> String # showList :: [ArbByteString10M] -> ShowS #
Arbitrary ArbByteString10M Source #
Instance details Defined in Data.ByteString.Arbitrary Methods arbitrary :: Gen ArbByteString10M # shrink :: ArbByteString10M -> [ArbByteString10M] #

fastRandBs :: Int -> Gen ByteString Source #

Generate a bunch of binary data quickly. This abuses the cryptohash skein function to generate a megabyte of data at a time, and then concats chunks until it has enough.

slowRandBs :: Int -> Gen ByteString Source #

Generate binary data slowly. This generates a list of Word8s, and then uses Data.ByteString.pack to concatenate it into a single ByteString.