Hoogle Search

Within LTS Haskell 24.6 (ghc-9.10.2)

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

  1. sequence_ :: forall t (k :: Type -> Type -> Type) l m a b uk ul . (Foldable t k l, Arrow k (->), Arrow l (->), uk ~ UnitObject k, ul ~ UnitObject l, uk ~ ul, Monoidal m k k, Monoidal m l l, ObjectPair k a uk, ObjectPair k (t (m a)) uk, ObjectPair k uk uk, ObjectPair k (m uk) (m uk), ObjectPair k (t (m a)) ul, ObjectPair l (m ul) (t (m a)), ObjectPair l ul (t (m a)), ObjectPair l (m uk) (t (m a)), ObjectPair l (t (m a)) ul, ObjectPair k (m uk) (m a)) => l (t (m a)) (m uk)

    constrained-categories Data.Foldable.Constrained

    No documentation available.

  2. sequenceA :: (Traversable t, Applicative f) => t (f a) -> f (t a)

    copilot-language Copilot.Language.Prelude

    Evaluate each action in the structure from left to right, and collect the results. For a version that ignores the results see sequenceA_.

    Examples

    Basic usage: For the first two examples we show sequenceA fully evaluating a a structure and collecting the results. 
    >>> sequenceA [Just 1, Just 2, Just 3]
Just [1,2,3]

    >>> sequenceA [Right 1, Right 2, Right 3]
Right [1,2,3]
    The next two example show Nothing and Just will short circuit the resulting structure if present in the input. For more context, check the Traversable instances for Either and Maybe. 
    >>> sequenceA [Just 1, Just 2, Just 3, Nothing]
Nothing

    >>> sequenceA [Right 1, Right 2, Right 3, Left 4]
Left 4

  3. sequence_ :: (Foldable t, Monad m) => t (m a) -> m ()

    copilot-language Copilot.Language.Prelude

    Evaluate each monadic action in the structure from left to right, and ignore the results. For a version that doesn't ignore the results see sequence. sequence_ is just like sequenceA_, but specialised to monadic actions.

  4. sequenceQIdKey :: Unique

    ghc-lib GHC.Builtin.Names.TH

    No documentation available.

  5. sequenceQName :: Name

    ghc-lib GHC.Builtin.Names.TH

    No documentation available.

  6. sequenceTop :: Instruction instr => NcgImpl statics instr jumpDest -> Maybe CFG -> NatCmmDecl statics instr -> UniqDSM (NatCmmDecl statics instr)

    ghc-lib GHC.CmmToAsm.BlockLayout

    No documentation available.

  7. sequenceConcurrently :: forall t (r :: EffectRow) a . (Traversable t, Member Async r) => t (Sem r a) -> Sem r (t (Maybe a))

    incipit-core IncipitCore

    Perform a sequence of effectful actions concurrently.

  8. sequenceUntil :: Monad m => (a -> Bool) -> [m a] -> m [a]

    monad-extras Control.Monad.Extra

    Draw monadic actions from a list until one of them yields a value satisfying the predicate, and then return all the values up to and including the first that succeeds in a list within that monad.

  9. sequenceWhile :: Monad m => (a -> Bool) -> [m a] -> m [a]

    monad-extras Control.Monad.Extra

    Draw monadic actions from a list until one of them yields a value failing the predicate, and then return all the passing values (discarding the final, failing value) in a list within that monad.

  10. sequenceIdInputStream :: Integral s => s -> (a -> s) -> (SequenceIdError s -> IO ()) -> InputStream a -> IO (InputStream a)

    seqid-streams System.IO.Streams.SequenceId

    Wrap an InputStream and check for dropped or duplicated sequence IDs. Example: 

    ghci> fromList [1..10 :: SequenceId] >>= sequenceIdInputStream 0 id (fail . show) >>= toList
[1,2,3,4,5,6,7,8,9,10]

ghci> fromList [5..10 :: SequenceId] >>= sequenceIdInputStream 0 id (fail . show) >>= toList
*** Exception: user error (SequenceIdError {errType = SequenceIdDropped, lastSeqId = 0, currSeqId = 5})

ghci> fromList [1..10 :: SequenceId] >>= sequenceIdInputStream 5 id (fail . show) >>= toList
*** Exception: user error (SequenceIdError {errType = SequenceIdDuplicated, lastSeqId = 5, currSeqId = 1})

Page 48 of many | Previous | Next