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.
Seq :: FingerTree (Elem a) -> Seq acontainers Data.Sequence.Internal No documentation available.
liftA2Seq :: (a -> b -> c) -> Seq a -> Seq b -> Seq ccontainers Data.Sequence.Internal No documentation available.
mergeQ :: (a -> a -> Ordering) -> Queue a -> Queue a -> Queue acontainers Data.Sequence.Internal.Sorting frequency :: HasCallStack => [(Int, Gen a)] -> Gen aQuickCheck Test.QuickCheck Chooses one of the given generators, with a weighted random distribution. The input list must be non-empty.
frequency :: HasCallStack => [(Int, Gen a)] -> Gen aQuickCheck Test.QuickCheck.Gen Chooses one of the given generators, with a weighted random distribution. The input list must be non-empty.
sequential :: SpecWith a -> SpecWith ahspec Test.Hspec sequential marks all spec items of the given spec to be evaluated sequentially.
sequentialTestGroup :: TestName -> DependencyType -> [TestTree] -> TestTreetasty Test.Tasty Create a named group of test cases or other groups. Tests are executed in order. For parallel execution, see testGroup.
Seq :: TestOutput -> TestOutput -> TestOutputtasty Test.Tasty.Ingredients.ConsoleReporter Two sets of TestOutput on the same level.
-
Deep evaluation of data structures This package provides methods for fully evaluating data structures ("deep evaluation"). Deep evaluation is often used for adding strictness to a program, e.g. in order to force pending exceptions, remove space leaks, or force lazy I/O to happen. It is also useful in parallel programs, to ensure pending work does not migrate to the wrong thread. The primary use of this package is via the deepseq function, a "deep" version of seq. It is implemented on top of an NFData typeclass ("Normal Form Data", data structures with no unevaluated components) which defines strategies for fully evaluating different data types. See module documentation in Control.DeepSeq for more details.
-
This module provides overloaded functions, such as deepseq and rnf, for fully evaluating data structures (that is, evaluating to "Normal Form"). A typical use is to prevent resource leaks in lazy IO programs, by forcing all characters from a file to be read. For example:
import System.IO import Control.DeepSeq import Control.Exception (evaluate) readFile' :: FilePath -> IO String readFile' fn = do h <- openFile fn ReadMode s <- hGetContents h evaluate (rnf s) hClose h return s
Note: The example above should rather be written in terms of bracket to ensure releasing file-descriptors in a timely matter (see the description of force for an example). deepseq differs from seq as it traverses data structures deeply, for example, seq will evaluate only to the first constructor in the list:> [1,2,undefined] `seq` 3 3
While deepseq will force evaluation of all the list elements:> [1,2,undefined] `deepseq` 3 *** Exception: Prelude.undefined
Another common use is to ensure any exceptions hidden within lazy fields of a data structure do not leak outside the scope of the exception handler, or to force evaluation of a data structure in one thread, before passing to another thread (preventing work moving to the wrong threads).