summaryrefslogtreecommitdiff
path: root/Library/ProofGraph.hs
diff options
context:
space:
mode:
authorJed Barber <jjbarber@y7mail.com>2014-03-12 02:17:25 +1100
committerJed Barber <jjbarber@y7mail.com>2014-03-12 02:17:25 +1100
commitb5ff89d417c73d74a42a1756cb3ecd99b7a3e7f4 (patch)
tree97bf2d3ad4e5eac7aec320b932ccf09fdf127871 /Library/ProofGraph.hs
parentef81889c1eccb08acc27d47c9df652541134e3db (diff)
Removed some superfluous lambdas in intermediate functions
Diffstat (limited to 'Library/ProofGraph.hs')
-rw-r--r--Library/ProofGraph.hs10
1 files changed, 4 insertions, 6 deletions
diff --git a/Library/ProofGraph.hs b/Library/ProofGraph.hs
index 217e40c..0e7e80a 100644
--- a/Library/ProofGraph.hs
+++ b/Library/ProofGraph.hs
@@ -113,14 +113,12 @@ parse gs@(graph,stack,dictionary) str =
checkDupe :: PGraph -> PGraph
checkDupe graph =
- let f = (\g n ->
- let list = filter (\x -> (x /= n) && (nodeEquals g n x)) (Graph.nodes g)
- in if (list == []) then g else merge g n (head list))
+ let f g n = let list = filter (\x -> (x /= n) && (nodeEquals g n x)) (Graph.nodes g)
+ in if (list == []) then g else merge g n (head list)
- merge =
- (\g n r ->
+ merge g n r =
let edgesFixed = map (\(a,b,c) -> (a,r,c)) (Graph.inn g n)
- in (Graph.insEdges edgesFixed) . (Graph.delNode n) $ g)
+ in (Graph.insEdges edgesFixed) . (Graph.delNode n) $ g
in foldl' f graph (Graph.nodes graph)