Hoogle Search

Within LTS Haskell 24.4 (ghc-9.10.2)

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

  1. first :: T a b -> a

    synthesizer-core Synthesizer.Zip

    No documentation available.

  2. first :: (a -> a') -> (a, b) -> (a', b)

    speculate Test.Speculate.Utils

    Applies a function to the first element of a pair. Often known on the wild as mapFst. 

    > first (*10) (1,2)
(10,2)

  3. first :: forall (arrow :: Type -> Type -> Type) sample0 sample1 sample . Arrow arrow => T arrow sample0 sample1 -> T arrow (sample0, sample) (sample1, sample)

    synthesizer-dimensional Synthesizer.Dimensional.Arrow

    No documentation available.

  4. first :: forall (arrow :: Type -> Type -> Type) sample0 sample1 sample . Arrow arrow => T arrow sample0 sample1 -> T arrow (sample0, sample) (sample1, sample)

    synthesizer-dimensional Synthesizer.Dimensional.Causal.Process

    No documentation available.

  5. first :: Arrow a => a b c -> a (b, d) (c, d)

    LambdaHack Game.LambdaHack.Core.Prelude

    Send the first component of the input through the argument arrow, and copy the rest unchanged to the output.

  6. first :: Arrow a => a b c -> a (b, d) (c, d)

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

    Send the first component of the input through the argument arrow, and copy the rest unchanged to the output.

  7. first :: forall a (b :: Type -> Type) x a' p i . Strong p => p i (a x) (a' x) -> p i ((a :*: b) x) ((a' :*: b) x)

    generic-lens-core Data.GenericLens.Internal

    Lens focusing on the first element of a product

  8. first :: LRU key val -> !Maybe key

    lrucache Data.Cache.LRU.Internal

    the key of the most recently accessed entry

  9. first :: (SymVal a, SymVal b, SymVal c) => (SBV a -> SBV b) -> SEither a c -> SEither b c

    sbv Data.SBV.Either

    Map over the left side of an Either 

    >>> let f = uninterpret "f" :: SInteger -> SInteger

>>> prove $ \x -> first f (sLeft x :: SEither Integer Integer) .== sLeft (f x)
Q.E.D.

>>> prove $ \x -> first f (sRight x :: SEither Integer Integer) .== sRight x
Q.E.D.

  10. first :: forall a (m :: Type -> Type) b c . a -> Unfold m (a, b) c -> Unfold m b c

    streamly-core Streamly.Data.Unfold

    Supply the first component of the tuple to an unfold that accepts a tuple as a seed resulting in a fold that accepts the second component of the tuple as a seed. 

    first a = Unfold.lmap (a, )
    Pre-release

Page 7 of many | Previous | Next