constrained-generators-0.2.0.0: Framework for generating constrained random data using a subset of first order logic
Safe HaskellSafe-Inferred
LanguageHaskell2010

Constrained.Examples.Set

Documentation

setPairSpecSpecification (Set Int, Set Int) Source #

setOfPairLetSpecSpecification (Set (Int, Int)) Source #

setSingletonSpecSpecification (Set (Int, Int)) Source #

eitherSimpleSetSpecSpecification (Set (Either Int Int)) Source #

maybeJustSetSpecSpecification (Set (Maybe Int)) Source #

notSubsetSpecSpecification (Set Int, Set Int) Source #

emptyEitherMemberSpecSpecification (Set (Either Int Int)) Source #

emptyEitherSpecSpecification (Set (Either Int Int)) Source #

maybeSpecSpecification (Set (Maybe Int)) Source #

eitherSetSpecSpecification (Set (Either Int Int), Set (Either Int Int), Set (Either Int Int)) Source #

weirdSetPairSpecSpecification ([Int], Set (Either Int Int)) Source #

setPairSpecification (Set (Int, Int)) Source #

newtype NotASet a Source #

Constructors

NotASet (Set a) 

Instances

Instances details
Generic (NotASet a) Source # 
Instance details

Defined in Constrained.Examples.Set

Associated Types

type Rep (NotASet a) ∷ Type → Type

Methods

fromNotASet a → Rep (NotASet a) x

to ∷ Rep (NotASet a) x → NotASet a

Show a ⇒ Show (NotASet a) Source # 
Instance details

Defined in Constrained.Examples.Set

Methods

showsPrec ∷ Int → NotASet a → ShowS

showNotASet a → String

showList ∷ [NotASet a] → ShowS

(Ord a, HasSpec a) ⇒ HasSpec (NotASet a) Source # 
Instance details

Defined in Constrained.Examples.Set

Associated Types

type TypeSpec (NotASet a) Source #

type Prerequisites (NotASet a) Source #

(Typeable a, Ord a) ⇒ HasSimpleRep (NotASet a) Source # 
Instance details

Defined in Constrained.Examples.Set

Associated Types

type SimpleRep (NotASet a) Source #

type TheSop (NotASet a) ∷ [Type] Source #

Eq a ⇒ Eq (NotASet a) Source # 
Instance details

Defined in Constrained.Examples.Set

Methods

(==)NotASet a → NotASet a → Bool

(/=)NotASet a → NotASet a → Bool

(Typeable a, Ord a) ⇒ Forallable (NotASet a) a Source # 
Instance details

Defined in Constrained.Examples.Set

type Rep (NotASet a) Source # 
Instance details

Defined in Constrained.Examples.Set

type Rep (NotASet a) = D1 ('MetaData "NotASet" "Constrained.Examples.Set" "constrained-generators-0.2.0.0-inplace" 'True) (C1 ('MetaCons "NotASet" 'PrefixI 'False) (S1 ('MetaSel ('Nothing ∷ Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Set a))))
type Prerequisites (NotASet a) Source # 
Instance details

Defined in Constrained.Examples.Set

type Prerequisites (NotASet a) = ()
type TypeSpec (NotASet a) Source # 
Instance details

Defined in Constrained.Examples.Set

type SimpleRep (NotASet a) Source # 
Instance details

Defined in Constrained.Examples.Set

type SimpleRep (NotASet a) = [a]
type TheSop (NotASet a) Source # 
Instance details

Defined in Constrained.Examples.Set

type TheSop (NotASet a) = SOPOf (Rep (NotASet a))

emptyListSpecSpecification ([Int], NotASet (Either Int Int, Int)) Source #

complexUnionSpecification (Set Int, Set Int) Source #