Showing 11 of 11 total issues
Unused LANGUAGE pragma Open
Open
{-# LANGUAGE KindSignatures #-}
- Read upRead up
- Exclude checks
Found
{-# LANGUAGE KindSignatures #-}
Perhaps
Applying this change:
- Extension KindSignatures is implied by TypeFamilies
Redundant bracket Open
Open
arrowOffsets = [(0 ^& 2.1), ((-2.1) ^& 0)]
- Read upRead up
- Exclude checks
Found
[(0 ^& 2.1), ((-2.1) ^& 0)]
Perhaps
[0 ^& 2.1, ((-2.1) ^& 0)]
Redundant $ Open
Open
sides = map snd $ sortBy (compare `on` fst) $
[ (-dx, r)
, (dx, l)
, (-dy, u)
, (dy, d)
- Read upRead up
- Exclude checks
Found
sortBy (compare `on` fst) $ [(-dx, r), (dx, l), (-dy, u), (dy, d)]
Perhaps
sortBy (compare `on` fst) [(-dx, r), (dx, l), (-dy, u), (dy, d)]
Redundant bracket Open
Open
(\downSide' downRows' -> c & downSide .~ downSide' & downRows .~ downRows')
<$> (traverse f (c ^. downSide))
<*> (traverse (traverse f) (c ^. downRows))
- Read upRead up
- Exclude checks
Found
(\ downSide' downRows' ->
c & downSide .~ downSide' & downRows .~ downRows')
<$> (traverse f (c ^. downSide))
<*> (traverse (traverse f) (c ^. downRows))
Perhaps
(\ downSide' downRows' ->
c & downSide .~ downSide' & downRows .~ downRows')
<$> (traverse f (c ^. downSide))
<*> traverse (traverse f) (c ^. downRows)
Redundant bracket Open
Open
(\downSide' downRows' -> c & downSide .~ downSide' & downRows .~ downRows')
<$> (traverse f (c ^. downSide))
- Read upRead up
- Exclude checks
Found
(\ downSide' downRows' ->
c & downSide .~ downSide' & downRows .~ downRows')
<$> (traverse f (c ^. downSide))
Perhaps
(\ downSide' downRows' ->
c & downSide .~ downSide' & downRows .~ downRows')
<$> traverse f (c ^. downSide)
Redundant bracket Open
Open
(\upSide' upRows' -> c & upSide .~ upSide' & upRows .~ upRows')
<$> (traverse f (c ^. upSide))
- Read upRead up
- Exclude checks
Found
(\ upSide' upRows' -> c & upSide .~ upSide' & upRows .~ upRows')
<$> (traverse f (c ^. upSide))
Perhaps
(\ upSide' upRows' -> c & upSide .~ upSide' & upRows .~ upRows')
<$> traverse f (c ^. upSide)
Redundant guard Open
Open
go !i c | otherwise = go (i+1) (step c)
- Read upRead up
- Exclude checks
Found
go !i c | otherwise = go (i + 1) (step c)
Perhaps
go !i c = go (i + 1) (step c)
Redundant bracket Open
Open
arrowOffsets = [(0 ^& 2.1), ((-2.1) ^& 0)]
- Read upRead up
- Exclude checks
Found
[(0 ^& 2.1), ((-2.1) ^& 0)]
Perhaps
[(0 ^& 2.1), (-2.1) ^& 0]
Avoid lambda Open
Open
_3 f (Vec3 a b c) = (\c' -> Vec3 a b c') <$> f c
- Read upRead up
- Exclude checks
Found
\ c' -> Vec3 a b c'
Perhaps
Vec3 a b
Redundant bracket Open
Open
(\upSide' upRows' -> c & upSide .~ upSide' & upRows .~ upRows')
<$> (traverse f (c ^. upSide))
<*> (traverse (traverse f) (c ^. upRows))
- Read upRead up
- Exclude checks
Found
(\ upSide' upRows' -> c & upSide .~ upSide' & upRows .~ upRows')
<$> (traverse f (c ^. upSide))
<*> (traverse (traverse f) (c ^. upRows))
Perhaps
(\ upSide' upRows' -> c & upSide .~ upSide' & upRows .~ upRows')
<$> (traverse f (c ^. upSide))
<*> traverse (traverse f) (c ^. upRows)
Use foldr Open
Open
doMoves [] = iso id id
doMoves (m:ms) = move m . doMoves ms
- Read upRead up
- Exclude checks
Found
doMoves [] = iso id id
doMoves (m : ms) = move m . doMoves ms
Perhaps
doMoves ms = foldr ((.) . move) (iso id id) ms