1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
|
{-# LANGUAGE BangPatterns, CPP, OverloadedStrings #-}
module QC.ByteString (tests) where
#if !MIN_VERSION_base(4,8,0)
import Control.Applicative ((<*>), (<$>))
#endif
import Data.Char (chr, ord, toUpper)
import Data.Int (Int64)
import Data.Word (Word8)
import Prelude hiding (take, takeWhile)
import QC.Common (ASCII(..), liftOp, parseBS, toStrictBS)
import Test.Tasty (TestTree)
import Test.Tasty.QuickCheck (testProperty)
import Test.QuickCheck
import qualified Data.Attoparsec.ByteString as P
import qualified Data.Attoparsec.ByteString.Char8 as P8
import qualified Data.Attoparsec.ByteString.FastSet as S
import qualified Data.Attoparsec.ByteString.Lazy as PL
import qualified Data.ByteString as B
import qualified Data.ByteString.Char8 as B8
import qualified Data.ByteString.Lazy as L
import qualified Data.ByteString.Lazy.Char8 as L8
-- Basic byte-level combinators.
satisfy :: Word8 -> L.ByteString -> Property
satisfy w s = parseBS (P.satisfy (<=w)) (L.cons w s) === Just w
satisfyWith :: Word8 -> L.ByteString -> Property
satisfyWith w s = parseBS (P.satisfyWith (chr . fromIntegral) (<=c))
(L.cons (fromIntegral (ord c)) s) === Just c
where
c = chr (fromIntegral w)
word8 :: Word8 -> L.ByteString -> Property
word8 w s = parseBS (P.word8 w) (L.cons w s) === Just w
skip :: Word8 -> L.ByteString -> Property
skip w s =
case (parseBS (P.skip (<w)) s, L.uncons s) of
(Nothing, mcs) -> maybe (property True) (expectFailure . it) mcs
(Just _, mcs) -> maybe (property False) it mcs
where it cs = liftOp "<" (<) (fst cs) w
anyWord8 :: L.ByteString -> Property
anyWord8 s
| L.null s = p === Nothing
| otherwise = p === Just (L.head s)
where p = parseBS P.anyWord8 s
notWord8 :: Word8 -> NonEmptyList Word8 -> Property
notWord8 w (NonEmpty s) = parseBS (P.notWord8 w) bs === if v == w
then Nothing
else Just v
where v = L.head bs
bs = L.pack s
peekWord8 :: L.ByteString -> Property
peekWord8 s
| L.null s = p === Just (Nothing, s)
| otherwise = p === Just (Just (L.head s), s)
where p = parseBS ((,) <$> P.peekWord8 <*> P.takeLazyByteString) s
peekWord8' :: L.ByteString -> Property
peekWord8' s = parseBS P.peekWord8' s === (fst <$> L.uncons s)
string :: L.ByteString -> L.ByteString -> Property
string s t = parseBS (P.string s') (s `L.append` t) === Just s'
where s' = toStrictBS s
stringCI :: ASCII L.ByteString -> ASCII L.ByteString -> Property
stringCI (ASCII s) (ASCII t) =
parseBS (P8.stringCI up) (s `L.append` t) === Just s'
where s' = toStrictBS s
up = B8.map toUpper s'
strings :: L.ByteString -> L.ByteString -> L.ByteString -> Property
strings s t u =
parseBS (P.string (toStrictBS s) >> P.string t') (L.concat [s,t,u])
=== Just t'
where t' = toStrictBS t
skipWhile :: Word8 -> L.ByteString -> Property
skipWhile w s =
let t = L.dropWhile (<=w) s
in case PL.parse (P.skipWhile (<=w)) s of
PL.Done t' () -> t === t'
_ -> property False
takeCount :: Positive Int -> L.ByteString -> Property
takeCount (Positive k) s =
case parseBS (P.take k) s of
Nothing -> liftOp ">" (>) (fromIntegral k) (L.length s)
Just _s -> liftOp "<=" (<=) (fromIntegral k) (L.length s)
takeWhile :: Word8 -> L.ByteString -> Property
takeWhile w s =
let (h,t) = L.span (==w) s
in case PL.parse (P.takeWhile (==w)) s of
PL.Done t' h' -> t === t' .&&. toStrictBS h === h'
_ -> property False
take :: Int -> L.ByteString -> Property
take n s = maybe (property $ L.length s < fromIntegral n)
(=== B.take n (toStrictBS s)) $
parseBS (P.take n) s
takeByteString :: L.ByteString -> Property
takeByteString s = maybe (property False) (=== toStrictBS s) .
parseBS P.takeByteString $ s
takeLazyByteString :: L.ByteString -> Property
takeLazyByteString s = maybe (property False) (=== s) .
parseBS P.takeLazyByteString $ s
takeWhile1 :: Word8 -> L.ByteString -> Property
takeWhile1 w s =
let s' = L.cons w s
(h,t) = L.span (<=w) s'
in case PL.parse (P.takeWhile1 (<=w)) s' of
PL.Done t' h' -> t === t' .&&. toStrictBS h === h'
_ -> property False
takeWhileIncluding :: Word8 -> L.ByteString -> Property
takeWhileIncluding w s =
let s' = L.cons w $ L.snoc s (w+1)
(h_,t_) = L.span (<=w) s'
(h,t) =
case L.uncons t_ of
Nothing -> (h_, t_)
Just (n, nt) -> (h_ `L.snoc` n, nt)
in w < 255 ==> case PL.parse (P.takeWhileIncluding (<=w)) s' of
PL.Done t' h' -> t === t' .&&. toStrictBS h === h'
_ -> property False
takeTill :: Word8 -> L.ByteString -> Property
takeTill w s =
let (h,t) = L.break (==w) s
in case PL.parse (P.takeTill (==w)) s of
PL.Done t' h' -> t === t' .&&. toStrictBS h === h'
_ -> property False
takeWhile1_empty :: Property
takeWhile1_empty = parseBS (P.takeWhile1 undefined) L.empty === Nothing
getChunk :: L.ByteString -> Property
getChunk s =
maybe (property False) (=== L.toChunks s) $
parseBS getChunks s
where getChunks = go []
go res = do
mchunk <- P.getChunk
case mchunk of
Nothing -> return (reverse res)
Just chunk -> do
_ <- P.take (B.length chunk)
go (chunk:res)
endOfInput :: L.ByteString -> Property
endOfInput s = parseBS P.endOfInput s === if L.null s
then Just ()
else Nothing
endOfLine :: L.ByteString -> Property
endOfLine s =
case (parseBS P8.endOfLine s, L8.uncons s) of
(Nothing, mcs) -> maybe (property True) (expectFailure . eol) mcs
(Just _, mcs) -> maybe (property False) eol mcs
where eol (c,s') = c === '\n' .||.
(c, fst <$> L8.uncons s') === ('\r', Just '\n')
scan :: L.ByteString -> Positive Int64 -> Property
scan s (Positive k) = parseBS p s === Just (toStrictBS $ L.take k s)
where p = P.scan k $ \ n _ ->
if n > 0 then let !n' = n - 1 in Just n' else Nothing
members :: [Word8] -> Property
members s = property $ all (`S.memberWord8` set) s
where set = S.fromList s
nonmembers :: [Word8] -> [Word8] -> Property
nonmembers s s' = property . not . any (`S.memberWord8` set) $ filter (not . (`elem` s)) s'
where set = S.fromList s
tests :: [TestTree]
tests = [
testProperty "anyWord8" anyWord8
, testProperty "endOfInput" endOfInput
, testProperty "endOfLine" endOfLine
, testProperty "notWord8" notWord8
, testProperty "peekWord8" peekWord8
, testProperty "peekWord8'" peekWord8'
, testProperty "satisfy" satisfy
, testProperty "satisfyWith" satisfyWith
, testProperty "scan" scan
, testProperty "skip" skip
, testProperty "skipWhile" skipWhile
, testProperty "string" string
, testProperty "stringCI" stringCI
, testProperty "strings" strings
, testProperty "take" take
, testProperty "takeByteString" takeByteString
, testProperty "takeCount" takeCount
, testProperty "takeLazyByteString" takeLazyByteString
, testProperty "takeTill" takeTill
, testProperty "takeWhile" takeWhile
, testProperty "takeWhile1" takeWhile1
, testProperty "takeWhile1_empty" takeWhile1_empty
, testProperty "takeWhileIncluding" takeWhileIncluding
, testProperty "getChunk" getChunk
, testProperty "word8" word8
, testProperty "members" members
, testProperty "nonmembers" nonmembers
]
|
