Coder Social home page Coder Social logo

purescript-test-pontificate's Introduction

Module Documentation

Module Test.Pontificate.Applicative

Pure

type Pure f a = a -> f a

Category

type Category f a b c = f b c -> f a b -> a -> c

checkApplicative'

checkApplicative' :: forall f a b c. (Arbitrary (f a), Arbitrary (f (a -> b)), Arbitrary (f (b -> c)), Arbitrary a, CoArbitrary a, Arbitrary b, Arbitrary c, CoArbitrary c, Arbitrary (f c), Show a, Show (f a), Show (f b), Show (f c)) => CustomEq (f a) -> CustomEq (f b) -> CustomEq (f c) -> Fmap f c c -> Fmap f (b -> c) ((a -> b) -> a -> c) -> Ap f a c -> Ap f (a -> b) (a -> c) -> Ap f a b -> Ap f b c -> Ap f a a -> Ap f (b -> c) ((a -> b) -> a -> c) -> Ap f a b -> Ap f (a -> b) b -> Pure f (a -> a) -> Pure f (Category Prim.Function a b c) -> Pure f b -> Pure f a -> Pure f (a -> b) -> Pure f ((a -> b) -> b) -> QC Unit

checkApplicative

checkApplicative :: forall f a b c. (Arbitrary (f a), Arbitrary (f (a -> b)), Arbitrary (f (b -> c)), Arbitrary a, CoArbitrary a, Arbitrary b, Arbitrary c, CoArbitrary c, Arbitrary (f c), Show a, Show (f a), Show (f b), Show (f c), Eq (f a), Eq (f b), Eq (f c)) => Fmap f c c -> Fmap f (b -> c) ((a -> b) -> a -> c) -> Ap f a c -> Ap f (a -> b) (a -> c) -> Ap f a b -> Ap f b c -> Ap f a a -> Ap f (b -> c) ((a -> b) -> a -> c) -> Ap f a b -> Ap f (a -> b) b -> Pure f (a -> a) -> Pure f (Category Prim.Function a b c) -> Pure f b -> Pure f a -> Pure f (a -> b) -> Pure f ((a -> b) -> b) -> QC Unit

checkApplicativeInstance'

checkApplicativeInstance' :: forall f a b c fn ap. (Applicative f, Arbitrary (f a), Arbitrary (f (a -> b)), Arbitrary (f (b -> c)), Arbitrary a, CoArbitrary a, Arbitrary b, Arbitrary c, CoArbitrary c, Arbitrary (f c), Show a, Show (f a), Show (f b), Show (f c)) => CustomEq (f a) -> CustomEq (f b) -> CustomEq (f c) -> QC Unit

checkApplicativeInstance

checkApplicativeInstance :: forall f a b c. (Applicative f, Arbitrary (f a), Arbitrary (f (a -> b)), Arbitrary (f (b -> c)), Arbitrary a, CoArbitrary a, Arbitrary b, Arbitrary c, CoArbitrary c, Arbitrary (f c), Show a, Show (f a), Show (f b), Show (f c), Eq (f a), Eq (f b), Eq (f c)) => f a -> f b -> f c -> QC Unit

Module Test.Pontificate.Apply

Ap

type Ap f a b = f (a -> b) -> f a -> f b

checkApply'

checkApply' :: forall f a b c. (Arbitrary (f a), Arbitrary (f (a -> b)), Arbitrary (f (b -> c)), Arbitrary c, CoArbitrary c, Arbitrary (f c), Show (f a), Show (f b), Show (f c)) => CustomEq (f c) -> Fmap f c c -> Fmap f (b -> c) ((a -> b) -> a -> c) -> Ap f a c -> Ap f (a -> b) (a -> c) -> Ap f a b -> Ap f b c -> QC Unit

checkApply

checkApply :: forall f a b c. (Arbitrary (f a), Arbitrary (f (a -> b)), Arbitrary (f (b -> c)), Arbitrary c, CoArbitrary c, Arbitrary (f c), Show (f a), Show (f b), Show (f c), Eq (f c)) => Fmap f c c -> Fmap f (b -> c) ((a -> b) -> a -> c) -> Ap f a c -> Ap f (a -> b) (a -> c) -> Ap f a b -> Ap f b c -> QC Unit

checkApplyInstance'

checkApplyInstance' :: forall f a b c. (Apply f, Arbitrary (f a), Arbitrary (f (a -> b)), Arbitrary (f (b -> c)), Arbitrary c, CoArbitrary c, Arbitrary (f c), Show (f a), Show (f b), Show (f c)) => CustomEq (f c) -> f a -> f b -> QC Unit

checkApplyInstance

checkApplyInstance :: forall f a b c. (Apply f, Arbitrary (f a), Arbitrary (f (a -> b)), Arbitrary (f (b -> c)), Arbitrary c, CoArbitrary c, Arbitrary (f c), Show (f a), Show (f b), Show (f c), Eq (f c)) => f c -> f a -> f b -> QC Unit

Module Test.Pontificate.Bifunctor

checkBifunctor

checkBifunctor :: forall f a b. (Bifunctor f, Arbitrary a, CoArbitrary a, Arbitrary b, CoArbitrary b, Arbitrary (f a b), Show a, Eq (f a b)) => f a b -> QC Unit

Module Test.Pontificate.Binary

CustomEq

type CustomEq a = a -> a -> Boolean

Binary

type Binary a = a -> a -> a

commutative'

commutative' :: forall a. (Show a) => CustomEq a -> Binary a -> a -> a -> Result

commutative

commutative :: forall a. (Eq a, Show a) => Binary a -> a -> a -> Result

associative'

associative' :: forall a. (Show a) => CustomEq a -> Binary a -> a -> a -> a -> Result

associative

associative :: forall a. (Show a, Eq a) => Binary a -> a -> a -> a -> Result

distributive'

distributive' :: forall a. (Show a) => CustomEq a -> Binary a -> Binary a -> a -> a -> a -> Result

distributive

distributive :: forall a. (Show a, Eq a) => Binary a -> Binary a -> a -> a -> a -> Result

Module Test.Pontificate.Bind

Bind

type Bind m a b = m a -> (a -> m b) -> m b

checkBind'

checkBind' :: forall m a b c. (Arbitrary (m a), Arbitrary (m b), Arbitrary (m c), Arbitrary a, CoArbitrary a, CoArbitrary b, Show (m a), Show (m c)) => CustomEq (m c) -> Bind m a b -> Bind m b c -> Bind m a c -> QC Unit

checkBind

checkBind :: forall m a b c. (Arbitrary (m a), Arbitrary (m b), Arbitrary (m c), Arbitrary a, CoArbitrary a, CoArbitrary b, Eq (m c), Show (m a), Show (m c)) => Bind m a b -> Bind m b c -> Bind m a c -> QC Unit

checkBindInstance'

checkBindInstance' :: forall m a b c. (Bind m, Arbitrary (m a), Arbitrary (m b), Arbitrary (m c), Arbitrary a, CoArbitrary a, CoArbitrary b, Show (m a), Show (m c)) => CustomEq (m c) -> m a -> m b -> QC Unit

checkBindInstance

checkBindInstance :: forall m a b c. (Bind m, Arbitrary (m a), Arbitrary (m b), Arbitrary (m c), Arbitrary a, CoArbitrary a, CoArbitrary b, Eq (m c), Show (m a), Show (m c)) => m a -> m b -> m c -> QC Unit

Module Test.Pontificate.Functor

Fmap

type Fmap f a b = (a -> b) -> f a -> f b

checkFunctor'

checkFunctor' :: forall f a. (Arbitrary a, CoArbitrary a, Arbitrary (f a), Show (f a)) => CustomEq (f a) -> Fmap f a a -> QC Unit

checkFunctor

checkFunctor :: forall f a. (Arbitrary a, CoArbitrary a, Arbitrary (f a), Eq (f a), Show (f a)) => Fmap f a a -> QC Unit

checkFunctorInstance'

checkFunctorInstance' :: forall f a. (Functor f, Arbitrary a, CoArbitrary a, Arbitrary (f a), Show (f a)) => CustomEq (f a) -> QC Unit

checkFunctorInstance

checkFunctorInstance :: forall f a. (Functor f, Eq (f a), Arbitrary a, CoArbitrary a, Arbitrary (f a), Show (f a)) => f a -> QC Unit

Module Test.Pontificate.Fuzzy

(/=~=)

(/=~=) :: forall a. (FuzzyEq a) => a -> a -> Boolean

FuzzyEq

class FuzzyEq a where
  (=~=) :: a -> a -> Boolean

fuzzyNumbers

instance fuzzyNumbers :: FuzzyEq Number

Module Test.Pontificate.Monad

checkMonad'

checkMonad' :: forall m a b c. (Arbitrary (m a), Arbitrary (m b), Arbitrary (m c), Arbitrary a, CoArbitrary a, Arbitrary b, CoArbitrary b, Arbitrary c, CoArbitrary c, Arbitrary (m (a -> b)), Arbitrary (m (b -> c)), Show a, Show c, Show (m a), Show (m b), Show (m c)) => CustomEq (m a) -> CustomEq (m b) -> CustomEq (m c) -> Fmap m c c -> Fmap m (b -> c) ((a -> b) -> a -> c) -> Ap m a c -> Ap m (a -> b) (a -> c) -> Ap m a b -> Ap m b c -> Ap m a a -> Ap m (b -> c) ((a -> b) -> a -> c) -> Ap m a b -> Ap m (a -> b) b -> Pure m (a -> a) -> Pure m (Category Prim.Function a b c) -> Pure m a -> Pure m b -> Pure m c -> Pure m (a -> b) -> Pure m ((a -> b) -> b) -> Bind m a a -> Bind m a b -> Bind m a c -> Bind m b c -> Bind m c c -> QC Unit

checkMonad

checkMonad :: forall m a b c. (Arbitrary (m a), Arbitrary (m b), Arbitrary (m c), Arbitrary a, CoArbitrary a, Arbitrary b, CoArbitrary b, Arbitrary c, CoArbitrary c, Arbitrary (m (a -> b)), Arbitrary (m (b -> c)), Show a, Show c, Show (m a), Show (m b), Show (m c), Eq (m a), Eq (m b), Eq (m c)) => Fmap m c c -> Fmap m (b -> c) ((a -> b) -> a -> c) -> Ap m a c -> Ap m (a -> b) (a -> c) -> Ap m a b -> Ap m b c -> Ap m a a -> Ap m (b -> c) ((a -> b) -> a -> c) -> Ap m a b -> Ap m (a -> b) b -> Pure m (a -> a) -> Pure m (Category Prim.Function a b c) -> Pure m a -> Pure m b -> Pure m c -> Pure m (a -> b) -> Pure m ((a -> b) -> b) -> Bind m a a -> Bind m a b -> Bind m a c -> Bind m b c -> Bind m c c -> QC Unit

checkMonadInstance'

checkMonadInstance' :: forall m a b c. (Monad m, Arbitrary (m a), Arbitrary (m b), Arbitrary (m c), Arbitrary a, CoArbitrary a, Arbitrary b, CoArbitrary b, Arbitrary c, CoArbitrary c, Arbitrary (m (a -> b)), Arbitrary (m (b -> c)), Show a, Show c, Show (m a), Show (m b), Show (m c)) => CustomEq (m a) -> CustomEq (m b) -> CustomEq (m c) -> QC Unit

checkMonadInstance

checkMonadInstance :: forall m a b c. (Monad m, Arbitrary (m a), Arbitrary (m b), Arbitrary (m c), Arbitrary a, CoArbitrary a, Arbitrary b, CoArbitrary b, Arbitrary c, CoArbitrary c, Arbitrary (m (a -> b)), Arbitrary (m (b -> c)), Show a, Show c, Show (m a), Show (m b), Show (m c), Eq (m a), Eq (m b), Eq (m c)) => m a -> m b -> m c -> QC Unit

Module Test.Pontificate.Monoid

Id

type Id a = a

checkMonoid'

checkMonoid' :: forall a. (Show a, Arbitrary a, CoArbitrary a) => CustomEq a -> Binary a -> Id a -> QC Unit

checkMonoid

checkMonoid :: forall a. (Eq a, Show a, Arbitrary a, CoArbitrary a) => Binary a -> Id a -> QC Unit

checkMonoidInstance'

checkMonoidInstance' :: forall a. (Monoid a, Show a, Arbitrary a, CoArbitrary a) => CustomEq a -> QC Unit

checkMonoidInstance

checkMonoidInstance :: forall a. (Monoid a, Eq a, Show a, Arbitrary a, CoArbitrary a) => a -> QC Unit

checkCommutativeMonoid'

checkCommutativeMonoid' :: forall a. (Show a, Arbitrary a, CoArbitrary a) => CustomEq a -> Binary a -> Id a -> QC Unit

checkCommutativeMonoid

checkCommutativeMonoid :: forall a. (Eq a, Show a, Arbitrary a, CoArbitrary a) => Binary a -> Id a -> QC Unit

Module Test.Pontificate.Semigroup

checkSemigroup'

checkSemigroup' :: forall a. (Show a, Arbitrary a, CoArbitrary a) => CustomEq a -> Binary a -> QC Unit

checkSemigroup

checkSemigroup :: forall a. (Eq a, Show a, Arbitrary a, CoArbitrary a) => Binary a -> QC Unit

checkSemigroupInstance'

checkSemigroupInstance' :: forall a. (Semigroup a, Show a, Arbitrary a, CoArbitrary a) => CustomEq a -> QC Unit

checkSemigroupInstance

checkSemigroupInstance :: forall a. (Semigroup a, Show a, Arbitrary a, CoArbitrary a, Eq a) => a -> QC Unit

Module Test.Pontificate.Semiring

checkSemiring'

checkSemiring' :: forall a. (Show a, Arbitrary a, CoArbitrary a) => CustomEq a -> Binary a -> a -> Binary a -> a -> QC Unit

checkSemiring

checkSemiring :: forall a. (Arbitrary a, CoArbitrary a, Show a, Eq a) => Binary a -> Id a -> Binary a -> Id a -> QC Unit

checkSemiringInstance'

checkSemiringInstance' :: forall a. (Semiring a, Arbitrary a, CoArbitrary a, Show a) => CustomEq a -> QC Unit

checkSemiringInstance

checkSemiringInstance :: forall a. (Semiring a, Arbitrary a, CoArbitrary a, Show a, Eq a) => a -> QC Unit

purescript-test-pontificate's People

Watchers

Isaac Shapira avatar James Cloos avatar  avatar

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    ๐Ÿ–– Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. ๐Ÿ“Š๐Ÿ“ˆ๐ŸŽ‰

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google โค๏ธ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.