{-# LANGUAGE DeriveTraversable #-}
module Require.Types where
import Relude
newtype ModuleName = ModuleName { ModuleName -> Text
unModuleName :: Text }
deriving (ModuleName -> ModuleName -> Bool
(ModuleName -> ModuleName -> Bool)
-> (ModuleName -> ModuleName -> Bool) -> Eq ModuleName
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
/= :: ModuleName -> ModuleName -> Bool
$c/= :: ModuleName -> ModuleName -> Bool
== :: ModuleName -> ModuleName -> Bool
$c== :: ModuleName -> ModuleName -> Bool
Eq, Int -> ModuleName -> ShowS
[ModuleName] -> ShowS
ModuleName -> String
(Int -> ModuleName -> ShowS)
-> (ModuleName -> String)
-> ([ModuleName] -> ShowS)
-> Show ModuleName
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
showList :: [ModuleName] -> ShowS
$cshowList :: [ModuleName] -> ShowS
show :: ModuleName -> String
$cshow :: ModuleName -> String
showsPrec :: Int -> ModuleName -> ShowS
$cshowsPrec :: Int -> ModuleName -> ShowS
Show)
data RequireDirective
= ModuleDirective ModuleName
| RequireDirective RequireInfo
| AutorequireDirective
data RequireInfo
= RequireInfo
{ RequireInfo -> ModuleName
riFullModuleName :: !ModuleName,
RequireInfo -> Text
riModuleAlias :: !Text,
RequireInfo -> Text
riImportedTypes :: !Text
}
deriving (Int -> RequireInfo -> ShowS
[RequireInfo] -> ShowS
RequireInfo -> String
(Int -> RequireInfo -> ShowS)
-> (RequireInfo -> String)
-> ([RequireInfo] -> ShowS)
-> Show RequireInfo
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
showList :: [RequireInfo] -> ShowS
$cshowList :: [RequireInfo] -> ShowS
show :: RequireInfo -> String
$cshow :: RequireInfo -> String
showsPrec :: Int -> RequireInfo -> ShowS
$cshowsPrec :: Int -> RequireInfo -> ShowS
Show)
data AutorequireMode a
= AutorequireEnabled a
| AutorequireOnDirective (Maybe a)
| AutorequireDisabled
deriving (a -> AutorequireMode b -> AutorequireMode a
(a -> b) -> AutorequireMode a -> AutorequireMode b
(forall a b. (a -> b) -> AutorequireMode a -> AutorequireMode b)
-> (forall a b. a -> AutorequireMode b -> AutorequireMode a)
-> Functor AutorequireMode
forall a b. a -> AutorequireMode b -> AutorequireMode a
forall a b. (a -> b) -> AutorequireMode a -> AutorequireMode b
forall (f :: * -> *).
(forall a b. (a -> b) -> f a -> f b)
-> (forall a b. a -> f b -> f a) -> Functor f
<$ :: a -> AutorequireMode b -> AutorequireMode a
$c<$ :: forall a b. a -> AutorequireMode b -> AutorequireMode a
fmap :: (a -> b) -> AutorequireMode a -> AutorequireMode b
$cfmap :: forall a b. (a -> b) -> AutorequireMode a -> AutorequireMode b
Functor, AutorequireMode a -> Bool
(a -> m) -> AutorequireMode a -> m
(a -> b -> b) -> b -> AutorequireMode a -> b
(forall m. Monoid m => AutorequireMode m -> m)
-> (forall m a. Monoid m => (a -> m) -> AutorequireMode a -> m)
-> (forall m a. Monoid m => (a -> m) -> AutorequireMode a -> m)
-> (forall a b. (a -> b -> b) -> b -> AutorequireMode a -> b)
-> (forall a b. (a -> b -> b) -> b -> AutorequireMode a -> b)
-> (forall b a. (b -> a -> b) -> b -> AutorequireMode a -> b)
-> (forall b a. (b -> a -> b) -> b -> AutorequireMode a -> b)
-> (forall a. (a -> a -> a) -> AutorequireMode a -> a)
-> (forall a. (a -> a -> a) -> AutorequireMode a -> a)
-> (forall a. AutorequireMode a -> [a])
-> (forall a. AutorequireMode a -> Bool)
-> (forall a. AutorequireMode a -> Int)
-> (forall a. Eq a => a -> AutorequireMode a -> Bool)
-> (forall a. Ord a => AutorequireMode a -> a)
-> (forall a. Ord a => AutorequireMode a -> a)
-> (forall a. Num a => AutorequireMode a -> a)
-> (forall a. Num a => AutorequireMode a -> a)
-> Foldable AutorequireMode
forall a. Eq a => a -> AutorequireMode a -> Bool
forall a. Num a => AutorequireMode a -> a
forall a. Ord a => AutorequireMode a -> a
forall m. Monoid m => AutorequireMode m -> m
forall a. AutorequireMode a -> Bool
forall a. AutorequireMode a -> Int
forall a. AutorequireMode a -> [a]
forall a. (a -> a -> a) -> AutorequireMode a -> a
forall m a. Monoid m => (a -> m) -> AutorequireMode a -> m
forall b a. (b -> a -> b) -> b -> AutorequireMode a -> b
forall a b. (a -> b -> b) -> b -> AutorequireMode a -> b
forall (t :: * -> *).
(forall m. Monoid m => t m -> m)
-> (forall m a. Monoid m => (a -> m) -> t a -> m)
-> (forall m a. Monoid m => (a -> m) -> t a -> m)
-> (forall a b. (a -> b -> b) -> b -> t a -> b)
-> (forall a b. (a -> b -> b) -> b -> t a -> b)
-> (forall b a. (b -> a -> b) -> b -> t a -> b)
-> (forall b a. (b -> a -> b) -> b -> t a -> b)
-> (forall a. (a -> a -> a) -> t a -> a)
-> (forall a. (a -> a -> a) -> t a -> a)
-> (forall a. t a -> [a])
-> (forall a. t a -> Bool)
-> (forall a. t a -> Int)
-> (forall a. Eq a => a -> t a -> Bool)
-> (forall a. Ord a => t a -> a)
-> (forall a. Ord a => t a -> a)
-> (forall a. Num a => t a -> a)
-> (forall a. Num a => t a -> a)
-> Foldable t
product :: AutorequireMode a -> a
$cproduct :: forall a. Num a => AutorequireMode a -> a
sum :: AutorequireMode a -> a
$csum :: forall a. Num a => AutorequireMode a -> a
minimum :: AutorequireMode a -> a
$cminimum :: forall a. Ord a => AutorequireMode a -> a
maximum :: AutorequireMode a -> a
$cmaximum :: forall a. Ord a => AutorequireMode a -> a
elem :: a -> AutorequireMode a -> Bool
$celem :: forall a. Eq a => a -> AutorequireMode a -> Bool
length :: AutorequireMode a -> Int
$clength :: forall a. AutorequireMode a -> Int
null :: AutorequireMode a -> Bool
$cnull :: forall a. AutorequireMode a -> Bool
toList :: AutorequireMode a -> [a]
$ctoList :: forall a. AutorequireMode a -> [a]
foldl1 :: (a -> a -> a) -> AutorequireMode a -> a
$cfoldl1 :: forall a. (a -> a -> a) -> AutorequireMode a -> a
foldr1 :: (a -> a -> a) -> AutorequireMode a -> a
$cfoldr1 :: forall a. (a -> a -> a) -> AutorequireMode a -> a
foldl' :: (b -> a -> b) -> b -> AutorequireMode a -> b
$cfoldl' :: forall b a. (b -> a -> b) -> b -> AutorequireMode a -> b
foldl :: (b -> a -> b) -> b -> AutorequireMode a -> b
$cfoldl :: forall b a. (b -> a -> b) -> b -> AutorequireMode a -> b
foldr' :: (a -> b -> b) -> b -> AutorequireMode a -> b
$cfoldr' :: forall a b. (a -> b -> b) -> b -> AutorequireMode a -> b
foldr :: (a -> b -> b) -> b -> AutorequireMode a -> b
$cfoldr :: forall a b. (a -> b -> b) -> b -> AutorequireMode a -> b
foldMap' :: (a -> m) -> AutorequireMode a -> m
$cfoldMap' :: forall m a. Monoid m => (a -> m) -> AutorequireMode a -> m
foldMap :: (a -> m) -> AutorequireMode a -> m
$cfoldMap :: forall m a. Monoid m => (a -> m) -> AutorequireMode a -> m
fold :: AutorequireMode m -> m
$cfold :: forall m. Monoid m => AutorequireMode m -> m
Foldable, Functor AutorequireMode
Foldable AutorequireMode
Functor AutorequireMode
-> Foldable AutorequireMode
-> (forall (f :: * -> *) a b.
Applicative f =>
(a -> f b) -> AutorequireMode a -> f (AutorequireMode b))
-> (forall (f :: * -> *) a.
Applicative f =>
AutorequireMode (f a) -> f (AutorequireMode a))
-> (forall (m :: * -> *) a b.
Monad m =>
(a -> m b) -> AutorequireMode a -> m (AutorequireMode b))
-> (forall (m :: * -> *) a.
Monad m =>
AutorequireMode (m a) -> m (AutorequireMode a))
-> Traversable AutorequireMode
(a -> f b) -> AutorequireMode a -> f (AutorequireMode b)
forall (t :: * -> *).
Functor t
-> Foldable t
-> (forall (f :: * -> *) a b.
Applicative f =>
(a -> f b) -> t a -> f (t b))
-> (forall (f :: * -> *) a. Applicative f => t (f a) -> f (t a))
-> (forall (m :: * -> *) a b.
Monad m =>
(a -> m b) -> t a -> m (t b))
-> (forall (m :: * -> *) a. Monad m => t (m a) -> m (t a))
-> Traversable t
forall (m :: * -> *) a.
Monad m =>
AutorequireMode (m a) -> m (AutorequireMode a)
forall (f :: * -> *) a.
Applicative f =>
AutorequireMode (f a) -> f (AutorequireMode a)
forall (m :: * -> *) a b.
Monad m =>
(a -> m b) -> AutorequireMode a -> m (AutorequireMode b)
forall (f :: * -> *) a b.
Applicative f =>
(a -> f b) -> AutorequireMode a -> f (AutorequireMode b)
sequence :: AutorequireMode (m a) -> m (AutorequireMode a)
$csequence :: forall (m :: * -> *) a.
Monad m =>
AutorequireMode (m a) -> m (AutorequireMode a)
mapM :: (a -> m b) -> AutorequireMode a -> m (AutorequireMode b)
$cmapM :: forall (m :: * -> *) a b.
Monad m =>
(a -> m b) -> AutorequireMode a -> m (AutorequireMode b)
sequenceA :: AutorequireMode (f a) -> f (AutorequireMode a)
$csequenceA :: forall (f :: * -> *) a.
Applicative f =>
AutorequireMode (f a) -> f (AutorequireMode a)
traverse :: (a -> f b) -> AutorequireMode a -> f (AutorequireMode b)
$ctraverse :: forall (f :: * -> *) a b.
Applicative f =>
(a -> f b) -> AutorequireMode a -> f (AutorequireMode b)
$cp2Traversable :: Foldable AutorequireMode
$cp1Traversable :: Functor AutorequireMode
Traversable)