{-# LANGUAGE DeriveGeneric #-}
{-# LANGUAGE DeriveAnyClass #-}
{-# LANGUAGE OverloadedStrings #-}
module Cryptol.Utils.Ident
(
ModPath(..)
, apPathRoot
, modPathCommon
, modPathIsOrContains
, topModuleFor
, modPathSplit
, modPathIsNormal
, ModName
, modNameToText
, textToModName
, modNameChunks
, modNameChunksText
, packModName
, preludeName
, preludeReferenceName
, undefinedModName
, floatName
, suiteBName
, arrayName
, primeECName
, interactiveName
, noModuleName
, exprModName
, modNameArg
, modNameIfaceMod
, modNameToNormalModName
, modNameIsNormal
, Ident
, packIdent
, packInfix
, unpackIdent
, mkIdent
, mkInfix
, isInfixIdent
, nullIdent
, identText
, modParamIdent
, identAnonArg
, identAnonIfaceMod
, identIsNormal
, Namespace(..)
, allNamespaces
, OrigName(..)
, OrigSource(..)
, ogFromModParam
, PrimIdent(..)
, prelPrim
, floatPrim
, arrayPrim
, suiteBPrim
, primeECPrim
) where
import Control.DeepSeq (NFData)
import Data.Char (isSpace)
import Data.List (unfoldr)
import Data.Text (Text)
import qualified Data.Text as T
import Data.String (IsString(..))
import GHC.Generics (Generic)
import Cryptol.Utils.Panic(panic)
data Namespace = NSValue | NSType | NSModule
deriving (forall x. Rep Namespace x -> Namespace
forall x. Namespace -> Rep Namespace x
forall a.
(forall x. a -> Rep a x) -> (forall x. Rep a x -> a) -> Generic a
$cto :: forall x. Rep Namespace x -> Namespace
$cfrom :: forall x. Namespace -> Rep Namespace x
Generic,Int -> Namespace -> ShowS
[Namespace] -> ShowS
Namespace -> String
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
showList :: [Namespace] -> ShowS
$cshowList :: [Namespace] -> ShowS
show :: Namespace -> String
$cshow :: Namespace -> String
showsPrec :: Int -> Namespace -> ShowS
$cshowsPrec :: Int -> Namespace -> ShowS
Show,Namespace -> ()
forall a. (a -> ()) -> NFData a
rnf :: Namespace -> ()
$crnf :: Namespace -> ()
NFData,Namespace -> Namespace -> Bool
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
/= :: Namespace -> Namespace -> Bool
$c/= :: Namespace -> Namespace -> Bool
== :: Namespace -> Namespace -> Bool
$c== :: Namespace -> Namespace -> Bool
Eq,Eq Namespace
Namespace -> Namespace -> Bool
Namespace -> Namespace -> Ordering
Namespace -> Namespace -> Namespace
forall a.
Eq a
-> (a -> a -> Ordering)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> a)
-> (a -> a -> a)
-> Ord a
min :: Namespace -> Namespace -> Namespace
$cmin :: Namespace -> Namespace -> Namespace
max :: Namespace -> Namespace -> Namespace
$cmax :: Namespace -> Namespace -> Namespace
>= :: Namespace -> Namespace -> Bool
$c>= :: Namespace -> Namespace -> Bool
> :: Namespace -> Namespace -> Bool
$c> :: Namespace -> Namespace -> Bool
<= :: Namespace -> Namespace -> Bool
$c<= :: Namespace -> Namespace -> Bool
< :: Namespace -> Namespace -> Bool
$c< :: Namespace -> Namespace -> Bool
compare :: Namespace -> Namespace -> Ordering
$ccompare :: Namespace -> Namespace -> Ordering
Ord,Int -> Namespace
Namespace -> Int
Namespace -> [Namespace]
Namespace -> Namespace
Namespace -> Namespace -> [Namespace]
Namespace -> Namespace -> Namespace -> [Namespace]
forall a.
(a -> a)
-> (a -> a)
-> (Int -> a)
-> (a -> Int)
-> (a -> [a])
-> (a -> a -> [a])
-> (a -> a -> [a])
-> (a -> a -> a -> [a])
-> Enum a
enumFromThenTo :: Namespace -> Namespace -> Namespace -> [Namespace]
$cenumFromThenTo :: Namespace -> Namespace -> Namespace -> [Namespace]
enumFromTo :: Namespace -> Namespace -> [Namespace]
$cenumFromTo :: Namespace -> Namespace -> [Namespace]
enumFromThen :: Namespace -> Namespace -> [Namespace]
$cenumFromThen :: Namespace -> Namespace -> [Namespace]
enumFrom :: Namespace -> [Namespace]
$cenumFrom :: Namespace -> [Namespace]
fromEnum :: Namespace -> Int
$cfromEnum :: Namespace -> Int
toEnum :: Int -> Namespace
$ctoEnum :: Int -> Namespace
pred :: Namespace -> Namespace
$cpred :: Namespace -> Namespace
succ :: Namespace -> Namespace
$csucc :: Namespace -> Namespace
Enum,Namespace
forall a. a -> a -> Bounded a
maxBound :: Namespace
$cmaxBound :: Namespace
minBound :: Namespace
$cminBound :: Namespace
Bounded)
allNamespaces :: [Namespace]
allNamespaces :: [Namespace]
allNamespaces = [ forall a. Bounded a => a
minBound .. forall a. Bounded a => a
maxBound ]
data ModPath = TopModule ModName
| Nested ModPath Ident
deriving (ModPath -> ModPath -> Bool
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
/= :: ModPath -> ModPath -> Bool
$c/= :: ModPath -> ModPath -> Bool
== :: ModPath -> ModPath -> Bool
$c== :: ModPath -> ModPath -> Bool
Eq,Eq ModPath
ModPath -> ModPath -> Bool
ModPath -> ModPath -> Ordering
ModPath -> ModPath -> ModPath
forall a.
Eq a
-> (a -> a -> Ordering)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> a)
-> (a -> a -> a)
-> Ord a
min :: ModPath -> ModPath -> ModPath
$cmin :: ModPath -> ModPath -> ModPath
max :: ModPath -> ModPath -> ModPath
$cmax :: ModPath -> ModPath -> ModPath
>= :: ModPath -> ModPath -> Bool
$c>= :: ModPath -> ModPath -> Bool
> :: ModPath -> ModPath -> Bool
$c> :: ModPath -> ModPath -> Bool
<= :: ModPath -> ModPath -> Bool
$c<= :: ModPath -> ModPath -> Bool
< :: ModPath -> ModPath -> Bool
$c< :: ModPath -> ModPath -> Bool
compare :: ModPath -> ModPath -> Ordering
$ccompare :: ModPath -> ModPath -> Ordering
Ord,Int -> ModPath -> ShowS
[ModPath] -> ShowS
ModPath -> String
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
showList :: [ModPath] -> ShowS
$cshowList :: [ModPath] -> ShowS
show :: ModPath -> String
$cshow :: ModPath -> String
showsPrec :: Int -> ModPath -> ShowS
$cshowsPrec :: Int -> ModPath -> ShowS
Show,forall x. Rep ModPath x -> ModPath
forall x. ModPath -> Rep ModPath x
forall a.
(forall x. a -> Rep a x) -> (forall x. Rep a x -> a) -> Generic a
$cto :: forall x. Rep ModPath x -> ModPath
$cfrom :: forall x. ModPath -> Rep ModPath x
Generic,ModPath -> ()
forall a. (a -> ()) -> NFData a
rnf :: ModPath -> ()
$crnf :: ModPath -> ()
NFData)
apPathRoot :: (ModName -> ModName) -> ModPath -> ModPath
apPathRoot :: (ModName -> ModName) -> ModPath -> ModPath
apPathRoot ModName -> ModName
f ModPath
path =
case ModPath
path of
TopModule ModName
m -> ModName -> ModPath
TopModule (ModName -> ModName
f ModName
m)
Nested ModPath
p Ident
q -> ModPath -> Ident -> ModPath
Nested ((ModName -> ModName) -> ModPath -> ModPath
apPathRoot ModName -> ModName
f ModPath
p) Ident
q
topModuleFor :: ModPath -> ModName
topModuleFor :: ModPath -> ModName
topModuleFor ModPath
m =
case ModPath
m of
TopModule ModName
x -> ModName
x
Nested ModPath
p Ident
_ -> ModPath -> ModName
topModuleFor ModPath
p
modPathCommon :: ModPath -> ModPath -> Maybe (ModPath, [Ident], [Ident])
modPathCommon :: ModPath -> ModPath -> Maybe (ModPath, [Ident], [Ident])
modPathCommon ModPath
p1 ModPath
p2
| ModName
top1 forall a. Eq a => a -> a -> Bool
== ModName
top2 = forall a. a -> Maybe a
Just (ModPath -> [Ident] -> [Ident] -> (ModPath, [Ident], [Ident])
findCommon (ModName -> ModPath
TopModule ModName
top1) [Ident]
as [Ident]
bs)
| Bool
otherwise = forall a. Maybe a
Nothing
where
(ModName
top1,[Ident]
as) = ModPath -> (ModName, [Ident])
modPathSplit ModPath
p1
(ModName
top2,[Ident]
bs) = ModPath -> (ModName, [Ident])
modPathSplit ModPath
p2
findCommon :: ModPath -> [Ident] -> [Ident] -> (ModPath, [Ident], [Ident])
findCommon ModPath
com [Ident]
xs [Ident]
ys =
case ([Ident]
xs,[Ident]
ys) of
(Ident
x:[Ident]
xs',Ident
y:[Ident]
ys') | Ident
x forall a. Eq a => a -> a -> Bool
== Ident
y -> ModPath -> [Ident] -> [Ident] -> (ModPath, [Ident], [Ident])
findCommon (ModPath -> Ident -> ModPath
Nested ModPath
com Ident
x) [Ident]
xs' [Ident]
ys'
([Ident], [Ident])
_ -> (ModPath
com, [Ident]
xs, [Ident]
ys)
modPathIsOrContains :: ModPath -> ModPath -> Bool
modPathIsOrContains :: ModPath -> ModPath -> Bool
modPathIsOrContains ModPath
p1 ModPath
p2 =
case ModPath -> ModPath -> Maybe (ModPath, [Ident], [Ident])
modPathCommon ModPath
p1 ModPath
p2 of
Just (ModPath
_,[],[Ident]
_) -> Bool
True
Maybe (ModPath, [Ident], [Ident])
_ -> Bool
False
modPathSplit :: ModPath -> (ModName, [Ident])
modPathSplit :: ModPath -> (ModName, [Ident])
modPathSplit ModPath
p0 = (ModName
top,forall a. [a] -> [a]
reverse [Ident]
xs)
where
(ModName
top,[Ident]
xs) = ModPath -> (ModName, [Ident])
go ModPath
p0
go :: ModPath -> (ModName, [Ident])
go ModPath
p =
case ModPath
p of
TopModule ModName
a -> (ModName
a, [])
Nested ModPath
b Ident
i -> (ModName
a, Ident
iforall a. a -> [a] -> [a]
:[Ident]
bs)
where (ModName
a,[Ident]
bs) = ModPath -> (ModName, [Ident])
go ModPath
b
modPathIsNormal :: ModPath -> Bool
modPathIsNormal :: ModPath -> Bool
modPathIsNormal ModPath
p = ModName -> Bool
modNameIsNormal ModName
m Bool -> Bool -> Bool
&& forall (t :: * -> *) a. Foldable t => (a -> Bool) -> t a -> Bool
all Ident -> Bool
identIsNormal [Ident]
is
where (ModName
m,[Ident]
is) = ModPath -> (ModName, [Ident])
modPathSplit ModPath
p
data ModName = ModName Text MaybeAnon
deriving (ModName -> ModName -> Bool
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
/= :: ModName -> ModName -> Bool
$c/= :: ModName -> ModName -> Bool
== :: ModName -> ModName -> Bool
$c== :: ModName -> ModName -> Bool
Eq,Eq ModName
ModName -> ModName -> Bool
ModName -> ModName -> Ordering
ModName -> ModName -> ModName
forall a.
Eq a
-> (a -> a -> Ordering)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> a)
-> (a -> a -> a)
-> Ord a
min :: ModName -> ModName -> ModName
$cmin :: ModName -> ModName -> ModName
max :: ModName -> ModName -> ModName
$cmax :: ModName -> ModName -> ModName
>= :: ModName -> ModName -> Bool
$c>= :: ModName -> ModName -> Bool
> :: ModName -> ModName -> Bool
$c> :: ModName -> ModName -> Bool
<= :: ModName -> ModName -> Bool
$c<= :: ModName -> ModName -> Bool
< :: ModName -> ModName -> Bool
$c< :: ModName -> ModName -> Bool
compare :: ModName -> ModName -> Ordering
$ccompare :: ModName -> ModName -> Ordering
Ord,Int -> ModName -> ShowS
[ModName] -> ShowS
ModName -> String
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
showList :: [ModName] -> ShowS
$cshowList :: [ModName] -> ShowS
show :: ModName -> String
$cshow :: ModName -> String
showsPrec :: Int -> ModName -> ShowS
$cshowsPrec :: Int -> ModName -> ShowS
Show,forall x. Rep ModName x -> ModName
forall x. ModName -> Rep ModName x
forall a.
(forall x. a -> Rep a x) -> (forall x. Rep a x -> a) -> Generic a
$cto :: forall x. Rep ModName x -> ModName
$cfrom :: forall x. ModName -> Rep ModName x
Generic)
instance NFData ModName
modNameArg :: ModName -> ModName
modNameArg :: ModName -> ModName
modNameArg (ModName Text
m MaybeAnon
fl) =
case MaybeAnon
fl of
MaybeAnon
NormalName -> Text -> MaybeAnon -> ModName
ModName Text
m MaybeAnon
AnonModArgName
MaybeAnon
AnonModArgName -> forall a. HasCallStack => String -> [String] -> a
panic String
"modNameArg" [String
"Name is not normal"]
MaybeAnon
AnonIfaceModName -> forall a. HasCallStack => String -> [String] -> a
panic String
"modNameArg" [String
"Name is not normal"]
modNameIfaceMod :: ModName -> ModName
modNameIfaceMod :: ModName -> ModName
modNameIfaceMod (ModName Text
m MaybeAnon
fl) =
case MaybeAnon
fl of
MaybeAnon
NormalName -> Text -> MaybeAnon -> ModName
ModName Text
m MaybeAnon
AnonIfaceModName
MaybeAnon
AnonModArgName -> forall a. HasCallStack => String -> [String] -> a
panic String
"modNameIfaceMod" [String
"Name is not normal"]
MaybeAnon
AnonIfaceModName -> forall a. HasCallStack => String -> [String] -> a
panic String
"modNameIfaceMod" [String
"Name is not normal"]
modNameToNormalModName :: ModName -> ModName
modNameToNormalModName :: ModName -> ModName
modNameToNormalModName (ModName Text
t MaybeAnon
_) = Text -> MaybeAnon -> ModName
ModName Text
t MaybeAnon
NormalName
modNameToText :: ModName -> Text
modNameToText :: ModName -> Text
modNameToText (ModName Text
x MaybeAnon
fl) = MaybeAnon -> Text -> Text
maybeAnonText MaybeAnon
fl Text
x
modNameIsNormal :: ModName -> Bool
modNameIsNormal :: ModName -> Bool
modNameIsNormal (ModName Text
_ MaybeAnon
fl) = MaybeAnon -> Bool
isNormal MaybeAnon
fl
textToModName :: T.Text -> ModName
textToModName :: Text -> ModName
textToModName Text
txt = Text -> MaybeAnon -> ModName
ModName Text
txt MaybeAnon
NormalName
modNameChunksText :: ModName -> [T.Text]
modNameChunksText :: ModName -> [Text]
modNameChunksText (ModName Text
x MaybeAnon
fl) = forall b a. (b -> Maybe (a, b)) -> b -> [a]
unfoldr Text -> Maybe (Text, Text)
step Text
x
where
step :: Text -> Maybe (Text, Text)
step Text
str
| Text -> Bool
T.null Text
str = forall a. Maybe a
Nothing
| Bool
otherwise =
case Text -> Text -> (Text, Text)
T.breakOn Text
modSep Text
str of
(Text
a,Text
b)
| Text -> Bool
T.null Text
b -> forall a. a -> Maybe a
Just (MaybeAnon -> Text -> Text
maybeAnonText MaybeAnon
fl Text
str, Text
b)
| Bool
otherwise -> forall a. a -> Maybe a
Just (Text
a,Int -> Text -> Text
T.drop (Text -> Int
T.length Text
modSep) Text
b)
modNameChunks :: ModName -> [String]
modNameChunks :: ModName -> [String]
modNameChunks = forall a b. (a -> b) -> [a] -> [b]
map Text -> String
T.unpack forall b c a. (b -> c) -> (a -> b) -> a -> c
. ModName -> [Text]
modNameChunksText
packModName :: [T.Text] -> ModName
packModName :: [Text] -> ModName
packModName [Text]
strs = Text -> ModName
textToModName (Text -> [Text] -> Text
T.intercalate Text
modSep (forall a b. (a -> b) -> [a] -> [b]
map Text -> Text
trim [Text]
strs))
where
trim :: Text -> Text
trim Text
str = (Char -> Bool) -> Text -> Text
T.dropWhile Char -> Bool
isSpace ((Char -> Bool) -> Text -> Text
T.dropWhileEnd Char -> Bool
isSpace Text
str)
modSep :: T.Text
modSep :: Text
modSep = Text
"::"
preludeName :: ModName
preludeName :: ModName
preludeName = [Text] -> ModName
packModName [Text
"Cryptol"]
undefinedModName :: ModName
undefinedModName :: ModName
undefinedModName = [Text] -> ModName
packModName [Text
"Undefined module"]
preludeReferenceName :: ModName
preludeReferenceName :: ModName
preludeReferenceName = [Text] -> ModName
packModName [Text
"Cryptol",Text
"Reference"]
floatName :: ModName
floatName :: ModName
floatName = [Text] -> ModName
packModName [Text
"Float"]
arrayName :: ModName
arrayName :: ModName
arrayName = [Text] -> ModName
packModName [Text
"Array"]
suiteBName :: ModName
suiteBName :: ModName
suiteBName = [Text] -> ModName
packModName [Text
"SuiteB"]
primeECName :: ModName
primeECName :: ModName
primeECName = [Text] -> ModName
packModName [Text
"PrimeEC"]
interactiveName :: ModName
interactiveName :: ModName
interactiveName = [Text] -> ModName
packModName [Text
"<interactive>"]
noModuleName :: ModName
noModuleName :: ModName
noModuleName = [Text] -> ModName
packModName [Text
"<none>"]
exprModName :: ModName
exprModName :: ModName
exprModName = [Text] -> ModName
packModName [Text
"<expr>"]
data OrigName = OrigName
{ OrigName -> Namespace
ogNamespace :: Namespace
, OrigName -> ModPath
ogModule :: ModPath
, OrigName -> OrigSource
ogSource :: OrigSource
, OrigName -> Ident
ogName :: Ident
} deriving (OrigName -> OrigName -> Bool
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
/= :: OrigName -> OrigName -> Bool
$c/= :: OrigName -> OrigName -> Bool
== :: OrigName -> OrigName -> Bool
$c== :: OrigName -> OrigName -> Bool
Eq,Eq OrigName
OrigName -> OrigName -> Bool
OrigName -> OrigName -> Ordering
OrigName -> OrigName -> OrigName
forall a.
Eq a
-> (a -> a -> Ordering)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> a)
-> (a -> a -> a)
-> Ord a
min :: OrigName -> OrigName -> OrigName
$cmin :: OrigName -> OrigName -> OrigName
max :: OrigName -> OrigName -> OrigName
$cmax :: OrigName -> OrigName -> OrigName
>= :: OrigName -> OrigName -> Bool
$c>= :: OrigName -> OrigName -> Bool
> :: OrigName -> OrigName -> Bool
$c> :: OrigName -> OrigName -> Bool
<= :: OrigName -> OrigName -> Bool
$c<= :: OrigName -> OrigName -> Bool
< :: OrigName -> OrigName -> Bool
$c< :: OrigName -> OrigName -> Bool
compare :: OrigName -> OrigName -> Ordering
$ccompare :: OrigName -> OrigName -> Ordering
Ord,Int -> OrigName -> ShowS
[OrigName] -> ShowS
OrigName -> String
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
showList :: [OrigName] -> ShowS
$cshowList :: [OrigName] -> ShowS
show :: OrigName -> String
$cshow :: OrigName -> String
showsPrec :: Int -> OrigName -> ShowS
$cshowsPrec :: Int -> OrigName -> ShowS
Show,forall x. Rep OrigName x -> OrigName
forall x. OrigName -> Rep OrigName x
forall a.
(forall x. a -> Rep a x) -> (forall x. Rep a x -> a) -> Generic a
$cto :: forall x. Rep OrigName x -> OrigName
$cfrom :: forall x. OrigName -> Rep OrigName x
Generic,OrigName -> ()
forall a. (a -> ()) -> NFData a
rnf :: OrigName -> ()
$crnf :: OrigName -> ()
NFData)
data OrigSource =
FromDefinition
| FromFunctorInst
| FromModParam Ident
deriving (OrigSource -> OrigSource -> Bool
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
/= :: OrigSource -> OrigSource -> Bool
$c/= :: OrigSource -> OrigSource -> Bool
== :: OrigSource -> OrigSource -> Bool
$c== :: OrigSource -> OrigSource -> Bool
Eq,Eq OrigSource
OrigSource -> OrigSource -> Bool
OrigSource -> OrigSource -> Ordering
OrigSource -> OrigSource -> OrigSource
forall a.
Eq a
-> (a -> a -> Ordering)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> a)
-> (a -> a -> a)
-> Ord a
min :: OrigSource -> OrigSource -> OrigSource
$cmin :: OrigSource -> OrigSource -> OrigSource
max :: OrigSource -> OrigSource -> OrigSource
$cmax :: OrigSource -> OrigSource -> OrigSource
>= :: OrigSource -> OrigSource -> Bool
$c>= :: OrigSource -> OrigSource -> Bool
> :: OrigSource -> OrigSource -> Bool
$c> :: OrigSource -> OrigSource -> Bool
<= :: OrigSource -> OrigSource -> Bool
$c<= :: OrigSource -> OrigSource -> Bool
< :: OrigSource -> OrigSource -> Bool
$c< :: OrigSource -> OrigSource -> Bool
compare :: OrigSource -> OrigSource -> Ordering
$ccompare :: OrigSource -> OrigSource -> Ordering
Ord,Int -> OrigSource -> ShowS
[OrigSource] -> ShowS
OrigSource -> String
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
showList :: [OrigSource] -> ShowS
$cshowList :: [OrigSource] -> ShowS
show :: OrigSource -> String
$cshow :: OrigSource -> String
showsPrec :: Int -> OrigSource -> ShowS
$cshowsPrec :: Int -> OrigSource -> ShowS
Show,forall x. Rep OrigSource x -> OrigSource
forall x. OrigSource -> Rep OrigSource x
forall a.
(forall x. a -> Rep a x) -> (forall x. Rep a x -> a) -> Generic a
$cto :: forall x. Rep OrigSource x -> OrigSource
$cfrom :: forall x. OrigSource -> Rep OrigSource x
Generic,OrigSource -> ()
forall a. (a -> ()) -> NFData a
rnf :: OrigSource -> ()
$crnf :: OrigSource -> ()
NFData)
ogFromModParam :: OrigName -> Bool
ogFromModParam :: OrigName -> Bool
ogFromModParam OrigName
og = case OrigName -> OrigSource
ogSource OrigName
og of
FromModParam Ident
_ -> Bool
True
OrigSource
_ -> Bool
False
data Ident = Ident Bool MaybeAnon T.Text
deriving (Int -> Ident -> ShowS
[Ident] -> ShowS
Ident -> String
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
showList :: [Ident] -> ShowS
$cshowList :: [Ident] -> ShowS
show :: Ident -> String
$cshow :: Ident -> String
showsPrec :: Int -> Ident -> ShowS
$cshowsPrec :: Int -> Ident -> ShowS
Show,forall x. Rep Ident x -> Ident
forall x. Ident -> Rep Ident x
forall a.
(forall x. a -> Rep a x) -> (forall x. Rep a x -> a) -> Generic a
$cto :: forall x. Rep Ident x -> Ident
$cfrom :: forall x. Ident -> Rep Ident x
Generic)
instance Eq Ident where
Ident
a == :: Ident -> Ident -> Bool
== Ident
b = forall a. Ord a => a -> a -> Ordering
compare Ident
a Ident
b forall a. Eq a => a -> a -> Bool
== Ordering
EQ
Ident
a /= :: Ident -> Ident -> Bool
/= Ident
b = forall a. Ord a => a -> a -> Ordering
compare Ident
a Ident
b forall a. Eq a => a -> a -> Bool
/= Ordering
EQ
instance Ord Ident where
compare :: Ident -> Ident -> Ordering
compare (Ident Bool
_ MaybeAnon
mb1 Text
i1) (Ident Bool
_ MaybeAnon
mb2 Text
i2) = forall a. Ord a => a -> a -> Ordering
compare (MaybeAnon
mb1,Text
i1) (MaybeAnon
mb2,Text
i2)
instance IsString Ident where
fromString :: String -> Ident
fromString String
str = Text -> Ident
mkIdent (String -> Text
T.pack String
str)
instance NFData Ident
packIdent :: String -> Ident
packIdent :: String -> Ident
packIdent = Text -> Ident
mkIdent forall b c a. (b -> c) -> (a -> b) -> a -> c
. String -> Text
T.pack
packInfix :: String -> Ident
packInfix :: String -> Ident
packInfix = Text -> Ident
mkInfix forall b c a. (b -> c) -> (a -> b) -> a -> c
. String -> Text
T.pack
unpackIdent :: Ident -> String
unpackIdent :: Ident -> String
unpackIdent = Text -> String
T.unpack forall b c a. (b -> c) -> (a -> b) -> a -> c
. Ident -> Text
identText
mkIdent :: T.Text -> Ident
mkIdent :: Text -> Ident
mkIdent = Bool -> MaybeAnon -> Text -> Ident
Ident Bool
False MaybeAnon
NormalName
mkInfix :: T.Text -> Ident
mkInfix :: Text -> Ident
mkInfix = Bool -> MaybeAnon -> Text -> Ident
Ident Bool
True MaybeAnon
NormalName
isInfixIdent :: Ident -> Bool
isInfixIdent :: Ident -> Bool
isInfixIdent (Ident Bool
b MaybeAnon
_ Text
_) = Bool
b
nullIdent :: Ident -> Bool
nullIdent :: Ident -> Bool
nullIdent = Text -> Bool
T.null forall b c a. (b -> c) -> (a -> b) -> a -> c
. Ident -> Text
identText
identText :: Ident -> T.Text
identText :: Ident -> Text
identText (Ident Bool
_ MaybeAnon
mb Text
t) = MaybeAnon -> Text -> Text
maybeAnonText MaybeAnon
mb Text
t
modParamIdent :: Ident -> Ident
modParamIdent :: Ident -> Ident
modParamIdent (Ident Bool
x MaybeAnon
a Text
t) =
Bool -> MaybeAnon -> Text -> Ident
Ident Bool
x MaybeAnon
a (Text -> Text -> Text
T.append (String -> Text
T.pack String
"module parameter ") Text
t)
identAnonArg :: Ident -> Ident
identAnonArg :: Ident -> Ident
identAnonArg (Ident Bool
b MaybeAnon
_ Text
txt) = Bool -> MaybeAnon -> Text -> Ident
Ident Bool
b MaybeAnon
AnonModArgName Text
txt
identAnonIfaceMod :: Ident -> Ident
identAnonIfaceMod :: Ident -> Ident
identAnonIfaceMod (Ident Bool
b MaybeAnon
_ Text
txt) = Bool -> MaybeAnon -> Text -> Ident
Ident Bool
b MaybeAnon
AnonIfaceModName Text
txt
identIsNormal :: Ident -> Bool
identIsNormal :: Ident -> Bool
identIsNormal (Ident Bool
_ MaybeAnon
mb Text
_) = MaybeAnon -> Bool
isNormal MaybeAnon
mb
data MaybeAnon = NormalName
| AnonModArgName
| AnonIfaceModName
deriving (MaybeAnon -> MaybeAnon -> Bool
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
/= :: MaybeAnon -> MaybeAnon -> Bool
$c/= :: MaybeAnon -> MaybeAnon -> Bool
== :: MaybeAnon -> MaybeAnon -> Bool
$c== :: MaybeAnon -> MaybeAnon -> Bool
Eq,Eq MaybeAnon
MaybeAnon -> MaybeAnon -> Bool
MaybeAnon -> MaybeAnon -> Ordering
MaybeAnon -> MaybeAnon -> MaybeAnon
forall a.
Eq a
-> (a -> a -> Ordering)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> a)
-> (a -> a -> a)
-> Ord a
min :: MaybeAnon -> MaybeAnon -> MaybeAnon
$cmin :: MaybeAnon -> MaybeAnon -> MaybeAnon
max :: MaybeAnon -> MaybeAnon -> MaybeAnon
$cmax :: MaybeAnon -> MaybeAnon -> MaybeAnon
>= :: MaybeAnon -> MaybeAnon -> Bool
$c>= :: MaybeAnon -> MaybeAnon -> Bool
> :: MaybeAnon -> MaybeAnon -> Bool
$c> :: MaybeAnon -> MaybeAnon -> Bool
<= :: MaybeAnon -> MaybeAnon -> Bool
$c<= :: MaybeAnon -> MaybeAnon -> Bool
< :: MaybeAnon -> MaybeAnon -> Bool
$c< :: MaybeAnon -> MaybeAnon -> Bool
compare :: MaybeAnon -> MaybeAnon -> Ordering
$ccompare :: MaybeAnon -> MaybeAnon -> Ordering
Ord,Int -> MaybeAnon -> ShowS
[MaybeAnon] -> ShowS
MaybeAnon -> String
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
showList :: [MaybeAnon] -> ShowS
$cshowList :: [MaybeAnon] -> ShowS
show :: MaybeAnon -> String
$cshow :: MaybeAnon -> String
showsPrec :: Int -> MaybeAnon -> ShowS
$cshowsPrec :: Int -> MaybeAnon -> ShowS
Show,forall x. Rep MaybeAnon x -> MaybeAnon
forall x. MaybeAnon -> Rep MaybeAnon x
forall a.
(forall x. a -> Rep a x) -> (forall x. Rep a x -> a) -> Generic a
$cto :: forall x. Rep MaybeAnon x -> MaybeAnon
$cfrom :: forall x. MaybeAnon -> Rep MaybeAnon x
Generic)
instance NFData MaybeAnon
maybeAnonText :: MaybeAnon -> Text -> Text
maybeAnonText :: MaybeAnon -> Text -> Text
maybeAnonText MaybeAnon
mb Text
txt =
case MaybeAnon
mb of
MaybeAnon
NormalName -> Text
txt
MaybeAnon
AnonModArgName -> Text
"`where` argument of " forall a. Semigroup a => a -> a -> a
<> Text
txt
MaybeAnon
AnonIfaceModName -> Text
"`parameter` interface of " forall a. Semigroup a => a -> a -> a
<> Text
txt
isNormal :: MaybeAnon -> Bool
isNormal :: MaybeAnon -> Bool
isNormal MaybeAnon
mb =
case MaybeAnon
mb of
MaybeAnon
NormalName -> Bool
True
MaybeAnon
_ -> Bool
False
data PrimIdent = PrimIdent ModName T.Text
deriving (PrimIdent -> PrimIdent -> Bool
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
/= :: PrimIdent -> PrimIdent -> Bool
$c/= :: PrimIdent -> PrimIdent -> Bool
== :: PrimIdent -> PrimIdent -> Bool
$c== :: PrimIdent -> PrimIdent -> Bool
Eq,Eq PrimIdent
PrimIdent -> PrimIdent -> Bool
PrimIdent -> PrimIdent -> Ordering
PrimIdent -> PrimIdent -> PrimIdent
forall a.
Eq a
-> (a -> a -> Ordering)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> a)
-> (a -> a -> a)
-> Ord a
min :: PrimIdent -> PrimIdent -> PrimIdent
$cmin :: PrimIdent -> PrimIdent -> PrimIdent
max :: PrimIdent -> PrimIdent -> PrimIdent
$cmax :: PrimIdent -> PrimIdent -> PrimIdent
>= :: PrimIdent -> PrimIdent -> Bool
$c>= :: PrimIdent -> PrimIdent -> Bool
> :: PrimIdent -> PrimIdent -> Bool
$c> :: PrimIdent -> PrimIdent -> Bool
<= :: PrimIdent -> PrimIdent -> Bool
$c<= :: PrimIdent -> PrimIdent -> Bool
< :: PrimIdent -> PrimIdent -> Bool
$c< :: PrimIdent -> PrimIdent -> Bool
compare :: PrimIdent -> PrimIdent -> Ordering
$ccompare :: PrimIdent -> PrimIdent -> Ordering
Ord,Int -> PrimIdent -> ShowS
[PrimIdent] -> ShowS
PrimIdent -> String
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
showList :: [PrimIdent] -> ShowS
$cshowList :: [PrimIdent] -> ShowS
show :: PrimIdent -> String
$cshow :: PrimIdent -> String
showsPrec :: Int -> PrimIdent -> ShowS
$cshowsPrec :: Int -> PrimIdent -> ShowS
Show,forall x. Rep PrimIdent x -> PrimIdent
forall x. PrimIdent -> Rep PrimIdent x
forall a.
(forall x. a -> Rep a x) -> (forall x. Rep a x -> a) -> Generic a
$cto :: forall x. Rep PrimIdent x -> PrimIdent
$cfrom :: forall x. PrimIdent -> Rep PrimIdent x
Generic)
prelPrim :: T.Text -> PrimIdent
prelPrim :: Text -> PrimIdent
prelPrim = ModName -> Text -> PrimIdent
PrimIdent ModName
preludeName
floatPrim :: T.Text -> PrimIdent
floatPrim :: Text -> PrimIdent
floatPrim = ModName -> Text -> PrimIdent
PrimIdent ModName
floatName
suiteBPrim :: T.Text -> PrimIdent
suiteBPrim :: Text -> PrimIdent
suiteBPrim = ModName -> Text -> PrimIdent
PrimIdent ModName
suiteBName
primeECPrim :: T.Text -> PrimIdent
primeECPrim :: Text -> PrimIdent
primeECPrim = ModName -> Text -> PrimIdent
PrimIdent ModName
primeECName
arrayPrim :: T.Text -> PrimIdent
arrayPrim :: Text -> PrimIdent
arrayPrim = ModName -> Text -> PrimIdent
PrimIdent ModName
arrayName
instance NFData PrimIdent