Hoogle Search

Within LTS Haskell 24.19 (ghc-9.10.3)

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

  1. bisequenceA_ :: (Bifoldable t, Applicative f) => t (f a) (f b) -> f ()

    base Data.Bifoldable

    Alias for bisequence_.

  2. bisequence_ :: (Bifoldable t, Applicative f) => t (f a) (f b) -> f ()

    base Data.Bifoldable

    Evaluate each action in the structure from left to right, and ignore the results. For a version that doesn't ignore the results, see bisequence.

    Examples

    Basic usage: 
    >>> bisequence_ (print "Hello", print "World")
"Hello"
"World"

    >>> bisequence_ (Left (print "Hello"))
"Hello"

    >>> bisequence_ (Right (print "World"))
"World"

  3. bisequence :: (Bitraversable t, Applicative f) => t (f a) (f b) -> f (t a b)

    base Data.Bitraversable

    Sequences all the actions in a structure, building a new structure with the same shape using the results of the actions. For a version that ignores the results, see bisequence_. 

    bisequence ≡ bitraverse id id

    Examples

    Basic usage: 
    >>> bisequence (Just 4, Nothing)
Nothing

    >>> bisequence (Just 4, Just 5)
Just (4,5)

    >>> bisequence ([1, 2, 3], [4, 5])
[(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)]

  4. bisequenceA :: (Bitraversable t, Applicative f) => t (f a) (f b) -> f (t a b)

    base Data.Bitraversable

    Alias for bisequence.

  5. InvalidSequence :: CodingProgress

    base GHC.IO.Encoding

    Stopped because there are sufficient free elements in the output to output at least one encoded ASCII character, but the input contains an invalid or unrepresentable sequence

  6. InvalidSequence :: CodingProgress

    base GHC.IO.Encoding.Types

    Stopped because there are sufficient free elements in the output to output at least one encoded ASCII character, but the input contains an invalid or unrepresentable sequence

  7. getSequenced :: Sequenced a (m :: Type -> Type) -> m a

    lens Control.Lens.Internal.Fold

    No documentation available.

  8. subsequence :: MonadGen m => [a] -> m [a]

    hedgehog Hedgehog.Gen

    Generates a random subsequence of a list. For example: 

    Gen.print (Gen.subsequence [1..5])

    === Outcome ===
[1,2,4]
=== Shrinks ===
[]
[2,4]
[1,4]
[1,2]

  9. subsequence :: MonadGen m => [a] -> m [a]

    hedgehog Hedgehog.Internal.Gen

    Generates a random subsequence of a list. For example: 

    Gen.print (Gen.subsequence [1..5])

    === Outcome ===
[1,2,4]
=== Shrinks ===
[]
[2,4]
[1,4]
[1,2]

  10. bisequenceA1_ :: (Bifoldable1 t, Apply f) => t (f a) (f b) -> f ()

    semigroupoids Data.Semigroup.Bifoldable

    No documentation available.

Page 50 of many | Previous | Next