pandora-0.4.3: Pandora/Paradigm/Primary/Functor/Validation.hs
module Pandora.Paradigm.Primary.Functor.Validation where
import Pandora.Pattern.Category ((.), ($), (#))
import Pandora.Pattern.Functor.Covariant (Covariant ((<$>)), Covariant_ ((-<$>-)))
import Pandora.Pattern.Functor.Pointable (Pointable (point), Pointable_ (point_))
import Pandora.Pattern.Functor.Applicative (Applicative ((<*>)), Applicative_ (multiply))
import Pandora.Pattern.Functor.Alternative (Alternative ((<+>)))
import Pandora.Pattern.Functor.Traversable (Traversable ((->>)))
import Pandora.Pattern.Functor.Bivariant (Bivariant ((<->)), Bivariant_ ((-<->-)))
import Pandora.Pattern.Object.Setoid (Setoid ((==)))
import Pandora.Pattern.Object.Chain (Chain ((<=>)))
import Pandora.Pattern.Object.Semigroup (Semigroup ((+)))
import Pandora.Paradigm.Primary.Functor.Function ()
import Pandora.Paradigm.Primary.Functor.Product (Product ((:*:)), type (:*:))
import Pandora.Paradigm.Primary.Transformer.Flip (Flip (Flip))
import Pandora.Paradigm.Primary.Object.Boolean (Boolean (False))
import Pandora.Paradigm.Primary.Object.Ordering (Ordering (Less, Greater))
data Validation e a = Flaws e | Validated a
instance Covariant (Validation e) where
_ <$> Flaws e = Flaws e
f <$> Validated x = Validated $ f x
instance Covariant_ (Validation e) (->) (->) where
_ -<$>- Flaws e = Flaws e
f -<$>- Validated x = Validated $ f x
_ -<$>- Flaws e = Flaws e
f -<$>- Validated x = Validated $ f x
_ -<$>- Flaws e = Flaws e
f -<$>- Validated x = Validated $ f x
instance Covariant_ (Flip Validation a) (->) (->) where
f -<$>- Flip (Flaws e) = Flip . Flaws $ f e
_ -<$>- Flip (Validated x) = Flip $ Validated x
f -<$>- Flip (Flaws e) = Flip . Flaws $ f e
_ -<$>- Flip (Validated x) = Flip $ Validated x
f -<$>- Flip (Flaws e) = Flip . Flaws $ f e
_ -<$>- Flip (Validated x) = Flip $ Validated x
instance Pointable (Validation e) (->) where
point = Validated
instance Pointable_ (Validation e) (->) where
point_ = Validated
instance Semigroup e => Applicative (Validation e) where
Flaws e <*> Flaws e' = Flaws $ e + e'
Flaws e <*> Validated _ = Flaws e
Validated _ <*> Flaws e' = Flaws e'
Validated f <*> Validated x = Validated $ f x
instance Semigroup e => Applicative_ (Validation e) (:*:) (->) (->) where
multiply f (Validated x :*: Validated y) = Validated . f $ x :*: y
multiply _ (Flaws x :*: Flaws y) = Flaws $ x + y
multiply _ (Validated _ :*: Flaws y) = Flaws y
multiply _ (Flaws x :*: Validated _) = Flaws x
instance Alternative (Validation e) where
Flaws _ <+> x = x
Validated x <+> _ = Validated x
instance Traversable (Validation e) where
Validated x ->> f = Validated <$> f x
Flaws e ->> _ = point $ Flaws e
instance Bivariant Validation where
f <-> g = validation # Flaws . f # Validated . g
instance Bivariant_ Validation (->) (->) (->) where
f -<->- g = validation # Flaws . f # Validated . g
instance (Setoid e, Setoid a) => Setoid (Validation e a) where
Validated x == Validated y = x == y
Flaws x == Flaws y = x == y
_ == _ = False
instance (Chain e, Chain a) => Chain (Validation e a) where
Validated x <=> Validated y = x <=> y
Flaws x <=> Flaws y = x <=> y
Flaws _ <=> Validated _ = Less
Validated _ <=> Flaws _ = Greater
instance (Semigroup e, Semigroup a) => Semigroup (Validation e a) where
Validated x + Validated y = Validated $ x + y
Flaws x + Flaws y = Flaws $ x + y
Flaws _ + Validated y = Validated y
Validated x + Flaws _ = Validated x
validation :: (e -> r) -> (a -> r) -> Validation e a -> r
validation f _ (Flaws x) = f x
validation _ s (Validated x) = s x