1
Fork 0

Separate strict and lazy version of functions.

This includes a large minor version upgrade.
master
Joshua Potter 2018-04-22 22:00:37 -07:00
parent 6f05ae6a80
commit 12bf35cea2
4 changed files with 48 additions and 23 deletions

View File

@ -2,11 +2,12 @@
-- --
-- see: https://github.com/sol/hpack -- see: https://github.com/sol/hpack
-- --
-- hash: 82b7ad1c15304e5bdef2dfe14b8cecc2e801967a3e05a65154970648658b171c -- hash: ea62b7db89a610cce35616a02dc56670b7cdff0d747b64a96f19cb72bd6d42f7
name: postlude name: postlude
version: 0.1.0.8 version: 0.1.1.0
description: Please see the README on Github at <https://github.com/jrpotter/postlude#readme> description: Please see the README on Github at
<https://github.com/jrpotter/postlude#readme>
homepage: https://github.com/jrpotter/postlude#readme homepage: https://github.com/jrpotter/postlude#readme
bug-reports: https://github.com/jrpotter/postlude/issues bug-reports: https://github.com/jrpotter/postlude/issues
author: Joshua Potter author: Joshua Potter
@ -37,6 +38,8 @@ library
, transformers >=0.4 && <0.6 , transformers >=0.4 && <0.6
exposed-modules: exposed-modules:
Postlude Postlude
Postlude.Lazy
Postlude.Strict
other-modules: other-modules:
Paths_postlude Paths_postlude
default-language: Haskell2010 default-language: Haskell2010

View File

@ -93,18 +93,6 @@ import Control.Monad.Trans.Reader as X
, ReaderT, ReaderT(ReaderT), runReaderT , ReaderT, ReaderT(ReaderT), runReaderT
) )
-- We default to the lazy implementation of State.
import Control.Monad.Trans.State as X
( State
, StateT, StateT(StateT), runStateT
)
-- We default to the lazy implementation of Writer.
import Control.Monad.Trans.Writer as X
( Writer
, WriterT, WriterT(WriterT), runWriterT
)
import Data.Bits as X import Data.Bits as X
( Bits ( Bits
, (.&.) , (.&.)
@ -139,10 +127,6 @@ import Data.Bool as X
, otherwise , otherwise
) )
import Data.ByteString.Lazy as X
( ByteString
)
import Data.Char as X import Data.Char as X
( Char ( Char
) )
@ -216,10 +200,6 @@ import Data.String as X
( String ( String
) )
import Data.Text.Lazy as X
( Text
)
import Data.Traversable as X import Data.Traversable as X
( Traversable, mapM, sequence, sequenceA, traverse ( Traversable, mapM, sequence, sequenceA, traverse
) )

21
src/Postlude/Lazy.hs Normal file
View File

@ -0,0 +1,21 @@
{-# LANGUAGE NoImplicitPrelude #-}
module Postlude.Lazy (module Lazy) where
import Control.Monad.Trans.State as Lazy
( State
, StateT, StateT(StateT), runStateT
)
import Control.Monad.Trans.Writer as Lazy
( Writer
, WriterT, WriterT(WriterT), runWriterT
)
import Data.ByteString.Lazy as Lazy
( ByteString
)
import Data.Text.Lazy as Lazy
( Text
)

21
src/Postlude/Strict.hs Normal file
View File

@ -0,0 +1,21 @@
{-# LANGUAGE NoImplicitPrelude #-}
module Postlude.Strict (module Strict) where
import Control.Monad.Trans.State.Strict as Strict
( State
, StateT, StateT(StateT), runStateT
)
import Control.Monad.Trans.Writer.Strict as Strict
( Writer
, WriterT, WriterT(WriterT), runWriterT
)
import Data.ByteString as Strict
( ByteString
)
import Data.Text as Strict
( Text
)