test.gby

Size: px

Start display at page:

Download "test.gby"

たみえさくもと
5 years ago
Views:

1 Beautiful Programming Language and Beautiful Testing 1

2 Haskeller Haskeller 2

3 Haskeller (Doctest QuickCheck ) github 3

4 Haskeller 4

5 Haskell Platform Glasgow Haskell Compiler

6 Q) Haskeller A) 6

7 Q) A) Haskell 7

8 Haskell 8

9 Haskell (+) :: Num a => a -> a -> a sort :: Ord a => [a] -> [a] delete :: Eq a => a -> [a] -> [a] hgetline :: Handle -> IO String writefile :: FilePath -> String -> IO () forkio :: IO () -> IO ThreadId 9

10 Haskell 10

11 Haskell Haskell 11

12 daemonize :: IO () -> IO () daemonize program = ensuredetachterminalcanwork $ do detachterminal ensureneverattachterminal $ do changeworkingdirectory "/" void $ setfilecreationmask 0 mapm_ closefd [stdinput, stdoutput, stderror] program where ensuredetachterminalcanwork p = do void $ forkprocess p exitsuccess ensureneverattachterminal p = do void $ forkprocess p exitsuccess detachterminal = void createsession IO 12

13 Haskell 13

14 Haskell 14

15 Haskell 15

16 0 16

17 Haskell Haskeller 17

18 18

19 Doctest Python def factorial(n): """Return the factorial of n, an exact integer >= 0. If the result is small enough to fit in an int, return an int. Else return a long. >>> [factorial(n) for n in range(6)] [1, 1, 2, 6, 24, 120] >>> factorial(30) L """ import math if not n >= 0: raise ValueError("n must be >= 0")... 19

20 Haskell Haddock 20

21 Haddock -- unlines is an inverse operation to lines. -- It joins lines, after appending a terminating -- newline to each. unlines :: [String] -> String unlines [] = [] unlines (l:ls) = l ++ \n : unlines ls Haddock HTML 21

22 ">>>" >>> length [] 0 >>> writefile "tmpfile" "Hello" >>> readfile "tmpfile" "Hello" >>> 1 div 0 *** Exception: divide by zero 22

23 doctest 23

24 24

25 Hspec Ruby Rspec Haskell Hspec describe "sort" $ do it "sorts in the ascending order" $ sort [3,7,1,5,2] shouldbe [1,2,3,5,7] it "preserves a sorted list" $ sort [1,2,3,5,7] shouldbe [1,2,3,5,7] 25

26 Hspec xunit HUnit do exist <- doesfileexist "foo.txt" True do ret <- try $ evaluate (1 div 0) Left DivideByZero Hspec do exist <- doesfileexist "foo.txt" exist shouldbe True doesfileexist "foo.txt" shouldreturn True evaluate (1 div 0) shouldthrow anyarithexception 26

27 27

28 Haskell QuickCheck prop_doublesort :: [Int] -> Bool prop_doublesort xs = sort xs == sort (sort xs) > quickcheck prop_doublesort +++ OK, passed 100 tests. 28

30 30

31 Haskeller 31

32 QuickCheck QuickCheck prop_model x xs = linearsearch x xs == binarysearch x xs ) 32

33 QuickCheck Doctest "prop>" prop> Data.Map.null empty == True prop> \xs -> sort xs == sort (sort (xs::[int])) hspec property it "maintains a sorted list" $ property $ \xs -> sort xs == sort (sort (xs::[int])) 33

34 34

35 API 35

36 Monoid Monoid Hspec shouldsatisfymonoidlaws :: (Eq a, Show a, Monoid a, Arbitrary a) => a -> Spec shouldsatisfymonoidlaws t = do describe "memepty" $ do it "is a left identity" $ property $ \x -> mempty <> x == x astypeof t it "is a right identity" $ property $ \x -> x <> mempty == x astypeof t describe "<>" $ do it "is associative" $ property $ \x y z -> (x <> y) <> z == x <> (y <> z) astypeof t Int Monoid spec = do describe "Maybe as a Monoid" $ do shouldsatisfymonoidlaws (undefined :: [Int]) 36

37 Doctest + + Hspec + + Haskeller 37

bdd.gby

bdd.gby Haskell Behavior Driven Development 2012.5.27 @kazu_yamamoto 1 Haskell 4 Mew Firemacs Mighty ghc-mod 2 Ruby/Java HackageDB 3 Haskeller 4 Haskeller 5 Q) Haskeller A) 6 7 Haskeller Haskell 8 9 10 Haskell