Hoogle Search
Within LTS Haskell 24.52 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
shrinkSeqOf :: (v -> [v]) -> Seq v -> [Seq v]genvalidity-containers Data.GenValidity.Sequence No documentation available.
-
ghc-internal GHC.Internal.Base The value of seq a b is bottom if a is bottom, and otherwise equal to b. In other words, it evaluates the first argument a to weak head normal form (WHNF). seq is usually introduced to improve performance by avoiding unneeded laziness. A note on evaluation order: the expression seq a b does not guarantee that a will be evaluated before b. The only guarantee given by seq is that the both a and b will be evaluated before seq returns a value. In particular, this means that b may be evaluated before a. If you need to guarantee a specific order of evaluation, you must use the function pseq from the "parallel" package.
seq# :: a -> State# d -> (# State# d, a #)ghc-internal GHC.Internal.Base No documentation available.
sequence :: Monad m => [m a] -> m [a]ghc-internal GHC.Internal.Base Evaluate each action in the sequence from left to right, and collect the results.
-
ghc-internal GHC.Internal.Conc.Sync No documentation available.
sequence :: (Traversable t, Monad m) => t (m a) -> m (t a)ghc-internal GHC.Internal.Control.Monad Evaluate each monadic action in the structure from left to right, and collect the results. For a version that ignores the results see sequence_.
Examples
Basic usage: The first two examples are instances where the input and and output of sequence are isomorphic.>>> sequence $ Right [1,2,3,4] [Right 1,Right 2,Right 3,Right 4]
>>> sequence $ [Right 1,Right 2,Right 3,Right 4] Right [1,2,3,4]
The following examples demonstrate short circuit behavior for sequence.>>> sequence $ Left [1,2,3,4] Left [1,2,3,4]
>>> sequence $ [Left 0, Right 1,Right 2,Right 3,Right 4] Left 0
sequence_ :: (Foldable t, Monad m) => t (m a) -> m ()ghc-internal GHC.Internal.Control.Monad 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.
sequenceA_ :: (Foldable t, Applicative f) => t (f a) -> f ()ghc-internal GHC.Internal.Data.Foldable Evaluate each action in the structure from left to right, and ignore the results. For a version that doesn't ignore the results see sequenceA. sequenceA_ is just like sequence_, but generalised to Applicative actions.
Examples
Basic usage:>>> sequenceA_ [print "Hello", print "world", print "!"] "Hello" "world" "!"
sequence_ :: (Foldable t, Monad m) => t (m a) -> m ()ghc-internal GHC.Internal.Data.Foldable 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.
isSubsequenceOf :: Eq a => [a] -> [a] -> Boolghc-internal GHC.Internal.Data.List The isSubsequenceOf function takes two lists and returns True if all the elements of the first list occur, in order, in the second. The elements do not have to occur consecutively. isSubsequenceOf x y is equivalent to x `elem` (subsequences y). Note: isSubsequenceOf is often used in infix form.
Examples
>>> "GHC" `isSubsequenceOf` "The Glorious Haskell Compiler" True
>>> ['a','d'..'z'] `isSubsequenceOf` ['a'..'z'] True
>>> [1..10] `isSubsequenceOf` [10,9..0] False
For the result to be True, the first list must be finite; for the result to be False, the second list must be finite:>>> [0,2..10] `isSubsequenceOf` [0..] True
>>> [0..] `isSubsequenceOf` [0,2..10] False
>>> [0,2..] `isSubsequenceOf` [0..] * Hangs forever*