-
Notifications
You must be signed in to change notification settings - Fork 0
/
pmat.hs
230 lines (180 loc) · 7.66 KB
/
pmat.hs
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
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
import System.Environment
import System.IO
import Control.Applicative hiding ((<|>), many)
import Text.ParserCombinators.Parsec
import Control.Monad
import Numeric.LinearAlgebra
{--
pmat: pipe oriented matrix calculator
written by Ryuichi Ueda
The MIT License
Copyright (C) 2013 Ryuichi Ueda
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
THE SOFTWARE.
--}
showUsage :: IO ()
showUsage = do hPutStr stderr
("Usage : pmat <opt> <file>\n" ++
"Sat Jul 20 17:08:55 JST 2013\n")
version :: IO ()
version = do hPutStr stderr ("version 0.021")
main :: IO ()
main = do args <- getArgs
case args of
[] -> showUsage
["-h"] -> showUsage
["--help"] -> showUsage
["--ver"] -> version
["--v"] -> version
[opt,f] -> readData f >>= mainProc opt
[opt] -> readData "-" >>= mainProc opt
readData :: String -> IO String
readData "-" = getContents
readData f = readFile f
---------------
-- data type --
---------------
data NMat = NMat (String,Matrix Double) deriving Show
data Option = Eq String Calc
| Error String
data Calc = Terms Term [Op2]
| AnsM NMat
data Term = TermS String [Op]
| TermN Double [Op]
| TermE NMat [Op]
| TermP Op0 [Op]
data Op0 = Pow String Int
| PowE NMat Int
data Op = MulM String
| MulN Double
| MulP Op0
data Op2 = OpMinus Term
| OpPlus Term
--------------------------
-- execution and output --
--------------------------
mainProc :: String -> String -> IO ()
mainProc opt cs = putStr cs >> mainProc' (setOpt opt) (setMatrices cs)
mainProc' :: Option -> [NMat] -> IO ()
mainProc' (Eq "" (AnsM n)) _ = putStr . toStr $ n
mainProc' (Eq name (AnsM (NMat (_,m)))) _ = putStr . toStr $ NMat (name,m)
mainProc' (Eq name calc) ms = mainProc' (Eq name $ execCalc calc ms ) ms
execCalc :: Calc -> [NMat] -> Calc
execCalc (Terms (TermE m []) []) ms = AnsM m
execCalc (Terms t []) ms = Terms (evalTerm t ms) []
execCalc (Terms t (op:ops)) ms = execCalc (Terms x ops) ms
where x = matAdd y op ms
y = evalTerm t ms
matAdd :: Term -> Op2 -> [NMat] -> Term
matAdd x (OpMinus (TermE n [])) _ = TermE ((getM x) .- n) []
matAdd x (OpPlus (TermE n [])) _ = TermE ((getM x) .+ n) []
matAdd x (OpMinus y) ms = matAdd x (OpMinus $ evalTerm y ms) ms
matAdd x (OpPlus y) ms = matAdd x (OpPlus $ evalTerm y ms) ms
getM (TermE m []) = m
evalTerm :: Term -> [NMat] -> Term
evalTerm (TermE e []) _ = TermE e []
evalTerm (TermN n []) _ = TermN n []
evalTerm (TermP m ops) ms = evalTerm (TermE (pow m ms) ops) ms
evalTerm (TermE e (op:ops)) ms = evalTerm (TermE (matMul e op ms) ops) ms
evalTerm (TermN d (op:ops)) ms = evalTerm (f d op ops ms) ms
where f d (MulM s) ops ms = TermE (d *. (getMat s ms)) ops
f d (MulN f) ops _ = TermN (d*f) ops
evalTerm (TermS s ops) ms = evalTerm (TermE (getMat s ms) ops) ms
matMul :: NMat -> Op -> [NMat] -> NMat
matMul m (MulM s) ms = m .* (getMat s ms)
matMul m (MulN d) _ = d *. m
matMul m (MulP p) ms = m .* (pow p ms)
pow :: Op0 -> [NMat] -> NMat
pow (PowE (NMat (name,m)) (-1)) _ = NMat (name ++ "^-1", inv m)
pow (PowE e 1) _ = e
pow (PowE (NMat (name,m)) n) ms = NMat (name ++ "^" ++ (show n),f m n)
where f m 1 = m
f m n = m <> (f m (n-1))
pow (Pow s n) ms = pow (PowE (getMat s ms) n) ms
---------------------
-- matrix handling --
---------------------
-- get a matrix named "name"
getMat :: String -> [NMat] -> NMat
getMat nm ms = head $ filter ( f nm ) ms
where f nm (NMat (n,_)) = (nm == n)
(.*) (NMat x) (NMat y) = NMat ((fst x) ++ "*" ++ (fst y), (snd x) <> (snd y))
(.+) (NMat x) (NMat y) = NMat ((fst x) ++ "+" ++ (fst y), (snd x) + (snd y))
(.-) (NMat x) (NMat y) = NMat ((fst x) ++ "-" ++ (fst y), (snd x) - (snd y))
-- I can't use `*` for double-Matrix operation though I can it on ghci
(*.) d (NMat y) = NMat ((show d) ++ "*" ++ (fst y), d `ml` (snd y))
where ml d m = ((r><r) arr) <> m
where r = rows m
arr = [ f x d | x <- [0..(r*r-1)]]
f n d = if (n `mod` r) == ( n `div` r) then d else 0.0
toStr :: NMat -> String
toStr (NMat (name,mat)) = unlines [ name ++ " " ++ t | t <- tos ]
where lns = toLists mat
tos = [ unwords [ show d | d <- ln ] | ln <- lns ]
---------------------
-- handle of stdin --
---------------------
setMatrices :: String -> [NMat]
setMatrices cs = [ setMatrix m | m <- (getCluster $ lines cs) ]
setMatrix :: [String] -> NMat
setMatrix lns = NMat (name,val)
where name = head (words $ head lns)
val = (row><col) (concatMap toNums lns)
toNums str = [ read n | n <- ( drop 1 $ words str) ]
row = length lns
col = (length $ words $ head lns) - 1
getCluster :: [String] -> [[String]]
getCluster [] = []
getCluster lns = [fst d] ++ getCluster (snd d)
where d = span (compKey key ) lns
key = head $ words $ head lns
compKey a b = a == (head $ words b)
---------------------
-- the parser part --
---------------------
setOpt :: String -> Option
setOpt str = case parse parseOption "" str of
Right opt -> opt
Left err -> Error ( show err )
parseOption = try(equation) <|> try(onlyrhs) <?> "no terms"
equation = do a <- many1 letter
char '='
Eq a <$> calc
onlyrhs = Eq "" <$> calc
calc = Terms <$> term <*> (many (try(opPlus) <|> try(opMinus)) )
opPlus = char '+' >> OpPlus <$> term
opMinus = char '-' >> OpMinus <$> term
term = try(longtermp) <|> try(longterm) <|> longtermn
longterm = TermS <$> (many1 letter) <*> many op
longtermn = TermN <$> (try(parseDouble) <|> parseInt) <*> many op
longtermp = TermP <$> (try(termPP) <|> termPI) <*> many op
op = try(opPow) <|> try(opMat) <|> try(opNum)
termPI = do a <- many1 letter
string "^-1"
return $ Pow a (-1)
termPP = do a <- many1 letter
char '^'
b <- many1 digit
return $ Pow a (read b::Int)
opPow = char '*' >> (try(termPI) <|> termPP) >>= return . MulP
opMat = char '*' >> many1 letter >>= return . MulM
opNum = char '*' >> (try(parseDouble) <|> parseInt) >>= return . MulN
parseDouble = do x <- many1 digit
char '.'
y <- many1 digit
return $ read (x++"."++y)
parseInt = do x <- many1 digit
return $ (read x::Double)