{- | Supporting code for handling Fortran BOZ literal constants.

Using the definition from the latest Fortran standards (F2003, F2008), BOZ
constants are bitstrings (untyped!) which have basically no implicit rules. How
they're interpreted depends on context (they are generally limited to DATA
statements and a small handful of intrinsic functions).

Note that currently, we don't store BOZ constants as bitstrings. Storing them in
their string representation is easy and in that form, they're easy to safely
resolve to an integer. An alternate option would be to store them as the
bitstring "B" of BOZ, and only implement functions on that. For simple uses
(integer), I'm doubtful that would provide extra utility or performance, but it
may be more sensible in the future. For now, you may retrieve a bitstring by
converting to a numeric type and using something like 'showIntAtBase', or a
'Bits' instance.

This type carries _some_ syntactic information that doesn't change meaning. The
expectation is that most users won't want to inspect 'Boz' values, usually just
convert them, so we do it for convenience for checking syntax conformance. Note
that not all info is retained -- which of single or double quotes were used is
not recorded, for example.
-}

module Language.Fortran.AST.Literal.Boz where

import           GHC.Generics
import           Data.Data
import           Control.DeepSeq                ( NFData )
import           Text.PrettyPrint.GenericPretty ( Out )

import qualified Data.List as List
import qualified Data.Char as Char
import qualified Numeric   as Num

import           Data.Bits

-- | A Fortran BOZ literal constant.
--
-- The prefix defines the characters allowed in the string:
--
--   * @B@: @[01]@
--   * @O@: @[0-7]@
--   * @Z@: @[0-9 a-f A-F]@
data Boz = Boz
  { Boz -> BozPrefix
bozPrefix :: BozPrefix
  , Boz -> String
bozString :: String

  , Boz -> Conforming
bozPrefixWasPostfix :: Conforming
  -- ^ Was the prefix actually postfix i.e. @'123'z@? This is non-standard
  --   syntax, disabled by default in gfortran. Syntactic info.
  } deriving stock    (Int -> Boz -> ShowS
[Boz] -> ShowS
Boz -> String
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
showList :: [Boz] -> ShowS
$cshowList :: [Boz] -> ShowS
show :: Boz -> String
$cshow :: Boz -> String
showsPrec :: Int -> Boz -> ShowS
$cshowsPrec :: Int -> Boz -> ShowS
Show, forall x. Rep Boz x -> Boz
forall x. Boz -> Rep Boz x
forall a.
(forall x. a -> Rep a x) -> (forall x. Rep a x -> a) -> Generic a
$cto :: forall x. Rep Boz x -> Boz
$cfrom :: forall x. Boz -> Rep Boz x
Generic, Typeable Boz
Boz -> DataType
Boz -> Constr
(forall b. Data b => b -> b) -> Boz -> Boz
forall a.
Typeable a
-> (forall (c :: * -> *).
    (forall d b. Data d => c (d -> b) -> d -> c b)
    -> (forall g. g -> c g) -> a -> c a)
-> (forall (c :: * -> *).
    (forall b r. Data b => c (b -> r) -> c r)
    -> (forall r. r -> c r) -> Constr -> c a)
-> (a -> Constr)
-> (a -> DataType)
-> (forall (t :: * -> *) (c :: * -> *).
    Typeable t =>
    (forall d. Data d => c (t d)) -> Maybe (c a))
-> (forall (t :: * -> * -> *) (c :: * -> *).
    Typeable t =>
    (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c a))
-> ((forall b. Data b => b -> b) -> a -> a)
-> (forall r r'.
    (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> a -> r)
-> (forall r r'.
    (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> a -> r)
-> (forall u. (forall d. Data d => d -> u) -> a -> [u])
-> (forall u. Int -> (forall d. Data d => d -> u) -> a -> u)
-> (forall (m :: * -> *).
    Monad m =>
    (forall d. Data d => d -> m d) -> a -> m a)
-> (forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> a -> m a)
-> (forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> a -> m a)
-> Data a
forall u. Int -> (forall d. Data d => d -> u) -> Boz -> u
forall u. (forall d. Data d => d -> u) -> Boz -> [u]
forall r r'.
(r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Boz -> r
forall r r'.
(r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Boz -> r
forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> Boz -> m Boz
forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Boz -> m Boz
forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c Boz
forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Boz -> c Boz
forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c Boz)
forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Boz)
gmapMo :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Boz -> m Boz
$cgmapMo :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Boz -> m Boz
gmapMp :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Boz -> m Boz
$cgmapMp :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Boz -> m Boz
gmapM :: forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> Boz -> m Boz
$cgmapM :: forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> Boz -> m Boz
gmapQi :: forall u. Int -> (forall d. Data d => d -> u) -> Boz -> u
$cgmapQi :: forall u. Int -> (forall d. Data d => d -> u) -> Boz -> u
gmapQ :: forall u. (forall d. Data d => d -> u) -> Boz -> [u]
$cgmapQ :: forall u. (forall d. Data d => d -> u) -> Boz -> [u]
gmapQr :: forall r r'.
(r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Boz -> r
$cgmapQr :: forall r r'.
(r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Boz -> r
gmapQl :: forall r r'.
(r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Boz -> r
$cgmapQl :: forall r r'.
(r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Boz -> r
gmapT :: (forall b. Data b => b -> b) -> Boz -> Boz
$cgmapT :: (forall b. Data b => b -> b) -> Boz -> Boz
dataCast2 :: forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Boz)
$cdataCast2 :: forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Boz)
dataCast1 :: forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c Boz)
$cdataCast1 :: forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c Boz)
dataTypeOf :: Boz -> DataType
$cdataTypeOf :: Boz -> DataType
toConstr :: Boz -> Constr
$ctoConstr :: Boz -> Constr
gunfold :: forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c Boz
$cgunfold :: forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c Boz
gfoldl :: forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Boz -> c Boz
$cgfoldl :: forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Boz -> c Boz
Data, Typeable, Eq Boz
Boz -> Boz -> Bool
Boz -> Boz -> Ordering
Boz -> Boz -> Boz
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 :: Boz -> Boz -> Boz
$cmin :: Boz -> Boz -> Boz
max :: Boz -> Boz -> Boz
$cmax :: Boz -> Boz -> Boz
>= :: Boz -> Boz -> Bool
$c>= :: Boz -> Boz -> Bool
> :: Boz -> Boz -> Bool
$c> :: Boz -> Boz -> Bool
<= :: Boz -> Boz -> Bool
$c<= :: Boz -> Boz -> Bool
< :: Boz -> Boz -> Bool
$c< :: Boz -> Boz -> Bool
compare :: Boz -> Boz -> Ordering
$ccompare :: Boz -> Boz -> Ordering
Ord)
    deriving anyclass (Boz -> ()
forall a. (a -> ()) -> NFData a
rnf :: Boz -> ()
$crnf :: Boz -> ()
NFData, Int -> Boz -> Doc
[Boz] -> Doc
Boz -> Doc
forall a. (Int -> a -> Doc) -> (a -> Doc) -> ([a] -> Doc) -> Out a
docList :: [Boz] -> Doc
$cdocList :: [Boz] -> Doc
doc :: Boz -> Doc
$cdoc :: Boz -> Doc
docPrec :: Int -> Boz -> Doc
$cdocPrec :: Int -> Boz -> Doc
Out)

-- | Tests prefix & strings match, ignoring conforming/nonconforming flags.
instance Eq Boz where
    Boz
b1 == :: Boz -> Boz -> Bool
== Boz
b2 =     Boz -> BozPrefix
bozPrefix Boz
b1 forall a. Eq a => a -> a -> Bool
== Boz -> BozPrefix
bozPrefix Boz
b2
                Bool -> Bool -> Bool
&& Boz -> String
bozString Boz
b1 forall a. Eq a => a -> a -> Bool
== Boz -> String
bozString Boz
b2

data BozPrefix
  = BozPrefixB              -- ^ binary (bitstring)
  | BozPrefixO              -- ^ octal
  | BozPrefixZ Conforming   -- ^ hex, including nonstandard @x@
    deriving stock    (Int -> BozPrefix -> ShowS
[BozPrefix] -> ShowS
BozPrefix -> String
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
showList :: [BozPrefix] -> ShowS
$cshowList :: [BozPrefix] -> ShowS
show :: BozPrefix -> String
$cshow :: BozPrefix -> String
showsPrec :: Int -> BozPrefix -> ShowS
$cshowsPrec :: Int -> BozPrefix -> ShowS
Show, forall x. Rep BozPrefix x -> BozPrefix
forall x. BozPrefix -> Rep BozPrefix x
forall a.
(forall x. a -> Rep a x) -> (forall x. Rep a x -> a) -> Generic a
$cto :: forall x. Rep BozPrefix x -> BozPrefix
$cfrom :: forall x. BozPrefix -> Rep BozPrefix x
Generic, Typeable BozPrefix
BozPrefix -> DataType
BozPrefix -> Constr
(forall b. Data b => b -> b) -> BozPrefix -> BozPrefix
forall a.
Typeable a
-> (forall (c :: * -> *).
    (forall d b. Data d => c (d -> b) -> d -> c b)
    -> (forall g. g -> c g) -> a -> c a)
-> (forall (c :: * -> *).
    (forall b r. Data b => c (b -> r) -> c r)
    -> (forall r. r -> c r) -> Constr -> c a)
-> (a -> Constr)
-> (a -> DataType)
-> (forall (t :: * -> *) (c :: * -> *).
    Typeable t =>
    (forall d. Data d => c (t d)) -> Maybe (c a))
-> (forall (t :: * -> * -> *) (c :: * -> *).
    Typeable t =>
    (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c a))
-> ((forall b. Data b => b -> b) -> a -> a)
-> (forall r r'.
    (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> a -> r)
-> (forall r r'.
    (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> a -> r)
-> (forall u. (forall d. Data d => d -> u) -> a -> [u])
-> (forall u. Int -> (forall d. Data d => d -> u) -> a -> u)
-> (forall (m :: * -> *).
    Monad m =>
    (forall d. Data d => d -> m d) -> a -> m a)
-> (forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> a -> m a)
-> (forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> a -> m a)
-> Data a
forall u. Int -> (forall d. Data d => d -> u) -> BozPrefix -> u
forall u. (forall d. Data d => d -> u) -> BozPrefix -> [u]
forall r r'.
(r -> r' -> r)
-> r -> (forall d. Data d => d -> r') -> BozPrefix -> r
forall r r'.
(r' -> r -> r)
-> r -> (forall d. Data d => d -> r') -> BozPrefix -> r
forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> BozPrefix -> m BozPrefix
forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> BozPrefix -> m BozPrefix
forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c BozPrefix
forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> BozPrefix -> c BozPrefix
forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c BozPrefix)
forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c BozPrefix)
gmapMo :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> BozPrefix -> m BozPrefix
$cgmapMo :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> BozPrefix -> m BozPrefix
gmapMp :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> BozPrefix -> m BozPrefix
$cgmapMp :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> BozPrefix -> m BozPrefix
gmapM :: forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> BozPrefix -> m BozPrefix
$cgmapM :: forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> BozPrefix -> m BozPrefix
gmapQi :: forall u. Int -> (forall d. Data d => d -> u) -> BozPrefix -> u
$cgmapQi :: forall u. Int -> (forall d. Data d => d -> u) -> BozPrefix -> u
gmapQ :: forall u. (forall d. Data d => d -> u) -> BozPrefix -> [u]
$cgmapQ :: forall u. (forall d. Data d => d -> u) -> BozPrefix -> [u]
gmapQr :: forall r r'.
(r' -> r -> r)
-> r -> (forall d. Data d => d -> r') -> BozPrefix -> r
$cgmapQr :: forall r r'.
(r' -> r -> r)
-> r -> (forall d. Data d => d -> r') -> BozPrefix -> r
gmapQl :: forall r r'.
(r -> r' -> r)
-> r -> (forall d. Data d => d -> r') -> BozPrefix -> r
$cgmapQl :: forall r r'.
(r -> r' -> r)
-> r -> (forall d. Data d => d -> r') -> BozPrefix -> r
gmapT :: (forall b. Data b => b -> b) -> BozPrefix -> BozPrefix
$cgmapT :: (forall b. Data b => b -> b) -> BozPrefix -> BozPrefix
dataCast2 :: forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c BozPrefix)
$cdataCast2 :: forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c BozPrefix)
dataCast1 :: forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c BozPrefix)
$cdataCast1 :: forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c BozPrefix)
dataTypeOf :: BozPrefix -> DataType
$cdataTypeOf :: BozPrefix -> DataType
toConstr :: BozPrefix -> Constr
$ctoConstr :: BozPrefix -> Constr
gunfold :: forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c BozPrefix
$cgunfold :: forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c BozPrefix
gfoldl :: forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> BozPrefix -> c BozPrefix
$cgfoldl :: forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> BozPrefix -> c BozPrefix
Data, Typeable, Eq BozPrefix
BozPrefix -> BozPrefix -> Bool
BozPrefix -> BozPrefix -> Ordering
BozPrefix -> BozPrefix -> BozPrefix
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 :: BozPrefix -> BozPrefix -> BozPrefix
$cmin :: BozPrefix -> BozPrefix -> BozPrefix
max :: BozPrefix -> BozPrefix -> BozPrefix
$cmax :: BozPrefix -> BozPrefix -> BozPrefix
>= :: BozPrefix -> BozPrefix -> Bool
$c>= :: BozPrefix -> BozPrefix -> Bool
> :: BozPrefix -> BozPrefix -> Bool
$c> :: BozPrefix -> BozPrefix -> Bool
<= :: BozPrefix -> BozPrefix -> Bool
$c<= :: BozPrefix -> BozPrefix -> Bool
< :: BozPrefix -> BozPrefix -> Bool
$c< :: BozPrefix -> BozPrefix -> Bool
compare :: BozPrefix -> BozPrefix -> Ordering
$ccompare :: BozPrefix -> BozPrefix -> Ordering
Ord)
    deriving anyclass (BozPrefix -> ()
forall a. (a -> ()) -> NFData a
rnf :: BozPrefix -> ()
$crnf :: BozPrefix -> ()
NFData, Int -> BozPrefix -> Doc
[BozPrefix] -> Doc
BozPrefix -> Doc
forall a. (Int -> a -> Doc) -> (a -> Doc) -> ([a] -> Doc) -> Out a
docList :: [BozPrefix] -> Doc
$cdocList :: [BozPrefix] -> Doc
doc :: BozPrefix -> Doc
$cdoc :: BozPrefix -> Doc
docPrec :: Int -> BozPrefix -> Doc
$cdocPrec :: Int -> BozPrefix -> Doc
Out)

-- | Ignores conforming/nonconforming flags.
instance Eq BozPrefix where
    BozPrefix
p1 == :: BozPrefix -> BozPrefix -> Bool
== BozPrefix
p2 = case (BozPrefix
p1, BozPrefix
p2) of (BozPrefix
BozPrefixB,   BozPrefix
BozPrefixB)   -> Bool
True
                                (BozPrefix
BozPrefixO,   BozPrefix
BozPrefixO)   -> Bool
True
                                (BozPrefixZ{}, BozPrefixZ{}) -> Bool
True
                                (BozPrefix, BozPrefix)
_                            -> Bool
False

data Conforming = Conforming | Nonconforming
    deriving stock    (Conforming -> Conforming -> Bool
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
/= :: Conforming -> Conforming -> Bool
$c/= :: Conforming -> Conforming -> Bool
== :: Conforming -> Conforming -> Bool
$c== :: Conforming -> Conforming -> Bool
Eq, Int -> Conforming -> ShowS
[Conforming] -> ShowS
Conforming -> String
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
showList :: [Conforming] -> ShowS
$cshowList :: [Conforming] -> ShowS
show :: Conforming -> String
$cshow :: Conforming -> String
showsPrec :: Int -> Conforming -> ShowS
$cshowsPrec :: Int -> Conforming -> ShowS
Show, forall x. Rep Conforming x -> Conforming
forall x. Conforming -> Rep Conforming x
forall a.
(forall x. a -> Rep a x) -> (forall x. Rep a x -> a) -> Generic a
$cto :: forall x. Rep Conforming x -> Conforming
$cfrom :: forall x. Conforming -> Rep Conforming x
Generic, Typeable Conforming
Conforming -> DataType
Conforming -> Constr
(forall b. Data b => b -> b) -> Conforming -> Conforming
forall a.
Typeable a
-> (forall (c :: * -> *).
    (forall d b. Data d => c (d -> b) -> d -> c b)
    -> (forall g. g -> c g) -> a -> c a)
-> (forall (c :: * -> *).
    (forall b r. Data b => c (b -> r) -> c r)
    -> (forall r. r -> c r) -> Constr -> c a)
-> (a -> Constr)
-> (a -> DataType)
-> (forall (t :: * -> *) (c :: * -> *).
    Typeable t =>
    (forall d. Data d => c (t d)) -> Maybe (c a))
-> (forall (t :: * -> * -> *) (c :: * -> *).
    Typeable t =>
    (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c a))
-> ((forall b. Data b => b -> b) -> a -> a)
-> (forall r r'.
    (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> a -> r)
-> (forall r r'.
    (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> a -> r)
-> (forall u. (forall d. Data d => d -> u) -> a -> [u])
-> (forall u. Int -> (forall d. Data d => d -> u) -> a -> u)
-> (forall (m :: * -> *).
    Monad m =>
    (forall d. Data d => d -> m d) -> a -> m a)
-> (forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> a -> m a)
-> (forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> a -> m a)
-> Data a
forall u. Int -> (forall d. Data d => d -> u) -> Conforming -> u
forall u. (forall d. Data d => d -> u) -> Conforming -> [u]
forall r r'.
(r -> r' -> r)
-> r -> (forall d. Data d => d -> r') -> Conforming -> r
forall r r'.
(r' -> r -> r)
-> r -> (forall d. Data d => d -> r') -> Conforming -> r
forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> Conforming -> m Conforming
forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Conforming -> m Conforming
forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c Conforming
forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Conforming -> c Conforming
forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c Conforming)
forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Conforming)
gmapMo :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Conforming -> m Conforming
$cgmapMo :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Conforming -> m Conforming
gmapMp :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Conforming -> m Conforming
$cgmapMp :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Conforming -> m Conforming
gmapM :: forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> Conforming -> m Conforming
$cgmapM :: forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> Conforming -> m Conforming
gmapQi :: forall u. Int -> (forall d. Data d => d -> u) -> Conforming -> u
$cgmapQi :: forall u. Int -> (forall d. Data d => d -> u) -> Conforming -> u
gmapQ :: forall u. (forall d. Data d => d -> u) -> Conforming -> [u]
$cgmapQ :: forall u. (forall d. Data d => d -> u) -> Conforming -> [u]
gmapQr :: forall r r'.
(r' -> r -> r)
-> r -> (forall d. Data d => d -> r') -> Conforming -> r
$cgmapQr :: forall r r'.
(r' -> r -> r)
-> r -> (forall d. Data d => d -> r') -> Conforming -> r
gmapQl :: forall r r'.
(r -> r' -> r)
-> r -> (forall d. Data d => d -> r') -> Conforming -> r
$cgmapQl :: forall r r'.
(r -> r' -> r)
-> r -> (forall d. Data d => d -> r') -> Conforming -> r
gmapT :: (forall b. Data b => b -> b) -> Conforming -> Conforming
$cgmapT :: (forall b. Data b => b -> b) -> Conforming -> Conforming
dataCast2 :: forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Conforming)
$cdataCast2 :: forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Conforming)
dataCast1 :: forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c Conforming)
$cdataCast1 :: forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c Conforming)
dataTypeOf :: Conforming -> DataType
$cdataTypeOf :: Conforming -> DataType
toConstr :: Conforming -> Constr
$ctoConstr :: Conforming -> Constr
gunfold :: forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c Conforming
$cgunfold :: forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c Conforming
gfoldl :: forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Conforming -> c Conforming
$cgfoldl :: forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Conforming -> c Conforming
Data, Typeable, Eq Conforming
Conforming -> Conforming -> Bool
Conforming -> Conforming -> Ordering
Conforming -> Conforming -> Conforming
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 :: Conforming -> Conforming -> Conforming
$cmin :: Conforming -> Conforming -> Conforming
max :: Conforming -> Conforming -> Conforming
$cmax :: Conforming -> Conforming -> Conforming
>= :: Conforming -> Conforming -> Bool
$c>= :: Conforming -> Conforming -> Bool
> :: Conforming -> Conforming -> Bool
$c> :: Conforming -> Conforming -> Bool
<= :: Conforming -> Conforming -> Bool
$c<= :: Conforming -> Conforming -> Bool
< :: Conforming -> Conforming -> Bool
$c< :: Conforming -> Conforming -> Bool
compare :: Conforming -> Conforming -> Ordering
$ccompare :: Conforming -> Conforming -> Ordering
Ord)
    deriving anyclass (Conforming -> ()
forall a. (a -> ()) -> NFData a
rnf :: Conforming -> ()
$crnf :: Conforming -> ()
NFData, Int -> Conforming -> Doc
[Conforming] -> Doc
Conforming -> Doc
forall a. (Int -> a -> Doc) -> (a -> Doc) -> ([a] -> Doc) -> Out a
docList :: [Conforming] -> Doc
$cdocList :: [Conforming] -> Doc
doc :: Conforming -> Doc
$cdoc :: Conforming -> Doc
docPrec :: Int -> Conforming -> Doc
$cdocPrec :: Int -> Conforming -> Doc
Out)

-- | UNSAFE. Parses a BOZ literal constant string.
--
-- Looks for prefix or postfix. Strips the quotes from the string (single quotes
-- only).
parseBoz :: String -> Boz
parseBoz :: String -> Boz
parseBoz String
s =
    case forall a. [a] -> Maybe (a, [a])
List.uncons String
s of
      Maybe (Char, String)
Nothing -> forall {a}. a
errInvalid
      Just (Char
pc, String
ps) -> case Char -> Maybe BozPrefix
parsePrefix Char
pc of
                         Just BozPrefix
p -> BozPrefix -> String -> Conforming -> Boz
Boz BozPrefix
p (forall {a}. [a] -> [a]
shave String
ps) Conforming
Conforming
                         Maybe BozPrefix
Nothing -> case Char -> Maybe BozPrefix
parsePrefix (forall a. [a] -> a
List.last String
s) of
                                      Just BozPrefix
p -> BozPrefix -> String -> Conforming -> Boz
Boz BozPrefix
p (forall {a}. [a] -> [a]
shave (forall {a}. [a] -> [a]
init String
s)) Conforming
Nonconforming
                                      Maybe BozPrefix
Nothing -> forall {a}. a
errInvalid
  where
    parsePrefix :: Char -> Maybe BozPrefix
parsePrefix Char
p
      | Char
p' forall a. Eq a => a -> a -> Bool
== Char
'b' = forall a. a -> Maybe a
Just forall a b. (a -> b) -> a -> b
$ BozPrefix
BozPrefixB
      | Char
p' forall a. Eq a => a -> a -> Bool
== Char
'o' = forall a. a -> Maybe a
Just forall a b. (a -> b) -> a -> b
$ BozPrefix
BozPrefixO
      | Char
p' forall a. Eq a => a -> a -> Bool
== Char
'z' = forall a. a -> Maybe a
Just forall a b. (a -> b) -> a -> b
$ Conforming -> BozPrefix
BozPrefixZ Conforming
Conforming
      | Char
p' forall a. Eq a => a -> a -> Bool
== Char
'x' = forall a. a -> Maybe a
Just forall a b. (a -> b) -> a -> b
$ Conforming -> BozPrefix
BozPrefixZ Conforming
Nonconforming
      | Bool
otherwise = forall a. Maybe a
Nothing
      where p' :: Char
p' = Char -> Char
Char.toLower Char
p
    errInvalid :: a
errInvalid = forall a. HasCallStack => String -> a
error String
"Language.Fortran.AST.BOZ.parseBoz: invalid BOZ string"
    -- | Remove the first and last elements in a list.
    shave :: [a] -> [a]
shave = forall {a}. [a] -> [a]
tail forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall {a}. [a] -> [a]
init

-- | Pretty print a BOZ constant. Uses prefix style (ignores the postfix field),
--   and @z@ over nonstandard @x@ for hexadecimal.
prettyBoz :: Boz -> String
prettyBoz :: Boz -> String
prettyBoz Boz
b = BozPrefix -> Char
prettyBozPrefix (Boz -> BozPrefix
bozPrefix Boz
b) forall a. a -> [a] -> [a]
: Char
'\'' forall a. a -> [a] -> [a]
: Boz -> String
bozString Boz
b forall a. Semigroup a => a -> a -> a
<> String
"'"
  where prettyBozPrefix :: BozPrefix -> Char
prettyBozPrefix = \case BozPrefix
BozPrefixB   -> Char
'b'
                                BozPrefix
BozPrefixO   -> Char
'o'
                                BozPrefixZ{} -> Char
'z'

-- | Resolve a BOZ constant as a natural (positive integer).
--
-- Is actually polymorphic over the output type, but you probably want to
-- resolve to 'Integer' or 'Natural' usually.
--
-- We assume the 'Boz' is well-formed, thus don't bother with digit predicates.
bozAsNatural :: (Num a, Eq a) => Boz -> a
bozAsNatural :: forall a. (Num a, Eq a) => Boz -> a
bozAsNatural (Boz BozPrefix
pfx String
str Conforming
_) = forall {c} {b}. [(c, b)] -> c
runReadS forall a b. (a -> b) -> a -> b
$ ReadS a
parser String
str
  where
    runReadS :: [(c, b)] -> c
runReadS = forall a b. (a, b) -> a
fst forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall a. [a] -> a
head
    parser :: ReadS a
parser = case BozPrefix
pfx of BozPrefix
BozPrefixB   -> forall a. Num a => a -> (Char -> Bool) -> (Char -> Int) -> ReadS a
Num.readInt a
2 (forall a b. a -> b -> a
const Bool
True) Char -> Int
binDigitVal
                         -- (on GHC >=9.2, 'Num.readBin')
                         BozPrefix
BozPrefixO   -> forall a. (Eq a, Num a) => ReadS a
Num.readOct
                         BozPrefixZ{} -> forall a. (Eq a, Num a) => ReadS a
Num.readHex
    binDigitVal :: Char -> Int
binDigitVal = \case Char
'0' -> Int
0
                        Char
'1' -> Int
1
                        Char
_   -> forall a. HasCallStack => String -> a
error String
"Language.Fortran.AST.BOZ.bozAsNatural: invalid BOZ string"

-- | Resolve a BOZ constant as a two's complement integer.
--
-- Note that the value will depend on the size of the output type.
bozAsTwosComp :: (Num a, Eq a, FiniteBits a) => Boz -> a
bozAsTwosComp :: forall a. (Num a, Eq a, FiniteBits a) => Boz -> a
bozAsTwosComp Boz
boz =
    if   Bool
msbIsSet
    then a
asNat forall a. Num a => a -> a -> a
- (a
2 forall a b. (Num a, Integral b) => a -> b -> a
^ Int
bitCount)
    else a
asNat
  where
    msbIsSet :: Bool
msbIsSet = forall a. Bits a => a -> Int -> Bool
testBit a
asNat (Int
bitCount forall a. Num a => a -> a -> a
- Int
1)
    asNat :: a
asNat    = forall a. (Num a, Eq a) => Boz -> a
bozAsNatural Boz
boz
    bitCount :: Int
bitCount = forall b. FiniteBits b => b -> Int
finiteBitSize a
asNat