aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorAryadev Chavali <aryadev@aryadevchavali.com>2021-07-24 01:36:43 +0100
committerAryadev Chavali <aryadev@aryadevchavali.com>2021-07-24 01:36:43 +0100
commitb03822dc08da74a4815f5e5e040c85819e019775 (patch)
tree93acccc063a1b160abcc1e5a9b6f626998ff733b
parent0f41ec16f14b0dbc26f633a01c3cbbcd0dbda75e (diff)
downloadnumberdisplay-b03822dc08da74a4815f5e5e040c85819e019775.tar.gz
numberdisplay-b03822dc08da74a4815f5e5e040c85819e019775.tar.bz2
numberdisplay-b03822dc08da74a4815f5e5e040c85819e019775.zip
(Math.hs)~indenting and rearrange code for cleanlinessHEADmaster
-rw-r--r--Math.hs15
1 files changed, 8 insertions, 7 deletions
diff --git a/Math.hs b/Math.hs
index ddeac32..98c7d8c 100644
--- a/Math.hs
+++ b/Math.hs
@@ -1,9 +1,10 @@
module Math where
- isPrime :: Int -> Bool
- factors :: Int -> [Int]
- intersect' :: [Int] -> [Int] -> [Int]
- isPrime n = (length [ x | x <- [2..(ceiling $ sqrt $ fromIntegral 2)],
- n `mod` x == 0]) == 0
- factors n = [x | x <- [1..(n `div` 2)], n `mod` x == 0] ++ [n]
- intersect' a b = [x | x <- a, x `elem` b]
+isPrime :: Int -> Bool
+isPrime n = (length [ x | x <- [2..(ceiling $ sqrt $ fromIntegral 2)],
+ n `mod` x == 0]) == 0
+factors :: Int -> [Int]
+factors n = [x | x <- [1..(n `div` 2)], n `mod` x == 0] ++ [n]
+
+intersect' :: [Int] -> [Int] -> [Int]
+intersect' a b = [x | x <- a, x `elem` b]