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.

  1. IdentifierSet :: Bool -> PreserveCase -> HDL -> FreshCache -> !HashSet Identifier -> IdentifierSet

    clash-lib Clash.Netlist.Types

    No documentation available.

  2. class Monad m => IdentifierSetMonad (m :: Type -> Type)

    clash-lib Clash.Netlist.Types

    An IdentifierSetMonad supports unique name generation for Clash Netlist

  3. type IdentifierText = Text

    clash-lib Clash.Netlist.Types

    No documentation available.

  4. data IdentifierType

    clash-lib Clash.Netlist.Types

    No documentation available.

  5. newtype Identity a

    cql-io Database.CQL.IO

    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

    cql-io Database.CQL.IO

    No documentation available.

  7. data Identifier

    epub-metadata Codec.Epub.Data.Metadata

    package/metadata/dc:identifier tag

  8. Identifier :: Maybe String -> Maybe String -> Maybe String -> String -> Identifier

    epub-metadata Codec.Epub.Data.Metadata

    No documentation available.

  9. class Idempotent (c :: k1 -> k1 -> k)

    gdp Logic.Classes

    A binary operation # is idempotent if x # x == x for all x. The Idempotent c typeclass provides a single method, idempotent :: Proof (c p p == p). Within the module where F is defined, you can declare F to be idempotent with an empty instance: 

    -- Define an idempotent binary operation
data Union x y
instance Idempotent Union

  10. data IdSurgery (a :: k -> Type) (b :: k -> Type)

    generic-data-surgery Generic.Data.Surgery

    The identity surgery: doesn't do anything.

Page 213 of many | Previous | Next