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. basisFor :: (Traversable t, Num a) => t b -> [t a]

    linear Linear.Vector

    Produce a default basis for a vector space from which the argument is drawn.

  2. segmentBefore :: Foldable f => (a -> Bool) -> f a -> ([a], [T [] a])

    non-empty Data.NonEmpty.Mixed

    No documentation available.

  3. ifor :: (TraversableWithIndex i t, Applicative f) => t a -> (i -> a -> f b) -> f (t b)

    optics-core Optics.Indexed.Core

    Traverse with an index (and the arguments flipped). 

    for a ≡ ifor a . const
ifor ≡ flip itraverse

  4. ifor_ :: (FoldableWithIndex i t, Applicative f) => t a -> (i -> a -> f b) -> f ()

    optics-core Optics.Indexed.Core

    Traverse elements with access to the index i, discarding the results (with the arguments flipped). 

    ifor_ ≡ flip itraverse_
    When you don't need access to the index then for_ is more flexible in what it accepts. 
    for_ a ≡ ifor_ a . const

  5. type family EliminationForms k :: ([(Symbol, Symbol)], [Symbol])

    optics-core Optics.Internal.Optic.Subtyping

    No documentation available.

  6. iforOf_ :: forall k f (is :: IxList) i s a r . (Is k A_Fold, Applicative f, HasSingleIndex is i) => Optic' k is s a -> s -> (i -> a -> f r) -> f ()

    optics-core Optics.IxFold

    A version of itraverseOf_ with the arguments flipped.

  7. iforOf :: forall k f (is :: IxList) i s t a b . (Is k A_Traversal, Applicative f, HasSingleIndex is i) => Optic k is s t a b -> s -> (i -> a -> f b) -> f t

    optics-core Optics.IxTraversal

    A version of itraverseOf with the arguments flipped.

  8. transformOf :: forall k (is :: IxList) a b . Is k A_Setter => Optic k is a b a b -> (b -> b) -> a -> b

    optics-core Optics.Setter

    Transform every element by recursively applying a given Setter in a bottom-up manner.

  9. transformMOf :: forall k m (is :: IxList) a b . (Is k A_Traversal, Monad m) => Optic k is a b a b -> (b -> m b) -> a -> m b

    optics-core Optics.Traversal

    Transform every element in a tree using a user supplied Traversal in a bottom-up manner with a monadic effect.

  10. uniform :: (Foldable t, MonadRandom m) => t a -> m a

    MonadRandom Control.Monad.Random.Class

    Sample a value uniformly from a nonempty collection of elements.

Page 524 of many | Previous | Next