Skip to content

Remove HLint ANN pragmas #118

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
athas merged 1 commit into from
May 14, 2026
Merged

Remove HLint ANN pragmas #118

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 0 additions & 2 deletions Data/Graph/Inductive/Monad.hs
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -20,8 +20,6 @@ module Data.Graph.Inductive.Monad(

import Data.Graph.Inductive.Graph

{-# ANN module "HLint: ignore Redundant lambda" #-}

----------------------------------------------------------------------
-- MONADIC GRAPH CLASS
----------------------------------------------------------------------
Expand Down
1 change: 0 additions & 1 deletion Data/Graph/Inductive/Query/Dominators.hs
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -21,7 +21,6 @@
import Data.Tree (Tree (..))
import qualified Data.Tree as T

{-# ANN iDom "HLint: ignore Use ***" #-}
-- | return immediate dominators for each reachable node of a graph, given a root
iDom :: (Graph gr) => gr a b -> Node -> [(Node,Node)]
iDom g root = let (result, toNode, _) = idomWork g root
Expand Down Expand Up @@ -61,7 +60,7 @@
-- relabel the tree so that paths from the root have increasing nodes
(s, ntree) = numberTree 0 tree
-- the approximation iDom0 just maps each node to its parent
iD0 = array (1, s-1) (tail $ treeEdges (-1) ntree)

Check warning on line 63 in Data/Graph/Inductive/Query/Dominators.hs

View workflow job for this annotation

GitHub Actions / build (9.12.2) 

In the use of ‘tail’

Check warning on line 63 in Data/Graph/Inductive/Query/Dominators.hs

View workflow job for this annotation

GitHub Actions / build (9.8.4) 

In the use of ‘tail’

Check warning on line 63 in Data/Graph/Inductive/Query/Dominators.hs

View workflow job for this annotation

GitHub Actions / build (9.10.3) 

In the use of ‘tail’
-- fromNode translates graph nodes to relabeled (internal) nodes
fromNode = I.unionWith const (I.fromList (zip (T.flatten tree) (T.flatten ntree))) (I.fromList (zip nds (repeat (-1))))
-- toNode translates internal nodes to graph nodes
Expand Down
Loading