Hoogle Search

Within LTS Haskell 24.2 (ghc-9.10.2)

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

  1. safeHeadG :: Foldable t => t a -> Maybe a

    monoid-insertleft Data.InsertLeft

    If a structure is empty, just returns Nothing.

  2. foldFirst :: Foldable t => t a -> Maybe a

    hw-prim HaskellWorks.Data.Foldable

    No documentation available.

  3. foldLast :: Foldable t => t a -> Maybe a

    hw-prim HaskellWorks.Data.Foldable

    No documentation available.

  4. head :: Foldable f => f a -> Maybe a

    protolude Protolude.List

    No documentation available.

  5. fromFoldable :: (Foldable f, Vector v a) => f a -> v a

    vector-extras VectorExtras.Generic

    No documentation available.

  6. average :: forall a f . (Foldable f, Fractional a) => f a -> Maybe a

    relude Relude.Extra.Foldable

    Given a Foldable of Fractional elements, computes the average if possible and returns Maybe element. 

    >>> average [42]
Just 42.0

>>> average @Double [1, 2, 3, 4]
Just 2.5

>>> average @Float [1.5, 2.5, 3 ,4]
Just 2.75

>>> average []
Nothing

  7. isConst :: (Mapping k m, Ord v) => m v -> Maybe v

    mappings Data.Mapping

    No documentation available.

  8. unsafePrimCast :: (PrimMonad m1, PrimMonad m2) => m1 a -> m2 a

    basement Basement.Monad

    Convert a prim monad to another prim monad. The net effect is that it coerce the state repr to another, so the runtime representation should be the same, otherwise hilary ensues.

  9. sendM :: forall n (sig :: (Type -> Type) -> Type -> Type) m a . (Has (Lift n) sig m, Functor n) => n a -> m a

    fused-effects Control.Effect.Lift

    Given a Lift n constraint in a signature carried by m, sendM promotes arbitrary actions of type n a to m a. It is spiritually similar to lift from the MonadTrans typeclass.

  10. convert :: (Vector v a, Vector w a) => v a -> w a

    rio RIO.Vector

    No documentation available.

Page 2 of many | Previous | Next