strict-base-types: Strict variants of the types provided in base.
It is common knowledge that lazy datastructures can lead to space-leaks. This problem is particularly prominent, when using lazy datastructures to store the state of a long-running application in memory. The easiest solution to this problem is to use fully strict types to store such state values. By "fully strict types" we mean types for whose values it holds that, if they are in weak-head normal form, then they are also in normal form. Intuitively, this means that values of fully strict types cannot contain unevaluated thunks.
To define a fully strict datatype, one typically uses the following recipe.
Make all fields of every constructor strict; i.e., add a bang to all fields.
Use only strict types for the fields of the constructors.
The second requirement is problematic as it rules out the use of
the standard Haskell Maybe
, Either
, and pair types. This library
solves this problem by providing strict variants of these types and their
corresponding standard support functions and type-class instances.
Note that this library does currently not provide fully strict lists.
They can be added if they are really required. However, in many cases one
probably wants to use unboxed or strict boxed vectors from the vector
library (http://hackage.haskell.org/package/vector) instead of strict
lists. Moreover, instead of String
s one probably wants to use strict
Text
values from the text
library
(http://hackage.haskell.org/package/text).
This library comes with batteries included; i.e., missing instances
for type-classes from the deepseq
, binary
, aeson
, QuickCheck
, and
lens
packages are included. Of particluar interest is the Strict
type-class provided by the lens library
(http://hackage.haskell.org/packages/archive/lens/3.9.0.2/doc/html/Control-Lens-Iso.html#t:Strict).
It is used in the following example to simplify the modification of
strict fields.
(-# LANGUAGE TemplateHaskell #-) -- replace with curly braces, (-# LANGUAGE OverloadedStrings #-) -- the Haddock prologues are a P.I.T.A! import Control.Lens ( (.=), Strict(strict), from, Iso', makeLenses) import Control.Monad.State.Strict (State) import qualified Data.Map as M import qualified Data.Maybe.Strict as S import qualified Data.Text as T -- | An example of a state record as it could be used in a (very minimal) -- role-playing game. data GameState = GameState ( _gsCooldown :: !(S.Maybe Int) , _gsHealth :: !Int ) -- replace with curly braces, *grmbl* makeLenses ''GameState -- The isomorphism, which converts a strict field to its lazy variant lazy :: Strict lazy strict => Iso' strict lazy lazy = from strict type Game = State GameState cast :: T.Text -> Game () cast spell = gsCooldown.lazy .= M.lookup spell spellDuration -- ... implement remainder of spell-casting ... where spellDuration = M.fromList [("fireball", 5)]
See http://www.haskellforall.com/2013/05/program-imperatively-using-haskell.html for a gentle introduction to lenses and state manipulation.
Note that this package uses the types provided by the strict
package
(http://hackage.haskell.org/package/strict), but organizes them a bit
differently. More precisely, the strict-base-types
package
only provides the fully strict variants of types from
base
,is in-sync with the current base library (base-4.6),
provides the missing instances for (future) Haskell platform packages, and
conforms to the standard policy that strictness variants of an existing datatype are identified by suffixing 'Strict' or 'Lazy' in the module hierarchy.
Downloads
- strict-base-types-0.2.tar.gz [browse] (Cabal source package)
- Package description (revised from the package)
Note: This package has metadata revisions in the cabal description newer than included in the tarball. To unpack the package including the revisions, use 'cabal get'.
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
Versions [RSS] | 0.1, 0.2, 0.2.1, 0.2.2, 0.2.3, 0.3.0, 0.4.0, 0.5.0, 0.6.0, 0.6.1, 0.7, 0.8, 0.8.1 |
---|---|
Dependencies | aeson (>=0.6), base (>=4.5 && <5), bifunctors (<5.1), binary (>=0.5), deepseq (>=1.3), ghc-prim, lens (>=3.9 && <4.0), QuickCheck (>=2), strict (>=0.3 && <0.4) [details] |
License | BSD-3-Clause |
Copyright | (c) 2006-2008 by Roman Leshchinskiy (c) 2013 by Simon Meier |
Author | Roman Leshchinskiy <rl@cse.unsw.edu.au>, Simon Meier <iridcode@gmail.com> |
Maintainer | Simon Meier <iridcode@gmail.com> |
Revised | Revision 2 made by phadej at 2015-11-24T22:39:40Z |
Category | Data |
Home page | https://github.com/meiersi/strict-base-types |
Source repo | head: git clone https://github.com/meiersi/strict-base-types.git |
Uploaded | by SimonMeier at 2013-05-11T14:08:38Z |
Distributions | LTSHaskell:0.8.1, NixOS:0.8, Stackage:0.8.1 |
Reverse Dependencies | 4 direct, 1 indirect [details] |
Downloads | 10562 total (3 in the last 30 days) |
Rating | 2.0 (votes: 1) [estimated by Bayesian average] |
Your Rating | |
Status | Docs uploaded by user Build status unknown [no reports yet] |