Advertisement
Guest User

Untitled

a guest
Jun 24th, 2019
72
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
  1. main :: IO ()
  2. main = do
  3.   -- right length
  4.   quickCheck $ forAll genPos $ \n -> (toInteger . length . grayCode) n == 2 ^ n
  5.   -- right elements, and sorted
  6.   quickCheck $
  7.     forAll genPos $ \n -> map fromBaseTwo (grayRead n) == [0 .. 2 ^ n - 1]
  8.   -- test in base 10
  9.   quickCheck $ forAll genPos $ \n -> n == (n `fromBase` 10) `inBase` 10
  10.   -- test in all bases
  11.   quickCheck $
  12.     forAll genPos $ \d ->
  13.       forAll (genBaseD d) $ \n -> n == (n `fromBase` d) `inBase` d
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement