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

setPairSpec ∷ Specification (Set Int, Set Int) Source #

fixedSetSpec ∷ Specification (Set Int) Source #

setOfPairLetSpec ∷ Specification (Set (Int, Int)) Source #

setSingletonSpec ∷ Specification (Set (Int, Int)) Source #

eitherSimpleSetSpec ∷ Specification (Set (Either Int Int)) Source #

forAllAnySpec ∷ Specification (Set Int) Source #

maybeJustSetSpec ∷ Specification (Set (Maybe Int)) Source #

notSubsetSpec ∷ Specification (Set Int, Set Int) Source #

emptyEitherMemberSpec ∷ Specification (Set (Either Int Int)) Source #

emptyEitherSpec ∷ Specification (Set (Either Int Int)) Source #

notSubset ∷ Specification (Set Int) Source #

unionSized ∷ Specification (Set Int) Source #

maybeSpec ∷ Specification (Set (Maybe Int)) Source #

eitherSetSpec ∷ Specification (Set (Either Int Int), Set (Either Int Int), Set (Either Int Int)) Source #

weirdSetPairSpec ∷ Specification ([Int], Set (Either Int Int)) Source #

setPair ∷ Specification (Set (Int, Int)) Source #

setSpec ∷ Specification (Set Int) Source #

compositionalSpec ∷ Specification (Set Int) Source #

emptySetSpec ∷ Specification (Set Int) Source #

setSubSize ∷ Specification (Set 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

from ∷ NotASet 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 #

show ∷ NotASet 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 #

Methods

emptySpec ∷ TypeSpec (NotASet a) Source #

combineSpec ∷ TypeSpec (NotASet a) → TypeSpec (NotASet a) → Specification (NotASet a) Source #

genFromTypeSpec ∷ ∀ (m ∷ Type → Type). (HasCallStack, MonadGenError m) ⇒ TypeSpec (NotASet a) → GenT m (NotASet a) Source #

conformsTo ∷ NotASet a → TypeSpec (NotASet a) → Bool Source #

shrinkWithTypeSpec ∷ TypeSpec (NotASet a) → NotASet a → [NotASet a] Source #

toPreds ∷ Term (NotASet a) → TypeSpec (NotASet a) → Pred Source #

cardinalTypeSpec ∷ TypeSpec (NotASet a) → Specification Integer Source #

cardinalTrueSpec ∷ Specification Integer Source #

typeSpecHasError ∷ TypeSpec (NotASet a) → Maybe (NonEmpty String) Source #

alternateShow ∷ TypeSpec (NotASet a) → BinaryShow Source #

monadConformsTo ∷ NotASet a → TypeSpec (NotASet a) → Writer [String] Bool Source #

typeSpecOpt ∷ TypeSpec (NotASet a) → [NotASet a] → Specification (NotASet a) Source #

guardTypeSpec ∷ [String] → TypeSpec (NotASet a) → Specification (NotASet a) Source #

prerequisites ∷ Evidence (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 #

Methods

toSimpleRep ∷ NotASet a → SimpleRep (NotASet a) Source #

fromSimpleRep ∷ SimpleRep (NotASet a) → NotASet a 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

Methods

fromForAllSpec ∷ Specification a → Specification (NotASet a) Source #

forAllToList ∷ NotASet a → [a] Source #

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 TypeSpec (NotASet a) = TypeSpec (SimpleRep (NotASet a))
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))

emptyListSpec ∷ Specification ([Int], NotASet (Either Int Int, Int)) Source #

foldSingleCase ∷ Specification Int Source #

complexUnion ∷ Specification (Set Int, Set Int) Source #

unionBounded ∷ Specification (Set Int) Source #

powersetPickOne ∷ Specification (Set Int) Source #