Safe Haskell | None |
---|---|
Language | Haskell2010 |
Documentation
newtype AtLeast (n :: Nat) t a Source #
Generate with a minimum, inclusive size as n :: Nat
AtLeast | |
|
Instances
Monad t => Monad (AtLeast n t) Source # | |
Functor t => Functor (AtLeast n t) Source # | |
Applicative t => Applicative (AtLeast n t) Source # | |
Defined in Test.QuickCheck.Combinators | |
Foldable t => Foldable (AtLeast n t) Source # | |
Defined in Test.QuickCheck.Combinators fold :: Monoid m => AtLeast n t m -> m # foldMap :: Monoid m => (a -> m) -> AtLeast n t a -> m # foldr :: (a -> b -> b) -> b -> AtLeast n t a -> b # foldr' :: (a -> b -> b) -> b -> AtLeast n t a -> b # foldl :: (b -> a -> b) -> b -> AtLeast n t a -> b # foldl' :: (b -> a -> b) -> b -> AtLeast n t a -> b # foldr1 :: (a -> a -> a) -> AtLeast n t a -> a # foldl1 :: (a -> a -> a) -> AtLeast n t a -> a # toList :: AtLeast n t a -> [a] # null :: AtLeast n t a -> Bool # length :: AtLeast n t a -> Int # elem :: Eq a => a -> AtLeast n t a -> Bool # maximum :: Ord a => AtLeast n t a -> a # minimum :: Ord a => AtLeast n t a -> a # | |
Traversable t => Traversable (AtLeast n t) Source # | |
Defined in Test.QuickCheck.Combinators | |
Enum (t a) => Enum (AtLeast n t a) Source # | |
Defined in Test.QuickCheck.Combinators succ :: AtLeast n t a -> AtLeast n t a # pred :: AtLeast n t a -> AtLeast n t a # toEnum :: Int -> AtLeast n t a # fromEnum :: AtLeast n t a -> Int # enumFrom :: AtLeast n t a -> [AtLeast n t a] # enumFromThen :: AtLeast n t a -> AtLeast n t a -> [AtLeast n t a] # enumFromTo :: AtLeast n t a -> AtLeast n t a -> [AtLeast n t a] # enumFromThenTo :: AtLeast n t a -> AtLeast n t a -> AtLeast n t a -> [AtLeast n t a] # | |
Eq (t a) => Eq (AtLeast n t a) Source # | |
(KnownNat n, Typeable t, Typeable a, Data (t a)) => Data (AtLeast n t a) Source # | |
Defined in Test.QuickCheck.Combinators gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> AtLeast n t a -> c (AtLeast n t a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (AtLeast n t a) # toConstr :: AtLeast n t a -> Constr # dataTypeOf :: AtLeast n t a -> DataType # dataCast1 :: Typeable t0 => (forall d. Data d => c (t0 d)) -> Maybe (c (AtLeast n t a)) # dataCast2 :: Typeable t0 => (forall d e. (Data d, Data e) => c (t0 d e)) -> Maybe (c (AtLeast n t a)) # gmapT :: (forall b. Data b => b -> b) -> AtLeast n t a -> AtLeast n t a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> AtLeast n t a -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> AtLeast n t a -> r # gmapQ :: (forall d. Data d => d -> u) -> AtLeast n t a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> AtLeast n t a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> AtLeast n t a -> m (AtLeast n t a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> AtLeast n t a -> m (AtLeast n t a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> AtLeast n t a -> m (AtLeast n t a) # | |
Ord (t a) => Ord (AtLeast n t a) Source # | |
Defined in Test.QuickCheck.Combinators compare :: AtLeast n t a -> AtLeast n t a -> Ordering # (<) :: AtLeast n t a -> AtLeast n t a -> Bool # (<=) :: AtLeast n t a -> AtLeast n t a -> Bool # (>) :: AtLeast n t a -> AtLeast n t a -> Bool # (>=) :: AtLeast n t a -> AtLeast n t a -> Bool # | |
Read (t a) => Read (AtLeast n t a) Source # | |
Show (t a) => Show (AtLeast n t a) Source # | |
Generic (AtLeast n t a) Source # | |
Semigroup (t a) => Semigroup (AtLeast n t a) Source # | |
Monoid (t a) => Monoid (AtLeast n t a) Source # | |
(Arbitrary a, Ord a, UnfoldableR p [], p a, KnownNat n) => Arbitrary (AtLeast n OrderedList a) Source # | |
Defined in Test.QuickCheck.Combinators arbitrary :: Gen (AtLeast n OrderedList a) # shrink :: AtLeast n OrderedList a -> [AtLeast n OrderedList a] # | |
(UnfoldableR p t, Monoid (t a), Arbitrary a, KnownNat n, p a) => Arbitrary (AtLeast n t a) Source # | |
type Rep (AtLeast n t a) Source # | |
Defined in Test.QuickCheck.Combinators |
newtype AtMost (n :: Nat) t a Source #
Generate with a maximum, inclusive size as n :: Nat
Instances
Monad t => Monad (AtMost n t) Source # | |
Functor t => Functor (AtMost n t) Source # | |
Applicative t => Applicative (AtMost n t) Source # | |
Defined in Test.QuickCheck.Combinators | |
Foldable t => Foldable (AtMost n t) Source # | |
Defined in Test.QuickCheck.Combinators fold :: Monoid m => AtMost n t m -> m # foldMap :: Monoid m => (a -> m) -> AtMost n t a -> m # foldr :: (a -> b -> b) -> b -> AtMost n t a -> b # foldr' :: (a -> b -> b) -> b -> AtMost n t a -> b # foldl :: (b -> a -> b) -> b -> AtMost n t a -> b # foldl' :: (b -> a -> b) -> b -> AtMost n t a -> b # foldr1 :: (a -> a -> a) -> AtMost n t a -> a # foldl1 :: (a -> a -> a) -> AtMost n t a -> a # toList :: AtMost n t a -> [a] # null :: AtMost n t a -> Bool # length :: AtMost n t a -> Int # elem :: Eq a => a -> AtMost n t a -> Bool # maximum :: Ord a => AtMost n t a -> a # minimum :: Ord a => AtMost n t a -> a # | |
Traversable t => Traversable (AtMost n t) Source # | |
Defined in Test.QuickCheck.Combinators | |
Enum (t a) => Enum (AtMost n t a) Source # | |
Defined in Test.QuickCheck.Combinators succ :: AtMost n t a -> AtMost n t a # pred :: AtMost n t a -> AtMost n t a # toEnum :: Int -> AtMost n t a # fromEnum :: AtMost n t a -> Int # enumFrom :: AtMost n t a -> [AtMost n t a] # enumFromThen :: AtMost n t a -> AtMost n t a -> [AtMost n t a] # enumFromTo :: AtMost n t a -> AtMost n t a -> [AtMost n t a] # enumFromThenTo :: AtMost n t a -> AtMost n t a -> AtMost n t a -> [AtMost n t a] # | |
Eq (t a) => Eq (AtMost n t a) Source # | |
(KnownNat n, Typeable t, Typeable a, Data (t a)) => Data (AtMost n t a) Source # | |
Defined in Test.QuickCheck.Combinators gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> AtMost n t a -> c (AtMost n t a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (AtMost n t a) # toConstr :: AtMost n t a -> Constr # dataTypeOf :: AtMost n t a -> DataType # dataCast1 :: Typeable t0 => (forall d. Data d => c (t0 d)) -> Maybe (c (AtMost n t a)) # dataCast2 :: Typeable t0 => (forall d e. (Data d, Data e) => c (t0 d e)) -> Maybe (c (AtMost n t a)) # gmapT :: (forall b. Data b => b -> b) -> AtMost n t a -> AtMost n t a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> AtMost n t a -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> AtMost n t a -> r # gmapQ :: (forall d. Data d => d -> u) -> AtMost n t a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> AtMost n t a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> AtMost n t a -> m (AtMost n t a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> AtMost n t a -> m (AtMost n t a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> AtMost n t a -> m (AtMost n t a) # | |
Ord (t a) => Ord (AtMost n t a) Source # | |
Defined in Test.QuickCheck.Combinators | |
Read (t a) => Read (AtMost n t a) Source # | |
Show (t a) => Show (AtMost n t a) Source # | |
Generic (AtMost n t a) Source # | |
Semigroup (t a) => Semigroup (AtMost n t a) Source # | |
Monoid (t a) => Monoid (AtMost n t a) Source # | |
(Arbitrary a, Ord a, UnfoldableR p [], p a, KnownNat n) => Arbitrary (AtMost n OrderedList a) Source # | |
Defined in Test.QuickCheck.Combinators arbitrary :: Gen (AtMost n OrderedList a) # shrink :: AtMost n OrderedList a -> [AtMost n OrderedList a] # | |
(UnfoldableR p t, Monoid (t a), Arbitrary a, KnownNat m, p a) => Arbitrary (AtMost m t a) Source # | |
type Rep (AtMost n t a) Source # | |
Defined in Test.QuickCheck.Combinators |
newtype Between (n :: Nat) (m :: Nat) t a Source #
Generate between the inclusive range of n :: Nat
and m :: Nat
Between | |
|
Instances
Monad t => Monad (Between n m t) Source # | |
Functor t => Functor (Between n m t) Source # | |
Applicative t => Applicative (Between n m t) Source # | |
Defined in Test.QuickCheck.Combinators pure :: a -> Between n m t a # (<*>) :: Between n m t (a -> b) -> Between n m t a -> Between n m t b # liftA2 :: (a -> b -> c) -> Between n m t a -> Between n m t b -> Between n m t c # (*>) :: Between n m t a -> Between n m t b -> Between n m t b # (<*) :: Between n m t a -> Between n m t b -> Between n m t a # | |
Foldable t => Foldable (Between n m t) Source # | |
Defined in Test.QuickCheck.Combinators fold :: Monoid m0 => Between n m t m0 -> m0 # foldMap :: Monoid m0 => (a -> m0) -> Between n m t a -> m0 # foldr :: (a -> b -> b) -> b -> Between n m t a -> b # foldr' :: (a -> b -> b) -> b -> Between n m t a -> b # foldl :: (b -> a -> b) -> b -> Between n m t a -> b # foldl' :: (b -> a -> b) -> b -> Between n m t a -> b # foldr1 :: (a -> a -> a) -> Between n m t a -> a # foldl1 :: (a -> a -> a) -> Between n m t a -> a # toList :: Between n m t a -> [a] # null :: Between n m t a -> Bool # length :: Between n m t a -> Int # elem :: Eq a => a -> Between n m t a -> Bool # maximum :: Ord a => Between n m t a -> a # minimum :: Ord a => Between n m t a -> a # | |
Traversable t => Traversable (Between n m t) Source # | |
Defined in Test.QuickCheck.Combinators traverse :: Applicative f => (a -> f b) -> Between n m t a -> f (Between n m t b) # sequenceA :: Applicative f => Between n m t (f a) -> f (Between n m t a) # mapM :: Monad m0 => (a -> m0 b) -> Between n m t a -> m0 (Between n m t b) # sequence :: Monad m0 => Between n m t (m0 a) -> m0 (Between n m t a) # | |
Enum (t a) => Enum (Between n m t a) Source # | |
Defined in Test.QuickCheck.Combinators succ :: Between n m t a -> Between n m t a # pred :: Between n m t a -> Between n m t a # toEnum :: Int -> Between n m t a # fromEnum :: Between n m t a -> Int # enumFrom :: Between n m t a -> [Between n m t a] # enumFromThen :: Between n m t a -> Between n m t a -> [Between n m t a] # enumFromTo :: Between n m t a -> Between n m t a -> [Between n m t a] # enumFromThenTo :: Between n m t a -> Between n m t a -> Between n m t a -> [Between n m t a] # | |
Eq (t a) => Eq (Between n m t a) Source # | |
(KnownNat n, KnownNat m, Typeable t, Typeable a, Data (t a)) => Data (Between n m t a) Source # | |
Defined in Test.QuickCheck.Combinators gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Between n m t a -> c (Between n m t a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Between n m t a) # toConstr :: Between n m t a -> Constr # dataTypeOf :: Between n m t a -> DataType # dataCast1 :: Typeable t0 => (forall d. Data d => c (t0 d)) -> Maybe (c (Between n m t a)) # dataCast2 :: Typeable t0 => (forall d e. (Data d, Data e) => c (t0 d e)) -> Maybe (c (Between n m t a)) # gmapT :: (forall b. Data b => b -> b) -> Between n m t a -> Between n m t a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Between n m t a -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Between n m t a -> r # gmapQ :: (forall d. Data d => d -> u) -> Between n m t a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Between n m t a -> u # gmapM :: Monad m0 => (forall d. Data d => d -> m0 d) -> Between n m t a -> m0 (Between n m t a) # gmapMp :: MonadPlus m0 => (forall d. Data d => d -> m0 d) -> Between n m t a -> m0 (Between n m t a) # gmapMo :: MonadPlus m0 => (forall d. Data d => d -> m0 d) -> Between n m t a -> m0 (Between n m t a) # | |
Ord (t a) => Ord (Between n m t a) Source # | |
Defined in Test.QuickCheck.Combinators compare :: Between n m t a -> Between n m t a -> Ordering # (<) :: Between n m t a -> Between n m t a -> Bool # (<=) :: Between n m t a -> Between n m t a -> Bool # (>) :: Between n m t a -> Between n m t a -> Bool # (>=) :: Between n m t a -> Between n m t a -> Bool # max :: Between n m t a -> Between n m t a -> Between n m t a # min :: Between n m t a -> Between n m t a -> Between n m t a # | |
Read (t a) => Read (Between n m t a) Source # | |
Show (t a) => Show (Between n m t a) Source # | |
Generic (Between n m t a) Source # | |
Semigroup (t a) => Semigroup (Between n m t a) Source # | |
Monoid (t a) => Monoid (Between n m t a) Source # | |
(Arbitrary a, Ord a, KnownNat n, UnfoldableR p [], p a, KnownNat m) => Arbitrary (Between n m OrderedList a) Source # | |
Defined in Test.QuickCheck.Combinators arbitrary :: Gen (Between n m OrderedList a) # shrink :: Between n m OrderedList a -> [Between n m OrderedList a] # | |
(UnfoldableR p t, Monoid (t a), Arbitrary a, KnownNat n, KnownNat m, p a) => Arbitrary (Between n m t a) Source # | |
type Rep (Between n m t a) Source # | |
Defined in Test.QuickCheck.Combinators |