thma/WhyHaskellMatters
1
1
Fork 0
mirror of https://github.com/thma/WhyHaskellMatters.git synced 2024-11-22 03:26:24 +03:00
Code Issues Projects Releases Wiki Activity

add some more code

Browse Source
This commit is contained in:
Thomas Mahler 2020-03-08 20:42:07 +01:00
parent a5b1bc0a6b
commit 376c9643d3
4 changed files with 66 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

47
WhyHaskellMatters.iml Normal file
View File

@ -0,0 +1,47 @@
<?xml version="1.0" encoding="UTF-8"?>
<module type="HASKELL_MODULE" version="4">
<component name="NewModuleRootManager" inherit-compiler-output="true">
<exclude-output />
<content url="file://$MODULE_DIR$">
<sourceFolder url="file://$MODULE_DIR$/src" isTestSource="false" />
<sourceFolder url="file://$MODULE_DIR$/test" isTestSource="true" />
<excludeFolder url="file://$MODULE_DIR$/.stack-work" />
</content>
<orderEntry type="inheritedJdk" />
<orderEntry type="sourceFolder" forTests="false" />
<orderEntry type="library" name="base-4.13.0.0" level="project" />
<orderEntry type="library" name="natural-numbers-0.1.2.0" level="project" />
<orderEntry type="library" name="QuickCheck-2.13.2" level="project" />
<orderEntry type="library" name="hspec-2.7.1" level="project" />
<orderEntry type="library" name="ghc-prim-0.5.3" level="project" />
<orderEntry type="library" name="integer-gmp-1.0.2.0" level="project" />
<orderEntry type="library" name="containers-0.6.2.1" level="project" />
<orderEntry type="library" name="deepseq-1.4.4.0" level="project" />
<orderEntry type="library" name="random-1.1" level="project" />
<orderEntry type="library" name="splitmix-0.0.4" level="project" />
<orderEntry type="library" name="template-haskell-2.15.0.0" level="project" />
<orderEntry type="library" name="transformers-0.5.6.2" level="project" />
<orderEntry type="library" name="hspec-core-2.7.1" level="project" />
<orderEntry type="library" name="hspec-discover-2.7.1" level="project" />
<orderEntry type="library" name="hspec-expectations-0.8.2" level="project" />
<orderEntry type="library" name="array-0.5.4.0" level="project" />
<orderEntry type="library" name="time-1.9.3" level="project" />
<orderEntry type="library" name="ghc-boot-th-8.8.2" level="project" />
<orderEntry type="library" name="pretty-1.1.3.6" level="project" />
<orderEntry type="library" name="HUnit-1.6.0.0" level="project" />
<orderEntry type="library" name="ansi-terminal-0.10.3" level="project" />
<orderEntry type="library" name="call-stack-0.2.0" level="project" />
<orderEntry type="library" name="clock-0.8" level="project" />
<orderEntry type="library" name="directory-1.3.4.0" level="project" />
<orderEntry type="library" name="filepath-1.4.2.1" level="project" />
<orderEntry type="library" name="quickcheck-io-0.2.0" level="project" />
<orderEntry type="library" name="setenv-0.1.1.3" level="project" />
<orderEntry type="library" name="stm-2.5.0.0" level="project" />
<orderEntry type="library" name="tf-random-0.5" level="project" />
<orderEntry type="library" name="Win32-2.6.1.0" level="project" />
<orderEntry type="library" name="colour-2.3.5" level="project" />
<orderEntry type="library" name="mintty-0.1.2" level="project" />
<orderEntry type="library" name="primitive-0.7.0.1" level="project" />
<orderEntry type="library" name="bytestring-0.10.10.0" level="project" />
</component>
</module>

8
src/AlgebraicDataTypes.hs
View File

@ -6,7 +6,7 @@ import Control.Monad ((>=>))
data Status = Green | Yellow | Red deriving (Eq, Show)
-- a simple product type
data Pair a b = Tuple a b deriving (Show)
data Pair a b = P a b deriving (Show)
data Tree a = Leaf a | Node (Tree a) (Tree a) deriving (Show)
@ -40,12 +40,12 @@ findDivRoot' x key map =
safeRoot d
findDivRoot'' x key map =
findValue key map >>=
(safeDiv x >=>
findValue key map >>=
(safeDiv x >=>
safeRoot)
findDivRoot''' x key map = do
y <- findValue key map
d <- safeDiv x y
safeRoot d

5
src/LazyEvaluation.hs
View File

@ -36,6 +36,11 @@ primes = sieve (2:[3,5..])
wenn :: Bool -> b -> b -> b
wenn p x y = if p then x else y
cond :: [(Bool, a)] -> [a]
cond [] = []
cond ((True, v):rest) = v : cond rest
cond ((False, _):rest) = cond rest

11
test/Tests/AllTestsSpec.hs
View File

@ -4,9 +4,18 @@ import Test.Hspec
import Test.QuickCheck
import Functions
import LazyEvaluation
import AlgebraicDataTypes
spec :: Spec
spec =
describe "Why Haskell matters" $ do
it "it has functions" $
property $ \x -> square x `shouldBe` x*x
property $ \x -> square x `shouldBe` x*x
it "can handle user defined controll structures" $
cond [(False, viciousCircle),
(True, 3),
(True, 5),
(False, viciousCircle)] `shouldBe` [3,5]
it "can build trees" $
show (Node (Leaf 1) (Node (Leaf 2) (Leaf 3))) `shouldBe` "Node (Leaf 1) (Node (Leaf 2) (Leaf 3))"