| Safe Haskell | None |
|---|---|
| Language | Haskell98 |
MagicHaskeller.Instantiate
- mkRandTrie :: [Int] -> TyConLib -> Generator -> RTrie
- type RTrie = (CmpMap, Maps, MemoMap, Tries, MapType (Dynamic, Dynamic))
- uncurryDyn :: Dynamic -> Type -> Dynamic -> Dynamic
- uncurryTy :: TyConLib -> Type -> Type
- mkUncurry :: TyConLib -> Dynamic
- typeToOrd :: CmpMap -> Type -> Maybe Dynamic
- typeToRandomsOrd :: TyConLib -> RTrie -> Type -> Order
- typeToRandomsOrdDM :: [Int] -> TyConLib -> RTrie -> Type -> Maybe ([[Dynamic]], PackedOrd)
- mkCurry :: TyConLib -> Dynamic
- curryDyn :: Dynamic -> Type -> Dynamic -> Dynamic
- argTypeToRandoms :: TyConLib -> CmpMap -> Maps -> Type -> Maybe [Dynamic]
- typeToArb :: ArbMap -> CoarbMap -> Type -> Maybe Dynamic
- type PackedOrd = Dynamic -> Dynamic -> Ordering
- typeToCompare :: TyConLib -> CmpMap -> Type -> Maybe (Dynamic -> Dynamic -> Ordering)
- compareRealFloat :: (NearEq a, RealFloat a) => a -> a -> Ordering
Documentation
mkRandTrie :: [Int] -> TyConLib -> Generator -> RTrie Source #
uncurryDyn :: Dynamic -> Type -> Dynamic -> Dynamic Source #
uncurryTy :: TyConLib -> Type -> Type Source #
uncurryTy converts a->b->c->d->e->r into ((((a,b),c),d),e)->r
Note that Arbitrary (a,b,c,d,e) is not defined in Test.QuickCheck.
typeToRandomsOrd :: TyConLib -> RTrie -> Type -> Order Source #
argTypeToRandoms :: TyConLib -> CmpMap -> Maps -> Type -> Maybe [Dynamic] Source #
typeToCompare :: TyConLib -> CmpMap -> Type -> Maybe (Dynamic -> Dynamic -> Ordering) Source #