{-# LANGUAGE CPP #-} -------------------------------------------------- {-# LANGUAGE NoImplicitPrelude #-} {-# LANGUAGE PackageImports #-} -------------------------------------------------- -------------------------------------------------- {-| Module : Prelude.Spiros.Reexports Stability : experimental Portability : non-portable (multi-param classes, functional dependencies) (Re-)Exports: * universally (or frequently) derived classes, i.e. @deriving (...,'Data','Generic','NFData','Semigroup')@ * @safe-exceptions@'s @'throw'@, which generalizes @IO@ to 'MonadThrow' * @safe@ (total) versions of partial functions, like 'readMay'. * 'assert' * and many more (see the source) Defines: * single-character composition, i.e. ('>') an ('<') * type names for common types ('LazyText' for lazy text, 'StrictBytes' for strict bytestrings, etc) Hides: * partial functions, e.g. @head@ * some aliased functions (like @sequence@, which is generalized into @sequenceA@). Also see (these aren't dependencies, just influences): * * * -} -------------------------------------------------- -------------------------------------------------- module Prelude.Spiros.Reexports ( module X -- MNEMONIC: re-eXports , module Base , module Prelude.Spiros.Compatibility ) where -------------------------------------------------- #include -------------------------------------------------- -------------------------------------------------- import Prelude.Spiros.Types import Prelude.Spiros.Compatibility -------------------------------------------------- -- Imports --------------------------------------- -------------------------------------------------- import "generic-deriving" Generics.Deriving.Enum as X ( GEnum(genum) , GIx ) -------------------------------------------------- import "safe" Safe as X -------------------------------------------------- import "exceptions" Control.Monad.Catch as X ( MonadThrow(..) ) -------------------------------------------------- import "data-default-class" Data.Default.Class as X ( Default(..) ) -------------------------------------------------- import "semigroups" Data.Semigroup.Generic as X ( gmappend, gmempty ) --------------------------------------- -- https://www.fpcomplete.com/blog/2016/06/announce-safe-exceptions --import "safe-exceptions" Control.Exception.Safe as X -- TODO mv so module, like Spiros.Exceptions? --import "exceptions" Control.Monad.Catch as X (MonadThrow(..)) -------------------------------------------------- -- import "unordered-containers" Data.HashSet as X (HashSet) -- import "unordered-containers" Data.HashMap.Strict as X (HashMap) -- import "protolude" Protolude as X import "string-conv" Data.String.Conv as X ( StringConv (..) , Leniency (..) , toS , toSL , convS , convSL ) -------------------------------------------------- -- imports from the "standard library"... -- (i.e. the libraries GHC bootstraps with, and thus are always available) -------------------------------------------------- -------------------------------------------------- -- `deepseq` -------------------------------------------------- import "deepseq" Control.DeepSeq as X ( NFData(..) , force ) -------------------------------------------------- -- `hashable` -------------------------------------------------- import "hashable" Data.Hashable as X (Hashable(..)) import "hashable" Data.Hashable as X (hashUsing) -------------------------------------------------- -- `text` -------------------------------------------------- import "text" Data.Text as X (Text) -- strict -------------------------------------------------- -- `bytestring` -------------------------------------------------- import "bytestring" Data.ByteString as X (ByteString) -- strict -------------------------------------------------- -- `transformers` -------------------------------------------------- import "transformers" Control.Monad.Trans.Class as X (MonadTrans(..)) -------------------------------------------------- -- `mtl` -------------------------------------------------- --import "mtl" Control.Monad.Trans as X (MonadTrans(..)) import "mtl" Control.Monad.Reader as X ( MonadReader(..), asks, Reader, runReader, mapReader, withReader, ReaderT(ReaderT), runReaderT, mapReaderT, withReaderT, ) import "mtl" Control.Monad.State as X ( MonadState(..), modify, modify', gets, State, runState, evalState, execState, mapState, withState, StateT(StateT), runStateT, evalStateT, execStateT, mapStateT, withStateT, ) import "mtl" Control.Monad.Except as X ( MonadError(..), ExceptT(ExceptT), Except, runExceptT, mapExceptT, withExceptT, runExcept, mapExcept, withExcept, ) -- import "mtl" Control.Monad.Writer.Strict as X -------------------------------------------------- -- `containers` -------------------------------------------------- import "containers" Data.Set as X (Set) import "containers" Data.Map as X (Map) import "containers" Data.Sequence as X (Seq) import "containers" Data.IntSet as X (IntSet) import "containers" Data.IntMap as X (IntMap) import "containers" Data.Graph as X (Graph) import "containers" Data.Tree as X (Tree) -------------------------------------------------- -- `template-haskell` -------------------------------------------------- import "template-haskell" Language.Haskell.TH.Syntax as X (Lift) -- import "template-haskell" Language.Haskell.TH.Syntax as X -------------------------------------------------- -- `base` -------------------------------------------------- --import "base" Control.Exception as X (evaluate) import "base" Data.Int as X ( Int , Int8, Int16, Int32, Int64 ) import "base" Data.Word as X ( Word , Word8, Word16, Word32, Word64 ) import "base" Data.Void as X ( Void , absurd ) import "base" Data.Char as X ( Char , isControl, isSpace , isLower, isUpper, isAlpha, isAlphaNum, isPrint , isDigit, isOctDigit, isHexDigit , isLetter, isMark, isNumber, isPunctuation, isSymbol, isSeparator , isAscii, isLatin1 , isAsciiUpper, isAsciiLower , generalCategory , toUpper, toLower, toTitle , digitToInt , intToDigit , ord , chr ) import "base" Numeric.Natural as X (Natural) import "base" Data.Ratio as X (Ratio) import "base" Data.Maybe as X import "base" Data.Either as X import "base" Data.Function as X ((&),on,fix) import "base" Text.Read as X ( readEither,readMaybe ) import "base" Data.Ix as X ( Ix ) import "base" Data.Bits as X ( Bits , FiniteBits ) import "base" Data.Foldable as X ( traverse_ , for_ , sequenceA_ , asum ) import "base" Data.Traversable as X ( sequenceA ) import "base" Control.Applicative as X import "base" Control.Arrow as X ( (&&&) , (***) , (+++) , (|||) ) import "base" Control.Monad as X ( MonadPlus(..) , void , forever , (>=>), (<=<) , join , guard, when, unless ) import "base" Control.Category as X (Category,(>>>),(<<<)) import "base" Control.Monad.Fix as X (MonadFix(..)) --import "base" Text.Printf as X (printf) import "base" Data.Proxy as X (Proxy(..)) import "base" Data.Functor.Identity as X (Identity(..)) import "base" Data.Coerce as X (coerce, Coercible) import "base" Data.Typeable as X ( Typeable , typeRep ) import "base" Data.Data as X (Data) import "base" Control.Exception as X (assert) -------------------------------------------------- -- Imports: CPP ---------------------------------- -------------------------------------------------- #if HAS_BASE_Semigroup import "base" Data.Semigroup as X (Semigroup(..)) #endif -------------------------------------------------- #if HAS_BASE_NonEmpty import "base" Data.List.NonEmpty as X ( NonEmpty(..) -- unqualified smart constructor , nonEmpty -- safe versions , head, tail, last, init , some1, scanl1, scanr1, group1, groupBy1 ) #endif -------------------------------------------------- #if HAS_BASE_Bifunctor import Data.Bifunctor as X #else #endif -------------------------------------------------- #if HAS_BASE_Bifoldable_Bitraversable import Data.Bifoldable as X import Data.Bitraversable as X #else #endif -------------------------------------------------- #if !HAS_PRELUDE_Monoid import Data.Functor as X ((<$>)) import Data.Monoid as X (Monoid(..)) #endif -------------------------------------------------- #if HAS_BASE_Contravariant import "base" Data.Functor.Contravariant as X ( Contravariant(..) , Predicate(..) , Comparison(..) , Equivalence(..) , Op(..) , defaultComparison , defaultEquivalence ) #endif -------------------------------------------------- -- `hashable` package... import "hashable" Data.Hashable as X (Hashable(..)) import "hashable" Data.Hashable as X (hashUsing) #if HAS_HASHABLE_Hashable1 import "hashable" Data.Hashable.Lifted as X (Hashable1(..)) #endif #if HAS_HASHABLE_Hashable2 import "hashable" Data.Hashable.Lifted as X (Hashable2(..)) #endif -------------------------------------------------- -- `deepseq` package... import "deepseq" Control.DeepSeq as X (NFData(..)) #if HAS_DEEPSEQ_NFData1 import "deepseq" Control.DeepSeq as X (NFData1(..)) import "deepseq" Control.DeepSeq as X (rnf1) #endif #if HAS_DEEPSEQ_NFData2 import "deepseq" Control.DeepSeq as X (NFData2(..)) import "deepseq" Control.DeepSeq as X (rnf2) #endif -------------------------------------------------- -- `ghc` compiler... #if IS_COMPILER_ghc import "base" GHC.Exts as X ( IsList(..) , IsString(..) , groupWith, sortWith ) import "base" GHC.Generics as X ( Generic , Generic1 ) #endif -------------------------------------------------- --TODO #if !HAS_BASE_Foldable_TRAVERSABLE -- import Data.Foldable (Foldable (..)) -- import Prelude hiding (foldr, foldr1) -- #endif -- --TODO #if !HAS_PRELUDE_Monoid -- import Data.Monoid as X hiding ((<>)) -- #endif -------------------------------------------------- -- the Prelude import Data.List as Base hiding -- partials ( (!!) , find , minimumBy, maximumBy , scanl1, scanr1 , head, tail, last, init -- aliased , map ) import Prelude as Base hiding ( (<), (>) -- aliased , map, sequence, sequence_ -- deprecated , fail -- partials , error, undefined , minimum, maximum , scanl1, scanr1 , head, tail, last, init , foldr1 , foldl1 , foldl1 , read , toEnum ) -------------------------------------------------- --------------------------------------------------