Hoogle Search

Within LTS Haskell 24.38 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. Identify :: Effect

   LambdaHack	Game.LambdaHack.Content.ItemKind

   find a suitable (i.e., not identified) item, starting from the floor, and identify it

2. newtype Identity a

   cabal-install-solver	Distribution.Solver.Compat.Prelude

   Identity functor and monad. (a non-strict monad)

   Examples

   >>> fmap (+1) (Identity 0)
   Identity 1
   

   >>> Identity [1, 2, 3] <> Identity [4, 5, 6]
   Identity [1,2,3,4,5,6]
   

   >>> do
   x <- Identity 10
   y <- Identity (x + 5)
   pure (x + y)
   Identity 25
   

3. Identity :: a -> Identity a

   cabal-install-solver	Distribution.Solver.Compat.Prelude

   No documentation available.

4. type IDCode = String

   clash-prelude	Clash.Signal.Trace

   No documentation available.

5. newtype Identity a

   classy-prelude-conduit	ClassyPrelude.Conduit

   Identity functor and monad. (a non-strict monad)

   Examples

   >>> fmap (+1) (Identity 0)
   Identity 1
   

   >>> Identity [1, 2, 3] <> Identity [4, 5, 6]
   Identity [1,2,3,4,5,6]
   

   >>> do
   x <- Identity 10
   y <- Identity (x + 5)
   pure (x + y)
   Identity 25
   

6. Identity :: a -> Identity a

   classy-prelude-conduit	ClassyPrelude.Conduit

   No documentation available.

7. IDouble :: Double -> InfoValue

   curl	Network.Curl.Info

   No documentation available.

8. IdNumber :: SourceData

   fakedata	Faker.Internal.Types

   No documentation available.

9. newtype IdentityT (f :: k -> Type) (a :: k)

   functor-combinators	Data.Functor.Combinator

   The trivial monad transformer, which maps a monad to an equivalent monad.

10. IdentityT :: f a -> IdentityT (f :: k -> Type) (a :: k)

    functor-combinators	Data.Functor.Combinator

    No documentation available.

Page 201 of many | Previous | Next