Hoogle Search
Within LTS Haskell 24.45 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
iDom :: Graph gr => gr a b -> Node -> [(Node, Node)]fgl Data.Graph.Inductive.Query.Dominators return immediate dominators for each reachable node of a graph, given a root
-
relude Relude.Function Renamed version of id.
>>> identity 10 10
>>> fmap identity [1,2,3] [1,2,3]
-
distributed-process Control.Distributed.Process.Closure -
distributed-process Control.Distributed.Process.Internal.Closure.BuiltIn idempotent :: (Show a, Eq a, GenValid a) => (a -> a) -> Propertygenvalidity-property Test.Validity.Functions.Idempotence No documentation available.
idempotentOnArbitrary :: (Show a, Eq a, Arbitrary a) => (a -> a) -> Propertygenvalidity-property Test.Validity.Functions.Idempotence id is idempotent for any type:
idempotentOnArbitrary (id :: Int -> Int)
const, given any input, is idempotent for any type as well:\int -> idempotentOnArbitrary (const int :: Int -> Int)
idempotentOnGen :: (Show a, Eq a) => (a -> a) -> Gen a -> (a -> [a]) -> Propertygenvalidity-property Test.Validity.Functions.Idempotence No documentation available.
identity :: (Show a, Eq a, GenValid a) => (a -> a -> a) -> a -> Propertygenvalidity-property Test.Validity.Operations.Identity identity ((*) :: Int -> Int -> Int) 1
identity ((+) :: Int -> Int -> Int) 0
identityOnArbitrary :: (Show a, Eq a, Arbitrary a) => (a -> a -> a) -> a -> Propertygenvalidity-property Test.Validity.Operations.Identity identityOnArbitrary ((*) :: Int -> Int -> Int) 1
identityOnArbitrary ((+) :: Int -> Int -> Int) 0
identityOnGen :: (Show a, Eq a) => (a -> a -> a) -> a -> Gen a -> (a -> [a]) -> Propertygenvalidity-property Test.Validity.Operations.Identity