Hoogle Search

Within LTS Haskell 24.67 (ghc-9.10.3)

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

  1. sequenceAOf_ :: Functor f => Getting (Traversed a f) s (f a) -> s -> f ()

    diagrams-lib Diagrams.Prelude

    Evaluate each action in observed by a Fold on a structure from left to right, ignoring the results.

    sequenceA_ ≡ sequenceAOf_ folded
    
    >>> sequenceAOf_ both (putStrLn "hello",putStrLn "world")
    hello
    world
    
    sequenceAOf_ :: Functor f     => Getter s (f a)     -> s -> f ()
    sequenceAOf_ :: Applicative f => Fold s (f a)       -> s -> f ()
    sequenceAOf_ :: Functor f     => Lens' s (f a)      -> s -> f ()
    sequenceAOf_ :: Functor f     => Iso' s (f a)       -> s -> f ()
    sequenceAOf_ :: Applicative f => Traversal' s (f a) -> s -> f ()
    sequenceAOf_ :: Applicative f => Prism' s (f a)     -> s -> f ()
    

  2. sequenceBy :: Traversable t => (forall x . () => x -> f x) -> (forall x y . () => f (x -> y) -> f x -> f y) -> t (f a) -> f (t a)

    diagrams-lib Diagrams.Prelude

    Sequence a container using its Traversable instance using explicitly provided Applicative operations. This is like sequence where the Applicative instance can be manually specified.

  3. sequenceByOf :: Traversal s t (f b) b -> (forall x . () => x -> f x) -> (forall x y . () => f (x -> y) -> f x -> f y) -> s -> f t

    diagrams-lib Diagrams.Prelude

    Sequence a container using a specified Applicative. This is like traverseBy where the Traversable instance can be specified by any Traversal

    sequenceByOf traverse ≡ sequenceBy
    

  4. sequenceOf :: LensLike (WrappedMonad m) s t (m b) b -> s -> m t

    diagrams-lib Diagrams.Prelude

    Sequence the (monadic) effects targeted by a Lens in a container from left to right.

    >>> sequenceOf each ([1,2],[3,4],[5,6])
    [(1,3,5),(1,3,6),(1,4,5),(1,4,6),(2,3,5),(2,3,6),(2,4,5),(2,4,6)]
    
    sequence ≡ sequenceOf traverse
    sequenceOf l ≡ mapMOf l id
    sequenceOf l ≡ unwrapMonad . l WrapMonad
    
    sequenceOf :: Monad m => Iso s t (m b) b       -> s -> m t
    sequenceOf :: Monad m => Lens s t (m b) b      -> s -> m t
    sequenceOf :: Monad m => Traversal s t (m b) b -> s -> m t
    

  5. sequenceOf_ :: Monad m => Getting (Sequenced a m) s (m a) -> s -> m ()

    diagrams-lib Diagrams.Prelude

    Evaluate each monadic action referenced by a Fold on the structure from left to right, and ignore the results.

    >>> sequenceOf_ both (putStrLn "hello",putStrLn "world")
    hello
    world
    
    sequence_ ≡ sequenceOf_ folded
    
    sequenceOf_ :: Monad m => Getter s (m a)     -> s -> m ()
    sequenceOf_ :: Monad m => Fold s (m a)       -> s -> m ()
    sequenceOf_ :: Monad m => Lens' s (m a)      -> s -> m ()
    sequenceOf_ :: Monad m => Iso' s (m a)       -> s -> m ()
    sequenceOf_ :: Monad m => Traversal' s (m a) -> s -> m ()
    sequenceOf_ :: Monad m => Prism' s (m a)     -> s -> m ()
    

  6. requiredScale :: (Additive v, Foldable v, Fractional n, Ord n) => SizeSpec v n -> v n -> n

    diagrams-lib Diagrams.Size

    requiredScale spec sz returns the largest scaling factor to make something of size sz fit the requested size spec without changing the aspect ratio. sz should be non-zero (otherwise a scale of 1 is returned). For non-uniform scaling see boxFit.

  7. requiredScaling :: (Additive v, Foldable v, Fractional n, Ord n) => SizeSpec v n -> v n -> Transformation v n

    diagrams-lib Diagrams.Size

    Return the Transformation calcuated from requiredScale.

  8. antisymmetricOnElemsWithEquality :: (a -> a -> Bool) -> (a -> a -> Bool) -> a -> a -> Bool

    genvalidity-sydtest Test.Syd.Validity

  9. antisymmetryOnGensWithEquality :: Show a => (a -> a -> Bool) -> Gen (a, a) -> (a -> a -> Bool) -> (a -> [a]) -> Property

    genvalidity-sydtest Test.Syd.Validity

    No documentation available.

  10. leftIdentityOnElemWithEquality :: (b -> a -> a) -> (a -> a -> Bool) -> b -> a -> Bool

    genvalidity-sydtest Test.Syd.Validity

Page 284 of many | Previous | Next