Verites/verigraph

View on GitHub
src/library/Analysis/Interlevel/InterLevelCP.hs

Summary

Maintainability
Test Coverage

Avoid restricted qualification
Open

import qualified Data.Graphs as G

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

    edgesToAdd = concatMap (\n -> map (\e -> (n,e)) dangT) orphanNodes

Found

\ e -> (n, e)

Perhaps

(n,)

Applying this change:

  • may require {-# LANGUAGE TupleSections #-} adding to the top of the file

Use .
Open

removeDuplicated = nubBy (\x y -> not $ Prelude.null $ find x y)

Found

not $ Prelude.null $ find x y

Perhaps

not . Prelude.null $ find x y

Use tuple-section
Open

    edgesToAdd = concatMap (\n -> map (\e -> (n,e)) dangT) orphanNodes

Found

\ e -> (n, e)

Perhaps

(n,)

Applying this change:

  • may require {-# LANGUAGE TupleSections #-} adding to the top of the file

Use tuple-section
Open

    newNames = map (\number -> (fstName, sndName, number)) ([0..] :: [Int])

Found

\ number -> (fstName, sndName, number)

Perhaps

(fstName, sndName,)

Applying this change:

  • may require {-# LANGUAGE TupleSections #-} adding to the top of the file

There are no issues that match your filters.

Category
Status