• About
  • Snapshots
  • LTS
  • Nightly
  • FAQ
  • Blog

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. (<.) :: Apply f => f a -> f b -> f a

    semigroupoids Data.Functor.Bind.Class

    a <. b = const <$> a <.> b
    

  2. (<.*>) :: Apply f => f (a -> b) -> MaybeApply f a -> f b

    semigroupoids Data.Functor.Bind.Class

    Apply a non-empty container of functions to a possibly-empty-with-unit container of values.

  3. (<.>) :: Apply f => f (a -> b) -> f a -> f b

    semigroupoids Data.Functor.Bind.Class

    No documentation available.

  4. (<<.) :: Biapply p => p a b -> p c d -> p a b

    semigroupoids Data.Functor.Bind.Class

    a <. b ≡ const <$> a <.> b
    

  5. (<<.>>) :: Biapply p => p (a -> b) (c -> d) -> p a c -> p b d

    semigroupoids Data.Functor.Bind.Class

    No documentation available.

  6. (!<<.) :: Bits a => a -> Int -> a

    base-compat Data.Bits.Compat

    Infix version of unsafeShiftL.

  7. (!>>.) :: Bits a => a -> Int -> a

    base-compat Data.Bits.Compat

    Infix version of unsafeShiftR.

  8. (>.>) :: (a -> b) -> (b -> c) -> a -> c

    ghc GHC.Core.Map.Expr

    No documentation available.

  9. (>.>) :: (a -> b) -> (b -> c) -> a -> c

    ghc GHC.Data.TrieMap

    No documentation available.

  10. (<.>) :: HsWrapper -> HsWrapper -> HsWrapper

    ghc GHC.Tc.Types.Evidence

    No documentation available.

Page 103 of many | Previous | Next

Stackage is a service provided by the Haskell Foundation │ Originally developed by FP Complete