Safe Haskell | None |
---|---|
Language | Haskell2010 |
Synopsis
- data Quid
- newtype Size (n :: Nat) a = Size {
- unSize :: a
- newtype Decimal a = Decimal {
- unDecimal :: a
- newtype Hexadecimal a = Hexadecimal {
- unHexadecimal :: a
- newtype Latin a = Latin {
- unLatin :: a
The Quid type
Instances
Combinators
Instances
(Arbitrary a, KnownNat n) => Arbitrary (Size n a) | |
NFData a => NFData (Size n a) | |
(KnownNat n, Data a) => Data (Size n a) | |
Defined in Internal.Test.QuickCheck.Quid.Combinators.Size gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Size n a -> c (Size n a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Size n a) # toConstr :: Size n a -> Constr # dataTypeOf :: Size n a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Size n a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Size n a)) # gmapT :: (forall b. Data b => b -> b) -> Size n a -> Size n a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Size n a -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Size n a -> r # gmapQ :: (forall d. Data d => d -> u) -> Size n a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Size n a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Size n a -> m (Size n a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Size n a -> m (Size n a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Size n a -> m (Size n a) # | |
Generic (Size n a) | |
Read a => Read (Size n a) | |
Show a => Show (Size n a) | |
Eq a => Eq (Size n a) | |
Ord a => Ord (Size n a) | |
Hashable a => Hashable (Size n a) | |
type Rep (Size n a) | |
Representations
Numerical representations
Instances
Function a => Function (Decimal a) | |||||
NFData a => NFData (Decimal a) | |||||
Data a => Data (Decimal a) | |||||
Defined in Internal.Test.QuickCheck.Quid.Representations.Decimal gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Decimal a -> c (Decimal a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Decimal a) # toConstr :: Decimal a -> Constr # dataTypeOf :: Decimal a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Decimal a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Decimal a)) # gmapT :: (forall b. Data b => b -> b) -> Decimal a -> Decimal a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Decimal a -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Decimal a -> r # gmapQ :: (forall d. Data d => d -> u) -> Decimal a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Decimal a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Decimal a -> m (Decimal a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Decimal a -> m (Decimal a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Decimal a -> m (Decimal a) # | |||||
Generic (Decimal a) | |||||
Defined in Internal.Test.QuickCheck.Quid.Representations.Decimal
| |||||
Num a => Num (Decimal a) | |||||
Read (Decimal Quid) | |||||
Show (Decimal Quid) | |||||
Eq a => Eq (Decimal a) | |||||
Ord a => Ord (Decimal a) | |||||
Hashable a => Hashable (Decimal a) | |||||
type Rep (Decimal a) | |||||
newtype Hexadecimal a #
Hexadecimal | |
|
Instances
Function a => Function (Hexadecimal a) | |||||
Defined in Internal.Test.QuickCheck.Quid.Representations.Hexadecimal function :: (Hexadecimal a -> b) -> Hexadecimal a :-> b # | |||||
NFData a => NFData (Hexadecimal a) | |||||
Defined in Internal.Test.QuickCheck.Quid.Representations.Hexadecimal rnf :: Hexadecimal a -> () # | |||||
Data a => Data (Hexadecimal a) | |||||
Defined in Internal.Test.QuickCheck.Quid.Representations.Hexadecimal gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Hexadecimal a -> c (Hexadecimal a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Hexadecimal a) # toConstr :: Hexadecimal a -> Constr # dataTypeOf :: Hexadecimal a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Hexadecimal a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Hexadecimal a)) # gmapT :: (forall b. Data b => b -> b) -> Hexadecimal a -> Hexadecimal a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Hexadecimal a -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Hexadecimal a -> r # gmapQ :: (forall d. Data d => d -> u) -> Hexadecimal a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Hexadecimal a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Hexadecimal a -> m (Hexadecimal a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Hexadecimal a -> m (Hexadecimal a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Hexadecimal a -> m (Hexadecimal a) # | |||||
Generic (Hexadecimal a) | |||||
Defined in Internal.Test.QuickCheck.Quid.Representations.Hexadecimal
from :: Hexadecimal a -> Rep (Hexadecimal a) x # to :: Rep (Hexadecimal a) x -> Hexadecimal a # | |||||
Num a => Num (Hexadecimal a) | |||||
Defined in Internal.Test.QuickCheck.Quid.Representations.Hexadecimal (+) :: Hexadecimal a -> Hexadecimal a -> Hexadecimal a # (-) :: Hexadecimal a -> Hexadecimal a -> Hexadecimal a # (*) :: Hexadecimal a -> Hexadecimal a -> Hexadecimal a # negate :: Hexadecimal a -> Hexadecimal a # abs :: Hexadecimal a -> Hexadecimal a # signum :: Hexadecimal a -> Hexadecimal a # fromInteger :: Integer -> Hexadecimal a # | |||||
Read (Hexadecimal Quid) | |||||
Defined in Internal.Test.QuickCheck.Quid.Representations.Hexadecimal readsPrec :: Int -> ReadS (Hexadecimal Quid) # readList :: ReadS [Hexadecimal Quid] # readPrec :: ReadPrec (Hexadecimal Quid) # readListPrec :: ReadPrec [Hexadecimal Quid] # | |||||
Show (Hexadecimal Quid) | |||||
Eq a => Eq (Hexadecimal a) | |||||
Defined in Internal.Test.QuickCheck.Quid.Representations.Hexadecimal (==) :: Hexadecimal a -> Hexadecimal a -> Bool # (/=) :: Hexadecimal a -> Hexadecimal a -> Bool # | |||||
Ord a => Ord (Hexadecimal a) | |||||
Defined in Internal.Test.QuickCheck.Quid.Representations.Hexadecimal compare :: Hexadecimal a -> Hexadecimal a -> Ordering # (<) :: Hexadecimal a -> Hexadecimal a -> Bool # (<=) :: Hexadecimal a -> Hexadecimal a -> Bool # (>) :: Hexadecimal a -> Hexadecimal a -> Bool # (>=) :: Hexadecimal a -> Hexadecimal a -> Bool # max :: Hexadecimal a -> Hexadecimal a -> Hexadecimal a # min :: Hexadecimal a -> Hexadecimal a -> Hexadecimal a # | |||||
Hashable a => Hashable (Hexadecimal a) | |||||
Defined in Internal.Test.QuickCheck.Quid.Representations.Hexadecimal hashWithSalt :: Int -> Hexadecimal a -> Int # hash :: Hexadecimal a -> Int # | |||||
type Rep (Hexadecimal a) | |||||
Defined in Internal.Test.QuickCheck.Quid.Representations.Hexadecimal type Rep (Hexadecimal a) = D1 ('MetaData "Hexadecimal" "Internal.Test.QuickCheck.Quid.Representations.Hexadecimal" "quickcheck-quid-0.0.1.4-inplace-internal" 'True) (C1 ('MetaCons "Hexadecimal" 'PrefixI 'True) (S1 ('MetaSel ('Just "unHexadecimal") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a))) |
String representations
Instances
Function a => Function (Latin a) | |||||
NFData a => NFData (Latin a) | |||||
Data a => Data (Latin a) | |||||
Defined in Internal.Test.QuickCheck.Quid.Representations.Latin gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Latin a -> c (Latin a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Latin a) # toConstr :: Latin a -> Constr # dataTypeOf :: Latin a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Latin a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Latin a)) # gmapT :: (forall b. Data b => b -> b) -> Latin a -> Latin a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Latin a -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Latin a -> r # gmapQ :: (forall d. Data d => d -> u) -> Latin a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Latin a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Latin a -> m (Latin a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Latin a -> m (Latin a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Latin a -> m (Latin a) # | |||||
IsString (Latin Quid) | |||||
Defined in Internal.Test.QuickCheck.Quid.Representations.Latin fromString :: String -> Latin Quid # | |||||
Generic (Latin a) | |||||
Defined in Internal.Test.QuickCheck.Quid.Representations.Latin
| |||||
Read (Latin Quid) | |||||
Show (Latin Quid) | |||||
Eq a => Eq (Latin a) | |||||
Ord a => Ord (Latin a) | |||||
Hashable a => Hashable (Latin a) | |||||
type Rep (Latin a) | |||||