Strict -containers -package

module Control.Monad.ST.Strict
base Control.Monad.ST.Strict
The strict ST monad (re-export of Control.Monad.ST)
module Data.STRef.Strict
base Data.STRef.Strict
Mutable references in the (strict) ST monad (re-export of Data.STRef)
module Control.Monad.RWS.Strict
mtl Control.Monad.RWS.Strict
Strict RWS monad. Inspired by the paper Functional Programming with Overloading and Higher-Order Polymorphism, Mark P Jones (http://web.cecs.pdx.edu/~mpj/) Advanced School of Functional Programming, 1995.
module Control.Monad.State.Strict
mtl Control.Monad.State.Strict
Strict state monads. This module is inspired by the paper Functional Programming with Overloading and Higher-Order Polymorphism, Mark P Jones (http://web.cecs.pdx.edu/~mpj/) Advanced School of Functional Programming, 1995.
module Control.Monad.Trans.RWS.Strict
transformers Control.Monad.Trans.RWS.Strict
A monad transformer that combines ReaderT, WriterT and StateT. This version is strict; for a lazy version, see Control.Monad.Trans.RWS.Lazy, which has the same interface.
module Control.Monad.Trans.State.Strict
transformers Control.Monad.Trans.State.Strict
Strict state monads, passing an updatable state through a computation. See below for examples. In this version, sequencing of computations is strict. For a lazy version, see Control.Monad.Trans.State.Lazy, which has the same interface. Some computations may not require the full power of state transformers: * For a read-only state, see Control.Monad.Trans.Reader. * To accumulate a value without using it on the way, see Control.Monad.Trans.Writer.
module Control.Monad.Trans.Writer.Strict
transformers Control.Monad.Trans.Writer.Strict
The strict WriterT monad transformer, which adds collection of outputs (such as a count or string output) to a given monad. This version builds its output strictly; for a lazy version, see Control.Monad.Trans.Writer.Lazy, which has the same interface. This monad transformer provides only limited access to the output during the computation. For more general access, use Control.Monad.Trans.State instead.
module Control.Monad.Writer.Strict
mtl Control.Monad.Writer.Strict
Strict writer monads. Inspired by the paper Functional Programming with Overloading and Higher-Order Polymorphism, Mark P Jones (http://web.cecs.pdx.edu/~mpj/pubs/springschool.html) Advanced School of Functional Programming, 1995.
data Strict
template-haskell Language.Haskell.TH.Syntax, template-haskell Language.Haskell.TH
module Text.XHtml.Strict
xhtml Text.XHtml.Strict
Produces XHTML 1.0 Strict.
type StrictType = (Strict, Type)
template-haskell Language.Haskell.TH.Syntax
type StrictTypeQ = Q StrictType
template-haskell Language.Haskell.TH.Lib, template-haskell Language.Haskell.TH
strictToLazyST :: ST s a -> ST s a
base Control.Monad.ST.Lazy
Convert a strict ST computation into a lazy one. The strict state thread passed to strictToLazyST is not performed until the result of the lazy state thread it returns is demanded.
strictBufferOp :: BufferOp ByteString
HTTP Network.BufferType
strictBufferOp is the BufferOp definition over ByteStrings, the non-lazy kind.
strictDecode :: OnDecodeError
text Data.Text.Encoding.Error
Throw a UnicodeException if decoding fails.
strictEncode :: OnEncodeError
text Data.Text.Encoding.Error
Throw a UnicodeException if encoding fails.
strictInvariant :: Text -> Bool
text Data.Text.Lazy.Internal
Check the invariant strictly.
strictType :: Q Strict -> TypeQ -> StrictTypeQ
template-haskell Language.Haskell.TH.Lib, template-haskell Language.Haskell.TH
lazyToStrictST :: ST s a -> ST s a
base Control.Monad.ST.Lazy
Convert a lazy ST computation into a strict one.
fromStrict :: ByteString -> ByteString
bytestring Data.ByteString.Lazy, bytestring Data.ByteString.Lazy.Char8
O(1) Convert a strict ByteString into a lazy ByteString.

Show more results