module Language.Fortran.Repr.Type.Scalar.String where

import Language.Fortran.Repr.Compat.Natural

import GHC.Generics ( Generic )
import Data.Data ( Data )
import Data.Binary ( Binary )
import Text.PrettyPrint.GenericPretty ( Out )
import Text.PrettyPrint.GenericPretty.Orphans()

-- | The length of a CHARACTER value.
--
-- IanH provides a great reference on StackOverflow:
-- https://stackoverflow.com/a/25051522/2246637
data CharLen
  = CharLen Natural
  -- ^ @CHARACTER(LEN=x)@ (where @x@ is a constant integer expression). Value
  --   has the given static length.

  | CharLenAssumed
  -- ^ @CHARACTER(LEN=*)@. F90. Value has assumed length. For a dummy argument,
  --   the length is assumed from the actual argument. For a PARAMETER named
  --   constant, the length is assumed from the length of the initializing
  --   expression.

  | CharLenDeferred
  -- ^ @CHARACTER(LEN=:)@. F2003. Value has deferred length. Must have the
  --   ALLOCATABLE or POINTER attribute.

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

prettyCharLen :: Natural -> String
prettyCharLen :: Natural -> String
prettyCharLen Natural
l = String
"LEN="String -> ShowS
forall a. Semigroup a => a -> a -> a
<>Natural -> String
forall a. Show a => a -> String
show Natural
l