| Safe Haskell | Safe-Inferred |
|---|---|
| Language | Haskell2010 |
Language.Fortran.Repr.Value.Scalar.Int.Idealized
Description
Idealized Fortran INTEGER values.
This module stores Fortran INTEGER values in a Haskell Integer, together with
a phantom type describing the Fortran kind. This way, we can safely check for
bounds issues, and leave exact behaviour up to the user.
Documentation
newtype FIntI (k :: FTInt) Source #
Instances
| Out (FIntI k) Source # | |
| Typeable k => Data (FIntI k) Source # | |
Defined in Language.Fortran.Repr.Value.Scalar.Int.Idealized Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> FIntI k -> c (FIntI k) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (FIntI k) # toConstr :: FIntI k -> Constr # dataTypeOf :: FIntI k -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (FIntI k)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (FIntI k)) # gmapT :: (forall b. Data b => b -> b) -> FIntI k -> FIntI k # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> FIntI k -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> FIntI k -> r # gmapQ :: (forall d. Data d => d -> u) -> FIntI k -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> FIntI k -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> FIntI k -> m (FIntI k) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> FIntI k -> m (FIntI k) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> FIntI k -> m (FIntI k) # | |
| Generic (FIntI k) Source # | |
| Show (FIntI k) Source # | |
| Binary (FIntI k) Source # | |
| Eq (FIntI k) Source # | |
| Ord (FIntI k) Source # | |
| type Rep (FIntI k) Source # | |
fIntICheckBounds :: forall k rep. (rep ~ FIntMRep k, Bounded rep, Integral rep) => FIntI k -> Maybe String Source #