{-# LANGUAGE CPP #-}
module Test.Hspec.Core.Compat (
module Imports
, module Test.Hspec.Core.Compat
) where
import Control.Exception as Imports
import Control.Arrow as Imports ((>>>), (&&&), first, second)
import Control.Applicative as Imports
import Control.Monad as Imports hiding (
mapM
, mapM_
, forM
, forM_
, msum
, sequence
, sequence_
)
import Data.Maybe as Imports
import Data.Foldable as Imports
import Data.CallStack as Imports (HasCallStack)
import System.IO
import System.Exit
import System.Environment
#if MIN_VERSION_base(4,11,0)
import Data.Functor as Imports ((<&>))
#endif
import Data.Traversable as Imports
import Data.Monoid as Imports
import Data.List as Imports (
stripPrefix
, isPrefixOf
, isInfixOf
, isSuffixOf
, intercalate
, inits
, tails
, sortBy
, sortOn
)
import Prelude as Imports hiding (
all
, and
, any
, concat
, concatMap
, elem
, foldl
, foldl1
, foldr
, foldr1
, mapM
, mapM_
, maximum
, minimum
, notElem
, or
, product
, sequence
, sequence_
, sum
)
import Data.Typeable (Typeable, typeOf, typeRepTyCon, tyConModule, tyConName)
import Data.IORef as Imports
#if MIN_VERSION_base(4,12,0)
import GHC.ResponseFile as Imports (unescapeArgs)
#else
import Data.Char
#endif
#if MIN_VERSION_base(4,6,0)
import Text.Read as Imports (readMaybe)
import System.Environment as Imports (lookupEnv)
#else
import Text.Read
import qualified Text.ParserCombinators.ReadP as P
#endif
#if !MIN_VERSION_base(4,8,0)
import Data.Ord (comparing)
#endif
#if MIN_VERSION_base(4,7,0)
import Data.Bool as Imports (bool)
#endif
import Control.Concurrent
#if !MIN_VERSION_base(4,9,0)
import GHC.IO
#endif
#if !MIN_VERSION_base(4,6,0)
forkFinally :: IO a -> (Either SomeException a -> IO ()) -> IO ThreadId
forkFinally action and_then =
mask $ \restore ->
forkIO $ try (restore action) >>= and_then
modifyIORef' :: IORef a -> (a -> a) -> IO ()
modifyIORef' ref f = do
x <- readIORef ref
let x' = f x
x' `seq` writeIORef ref x'
atomicWriteIORef :: IORef a -> a -> IO ()
atomicWriteIORef ref a = do
x <- atomicModifyIORef ref (\_ -> (a, ()))
x `seq` pass
readEither :: Read a => String -> Either String a
readEither s =
case [ x | (x,"") <- readPrec_to_S read' minPrec s ] of
[x] -> Right x
[] -> Left "Prelude.read: no parse"
_ -> Left "Prelude.read: ambiguous parse"
where
read' =
do x <- readPrec
lift P.skipSpaces
return x
readMaybe :: Read a => String -> Maybe a
readMaybe s = case readEither s of
Left _ -> Nothing
Right a -> Just a
lookupEnv :: String -> IO (Maybe String)
lookupEnv k = lookup k `fmap` getEnvironment
#endif
showType :: Typeable a => a -> String
showType :: forall a. Typeable a => a -> String
showType a
a = let t :: TyCon
t = TypeRep -> TyCon
typeRepTyCon (forall a. Typeable a => a -> TypeRep
typeOf a
a) in
forall a. Show a => a -> String
show TyCon
t
showFullType :: Typeable a => a -> String
showFullType :: forall a. Typeable a => a -> String
showFullType a
a = let t :: TyCon
t = TypeRep -> TyCon
typeRepTyCon (forall a. Typeable a => a -> TypeRep
typeOf a
a) in
TyCon -> String
tyConModule TyCon
t forall a. [a] -> [a] -> [a]
++ String
"." forall a. [a] -> [a] -> [a]
++ TyCon -> String
tyConName TyCon
t
getDefaultConcurrentJobs :: IO Int
getDefaultConcurrentJobs :: IO Int
getDefaultConcurrentJobs = IO Int
getNumCapabilities
#if !MIN_VERSION_base(4,9,0)
interruptible :: IO a -> IO a
interruptible act = do
st <- getMaskingState
case st of
Unmasked -> act
MaskedInterruptible -> unsafeUnmask act
MaskedUninterruptible -> act
#endif
guarded :: Alternative m => (a -> Bool) -> a -> m a
guarded :: forall (m :: * -> *) a. Alternative m => (a -> Bool) -> a -> m a
guarded a -> Bool
p a
a = if a -> Bool
p a
a then forall (f :: * -> *) a. Applicative f => a -> f a
pure a
a else forall (f :: * -> *) a. Alternative f => f a
empty
#if !MIN_VERSION_base(4,11,0)
infixl 1 <&>
(<&>) :: Functor f => f a -> (a -> b) -> f b
(<&>) = flip (<$>)
#endif
endsWith :: Eq a => [a] -> [a] -> Bool
endsWith :: forall a. Eq a => [a] -> [a] -> Bool
endsWith = forall a b c. (a -> b -> c) -> b -> a -> c
flip forall a. Eq a => [a] -> [a] -> Bool
isSuffixOf
pass :: Applicative m => m ()
pass :: forall (m :: * -> *). Applicative m => m ()
pass = forall (f :: * -> *) a. Applicative f => a -> f a
pure ()
die :: String -> IO a
die :: forall a. String -> IO a
die String
err = do
String
name <- IO String
getProgName
Handle -> String -> IO ()
hPutStrLn Handle
stderr forall a b. (a -> b) -> a -> b
$ String
name forall a. Semigroup a => a -> a -> a
<> String
": " forall a. Semigroup a => a -> a -> a
<> String
err
forall a. IO a
exitFailure
#if !MIN_VERSION_base(4,12,0)
unescapeArgs :: String -> [String]
unescapeArgs = filter (not . null) . unescape
data Quoting = NoneQ | SngQ | DblQ
unescape :: String -> [String]
unescape args = reverse . map reverse $ go args NoneQ False [] []
where
go [] _q _bs a as = a:as
go (c:cs) q True a as = go cs q False (c:a) as
go (c:cs) q False a as
| '\\' == c = go cs q True a as
go (c:cs) SngQ False a as
| '\'' == c = go cs NoneQ False a as
| otherwise = go cs SngQ False (c:a) as
go (c:cs) DblQ False a as
| '"' == c = go cs NoneQ False a as
| otherwise = go cs DblQ False (c:a) as
go (c:cs) NoneQ False a as
| isSpace c = go cs NoneQ False [] (a:as)
| '\'' == c = go cs SngQ False a as
| '"' == c = go cs DblQ False a as
| otherwise = go cs NoneQ False (c:a) as
#endif