src/library/Analysis/Interlevel/InterLevelCP.hs
Avoid restricted qualification Open
Open
import qualified Data.Graphs as G
- Read upRead up
- Create a ticketCreate a ticket
- Exclude checks
Found
import qualified Data.Graphs as G
Perhaps
import qualified Data.Graphs as Graph
Applying this change:
- may break the code
Use tuple-section Open
Open
edgesToAdd = concatMap (\n -> map (\e -> (n,e)) dangT) orphanNodes
- Read upRead up
- Create a ticketCreate a ticket
- Exclude checks
Found
\ e -> (n, e)
Perhaps
(n,)
Applying this change:
- may require
{-# LANGUAGE TupleSections #-}
adding to the top of the file
Use . Open
Open
removeDuplicated = nubBy (\x y -> not $ Prelude.null $ find x y)
- Read upRead up
- Create a ticketCreate a ticket
- Exclude checks
Found
not $ Prelude.null $ find x y
Perhaps
not . Prelude.null $ find x y
Use tuple-section Open
Open
edgesToAdd = concatMap (\n -> map (\e -> (n,e)) dangT) orphanNodes
- Read upRead up
- Create a ticketCreate a ticket
- Exclude checks
Found
\ e -> (n, e)
Perhaps
(n,)
Applying this change:
- may require
{-# LANGUAGE TupleSections #-}
adding to the top of the file
Use tuple-section Open
Open
newNames = map (\number -> (fstName, sndName, number)) ([0..] :: [Int])
- Read upRead up
- Create a ticketCreate a ticket
- Exclude checks
Found
\ number -> (fstName, sndName, number)
Perhaps
(fstName, sndName,)
Applying this change:
- may require
{-# LANGUAGE TupleSections #-}
adding to the top of the file