Some linting

src/Geometry/Intersect.hs

@@ -1,4 +1,4 @@
-{-# LANGUAGE TupleSections #-}
+--{-# LANGUAGE TupleSections #-}
 {-
 Testing for and finding intersection points.
 -}
@@ -100,12 +100,12 @@ myIntersectSegSeg a@(V2 ax ay) b@(V2 bx by) c@(V2 cx cy) d@(V2 dx dy) = case rat
 -- | Polymorphic intersection of fractional line points.
 myIntersectLineLine :: (Eq a,Fractional a) => V2 a -> V2 a -> V2 a -> V2 a -> Maybe (V2 a)
 myIntersectLineLine a@(V2 ax _) b c@(V2 cx _) d
-    | isNothing (linGrad a b) = (V2 ax) <$> axisInt (c *-* (V2 ax 0)) (d *-* (V2 ax 0))
-    | isNothing (linGrad c d) = (V2 cx) <$> axisInt (a *-* (V2 cx 0)) (b *-* (V2 cx 0))
+    | isNothing (linGrad a b) = V2 ax <$> axisInt (c *-* V2 ax 0) (d *-* V2 ax 0)
+    | isNothing (linGrad c d) = V2 cx <$> axisInt (a *-* V2 cx 0) (b *-* V2 cx 0)
     | otherwise              
         = case linGrad a b ^-^ linGrad c d of
             Just 0 -> Nothing
-            _      -> liftA2 (V2) newx ((linGrad a b ^*^ newx) ^+^ axisInt a b)
+            _      -> liftA2 V2 newx ((linGrad a b ^*^ newx) ^+^ axisInt a b)
   where 
     (^-^) = liftA2 (-)
     (^+^) = liftA2 (+)
@@ -142,7 +142,7 @@ linGrad (V2 x y) (V2 a b)
     | otherwise = Just $ (y-b)/(x-a)
 -- | Given two points, finds the intersection with the y axis if it exists.
 axisInt :: (Eq a,Fractional a) => V2 a -> V2 a -> Maybe a
-axisInt p (V2 a b) =  fmap (\lg -> b - (a*lg)) $ linGrad p (V2 a b)
+axisInt p (V2 a b) =  (\lg -> b - (a*lg)) <$> linGrad p (V2 a b)
 -- | Placeholder, undefined.
 intersectSegsSeg :: [Point2] -> Point2 -> Point2 -> Maybe Point2
 intersectSegsSeg = undefined