annotate delta.hs @ 57:dfcd72dc697e

ReDefine Delta used non-empty-list for infinite changes
author Yasutaka Higa <e115763@ie.u-ryukyu.ac.jp>
date Sat, 22 Nov 2014 12:29:32 +0900
parents 1e6fecb54f1f
children 1229ee398567
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
rev   line source
17
279ebcf670c4 Define Similar as Applicative
Yasutaka Higa <e115763@ie.u-ryukyu.ac.jp>
parents: 16
diff changeset
1 import Control.Applicative
18
c77397d0677f Try define Similar as Monad
Yasutaka Higa <e115763@ie.u-ryukyu.ac.jp>
parents: 17
diff changeset
2 import Data.Numbers.Primes -- $ cabal install primes
c77397d0677f Try define Similar as Monad
Yasutaka Higa <e115763@ie.u-ryukyu.ac.jp>
parents: 17
diff changeset
3
57
dfcd72dc697e ReDefine Delta used non-empty-list for infinite changes
Yasutaka Higa <e115763@ie.u-ryukyu.ac.jp>
parents: 53
diff changeset
4 data Delta a = Mono a | Delta a (Delta a) deriving Show
17
279ebcf670c4 Define Similar as Applicative
Yasutaka Higa <e115763@ie.u-ryukyu.ac.jp>
parents: 16
diff changeset
5
52
69a01cc80075 Define Delta for Infinite changes in Haskell
Yasutaka Higa <e115763@ie.u-ryukyu.ac.jp>
parents: 51
diff changeset
6 deltaAppend :: Delta a -> Delta a -> Delta a
57
dfcd72dc697e ReDefine Delta used non-empty-list for infinite changes
Yasutaka Higa <e115763@ie.u-ryukyu.ac.jp>
parents: 53
diff changeset
7 deltaAppend (Mono x) d = Delta x d
dfcd72dc697e ReDefine Delta used non-empty-list for infinite changes
Yasutaka Higa <e115763@ie.u-ryukyu.ac.jp>
parents: 53
diff changeset
8 deltaAppend (Delta x d) ds = Delta x (deltaAppend d ds)
47
1aefea69f71b Implement bubble sort by delta
Yasutaka Higa <e115763@ie.u-ryukyu.ac.jp>
parents: 46
diff changeset
9
53
1e6fecb54f1f Adjust function name
Yasutaka Higa <e115763@ie.u-ryukyu.ac.jp>
parents: 52
diff changeset
10 headDelta :: Delta a -> Delta a
57
dfcd72dc697e ReDefine Delta used non-empty-list for infinite changes
Yasutaka Higa <e115763@ie.u-ryukyu.ac.jp>
parents: 53
diff changeset
11 headDelta d@(Mono _) = d
dfcd72dc697e ReDefine Delta used non-empty-list for infinite changes
Yasutaka Higa <e115763@ie.u-ryukyu.ac.jp>
parents: 53
diff changeset
12 headDelta (Delta x _) = Mono x
14
116131b196bb Define fmap and mu
Yasutaka Higa <e115763@ie.u-ryukyu.ac.jp>
parents: 13
diff changeset
13
52
69a01cc80075 Define Delta for Infinite changes in Haskell
Yasutaka Higa <e115763@ie.u-ryukyu.ac.jp>
parents: 51
diff changeset
14 tailDelta :: Delta a -> Delta a
57
dfcd72dc697e ReDefine Delta used non-empty-list for infinite changes
Yasutaka Higa <e115763@ie.u-ryukyu.ac.jp>
parents: 53
diff changeset
15 tailDelta d@(Mono _) = d
dfcd72dc697e ReDefine Delta used non-empty-list for infinite changes
Yasutaka Higa <e115763@ie.u-ryukyu.ac.jp>
parents: 53
diff changeset
16 tailDelta (Delta _ ds) = ds
18
c77397d0677f Try define Similar as Monad
Yasutaka Higa <e115763@ie.u-ryukyu.ac.jp>
parents: 17
diff changeset
17
43
90b171e3a73e Rename to Delta from Similar
Yasutaka Higa <e115763@ie.u-ryukyu.ac.jp>
parents: 23
diff changeset
18 instance Functor Delta where
57
dfcd72dc697e ReDefine Delta used non-empty-list for infinite changes
Yasutaka Higa <e115763@ie.u-ryukyu.ac.jp>
parents: 53
diff changeset
19 fmap f (Mono x) = Mono (f x)
dfcd72dc697e ReDefine Delta used non-empty-list for infinite changes
Yasutaka Higa <e115763@ie.u-ryukyu.ac.jp>
parents: 53
diff changeset
20 fmap f (Delta x d) = Delta (f x) (fmap f d)
18
c77397d0677f Try define Similar as Monad
Yasutaka Higa <e115763@ie.u-ryukyu.ac.jp>
parents: 17
diff changeset
21
43
90b171e3a73e Rename to Delta from Similar
Yasutaka Higa <e115763@ie.u-ryukyu.ac.jp>
parents: 23
diff changeset
22 instance Applicative Delta where
57
dfcd72dc697e ReDefine Delta used non-empty-list for infinite changes
Yasutaka Higa <e115763@ie.u-ryukyu.ac.jp>
parents: 53
diff changeset
23 pure f = Mono f
dfcd72dc697e ReDefine Delta used non-empty-list for infinite changes
Yasutaka Higa <e115763@ie.u-ryukyu.ac.jp>
parents: 53
diff changeset
24 (Mono f) <*> (Mono x) = Mono (f x)
dfcd72dc697e ReDefine Delta used non-empty-list for infinite changes
Yasutaka Higa <e115763@ie.u-ryukyu.ac.jp>
parents: 53
diff changeset
25 df@(Mono f) <*> (Delta x d) = Delta (f x) (df <*> d)
dfcd72dc697e ReDefine Delta used non-empty-list for infinite changes
Yasutaka Higa <e115763@ie.u-ryukyu.ac.jp>
parents: 53
diff changeset
26 (Delta f df) <*> d@(Mono x) = Delta (f x) (df <*> d)
dfcd72dc697e ReDefine Delta used non-empty-list for infinite changes
Yasutaka Higa <e115763@ie.u-ryukyu.ac.jp>
parents: 53
diff changeset
27 (Delta f df) <*> (Delta x d) = Delta (f x) (df <*> d)
52
69a01cc80075 Define Delta for Infinite changes in Haskell
Yasutaka Higa <e115763@ie.u-ryukyu.ac.jp>
parents: 51
diff changeset
28
20
d4aa70d94352 Define Similar as Applicative
Yasutaka Higa <e115763@ie.u-ryukyu.ac.jp>
parents: 19
diff changeset
29
43
90b171e3a73e Rename to Delta from Similar
Yasutaka Higa <e115763@ie.u-ryukyu.ac.jp>
parents: 23
diff changeset
30 instance Monad Delta where
57
dfcd72dc697e ReDefine Delta used non-empty-list for infinite changes
Yasutaka Higa <e115763@ie.u-ryukyu.ac.jp>
parents: 53
diff changeset
31 return x = Mono x
dfcd72dc697e ReDefine Delta used non-empty-list for infinite changes
Yasutaka Higa <e115763@ie.u-ryukyu.ac.jp>
parents: 53
diff changeset
32 (Mono x) >>= f = f x
dfcd72dc697e ReDefine Delta used non-empty-list for infinite changes
Yasutaka Higa <e115763@ie.u-ryukyu.ac.jp>
parents: 53
diff changeset
33 (Delta x d) >>= f = (headDelta (f x)) `deltaAppend` (d >>= (tailDelta . f))
18
c77397d0677f Try define Similar as Monad
Yasutaka Higa <e115763@ie.u-ryukyu.ac.jp>
parents: 17
diff changeset
34
43
90b171e3a73e Rename to Delta from Similar
Yasutaka Higa <e115763@ie.u-ryukyu.ac.jp>
parents: 23
diff changeset
35 returnS :: (Show s) => s -> Delta s
57
dfcd72dc697e ReDefine Delta used non-empty-list for infinite changes
Yasutaka Higa <e115763@ie.u-ryukyu.ac.jp>
parents: 53
diff changeset
36 returnS x = Mono x
0
7a82a5e50499 Initial commit. define to Functor for Similer
Yasutaka Higa <e115763@ie.u-ryukyu.ac.jp>
parents:
diff changeset
37
43
90b171e3a73e Rename to Delta from Similar
Yasutaka Higa <e115763@ie.u-ryukyu.ac.jp>
parents: 23
diff changeset
38 returnSS :: (Show s) => s -> s -> Delta s
52
69a01cc80075 Define Delta for Infinite changes in Haskell
Yasutaka Higa <e115763@ie.u-ryukyu.ac.jp>
parents: 51
diff changeset
39 returnSS x y = (returnS x) `deltaAppend` (returnS y)
69a01cc80075 Define Delta for Infinite changes in Haskell
Yasutaka Higa <e115763@ie.u-ryukyu.ac.jp>
parents: 51
diff changeset
40
23
b4d3960af901 Define similar constructor for different element
Yasutaka Higa <e115763@ie.u-ryukyu.ac.jp>
parents: 22
diff changeset
41
16
4b315cf0edb9 Improve mu definition
Yasutaka Higa <e115763@ie.u-ryukyu.ac.jp>
parents: 15
diff changeset
42 -- samples
3
3c5fbce357af Define >>= for Similer
Yasutaka Higa <e115763@ie.u-ryukyu.ac.jp>
parents: 2
diff changeset
43
43
90b171e3a73e Rename to Delta from Similar
Yasutaka Higa <e115763@ie.u-ryukyu.ac.jp>
parents: 23
diff changeset
44 generator :: Int -> Delta [Int]
21
af8754322ed4 Define Similar sample
Yasutaka Higa <e115763@ie.u-ryukyu.ac.jp>
parents: 20
diff changeset
45 generator x = let intList = [1..x] in
22
f0400c4c953f Imporve Similar definition. delete "Single" constructor
Yasutaka Higa <e115763@ie.u-ryukyu.ac.jp>
parents: 21
diff changeset
46 returnS intList
6
5e367a167382 Define samples
Yasutaka Higa <e115763@ie.u-ryukyu.ac.jp>
parents: 5
diff changeset
47
43
90b171e3a73e Rename to Delta from Similar
Yasutaka Higa <e115763@ie.u-ryukyu.ac.jp>
parents: 23
diff changeset
48 primeFilter :: [Int] -> Delta [Int]
21
af8754322ed4 Define Similar sample
Yasutaka Higa <e115763@ie.u-ryukyu.ac.jp>
parents: 20
diff changeset
49 primeFilter xs = let primeList = filter isPrime xs
23
b4d3960af901 Define similar constructor for different element
Yasutaka Higa <e115763@ie.u-ryukyu.ac.jp>
parents: 22
diff changeset
50 refactorList = filter even xs in
b4d3960af901 Define similar constructor for different element
Yasutaka Higa <e115763@ie.u-ryukyu.ac.jp>
parents: 22
diff changeset
51 returnSS primeList refactorList
11
e8a5df54480e Define sample for Monad style
Yasutaka Higa <e115763@ie.u-ryukyu.ac.jp>
parents: 10
diff changeset
52
43
90b171e3a73e Rename to Delta from Similar
Yasutaka Higa <e115763@ie.u-ryukyu.ac.jp>
parents: 23
diff changeset
53 count :: [Int] -> Delta Int
21
af8754322ed4 Define Similar sample
Yasutaka Higa <e115763@ie.u-ryukyu.ac.jp>
parents: 20
diff changeset
54 count xs = let primeCount = length xs in
22
f0400c4c953f Imporve Similar definition. delete "Single" constructor
Yasutaka Higa <e115763@ie.u-ryukyu.ac.jp>
parents: 21
diff changeset
55 returnS primeCount
15
c599d2236d19 Similar as Monad
Yasutaka Higa <e115763@ie.u-ryukyu.ac.jp>
parents: 14
diff changeset
56
43
90b171e3a73e Rename to Delta from Similar
Yasutaka Higa <e115763@ie.u-ryukyu.ac.jp>
parents: 23
diff changeset
57 primeCount :: Int -> Delta Int
21
af8754322ed4 Define Similar sample
Yasutaka Higa <e115763@ie.u-ryukyu.ac.jp>
parents: 20
diff changeset
58 primeCount x = generator x >>= primeFilter >>= count
46
cb5c190aa45d Define bubble sort
Yasutaka Higa <e115763@ie.u-ryukyu.ac.jp>
parents: 45
diff changeset
59
cb5c190aa45d Define bubble sort
Yasutaka Higa <e115763@ie.u-ryukyu.ac.jp>
parents: 45
diff changeset
60 bubbleSort :: [Int] -> Delta [Int]
48
820af7cc8485 Wrote >>= style bubble sort
Yasutaka Higa <e115763@ie.u-ryukyu.ac.jp>
parents: 47
diff changeset
61 bubbleSort [] = returnS []
49
d654fdecdcd0 Wrote bubble sort with modified calculate
Yasutaka Higa <e115763@ie.u-ryukyu.ac.jp>
parents: 48
diff changeset
62 bubbleSort xs = bubbleSort remainValue >>= (\xs -> returnSS (sortedValueL : xs)
d654fdecdcd0 Wrote bubble sort with modified calculate
Yasutaka Higa <e115763@ie.u-ryukyu.ac.jp>
parents: 48
diff changeset
63 (sortedValueR ++ xs))
46
cb5c190aa45d Define bubble sort
Yasutaka Higa <e115763@ie.u-ryukyu.ac.jp>
parents: 45
diff changeset
64 where
51
8d9c55bac8b2 Fix typo
Yasutaka Higa <e115763@ie.u-ryukyu.ac.jp>
parents: 49
diff changeset
65 maximumValue = maximum xs
8d9c55bac8b2 Fix typo
Yasutaka Higa <e115763@ie.u-ryukyu.ac.jp>
parents: 49
diff changeset
66 sortedValueL = maximumValue
8d9c55bac8b2 Fix typo
Yasutaka Higa <e115763@ie.u-ryukyu.ac.jp>
parents: 49
diff changeset
67 sortedValueR = replicate (length $ filter (== maximumValue) xs) maximumValue
8d9c55bac8b2 Fix typo
Yasutaka Higa <e115763@ie.u-ryukyu.ac.jp>
parents: 49
diff changeset
68 remainValue = filter (/= maximumValue) xs