Hoogle Search

Within LTS Haskell 24.3 (ghc-9.10.2)

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

  1. addPath :: MonadReader [a1] m => a1 -> m a2 -> m a2

    morpheus-graphql-core Data.Morpheus.Internal.Utils

    No documentation available.

  2. cons :: Vector v a => a -> v a -> v a

    rio RIO.Vector

    No documentation available.

  3. cons :: Vector v a => a -> v a -> v a

    rebase Rebase.Data.Vector.Generic

    No documentation available.

  4. (<$) :: Functor f => a -> f b -> f a

    base Prelude

    Replace all locations in the input with the same value. The default definition is fmap . const, but this may be overridden with a more efficient version.

    Examples

    Perform a computation with Maybe and replace the result with a constant value if it is Just:
    >>> 'a' <$ Just 2
    Just 'a'
    
    >>> 'a' <$ Nothing
    Nothing
    

  5. (<$) :: Functor f => a -> f b -> f a

    base Control.Monad

    Replace all locations in the input with the same value. The default definition is fmap . const, but this may be overridden with a more efficient version.

    Examples

    Perform a computation with Maybe and replace the result with a constant value if it is Just:
    >>> 'a' <$ Just 2
    Just 'a'
    
    >>> 'a' <$ Nothing
    Nothing
    

  6. (<$) :: Functor f => a -> f b -> f a

    base Control.Applicative

    Replace all locations in the input with the same value. The default definition is fmap . const, but this may be overridden with a more efficient version.

    Examples

    Perform a computation with Maybe and replace the result with a constant value if it is Just:
    >>> 'a' <$ Just 2
    Just 'a'
    
    >>> 'a' <$ Nothing
    Nothing
    

  7. (<$) :: Functor f => a -> f b -> f a

    base Control.Monad.Instances

    Replace all locations in the input with the same value. The default definition is fmap . const, but this may be overridden with a more efficient version.

    Examples

    Perform a computation with Maybe and replace the result with a constant value if it is Just:
    >>> 'a' <$ Just 2
    Just 'a'
    
    >>> 'a' <$ Nothing
    Nothing
    

  8. (<$) :: Functor f => a -> f b -> f a

    base Data.Functor

    Replace all locations in the input with the same value. The default definition is fmap . const, but this may be overridden with a more efficient version.

    Examples

    Perform a computation with Maybe and replace the result with a constant value if it is Just:
    >>> 'a' <$ Just 2
    Just 'a'
    
    >>> 'a' <$ Nothing
    Nothing
    

  9. (<$) :: Functor f => a -> f b -> f a

    base GHC.Base

    Replace all locations in the input with the same value. The default definition is fmap . const, but this may be overridden with a more efficient version.

    Examples

    Perform a computation with Maybe and replace the result with a constant value if it is Just:
    >>> 'a' <$ Just 2
    Just 'a'
    
    >>> 'a' <$ Nothing
    Nothing
    

  10. (<$) :: Functor f => a -> f b -> f a

    hedgehog Hedgehog.Internal.Prelude

    Replace all locations in the input with the same value. The default definition is fmap . const, but this may be overridden with a more efficient version.

    Examples

    Perform a computation with Maybe and replace the result with a constant value if it is Just:
    >>> 'a' <$ Just 2
    Just 'a'
    
    >>> 'a' <$ Nothing
    Nothing
    

Page 1 of many | Next