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.
module Reactive.Banana.ALSA.
Sequencer No documentation available.
class TableDerivable s =>
SequenceDerivable s i | s -> irelational-schemas Database.Custom.IBMDB2 Sequence derivation rule
class TableDerivable s =>
SequenceDerivable s i | s -> irelational-schemas Database.Custom.MySQL Sequence derivation rule
class TableDerivable s =>
SequenceDerivable s i | s -> irelational-schemas Database.Custom.Oracle Sequence derivation rule
class TableDerivable s =>
SequenceDerivable s i | s -> irelational-schemas Database.Custom.PostgreSQL Sequence derivation rule
class TableDerivable s =>
SequenceDerivable s i | s -> irelational-schemas Database.Custom.SQLServer Sequence derivation rule
class TableDerivable s =>
SequenceDerivable s i | s -> irelational-schemas Database.Custom.SQLite3 Sequence derivation rule
module System.IO.Streams.
SequenceId No documentation available.
-
tuple Data.Tuple.Sequence Tuple sequencing, i.e., take a tuple of of monadic actions and do them from left-to-right, returning the resulting tuple.
sequenceA :: (Traversable t, Applicative f) => t (f a) -> f (t a)base 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